map_object.c revision 1.21 1 1.21 mycroft /* $NetBSD: map_object.c,v 1.21 2002/09/27 19:48:24 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.18 junyoung Elf_Phdr *phdyn;
67 1.18 junyoung Elf_Phdr *phphdr;
68 1.18 junyoung Elf_Phdr *phinterp;
69 1.18 junyoung caddr_t mapbase;
70 1.18 junyoung size_t mapsize;
71 1.18 junyoung Elf_Off base_offset;
72 1.18 junyoung Elf_Addr base_vaddr;
73 1.18 junyoung Elf_Addr base_vlimit;
74 1.18 junyoung Elf_Addr text_vlimit;
75 1.18 junyoung caddr_t base_addr;
76 1.18 junyoung Elf_Off data_offset;
77 1.18 junyoung Elf_Addr data_vaddr;
78 1.18 junyoung Elf_Addr data_vlimit;
79 1.18 junyoung caddr_t data_addr;
80 1.18 junyoung caddr_t gap_addr;
81 1.18 junyoung size_t gap_size;
82 1.1 cgd #ifdef RTLD_LOADER
83 1.18 junyoung Elf_Addr clear_vaddr;
84 1.18 junyoung caddr_t clear_addr;
85 1.18 junyoung size_t nclear;
86 1.1 cgd #endif
87 1.1 cgd
88 1.20 mycroft ehdr = mmap(NULL, _rtld_pagesz, PROT_READ, MAP_FILE | MAP_SHARED, fd,
89 1.16 mycroft (off_t)0);
90 1.20 mycroft if (ehdr == MAP_FAILED) {
91 1.4 christos _rtld_error("%s: read error: %s", path, xstrerror(errno));
92 1.4 christos return NULL;
93 1.4 christos }
94 1.4 christos /* Make sure the file is valid */
95 1.17 junyoung if (memcmp(ELFMAG, ehdr->e_ident, SELFMAG) != 0 ||
96 1.17 junyoung ehdr->e_ident[EI_CLASS] != ELFCLASS) {
97 1.4 christos _rtld_error("%s: unrecognized file format", path);
98 1.16 mycroft goto bad;
99 1.4 christos }
100 1.4 christos /* Elf_e_ident includes class */
101 1.17 junyoung if (ehdr->e_ident[EI_VERSION] != EV_CURRENT ||
102 1.17 junyoung ehdr->e_version != EV_CURRENT ||
103 1.17 junyoung ehdr->e_ident[EI_DATA] != ELFDEFNNAME(MACHDEP_ENDIANNESS)) {
104 1.16 mycroft _rtld_error("%s: unsupported file version", path);
105 1.16 mycroft goto bad;
106 1.16 mycroft }
107 1.17 junyoung if (ehdr->e_type != ET_EXEC && ehdr->e_type != ET_DYN) {
108 1.16 mycroft _rtld_error("%s: unsupported file type", path);
109 1.16 mycroft goto bad;
110 1.4 christos }
111 1.17 junyoung switch (ehdr->e_machine) {
112 1.4 christos ELFDEFNNAME(MACHDEP_ID_CASES)
113 1.4 christos default:
114 1.16 mycroft _rtld_error("%s: unsupported machine", path);
115 1.16 mycroft goto bad;
116 1.4 christos }
117 1.4 christos
118 1.4 christos /*
119 1.4 christos * We rely on the program header being in the first page. This is
120 1.4 christos * not strictly required by the ABI specification, but it seems to
121 1.4 christos * always true in practice. And, it simplifies things considerably.
122 1.4 christos */
123 1.17 junyoung assert(ehdr->e_phentsize == sizeof(Elf_Phdr));
124 1.19 junyoung assert(ehdr->e_phoff + ehdr->e_phnum * sizeof(Elf_Phdr) <=
125 1.19 junyoung _rtld_pagesz);
126 1.4 christos
127 1.4 christos /*
128 1.4 christos * Scan the program header entries, and save key information.
129 1.4 christos *
130 1.4 christos * We rely on there being exactly two load segments, text and data,
131 1.4 christos * in that order.
132 1.4 christos */
133 1.17 junyoung phdr = (Elf_Phdr *) ((caddr_t)ehdr + ehdr->e_phoff);
134 1.17 junyoung phlimit = phdr + ehdr->e_phnum;
135 1.4 christos nsegs = 0;
136 1.10 mycroft phdyn = phphdr = phinterp = NULL;
137 1.4 christos while (phdr < phlimit) {
138 1.4 christos switch (phdr->p_type) {
139 1.10 mycroft case PT_INTERP:
140 1.10 mycroft phinterp = phdr;
141 1.10 mycroft break;
142 1.1 cgd
143 1.8 kleink case PT_LOAD:
144 1.12 mycroft if (nsegs < 2)
145 1.12 mycroft segs[nsegs] = phdr;
146 1.4 christos ++nsegs;
147 1.4 christos break;
148 1.4 christos
149 1.8 kleink case PT_PHDR:
150 1.4 christos phphdr = phdr;
151 1.4 christos break;
152 1.4 christos
153 1.8 kleink case PT_DYNAMIC:
154 1.4 christos phdyn = phdr;
155 1.4 christos break;
156 1.4 christos }
157 1.1 cgd
158 1.4 christos ++phdr;
159 1.4 christos }
160 1.4 christos if (phdyn == NULL) {
161 1.12 mycroft _rtld_error("%s: not dynamically linked", path);
162 1.16 mycroft goto bad;
163 1.12 mycroft }
164 1.12 mycroft if (nsegs != 2) {
165 1.12 mycroft _rtld_error("%s: wrong number of segments (%d != 2)", path,
166 1.12 mycroft nsegs);
167 1.16 mycroft goto bad;
168 1.4 christos }
169 1.1 cgd
170 1.4 christos /*
171 1.11 chs * Map the entire address space of the object as a file
172 1.5 thorpej * region to stake out our contiguous region and establish a
173 1.11 chs * base for relocation. We use a file mapping so that
174 1.11 chs * the kernel will give us whatever alignment is appropriate
175 1.11 chs * for the platform we're running on.
176 1.5 thorpej *
177 1.11 chs * We map it using the text protection, map the data segment
178 1.11 chs * into the right place, then map an anon segment for the bss
179 1.11 chs * and unmap the gaps left by padding to alignment.
180 1.5 thorpej */
181 1.11 chs
182 1.4 christos base_offset = round_down(segs[0]->p_offset);
183 1.4 christos base_vaddr = round_down(segs[0]->p_vaddr);
184 1.4 christos base_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_memsz);
185 1.11 chs text_vlimit = round_up(segs[0]->p_vaddr + segs[0]->p_memsz);
186 1.4 christos mapsize = base_vlimit - base_vaddr;
187 1.11 chs
188 1.1 cgd #ifdef RTLD_LOADER
189 1.17 junyoung base_addr = ehdr->e_type == ET_EXEC ? (caddr_t) base_vaddr : NULL;
190 1.1 cgd #else
191 1.4 christos base_addr = NULL;
192 1.1 cgd #endif
193 1.1 cgd
194 1.11 chs mapbase = mmap(base_addr, mapsize, protflags(segs[0]->p_flags),
195 1.11 chs MAP_FILE | MAP_PRIVATE, fd, base_offset);
196 1.5 thorpej if (mapbase == MAP_FAILED) {
197 1.4 christos _rtld_error("mmap of entire address space failed: %s",
198 1.4 christos xstrerror(errno));
199 1.16 mycroft goto bad;
200 1.4 christos }
201 1.11 chs
202 1.5 thorpej base_addr = mapbase;
203 1.5 thorpej
204 1.4 christos /* Overlay the data segment onto the proper region. */
205 1.4 christos data_offset = round_down(segs[1]->p_offset);
206 1.4 christos data_vaddr = round_down(segs[1]->p_vaddr);
207 1.4 christos data_vlimit = round_up(segs[1]->p_vaddr + segs[1]->p_filesz);
208 1.4 christos data_addr = mapbase + (data_vaddr - base_vaddr);
209 1.4 christos if (mmap(data_addr, data_vlimit - data_vaddr,
210 1.11 chs protflags(segs[1]->p_flags),
211 1.11 chs MAP_FILE | MAP_PRIVATE | MAP_FIXED, fd, data_offset)
212 1.11 chs == MAP_FAILED) {
213 1.4 christos _rtld_error("mmap of data failed: %s", xstrerror(errno));
214 1.20 mycroft goto bad2;
215 1.11 chs }
216 1.11 chs
217 1.11 chs /* Overlay the bss segment onto the proper region. */
218 1.11 chs if (mmap(mapbase + data_vlimit - base_vaddr, base_vlimit - data_vlimit,
219 1.11 chs protflags(segs[1]->p_flags),
220 1.11 chs MAP_ANON | MAP_PRIVATE | MAP_FIXED, -1, 0)
221 1.11 chs == MAP_FAILED) {
222 1.11 chs _rtld_error("mmap of bss failed: %s", xstrerror(errno));
223 1.20 mycroft goto bad2;
224 1.4 christos }
225 1.5 thorpej
226 1.5 thorpej /* Unmap the gap between the text and data. */
227 1.5 thorpej gap_addr = base_addr + round_up(text_vlimit - base_vaddr);
228 1.5 thorpej gap_size = data_addr - gap_addr;
229 1.21 mycroft if (gap_size != 0 && mprotect(gap_addr, gap_size, PROT_NONE) == -1) {
230 1.21 mycroft _rtld_error("mprotect of text -> data gap failed: %s",
231 1.5 thorpej xstrerror(errno));
232 1.20 mycroft goto bad2;
233 1.5 thorpej }
234 1.5 thorpej
235 1.1 cgd #ifdef RTLD_LOADER
236 1.4 christos /* Clear any BSS in the last page of the data segment. */
237 1.4 christos clear_vaddr = segs[1]->p_vaddr + segs[1]->p_filesz;
238 1.4 christos clear_addr = mapbase + (clear_vaddr - base_vaddr);
239 1.4 christos if ((nclear = data_vlimit - clear_vaddr) > 0)
240 1.4 christos memset(clear_addr, 0, nclear);
241 1.4 christos
242 1.5 thorpej /* Non-file portion of BSS mapped above. */
243 1.1 cgd #endif
244 1.1 cgd
245 1.10 mycroft obj = _rtld_obj_new();
246 1.16 mycroft obj->path = path;
247 1.10 mycroft if (sb != NULL) {
248 1.10 mycroft obj->dev = sb->st_dev;
249 1.10 mycroft obj->ino = sb->st_ino;
250 1.10 mycroft }
251 1.4 christos obj->mapbase = mapbase;
252 1.4 christos obj->mapsize = mapsize;
253 1.4 christos obj->textsize = round_up(segs[0]->p_vaddr + segs[0]->p_memsz) -
254 1.4 christos base_vaddr;
255 1.4 christos obj->vaddrbase = base_vaddr;
256 1.4 christos obj->relocbase = mapbase - base_vaddr;
257 1.4 christos obj->dynamic = (Elf_Dyn *)(obj->relocbase + phdyn->p_vaddr);
258 1.17 junyoung if (ehdr->e_entry != 0)
259 1.17 junyoung obj->entry = (caddr_t)(obj->relocbase + ehdr->e_entry);
260 1.4 christos if (phphdr != NULL) {
261 1.4 christos obj->phdr = (const Elf_Phdr *)
262 1.4 christos (obj->relocbase + phphdr->p_vaddr);
263 1.4 christos obj->phsize = phphdr->p_memsz;
264 1.4 christos }
265 1.10 mycroft if (phinterp != NULL)
266 1.10 mycroft obj->interp = (const char *) (obj->relocbase + phinterp->p_vaddr);
267 1.17 junyoung obj->isdynamic = ehdr->e_type == ET_DYN;
268 1.10 mycroft
269 1.20 mycroft munmap(ehdr, _rtld_pagesz);
270 1.10 mycroft return obj;
271 1.16 mycroft
272 1.20 mycroft bad2:
273 1.20 mycroft munmap(mapbase, mapsize);
274 1.16 mycroft bad:
275 1.20 mycroft munmap(ehdr, _rtld_pagesz);
276 1.16 mycroft return NULL;
277 1.10 mycroft }
278 1.10 mycroft
279 1.10 mycroft void
280 1.10 mycroft _rtld_obj_free(obj)
281 1.10 mycroft Obj_Entry *obj;
282 1.10 mycroft {
283 1.10 mycroft Objlist_Entry *elm;
284 1.10 mycroft
285 1.10 mycroft free(obj->path);
286 1.10 mycroft while (obj->needed != NULL) {
287 1.10 mycroft Needed_Entry *needed = obj->needed;
288 1.10 mycroft obj->needed = needed->next;
289 1.10 mycroft free(needed);
290 1.10 mycroft }
291 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dldags)) != NULL) {
292 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dldags, link);
293 1.10 mycroft free(elm);
294 1.10 mycroft }
295 1.13 lukem while ((elm = SIMPLEQ_FIRST(&obj->dagmembers)) != NULL) {
296 1.13 lukem SIMPLEQ_REMOVE_HEAD(&obj->dagmembers, link);
297 1.10 mycroft free(elm);
298 1.10 mycroft }
299 1.10 mycroft free(obj);
300 1.10 mycroft }
301 1.10 mycroft
302 1.10 mycroft Obj_Entry *
303 1.10 mycroft _rtld_obj_new(void)
304 1.10 mycroft {
305 1.10 mycroft Obj_Entry *obj;
306 1.10 mycroft
307 1.10 mycroft obj = CNEW(Obj_Entry);
308 1.10 mycroft SIMPLEQ_INIT(&obj->dldags);
309 1.10 mycroft SIMPLEQ_INIT(&obj->dagmembers);
310 1.4 christos return obj;
311 1.1 cgd }
312 1.1 cgd
313 1.1 cgd /*
314 1.1 cgd * Given a set of ELF protection flags, return the corresponding protection
315 1.1 cgd * flags for MMAP.
316 1.1 cgd */
317 1.1 cgd static int
318 1.4 christos protflags(elfflags)
319 1.4 christos int elfflags;
320 1.1 cgd {
321 1.4 christos int prot = 0;
322 1.8 kleink if (elfflags & PF_R)
323 1.4 christos prot |= PROT_READ;
324 1.1 cgd #ifdef RTLD_LOADER
325 1.8 kleink if (elfflags & PF_W)
326 1.4 christos prot |= PROT_WRITE;
327 1.1 cgd #endif
328 1.8 kleink if (elfflags & PF_X)
329 1.4 christos prot |= PROT_EXEC;
330 1.4 christos return prot;
331 1.1 cgd }
332