2 * Copyright 1996, 1997, 1998, 1999, 2000 John D. Polstra.
3 * Copyright 2003 Alexander Kabaev <kan@FreeBSD.ORG>.
4 * Copyright 2009-2012 Konstantin Belousov <kib@FreeBSD.ORG>.
5 * Copyright 2012 John Marino <draco@marino.st>.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * Dynamic linker for ELF.
34 * John Polstra <jdp@polstra.com>.
38 #error "GCC is needed to compile this file"
41 #include <sys/param.h>
42 #include <sys/mount.h>
45 #include <sys/sysctl.h>
47 #include <sys/utsname.h>
48 #include <sys/ktrace.h>
64 #include "rtld_printf.h"
68 #define PATH_RTLD "/libexec/ld-elf.so.1"
70 #define PATH_RTLD "/libexec/ld-elf32.so.1"
74 typedef void (*func_ptr_type)();
75 typedef void * (*path_enum_proc) (const char *path, size_t len, void *arg);
78 * Function declarations.
80 static const char *basename(const char *);
81 static void die(void) __dead2;
82 static void digest_dynamic1(Obj_Entry *, int, const Elf_Dyn **,
83 const Elf_Dyn **, const Elf_Dyn **);
84 static void digest_dynamic2(Obj_Entry *, const Elf_Dyn *, const Elf_Dyn *,
86 static void digest_dynamic(Obj_Entry *, int);
87 static Obj_Entry *digest_phdr(const Elf_Phdr *, int, caddr_t, const char *);
88 static Obj_Entry *dlcheck(void *);
89 static Obj_Entry *dlopen_object(const char *name, int fd, Obj_Entry *refobj,
90 int lo_flags, int mode, RtldLockState *lockstate);
91 static Obj_Entry *do_load_object(int, const char *, char *, struct stat *, int);
92 static int do_search_info(const Obj_Entry *obj, int, struct dl_serinfo *);
93 static bool donelist_check(DoneList *, const Obj_Entry *);
94 static void errmsg_restore(char *);
95 static char *errmsg_save(void);
96 static void *fill_search_info(const char *, size_t, void *);
97 static char *find_library(const char *, const Obj_Entry *);
98 static const char *gethints(bool);
99 static void init_dag(Obj_Entry *);
100 static void init_rtld(caddr_t, Elf_Auxinfo **);
101 static void initlist_add_neededs(Needed_Entry *, Objlist *);
102 static void initlist_add_objects(Obj_Entry *, Obj_Entry **, Objlist *);
103 static void linkmap_add(Obj_Entry *);
104 static void linkmap_delete(Obj_Entry *);
105 static void load_filtees(Obj_Entry *, int flags, RtldLockState *);
106 static void unload_filtees(Obj_Entry *);
107 static int load_needed_objects(Obj_Entry *, int);
108 static int load_preload_objects(void);
109 static Obj_Entry *load_object(const char *, int fd, const Obj_Entry *, int);
110 static void map_stacks_exec(RtldLockState *);
111 static Obj_Entry *obj_from_addr(const void *);
112 static void objlist_call_fini(Objlist *, Obj_Entry *, RtldLockState *);
113 static void objlist_call_init(Objlist *, RtldLockState *);
114 static void objlist_clear(Objlist *);
115 static Objlist_Entry *objlist_find(Objlist *, const Obj_Entry *);
116 static void objlist_init(Objlist *);
117 static void objlist_push_head(Objlist *, Obj_Entry *);
118 static void objlist_push_tail(Objlist *, Obj_Entry *);
119 static void objlist_put_after(Objlist *, Obj_Entry *, Obj_Entry *);
120 static void objlist_remove(Objlist *, Obj_Entry *);
121 static void *path_enumerate(const char *, path_enum_proc, void *);
122 static int relocate_object_dag(Obj_Entry *root, bool bind_now,
123 Obj_Entry *rtldobj, int flags, RtldLockState *lockstate);
124 static int relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj,
125 int flags, RtldLockState *lockstate);
126 static int relocate_objects(Obj_Entry *, bool, Obj_Entry *, int,
128 static int resolve_objects_ifunc(Obj_Entry *first, bool bind_now,
129 int flags, RtldLockState *lockstate);
130 static int rtld_dirname(const char *, char *);
131 static int rtld_dirname_abs(const char *, char *);
132 static void *rtld_dlopen(const char *name, int fd, int mode);
133 static void rtld_exit(void);
134 static char *search_library_path(const char *, const char *);
135 static const void **get_program_var_addr(const char *, RtldLockState *);
136 static void set_program_var(const char *, const void *);
137 static int symlook_default(SymLook *, const Obj_Entry *refobj);
138 static int symlook_global(SymLook *, DoneList *);
139 static void symlook_init_from_req(SymLook *, const SymLook *);
140 static int symlook_list(SymLook *, const Objlist *, DoneList *);
141 static int symlook_needed(SymLook *, const Needed_Entry *, DoneList *);
142 static int symlook_obj1_sysv(SymLook *, const Obj_Entry *);
143 static int symlook_obj1_gnu(SymLook *, const Obj_Entry *);
144 static void trace_loaded_objects(Obj_Entry *);
145 static void unlink_object(Obj_Entry *);
146 static void unload_object(Obj_Entry *);
147 static void unref_dag(Obj_Entry *);
148 static void ref_dag(Obj_Entry *);
149 static char *origin_subst_one(char *, const char *, const char *, bool);
150 static char *origin_subst(char *, const char *);
151 static void preinit_main(void);
152 static int rtld_verify_versions(const Objlist *);
153 static int rtld_verify_object_versions(Obj_Entry *);
154 static void object_add_name(Obj_Entry *, const char *);
155 static int object_match_name(const Obj_Entry *, const char *);
156 static void ld_utrace_log(int, void *, void *, size_t, int, const char *);
157 static void rtld_fill_dl_phdr_info(const Obj_Entry *obj,
158 struct dl_phdr_info *phdr_info);
159 static uint32_t gnu_hash(const char *);
160 static bool matched_symbol(SymLook *, const Obj_Entry *, Sym_Match_Result *,
161 const unsigned long);
163 void r_debug_state(struct r_debug *, struct link_map *) __noinline;
164 void _r_debug_postinit(struct link_map *) __noinline;
169 static char *error_message; /* Message for dlerror(), or NULL */
170 struct r_debug r_debug; /* for GDB; */
171 static bool libmap_disable; /* Disable libmap */
172 static bool ld_loadfltr; /* Immediate filters processing */
173 static char *libmap_override; /* Maps to use in addition to libmap.conf */
174 static bool trust; /* False for setuid and setgid programs */
175 static bool dangerous_ld_env; /* True if environment variables have been
176 used to affect the libraries loaded */
177 static char *ld_bind_now; /* Environment variable for immediate binding */
178 static char *ld_debug; /* Environment variable for debugging */
179 static char *ld_library_path; /* Environment variable for search path */
180 static char *ld_preload; /* Environment variable for libraries to
182 static char *ld_elf_hints_path; /* Environment variable for alternative hints path */
183 static char *ld_tracing; /* Called from ldd to print libs */
184 static char *ld_utrace; /* Use utrace() to log events. */
185 static Obj_Entry *obj_list; /* Head of linked list of shared objects */
186 static Obj_Entry **obj_tail; /* Link field of last object in list */
187 static Obj_Entry *obj_main; /* The main program shared object */
188 static Obj_Entry obj_rtld; /* The dynamic linker shared object */
189 static unsigned int obj_count; /* Number of objects in obj_list */
190 static unsigned int obj_loads; /* Number of objects in obj_list */
192 static Objlist list_global = /* Objects dlopened with RTLD_GLOBAL */
193 STAILQ_HEAD_INITIALIZER(list_global);
194 static Objlist list_main = /* Objects loaded at program startup */
195 STAILQ_HEAD_INITIALIZER(list_main);
196 static Objlist list_fini = /* Objects needing fini() calls */
197 STAILQ_HEAD_INITIALIZER(list_fini);
199 Elf_Sym sym_zero; /* For resolving undefined weak refs. */
201 #define GDB_STATE(s,m) r_debug.r_state = s; r_debug_state(&r_debug,m);
203 extern Elf_Dyn _DYNAMIC;
204 #pragma weak _DYNAMIC
205 #ifndef RTLD_IS_DYNAMIC
206 #define RTLD_IS_DYNAMIC() (&_DYNAMIC != NULL)
209 int osreldate, pagesize;
211 long __stack_chk_guard[8] = {0, 0, 0, 0, 0, 0, 0, 0};
213 static int stack_prot = PROT_READ | PROT_WRITE | RTLD_DEFAULT_STACK_EXEC;
214 static int max_stack_flags;
217 * Global declarations normally provided by crt1. The dynamic linker is
218 * not built with crt1, so we have to provide them ourselves.
224 * Used to pass argc, argv to init functions.
230 * Globals to control TLS allocation.
232 size_t tls_last_offset; /* Static TLS offset of last module */
233 size_t tls_last_size; /* Static TLS size of last module */
234 size_t tls_static_space; /* Static TLS space allocated */
235 size_t tls_static_max_align;
236 int tls_dtv_generation = 1; /* Used to detect when dtv size changes */
237 int tls_max_index = 1; /* Largest module index allocated */
239 bool ld_library_path_rpath = false;
242 * Fill in a DoneList with an allocation large enough to hold all of
243 * the currently-loaded objects. Keep this as a macro since it calls
244 * alloca and we want that to occur within the scope of the caller.
246 #define donelist_init(dlp) \
247 ((dlp)->objs = alloca(obj_count * sizeof (dlp)->objs[0]), \
248 assert((dlp)->objs != NULL), \
249 (dlp)->num_alloc = obj_count, \
252 #define UTRACE_DLOPEN_START 1
253 #define UTRACE_DLOPEN_STOP 2
254 #define UTRACE_DLCLOSE_START 3
255 #define UTRACE_DLCLOSE_STOP 4
256 #define UTRACE_LOAD_OBJECT 5
257 #define UTRACE_UNLOAD_OBJECT 6
258 #define UTRACE_ADD_RUNDEP 7
259 #define UTRACE_PRELOAD_FINISHED 8
260 #define UTRACE_INIT_CALL 9
261 #define UTRACE_FINI_CALL 10
264 char sig[4]; /* 'RTLD' */
267 void *mapbase; /* Used for 'parent' and 'init/fini' */
269 int refcnt; /* Used for 'mode' */
270 char name[MAXPATHLEN];
273 #define LD_UTRACE(e, h, mb, ms, r, n) do { \
274 if (ld_utrace != NULL) \
275 ld_utrace_log(e, h, mb, ms, r, n); \
279 ld_utrace_log(int event, void *handle, void *mapbase, size_t mapsize,
280 int refcnt, const char *name)
282 struct utrace_rtld ut;
290 ut.mapbase = mapbase;
291 ut.mapsize = mapsize;
293 bzero(ut.name, sizeof(ut.name));
295 strlcpy(ut.name, name, sizeof(ut.name));
296 utrace(&ut, sizeof(ut));
300 * Main entry point for dynamic linking. The first argument is the
301 * stack pointer. The stack is expected to be laid out as described
302 * in the SVR4 ABI specification, Intel 386 Processor Supplement.
303 * Specifically, the stack pointer points to a word containing
304 * ARGC. Following that in the stack is a null-terminated sequence
305 * of pointers to argument strings. Then comes a null-terminated
306 * sequence of pointers to environment strings. Finally, there is a
307 * sequence of "auxiliary vector" entries.
309 * The second argument points to a place to store the dynamic linker's
310 * exit procedure pointer and the third to a place to store the main
313 * The return value is the main program's entry point.
316 _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp)
318 Elf_Auxinfo *aux_info[AT_COUNT];
326 Objlist_Entry *entry;
328 Obj_Entry **preload_tail;
329 Obj_Entry *last_interposer;
331 RtldLockState lockstate;
332 char *library_path_rpath;
337 * On entry, the dynamic linker itself has not been relocated yet.
338 * Be very careful not to reference any global data until after
339 * init_rtld has returned. It is OK to reference file-scope statics
340 * and string constants, and to call static and global functions.
343 /* Find the auxiliary vector on the stack. */
346 sp += argc + 1; /* Skip over arguments and NULL terminator */
348 while (*sp++ != 0) /* Skip over environment, and NULL terminator */
350 aux = (Elf_Auxinfo *) sp;
352 /* Digest the auxiliary vector. */
353 for (i = 0; i < AT_COUNT; i++)
355 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) {
356 if (auxp->a_type < AT_COUNT)
357 aux_info[auxp->a_type] = auxp;
360 /* Initialize and relocate ourselves. */
361 assert(aux_info[AT_BASE] != NULL);
362 init_rtld((caddr_t) aux_info[AT_BASE]->a_un.a_ptr, aux_info);
364 __progname = obj_rtld.path;
365 argv0 = argv[0] != NULL ? argv[0] : "(null)";
370 if (aux_info[AT_CANARY] != NULL &&
371 aux_info[AT_CANARY]->a_un.a_ptr != NULL) {
372 i = aux_info[AT_CANARYLEN]->a_un.a_val;
373 if (i > sizeof(__stack_chk_guard))
374 i = sizeof(__stack_chk_guard);
375 memcpy(__stack_chk_guard, aux_info[AT_CANARY]->a_un.a_ptr, i);
380 len = sizeof(__stack_chk_guard);
381 if (sysctl(mib, 2, __stack_chk_guard, &len, NULL, 0) == -1 ||
382 len != sizeof(__stack_chk_guard)) {
383 /* If sysctl was unsuccessful, use the "terminator canary". */
384 ((unsigned char *)(void *)__stack_chk_guard)[0] = 0;
385 ((unsigned char *)(void *)__stack_chk_guard)[1] = 0;
386 ((unsigned char *)(void *)__stack_chk_guard)[2] = '\n';
387 ((unsigned char *)(void *)__stack_chk_guard)[3] = 255;
391 trust = !issetugid();
393 ld_bind_now = getenv(LD_ "BIND_NOW");
395 * If the process is tainted, then we un-set the dangerous environment
396 * variables. The process will be marked as tainted until setuid(2)
397 * is called. If any child process calls setuid(2) we do not want any
398 * future processes to honor the potentially un-safe variables.
401 if (unsetenv(LD_ "PRELOAD") || unsetenv(LD_ "LIBMAP") ||
402 unsetenv(LD_ "LIBRARY_PATH") || unsetenv(LD_ "LIBMAP_DISABLE") ||
403 unsetenv(LD_ "DEBUG") || unsetenv(LD_ "ELF_HINTS_PATH") ||
404 unsetenv(LD_ "LOADFLTR") || unsetenv(LD_ "LIBRARY_PATH_RPATH")) {
405 _rtld_error("environment corrupt; aborting");
409 ld_debug = getenv(LD_ "DEBUG");
410 libmap_disable = getenv(LD_ "LIBMAP_DISABLE") != NULL;
411 libmap_override = getenv(LD_ "LIBMAP");
412 ld_library_path = getenv(LD_ "LIBRARY_PATH");
413 ld_preload = getenv(LD_ "PRELOAD");
414 ld_elf_hints_path = getenv(LD_ "ELF_HINTS_PATH");
415 ld_loadfltr = getenv(LD_ "LOADFLTR") != NULL;
416 library_path_rpath = getenv(LD_ "LIBRARY_PATH_RPATH");
417 if (library_path_rpath != NULL) {
418 if (library_path_rpath[0] == 'y' ||
419 library_path_rpath[0] == 'Y' ||
420 library_path_rpath[0] == '1')
421 ld_library_path_rpath = true;
423 ld_library_path_rpath = false;
425 dangerous_ld_env = libmap_disable || (libmap_override != NULL) ||
426 (ld_library_path != NULL) || (ld_preload != NULL) ||
427 (ld_elf_hints_path != NULL) || ld_loadfltr;
428 ld_tracing = getenv(LD_ "TRACE_LOADED_OBJECTS");
429 ld_utrace = getenv(LD_ "UTRACE");
431 if ((ld_elf_hints_path == NULL) || strlen(ld_elf_hints_path) == 0)
432 ld_elf_hints_path = _PATH_ELF_HINTS;
434 if (ld_debug != NULL && *ld_debug != '\0')
436 dbg("%s is initialized, base address = %p", __progname,
437 (caddr_t) aux_info[AT_BASE]->a_un.a_ptr);
438 dbg("RTLD dynamic = %p", obj_rtld.dynamic);
439 dbg("RTLD pltgot = %p", obj_rtld.pltgot);
441 dbg("initializing thread locks");
445 * Load the main program, or process its program header if it is
448 if (aux_info[AT_EXECFD] != NULL) { /* Load the main program. */
449 int fd = aux_info[AT_EXECFD]->a_un.a_val;
450 dbg("loading main program");
451 obj_main = map_object(fd, argv0, NULL);
453 if (obj_main == NULL)
455 max_stack_flags = obj->stack_flags;
456 } else { /* Main program already loaded. */
457 const Elf_Phdr *phdr;
461 dbg("processing main program's program header");
462 assert(aux_info[AT_PHDR] != NULL);
463 phdr = (const Elf_Phdr *) aux_info[AT_PHDR]->a_un.a_ptr;
464 assert(aux_info[AT_PHNUM] != NULL);
465 phnum = aux_info[AT_PHNUM]->a_un.a_val;
466 assert(aux_info[AT_PHENT] != NULL);
467 assert(aux_info[AT_PHENT]->a_un.a_val == sizeof(Elf_Phdr));
468 assert(aux_info[AT_ENTRY] != NULL);
469 entry = (caddr_t) aux_info[AT_ENTRY]->a_un.a_ptr;
470 if ((obj_main = digest_phdr(phdr, phnum, entry, argv0)) == NULL)
474 if (aux_info[AT_EXECPATH] != 0) {
476 char buf[MAXPATHLEN];
478 kexecpath = aux_info[AT_EXECPATH]->a_un.a_ptr;
479 dbg("AT_EXECPATH %p %s", kexecpath, kexecpath);
480 if (kexecpath[0] == '/')
481 obj_main->path = kexecpath;
482 else if (getcwd(buf, sizeof(buf)) == NULL ||
483 strlcat(buf, "/", sizeof(buf)) >= sizeof(buf) ||
484 strlcat(buf, kexecpath, sizeof(buf)) >= sizeof(buf))
485 obj_main->path = xstrdup(argv0);
487 obj_main->path = xstrdup(buf);
489 dbg("No AT_EXECPATH");
490 obj_main->path = xstrdup(argv0);
492 dbg("obj_main path %s", obj_main->path);
493 obj_main->mainprog = true;
495 if (aux_info[AT_STACKPROT] != NULL &&
496 aux_info[AT_STACKPROT]->a_un.a_val != 0)
497 stack_prot = aux_info[AT_STACKPROT]->a_un.a_val;
500 * Get the actual dynamic linker pathname from the executable if
501 * possible. (It should always be possible.) That ensures that
502 * gdb will find the right dynamic linker even if a non-standard
505 if (obj_main->interp != NULL &&
506 strcmp(obj_main->interp, obj_rtld.path) != 0) {
508 obj_rtld.path = xstrdup(obj_main->interp);
509 __progname = obj_rtld.path;
512 digest_dynamic(obj_main, 0);
513 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d",
514 obj_main->path, obj_main->valid_hash_sysv, obj_main->valid_hash_gnu,
515 obj_main->dynsymcount);
517 linkmap_add(obj_main);
518 linkmap_add(&obj_rtld);
520 /* Link the main program into the list of objects. */
521 *obj_tail = obj_main;
522 obj_tail = &obj_main->next;
526 /* Initialize a fake symbol for resolving undefined weak references. */
527 sym_zero.st_info = ELF_ST_INFO(STB_GLOBAL, STT_NOTYPE);
528 sym_zero.st_shndx = SHN_UNDEF;
529 sym_zero.st_value = -(uintptr_t)obj_main->relocbase;
532 libmap_disable = (bool)lm_init(libmap_override);
534 dbg("loading LD_PRELOAD libraries");
535 if (load_preload_objects() == -1)
537 preload_tail = obj_tail;
539 dbg("loading needed objects");
540 if (load_needed_objects(obj_main, 0) == -1)
543 /* Make a list of all objects loaded at startup. */
544 last_interposer = obj_main;
545 for (obj = obj_list; obj != NULL; obj = obj->next) {
546 if (obj->z_interpose && obj != obj_main) {
547 objlist_put_after(&list_main, last_interposer, obj);
548 last_interposer = obj;
550 objlist_push_tail(&list_main, obj);
555 dbg("checking for required versions");
556 if (rtld_verify_versions(&list_main) == -1 && !ld_tracing)
559 if (ld_tracing) { /* We're done */
560 trace_loaded_objects(obj_main);
564 if (getenv(LD_ "DUMP_REL_PRE") != NULL) {
565 dump_relocations(obj_main);
570 * Processing tls relocations requires having the tls offsets
571 * initialized. Prepare offsets before starting initial
572 * relocation processing.
574 dbg("initializing initial thread local storage offsets");
575 STAILQ_FOREACH(entry, &list_main, link) {
577 * Allocate all the initial objects out of the static TLS
578 * block even if they didn't ask for it.
580 allocate_tls_offset(entry->obj);
583 if (relocate_objects(obj_main,
584 ld_bind_now != NULL && *ld_bind_now != '\0',
585 &obj_rtld, SYMLOOK_EARLY, NULL) == -1)
588 dbg("doing copy relocations");
589 if (do_copy_relocations(obj_main) == -1)
592 if (getenv(LD_ "DUMP_REL_POST") != NULL) {
593 dump_relocations(obj_main);
598 * Setup TLS for main thread. This must be done after the
599 * relocations are processed, since tls initialization section
600 * might be the subject for relocations.
602 dbg("initializing initial thread local storage");
603 allocate_initial_tls(obj_list);
605 dbg("initializing key program variables");
606 set_program_var("__progname", argv[0] != NULL ? basename(argv[0]) : "");
607 set_program_var("environ", env);
608 set_program_var("__elf_aux_vector", aux);
610 /* Make a list of init functions to call. */
611 objlist_init(&initlist);
612 initlist_add_objects(obj_list, preload_tail, &initlist);
614 r_debug_state(NULL, &obj_main->linkmap); /* say hello to gdb! */
616 map_stacks_exec(NULL);
618 dbg("resolving ifuncs");
619 if (resolve_objects_ifunc(obj_main,
620 ld_bind_now != NULL && *ld_bind_now != '\0', SYMLOOK_EARLY,
624 if (!obj_main->crt_no_init) {
626 * Make sure we don't call the main program's init and fini
627 * functions for binaries linked with old crt1 which calls
630 obj_main->init = obj_main->fini = (Elf_Addr)NULL;
631 obj_main->preinit_array = obj_main->init_array =
632 obj_main->fini_array = (Elf_Addr)NULL;
635 wlock_acquire(rtld_bind_lock, &lockstate);
636 if (obj_main->crt_no_init)
638 objlist_call_init(&initlist, &lockstate);
639 _r_debug_postinit(&obj_main->linkmap);
640 objlist_clear(&initlist);
641 dbg("loading filtees");
642 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
643 if (ld_loadfltr || obj->z_loadfltr)
644 load_filtees(obj, 0, &lockstate);
646 lock_release(rtld_bind_lock, &lockstate);
648 dbg("transferring control to program entry point = %p", obj_main->entry);
650 /* Return the exit procedure and the program entry point. */
651 *exit_proc = rtld_exit;
653 return (func_ptr_type) obj_main->entry;
657 rtld_resolve_ifunc(const Obj_Entry *obj, const Elf_Sym *def)
662 ptr = (void *)make_function_pointer(def, obj);
663 target = ((Elf_Addr (*)(void))ptr)();
664 return ((void *)target);
668 _rtld_bind(Obj_Entry *obj, Elf_Size reloff)
672 const Obj_Entry *defobj;
675 RtldLockState lockstate;
677 rlock_acquire(rtld_bind_lock, &lockstate);
678 if (sigsetjmp(lockstate.env, 0) != 0)
679 lock_upgrade(rtld_bind_lock, &lockstate);
681 rel = (const Elf_Rel *) ((caddr_t) obj->pltrel + reloff);
683 rel = (const Elf_Rel *) ((caddr_t) obj->pltrela + reloff);
685 where = (Elf_Addr *) (obj->relocbase + rel->r_offset);
686 def = find_symdef(ELF_R_SYM(rel->r_info), obj, &defobj, true, NULL,
690 if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
691 target = (Elf_Addr)rtld_resolve_ifunc(defobj, def);
693 target = (Elf_Addr)(defobj->relocbase + def->st_value);
695 dbg("\"%s\" in \"%s\" ==> %p in \"%s\"",
696 defobj->strtab + def->st_name, basename(obj->path),
697 (void *)target, basename(defobj->path));
700 * Write the new contents for the jmpslot. Note that depending on
701 * architecture, the value which we need to return back to the
702 * lazy binding trampoline may or may not be the target
703 * address. The value returned from reloc_jmpslot() is the value
704 * that the trampoline needs.
706 target = reloc_jmpslot(where, target, defobj, obj, rel);
707 lock_release(rtld_bind_lock, &lockstate);
712 * Error reporting function. Use it like printf. If formats the message
713 * into a buffer, and sets things up so that the next call to dlerror()
714 * will return the message.
717 _rtld_error(const char *fmt, ...)
719 static char buf[512];
723 rtld_vsnprintf(buf, sizeof buf, fmt, ap);
729 * Return a dynamically-allocated copy of the current error message, if any.
734 return error_message == NULL ? NULL : xstrdup(error_message);
738 * Restore the current error message from a copy which was previously saved
739 * by errmsg_save(). The copy is freed.
742 errmsg_restore(char *saved_msg)
744 if (saved_msg == NULL)
745 error_message = NULL;
747 _rtld_error("%s", saved_msg);
753 basename(const char *name)
755 const char *p = strrchr(name, '/');
756 return p != NULL ? p + 1 : name;
759 static struct utsname uts;
762 origin_subst_one(char *real, const char *kw, const char *subst,
765 char *p, *p1, *res, *resp;
766 int subst_len, kw_len, subst_count, old_len, new_len;
771 * First, count the number of the keyword occurences, to
772 * preallocate the final string.
774 for (p = real, subst_count = 0;; p = p1 + kw_len, subst_count++) {
781 * If the keyword is not found, just return.
783 if (subst_count == 0)
784 return (may_free ? real : xstrdup(real));
787 * There is indeed something to substitute. Calculate the
788 * length of the resulting string, and allocate it.
790 subst_len = strlen(subst);
791 old_len = strlen(real);
792 new_len = old_len + (subst_len - kw_len) * subst_count;
793 res = xmalloc(new_len + 1);
796 * Now, execute the substitution loop.
798 for (p = real, resp = res, *resp = '\0';;) {
801 /* Copy the prefix before keyword. */
802 memcpy(resp, p, p1 - p);
804 /* Keyword replacement. */
805 memcpy(resp, subst, subst_len);
813 /* Copy to the end of string and finish. */
821 origin_subst(char *real, const char *origin_path)
823 char *res1, *res2, *res3, *res4;
825 if (uts.sysname[0] == '\0') {
826 if (uname(&uts) != 0) {
827 _rtld_error("utsname failed: %d", errno);
831 res1 = origin_subst_one(real, "$ORIGIN", origin_path, false);
832 res2 = origin_subst_one(res1, "$OSNAME", uts.sysname, true);
833 res3 = origin_subst_one(res2, "$OSREL", uts.release, true);
834 res4 = origin_subst_one(res3, "$PLATFORM", uts.machine, true);
841 const char *msg = dlerror();
845 rtld_fdputstr(STDERR_FILENO, msg);
846 rtld_fdputchar(STDERR_FILENO, '\n');
851 * Process a shared object's DYNAMIC section, and save the important
852 * information in its Obj_Entry structure.
855 digest_dynamic1(Obj_Entry *obj, int early, const Elf_Dyn **dyn_rpath,
856 const Elf_Dyn **dyn_soname, const Elf_Dyn **dyn_runpath)
859 Needed_Entry **needed_tail = &obj->needed;
860 Needed_Entry **needed_filtees_tail = &obj->needed_filtees;
861 Needed_Entry **needed_aux_filtees_tail = &obj->needed_aux_filtees;
862 const Elf_Hashelt *hashtab;
863 const Elf32_Word *hashval;
864 Elf32_Word bkt, nmaskwords;
866 int plttype = DT_REL;
872 obj->bind_now = false;
873 for (dynp = obj->dynamic; dynp->d_tag != DT_NULL; dynp++) {
874 switch (dynp->d_tag) {
877 obj->rel = (const Elf_Rel *) (obj->relocbase + dynp->d_un.d_ptr);
881 obj->relsize = dynp->d_un.d_val;
885 assert(dynp->d_un.d_val == sizeof(Elf_Rel));
889 obj->pltrel = (const Elf_Rel *)
890 (obj->relocbase + dynp->d_un.d_ptr);
894 obj->pltrelsize = dynp->d_un.d_val;
898 obj->rela = (const Elf_Rela *) (obj->relocbase + dynp->d_un.d_ptr);
902 obj->relasize = dynp->d_un.d_val;
906 assert(dynp->d_un.d_val == sizeof(Elf_Rela));
910 plttype = dynp->d_un.d_val;
911 assert(dynp->d_un.d_val == DT_REL || plttype == DT_RELA);
915 obj->symtab = (const Elf_Sym *)
916 (obj->relocbase + dynp->d_un.d_ptr);
920 assert(dynp->d_un.d_val == sizeof(Elf_Sym));
924 obj->strtab = (const char *) (obj->relocbase + dynp->d_un.d_ptr);
928 obj->strsize = dynp->d_un.d_val;
932 obj->verneed = (const Elf_Verneed *) (obj->relocbase +
937 obj->verneednum = dynp->d_un.d_val;
941 obj->verdef = (const Elf_Verdef *) (obj->relocbase +
946 obj->verdefnum = dynp->d_un.d_val;
950 obj->versyms = (const Elf_Versym *)(obj->relocbase +
956 hashtab = (const Elf_Hashelt *)(obj->relocbase +
958 obj->nbuckets = hashtab[0];
959 obj->nchains = hashtab[1];
960 obj->buckets = hashtab + 2;
961 obj->chains = obj->buckets + obj->nbuckets;
962 obj->valid_hash_sysv = obj->nbuckets > 0 && obj->nchains > 0 &&
963 obj->buckets != NULL;
969 hashtab = (const Elf_Hashelt *)(obj->relocbase +
971 obj->nbuckets_gnu = hashtab[0];
972 obj->symndx_gnu = hashtab[1];
973 nmaskwords = hashtab[2];
974 bloom_size32 = (__ELF_WORD_SIZE / 32) * nmaskwords;
975 obj->maskwords_bm_gnu = nmaskwords - 1;
976 obj->shift2_gnu = hashtab[3];
977 obj->bloom_gnu = (Elf_Addr *) (hashtab + 4);
978 obj->buckets_gnu = hashtab + 4 + bloom_size32;
979 obj->chain_zero_gnu = obj->buckets_gnu + obj->nbuckets_gnu -
981 /* Number of bitmask words is required to be power of 2 */
982 obj->valid_hash_gnu = powerof2(nmaskwords) &&
983 obj->nbuckets_gnu > 0 && obj->buckets_gnu != NULL;
989 Needed_Entry *nep = NEW(Needed_Entry);
990 nep->name = dynp->d_un.d_val;
995 needed_tail = &nep->next;
1001 Needed_Entry *nep = NEW(Needed_Entry);
1002 nep->name = dynp->d_un.d_val;
1006 *needed_filtees_tail = nep;
1007 needed_filtees_tail = &nep->next;
1013 Needed_Entry *nep = NEW(Needed_Entry);
1014 nep->name = dynp->d_un.d_val;
1018 *needed_aux_filtees_tail = nep;
1019 needed_aux_filtees_tail = &nep->next;
1024 obj->pltgot = (Elf_Addr *) (obj->relocbase + dynp->d_un.d_ptr);
1028 obj->textrel = true;
1032 obj->symbolic = true;
1037 * We have to wait until later to process this, because we
1038 * might not have gotten the address of the string table yet.
1048 *dyn_runpath = dynp;
1052 obj->init = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1055 case DT_PREINIT_ARRAY:
1056 obj->preinit_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1059 case DT_PREINIT_ARRAYSZ:
1060 obj->preinit_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1064 obj->init_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1067 case DT_INIT_ARRAYSZ:
1068 obj->init_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1072 obj->fini = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1076 obj->fini_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1079 case DT_FINI_ARRAYSZ:
1080 obj->fini_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1084 * Don't process DT_DEBUG on MIPS as the dynamic section
1085 * is mapped read-only. DT_MIPS_RLD_MAP is used instead.
1090 /* XXX - not implemented yet */
1092 dbg("Filling in DT_DEBUG entry");
1093 ((Elf_Dyn*)dynp)->d_un.d_ptr = (Elf_Addr) &r_debug;
1098 if ((dynp->d_un.d_val & DF_ORIGIN) && trust)
1099 obj->z_origin = true;
1100 if (dynp->d_un.d_val & DF_SYMBOLIC)
1101 obj->symbolic = true;
1102 if (dynp->d_un.d_val & DF_TEXTREL)
1103 obj->textrel = true;
1104 if (dynp->d_un.d_val & DF_BIND_NOW)
1105 obj->bind_now = true;
1106 /*if (dynp->d_un.d_val & DF_STATIC_TLS)
1110 case DT_MIPS_LOCAL_GOTNO:
1111 obj->local_gotno = dynp->d_un.d_val;
1114 case DT_MIPS_SYMTABNO:
1115 obj->symtabno = dynp->d_un.d_val;
1118 case DT_MIPS_GOTSYM:
1119 obj->gotsym = dynp->d_un.d_val;
1122 case DT_MIPS_RLD_MAP:
1123 *((Elf_Addr *)(dynp->d_un.d_ptr)) = (Elf_Addr) &r_debug;
1128 if (dynp->d_un.d_val & DF_1_NOOPEN)
1129 obj->z_noopen = true;
1130 if ((dynp->d_un.d_val & DF_1_ORIGIN) && trust)
1131 obj->z_origin = true;
1132 /*if (dynp->d_un.d_val & DF_1_GLOBAL)
1134 if (dynp->d_un.d_val & DF_1_BIND_NOW)
1135 obj->bind_now = true;
1136 if (dynp->d_un.d_val & DF_1_NODELETE)
1137 obj->z_nodelete = true;
1138 if (dynp->d_un.d_val & DF_1_LOADFLTR)
1139 obj->z_loadfltr = true;
1140 if (dynp->d_un.d_val & DF_1_INTERPOSE)
1141 obj->z_interpose = true;
1142 if (dynp->d_un.d_val & DF_1_NODEFLIB)
1143 obj->z_nodeflib = true;
1148 dbg("Ignoring d_tag %ld = %#lx", (long)dynp->d_tag,
1155 obj->traced = false;
1157 if (plttype == DT_RELA) {
1158 obj->pltrela = (const Elf_Rela *) obj->pltrel;
1160 obj->pltrelasize = obj->pltrelsize;
1161 obj->pltrelsize = 0;
1164 /* Determine size of dynsym table (equal to nchains of sysv hash) */
1165 if (obj->valid_hash_sysv)
1166 obj->dynsymcount = obj->nchains;
1167 else if (obj->valid_hash_gnu) {
1168 obj->dynsymcount = 0;
1169 for (bkt = 0; bkt < obj->nbuckets_gnu; bkt++) {
1170 if (obj->buckets_gnu[bkt] == 0)
1172 hashval = &obj->chain_zero_gnu[obj->buckets_gnu[bkt]];
1175 while ((*hashval++ & 1u) == 0);
1177 obj->dynsymcount += obj->symndx_gnu;
1182 digest_dynamic2(Obj_Entry *obj, const Elf_Dyn *dyn_rpath,
1183 const Elf_Dyn *dyn_soname, const Elf_Dyn *dyn_runpath)
1186 if (obj->z_origin && obj->origin_path == NULL) {
1187 obj->origin_path = xmalloc(PATH_MAX);
1188 if (rtld_dirname_abs(obj->path, obj->origin_path) == -1)
1192 if (dyn_runpath != NULL) {
1193 obj->runpath = (char *)obj->strtab + dyn_runpath->d_un.d_val;
1195 obj->runpath = origin_subst(obj->runpath, obj->origin_path);
1197 else if (dyn_rpath != NULL) {
1198 obj->rpath = (char *)obj->strtab + dyn_rpath->d_un.d_val;
1200 obj->rpath = origin_subst(obj->rpath, obj->origin_path);
1203 if (dyn_soname != NULL)
1204 object_add_name(obj, obj->strtab + dyn_soname->d_un.d_val);
1208 digest_dynamic(Obj_Entry *obj, int early)
1210 const Elf_Dyn *dyn_rpath;
1211 const Elf_Dyn *dyn_soname;
1212 const Elf_Dyn *dyn_runpath;
1214 digest_dynamic1(obj, early, &dyn_rpath, &dyn_soname, &dyn_runpath);
1215 digest_dynamic2(obj, dyn_rpath, dyn_soname, dyn_runpath);
1219 * Process a shared object's program header. This is used only for the
1220 * main program, when the kernel has already loaded the main program
1221 * into memory before calling the dynamic linker. It creates and
1222 * returns an Obj_Entry structure.
1225 digest_phdr(const Elf_Phdr *phdr, int phnum, caddr_t entry, const char *path)
1228 const Elf_Phdr *phlimit = phdr + phnum;
1230 Elf_Addr note_start, note_end;
1234 for (ph = phdr; ph < phlimit; ph++) {
1235 if (ph->p_type != PT_PHDR)
1239 obj->phsize = ph->p_memsz;
1240 obj->relocbase = (caddr_t)phdr - ph->p_vaddr;
1244 obj->stack_flags = PF_X | PF_R | PF_W;
1246 for (ph = phdr; ph < phlimit; ph++) {
1247 switch (ph->p_type) {
1250 obj->interp = (const char *)(ph->p_vaddr + obj->relocbase);
1254 if (nsegs == 0) { /* First load segment */
1255 obj->vaddrbase = trunc_page(ph->p_vaddr);
1256 obj->mapbase = obj->vaddrbase + obj->relocbase;
1257 obj->textsize = round_page(ph->p_vaddr + ph->p_memsz) -
1259 } else { /* Last load segment */
1260 obj->mapsize = round_page(ph->p_vaddr + ph->p_memsz) -
1267 obj->dynamic = (const Elf_Dyn *)(ph->p_vaddr + obj->relocbase);
1272 obj->tlssize = ph->p_memsz;
1273 obj->tlsalign = ph->p_align;
1274 obj->tlsinitsize = ph->p_filesz;
1275 obj->tlsinit = (void*)(ph->p_vaddr + obj->relocbase);
1279 obj->stack_flags = ph->p_flags;
1283 obj->relro_page = obj->relocbase + trunc_page(ph->p_vaddr);
1284 obj->relro_size = round_page(ph->p_memsz);
1288 note_start = (Elf_Addr)obj->relocbase + ph->p_vaddr;
1289 note_end = note_start + ph->p_filesz;
1290 digest_notes(obj, note_start, note_end);
1295 _rtld_error("%s: too few PT_LOAD segments", path);
1304 digest_notes(Obj_Entry *obj, Elf_Addr note_start, Elf_Addr note_end)
1306 const Elf_Note *note;
1307 const char *note_name;
1310 for (note = (const Elf_Note *)note_start; (Elf_Addr)note < note_end;
1311 note = (const Elf_Note *)((const char *)(note + 1) +
1312 roundup2(note->n_namesz, sizeof(Elf32_Addr)) +
1313 roundup2(note->n_descsz, sizeof(Elf32_Addr)))) {
1314 if (note->n_namesz != sizeof(NOTE_FREEBSD_VENDOR) ||
1315 note->n_descsz != sizeof(int32_t))
1317 if (note->n_type != ABI_NOTETYPE &&
1318 note->n_type != CRT_NOINIT_NOTETYPE)
1320 note_name = (const char *)(note + 1);
1321 if (strncmp(NOTE_FREEBSD_VENDOR, note_name,
1322 sizeof(NOTE_FREEBSD_VENDOR)) != 0)
1324 switch (note->n_type) {
1326 /* FreeBSD osrel note */
1327 p = (uintptr_t)(note + 1);
1328 p += roundup2(note->n_namesz, sizeof(Elf32_Addr));
1329 obj->osrel = *(const int32_t *)(p);
1330 dbg("note osrel %d", obj->osrel);
1332 case CRT_NOINIT_NOTETYPE:
1333 /* FreeBSD 'crt does not call init' note */
1334 obj->crt_no_init = true;
1335 dbg("note crt_no_init");
1342 dlcheck(void *handle)
1346 for (obj = obj_list; obj != NULL; obj = obj->next)
1347 if (obj == (Obj_Entry *) handle)
1350 if (obj == NULL || obj->refcount == 0 || obj->dl_refcount == 0) {
1351 _rtld_error("Invalid shared object handle %p", handle);
1358 * If the given object is already in the donelist, return true. Otherwise
1359 * add the object to the list and return false.
1362 donelist_check(DoneList *dlp, const Obj_Entry *obj)
1366 for (i = 0; i < dlp->num_used; i++)
1367 if (dlp->objs[i] == obj)
1370 * Our donelist allocation should always be sufficient. But if
1371 * our threads locking isn't working properly, more shared objects
1372 * could have been loaded since we allocated the list. That should
1373 * never happen, but we'll handle it properly just in case it does.
1375 if (dlp->num_used < dlp->num_alloc)
1376 dlp->objs[dlp->num_used++] = obj;
1381 * Hash function for symbol table lookup. Don't even think about changing
1382 * this. It is specified by the System V ABI.
1385 elf_hash(const char *name)
1387 const unsigned char *p = (const unsigned char *) name;
1388 unsigned long h = 0;
1391 while (*p != '\0') {
1392 h = (h << 4) + *p++;
1393 if ((g = h & 0xf0000000) != 0)
1401 * The GNU hash function is the Daniel J. Bernstein hash clipped to 32 bits
1402 * unsigned in case it's implemented with a wider type.
1405 gnu_hash(const char *s)
1411 for (c = *s; c != '\0'; c = *++s)
1413 return (h & 0xffffffff);
1417 * Find the library with the given name, and return its full pathname.
1418 * The returned string is dynamically allocated. Generates an error
1419 * message and returns NULL if the library cannot be found.
1421 * If the second argument is non-NULL, then it refers to an already-
1422 * loaded shared object, whose library search path will be searched.
1424 * The search order is:
1425 * DT_RPATH in the referencing file _unless_ DT_RUNPATH is present (1)
1426 * DT_RPATH of the main object if DSO without defined DT_RUNPATH (1)
1428 * DT_RUNPATH in the referencing file
1429 * ldconfig hints (if -z nodefaultlib, filter out default library directories
1431 * /lib:/usr/lib _unless_ the referencing file is linked with -z nodefaultlib
1433 * (1) Handled in digest_dynamic2 - rpath left NULL if runpath defined.
1436 find_library(const char *xname, const Obj_Entry *refobj)
1440 bool nodeflib, objgiven;
1442 objgiven = refobj != NULL;
1443 if (strchr(xname, '/') != NULL) { /* Hard coded pathname */
1444 if (xname[0] != '/' && !trust) {
1445 _rtld_error("Absolute pathname required for shared object \"%s\"",
1449 if (objgiven && refobj->z_origin) {
1450 return (origin_subst(__DECONST(char *, xname),
1451 refobj->origin_path));
1453 return (xstrdup(xname));
1457 if (libmap_disable || !objgiven ||
1458 (name = lm_find(refobj->path, xname)) == NULL)
1459 name = (char *)xname;
1461 dbg(" Searching for \"%s\"", name);
1464 * If refobj->rpath != NULL, then refobj->runpath is NULL. Fall
1465 * back to pre-conforming behaviour if user requested so with
1466 * LD_LIBRARY_PATH_RPATH environment variable and ignore -z
1469 if (objgiven && refobj->rpath != NULL && ld_library_path_rpath) {
1470 if ((pathname = search_library_path(name, ld_library_path)) != NULL ||
1472 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1473 (pathname = search_library_path(name, gethints(false))) != NULL ||
1474 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL)
1477 nodeflib = objgiven ? refobj->z_nodeflib : false;
1479 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1480 (objgiven && refobj->runpath == NULL && refobj != obj_main &&
1481 (pathname = search_library_path(name, obj_main->rpath)) != NULL) ||
1482 (pathname = search_library_path(name, ld_library_path)) != NULL ||
1484 (pathname = search_library_path(name, refobj->runpath)) != NULL) ||
1485 (pathname = search_library_path(name, gethints(nodeflib))) != NULL ||
1486 (objgiven && !nodeflib &&
1487 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL))
1491 if (objgiven && refobj->path != NULL) {
1492 _rtld_error("Shared object \"%s\" not found, required by \"%s\"",
1493 name, basename(refobj->path));
1495 _rtld_error("Shared object \"%s\" not found", name);
1501 * Given a symbol number in a referencing object, find the corresponding
1502 * definition of the symbol. Returns a pointer to the symbol, or NULL if
1503 * no definition was found. Returns a pointer to the Obj_Entry of the
1504 * defining object via the reference parameter DEFOBJ_OUT.
1507 find_symdef(unsigned long symnum, const Obj_Entry *refobj,
1508 const Obj_Entry **defobj_out, int flags, SymCache *cache,
1509 RtldLockState *lockstate)
1513 const Obj_Entry *defobj;
1519 * If we have already found this symbol, get the information from
1522 if (symnum >= refobj->dynsymcount)
1523 return NULL; /* Bad object */
1524 if (cache != NULL && cache[symnum].sym != NULL) {
1525 *defobj_out = cache[symnum].obj;
1526 return cache[symnum].sym;
1529 ref = refobj->symtab + symnum;
1530 name = refobj->strtab + ref->st_name;
1535 * We don't have to do a full scale lookup if the symbol is local.
1536 * We know it will bind to the instance in this load module; to
1537 * which we already have a pointer (ie ref). By not doing a lookup,
1538 * we not only improve performance, but it also avoids unresolvable
1539 * symbols when local symbols are not in the hash table. This has
1540 * been seen with the ia64 toolchain.
1542 if (ELF_ST_BIND(ref->st_info) != STB_LOCAL) {
1543 if (ELF_ST_TYPE(ref->st_info) == STT_SECTION) {
1544 _rtld_error("%s: Bogus symbol table entry %lu", refobj->path,
1547 symlook_init(&req, name);
1549 req.ventry = fetch_ventry(refobj, symnum);
1550 req.lockstate = lockstate;
1551 res = symlook_default(&req, refobj);
1554 defobj = req.defobj_out;
1562 * If we found no definition and the reference is weak, treat the
1563 * symbol as having the value zero.
1565 if (def == NULL && ELF_ST_BIND(ref->st_info) == STB_WEAK) {
1571 *defobj_out = defobj;
1572 /* Record the information in the cache to avoid subsequent lookups. */
1573 if (cache != NULL) {
1574 cache[symnum].sym = def;
1575 cache[symnum].obj = defobj;
1578 if (refobj != &obj_rtld)
1579 _rtld_error("%s: Undefined symbol \"%s\"", refobj->path, name);
1585 * Return the search path from the ldconfig hints file, reading it if
1586 * necessary. If nostdlib is true, then the default search paths are
1587 * not added to result.
1589 * Returns NULL if there are problems with the hints file,
1590 * or if the search path there is empty.
1593 gethints(bool nostdlib)
1595 static char *hints, *filtered_path;
1596 struct elfhints_hdr hdr;
1597 struct fill_search_info_args sargs, hargs;
1598 struct dl_serinfo smeta, hmeta, *SLPinfo, *hintinfo;
1599 struct dl_serpath *SLPpath, *hintpath;
1601 unsigned int SLPndx, hintndx, fndx, fcount;
1606 /* First call, read the hints file */
1607 if (hints == NULL) {
1608 /* Keep from trying again in case the hints file is bad. */
1611 if ((fd = open(ld_elf_hints_path, O_RDONLY | O_CLOEXEC)) == -1)
1613 if (read(fd, &hdr, sizeof hdr) != sizeof hdr ||
1614 hdr.magic != ELFHINTS_MAGIC ||
1619 p = xmalloc(hdr.dirlistlen + 1);
1620 if (lseek(fd, hdr.strtab + hdr.dirlist, SEEK_SET) == -1 ||
1621 read(fd, p, hdr.dirlistlen + 1) !=
1622 (ssize_t)hdr.dirlistlen + 1) {
1632 * If caller agreed to receive list which includes the default
1633 * paths, we are done. Otherwise, if we still did not
1634 * calculated filtered result, do it now.
1637 return (hints[0] != '\0' ? hints : NULL);
1638 if (filtered_path != NULL)
1642 * Obtain the list of all configured search paths, and the
1643 * list of the default paths.
1645 * First estimate the size of the results.
1647 smeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1649 hmeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1652 sargs.request = RTLD_DI_SERINFOSIZE;
1653 sargs.serinfo = &smeta;
1654 hargs.request = RTLD_DI_SERINFOSIZE;
1655 hargs.serinfo = &hmeta;
1657 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1658 path_enumerate(p, fill_search_info, &hargs);
1660 SLPinfo = xmalloc(smeta.dls_size);
1661 hintinfo = xmalloc(hmeta.dls_size);
1664 * Next fetch both sets of paths.
1666 sargs.request = RTLD_DI_SERINFO;
1667 sargs.serinfo = SLPinfo;
1668 sargs.serpath = &SLPinfo->dls_serpath[0];
1669 sargs.strspace = (char *)&SLPinfo->dls_serpath[smeta.dls_cnt];
1671 hargs.request = RTLD_DI_SERINFO;
1672 hargs.serinfo = hintinfo;
1673 hargs.serpath = &hintinfo->dls_serpath[0];
1674 hargs.strspace = (char *)&hintinfo->dls_serpath[hmeta.dls_cnt];
1676 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1677 path_enumerate(p, fill_search_info, &hargs);
1680 * Now calculate the difference between two sets, by excluding
1681 * standard paths from the full set.
1685 filtered_path = xmalloc(hdr.dirlistlen + 1);
1686 hintpath = &hintinfo->dls_serpath[0];
1687 for (hintndx = 0; hintndx < hmeta.dls_cnt; hintndx++, hintpath++) {
1689 SLPpath = &SLPinfo->dls_serpath[0];
1691 * Check each standard path against current.
1693 for (SLPndx = 0; SLPndx < smeta.dls_cnt; SLPndx++, SLPpath++) {
1694 /* matched, skip the path */
1695 if (!strcmp(hintpath->dls_name, SLPpath->dls_name)) {
1703 * Not matched against any standard path, add the path
1704 * to result. Separate consequtive paths with ':'.
1707 filtered_path[fndx] = ':';
1711 flen = strlen(hintpath->dls_name);
1712 strncpy((filtered_path + fndx), hintpath->dls_name, flen);
1715 filtered_path[fndx] = '\0';
1721 return (filtered_path[0] != '\0' ? filtered_path : NULL);
1725 init_dag(Obj_Entry *root)
1727 const Needed_Entry *needed;
1728 const Objlist_Entry *elm;
1731 if (root->dag_inited)
1733 donelist_init(&donelist);
1735 /* Root object belongs to own DAG. */
1736 objlist_push_tail(&root->dldags, root);
1737 objlist_push_tail(&root->dagmembers, root);
1738 donelist_check(&donelist, root);
1741 * Add dependencies of root object to DAG in breadth order
1742 * by exploiting the fact that each new object get added
1743 * to the tail of the dagmembers list.
1745 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1746 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {
1747 if (needed->obj == NULL || donelist_check(&donelist, needed->obj))
1749 objlist_push_tail(&needed->obj->dldags, root);
1750 objlist_push_tail(&root->dagmembers, needed->obj);
1753 root->dag_inited = true;
1757 process_nodelete(Obj_Entry *root)
1759 const Objlist_Entry *elm;
1762 * Walk over object DAG and process every dependent object that
1763 * is marked as DF_1_NODELETE. They need to grow their own DAG,
1764 * which then should have its reference upped separately.
1766 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1767 if (elm->obj != NULL && elm->obj->z_nodelete &&
1768 !elm->obj->ref_nodel) {
1769 dbg("obj %s nodelete", elm->obj->path);
1772 elm->obj->ref_nodel = true;
1777 * Initialize the dynamic linker. The argument is the address at which
1778 * the dynamic linker has been mapped into memory. The primary task of
1779 * this function is to relocate the dynamic linker.
1782 init_rtld(caddr_t mapbase, Elf_Auxinfo **aux_info)
1784 Obj_Entry objtmp; /* Temporary rtld object */
1785 const Elf_Dyn *dyn_rpath;
1786 const Elf_Dyn *dyn_soname;
1787 const Elf_Dyn *dyn_runpath;
1790 * Conjure up an Obj_Entry structure for the dynamic linker.
1792 * The "path" member can't be initialized yet because string constants
1793 * cannot yet be accessed. Below we will set it correctly.
1795 memset(&objtmp, 0, sizeof(objtmp));
1798 objtmp.mapbase = mapbase;
1800 objtmp.relocbase = mapbase;
1802 if (RTLD_IS_DYNAMIC()) {
1803 objtmp.dynamic = rtld_dynamic(&objtmp);
1804 digest_dynamic1(&objtmp, 1, &dyn_rpath, &dyn_soname, &dyn_runpath);
1805 assert(objtmp.needed == NULL);
1806 #if !defined(__mips__)
1807 /* MIPS has a bogus DT_TEXTREL. */
1808 assert(!objtmp.textrel);
1812 * Temporarily put the dynamic linker entry into the object list, so
1813 * that symbols can be found.
1816 relocate_objects(&objtmp, true, &objtmp, 0, NULL);
1819 /* Initialize the object list. */
1820 obj_tail = &obj_list;
1822 /* Now that non-local variables can be accesses, copy out obj_rtld. */
1823 memcpy(&obj_rtld, &objtmp, sizeof(obj_rtld));
1825 if (aux_info[AT_PAGESZ] != NULL)
1826 pagesize = aux_info[AT_PAGESZ]->a_un.a_val;
1827 if (aux_info[AT_OSRELDATE] != NULL)
1828 osreldate = aux_info[AT_OSRELDATE]->a_un.a_val;
1830 digest_dynamic2(&obj_rtld, dyn_rpath, dyn_soname, dyn_runpath);
1832 /* Replace the path with a dynamically allocated copy. */
1833 obj_rtld.path = xstrdup(PATH_RTLD);
1835 r_debug.r_brk = r_debug_state;
1836 r_debug.r_state = RT_CONSISTENT;
1840 * Add the init functions from a needed object list (and its recursive
1841 * needed objects) to "list". This is not used directly; it is a helper
1842 * function for initlist_add_objects(). The write lock must be held
1843 * when this function is called.
1846 initlist_add_neededs(Needed_Entry *needed, Objlist *list)
1848 /* Recursively process the successor needed objects. */
1849 if (needed->next != NULL)
1850 initlist_add_neededs(needed->next, list);
1852 /* Process the current needed object. */
1853 if (needed->obj != NULL)
1854 initlist_add_objects(needed->obj, &needed->obj->next, list);
1858 * Scan all of the DAGs rooted in the range of objects from "obj" to
1859 * "tail" and add their init functions to "list". This recurses over
1860 * the DAGs and ensure the proper init ordering such that each object's
1861 * needed libraries are initialized before the object itself. At the
1862 * same time, this function adds the objects to the global finalization
1863 * list "list_fini" in the opposite order. The write lock must be
1864 * held when this function is called.
1867 initlist_add_objects(Obj_Entry *obj, Obj_Entry **tail, Objlist *list)
1870 if (obj->init_scanned || obj->init_done)
1872 obj->init_scanned = true;
1874 /* Recursively process the successor objects. */
1875 if (&obj->next != tail)
1876 initlist_add_objects(obj->next, tail, list);
1878 /* Recursively process the needed objects. */
1879 if (obj->needed != NULL)
1880 initlist_add_neededs(obj->needed, list);
1881 if (obj->needed_filtees != NULL)
1882 initlist_add_neededs(obj->needed_filtees, list);
1883 if (obj->needed_aux_filtees != NULL)
1884 initlist_add_neededs(obj->needed_aux_filtees, list);
1886 /* Add the object to the init list. */
1887 if (obj->preinit_array != (Elf_Addr)NULL || obj->init != (Elf_Addr)NULL ||
1888 obj->init_array != (Elf_Addr)NULL)
1889 objlist_push_tail(list, obj);
1891 /* Add the object to the global fini list in the reverse order. */
1892 if ((obj->fini != (Elf_Addr)NULL || obj->fini_array != (Elf_Addr)NULL)
1893 && !obj->on_fini_list) {
1894 objlist_push_head(&list_fini, obj);
1895 obj->on_fini_list = true;
1900 #define FPTR_TARGET(f) ((Elf_Addr) (f))
1904 free_needed_filtees(Needed_Entry *n)
1906 Needed_Entry *needed, *needed1;
1908 for (needed = n; needed != NULL; needed = needed->next) {
1909 if (needed->obj != NULL) {
1910 dlclose(needed->obj);
1914 for (needed = n; needed != NULL; needed = needed1) {
1915 needed1 = needed->next;
1921 unload_filtees(Obj_Entry *obj)
1924 free_needed_filtees(obj->needed_filtees);
1925 obj->needed_filtees = NULL;
1926 free_needed_filtees(obj->needed_aux_filtees);
1927 obj->needed_aux_filtees = NULL;
1928 obj->filtees_loaded = false;
1932 load_filtee1(Obj_Entry *obj, Needed_Entry *needed, int flags,
1933 RtldLockState *lockstate)
1936 for (; needed != NULL; needed = needed->next) {
1937 needed->obj = dlopen_object(obj->strtab + needed->name, -1, obj,
1938 flags, ((ld_loadfltr || obj->z_loadfltr) ? RTLD_NOW : RTLD_LAZY) |
1939 RTLD_LOCAL, lockstate);
1944 load_filtees(Obj_Entry *obj, int flags, RtldLockState *lockstate)
1947 lock_restart_for_upgrade(lockstate);
1948 if (!obj->filtees_loaded) {
1949 load_filtee1(obj, obj->needed_filtees, flags, lockstate);
1950 load_filtee1(obj, obj->needed_aux_filtees, flags, lockstate);
1951 obj->filtees_loaded = true;
1956 process_needed(Obj_Entry *obj, Needed_Entry *needed, int flags)
1960 for (; needed != NULL; needed = needed->next) {
1961 obj1 = needed->obj = load_object(obj->strtab + needed->name, -1, obj,
1962 flags & ~RTLD_LO_NOLOAD);
1963 if (obj1 == NULL && !ld_tracing && (flags & RTLD_LO_FILTEES) == 0)
1970 * Given a shared object, traverse its list of needed objects, and load
1971 * each of them. Returns 0 on success. Generates an error message and
1972 * returns -1 on failure.
1975 load_needed_objects(Obj_Entry *first, int flags)
1979 for (obj = first; obj != NULL; obj = obj->next) {
1980 if (process_needed(obj, obj->needed, flags) == -1)
1987 load_preload_objects(void)
1989 char *p = ld_preload;
1991 static const char delim[] = " \t:;";
1996 p += strspn(p, delim);
1997 while (*p != '\0') {
1998 size_t len = strcspn(p, delim);
2003 obj = load_object(p, -1, NULL, 0);
2005 return -1; /* XXX - cleanup */
2006 obj->z_interpose = true;
2009 p += strspn(p, delim);
2011 LD_UTRACE(UTRACE_PRELOAD_FINISHED, NULL, NULL, 0, 0, NULL);
2016 printable_path(const char *path)
2019 return (path == NULL ? "<unknown>" : path);
2023 * Load a shared object into memory, if it is not already loaded. The
2024 * object may be specified by name or by user-supplied file descriptor
2025 * fd_u. In the later case, the fd_u descriptor is not closed, but its
2028 * Returns a pointer to the Obj_Entry for the object. Returns NULL
2032 load_object(const char *name, int fd_u, const Obj_Entry *refobj, int flags)
2040 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
2041 if (object_match_name(obj, name))
2045 path = find_library(name, refobj);
2052 * If we didn't find a match by pathname, or the name is not
2053 * supplied, open the file and check again by device and inode.
2054 * This avoids false mismatches caused by multiple links or ".."
2057 * To avoid a race, we open the file and use fstat() rather than
2062 if ((fd = open(path, O_RDONLY | O_CLOEXEC)) == -1) {
2063 _rtld_error("Cannot open \"%s\"", path);
2068 fd = fcntl(fd_u, F_DUPFD_CLOEXEC, 0);
2070 _rtld_error("Cannot dup fd");
2075 if (fstat(fd, &sb) == -1) {
2076 _rtld_error("Cannot fstat \"%s\"", printable_path(path));
2081 for (obj = obj_list->next; obj != NULL; obj = obj->next)
2082 if (obj->ino == sb.st_ino && obj->dev == sb.st_dev)
2084 if (obj != NULL && name != NULL) {
2085 object_add_name(obj, name);
2090 if (flags & RTLD_LO_NOLOAD) {
2096 /* First use of this object, so we must map it in */
2097 obj = do_load_object(fd, name, path, &sb, flags);
2106 do_load_object(int fd, const char *name, char *path, struct stat *sbp,
2113 * but first, make sure that environment variables haven't been
2114 * used to circumvent the noexec flag on a filesystem.
2116 if (dangerous_ld_env) {
2117 if (fstatfs(fd, &fs) != 0) {
2118 _rtld_error("Cannot fstatfs \"%s\"", printable_path(path));
2121 if (fs.f_flags & MNT_NOEXEC) {
2122 _rtld_error("Cannot execute objects on %s\n", fs.f_mntonname);
2126 dbg("loading \"%s\"", printable_path(path));
2127 obj = map_object(fd, printable_path(path), sbp);
2132 * If DT_SONAME is present in the object, digest_dynamic2 already
2133 * added it to the object names.
2136 object_add_name(obj, name);
2138 digest_dynamic(obj, 0);
2139 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d", obj->path,
2140 obj->valid_hash_sysv, obj->valid_hash_gnu, obj->dynsymcount);
2141 if (obj->z_noopen && (flags & (RTLD_LO_DLOPEN | RTLD_LO_TRACE)) ==
2143 dbg("refusing to load non-loadable \"%s\"", obj->path);
2144 _rtld_error("Cannot dlopen non-loadable %s", obj->path);
2145 munmap(obj->mapbase, obj->mapsize);
2150 obj->dlopened = (flags & RTLD_LO_DLOPEN) != 0;
2152 obj_tail = &obj->next;
2155 linkmap_add(obj); /* for GDB & dlinfo() */
2156 max_stack_flags |= obj->stack_flags;
2158 dbg(" %p .. %p: %s", obj->mapbase,
2159 obj->mapbase + obj->mapsize - 1, obj->path);
2161 dbg(" WARNING: %s has impure text", obj->path);
2162 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
2169 obj_from_addr(const void *addr)
2173 for (obj = obj_list; obj != NULL; obj = obj->next) {
2174 if (addr < (void *) obj->mapbase)
2176 if (addr < (void *) (obj->mapbase + obj->mapsize))
2185 Elf_Addr *preinit_addr;
2188 preinit_addr = (Elf_Addr *)obj_main->preinit_array;
2189 if (preinit_addr == NULL)
2192 for (index = 0; index < obj_main->preinit_array_num; index++) {
2193 if (preinit_addr[index] != 0 && preinit_addr[index] != 1) {
2194 dbg("calling preinit function for %s at %p", obj_main->path,
2195 (void *)preinit_addr[index]);
2196 LD_UTRACE(UTRACE_INIT_CALL, obj_main, (void *)preinit_addr[index],
2197 0, 0, obj_main->path);
2198 call_init_pointer(obj_main, preinit_addr[index]);
2204 * Call the finalization functions for each of the objects in "list"
2205 * belonging to the DAG of "root" and referenced once. If NULL "root"
2206 * is specified, every finalization function will be called regardless
2207 * of the reference count and the list elements won't be freed. All of
2208 * the objects are expected to have non-NULL fini functions.
2211 objlist_call_fini(Objlist *list, Obj_Entry *root, RtldLockState *lockstate)
2215 Elf_Addr *fini_addr;
2218 assert(root == NULL || root->refcount == 1);
2221 * Preserve the current error message since a fini function might
2222 * call into the dynamic linker and overwrite it.
2224 saved_msg = errmsg_save();
2226 STAILQ_FOREACH(elm, list, link) {
2227 if (root != NULL && (elm->obj->refcount != 1 ||
2228 objlist_find(&root->dagmembers, elm->obj) == NULL))
2230 /* Remove object from fini list to prevent recursive invocation. */
2231 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2233 * XXX: If a dlopen() call references an object while the
2234 * fini function is in progress, we might end up trying to
2235 * unload the referenced object in dlclose() or the object
2236 * won't be unloaded although its fini function has been
2239 lock_release(rtld_bind_lock, lockstate);
2242 * It is legal to have both DT_FINI and DT_FINI_ARRAY defined.
2243 * When this happens, DT_FINI_ARRAY is processed first.
2245 fini_addr = (Elf_Addr *)elm->obj->fini_array;
2246 if (fini_addr != NULL && elm->obj->fini_array_num > 0) {
2247 for (index = elm->obj->fini_array_num - 1; index >= 0;
2249 if (fini_addr[index] != 0 && fini_addr[index] != 1) {
2250 dbg("calling fini function for %s at %p",
2251 elm->obj->path, (void *)fini_addr[index]);
2252 LD_UTRACE(UTRACE_FINI_CALL, elm->obj,
2253 (void *)fini_addr[index], 0, 0, elm->obj->path);
2254 call_initfini_pointer(elm->obj, fini_addr[index]);
2258 if (elm->obj->fini != (Elf_Addr)NULL) {
2259 dbg("calling fini function for %s at %p", elm->obj->path,
2260 (void *)elm->obj->fini);
2261 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini,
2262 0, 0, elm->obj->path);
2263 call_initfini_pointer(elm->obj, elm->obj->fini);
2265 wlock_acquire(rtld_bind_lock, lockstate);
2266 /* No need to free anything if process is going down. */
2270 * We must restart the list traversal after every fini call
2271 * because a dlclose() call from the fini function or from
2272 * another thread might have modified the reference counts.
2276 } while (elm != NULL);
2277 errmsg_restore(saved_msg);
2281 * Call the initialization functions for each of the objects in
2282 * "list". All of the objects are expected to have non-NULL init
2286 objlist_call_init(Objlist *list, RtldLockState *lockstate)
2291 Elf_Addr *init_addr;
2295 * Clean init_scanned flag so that objects can be rechecked and
2296 * possibly initialized earlier if any of vectors called below
2297 * cause the change by using dlopen.
2299 for (obj = obj_list; obj != NULL; obj = obj->next)
2300 obj->init_scanned = false;
2303 * Preserve the current error message since an init function might
2304 * call into the dynamic linker and overwrite it.
2306 saved_msg = errmsg_save();
2307 STAILQ_FOREACH(elm, list, link) {
2308 if (elm->obj->init_done) /* Initialized early. */
2311 * Race: other thread might try to use this object before current
2312 * one completes the initilization. Not much can be done here
2313 * without better locking.
2315 elm->obj->init_done = true;
2316 lock_release(rtld_bind_lock, lockstate);
2319 * It is legal to have both DT_INIT and DT_INIT_ARRAY defined.
2320 * When this happens, DT_INIT is processed first.
2322 if (elm->obj->init != (Elf_Addr)NULL) {
2323 dbg("calling init function for %s at %p", elm->obj->path,
2324 (void *)elm->obj->init);
2325 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init,
2326 0, 0, elm->obj->path);
2327 call_initfini_pointer(elm->obj, elm->obj->init);
2329 init_addr = (Elf_Addr *)elm->obj->init_array;
2330 if (init_addr != NULL) {
2331 for (index = 0; index < elm->obj->init_array_num; index++) {
2332 if (init_addr[index] != 0 && init_addr[index] != 1) {
2333 dbg("calling init function for %s at %p", elm->obj->path,
2334 (void *)init_addr[index]);
2335 LD_UTRACE(UTRACE_INIT_CALL, elm->obj,
2336 (void *)init_addr[index], 0, 0, elm->obj->path);
2337 call_init_pointer(elm->obj, init_addr[index]);
2341 wlock_acquire(rtld_bind_lock, lockstate);
2343 errmsg_restore(saved_msg);
2347 objlist_clear(Objlist *list)
2351 while (!STAILQ_EMPTY(list)) {
2352 elm = STAILQ_FIRST(list);
2353 STAILQ_REMOVE_HEAD(list, link);
2358 static Objlist_Entry *
2359 objlist_find(Objlist *list, const Obj_Entry *obj)
2363 STAILQ_FOREACH(elm, list, link)
2364 if (elm->obj == obj)
2370 objlist_init(Objlist *list)
2376 objlist_push_head(Objlist *list, Obj_Entry *obj)
2380 elm = NEW(Objlist_Entry);
2382 STAILQ_INSERT_HEAD(list, elm, link);
2386 objlist_push_tail(Objlist *list, Obj_Entry *obj)
2390 elm = NEW(Objlist_Entry);
2392 STAILQ_INSERT_TAIL(list, elm, link);
2396 objlist_put_after(Objlist *list, Obj_Entry *listobj, Obj_Entry *obj)
2398 Objlist_Entry *elm, *listelm;
2400 STAILQ_FOREACH(listelm, list, link) {
2401 if (listelm->obj == listobj)
2404 elm = NEW(Objlist_Entry);
2406 if (listelm != NULL)
2407 STAILQ_INSERT_AFTER(list, listelm, elm, link);
2409 STAILQ_INSERT_TAIL(list, elm, link);
2413 objlist_remove(Objlist *list, Obj_Entry *obj)
2417 if ((elm = objlist_find(list, obj)) != NULL) {
2418 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2424 * Relocate dag rooted in the specified object.
2425 * Returns 0 on success, or -1 on failure.
2429 relocate_object_dag(Obj_Entry *root, bool bind_now, Obj_Entry *rtldobj,
2430 int flags, RtldLockState *lockstate)
2436 STAILQ_FOREACH(elm, &root->dagmembers, link) {
2437 error = relocate_object(elm->obj, bind_now, rtldobj, flags,
2446 * Relocate single object.
2447 * Returns 0 on success, or -1 on failure.
2450 relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj,
2451 int flags, RtldLockState *lockstate)
2456 obj->relocated = true;
2458 dbg("relocating \"%s\"", obj->path);
2460 if (obj->symtab == NULL || obj->strtab == NULL ||
2461 !(obj->valid_hash_sysv || obj->valid_hash_gnu)) {
2462 _rtld_error("%s: Shared object has no run-time symbol table",
2468 /* There are relocations to the write-protected text segment. */
2469 if (mprotect(obj->mapbase, obj->textsize,
2470 PROT_READ|PROT_WRITE|PROT_EXEC) == -1) {
2471 _rtld_error("%s: Cannot write-enable text segment: %s",
2472 obj->path, rtld_strerror(errno));
2477 /* Process the non-PLT non-IFUNC relocations. */
2478 if (reloc_non_plt(obj, rtldobj, flags, lockstate))
2481 if (obj->textrel) { /* Re-protected the text segment. */
2482 if (mprotect(obj->mapbase, obj->textsize,
2483 PROT_READ|PROT_EXEC) == -1) {
2484 _rtld_error("%s: Cannot write-protect text segment: %s",
2485 obj->path, rtld_strerror(errno));
2490 /* Set the special PLT or GOT entries. */
2493 /* Process the PLT relocations. */
2494 if (reloc_plt(obj) == -1)
2496 /* Relocate the jump slots if we are doing immediate binding. */
2497 if (obj->bind_now || bind_now)
2498 if (reloc_jmpslots(obj, flags, lockstate) == -1)
2502 * Process the non-PLT IFUNC relocations. The relocations are
2503 * processed in two phases, because IFUNC resolvers may
2504 * reference other symbols, which must be readily processed
2505 * before resolvers are called.
2507 if (obj->non_plt_gnu_ifunc &&
2508 reloc_non_plt(obj, rtldobj, flags | SYMLOOK_IFUNC, lockstate))
2511 if (obj->relro_size > 0) {
2512 if (mprotect(obj->relro_page, obj->relro_size,
2514 _rtld_error("%s: Cannot enforce relro protection: %s",
2515 obj->path, rtld_strerror(errno));
2521 * Set up the magic number and version in the Obj_Entry. These
2522 * were checked in the crt1.o from the original ElfKit, so we
2523 * set them for backward compatibility.
2525 obj->magic = RTLD_MAGIC;
2526 obj->version = RTLD_VERSION;
2532 * Relocate newly-loaded shared objects. The argument is a pointer to
2533 * the Obj_Entry for the first such object. All objects from the first
2534 * to the end of the list of objects are relocated. Returns 0 on success,
2538 relocate_objects(Obj_Entry *first, bool bind_now, Obj_Entry *rtldobj,
2539 int flags, RtldLockState *lockstate)
2544 for (error = 0, obj = first; obj != NULL; obj = obj->next) {
2545 error = relocate_object(obj, bind_now, rtldobj, flags,
2554 * The handling of R_MACHINE_IRELATIVE relocations and jumpslots
2555 * referencing STT_GNU_IFUNC symbols is postponed till the other
2556 * relocations are done. The indirect functions specified as
2557 * ifunc are allowed to call other symbols, so we need to have
2558 * objects relocated before asking for resolution from indirects.
2560 * The R_MACHINE_IRELATIVE slots are resolved in greedy fashion,
2561 * instead of the usual lazy handling of PLT slots. It is
2562 * consistent with how GNU does it.
2565 resolve_object_ifunc(Obj_Entry *obj, bool bind_now, int flags,
2566 RtldLockState *lockstate)
2568 if (obj->irelative && reloc_iresolve(obj, lockstate) == -1)
2570 if ((obj->bind_now || bind_now) && obj->gnu_ifunc &&
2571 reloc_gnu_ifunc(obj, flags, lockstate) == -1)
2577 resolve_objects_ifunc(Obj_Entry *first, bool bind_now, int flags,
2578 RtldLockState *lockstate)
2582 for (obj = first; obj != NULL; obj = obj->next) {
2583 if (resolve_object_ifunc(obj, bind_now, flags, lockstate) == -1)
2590 initlist_objects_ifunc(Objlist *list, bool bind_now, int flags,
2591 RtldLockState *lockstate)
2595 STAILQ_FOREACH(elm, list, link) {
2596 if (resolve_object_ifunc(elm->obj, bind_now, flags,
2604 * Cleanup procedure. It will be called (by the atexit mechanism) just
2605 * before the process exits.
2610 RtldLockState lockstate;
2612 wlock_acquire(rtld_bind_lock, &lockstate);
2614 objlist_call_fini(&list_fini, NULL, &lockstate);
2615 /* No need to remove the items from the list, since we are exiting. */
2616 if (!libmap_disable)
2618 lock_release(rtld_bind_lock, &lockstate);
2622 * Iterate over a search path, translate each element, and invoke the
2623 * callback on the result.
2626 path_enumerate(const char *path, path_enum_proc callback, void *arg)
2632 path += strspn(path, ":;");
2633 while (*path != '\0') {
2637 len = strcspn(path, ":;");
2638 trans = lm_findn(NULL, path, len);
2640 res = callback(trans, strlen(trans), arg);
2642 res = callback(path, len, arg);
2648 path += strspn(path, ":;");
2654 struct try_library_args {
2662 try_library_path(const char *dir, size_t dirlen, void *param)
2664 struct try_library_args *arg;
2667 if (*dir == '/' || trust) {
2670 if (dirlen + 1 + arg->namelen + 1 > arg->buflen)
2673 pathname = arg->buffer;
2674 strncpy(pathname, dir, dirlen);
2675 pathname[dirlen] = '/';
2676 strcpy(pathname + dirlen + 1, arg->name);
2678 dbg(" Trying \"%s\"", pathname);
2679 if (access(pathname, F_OK) == 0) { /* We found it */
2680 pathname = xmalloc(dirlen + 1 + arg->namelen + 1);
2681 strcpy(pathname, arg->buffer);
2689 search_library_path(const char *name, const char *path)
2692 struct try_library_args arg;
2698 arg.namelen = strlen(name);
2699 arg.buffer = xmalloc(PATH_MAX);
2700 arg.buflen = PATH_MAX;
2702 p = path_enumerate(path, try_library_path, &arg);
2710 dlclose(void *handle)
2713 RtldLockState lockstate;
2715 wlock_acquire(rtld_bind_lock, &lockstate);
2716 root = dlcheck(handle);
2718 lock_release(rtld_bind_lock, &lockstate);
2721 LD_UTRACE(UTRACE_DLCLOSE_START, handle, NULL, 0, root->dl_refcount,
2724 /* Unreference the object and its dependencies. */
2725 root->dl_refcount--;
2727 if (root->refcount == 1) {
2729 * The object will be no longer referenced, so we must unload it.
2730 * First, call the fini functions.
2732 objlist_call_fini(&list_fini, root, &lockstate);
2736 /* Finish cleaning up the newly-unreferenced objects. */
2737 GDB_STATE(RT_DELETE,&root->linkmap);
2738 unload_object(root);
2739 GDB_STATE(RT_CONSISTENT,NULL);
2743 LD_UTRACE(UTRACE_DLCLOSE_STOP, handle, NULL, 0, 0, NULL);
2744 lock_release(rtld_bind_lock, &lockstate);
2751 char *msg = error_message;
2752 error_message = NULL;
2757 * This function is deprecated and has no effect.
2760 dllockinit(void *context,
2761 void *(*lock_create)(void *context),
2762 void (*rlock_acquire)(void *lock),
2763 void (*wlock_acquire)(void *lock),
2764 void (*lock_release)(void *lock),
2765 void (*lock_destroy)(void *lock),
2766 void (*context_destroy)(void *context))
2768 static void *cur_context;
2769 static void (*cur_context_destroy)(void *);
2771 /* Just destroy the context from the previous call, if necessary. */
2772 if (cur_context_destroy != NULL)
2773 cur_context_destroy(cur_context);
2774 cur_context = context;
2775 cur_context_destroy = context_destroy;
2779 dlopen(const char *name, int mode)
2782 return (rtld_dlopen(name, -1, mode));
2786 fdlopen(int fd, int mode)
2789 return (rtld_dlopen(NULL, fd, mode));
2793 rtld_dlopen(const char *name, int fd, int mode)
2795 RtldLockState lockstate;
2798 LD_UTRACE(UTRACE_DLOPEN_START, NULL, NULL, 0, mode, name);
2799 ld_tracing = (mode & RTLD_TRACE) == 0 ? NULL : "1";
2800 if (ld_tracing != NULL) {
2801 rlock_acquire(rtld_bind_lock, &lockstate);
2802 if (sigsetjmp(lockstate.env, 0) != 0)
2803 lock_upgrade(rtld_bind_lock, &lockstate);
2804 environ = (char **)*get_program_var_addr("environ", &lockstate);
2805 lock_release(rtld_bind_lock, &lockstate);
2807 lo_flags = RTLD_LO_DLOPEN;
2808 if (mode & RTLD_NODELETE)
2809 lo_flags |= RTLD_LO_NODELETE;
2810 if (mode & RTLD_NOLOAD)
2811 lo_flags |= RTLD_LO_NOLOAD;
2812 if (ld_tracing != NULL)
2813 lo_flags |= RTLD_LO_TRACE;
2815 return (dlopen_object(name, fd, obj_main, lo_flags,
2816 mode & (RTLD_MODEMASK | RTLD_GLOBAL), NULL));
2820 dlopen_cleanup(Obj_Entry *obj)
2825 if (obj->refcount == 0)
2830 dlopen_object(const char *name, int fd, Obj_Entry *refobj, int lo_flags,
2831 int mode, RtldLockState *lockstate)
2833 Obj_Entry **old_obj_tail;
2836 RtldLockState mlockstate;
2839 objlist_init(&initlist);
2841 if (lockstate == NULL && !(lo_flags & RTLD_LO_EARLY)) {
2842 wlock_acquire(rtld_bind_lock, &mlockstate);
2843 lockstate = &mlockstate;
2845 GDB_STATE(RT_ADD,NULL);
2847 old_obj_tail = obj_tail;
2849 if (name == NULL && fd == -1) {
2853 obj = load_object(name, fd, refobj, lo_flags);
2858 if (mode & RTLD_GLOBAL && objlist_find(&list_global, obj) == NULL)
2859 objlist_push_tail(&list_global, obj);
2860 if (*old_obj_tail != NULL) { /* We loaded something new. */
2861 assert(*old_obj_tail == obj);
2862 result = load_needed_objects(obj,
2863 lo_flags & (RTLD_LO_DLOPEN | RTLD_LO_EARLY));
2867 result = rtld_verify_versions(&obj->dagmembers);
2868 if (result != -1 && ld_tracing)
2870 if (result == -1 || relocate_object_dag(obj,
2871 (mode & RTLD_MODEMASK) == RTLD_NOW, &obj_rtld,
2872 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
2874 dlopen_cleanup(obj);
2876 } else if (lo_flags & RTLD_LO_EARLY) {
2878 * Do not call the init functions for early loaded
2879 * filtees. The image is still not initialized enough
2882 * Our object is found by the global object list and
2883 * will be ordered among all init calls done right
2884 * before transferring control to main.
2887 /* Make list of init functions to call. */
2888 initlist_add_objects(obj, &obj->next, &initlist);
2891 * Process all no_delete objects here, given them own
2892 * DAGs to prevent their dependencies from being unloaded.
2893 * This has to be done after we have loaded all of the
2894 * dependencies, so that we do not miss any.
2897 process_nodelete(obj);
2900 * Bump the reference counts for objects on this DAG. If
2901 * this is the first dlopen() call for the object that was
2902 * already loaded as a dependency, initialize the dag
2908 if ((lo_flags & RTLD_LO_TRACE) != 0)
2911 if (obj != NULL && ((lo_flags & RTLD_LO_NODELETE) != 0 ||
2912 obj->z_nodelete) && !obj->ref_nodel) {
2913 dbg("obj %s nodelete", obj->path);
2915 obj->z_nodelete = obj->ref_nodel = true;
2919 LD_UTRACE(UTRACE_DLOPEN_STOP, obj, NULL, 0, obj ? obj->dl_refcount : 0,
2921 GDB_STATE(RT_CONSISTENT,obj ? &obj->linkmap : NULL);
2923 if (!(lo_flags & RTLD_LO_EARLY)) {
2924 map_stacks_exec(lockstate);
2927 if (initlist_objects_ifunc(&initlist, (mode & RTLD_MODEMASK) == RTLD_NOW,
2928 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
2930 objlist_clear(&initlist);
2931 dlopen_cleanup(obj);
2932 if (lockstate == &mlockstate)
2933 lock_release(rtld_bind_lock, lockstate);
2937 if (!(lo_flags & RTLD_LO_EARLY)) {
2938 /* Call the init functions. */
2939 objlist_call_init(&initlist, lockstate);
2941 objlist_clear(&initlist);
2942 if (lockstate == &mlockstate)
2943 lock_release(rtld_bind_lock, lockstate);
2946 trace_loaded_objects(obj);
2947 if (lockstate == &mlockstate)
2948 lock_release(rtld_bind_lock, lockstate);
2953 do_dlsym(void *handle, const char *name, void *retaddr, const Ver_Entry *ve,
2957 const Obj_Entry *obj, *defobj;
2960 RtldLockState lockstate;
2968 symlook_init(&req, name);
2970 req.flags = flags | SYMLOOK_IN_PLT;
2971 req.lockstate = &lockstate;
2973 rlock_acquire(rtld_bind_lock, &lockstate);
2974 if (sigsetjmp(lockstate.env, 0) != 0)
2975 lock_upgrade(rtld_bind_lock, &lockstate);
2976 if (handle == NULL || handle == RTLD_NEXT ||
2977 handle == RTLD_DEFAULT || handle == RTLD_SELF) {
2979 if ((obj = obj_from_addr(retaddr)) == NULL) {
2980 _rtld_error("Cannot determine caller's shared object");
2981 lock_release(rtld_bind_lock, &lockstate);
2984 if (handle == NULL) { /* Just the caller's shared object. */
2985 res = symlook_obj(&req, obj);
2988 defobj = req.defobj_out;
2990 } else if (handle == RTLD_NEXT || /* Objects after caller's */
2991 handle == RTLD_SELF) { /* ... caller included */
2992 if (handle == RTLD_NEXT)
2994 for (; obj != NULL; obj = obj->next) {
2995 res = symlook_obj(&req, obj);
2998 ELF_ST_BIND(req.sym_out->st_info) != STB_WEAK) {
3000 defobj = req.defobj_out;
3001 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3007 * Search the dynamic linker itself, and possibly resolve the
3008 * symbol from there. This is how the application links to
3009 * dynamic linker services such as dlopen.
3011 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
3012 res = symlook_obj(&req, &obj_rtld);
3015 defobj = req.defobj_out;
3019 assert(handle == RTLD_DEFAULT);
3020 res = symlook_default(&req, obj);
3022 defobj = req.defobj_out;
3027 if ((obj = dlcheck(handle)) == NULL) {
3028 lock_release(rtld_bind_lock, &lockstate);
3032 donelist_init(&donelist);
3033 if (obj->mainprog) {
3034 /* Handle obtained by dlopen(NULL, ...) implies global scope. */
3035 res = symlook_global(&req, &donelist);
3038 defobj = req.defobj_out;
3041 * Search the dynamic linker itself, and possibly resolve the
3042 * symbol from there. This is how the application links to
3043 * dynamic linker services such as dlopen.
3045 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
3046 res = symlook_obj(&req, &obj_rtld);
3049 defobj = req.defobj_out;
3054 /* Search the whole DAG rooted at the given object. */
3055 res = symlook_list(&req, &obj->dagmembers, &donelist);
3058 defobj = req.defobj_out;
3064 lock_release(rtld_bind_lock, &lockstate);
3067 * The value required by the caller is derived from the value
3068 * of the symbol. For the ia64 architecture, we need to
3069 * construct a function descriptor which the caller can use to
3070 * call the function with the right 'gp' value. For other
3071 * architectures and for non-functions, the value is simply
3072 * the relocated value of the symbol.
3074 if (ELF_ST_TYPE(def->st_info) == STT_FUNC)
3075 return (make_function_pointer(def, defobj));
3076 else if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
3077 return (rtld_resolve_ifunc(defobj, def));
3078 else if (ELF_ST_TYPE(def->st_info) == STT_TLS) {
3080 return (__tls_get_addr(defobj->tlsindex, def->st_value));
3082 ti.ti_module = defobj->tlsindex;
3083 ti.ti_offset = def->st_value;
3084 return (__tls_get_addr(&ti));
3087 return (defobj->relocbase + def->st_value);
3090 _rtld_error("Undefined symbol \"%s\"", name);
3091 lock_release(rtld_bind_lock, &lockstate);
3096 dlsym(void *handle, const char *name)
3098 return do_dlsym(handle, name, __builtin_return_address(0), NULL,
3103 dlfunc(void *handle, const char *name)
3110 rv.d = do_dlsym(handle, name, __builtin_return_address(0), NULL,
3116 dlvsym(void *handle, const char *name, const char *version)
3120 ventry.name = version;
3122 ventry.hash = elf_hash(version);
3124 return do_dlsym(handle, name, __builtin_return_address(0), &ventry,
3129 _rtld_addr_phdr(const void *addr, struct dl_phdr_info *phdr_info)
3131 const Obj_Entry *obj;
3132 RtldLockState lockstate;
3134 rlock_acquire(rtld_bind_lock, &lockstate);
3135 obj = obj_from_addr(addr);
3137 _rtld_error("No shared object contains address");
3138 lock_release(rtld_bind_lock, &lockstate);
3141 rtld_fill_dl_phdr_info(obj, phdr_info);
3142 lock_release(rtld_bind_lock, &lockstate);
3147 dladdr(const void *addr, Dl_info *info)
3149 const Obj_Entry *obj;
3152 unsigned long symoffset;
3153 RtldLockState lockstate;
3155 rlock_acquire(rtld_bind_lock, &lockstate);
3156 obj = obj_from_addr(addr);
3158 _rtld_error("No shared object contains address");
3159 lock_release(rtld_bind_lock, &lockstate);
3162 info->dli_fname = obj->path;
3163 info->dli_fbase = obj->mapbase;
3164 info->dli_saddr = (void *)0;
3165 info->dli_sname = NULL;
3168 * Walk the symbol list looking for the symbol whose address is
3169 * closest to the address sent in.
3171 for (symoffset = 0; symoffset < obj->dynsymcount; symoffset++) {
3172 def = obj->symtab + symoffset;
3175 * For skip the symbol if st_shndx is either SHN_UNDEF or
3178 if (def->st_shndx == SHN_UNDEF || def->st_shndx == SHN_COMMON)
3182 * If the symbol is greater than the specified address, or if it
3183 * is further away from addr than the current nearest symbol,
3186 symbol_addr = obj->relocbase + def->st_value;
3187 if (symbol_addr > addr || symbol_addr < info->dli_saddr)
3190 /* Update our idea of the nearest symbol. */
3191 info->dli_sname = obj->strtab + def->st_name;
3192 info->dli_saddr = symbol_addr;
3195 if (info->dli_saddr == addr)
3198 lock_release(rtld_bind_lock, &lockstate);
3203 dlinfo(void *handle, int request, void *p)
3205 const Obj_Entry *obj;
3206 RtldLockState lockstate;
3209 rlock_acquire(rtld_bind_lock, &lockstate);
3211 if (handle == NULL || handle == RTLD_SELF) {
3214 retaddr = __builtin_return_address(0); /* __GNUC__ only */
3215 if ((obj = obj_from_addr(retaddr)) == NULL)
3216 _rtld_error("Cannot determine caller's shared object");
3218 obj = dlcheck(handle);
3221 lock_release(rtld_bind_lock, &lockstate);
3227 case RTLD_DI_LINKMAP:
3228 *((struct link_map const **)p) = &obj->linkmap;
3230 case RTLD_DI_ORIGIN:
3231 error = rtld_dirname(obj->path, p);
3234 case RTLD_DI_SERINFOSIZE:
3235 case RTLD_DI_SERINFO:
3236 error = do_search_info(obj, request, (struct dl_serinfo *)p);
3240 _rtld_error("Invalid request %d passed to dlinfo()", request);
3244 lock_release(rtld_bind_lock, &lockstate);
3250 rtld_fill_dl_phdr_info(const Obj_Entry *obj, struct dl_phdr_info *phdr_info)
3253 phdr_info->dlpi_addr = (Elf_Addr)obj->relocbase;
3254 phdr_info->dlpi_name = obj->path;
3255 phdr_info->dlpi_phdr = obj->phdr;
3256 phdr_info->dlpi_phnum = obj->phsize / sizeof(obj->phdr[0]);
3257 phdr_info->dlpi_tls_modid = obj->tlsindex;
3258 phdr_info->dlpi_tls_data = obj->tlsinit;
3259 phdr_info->dlpi_adds = obj_loads;
3260 phdr_info->dlpi_subs = obj_loads - obj_count;
3264 dl_iterate_phdr(__dl_iterate_hdr_callback callback, void *param)
3266 struct dl_phdr_info phdr_info;
3267 const Obj_Entry *obj;
3268 RtldLockState bind_lockstate, phdr_lockstate;
3271 wlock_acquire(rtld_phdr_lock, &phdr_lockstate);
3272 rlock_acquire(rtld_bind_lock, &bind_lockstate);
3276 for (obj = obj_list; obj != NULL; obj = obj->next) {
3277 rtld_fill_dl_phdr_info(obj, &phdr_info);
3278 if ((error = callback(&phdr_info, sizeof phdr_info, param)) != 0)
3282 lock_release(rtld_bind_lock, &bind_lockstate);
3283 lock_release(rtld_phdr_lock, &phdr_lockstate);
3289 fill_search_info(const char *dir, size_t dirlen, void *param)
3291 struct fill_search_info_args *arg;
3295 if (arg->request == RTLD_DI_SERINFOSIZE) {
3296 arg->serinfo->dls_cnt ++;
3297 arg->serinfo->dls_size += sizeof(struct dl_serpath) + dirlen + 1;
3299 struct dl_serpath *s_entry;
3301 s_entry = arg->serpath;
3302 s_entry->dls_name = arg->strspace;
3303 s_entry->dls_flags = arg->flags;
3305 strncpy(arg->strspace, dir, dirlen);
3306 arg->strspace[dirlen] = '\0';
3308 arg->strspace += dirlen + 1;
3316 do_search_info(const Obj_Entry *obj, int request, struct dl_serinfo *info)
3318 struct dl_serinfo _info;
3319 struct fill_search_info_args args;
3321 args.request = RTLD_DI_SERINFOSIZE;
3322 args.serinfo = &_info;
3324 _info.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
3327 path_enumerate(obj->rpath, fill_search_info, &args);
3328 path_enumerate(ld_library_path, fill_search_info, &args);
3329 path_enumerate(obj->runpath, fill_search_info, &args);
3330 path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args);
3331 if (!obj->z_nodeflib)
3332 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args);
3335 if (request == RTLD_DI_SERINFOSIZE) {
3336 info->dls_size = _info.dls_size;
3337 info->dls_cnt = _info.dls_cnt;
3341 if (info->dls_cnt != _info.dls_cnt || info->dls_size != _info.dls_size) {
3342 _rtld_error("Uninitialized Dl_serinfo struct passed to dlinfo()");
3346 args.request = RTLD_DI_SERINFO;
3347 args.serinfo = info;
3348 args.serpath = &info->dls_serpath[0];
3349 args.strspace = (char *)&info->dls_serpath[_info.dls_cnt];
3351 args.flags = LA_SER_RUNPATH;
3352 if (path_enumerate(obj->rpath, fill_search_info, &args) != NULL)
3355 args.flags = LA_SER_LIBPATH;
3356 if (path_enumerate(ld_library_path, fill_search_info, &args) != NULL)
3359 args.flags = LA_SER_RUNPATH;
3360 if (path_enumerate(obj->runpath, fill_search_info, &args) != NULL)
3363 args.flags = LA_SER_CONFIG;
3364 if (path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args)
3368 args.flags = LA_SER_DEFAULT;
3369 if (!obj->z_nodeflib &&
3370 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args) != NULL)
3376 rtld_dirname(const char *path, char *bname)
3380 /* Empty or NULL string gets treated as "." */
3381 if (path == NULL || *path == '\0') {
3387 /* Strip trailing slashes */
3388 endp = path + strlen(path) - 1;
3389 while (endp > path && *endp == '/')
3392 /* Find the start of the dir */
3393 while (endp > path && *endp != '/')
3396 /* Either the dir is "/" or there are no slashes */
3398 bname[0] = *endp == '/' ? '/' : '.';
3404 } while (endp > path && *endp == '/');
3407 if (endp - path + 2 > PATH_MAX)
3409 _rtld_error("Filename is too long: %s", path);
3413 strncpy(bname, path, endp - path + 1);
3414 bname[endp - path + 1] = '\0';
3419 rtld_dirname_abs(const char *path, char *base)
3421 char base_rel[PATH_MAX];
3423 if (rtld_dirname(path, base) == -1)
3427 if (getcwd(base_rel, sizeof(base_rel)) == NULL ||
3428 strlcat(base_rel, "/", sizeof(base_rel)) >= sizeof(base_rel) ||
3429 strlcat(base_rel, base, sizeof(base_rel)) >= sizeof(base_rel))
3431 strcpy(base, base_rel);
3436 linkmap_add(Obj_Entry *obj)
3438 struct link_map *l = &obj->linkmap;
3439 struct link_map *prev;
3441 obj->linkmap.l_name = obj->path;
3442 obj->linkmap.l_addr = obj->mapbase;
3443 obj->linkmap.l_ld = obj->dynamic;
3445 /* GDB needs load offset on MIPS to use the symbols */
3446 obj->linkmap.l_offs = obj->relocbase;
3449 if (r_debug.r_map == NULL) {
3455 * Scan to the end of the list, but not past the entry for the
3456 * dynamic linker, which we want to keep at the very end.
3458 for (prev = r_debug.r_map;
3459 prev->l_next != NULL && prev->l_next != &obj_rtld.linkmap;
3460 prev = prev->l_next)
3463 /* Link in the new entry. */
3465 l->l_next = prev->l_next;
3466 if (l->l_next != NULL)
3467 l->l_next->l_prev = l;
3472 linkmap_delete(Obj_Entry *obj)
3474 struct link_map *l = &obj->linkmap;
3476 if (l->l_prev == NULL) {
3477 if ((r_debug.r_map = l->l_next) != NULL)
3478 l->l_next->l_prev = NULL;
3482 if ((l->l_prev->l_next = l->l_next) != NULL)
3483 l->l_next->l_prev = l->l_prev;
3487 * Function for the debugger to set a breakpoint on to gain control.
3489 * The two parameters allow the debugger to easily find and determine
3490 * what the runtime loader is doing and to whom it is doing it.
3492 * When the loadhook trap is hit (r_debug_state, set at program
3493 * initialization), the arguments can be found on the stack:
3495 * +8 struct link_map *m
3496 * +4 struct r_debug *rd
3500 r_debug_state(struct r_debug* rd, struct link_map *m)
3503 * The following is a hack to force the compiler to emit calls to
3504 * this function, even when optimizing. If the function is empty,
3505 * the compiler is not obliged to emit any code for calls to it,
3506 * even when marked __noinline. However, gdb depends on those
3509 __compiler_membar();
3513 * A function called after init routines have completed. This can be used to
3514 * break before a program's entry routine is called, and can be used when
3515 * main is not available in the symbol table.
3518 _r_debug_postinit(struct link_map *m)
3521 /* See r_debug_state(). */
3522 __compiler_membar();
3526 * Get address of the pointer variable in the main program.
3527 * Prefer non-weak symbol over the weak one.
3529 static const void **
3530 get_program_var_addr(const char *name, RtldLockState *lockstate)
3535 symlook_init(&req, name);
3536 req.lockstate = lockstate;
3537 donelist_init(&donelist);
3538 if (symlook_global(&req, &donelist) != 0)
3540 if (ELF_ST_TYPE(req.sym_out->st_info) == STT_FUNC)
3541 return ((const void **)make_function_pointer(req.sym_out,
3543 else if (ELF_ST_TYPE(req.sym_out->st_info) == STT_GNU_IFUNC)
3544 return ((const void **)rtld_resolve_ifunc(req.defobj_out, req.sym_out));
3546 return ((const void **)(req.defobj_out->relocbase +
3547 req.sym_out->st_value));
3551 * Set a pointer variable in the main program to the given value. This
3552 * is used to set key variables such as "environ" before any of the
3553 * init functions are called.
3556 set_program_var(const char *name, const void *value)
3560 if ((addr = get_program_var_addr(name, NULL)) != NULL) {
3561 dbg("\"%s\": *%p <-- %p", name, addr, value);
3567 * Search the global objects, including dependencies and main object,
3568 * for the given symbol.
3571 symlook_global(SymLook *req, DoneList *donelist)
3574 const Objlist_Entry *elm;
3577 symlook_init_from_req(&req1, req);
3579 /* Search all objects loaded at program start up. */
3580 if (req->defobj_out == NULL ||
3581 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3582 res = symlook_list(&req1, &list_main, donelist);
3583 if (res == 0 && (req->defobj_out == NULL ||
3584 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3585 req->sym_out = req1.sym_out;
3586 req->defobj_out = req1.defobj_out;
3587 assert(req->defobj_out != NULL);
3591 /* Search all DAGs whose roots are RTLD_GLOBAL objects. */
3592 STAILQ_FOREACH(elm, &list_global, link) {
3593 if (req->defobj_out != NULL &&
3594 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3596 res = symlook_list(&req1, &elm->obj->dagmembers, donelist);
3597 if (res == 0 && (req->defobj_out == NULL ||
3598 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3599 req->sym_out = req1.sym_out;
3600 req->defobj_out = req1.defobj_out;
3601 assert(req->defobj_out != NULL);
3605 return (req->sym_out != NULL ? 0 : ESRCH);
3609 * Given a symbol name in a referencing object, find the corresponding
3610 * definition of the symbol. Returns a pointer to the symbol, or NULL if
3611 * no definition was found. Returns a pointer to the Obj_Entry of the
3612 * defining object via the reference parameter DEFOBJ_OUT.
3615 symlook_default(SymLook *req, const Obj_Entry *refobj)
3618 const Objlist_Entry *elm;
3622 donelist_init(&donelist);
3623 symlook_init_from_req(&req1, req);
3625 /* Look first in the referencing object if linked symbolically. */
3626 if (refobj->symbolic && !donelist_check(&donelist, refobj)) {
3627 res = symlook_obj(&req1, refobj);
3629 req->sym_out = req1.sym_out;
3630 req->defobj_out = req1.defobj_out;
3631 assert(req->defobj_out != NULL);
3635 symlook_global(req, &donelist);
3637 /* Search all dlopened DAGs containing the referencing object. */
3638 STAILQ_FOREACH(elm, &refobj->dldags, link) {
3639 if (req->sym_out != NULL &&
3640 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3642 res = symlook_list(&req1, &elm->obj->dagmembers, &donelist);
3643 if (res == 0 && (req->sym_out == NULL ||
3644 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3645 req->sym_out = req1.sym_out;
3646 req->defobj_out = req1.defobj_out;
3647 assert(req->defobj_out != NULL);
3652 * Search the dynamic linker itself, and possibly resolve the
3653 * symbol from there. This is how the application links to
3654 * dynamic linker services such as dlopen.
3656 if (req->sym_out == NULL ||
3657 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3658 res = symlook_obj(&req1, &obj_rtld);
3660 req->sym_out = req1.sym_out;
3661 req->defobj_out = req1.defobj_out;
3662 assert(req->defobj_out != NULL);
3666 return (req->sym_out != NULL ? 0 : ESRCH);
3670 symlook_list(SymLook *req, const Objlist *objlist, DoneList *dlp)
3673 const Obj_Entry *defobj;
3674 const Objlist_Entry *elm;
3680 STAILQ_FOREACH(elm, objlist, link) {
3681 if (donelist_check(dlp, elm->obj))
3683 symlook_init_from_req(&req1, req);
3684 if ((res = symlook_obj(&req1, elm->obj)) == 0) {
3685 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3687 defobj = req1.defobj_out;
3688 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3695 req->defobj_out = defobj;
3702 * Search the chain of DAGS cointed to by the given Needed_Entry
3703 * for a symbol of the given name. Each DAG is scanned completely
3704 * before advancing to the next one. Returns a pointer to the symbol,
3705 * or NULL if no definition was found.
3708 symlook_needed(SymLook *req, const Needed_Entry *needed, DoneList *dlp)
3711 const Needed_Entry *n;
3712 const Obj_Entry *defobj;
3718 symlook_init_from_req(&req1, req);
3719 for (n = needed; n != NULL; n = n->next) {
3720 if (n->obj == NULL ||
3721 (res = symlook_list(&req1, &n->obj->dagmembers, dlp)) != 0)
3723 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3725 defobj = req1.defobj_out;
3726 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3732 req->defobj_out = defobj;
3739 * Search the symbol table of a single shared object for a symbol of
3740 * the given name and version, if requested. Returns a pointer to the
3741 * symbol, or NULL if no definition was found. If the object is
3742 * filter, return filtered symbol from filtee.
3744 * The symbol's hash value is passed in for efficiency reasons; that
3745 * eliminates many recomputations of the hash value.
3748 symlook_obj(SymLook *req, const Obj_Entry *obj)
3752 int flags, res, mres;
3755 * If there is at least one valid hash at this point, we prefer to
3756 * use the faster GNU version if available.
3758 if (obj->valid_hash_gnu)
3759 mres = symlook_obj1_gnu(req, obj);
3760 else if (obj->valid_hash_sysv)
3761 mres = symlook_obj1_sysv(req, obj);
3766 if (obj->needed_filtees != NULL) {
3767 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3768 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3769 donelist_init(&donelist);
3770 symlook_init_from_req(&req1, req);
3771 res = symlook_needed(&req1, obj->needed_filtees, &donelist);
3773 req->sym_out = req1.sym_out;
3774 req->defobj_out = req1.defobj_out;
3778 if (obj->needed_aux_filtees != NULL) {
3779 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3780 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3781 donelist_init(&donelist);
3782 symlook_init_from_req(&req1, req);
3783 res = symlook_needed(&req1, obj->needed_aux_filtees, &donelist);
3785 req->sym_out = req1.sym_out;
3786 req->defobj_out = req1.defobj_out;
3794 /* Symbol match routine common to both hash functions */
3796 matched_symbol(SymLook *req, const Obj_Entry *obj, Sym_Match_Result *result,
3797 const unsigned long symnum)
3800 const Elf_Sym *symp;
3803 symp = obj->symtab + symnum;
3804 strp = obj->strtab + symp->st_name;
3806 switch (ELF_ST_TYPE(symp->st_info)) {
3812 if (symp->st_value == 0)
3816 if (symp->st_shndx != SHN_UNDEF)
3819 else if (((req->flags & SYMLOOK_IN_PLT) == 0) &&
3820 (ELF_ST_TYPE(symp->st_info) == STT_FUNC))
3827 if (req->name[0] != strp[0] || strcmp(req->name, strp) != 0)
3830 if (req->ventry == NULL) {
3831 if (obj->versyms != NULL) {
3832 verndx = VER_NDX(obj->versyms[symnum]);
3833 if (verndx > obj->vernum) {
3835 "%s: symbol %s references wrong version %d",
3836 obj->path, obj->strtab + symnum, verndx);
3840 * If we are not called from dlsym (i.e. this
3841 * is a normal relocation from unversioned
3842 * binary), accept the symbol immediately if
3843 * it happens to have first version after this
3844 * shared object became versioned. Otherwise,
3845 * if symbol is versioned and not hidden,
3846 * remember it. If it is the only symbol with
3847 * this name exported by the shared object, it
3848 * will be returned as a match by the calling
3849 * function. If symbol is global (verndx < 2)
3850 * accept it unconditionally.
3852 if ((req->flags & SYMLOOK_DLSYM) == 0 &&
3853 verndx == VER_NDX_GIVEN) {
3854 result->sym_out = symp;
3857 else if (verndx >= VER_NDX_GIVEN) {
3858 if ((obj->versyms[symnum] & VER_NDX_HIDDEN)
3860 if (result->vsymp == NULL)
3861 result->vsymp = symp;
3867 result->sym_out = symp;
3870 if (obj->versyms == NULL) {
3871 if (object_match_name(obj, req->ventry->name)) {
3872 _rtld_error("%s: object %s should provide version %s "
3873 "for symbol %s", obj_rtld.path, obj->path,
3874 req->ventry->name, obj->strtab + symnum);
3878 verndx = VER_NDX(obj->versyms[symnum]);
3879 if (verndx > obj->vernum) {
3880 _rtld_error("%s: symbol %s references wrong version %d",
3881 obj->path, obj->strtab + symnum, verndx);
3884 if (obj->vertab[verndx].hash != req->ventry->hash ||
3885 strcmp(obj->vertab[verndx].name, req->ventry->name)) {
3887 * Version does not match. Look if this is a
3888 * global symbol and if it is not hidden. If
3889 * global symbol (verndx < 2) is available,
3890 * use it. Do not return symbol if we are
3891 * called by dlvsym, because dlvsym looks for
3892 * a specific version and default one is not
3893 * what dlvsym wants.
3895 if ((req->flags & SYMLOOK_DLSYM) ||
3896 (verndx >= VER_NDX_GIVEN) ||
3897 (obj->versyms[symnum] & VER_NDX_HIDDEN))
3901 result->sym_out = symp;
3906 * Search for symbol using SysV hash function.
3907 * obj->buckets is known not to be NULL at this point; the test for this was
3908 * performed with the obj->valid_hash_sysv assignment.
3911 symlook_obj1_sysv(SymLook *req, const Obj_Entry *obj)
3913 unsigned long symnum;
3914 Sym_Match_Result matchres;
3916 matchres.sym_out = NULL;
3917 matchres.vsymp = NULL;
3918 matchres.vcount = 0;
3920 for (symnum = obj->buckets[req->hash % obj->nbuckets];
3921 symnum != STN_UNDEF; symnum = obj->chains[symnum]) {
3922 if (symnum >= obj->nchains)
3923 return (ESRCH); /* Bad object */
3925 if (matched_symbol(req, obj, &matchres, symnum)) {
3926 req->sym_out = matchres.sym_out;
3927 req->defobj_out = obj;
3931 if (matchres.vcount == 1) {
3932 req->sym_out = matchres.vsymp;
3933 req->defobj_out = obj;
3939 /* Search for symbol using GNU hash function */
3941 symlook_obj1_gnu(SymLook *req, const Obj_Entry *obj)
3943 Elf_Addr bloom_word;
3944 const Elf32_Word *hashval;
3946 Sym_Match_Result matchres;
3947 unsigned int h1, h2;
3948 unsigned long symnum;
3950 matchres.sym_out = NULL;
3951 matchres.vsymp = NULL;
3952 matchres.vcount = 0;
3954 /* Pick right bitmask word from Bloom filter array */
3955 bloom_word = obj->bloom_gnu[(req->hash_gnu / __ELF_WORD_SIZE) &
3956 obj->maskwords_bm_gnu];
3958 /* Calculate modulus word size of gnu hash and its derivative */
3959 h1 = req->hash_gnu & (__ELF_WORD_SIZE - 1);
3960 h2 = ((req->hash_gnu >> obj->shift2_gnu) & (__ELF_WORD_SIZE - 1));
3962 /* Filter out the "definitely not in set" queries */
3963 if (((bloom_word >> h1) & (bloom_word >> h2) & 1) == 0)
3966 /* Locate hash chain and corresponding value element*/
3967 bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu];
3970 hashval = &obj->chain_zero_gnu[bucket];
3972 if (((*hashval ^ req->hash_gnu) >> 1) == 0) {
3973 symnum = hashval - obj->chain_zero_gnu;
3974 if (matched_symbol(req, obj, &matchres, symnum)) {
3975 req->sym_out = matchres.sym_out;
3976 req->defobj_out = obj;
3980 } while ((*hashval++ & 1) == 0);
3981 if (matchres.vcount == 1) {
3982 req->sym_out = matchres.vsymp;
3983 req->defobj_out = obj;
3990 trace_loaded_objects(Obj_Entry *obj)
3992 char *fmt1, *fmt2, *fmt, *main_local, *list_containers;
3995 if ((main_local = getenv(LD_ "TRACE_LOADED_OBJECTS_PROGNAME")) == NULL)
3998 if ((fmt1 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT1")) == NULL)
3999 fmt1 = "\t%o => %p (%x)\n";
4001 if ((fmt2 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT2")) == NULL)
4002 fmt2 = "\t%o (%x)\n";
4004 list_containers = getenv(LD_ "TRACE_LOADED_OBJECTS_ALL");
4006 for (; obj; obj = obj->next) {
4007 Needed_Entry *needed;
4011 if (list_containers && obj->needed != NULL)
4012 rtld_printf("%s:\n", obj->path);
4013 for (needed = obj->needed; needed; needed = needed->next) {
4014 if (needed->obj != NULL) {
4015 if (needed->obj->traced && !list_containers)
4017 needed->obj->traced = true;
4018 path = needed->obj->path;
4022 name = (char *)obj->strtab + needed->name;
4023 is_lib = strncmp(name, "lib", 3) == 0; /* XXX - bogus */
4025 fmt = is_lib ? fmt1 : fmt2;
4026 while ((c = *fmt++) != '\0') {
4052 rtld_putstr(main_local);
4055 rtld_putstr(obj_main->path);
4062 rtld_printf("%d", sodp->sod_major);
4065 rtld_printf("%d", sodp->sod_minor);
4072 rtld_printf("%p", needed->obj ? needed->obj->mapbase :
4085 * Unload a dlopened object and its dependencies from memory and from
4086 * our data structures. It is assumed that the DAG rooted in the
4087 * object has already been unreferenced, and that the object has a
4088 * reference count of 0.
4091 unload_object(Obj_Entry *root)
4096 assert(root->refcount == 0);
4099 * Pass over the DAG removing unreferenced objects from
4100 * appropriate lists.
4102 unlink_object(root);
4104 /* Unmap all objects that are no longer referenced. */
4105 linkp = &obj_list->next;
4106 while ((obj = *linkp) != NULL) {
4107 if (obj->refcount == 0) {
4108 LD_UTRACE(UTRACE_UNLOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
4110 dbg("unloading \"%s\"", obj->path);
4111 unload_filtees(root);
4112 munmap(obj->mapbase, obj->mapsize);
4113 linkmap_delete(obj);
4124 unlink_object(Obj_Entry *root)
4128 if (root->refcount == 0) {
4129 /* Remove the object from the RTLD_GLOBAL list. */
4130 objlist_remove(&list_global, root);
4132 /* Remove the object from all objects' DAG lists. */
4133 STAILQ_FOREACH(elm, &root->dagmembers, link) {
4134 objlist_remove(&elm->obj->dldags, root);
4135 if (elm->obj != root)
4136 unlink_object(elm->obj);
4142 ref_dag(Obj_Entry *root)
4146 assert(root->dag_inited);
4147 STAILQ_FOREACH(elm, &root->dagmembers, link)
4148 elm->obj->refcount++;
4152 unref_dag(Obj_Entry *root)
4156 assert(root->dag_inited);
4157 STAILQ_FOREACH(elm, &root->dagmembers, link)
4158 elm->obj->refcount--;
4162 * Common code for MD __tls_get_addr().
4164 static void *tls_get_addr_slow(Elf_Addr **, int, size_t) __noinline;
4166 tls_get_addr_slow(Elf_Addr **dtvp, int index, size_t offset)
4168 Elf_Addr *newdtv, *dtv;
4169 RtldLockState lockstate;
4173 /* Check dtv generation in case new modules have arrived */
4174 if (dtv[0] != tls_dtv_generation) {
4175 wlock_acquire(rtld_bind_lock, &lockstate);
4176 newdtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4178 if (to_copy > tls_max_index)
4179 to_copy = tls_max_index;
4180 memcpy(&newdtv[2], &dtv[2], to_copy * sizeof(Elf_Addr));
4181 newdtv[0] = tls_dtv_generation;
4182 newdtv[1] = tls_max_index;
4184 lock_release(rtld_bind_lock, &lockstate);
4185 dtv = *dtvp = newdtv;
4188 /* Dynamically allocate module TLS if necessary */
4189 if (dtv[index + 1] == 0) {
4190 /* Signal safe, wlock will block out signals. */
4191 wlock_acquire(rtld_bind_lock, &lockstate);
4192 if (!dtv[index + 1])
4193 dtv[index + 1] = (Elf_Addr)allocate_module_tls(index);
4194 lock_release(rtld_bind_lock, &lockstate);
4196 return ((void *)(dtv[index + 1] + offset));
4200 tls_get_addr_common(Elf_Addr **dtvp, int index, size_t offset)
4205 /* Check dtv generation in case new modules have arrived */
4206 if (__predict_true(dtv[0] == tls_dtv_generation &&
4207 dtv[index + 1] != 0))
4208 return ((void *)(dtv[index + 1] + offset));
4209 return (tls_get_addr_slow(dtvp, index, offset));
4212 #if defined(__arm__) || defined(__ia64__) || defined(__mips__) || defined(__powerpc__)
4215 * Allocate Static TLS using the Variant I method.
4218 allocate_tls(Obj_Entry *objs, void *oldtcb, size_t tcbsize, size_t tcbalign)
4227 if (oldtcb != NULL && tcbsize == TLS_TCB_SIZE)
4230 assert(tcbsize >= TLS_TCB_SIZE);
4231 tcb = xcalloc(1, tls_static_space - TLS_TCB_SIZE + tcbsize);
4232 tls = (Elf_Addr **)(tcb + tcbsize - TLS_TCB_SIZE);
4234 if (oldtcb != NULL) {
4235 memcpy(tls, oldtcb, tls_static_space);
4238 /* Adjust the DTV. */
4240 for (i = 0; i < dtv[1]; i++) {
4241 if (dtv[i+2] >= (Elf_Addr)oldtcb &&
4242 dtv[i+2] < (Elf_Addr)oldtcb + tls_static_space) {
4243 dtv[i+2] = dtv[i+2] - (Elf_Addr)oldtcb + (Elf_Addr)tls;
4247 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4249 dtv[0] = tls_dtv_generation;
4250 dtv[1] = tls_max_index;
4252 for (obj = objs; obj; obj = obj->next) {
4253 if (obj->tlsoffset > 0) {
4254 addr = (Elf_Addr)tls + obj->tlsoffset;
4255 if (obj->tlsinitsize > 0)
4256 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4257 if (obj->tlssize > obj->tlsinitsize)
4258 memset((void*) (addr + obj->tlsinitsize), 0,
4259 obj->tlssize - obj->tlsinitsize);
4260 dtv[obj->tlsindex + 1] = addr;
4269 free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4272 Elf_Addr tlsstart, tlsend;
4275 assert(tcbsize >= TLS_TCB_SIZE);
4277 tlsstart = (Elf_Addr)tcb + tcbsize - TLS_TCB_SIZE;
4278 tlsend = tlsstart + tls_static_space;
4280 dtv = *(Elf_Addr **)tlsstart;
4282 for (i = 0; i < dtvsize; i++) {
4283 if (dtv[i+2] && (dtv[i+2] < tlsstart || dtv[i+2] >= tlsend)) {
4284 free((void*)dtv[i+2]);
4293 #if defined(__i386__) || defined(__amd64__) || defined(__sparc64__)
4296 * Allocate Static TLS using the Variant II method.
4299 allocate_tls(Obj_Entry *objs, void *oldtls, size_t tcbsize, size_t tcbalign)
4302 size_t size, ralign;
4304 Elf_Addr *dtv, *olddtv;
4305 Elf_Addr segbase, oldsegbase, addr;
4309 if (tls_static_max_align > ralign)
4310 ralign = tls_static_max_align;
4311 size = round(tls_static_space, ralign) + round(tcbsize, ralign);
4313 assert(tcbsize >= 2*sizeof(Elf_Addr));
4314 tls = malloc_aligned(size, ralign);
4315 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4317 segbase = (Elf_Addr)(tls + round(tls_static_space, ralign));
4318 ((Elf_Addr*)segbase)[0] = segbase;
4319 ((Elf_Addr*)segbase)[1] = (Elf_Addr) dtv;
4321 dtv[0] = tls_dtv_generation;
4322 dtv[1] = tls_max_index;
4326 * Copy the static TLS block over whole.
4328 oldsegbase = (Elf_Addr) oldtls;
4329 memcpy((void *)(segbase - tls_static_space),
4330 (const void *)(oldsegbase - tls_static_space),
4334 * If any dynamic TLS blocks have been created tls_get_addr(),
4337 olddtv = ((Elf_Addr**)oldsegbase)[1];
4338 for (i = 0; i < olddtv[1]; i++) {
4339 if (olddtv[i+2] < oldsegbase - size || olddtv[i+2] > oldsegbase) {
4340 dtv[i+2] = olddtv[i+2];
4346 * We assume that this block was the one we created with
4347 * allocate_initial_tls().
4349 free_tls(oldtls, 2*sizeof(Elf_Addr), sizeof(Elf_Addr));
4351 for (obj = objs; obj; obj = obj->next) {
4352 if (obj->tlsoffset) {
4353 addr = segbase - obj->tlsoffset;
4354 memset((void*) (addr + obj->tlsinitsize),
4355 0, obj->tlssize - obj->tlsinitsize);
4357 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4358 dtv[obj->tlsindex + 1] = addr;
4363 return (void*) segbase;
4367 free_tls(void *tls, size_t tcbsize, size_t tcbalign)
4370 size_t size, ralign;
4372 Elf_Addr tlsstart, tlsend;
4375 * Figure out the size of the initial TLS block so that we can
4376 * find stuff which ___tls_get_addr() allocated dynamically.
4379 if (tls_static_max_align > ralign)
4380 ralign = tls_static_max_align;
4381 size = round(tls_static_space, ralign);
4383 dtv = ((Elf_Addr**)tls)[1];
4385 tlsend = (Elf_Addr) tls;
4386 tlsstart = tlsend - size;
4387 for (i = 0; i < dtvsize; i++) {
4388 if (dtv[i + 2] != 0 && (dtv[i + 2] < tlsstart || dtv[i + 2] > tlsend)) {
4389 free_aligned((void *)dtv[i + 2]);
4393 free_aligned((void *)tlsstart);
4400 * Allocate TLS block for module with given index.
4403 allocate_module_tls(int index)
4408 for (obj = obj_list; obj; obj = obj->next) {
4409 if (obj->tlsindex == index)
4413 _rtld_error("Can't find module with TLS index %d", index);
4417 p = malloc_aligned(obj->tlssize, obj->tlsalign);
4418 memcpy(p, obj->tlsinit, obj->tlsinitsize);
4419 memset(p + obj->tlsinitsize, 0, obj->tlssize - obj->tlsinitsize);
4425 allocate_tls_offset(Obj_Entry *obj)
4432 if (obj->tlssize == 0) {
4433 obj->tls_done = true;
4437 if (obj->tlsindex == 1)
4438 off = calculate_first_tls_offset(obj->tlssize, obj->tlsalign);
4440 off = calculate_tls_offset(tls_last_offset, tls_last_size,
4441 obj->tlssize, obj->tlsalign);
4444 * If we have already fixed the size of the static TLS block, we
4445 * must stay within that size. When allocating the static TLS, we
4446 * leave a small amount of space spare to be used for dynamically
4447 * loading modules which use static TLS.
4449 if (tls_static_space != 0) {
4450 if (calculate_tls_end(off, obj->tlssize) > tls_static_space)
4452 } else if (obj->tlsalign > tls_static_max_align) {
4453 tls_static_max_align = obj->tlsalign;
4456 tls_last_offset = obj->tlsoffset = off;
4457 tls_last_size = obj->tlssize;
4458 obj->tls_done = true;
4464 free_tls_offset(Obj_Entry *obj)
4468 * If we were the last thing to allocate out of the static TLS
4469 * block, we give our space back to the 'allocator'. This is a
4470 * simplistic workaround to allow libGL.so.1 to be loaded and
4471 * unloaded multiple times.
4473 if (calculate_tls_end(obj->tlsoffset, obj->tlssize)
4474 == calculate_tls_end(tls_last_offset, tls_last_size)) {
4475 tls_last_offset -= obj->tlssize;
4481 _rtld_allocate_tls(void *oldtls, size_t tcbsize, size_t tcbalign)
4484 RtldLockState lockstate;
4486 wlock_acquire(rtld_bind_lock, &lockstate);
4487 ret = allocate_tls(obj_list, oldtls, tcbsize, tcbalign);
4488 lock_release(rtld_bind_lock, &lockstate);
4493 _rtld_free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4495 RtldLockState lockstate;
4497 wlock_acquire(rtld_bind_lock, &lockstate);
4498 free_tls(tcb, tcbsize, tcbalign);
4499 lock_release(rtld_bind_lock, &lockstate);
4503 object_add_name(Obj_Entry *obj, const char *name)
4509 entry = malloc(sizeof(Name_Entry) + len);
4511 if (entry != NULL) {
4512 strcpy(entry->name, name);
4513 STAILQ_INSERT_TAIL(&obj->names, entry, link);
4518 object_match_name(const Obj_Entry *obj, const char *name)
4522 STAILQ_FOREACH(entry, &obj->names, link) {
4523 if (strcmp(name, entry->name) == 0)
4530 locate_dependency(const Obj_Entry *obj, const char *name)
4532 const Objlist_Entry *entry;
4533 const Needed_Entry *needed;
4535 STAILQ_FOREACH(entry, &list_main, link) {
4536 if (object_match_name(entry->obj, name))
4540 for (needed = obj->needed; needed != NULL; needed = needed->next) {
4541 if (strcmp(obj->strtab + needed->name, name) == 0 ||
4542 (needed->obj != NULL && object_match_name(needed->obj, name))) {
4544 * If there is DT_NEEDED for the name we are looking for,
4545 * we are all set. Note that object might not be found if
4546 * dependency was not loaded yet, so the function can
4547 * return NULL here. This is expected and handled
4548 * properly by the caller.
4550 return (needed->obj);
4553 _rtld_error("%s: Unexpected inconsistency: dependency %s not found",
4559 check_object_provided_version(Obj_Entry *refobj, const Obj_Entry *depobj,
4560 const Elf_Vernaux *vna)
4562 const Elf_Verdef *vd;
4563 const char *vername;
4565 vername = refobj->strtab + vna->vna_name;
4566 vd = depobj->verdef;
4568 _rtld_error("%s: version %s required by %s not defined",
4569 depobj->path, vername, refobj->path);
4573 if (vd->vd_version != VER_DEF_CURRENT) {
4574 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4575 depobj->path, vd->vd_version);
4578 if (vna->vna_hash == vd->vd_hash) {
4579 const Elf_Verdaux *aux = (const Elf_Verdaux *)
4580 ((char *)vd + vd->vd_aux);
4581 if (strcmp(vername, depobj->strtab + aux->vda_name) == 0)
4584 if (vd->vd_next == 0)
4586 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4588 if (vna->vna_flags & VER_FLG_WEAK)
4590 _rtld_error("%s: version %s required by %s not found",
4591 depobj->path, vername, refobj->path);
4596 rtld_verify_object_versions(Obj_Entry *obj)
4598 const Elf_Verneed *vn;
4599 const Elf_Verdef *vd;
4600 const Elf_Verdaux *vda;
4601 const Elf_Vernaux *vna;
4602 const Obj_Entry *depobj;
4603 int maxvernum, vernum;
4605 if (obj->ver_checked)
4607 obj->ver_checked = true;
4611 * Walk over defined and required version records and figure out
4612 * max index used by any of them. Do very basic sanity checking
4616 while (vn != NULL) {
4617 if (vn->vn_version != VER_NEED_CURRENT) {
4618 _rtld_error("%s: Unsupported version %d of Elf_Verneed entry",
4619 obj->path, vn->vn_version);
4622 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4624 vernum = VER_NEED_IDX(vna->vna_other);
4625 if (vernum > maxvernum)
4627 if (vna->vna_next == 0)
4629 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4631 if (vn->vn_next == 0)
4633 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4637 while (vd != NULL) {
4638 if (vd->vd_version != VER_DEF_CURRENT) {
4639 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4640 obj->path, vd->vd_version);
4643 vernum = VER_DEF_IDX(vd->vd_ndx);
4644 if (vernum > maxvernum)
4646 if (vd->vd_next == 0)
4648 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4655 * Store version information in array indexable by version index.
4656 * Verify that object version requirements are satisfied along the
4659 obj->vernum = maxvernum + 1;
4660 obj->vertab = xcalloc(obj->vernum, sizeof(Ver_Entry));
4663 while (vd != NULL) {
4664 if ((vd->vd_flags & VER_FLG_BASE) == 0) {
4665 vernum = VER_DEF_IDX(vd->vd_ndx);
4666 assert(vernum <= maxvernum);
4667 vda = (const Elf_Verdaux *)((char *)vd + vd->vd_aux);
4668 obj->vertab[vernum].hash = vd->vd_hash;
4669 obj->vertab[vernum].name = obj->strtab + vda->vda_name;
4670 obj->vertab[vernum].file = NULL;
4671 obj->vertab[vernum].flags = 0;
4673 if (vd->vd_next == 0)
4675 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4679 while (vn != NULL) {
4680 depobj = locate_dependency(obj, obj->strtab + vn->vn_file);
4683 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4685 if (check_object_provided_version(obj, depobj, vna))
4687 vernum = VER_NEED_IDX(vna->vna_other);
4688 assert(vernum <= maxvernum);
4689 obj->vertab[vernum].hash = vna->vna_hash;
4690 obj->vertab[vernum].name = obj->strtab + vna->vna_name;
4691 obj->vertab[vernum].file = obj->strtab + vn->vn_file;
4692 obj->vertab[vernum].flags = (vna->vna_other & VER_NEED_HIDDEN) ?
4693 VER_INFO_HIDDEN : 0;
4694 if (vna->vna_next == 0)
4696 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4698 if (vn->vn_next == 0)
4700 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4706 rtld_verify_versions(const Objlist *objlist)
4708 Objlist_Entry *entry;
4712 STAILQ_FOREACH(entry, objlist, link) {
4714 * Skip dummy objects or objects that have their version requirements
4717 if (entry->obj->strtab == NULL || entry->obj->vertab != NULL)
4719 if (rtld_verify_object_versions(entry->obj) == -1) {
4721 if (ld_tracing == NULL)
4725 if (rc == 0 || ld_tracing != NULL)
4726 rc = rtld_verify_object_versions(&obj_rtld);
4731 fetch_ventry(const Obj_Entry *obj, unsigned long symnum)
4736 vernum = VER_NDX(obj->versyms[symnum]);
4737 if (vernum >= obj->vernum) {
4738 _rtld_error("%s: symbol %s has wrong verneed value %d",
4739 obj->path, obj->strtab + symnum, vernum);
4740 } else if (obj->vertab[vernum].hash != 0) {
4741 return &obj->vertab[vernum];
4748 _rtld_get_stack_prot(void)
4751 return (stack_prot);
4755 _rtld_is_dlopened(void *arg)
4758 RtldLockState lockstate;
4761 rlock_acquire(rtld_bind_lock, &lockstate);
4764 obj = obj_from_addr(arg);
4766 _rtld_error("No shared object contains address");
4767 lock_release(rtld_bind_lock, &lockstate);
4770 res = obj->dlopened ? 1 : 0;
4771 lock_release(rtld_bind_lock, &lockstate);
4776 map_stacks_exec(RtldLockState *lockstate)
4778 void (*thr_map_stacks_exec)(void);
4780 if ((max_stack_flags & PF_X) == 0 || (stack_prot & PROT_EXEC) != 0)
4782 thr_map_stacks_exec = (void (*)(void))(uintptr_t)
4783 get_program_var_addr("__pthread_map_stacks_exec", lockstate);
4784 if (thr_map_stacks_exec != NULL) {
4785 stack_prot |= PROT_EXEC;
4786 thr_map_stacks_exec();
4791 symlook_init(SymLook *dst, const char *name)
4794 bzero(dst, sizeof(*dst));
4796 dst->hash = elf_hash(name);
4797 dst->hash_gnu = gnu_hash(name);
4801 symlook_init_from_req(SymLook *dst, const SymLook *src)
4804 dst->name = src->name;
4805 dst->hash = src->hash;
4806 dst->hash_gnu = src->hash_gnu;
4807 dst->ventry = src->ventry;
4808 dst->flags = src->flags;
4809 dst->defobj_out = NULL;
4810 dst->sym_out = NULL;
4811 dst->lockstate = src->lockstate;
4815 * Overrides for libc_pic-provided functions.
4819 __getosreldate(void)
4829 oid[1] = KERN_OSRELDATE;
4831 len = sizeof(osrel);
4832 error = sysctl(oid, 2, &osrel, &len, NULL, 0);
4833 if (error == 0 && osrel > 0 && len == sizeof(osrel))
4845 void (*__cleanup)(void);
4846 int __isthreaded = 0;
4847 int _thread_autoinit_dummy_decl = 1;
4850 * No unresolved symbols for rtld.
4853 __pthread_cxa_finalize(struct dl_phdr_info *a)
4858 __stack_chk_fail(void)
4861 _rtld_error("stack overflow detected; terminated");
4864 __weak_reference(__stack_chk_fail, __stack_chk_fail_local);
4870 _rtld_error("buffer overflow detected; terminated");
4875 rtld_strerror(int errnum)
4878 if (errnum < 0 || errnum >= sys_nerr)
4879 return ("Unknown error");
4880 return (sys_errlist[errnum]);