rtld.c revision 1.1 1 1.1 cgd /* $NetBSD: rtld.c,v 1.1 1996/12/16 20:38:03 cgd 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.1 cgd #include <sys/mman.h>
50 1.1 cgd #include <dirent.h>
51 1.1 cgd
52 1.1 cgd #include <ctype.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.1 cgd /* FIXME - Theses don't belong here. */
58 1.1 cgd #define RTLD_LAZY 1
59 1.1 cgd #define RTLD_NOW 2
60 1.1 cgd
61 1.1 cgd /*
62 1.1 cgd * Debugging support.
63 1.1 cgd */
64 1.1 cgd
65 1.1 cgd typedef void (*funcptr)(void);
66 1.1 cgd
67 1.1 cgd /*
68 1.1 cgd * Function declarations.
69 1.1 cgd */
70 1.1 cgd static void _rtld_init(caddr_t);
71 1.1 cgd static void _rtld_exit(void);
72 1.1 cgd
73 1.1 cgd /*
74 1.1 cgd * Data declarations.
75 1.1 cgd */
76 1.1 cgd static char *error_message; /* Message for dlopen(), or NULL */
77 1.1 cgd
78 1.1 cgd struct r_debug _rtld_debug; /* for GDB; */
79 1.1 cgd bool _rtld_trust; /* False for setuid and setgid programs */
80 1.1 cgd Obj_Entry *_rtld_objlist; /* Head of linked list of shared objects */
81 1.1 cgd Obj_Entry **_rtld_objtail; /* Link field of last object in list */
82 1.1 cgd Obj_Entry *_rtld_objmain; /* The main program shared object */
83 1.1 cgd Obj_Entry _rtld_objself; /* The dynamic linker shared object */
84 1.1 cgd
85 1.1 cgd Search_Path *_rtld_paths;
86 1.1 cgd /*
87 1.1 cgd * Global declarations normally provided by crt0.
88 1.1 cgd */
89 1.1 cgd char *__progname;
90 1.1 cgd char **environ;
91 1.1 cgd
92 1.1 cgd #ifdef OLD_GOT
93 1.1 cgd extern Elf_Addr _GLOBAL_OFFSET_TABLE_[];
94 1.1 cgd #else
95 1.1 cgd extern Elf_Addr _GLOBAL_OFFSET_TABLE_[];
96 1.1 cgd extern Elf_Dyn _DYNAMIC;
97 1.1 cgd #endif
98 1.1 cgd
99 1.1 cgd static void
100 1.1 cgd _rtld_call_fini_functions(
101 1.1 cgd Obj_Entry *first)
102 1.1 cgd {
103 1.1 cgd Obj_Entry *obj;
104 1.1 cgd
105 1.1 cgd for (obj = first; obj != NULL; obj = obj->next)
106 1.1 cgd if (obj->fini != NULL)
107 1.1 cgd (*obj->fini)();
108 1.1 cgd }
109 1.1 cgd
110 1.1 cgd static void
111 1.1 cgd _rtld_call_init_functions(
112 1.1 cgd Obj_Entry *first)
113 1.1 cgd {
114 1.1 cgd if (first != NULL) {
115 1.1 cgd _rtld_call_init_functions(first->next);
116 1.1 cgd if (first->init != NULL)
117 1.1 cgd (*first->init)();
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd /*
123 1.1 cgd * Initialize the dynamic linker. The argument is the address at which
124 1.1 cgd * the dynamic linker has been mapped into memory. The primary task of
125 1.1 cgd * this function is to relocate the dynamic linker.
126 1.1 cgd */
127 1.1 cgd static void
128 1.1 cgd _rtld_init(
129 1.1 cgd caddr_t mapbase)
130 1.1 cgd {
131 1.1 cgd _rtld_add_paths(&_rtld_paths, RTLD_DEFAULT_LIBRARY_PATH);
132 1.1 cgd
133 1.1 cgd /* Conjure up an Obj_Entry structure for the dynamic linker. */
134 1.1 cgd
135 1.1 cgd _rtld_objself.path = _PATH_RTLD;
136 1.1 cgd _rtld_objself.rtld = true;
137 1.1 cgd _rtld_objself.mapbase = mapbase;
138 1.1 cgd _rtld_objself.relocbase = mapbase;
139 1.1 cgd _rtld_objself.pltgot = NULL;
140 1.1 cgd #ifdef OLD_GOT
141 1.1 cgd _rtld_objself.dynamic = (Elf_Dyn *) _GLOBAL_OFFSET_TABLE_[0];
142 1.1 cgd #else
143 1.1 cgd _rtld_objself.dynamic = &_DYNAMIC;
144 1.1 cgd #endif
145 1.1 cgd
146 1.1 cgd _rtld_digest_dynamic(&_rtld_objself);
147 1.1 cgd #ifdef __alpha__
148 1.1 cgd /* XXX XXX XXX */
149 1.1 cgd _rtld_objself.pltgot = NULL;
150 1.1 cgd #endif
151 1.1 cgd assert(_rtld_objself.needed == NULL);
152 1.1 cgd assert(!_rtld_objself.textrel);
153 1.1 cgd
154 1.1 cgd /* Set up the _rtld_objlist pointer, so that rtld symbols can be found. */
155 1.1 cgd _rtld_objlist = &_rtld_objself;
156 1.1 cgd
157 1.1 cgd _rtld_relocate_objects(&_rtld_objself, true);
158 1.1 cgd
159 1.1 cgd /* Make the object list empty again. */
160 1.1 cgd _rtld_objlist = NULL;
161 1.1 cgd _rtld_objtail = &_rtld_objlist;
162 1.1 cgd
163 1.1 cgd _rtld_debug.r_brk = _rtld_debug_state;
164 1.1 cgd _rtld_debug.r_state = RT_CONSISTENT;
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd /*
169 1.1 cgd * Cleanup procedure. It will be called (by the atexit() mechanism) just
170 1.1 cgd * before the process exits.
171 1.1 cgd */
172 1.1 cgd static void
173 1.1 cgd _rtld_exit(void)
174 1.1 cgd {
175 1.1 cgd dbg("rtld_exit()");
176 1.1 cgd
177 1.1 cgd _rtld_call_fini_functions(_rtld_objlist->next);
178 1.1 cgd }
179 1.1 cgd
180 1.1 cgd /*
182 1.1 cgd * Main entry point for dynamic linking. The argument is the stack
183 1.1 cgd * pointer. The stack is expected to be laid out as described in the
184 1.1 cgd * SVR4 ABI specification, Intel 386 Processor Supplement. Specifically,
185 1.1 cgd * the stack pointer points to a word containing ARGC. Following that
186 1.1 cgd * in the stack is a null-terminated sequence of pointers to argument
187 1.1 cgd * strings. Then comes a null-terminated sequence of pointers to
188 1.1 cgd * environment strings. Finally, there is a sequence of "auxiliary
189 1.1 cgd * vector" entries.
190 1.1 cgd *
191 1.1 cgd * This function returns the entry point for the main program in %eax,
192 1.1 cgd * and the dynamic linker's exit procedure in %edx. We accomplish this
193 1.1 cgd * by declaring the return value to have the 64-bit type "long long".
194 1.1 cgd * Such values are returned with their most-significant 32 bits in %edx,
195 1.1 cgd * and their least-significant 32 bits in %eax.
196 1.1 cgd */
197 1.1 cgd Elf_Addr
198 1.1 cgd _rtld(
199 1.1 cgd Elf_Word *sp)
200 1.1 cgd {
201 1.1 cgd const AuxInfo *aux_info[AUX_count];
202 1.1 cgd int i = 0;
203 1.1 cgd char **env;
204 1.1 cgd const AuxInfo *aux;
205 1.1 cgd const AuxInfo *auxp;
206 1.1 cgd Elf_Word * const osp = sp;
207 1.1 cgd bool bind_now = 0;
208 1.1 cgd const char *ld_bind_now;
209 1.1 cgd const char **argv;
210 1.1 cgd
211 1.1 cgd /*
212 1.1 cgd * On entry, the dynamic linker itself has not been relocated yet.
213 1.1 cgd * Be very careful not to reference any global data until after
214 1.1 cgd * _rtld_init has returned. It is OK to reference file-scope statics
215 1.1 cgd * and string constants, and to call static and global functions.
216 1.1 cgd */
217 1.1 cgd /* Find the auxiliary vector on the stack. */
218 1.1 cgd /* first Elf_Word reserved to address of exit routine */
219 1.1 cgd #ifdef RTLD_DEBUG
220 1.1 cgd xprintf("sp = %p, argc = %d, argv = %p <%s>\n", sp, sp[2], &sp[3], sp[3]);
221 1.1 cgd xprintf("got is at %p, dynamic is at %p\n", _GLOBAL_OFFSET_TABLE_, &_DYNAMIC);
222 1.1 cgd debug = 1;
223 1.1 cgd xprintf("_ctype_ is %p\n", _ctype_);
224 1.1 cgd #endif
225 1.1 cgd
226 1.1 cgd sp += 2; /* skip over return argument space */
227 1.1 cgd argv = (const char **) &sp[1];
228 1.1 cgd sp += sp[0] + 2; /* Skip over argc, arguments, and NULL terminator */
229 1.1 cgd env = (char **) sp;
230 1.1 cgd while (*sp++ != 0) { /* Skip over environment, and NULL terminator */
231 1.1 cgd #ifdef RTLD_DEBUG
232 1.1 cgd xprintf("env[%d] = %p\n", i++, sp[-1]);
233 1.1 cgd #endif
234 1.1 cgd }
235 1.1 cgd aux = (const AuxInfo *) sp;
236 1.1 cgd
237 1.1 cgd /* Digest the auxiliary vector. */
238 1.1 cgd for (i = 0; i < AUX_count; ++i)
239 1.1 cgd aux_info[i] = NULL;
240 1.1 cgd for (auxp = aux; auxp->au_id != AUX_null; ++auxp) {
241 1.1 cgd if (auxp->au_id < AUX_count)
242 1.1 cgd aux_info[auxp->au_id] = auxp;
243 1.1 cgd }
244 1.1 cgd
245 1.1 cgd /* Initialize and relocate ourselves. */
246 1.1 cgd assert(aux_info[AUX_base] != NULL);
247 1.1 cgd _rtld_init((caddr_t) aux_info[AUX_base]->au_v);
248 1.1 cgd
249 1.1 cgd #ifdef RTLD_DEBUG
250 1.1 cgd xprintf("_ctype_ is %p\n", _ctype_);
251 1.1 cgd #endif
252 1.1 cgd if (aux_info[AUX_debug] != NULL) /* Set debugging level */
253 1.1 cgd debug = aux_info[AUX_debug]->au_v;
254 1.1 cgd
255 1.1 cgd __progname = _rtld_objself.path;
256 1.1 cgd environ = env;
257 1.1 cgd
258 1.1 cgd _rtld_trust = geteuid() == getuid() && getegid() == getgid();
259 1.1 cgd
260 1.1 cgd ld_bind_now = getenv("LD_BIND_NOW");
261 1.1 cgd if (ld_bind_now != NULL && *ld_bind_now != '\0')
262 1.1 cgd bind_now = true;
263 1.1 cgd if (_rtld_trust) {
264 1.1 cgd const char *ld_debug = getenv("LD_DEBUG");
265 1.1 cgd if (ld_debug != NULL && *ld_debug != '\0')
266 1.1 cgd debug = 1;
267 1.1 cgd _rtld_add_paths(&_rtld_paths, getenv("LD_LIBRARY_PATH"));
268 1.1 cgd }
269 1.1 cgd
270 1.1 cgd dbg("%s is initialized, base address = %p", __progname,
271 1.1 cgd (caddr_t) aux_info[AUX_base]->au_v);
272 1.1 cgd
273 1.1 cgd /*
274 1.1 cgd * Load the main program, or process its program header if it is
275 1.1 cgd * already loaded.
276 1.1 cgd */
277 1.1 cgd if (aux_info[AUX_execfd] != NULL) { /* Load the main program. */
278 1.1 cgd int fd = aux_info[AUX_execfd]->au_v;
279 1.1 cgd dbg("loading main program");
280 1.1 cgd _rtld_objmain = _rtld_map_object(argv[0], fd);
281 1.1 cgd close(fd);
282 1.1 cgd if (_rtld_objmain == NULL)
283 1.1 cgd _rtld_die();
284 1.1 cgd } else { /* Main program already loaded. */
285 1.1 cgd const Elf_Phdr *phdr;
286 1.1 cgd int phnum;
287 1.1 cgd caddr_t entry;
288 1.1 cgd
289 1.1 cgd dbg("processing main program's program header");
290 1.1 cgd assert(aux_info[AUX_phdr] != NULL);
291 1.1 cgd phdr = (const Elf_Phdr *) aux_info[AUX_phdr]->au_v;
292 1.1 cgd assert(aux_info[AUX_phnum] != NULL);
293 1.1 cgd phnum = aux_info[AUX_phnum]->au_v;
294 1.1 cgd assert(aux_info[AUX_phent] != NULL);
295 1.1 cgd assert(aux_info[AUX_phent]->au_v == sizeof(Elf_Phdr));
296 1.1 cgd assert(aux_info[AUX_entry] != NULL);
297 1.1 cgd entry = (caddr_t) aux_info[AUX_entry]->au_v;
298 1.1 cgd _rtld_objmain = _rtld_digest_phdr(phdr, phnum, entry);
299 1.1 cgd }
300 1.1 cgd
301 1.1 cgd _rtld_objmain->path = xstrdup("main program");
302 1.1 cgd _rtld_objmain->mainprog = true;
303 1.1 cgd _rtld_digest_dynamic(_rtld_objmain);
304 1.1 cgd
305 1.1 cgd _rtld_linkmap_add(_rtld_objmain);
306 1.1 cgd _rtld_linkmap_add(&_rtld_objself);
307 1.1 cgd
308 1.1 cgd /* Link the main program into the list of objects. */
309 1.1 cgd *_rtld_objtail = _rtld_objmain;
310 1.1 cgd _rtld_objtail = &_rtld_objmain->next;
311 1.1 cgd ++_rtld_objmain->refcount;
312 1.1 cgd
313 1.1 cgd dbg("loading needed objects");
314 1.1 cgd if (_rtld_load_needed_objects(_rtld_objmain) == -1)
315 1.1 cgd _rtld_die();
316 1.1 cgd
317 1.1 cgd dbg("relocating objects");
318 1.1 cgd if (_rtld_relocate_objects(_rtld_objmain, bind_now) == -1)
319 1.1 cgd _rtld_die();
320 1.1 cgd
321 1.1 cgd dbg("doing copy relocations");
322 1.1 cgd if (_rtld_do_copy_relocations(_rtld_objmain) == -1)
323 1.1 cgd _rtld_die();
324 1.1 cgd
325 1.1 cgd dbg("calling _init functions");
326 1.1 cgd _rtld_call_init_functions(_rtld_objmain->next);
327 1.1 cgd
328 1.1 cgd dbg("transferring control to program entry point = %p",
329 1.1 cgd _rtld_objmain->entry);
330 1.1 cgd
331 1.1 cgd /* Return with the entry point and the exit procedure in at the top of
332 1.1 cgd * stack.
333 1.1 cgd */
334 1.1 cgd
335 1.1 cgd _rtld_debug_state(); /* say hello to gdb! */
336 1.1 cgd
337 1.1 cgd ((void **) osp)[0] = _rtld_exit;
338 1.1 cgd ((void **) osp)[1] = _rtld_objmain;
339 1.1 cgd return (Elf_Addr) _rtld_objmain->entry;
340 1.1 cgd }
341 1.1 cgd
342 1.1 cgd void
343 1.1 cgd _rtld_die(
344 1.1 cgd void)
345 1.1 cgd {
346 1.1 cgd const char *msg = _rtld_dlerror();
347 1.1 cgd
348 1.1 cgd if (msg == NULL)
349 1.1 cgd msg = "Fatal error";
350 1.1 cgd xerrx(1, "%s\n", msg);
351 1.1 cgd }
352 1.1 cgd
353 1.1 cgd static Obj_Entry *
354 1.1 cgd _rtld_dlcheck(
355 1.1 cgd void *handle)
356 1.1 cgd {
357 1.1 cgd Obj_Entry *obj;
358 1.1 cgd
359 1.1 cgd for (obj = _rtld_objlist; obj != NULL; obj = obj->next)
360 1.1 cgd if (obj == (Obj_Entry *) handle)
361 1.1 cgd break;
362 1.1 cgd
363 1.1 cgd if (obj == NULL || obj->dl_refcount == 0) {
364 1.1 cgd xwarnx("Invalid shared object handle %p", handle);
365 1.1 cgd return NULL;
366 1.1 cgd }
367 1.1 cgd return obj;
368 1.1 cgd }
369 1.1 cgd
370 1.1 cgd static void
371 1.1 cgd _rtld_unref_object_dag(
372 1.1 cgd Obj_Entry *root)
373 1.1 cgd {
374 1.1 cgd assert(root->refcount != 0);
375 1.1 cgd --root->refcount;
376 1.1 cgd if (root->refcount == 0) {
377 1.1 cgd const Needed_Entry *needed;
378 1.1 cgd
379 1.1 cgd for (needed = root->needed; needed != NULL; needed = needed->next)
380 1.1 cgd _rtld_unref_object_dag(needed->obj);
381 1.1 cgd }
382 1.1 cgd }
383 1.1 cgd
384 1.1 cgd int
385 1.1 cgd _rtld_dlclose(
386 1.1 cgd void *handle)
387 1.1 cgd {
388 1.1 cgd Obj_Entry *root = _rtld_dlcheck(handle);
389 1.1 cgd
390 1.1 cgd if (root == NULL)
391 1.1 cgd return -1;
392 1.1 cgd
393 1.1 cgd _rtld_debug.r_state = RT_DELETE;
394 1.1 cgd _rtld_debug_state();
395 1.1 cgd
396 1.1 cgd --root->dl_refcount;
397 1.1 cgd _rtld_unref_object_dag(root);
398 1.1 cgd if (root->refcount == 0) { /* We are finished with some objects. */
399 1.1 cgd Obj_Entry *obj;
400 1.1 cgd Obj_Entry **linkp;
401 1.1 cgd
402 1.1 cgd /* Finalize objects that are about to be unmapped. */
403 1.1 cgd for (obj = _rtld_objlist->next; obj != NULL; obj = obj->next)
404 1.1 cgd if (obj->refcount == 0 && obj->fini != NULL)
405 1.1 cgd (*obj->fini)();
406 1.1 cgd
407 1.1 cgd /* Unmap all objects that are no longer referenced. */
408 1.1 cgd linkp = &_rtld_objlist->next;
409 1.1 cgd while((obj = *linkp) != NULL) {
410 1.1 cgd if (obj->refcount == 0) {
411 1.1 cgd munmap(obj->mapbase, obj->mapsize);
412 1.1 cgd free(obj->path);
413 1.1 cgd while(obj->needed != NULL) {
414 1.1 cgd Needed_Entry *needed = obj->needed;
415 1.1 cgd obj->needed = needed->next;
416 1.1 cgd free(needed);
417 1.1 cgd }
418 1.1 cgd _rtld_linkmap_delete(obj);
419 1.1 cgd *linkp = obj->next;
420 1.1 cgd free(obj);
421 1.1 cgd } else
422 1.1 cgd linkp = &obj->next;
423 1.1 cgd }
424 1.1 cgd }
425 1.1 cgd
426 1.1 cgd _rtld_debug.r_state = RT_CONSISTENT;
427 1.1 cgd _rtld_debug_state();
428 1.1 cgd
429 1.1 cgd return 0;
430 1.1 cgd }
431 1.1 cgd
432 1.1 cgd char *
433 1.1 cgd _rtld_dlerror(
434 1.1 cgd void)
435 1.1 cgd {
436 1.1 cgd char *msg = error_message;
437 1.1 cgd error_message = NULL;
438 1.1 cgd return msg;
439 1.1 cgd }
440 1.1 cgd
441 1.1 cgd void *
442 1.1 cgd _rtld_dlopen(
443 1.1 cgd const char *name,
444 1.1 cgd int mode)
445 1.1 cgd {
446 1.1 cgd Obj_Entry **old_obj_tail = _rtld_objtail;
447 1.1 cgd Obj_Entry *obj = NULL;
448 1.1 cgd
449 1.1 cgd _rtld_debug.r_state = RT_ADD;
450 1.1 cgd _rtld_debug_state();
451 1.1 cgd
452 1.1 cgd if (name == NULL) {
453 1.1 cgd obj = _rtld_objmain;
454 1.1 cgd } else {
455 1.1 cgd char *path = _rtld_find_library(name, NULL);
456 1.1 cgd if (path != NULL)
457 1.1 cgd obj = _rtld_load_object(path);
458 1.1 cgd }
459 1.1 cgd
460 1.1 cgd if (obj != NULL) {
461 1.1 cgd ++obj->dl_refcount;
462 1.1 cgd if (*old_obj_tail != NULL) { /* We loaded something new. */
463 1.1 cgd assert(*old_obj_tail == obj);
464 1.1 cgd
465 1.1 cgd /* FIXME - Clean up properly after an error. */
466 1.1 cgd if (_rtld_load_needed_objects(obj) == -1) {
467 1.1 cgd --obj->dl_refcount;
468 1.1 cgd obj = NULL;
469 1.1 cgd } else if (_rtld_relocate_objects(obj, mode == RTLD_NOW) == -1) {
470 1.1 cgd --obj->dl_refcount;
471 1.1 cgd obj = NULL;
472 1.1 cgd } else {
473 1.1 cgd _rtld_call_init_functions(obj);
474 1.1 cgd }
475 1.1 cgd }
476 1.1 cgd }
477 1.1 cgd
478 1.1 cgd _rtld_debug.r_state = RT_CONSISTENT;
479 1.1 cgd _rtld_debug_state();
480 1.1 cgd
481 1.1 cgd return obj;
482 1.1 cgd }
483 1.1 cgd
484 1.1 cgd void *
485 1.1 cgd _rtld_dlsym(
486 1.1 cgd void *handle,
487 1.1 cgd const char *name)
488 1.1 cgd {
489 1.1 cgd const Obj_Entry *obj = _rtld_dlcheck(handle);
490 1.1 cgd const Elf_Sym *def;
491 1.1 cgd const Obj_Entry *defobj;
492 1.1 cgd
493 1.1 cgd if (obj == NULL)
494 1.1 cgd return NULL;
495 1.1 cgd
496 1.1 cgd /*
497 1.1 cgd * FIXME - This isn't correct. The search should include the whole
498 1.1 cgd * DAG rooted at the given object.
499 1.1 cgd */
500 1.1 cgd def = _rtld_find_symdef(_rtld_objlist, 0, name, obj, &defobj, false);
501 1.1 cgd if (def != NULL)
502 1.1 cgd return defobj->relocbase + def->st_value;
503 1.1 cgd
504 1.1 cgd _rtld_error("Undefined symbol \"%s\"", name);
505 1.1 cgd return NULL;
506 1.1 cgd }
507 1.1 cgd
508 1.1 cgd /*
509 1.1 cgd * Error reporting function. Use it like printf. If formats the message
510 1.1 cgd * into a buffer, and sets things up so that the next call to dlerror()
511 1.1 cgd * will return the message.
512 1.1 cgd */
513 1.1 cgd void
514 1.1 cgd _rtld_error(
515 1.1 cgd const char *fmt, ...)
516 1.1 cgd {
517 1.1 cgd static char buf[512];
518 1.1 cgd va_list ap;
519 1.1 cgd
520 1.1 cgd va_start(ap, fmt);
521 1.1 cgd xvsnprintf(buf, sizeof buf, fmt, ap);
522 1.1 cgd error_message = buf;
523 1.1 cgd va_end(ap);
524 1.1 cgd }
525 1.1 cgd
526 1.1 cgd void
528 1.1 cgd _rtld_debug_state(
529 1.1 cgd void)
530 1.1 cgd {
531 1.1 cgd /* do nothing */
532 1.1 cgd }
533 1.1 cgd
534 1.1 cgd void
535 1.1 cgd _rtld_linkmap_add(
536 1.1 cgd Obj_Entry *obj)
537 1.1 cgd {
538 1.1 cgd struct link_map *l = &obj->linkmap;
539 1.1 cgd struct link_map *prev;
540 1.1 cgd
541 1.1 cgd obj->linkmap.l_name = obj->path;
542 1.1 cgd obj->linkmap.l_addr = obj->mapbase;
543 1.1 cgd obj->linkmap.l_ld = obj->dynamic;
544 1.1 cgd
545 1.1 cgd if (_rtld_debug.r_map == NULL) {
546 1.1 cgd _rtld_debug.r_map = l;
547 1.1 cgd return;
548 1.1 cgd }
549 1.1 cgd
550 1.1 cgd for (prev = _rtld_debug.r_map; prev->l_next != NULL; prev = prev->l_next)
551 1.1 cgd ;
552 1.1 cgd l->l_prev = prev;
553 1.1 cgd prev->l_next = l;
554 1.1 cgd l->l_next = NULL;
555 1.1 cgd }
556 1.1 cgd
557 1.1 cgd void
558 1.1 cgd _rtld_linkmap_delete(
559 1.1 cgd Obj_Entry *obj)
560 1.1 cgd {
561 1.1 cgd struct link_map *l = &obj->linkmap;
562 1.1 cgd
563 1.1 cgd if (l->l_prev == NULL) {
564 1.1 cgd if ((_rtld_debug.r_map = l->l_next) != NULL)
565 1.1 cgd l->l_next->l_prev = NULL;
566 1.1 cgd return;
567 1.1 cgd }
568 1.1 cgd
569 if ((l->l_prev->l_next = l->l_next) != NULL)
570 l->l_next->l_prev = l->l_prev;
571 }
572
573