hppa_reloc.c revision 1.22 1 1.22 chs /* $NetBSD: hppa_reloc.c,v 1.22 2005/06/05 19:08:28 chs Exp $ */
2 1.1 fredette
3 1.1 fredette /*-
4 1.21 skrll * Copyright (c) 2002, 2004 The NetBSD Foundation, Inc.
5 1.1 fredette * All rights reserved.
6 1.1 fredette *
7 1.1 fredette * This code is derived from software contributed to The NetBSD Foundation
8 1.21 skrll * by Matt Fredette and Nick Hudson.
9 1.1 fredette *
10 1.1 fredette * Redistribution and use in source and binary forms, with or without
11 1.1 fredette * modification, are permitted provided that the following conditions
12 1.1 fredette * are met:
13 1.1 fredette * 1. Redistributions of source code must retain the above copyright
14 1.1 fredette * notice, this list of conditions and the following disclaimer.
15 1.1 fredette * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 fredette * notice, this list of conditions and the following disclaimer in the
17 1.1 fredette * documentation and/or other materials provided with the distribution.
18 1.1 fredette * 3. All advertising materials mentioning features or use of this software
19 1.1 fredette * must display the following acknowledgement:
20 1.1 fredette * This product includes software developed by the NetBSD
21 1.1 fredette * Foundation, Inc. and its contributors.
22 1.1 fredette * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 fredette * contributors may be used to endorse or promote products derived
24 1.1 fredette * from this software without specific prior written permission.
25 1.1 fredette *
26 1.1 fredette * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 fredette * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 fredette * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 fredette * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 fredette * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 fredette * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 fredette * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 fredette * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 fredette * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 fredette * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 fredette * POSSIBILITY OF SUCH DAMAGE.
37 1.1 fredette */
38 1.1 fredette
39 1.1 fredette #include <stdlib.h>
40 1.1 fredette #include <sys/types.h>
41 1.1 fredette #include <sys/stat.h>
42 1.1 fredette #include <sys/queue.h>
43 1.1 fredette
44 1.1 fredette #include "rtld.h"
45 1.1 fredette #include "debug.h"
46 1.1 fredette
47 1.1 fredette #ifdef RTLD_DEBUG_HPPA
48 1.14 mycroft #define hdbg(x) xprintf x
49 1.1 fredette #else
50 1.1 fredette #define hdbg(x) /* nothing */
51 1.1 fredette #endif
52 1.12 mycroft
53 1.20 skrll caddr_t _rtld_bind(const Obj_Entry *, const Elf_Addr);
54 1.12 mycroft void _rtld_bind_start(void);
55 1.13 mycroft void __rtld_setup_hppa_pltgot(const Obj_Entry *, Elf_Addr *);
56 1.1 fredette
57 1.1 fredette /*
58 1.1 fredette * In the runtime architecture (ABI), PLABEL function
59 1.1 fredette * pointers are distinguished from normal function
60 1.1 fredette * pointers by having the next-least-significant bit
61 1.1 fredette * set. (This bit is referred to as the L field in
62 1.1 fredette * HP documentation). The $$dyncall millicode is
63 1.1 fredette * aware of this.
64 1.1 fredette */
65 1.1 fredette #define RTLD_MAKE_PLABEL(plabel) (((Elf_Addr)(plabel)) | (1 << 1))
66 1.1 fredette #define RTLD_IS_PLABEL(addr) (((Elf_Addr)(addr)) & (1 << 1))
67 1.1 fredette #define RTLD_GET_PLABEL(addr) ((hppa_plabel *) (((Elf_Addr)addr) & ~3))
68 1.1 fredette
69 1.1 fredette /*
70 1.1 fredette * This is the PLABEL structure. The function PC and
71 1.1 fredette * shared linkage members must come first, as they are
72 1.1 fredette * the actual PLABEL.
73 1.1 fredette */
74 1.1 fredette typedef struct _hppa_plabel {
75 1.1 fredette Elf_Addr hppa_plabel_pc;
76 1.1 fredette Elf_Addr hppa_plabel_sl;
77 1.1 fredette SLIST_ENTRY(_hppa_plabel) hppa_plabel_next;
78 1.1 fredette } hppa_plabel;
79 1.1 fredette
80 1.1 fredette /*
81 1.1 fredette * For now allocated PLABEL structures are tracked on a
82 1.1 fredette * singly linked list. This maybe should be revisited.
83 1.1 fredette */
84 1.1 fredette static SLIST_HEAD(hppa_plabel_head, _hppa_plabel) hppa_plabel_list
85 1.1 fredette = SLIST_HEAD_INITIALIZER(hppa_plabel_list);
86 1.1 fredette
87 1.1 fredette /*
88 1.1 fredette * Because I'm hesitant to use NEW while relocating self,
89 1.1 fredette * this is a small pool of preallocated PLABELs.
90 1.1 fredette */
91 1.20 skrll #define HPPA_PLABEL_PRE (12)
92 1.1 fredette static hppa_plabel hppa_plabel_pre[HPPA_PLABEL_PRE];
93 1.1 fredette static int hppa_plabel_pre_next = 0;
94 1.1 fredette
95 1.20 skrll void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
96 1.20 skrll int _rtld_relocate_plt_objects(const Obj_Entry *);
97 1.1 fredette /*
98 1.1 fredette * This bootstraps the dynamic linker by relocating its GOT.
99 1.1 fredette * On the hppa, unlike on other architectures, static strings
100 1.1 fredette * are found through the GOT. Static strings are essential
101 1.1 fredette * for RTLD_DEBUG, and I suspect they're used early even when
102 1.1 fredette * !defined(RTLD_DEBUG), making relocating the GOT essential.
103 1.1 fredette *
104 1.1 fredette * It gets worse. Relocating the GOT doesn't mean just walking
105 1.1 fredette * it and adding the relocbase to all of the entries. You must
106 1.1 fredette * find and use the GOT relocations, since those RELA relocations
107 1.1 fredette * have the necessary addends - the GOT comes initialized as
108 1.1 fredette * zeroes.
109 1.1 fredette */
110 1.1 fredette void
111 1.20 skrll _rtld_relocate_nonplt_self(Elf_Dyn *dynp, Elf_Addr relocbase)
112 1.1 fredette {
113 1.1 fredette const Elf_Rela *relafirst, *rela, *relalim;
114 1.22 chs Elf_Addr relasz;
115 1.1 fredette Elf_Addr where;
116 1.20 skrll Elf_Addr *pltgot;
117 1.20 skrll const Elf_Rela *plabel_relocs[HPPA_PLABEL_PRE];
118 1.20 skrll int nplabel_relocs = 0;
119 1.20 skrll int i;
120 1.20 skrll const Elf_Sym *symtab, *sym;
121 1.20 skrll unsigned long symnum;
122 1.20 skrll hppa_plabel *plabel;
123 1.1 fredette
124 1.22 chs /*
125 1.22 chs * Process the DYNAMIC section, looking for the non-PLT relocations.
126 1.1 fredette */
127 1.1 fredette relafirst = NULL;
128 1.22 chs relasz = 0;
129 1.22 chs symtab = NULL;
130 1.22 chs pltgot = NULL;
131 1.1 fredette for (; dynp->d_tag != DT_NULL; ++dynp) {
132 1.1 fredette switch (dynp->d_tag) {
133 1.1 fredette
134 1.1 fredette case DT_RELA:
135 1.1 fredette relafirst = (const Elf_Rela *)
136 1.1 fredette (relocbase + dynp->d_un.d_ptr);
137 1.1 fredette break;
138 1.1 fredette
139 1.1 fredette case DT_RELASZ:
140 1.1 fredette relasz = dynp->d_un.d_val;
141 1.1 fredette break;
142 1.20 skrll
143 1.20 skrll case DT_SYMTAB:
144 1.20 skrll symtab = (const Elf_Sym *)
145 1.20 skrll (relocbase + dynp->d_un.d_ptr);
146 1.20 skrll break;
147 1.20 skrll
148 1.20 skrll case DT_PLTGOT:
149 1.20 skrll pltgot = (Elf_Addr *)
150 1.20 skrll (relocbase + dynp->d_un.d_ptr);
151 1.20 skrll break;
152 1.1 fredette }
153 1.1 fredette }
154 1.1 fredette relalim = (const Elf_Rela *)((caddr_t)relafirst + relasz);
155 1.1 fredette
156 1.18 skrll for (rela = relafirst; rela < relalim; rela++) {
157 1.20 skrll symnum = ELF_R_SYM(rela->r_info);
158 1.1 fredette where = (Elf_Addr)(relocbase + rela->r_offset);
159 1.20 skrll
160 1.20 skrll switch (ELF_R_TYPE(rela->r_info)) {
161 1.20 skrll case R_TYPE(DIR32):
162 1.20 skrll if (symnum == 0)
163 1.20 skrll *((Elf_Addr *)where) = relocbase + rela->r_addend;
164 1.20 skrll else {
165 1.20 skrll sym = symtab + symnum;
166 1.20 skrll *((Elf_Addr *)where) =
167 1.20 skrll relocbase + rela->r_addend + sym->st_value;
168 1.20 skrll }
169 1.20 skrll break;
170 1.20 skrll
171 1.20 skrll case R_TYPE(PLABEL32):
172 1.20 skrll /*
173 1.20 skrll * PLABEL32 relocation processing is done in two phases
174 1.20 skrll *
175 1.20 skrll * i) local function relocations (symbol number == 0)
176 1.20 skrll * can be resolved immediately.
177 1.20 skrll *
178 1.20 skrll * ii) external function relocations are deferred until
179 1.20 skrll * we finish all other relocations so that global
180 1.20 skrll * data isn't accessed until all other non-PLT
181 1.20 skrll * relocations have been done.
182 1.20 skrll */
183 1.20 skrll if (symnum == 0)
184 1.20 skrll *((Elf_Addr *)where) =
185 1.20 skrll relocbase + rela->r_addend;
186 1.20 skrll else
187 1.20 skrll plabel_relocs[nplabel_relocs++] = rela;
188 1.20 skrll break;
189 1.20 skrll
190 1.20 skrll default:
191 1.20 skrll break;
192 1.20 skrll }
193 1.1 fredette }
194 1.1 fredette
195 1.20 skrll assert(nplabel_relocs < HPPA_PLABEL_PRE);
196 1.20 skrll for (i = 0; i < nplabel_relocs; i++) {
197 1.20 skrll rela = plabel_relocs[i];
198 1.20 skrll where = (Elf_Addr)(relocbase + rela->r_offset);
199 1.20 skrll sym = symtab + ELF_R_SYM(rela->r_info);
200 1.20 skrll
201 1.20 skrll plabel = &hppa_plabel_pre[hppa_plabel_pre_next++];
202 1.20 skrll
203 1.20 skrll plabel->hppa_plabel_pc = (Elf_Addr)
204 1.20 skrll (relocbase + sym->st_value + rela->r_addend);
205 1.20 skrll plabel->hppa_plabel_sl = (Elf_Addr)pltgot;
206 1.20 skrll
207 1.20 skrll SLIST_INSERT_HEAD(&hppa_plabel_list, plabel, hppa_plabel_next);
208 1.20 skrll *((Elf_Addr *)where) = (Elf_Addr)(RTLD_MAKE_PLABEL(plabel));
209 1.20 skrll }
210 1.20 skrll
211 1.1 fredette #if defined(RTLD_DEBUG_HPPA)
212 1.18 skrll for (rela = relafirst; rela < relalim; rela++) {
213 1.1 fredette where = (Elf_Addr)(relocbase + rela->r_offset);
214 1.20 skrll
215 1.20 skrll switch (ELF_R_TYPE(rela->r_info)) {
216 1.20 skrll case R_TYPE(DIR32):
217 1.20 skrll hdbg(("DIR32 rela @%p(%p) -> %p(%p)\n",
218 1.1 fredette (void *)rela->r_offset,
219 1.1 fredette (void *)where,
220 1.1 fredette (void *)rela->r_addend,
221 1.20 skrll (void *)*((Elf_Addr *)where) ));
222 1.20 skrll break;
223 1.20 skrll
224 1.20 skrll case R_TYPE(PLABEL32):
225 1.20 skrll symnum = ELF_R_SYM(rela->r_info);
226 1.20 skrll if (symnum == 0) {
227 1.20 skrll hdbg(("PLABEL rela @%p(%p) -> %p(%p)\n",
228 1.20 skrll (void *)rela->r_offset,
229 1.20 skrll (void *)where,
230 1.20 skrll (void *)rela->r_addend,
231 1.20 skrll (void *)*((Elf_Addr *)where) ));
232 1.20 skrll } else {
233 1.20 skrll sym = symtab + symnum;
234 1.20 skrll
235 1.20 skrll hdbg(("PLABEL32 rela @%p(%p), symnum=%ld(%p) -> %p(%p)\n",
236 1.20 skrll (void *)rela->r_offset,
237 1.20 skrll (void *)where,
238 1.20 skrll symnum,
239 1.20 skrll (void *)sym->st_value,
240 1.20 skrll (void *)rela->r_addend,
241 1.20 skrll (void *)*((Elf_Addr *)where) ));
242 1.20 skrll }
243 1.20 skrll break;
244 1.20 skrll default:
245 1.20 skrll hdbg(("rela XXX reloc\n"));
246 1.20 skrll break;
247 1.20 skrll }
248 1.1 fredette }
249 1.1 fredette #endif /* RTLD_DEBUG_HPPA */
250 1.1 fredette }
251 1.1 fredette
252 1.1 fredette /*
253 1.1 fredette * This allocates a PLABEL. If called with a non-NULL def, the
254 1.1 fredette * plabel is for the function associated with that definition
255 1.1 fredette * in the defining object defobj, plus the given addend. If
256 1.1 fredette * called with a NULL def, the plabel is for the function at
257 1.1 fredette * the (unrelocated) address in addend in the object defobj.
258 1.1 fredette */
259 1.1 fredette Elf_Addr
260 1.1 fredette _rtld_function_descriptor_alloc(const Obj_Entry *defobj, const Elf_Sym *def,
261 1.1 fredette Elf_Addr addend)
262 1.1 fredette {
263 1.1 fredette Elf_Addr func_pc, func_sl;
264 1.1 fredette hppa_plabel *plabel;
265 1.1 fredette
266 1.1 fredette if (def != NULL) {
267 1.1 fredette
268 1.1 fredette /*
269 1.1 fredette * We assume that symbols of type STT_NOTYPE
270 1.1 fredette * are undefined. Return NULL for these.
271 1.1 fredette */
272 1.1 fredette if (ELF_ST_TYPE(def->st_info) == STT_NOTYPE)
273 1.1 fredette return (Elf_Addr)NULL;
274 1.1 fredette
275 1.1 fredette /* Otherwise assert that this symbol must be a function. */
276 1.1 fredette assert(ELF_ST_TYPE(def->st_info) == STT_FUNC);
277 1.1 fredette
278 1.1 fredette func_pc = (Elf_Addr)(defobj->relocbase + def->st_value +
279 1.1 fredette addend);
280 1.1 fredette } else
281 1.1 fredette func_pc = (Elf_Addr)(defobj->relocbase + addend);
282 1.1 fredette
283 1.1 fredette /*
284 1.1 fredette * Search the existing PLABELs for one matching
285 1.1 fredette * this function. If there is one, return it.
286 1.1 fredette */
287 1.20 skrll func_sl = (Elf_Addr)(defobj->pltgot);
288 1.1 fredette SLIST_FOREACH(plabel, &hppa_plabel_list, hppa_plabel_next)
289 1.1 fredette if (plabel->hppa_plabel_pc == func_pc &&
290 1.1 fredette plabel->hppa_plabel_sl == func_sl)
291 1.1 fredette return RTLD_MAKE_PLABEL(plabel);
292 1.1 fredette
293 1.1 fredette /*
294 1.1 fredette * Once we've used up the preallocated set, we start
295 1.1 fredette * using NEW to allocate plabels.
296 1.1 fredette */
297 1.1 fredette if (hppa_plabel_pre_next < HPPA_PLABEL_PRE)
298 1.1 fredette plabel = &hppa_plabel_pre[hppa_plabel_pre_next++];
299 1.1 fredette else {
300 1.1 fredette plabel = NEW(hppa_plabel);
301 1.1 fredette if (plabel == NULL)
302 1.1 fredette return (Elf_Addr)-1;
303 1.1 fredette }
304 1.1 fredette
305 1.1 fredette /* Fill the new entry and insert it on the list. */
306 1.1 fredette plabel->hppa_plabel_pc = func_pc;
307 1.1 fredette plabel->hppa_plabel_sl = func_sl;
308 1.1 fredette SLIST_INSERT_HEAD(&hppa_plabel_list, plabel, hppa_plabel_next);
309 1.1 fredette
310 1.1 fredette return RTLD_MAKE_PLABEL(plabel);
311 1.1 fredette }
312 1.1 fredette
313 1.1 fredette /*
314 1.1 fredette * If a pointer is a PLABEL, this unwraps it.
315 1.1 fredette */
316 1.1 fredette const void *
317 1.1 fredette _rtld_function_descriptor_function(const void *addr)
318 1.1 fredette {
319 1.1 fredette return (RTLD_IS_PLABEL(addr) ?
320 1.1 fredette (const void *) RTLD_GET_PLABEL(addr)->hppa_plabel_pc :
321 1.1 fredette addr);
322 1.1 fredette }
323 1.1 fredette
324 1.2 mycroft /* This sets up an object's GOT. */
325 1.2 mycroft void
326 1.2 mycroft _rtld_setup_pltgot(const Obj_Entry *obj)
327 1.2 mycroft {
328 1.20 skrll __rtld_setup_hppa_pltgot(obj, obj->pltgot);
329 1.4 mycroft }
330 1.4 mycroft
331 1.4 mycroft int
332 1.16 skrll _rtld_relocate_nonplt_objects(const Obj_Entry *obj)
333 1.4 mycroft {
334 1.5 mycroft const Elf_Rela *rela;
335 1.5 mycroft
336 1.5 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
337 1.5 mycroft Elf_Addr *where;
338 1.5 mycroft const Elf_Sym *def;
339 1.5 mycroft const Obj_Entry *defobj;
340 1.5 mycroft Elf_Addr tmp;
341 1.6 mycroft unsigned long symnum;
342 1.5 mycroft
343 1.5 mycroft where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
344 1.6 mycroft symnum = ELF_R_SYM(rela->r_info);
345 1.5 mycroft
346 1.5 mycroft switch (ELF_R_TYPE(rela->r_info)) {
347 1.5 mycroft case R_TYPE(NONE):
348 1.5 mycroft break;
349 1.4 mycroft
350 1.5 mycroft case R_TYPE(DIR32):
351 1.6 mycroft if (symnum) {
352 1.5 mycroft /*
353 1.5 mycroft * This is either a DIR32 against a symbol
354 1.5 mycroft * (def->st_name != 0), or against a local
355 1.5 mycroft * section (def->st_name == 0).
356 1.5 mycroft */
357 1.6 mycroft def = obj->symtab + symnum;
358 1.5 mycroft defobj = obj;
359 1.5 mycroft if (def->st_name != 0)
360 1.6 mycroft def = _rtld_find_symdef(symnum, obj,
361 1.6 mycroft &defobj, false);
362 1.5 mycroft if (def == NULL)
363 1.5 mycroft return -1;
364 1.4 mycroft
365 1.5 mycroft tmp = (Elf_Addr)(defobj->relocbase +
366 1.5 mycroft def->st_value + rela->r_addend);
367 1.4 mycroft
368 1.5 mycroft if (*where != tmp)
369 1.5 mycroft *where = tmp;
370 1.14 mycroft rdbg(("DIR32 %s in %s --> %p in %s",
371 1.7 mycroft obj->strtab + obj->symtab[symnum].st_name,
372 1.7 mycroft obj->path, (void *)*where, defobj->path));
373 1.5 mycroft } else {
374 1.5 mycroft tmp = (Elf_Addr)(obj->relocbase +
375 1.5 mycroft rela->r_addend);
376 1.5 mycroft
377 1.20 skrll if (*where != tmp)
378 1.20 skrll *where = tmp;
379 1.20 skrll rdbg(("DIR32 in %s --> %p", obj->path,
380 1.14 mycroft (void *)*where));
381 1.5 mycroft }
382 1.5 mycroft break;
383 1.5 mycroft
384 1.5 mycroft case R_TYPE(PLABEL32):
385 1.6 mycroft if (symnum) {
386 1.6 mycroft def = _rtld_find_symdef(symnum, obj, &defobj,
387 1.6 mycroft false);
388 1.5 mycroft if (def == NULL)
389 1.5 mycroft return -1;
390 1.4 mycroft
391 1.19 skrll tmp = _rtld_function_descriptor_alloc(defobj,
392 1.19 skrll def, rela->r_addend);
393 1.5 mycroft if (tmp == (Elf_Addr)-1)
394 1.5 mycroft return -1;
395 1.4 mycroft
396 1.4 mycroft if (*where != tmp)
397 1.4 mycroft *where = tmp;
398 1.14 mycroft rdbg(("PLABEL32 %s in %s --> %p in %s",
399 1.7 mycroft obj->strtab + obj->symtab[symnum].st_name,
400 1.7 mycroft obj->path, (void *)*where, defobj->path));
401 1.5 mycroft } else {
402 1.5 mycroft /*
403 1.5 mycroft * This is a PLABEL for a static function, and
404 1.5 mycroft * the dynamic linker has both allocated a PLT
405 1.5 mycroft * entry for this function and told us where it
406 1.5 mycroft * is. We can safely use the PLT entry as the
407 1.5 mycroft * PLABEL because there should be no other
408 1.5 mycroft * PLABEL reloc referencing this function.
409 1.5 mycroft * This object should also have an IPLT
410 1.5 mycroft * relocation to initialize the PLT entry.
411 1.5 mycroft *
412 1.5 mycroft * The dynamic linker should also have ensured
413 1.5 mycroft * that the addend has the
414 1.5 mycroft * next-least-significant bit set; the
415 1.5 mycroft * $$dyncall millicode uses this to distinguish
416 1.5 mycroft * a PLABEL pointer from a plain function
417 1.5 mycroft * pointer.
418 1.5 mycroft */
419 1.19 skrll tmp = (Elf_Addr)
420 1.19 skrll (obj->relocbase + rela->r_addend);
421 1.5 mycroft
422 1.5 mycroft if (*where != tmp)
423 1.5 mycroft *where = tmp;
424 1.14 mycroft rdbg(("PLABEL32 in %s --> %p", obj->path,
425 1.14 mycroft (void *)*where));
426 1.5 mycroft }
427 1.5 mycroft break;
428 1.4 mycroft
429 1.5 mycroft case R_TYPE(COPY):
430 1.4 mycroft /*
431 1.5 mycroft * These are deferred until all other relocations have
432 1.5 mycroft * been done. All we do here is make sure that the
433 1.5 mycroft * COPY relocation is not in a shared library. They
434 1.5 mycroft * are allowed only in executable files.
435 1.4 mycroft */
436 1.10 mycroft if (obj->isdynamic) {
437 1.5 mycroft _rtld_error(
438 1.5 mycroft "%s: Unexpected R_COPY relocation in shared library",
439 1.5 mycroft obj->path);
440 1.4 mycroft return -1;
441 1.5 mycroft }
442 1.14 mycroft rdbg(("COPY (avoid in main)"));
443 1.5 mycroft break;
444 1.4 mycroft
445 1.5 mycroft default:
446 1.14 mycroft rdbg(("sym = %lu, type = %lu, offset = %p, "
447 1.5 mycroft "addend = %p, contents = %p, symbol = %s",
448 1.6 mycroft symnum, (u_long)ELF_R_TYPE(rela->r_info),
449 1.5 mycroft (void *)rela->r_offset, (void *)rela->r_addend,
450 1.5 mycroft (void *)*where,
451 1.6 mycroft obj->strtab + obj->symtab[symnum].st_name));
452 1.5 mycroft _rtld_error("%s: Unsupported relocation type %ld "
453 1.5 mycroft "in non-PLT relocations\n",
454 1.5 mycroft obj->path, (u_long) ELF_R_TYPE(rela->r_info));
455 1.4 mycroft return -1;
456 1.4 mycroft }
457 1.8 mycroft }
458 1.8 mycroft return 0;
459 1.8 mycroft }
460 1.8 mycroft
461 1.8 mycroft int
462 1.16 skrll _rtld_relocate_plt_lazy(const Obj_Entry *obj)
463 1.8 mycroft {
464 1.8 mycroft const Elf_Rela *rela;
465 1.8 mycroft
466 1.8 mycroft for (rela = obj->pltrela; rela < obj->pltrelalim; rela++) {
467 1.8 mycroft Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
468 1.8 mycroft Elf_Addr func_pc, func_sl;
469 1.8 mycroft
470 1.8 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(IPLT));
471 1.8 mycroft
472 1.8 mycroft /*
473 1.8 mycroft * If this is an IPLT reloc for a static function,
474 1.8 mycroft * fully resolve the PLT entry now.
475 1.8 mycroft */
476 1.8 mycroft if (ELF_R_SYM(rela->r_info) == 0) {
477 1.8 mycroft func_pc = (Elf_Addr)(obj->relocbase + rela->r_addend);
478 1.20 skrll func_sl = (Elf_Addr)(obj->pltgot);
479 1.8 mycroft }
480 1.8 mycroft
481 1.8 mycroft /*
482 1.8 mycroft * Otherwise set up for lazy binding.
483 1.8 mycroft */
484 1.8 mycroft else {
485 1.8 mycroft /*
486 1.8 mycroft * This function pointer points to the PLT
487 1.8 mycroft * stub added by the linker, and instead of
488 1.8 mycroft * a shared linkage value, we stash this
489 1.8 mycroft * relocation's offset. The PLT stub has
490 1.8 mycroft * already been set up to transfer to
491 1.8 mycroft * _rtld_bind_start.
492 1.8 mycroft */
493 1.20 skrll func_pc = ((Elf_Addr)(obj->pltgot)) - 16;
494 1.19 skrll func_sl = (Elf_Addr)
495 1.20 skrll ((caddr_t)rela - (caddr_t)(obj->pltrela));
496 1.8 mycroft }
497 1.20 skrll rdbg(("lazy bind %s(%p) --> old=(%p,%p) new=(%p,%p)",
498 1.20 skrll obj->path,
499 1.20 skrll (void *)where,
500 1.20 skrll (void *)where[0], (void *)where[1],
501 1.20 skrll (void *)func_pc, (void *)func_sl));
502 1.8 mycroft
503 1.8 mycroft /*
504 1.8 mycroft * Fill this PLT entry and return.
505 1.8 mycroft */
506 1.8 mycroft where[0] = func_pc;
507 1.8 mycroft where[1] = func_sl;
508 1.4 mycroft }
509 1.4 mycroft return 0;
510 1.1 fredette }
511 1.20 skrll
512 1.20 skrll caddr_t
513 1.20 skrll _rtld_bind(const Obj_Entry *obj, Elf_Addr reloff)
514 1.20 skrll {
515 1.20 skrll const Elf_Rela *rela = (const Elf_Rela *)((caddr_t)obj->pltrela + reloff);
516 1.20 skrll Elf_Word *where = (Elf_Word *)(obj->relocbase + rela->r_offset);
517 1.20 skrll const Elf_Sym *def;
518 1.20 skrll const Obj_Entry *defobj;
519 1.20 skrll Elf_Addr func_pc, func_sl;
520 1.20 skrll
521 1.20 skrll assert(ELF_R_TYPE(rela->r_info) == R_TYPE(IPLT));
522 1.20 skrll assert(ELF_R_SYM(rela->r_info) != 0);
523 1.20 skrll
524 1.20 skrll def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true);
525 1.20 skrll if (def == NULL)
526 1.20 skrll _rtld_die();
527 1.20 skrll
528 1.20 skrll func_pc = (Elf_Addr)(defobj->relocbase + def->st_value + rela->r_addend);
529 1.20 skrll func_sl = (Elf_Addr)(defobj->pltgot);
530 1.20 skrll
531 1.20 skrll rdbg(("bind now/fixup in %s --> old=(%p,%p) new=(%p,%p)",
532 1.20 skrll defobj->strtab + def->st_name,
533 1.20 skrll (void *)where[0], (void *)where[1],
534 1.20 skrll (void *)func_pc, (void *)func_sl));
535 1.20 skrll /*
536 1.20 skrll * Fill this PLT entry and return.
537 1.20 skrll */
538 1.20 skrll if (where[0] != func_pc)
539 1.20 skrll where[0] = func_pc;
540 1.20 skrll if (where[1] != func_sl)
541 1.20 skrll where[1] = func_sl;
542 1.20 skrll
543 1.20 skrll return (caddr_t)where;
544 1.20 skrll }
545 1.20 skrll
546 1.20 skrll int
547 1.20 skrll _rtld_relocate_plt_objects(const Obj_Entry *obj)
548 1.20 skrll {
549 1.20 skrll const Elf_Rela *rela;
550 1.20 skrll
551 1.20 skrll for (rela = obj->pltrela; rela < obj->pltrelalim; rela++) {
552 1.20 skrll Elf_Addr *where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
553 1.20 skrll const Elf_Sym *def;
554 1.20 skrll const Obj_Entry *defobj;
555 1.20 skrll Elf_Addr func_pc, func_sl;
556 1.20 skrll
557 1.20 skrll assert(ELF_R_TYPE(rela->r_info) == R_TYPE(IPLT));
558 1.20 skrll
559 1.20 skrll if (ELF_R_SYM(rela->r_info) == 0) {
560 1.20 skrll func_pc = (Elf_Addr)(obj->relocbase + rela->r_addend);
561 1.20 skrll func_sl = (Elf_Addr)(obj->pltgot);
562 1.20 skrll } else {
563 1.20 skrll def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj,
564 1.20 skrll true);
565 1.20 skrll if (def == NULL)
566 1.20 skrll return -1;
567 1.20 skrll func_pc = (Elf_Addr)(defobj->relocbase + def->st_value +
568 1.20 skrll rela->r_addend);
569 1.20 skrll func_sl = (Elf_Addr)(defobj->pltgot);
570 1.20 skrll rdbg(("bind now/fixup in %s --> old=(%p,%p) new=(%p,%p)",
571 1.20 skrll defobj->strtab + def->st_name,
572 1.20 skrll (void *)where[0], (void *)where[1],
573 1.20 skrll (void *)func_pc, (void *)func_sl));
574 1.20 skrll }
575 1.20 skrll
576 1.20 skrll /*
577 1.20 skrll * Fill this PLT entry and return.
578 1.20 skrll */
579 1.20 skrll if (where[0] != func_pc)
580 1.20 skrll where[0] = func_pc;
581 1.20 skrll if (where[1] != func_sl)
582 1.20 skrll where[1] = func_sl;
583 1.20 skrll }
584 1.20 skrll return 0;
585 1.20 skrll }
586