ppc_reloc.c revision 1.35 1 1.35 skrll /* $NetBSD: ppc_reloc.c,v 1.35 2003/07/24 10:12:29 skrll 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.1 tsubai #include <stdarg.h>
32 1.1 tsubai #include <stdio.h>
33 1.1 tsubai #include <stdlib.h>
34 1.1 tsubai #include <string.h>
35 1.1 tsubai #include <sys/types.h>
36 1.7 mycroft #include <sys/stat.h>
37 1.1 tsubai #include <machine/cpu.h>
38 1.1 tsubai
39 1.1 tsubai #include "debug.h"
40 1.1 tsubai #include "rtld.h"
41 1.1 tsubai
42 1.35 skrll void _rtld_powerpc_pltcall(Elf_Word);
43 1.35 skrll void _rtld_powerpc_pltresolve(Elf_Word, Elf_Word);
44 1.1 tsubai
45 1.1 tsubai #define ha(x) ((((u_int32_t)(x) & 0x8000) ? \
46 1.1 tsubai ((u_int32_t)(x) + 0x10000) : (u_int32_t)(x)) >> 16)
47 1.1 tsubai #define l(x) ((u_int32_t)(x) & 0xffff)
48 1.1 tsubai
49 1.23 mycroft void _rtld_bind_start(void);
50 1.22 mycroft void _rtld_relocate_nonplt_self(Elf_Dyn *, Elf_Addr);
51 1.35 skrll caddr_t _rtld_bind(const Obj_Entry *, Elf_Word);
52 1.1 tsubai
53 1.1 tsubai /*
54 1.1 tsubai * Setup the plt glue routines.
55 1.1 tsubai */
56 1.1 tsubai #define PLTCALL_SIZE 20
57 1.1 tsubai #define PLTRESOLVE_SIZE 24
58 1.1 tsubai
59 1.1 tsubai void
60 1.35 skrll _rtld_setup_pltgot(const Obj_Entry *obj)
61 1.1 tsubai {
62 1.1 tsubai Elf_Word *pltcall, *pltresolve;
63 1.1 tsubai Elf_Word *jmptab;
64 1.1 tsubai int N = obj->pltrelalim - obj->pltrela;
65 1.1 tsubai
66 1.28 mycroft /* Entries beyond 8192 take twice as much space. */
67 1.28 mycroft if (N > 8192)
68 1.28 mycroft N += N-8192;
69 1.28 mycroft
70 1.1 tsubai pltcall = obj->pltgot;
71 1.28 mycroft jmptab = pltcall + 18 + N * 2;
72 1.1 tsubai
73 1.1 tsubai memcpy(pltcall, _rtld_powerpc_pltcall, PLTCALL_SIZE);
74 1.1 tsubai pltcall[1] |= ha(jmptab);
75 1.1 tsubai pltcall[2] |= l(jmptab);
76 1.1 tsubai
77 1.10 mycroft pltresolve = obj->pltgot + 8;
78 1.1 tsubai
79 1.1 tsubai memcpy(pltresolve, _rtld_powerpc_pltresolve, PLTRESOLVE_SIZE);
80 1.1 tsubai pltresolve[0] |= ha(_rtld_bind_start);
81 1.1 tsubai pltresolve[1] |= l(_rtld_bind_start);
82 1.1 tsubai pltresolve[3] |= ha(obj);
83 1.1 tsubai pltresolve[4] |= l(obj);
84 1.1 tsubai
85 1.34 mycroft __syncicache(pltcall, 72 + N * 8);
86 1.13 mycroft }
87 1.13 mycroft
88 1.22 mycroft void
89 1.35 skrll _rtld_relocate_nonplt_self(Elf_Dyn *dynp, Elf_Addr relocbase)
90 1.22 mycroft {
91 1.22 mycroft const Elf_Rela *rela = 0, *relalim;
92 1.22 mycroft Elf_Addr relasz = 0;
93 1.22 mycroft Elf_Addr *where;
94 1.22 mycroft
95 1.22 mycroft for (; dynp->d_tag != DT_NULL; dynp++) {
96 1.22 mycroft switch (dynp->d_tag) {
97 1.22 mycroft case DT_RELA:
98 1.22 mycroft rela = (const Elf_Rela *)(relocbase + dynp->d_un.d_ptr);
99 1.22 mycroft break;
100 1.22 mycroft case DT_RELASZ:
101 1.22 mycroft relasz = dynp->d_un.d_val;
102 1.22 mycroft break;
103 1.22 mycroft }
104 1.22 mycroft }
105 1.22 mycroft relalim = (const Elf_Rela *)((caddr_t)rela + relasz);
106 1.22 mycroft for (; rela < relalim; rela++) {
107 1.22 mycroft where = (Elf_Addr *)(relocbase + rela->r_offset);
108 1.22 mycroft *where = (Elf_Addr)(relocbase + rela->r_addend);
109 1.22 mycroft }
110 1.22 mycroft }
111 1.22 mycroft
112 1.13 mycroft int
113 1.35 skrll _rtld_relocate_nonplt_objects(const Obj_Entry *obj)
114 1.13 mycroft {
115 1.14 mycroft const Elf_Rela *rela;
116 1.22 mycroft
117 1.14 mycroft for (rela = obj->rela; rela < obj->relalim; rela++) {
118 1.14 mycroft Elf_Addr *where;
119 1.14 mycroft const Elf_Sym *def;
120 1.14 mycroft const Obj_Entry *defobj;
121 1.14 mycroft Elf_Addr tmp;
122 1.15 mycroft unsigned long symnum;
123 1.14 mycroft
124 1.14 mycroft where = (Elf_Addr *)(obj->relocbase + rela->r_offset);
125 1.15 mycroft symnum = ELF_R_SYM(rela->r_info);
126 1.13 mycroft
127 1.14 mycroft switch (ELF_R_TYPE(rela->r_info)) {
128 1.26 mycroft #if 1 /* XXX Should not be necessary. */
129 1.26 mycroft case R_TYPE(JMP_SLOT):
130 1.26 mycroft #endif
131 1.14 mycroft case R_TYPE(NONE):
132 1.14 mycroft break;
133 1.14 mycroft
134 1.14 mycroft case R_TYPE(32): /* word32 S + A */
135 1.14 mycroft case R_TYPE(GLOB_DAT): /* word32 S + A */
136 1.15 mycroft def = _rtld_find_symdef(symnum, obj, &defobj, false);
137 1.14 mycroft if (def == NULL)
138 1.14 mycroft return -1;
139 1.14 mycroft
140 1.14 mycroft tmp = (Elf_Addr)(defobj->relocbase + def->st_value +
141 1.14 mycroft rela->r_addend);
142 1.14 mycroft if (*where != tmp)
143 1.14 mycroft *where = tmp;
144 1.24 mycroft rdbg(("32/GLOB_DAT %s in %s --> %p in %s",
145 1.16 mycroft obj->strtab + obj->symtab[symnum].st_name,
146 1.16 mycroft obj->path, (void *)*where, defobj->path));
147 1.14 mycroft break;
148 1.14 mycroft
149 1.14 mycroft case R_TYPE(RELATIVE): /* word32 B + A */
150 1.22 mycroft *where = (Elf_Addr)(obj->relocbase + rela->r_addend);
151 1.24 mycroft rdbg(("RELATIVE in %s --> %p", obj->path,
152 1.14 mycroft (void *)*where));
153 1.14 mycroft break;
154 1.14 mycroft
155 1.14 mycroft case R_TYPE(COPY):
156 1.14 mycroft /*
157 1.14 mycroft * These are deferred until all other relocations have
158 1.14 mycroft * been done. All we do here is make sure that the
159 1.14 mycroft * COPY relocation is not in a shared library. They
160 1.14 mycroft * are allowed only in executable files.
161 1.14 mycroft */
162 1.20 mycroft if (obj->isdynamic) {
163 1.14 mycroft _rtld_error(
164 1.13 mycroft "%s: Unexpected R_COPY relocation in shared library",
165 1.14 mycroft obj->path);
166 1.14 mycroft return -1;
167 1.14 mycroft }
168 1.24 mycroft rdbg(("COPY (avoid in main)"));
169 1.14 mycroft break;
170 1.14 mycroft
171 1.14 mycroft default:
172 1.24 mycroft rdbg(("sym = %lu, type = %lu, offset = %p, "
173 1.14 mycroft "addend = %p, contents = %p, symbol = %s",
174 1.15 mycroft symnum, (u_long)ELF_R_TYPE(rela->r_info),
175 1.14 mycroft (void *)rela->r_offset, (void *)rela->r_addend,
176 1.14 mycroft (void *)*where,
177 1.15 mycroft obj->strtab + obj->symtab[symnum].st_name));
178 1.14 mycroft _rtld_error("%s: Unsupported relocation type %ld "
179 1.14 mycroft "in non-PLT relocations\n",
180 1.14 mycroft obj->path, (u_long) ELF_R_TYPE(rela->r_info));
181 1.13 mycroft return -1;
182 1.13 mycroft }
183 1.13 mycroft }
184 1.17 mycroft return 0;
185 1.17 mycroft }
186 1.17 mycroft
187 1.17 mycroft int
188 1.35 skrll _rtld_relocate_plt_lazy(const Obj_Entry *obj)
189 1.17 mycroft {
190 1.17 mycroft const Elf_Rela *rela;
191 1.28 mycroft int reloff;
192 1.17 mycroft
193 1.28 mycroft for (rela = obj->pltrela, reloff = 0; rela < obj->pltrelalim; rela++, reloff++) {
194 1.17 mycroft Elf_Word *where = (Elf_Word *)(obj->relocbase + rela->r_offset);
195 1.17 mycroft int distance;
196 1.17 mycroft Elf_Addr *pltresolve;
197 1.17 mycroft
198 1.17 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
199 1.17 mycroft
200 1.17 mycroft pltresolve = obj->pltgot + 8;
201 1.17 mycroft
202 1.28 mycroft if (reloff < 32768) {
203 1.28 mycroft /* li r11,reloff */
204 1.28 mycroft *where++ = 0x39600000 | reloff;
205 1.28 mycroft } else {
206 1.28 mycroft /* lis r11,ha(reloff) */
207 1.28 mycroft /* addi r11,l(reloff) */
208 1.28 mycroft *where++ = 0x3d600000 | ha(reloff);
209 1.28 mycroft *where++ = 0x396b0000 | l(reloff);
210 1.28 mycroft }
211 1.28 mycroft /* b pltresolve */
212 1.28 mycroft distance = (Elf_Addr)pltresolve - (Elf_Addr)where;
213 1.28 mycroft *where++ = 0x48000000 | (distance & 0x03fffffc);
214 1.28 mycroft /* __syncicache(where - 12, 12); */
215 1.17 mycroft }
216 1.17 mycroft
217 1.13 mycroft return 0;
218 1.27 mycroft }
219 1.27 mycroft
220 1.27 mycroft caddr_t
221 1.35 skrll _rtld_bind(const Obj_Entry *obj, Elf_Word reloff)
222 1.27 mycroft {
223 1.27 mycroft const Elf_Rela *rela = obj->pltrela + reloff;
224 1.27 mycroft Elf_Word *where = (Elf_Word *)(obj->relocbase + rela->r_offset);
225 1.27 mycroft Elf_Addr value;
226 1.27 mycroft const Elf_Sym *def;
227 1.27 mycroft const Obj_Entry *defobj;
228 1.27 mycroft int distance;
229 1.27 mycroft
230 1.27 mycroft assert(ELF_R_TYPE(rela->r_info) == R_TYPE(JMP_SLOT));
231 1.27 mycroft
232 1.27 mycroft def = _rtld_find_symdef(ELF_R_SYM(rela->r_info), obj, &defobj, true);
233 1.27 mycroft if (def == NULL)
234 1.27 mycroft _rtld_die();
235 1.27 mycroft
236 1.27 mycroft value = (Elf_Addr)(defobj->relocbase + def->st_value);
237 1.27 mycroft distance = value - (Elf_Addr)where;
238 1.29 mycroft rdbg(("bind now/fixup in %s --> new=%p",
239 1.29 mycroft defobj->strtab + def->st_name, (void *)value));
240 1.27 mycroft
241 1.27 mycroft if (abs(distance) < 32*1024*1024) { /* inside 32MB? */
242 1.27 mycroft /* b value # branch directly */
243 1.27 mycroft *where = 0x48000000 | (distance & 0x03fffffc);
244 1.27 mycroft __syncicache(where, 4);
245 1.27 mycroft } else {
246 1.27 mycroft Elf_Addr *pltcall, *jmptab;
247 1.27 mycroft int N = obj->pltrelalim - obj->pltrela;
248 1.27 mycroft
249 1.28 mycroft /* Entries beyond 8192 take twice as much space. */
250 1.28 mycroft if (N > 8192)
251 1.28 mycroft N += N-8192;
252 1.28 mycroft
253 1.27 mycroft pltcall = obj->pltgot;
254 1.28 mycroft jmptab = pltcall + 18 + N * 2;
255 1.27 mycroft
256 1.27 mycroft jmptab[reloff] = value;
257 1.27 mycroft
258 1.28 mycroft if (reloff < 32768) {
259 1.28 mycroft /* li r11,reloff */
260 1.28 mycroft *where++ = 0x39600000 | reloff;
261 1.28 mycroft } else {
262 1.28 mycroft /* lis r11,ha(reloff) */
263 1.28 mycroft /* addi r11,l(reloff) */
264 1.28 mycroft *where++ = 0x3d600000 | ha(reloff);
265 1.28 mycroft *where++ = 0x396b0000 | l(reloff);
266 1.28 mycroft }
267 1.28 mycroft /* b pltcall */
268 1.28 mycroft distance = (Elf_Addr)pltcall - (Elf_Addr)where;
269 1.28 mycroft *where++ = 0x48000000 | (distance & 0x03fffffc);
270 1.28 mycroft __syncicache(where - 12, 12);
271 1.27 mycroft }
272 1.27 mycroft
273 1.27 mycroft return (caddr_t)value;
274 1.1 tsubai }
275