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 digest_dynamic1(Obj_Entry *, int, const Elf_Dyn **,
82 const Elf_Dyn **, const Elf_Dyn **);
83 static void digest_dynamic2(Obj_Entry *, const Elf_Dyn *, const Elf_Dyn *,
85 static void digest_dynamic(Obj_Entry *, int);
86 static Obj_Entry *digest_phdr(const Elf_Phdr *, int, caddr_t, const char *);
87 static Obj_Entry *dlcheck(void *);
88 static Obj_Entry *dlopen_object(const char *name, int fd, Obj_Entry *refobj,
89 int lo_flags, int mode, RtldLockState *lockstate);
90 static Obj_Entry *do_load_object(int, const char *, char *, struct stat *, int);
91 static int do_search_info(const Obj_Entry *obj, int, struct dl_serinfo *);
92 static bool donelist_check(DoneList *, const Obj_Entry *);
93 static void errmsg_restore(char *);
94 static char *errmsg_save(void);
95 static void *fill_search_info(const char *, size_t, void *);
96 static char *find_library(const char *, const Obj_Entry *);
97 static const char *gethints(bool);
98 static void init_dag(Obj_Entry *);
99 static void init_pagesizes(Elf_Auxinfo **aux_info);
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 __exported;
164 void _r_debug_postinit(struct link_map *) __noinline __exported;
169 static char *error_message; /* Message for dlerror(), or NULL */
170 struct r_debug r_debug __exported; /* 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 dlclose(void *) __exported;
210 char *dlerror(void) __exported;
211 void *dlopen(const char *, int) __exported;
212 void *fdlopen(int, int) __exported;
213 void *dlsym(void *, const char *) __exported;
214 dlfunc_t dlfunc(void *, const char *) __exported;
215 void *dlvsym(void *, const char *, const char *) __exported;
216 int dladdr(const void *, Dl_info *) __exported;
217 void dllockinit(void *, void *(*)(void *), void (*)(void *), void (*)(void *),
218 void (*)(void *), void (*)(void *), void (*)(void *)) __exported;
219 int dlinfo(void *, int , void *) __exported;
220 int dl_iterate_phdr(__dl_iterate_hdr_callback, void *) __exported;
221 int _rtld_addr_phdr(const void *, struct dl_phdr_info *) __exported;
222 int _rtld_get_stack_prot(void) __exported;
223 int _rtld_is_dlopened(void *) __exported;
224 void _rtld_error(const char *, ...) __exported;
226 int npagesizes, osreldate;
229 long __stack_chk_guard[8] = {0, 0, 0, 0, 0, 0, 0, 0};
231 static int stack_prot = PROT_READ | PROT_WRITE | RTLD_DEFAULT_STACK_EXEC;
232 static int max_stack_flags;
235 * Global declarations normally provided by crt1. The dynamic linker is
236 * not built with crt1, so we have to provide them ourselves.
242 * Used to pass argc, argv to init functions.
248 * Globals to control TLS allocation.
250 size_t tls_last_offset; /* Static TLS offset of last module */
251 size_t tls_last_size; /* Static TLS size of last module */
252 size_t tls_static_space; /* Static TLS space allocated */
253 size_t tls_static_max_align;
254 int tls_dtv_generation = 1; /* Used to detect when dtv size changes */
255 int tls_max_index = 1; /* Largest module index allocated */
257 bool ld_library_path_rpath = false;
260 * Fill in a DoneList with an allocation large enough to hold all of
261 * the currently-loaded objects. Keep this as a macro since it calls
262 * alloca and we want that to occur within the scope of the caller.
264 #define donelist_init(dlp) \
265 ((dlp)->objs = alloca(obj_count * sizeof (dlp)->objs[0]), \
266 assert((dlp)->objs != NULL), \
267 (dlp)->num_alloc = obj_count, \
270 #define UTRACE_DLOPEN_START 1
271 #define UTRACE_DLOPEN_STOP 2
272 #define UTRACE_DLCLOSE_START 3
273 #define UTRACE_DLCLOSE_STOP 4
274 #define UTRACE_LOAD_OBJECT 5
275 #define UTRACE_UNLOAD_OBJECT 6
276 #define UTRACE_ADD_RUNDEP 7
277 #define UTRACE_PRELOAD_FINISHED 8
278 #define UTRACE_INIT_CALL 9
279 #define UTRACE_FINI_CALL 10
282 char sig[4]; /* 'RTLD' */
285 void *mapbase; /* Used for 'parent' and 'init/fini' */
287 int refcnt; /* Used for 'mode' */
288 char name[MAXPATHLEN];
291 #define LD_UTRACE(e, h, mb, ms, r, n) do { \
292 if (ld_utrace != NULL) \
293 ld_utrace_log(e, h, mb, ms, r, n); \
297 ld_utrace_log(int event, void *handle, void *mapbase, size_t mapsize,
298 int refcnt, const char *name)
300 struct utrace_rtld ut;
308 ut.mapbase = mapbase;
309 ut.mapsize = mapsize;
311 bzero(ut.name, sizeof(ut.name));
313 strlcpy(ut.name, name, sizeof(ut.name));
314 utrace(&ut, sizeof(ut));
318 * Main entry point for dynamic linking. The first argument is the
319 * stack pointer. The stack is expected to be laid out as described
320 * in the SVR4 ABI specification, Intel 386 Processor Supplement.
321 * Specifically, the stack pointer points to a word containing
322 * ARGC. Following that in the stack is a null-terminated sequence
323 * of pointers to argument strings. Then comes a null-terminated
324 * sequence of pointers to environment strings. Finally, there is a
325 * sequence of "auxiliary vector" entries.
327 * The second argument points to a place to store the dynamic linker's
328 * exit procedure pointer and the third to a place to store the main
331 * The return value is the main program's entry point.
334 _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp)
336 Elf_Auxinfo *aux_info[AT_COUNT];
344 Objlist_Entry *entry;
346 Obj_Entry **preload_tail;
347 Obj_Entry *last_interposer;
349 RtldLockState lockstate;
350 char *library_path_rpath;
355 * On entry, the dynamic linker itself has not been relocated yet.
356 * Be very careful not to reference any global data until after
357 * init_rtld has returned. It is OK to reference file-scope statics
358 * and string constants, and to call static and global functions.
361 /* Find the auxiliary vector on the stack. */
364 sp += argc + 1; /* Skip over arguments and NULL terminator */
366 while (*sp++ != 0) /* Skip over environment, and NULL terminator */
368 aux = (Elf_Auxinfo *) sp;
370 /* Digest the auxiliary vector. */
371 for (i = 0; i < AT_COUNT; i++)
373 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) {
374 if (auxp->a_type < AT_COUNT)
375 aux_info[auxp->a_type] = auxp;
378 /* Initialize and relocate ourselves. */
379 assert(aux_info[AT_BASE] != NULL);
380 init_rtld((caddr_t) aux_info[AT_BASE]->a_un.a_ptr, aux_info);
382 __progname = obj_rtld.path;
383 argv0 = argv[0] != NULL ? argv[0] : "(null)";
388 if (aux_info[AT_CANARY] != NULL &&
389 aux_info[AT_CANARY]->a_un.a_ptr != NULL) {
390 i = aux_info[AT_CANARYLEN]->a_un.a_val;
391 if (i > sizeof(__stack_chk_guard))
392 i = sizeof(__stack_chk_guard);
393 memcpy(__stack_chk_guard, aux_info[AT_CANARY]->a_un.a_ptr, i);
398 len = sizeof(__stack_chk_guard);
399 if (sysctl(mib, 2, __stack_chk_guard, &len, NULL, 0) == -1 ||
400 len != sizeof(__stack_chk_guard)) {
401 /* If sysctl was unsuccessful, use the "terminator canary". */
402 ((unsigned char *)(void *)__stack_chk_guard)[0] = 0;
403 ((unsigned char *)(void *)__stack_chk_guard)[1] = 0;
404 ((unsigned char *)(void *)__stack_chk_guard)[2] = '\n';
405 ((unsigned char *)(void *)__stack_chk_guard)[3] = 255;
409 trust = !issetugid();
411 ld_bind_now = getenv(LD_ "BIND_NOW");
413 * If the process is tainted, then we un-set the dangerous environment
414 * variables. The process will be marked as tainted until setuid(2)
415 * is called. If any child process calls setuid(2) we do not want any
416 * future processes to honor the potentially un-safe variables.
419 if (unsetenv(LD_ "PRELOAD") || unsetenv(LD_ "LIBMAP") ||
420 unsetenv(LD_ "LIBRARY_PATH") || unsetenv(LD_ "LIBMAP_DISABLE") ||
421 unsetenv(LD_ "DEBUG") || unsetenv(LD_ "ELF_HINTS_PATH") ||
422 unsetenv(LD_ "LOADFLTR") || unsetenv(LD_ "LIBRARY_PATH_RPATH")) {
423 _rtld_error("environment corrupt; aborting");
427 ld_debug = getenv(LD_ "DEBUG");
428 libmap_disable = getenv(LD_ "LIBMAP_DISABLE") != NULL;
429 libmap_override = getenv(LD_ "LIBMAP");
430 ld_library_path = getenv(LD_ "LIBRARY_PATH");
431 ld_preload = getenv(LD_ "PRELOAD");
432 ld_elf_hints_path = getenv(LD_ "ELF_HINTS_PATH");
433 ld_loadfltr = getenv(LD_ "LOADFLTR") != NULL;
434 library_path_rpath = getenv(LD_ "LIBRARY_PATH_RPATH");
435 if (library_path_rpath != NULL) {
436 if (library_path_rpath[0] == 'y' ||
437 library_path_rpath[0] == 'Y' ||
438 library_path_rpath[0] == '1')
439 ld_library_path_rpath = true;
441 ld_library_path_rpath = false;
443 dangerous_ld_env = libmap_disable || (libmap_override != NULL) ||
444 (ld_library_path != NULL) || (ld_preload != NULL) ||
445 (ld_elf_hints_path != NULL) || ld_loadfltr;
446 ld_tracing = getenv(LD_ "TRACE_LOADED_OBJECTS");
447 ld_utrace = getenv(LD_ "UTRACE");
449 if ((ld_elf_hints_path == NULL) || strlen(ld_elf_hints_path) == 0)
450 ld_elf_hints_path = _PATH_ELF_HINTS;
452 if (ld_debug != NULL && *ld_debug != '\0')
454 dbg("%s is initialized, base address = %p", __progname,
455 (caddr_t) aux_info[AT_BASE]->a_un.a_ptr);
456 dbg("RTLD dynamic = %p", obj_rtld.dynamic);
457 dbg("RTLD pltgot = %p", obj_rtld.pltgot);
459 dbg("initializing thread locks");
463 * Load the main program, or process its program header if it is
466 if (aux_info[AT_EXECFD] != NULL) { /* Load the main program. */
467 int fd = aux_info[AT_EXECFD]->a_un.a_val;
468 dbg("loading main program");
469 obj_main = map_object(fd, argv0, NULL);
471 if (obj_main == NULL)
473 max_stack_flags = obj->stack_flags;
474 } else { /* Main program already loaded. */
475 const Elf_Phdr *phdr;
479 dbg("processing main program's program header");
480 assert(aux_info[AT_PHDR] != NULL);
481 phdr = (const Elf_Phdr *) aux_info[AT_PHDR]->a_un.a_ptr;
482 assert(aux_info[AT_PHNUM] != NULL);
483 phnum = aux_info[AT_PHNUM]->a_un.a_val;
484 assert(aux_info[AT_PHENT] != NULL);
485 assert(aux_info[AT_PHENT]->a_un.a_val == sizeof(Elf_Phdr));
486 assert(aux_info[AT_ENTRY] != NULL);
487 entry = (caddr_t) aux_info[AT_ENTRY]->a_un.a_ptr;
488 if ((obj_main = digest_phdr(phdr, phnum, entry, argv0)) == NULL)
492 if (aux_info[AT_EXECPATH] != 0) {
494 char buf[MAXPATHLEN];
496 kexecpath = aux_info[AT_EXECPATH]->a_un.a_ptr;
497 dbg("AT_EXECPATH %p %s", kexecpath, kexecpath);
498 if (kexecpath[0] == '/')
499 obj_main->path = kexecpath;
500 else if (getcwd(buf, sizeof(buf)) == NULL ||
501 strlcat(buf, "/", sizeof(buf)) >= sizeof(buf) ||
502 strlcat(buf, kexecpath, sizeof(buf)) >= sizeof(buf))
503 obj_main->path = xstrdup(argv0);
505 obj_main->path = xstrdup(buf);
507 dbg("No AT_EXECPATH");
508 obj_main->path = xstrdup(argv0);
510 dbg("obj_main path %s", obj_main->path);
511 obj_main->mainprog = true;
513 if (aux_info[AT_STACKPROT] != NULL &&
514 aux_info[AT_STACKPROT]->a_un.a_val != 0)
515 stack_prot = aux_info[AT_STACKPROT]->a_un.a_val;
519 * Get the actual dynamic linker pathname from the executable if
520 * possible. (It should always be possible.) That ensures that
521 * gdb will find the right dynamic linker even if a non-standard
524 if (obj_main->interp != NULL &&
525 strcmp(obj_main->interp, obj_rtld.path) != 0) {
527 obj_rtld.path = xstrdup(obj_main->interp);
528 __progname = obj_rtld.path;
532 digest_dynamic(obj_main, 0);
533 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d",
534 obj_main->path, obj_main->valid_hash_sysv, obj_main->valid_hash_gnu,
535 obj_main->dynsymcount);
537 linkmap_add(obj_main);
538 linkmap_add(&obj_rtld);
540 /* Link the main program into the list of objects. */
541 *obj_tail = obj_main;
542 obj_tail = &obj_main->next;
546 /* Initialize a fake symbol for resolving undefined weak references. */
547 sym_zero.st_info = ELF_ST_INFO(STB_GLOBAL, STT_NOTYPE);
548 sym_zero.st_shndx = SHN_UNDEF;
549 sym_zero.st_value = -(uintptr_t)obj_main->relocbase;
552 libmap_disable = (bool)lm_init(libmap_override);
554 dbg("loading LD_PRELOAD libraries");
555 if (load_preload_objects() == -1)
557 preload_tail = obj_tail;
559 dbg("loading needed objects");
560 if (load_needed_objects(obj_main, 0) == -1)
563 /* Make a list of all objects loaded at startup. */
564 last_interposer = obj_main;
565 for (obj = obj_list; obj != NULL; obj = obj->next) {
566 if (obj->z_interpose && obj != obj_main) {
567 objlist_put_after(&list_main, last_interposer, obj);
568 last_interposer = obj;
570 objlist_push_tail(&list_main, obj);
575 dbg("checking for required versions");
576 if (rtld_verify_versions(&list_main) == -1 && !ld_tracing)
579 if (ld_tracing) { /* We're done */
580 trace_loaded_objects(obj_main);
584 if (getenv(LD_ "DUMP_REL_PRE") != NULL) {
585 dump_relocations(obj_main);
590 * Processing tls relocations requires having the tls offsets
591 * initialized. Prepare offsets before starting initial
592 * relocation processing.
594 dbg("initializing initial thread local storage offsets");
595 STAILQ_FOREACH(entry, &list_main, link) {
597 * Allocate all the initial objects out of the static TLS
598 * block even if they didn't ask for it.
600 allocate_tls_offset(entry->obj);
603 if (relocate_objects(obj_main,
604 ld_bind_now != NULL && *ld_bind_now != '\0',
605 &obj_rtld, SYMLOOK_EARLY, NULL) == -1)
608 dbg("doing copy relocations");
609 if (do_copy_relocations(obj_main) == -1)
612 if (getenv(LD_ "DUMP_REL_POST") != NULL) {
613 dump_relocations(obj_main);
618 * Setup TLS for main thread. This must be done after the
619 * relocations are processed, since tls initialization section
620 * might be the subject for relocations.
622 dbg("initializing initial thread local storage");
623 allocate_initial_tls(obj_list);
625 dbg("initializing key program variables");
626 set_program_var("__progname", argv[0] != NULL ? basename(argv[0]) : "");
627 set_program_var("environ", env);
628 set_program_var("__elf_aux_vector", aux);
630 /* Make a list of init functions to call. */
631 objlist_init(&initlist);
632 initlist_add_objects(obj_list, preload_tail, &initlist);
634 r_debug_state(NULL, &obj_main->linkmap); /* say hello to gdb! */
636 map_stacks_exec(NULL);
638 dbg("resolving ifuncs");
639 if (resolve_objects_ifunc(obj_main,
640 ld_bind_now != NULL && *ld_bind_now != '\0', SYMLOOK_EARLY,
644 if (!obj_main->crt_no_init) {
646 * Make sure we don't call the main program's init and fini
647 * functions for binaries linked with old crt1 which calls
650 obj_main->init = obj_main->fini = (Elf_Addr)NULL;
651 obj_main->preinit_array = obj_main->init_array =
652 obj_main->fini_array = (Elf_Addr)NULL;
655 wlock_acquire(rtld_bind_lock, &lockstate);
656 if (obj_main->crt_no_init)
658 objlist_call_init(&initlist, &lockstate);
659 _r_debug_postinit(&obj_main->linkmap);
660 objlist_clear(&initlist);
661 dbg("loading filtees");
662 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
663 if (ld_loadfltr || obj->z_loadfltr)
664 load_filtees(obj, 0, &lockstate);
666 lock_release(rtld_bind_lock, &lockstate);
668 dbg("transferring control to program entry point = %p", obj_main->entry);
670 /* Return the exit procedure and the program entry point. */
671 *exit_proc = rtld_exit;
673 return (func_ptr_type) obj_main->entry;
677 rtld_resolve_ifunc(const Obj_Entry *obj, const Elf_Sym *def)
682 ptr = (void *)make_function_pointer(def, obj);
683 target = ((Elf_Addr (*)(void))ptr)();
684 return ((void *)target);
688 _rtld_bind(Obj_Entry *obj, Elf_Size reloff)
692 const Obj_Entry *defobj;
695 RtldLockState lockstate;
697 rlock_acquire(rtld_bind_lock, &lockstate);
698 if (sigsetjmp(lockstate.env, 0) != 0)
699 lock_upgrade(rtld_bind_lock, &lockstate);
701 rel = (const Elf_Rel *) ((caddr_t) obj->pltrel + reloff);
703 rel = (const Elf_Rel *) ((caddr_t) obj->pltrela + reloff);
705 where = (Elf_Addr *) (obj->relocbase + rel->r_offset);
706 def = find_symdef(ELF_R_SYM(rel->r_info), obj, &defobj, true, NULL,
710 if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
711 target = (Elf_Addr)rtld_resolve_ifunc(defobj, def);
713 target = (Elf_Addr)(defobj->relocbase + def->st_value);
715 dbg("\"%s\" in \"%s\" ==> %p in \"%s\"",
716 defobj->strtab + def->st_name, basename(obj->path),
717 (void *)target, basename(defobj->path));
720 * Write the new contents for the jmpslot. Note that depending on
721 * architecture, the value which we need to return back to the
722 * lazy binding trampoline may or may not be the target
723 * address. The value returned from reloc_jmpslot() is the value
724 * that the trampoline needs.
726 target = reloc_jmpslot(where, target, defobj, obj, rel);
727 lock_release(rtld_bind_lock, &lockstate);
732 * Error reporting function. Use it like printf. If formats the message
733 * into a buffer, and sets things up so that the next call to dlerror()
734 * will return the message.
737 _rtld_error(const char *fmt, ...)
739 static char buf[512];
743 rtld_vsnprintf(buf, sizeof buf, fmt, ap);
749 * Return a dynamically-allocated copy of the current error message, if any.
754 return error_message == NULL ? NULL : xstrdup(error_message);
758 * Restore the current error message from a copy which was previously saved
759 * by errmsg_save(). The copy is freed.
762 errmsg_restore(char *saved_msg)
764 if (saved_msg == NULL)
765 error_message = NULL;
767 _rtld_error("%s", saved_msg);
773 basename(const char *name)
775 const char *p = strrchr(name, '/');
776 return p != NULL ? p + 1 : name;
779 static struct utsname uts;
782 origin_subst_one(char *real, const char *kw, const char *subst,
785 char *p, *p1, *res, *resp;
786 int subst_len, kw_len, subst_count, old_len, new_len;
791 * First, count the number of the keyword occurences, to
792 * preallocate the final string.
794 for (p = real, subst_count = 0;; p = p1 + kw_len, subst_count++) {
801 * If the keyword is not found, just return.
803 if (subst_count == 0)
804 return (may_free ? real : xstrdup(real));
807 * There is indeed something to substitute. Calculate the
808 * length of the resulting string, and allocate it.
810 subst_len = strlen(subst);
811 old_len = strlen(real);
812 new_len = old_len + (subst_len - kw_len) * subst_count;
813 res = xmalloc(new_len + 1);
816 * Now, execute the substitution loop.
818 for (p = real, resp = res, *resp = '\0';;) {
821 /* Copy the prefix before keyword. */
822 memcpy(resp, p, p1 - p);
824 /* Keyword replacement. */
825 memcpy(resp, subst, subst_len);
833 /* Copy to the end of string and finish. */
841 origin_subst(char *real, const char *origin_path)
843 char *res1, *res2, *res3, *res4;
845 if (uts.sysname[0] == '\0') {
846 if (uname(&uts) != 0) {
847 _rtld_error("utsname failed: %d", errno);
851 res1 = origin_subst_one(real, "$ORIGIN", origin_path, false);
852 res2 = origin_subst_one(res1, "$OSNAME", uts.sysname, true);
853 res3 = origin_subst_one(res2, "$OSREL", uts.release, true);
854 res4 = origin_subst_one(res3, "$PLATFORM", uts.machine, true);
861 const char *msg = dlerror();
865 rtld_fdputstr(STDERR_FILENO, msg);
866 rtld_fdputchar(STDERR_FILENO, '\n');
871 * Process a shared object's DYNAMIC section, and save the important
872 * information in its Obj_Entry structure.
875 digest_dynamic1(Obj_Entry *obj, int early, const Elf_Dyn **dyn_rpath,
876 const Elf_Dyn **dyn_soname, const Elf_Dyn **dyn_runpath)
879 Needed_Entry **needed_tail = &obj->needed;
880 Needed_Entry **needed_filtees_tail = &obj->needed_filtees;
881 Needed_Entry **needed_aux_filtees_tail = &obj->needed_aux_filtees;
882 const Elf_Hashelt *hashtab;
883 const Elf32_Word *hashval;
884 Elf32_Word bkt, nmaskwords;
886 int plttype = DT_REL;
892 obj->bind_now = false;
893 for (dynp = obj->dynamic; dynp->d_tag != DT_NULL; dynp++) {
894 switch (dynp->d_tag) {
897 obj->rel = (const Elf_Rel *) (obj->relocbase + dynp->d_un.d_ptr);
901 obj->relsize = dynp->d_un.d_val;
905 assert(dynp->d_un.d_val == sizeof(Elf_Rel));
909 obj->pltrel = (const Elf_Rel *)
910 (obj->relocbase + dynp->d_un.d_ptr);
914 obj->pltrelsize = dynp->d_un.d_val;
918 obj->rela = (const Elf_Rela *) (obj->relocbase + dynp->d_un.d_ptr);
922 obj->relasize = dynp->d_un.d_val;
926 assert(dynp->d_un.d_val == sizeof(Elf_Rela));
930 plttype = dynp->d_un.d_val;
931 assert(dynp->d_un.d_val == DT_REL || plttype == DT_RELA);
935 obj->symtab = (const Elf_Sym *)
936 (obj->relocbase + dynp->d_un.d_ptr);
940 assert(dynp->d_un.d_val == sizeof(Elf_Sym));
944 obj->strtab = (const char *) (obj->relocbase + dynp->d_un.d_ptr);
948 obj->strsize = dynp->d_un.d_val;
952 obj->verneed = (const Elf_Verneed *) (obj->relocbase +
957 obj->verneednum = dynp->d_un.d_val;
961 obj->verdef = (const Elf_Verdef *) (obj->relocbase +
966 obj->verdefnum = dynp->d_un.d_val;
970 obj->versyms = (const Elf_Versym *)(obj->relocbase +
976 hashtab = (const Elf_Hashelt *)(obj->relocbase +
978 obj->nbuckets = hashtab[0];
979 obj->nchains = hashtab[1];
980 obj->buckets = hashtab + 2;
981 obj->chains = obj->buckets + obj->nbuckets;
982 obj->valid_hash_sysv = obj->nbuckets > 0 && obj->nchains > 0 &&
983 obj->buckets != NULL;
989 hashtab = (const Elf_Hashelt *)(obj->relocbase +
991 obj->nbuckets_gnu = hashtab[0];
992 obj->symndx_gnu = hashtab[1];
993 nmaskwords = hashtab[2];
994 bloom_size32 = (__ELF_WORD_SIZE / 32) * nmaskwords;
995 obj->maskwords_bm_gnu = nmaskwords - 1;
996 obj->shift2_gnu = hashtab[3];
997 obj->bloom_gnu = (Elf_Addr *) (hashtab + 4);
998 obj->buckets_gnu = hashtab + 4 + bloom_size32;
999 obj->chain_zero_gnu = obj->buckets_gnu + obj->nbuckets_gnu -
1001 /* Number of bitmask words is required to be power of 2 */
1002 obj->valid_hash_gnu = powerof2(nmaskwords) &&
1003 obj->nbuckets_gnu > 0 && obj->buckets_gnu != NULL;
1009 Needed_Entry *nep = NEW(Needed_Entry);
1010 nep->name = dynp->d_un.d_val;
1015 needed_tail = &nep->next;
1021 Needed_Entry *nep = NEW(Needed_Entry);
1022 nep->name = dynp->d_un.d_val;
1026 *needed_filtees_tail = nep;
1027 needed_filtees_tail = &nep->next;
1033 Needed_Entry *nep = NEW(Needed_Entry);
1034 nep->name = dynp->d_un.d_val;
1038 *needed_aux_filtees_tail = nep;
1039 needed_aux_filtees_tail = &nep->next;
1044 obj->pltgot = (Elf_Addr *) (obj->relocbase + dynp->d_un.d_ptr);
1048 obj->textrel = true;
1052 obj->symbolic = true;
1057 * We have to wait until later to process this, because we
1058 * might not have gotten the address of the string table yet.
1068 *dyn_runpath = dynp;
1072 obj->init = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1075 case DT_PREINIT_ARRAY:
1076 obj->preinit_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1079 case DT_PREINIT_ARRAYSZ:
1080 obj->preinit_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1084 obj->init_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1087 case DT_INIT_ARRAYSZ:
1088 obj->init_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1092 obj->fini = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1096 obj->fini_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1099 case DT_FINI_ARRAYSZ:
1100 obj->fini_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1104 * Don't process DT_DEBUG on MIPS as the dynamic section
1105 * is mapped read-only. DT_MIPS_RLD_MAP is used instead.
1110 /* XXX - not implemented yet */
1112 dbg("Filling in DT_DEBUG entry");
1113 ((Elf_Dyn*)dynp)->d_un.d_ptr = (Elf_Addr) &r_debug;
1118 if ((dynp->d_un.d_val & DF_ORIGIN) && trust)
1119 obj->z_origin = true;
1120 if (dynp->d_un.d_val & DF_SYMBOLIC)
1121 obj->symbolic = true;
1122 if (dynp->d_un.d_val & DF_TEXTREL)
1123 obj->textrel = true;
1124 if (dynp->d_un.d_val & DF_BIND_NOW)
1125 obj->bind_now = true;
1126 /*if (dynp->d_un.d_val & DF_STATIC_TLS)
1130 case DT_MIPS_LOCAL_GOTNO:
1131 obj->local_gotno = dynp->d_un.d_val;
1134 case DT_MIPS_SYMTABNO:
1135 obj->symtabno = dynp->d_un.d_val;
1138 case DT_MIPS_GOTSYM:
1139 obj->gotsym = dynp->d_un.d_val;
1142 case DT_MIPS_RLD_MAP:
1143 *((Elf_Addr *)(dynp->d_un.d_ptr)) = (Elf_Addr) &r_debug;
1148 if (dynp->d_un.d_val & DF_1_NOOPEN)
1149 obj->z_noopen = true;
1150 if ((dynp->d_un.d_val & DF_1_ORIGIN) && trust)
1151 obj->z_origin = true;
1152 if (dynp->d_un.d_val & DF_1_GLOBAL)
1153 obj->z_global = true;
1154 if (dynp->d_un.d_val & DF_1_BIND_NOW)
1155 obj->bind_now = true;
1156 if (dynp->d_un.d_val & DF_1_NODELETE)
1157 obj->z_nodelete = true;
1158 if (dynp->d_un.d_val & DF_1_LOADFLTR)
1159 obj->z_loadfltr = true;
1160 if (dynp->d_un.d_val & DF_1_INTERPOSE)
1161 obj->z_interpose = true;
1162 if (dynp->d_un.d_val & DF_1_NODEFLIB)
1163 obj->z_nodeflib = true;
1168 dbg("Ignoring d_tag %ld = %#lx", (long)dynp->d_tag,
1175 obj->traced = false;
1177 if (plttype == DT_RELA) {
1178 obj->pltrela = (const Elf_Rela *) obj->pltrel;
1180 obj->pltrelasize = obj->pltrelsize;
1181 obj->pltrelsize = 0;
1184 /* Determine size of dynsym table (equal to nchains of sysv hash) */
1185 if (obj->valid_hash_sysv)
1186 obj->dynsymcount = obj->nchains;
1187 else if (obj->valid_hash_gnu) {
1188 obj->dynsymcount = 0;
1189 for (bkt = 0; bkt < obj->nbuckets_gnu; bkt++) {
1190 if (obj->buckets_gnu[bkt] == 0)
1192 hashval = &obj->chain_zero_gnu[obj->buckets_gnu[bkt]];
1195 while ((*hashval++ & 1u) == 0);
1197 obj->dynsymcount += obj->symndx_gnu;
1202 digest_dynamic2(Obj_Entry *obj, const Elf_Dyn *dyn_rpath,
1203 const Elf_Dyn *dyn_soname, const Elf_Dyn *dyn_runpath)
1206 if (obj->z_origin && obj->origin_path == NULL) {
1207 obj->origin_path = xmalloc(PATH_MAX);
1208 if (rtld_dirname_abs(obj->path, obj->origin_path) == -1)
1212 if (dyn_runpath != NULL) {
1213 obj->runpath = (char *)obj->strtab + dyn_runpath->d_un.d_val;
1215 obj->runpath = origin_subst(obj->runpath, obj->origin_path);
1217 else if (dyn_rpath != NULL) {
1218 obj->rpath = (char *)obj->strtab + dyn_rpath->d_un.d_val;
1220 obj->rpath = origin_subst(obj->rpath, obj->origin_path);
1223 if (dyn_soname != NULL)
1224 object_add_name(obj, obj->strtab + dyn_soname->d_un.d_val);
1228 digest_dynamic(Obj_Entry *obj, int early)
1230 const Elf_Dyn *dyn_rpath;
1231 const Elf_Dyn *dyn_soname;
1232 const Elf_Dyn *dyn_runpath;
1234 digest_dynamic1(obj, early, &dyn_rpath, &dyn_soname, &dyn_runpath);
1235 digest_dynamic2(obj, dyn_rpath, dyn_soname, dyn_runpath);
1239 * Process a shared object's program header. This is used only for the
1240 * main program, when the kernel has already loaded the main program
1241 * into memory before calling the dynamic linker. It creates and
1242 * returns an Obj_Entry structure.
1245 digest_phdr(const Elf_Phdr *phdr, int phnum, caddr_t entry, const char *path)
1248 const Elf_Phdr *phlimit = phdr + phnum;
1250 Elf_Addr note_start, note_end;
1254 for (ph = phdr; ph < phlimit; ph++) {
1255 if (ph->p_type != PT_PHDR)
1259 obj->phsize = ph->p_memsz;
1260 obj->relocbase = (caddr_t)phdr - ph->p_vaddr;
1264 obj->stack_flags = PF_X | PF_R | PF_W;
1266 for (ph = phdr; ph < phlimit; ph++) {
1267 switch (ph->p_type) {
1270 obj->interp = (const char *)(ph->p_vaddr + obj->relocbase);
1274 if (nsegs == 0) { /* First load segment */
1275 obj->vaddrbase = trunc_page(ph->p_vaddr);
1276 obj->mapbase = obj->vaddrbase + obj->relocbase;
1277 obj->textsize = round_page(ph->p_vaddr + ph->p_memsz) -
1279 } else { /* Last load segment */
1280 obj->mapsize = round_page(ph->p_vaddr + ph->p_memsz) -
1287 obj->dynamic = (const Elf_Dyn *)(ph->p_vaddr + obj->relocbase);
1292 obj->tlssize = ph->p_memsz;
1293 obj->tlsalign = ph->p_align;
1294 obj->tlsinitsize = ph->p_filesz;
1295 obj->tlsinit = (void*)(ph->p_vaddr + obj->relocbase);
1299 obj->stack_flags = ph->p_flags;
1303 obj->relro_page = obj->relocbase + trunc_page(ph->p_vaddr);
1304 obj->relro_size = round_page(ph->p_memsz);
1308 note_start = (Elf_Addr)obj->relocbase + ph->p_vaddr;
1309 note_end = note_start + ph->p_filesz;
1310 digest_notes(obj, note_start, note_end);
1315 _rtld_error("%s: too few PT_LOAD segments", path);
1324 digest_notes(Obj_Entry *obj, Elf_Addr note_start, Elf_Addr note_end)
1326 const Elf_Note *note;
1327 const char *note_name;
1330 for (note = (const Elf_Note *)note_start; (Elf_Addr)note < note_end;
1331 note = (const Elf_Note *)((const char *)(note + 1) +
1332 roundup2(note->n_namesz, sizeof(Elf32_Addr)) +
1333 roundup2(note->n_descsz, sizeof(Elf32_Addr)))) {
1334 if (note->n_namesz != sizeof(NOTE_FREEBSD_VENDOR) ||
1335 note->n_descsz != sizeof(int32_t))
1337 if (note->n_type != ABI_NOTETYPE &&
1338 note->n_type != CRT_NOINIT_NOTETYPE)
1340 note_name = (const char *)(note + 1);
1341 if (strncmp(NOTE_FREEBSD_VENDOR, note_name,
1342 sizeof(NOTE_FREEBSD_VENDOR)) != 0)
1344 switch (note->n_type) {
1346 /* FreeBSD osrel note */
1347 p = (uintptr_t)(note + 1);
1348 p += roundup2(note->n_namesz, sizeof(Elf32_Addr));
1349 obj->osrel = *(const int32_t *)(p);
1350 dbg("note osrel %d", obj->osrel);
1352 case CRT_NOINIT_NOTETYPE:
1353 /* FreeBSD 'crt does not call init' note */
1354 obj->crt_no_init = true;
1355 dbg("note crt_no_init");
1362 dlcheck(void *handle)
1366 for (obj = obj_list; obj != NULL; obj = obj->next)
1367 if (obj == (Obj_Entry *) handle)
1370 if (obj == NULL || obj->refcount == 0 || obj->dl_refcount == 0) {
1371 _rtld_error("Invalid shared object handle %p", handle);
1378 * If the given object is already in the donelist, return true. Otherwise
1379 * add the object to the list and return false.
1382 donelist_check(DoneList *dlp, const Obj_Entry *obj)
1386 for (i = 0; i < dlp->num_used; i++)
1387 if (dlp->objs[i] == obj)
1390 * Our donelist allocation should always be sufficient. But if
1391 * our threads locking isn't working properly, more shared objects
1392 * could have been loaded since we allocated the list. That should
1393 * never happen, but we'll handle it properly just in case it does.
1395 if (dlp->num_used < dlp->num_alloc)
1396 dlp->objs[dlp->num_used++] = obj;
1401 * Hash function for symbol table lookup. Don't even think about changing
1402 * this. It is specified by the System V ABI.
1405 elf_hash(const char *name)
1407 const unsigned char *p = (const unsigned char *) name;
1408 unsigned long h = 0;
1411 while (*p != '\0') {
1412 h = (h << 4) + *p++;
1413 if ((g = h & 0xf0000000) != 0)
1421 * The GNU hash function is the Daniel J. Bernstein hash clipped to 32 bits
1422 * unsigned in case it's implemented with a wider type.
1425 gnu_hash(const char *s)
1431 for (c = *s; c != '\0'; c = *++s)
1433 return (h & 0xffffffff);
1437 * Find the library with the given name, and return its full pathname.
1438 * The returned string is dynamically allocated. Generates an error
1439 * message and returns NULL if the library cannot be found.
1441 * If the second argument is non-NULL, then it refers to an already-
1442 * loaded shared object, whose library search path will be searched.
1444 * The search order is:
1445 * DT_RPATH in the referencing file _unless_ DT_RUNPATH is present (1)
1446 * DT_RPATH of the main object if DSO without defined DT_RUNPATH (1)
1448 * DT_RUNPATH in the referencing file
1449 * ldconfig hints (if -z nodefaultlib, filter out default library directories
1451 * /lib:/usr/lib _unless_ the referencing file is linked with -z nodefaultlib
1453 * (1) Handled in digest_dynamic2 - rpath left NULL if runpath defined.
1456 find_library(const char *xname, const Obj_Entry *refobj)
1460 bool nodeflib, objgiven;
1462 objgiven = refobj != NULL;
1463 if (strchr(xname, '/') != NULL) { /* Hard coded pathname */
1464 if (xname[0] != '/' && !trust) {
1465 _rtld_error("Absolute pathname required for shared object \"%s\"",
1469 if (objgiven && refobj->z_origin) {
1470 return (origin_subst(__DECONST(char *, xname),
1471 refobj->origin_path));
1473 return (xstrdup(xname));
1477 if (libmap_disable || !objgiven ||
1478 (name = lm_find(refobj->path, xname)) == NULL)
1479 name = (char *)xname;
1481 dbg(" Searching for \"%s\"", name);
1484 * If refobj->rpath != NULL, then refobj->runpath is NULL. Fall
1485 * back to pre-conforming behaviour if user requested so with
1486 * LD_LIBRARY_PATH_RPATH environment variable and ignore -z
1489 if (objgiven && refobj->rpath != NULL && ld_library_path_rpath) {
1490 if ((pathname = search_library_path(name, ld_library_path)) != NULL ||
1492 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1493 (pathname = search_library_path(name, gethints(false))) != NULL ||
1494 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL)
1497 nodeflib = objgiven ? refobj->z_nodeflib : false;
1499 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1500 (objgiven && refobj->runpath == NULL && refobj != obj_main &&
1501 (pathname = search_library_path(name, obj_main->rpath)) != NULL) ||
1502 (pathname = search_library_path(name, ld_library_path)) != NULL ||
1504 (pathname = search_library_path(name, refobj->runpath)) != NULL) ||
1505 (pathname = search_library_path(name, gethints(nodeflib))) != NULL ||
1506 (objgiven && !nodeflib &&
1507 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL))
1511 if (objgiven && refobj->path != NULL) {
1512 _rtld_error("Shared object \"%s\" not found, required by \"%s\"",
1513 name, basename(refobj->path));
1515 _rtld_error("Shared object \"%s\" not found", name);
1521 * Given a symbol number in a referencing object, find the corresponding
1522 * definition of the symbol. Returns a pointer to the symbol, or NULL if
1523 * no definition was found. Returns a pointer to the Obj_Entry of the
1524 * defining object via the reference parameter DEFOBJ_OUT.
1527 find_symdef(unsigned long symnum, const Obj_Entry *refobj,
1528 const Obj_Entry **defobj_out, int flags, SymCache *cache,
1529 RtldLockState *lockstate)
1533 const Obj_Entry *defobj;
1539 * If we have already found this symbol, get the information from
1542 if (symnum >= refobj->dynsymcount)
1543 return NULL; /* Bad object */
1544 if (cache != NULL && cache[symnum].sym != NULL) {
1545 *defobj_out = cache[symnum].obj;
1546 return cache[symnum].sym;
1549 ref = refobj->symtab + symnum;
1550 name = refobj->strtab + ref->st_name;
1555 * We don't have to do a full scale lookup if the symbol is local.
1556 * We know it will bind to the instance in this load module; to
1557 * which we already have a pointer (ie ref). By not doing a lookup,
1558 * we not only improve performance, but it also avoids unresolvable
1559 * symbols when local symbols are not in the hash table. This has
1560 * been seen with the ia64 toolchain.
1562 if (ELF_ST_BIND(ref->st_info) != STB_LOCAL) {
1563 if (ELF_ST_TYPE(ref->st_info) == STT_SECTION) {
1564 _rtld_error("%s: Bogus symbol table entry %lu", refobj->path,
1567 symlook_init(&req, name);
1569 req.ventry = fetch_ventry(refobj, symnum);
1570 req.lockstate = lockstate;
1571 res = symlook_default(&req, refobj);
1574 defobj = req.defobj_out;
1582 * If we found no definition and the reference is weak, treat the
1583 * symbol as having the value zero.
1585 if (def == NULL && ELF_ST_BIND(ref->st_info) == STB_WEAK) {
1591 *defobj_out = defobj;
1592 /* Record the information in the cache to avoid subsequent lookups. */
1593 if (cache != NULL) {
1594 cache[symnum].sym = def;
1595 cache[symnum].obj = defobj;
1598 if (refobj != &obj_rtld)
1599 _rtld_error("%s: Undefined symbol \"%s\"", refobj->path, name);
1605 * Return the search path from the ldconfig hints file, reading it if
1606 * necessary. If nostdlib is true, then the default search paths are
1607 * not added to result.
1609 * Returns NULL if there are problems with the hints file,
1610 * or if the search path there is empty.
1613 gethints(bool nostdlib)
1615 static char *hints, *filtered_path;
1616 struct elfhints_hdr hdr;
1617 struct fill_search_info_args sargs, hargs;
1618 struct dl_serinfo smeta, hmeta, *SLPinfo, *hintinfo;
1619 struct dl_serpath *SLPpath, *hintpath;
1621 unsigned int SLPndx, hintndx, fndx, fcount;
1626 /* First call, read the hints file */
1627 if (hints == NULL) {
1628 /* Keep from trying again in case the hints file is bad. */
1631 if ((fd = open(ld_elf_hints_path, O_RDONLY | O_CLOEXEC)) == -1)
1633 if (read(fd, &hdr, sizeof hdr) != sizeof hdr ||
1634 hdr.magic != ELFHINTS_MAGIC ||
1639 p = xmalloc(hdr.dirlistlen + 1);
1640 if (lseek(fd, hdr.strtab + hdr.dirlist, SEEK_SET) == -1 ||
1641 read(fd, p, hdr.dirlistlen + 1) !=
1642 (ssize_t)hdr.dirlistlen + 1) {
1652 * If caller agreed to receive list which includes the default
1653 * paths, we are done. Otherwise, if we still did not
1654 * calculated filtered result, do it now.
1657 return (hints[0] != '\0' ? hints : NULL);
1658 if (filtered_path != NULL)
1662 * Obtain the list of all configured search paths, and the
1663 * list of the default paths.
1665 * First estimate the size of the results.
1667 smeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1669 hmeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1672 sargs.request = RTLD_DI_SERINFOSIZE;
1673 sargs.serinfo = &smeta;
1674 hargs.request = RTLD_DI_SERINFOSIZE;
1675 hargs.serinfo = &hmeta;
1677 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1678 path_enumerate(p, fill_search_info, &hargs);
1680 SLPinfo = xmalloc(smeta.dls_size);
1681 hintinfo = xmalloc(hmeta.dls_size);
1684 * Next fetch both sets of paths.
1686 sargs.request = RTLD_DI_SERINFO;
1687 sargs.serinfo = SLPinfo;
1688 sargs.serpath = &SLPinfo->dls_serpath[0];
1689 sargs.strspace = (char *)&SLPinfo->dls_serpath[smeta.dls_cnt];
1691 hargs.request = RTLD_DI_SERINFO;
1692 hargs.serinfo = hintinfo;
1693 hargs.serpath = &hintinfo->dls_serpath[0];
1694 hargs.strspace = (char *)&hintinfo->dls_serpath[hmeta.dls_cnt];
1696 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1697 path_enumerate(p, fill_search_info, &hargs);
1700 * Now calculate the difference between two sets, by excluding
1701 * standard paths from the full set.
1705 filtered_path = xmalloc(hdr.dirlistlen + 1);
1706 hintpath = &hintinfo->dls_serpath[0];
1707 for (hintndx = 0; hintndx < hmeta.dls_cnt; hintndx++, hintpath++) {
1709 SLPpath = &SLPinfo->dls_serpath[0];
1711 * Check each standard path against current.
1713 for (SLPndx = 0; SLPndx < smeta.dls_cnt; SLPndx++, SLPpath++) {
1714 /* matched, skip the path */
1715 if (!strcmp(hintpath->dls_name, SLPpath->dls_name)) {
1723 * Not matched against any standard path, add the path
1724 * to result. Separate consequtive paths with ':'.
1727 filtered_path[fndx] = ':';
1731 flen = strlen(hintpath->dls_name);
1732 strncpy((filtered_path + fndx), hintpath->dls_name, flen);
1735 filtered_path[fndx] = '\0';
1741 return (filtered_path[0] != '\0' ? filtered_path : NULL);
1745 init_dag(Obj_Entry *root)
1747 const Needed_Entry *needed;
1748 const Objlist_Entry *elm;
1751 if (root->dag_inited)
1753 donelist_init(&donelist);
1755 /* Root object belongs to own DAG. */
1756 objlist_push_tail(&root->dldags, root);
1757 objlist_push_tail(&root->dagmembers, root);
1758 donelist_check(&donelist, root);
1761 * Add dependencies of root object to DAG in breadth order
1762 * by exploiting the fact that each new object get added
1763 * to the tail of the dagmembers list.
1765 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1766 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {
1767 if (needed->obj == NULL || donelist_check(&donelist, needed->obj))
1769 objlist_push_tail(&needed->obj->dldags, root);
1770 objlist_push_tail(&root->dagmembers, needed->obj);
1773 root->dag_inited = true;
1777 process_z(Obj_Entry *root)
1779 const Objlist_Entry *elm;
1783 * Walk over object DAG and process every dependent object
1784 * that is marked as DF_1_NODELETE or DF_1_GLOBAL. They need
1785 * to grow their own DAG.
1787 * For DF_1_GLOBAL, DAG is required for symbol lookups in
1788 * symlook_global() to work.
1790 * For DF_1_NODELETE, the DAG should have its reference upped.
1792 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1796 if (obj->z_nodelete && !obj->ref_nodel) {
1797 dbg("obj %s -z nodelete", obj->path);
1800 obj->ref_nodel = true;
1802 if (obj->z_global && objlist_find(&list_global, obj) == NULL) {
1803 dbg("obj %s -z global", obj->path);
1804 objlist_push_tail(&list_global, obj);
1810 * Initialize the dynamic linker. The argument is the address at which
1811 * the dynamic linker has been mapped into memory. The primary task of
1812 * this function is to relocate the dynamic linker.
1815 init_rtld(caddr_t mapbase, Elf_Auxinfo **aux_info)
1817 Obj_Entry objtmp; /* Temporary rtld object */
1818 const Elf_Dyn *dyn_rpath;
1819 const Elf_Dyn *dyn_soname;
1820 const Elf_Dyn *dyn_runpath;
1822 #ifdef RTLD_INIT_PAGESIZES_EARLY
1823 /* The page size is required by the dynamic memory allocator. */
1824 init_pagesizes(aux_info);
1828 * Conjure up an Obj_Entry structure for the dynamic linker.
1830 * The "path" member can't be initialized yet because string constants
1831 * cannot yet be accessed. Below we will set it correctly.
1833 memset(&objtmp, 0, sizeof(objtmp));
1836 objtmp.mapbase = mapbase;
1838 objtmp.relocbase = mapbase;
1840 if (RTLD_IS_DYNAMIC()) {
1841 objtmp.dynamic = rtld_dynamic(&objtmp);
1842 digest_dynamic1(&objtmp, 1, &dyn_rpath, &dyn_soname, &dyn_runpath);
1843 assert(objtmp.needed == NULL);
1844 #if !defined(__mips__)
1845 /* MIPS has a bogus DT_TEXTREL. */
1846 assert(!objtmp.textrel);
1850 * Temporarily put the dynamic linker entry into the object list, so
1851 * that symbols can be found.
1854 relocate_objects(&objtmp, true, &objtmp, 0, NULL);
1857 /* Initialize the object list. */
1858 obj_tail = &obj_list;
1860 /* Now that non-local variables can be accesses, copy out obj_rtld. */
1861 memcpy(&obj_rtld, &objtmp, sizeof(obj_rtld));
1863 #ifndef RTLD_INIT_PAGESIZES_EARLY
1864 /* The page size is required by the dynamic memory allocator. */
1865 init_pagesizes(aux_info);
1868 if (aux_info[AT_OSRELDATE] != NULL)
1869 osreldate = aux_info[AT_OSRELDATE]->a_un.a_val;
1871 digest_dynamic2(&obj_rtld, dyn_rpath, dyn_soname, dyn_runpath);
1873 /* Replace the path with a dynamically allocated copy. */
1874 obj_rtld.path = xstrdup(PATH_RTLD);
1876 r_debug.r_brk = r_debug_state;
1877 r_debug.r_state = RT_CONSISTENT;
1881 * Retrieve the array of supported page sizes. The kernel provides the page
1882 * sizes in increasing order.
1885 init_pagesizes(Elf_Auxinfo **aux_info)
1887 static size_t psa[MAXPAGESIZES];
1891 if (aux_info[AT_PAGESIZES] != NULL && aux_info[AT_PAGESIZESLEN] !=
1893 size = aux_info[AT_PAGESIZESLEN]->a_un.a_val;
1894 pagesizes = aux_info[AT_PAGESIZES]->a_un.a_ptr;
1897 if (sysctlnametomib("hw.pagesizes", mib, &len) == 0)
1900 /* As a fallback, retrieve the base page size. */
1901 size = sizeof(psa[0]);
1902 if (aux_info[AT_PAGESZ] != NULL) {
1903 psa[0] = aux_info[AT_PAGESZ]->a_un.a_val;
1907 mib[1] = HW_PAGESIZE;
1911 if (sysctl(mib, len, psa, &size, NULL, 0) == -1) {
1912 _rtld_error("sysctl for hw.pagesize(s) failed");
1918 npagesizes = size / sizeof(pagesizes[0]);
1919 /* Discard any invalid entries at the end of the array. */
1920 while (npagesizes > 0 && pagesizes[npagesizes - 1] == 0)
1925 * Add the init functions from a needed object list (and its recursive
1926 * needed objects) to "list". This is not used directly; it is a helper
1927 * function for initlist_add_objects(). The write lock must be held
1928 * when this function is called.
1931 initlist_add_neededs(Needed_Entry *needed, Objlist *list)
1933 /* Recursively process the successor needed objects. */
1934 if (needed->next != NULL)
1935 initlist_add_neededs(needed->next, list);
1937 /* Process the current needed object. */
1938 if (needed->obj != NULL)
1939 initlist_add_objects(needed->obj, &needed->obj->next, list);
1943 * Scan all of the DAGs rooted in the range of objects from "obj" to
1944 * "tail" and add their init functions to "list". This recurses over
1945 * the DAGs and ensure the proper init ordering such that each object's
1946 * needed libraries are initialized before the object itself. At the
1947 * same time, this function adds the objects to the global finalization
1948 * list "list_fini" in the opposite order. The write lock must be
1949 * held when this function is called.
1952 initlist_add_objects(Obj_Entry *obj, Obj_Entry **tail, Objlist *list)
1955 if (obj->init_scanned || obj->init_done)
1957 obj->init_scanned = true;
1959 /* Recursively process the successor objects. */
1960 if (&obj->next != tail)
1961 initlist_add_objects(obj->next, tail, list);
1963 /* Recursively process the needed objects. */
1964 if (obj->needed != NULL)
1965 initlist_add_neededs(obj->needed, list);
1966 if (obj->needed_filtees != NULL)
1967 initlist_add_neededs(obj->needed_filtees, list);
1968 if (obj->needed_aux_filtees != NULL)
1969 initlist_add_neededs(obj->needed_aux_filtees, list);
1971 /* Add the object to the init list. */
1972 if (obj->preinit_array != (Elf_Addr)NULL || obj->init != (Elf_Addr)NULL ||
1973 obj->init_array != (Elf_Addr)NULL)
1974 objlist_push_tail(list, obj);
1976 /* Add the object to the global fini list in the reverse order. */
1977 if ((obj->fini != (Elf_Addr)NULL || obj->fini_array != (Elf_Addr)NULL)
1978 && !obj->on_fini_list) {
1979 objlist_push_head(&list_fini, obj);
1980 obj->on_fini_list = true;
1985 #define FPTR_TARGET(f) ((Elf_Addr) (f))
1989 free_needed_filtees(Needed_Entry *n)
1991 Needed_Entry *needed, *needed1;
1993 for (needed = n; needed != NULL; needed = needed->next) {
1994 if (needed->obj != NULL) {
1995 dlclose(needed->obj);
1999 for (needed = n; needed != NULL; needed = needed1) {
2000 needed1 = needed->next;
2006 unload_filtees(Obj_Entry *obj)
2009 free_needed_filtees(obj->needed_filtees);
2010 obj->needed_filtees = NULL;
2011 free_needed_filtees(obj->needed_aux_filtees);
2012 obj->needed_aux_filtees = NULL;
2013 obj->filtees_loaded = false;
2017 load_filtee1(Obj_Entry *obj, Needed_Entry *needed, int flags,
2018 RtldLockState *lockstate)
2021 for (; needed != NULL; needed = needed->next) {
2022 needed->obj = dlopen_object(obj->strtab + needed->name, -1, obj,
2023 flags, ((ld_loadfltr || obj->z_loadfltr) ? RTLD_NOW : RTLD_LAZY) |
2024 RTLD_LOCAL, lockstate);
2029 load_filtees(Obj_Entry *obj, int flags, RtldLockState *lockstate)
2032 lock_restart_for_upgrade(lockstate);
2033 if (!obj->filtees_loaded) {
2034 load_filtee1(obj, obj->needed_filtees, flags, lockstate);
2035 load_filtee1(obj, obj->needed_aux_filtees, flags, lockstate);
2036 obj->filtees_loaded = true;
2041 process_needed(Obj_Entry *obj, Needed_Entry *needed, int flags)
2045 for (; needed != NULL; needed = needed->next) {
2046 obj1 = needed->obj = load_object(obj->strtab + needed->name, -1, obj,
2047 flags & ~RTLD_LO_NOLOAD);
2048 if (obj1 == NULL && !ld_tracing && (flags & RTLD_LO_FILTEES) == 0)
2055 * Given a shared object, traverse its list of needed objects, and load
2056 * each of them. Returns 0 on success. Generates an error message and
2057 * returns -1 on failure.
2060 load_needed_objects(Obj_Entry *first, int flags)
2064 for (obj = first; obj != NULL; obj = obj->next) {
2065 if (process_needed(obj, obj->needed, flags) == -1)
2072 load_preload_objects(void)
2074 char *p = ld_preload;
2076 static const char delim[] = " \t:;";
2081 p += strspn(p, delim);
2082 while (*p != '\0') {
2083 size_t len = strcspn(p, delim);
2088 obj = load_object(p, -1, NULL, 0);
2090 return -1; /* XXX - cleanup */
2091 obj->z_interpose = true;
2094 p += strspn(p, delim);
2096 LD_UTRACE(UTRACE_PRELOAD_FINISHED, NULL, NULL, 0, 0, NULL);
2101 printable_path(const char *path)
2104 return (path == NULL ? "<unknown>" : path);
2108 * Load a shared object into memory, if it is not already loaded. The
2109 * object may be specified by name or by user-supplied file descriptor
2110 * fd_u. In the later case, the fd_u descriptor is not closed, but its
2113 * Returns a pointer to the Obj_Entry for the object. Returns NULL
2117 load_object(const char *name, int fd_u, const Obj_Entry *refobj, int flags)
2125 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
2126 if (object_match_name(obj, name))
2130 path = find_library(name, refobj);
2137 * If we didn't find a match by pathname, or the name is not
2138 * supplied, open the file and check again by device and inode.
2139 * This avoids false mismatches caused by multiple links or ".."
2142 * To avoid a race, we open the file and use fstat() rather than
2147 if ((fd = open(path, O_RDONLY | O_CLOEXEC)) == -1) {
2148 _rtld_error("Cannot open \"%s\"", path);
2153 fd = fcntl(fd_u, F_DUPFD_CLOEXEC, 0);
2155 _rtld_error("Cannot dup fd");
2160 if (fstat(fd, &sb) == -1) {
2161 _rtld_error("Cannot fstat \"%s\"", printable_path(path));
2166 for (obj = obj_list->next; obj != NULL; obj = obj->next)
2167 if (obj->ino == sb.st_ino && obj->dev == sb.st_dev)
2169 if (obj != NULL && name != NULL) {
2170 object_add_name(obj, name);
2175 if (flags & RTLD_LO_NOLOAD) {
2181 /* First use of this object, so we must map it in */
2182 obj = do_load_object(fd, name, path, &sb, flags);
2191 do_load_object(int fd, const char *name, char *path, struct stat *sbp,
2198 * but first, make sure that environment variables haven't been
2199 * used to circumvent the noexec flag on a filesystem.
2201 if (dangerous_ld_env) {
2202 if (fstatfs(fd, &fs) != 0) {
2203 _rtld_error("Cannot fstatfs \"%s\"", printable_path(path));
2206 if (fs.f_flags & MNT_NOEXEC) {
2207 _rtld_error("Cannot execute objects on %s\n", fs.f_mntonname);
2211 dbg("loading \"%s\"", printable_path(path));
2212 obj = map_object(fd, printable_path(path), sbp);
2217 * If DT_SONAME is present in the object, digest_dynamic2 already
2218 * added it to the object names.
2221 object_add_name(obj, name);
2223 digest_dynamic(obj, 0);
2224 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d", obj->path,
2225 obj->valid_hash_sysv, obj->valid_hash_gnu, obj->dynsymcount);
2226 if (obj->z_noopen && (flags & (RTLD_LO_DLOPEN | RTLD_LO_TRACE)) ==
2228 dbg("refusing to load non-loadable \"%s\"", obj->path);
2229 _rtld_error("Cannot dlopen non-loadable %s", obj->path);
2230 munmap(obj->mapbase, obj->mapsize);
2235 obj->dlopened = (flags & RTLD_LO_DLOPEN) != 0;
2237 obj_tail = &obj->next;
2240 linkmap_add(obj); /* for GDB & dlinfo() */
2241 max_stack_flags |= obj->stack_flags;
2243 dbg(" %p .. %p: %s", obj->mapbase,
2244 obj->mapbase + obj->mapsize - 1, obj->path);
2246 dbg(" WARNING: %s has impure text", obj->path);
2247 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
2254 obj_from_addr(const void *addr)
2258 for (obj = obj_list; obj != NULL; obj = obj->next) {
2259 if (addr < (void *) obj->mapbase)
2261 if (addr < (void *) (obj->mapbase + obj->mapsize))
2270 Elf_Addr *preinit_addr;
2273 preinit_addr = (Elf_Addr *)obj_main->preinit_array;
2274 if (preinit_addr == NULL)
2277 for (index = 0; index < obj_main->preinit_array_num; index++) {
2278 if (preinit_addr[index] != 0 && preinit_addr[index] != 1) {
2279 dbg("calling preinit function for %s at %p", obj_main->path,
2280 (void *)preinit_addr[index]);
2281 LD_UTRACE(UTRACE_INIT_CALL, obj_main, (void *)preinit_addr[index],
2282 0, 0, obj_main->path);
2283 call_init_pointer(obj_main, preinit_addr[index]);
2289 * Call the finalization functions for each of the objects in "list"
2290 * belonging to the DAG of "root" and referenced once. If NULL "root"
2291 * is specified, every finalization function will be called regardless
2292 * of the reference count and the list elements won't be freed. All of
2293 * the objects are expected to have non-NULL fini functions.
2296 objlist_call_fini(Objlist *list, Obj_Entry *root, RtldLockState *lockstate)
2300 Elf_Addr *fini_addr;
2303 assert(root == NULL || root->refcount == 1);
2306 * Preserve the current error message since a fini function might
2307 * call into the dynamic linker and overwrite it.
2309 saved_msg = errmsg_save();
2311 STAILQ_FOREACH(elm, list, link) {
2312 if (root != NULL && (elm->obj->refcount != 1 ||
2313 objlist_find(&root->dagmembers, elm->obj) == NULL))
2315 /* Remove object from fini list to prevent recursive invocation. */
2316 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2318 * XXX: If a dlopen() call references an object while the
2319 * fini function is in progress, we might end up trying to
2320 * unload the referenced object in dlclose() or the object
2321 * won't be unloaded although its fini function has been
2324 lock_release(rtld_bind_lock, lockstate);
2327 * It is legal to have both DT_FINI and DT_FINI_ARRAY defined.
2328 * When this happens, DT_FINI_ARRAY is processed first.
2330 fini_addr = (Elf_Addr *)elm->obj->fini_array;
2331 if (fini_addr != NULL && elm->obj->fini_array_num > 0) {
2332 for (index = elm->obj->fini_array_num - 1; index >= 0;
2334 if (fini_addr[index] != 0 && fini_addr[index] != 1) {
2335 dbg("calling fini function for %s at %p",
2336 elm->obj->path, (void *)fini_addr[index]);
2337 LD_UTRACE(UTRACE_FINI_CALL, elm->obj,
2338 (void *)fini_addr[index], 0, 0, elm->obj->path);
2339 call_initfini_pointer(elm->obj, fini_addr[index]);
2343 if (elm->obj->fini != (Elf_Addr)NULL) {
2344 dbg("calling fini function for %s at %p", elm->obj->path,
2345 (void *)elm->obj->fini);
2346 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini,
2347 0, 0, elm->obj->path);
2348 call_initfini_pointer(elm->obj, elm->obj->fini);
2350 wlock_acquire(rtld_bind_lock, lockstate);
2351 /* No need to free anything if process is going down. */
2355 * We must restart the list traversal after every fini call
2356 * because a dlclose() call from the fini function or from
2357 * another thread might have modified the reference counts.
2361 } while (elm != NULL);
2362 errmsg_restore(saved_msg);
2366 * Call the initialization functions for each of the objects in
2367 * "list". All of the objects are expected to have non-NULL init
2371 objlist_call_init(Objlist *list, RtldLockState *lockstate)
2376 Elf_Addr *init_addr;
2380 * Clean init_scanned flag so that objects can be rechecked and
2381 * possibly initialized earlier if any of vectors called below
2382 * cause the change by using dlopen.
2384 for (obj = obj_list; obj != NULL; obj = obj->next)
2385 obj->init_scanned = false;
2388 * Preserve the current error message since an init function might
2389 * call into the dynamic linker and overwrite it.
2391 saved_msg = errmsg_save();
2392 STAILQ_FOREACH(elm, list, link) {
2393 if (elm->obj->init_done) /* Initialized early. */
2396 * Race: other thread might try to use this object before current
2397 * one completes the initilization. Not much can be done here
2398 * without better locking.
2400 elm->obj->init_done = true;
2401 lock_release(rtld_bind_lock, lockstate);
2404 * It is legal to have both DT_INIT and DT_INIT_ARRAY defined.
2405 * When this happens, DT_INIT is processed first.
2407 if (elm->obj->init != (Elf_Addr)NULL) {
2408 dbg("calling init function for %s at %p", elm->obj->path,
2409 (void *)elm->obj->init);
2410 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init,
2411 0, 0, elm->obj->path);
2412 call_initfini_pointer(elm->obj, elm->obj->init);
2414 init_addr = (Elf_Addr *)elm->obj->init_array;
2415 if (init_addr != NULL) {
2416 for (index = 0; index < elm->obj->init_array_num; index++) {
2417 if (init_addr[index] != 0 && init_addr[index] != 1) {
2418 dbg("calling init function for %s at %p", elm->obj->path,
2419 (void *)init_addr[index]);
2420 LD_UTRACE(UTRACE_INIT_CALL, elm->obj,
2421 (void *)init_addr[index], 0, 0, elm->obj->path);
2422 call_init_pointer(elm->obj, init_addr[index]);
2426 wlock_acquire(rtld_bind_lock, lockstate);
2428 errmsg_restore(saved_msg);
2432 objlist_clear(Objlist *list)
2436 while (!STAILQ_EMPTY(list)) {
2437 elm = STAILQ_FIRST(list);
2438 STAILQ_REMOVE_HEAD(list, link);
2443 static Objlist_Entry *
2444 objlist_find(Objlist *list, const Obj_Entry *obj)
2448 STAILQ_FOREACH(elm, list, link)
2449 if (elm->obj == obj)
2455 objlist_init(Objlist *list)
2461 objlist_push_head(Objlist *list, Obj_Entry *obj)
2465 elm = NEW(Objlist_Entry);
2467 STAILQ_INSERT_HEAD(list, elm, link);
2471 objlist_push_tail(Objlist *list, Obj_Entry *obj)
2475 elm = NEW(Objlist_Entry);
2477 STAILQ_INSERT_TAIL(list, elm, link);
2481 objlist_put_after(Objlist *list, Obj_Entry *listobj, Obj_Entry *obj)
2483 Objlist_Entry *elm, *listelm;
2485 STAILQ_FOREACH(listelm, list, link) {
2486 if (listelm->obj == listobj)
2489 elm = NEW(Objlist_Entry);
2491 if (listelm != NULL)
2492 STAILQ_INSERT_AFTER(list, listelm, elm, link);
2494 STAILQ_INSERT_TAIL(list, elm, link);
2498 objlist_remove(Objlist *list, Obj_Entry *obj)
2502 if ((elm = objlist_find(list, obj)) != NULL) {
2503 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2509 * Relocate dag rooted in the specified object.
2510 * Returns 0 on success, or -1 on failure.
2514 relocate_object_dag(Obj_Entry *root, bool bind_now, Obj_Entry *rtldobj,
2515 int flags, RtldLockState *lockstate)
2521 STAILQ_FOREACH(elm, &root->dagmembers, link) {
2522 error = relocate_object(elm->obj, bind_now, rtldobj, flags,
2531 * Relocate single object.
2532 * Returns 0 on success, or -1 on failure.
2535 relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj,
2536 int flags, RtldLockState *lockstate)
2541 obj->relocated = true;
2543 dbg("relocating \"%s\"", obj->path);
2545 if (obj->symtab == NULL || obj->strtab == NULL ||
2546 !(obj->valid_hash_sysv || obj->valid_hash_gnu)) {
2547 _rtld_error("%s: Shared object has no run-time symbol table",
2553 /* There are relocations to the write-protected text segment. */
2554 if (mprotect(obj->mapbase, obj->textsize,
2555 PROT_READ|PROT_WRITE|PROT_EXEC) == -1) {
2556 _rtld_error("%s: Cannot write-enable text segment: %s",
2557 obj->path, rtld_strerror(errno));
2562 /* Process the non-PLT non-IFUNC relocations. */
2563 if (reloc_non_plt(obj, rtldobj, flags, lockstate))
2566 if (obj->textrel) { /* Re-protected the text segment. */
2567 if (mprotect(obj->mapbase, obj->textsize,
2568 PROT_READ|PROT_EXEC) == -1) {
2569 _rtld_error("%s: Cannot write-protect text segment: %s",
2570 obj->path, rtld_strerror(errno));
2575 /* Set the special PLT or GOT entries. */
2578 /* Process the PLT relocations. */
2579 if (reloc_plt(obj) == -1)
2581 /* Relocate the jump slots if we are doing immediate binding. */
2582 if (obj->bind_now || bind_now)
2583 if (reloc_jmpslots(obj, flags, lockstate) == -1)
2587 * Process the non-PLT IFUNC relocations. The relocations are
2588 * processed in two phases, because IFUNC resolvers may
2589 * reference other symbols, which must be readily processed
2590 * before resolvers are called.
2592 if (obj->non_plt_gnu_ifunc &&
2593 reloc_non_plt(obj, rtldobj, flags | SYMLOOK_IFUNC, lockstate))
2596 if (obj->relro_size > 0) {
2597 if (mprotect(obj->relro_page, obj->relro_size,
2599 _rtld_error("%s: Cannot enforce relro protection: %s",
2600 obj->path, rtld_strerror(errno));
2606 * Set up the magic number and version in the Obj_Entry. These
2607 * were checked in the crt1.o from the original ElfKit, so we
2608 * set them for backward compatibility.
2610 obj->magic = RTLD_MAGIC;
2611 obj->version = RTLD_VERSION;
2617 * Relocate newly-loaded shared objects. The argument is a pointer to
2618 * the Obj_Entry for the first such object. All objects from the first
2619 * to the end of the list of objects are relocated. Returns 0 on success,
2623 relocate_objects(Obj_Entry *first, bool bind_now, Obj_Entry *rtldobj,
2624 int flags, RtldLockState *lockstate)
2629 for (error = 0, obj = first; obj != NULL; obj = obj->next) {
2630 error = relocate_object(obj, bind_now, rtldobj, flags,
2639 * The handling of R_MACHINE_IRELATIVE relocations and jumpslots
2640 * referencing STT_GNU_IFUNC symbols is postponed till the other
2641 * relocations are done. The indirect functions specified as
2642 * ifunc are allowed to call other symbols, so we need to have
2643 * objects relocated before asking for resolution from indirects.
2645 * The R_MACHINE_IRELATIVE slots are resolved in greedy fashion,
2646 * instead of the usual lazy handling of PLT slots. It is
2647 * consistent with how GNU does it.
2650 resolve_object_ifunc(Obj_Entry *obj, bool bind_now, int flags,
2651 RtldLockState *lockstate)
2653 if (obj->irelative && reloc_iresolve(obj, lockstate) == -1)
2655 if ((obj->bind_now || bind_now) && obj->gnu_ifunc &&
2656 reloc_gnu_ifunc(obj, flags, lockstate) == -1)
2662 resolve_objects_ifunc(Obj_Entry *first, bool bind_now, int flags,
2663 RtldLockState *lockstate)
2667 for (obj = first; obj != NULL; obj = obj->next) {
2668 if (resolve_object_ifunc(obj, bind_now, flags, lockstate) == -1)
2675 initlist_objects_ifunc(Objlist *list, bool bind_now, int flags,
2676 RtldLockState *lockstate)
2680 STAILQ_FOREACH(elm, list, link) {
2681 if (resolve_object_ifunc(elm->obj, bind_now, flags,
2689 * Cleanup procedure. It will be called (by the atexit mechanism) just
2690 * before the process exits.
2695 RtldLockState lockstate;
2697 wlock_acquire(rtld_bind_lock, &lockstate);
2699 objlist_call_fini(&list_fini, NULL, &lockstate);
2700 /* No need to remove the items from the list, since we are exiting. */
2701 if (!libmap_disable)
2703 lock_release(rtld_bind_lock, &lockstate);
2707 * Iterate over a search path, translate each element, and invoke the
2708 * callback on the result.
2711 path_enumerate(const char *path, path_enum_proc callback, void *arg)
2717 path += strspn(path, ":;");
2718 while (*path != '\0') {
2722 len = strcspn(path, ":;");
2723 trans = lm_findn(NULL, path, len);
2725 res = callback(trans, strlen(trans), arg);
2727 res = callback(path, len, arg);
2733 path += strspn(path, ":;");
2739 struct try_library_args {
2747 try_library_path(const char *dir, size_t dirlen, void *param)
2749 struct try_library_args *arg;
2752 if (*dir == '/' || trust) {
2755 if (dirlen + 1 + arg->namelen + 1 > arg->buflen)
2758 pathname = arg->buffer;
2759 strncpy(pathname, dir, dirlen);
2760 pathname[dirlen] = '/';
2761 strcpy(pathname + dirlen + 1, arg->name);
2763 dbg(" Trying \"%s\"", pathname);
2764 if (access(pathname, F_OK) == 0) { /* We found it */
2765 pathname = xmalloc(dirlen + 1 + arg->namelen + 1);
2766 strcpy(pathname, arg->buffer);
2774 search_library_path(const char *name, const char *path)
2777 struct try_library_args arg;
2783 arg.namelen = strlen(name);
2784 arg.buffer = xmalloc(PATH_MAX);
2785 arg.buflen = PATH_MAX;
2787 p = path_enumerate(path, try_library_path, &arg);
2795 dlclose(void *handle)
2798 RtldLockState lockstate;
2800 wlock_acquire(rtld_bind_lock, &lockstate);
2801 root = dlcheck(handle);
2803 lock_release(rtld_bind_lock, &lockstate);
2806 LD_UTRACE(UTRACE_DLCLOSE_START, handle, NULL, 0, root->dl_refcount,
2809 /* Unreference the object and its dependencies. */
2810 root->dl_refcount--;
2812 if (root->refcount == 1) {
2814 * The object will be no longer referenced, so we must unload it.
2815 * First, call the fini functions.
2817 objlist_call_fini(&list_fini, root, &lockstate);
2821 /* Finish cleaning up the newly-unreferenced objects. */
2822 GDB_STATE(RT_DELETE,&root->linkmap);
2823 unload_object(root);
2824 GDB_STATE(RT_CONSISTENT,NULL);
2828 LD_UTRACE(UTRACE_DLCLOSE_STOP, handle, NULL, 0, 0, NULL);
2829 lock_release(rtld_bind_lock, &lockstate);
2836 char *msg = error_message;
2837 error_message = NULL;
2842 * This function is deprecated and has no effect.
2845 dllockinit(void *context,
2846 void *(*lock_create)(void *context),
2847 void (*rlock_acquire)(void *lock),
2848 void (*wlock_acquire)(void *lock),
2849 void (*lock_release)(void *lock),
2850 void (*lock_destroy)(void *lock),
2851 void (*context_destroy)(void *context))
2853 static void *cur_context;
2854 static void (*cur_context_destroy)(void *);
2856 /* Just destroy the context from the previous call, if necessary. */
2857 if (cur_context_destroy != NULL)
2858 cur_context_destroy(cur_context);
2859 cur_context = context;
2860 cur_context_destroy = context_destroy;
2864 dlopen(const char *name, int mode)
2867 return (rtld_dlopen(name, -1, mode));
2871 fdlopen(int fd, int mode)
2874 return (rtld_dlopen(NULL, fd, mode));
2878 rtld_dlopen(const char *name, int fd, int mode)
2880 RtldLockState lockstate;
2883 LD_UTRACE(UTRACE_DLOPEN_START, NULL, NULL, 0, mode, name);
2884 ld_tracing = (mode & RTLD_TRACE) == 0 ? NULL : "1";
2885 if (ld_tracing != NULL) {
2886 rlock_acquire(rtld_bind_lock, &lockstate);
2887 if (sigsetjmp(lockstate.env, 0) != 0)
2888 lock_upgrade(rtld_bind_lock, &lockstate);
2889 environ = (char **)*get_program_var_addr("environ", &lockstate);
2890 lock_release(rtld_bind_lock, &lockstate);
2892 lo_flags = RTLD_LO_DLOPEN;
2893 if (mode & RTLD_NODELETE)
2894 lo_flags |= RTLD_LO_NODELETE;
2895 if (mode & RTLD_NOLOAD)
2896 lo_flags |= RTLD_LO_NOLOAD;
2897 if (ld_tracing != NULL)
2898 lo_flags |= RTLD_LO_TRACE;
2900 return (dlopen_object(name, fd, obj_main, lo_flags,
2901 mode & (RTLD_MODEMASK | RTLD_GLOBAL), NULL));
2905 dlopen_cleanup(Obj_Entry *obj)
2910 if (obj->refcount == 0)
2915 dlopen_object(const char *name, int fd, Obj_Entry *refobj, int lo_flags,
2916 int mode, RtldLockState *lockstate)
2918 Obj_Entry **old_obj_tail;
2921 RtldLockState mlockstate;
2924 objlist_init(&initlist);
2926 if (lockstate == NULL && !(lo_flags & RTLD_LO_EARLY)) {
2927 wlock_acquire(rtld_bind_lock, &mlockstate);
2928 lockstate = &mlockstate;
2930 GDB_STATE(RT_ADD,NULL);
2932 old_obj_tail = obj_tail;
2934 if (name == NULL && fd == -1) {
2938 obj = load_object(name, fd, refobj, lo_flags);
2943 if (mode & RTLD_GLOBAL && objlist_find(&list_global, obj) == NULL)
2944 objlist_push_tail(&list_global, obj);
2945 if (*old_obj_tail != NULL) { /* We loaded something new. */
2946 assert(*old_obj_tail == obj);
2947 result = load_needed_objects(obj,
2948 lo_flags & (RTLD_LO_DLOPEN | RTLD_LO_EARLY));
2952 result = rtld_verify_versions(&obj->dagmembers);
2953 if (result != -1 && ld_tracing)
2955 if (result == -1 || relocate_object_dag(obj,
2956 (mode & RTLD_MODEMASK) == RTLD_NOW, &obj_rtld,
2957 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
2959 dlopen_cleanup(obj);
2961 } else if (lo_flags & RTLD_LO_EARLY) {
2963 * Do not call the init functions for early loaded
2964 * filtees. The image is still not initialized enough
2967 * Our object is found by the global object list and
2968 * will be ordered among all init calls done right
2969 * before transferring control to main.
2972 /* Make list of init functions to call. */
2973 initlist_add_objects(obj, &obj->next, &initlist);
2976 * Process all no_delete or global objects here, given
2977 * them own DAGs to prevent their dependencies from being
2978 * unloaded. This has to be done after we have loaded all
2979 * of the dependencies, so that we do not miss any.
2985 * Bump the reference counts for objects on this DAG. If
2986 * this is the first dlopen() call for the object that was
2987 * already loaded as a dependency, initialize the dag
2993 if ((lo_flags & RTLD_LO_TRACE) != 0)
2996 if (obj != NULL && ((lo_flags & RTLD_LO_NODELETE) != 0 ||
2997 obj->z_nodelete) && !obj->ref_nodel) {
2998 dbg("obj %s nodelete", obj->path);
3000 obj->z_nodelete = obj->ref_nodel = true;
3004 LD_UTRACE(UTRACE_DLOPEN_STOP, obj, NULL, 0, obj ? obj->dl_refcount : 0,
3006 GDB_STATE(RT_CONSISTENT,obj ? &obj->linkmap : NULL);
3008 if (!(lo_flags & RTLD_LO_EARLY)) {
3009 map_stacks_exec(lockstate);
3012 if (initlist_objects_ifunc(&initlist, (mode & RTLD_MODEMASK) == RTLD_NOW,
3013 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
3015 objlist_clear(&initlist);
3016 dlopen_cleanup(obj);
3017 if (lockstate == &mlockstate)
3018 lock_release(rtld_bind_lock, lockstate);
3022 if (!(lo_flags & RTLD_LO_EARLY)) {
3023 /* Call the init functions. */
3024 objlist_call_init(&initlist, lockstate);
3026 objlist_clear(&initlist);
3027 if (lockstate == &mlockstate)
3028 lock_release(rtld_bind_lock, lockstate);
3031 trace_loaded_objects(obj);
3032 if (lockstate == &mlockstate)
3033 lock_release(rtld_bind_lock, lockstate);
3038 do_dlsym(void *handle, const char *name, void *retaddr, const Ver_Entry *ve,
3042 const Obj_Entry *obj, *defobj;
3045 RtldLockState lockstate;
3053 symlook_init(&req, name);
3055 req.flags = flags | SYMLOOK_IN_PLT;
3056 req.lockstate = &lockstate;
3058 rlock_acquire(rtld_bind_lock, &lockstate);
3059 if (sigsetjmp(lockstate.env, 0) != 0)
3060 lock_upgrade(rtld_bind_lock, &lockstate);
3061 if (handle == NULL || handle == RTLD_NEXT ||
3062 handle == RTLD_DEFAULT || handle == RTLD_SELF) {
3064 if ((obj = obj_from_addr(retaddr)) == NULL) {
3065 _rtld_error("Cannot determine caller's shared object");
3066 lock_release(rtld_bind_lock, &lockstate);
3069 if (handle == NULL) { /* Just the caller's shared object. */
3070 res = symlook_obj(&req, obj);
3073 defobj = req.defobj_out;
3075 } else if (handle == RTLD_NEXT || /* Objects after caller's */
3076 handle == RTLD_SELF) { /* ... caller included */
3077 if (handle == RTLD_NEXT)
3079 for (; obj != NULL; obj = obj->next) {
3080 res = symlook_obj(&req, obj);
3083 ELF_ST_BIND(req.sym_out->st_info) != STB_WEAK) {
3085 defobj = req.defobj_out;
3086 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3092 * Search the dynamic linker itself, and possibly resolve the
3093 * symbol from there. This is how the application links to
3094 * dynamic linker services such as dlopen.
3096 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
3097 res = symlook_obj(&req, &obj_rtld);
3100 defobj = req.defobj_out;
3104 assert(handle == RTLD_DEFAULT);
3105 res = symlook_default(&req, obj);
3107 defobj = req.defobj_out;
3112 if ((obj = dlcheck(handle)) == NULL) {
3113 lock_release(rtld_bind_lock, &lockstate);
3117 donelist_init(&donelist);
3118 if (obj->mainprog) {
3119 /* Handle obtained by dlopen(NULL, ...) implies global scope. */
3120 res = symlook_global(&req, &donelist);
3123 defobj = req.defobj_out;
3126 * Search the dynamic linker itself, and possibly resolve the
3127 * symbol from there. This is how the application links to
3128 * dynamic linker services such as dlopen.
3130 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
3131 res = symlook_obj(&req, &obj_rtld);
3134 defobj = req.defobj_out;
3139 /* Search the whole DAG rooted at the given object. */
3140 res = symlook_list(&req, &obj->dagmembers, &donelist);
3143 defobj = req.defobj_out;
3149 lock_release(rtld_bind_lock, &lockstate);
3152 * The value required by the caller is derived from the value
3153 * of the symbol. For the ia64 architecture, we need to
3154 * construct a function descriptor which the caller can use to
3155 * call the function with the right 'gp' value. For other
3156 * architectures and for non-functions, the value is simply
3157 * the relocated value of the symbol.
3159 if (ELF_ST_TYPE(def->st_info) == STT_FUNC)
3160 return (make_function_pointer(def, defobj));
3161 else if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
3162 return (rtld_resolve_ifunc(defobj, def));
3163 else if (ELF_ST_TYPE(def->st_info) == STT_TLS) {
3165 return (__tls_get_addr(defobj->tlsindex, def->st_value));
3167 ti.ti_module = defobj->tlsindex;
3168 ti.ti_offset = def->st_value;
3169 return (__tls_get_addr(&ti));
3172 return (defobj->relocbase + def->st_value);
3175 _rtld_error("Undefined symbol \"%s\"", name);
3176 lock_release(rtld_bind_lock, &lockstate);
3181 dlsym(void *handle, const char *name)
3183 return do_dlsym(handle, name, __builtin_return_address(0), NULL,
3188 dlfunc(void *handle, const char *name)
3195 rv.d = do_dlsym(handle, name, __builtin_return_address(0), NULL,
3201 dlvsym(void *handle, const char *name, const char *version)
3205 ventry.name = version;
3207 ventry.hash = elf_hash(version);
3209 return do_dlsym(handle, name, __builtin_return_address(0), &ventry,
3214 _rtld_addr_phdr(const void *addr, struct dl_phdr_info *phdr_info)
3216 const Obj_Entry *obj;
3217 RtldLockState lockstate;
3219 rlock_acquire(rtld_bind_lock, &lockstate);
3220 obj = obj_from_addr(addr);
3222 _rtld_error("No shared object contains address");
3223 lock_release(rtld_bind_lock, &lockstate);
3226 rtld_fill_dl_phdr_info(obj, phdr_info);
3227 lock_release(rtld_bind_lock, &lockstate);
3232 dladdr(const void *addr, Dl_info *info)
3234 const Obj_Entry *obj;
3237 unsigned long symoffset;
3238 RtldLockState lockstate;
3240 rlock_acquire(rtld_bind_lock, &lockstate);
3241 obj = obj_from_addr(addr);
3243 _rtld_error("No shared object contains address");
3244 lock_release(rtld_bind_lock, &lockstate);
3247 info->dli_fname = obj->path;
3248 info->dli_fbase = obj->mapbase;
3249 info->dli_saddr = (void *)0;
3250 info->dli_sname = NULL;
3253 * Walk the symbol list looking for the symbol whose address is
3254 * closest to the address sent in.
3256 for (symoffset = 0; symoffset < obj->dynsymcount; symoffset++) {
3257 def = obj->symtab + symoffset;
3260 * For skip the symbol if st_shndx is either SHN_UNDEF or
3263 if (def->st_shndx == SHN_UNDEF || def->st_shndx == SHN_COMMON)
3267 * If the symbol is greater than the specified address, or if it
3268 * is further away from addr than the current nearest symbol,
3271 symbol_addr = obj->relocbase + def->st_value;
3272 if (symbol_addr > addr || symbol_addr < info->dli_saddr)
3275 /* Update our idea of the nearest symbol. */
3276 info->dli_sname = obj->strtab + def->st_name;
3277 info->dli_saddr = symbol_addr;
3280 if (info->dli_saddr == addr)
3283 lock_release(rtld_bind_lock, &lockstate);
3288 dlinfo(void *handle, int request, void *p)
3290 const Obj_Entry *obj;
3291 RtldLockState lockstate;
3294 rlock_acquire(rtld_bind_lock, &lockstate);
3296 if (handle == NULL || handle == RTLD_SELF) {
3299 retaddr = __builtin_return_address(0); /* __GNUC__ only */
3300 if ((obj = obj_from_addr(retaddr)) == NULL)
3301 _rtld_error("Cannot determine caller's shared object");
3303 obj = dlcheck(handle);
3306 lock_release(rtld_bind_lock, &lockstate);
3312 case RTLD_DI_LINKMAP:
3313 *((struct link_map const **)p) = &obj->linkmap;
3315 case RTLD_DI_ORIGIN:
3316 error = rtld_dirname(obj->path, p);
3319 case RTLD_DI_SERINFOSIZE:
3320 case RTLD_DI_SERINFO:
3321 error = do_search_info(obj, request, (struct dl_serinfo *)p);
3325 _rtld_error("Invalid request %d passed to dlinfo()", request);
3329 lock_release(rtld_bind_lock, &lockstate);
3335 rtld_fill_dl_phdr_info(const Obj_Entry *obj, struct dl_phdr_info *phdr_info)
3338 phdr_info->dlpi_addr = (Elf_Addr)obj->relocbase;
3339 phdr_info->dlpi_name = obj->path;
3340 phdr_info->dlpi_phdr = obj->phdr;
3341 phdr_info->dlpi_phnum = obj->phsize / sizeof(obj->phdr[0]);
3342 phdr_info->dlpi_tls_modid = obj->tlsindex;
3343 phdr_info->dlpi_tls_data = obj->tlsinit;
3344 phdr_info->dlpi_adds = obj_loads;
3345 phdr_info->dlpi_subs = obj_loads - obj_count;
3349 dl_iterate_phdr(__dl_iterate_hdr_callback callback, void *param)
3351 struct dl_phdr_info phdr_info;
3352 const Obj_Entry *obj;
3353 RtldLockState bind_lockstate, phdr_lockstate;
3356 wlock_acquire(rtld_phdr_lock, &phdr_lockstate);
3357 rlock_acquire(rtld_bind_lock, &bind_lockstate);
3361 for (obj = obj_list; obj != NULL; obj = obj->next) {
3362 rtld_fill_dl_phdr_info(obj, &phdr_info);
3363 if ((error = callback(&phdr_info, sizeof phdr_info, param)) != 0)
3367 lock_release(rtld_bind_lock, &bind_lockstate);
3368 lock_release(rtld_phdr_lock, &phdr_lockstate);
3374 fill_search_info(const char *dir, size_t dirlen, void *param)
3376 struct fill_search_info_args *arg;
3380 if (arg->request == RTLD_DI_SERINFOSIZE) {
3381 arg->serinfo->dls_cnt ++;
3382 arg->serinfo->dls_size += sizeof(struct dl_serpath) + dirlen + 1;
3384 struct dl_serpath *s_entry;
3386 s_entry = arg->serpath;
3387 s_entry->dls_name = arg->strspace;
3388 s_entry->dls_flags = arg->flags;
3390 strncpy(arg->strspace, dir, dirlen);
3391 arg->strspace[dirlen] = '\0';
3393 arg->strspace += dirlen + 1;
3401 do_search_info(const Obj_Entry *obj, int request, struct dl_serinfo *info)
3403 struct dl_serinfo _info;
3404 struct fill_search_info_args args;
3406 args.request = RTLD_DI_SERINFOSIZE;
3407 args.serinfo = &_info;
3409 _info.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
3412 path_enumerate(obj->rpath, fill_search_info, &args);
3413 path_enumerate(ld_library_path, fill_search_info, &args);
3414 path_enumerate(obj->runpath, fill_search_info, &args);
3415 path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args);
3416 if (!obj->z_nodeflib)
3417 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args);
3420 if (request == RTLD_DI_SERINFOSIZE) {
3421 info->dls_size = _info.dls_size;
3422 info->dls_cnt = _info.dls_cnt;
3426 if (info->dls_cnt != _info.dls_cnt || info->dls_size != _info.dls_size) {
3427 _rtld_error("Uninitialized Dl_serinfo struct passed to dlinfo()");
3431 args.request = RTLD_DI_SERINFO;
3432 args.serinfo = info;
3433 args.serpath = &info->dls_serpath[0];
3434 args.strspace = (char *)&info->dls_serpath[_info.dls_cnt];
3436 args.flags = LA_SER_RUNPATH;
3437 if (path_enumerate(obj->rpath, fill_search_info, &args) != NULL)
3440 args.flags = LA_SER_LIBPATH;
3441 if (path_enumerate(ld_library_path, fill_search_info, &args) != NULL)
3444 args.flags = LA_SER_RUNPATH;
3445 if (path_enumerate(obj->runpath, fill_search_info, &args) != NULL)
3448 args.flags = LA_SER_CONFIG;
3449 if (path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args)
3453 args.flags = LA_SER_DEFAULT;
3454 if (!obj->z_nodeflib &&
3455 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args) != NULL)
3461 rtld_dirname(const char *path, char *bname)
3465 /* Empty or NULL string gets treated as "." */
3466 if (path == NULL || *path == '\0') {
3472 /* Strip trailing slashes */
3473 endp = path + strlen(path) - 1;
3474 while (endp > path && *endp == '/')
3477 /* Find the start of the dir */
3478 while (endp > path && *endp != '/')
3481 /* Either the dir is "/" or there are no slashes */
3483 bname[0] = *endp == '/' ? '/' : '.';
3489 } while (endp > path && *endp == '/');
3492 if (endp - path + 2 > PATH_MAX)
3494 _rtld_error("Filename is too long: %s", path);
3498 strncpy(bname, path, endp - path + 1);
3499 bname[endp - path + 1] = '\0';
3504 rtld_dirname_abs(const char *path, char *base)
3508 if (realpath(path, base) == NULL)
3510 dbg("%s -> %s", path, base);
3511 last = strrchr(base, '/');
3520 linkmap_add(Obj_Entry *obj)
3522 struct link_map *l = &obj->linkmap;
3523 struct link_map *prev;
3525 obj->linkmap.l_name = obj->path;
3526 obj->linkmap.l_addr = obj->mapbase;
3527 obj->linkmap.l_ld = obj->dynamic;
3529 /* GDB needs load offset on MIPS to use the symbols */
3530 obj->linkmap.l_offs = obj->relocbase;
3533 if (r_debug.r_map == NULL) {
3539 * Scan to the end of the list, but not past the entry for the
3540 * dynamic linker, which we want to keep at the very end.
3542 for (prev = r_debug.r_map;
3543 prev->l_next != NULL && prev->l_next != &obj_rtld.linkmap;
3544 prev = prev->l_next)
3547 /* Link in the new entry. */
3549 l->l_next = prev->l_next;
3550 if (l->l_next != NULL)
3551 l->l_next->l_prev = l;
3556 linkmap_delete(Obj_Entry *obj)
3558 struct link_map *l = &obj->linkmap;
3560 if (l->l_prev == NULL) {
3561 if ((r_debug.r_map = l->l_next) != NULL)
3562 l->l_next->l_prev = NULL;
3566 if ((l->l_prev->l_next = l->l_next) != NULL)
3567 l->l_next->l_prev = l->l_prev;
3571 * Function for the debugger to set a breakpoint on to gain control.
3573 * The two parameters allow the debugger to easily find and determine
3574 * what the runtime loader is doing and to whom it is doing it.
3576 * When the loadhook trap is hit (r_debug_state, set at program
3577 * initialization), the arguments can be found on the stack:
3579 * +8 struct link_map *m
3580 * +4 struct r_debug *rd
3584 r_debug_state(struct r_debug* rd, struct link_map *m)
3587 * The following is a hack to force the compiler to emit calls to
3588 * this function, even when optimizing. If the function is empty,
3589 * the compiler is not obliged to emit any code for calls to it,
3590 * even when marked __noinline. However, gdb depends on those
3593 __compiler_membar();
3597 * A function called after init routines have completed. This can be used to
3598 * break before a program's entry routine is called, and can be used when
3599 * main is not available in the symbol table.
3602 _r_debug_postinit(struct link_map *m)
3605 /* See r_debug_state(). */
3606 __compiler_membar();
3610 * Get address of the pointer variable in the main program.
3611 * Prefer non-weak symbol over the weak one.
3613 static const void **
3614 get_program_var_addr(const char *name, RtldLockState *lockstate)
3619 symlook_init(&req, name);
3620 req.lockstate = lockstate;
3621 donelist_init(&donelist);
3622 if (symlook_global(&req, &donelist) != 0)
3624 if (ELF_ST_TYPE(req.sym_out->st_info) == STT_FUNC)
3625 return ((const void **)make_function_pointer(req.sym_out,
3627 else if (ELF_ST_TYPE(req.sym_out->st_info) == STT_GNU_IFUNC)
3628 return ((const void **)rtld_resolve_ifunc(req.defobj_out, req.sym_out));
3630 return ((const void **)(req.defobj_out->relocbase +
3631 req.sym_out->st_value));
3635 * Set a pointer variable in the main program to the given value. This
3636 * is used to set key variables such as "environ" before any of the
3637 * init functions are called.
3640 set_program_var(const char *name, const void *value)
3644 if ((addr = get_program_var_addr(name, NULL)) != NULL) {
3645 dbg("\"%s\": *%p <-- %p", name, addr, value);
3651 * Search the global objects, including dependencies and main object,
3652 * for the given symbol.
3655 symlook_global(SymLook *req, DoneList *donelist)
3658 const Objlist_Entry *elm;
3661 symlook_init_from_req(&req1, req);
3663 /* Search all objects loaded at program start up. */
3664 if (req->defobj_out == NULL ||
3665 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3666 res = symlook_list(&req1, &list_main, donelist);
3667 if (res == 0 && (req->defobj_out == NULL ||
3668 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3669 req->sym_out = req1.sym_out;
3670 req->defobj_out = req1.defobj_out;
3671 assert(req->defobj_out != NULL);
3675 /* Search all DAGs whose roots are RTLD_GLOBAL objects. */
3676 STAILQ_FOREACH(elm, &list_global, link) {
3677 if (req->defobj_out != NULL &&
3678 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3680 res = symlook_list(&req1, &elm->obj->dagmembers, donelist);
3681 if (res == 0 && (req->defobj_out == NULL ||
3682 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3683 req->sym_out = req1.sym_out;
3684 req->defobj_out = req1.defobj_out;
3685 assert(req->defobj_out != NULL);
3689 return (req->sym_out != NULL ? 0 : ESRCH);
3693 * Given a symbol name in a referencing object, find the corresponding
3694 * definition of the symbol. Returns a pointer to the symbol, or NULL if
3695 * no definition was found. Returns a pointer to the Obj_Entry of the
3696 * defining object via the reference parameter DEFOBJ_OUT.
3699 symlook_default(SymLook *req, const Obj_Entry *refobj)
3702 const Objlist_Entry *elm;
3706 donelist_init(&donelist);
3707 symlook_init_from_req(&req1, req);
3709 /* Look first in the referencing object if linked symbolically. */
3710 if (refobj->symbolic && !donelist_check(&donelist, refobj)) {
3711 res = symlook_obj(&req1, refobj);
3713 req->sym_out = req1.sym_out;
3714 req->defobj_out = req1.defobj_out;
3715 assert(req->defobj_out != NULL);
3719 symlook_global(req, &donelist);
3721 /* Search all dlopened DAGs containing the referencing object. */
3722 STAILQ_FOREACH(elm, &refobj->dldags, link) {
3723 if (req->sym_out != NULL &&
3724 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3726 res = symlook_list(&req1, &elm->obj->dagmembers, &donelist);
3727 if (res == 0 && (req->sym_out == NULL ||
3728 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3729 req->sym_out = req1.sym_out;
3730 req->defobj_out = req1.defobj_out;
3731 assert(req->defobj_out != NULL);
3736 * Search the dynamic linker itself, and possibly resolve the
3737 * symbol from there. This is how the application links to
3738 * dynamic linker services such as dlopen.
3740 if (req->sym_out == NULL ||
3741 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3742 res = symlook_obj(&req1, &obj_rtld);
3744 req->sym_out = req1.sym_out;
3745 req->defobj_out = req1.defobj_out;
3746 assert(req->defobj_out != NULL);
3750 return (req->sym_out != NULL ? 0 : ESRCH);
3754 symlook_list(SymLook *req, const Objlist *objlist, DoneList *dlp)
3757 const Obj_Entry *defobj;
3758 const Objlist_Entry *elm;
3764 STAILQ_FOREACH(elm, objlist, link) {
3765 if (donelist_check(dlp, elm->obj))
3767 symlook_init_from_req(&req1, req);
3768 if ((res = symlook_obj(&req1, elm->obj)) == 0) {
3769 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3771 defobj = req1.defobj_out;
3772 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3779 req->defobj_out = defobj;
3786 * Search the chain of DAGS cointed to by the given Needed_Entry
3787 * for a symbol of the given name. Each DAG is scanned completely
3788 * before advancing to the next one. Returns a pointer to the symbol,
3789 * or NULL if no definition was found.
3792 symlook_needed(SymLook *req, const Needed_Entry *needed, DoneList *dlp)
3795 const Needed_Entry *n;
3796 const Obj_Entry *defobj;
3802 symlook_init_from_req(&req1, req);
3803 for (n = needed; n != NULL; n = n->next) {
3804 if (n->obj == NULL ||
3805 (res = symlook_list(&req1, &n->obj->dagmembers, dlp)) != 0)
3807 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3809 defobj = req1.defobj_out;
3810 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3816 req->defobj_out = defobj;
3823 * Search the symbol table of a single shared object for a symbol of
3824 * the given name and version, if requested. Returns a pointer to the
3825 * symbol, or NULL if no definition was found. If the object is
3826 * filter, return filtered symbol from filtee.
3828 * The symbol's hash value is passed in for efficiency reasons; that
3829 * eliminates many recomputations of the hash value.
3832 symlook_obj(SymLook *req, const Obj_Entry *obj)
3836 int flags, res, mres;
3839 * If there is at least one valid hash at this point, we prefer to
3840 * use the faster GNU version if available.
3842 if (obj->valid_hash_gnu)
3843 mres = symlook_obj1_gnu(req, obj);
3844 else if (obj->valid_hash_sysv)
3845 mres = symlook_obj1_sysv(req, obj);
3850 if (obj->needed_filtees != NULL) {
3851 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3852 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3853 donelist_init(&donelist);
3854 symlook_init_from_req(&req1, req);
3855 res = symlook_needed(&req1, obj->needed_filtees, &donelist);
3857 req->sym_out = req1.sym_out;
3858 req->defobj_out = req1.defobj_out;
3862 if (obj->needed_aux_filtees != NULL) {
3863 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3864 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3865 donelist_init(&donelist);
3866 symlook_init_from_req(&req1, req);
3867 res = symlook_needed(&req1, obj->needed_aux_filtees, &donelist);
3869 req->sym_out = req1.sym_out;
3870 req->defobj_out = req1.defobj_out;
3878 /* Symbol match routine common to both hash functions */
3880 matched_symbol(SymLook *req, const Obj_Entry *obj, Sym_Match_Result *result,
3881 const unsigned long symnum)
3884 const Elf_Sym *symp;
3887 symp = obj->symtab + symnum;
3888 strp = obj->strtab + symp->st_name;
3890 switch (ELF_ST_TYPE(symp->st_info)) {
3896 if (symp->st_value == 0)
3900 if (symp->st_shndx != SHN_UNDEF)
3903 else if (((req->flags & SYMLOOK_IN_PLT) == 0) &&
3904 (ELF_ST_TYPE(symp->st_info) == STT_FUNC))
3911 if (req->name[0] != strp[0] || strcmp(req->name, strp) != 0)
3914 if (req->ventry == NULL) {
3915 if (obj->versyms != NULL) {
3916 verndx = VER_NDX(obj->versyms[symnum]);
3917 if (verndx > obj->vernum) {
3919 "%s: symbol %s references wrong version %d",
3920 obj->path, obj->strtab + symnum, verndx);
3924 * If we are not called from dlsym (i.e. this
3925 * is a normal relocation from unversioned
3926 * binary), accept the symbol immediately if
3927 * it happens to have first version after this
3928 * shared object became versioned. Otherwise,
3929 * if symbol is versioned and not hidden,
3930 * remember it. If it is the only symbol with
3931 * this name exported by the shared object, it
3932 * will be returned as a match by the calling
3933 * function. If symbol is global (verndx < 2)
3934 * accept it unconditionally.
3936 if ((req->flags & SYMLOOK_DLSYM) == 0 &&
3937 verndx == VER_NDX_GIVEN) {
3938 result->sym_out = symp;
3941 else if (verndx >= VER_NDX_GIVEN) {
3942 if ((obj->versyms[symnum] & VER_NDX_HIDDEN)
3944 if (result->vsymp == NULL)
3945 result->vsymp = symp;
3951 result->sym_out = symp;
3954 if (obj->versyms == NULL) {
3955 if (object_match_name(obj, req->ventry->name)) {
3956 _rtld_error("%s: object %s should provide version %s "
3957 "for symbol %s", obj_rtld.path, obj->path,
3958 req->ventry->name, obj->strtab + symnum);
3962 verndx = VER_NDX(obj->versyms[symnum]);
3963 if (verndx > obj->vernum) {
3964 _rtld_error("%s: symbol %s references wrong version %d",
3965 obj->path, obj->strtab + symnum, verndx);
3968 if (obj->vertab[verndx].hash != req->ventry->hash ||
3969 strcmp(obj->vertab[verndx].name, req->ventry->name)) {
3971 * Version does not match. Look if this is a
3972 * global symbol and if it is not hidden. If
3973 * global symbol (verndx < 2) is available,
3974 * use it. Do not return symbol if we are
3975 * called by dlvsym, because dlvsym looks for
3976 * a specific version and default one is not
3977 * what dlvsym wants.
3979 if ((req->flags & SYMLOOK_DLSYM) ||
3980 (verndx >= VER_NDX_GIVEN) ||
3981 (obj->versyms[symnum] & VER_NDX_HIDDEN))
3985 result->sym_out = symp;
3990 * Search for symbol using SysV hash function.
3991 * obj->buckets is known not to be NULL at this point; the test for this was
3992 * performed with the obj->valid_hash_sysv assignment.
3995 symlook_obj1_sysv(SymLook *req, const Obj_Entry *obj)
3997 unsigned long symnum;
3998 Sym_Match_Result matchres;
4000 matchres.sym_out = NULL;
4001 matchres.vsymp = NULL;
4002 matchres.vcount = 0;
4004 for (symnum = obj->buckets[req->hash % obj->nbuckets];
4005 symnum != STN_UNDEF; symnum = obj->chains[symnum]) {
4006 if (symnum >= obj->nchains)
4007 return (ESRCH); /* Bad object */
4009 if (matched_symbol(req, obj, &matchres, symnum)) {
4010 req->sym_out = matchres.sym_out;
4011 req->defobj_out = obj;
4015 if (matchres.vcount == 1) {
4016 req->sym_out = matchres.vsymp;
4017 req->defobj_out = obj;
4023 /* Search for symbol using GNU hash function */
4025 symlook_obj1_gnu(SymLook *req, const Obj_Entry *obj)
4027 Elf_Addr bloom_word;
4028 const Elf32_Word *hashval;
4030 Sym_Match_Result matchres;
4031 unsigned int h1, h2;
4032 unsigned long symnum;
4034 matchres.sym_out = NULL;
4035 matchres.vsymp = NULL;
4036 matchres.vcount = 0;
4038 /* Pick right bitmask word from Bloom filter array */
4039 bloom_word = obj->bloom_gnu[(req->hash_gnu / __ELF_WORD_SIZE) &
4040 obj->maskwords_bm_gnu];
4042 /* Calculate modulus word size of gnu hash and its derivative */
4043 h1 = req->hash_gnu & (__ELF_WORD_SIZE - 1);
4044 h2 = ((req->hash_gnu >> obj->shift2_gnu) & (__ELF_WORD_SIZE - 1));
4046 /* Filter out the "definitely not in set" queries */
4047 if (((bloom_word >> h1) & (bloom_word >> h2) & 1) == 0)
4050 /* Locate hash chain and corresponding value element*/
4051 bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu];
4054 hashval = &obj->chain_zero_gnu[bucket];
4056 if (((*hashval ^ req->hash_gnu) >> 1) == 0) {
4057 symnum = hashval - obj->chain_zero_gnu;
4058 if (matched_symbol(req, obj, &matchres, symnum)) {
4059 req->sym_out = matchres.sym_out;
4060 req->defobj_out = obj;
4064 } while ((*hashval++ & 1) == 0);
4065 if (matchres.vcount == 1) {
4066 req->sym_out = matchres.vsymp;
4067 req->defobj_out = obj;
4074 trace_loaded_objects(Obj_Entry *obj)
4076 char *fmt1, *fmt2, *fmt, *main_local, *list_containers;
4079 if ((main_local = getenv(LD_ "TRACE_LOADED_OBJECTS_PROGNAME")) == NULL)
4082 if ((fmt1 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT1")) == NULL)
4083 fmt1 = "\t%o => %p (%x)\n";
4085 if ((fmt2 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT2")) == NULL)
4086 fmt2 = "\t%o (%x)\n";
4088 list_containers = getenv(LD_ "TRACE_LOADED_OBJECTS_ALL");
4090 for (; obj; obj = obj->next) {
4091 Needed_Entry *needed;
4095 if (list_containers && obj->needed != NULL)
4096 rtld_printf("%s:\n", obj->path);
4097 for (needed = obj->needed; needed; needed = needed->next) {
4098 if (needed->obj != NULL) {
4099 if (needed->obj->traced && !list_containers)
4101 needed->obj->traced = true;
4102 path = needed->obj->path;
4106 name = (char *)obj->strtab + needed->name;
4107 is_lib = strncmp(name, "lib", 3) == 0; /* XXX - bogus */
4109 fmt = is_lib ? fmt1 : fmt2;
4110 while ((c = *fmt++) != '\0') {
4136 rtld_putstr(main_local);
4139 rtld_putstr(obj_main->path);
4146 rtld_printf("%d", sodp->sod_major);
4149 rtld_printf("%d", sodp->sod_minor);
4156 rtld_printf("%p", needed->obj ? needed->obj->mapbase :
4169 * Unload a dlopened object and its dependencies from memory and from
4170 * our data structures. It is assumed that the DAG rooted in the
4171 * object has already been unreferenced, and that the object has a
4172 * reference count of 0.
4175 unload_object(Obj_Entry *root)
4180 assert(root->refcount == 0);
4183 * Pass over the DAG removing unreferenced objects from
4184 * appropriate lists.
4186 unlink_object(root);
4188 /* Unmap all objects that are no longer referenced. */
4189 linkp = &obj_list->next;
4190 while ((obj = *linkp) != NULL) {
4191 if (obj->refcount == 0) {
4192 LD_UTRACE(UTRACE_UNLOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
4194 dbg("unloading \"%s\"", obj->path);
4195 unload_filtees(root);
4196 munmap(obj->mapbase, obj->mapsize);
4197 linkmap_delete(obj);
4208 unlink_object(Obj_Entry *root)
4212 if (root->refcount == 0) {
4213 /* Remove the object from the RTLD_GLOBAL list. */
4214 objlist_remove(&list_global, root);
4216 /* Remove the object from all objects' DAG lists. */
4217 STAILQ_FOREACH(elm, &root->dagmembers, link) {
4218 objlist_remove(&elm->obj->dldags, root);
4219 if (elm->obj != root)
4220 unlink_object(elm->obj);
4226 ref_dag(Obj_Entry *root)
4230 assert(root->dag_inited);
4231 STAILQ_FOREACH(elm, &root->dagmembers, link)
4232 elm->obj->refcount++;
4236 unref_dag(Obj_Entry *root)
4240 assert(root->dag_inited);
4241 STAILQ_FOREACH(elm, &root->dagmembers, link)
4242 elm->obj->refcount--;
4246 * Common code for MD __tls_get_addr().
4248 static void *tls_get_addr_slow(Elf_Addr **, int, size_t) __noinline;
4250 tls_get_addr_slow(Elf_Addr **dtvp, int index, size_t offset)
4252 Elf_Addr *newdtv, *dtv;
4253 RtldLockState lockstate;
4257 /* Check dtv generation in case new modules have arrived */
4258 if (dtv[0] != tls_dtv_generation) {
4259 wlock_acquire(rtld_bind_lock, &lockstate);
4260 newdtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4262 if (to_copy > tls_max_index)
4263 to_copy = tls_max_index;
4264 memcpy(&newdtv[2], &dtv[2], to_copy * sizeof(Elf_Addr));
4265 newdtv[0] = tls_dtv_generation;
4266 newdtv[1] = tls_max_index;
4268 lock_release(rtld_bind_lock, &lockstate);
4269 dtv = *dtvp = newdtv;
4272 /* Dynamically allocate module TLS if necessary */
4273 if (dtv[index + 1] == 0) {
4274 /* Signal safe, wlock will block out signals. */
4275 wlock_acquire(rtld_bind_lock, &lockstate);
4276 if (!dtv[index + 1])
4277 dtv[index + 1] = (Elf_Addr)allocate_module_tls(index);
4278 lock_release(rtld_bind_lock, &lockstate);
4280 return ((void *)(dtv[index + 1] + offset));
4284 tls_get_addr_common(Elf_Addr **dtvp, int index, size_t offset)
4289 /* Check dtv generation in case new modules have arrived */
4290 if (__predict_true(dtv[0] == tls_dtv_generation &&
4291 dtv[index + 1] != 0))
4292 return ((void *)(dtv[index + 1] + offset));
4293 return (tls_get_addr_slow(dtvp, index, offset));
4296 #if defined(__arm__) || defined(__ia64__) || defined(__mips__) || defined(__powerpc__)
4299 * Allocate Static TLS using the Variant I method.
4302 allocate_tls(Obj_Entry *objs, void *oldtcb, size_t tcbsize, size_t tcbalign)
4311 if (oldtcb != NULL && tcbsize == TLS_TCB_SIZE)
4314 assert(tcbsize >= TLS_TCB_SIZE);
4315 tcb = xcalloc(1, tls_static_space - TLS_TCB_SIZE + tcbsize);
4316 tls = (Elf_Addr **)(tcb + tcbsize - TLS_TCB_SIZE);
4318 if (oldtcb != NULL) {
4319 memcpy(tls, oldtcb, tls_static_space);
4322 /* Adjust the DTV. */
4324 for (i = 0; i < dtv[1]; i++) {
4325 if (dtv[i+2] >= (Elf_Addr)oldtcb &&
4326 dtv[i+2] < (Elf_Addr)oldtcb + tls_static_space) {
4327 dtv[i+2] = dtv[i+2] - (Elf_Addr)oldtcb + (Elf_Addr)tls;
4331 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4333 dtv[0] = tls_dtv_generation;
4334 dtv[1] = tls_max_index;
4336 for (obj = objs; obj; obj = obj->next) {
4337 if (obj->tlsoffset > 0) {
4338 addr = (Elf_Addr)tls + obj->tlsoffset;
4339 if (obj->tlsinitsize > 0)
4340 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4341 if (obj->tlssize > obj->tlsinitsize)
4342 memset((void*) (addr + obj->tlsinitsize), 0,
4343 obj->tlssize - obj->tlsinitsize);
4344 dtv[obj->tlsindex + 1] = addr;
4353 free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4356 Elf_Addr tlsstart, tlsend;
4359 assert(tcbsize >= TLS_TCB_SIZE);
4361 tlsstart = (Elf_Addr)tcb + tcbsize - TLS_TCB_SIZE;
4362 tlsend = tlsstart + tls_static_space;
4364 dtv = *(Elf_Addr **)tlsstart;
4366 for (i = 0; i < dtvsize; i++) {
4367 if (dtv[i+2] && (dtv[i+2] < tlsstart || dtv[i+2] >= tlsend)) {
4368 free((void*)dtv[i+2]);
4377 #if defined(__i386__) || defined(__amd64__) || defined(__sparc64__)
4380 * Allocate Static TLS using the Variant II method.
4383 allocate_tls(Obj_Entry *objs, void *oldtls, size_t tcbsize, size_t tcbalign)
4386 size_t size, ralign;
4388 Elf_Addr *dtv, *olddtv;
4389 Elf_Addr segbase, oldsegbase, addr;
4393 if (tls_static_max_align > ralign)
4394 ralign = tls_static_max_align;
4395 size = round(tls_static_space, ralign) + round(tcbsize, ralign);
4397 assert(tcbsize >= 2*sizeof(Elf_Addr));
4398 tls = malloc_aligned(size, ralign);
4399 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4401 segbase = (Elf_Addr)(tls + round(tls_static_space, ralign));
4402 ((Elf_Addr*)segbase)[0] = segbase;
4403 ((Elf_Addr*)segbase)[1] = (Elf_Addr) dtv;
4405 dtv[0] = tls_dtv_generation;
4406 dtv[1] = tls_max_index;
4410 * Copy the static TLS block over whole.
4412 oldsegbase = (Elf_Addr) oldtls;
4413 memcpy((void *)(segbase - tls_static_space),
4414 (const void *)(oldsegbase - tls_static_space),
4418 * If any dynamic TLS blocks have been created tls_get_addr(),
4421 olddtv = ((Elf_Addr**)oldsegbase)[1];
4422 for (i = 0; i < olddtv[1]; i++) {
4423 if (olddtv[i+2] < oldsegbase - size || olddtv[i+2] > oldsegbase) {
4424 dtv[i+2] = olddtv[i+2];
4430 * We assume that this block was the one we created with
4431 * allocate_initial_tls().
4433 free_tls(oldtls, 2*sizeof(Elf_Addr), sizeof(Elf_Addr));
4435 for (obj = objs; obj; obj = obj->next) {
4436 if (obj->tlsoffset) {
4437 addr = segbase - obj->tlsoffset;
4438 memset((void*) (addr + obj->tlsinitsize),
4439 0, obj->tlssize - obj->tlsinitsize);
4441 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4442 dtv[obj->tlsindex + 1] = addr;
4447 return (void*) segbase;
4451 free_tls(void *tls, size_t tcbsize, size_t tcbalign)
4454 size_t size, ralign;
4456 Elf_Addr tlsstart, tlsend;
4459 * Figure out the size of the initial TLS block so that we can
4460 * find stuff which ___tls_get_addr() allocated dynamically.
4463 if (tls_static_max_align > ralign)
4464 ralign = tls_static_max_align;
4465 size = round(tls_static_space, ralign);
4467 dtv = ((Elf_Addr**)tls)[1];
4469 tlsend = (Elf_Addr) tls;
4470 tlsstart = tlsend - size;
4471 for (i = 0; i < dtvsize; i++) {
4472 if (dtv[i + 2] != 0 && (dtv[i + 2] < tlsstart || dtv[i + 2] > tlsend)) {
4473 free_aligned((void *)dtv[i + 2]);
4477 free_aligned((void *)tlsstart);
4484 * Allocate TLS block for module with given index.
4487 allocate_module_tls(int index)
4492 for (obj = obj_list; obj; obj = obj->next) {
4493 if (obj->tlsindex == index)
4497 _rtld_error("Can't find module with TLS index %d", index);
4501 p = malloc_aligned(obj->tlssize, obj->tlsalign);
4502 memcpy(p, obj->tlsinit, obj->tlsinitsize);
4503 memset(p + obj->tlsinitsize, 0, obj->tlssize - obj->tlsinitsize);
4509 allocate_tls_offset(Obj_Entry *obj)
4516 if (obj->tlssize == 0) {
4517 obj->tls_done = true;
4521 if (obj->tlsindex == 1)
4522 off = calculate_first_tls_offset(obj->tlssize, obj->tlsalign);
4524 off = calculate_tls_offset(tls_last_offset, tls_last_size,
4525 obj->tlssize, obj->tlsalign);
4528 * If we have already fixed the size of the static TLS block, we
4529 * must stay within that size. When allocating the static TLS, we
4530 * leave a small amount of space spare to be used for dynamically
4531 * loading modules which use static TLS.
4533 if (tls_static_space != 0) {
4534 if (calculate_tls_end(off, obj->tlssize) > tls_static_space)
4536 } else if (obj->tlsalign > tls_static_max_align) {
4537 tls_static_max_align = obj->tlsalign;
4540 tls_last_offset = obj->tlsoffset = off;
4541 tls_last_size = obj->tlssize;
4542 obj->tls_done = true;
4548 free_tls_offset(Obj_Entry *obj)
4552 * If we were the last thing to allocate out of the static TLS
4553 * block, we give our space back to the 'allocator'. This is a
4554 * simplistic workaround to allow libGL.so.1 to be loaded and
4555 * unloaded multiple times.
4557 if (calculate_tls_end(obj->tlsoffset, obj->tlssize)
4558 == calculate_tls_end(tls_last_offset, tls_last_size)) {
4559 tls_last_offset -= obj->tlssize;
4565 _rtld_allocate_tls(void *oldtls, size_t tcbsize, size_t tcbalign)
4568 RtldLockState lockstate;
4570 wlock_acquire(rtld_bind_lock, &lockstate);
4571 ret = allocate_tls(obj_list, oldtls, tcbsize, tcbalign);
4572 lock_release(rtld_bind_lock, &lockstate);
4577 _rtld_free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4579 RtldLockState lockstate;
4581 wlock_acquire(rtld_bind_lock, &lockstate);
4582 free_tls(tcb, tcbsize, tcbalign);
4583 lock_release(rtld_bind_lock, &lockstate);
4587 object_add_name(Obj_Entry *obj, const char *name)
4593 entry = malloc(sizeof(Name_Entry) + len);
4595 if (entry != NULL) {
4596 strcpy(entry->name, name);
4597 STAILQ_INSERT_TAIL(&obj->names, entry, link);
4602 object_match_name(const Obj_Entry *obj, const char *name)
4606 STAILQ_FOREACH(entry, &obj->names, link) {
4607 if (strcmp(name, entry->name) == 0)
4614 locate_dependency(const Obj_Entry *obj, const char *name)
4616 const Objlist_Entry *entry;
4617 const Needed_Entry *needed;
4619 STAILQ_FOREACH(entry, &list_main, link) {
4620 if (object_match_name(entry->obj, name))
4624 for (needed = obj->needed; needed != NULL; needed = needed->next) {
4625 if (strcmp(obj->strtab + needed->name, name) == 0 ||
4626 (needed->obj != NULL && object_match_name(needed->obj, name))) {
4628 * If there is DT_NEEDED for the name we are looking for,
4629 * we are all set. Note that object might not be found if
4630 * dependency was not loaded yet, so the function can
4631 * return NULL here. This is expected and handled
4632 * properly by the caller.
4634 return (needed->obj);
4637 _rtld_error("%s: Unexpected inconsistency: dependency %s not found",
4643 check_object_provided_version(Obj_Entry *refobj, const Obj_Entry *depobj,
4644 const Elf_Vernaux *vna)
4646 const Elf_Verdef *vd;
4647 const char *vername;
4649 vername = refobj->strtab + vna->vna_name;
4650 vd = depobj->verdef;
4652 _rtld_error("%s: version %s required by %s not defined",
4653 depobj->path, vername, refobj->path);
4657 if (vd->vd_version != VER_DEF_CURRENT) {
4658 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4659 depobj->path, vd->vd_version);
4662 if (vna->vna_hash == vd->vd_hash) {
4663 const Elf_Verdaux *aux = (const Elf_Verdaux *)
4664 ((char *)vd + vd->vd_aux);
4665 if (strcmp(vername, depobj->strtab + aux->vda_name) == 0)
4668 if (vd->vd_next == 0)
4670 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4672 if (vna->vna_flags & VER_FLG_WEAK)
4674 _rtld_error("%s: version %s required by %s not found",
4675 depobj->path, vername, refobj->path);
4680 rtld_verify_object_versions(Obj_Entry *obj)
4682 const Elf_Verneed *vn;
4683 const Elf_Verdef *vd;
4684 const Elf_Verdaux *vda;
4685 const Elf_Vernaux *vna;
4686 const Obj_Entry *depobj;
4687 int maxvernum, vernum;
4689 if (obj->ver_checked)
4691 obj->ver_checked = true;
4695 * Walk over defined and required version records and figure out
4696 * max index used by any of them. Do very basic sanity checking
4700 while (vn != NULL) {
4701 if (vn->vn_version != VER_NEED_CURRENT) {
4702 _rtld_error("%s: Unsupported version %d of Elf_Verneed entry",
4703 obj->path, vn->vn_version);
4706 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4708 vernum = VER_NEED_IDX(vna->vna_other);
4709 if (vernum > maxvernum)
4711 if (vna->vna_next == 0)
4713 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4715 if (vn->vn_next == 0)
4717 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4721 while (vd != NULL) {
4722 if (vd->vd_version != VER_DEF_CURRENT) {
4723 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4724 obj->path, vd->vd_version);
4727 vernum = VER_DEF_IDX(vd->vd_ndx);
4728 if (vernum > maxvernum)
4730 if (vd->vd_next == 0)
4732 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4739 * Store version information in array indexable by version index.
4740 * Verify that object version requirements are satisfied along the
4743 obj->vernum = maxvernum + 1;
4744 obj->vertab = xcalloc(obj->vernum, sizeof(Ver_Entry));
4747 while (vd != NULL) {
4748 if ((vd->vd_flags & VER_FLG_BASE) == 0) {
4749 vernum = VER_DEF_IDX(vd->vd_ndx);
4750 assert(vernum <= maxvernum);
4751 vda = (const Elf_Verdaux *)((char *)vd + vd->vd_aux);
4752 obj->vertab[vernum].hash = vd->vd_hash;
4753 obj->vertab[vernum].name = obj->strtab + vda->vda_name;
4754 obj->vertab[vernum].file = NULL;
4755 obj->vertab[vernum].flags = 0;
4757 if (vd->vd_next == 0)
4759 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4763 while (vn != NULL) {
4764 depobj = locate_dependency(obj, obj->strtab + vn->vn_file);
4767 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4769 if (check_object_provided_version(obj, depobj, vna))
4771 vernum = VER_NEED_IDX(vna->vna_other);
4772 assert(vernum <= maxvernum);
4773 obj->vertab[vernum].hash = vna->vna_hash;
4774 obj->vertab[vernum].name = obj->strtab + vna->vna_name;
4775 obj->vertab[vernum].file = obj->strtab + vn->vn_file;
4776 obj->vertab[vernum].flags = (vna->vna_other & VER_NEED_HIDDEN) ?
4777 VER_INFO_HIDDEN : 0;
4778 if (vna->vna_next == 0)
4780 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4782 if (vn->vn_next == 0)
4784 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4790 rtld_verify_versions(const Objlist *objlist)
4792 Objlist_Entry *entry;
4796 STAILQ_FOREACH(entry, objlist, link) {
4798 * Skip dummy objects or objects that have their version requirements
4801 if (entry->obj->strtab == NULL || entry->obj->vertab != NULL)
4803 if (rtld_verify_object_versions(entry->obj) == -1) {
4805 if (ld_tracing == NULL)
4809 if (rc == 0 || ld_tracing != NULL)
4810 rc = rtld_verify_object_versions(&obj_rtld);
4815 fetch_ventry(const Obj_Entry *obj, unsigned long symnum)
4820 vernum = VER_NDX(obj->versyms[symnum]);
4821 if (vernum >= obj->vernum) {
4822 _rtld_error("%s: symbol %s has wrong verneed value %d",
4823 obj->path, obj->strtab + symnum, vernum);
4824 } else if (obj->vertab[vernum].hash != 0) {
4825 return &obj->vertab[vernum];
4832 _rtld_get_stack_prot(void)
4835 return (stack_prot);
4839 _rtld_is_dlopened(void *arg)
4842 RtldLockState lockstate;
4845 rlock_acquire(rtld_bind_lock, &lockstate);
4848 obj = obj_from_addr(arg);
4850 _rtld_error("No shared object contains address");
4851 lock_release(rtld_bind_lock, &lockstate);
4854 res = obj->dlopened ? 1 : 0;
4855 lock_release(rtld_bind_lock, &lockstate);
4860 map_stacks_exec(RtldLockState *lockstate)
4862 void (*thr_map_stacks_exec)(void);
4864 if ((max_stack_flags & PF_X) == 0 || (stack_prot & PROT_EXEC) != 0)
4866 thr_map_stacks_exec = (void (*)(void))(uintptr_t)
4867 get_program_var_addr("__pthread_map_stacks_exec", lockstate);
4868 if (thr_map_stacks_exec != NULL) {
4869 stack_prot |= PROT_EXEC;
4870 thr_map_stacks_exec();
4875 symlook_init(SymLook *dst, const char *name)
4878 bzero(dst, sizeof(*dst));
4880 dst->hash = elf_hash(name);
4881 dst->hash_gnu = gnu_hash(name);
4885 symlook_init_from_req(SymLook *dst, const SymLook *src)
4888 dst->name = src->name;
4889 dst->hash = src->hash;
4890 dst->hash_gnu = src->hash_gnu;
4891 dst->ventry = src->ventry;
4892 dst->flags = src->flags;
4893 dst->defobj_out = NULL;
4894 dst->sym_out = NULL;
4895 dst->lockstate = src->lockstate;
4899 * Overrides for libc_pic-provided functions.
4903 __getosreldate(void)
4913 oid[1] = KERN_OSRELDATE;
4915 len = sizeof(osrel);
4916 error = sysctl(oid, 2, &osrel, &len, NULL, 0);
4917 if (error == 0 && osrel > 0 && len == sizeof(osrel))
4929 void (*__cleanup)(void);
4930 int __isthreaded = 0;
4931 int _thread_autoinit_dummy_decl = 1;
4934 * No unresolved symbols for rtld.
4937 __pthread_cxa_finalize(struct dl_phdr_info *a)
4942 __stack_chk_fail(void)
4945 _rtld_error("stack overflow detected; terminated");
4948 __weak_reference(__stack_chk_fail, __stack_chk_fail_local);
4954 _rtld_error("buffer overflow detected; terminated");
4959 rtld_strerror(int errnum)
4962 if (errnum < 0 || errnum >= sys_nerr)
4963 return ("Unknown error");
4964 return (sys_errlist[errnum]);