alpha_reloc.c revision 1.16 1 1.16 mycroft /* $NetBSD: alpha_reloc.c,v 1.16 2002/09/12 20:20:59 mycroft 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.1 thorpej #include <sys/types.h>
64 1.1 thorpej #include <sys/stat.h>
65 1.1 thorpej
66 1.1 thorpej #include "rtld.h"
67 1.2 thorpej #include "debug.h"
68 1.2 thorpej
69 1.2 thorpej #ifdef RTLD_DEBUG_ALPHA
70 1.2 thorpej #define adbg(x) if (dodebug) xprintf x
71 1.2 thorpej #else
72 1.2 thorpej #define adbg(x) /* nothing */
73 1.2 thorpej #endif
74 1.1 thorpej
75 1.16 mycroft void _rtld_bind_start(void);
76 1.16 mycroft void _rtld_bind_start_old(void);
77 1.15 mycroft void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
78 1.15 mycroft
79 1.1 thorpej void
80 1.4 mycroft _rtld_setup_pltgot(const Obj_Entry *obj)
81 1.1 thorpej {
82 1.2 thorpej uint32_t word0;
83 1.1 thorpej
84 1.1 thorpej /*
85 1.2 thorpej * The PLTGOT on the Alpha looks like this:
86 1.2 thorpej *
87 1.2 thorpej * PLT HEADER
88 1.2 thorpej * .
89 1.2 thorpej * . 32 bytes
90 1.2 thorpej * .
91 1.2 thorpej * PLT ENTRY #0
92 1.2 thorpej * .
93 1.2 thorpej * . 12 bytes
94 1.2 thorpej * .
95 1.2 thorpej * PLT ENTRY #1
96 1.2 thorpej * .
97 1.2 thorpej * . 12 bytes
98 1.2 thorpej * .
99 1.2 thorpej * etc.
100 1.2 thorpej *
101 1.2 thorpej * The old-format entries look like (displacements filled in
102 1.2 thorpej * by the linker):
103 1.2 thorpej *
104 1.2 thorpej * ldah $28, 0($31) # 0x279f0000
105 1.2 thorpej * lda $28, 0($28) # 0x239c0000
106 1.2 thorpej * br $31, plt0 # 0xc3e00000
107 1.2 thorpej *
108 1.2 thorpej * The new-format entries look like:
109 1.2 thorpej *
110 1.2 thorpej * br $28, plt0 # 0xc3800000
111 1.2 thorpej * # 0x00000000
112 1.2 thorpej * # 0x00000000
113 1.2 thorpej *
114 1.2 thorpej * What we do is fetch the first PLT entry and check to
115 1.2 thorpej * see the first word of it matches the first word of the
116 1.2 thorpej * old format. If so, we use a binding routine that can
117 1.2 thorpej * handle the old format, otherwise we use a binding routine
118 1.2 thorpej * that handles the new format.
119 1.2 thorpej *
120 1.2 thorpej * Note that this is done on a per-object basis, we can mix
121 1.2 thorpej * and match shared objects build with both the old and new
122 1.2 thorpej * linker.
123 1.1 thorpej */
124 1.2 thorpej word0 = *(uint32_t *)(((char *) obj->pltgot) + 32);
125 1.2 thorpej if ((word0 & 0xffff0000) == 0x279f0000) {
126 1.1 thorpej /* Old PLT entry format. */
127 1.2 thorpej adbg(("ALPHA: object %p has old PLT format\n", obj));
128 1.1 thorpej obj->pltgot[2] = (Elf_Addr) &_rtld_bind_start_old;
129 1.1 thorpej obj->pltgot[3] = (Elf_Addr) obj;
130 1.3 mycroft } else {
131 1.3 mycroft /* New PLT entry format. */
132 1.3 mycroft adbg(("ALPHA: object %p has new PLT format\n", obj));
133 1.3 mycroft obj->pltgot[2] = (Elf_Addr) &_rtld_bind_start;
134 1.3 mycroft obj->pltgot[3] = (Elf_Addr) obj;
135 1.1 thorpej }
136 1.1 thorpej
137 1.3 mycroft __asm __volatile("imb");
138 1.5 mycroft }
139 1.5 mycroft
140 1.15 mycroft void
141 1.15 mycroft _rtld_relocate_nonplt_self(dynp, relocbase)
142 1.15 mycroft Elf_Dyn *dynp;
143 1.15 mycroft Elf_Addr relocbase;
144 1.15 mycroft {
145 1.15 mycroft const Elf_Rela *rela = 0, *relalim;
146 1.15 mycroft Elf_Addr relasz = 0;
147 1.15 mycroft Elf_Addr *where;
148 1.15 mycroft
149 1.15 mycroft for (; dynp->d_tag != DT_NULL; dynp++) {
150 1.15 mycroft switch (dynp->d_tag) {
151 1.15 mycroft case DT_RELA:
152 1.15 mycroft rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr);
153 1.15 mycroft break;
154 1.15 mycroft case DT_RELASZ:
155 1.15 mycroft relasz = dynp->d_un.d_val;
156 1.15 mycroft break;
157 1.15 mycroft }
158 1.15 mycroft }
159 1.15 mycroft relalim = (const Elf_Rela *)((caddr_t)rela + relasz);
160 1.15 mycroft for (; rela < relalim; rela++) {
161 1.15 mycroft where = (Elf_Addr *)(relocbase + rela->r_offset);
162 1.15 mycroft /* XXX For some reason I see a few GLOB_DAT relocs here. */
163 1.15 mycroft *where += (Elf_Addr)relocbase;
164 1.15 mycroft }
165 1.15 mycroft }
166 1.15 mycroft
167 1.5 mycroft int
168 1.13 mycroft _rtld_relocate_nonplt_objects(obj, self, dodebug)
169 1.11 mycroft const Obj_Entry *obj;
170 1.13 mycroft bool self;
171 1.5 mycroft bool dodebug;
172 1.5 mycroft {
173 1.6 mycroft const Elf_Rela *rela;
174 1.5 mycroft
175 1.15 mycroft if (self)
176 1.15 mycroft return 0;
177 1.15 mycroft
178 1.6 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
179 1.6 mycroft Elf_Addr *where;
180 1.6 mycroft const Elf_Sym *def;
181 1.6 mycroft const Obj_Entry *defobj;
182 1.6 mycroft Elf_Addr tmp;
183 1.8 mycroft unsigned long symnum;
184 1.6 mycroft
185 1.6 mycroft where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
186 1.8 mycroft symnum = ELF_R_SYM(rela->r_info);
187 1.6 mycroft
188 1.6 mycroft switch (ELF_R_TYPE(rela->r_info)) {
189 1.6 mycroft case R_TYPE(NONE):
190 1.6 mycroft break;
191 1.6 mycroft
192 1.6 mycroft case R_TYPE(REFQUAD):
193 1.8 mycroft def = _rtld_find_symdef(symnum, obj, &defobj, false);
194 1.6 mycroft if (def == NULL)
195 1.6 mycroft return -1;
196 1.6 mycroft
197 1.6 mycroft tmp = (Elf_Addr)(defobj->relocbase + def->st_value) +
198 1.7 mycroft *where + rela->r_addend;
199 1.6 mycroft if (*where != tmp)
200 1.6 mycroft *where = tmp;
201 1.6 mycroft rdbg(dodebug, ("REFQUAD %s in %s --> %p in %s",
202 1.9 mycroft obj->strtab + obj->symtab[symnum].st_name,
203 1.9 mycroft obj->path, (void *)*where, defobj->path));
204 1.6 mycroft break;
205 1.6 mycroft
206 1.6 mycroft case R_TYPE(GLOB_DAT):
207 1.8 mycroft def = _rtld_find_symdef(symnum, obj, &defobj, false);
208 1.6 mycroft if (def == NULL)
209 1.6 mycroft return -1;
210 1.6 mycroft
211 1.6 mycroft tmp = (Elf_Addr)(defobj->relocbase + def->st_value) +
212 1.6 mycroft rela->r_addend;
213 1.6 mycroft if (*where != tmp)
214 1.6 mycroft *where = tmp;
215 1.6 mycroft rdbg(dodebug, ("GLOB_DAT %s in %s --> %p in %s",
216 1.9 mycroft obj->strtab + obj->symtab[symnum].st_name,
217 1.9 mycroft obj->path, (void *)*where, defobj->path));
218 1.6 mycroft break;
219 1.6 mycroft
220 1.6 mycroft case R_TYPE(RELATIVE):
221 1.15 mycroft *where += (Elf_Addr)obj->relocbase;
222 1.15 mycroft rdbg(dodebug, ("RELATIVE in %s --> %p",
223 1.15 mycroft obj->path, (void *)*where));
224 1.6 mycroft break;
225 1.6 mycroft
226 1.6 mycroft case R_TYPE(COPY):
227 1.6 mycroft /*
228 1.6 mycroft * These are deferred until all other relocations have
229 1.6 mycroft * been done. All we do here is make sure that the
230 1.6 mycroft * COPY relocation is not in a shared library. They
231 1.6 mycroft * are allowed only in executable files.
232 1.6 mycroft */
233 1.12 mycroft if (obj->isdynamic) {
234 1.6 mycroft _rtld_error(
235 1.5 mycroft "%s: Unexpected R_COPY relocation in shared library",
236 1.6 mycroft obj->path);
237 1.6 mycroft return -1;
238 1.6 mycroft }
239 1.6 mycroft rdbg(dodebug, ("COPY (avoid in main)"));
240 1.6 mycroft break;
241 1.6 mycroft
242 1.6 mycroft default:
243 1.6 mycroft rdbg(dodebug, ("sym = %lu, type = %lu, offset = %p, "
244 1.6 mycroft "addend = %p, contents = %p, symbol = %s",
245 1.8 mycroft symnum, (u_long)ELF_R_TYPE(rela->r_info),
246 1.6 mycroft (void *)rela->r_offset, (void *)rela->r_addend,
247 1.6 mycroft (void *)*where,
248 1.8 mycroft obj->strtab + obj->symtab[symnum].st_name));
249 1.6 mycroft _rtld_error("%s: Unsupported relocation type %ld "
250 1.6 mycroft "in non-PLT relocations\n",
251 1.6 mycroft obj->path, (u_long) ELF_R_TYPE(rela->r_info));
252 1.5 mycroft return -1;
253 1.5 mycroft }
254 1.5 mycroft }
255 1.10 mycroft return 0;
256 1.10 mycroft }
257 1.10 mycroft
258 1.10 mycroft int
259 1.10 mycroft _rtld_relocate_plt_lazy(obj, dodebug)
260 1.11 mycroft const Obj_Entry *obj;
261 1.10 mycroft bool dodebug;
262 1.10 mycroft {
263 1.10 mycroft const Elf_Rela *rela;
264 1.10 mycroft
265 1.12 mycroft if (!obj->isdynamic)
266 1.10 mycroft return 0;
267 1.10 mycroft
268 1.10 mycroft for (rela = obj->pltrela; rela < obj->pltrelalim; rela++) {
269 1.10 mycroft Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
270 1.10 mycroft
271 1.10 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
272 1.10 mycroft
273 1.10 mycroft /* Just relocate the GOT slots pointing into the PLT */
274 1.10 mycroft *where += (Elf_Addr)obj->relocbase;
275 1.10 mycroft rdbg(dodebug, ("fixup !main in %s --> %p", obj->path,
276 1.10 mycroft (void *)*where));
277 1.10 mycroft }
278 1.10 mycroft
279 1.10 mycroft return 0;
280 1.10 mycroft }
281 1.10 mycroft
282 1.10 mycroft int
283 1.10 mycroft _rtld_relocate_plt_object(obj, rela, addrp, dodebug)
284 1.11 mycroft const Obj_Entry *obj;
285 1.10 mycroft const Elf_Rela *rela;
286 1.10 mycroft caddr_t *addrp;
287 1.10 mycroft bool dodebug;
288 1.10 mycroft {
289 1.10 mycroft Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
290 1.10 mycroft Elf_Addr new_value;
291 1.10 mycroft const Elf_Sym *def;
292 1.10 mycroft const Obj_Entry *defobj;
293 1.14 thorpej Elf_Addr stubaddr;
294 1.10 mycroft
295 1.10 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
296 1.10 mycroft
297 1.10 mycroft def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true);
298 1.10 mycroft if (def == NULL)
299 1.10 mycroft return -1;
300 1.10 mycroft
301 1.10 mycroft new_value = (Elf_Addr)(defobj->relocbase + def->st_value);
302 1.10 mycroft rdbg(dodebug, ("bind now/fixup in %s --> old=%p new=%p",
303 1.10 mycroft defobj->strtab + def->st_name, (void *)*where, (void *)new_value));
304 1.14 thorpej
305 1.14 thorpej if ((stubaddr = *where) != new_value) {
306 1.14 thorpej int64_t delta, idisp;
307 1.14 thorpej uint32_t insn[3], *stubptr;
308 1.14 thorpej int insncnt;
309 1.14 thorpej Elf_Addr pc;
310 1.14 thorpej
311 1.14 thorpej /* Point this GOT entry at the target. */
312 1.10 mycroft *where = new_value;
313 1.10 mycroft
314 1.14 thorpej /*
315 1.14 thorpej * Alpha shared objects may have multiple GOTs, each
316 1.14 thorpej * of which may point to this entry in the PLT. But,
317 1.14 thorpej * we only have a reference to the first GOT entry which
318 1.14 thorpej * points to this PLT entry. In order to avoid having to
319 1.14 thorpej * re-bind this call every time a non-first GOT entry is
320 1.14 thorpej * used, we will attempt to patch up the PLT entry to
321 1.14 thorpej * reference the target, rather than the binder.
322 1.14 thorpej *
323 1.14 thorpej * When the PLT stub gets control, PV contains the address
324 1.14 thorpej * of the PLT entry. Each PLT entry has room for 3 insns.
325 1.14 thorpej * If the displacement of the target from PV fits in a signed
326 1.14 thorpej * 32-bit integer, we can simply add it to PV. Otherwise,
327 1.14 thorpej * we must load the GOT entry itself into PV.
328 1.14 thorpej *
329 1.14 thorpej * Note if the shared object uses the old PLT format, then
330 1.14 thorpej * we cannot patch up the PLT safely, and so we skip it
331 1.14 thorpej * in that case[*].
332 1.14 thorpej *
333 1.14 thorpej * [*] Actually, if we're not doing lazy-binding, then
334 1.14 thorpej * we *can* (and do) patch up this PLT entry; the PLTGOT
335 1.14 thorpej * thunk won't yet point to any binder entry point, and
336 1.14 thorpej * so this test will fail as it would for the new PLT
337 1.14 thorpej * entry format.
338 1.14 thorpej */
339 1.14 thorpej if (obj->pltgot[2] == (Elf_Addr) &_rtld_bind_start_old) {
340 1.14 thorpej rdbg(dodebug, (" old PLT format"));
341 1.14 thorpej goto out;
342 1.14 thorpej }
343 1.14 thorpej
344 1.14 thorpej delta = new_value - stubaddr;
345 1.14 thorpej rdbg(dodebug, (" stubaddr=%p, where-stubaddr=%ld, delta=%ld",
346 1.14 thorpej (void *)stubaddr, (long)where - (long)stubaddr,
347 1.14 thorpej (long)delta));
348 1.14 thorpej insncnt = 0;
349 1.14 thorpej if ((int32_t)delta == delta) {
350 1.14 thorpej /*
351 1.14 thorpej * We can adjust PV with an LDA, LDAH sequence.
352 1.14 thorpej *
353 1.14 thorpej * First, build an LDA insn to adjust the low 16
354 1.14 thorpej * bits.
355 1.14 thorpej */
356 1.14 thorpej insn[insncnt++] = 0x08 << 26 | 27 << 21 | 27 << 16 |
357 1.14 thorpej (delta & 0xffff);
358 1.14 thorpej rdbg(dodebug, (" LDA $27,%d($27)", (int16_t)delta));
359 1.14 thorpej /*
360 1.14 thorpej * Adjust the delta to account for the effects of
361 1.14 thorpej * the LDA, including sign-extension.
362 1.14 thorpej */
363 1.14 thorpej delta -= (int16_t)delta;
364 1.14 thorpej if (delta != 0) {
365 1.14 thorpej /*
366 1.14 thorpej * Build an LDAH instruction to adjust the
367 1.14 thorpej * high 16 bits.
368 1.14 thorpej */
369 1.14 thorpej insn[insncnt++] = 0x09 << 26 | 27 << 21 |
370 1.14 thorpej 27 << 16 | ((delta >> 16) & 0xffff);
371 1.14 thorpej rdbg(dodebug, (" LDAH $27,%d($27)",
372 1.14 thorpej (int16_t)(delta >> 16)));
373 1.14 thorpej }
374 1.14 thorpej } else {
375 1.14 thorpej int64_t dhigh;
376 1.14 thorpej
377 1.14 thorpej /* We must load the GOT entry. */
378 1.14 thorpej delta = (Elf_Addr)where - stubaddr;
379 1.14 thorpej
380 1.14 thorpej /*
381 1.14 thorpej * If the GOT entry is too far away from the PLT
382 1.14 thorpej * entry, then we can't patch up the PLT entry.
383 1.14 thorpej * This PLT entry will have to be bound for each
384 1.14 thorpej * GOT entry except for the first one. This program
385 1.14 thorpej * will still run, albeit very slowly. It is very
386 1.14 thorpej * unlikely that this case will ever happen in
387 1.14 thorpej * practice.
388 1.14 thorpej */
389 1.14 thorpej if ((int32_t)delta != delta) {
390 1.14 thorpej rdbg(dodebug,
391 1.14 thorpej (" PLT stub too far from GOT to relocate"));
392 1.14 thorpej goto out;
393 1.14 thorpej }
394 1.14 thorpej dhigh = delta - (int16_t)delta;
395 1.14 thorpej if (dhigh != 0) {
396 1.14 thorpej /*
397 1.14 thorpej * Build an LDAH instruction to adjust the
398 1.14 thorpej * high 16 bits.
399 1.14 thorpej */
400 1.14 thorpej insn[insncnt++] = 0x09 << 26 | 27 << 21 |
401 1.14 thorpej 27 << 16 | ((dhigh >> 16) & 0xffff);
402 1.14 thorpej rdbg(dodebug, (" LDAH $27,%d($27)",
403 1.14 thorpej (int16_t)(dhigh >> 16)));
404 1.14 thorpej }
405 1.14 thorpej /* Build an LDQ to load the GOT entry. */
406 1.14 thorpej insn[insncnt++] = 0x29 << 26 | 27 << 21 |
407 1.14 thorpej 27 << 16 | (delta & 0xffff);
408 1.14 thorpej rdbg(dodebug, (" LDQ $27,%d($27)",
409 1.14 thorpej (int16_t)delta));
410 1.14 thorpej }
411 1.14 thorpej
412 1.14 thorpej /*
413 1.14 thorpej * Now, build a JMP or BR insn to jump to the target. If
414 1.14 thorpej * the displacement fits in a sign-extended 21-bit field,
415 1.14 thorpej * we can use the more efficient BR insn. Otherwise, we
416 1.14 thorpej * have to jump indirect through PV.
417 1.14 thorpej */
418 1.14 thorpej pc = stubaddr + (4 * (insncnt + 1));
419 1.14 thorpej idisp = (int64_t)(new_value - pc) >> 2;
420 1.14 thorpej if (-0x100000 <= idisp && idisp < 0x100000) {
421 1.14 thorpej insn[insncnt++] = 0x30 << 26 | 31 << 21 |
422 1.14 thorpej (idisp & 0x1fffff);
423 1.15 mycroft rdbg(dodebug, (" BR $31,%p", (void *)new_value));
424 1.14 thorpej } else {
425 1.14 thorpej insn[insncnt++] = 0x1a << 26 | 31 << 21 |
426 1.14 thorpej 27 << 16 | (idisp & 0x3fff);
427 1.14 thorpej rdbg(dodebug, (" JMP $31,($27),%d",
428 1.14 thorpej (int)(idisp & 0x3fff)));
429 1.14 thorpej }
430 1.14 thorpej
431 1.14 thorpej /*
432 1.14 thorpej * Fill in the tail of the PLT entry first, for reentrancy.
433 1.14 thorpej * Until we have overwritten the first insn (an unconditional
434 1.14 thorpej * branch), the remaining insns have no effect.
435 1.14 thorpej */
436 1.14 thorpej stubptr = (uint32_t *)stubaddr;
437 1.14 thorpej while (insncnt > 1) {
438 1.14 thorpej insncnt--;
439 1.14 thorpej stubptr[insncnt] = insn[insncnt];
440 1.14 thorpej }
441 1.14 thorpej /*
442 1.14 thorpej * Commit the tail of the insn sequence to memory
443 1.14 thorpej * before overwriting the first insn.
444 1.14 thorpej */
445 1.14 thorpej __asm __volatile("wmb" ::: "memory");
446 1.14 thorpej stubptr[0] = insn[0];
447 1.14 thorpej /*
448 1.14 thorpej * I-stream will be sync'd when we either return from
449 1.14 thorpej * the binder (lazy bind case) or when the PLTGOT thunk
450 1.14 thorpej * is patched up (bind-now case).
451 1.14 thorpej */
452 1.14 thorpej }
453 1.14 thorpej
454 1.14 thorpej out:
455 1.10 mycroft *addrp = (caddr_t)new_value;
456 1.5 mycroft return 0;
457 1.1 thorpej }
458