alpha_reloc.c revision 1.28 1 1.28 skrll /* $NetBSD: alpha_reloc.c,v 1.28 2005/08/20 19:01:16 skrll Exp $ */
2 1.1 thorpej
3 1.1 thorpej /*
4 1.1 thorpej * Copyright (c) 2001 Wasabi Systems, Inc.
5 1.1 thorpej * All rights reserved.
6 1.1 thorpej *
7 1.1 thorpej * Written by Jason R. Thorpe for Wasabi Systems, Inc.
8 1.1 thorpej *
9 1.1 thorpej * Redistribution and use in source and binary forms, with or without
10 1.1 thorpej * modification, are permitted provided that the following conditions
11 1.1 thorpej * are met:
12 1.1 thorpej * 1. Redistributions of source code must retain the above copyright
13 1.1 thorpej * notice, this list of conditions and the following disclaimer.
14 1.1 thorpej * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 thorpej * notice, this list of conditions and the following disclaimer in the
16 1.1 thorpej * documentation and/or other materials provided with the distribution.
17 1.1 thorpej * 3. All advertising materials mentioning features or use of this software
18 1.1 thorpej * must display the following acknowledgement:
19 1.1 thorpej * This product includes software developed for the NetBSD Project by
20 1.1 thorpej * Wasabi Systems, Inc.
21 1.1 thorpej * 4. The name of Wasabi Systems, Inc. may not be used to endorse
22 1.1 thorpej * or promote products derived from this software without specific prior
23 1.1 thorpej * written permission.
24 1.1 thorpej *
25 1.1 thorpej * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
26 1.1 thorpej * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 1.1 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 1.1 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
29 1.1 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 1.1 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 1.1 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 1.1 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 1.1 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 1.1 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 1.1 thorpej * POSSIBILITY OF SUCH DAMAGE.
36 1.1 thorpej */
37 1.1 thorpej
38 1.14 thorpej /*
39 1.14 thorpej * Copyright 1996, 1997, 1998, 1999 John D. Polstra.
40 1.14 thorpej * All rights reserved.
41 1.14 thorpej *
42 1.14 thorpej * Redistribution and use in source and binary forms, with or without
43 1.14 thorpej * modification, are permitted provided that the following conditions
44 1.14 thorpej * are met:
45 1.14 thorpej * 1. Redistributions of source code must retain the above copyright
46 1.14 thorpej * notice, this list of conditions and the following disclaimer.
47 1.14 thorpej * 2. Redistributions in binary form must reproduce the above copyright
48 1.14 thorpej * notice, this list of conditions and the following disclaimer in the
49 1.14 thorpej * documentation and/or other materials provided with the distribution.
50 1.14 thorpej *
51 1.14 thorpej * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
52 1.14 thorpej * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
53 1.14 thorpej * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
54 1.14 thorpej * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
55 1.14 thorpej * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
56 1.14 thorpej * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
57 1.14 thorpej * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
58 1.14 thorpej * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
59 1.14 thorpej * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
60 1.14 thorpej * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
61 1.14 thorpej */
62 1.14 thorpej
63 1.28 skrll #include <sys/cdefs.h>
64 1.28 skrll #ifndef lint
65 1.28 skrll __RCSID("$NetBSD: alpha_reloc.c,v 1.28 2005/08/20 19:01:16 skrll Exp $");
66 1.28 skrll #endif /* not lint */
67 1.28 skrll
68 1.1 thorpej #include <sys/types.h>
69 1.1 thorpej #include <sys/stat.h>
70 1.19 thorpej #include <string.h>
71 1.1 thorpej
72 1.1 thorpej #include "rtld.h"
73 1.2 thorpej #include "debug.h"
74 1.2 thorpej
75 1.2 thorpej #ifdef RTLD_DEBUG_ALPHA
76 1.17 mycroft #define adbg(x) xprintf x
77 1.2 thorpej #else
78 1.2 thorpej #define adbg(x) /* nothing */
79 1.2 thorpej #endif
80 1.1 thorpej
81 1.16 mycroft void _rtld_bind_start(void);
82 1.16 mycroft void _rtld_bind_start_old(void);
83 1.15 mycroft void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
84 1.24 skrll caddr_t _rtld_bind(const Obj_Entry *, Elf_Word);
85 1.25 skrll static inline int _rtld_relocate_plt_object(const Obj_Entry *,
86 1.27 skrll const Elf_Rela *, Elf_Addr *);
87 1.15 mycroft
88 1.1 thorpej void
89 1.4 mycroft _rtld_setup_pltgot(const Obj_Entry *obj)
90 1.1 thorpej {
91 1.2 thorpej uint32_t word0;
92 1.1 thorpej
93 1.1 thorpej /*
94 1.2 thorpej * The PLTGOT on the Alpha looks like this:
95 1.2 thorpej *
96 1.2 thorpej * PLT HEADER
97 1.2 thorpej * .
98 1.2 thorpej * . 32 bytes
99 1.2 thorpej * .
100 1.2 thorpej * PLT ENTRY #0
101 1.2 thorpej * .
102 1.2 thorpej * . 12 bytes
103 1.2 thorpej * .
104 1.2 thorpej * PLT ENTRY #1
105 1.2 thorpej * .
106 1.2 thorpej * . 12 bytes
107 1.2 thorpej * .
108 1.2 thorpej * etc.
109 1.2 thorpej *
110 1.2 thorpej * The old-format entries look like (displacements filled in
111 1.2 thorpej * by the linker):
112 1.2 thorpej *
113 1.2 thorpej * ldah $28, 0($31) # 0x279f0000
114 1.2 thorpej * lda $28, 0($28) # 0x239c0000
115 1.2 thorpej * br $31, plt0 # 0xc3e00000
116 1.2 thorpej *
117 1.2 thorpej * The new-format entries look like:
118 1.2 thorpej *
119 1.2 thorpej * br $28, plt0 # 0xc3800000
120 1.2 thorpej * # 0x00000000
121 1.2 thorpej * # 0x00000000
122 1.2 thorpej *
123 1.2 thorpej * What we do is fetch the first PLT entry and check to
124 1.2 thorpej * see the first word of it matches the first word of the
125 1.2 thorpej * old format. If so, we use a binding routine that can
126 1.2 thorpej * handle the old format, otherwise we use a binding routine
127 1.2 thorpej * that handles the new format.
128 1.2 thorpej *
129 1.2 thorpej * Note that this is done on a per-object basis, we can mix
130 1.2 thorpej * and match shared objects build with both the old and new
131 1.2 thorpej * linker.
132 1.1 thorpej */
133 1.2 thorpej word0 = *(uint32_t *)(((char *) obj->pltgot) + 32);
134 1.2 thorpej if ((word0 & 0xffff0000) == 0x279f0000) {
135 1.1 thorpej /* Old PLT entry format. */
136 1.2 thorpej adbg(("ALPHA: object %p has old PLT format\n", obj));
137 1.1 thorpej obj->pltgot[2] = (Elf_Addr) &_rtld_bind_start_old;
138 1.1 thorpej obj->pltgot[3] = (Elf_Addr) obj;
139 1.3 mycroft } else {
140 1.3 mycroft /* New PLT entry format. */
141 1.3 mycroft adbg(("ALPHA: object %p has new PLT format\n", obj));
142 1.3 mycroft obj->pltgot[2] = (Elf_Addr) &_rtld_bind_start;
143 1.3 mycroft obj->pltgot[3] = (Elf_Addr) obj;
144 1.1 thorpej }
145 1.1 thorpej
146 1.3 mycroft __asm __volatile("imb");
147 1.5 mycroft }
148 1.5 mycroft
149 1.19 thorpej /*
150 1.19 thorpej * It is possible for the compiler to emit relocations for unaligned data.
151 1.19 thorpej * We handle this situation with these inlines.
152 1.19 thorpej */
153 1.19 thorpej #define RELOC_ALIGNED_P(x) \
154 1.19 thorpej (((uintptr_t)(x) & (sizeof(void *) - 1)) == 0)
155 1.19 thorpej
156 1.19 thorpej static __inline Elf_Addr
157 1.19 thorpej load_ptr(void *where)
158 1.19 thorpej {
159 1.19 thorpej Elf_Addr res;
160 1.19 thorpej
161 1.19 thorpej memcpy(&res, where, sizeof(res));
162 1.19 thorpej
163 1.19 thorpej return (res);
164 1.19 thorpej }
165 1.19 thorpej
166 1.19 thorpej static __inline void
167 1.19 thorpej store_ptr(void *where, Elf_Addr val)
168 1.19 thorpej {
169 1.19 thorpej
170 1.19 thorpej memcpy(where, &val, sizeof(val));
171 1.19 thorpej }
172 1.19 thorpej
173 1.15 mycroft void
174 1.24 skrll _rtld_relocate_nonplt_self(Elf_Dyn *dynp, Elf_Addr relocbase)
175 1.15 mycroft {
176 1.15 mycroft const Elf_Rela *rela = 0, *relalim;
177 1.15 mycroft Elf_Addr relasz = 0;
178 1.15 mycroft Elf_Addr *where;
179 1.15 mycroft
180 1.15 mycroft for (; dynp->d_tag != DT_NULL; dynp++) {
181 1.15 mycroft switch (dynp->d_tag) {
182 1.15 mycroft case DT_RELA:
183 1.15 mycroft rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr);
184 1.15 mycroft break;
185 1.15 mycroft case DT_RELASZ:
186 1.15 mycroft relasz = dynp->d_un.d_val;
187 1.15 mycroft break;
188 1.15 mycroft }
189 1.15 mycroft }
190 1.15 mycroft relalim = (const Elf_Rela *)((caddr_t)rela + relasz);
191 1.15 mycroft for (; rela < relalim; rela++) {
192 1.15 mycroft where = (Elf_Addr *)(relocbase + rela->r_offset);
193 1.15 mycroft /* XXX For some reason I see a few GLOB_DAT relocs here. */
194 1.15 mycroft *where += (Elf_Addr)relocbase;
195 1.15 mycroft }
196 1.15 mycroft }
197 1.15 mycroft
198 1.5 mycroft int
199 1.24 skrll _rtld_relocate_nonplt_objects(const Obj_Entry *obj)
200 1.5 mycroft {
201 1.6 mycroft const Elf_Rela *rela;
202 1.20 mycroft #define COMBRELOC
203 1.20 mycroft #ifdef COMBRELOC
204 1.20 mycroft unsigned long lastsym = -1;
205 1.20 mycroft #endif
206 1.26 fair Elf_Addr target = -1;
207 1.15 mycroft
208 1.6 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
209 1.6 mycroft Elf_Addr *where;
210 1.6 mycroft const Elf_Sym *def;
211 1.6 mycroft const Obj_Entry *defobj;
212 1.6 mycroft Elf_Addr tmp;
213 1.8 mycroft unsigned long symnum;
214 1.6 mycroft
215 1.6 mycroft where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
216 1.8 mycroft symnum = ELF_R_SYM(rela->r_info);
217 1.6 mycroft
218 1.6 mycroft switch (ELF_R_TYPE(rela->r_info)) {
219 1.6 mycroft case R_TYPE(NONE):
220 1.6 mycroft break;
221 1.6 mycroft
222 1.6 mycroft case R_TYPE(REFQUAD):
223 1.6 mycroft case R_TYPE(GLOB_DAT):
224 1.20 mycroft #ifdef COMBRELOC
225 1.20 mycroft if (symnum != lastsym) {
226 1.20 mycroft #endif
227 1.20 mycroft def = _rtld_find_symdef(symnum, obj, &defobj,
228 1.20 mycroft false);
229 1.20 mycroft if (def == NULL)
230 1.20 mycroft return -1;
231 1.20 mycroft target = (Elf_Addr)(defobj->relocbase +
232 1.20 mycroft def->st_value);
233 1.20 mycroft #ifdef COMBRELOC
234 1.20 mycroft lastsym = symnum;
235 1.20 mycroft }
236 1.20 mycroft #endif
237 1.6 mycroft
238 1.20 mycroft tmp = target + rela->r_addend;
239 1.19 thorpej if (__predict_true(RELOC_ALIGNED_P(where))) {
240 1.19 thorpej if (*where != tmp)
241 1.19 thorpej *where = tmp;
242 1.19 thorpej } else {
243 1.19 thorpej if (load_ptr(where) != tmp)
244 1.19 thorpej store_ptr(where, tmp);
245 1.19 thorpej }
246 1.18 mycroft rdbg(("REFQUAD/GLOB_DAT %s in %s --> %p in %s",
247 1.9 mycroft obj->strtab + obj->symtab[symnum].st_name,
248 1.19 thorpej obj->path, (void *)tmp, defobj->path));
249 1.6 mycroft break;
250 1.6 mycroft
251 1.6 mycroft case R_TYPE(RELATIVE):
252 1.19 thorpej if (__predict_true(RELOC_ALIGNED_P(where)))
253 1.19 thorpej *where += (Elf_Addr)obj->relocbase;
254 1.19 thorpej else
255 1.19 thorpej store_ptr(where,
256 1.19 thorpej load_ptr(where) + (Elf_Addr)obj->relocbase);
257 1.18 mycroft rdbg(("RELATIVE in %s --> %p", obj->path,
258 1.18 mycroft (void *)*where));
259 1.6 mycroft break;
260 1.6 mycroft
261 1.6 mycroft case R_TYPE(COPY):
262 1.6 mycroft /*
263 1.6 mycroft * These are deferred until all other relocations have
264 1.6 mycroft * been done. All we do here is make sure that the
265 1.6 mycroft * COPY relocation is not in a shared library. They
266 1.6 mycroft * are allowed only in executable files.
267 1.6 mycroft */
268 1.12 mycroft if (obj->isdynamic) {
269 1.6 mycroft _rtld_error(
270 1.5 mycroft "%s: Unexpected R_COPY relocation in shared library",
271 1.6 mycroft obj->path);
272 1.6 mycroft return -1;
273 1.6 mycroft }
274 1.17 mycroft rdbg(("COPY (avoid in main)"));
275 1.6 mycroft break;
276 1.6 mycroft
277 1.6 mycroft default:
278 1.17 mycroft rdbg(("sym = %lu, type = %lu, offset = %p, "
279 1.6 mycroft "addend = %p, contents = %p, symbol = %s",
280 1.8 mycroft symnum, (u_long)ELF_R_TYPE(rela->r_info),
281 1.6 mycroft (void *)rela->r_offset, (void *)rela->r_addend,
282 1.19 thorpej (void *)load_ptr(where),
283 1.8 mycroft obj->strtab + obj->symtab[symnum].st_name));
284 1.6 mycroft _rtld_error("%s: Unsupported relocation type %ld "
285 1.6 mycroft "in non-PLT relocations\n",
286 1.6 mycroft obj->path, (u_long) ELF_R_TYPE(rela->r_info));
287 1.5 mycroft return -1;
288 1.5 mycroft }
289 1.5 mycroft }
290 1.10 mycroft return 0;
291 1.10 mycroft }
292 1.10 mycroft
293 1.10 mycroft int
294 1.24 skrll _rtld_relocate_plt_lazy(const Obj_Entry *obj)
295 1.10 mycroft {
296 1.10 mycroft const Elf_Rela *rela;
297 1.10 mycroft
298 1.23 mycroft if (!obj->relocbase)
299 1.10 mycroft return 0;
300 1.10 mycroft
301 1.10 mycroft for (rela = obj->pltrela; rela < obj->pltrelalim; rela++) {
302 1.10 mycroft Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
303 1.10 mycroft
304 1.10 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
305 1.10 mycroft
306 1.10 mycroft /* Just relocate the GOT slots pointing into the PLT */
307 1.10 mycroft *where += (Elf_Addr)obj->relocbase;
308 1.17 mycroft rdbg(("fixup !main in %s --> %p", obj->path, (void *)*where));
309 1.10 mycroft }
310 1.10 mycroft
311 1.10 mycroft return 0;
312 1.10 mycroft }
313 1.10 mycroft
314 1.25 skrll static inline int
315 1.25 skrll _rtld_relocate_plt_object(const Obj_Entry *obj, const Elf_Rela *rela, Elf_Addr *tp)
316 1.10 mycroft {
317 1.10 mycroft Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
318 1.10 mycroft Elf_Addr new_value;
319 1.10 mycroft const Elf_Sym *def;
320 1.10 mycroft const Obj_Entry *defobj;
321 1.14 thorpej Elf_Addr stubaddr;
322 1.10 mycroft
323 1.10 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
324 1.10 mycroft
325 1.10 mycroft def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true);
326 1.10 mycroft if (def == NULL)
327 1.25 skrll return -1;
328 1.10 mycroft
329 1.10 mycroft new_value = (Elf_Addr)(defobj->relocbase + def->st_value);
330 1.17 mycroft rdbg(("bind now/fixup in %s --> old=%p new=%p",
331 1.10 mycroft defobj->strtab + def->st_name, (void *)*where, (void *)new_value));
332 1.14 thorpej
333 1.14 thorpej if ((stubaddr = *where) != new_value) {
334 1.14 thorpej int64_t delta, idisp;
335 1.14 thorpej uint32_t insn[3], *stubptr;
336 1.14 thorpej int insncnt;
337 1.14 thorpej Elf_Addr pc;
338 1.14 thorpej
339 1.14 thorpej /* Point this GOT entry at the target. */
340 1.10 mycroft *where = new_value;
341 1.10 mycroft
342 1.14 thorpej /*
343 1.14 thorpej * Alpha shared objects may have multiple GOTs, each
344 1.14 thorpej * of which may point to this entry in the PLT. But,
345 1.14 thorpej * we only have a reference to the first GOT entry which
346 1.14 thorpej * points to this PLT entry. In order to avoid having to
347 1.14 thorpej * re-bind this call every time a non-first GOT entry is
348 1.14 thorpej * used, we will attempt to patch up the PLT entry to
349 1.14 thorpej * reference the target, rather than the binder.
350 1.14 thorpej *
351 1.14 thorpej * When the PLT stub gets control, PV contains the address
352 1.14 thorpej * of the PLT entry. Each PLT entry has room for 3 insns.
353 1.14 thorpej * If the displacement of the target from PV fits in a signed
354 1.14 thorpej * 32-bit integer, we can simply add it to PV. Otherwise,
355 1.14 thorpej * we must load the GOT entry itself into PV.
356 1.14 thorpej *
357 1.14 thorpej * Note if the shared object uses the old PLT format, then
358 1.14 thorpej * we cannot patch up the PLT safely, and so we skip it
359 1.14 thorpej * in that case[*].
360 1.14 thorpej *
361 1.14 thorpej * [*] Actually, if we're not doing lazy-binding, then
362 1.14 thorpej * we *can* (and do) patch up this PLT entry; the PLTGOT
363 1.14 thorpej * thunk won't yet point to any binder entry point, and
364 1.14 thorpej * so this test will fail as it would for the new PLT
365 1.14 thorpej * entry format.
366 1.14 thorpej */
367 1.14 thorpej if (obj->pltgot[2] == (Elf_Addr) &_rtld_bind_start_old) {
368 1.17 mycroft rdbg((" old PLT format"));
369 1.14 thorpej goto out;
370 1.14 thorpej }
371 1.14 thorpej
372 1.14 thorpej delta = new_value - stubaddr;
373 1.17 mycroft rdbg((" stubaddr=%p, where-stubaddr=%ld, delta=%ld",
374 1.14 thorpej (void *)stubaddr, (long)where - (long)stubaddr,
375 1.14 thorpej (long)delta));
376 1.14 thorpej insncnt = 0;
377 1.14 thorpej if ((int32_t)delta == delta) {
378 1.14 thorpej /*
379 1.14 thorpej * We can adjust PV with an LDA, LDAH sequence.
380 1.14 thorpej *
381 1.14 thorpej * First, build an LDA insn to adjust the low 16
382 1.14 thorpej * bits.
383 1.14 thorpej */
384 1.14 thorpej insn[insncnt++] = 0x08 << 26 | 27 << 21 | 27 << 16 |
385 1.14 thorpej (delta & 0xffff);
386 1.17 mycroft rdbg((" LDA $27,%d($27)", (int16_t)delta));
387 1.14 thorpej /*
388 1.14 thorpej * Adjust the delta to account for the effects of
389 1.14 thorpej * the LDA, including sign-extension.
390 1.14 thorpej */
391 1.14 thorpej delta -= (int16_t)delta;
392 1.14 thorpej if (delta != 0) {
393 1.14 thorpej /*
394 1.14 thorpej * Build an LDAH instruction to adjust the
395 1.14 thorpej * high 16 bits.
396 1.14 thorpej */
397 1.14 thorpej insn[insncnt++] = 0x09 << 26 | 27 << 21 |
398 1.14 thorpej 27 << 16 | ((delta >> 16) & 0xffff);
399 1.17 mycroft rdbg((" LDAH $27,%d($27)",
400 1.14 thorpej (int16_t)(delta >> 16)));
401 1.14 thorpej }
402 1.14 thorpej } else {
403 1.14 thorpej int64_t dhigh;
404 1.14 thorpej
405 1.14 thorpej /* We must load the GOT entry. */
406 1.14 thorpej delta = (Elf_Addr)where - stubaddr;
407 1.14 thorpej
408 1.14 thorpej /*
409 1.14 thorpej * If the GOT entry is too far away from the PLT
410 1.14 thorpej * entry, then we can't patch up the PLT entry.
411 1.14 thorpej * This PLT entry will have to be bound for each
412 1.14 thorpej * GOT entry except for the first one. This program
413 1.14 thorpej * will still run, albeit very slowly. It is very
414 1.14 thorpej * unlikely that this case will ever happen in
415 1.14 thorpej * practice.
416 1.14 thorpej */
417 1.14 thorpej if ((int32_t)delta != delta) {
418 1.17 mycroft rdbg((" PLT stub too far from GOT to relocate"));
419 1.14 thorpej goto out;
420 1.14 thorpej }
421 1.14 thorpej dhigh = delta - (int16_t)delta;
422 1.14 thorpej if (dhigh != 0) {
423 1.14 thorpej /*
424 1.14 thorpej * Build an LDAH instruction to adjust the
425 1.14 thorpej * high 16 bits.
426 1.14 thorpej */
427 1.14 thorpej insn[insncnt++] = 0x09 << 26 | 27 << 21 |
428 1.14 thorpej 27 << 16 | ((dhigh >> 16) & 0xffff);
429 1.17 mycroft rdbg((" LDAH $27,%d($27)",
430 1.14 thorpej (int16_t)(dhigh >> 16)));
431 1.14 thorpej }
432 1.14 thorpej /* Build an LDQ to load the GOT entry. */
433 1.14 thorpej insn[insncnt++] = 0x29 << 26 | 27 << 21 |
434 1.14 thorpej 27 << 16 | (delta & 0xffff);
435 1.17 mycroft rdbg((" LDQ $27,%d($27)",
436 1.14 thorpej (int16_t)delta));
437 1.14 thorpej }
438 1.14 thorpej
439 1.14 thorpej /*
440 1.14 thorpej * Now, build a JMP or BR insn to jump to the target. If
441 1.14 thorpej * the displacement fits in a sign-extended 21-bit field,
442 1.14 thorpej * we can use the more efficient BR insn. Otherwise, we
443 1.14 thorpej * have to jump indirect through PV.
444 1.14 thorpej */
445 1.14 thorpej pc = stubaddr + (4 * (insncnt + 1));
446 1.14 thorpej idisp = (int64_t)(new_value - pc) >> 2;
447 1.14 thorpej if (-0x100000 <= idisp && idisp < 0x100000) {
448 1.14 thorpej insn[insncnt++] = 0x30 << 26 | 31 << 21 |
449 1.14 thorpej (idisp & 0x1fffff);
450 1.17 mycroft rdbg((" BR $31,%p", (void *)new_value));
451 1.14 thorpej } else {
452 1.14 thorpej insn[insncnt++] = 0x1a << 26 | 31 << 21 |
453 1.14 thorpej 27 << 16 | (idisp & 0x3fff);
454 1.17 mycroft rdbg((" JMP $31,($27),%d",
455 1.14 thorpej (int)(idisp & 0x3fff)));
456 1.14 thorpej }
457 1.14 thorpej
458 1.14 thorpej /*
459 1.14 thorpej * Fill in the tail of the PLT entry first, for reentrancy.
460 1.14 thorpej * Until we have overwritten the first insn (an unconditional
461 1.14 thorpej * branch), the remaining insns have no effect.
462 1.14 thorpej */
463 1.14 thorpej stubptr = (uint32_t *)stubaddr;
464 1.14 thorpej while (insncnt > 1) {
465 1.14 thorpej insncnt--;
466 1.14 thorpej stubptr[insncnt] = insn[insncnt];
467 1.14 thorpej }
468 1.14 thorpej /*
469 1.14 thorpej * Commit the tail of the insn sequence to memory
470 1.14 thorpej * before overwriting the first insn.
471 1.14 thorpej */
472 1.14 thorpej __asm __volatile("wmb" ::: "memory");
473 1.14 thorpej stubptr[0] = insn[0];
474 1.14 thorpej /*
475 1.14 thorpej * I-stream will be sync'd when we either return from
476 1.14 thorpej * the binder (lazy bind case) or when the PLTGOT thunk
477 1.14 thorpej * is patched up (bind-now case).
478 1.14 thorpej */
479 1.14 thorpej }
480 1.25 skrll out:
481 1.25 skrll if (tp)
482 1.25 skrll *tp = new_value;
483 1.25 skrll
484 1.25 skrll return 0;
485 1.25 skrll }
486 1.25 skrll
487 1.25 skrll caddr_t
488 1.25 skrll _rtld_bind(const Obj_Entry *obj, Elf_Word reloff)
489 1.25 skrll {
490 1.25 skrll const Elf_Rela *rela = (const Elf_Rela *)((caddr_t)obj->pltrela + reloff);
491 1.25 skrll Elf_Addr result;
492 1.25 skrll int err;
493 1.25 skrll
494 1.25 skrll err = _rtld_relocate_plt_object(obj, rela, &result);
495 1.25 skrll if (err)
496 1.25 skrll _rtld_die();
497 1.25 skrll
498 1.25 skrll return (caddr_t)result;
499 1.25 skrll }
500 1.25 skrll
501 1.25 skrll int
502 1.25 skrll _rtld_relocate_plt_objects(const Obj_Entry *obj)
503 1.25 skrll {
504 1.25 skrll const Elf_Rela *rela;
505 1.14 thorpej
506 1.25 skrll for (rela = obj->pltrela; rela < obj->pltrelalim; rela++)
507 1.25 skrll if (_rtld_relocate_plt_object(obj, rela, NULL) < 0)
508 1.25 skrll return -1;
509 1.25 skrll
510 1.25 skrll return 0;
511 1.1 thorpej }
512