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