ppc_reloc.c revision 1.46 1 1.46 matt /* $NetBSD: ppc_reloc.c,v 1.46 2011/01/16 01:22:29 matt Exp $ */
2 1.1 tsubai
3 1.1 tsubai /*-
4 1.1 tsubai * Copyright (C) 1998 Tsubai Masanari
5 1.32 mycroft * Portions copyright 2002 Charles M. Hannum <root (at) ihack.net>
6 1.1 tsubai * All rights reserved.
7 1.1 tsubai *
8 1.1 tsubai * Redistribution and use in source and binary forms, with or without
9 1.1 tsubai * modification, are permitted provided that the following conditions
10 1.1 tsubai * are met:
11 1.1 tsubai * 1. Redistributions of source code must retain the above copyright
12 1.1 tsubai * notice, this list of conditions and the following disclaimer.
13 1.1 tsubai * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 tsubai * notice, this list of conditions and the following disclaimer in the
15 1.1 tsubai * documentation and/or other materials provided with the distribution.
16 1.1 tsubai * 3. The name of the author may not be used to endorse or promote products
17 1.1 tsubai * derived from this software without specific prior written permission.
18 1.1 tsubai *
19 1.1 tsubai * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 1.1 tsubai * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 1.1 tsubai * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 1.1 tsubai * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 1.1 tsubai * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 1.1 tsubai * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 1.1 tsubai * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 1.1 tsubai * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 1.1 tsubai * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 1.1 tsubai * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 1.1 tsubai */
30 1.1 tsubai
31 1.37 skrll #include <sys/cdefs.h>
32 1.37 skrll #ifndef lint
33 1.46 matt __RCSID("$NetBSD: ppc_reloc.c,v 1.46 2011/01/16 01:22:29 matt Exp $");
34 1.37 skrll #endif /* not lint */
35 1.37 skrll
36 1.1 tsubai #include <stdarg.h>
37 1.1 tsubai #include <stdio.h>
38 1.1 tsubai #include <stdlib.h>
39 1.1 tsubai #include <string.h>
40 1.1 tsubai #include <sys/types.h>
41 1.1 tsubai #include <machine/cpu.h>
42 1.1 tsubai
43 1.1 tsubai #include "debug.h"
44 1.1 tsubai #include "rtld.h"
45 1.1 tsubai
46 1.35 skrll void _rtld_powerpc_pltcall(Elf_Word);
47 1.35 skrll void _rtld_powerpc_pltresolve(Elf_Word, Elf_Word);
48 1.1 tsubai
49 1.1 tsubai #define ha(x) ((((u_int32_t)(x) & 0x8000) ? \
50 1.1 tsubai ((u_int32_t)(x) + 0x10000) : (u_int32_t)(x)) >> 16)
51 1.1 tsubai #define l(x) ((u_int32_t)(x) & 0xffff)
52 1.1 tsubai
53 1.46 matt void _rtld_bind_bssplt_start(void);
54 1.46 matt void _rtld_bind_secureplt_start(void);
55 1.22 mycroft void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
56 1.35 skrll caddr_t _rtld_bind(const Obj_Entry *, Elf_Word);
57 1.46 matt static int _rtld_relocate_plt_object(const Obj_Entry *,
58 1.36 skrll const Elf_Rela *, int, Elf_Addr *);
59 1.1 tsubai
60 1.1 tsubai /*
61 1.39 chs * The PPC PLT format consists of three sections:
62 1.39 chs * (1) The "pltcall" and "pltresolve" glue code. This is always 18 words.
63 1.39 chs * (2) The code part of the PLT entries. There are 2 words per entry for
64 1.39 chs * up to 8192 entries, then 4 words per entry for any additional entries.
65 1.39 chs * (3) The data part of the PLT entries, comprising a jump table.
66 1.39 chs * This section is half the size of the second section (ie. 1 or 2 words
67 1.39 chs * per entry).
68 1.39 chs */
69 1.39 chs
70 1.39 chs /*
71 1.46 matt * Setup the plt glue routines (for bss-plt).
72 1.1 tsubai */
73 1.1 tsubai #define PLTCALL_SIZE 20
74 1.1 tsubai #define PLTRESOLVE_SIZE 24
75 1.1 tsubai
76 1.1 tsubai void
77 1.35 skrll _rtld_setup_pltgot(const Obj_Entry *obj)
78 1.1 tsubai {
79 1.39 chs /*
80 1.46 matt * Secure-PLT is much more sane.
81 1.39 chs */
82 1.46 matt if (obj->gotptr != NULL) {
83 1.46 matt obj->gotptr[1] = (Elf_Addr) _rtld_bind_secureplt_start;
84 1.46 matt obj->gotptr[2] = (Elf_Addr) obj;
85 1.46 matt } else {
86 1.46 matt Elf_Word *pltcall, *pltresolve;
87 1.46 matt Elf_Word *jmptab;
88 1.46 matt int N = obj->pltrelalim - obj->pltrela;
89 1.46 matt
90 1.46 matt /* Entries beyond 8192 take twice as much space. */
91 1.46 matt if (N > 8192)
92 1.46 matt N += N-8192;
93 1.46 matt
94 1.46 matt pltcall = obj->pltgot;
95 1.46 matt jmptab = pltcall + 18 + N * 2;
96 1.46 matt
97 1.46 matt memcpy(pltcall, _rtld_powerpc_pltcall, PLTCALL_SIZE);
98 1.46 matt pltcall[1] |= ha(jmptab);
99 1.46 matt pltcall[2] |= l(jmptab);
100 1.46 matt
101 1.46 matt pltresolve = obj->pltgot + 8;
102 1.46 matt
103 1.46 matt memcpy(pltresolve, _rtld_powerpc_pltresolve, PLTRESOLVE_SIZE);
104 1.46 matt pltresolve[0] |= ha(_rtld_bind_bssplt_start);
105 1.46 matt pltresolve[1] |= l(_rtld_bind_bssplt_start);
106 1.46 matt pltresolve[3] |= ha(obj);
107 1.46 matt pltresolve[4] |= l(obj);
108 1.46 matt
109 1.46 matt /*
110 1.46 matt * Invalidate the icache for only the code part of the PLT
111 1.46 matt * (and not the jump table at the end).
112 1.46 matt */
113 1.46 matt __syncicache(pltcall, (char *)jmptab - (char *)pltcall);
114 1.46 matt }
115 1.13 mycroft }
116 1.13 mycroft
117 1.22 mycroft void
118 1.35 skrll _rtld_relocate_nonplt_self(Elf_Dyn *dynp, Elf_Addr relocbase)
119 1.22 mycroft {
120 1.22 mycroft const Elf_Rela *rela = 0, *relalim;
121 1.22 mycroft Elf_Addr relasz = 0;
122 1.22 mycroft Elf_Addr *where;
123 1.22 mycroft
124 1.22 mycroft for (; dynp->d_tag != DT_NULL; dynp++) {
125 1.22 mycroft switch (dynp->d_tag) {
126 1.22 mycroft case DT_RELA:
127 1.22 mycroft rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr);
128 1.22 mycroft break;
129 1.22 mycroft case DT_RELASZ:
130 1.22 mycroft relasz = dynp->d_un.d_val;
131 1.22 mycroft break;
132 1.22 mycroft }
133 1.22 mycroft }
134 1.42 he relalim = (const Elf_Rela *)((const uint8_t *)rela + relasz);
135 1.22 mycroft for (; rela < relalim; rela++) {
136 1.22 mycroft where = (Elf_Addr *)(relocbase + rela->r_offset);
137 1.22 mycroft *where = (Elf_Addr)(relocbase + rela->r_addend);
138 1.22 mycroft }
139 1.22 mycroft }
140 1.22 mycroft
141 1.13 mycroft int
142 1.45 joerg _rtld_relocate_nonplt_objects(Obj_Entry *obj)
143 1.13 mycroft {
144 1.14 mycroft const Elf_Rela *rela;
145 1.22 mycroft
146 1.14 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
147 1.14 mycroft Elf_Addr *where;
148 1.14 mycroft const Elf_Sym *def;
149 1.14 mycroft const Obj_Entry *defobj;
150 1.14 mycroft Elf_Addr tmp;
151 1.15 mycroft unsigned long symnum;
152 1.14 mycroft
153 1.14 mycroft where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
154 1.15 mycroft symnum = ELF_R_SYM(rela->r_info);
155 1.13 mycroft
156 1.14 mycroft switch (ELF_R_TYPE(rela->r_info)) {
157 1.26 mycroft #if 1 /* XXX Should not be necessary. */
158 1.26 mycroft case R_TYPE(JMP_SLOT):
159 1.26 mycroft #endif
160 1.14 mycroft case R_TYPE(NONE):
161 1.14 mycroft break;
162 1.14 mycroft
163 1.14 mycroft case R_TYPE(32): /* word32 S + A */
164 1.14 mycroft case R_TYPE(GLOB_DAT): /* word32 S + A */
165 1.15 mycroft def = _rtld_find_symdef(symnum, obj, &defobj, false);
166 1.14 mycroft if (def == NULL)
167 1.14 mycroft return -1;
168 1.14 mycroft
169 1.14 mycroft tmp = (Elf_Addr)(defobj->relocbase + def->st_value +
170 1.14 mycroft rela->r_addend);
171 1.14 mycroft if (*where != tmp)
172 1.14 mycroft *where = tmp;
173 1.24 mycroft rdbg(("32/GLOB_DAT %s in %s --> %p in %s",
174 1.16 mycroft obj->strtab + obj->symtab[symnum].st_name,
175 1.16 mycroft obj->path, (void *)*where, defobj->path));
176 1.14 mycroft break;
177 1.14 mycroft
178 1.14 mycroft case R_TYPE(RELATIVE): /* word32 B + A */
179 1.22 mycroft *where = (Elf_Addr)(obj->relocbase + rela->r_addend);
180 1.24 mycroft rdbg(("RELATIVE in %s --> %p", obj->path,
181 1.14 mycroft (void *)*where));
182 1.14 mycroft break;
183 1.14 mycroft
184 1.14 mycroft case R_TYPE(COPY):
185 1.14 mycroft /*
186 1.14 mycroft * These are deferred until all other relocations have
187 1.14 mycroft * been done. All we do here is make sure that the
188 1.14 mycroft * COPY relocation is not in a shared library. They
189 1.14 mycroft * are allowed only in executable files.
190 1.14 mycroft */
191 1.20 mycroft if (obj->isdynamic) {
192 1.14 mycroft _rtld_error(
193 1.13 mycroft "%s: Unexpected R_COPY relocation in shared library",
194 1.14 mycroft obj->path);
195 1.14 mycroft return -1;
196 1.14 mycroft }
197 1.24 mycroft rdbg(("COPY (avoid in main)"));
198 1.14 mycroft break;
199 1.14 mycroft
200 1.14 mycroft default:
201 1.24 mycroft rdbg(("sym = %lu, type = %lu, offset = %p, "
202 1.14 mycroft "addend = %p, contents = %p, symbol = %s",
203 1.15 mycroft symnum, (u_long)ELF_R_TYPE(rela->r_info),
204 1.14 mycroft (void *)rela->r_offset, (void *)rela->r_addend,
205 1.14 mycroft (void *)*where,
206 1.15 mycroft obj->strtab + obj->symtab[symnum].st_name));
207 1.14 mycroft _rtld_error("%s: Unsupported relocation type %ld "
208 1.43 jmmv "in non-PLT relocations",
209 1.14 mycroft obj->path, (u_long) ELF_R_TYPE(rela->r_info));
210 1.13 mycroft return -1;
211 1.13 mycroft }
212 1.13 mycroft }
213 1.17 mycroft return 0;
214 1.17 mycroft }
215 1.17 mycroft
216 1.17 mycroft int
217 1.35 skrll _rtld_relocate_plt_lazy(const Obj_Entry *obj)
218 1.17 mycroft {
219 1.46 matt Elf_Addr * const pltresolve = obj->pltgot + 8;
220 1.17 mycroft const Elf_Rela *rela;
221 1.28 mycroft int reloff;
222 1.17 mycroft
223 1.46 matt for (rela = obj->pltrela, reloff = 0;
224 1.46 matt rela < obj->pltrelalim;
225 1.46 matt rela++, reloff++) {
226 1.17 mycroft Elf_Word *where = (Elf_Word *)(obj->relocbase + rela->r_offset);
227 1.17 mycroft
228 1.17 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
229 1.17 mycroft
230 1.46 matt if (obj->gotptr != NULL) {
231 1.46 matt /*
232 1.46 matt * For now, simply treat then as relative.
233 1.46 matt */
234 1.46 matt *where += (Elf_Addr)obj->relocbase;
235 1.46 matt } else {
236 1.46 matt int distance;
237 1.46 matt
238 1.46 matt if (reloff < 32768) {
239 1.46 matt /* li r11,reloff */
240 1.46 matt *where++ = 0x39600000 | reloff;
241 1.46 matt } else {
242 1.46 matt /* lis r11,ha(reloff) */
243 1.46 matt /* addi r11,l(reloff) */
244 1.46 matt *where++ = 0x3d600000 | ha(reloff);
245 1.46 matt *where++ = 0x396b0000 | l(reloff);
246 1.46 matt }
247 1.46 matt /* b pltresolve */
248 1.46 matt distance = (Elf_Addr)pltresolve - (Elf_Addr)where;
249 1.46 matt *where++ = 0x48000000 | (distance & 0x03fffffc);
250 1.17 mycroft
251 1.46 matt /*
252 1.46 matt * Icache invalidation is not done for each entry here
253 1.46 matt * because we sync the entire code part of the PLT once
254 1.46 matt * in _rtld_setup_pltgot() after all the entries have been
255 1.46 matt * initialized.
256 1.46 matt */
257 1.46 matt /* __syncicache(where - 3, 12); */
258 1.28 mycroft }
259 1.17 mycroft }
260 1.17 mycroft
261 1.13 mycroft return 0;
262 1.27 mycroft }
263 1.27 mycroft
264 1.46 matt static int
265 1.36 skrll _rtld_relocate_plt_object(const Obj_Entry *obj, const Elf_Rela *rela, int reloff, Elf_Addr *tp)
266 1.27 mycroft {
267 1.27 mycroft Elf_Word *where = (Elf_Word *)(obj->relocbase + rela->r_offset);
268 1.27 mycroft Elf_Addr value;
269 1.27 mycroft const Elf_Sym *def;
270 1.27 mycroft const Obj_Entry *defobj;
271 1.27 mycroft int distance;
272 1.44 christos unsigned long info = rela->r_info;
273 1.27 mycroft
274 1.44 christos assert(ELF_R_TYPE(info) == R_TYPE(JMP_SLOT));
275 1.27 mycroft
276 1.44 christos def = _rtld_find_plt_symdef(ELF_R_SYM(info), obj, &defobj, tp != NULL);
277 1.44 christos if (__predict_false(def == NULL))
278 1.36 skrll return -1;
279 1.44 christos if (__predict_false(def == &_rtld_sym_zero))
280 1.44 christos return 0;
281 1.27 mycroft
282 1.27 mycroft value = (Elf_Addr)(defobj->relocbase + def->st_value);
283 1.27 mycroft distance = value - (Elf_Addr)where;
284 1.29 mycroft rdbg(("bind now/fixup in %s --> new=%p",
285 1.29 mycroft defobj->strtab + def->st_name, (void *)value));
286 1.27 mycroft
287 1.46 matt if (obj->gotptr != NULL) {
288 1.46 matt /*
289 1.46 matt * For Secure-PLT we simply replace the entry in GOT with the address
290 1.46 matt * of the routine.
291 1.46 matt */
292 1.46 matt assert(where >= (Elf_Word *)obj->pltgot);
293 1.46 matt assert(where < (Elf_Word *)obj->pltgot + (obj->pltrelalim - obj->pltrela));
294 1.46 matt *where = value;
295 1.46 matt } else if (abs(distance) < 32*1024*1024) { /* inside 32MB? */
296 1.27 mycroft /* b value # branch directly */
297 1.27 mycroft *where = 0x48000000 | (distance & 0x03fffffc);
298 1.27 mycroft __syncicache(where, 4);
299 1.27 mycroft } else {
300 1.27 mycroft Elf_Addr *pltcall, *jmptab;
301 1.27 mycroft int N = obj->pltrelalim - obj->pltrela;
302 1.27 mycroft
303 1.28 mycroft /* Entries beyond 8192 take twice as much space. */
304 1.28 mycroft if (N > 8192)
305 1.28 mycroft N += N-8192;
306 1.28 mycroft
307 1.27 mycroft pltcall = obj->pltgot;
308 1.28 mycroft jmptab = pltcall + 18 + N * 2;
309 1.27 mycroft
310 1.27 mycroft jmptab[reloff] = value;
311 1.27 mycroft
312 1.28 mycroft if (reloff < 32768) {
313 1.28 mycroft /* li r11,reloff */
314 1.28 mycroft *where++ = 0x39600000 | reloff;
315 1.28 mycroft } else {
316 1.46 matt #ifdef notyet
317 1.46 matt /* lis r11,ha(value) */
318 1.46 matt /* addi r11,l(value) */
319 1.46 matt /* mtctr r11 */
320 1.46 matt /* bctr */
321 1.46 matt *where++ = 0x3d600000 | ha(value);
322 1.46 matt *where++ = 0x396b0000 | l(value);
323 1.46 matt *where++ = 0x7d6903a6;
324 1.46 matt *where++ = 0x4e800420;
325 1.46 matt #else
326 1.28 mycroft /* lis r11,ha(reloff) */
327 1.28 mycroft /* addi r11,l(reloff) */
328 1.28 mycroft *where++ = 0x3d600000 | ha(reloff);
329 1.28 mycroft *where++ = 0x396b0000 | l(reloff);
330 1.46 matt #endif
331 1.28 mycroft }
332 1.28 mycroft /* b pltcall */
333 1.28 mycroft distance = (Elf_Addr)pltcall - (Elf_Addr)where;
334 1.28 mycroft *where++ = 0x48000000 | (distance & 0x03fffffc);
335 1.38 chs __syncicache(where - 3, 12);
336 1.27 mycroft }
337 1.27 mycroft
338 1.36 skrll if (tp)
339 1.36 skrll *tp = value;
340 1.36 skrll return 0;
341 1.36 skrll }
342 1.36 skrll
343 1.36 skrll caddr_t
344 1.36 skrll _rtld_bind(const Obj_Entry *obj, Elf_Word reloff)
345 1.36 skrll {
346 1.46 matt const Elf_Rela *rela = (const void *)((const char *)obj->pltrela + reloff);
347 1.36 skrll Elf_Addr new_value;
348 1.36 skrll int err;
349 1.36 skrll
350 1.40 mrg new_value = 0; /* XXX gcc */
351 1.40 mrg
352 1.36 skrll err = _rtld_relocate_plt_object(obj, rela, reloff, &new_value);
353 1.44 christos if (err)
354 1.36 skrll _rtld_die();
355 1.36 skrll
356 1.36 skrll return (caddr_t)new_value;
357 1.36 skrll }
358 1.36 skrll
359 1.36 skrll int
360 1.36 skrll _rtld_relocate_plt_objects(const Obj_Entry *obj)
361 1.36 skrll {
362 1.36 skrll const Elf_Rela *rela;
363 1.36 skrll int reloff;
364 1.36 skrll
365 1.36 skrll for (rela = obj->pltrela, reloff = 0; rela < obj->pltrelalim; rela++, reloff++) {
366 1.36 skrll if (_rtld_relocate_plt_object(obj, rela, reloff, NULL) < 0)
367 1.36 skrll return -1;
368 1.36 skrll }
369 1.36 skrll return 0;
370 1.1 tsubai }
371