map_object.c revision 1.32 1 1.32 lukem /* $NetBSD: map_object.c,v 1.32 2005/06/01 14:14:55 lukem Exp $ */
2 1.1 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright 1996 John D. Polstra.
5 1.1 cgd * Copyright 1996 Matt Thomas <matt (at) 3am-software.com>
6 1.24 mycroft * Copyright 2002 Charles M. Hannum <root (at) ihack.net>
7 1.1 cgd * All rights reserved.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by John Polstra.
20 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
21 1.1 cgd * derived from this software without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.31 skrll #include <sys/cdefs.h>
36 1.31 skrll #ifndef lint
37 1.32 lukem __RCSID("$NetBSD: map_object.c,v 1.32 2005/06/01 14:14:55 lukem Exp $");
38 1.31 skrll #endif /* not lint */
39 1.31 skrll
40 1.1 cgd #include <errno.h>
41 1.1 cgd #include <stddef.h>
42 1.10 mycroft #include <stdlib.h>
43 1.1 cgd #include <string.h>
44 1.1 cgd #include <unistd.h>
45 1.10 mycroft #include <sys/stat.h>
46 1.1 cgd #include <sys/types.h>
47 1.1 cgd #include <sys/mman.h>
48 1.1 cgd
49 1.1 cgd #include "rtld.h"
50 1.7 hannken
51 1.30 skrll static int protflags(int); /* Elf flags -> mmap protection */
52 1.1 cgd
53 1.1 cgd /*
54 1.1 cgd * Map a shared object into memory. The argument is a file descriptor,
55 1.1 cgd * which must be open on the object and positioned at its beginning.
56 1.1 cgd *
57 1.1 cgd * The return value is a pointer to a newly-allocated Obj_Entry structure
58 1.1 cgd * for the shared object. Returns NULL on failure.
59 1.1 cgd */
60 1.1 cgd Obj_Entry *
61 1.30 skrll _rtld_map_object(char *path, int fd, const struct stat *sb)
62 1.1 cgd {
63 1.18 junyoung Obj_Entry *obj;
64 1.18 junyoung Elf_Ehdr *ehdr;
65 1.18 junyoung Elf_Phdr *phdr;
66 1.18 junyoung Elf_Phdr *phlimit;
67 1.18 junyoung Elf_Phdr *segs[2];
68 1.18 junyoung int nsegs;
69 1.22 mycroft caddr_t mapbase = MAP_FAILED;
70 1.32 lukem size_t mapsize = 0;
71 1.27 matt int mapflags;
72 1.18 junyoung Elf_Off base_offset;
73 1.28 taca #ifdef MAP_ALIGNED
74 1.27 matt Elf_Addr base_alignment;
75 1.28 taca #endif
76 1.18 junyoung Elf_Addr base_vaddr;
77 1.18 junyoung Elf_Addr base_vlimit;
78 1.18 junyoung Elf_Addr text_vlimit;
79 1.22 mycroft int text_flags;
80 1.18 junyoung caddr_t base_addr;
81 1.18 junyoung Elf_Off data_offset;
82 1.18 junyoung Elf_Addr data_vaddr;
83 1.18 junyoung Elf_Addr data_vlimit;
84 1.22 mycroft int data_flags;
85 1.18 junyoung caddr_t data_addr;
86 1.18 junyoung caddr_t gap_addr;
87 1.18 junyoung size_t gap_size;
88 1.1 cgd #ifdef RTLD_LOADER
89 1.18 junyoung Elf_Addr clear_vaddr;
90 1.18 junyoung caddr_t clear_addr;
91 1.18 junyoung size_t nclear;
92 1.1 cgd #endif
93 1.26 fvdl
94 1.26 fvdl if (sb != NULL && sb->st_size < sizeof (Elf_Ehdr)) {
95 1.26 fvdl _rtld_error("%s: unrecognized file format", path);
96 1.26 fvdl return NULL;
97 1.26 fvdl }
98 1.1 cgd
99 1.22 mycroft obj = _rtld_obj_new();
100 1.22 mycroft obj->path = path;
101 1.25 junyoung obj->pathlen = strlen(path);
102 1.22 mycroft if (sb != NULL) {
103 1.22 mycroft obj->dev = sb->st_dev;
104 1.22 mycroft obj->ino = sb->st_ino;
105 1.22 mycroft }
106 1.22 mycroft
107 1.20 mycroft ehdr = mmap(NULL, _rtld_pagesz, PROT_READ, MAP_FILE | MAP_SHARED, fd,
108 1.16 mycroft (off_t)0);
109 1.20 mycroft if (ehdr == MAP_FAILED) {
110 1.4 christos _rtld_error("%s: read error: %s", path, xstrerror(errno));
111 1.22 mycroft goto bad;
112 1.4 christos }
113 1.4 christos /* Make sure the file is valid */
114 1.17 junyoung if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
115 1.17 junyoung ehdr->e_ident[EI_CLASS] != ELFCLASS) {
116 1.4 christos _rtld_error("%s: unrecognized file format", path);
117 1.16 mycroft goto bad;
118 1.4 christos }
119 1.4 christos /* Elf_e_ident includes class */
120 1.17 junyoung if (ehdr->e_ident[EI_VERSION] != EV_CURRENT ||
121 1.17 junyoung ehdr->e_version != EV_CURRENT ||
122 1.17 junyoung ehdr->e_ident[EI_DATA] != ELFDEFNNAME(MACHDEP_ENDIANNESS)) {
123 1.16 mycroft _rtld_error("%s: unsupported file version", path);
124 1.16 mycroft goto bad;
125 1.16 mycroft }
126 1.17 junyoung if (ehdr->e_type != ET_EXEC && ehdr->e_type != ET_DYN) {
127 1.16 mycroft _rtld_error("%s: unsupported file type", path);
128 1.16 mycroft goto bad;
129 1.4 christos }
130 1.17 junyoung switch (ehdr->e_machine) {
131 1.4 christos ELFDEFNNAME(MACHDEP_ID_CASES)
132 1.4 christos default:
133 1.16 mycroft _rtld_error("%s: unsupported machine", path);
134 1.16 mycroft goto bad;
135 1.4 christos }
136 1.4 christos
137 1.4 christos /*
138 1.4 christos * We rely on the program header being in the first page. This is
139 1.4 christos * not strictly required by the ABI specification, but it seems to
140 1.4 christos * always true in practice. And, it simplifies things considerably.
141 1.4 christos */
142 1.17 junyoung assert(ehdr->e_phentsize == sizeof(Elf_Phdr));
143 1.19 junyoung assert(ehdr->e_phoff + ehdr->e_phnum * sizeof(Elf_Phdr) <=
144 1.19 junyoung _rtld_pagesz);
145 1.4 christos
146 1.4 christos /*
147 1.4 christos * Scan the program header entries, and save key information.
148 1.4 christos *
149 1.4 christos * We rely on there being exactly two load segments, text and data,
150 1.4 christos * in that order.
151 1.4 christos */
152 1.17 junyoung phdr = (Elf_Phdr *) ((caddr_t)ehdr + ehdr->e_phoff);
153 1.17 junyoung phlimit = phdr + ehdr->e_phnum;
154 1.4 christos nsegs = 0;
155 1.4 christos while (phdr < phlimit) {
156 1.4 christos switch (phdr->p_type) {
157 1.10 mycroft case PT_INTERP:
158 1.22 mycroft obj->interp = (void *)phdr->p_vaddr;
159 1.10 mycroft break;
160 1.1 cgd
161 1.8 kleink case PT_LOAD:
162 1.12 mycroft if (nsegs < 2)
163 1.12 mycroft segs[nsegs] = phdr;
164 1.4 christos ++nsegs;
165 1.4 christos break;
166 1.4 christos
167 1.8 kleink case PT_DYNAMIC:
168 1.22 mycroft obj->dynamic = (void *)phdr->p_vaddr;
169 1.4 christos break;
170 1.4 christos }
171 1.1 cgd
172 1.4 christos ++phdr;
173 1.4 christos }
174 1.22 mycroft obj->entry = (void *)ehdr->e_entry;
175 1.22 mycroft if (!obj->dynamic) {
176 1.12 mycroft _rtld_error("%s: not dynamically linked", path);
177 1.16 mycroft goto bad;
178 1.12 mycroft }
179 1.12 mycroft if (nsegs != 2) {
180 1.12 mycroft _rtld_error("%s: wrong number of segments (%d != 2)", path,
181 1.12 mycroft nsegs);
182 1.16 mycroft goto bad;
183 1.4 christos }
184 1.1 cgd
185 1.4 christos /*
186 1.11 chs * Map the entire address space of the object as a file
187 1.5 thorpej * region to stake out our contiguous region and establish a
188 1.11 chs * base for relocation. We use a file mapping so that
189 1.11 chs * the kernel will give us whatever alignment is appropriate
190 1.11 chs * for the platform we're running on.
191 1.5 thorpej *
192 1.11 chs * We map it using the text protection, map the data segment
193 1.11 chs * into the right place, then map an anon segment for the bss
194 1.11 chs * and unmap the gaps left by padding to alignment.
195 1.5 thorpej */
196 1.11 chs
197 1.27 matt #ifdef MAP_ALIGNED
198 1.27 matt base_alignment = segs[0]->p_align;
199 1.27 matt #endif
200 1.4 christos base_offset = round_down(segs[0]->p_offset);
201 1.4 christos base_vaddr = round_down(segs[0]->p_vaddr);
202 1.4 christos base_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_memsz);
203 1.11 chs text_vlimit = round_up(segs[0]->p_vaddr + segs[0]->p_memsz);
204 1.22 mycroft text_flags = protflags(segs[0]->p_flags);
205 1.22 mycroft data_offset = round_down(segs[1]->p_offset);
206 1.22 mycroft data_vaddr = round_down(segs[1]->p_vaddr);
207 1.22 mycroft data_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_filesz);
208 1.22 mycroft data_flags = protflags(segs[1]->p_flags);
209 1.23 mycroft #ifdef RTLD_LOADER
210 1.22 mycroft clear_vaddr = segs[1]->p_vaddr + segs[1]->p_filesz;
211 1.23 mycroft #endif
212 1.22 mycroft
213 1.22 mycroft obj->textsize = text_vlimit - base_vaddr;
214 1.22 mycroft obj->vaddrbase = base_vaddr;
215 1.22 mycroft obj->isdynamic = ehdr->e_type == ET_DYN;
216 1.22 mycroft
217 1.22 mycroft munmap(ehdr, _rtld_pagesz);
218 1.22 mycroft ehdr = MAP_FAILED;
219 1.11 chs
220 1.27 matt /*
221 1.27 matt * Calculate log2 of the base section alignment.
222 1.27 matt */
223 1.27 matt mapflags = 0;
224 1.27 matt #ifdef MAP_ALIGNED
225 1.27 matt if (base_alignment > _rtld_pagesz) {
226 1.27 matt unsigned int log2 = 0;
227 1.27 matt for (; base_alignment > 1; base_alignment >>= 1)
228 1.27 matt log2++;
229 1.27 matt mapflags = MAP_ALIGNED(log2);
230 1.27 matt }
231 1.27 matt #endif
232 1.27 matt
233 1.1 cgd #ifdef RTLD_LOADER
234 1.22 mycroft base_addr = obj->isdynamic ? NULL : (caddr_t)base_vaddr;
235 1.1 cgd #else
236 1.4 christos base_addr = NULL;
237 1.1 cgd #endif
238 1.22 mycroft mapsize = base_vlimit - base_vaddr;
239 1.27 matt mapbase = mmap(base_addr, mapsize, text_flags,
240 1.27 matt mapflags | MAP_FILE | MAP_PRIVATE, fd, base_offset);
241 1.5 thorpej if (mapbase == MAP_FAILED) {
242 1.4 christos _rtld_error("mmap of entire address space failed: %s",
243 1.4 christos xstrerror(errno));
244 1.16 mycroft goto bad;
245 1.4 christos }
246 1.11 chs
247 1.4 christos /* Overlay the data segment onto the proper region. */
248 1.4 christos data_addr = mapbase + (data_vaddr - base_vaddr);
249 1.22 mycroft if (mmap(data_addr, data_vlimit - data_vaddr, data_flags,
250 1.22 mycroft MAP_FILE | MAP_PRIVATE | MAP_FIXED, fd, data_offset) ==
251 1.22 mycroft MAP_FAILED) {
252 1.4 christos _rtld_error("mmap of data failed: %s", xstrerror(errno));
253 1.22 mycroft goto bad;
254 1.11 chs }
255 1.11 chs
256 1.11 chs /* Overlay the bss segment onto the proper region. */
257 1.11 chs if (mmap(mapbase + data_vlimit - base_vaddr, base_vlimit - data_vlimit,
258 1.22 mycroft data_flags, MAP_ANON | MAP_PRIVATE | MAP_FIXED, -1, 0) ==
259 1.22 mycroft MAP_FAILED) {
260 1.11 chs _rtld_error("mmap of bss failed: %s", xstrerror(errno));
261 1.22 mycroft goto bad;
262 1.4 christos }
263 1.5 thorpej
264 1.5 thorpej /* Unmap the gap between the text and data. */
265 1.22 mycroft gap_addr = mapbase + round_up(text_vlimit - base_vaddr);
266 1.5 thorpej gap_size = data_addr - gap_addr;
267 1.21 mycroft if (gap_size != 0 && mprotect(gap_addr, gap_size, PROT_NONE) == -1) {
268 1.21 mycroft _rtld_error("mprotect of text -> data gap failed: %s",
269 1.5 thorpej xstrerror(errno));
270 1.22 mycroft goto bad;
271 1.5 thorpej }
272 1.5 thorpej
273 1.1 cgd #ifdef RTLD_LOADER
274 1.4 christos /* Clear any BSS in the last page of the data segment. */
275 1.4 christos clear_addr = mapbase + (clear_vaddr - base_vaddr);
276 1.4 christos if ((nclear = data_vlimit - clear_vaddr) > 0)
277 1.4 christos memset(clear_addr, 0, nclear);
278 1.4 christos
279 1.5 thorpej /* Non-file portion of BSS mapped above. */
280 1.1 cgd #endif
281 1.1 cgd
282 1.4 christos obj->mapbase = mapbase;
283 1.4 christos obj->mapsize = mapsize;
284 1.4 christos obj->relocbase = mapbase - base_vaddr;
285 1.10 mycroft
286 1.22 mycroft if (obj->dynamic)
287 1.22 mycroft obj->dynamic = (void *)(obj->relocbase + (Elf_Addr)obj->dynamic);
288 1.22 mycroft if (obj->entry)
289 1.22 mycroft obj->entry = (void *)(obj->relocbase + (Elf_Addr)obj->entry);
290 1.22 mycroft if (obj->interp)
291 1.22 mycroft obj->interp = (void *)(obj->relocbase + (Elf_Addr)obj->interp);
292 1.22 mycroft
293 1.10 mycroft return obj;
294 1.16 mycroft
295 1.16 mycroft bad:
296 1.22 mycroft if (ehdr != MAP_FAILED)
297 1.22 mycroft munmap(ehdr, _rtld_pagesz);
298 1.22 mycroft if (mapbase != MAP_FAILED)
299 1.22 mycroft munmap(mapbase, mapsize);
300 1.22 mycroft _rtld_obj_free(obj);
301 1.16 mycroft return NULL;
302 1.10 mycroft }
303 1.10 mycroft
304 1.10 mycroft void
305 1.30 skrll _rtld_obj_free(Obj_Entry *obj)
306 1.10 mycroft {
307 1.10 mycroft Objlist_Entry *elm;
308 1.10 mycroft
309 1.10 mycroft free(obj->path);
310 1.10 mycroft while (obj->needed != NULL) {
311 1.10 mycroft Needed_Entry *needed = obj->needed;
312 1.10 mycroft obj->needed = needed->next;
313 1.10 mycroft free(needed);
314 1.10 mycroft }
315 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dldags)) != NULL) {
316 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dldags, link);
317 1.10 mycroft free(elm);
318 1.10 mycroft }
319 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dagmembers)) != NULL) {
320 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dagmembers, link);
321 1.10 mycroft free(elm);
322 1.10 mycroft }
323 1.10 mycroft free(obj);
324 1.10 mycroft }
325 1.10 mycroft
326 1.10 mycroft Obj_Entry *
327 1.10 mycroft _rtld_obj_new(void)
328 1.10 mycroft {
329 1.10 mycroft Obj_Entry *obj;
330 1.10 mycroft
331 1.10 mycroft obj = CNEW(Obj_Entry);
332 1.10 mycroft SIMPLEQ_INIT(&obj->dldags);
333 1.10 mycroft SIMPLEQ_INIT(&obj->dagmembers);
334 1.4 christos return obj;
335 1.1 cgd }
336 1.1 cgd
337 1.1 cgd /*
338 1.1 cgd * Given a set of ELF protection flags, return the corresponding protection
339 1.1 cgd * flags for MMAP.
340 1.1 cgd */
341 1.1 cgd static int
342 1.30 skrll protflags(int elfflags)
343 1.1 cgd {
344 1.4 christos int prot = 0;
345 1.29 simonb
346 1.8 kleink if (elfflags & PF_R)
347 1.4 christos prot |= PROT_READ;
348 1.1 cgd #ifdef RTLD_LOADER
349 1.8 kleink if (elfflags & PF_W)
350 1.4 christos prot |= PROT_WRITE;
351 1.1 cgd #endif
352 1.8 kleink if (elfflags & PF_X)
353 1.4 christos prot |= PROT_EXEC;
354 1.4 christos return prot;
355 1.1 cgd }
356