map_object.c revision 1.40 1 1.40 skrll /* $NetBSD: map_object.c,v 1.40 2010/09/11 11:11:52 skrll 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.40 skrll __RCSID("$NetBSD: map_object.c,v 1.40 2010/09/11 11:11:52 skrll 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.34 christos _rtld_map_object(const 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.38 christos if (sb != NULL && sb->st_size < (off_t)sizeof (Elf_Ehdr)) {
95 1.37 mrg _rtld_error("%s: unrecognized file format1", 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.34 christos obj->path = xstrdup(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.36 ad obj->ehdr = ehdr;
110 1.20 mycroft if (ehdr == MAP_FAILED) {
111 1.4 christos _rtld_error("%s: read error: %s", path, xstrerror(errno));
112 1.22 mycroft goto bad;
113 1.4 christos }
114 1.4 christos /* Make sure the file is valid */
115 1.17 junyoung if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
116 1.17 junyoung ehdr->e_ident[EI_CLASS] != ELFCLASS) {
117 1.40 skrll _rtld_error("%s: unrecognized file format2 [%x != %x]", path,
118 1.40 skrll ehdr->e_ident[EI_CLASS], ELFCLASS);
119 1.16 mycroft goto bad;
120 1.4 christos }
121 1.4 christos /* Elf_e_ident includes class */
122 1.17 junyoung if (ehdr->e_ident[EI_VERSION] != EV_CURRENT ||
123 1.17 junyoung ehdr->e_version != EV_CURRENT ||
124 1.17 junyoung ehdr->e_ident[EI_DATA] != ELFDEFNNAME(MACHDEP_ENDIANNESS)) {
125 1.16 mycroft _rtld_error("%s: unsupported file version", path);
126 1.16 mycroft goto bad;
127 1.16 mycroft }
128 1.17 junyoung if (ehdr->e_type != ET_EXEC && ehdr->e_type != ET_DYN) {
129 1.16 mycroft _rtld_error("%s: unsupported file type", path);
130 1.16 mycroft goto bad;
131 1.4 christos }
132 1.17 junyoung switch (ehdr->e_machine) {
133 1.4 christos ELFDEFNNAME(MACHDEP_ID_CASES)
134 1.4 christos default:
135 1.16 mycroft _rtld_error("%s: unsupported machine", path);
136 1.16 mycroft goto bad;
137 1.4 christos }
138 1.4 christos
139 1.4 christos /*
140 1.4 christos * We rely on the program header being in the first page. This is
141 1.4 christos * not strictly required by the ABI specification, but it seems to
142 1.4 christos * always true in practice. And, it simplifies things considerably.
143 1.4 christos */
144 1.17 junyoung assert(ehdr->e_phentsize == sizeof(Elf_Phdr));
145 1.19 junyoung assert(ehdr->e_phoff + ehdr->e_phnum * sizeof(Elf_Phdr) <=
146 1.19 junyoung _rtld_pagesz);
147 1.4 christos
148 1.4 christos /*
149 1.4 christos * Scan the program header entries, and save key information.
150 1.4 christos *
151 1.4 christos * We rely on there being exactly two load segments, text and data,
152 1.4 christos * in that order.
153 1.4 christos */
154 1.17 junyoung phdr = (Elf_Phdr *) ((caddr_t)ehdr + ehdr->e_phoff);
155 1.17 junyoung phlimit = phdr + ehdr->e_phnum;
156 1.4 christos nsegs = 0;
157 1.4 christos while (phdr < phlimit) {
158 1.4 christos switch (phdr->p_type) {
159 1.10 mycroft case PT_INTERP:
160 1.37 mrg obj->interp = (void *)(uintptr_t)phdr->p_vaddr;
161 1.10 mycroft break;
162 1.1 cgd
163 1.8 kleink case PT_LOAD:
164 1.12 mycroft if (nsegs < 2)
165 1.12 mycroft segs[nsegs] = phdr;
166 1.4 christos ++nsegs;
167 1.4 christos break;
168 1.4 christos
169 1.8 kleink case PT_DYNAMIC:
170 1.37 mrg obj->dynamic = (void *)(uintptr_t)phdr->p_vaddr;
171 1.4 christos break;
172 1.4 christos }
173 1.1 cgd
174 1.4 christos ++phdr;
175 1.4 christos }
176 1.37 mrg obj->entry = (void *)(uintptr_t)ehdr->e_entry;
177 1.22 mycroft if (!obj->dynamic) {
178 1.12 mycroft _rtld_error("%s: not dynamically linked", path);
179 1.16 mycroft goto bad;
180 1.12 mycroft }
181 1.12 mycroft if (nsegs != 2) {
182 1.12 mycroft _rtld_error("%s: wrong number of segments (%d != 2)", path,
183 1.12 mycroft nsegs);
184 1.16 mycroft goto bad;
185 1.4 christos }
186 1.1 cgd
187 1.4 christos /*
188 1.11 chs * Map the entire address space of the object as a file
189 1.5 thorpej * region to stake out our contiguous region and establish a
190 1.11 chs * base for relocation. We use a file mapping so that
191 1.11 chs * the kernel will give us whatever alignment is appropriate
192 1.11 chs * for the platform we're running on.
193 1.5 thorpej *
194 1.11 chs * We map it using the text protection, map the data segment
195 1.11 chs * into the right place, then map an anon segment for the bss
196 1.11 chs * and unmap the gaps left by padding to alignment.
197 1.5 thorpej */
198 1.11 chs
199 1.27 matt #ifdef MAP_ALIGNED
200 1.27 matt base_alignment = segs[0]->p_align;
201 1.27 matt #endif
202 1.4 christos base_offset = round_down(segs[0]->p_offset);
203 1.4 christos base_vaddr = round_down(segs[0]->p_vaddr);
204 1.4 christos base_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_memsz);
205 1.11 chs text_vlimit = round_up(segs[0]->p_vaddr + segs[0]->p_memsz);
206 1.22 mycroft text_flags = protflags(segs[0]->p_flags);
207 1.22 mycroft data_offset = round_down(segs[1]->p_offset);
208 1.22 mycroft data_vaddr = round_down(segs[1]->p_vaddr);
209 1.22 mycroft data_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_filesz);
210 1.22 mycroft data_flags = protflags(segs[1]->p_flags);
211 1.23 mycroft #ifdef RTLD_LOADER
212 1.22 mycroft clear_vaddr = segs[1]->p_vaddr + segs[1]->p_filesz;
213 1.23 mycroft #endif
214 1.22 mycroft
215 1.22 mycroft obj->textsize = text_vlimit - base_vaddr;
216 1.22 mycroft obj->vaddrbase = base_vaddr;
217 1.22 mycroft obj->isdynamic = ehdr->e_type == ET_DYN;
218 1.22 mycroft
219 1.36 ad /* Unmap header if it overlaps the first load section. */
220 1.36 ad if (base_offset < _rtld_pagesz) {
221 1.36 ad munmap(ehdr, _rtld_pagesz);
222 1.36 ad obj->ehdr = MAP_FAILED;
223 1.36 ad }
224 1.11 chs
225 1.27 matt /*
226 1.27 matt * Calculate log2 of the base section alignment.
227 1.27 matt */
228 1.27 matt mapflags = 0;
229 1.27 matt #ifdef MAP_ALIGNED
230 1.27 matt if (base_alignment > _rtld_pagesz) {
231 1.27 matt unsigned int log2 = 0;
232 1.27 matt for (; base_alignment > 1; base_alignment >>= 1)
233 1.27 matt log2++;
234 1.27 matt mapflags = MAP_ALIGNED(log2);
235 1.27 matt }
236 1.27 matt #endif
237 1.27 matt
238 1.1 cgd #ifdef RTLD_LOADER
239 1.22 mycroft base_addr = obj->isdynamic ? NULL : (caddr_t)base_vaddr;
240 1.1 cgd #else
241 1.4 christos base_addr = NULL;
242 1.1 cgd #endif
243 1.22 mycroft mapsize = base_vlimit - base_vaddr;
244 1.27 matt mapbase = mmap(base_addr, mapsize, text_flags,
245 1.27 matt mapflags | MAP_FILE | MAP_PRIVATE, fd, base_offset);
246 1.5 thorpej if (mapbase == MAP_FAILED) {
247 1.4 christos _rtld_error("mmap of entire address space failed: %s",
248 1.4 christos xstrerror(errno));
249 1.16 mycroft goto bad;
250 1.4 christos }
251 1.11 chs
252 1.4 christos /* Overlay the data segment onto the proper region. */
253 1.4 christos data_addr = mapbase + (data_vaddr - base_vaddr);
254 1.22 mycroft if (mmap(data_addr, data_vlimit - data_vaddr, data_flags,
255 1.22 mycroft MAP_FILE | MAP_PRIVATE | MAP_FIXED, fd, data_offset) ==
256 1.22 mycroft MAP_FAILED) {
257 1.4 christos _rtld_error("mmap of data failed: %s", xstrerror(errno));
258 1.22 mycroft goto bad;
259 1.11 chs }
260 1.11 chs
261 1.11 chs /* Overlay the bss segment onto the proper region. */
262 1.11 chs if (mmap(mapbase + data_vlimit - base_vaddr, base_vlimit - data_vlimit,
263 1.22 mycroft data_flags, MAP_ANON | MAP_PRIVATE | MAP_FIXED, -1, 0) ==
264 1.22 mycroft MAP_FAILED) {
265 1.11 chs _rtld_error("mmap of bss failed: %s", xstrerror(errno));
266 1.22 mycroft goto bad;
267 1.4 christos }
268 1.5 thorpej
269 1.5 thorpej /* Unmap the gap between the text and data. */
270 1.22 mycroft gap_addr = mapbase + round_up(text_vlimit - base_vaddr);
271 1.5 thorpej gap_size = data_addr - gap_addr;
272 1.21 mycroft if (gap_size != 0 && mprotect(gap_addr, gap_size, PROT_NONE) == -1) {
273 1.21 mycroft _rtld_error("mprotect of text -> data gap failed: %s",
274 1.5 thorpej xstrerror(errno));
275 1.22 mycroft goto bad;
276 1.5 thorpej }
277 1.5 thorpej
278 1.1 cgd #ifdef RTLD_LOADER
279 1.4 christos /* Clear any BSS in the last page of the data segment. */
280 1.4 christos clear_addr = mapbase + (clear_vaddr - base_vaddr);
281 1.4 christos if ((nclear = data_vlimit - clear_vaddr) > 0)
282 1.4 christos memset(clear_addr, 0, nclear);
283 1.4 christos
284 1.5 thorpej /* Non-file portion of BSS mapped above. */
285 1.1 cgd #endif
286 1.1 cgd
287 1.4 christos obj->mapbase = mapbase;
288 1.4 christos obj->mapsize = mapsize;
289 1.4 christos obj->relocbase = mapbase - base_vaddr;
290 1.10 mycroft
291 1.22 mycroft if (obj->dynamic)
292 1.37 mrg obj->dynamic = (void *)(obj->relocbase + (Elf_Addr)(uintptr_t)obj->dynamic);
293 1.22 mycroft if (obj->entry)
294 1.37 mrg obj->entry = (void *)(obj->relocbase + (Elf_Addr)(uintptr_t)obj->entry);
295 1.22 mycroft if (obj->interp)
296 1.37 mrg obj->interp = (void *)(obj->relocbase + (Elf_Addr)(uintptr_t)obj->interp);
297 1.22 mycroft
298 1.10 mycroft return obj;
299 1.16 mycroft
300 1.16 mycroft bad:
301 1.36 ad if (obj->ehdr != MAP_FAILED)
302 1.36 ad munmap(obj->ehdr, _rtld_pagesz);
303 1.22 mycroft if (mapbase != MAP_FAILED)
304 1.22 mycroft munmap(mapbase, mapsize);
305 1.22 mycroft _rtld_obj_free(obj);
306 1.16 mycroft return NULL;
307 1.10 mycroft }
308 1.10 mycroft
309 1.10 mycroft void
310 1.30 skrll _rtld_obj_free(Obj_Entry *obj)
311 1.10 mycroft {
312 1.10 mycroft Objlist_Entry *elm;
313 1.10 mycroft
314 1.35 ad xfree(obj->path);
315 1.10 mycroft while (obj->needed != NULL) {
316 1.10 mycroft Needed_Entry *needed = obj->needed;
317 1.10 mycroft obj->needed = needed->next;
318 1.35 ad xfree(needed);
319 1.10 mycroft }
320 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dldags)) != NULL) {
321 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dldags, link);
322 1.35 ad xfree(elm);
323 1.10 mycroft }
324 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dagmembers)) != NULL) {
325 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dagmembers, link);
326 1.35 ad xfree(elm);
327 1.10 mycroft }
328 1.35 ad xfree(obj);
329 1.39 skrll #ifdef COMBRELOC
330 1.39 skrll _rtld_combreloc_reset(obj);
331 1.39 skrll #endif
332 1.10 mycroft }
333 1.10 mycroft
334 1.10 mycroft Obj_Entry *
335 1.10 mycroft _rtld_obj_new(void)
336 1.10 mycroft {
337 1.10 mycroft Obj_Entry *obj;
338 1.10 mycroft
339 1.10 mycroft obj = CNEW(Obj_Entry);
340 1.10 mycroft SIMPLEQ_INIT(&obj->dldags);
341 1.10 mycroft SIMPLEQ_INIT(&obj->dagmembers);
342 1.4 christos return obj;
343 1.1 cgd }
344 1.1 cgd
345 1.1 cgd /*
346 1.1 cgd * Given a set of ELF protection flags, return the corresponding protection
347 1.1 cgd * flags for MMAP.
348 1.1 cgd */
349 1.1 cgd static int
350 1.30 skrll protflags(int elfflags)
351 1.1 cgd {
352 1.4 christos int prot = 0;
353 1.29 simonb
354 1.8 kleink if (elfflags & PF_R)
355 1.4 christos prot |= PROT_READ;
356 1.1 cgd #ifdef RTLD_LOADER
357 1.8 kleink if (elfflags & PF_W)
358 1.4 christos prot |= PROT_WRITE;
359 1.1 cgd #endif
360 1.8 kleink if (elfflags & PF_X)
361 1.4 christos prot |= PROT_EXEC;
362 1.4 christos return prot;
363 1.1 cgd }
364