load.c revision 1.18 1 1.18 mycroft /* $NetBSD: load.c,v 1.18 2002/09/12 22:56:28 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 /*
35 1.1 cgd * Dynamic linker for ELF.
36 1.1 cgd *
37 1.1 cgd * John Polstra <jdp (at) polstra.com>.
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd #include <err.h>
41 1.1 cgd #include <errno.h>
42 1.1 cgd #include <fcntl.h>
43 1.1 cgd #include <stdarg.h>
44 1.1 cgd #include <stdio.h>
45 1.1 cgd #include <stdlib.h>
46 1.1 cgd #include <string.h>
47 1.1 cgd #include <unistd.h>
48 1.1 cgd #include <sys/types.h>
49 1.6 christos #include <sys/param.h>
50 1.1 cgd #include <sys/mman.h>
51 1.6 christos #include <sys/sysctl.h>
52 1.1 cgd #include <dirent.h>
53 1.1 cgd
54 1.1 cgd #include "debug.h"
55 1.1 cgd #include "rtld.h"
56 1.1 cgd
57 1.7 christos static bool _rtld_load_by_name __P((const char *, Obj_Entry *, Needed_Entry **,
58 1.18 mycroft int));
59 1.13 mycroft
60 1.13 mycroft Objlist _rtld_list_global = /* Objects dlopened with RTLD_GLOBAL */
61 1.13 mycroft SIMPLEQ_HEAD_INITIALIZER(_rtld_list_global);
62 1.13 mycroft
63 1.13 mycroft void
64 1.13 mycroft _rtld_objlist_add(list, obj)
65 1.13 mycroft Objlist *list;
66 1.13 mycroft Obj_Entry *obj;
67 1.13 mycroft {
68 1.13 mycroft Objlist_Entry *elm;
69 1.13 mycroft
70 1.13 mycroft elm = NEW(Objlist_Entry);
71 1.13 mycroft elm->obj = obj;
72 1.13 mycroft SIMPLEQ_INSERT_TAIL(list, elm, link);
73 1.13 mycroft }
74 1.13 mycroft
75 1.13 mycroft Objlist_Entry *
76 1.13 mycroft _rtld_objlist_find(Objlist *list, const Obj_Entry *obj)
77 1.13 mycroft {
78 1.13 mycroft Objlist_Entry *elm;
79 1.13 mycroft
80 1.16 lukem SIMPLEQ_FOREACH(elm, list, link) {
81 1.13 mycroft if (elm->obj == obj)
82 1.13 mycroft return elm;
83 1.13 mycroft }
84 1.13 mycroft return NULL;
85 1.13 mycroft }
86 1.6 christos
87 1.1 cgd /*
88 1.1 cgd * Load a shared object into memory, if it is not already loaded. The
89 1.1 cgd * argument must be a string allocated on the heap. This function assumes
90 1.1 cgd * responsibility for freeing it when necessary.
91 1.1 cgd *
92 1.1 cgd * Returns a pointer to the Obj_Entry for the object. Returns NULL
93 1.1 cgd * on failure.
94 1.1 cgd */
95 1.1 cgd Obj_Entry *
96 1.18 mycroft _rtld_load_object(filepath, mode)
97 1.3 christos char *filepath;
98 1.12 mycroft int mode;
99 1.1 cgd {
100 1.3 christos Obj_Entry *obj;
101 1.5 mycroft int fd = -1;
102 1.5 mycroft struct stat sb;
103 1.1 cgd
104 1.3 christos for (obj = _rtld_objlist->next; obj != NULL; obj = obj->next)
105 1.3 christos if (strcmp(obj->path, filepath) == 0)
106 1.3 christos break;
107 1.3 christos
108 1.5 mycroft /*
109 1.5 mycroft * If we didn't find a match by pathname, open the file and check
110 1.5 mycroft * again by device and inode. This avoids false mismatches caused
111 1.5 mycroft * by multiple links or ".." in pathnames.
112 1.5 mycroft *
113 1.5 mycroft * To avoid a race, we open the file and use fstat() rather than
114 1.5 mycroft * using stat().
115 1.5 mycroft */
116 1.5 mycroft if (obj == NULL) {
117 1.3 christos if ((fd = open(filepath, O_RDONLY)) == -1) {
118 1.3 christos _rtld_error("Cannot open \"%s\"", filepath);
119 1.3 christos return NULL;
120 1.3 christos }
121 1.5 mycroft if (fstat(fd, &sb) == -1) {
122 1.5 mycroft _rtld_error("Cannot fstat \"%s\"", filepath);
123 1.5 mycroft close(fd);
124 1.5 mycroft return NULL;
125 1.5 mycroft }
126 1.5 mycroft for (obj = _rtld_objlist->next; obj != NULL; obj = obj->next) {
127 1.5 mycroft if (obj->ino == sb.st_ino && obj->dev == sb.st_dev) {
128 1.5 mycroft close(fd);
129 1.5 mycroft break;
130 1.5 mycroft }
131 1.5 mycroft }
132 1.5 mycroft }
133 1.5 mycroft
134 1.5 mycroft if (obj == NULL) { /* First use of this object, so we must map it in */
135 1.5 mycroft obj = _rtld_map_object(filepath, fd, &sb);
136 1.3 christos (void)close(fd);
137 1.3 christos if (obj == NULL) {
138 1.3 christos free(filepath);
139 1.3 christos return NULL;
140 1.3 christos }
141 1.3 christos obj->path = filepath;
142 1.3 christos _rtld_digest_dynamic(obj);
143 1.1 cgd
144 1.3 christos *_rtld_objtail = obj;
145 1.3 christos _rtld_objtail = &obj->next;
146 1.1 cgd #ifdef RTLD_LOADER
147 1.3 christos _rtld_linkmap_add(obj); /* for GDB */
148 1.1 cgd #endif
149 1.18 mycroft dbg((" %p .. %p: %s", obj->mapbase,
150 1.18 mycroft obj->mapbase + obj->mapsize - 1, obj->path));
151 1.18 mycroft if (obj->textrel)
152 1.18 mycroft dbg((" WARNING: %s has impure text", obj->path));
153 1.3 christos } else
154 1.3 christos free(filepath);
155 1.1 cgd
156 1.3 christos ++obj->refcount;
157 1.12 mycroft if ((mode & RTLD_GLOBAL) &&
158 1.12 mycroft _rtld_objlist_find(&_rtld_list_global, obj) == NULL)
159 1.12 mycroft _rtld_objlist_add(&_rtld_list_global, obj);
160 1.3 christos return obj;
161 1.1 cgd }
162 1.1 cgd
163 1.7 christos static bool
164 1.18 mycroft _rtld_load_by_name(name, obj, needed, mode)
165 1.6 christos const char *name;
166 1.6 christos Obj_Entry *obj;
167 1.7 christos Needed_Entry **needed;
168 1.12 mycroft int mode;
169 1.6 christos {
170 1.6 christos Library_Xform *x = _rtld_xforms;
171 1.6 christos Obj_Entry *o = NULL;
172 1.6 christos size_t i, j;
173 1.6 christos char *libpath;
174 1.7 christos bool got = false;
175 1.6 christos union {
176 1.6 christos int i;
177 1.6 christos char s[16];
178 1.6 christos } val;
179 1.6 christos
180 1.18 mycroft dbg(("load by name %s %p", name, x));
181 1.6 christos for (; x; x = x->next) {
182 1.6 christos if (strcmp(x->name, name) != 0)
183 1.6 christos continue;
184 1.6 christos
185 1.6 christos i = sizeof(val);
186 1.6 christos
187 1.9 christos if (sysctl(x->ctl, x->ctlmax, &val, &i, NULL, 0) == -1) {
188 1.17 abs xwarnx(_PATH_LD_HINTS ": unknown sysctl for %s", name);
189 1.6 christos break;
190 1.6 christos }
191 1.6 christos
192 1.9 christos switch (x->ctltype[x->ctlmax - 1]) {
193 1.6 christos case CTLTYPE_INT:
194 1.6 christos xsnprintf(val.s, sizeof(val.s), "%d", val.i);
195 1.6 christos break;
196 1.6 christos case CTLTYPE_STRING:
197 1.6 christos break;
198 1.6 christos default:
199 1.11 christos xwarnx("unsupported sysctl type %d",
200 1.9 christos x->ctltype[x->ctlmax - 1]);
201 1.6 christos break;
202 1.6 christos }
203 1.6 christos
204 1.18 mycroft dbg(("sysctl returns %s", val.s));
205 1.6 christos
206 1.6 christos for (i = 0; i < RTLD_MAX_ENTRY && x->entry[i].value != NULL;
207 1.6 christos i++) {
208 1.18 mycroft dbg(("entry %ld", (unsigned long)i));
209 1.6 christos if (strcmp(x->entry[i].value, val.s) == 0)
210 1.6 christos break;
211 1.6 christos }
212 1.6 christos
213 1.6 christos if (i == RTLD_MAX_ENTRY) {
214 1.11 christos xwarnx("sysctl value %s not found for lib%s",
215 1.6 christos val.s, name);
216 1.6 christos break;
217 1.6 christos }
218 1.6 christos /* XXX: This can mess up debuggers, cause we lie about
219 1.6 christos * what we loaded in the needed objects */
220 1.6 christos for (j = 0; j < RTLD_MAX_LIBRARY &&
221 1.6 christos x->entry[i].library[j] != NULL; j++) {
222 1.6 christos libpath = _rtld_find_library(
223 1.6 christos x->entry[i].library[j], obj);
224 1.6 christos if (libpath == NULL) {
225 1.11 christos xwarnx("could not load %s for %s",
226 1.6 christos x->entry[i].library[j], name);
227 1.6 christos continue;
228 1.6 christos }
229 1.18 mycroft o = _rtld_load_object(libpath, mode);
230 1.6 christos if (o == NULL)
231 1.6 christos continue;
232 1.7 christos got = true;
233 1.7 christos if (j == 0)
234 1.7 christos (*needed)->obj = o;
235 1.7 christos else {
236 1.7 christos /* make a new one and put it in the chain */
237 1.7 christos Needed_Entry *ne = xmalloc(sizeof(*ne));
238 1.7 christos ne->name = (*needed)->name;
239 1.7 christos ne->obj = o;
240 1.7 christos ne->next = (*needed)->next;
241 1.7 christos (*needed)->next = ne;
242 1.7 christos *needed = ne;
243 1.7 christos }
244 1.7 christos
245 1.6 christos }
246 1.6 christos
247 1.6 christos }
248 1.6 christos
249 1.7 christos if (got)
250 1.7 christos return true;
251 1.6 christos
252 1.6 christos libpath = _rtld_find_library(name, obj);
253 1.6 christos if (libpath == NULL)
254 1.7 christos return false;
255 1.18 mycroft return ((*needed)->obj = _rtld_load_object(libpath, mode)) != NULL;
256 1.6 christos }
257 1.6 christos
258 1.6 christos
259 1.1 cgd /*
260 1.1 cgd * Given a shared object, traverse its list of needed objects, and load
261 1.1 cgd * each of them. Returns 0 on success. Generates an error message and
262 1.1 cgd * returns -1 on failure.
263 1.1 cgd */
264 1.1 cgd int
265 1.18 mycroft _rtld_load_needed_objects(first, mode)
266 1.3 christos Obj_Entry *first;
267 1.12 mycroft int mode;
268 1.1 cgd {
269 1.3 christos Obj_Entry *obj;
270 1.3 christos int status = 0;
271 1.1 cgd
272 1.3 christos for (obj = first; obj != NULL; obj = obj->next) {
273 1.3 christos Needed_Entry *needed;
274 1.1 cgd
275 1.3 christos for (needed = obj->needed; needed != NULL;
276 1.3 christos needed = needed->next) {
277 1.3 christos const char *name = obj->strtab + needed->name;
278 1.18 mycroft if (!_rtld_load_by_name(name, obj, &needed, mode))
279 1.6 christos status = -1; /* FIXME - cleanup */
280 1.1 cgd #ifdef RTLD_LOADER
281 1.3 christos if (status == -1)
282 1.3 christos return status;
283 1.1 cgd #endif
284 1.3 christos }
285 1.1 cgd }
286 1.1 cgd
287 1.3 christos return status;
288 1.1 cgd }
289 1.4 kleink
290 1.4 kleink #ifdef RTLD_LOADER
291 1.4 kleink int
292 1.18 mycroft _rtld_preload(preload_path)
293 1.4 kleink const char *preload_path;
294 1.4 kleink {
295 1.4 kleink const char *path;
296 1.4 kleink char *cp, *buf;
297 1.4 kleink int status = 0;
298 1.4 kleink
299 1.4 kleink if (preload_path != NULL) {
300 1.4 kleink cp = buf = xstrdup(preload_path);
301 1.15 skrll while ((path = strsep(&cp, " :")) != NULL && status == 0) {
302 1.18 mycroft if (!_rtld_load_object(xstrdup(path), RTLD_GLOBAL))
303 1.4 kleink status = -1;
304 1.18 mycroft else
305 1.4 kleink dbg((" preloaded \"%s\"", path));
306 1.4 kleink }
307 1.4 kleink free(buf);
308 1.4 kleink }
309 1.4 kleink
310 1.4 kleink return (status);
311 1.4 kleink }
312 1.4 kleink #endif
313