mdreloc.c revision 1.26
1 /* $NetBSD: mdreloc.c,v 1.26 2002/09/25 16:35:08 mycroft Exp $ */ 2 3 /*- 4 * Copyright (c) 2000 Eduardo Horvath. 5 * Copyright (c) 1999, 2002 The NetBSD Foundation, Inc. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to The NetBSD Foundation 9 * by Paul Kranenburg. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 #include <errno.h> 41 #include <stdio.h> 42 #include <stdlib.h> 43 #include <string.h> 44 #include <unistd.h> 45 #include <sys/stat.h> 46 47 #include "rtldenv.h" 48 #include "debug.h" 49 #include "rtld.h" 50 51 /* 52 * The following table holds for each relocation type: 53 * - the width in bits of the memory location the relocation 54 * applies to (not currently used) 55 * - the number of bits the relocation value must be shifted to the 56 * right (i.e. discard least significant bits) to fit into 57 * the appropriate field in the instruction word. 58 * - flags indicating whether 59 * * the relocation involves a symbol 60 * * the relocation is relative to the current position 61 * * the relocation is for a GOT entry 62 * * the relocation is relative to the load address 63 * 64 */ 65 #define _RF_S 0x80000000 /* Resolve symbol */ 66 #define _RF_A 0x40000000 /* Use addend */ 67 #define _RF_P 0x20000000 /* Location relative */ 68 #define _RF_G 0x10000000 /* GOT offset */ 69 #define _RF_B 0x08000000 /* Load address relative */ 70 #define _RF_U 0x04000000 /* Unaligned */ 71 #define _RF_SZ(s) (((s) & 0xff) << 8) /* memory target size */ 72 #define _RF_RS(s) ( (s) & 0xff) /* right shift */ 73 static const int reloc_target_flags[] = { 74 0, /* NONE */ 75 _RF_S|_RF_A| _RF_SZ(8) | _RF_RS(0), /* RELOC_8 */ 76 _RF_S|_RF_A| _RF_SZ(16) | _RF_RS(0), /* RELOC_16 */ 77 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* RELOC_32 */ 78 _RF_S|_RF_A|_RF_P| _RF_SZ(8) | _RF_RS(0), /* DISP_8 */ 79 _RF_S|_RF_A|_RF_P| _RF_SZ(16) | _RF_RS(0), /* DISP_16 */ 80 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* DISP_32 */ 81 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP_30 */ 82 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP_22 */ 83 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(10), /* HI22 */ 84 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 22 */ 85 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 13 */ 86 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* LO10 */ 87 _RF_G| _RF_SZ(32) | _RF_RS(0), /* GOT10 */ 88 _RF_G| _RF_SZ(32) | _RF_RS(0), /* GOT13 */ 89 _RF_G| _RF_SZ(32) | _RF_RS(10), /* GOT22 */ 90 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* PC10 */ 91 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(10), /* PC22 */ 92 _RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WPLT30 */ 93 _RF_SZ(32) | _RF_RS(0), /* COPY */ 94 _RF_S|_RF_A| _RF_SZ(64) | _RF_RS(0), /* GLOB_DAT */ 95 _RF_SZ(32) | _RF_RS(0), /* JMP_SLOT */ 96 _RF_A| _RF_B| _RF_SZ(64) | _RF_RS(0), /* RELATIVE */ 97 _RF_S|_RF_A| _RF_U| _RF_SZ(32) | _RF_RS(0), /* UA_32 */ 98 99 _RF_A| _RF_SZ(32) | _RF_RS(0), /* PLT32 */ 100 _RF_A| _RF_SZ(32) | _RF_RS(10), /* HIPLT22 */ 101 _RF_A| _RF_SZ(32) | _RF_RS(0), /* LOPLT10 */ 102 _RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* PCPLT32 */ 103 _RF_A|_RF_P| _RF_SZ(32) | _RF_RS(10), /* PCPLT22 */ 104 _RF_A|_RF_P| _RF_SZ(32) | _RF_RS(0), /* PCPLT10 */ 105 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 10 */ 106 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 11 */ 107 _RF_S|_RF_A| _RF_SZ(64) | _RF_RS(0), /* 64 */ 108 _RF_S|_RF_A|/*extra*/ _RF_SZ(32) | _RF_RS(0), /* OLO10 */ 109 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(42), /* HH22 */ 110 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(32), /* HM10 */ 111 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(10), /* LM22 */ 112 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(42), /* PC_HH22 */ 113 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(32), /* PC_HM10 */ 114 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(10), /* PC_LM22 */ 115 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP16 */ 116 _RF_S|_RF_A|_RF_P| _RF_SZ(32) | _RF_RS(2), /* WDISP19 */ 117 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* GLOB_JMP */ 118 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 7 */ 119 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 5 */ 120 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* 6 */ 121 _RF_S|_RF_A|_RF_P| _RF_SZ(64) | _RF_RS(0), /* DISP64 */ 122 _RF_A| _RF_SZ(64) | _RF_RS(0), /* PLT64 */ 123 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(10), /* HIX22 */ 124 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* LOX10 */ 125 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(22), /* H44 */ 126 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(12), /* M44 */ 127 _RF_S|_RF_A| _RF_SZ(32) | _RF_RS(0), /* L44 */ 128 _RF_S|_RF_A| _RF_SZ(64) | _RF_RS(0), /* REGISTER */ 129 _RF_S|_RF_A| _RF_U| _RF_SZ(64) | _RF_RS(0), /* UA64 */ 130 _RF_S|_RF_A| _RF_U| _RF_SZ(16) | _RF_RS(0), /* UA16 */ 131 }; 132 133 #ifdef RTLD_DEBUG_RELOC 134 static const char *reloc_names[] = { 135 "NONE", "RELOC_8", "RELOC_16", "RELOC_32", "DISP_8", 136 "DISP_16", "DISP_32", "WDISP_30", "WDISP_22", "HI22", 137 "22", "13", "LO10", "GOT10", "GOT13", 138 "GOT22", "PC10", "PC22", "WPLT30", "COPY", 139 "GLOB_DAT", "JMP_SLOT", "RELATIVE", "UA_32", "PLT32", 140 "HIPLT22", "LOPLT10", "LOPLT10", "PCPLT22", "PCPLT32", 141 "10", "11", "64", "OLO10", "HH22", 142 "HM10", "LM22", "PC_HH22", "PC_HM10", "PC_LM22", 143 "WDISP16", "WDISP19", "GLOB_JMP", "7", "5", "6", 144 "DISP64", "PLT64", "HIX22", "LOX10", "H44", "M44", 145 "L44", "REGISTER", "UA64", "UA16" 146 }; 147 #endif 148 149 #define RELOC_RESOLVE_SYMBOL(t) ((reloc_target_flags[t] & _RF_S) != 0) 150 #define RELOC_PC_RELATIVE(t) ((reloc_target_flags[t] & _RF_P) != 0) 151 #define RELOC_BASE_RELATIVE(t) ((reloc_target_flags[t] & _RF_B) != 0) 152 #define RELOC_UNALIGNED(t) ((reloc_target_flags[t] & _RF_U) != 0) 153 #define RELOC_USE_ADDEND(t) ((reloc_target_flags[t] & _RF_A) != 0) 154 #define RELOC_TARGET_SIZE(t) ((reloc_target_flags[t] >> 8) & 0xff) 155 #define RELOC_VALUE_RIGHTSHIFT(t) (reloc_target_flags[t] & 0xff) 156 157 static const long reloc_target_bitmask[] = { 158 #define _BM(x) (~(-(1ULL << (x)))) 159 0, /* NONE */ 160 _BM(8), _BM(16), _BM(32), /* RELOC_8, _16, _32 */ 161 _BM(8), _BM(16), _BM(32), /* DISP8, DISP16, DISP32 */ 162 _BM(30), _BM(22), /* WDISP30, WDISP22 */ 163 _BM(22), _BM(22), /* HI22, _22 */ 164 _BM(13), _BM(10), /* RELOC_13, _LO10 */ 165 _BM(10), _BM(13), _BM(22), /* GOT10, GOT13, GOT22 */ 166 _BM(10), _BM(22), /* _PC10, _PC22 */ 167 _BM(30), 0, /* _WPLT30, _COPY */ 168 _BM(32), _BM(32), _BM(32), /* _GLOB_DAT, JMP_SLOT, _RELATIVE */ 169 _BM(32), _BM(32), /* _UA32, PLT32 */ 170 _BM(22), _BM(10), /* _HIPLT22, LOPLT10 */ 171 _BM(32), _BM(22), _BM(10), /* _PCPLT32, _PCPLT22, _PCPLT10 */ 172 _BM(10), _BM(11), -1, /* _10, _11, _64 */ 173 _BM(10), _BM(22), /* _OLO10, _HH22 */ 174 _BM(10), _BM(22), /* _HM10, _LM22 */ 175 _BM(22), _BM(10), _BM(22), /* _PC_HH22, _PC_HM10, _PC_LM22 */ 176 _BM(16), _BM(19), /* _WDISP16, _WDISP19 */ 177 -1, /* GLOB_JMP */ 178 _BM(7), _BM(5), _BM(6) /* _7, _5, _6 */ 179 -1, -1, /* DISP64, PLT64 */ 180 _BM(22), _BM(13), /* HIX22, LOX10 */ 181 _BM(22), _BM(10), _BM(13), /* H44, M44, L44 */ 182 -1, -1, _BM(16), /* REGISTER, UA64, UA16 */ 183 #undef _BM 184 }; 185 #define RELOC_VALUE_BITMASK(t) (reloc_target_bitmask[t]) 186 187 /* 188 * Instruction templates: 189 */ 190 #define BAA 0x10400000 /* ba,a %xcc, 0 */ 191 #define SETHI 0x03000000 /* sethi %hi(0), %g1 */ 192 #define JMP 0x81c06000 /* jmpl %g1+%lo(0), %g0 */ 193 #define NOP 0x01000000 /* sethi %hi(0), %g0 */ 194 #define OR 0x82806000 /* or %g1, 0, %g1 */ 195 #define XOR 0x82c06000 /* xor %g1, 0, %g1 */ 196 #define MOV71 0x8283a000 /* or %o7, 0, %g1 */ 197 #define MOV17 0x9c806000 /* or %g1, 0, %o7 */ 198 #define CALL 0x40000000 /* call 0 */ 199 #define SLLX 0x8b407000 /* sllx %g1, 0, %g1 */ 200 #define SETHIG5 0x0b000000 /* sethi %hi(0), %g5 */ 201 #define ORG5 0x82804005 /* or %g1, %g5, %g1 */ 202 203 204 /* %hi(v)/%lo(v) with variable shift */ 205 #define HIVAL(v, s) (((v) >> (s)) & 0x003fffff) 206 #define LOVAL(v, s) (((v) >> (s)) & 0x000003ff) 207 208 void _rtld_bind_start_0(long, long); 209 void _rtld_bind_start_1(long, long); 210 void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr); 211 caddr_t _rtld_bind __P((const Obj_Entry *, Elf_Word)); 212 213 /* 214 * Install rtld function call into this PLT slot. 215 */ 216 #define SAVE 0x9de3bf50 217 #define SETHI_l0 0x21000000 218 #define SETHI_l1 0x23000000 219 #define OR_l0_l0 0xa0142000 220 #define SLLX_l0_32_l0 0xa12c3020 221 #define OR_l0_l1_l0 0xa0140011 222 #define JMPL_l0_o0 0x91c42000 223 #define MOV_g1_o1 0x92100001 224 225 void _rtld_install_plt __P((Elf_Word *pltgot, Elf_Addr proc)); 226 227 void 228 _rtld_install_plt(pltgot, proc) 229 Elf_Word *pltgot; 230 Elf_Addr proc; 231 { 232 pltgot[0] = SAVE; 233 pltgot[1] = SETHI_l0 | HIVAL(proc, 42); 234 pltgot[2] = SETHI_l1 | HIVAL(proc, 10); 235 pltgot[3] = OR_l0_l0 | LOVAL(proc, 32); 236 pltgot[4] = SLLX_l0_32_l0; 237 pltgot[5] = OR_l0_l1_l0; 238 pltgot[6] = JMPL_l0_o0 | LOVAL(proc, 0); 239 pltgot[7] = MOV_g1_o1; 240 } 241 242 #if 0 243 long _rtld_bind_start_0_stub __P((long x, long y)); 244 long 245 _rtld_bind_start_0_stub(y, x) 246 long y, x; 247 { 248 long i; 249 long n; 250 251 i = x - y + 8 - 32768*32; 252 n = 32768 + (i/5120)*160 + (i%5120)/24; 253 254 return (n); 255 } 256 #endif 257 258 void 259 _rtld_setup_pltgot(const Obj_Entry *obj) 260 { 261 /* 262 * On sparc64 we got troubles. 263 * 264 * Instructions are 4 bytes long. 265 * Elf[64]_Addr is 8 bytes long, so are our pltglot[] 266 * array entries. 267 * Each PLT entry jumps to PLT0 to enter the dynamic 268 * linker. 269 * Loading an arbitrary 64-bit pointer takes 6 270 * instructions and 2 registers. 271 * 272 * Somehow we need to issue a save to get a new stack 273 * frame, load the address of the dynamic linker, and 274 * jump there, in 8 instructions or less. 275 * 276 * Oh, we need to fill out both PLT0 and PLT1. 277 */ 278 { 279 Elf_Word *entry = (Elf_Word *)obj->pltgot; 280 281 /* Install in entries 0 and 1 */ 282 _rtld_install_plt(&entry[0], (Elf_Addr) &_rtld_bind_start_0); 283 _rtld_install_plt(&entry[8], (Elf_Addr) &_rtld_bind_start_1); 284 285 /* 286 * Install the object reference in first slot 287 * of entry 2. 288 */ 289 obj->pltgot[8] = (Elf_Addr) obj; 290 } 291 } 292 293 void 294 _rtld_relocate_nonplt_self(dynp, relocbase) 295 Elf_Dyn *dynp; 296 Elf_Addr relocbase; 297 { 298 const Elf_Rela *rela = 0, *relalim; 299 Elf_Addr relasz = 0; 300 Elf_Addr *where; 301 302 for (; dynp->d_tag != DT_NULL; dynp++) { 303 switch (dynp->d_tag) { 304 case DT_RELA: 305 rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr); 306 break; 307 case DT_RELASZ: 308 relasz = dynp->d_un.d_val; 309 break; 310 } 311 } 312 relalim = (const Elf_Rela *)((caddr_t)rela + relasz); 313 for (; rela < relalim; rela++) { 314 where = (Elf_Addr *)(relocbase + rela->r_offset); 315 *where = (Elf_Addr)(relocbase + rela->r_addend); 316 } 317 } 318 319 int 320 _rtld_relocate_nonplt_objects(obj, self) 321 const Obj_Entry *obj; 322 bool self; 323 { 324 const Elf_Rela *rela; 325 326 if (self) 327 return (0); 328 329 for (rela = obj->rela; rela < obj->relalim; rela++) { 330 Elf_Addr *where; 331 Elf_Word type; 332 Elf_Addr value = 0, mask; 333 const Elf_Sym *def = NULL; 334 const Obj_Entry *defobj = NULL; 335 unsigned long symnum; 336 337 where = (Elf_Addr *) (obj->relocbase + rela->r_offset); 338 symnum = ELF_R_SYM(rela->r_info); 339 340 type = ELF_R_TYPE(rela->r_info); 341 if (type == R_TYPE(NONE)) 342 continue; 343 344 /* We do JMP_SLOTs in _rtld_bind() below */ 345 if (type == R_TYPE(JMP_SLOT)) 346 continue; 347 348 /* COPY relocs are also handled elsewhere */ 349 if (type == R_TYPE(COPY)) 350 continue; 351 352 /* 353 * We use the fact that relocation types are an `enum' 354 * Note: R_SPARC_UA16 is currently numerically largest. 355 */ 356 if (type > R_TYPE(UA16)) 357 return (-1); 358 359 value = rela->r_addend; 360 361 /* 362 * Handle relative relocs here, as an optimization. 363 */ 364 if (type == R_TYPE(RELATIVE)) { 365 *where = (Elf_Addr)(obj->relocbase + value); 366 rdbg(("RELATIVE in %s --> %p", obj->path, 367 (void *)*where)); 368 continue; 369 } 370 371 if (RELOC_RESOLVE_SYMBOL(type)) { 372 373 /* Find the symbol */ 374 def = _rtld_find_symdef(symnum, obj, &defobj, false); 375 if (def == NULL) 376 return (-1); 377 378 /* Add in the symbol's absolute address */ 379 value += (Elf_Addr)(defobj->relocbase + def->st_value); 380 } 381 382 if (RELOC_PC_RELATIVE(type)) { 383 value -= (Elf_Addr)where; 384 } 385 386 if (RELOC_BASE_RELATIVE(type)) { 387 /* 388 * Note that even though sparcs use `Elf_rela' 389 * exclusively we still need the implicit memory addend 390 * in relocations referring to GOT entries. 391 * Undoubtedly, someone f*cked this up in the distant 392 * past, and now we're stuck with it in the name of 393 * compatibility for all eternity.. 394 * 395 * In any case, the implicit and explicit should be 396 * mutually exclusive. We provide a check for that 397 * here. 398 */ 399 #ifdef DIAGNOSTIC 400 if (value != 0 && *where != 0) { 401 xprintf("BASE_REL(%s): where=%p, *where 0x%lx, " 402 "addend=0x%lx, base %p\n", 403 obj->path, where, *where, 404 rela->r_addend, obj->relocbase); 405 } 406 #endif 407 /* XXXX -- apparently we ignore the preexisting value */ 408 value += (Elf_Addr)(obj->relocbase); 409 } 410 411 mask = RELOC_VALUE_BITMASK(type); 412 value >>= RELOC_VALUE_RIGHTSHIFT(type); 413 value &= mask; 414 415 if (RELOC_UNALIGNED(type)) { 416 /* Handle unaligned relocations. */ 417 Elf_Addr tmp = 0; 418 char *ptr = (char *)where; 419 int i, size = RELOC_TARGET_SIZE(type)/8; 420 421 /* Read it in one byte at a time. */ 422 for (i=0; i<size; i++) 423 tmp = (tmp << 8) | ptr[i]; 424 425 tmp &= ~mask; 426 tmp |= value; 427 428 /* Write it back out. */ 429 for (i=0; i<size; i++) 430 ptr[i] = ((tmp >> (8*i)) & 0xff); 431 #ifdef RTLD_DEBUG_RELOC 432 value = (Elf_Addr)tmp; 433 #endif 434 435 } else if (RELOC_TARGET_SIZE(type) > 32) { 436 *where &= ~mask; 437 *where |= value; 438 #ifdef RTLD_DEBUG_RELOC 439 value = (Elf_Addr)*where; 440 #endif 441 } else { 442 Elf32_Addr *where32 = (Elf32_Addr *)where; 443 444 *where32 &= ~mask; 445 *where32 |= value; 446 #ifdef RTLD_DEBUG_RELOC 447 value = (Elf_Addr)*where32; 448 #endif 449 } 450 451 #ifdef RTLD_DEBUG_RELOC 452 if (RELOC_RESOLVE_SYMBOL(type)) { 453 rdbg(("%s %s in %s --> %p in %s", reloc_names[type], 454 obj->strtab + obj->symtab[symnum].st_name, 455 obj->path, (void *)*where, defobj->path)); 456 } else { 457 rdbg(("%s in %s --> %p", reloc_names[type], 458 obj->path, (void *)*where)); 459 } 460 #endif 461 } 462 return (0); 463 } 464 465 int 466 _rtld_relocate_plt_lazy(obj) 467 const Obj_Entry *obj; 468 { 469 return (0); 470 } 471 472 caddr_t 473 _rtld_bind(obj, reloff) 474 const Obj_Entry *obj; 475 Elf_Word reloff; 476 { 477 const Elf_Rela *rela = obj->pltrela + reloff; 478 const Elf_Sym *def; 479 const Obj_Entry *defobj; 480 Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset); 481 Elf_Addr value, offset; 482 483 if (ELF_R_TYPE(obj->pltrela->r_info) == R_TYPE(JMP_SLOT)) { 484 /* 485 * XXXX 486 * 487 * The first four PLT entries are reserved. There is some 488 * disagreement whether they should have associated relocation 489 * entries. Both the SPARC 32-bit and 64-bit ELF 490 * specifications say that they should have relocation entries, 491 * but the 32-bit SPARC binutils do not generate them, and now 492 * the 64-bit SPARC binutils have stopped generating them too. 493 * 494 * So, to provide binary compatibility, we will check the first 495 * entry, if it is reserved it should not be of the type 496 * JMP_SLOT. If it is JMP_SLOT, then the 4 reserved entries 497 * were not generated and our index is 4 entries too far. 498 */ 499 rela -= 4; 500 } 501 502 /* Fully resolve procedure addresses now */ 503 504 assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT)); 505 506 def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true); 507 if (def == NULL) 508 _rtld_die(); 509 510 value = (Elf_Addr)(defobj->relocbase + def->st_value); 511 rdbg(("bind now/fixup in %s --> old=%p new=%p", 512 defobj->strtab + def->st_name, (void *)*where, (void *)value)); 513 514 /* 515 * At the PLT entry pointed at by `where', we now construct 516 * a direct transfer to the now fully resolved function 517 * address. 518 * 519 * A PLT entry is supposed to start by looking like this: 520 * 521 * sethi %hi(. - .PLT0), %g1 522 * ba,a %xcc, .PLT1 523 * nop 524 * nop 525 * nop 526 * nop 527 * nop 528 * nop 529 * 530 * When we replace these entries we start from the second 531 * entry and do it in reverse order so the last thing we 532 * do is replace the branch. That allows us to change this 533 * atomically. 534 * 535 * We now need to find out how far we need to jump. We 536 * have a choice of several different relocation techniques 537 * which are increasingly expensive. 538 */ 539 540 offset = ((Elf_Addr)where) - value; 541 if (rela->r_addend) { 542 Elf_Addr *ptr = (Elf_Addr *)where; 543 /* 544 * This entry is >32768. Just replace the pointer. 545 */ 546 ptr[0] = value; 547 548 } else if (offset <= (1L<<20) && offset >= -(1L<<20)) { 549 /* 550 * We're within 1MB -- we can use a direct branch insn. 551 * 552 * We can generate this pattern: 553 * 554 * sethi %hi(. - .PLT0), %g1 555 * ba,a %xcc, addr 556 * nop 557 * nop 558 * nop 559 * nop 560 * nop 561 * nop 562 * 563 */ 564 where[1] = BAA | ((offset >> 2) &0x3fffff); 565 __asm __volatile("iflush %0+4" : : "r" (where)); 566 } else if (value >= 0 && value < (1L<<32)) { 567 /* 568 * We're within 32-bits of address zero. 569 * 570 * The resulting code in the jump slot is: 571 * 572 * sethi %hi(. - .PLT0), %g1 573 * sethi %hi(addr), %g1 574 * jmp %g1+%lo(addr) 575 * nop 576 * nop 577 * nop 578 * nop 579 * nop 580 * 581 */ 582 where[2] = JMP | LOVAL(value, 0); 583 where[1] = SETHI | HIVAL(value, 10); 584 __asm __volatile("iflush %0+8" : : "r" (where)); 585 __asm __volatile("iflush %0+4" : : "r" (where)); 586 587 } else if (value <= 0 && value > -(1L<<32)) { 588 /* 589 * We're within 32-bits of address -1. 590 * 591 * The resulting code in the jump slot is: 592 * 593 * sethi %hi(. - .PLT0), %g1 594 * sethi %hix(addr), %g1 595 * xor %g1, %lox(addr), %g1 596 * jmp %g1 597 * nop 598 * nop 599 * nop 600 * nop 601 * 602 */ 603 where[3] = JMP; 604 where[2] = XOR | ((~value) & 0x00001fff); 605 where[1] = SETHI | HIVAL(~value, 10); 606 __asm __volatile("iflush %0+12" : : "r" (where)); 607 __asm __volatile("iflush %0+8" : : "r" (where)); 608 __asm __volatile("iflush %0+4" : : "r" (where)); 609 610 } else if (offset <= (1L<<32) && offset >= -((1L<<32) - 4)) { 611 /* 612 * We're within 32-bits -- we can use a direct call insn 613 * 614 * The resulting code in the jump slot is: 615 * 616 * sethi %hi(. - .PLT0), %g1 617 * mov %o7, %g1 618 * call (.+offset) 619 * mov %g1, %o7 620 * nop 621 * nop 622 * nop 623 * nop 624 * 625 */ 626 where[3] = MOV17; 627 where[2] = CALL | ((offset >> 4) & 0x3fffffff); 628 where[1] = MOV71; 629 __asm __volatile("iflush %0+12" : : "r" (where)); 630 __asm __volatile("iflush %0+8" : : "r" (where)); 631 __asm __volatile("iflush %0+4" : : "r" (where)); 632 633 } else if (offset >= 0 && offset < (1L<<44)) { 634 /* 635 * We're within 44 bits. We can generate this pattern: 636 * 637 * The resulting code in the jump slot is: 638 * 639 * sethi %hi(. - .PLT0), %g1 640 * sethi %h44(addr), %g1 641 * or %g1, %m44(addr), %g1 642 * sllx %g1, 12, %g1 643 * jmp %g1+%l44(addr) 644 * nop 645 * nop 646 * nop 647 * 648 */ 649 where[4] = JMP | LOVAL(offset, 0); 650 where[3] = SLLX | 12; 651 where[2] = OR | (((offset) >> 12) & 0x00001fff); 652 where[1] = SETHI | HIVAL(offset, 22); 653 __asm __volatile("iflush %0+16" : : "r" (where)); 654 __asm __volatile("iflush %0+12" : : "r" (where)); 655 __asm __volatile("iflush %0+8" : : "r" (where)); 656 __asm __volatile("iflush %0+4" : : "r" (where)); 657 658 } else if (offset < 0 && offset > -(1L<<44)) { 659 /* 660 * We're within 44 bits. We can generate this pattern: 661 * 662 * The resulting code in the jump slot is: 663 * 664 * sethi %hi(. - .PLT0), %g1 665 * sethi %h44(-addr), %g1 666 * xor %g1, %m44(-addr), %g1 667 * sllx %g1, 12, %g1 668 * jmp %g1+%l44(addr) 669 * nop 670 * nop 671 * nop 672 * 673 */ 674 where[4] = JMP | LOVAL(offset, 0); 675 where[3] = SLLX | 12; 676 where[2] = XOR | (((~offset) >> 12) & 0x00001fff); 677 where[1] = SETHI | HIVAL(~offset, 22); 678 __asm __volatile("iflush %0+16" : : "r" (where)); 679 __asm __volatile("iflush %0+12" : : "r" (where)); 680 __asm __volatile("iflush %0+8" : : "r" (where)); 681 __asm __volatile("iflush %0+4" : : "r" (where)); 682 683 } else { 684 /* 685 * We need to load all 64-bits 686 * 687 * The resulting code in the jump slot is: 688 * 689 * sethi %hi(. - .PLT0), %g1 690 * sethi %hh(addr), %g1 691 * sethi %lm(addr), %g5 692 * or %g1, %hm(addr), %g1 693 * sllx %g1, 32, %g1 694 * or %g1, %g5, %g1 695 * jmp %g1+%lo(addr) 696 * nop 697 * 698 */ 699 where[6] = JMP | LOVAL(value, 0); 700 where[5] = ORG5; 701 where[4] = SLLX | 32; 702 where[3] = OR | LOVAL(value, 32); 703 where[2] = SETHIG5 | HIVAL(value, 10); 704 where[1] = SETHI | HIVAL(value, 42); 705 __asm __volatile("iflush %0+24" : : "r" (where)); 706 __asm __volatile("iflush %0+20" : : "r" (where)); 707 __asm __volatile("iflush %0+16" : : "r" (where)); 708 __asm __volatile("iflush %0+12" : : "r" (where)); 709 __asm __volatile("iflush %0+8" : : "r" (where)); 710 __asm __volatile("iflush %0+4" : : "r" (where)); 711 712 } 713 714 return (caddr_t)value; 715 } 716
Indexes created Tue Sep 30 17:09:57 GMT 2025