2 * Copyright 1996, 1997, 1998, 1999, 2000 John D. Polstra.
3 * Copyright 2003 Alexander Kabaev <kan@FreeBSD.ORG>.
4 * Copyright 2009-2012 Konstantin Belousov <kib@FreeBSD.ORG>.
5 * Copyright 2012 John Marino <draco@marino.st>.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * Dynamic linker for ELF.
34 * John Polstra <jdp@polstra.com>.
38 #error "GCC is needed to compile this file"
41 #include <sys/param.h>
42 #include <sys/mount.h>
45 #include <sys/sysctl.h>
47 #include <sys/utsname.h>
48 #include <sys/ktrace.h>
64 #include "rtld_printf.h"
68 #define PATH_RTLD "/libexec/ld-elf.so.1"
70 #define PATH_RTLD "/libexec/ld-elf32.so.1"
74 typedef void (*func_ptr_type)();
75 typedef void * (*path_enum_proc) (const char *path, size_t len, void *arg);
78 * Function declarations.
80 static const char *basename(const char *);
81 static void die(void) __dead2;
82 static void digest_dynamic1(Obj_Entry *, int, const Elf_Dyn **,
83 const Elf_Dyn **, const Elf_Dyn **);
84 static void digest_dynamic2(Obj_Entry *, const Elf_Dyn *, const Elf_Dyn *,
86 static void digest_dynamic(Obj_Entry *, int);
87 static Obj_Entry *digest_phdr(const Elf_Phdr *, int, caddr_t, const char *);
88 static Obj_Entry *dlcheck(void *);
89 static Obj_Entry *dlopen_object(const char *name, int fd, Obj_Entry *refobj,
90 int lo_flags, int mode, RtldLockState *lockstate);
91 static Obj_Entry *do_load_object(int, const char *, char *, struct stat *, int);
92 static int do_search_info(const Obj_Entry *obj, int, struct dl_serinfo *);
93 static bool donelist_check(DoneList *, const Obj_Entry *);
94 static void errmsg_restore(char *);
95 static char *errmsg_save(void);
96 static void *fill_search_info(const char *, size_t, void *);
97 static char *find_library(const char *, const Obj_Entry *, int *);
98 static const char *gethints(bool);
99 static void init_dag(Obj_Entry *);
100 static void init_pagesizes(Elf_Auxinfo **aux_info);
101 static void init_rtld(caddr_t, Elf_Auxinfo **);
102 static void initlist_add_neededs(Needed_Entry *, Objlist *);
103 static void initlist_add_objects(Obj_Entry *, Obj_Entry **, Objlist *);
104 static void linkmap_add(Obj_Entry *);
105 static void linkmap_delete(Obj_Entry *);
106 static void load_filtees(Obj_Entry *, int flags, RtldLockState *);
107 static void unload_filtees(Obj_Entry *);
108 static int load_needed_objects(Obj_Entry *, int);
109 static int load_preload_objects(void);
110 static Obj_Entry *load_object(const char *, int fd, const Obj_Entry *, int);
111 static void map_stacks_exec(RtldLockState *);
112 static Obj_Entry *obj_from_addr(const void *);
113 static void objlist_call_fini(Objlist *, Obj_Entry *, RtldLockState *);
114 static void objlist_call_init(Objlist *, RtldLockState *);
115 static void objlist_clear(Objlist *);
116 static Objlist_Entry *objlist_find(Objlist *, const Obj_Entry *);
117 static void objlist_init(Objlist *);
118 static void objlist_push_head(Objlist *, Obj_Entry *);
119 static void objlist_push_tail(Objlist *, Obj_Entry *);
120 static void objlist_put_after(Objlist *, Obj_Entry *, Obj_Entry *);
121 static void objlist_remove(Objlist *, Obj_Entry *);
122 static int parse_libdir(const char *);
123 static void *path_enumerate(const char *, path_enum_proc, void *);
124 static int relocate_object_dag(Obj_Entry *root, bool bind_now,
125 Obj_Entry *rtldobj, int flags, RtldLockState *lockstate);
126 static int relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj,
127 int flags, RtldLockState *lockstate);
128 static int relocate_objects(Obj_Entry *, bool, Obj_Entry *, int,
130 static int resolve_objects_ifunc(Obj_Entry *first, bool bind_now,
131 int flags, RtldLockState *lockstate);
132 static int rtld_dirname(const char *, char *);
133 static int rtld_dirname_abs(const char *, char *);
134 static void *rtld_dlopen(const char *name, int fd, int mode);
135 static void rtld_exit(void);
136 static char *search_library_path(const char *, const char *);
137 static char *search_library_pathfds(const char *, const char *, int *);
138 static const void **get_program_var_addr(const char *, RtldLockState *);
139 static void set_program_var(const char *, const void *);
140 static int symlook_default(SymLook *, const Obj_Entry *refobj);
141 static int symlook_global(SymLook *, DoneList *);
142 static void symlook_init_from_req(SymLook *, const SymLook *);
143 static int symlook_list(SymLook *, const Objlist *, DoneList *);
144 static int symlook_needed(SymLook *, const Needed_Entry *, DoneList *);
145 static int symlook_obj1_sysv(SymLook *, const Obj_Entry *);
146 static int symlook_obj1_gnu(SymLook *, const Obj_Entry *);
147 static void trace_loaded_objects(Obj_Entry *);
148 static void unlink_object(Obj_Entry *);
149 static void unload_object(Obj_Entry *);
150 static void unref_dag(Obj_Entry *);
151 static void ref_dag(Obj_Entry *);
152 static char *origin_subst_one(char *, const char *, const char *, bool);
153 static char *origin_subst(char *, const char *);
154 static void preinit_main(void);
155 static int rtld_verify_versions(const Objlist *);
156 static int rtld_verify_object_versions(Obj_Entry *);
157 static void object_add_name(Obj_Entry *, const char *);
158 static int object_match_name(const Obj_Entry *, const char *);
159 static void ld_utrace_log(int, void *, void *, size_t, int, const char *);
160 static void rtld_fill_dl_phdr_info(const Obj_Entry *obj,
161 struct dl_phdr_info *phdr_info);
162 static uint32_t gnu_hash(const char *);
163 static bool matched_symbol(SymLook *, const Obj_Entry *, Sym_Match_Result *,
164 const unsigned long);
166 void r_debug_state(struct r_debug *, struct link_map *) __noinline;
167 void _r_debug_postinit(struct link_map *) __noinline;
172 static char *error_message; /* Message for dlerror(), or NULL */
173 struct r_debug r_debug; /* for GDB; */
174 static bool libmap_disable; /* Disable libmap */
175 static bool ld_loadfltr; /* Immediate filters processing */
176 static char *libmap_override; /* Maps to use in addition to libmap.conf */
177 static bool trust; /* False for setuid and setgid programs */
178 static bool dangerous_ld_env; /* True if environment variables have been
179 used to affect the libraries loaded */
180 static char *ld_bind_now; /* Environment variable for immediate binding */
181 static char *ld_debug; /* Environment variable for debugging */
182 static char *ld_library_path; /* Environment variable for search path */
183 static char *ld_library_dirs; /* Environment variable for library descriptors */
184 static char *ld_preload; /* Environment variable for libraries to
186 static char *ld_elf_hints_path; /* Environment variable for alternative hints path */
187 static char *ld_tracing; /* Called from ldd to print libs */
188 static char *ld_utrace; /* Use utrace() to log events. */
189 static Obj_Entry *obj_list; /* Head of linked list of shared objects */
190 static Obj_Entry **obj_tail; /* Link field of last object in list */
191 static Obj_Entry *obj_main; /* The main program shared object */
192 static Obj_Entry obj_rtld; /* The dynamic linker shared object */
193 static unsigned int obj_count; /* Number of objects in obj_list */
194 static unsigned int obj_loads; /* Number of objects in obj_list */
196 static Objlist list_global = /* Objects dlopened with RTLD_GLOBAL */
197 STAILQ_HEAD_INITIALIZER(list_global);
198 static Objlist list_main = /* Objects loaded at program startup */
199 STAILQ_HEAD_INITIALIZER(list_main);
200 static Objlist list_fini = /* Objects needing fini() calls */
201 STAILQ_HEAD_INITIALIZER(list_fini);
203 Elf_Sym sym_zero; /* For resolving undefined weak refs. */
205 #define GDB_STATE(s,m) r_debug.r_state = s; r_debug_state(&r_debug,m);
207 extern Elf_Dyn _DYNAMIC;
208 #pragma weak _DYNAMIC
209 #ifndef RTLD_IS_DYNAMIC
210 #define RTLD_IS_DYNAMIC() (&_DYNAMIC != NULL)
213 int npagesizes, osreldate;
216 long __stack_chk_guard[8] = {0, 0, 0, 0, 0, 0, 0, 0};
218 static int stack_prot = PROT_READ | PROT_WRITE | RTLD_DEFAULT_STACK_EXEC;
219 static int max_stack_flags;
222 * Global declarations normally provided by crt1. The dynamic linker is
223 * not built with crt1, so we have to provide them ourselves.
229 * Used to pass argc, argv to init functions.
235 * Globals to control TLS allocation.
237 size_t tls_last_offset; /* Static TLS offset of last module */
238 size_t tls_last_size; /* Static TLS size of last module */
239 size_t tls_static_space; /* Static TLS space allocated */
240 size_t tls_static_max_align;
241 int tls_dtv_generation = 1; /* Used to detect when dtv size changes */
242 int tls_max_index = 1; /* Largest module index allocated */
244 bool ld_library_path_rpath = false;
247 * Fill in a DoneList with an allocation large enough to hold all of
248 * the currently-loaded objects. Keep this as a macro since it calls
249 * alloca and we want that to occur within the scope of the caller.
251 #define donelist_init(dlp) \
252 ((dlp)->objs = alloca(obj_count * sizeof (dlp)->objs[0]), \
253 assert((dlp)->objs != NULL), \
254 (dlp)->num_alloc = obj_count, \
257 #define UTRACE_DLOPEN_START 1
258 #define UTRACE_DLOPEN_STOP 2
259 #define UTRACE_DLCLOSE_START 3
260 #define UTRACE_DLCLOSE_STOP 4
261 #define UTRACE_LOAD_OBJECT 5
262 #define UTRACE_UNLOAD_OBJECT 6
263 #define UTRACE_ADD_RUNDEP 7
264 #define UTRACE_PRELOAD_FINISHED 8
265 #define UTRACE_INIT_CALL 9
266 #define UTRACE_FINI_CALL 10
269 char sig[4]; /* 'RTLD' */
272 void *mapbase; /* Used for 'parent' and 'init/fini' */
274 int refcnt; /* Used for 'mode' */
275 char name[MAXPATHLEN];
278 #define LD_UTRACE(e, h, mb, ms, r, n) do { \
279 if (ld_utrace != NULL) \
280 ld_utrace_log(e, h, mb, ms, r, n); \
284 ld_utrace_log(int event, void *handle, void *mapbase, size_t mapsize,
285 int refcnt, const char *name)
287 struct utrace_rtld ut;
295 ut.mapbase = mapbase;
296 ut.mapsize = mapsize;
298 bzero(ut.name, sizeof(ut.name));
300 strlcpy(ut.name, name, sizeof(ut.name));
301 utrace(&ut, sizeof(ut));
305 * Main entry point for dynamic linking. The first argument is the
306 * stack pointer. The stack is expected to be laid out as described
307 * in the SVR4 ABI specification, Intel 386 Processor Supplement.
308 * Specifically, the stack pointer points to a word containing
309 * ARGC. Following that in the stack is a null-terminated sequence
310 * of pointers to argument strings. Then comes a null-terminated
311 * sequence of pointers to environment strings. Finally, there is a
312 * sequence of "auxiliary vector" entries.
314 * The second argument points to a place to store the dynamic linker's
315 * exit procedure pointer and the third to a place to store the main
318 * The return value is the main program's entry point.
321 _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp)
323 Elf_Auxinfo *aux_info[AT_COUNT];
331 Objlist_Entry *entry;
333 Obj_Entry **preload_tail;
334 Obj_Entry *last_interposer;
336 RtldLockState lockstate;
337 char *library_path_rpath;
342 * On entry, the dynamic linker itself has not been relocated yet.
343 * Be very careful not to reference any global data until after
344 * init_rtld has returned. It is OK to reference file-scope statics
345 * and string constants, and to call static and global functions.
348 /* Find the auxiliary vector on the stack. */
351 sp += argc + 1; /* Skip over arguments and NULL terminator */
353 while (*sp++ != 0) /* Skip over environment, and NULL terminator */
355 aux = (Elf_Auxinfo *) sp;
357 /* Digest the auxiliary vector. */
358 for (i = 0; i < AT_COUNT; i++)
360 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) {
361 if (auxp->a_type < AT_COUNT)
362 aux_info[auxp->a_type] = auxp;
365 /* Initialize and relocate ourselves. */
366 assert(aux_info[AT_BASE] != NULL);
367 init_rtld((caddr_t) aux_info[AT_BASE]->a_un.a_ptr, aux_info);
369 __progname = obj_rtld.path;
370 argv0 = argv[0] != NULL ? argv[0] : "(null)";
375 if (aux_info[AT_CANARY] != NULL &&
376 aux_info[AT_CANARY]->a_un.a_ptr != NULL) {
377 i = aux_info[AT_CANARYLEN]->a_un.a_val;
378 if (i > sizeof(__stack_chk_guard))
379 i = sizeof(__stack_chk_guard);
380 memcpy(__stack_chk_guard, aux_info[AT_CANARY]->a_un.a_ptr, i);
385 len = sizeof(__stack_chk_guard);
386 if (sysctl(mib, 2, __stack_chk_guard, &len, NULL, 0) == -1 ||
387 len != sizeof(__stack_chk_guard)) {
388 /* If sysctl was unsuccessful, use the "terminator canary". */
389 ((unsigned char *)(void *)__stack_chk_guard)[0] = 0;
390 ((unsigned char *)(void *)__stack_chk_guard)[1] = 0;
391 ((unsigned char *)(void *)__stack_chk_guard)[2] = '\n';
392 ((unsigned char *)(void *)__stack_chk_guard)[3] = 255;
396 trust = !issetugid();
398 ld_bind_now = getenv(LD_ "BIND_NOW");
400 * If the process is tainted, then we un-set the dangerous environment
401 * variables. The process will be marked as tainted until setuid(2)
402 * is called. If any child process calls setuid(2) we do not want any
403 * future processes to honor the potentially un-safe variables.
406 if (unsetenv(LD_ "PRELOAD") || unsetenv(LD_ "LIBMAP") ||
407 unsetenv(LD_ "LIBRARY_PATH") || unsetenv(LD_ "LIBRARY_PATH_FDS") ||
408 unsetenv(LD_ "LIBMAP_DISABLE") ||
409 unsetenv(LD_ "DEBUG") || unsetenv(LD_ "ELF_HINTS_PATH") ||
410 unsetenv(LD_ "LOADFLTR") || unsetenv(LD_ "LIBRARY_PATH_RPATH")) {
411 _rtld_error("environment corrupt; aborting");
415 ld_debug = getenv(LD_ "DEBUG");
416 libmap_disable = getenv(LD_ "LIBMAP_DISABLE") != NULL;
417 libmap_override = getenv(LD_ "LIBMAP");
418 ld_library_path = getenv(LD_ "LIBRARY_PATH");
419 ld_library_dirs = getenv(LD_ "LIBRARY_PATH_FDS");
420 ld_preload = getenv(LD_ "PRELOAD");
421 ld_elf_hints_path = getenv(LD_ "ELF_HINTS_PATH");
422 ld_loadfltr = getenv(LD_ "LOADFLTR") != NULL;
423 library_path_rpath = getenv(LD_ "LIBRARY_PATH_RPATH");
424 if (library_path_rpath != NULL) {
425 if (library_path_rpath[0] == 'y' ||
426 library_path_rpath[0] == 'Y' ||
427 library_path_rpath[0] == '1')
428 ld_library_path_rpath = true;
430 ld_library_path_rpath = false;
432 dangerous_ld_env = libmap_disable || (libmap_override != NULL) ||
433 (ld_library_path != NULL) || (ld_preload != NULL) ||
434 (ld_elf_hints_path != NULL) || ld_loadfltr;
435 ld_tracing = getenv(LD_ "TRACE_LOADED_OBJECTS");
436 ld_utrace = getenv(LD_ "UTRACE");
438 if ((ld_elf_hints_path == NULL) || strlen(ld_elf_hints_path) == 0)
439 ld_elf_hints_path = _PATH_ELF_HINTS;
441 if (ld_debug != NULL && *ld_debug != '\0')
443 dbg("%s is initialized, base address = %p", __progname,
444 (caddr_t) aux_info[AT_BASE]->a_un.a_ptr);
445 dbg("RTLD dynamic = %p", obj_rtld.dynamic);
446 dbg("RTLD pltgot = %p", obj_rtld.pltgot);
448 dbg("initializing thread locks");
452 * Load the main program, or process its program header if it is
455 if (aux_info[AT_EXECFD] != NULL) { /* Load the main program. */
456 int fd = aux_info[AT_EXECFD]->a_un.a_val;
457 dbg("loading main program");
458 obj_main = map_object(fd, argv0, NULL);
460 if (obj_main == NULL)
462 max_stack_flags = obj->stack_flags;
463 } else { /* Main program already loaded. */
464 const Elf_Phdr *phdr;
468 dbg("processing main program's program header");
469 assert(aux_info[AT_PHDR] != NULL);
470 phdr = (const Elf_Phdr *) aux_info[AT_PHDR]->a_un.a_ptr;
471 assert(aux_info[AT_PHNUM] != NULL);
472 phnum = aux_info[AT_PHNUM]->a_un.a_val;
473 assert(aux_info[AT_PHENT] != NULL);
474 assert(aux_info[AT_PHENT]->a_un.a_val == sizeof(Elf_Phdr));
475 assert(aux_info[AT_ENTRY] != NULL);
476 entry = (caddr_t) aux_info[AT_ENTRY]->a_un.a_ptr;
477 if ((obj_main = digest_phdr(phdr, phnum, entry, argv0)) == NULL)
481 if (aux_info[AT_EXECPATH] != 0) {
483 char buf[MAXPATHLEN];
485 kexecpath = aux_info[AT_EXECPATH]->a_un.a_ptr;
486 dbg("AT_EXECPATH %p %s", kexecpath, kexecpath);
487 if (kexecpath[0] == '/')
488 obj_main->path = kexecpath;
489 else if (getcwd(buf, sizeof(buf)) == NULL ||
490 strlcat(buf, "/", sizeof(buf)) >= sizeof(buf) ||
491 strlcat(buf, kexecpath, sizeof(buf)) >= sizeof(buf))
492 obj_main->path = xstrdup(argv0);
494 obj_main->path = xstrdup(buf);
496 dbg("No AT_EXECPATH");
497 obj_main->path = xstrdup(argv0);
499 dbg("obj_main path %s", obj_main->path);
500 obj_main->mainprog = true;
502 if (aux_info[AT_STACKPROT] != NULL &&
503 aux_info[AT_STACKPROT]->a_un.a_val != 0)
504 stack_prot = aux_info[AT_STACKPROT]->a_un.a_val;
507 * Get the actual dynamic linker pathname from the executable if
508 * possible. (It should always be possible.) That ensures that
509 * gdb will find the right dynamic linker even if a non-standard
512 if (obj_main->interp != NULL &&
513 strcmp(obj_main->interp, obj_rtld.path) != 0) {
515 obj_rtld.path = xstrdup(obj_main->interp);
516 __progname = obj_rtld.path;
519 digest_dynamic(obj_main, 0);
520 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d",
521 obj_main->path, obj_main->valid_hash_sysv, obj_main->valid_hash_gnu,
522 obj_main->dynsymcount);
524 linkmap_add(obj_main);
525 linkmap_add(&obj_rtld);
527 /* Link the main program into the list of objects. */
528 *obj_tail = obj_main;
529 obj_tail = &obj_main->next;
533 /* Initialize a fake symbol for resolving undefined weak references. */
534 sym_zero.st_info = ELF_ST_INFO(STB_GLOBAL, STT_NOTYPE);
535 sym_zero.st_shndx = SHN_UNDEF;
536 sym_zero.st_value = -(uintptr_t)obj_main->relocbase;
539 libmap_disable = (bool)lm_init(libmap_override);
541 dbg("loading LD_PRELOAD libraries");
542 if (load_preload_objects() == -1)
544 preload_tail = obj_tail;
546 dbg("loading needed objects");
547 if (load_needed_objects(obj_main, 0) == -1)
550 /* Make a list of all objects loaded at startup. */
551 last_interposer = obj_main;
552 for (obj = obj_list; obj != NULL; obj = obj->next) {
553 if (obj->z_interpose && obj != obj_main) {
554 objlist_put_after(&list_main, last_interposer, obj);
555 last_interposer = obj;
557 objlist_push_tail(&list_main, obj);
562 dbg("checking for required versions");
563 if (rtld_verify_versions(&list_main) == -1 && !ld_tracing)
566 if (ld_tracing) { /* We're done */
567 trace_loaded_objects(obj_main);
571 if (getenv(LD_ "DUMP_REL_PRE") != NULL) {
572 dump_relocations(obj_main);
577 * Processing tls relocations requires having the tls offsets
578 * initialized. Prepare offsets before starting initial
579 * relocation processing.
581 dbg("initializing initial thread local storage offsets");
582 STAILQ_FOREACH(entry, &list_main, link) {
584 * Allocate all the initial objects out of the static TLS
585 * block even if they didn't ask for it.
587 allocate_tls_offset(entry->obj);
590 if (relocate_objects(obj_main,
591 ld_bind_now != NULL && *ld_bind_now != '\0',
592 &obj_rtld, SYMLOOK_EARLY, NULL) == -1)
595 dbg("doing copy relocations");
596 if (do_copy_relocations(obj_main) == -1)
599 if (getenv(LD_ "DUMP_REL_POST") != NULL) {
600 dump_relocations(obj_main);
605 * Setup TLS for main thread. This must be done after the
606 * relocations are processed, since tls initialization section
607 * might be the subject for relocations.
609 dbg("initializing initial thread local storage");
610 allocate_initial_tls(obj_list);
612 dbg("initializing key program variables");
613 set_program_var("__progname", argv[0] != NULL ? basename(argv[0]) : "");
614 set_program_var("environ", env);
615 set_program_var("__elf_aux_vector", aux);
617 /* Make a list of init functions to call. */
618 objlist_init(&initlist);
619 initlist_add_objects(obj_list, preload_tail, &initlist);
621 r_debug_state(NULL, &obj_main->linkmap); /* say hello to gdb! */
623 map_stacks_exec(NULL);
625 dbg("resolving ifuncs");
626 if (resolve_objects_ifunc(obj_main,
627 ld_bind_now != NULL && *ld_bind_now != '\0', SYMLOOK_EARLY,
631 if (!obj_main->crt_no_init) {
633 * Make sure we don't call the main program's init and fini
634 * functions for binaries linked with old crt1 which calls
637 obj_main->init = obj_main->fini = (Elf_Addr)NULL;
638 obj_main->preinit_array = obj_main->init_array =
639 obj_main->fini_array = (Elf_Addr)NULL;
642 wlock_acquire(rtld_bind_lock, &lockstate);
643 if (obj_main->crt_no_init)
645 objlist_call_init(&initlist, &lockstate);
646 _r_debug_postinit(&obj_main->linkmap);
647 objlist_clear(&initlist);
648 dbg("loading filtees");
649 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
650 if (ld_loadfltr || obj->z_loadfltr)
651 load_filtees(obj, 0, &lockstate);
653 lock_release(rtld_bind_lock, &lockstate);
655 dbg("transferring control to program entry point = %p", obj_main->entry);
657 /* Return the exit procedure and the program entry point. */
658 *exit_proc = rtld_exit;
660 return (func_ptr_type) obj_main->entry;
664 rtld_resolve_ifunc(const Obj_Entry *obj, const Elf_Sym *def)
669 ptr = (void *)make_function_pointer(def, obj);
670 target = ((Elf_Addr (*)(void))ptr)();
671 return ((void *)target);
675 _rtld_bind(Obj_Entry *obj, Elf_Size reloff)
679 const Obj_Entry *defobj;
682 RtldLockState lockstate;
684 rlock_acquire(rtld_bind_lock, &lockstate);
685 if (sigsetjmp(lockstate.env, 0) != 0)
686 lock_upgrade(rtld_bind_lock, &lockstate);
688 rel = (const Elf_Rel *) ((caddr_t) obj->pltrel + reloff);
690 rel = (const Elf_Rel *) ((caddr_t) obj->pltrela + reloff);
692 where = (Elf_Addr *) (obj->relocbase + rel->r_offset);
693 def = find_symdef(ELF_R_SYM(rel->r_info), obj, &defobj, true, NULL,
697 if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
698 target = (Elf_Addr)rtld_resolve_ifunc(defobj, def);
700 target = (Elf_Addr)(defobj->relocbase + def->st_value);
702 dbg("\"%s\" in \"%s\" ==> %p in \"%s\"",
703 defobj->strtab + def->st_name, basename(obj->path),
704 (void *)target, basename(defobj->path));
707 * Write the new contents for the jmpslot. Note that depending on
708 * architecture, the value which we need to return back to the
709 * lazy binding trampoline may or may not be the target
710 * address. The value returned from reloc_jmpslot() is the value
711 * that the trampoline needs.
713 target = reloc_jmpslot(where, target, defobj, obj, rel);
714 lock_release(rtld_bind_lock, &lockstate);
719 * Error reporting function. Use it like printf. If formats the message
720 * into a buffer, and sets things up so that the next call to dlerror()
721 * will return the message.
724 _rtld_error(const char *fmt, ...)
726 static char buf[512];
730 rtld_vsnprintf(buf, sizeof buf, fmt, ap);
736 * Return a dynamically-allocated copy of the current error message, if any.
741 return error_message == NULL ? NULL : xstrdup(error_message);
745 * Restore the current error message from a copy which was previously saved
746 * by errmsg_save(). The copy is freed.
749 errmsg_restore(char *saved_msg)
751 if (saved_msg == NULL)
752 error_message = NULL;
754 _rtld_error("%s", saved_msg);
760 basename(const char *name)
762 const char *p = strrchr(name, '/');
763 return p != NULL ? p + 1 : name;
766 static struct utsname uts;
769 origin_subst_one(char *real, const char *kw, const char *subst,
772 char *p, *p1, *res, *resp;
773 int subst_len, kw_len, subst_count, old_len, new_len;
778 * First, count the number of the keyword occurences, to
779 * preallocate the final string.
781 for (p = real, subst_count = 0;; p = p1 + kw_len, subst_count++) {
788 * If the keyword is not found, just return.
790 if (subst_count == 0)
791 return (may_free ? real : xstrdup(real));
794 * There is indeed something to substitute. Calculate the
795 * length of the resulting string, and allocate it.
797 subst_len = strlen(subst);
798 old_len = strlen(real);
799 new_len = old_len + (subst_len - kw_len) * subst_count;
800 res = xmalloc(new_len + 1);
803 * Now, execute the substitution loop.
805 for (p = real, resp = res, *resp = '\0';;) {
808 /* Copy the prefix before keyword. */
809 memcpy(resp, p, p1 - p);
811 /* Keyword replacement. */
812 memcpy(resp, subst, subst_len);
820 /* Copy to the end of string and finish. */
828 origin_subst(char *real, const char *origin_path)
830 char *res1, *res2, *res3, *res4;
832 if (uts.sysname[0] == '\0') {
833 if (uname(&uts) != 0) {
834 _rtld_error("utsname failed: %d", errno);
838 res1 = origin_subst_one(real, "$ORIGIN", origin_path, false);
839 res2 = origin_subst_one(res1, "$OSNAME", uts.sysname, true);
840 res3 = origin_subst_one(res2, "$OSREL", uts.release, true);
841 res4 = origin_subst_one(res3, "$PLATFORM", uts.machine, true);
848 const char *msg = dlerror();
852 rtld_fdputstr(STDERR_FILENO, msg);
853 rtld_fdputchar(STDERR_FILENO, '\n');
858 * Process a shared object's DYNAMIC section, and save the important
859 * information in its Obj_Entry structure.
862 digest_dynamic1(Obj_Entry *obj, int early, const Elf_Dyn **dyn_rpath,
863 const Elf_Dyn **dyn_soname, const Elf_Dyn **dyn_runpath)
866 Needed_Entry **needed_tail = &obj->needed;
867 Needed_Entry **needed_filtees_tail = &obj->needed_filtees;
868 Needed_Entry **needed_aux_filtees_tail = &obj->needed_aux_filtees;
869 const Elf_Hashelt *hashtab;
870 const Elf32_Word *hashval;
871 Elf32_Word bkt, nmaskwords;
874 int plttype = DT_REL;
880 obj->bind_now = false;
881 for (dynp = obj->dynamic; dynp->d_tag != DT_NULL; dynp++) {
882 switch (dynp->d_tag) {
885 obj->rel = (const Elf_Rel *) (obj->relocbase + dynp->d_un.d_ptr);
889 obj->relsize = dynp->d_un.d_val;
893 assert(dynp->d_un.d_val == sizeof(Elf_Rel));
897 obj->pltrel = (const Elf_Rel *)
898 (obj->relocbase + dynp->d_un.d_ptr);
902 obj->pltrelsize = dynp->d_un.d_val;
906 obj->rela = (const Elf_Rela *) (obj->relocbase + dynp->d_un.d_ptr);
910 obj->relasize = dynp->d_un.d_val;
914 assert(dynp->d_un.d_val == sizeof(Elf_Rela));
918 plttype = dynp->d_un.d_val;
919 assert(dynp->d_un.d_val == DT_REL || plttype == DT_RELA);
923 obj->symtab = (const Elf_Sym *)
924 (obj->relocbase + dynp->d_un.d_ptr);
928 assert(dynp->d_un.d_val == sizeof(Elf_Sym));
932 obj->strtab = (const char *) (obj->relocbase + dynp->d_un.d_ptr);
936 obj->strsize = dynp->d_un.d_val;
940 obj->verneed = (const Elf_Verneed *) (obj->relocbase +
945 obj->verneednum = dynp->d_un.d_val;
949 obj->verdef = (const Elf_Verdef *) (obj->relocbase +
954 obj->verdefnum = dynp->d_un.d_val;
958 obj->versyms = (const Elf_Versym *)(obj->relocbase +
964 hashtab = (const Elf_Hashelt *)(obj->relocbase +
966 obj->nbuckets = hashtab[0];
967 obj->nchains = hashtab[1];
968 obj->buckets = hashtab + 2;
969 obj->chains = obj->buckets + obj->nbuckets;
970 obj->valid_hash_sysv = obj->nbuckets > 0 && obj->nchains > 0 &&
971 obj->buckets != NULL;
977 hashtab = (const Elf_Hashelt *)(obj->relocbase +
979 obj->nbuckets_gnu = hashtab[0];
980 obj->symndx_gnu = hashtab[1];
981 nmaskwords = hashtab[2];
982 bloom_size32 = (__ELF_WORD_SIZE / 32) * nmaskwords;
983 /* Number of bitmask words is required to be power of 2 */
984 nmw_power2 = ((nmaskwords & (nmaskwords - 1)) == 0);
985 obj->maskwords_bm_gnu = nmaskwords - 1;
986 obj->shift2_gnu = hashtab[3];
987 obj->bloom_gnu = (Elf_Addr *) (hashtab + 4);
988 obj->buckets_gnu = hashtab + 4 + bloom_size32;
989 obj->chain_zero_gnu = obj->buckets_gnu + obj->nbuckets_gnu -
991 obj->valid_hash_gnu = nmw_power2 && obj->nbuckets_gnu > 0 &&
992 obj->buckets_gnu != NULL;
998 Needed_Entry *nep = NEW(Needed_Entry);
999 nep->name = dynp->d_un.d_val;
1004 needed_tail = &nep->next;
1010 Needed_Entry *nep = NEW(Needed_Entry);
1011 nep->name = dynp->d_un.d_val;
1015 *needed_filtees_tail = nep;
1016 needed_filtees_tail = &nep->next;
1022 Needed_Entry *nep = NEW(Needed_Entry);
1023 nep->name = dynp->d_un.d_val;
1027 *needed_aux_filtees_tail = nep;
1028 needed_aux_filtees_tail = &nep->next;
1033 obj->pltgot = (Elf_Addr *) (obj->relocbase + dynp->d_un.d_ptr);
1037 obj->textrel = true;
1041 obj->symbolic = true;
1046 * We have to wait until later to process this, because we
1047 * might not have gotten the address of the string table yet.
1057 *dyn_runpath = dynp;
1061 obj->init = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1064 case DT_PREINIT_ARRAY:
1065 obj->preinit_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1068 case DT_PREINIT_ARRAYSZ:
1069 obj->preinit_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1073 obj->init_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1076 case DT_INIT_ARRAYSZ:
1077 obj->init_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1081 obj->fini = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr);
1085 obj->fini_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr);
1088 case DT_FINI_ARRAYSZ:
1089 obj->fini_array_num = dynp->d_un.d_val / sizeof(Elf_Addr);
1093 * Don't process DT_DEBUG on MIPS as the dynamic section
1094 * is mapped read-only. DT_MIPS_RLD_MAP is used instead.
1099 /* XXX - not implemented yet */
1101 dbg("Filling in DT_DEBUG entry");
1102 ((Elf_Dyn*)dynp)->d_un.d_ptr = (Elf_Addr) &r_debug;
1107 if ((dynp->d_un.d_val & DF_ORIGIN) && trust)
1108 obj->z_origin = true;
1109 if (dynp->d_un.d_val & DF_SYMBOLIC)
1110 obj->symbolic = true;
1111 if (dynp->d_un.d_val & DF_TEXTREL)
1112 obj->textrel = true;
1113 if (dynp->d_un.d_val & DF_BIND_NOW)
1114 obj->bind_now = true;
1115 /*if (dynp->d_un.d_val & DF_STATIC_TLS)
1119 case DT_MIPS_LOCAL_GOTNO:
1120 obj->local_gotno = dynp->d_un.d_val;
1123 case DT_MIPS_SYMTABNO:
1124 obj->symtabno = dynp->d_un.d_val;
1127 case DT_MIPS_GOTSYM:
1128 obj->gotsym = dynp->d_un.d_val;
1131 case DT_MIPS_RLD_MAP:
1132 *((Elf_Addr *)(dynp->d_un.d_ptr)) = (Elf_Addr) &r_debug;
1137 if (dynp->d_un.d_val & DF_1_NOOPEN)
1138 obj->z_noopen = true;
1139 if ((dynp->d_un.d_val & DF_1_ORIGIN) && trust)
1140 obj->z_origin = true;
1141 /*if (dynp->d_un.d_val & DF_1_GLOBAL)
1143 if (dynp->d_un.d_val & DF_1_BIND_NOW)
1144 obj->bind_now = true;
1145 if (dynp->d_un.d_val & DF_1_NODELETE)
1146 obj->z_nodelete = true;
1147 if (dynp->d_un.d_val & DF_1_LOADFLTR)
1148 obj->z_loadfltr = true;
1149 if (dynp->d_un.d_val & DF_1_INTERPOSE)
1150 obj->z_interpose = true;
1151 if (dynp->d_un.d_val & DF_1_NODEFLIB)
1152 obj->z_nodeflib = true;
1157 dbg("Ignoring d_tag %ld = %#lx", (long)dynp->d_tag,
1164 obj->traced = false;
1166 if (plttype == DT_RELA) {
1167 obj->pltrela = (const Elf_Rela *) obj->pltrel;
1169 obj->pltrelasize = obj->pltrelsize;
1170 obj->pltrelsize = 0;
1173 /* Determine size of dynsym table (equal to nchains of sysv hash) */
1174 if (obj->valid_hash_sysv)
1175 obj->dynsymcount = obj->nchains;
1176 else if (obj->valid_hash_gnu) {
1177 obj->dynsymcount = 0;
1178 for (bkt = 0; bkt < obj->nbuckets_gnu; bkt++) {
1179 if (obj->buckets_gnu[bkt] == 0)
1181 hashval = &obj->chain_zero_gnu[obj->buckets_gnu[bkt]];
1184 while ((*hashval++ & 1u) == 0);
1186 obj->dynsymcount += obj->symndx_gnu;
1191 digest_dynamic2(Obj_Entry *obj, const Elf_Dyn *dyn_rpath,
1192 const Elf_Dyn *dyn_soname, const Elf_Dyn *dyn_runpath)
1195 if (obj->z_origin && obj->origin_path == NULL) {
1196 obj->origin_path = xmalloc(PATH_MAX);
1197 if (rtld_dirname_abs(obj->path, obj->origin_path) == -1)
1201 if (dyn_runpath != NULL) {
1202 obj->runpath = (char *)obj->strtab + dyn_runpath->d_un.d_val;
1204 obj->runpath = origin_subst(obj->runpath, obj->origin_path);
1206 else if (dyn_rpath != NULL) {
1207 obj->rpath = (char *)obj->strtab + dyn_rpath->d_un.d_val;
1209 obj->rpath = origin_subst(obj->rpath, obj->origin_path);
1212 if (dyn_soname != NULL)
1213 object_add_name(obj, obj->strtab + dyn_soname->d_un.d_val);
1217 digest_dynamic(Obj_Entry *obj, int early)
1219 const Elf_Dyn *dyn_rpath;
1220 const Elf_Dyn *dyn_soname;
1221 const Elf_Dyn *dyn_runpath;
1223 digest_dynamic1(obj, early, &dyn_rpath, &dyn_soname, &dyn_runpath);
1224 digest_dynamic2(obj, dyn_rpath, dyn_soname, dyn_runpath);
1228 * Process a shared object's program header. This is used only for the
1229 * main program, when the kernel has already loaded the main program
1230 * into memory before calling the dynamic linker. It creates and
1231 * returns an Obj_Entry structure.
1234 digest_phdr(const Elf_Phdr *phdr, int phnum, caddr_t entry, const char *path)
1237 const Elf_Phdr *phlimit = phdr + phnum;
1239 Elf_Addr note_start, note_end;
1243 for (ph = phdr; ph < phlimit; ph++) {
1244 if (ph->p_type != PT_PHDR)
1248 obj->phsize = ph->p_memsz;
1249 obj->relocbase = (caddr_t)phdr - ph->p_vaddr;
1253 obj->stack_flags = PF_X | PF_R | PF_W;
1255 for (ph = phdr; ph < phlimit; ph++) {
1256 switch (ph->p_type) {
1259 obj->interp = (const char *)(ph->p_vaddr + obj->relocbase);
1263 if (nsegs == 0) { /* First load segment */
1264 obj->vaddrbase = trunc_page(ph->p_vaddr);
1265 obj->mapbase = obj->vaddrbase + obj->relocbase;
1266 obj->textsize = round_page(ph->p_vaddr + ph->p_memsz) -
1268 } else { /* Last load segment */
1269 obj->mapsize = round_page(ph->p_vaddr + ph->p_memsz) -
1276 obj->dynamic = (const Elf_Dyn *)(ph->p_vaddr + obj->relocbase);
1281 obj->tlssize = ph->p_memsz;
1282 obj->tlsalign = ph->p_align;
1283 obj->tlsinitsize = ph->p_filesz;
1284 obj->tlsinit = (void*)(ph->p_vaddr + obj->relocbase);
1288 obj->stack_flags = ph->p_flags;
1292 obj->relro_page = obj->relocbase + trunc_page(ph->p_vaddr);
1293 obj->relro_size = round_page(ph->p_memsz);
1297 note_start = (Elf_Addr)obj->relocbase + ph->p_vaddr;
1298 note_end = note_start + ph->p_filesz;
1299 digest_notes(obj, note_start, note_end);
1304 _rtld_error("%s: too few PT_LOAD segments", path);
1313 digest_notes(Obj_Entry *obj, Elf_Addr note_start, Elf_Addr note_end)
1315 const Elf_Note *note;
1316 const char *note_name;
1319 for (note = (const Elf_Note *)note_start; (Elf_Addr)note < note_end;
1320 note = (const Elf_Note *)((const char *)(note + 1) +
1321 roundup2(note->n_namesz, sizeof(Elf32_Addr)) +
1322 roundup2(note->n_descsz, sizeof(Elf32_Addr)))) {
1323 if (note->n_namesz != sizeof(NOTE_FREEBSD_VENDOR) ||
1324 note->n_descsz != sizeof(int32_t))
1326 if (note->n_type != ABI_NOTETYPE &&
1327 note->n_type != CRT_NOINIT_NOTETYPE)
1329 note_name = (const char *)(note + 1);
1330 if (strncmp(NOTE_FREEBSD_VENDOR, note_name,
1331 sizeof(NOTE_FREEBSD_VENDOR)) != 0)
1333 switch (note->n_type) {
1335 /* FreeBSD osrel note */
1336 p = (uintptr_t)(note + 1);
1337 p += roundup2(note->n_namesz, sizeof(Elf32_Addr));
1338 obj->osrel = *(const int32_t *)(p);
1339 dbg("note osrel %d", obj->osrel);
1341 case CRT_NOINIT_NOTETYPE:
1342 /* FreeBSD 'crt does not call init' note */
1343 obj->crt_no_init = true;
1344 dbg("note crt_no_init");
1351 dlcheck(void *handle)
1355 for (obj = obj_list; obj != NULL; obj = obj->next)
1356 if (obj == (Obj_Entry *) handle)
1359 if (obj == NULL || obj->refcount == 0 || obj->dl_refcount == 0) {
1360 _rtld_error("Invalid shared object handle %p", handle);
1367 * If the given object is already in the donelist, return true. Otherwise
1368 * add the object to the list and return false.
1371 donelist_check(DoneList *dlp, const Obj_Entry *obj)
1375 for (i = 0; i < dlp->num_used; i++)
1376 if (dlp->objs[i] == obj)
1379 * Our donelist allocation should always be sufficient. But if
1380 * our threads locking isn't working properly, more shared objects
1381 * could have been loaded since we allocated the list. That should
1382 * never happen, but we'll handle it properly just in case it does.
1384 if (dlp->num_used < dlp->num_alloc)
1385 dlp->objs[dlp->num_used++] = obj;
1390 * Hash function for symbol table lookup. Don't even think about changing
1391 * this. It is specified by the System V ABI.
1394 elf_hash(const char *name)
1396 const unsigned char *p = (const unsigned char *) name;
1397 unsigned long h = 0;
1400 while (*p != '\0') {
1401 h = (h << 4) + *p++;
1402 if ((g = h & 0xf0000000) != 0)
1410 * The GNU hash function is the Daniel J. Bernstein hash clipped to 32 bits
1411 * unsigned in case it's implemented with a wider type.
1414 gnu_hash(const char *s)
1420 for (c = *s; c != '\0'; c = *++s)
1422 return (h & 0xffffffff);
1427 * Find the library with the given name, and return its full pathname.
1428 * The returned string is dynamically allocated. Generates an error
1429 * message and returns NULL if the library cannot be found.
1431 * If the second argument is non-NULL, then it refers to an already-
1432 * loaded shared object, whose library search path will be searched.
1434 * If a library is successfully located via LD_LIBRARY_PATH_FDS, its
1435 * descriptor (which is close-on-exec) will be passed out via the third
1438 * The search order is:
1439 * DT_RPATH in the referencing file _unless_ DT_RUNPATH is present (1)
1440 * DT_RPATH of the main object if DSO without defined DT_RUNPATH (1)
1442 * DT_RUNPATH in the referencing file
1443 * ldconfig hints (if -z nodefaultlib, filter out default library directories
1445 * /lib:/usr/lib _unless_ the referencing file is linked with -z nodefaultlib
1447 * (1) Handled in digest_dynamic2 - rpath left NULL if runpath defined.
1450 find_library(const char *xname, const Obj_Entry *refobj, int *fdp)
1454 bool nodeflib, objgiven;
1456 objgiven = refobj != NULL;
1457 if (strchr(xname, '/') != NULL) { /* Hard coded pathname */
1458 if (xname[0] != '/' && !trust) {
1459 _rtld_error("Absolute pathname required for shared object \"%s\"",
1463 if (objgiven && refobj->z_origin) {
1464 return (origin_subst(__DECONST(char *, xname),
1465 refobj->origin_path));
1467 return (xstrdup(xname));
1471 if (libmap_disable || !objgiven ||
1472 (name = lm_find(refobj->path, xname)) == NULL)
1473 name = (char *)xname;
1475 dbg(" Searching for \"%s\"", name);
1478 * If refobj->rpath != NULL, then refobj->runpath is NULL. Fall
1479 * back to pre-conforming behaviour if user requested so with
1480 * LD_LIBRARY_PATH_RPATH environment variable and ignore -z
1483 if (objgiven && refobj->rpath != NULL && ld_library_path_rpath) {
1484 if ((pathname = search_library_path(name, ld_library_path)) != NULL ||
1486 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1487 (pathname = search_library_pathfds(name, ld_library_dirs, fdp)) != NULL ||
1488 (pathname = search_library_path(name, gethints(false))) != NULL ||
1489 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL)
1492 nodeflib = objgiven ? refobj->z_nodeflib : false;
1494 (pathname = search_library_path(name, refobj->rpath)) != NULL) ||
1495 (objgiven && refobj->runpath == NULL && refobj != obj_main &&
1496 (pathname = search_library_path(name, obj_main->rpath)) != NULL) ||
1497 (pathname = search_library_path(name, ld_library_path)) != NULL ||
1499 (pathname = search_library_path(name, refobj->runpath)) != NULL) ||
1500 (pathname = search_library_pathfds(name, ld_library_dirs, fdp)) != NULL ||
1501 (pathname = search_library_path(name, gethints(nodeflib))) != NULL ||
1502 (objgiven && !nodeflib &&
1503 (pathname = search_library_path(name, STANDARD_LIBRARY_PATH)) != NULL))
1507 if (objgiven && refobj->path != NULL) {
1508 _rtld_error("Shared object \"%s\" not found, required by \"%s\"",
1509 name, basename(refobj->path));
1511 _rtld_error("Shared object \"%s\" not found", name);
1517 * Given a symbol number in a referencing object, find the corresponding
1518 * definition of the symbol. Returns a pointer to the symbol, or NULL if
1519 * no definition was found. Returns a pointer to the Obj_Entry of the
1520 * defining object via the reference parameter DEFOBJ_OUT.
1523 find_symdef(unsigned long symnum, const Obj_Entry *refobj,
1524 const Obj_Entry **defobj_out, int flags, SymCache *cache,
1525 RtldLockState *lockstate)
1529 const Obj_Entry *defobj;
1535 * If we have already found this symbol, get the information from
1538 if (symnum >= refobj->dynsymcount)
1539 return NULL; /* Bad object */
1540 if (cache != NULL && cache[symnum].sym != NULL) {
1541 *defobj_out = cache[symnum].obj;
1542 return cache[symnum].sym;
1545 ref = refobj->symtab + symnum;
1546 name = refobj->strtab + ref->st_name;
1551 * We don't have to do a full scale lookup if the symbol is local.
1552 * We know it will bind to the instance in this load module; to
1553 * which we already have a pointer (ie ref). By not doing a lookup,
1554 * we not only improve performance, but it also avoids unresolvable
1555 * symbols when local symbols are not in the hash table. This has
1556 * been seen with the ia64 toolchain.
1558 if (ELF_ST_BIND(ref->st_info) != STB_LOCAL) {
1559 if (ELF_ST_TYPE(ref->st_info) == STT_SECTION) {
1560 _rtld_error("%s: Bogus symbol table entry %lu", refobj->path,
1563 symlook_init(&req, name);
1565 req.ventry = fetch_ventry(refobj, symnum);
1566 req.lockstate = lockstate;
1567 res = symlook_default(&req, refobj);
1570 defobj = req.defobj_out;
1578 * If we found no definition and the reference is weak, treat the
1579 * symbol as having the value zero.
1581 if (def == NULL && ELF_ST_BIND(ref->st_info) == STB_WEAK) {
1587 *defobj_out = defobj;
1588 /* Record the information in the cache to avoid subsequent lookups. */
1589 if (cache != NULL) {
1590 cache[symnum].sym = def;
1591 cache[symnum].obj = defobj;
1594 if (refobj != &obj_rtld)
1595 _rtld_error("%s: Undefined symbol \"%s\"", refobj->path, name);
1601 * Return the search path from the ldconfig hints file, reading it if
1602 * necessary. If nostdlib is true, then the default search paths are
1603 * not added to result.
1605 * Returns NULL if there are problems with the hints file,
1606 * or if the search path there is empty.
1609 gethints(bool nostdlib)
1611 static char *hints, *filtered_path;
1612 struct elfhints_hdr hdr;
1613 struct fill_search_info_args sargs, hargs;
1614 struct dl_serinfo smeta, hmeta, *SLPinfo, *hintinfo;
1615 struct dl_serpath *SLPpath, *hintpath;
1617 unsigned int SLPndx, hintndx, fndx, fcount;
1622 /* First call, read the hints file */
1623 if (hints == NULL) {
1624 /* Keep from trying again in case the hints file is bad. */
1627 if ((fd = open(ld_elf_hints_path, O_RDONLY | O_CLOEXEC)) == -1)
1629 if (read(fd, &hdr, sizeof hdr) != sizeof hdr ||
1630 hdr.magic != ELFHINTS_MAGIC ||
1635 p = xmalloc(hdr.dirlistlen + 1);
1636 if (lseek(fd, hdr.strtab + hdr.dirlist, SEEK_SET) == -1 ||
1637 read(fd, p, hdr.dirlistlen + 1) !=
1638 (ssize_t)hdr.dirlistlen + 1) {
1648 * If caller agreed to receive list which includes the default
1649 * paths, we are done. Otherwise, if we still did not
1650 * calculated filtered result, do it now.
1653 return (hints[0] != '\0' ? hints : NULL);
1654 if (filtered_path != NULL)
1658 * Obtain the list of all configured search paths, and the
1659 * list of the default paths.
1661 * First estimate the size of the results.
1663 smeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1665 hmeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
1668 sargs.request = RTLD_DI_SERINFOSIZE;
1669 sargs.serinfo = &smeta;
1670 hargs.request = RTLD_DI_SERINFOSIZE;
1671 hargs.serinfo = &hmeta;
1673 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1674 path_enumerate(p, fill_search_info, &hargs);
1676 SLPinfo = xmalloc(smeta.dls_size);
1677 hintinfo = xmalloc(hmeta.dls_size);
1680 * Next fetch both sets of paths.
1682 sargs.request = RTLD_DI_SERINFO;
1683 sargs.serinfo = SLPinfo;
1684 sargs.serpath = &SLPinfo->dls_serpath[0];
1685 sargs.strspace = (char *)&SLPinfo->dls_serpath[smeta.dls_cnt];
1687 hargs.request = RTLD_DI_SERINFO;
1688 hargs.serinfo = hintinfo;
1689 hargs.serpath = &hintinfo->dls_serpath[0];
1690 hargs.strspace = (char *)&hintinfo->dls_serpath[hmeta.dls_cnt];
1692 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs);
1693 path_enumerate(p, fill_search_info, &hargs);
1696 * Now calculate the difference between two sets, by excluding
1697 * standard paths from the full set.
1701 filtered_path = xmalloc(hdr.dirlistlen + 1);
1702 hintpath = &hintinfo->dls_serpath[0];
1703 for (hintndx = 0; hintndx < hmeta.dls_cnt; hintndx++, hintpath++) {
1705 SLPpath = &SLPinfo->dls_serpath[0];
1707 * Check each standard path against current.
1709 for (SLPndx = 0; SLPndx < smeta.dls_cnt; SLPndx++, SLPpath++) {
1710 /* matched, skip the path */
1711 if (!strcmp(hintpath->dls_name, SLPpath->dls_name)) {
1719 * Not matched against any standard path, add the path
1720 * to result. Separate consequtive paths with ':'.
1723 filtered_path[fndx] = ':';
1727 flen = strlen(hintpath->dls_name);
1728 strncpy((filtered_path + fndx), hintpath->dls_name, flen);
1731 filtered_path[fndx] = '\0';
1737 return (filtered_path[0] != '\0' ? filtered_path : NULL);
1741 init_dag(Obj_Entry *root)
1743 const Needed_Entry *needed;
1744 const Objlist_Entry *elm;
1747 if (root->dag_inited)
1749 donelist_init(&donelist);
1751 /* Root object belongs to own DAG. */
1752 objlist_push_tail(&root->dldags, root);
1753 objlist_push_tail(&root->dagmembers, root);
1754 donelist_check(&donelist, root);
1757 * Add dependencies of root object to DAG in breadth order
1758 * by exploiting the fact that each new object get added
1759 * to the tail of the dagmembers list.
1761 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1762 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {
1763 if (needed->obj == NULL || donelist_check(&donelist, needed->obj))
1765 objlist_push_tail(&needed->obj->dldags, root);
1766 objlist_push_tail(&root->dagmembers, needed->obj);
1769 root->dag_inited = true;
1773 process_nodelete(Obj_Entry *root)
1775 const Objlist_Entry *elm;
1778 * Walk over object DAG and process every dependent object that
1779 * is marked as DF_1_NODELETE. They need to grow their own DAG,
1780 * which then should have its reference upped separately.
1782 STAILQ_FOREACH(elm, &root->dagmembers, link) {
1783 if (elm->obj != NULL && elm->obj->z_nodelete &&
1784 !elm->obj->ref_nodel) {
1785 dbg("obj %s nodelete", elm->obj->path);
1788 elm->obj->ref_nodel = true;
1793 * Initialize the dynamic linker. The argument is the address at which
1794 * the dynamic linker has been mapped into memory. The primary task of
1795 * this function is to relocate the dynamic linker.
1798 init_rtld(caddr_t mapbase, Elf_Auxinfo **aux_info)
1800 Obj_Entry objtmp; /* Temporary rtld object */
1801 const Elf_Dyn *dyn_rpath;
1802 const Elf_Dyn *dyn_soname;
1803 const Elf_Dyn *dyn_runpath;
1806 * Conjure up an Obj_Entry structure for the dynamic linker.
1808 * The "path" member can't be initialized yet because string constants
1809 * cannot yet be accessed. Below we will set it correctly.
1811 memset(&objtmp, 0, sizeof(objtmp));
1814 objtmp.mapbase = mapbase;
1816 objtmp.relocbase = mapbase;
1818 if (RTLD_IS_DYNAMIC()) {
1819 objtmp.dynamic = rtld_dynamic(&objtmp);
1820 digest_dynamic1(&objtmp, 1, &dyn_rpath, &dyn_soname, &dyn_runpath);
1821 assert(objtmp.needed == NULL);
1822 #if !defined(__mips__)
1823 /* MIPS has a bogus DT_TEXTREL. */
1824 assert(!objtmp.textrel);
1828 * Temporarily put the dynamic linker entry into the object list, so
1829 * that symbols can be found.
1832 relocate_objects(&objtmp, true, &objtmp, 0, NULL);
1835 /* Initialize the object list. */
1836 obj_tail = &obj_list;
1838 /* Now that non-local variables can be accesses, copy out obj_rtld. */
1839 memcpy(&obj_rtld, &objtmp, sizeof(obj_rtld));
1841 /* The page size is required by the dynamic memory allocator. */
1842 init_pagesizes(aux_info);
1844 if (aux_info[AT_OSRELDATE] != NULL)
1845 osreldate = aux_info[AT_OSRELDATE]->a_un.a_val;
1847 digest_dynamic2(&obj_rtld, dyn_rpath, dyn_soname, dyn_runpath);
1849 /* Replace the path with a dynamically allocated copy. */
1850 obj_rtld.path = xstrdup(PATH_RTLD);
1852 r_debug.r_brk = r_debug_state;
1853 r_debug.r_state = RT_CONSISTENT;
1857 * Retrieve the array of supported page sizes. The kernel provides the page
1858 * sizes in increasing order.
1861 init_pagesizes(Elf_Auxinfo **aux_info)
1863 static size_t psa[MAXPAGESIZES];
1867 if (aux_info[AT_PAGESIZES] != NULL && aux_info[AT_PAGESIZESLEN] !=
1869 size = aux_info[AT_PAGESIZESLEN]->a_un.a_val;
1870 pagesizes = aux_info[AT_PAGESIZES]->a_un.a_ptr;
1873 if (sysctlnametomib("hw.pagesizes", mib, &len) == 0)
1876 /* As a fallback, retrieve the base page size. */
1877 size = sizeof(psa[0]);
1878 if (aux_info[AT_PAGESZ] != NULL) {
1879 psa[0] = aux_info[AT_PAGESZ]->a_un.a_val;
1883 mib[1] = HW_PAGESIZE;
1887 if (sysctl(mib, len, psa, &size, NULL, 0) == -1) {
1888 _rtld_error("sysctl for hw.pagesize(s) failed");
1894 npagesizes = size / sizeof(pagesizes[0]);
1895 /* Discard any invalid entries at the end of the array. */
1896 while (npagesizes > 0 && pagesizes[npagesizes - 1] == 0)
1901 * Add the init functions from a needed object list (and its recursive
1902 * needed objects) to "list". This is not used directly; it is a helper
1903 * function for initlist_add_objects(). The write lock must be held
1904 * when this function is called.
1907 initlist_add_neededs(Needed_Entry *needed, Objlist *list)
1909 /* Recursively process the successor needed objects. */
1910 if (needed->next != NULL)
1911 initlist_add_neededs(needed->next, list);
1913 /* Process the current needed object. */
1914 if (needed->obj != NULL)
1915 initlist_add_objects(needed->obj, &needed->obj->next, list);
1919 * Scan all of the DAGs rooted in the range of objects from "obj" to
1920 * "tail" and add their init functions to "list". This recurses over
1921 * the DAGs and ensure the proper init ordering such that each object's
1922 * needed libraries are initialized before the object itself. At the
1923 * same time, this function adds the objects to the global finalization
1924 * list "list_fini" in the opposite order. The write lock must be
1925 * held when this function is called.
1928 initlist_add_objects(Obj_Entry *obj, Obj_Entry **tail, Objlist *list)
1931 if (obj->init_scanned || obj->init_done)
1933 obj->init_scanned = true;
1935 /* Recursively process the successor objects. */
1936 if (&obj->next != tail)
1937 initlist_add_objects(obj->next, tail, list);
1939 /* Recursively process the needed objects. */
1940 if (obj->needed != NULL)
1941 initlist_add_neededs(obj->needed, list);
1942 if (obj->needed_filtees != NULL)
1943 initlist_add_neededs(obj->needed_filtees, list);
1944 if (obj->needed_aux_filtees != NULL)
1945 initlist_add_neededs(obj->needed_aux_filtees, list);
1947 /* Add the object to the init list. */
1948 if (obj->preinit_array != (Elf_Addr)NULL || obj->init != (Elf_Addr)NULL ||
1949 obj->init_array != (Elf_Addr)NULL)
1950 objlist_push_tail(list, obj);
1952 /* Add the object to the global fini list in the reverse order. */
1953 if ((obj->fini != (Elf_Addr)NULL || obj->fini_array != (Elf_Addr)NULL)
1954 && !obj->on_fini_list) {
1955 objlist_push_head(&list_fini, obj);
1956 obj->on_fini_list = true;
1961 #define FPTR_TARGET(f) ((Elf_Addr) (f))
1965 free_needed_filtees(Needed_Entry *n)
1967 Needed_Entry *needed, *needed1;
1969 for (needed = n; needed != NULL; needed = needed->next) {
1970 if (needed->obj != NULL) {
1971 dlclose(needed->obj);
1975 for (needed = n; needed != NULL; needed = needed1) {
1976 needed1 = needed->next;
1982 unload_filtees(Obj_Entry *obj)
1985 free_needed_filtees(obj->needed_filtees);
1986 obj->needed_filtees = NULL;
1987 free_needed_filtees(obj->needed_aux_filtees);
1988 obj->needed_aux_filtees = NULL;
1989 obj->filtees_loaded = false;
1993 load_filtee1(Obj_Entry *obj, Needed_Entry *needed, int flags,
1994 RtldLockState *lockstate)
1997 for (; needed != NULL; needed = needed->next) {
1998 needed->obj = dlopen_object(obj->strtab + needed->name, -1, obj,
1999 flags, ((ld_loadfltr || obj->z_loadfltr) ? RTLD_NOW : RTLD_LAZY) |
2000 RTLD_LOCAL, lockstate);
2005 load_filtees(Obj_Entry *obj, int flags, RtldLockState *lockstate)
2008 lock_restart_for_upgrade(lockstate);
2009 if (!obj->filtees_loaded) {
2010 load_filtee1(obj, obj->needed_filtees, flags, lockstate);
2011 load_filtee1(obj, obj->needed_aux_filtees, flags, lockstate);
2012 obj->filtees_loaded = true;
2017 process_needed(Obj_Entry *obj, Needed_Entry *needed, int flags)
2021 for (; needed != NULL; needed = needed->next) {
2022 obj1 = needed->obj = load_object(obj->strtab + needed->name, -1, obj,
2023 flags & ~RTLD_LO_NOLOAD);
2024 if (obj1 == NULL && !ld_tracing && (flags & RTLD_LO_FILTEES) == 0)
2031 * Given a shared object, traverse its list of needed objects, and load
2032 * each of them. Returns 0 on success. Generates an error message and
2033 * returns -1 on failure.
2036 load_needed_objects(Obj_Entry *first, int flags)
2040 for (obj = first; obj != NULL; obj = obj->next) {
2041 if (process_needed(obj, obj->needed, flags) == -1)
2048 load_preload_objects(void)
2050 char *p = ld_preload;
2052 static const char delim[] = " \t:;";
2057 p += strspn(p, delim);
2058 while (*p != '\0') {
2059 size_t len = strcspn(p, delim);
2064 obj = load_object(p, -1, NULL, 0);
2066 return -1; /* XXX - cleanup */
2067 obj->z_interpose = true;
2070 p += strspn(p, delim);
2072 LD_UTRACE(UTRACE_PRELOAD_FINISHED, NULL, NULL, 0, 0, NULL);
2077 printable_path(const char *path)
2080 return (path == NULL ? "<unknown>" : path);
2084 * Load a shared object into memory, if it is not already loaded. The
2085 * object may be specified by name or by user-supplied file descriptor
2086 * fd_u. In the later case, the fd_u descriptor is not closed, but its
2089 * Returns a pointer to the Obj_Entry for the object. Returns NULL
2093 load_object(const char *name, int fd_u, const Obj_Entry *refobj, int flags)
2102 for (obj = obj_list->next; obj != NULL; obj = obj->next) {
2103 if (object_match_name(obj, name))
2107 path = find_library(name, refobj, &fd);
2115 * search_library_pathfds() opens a fresh file descriptor for the
2116 * library, so there is no need to dup().
2118 } else if (fd_u == -1) {
2120 * If we didn't find a match by pathname, or the name is not
2121 * supplied, open the file and check again by device and inode.
2122 * This avoids false mismatches caused by multiple links or ".."
2125 * To avoid a race, we open the file and use fstat() rather than
2128 if ((fd = open(path, O_RDONLY | O_CLOEXEC)) == -1) {
2129 _rtld_error("Cannot open \"%s\"", path);
2134 fd = fcntl(fd_u, F_DUPFD_CLOEXEC, 0);
2136 _rtld_error("Cannot dup fd");
2141 if (fstat(fd, &sb) == -1) {
2142 _rtld_error("Cannot fstat \"%s\"", printable_path(path));
2147 for (obj = obj_list->next; obj != NULL; obj = obj->next)
2148 if (obj->ino == sb.st_ino && obj->dev == sb.st_dev)
2150 if (obj != NULL && name != NULL) {
2151 object_add_name(obj, name);
2156 if (flags & RTLD_LO_NOLOAD) {
2162 /* First use of this object, so we must map it in */
2163 obj = do_load_object(fd, name, path, &sb, flags);
2172 do_load_object(int fd, const char *name, char *path, struct stat *sbp,
2179 * but first, make sure that environment variables haven't been
2180 * used to circumvent the noexec flag on a filesystem.
2182 if (dangerous_ld_env) {
2183 if (fstatfs(fd, &fs) != 0) {
2184 _rtld_error("Cannot fstatfs \"%s\"", printable_path(path));
2187 if (fs.f_flags & MNT_NOEXEC) {
2188 _rtld_error("Cannot execute objects on %s\n", fs.f_mntonname);
2192 dbg("loading \"%s\"", printable_path(path));
2193 obj = map_object(fd, printable_path(path), sbp);
2198 * If DT_SONAME is present in the object, digest_dynamic2 already
2199 * added it to the object names.
2202 object_add_name(obj, name);
2204 digest_dynamic(obj, 0);
2205 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d", obj->path,
2206 obj->valid_hash_sysv, obj->valid_hash_gnu, obj->dynsymcount);
2207 if (obj->z_noopen && (flags & (RTLD_LO_DLOPEN | RTLD_LO_TRACE)) ==
2209 dbg("refusing to load non-loadable \"%s\"", obj->path);
2210 _rtld_error("Cannot dlopen non-loadable %s", obj->path);
2211 munmap(obj->mapbase, obj->mapsize);
2217 obj_tail = &obj->next;
2220 linkmap_add(obj); /* for GDB & dlinfo() */
2221 max_stack_flags |= obj->stack_flags;
2223 dbg(" %p .. %p: %s", obj->mapbase,
2224 obj->mapbase + obj->mapsize - 1, obj->path);
2226 dbg(" WARNING: %s has impure text", obj->path);
2227 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
2234 obj_from_addr(const void *addr)
2238 for (obj = obj_list; obj != NULL; obj = obj->next) {
2239 if (addr < (void *) obj->mapbase)
2241 if (addr < (void *) (obj->mapbase + obj->mapsize))
2250 Elf_Addr *preinit_addr;
2253 preinit_addr = (Elf_Addr *)obj_main->preinit_array;
2254 if (preinit_addr == NULL)
2257 for (index = 0; index < obj_main->preinit_array_num; index++) {
2258 if (preinit_addr[index] != 0 && preinit_addr[index] != 1) {
2259 dbg("calling preinit function for %s at %p", obj_main->path,
2260 (void *)preinit_addr[index]);
2261 LD_UTRACE(UTRACE_INIT_CALL, obj_main, (void *)preinit_addr[index],
2262 0, 0, obj_main->path);
2263 call_init_pointer(obj_main, preinit_addr[index]);
2269 * Call the finalization functions for each of the objects in "list"
2270 * belonging to the DAG of "root" and referenced once. If NULL "root"
2271 * is specified, every finalization function will be called regardless
2272 * of the reference count and the list elements won't be freed. All of
2273 * the objects are expected to have non-NULL fini functions.
2276 objlist_call_fini(Objlist *list, Obj_Entry *root, RtldLockState *lockstate)
2280 Elf_Addr *fini_addr;
2283 assert(root == NULL || root->refcount == 1);
2286 * Preserve the current error message since a fini function might
2287 * call into the dynamic linker and overwrite it.
2289 saved_msg = errmsg_save();
2291 STAILQ_FOREACH(elm, list, link) {
2292 if (root != NULL && (elm->obj->refcount != 1 ||
2293 objlist_find(&root->dagmembers, elm->obj) == NULL))
2295 /* Remove object from fini list to prevent recursive invocation. */
2296 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2298 * XXX: If a dlopen() call references an object while the
2299 * fini function is in progress, we might end up trying to
2300 * unload the referenced object in dlclose() or the object
2301 * won't be unloaded although its fini function has been
2304 lock_release(rtld_bind_lock, lockstate);
2307 * It is legal to have both DT_FINI and DT_FINI_ARRAY defined.
2308 * When this happens, DT_FINI_ARRAY is processed first.
2310 fini_addr = (Elf_Addr *)elm->obj->fini_array;
2311 if (fini_addr != NULL && elm->obj->fini_array_num > 0) {
2312 for (index = elm->obj->fini_array_num - 1; index >= 0;
2314 if (fini_addr[index] != 0 && fini_addr[index] != 1) {
2315 dbg("calling fini function for %s at %p",
2316 elm->obj->path, (void *)fini_addr[index]);
2317 LD_UTRACE(UTRACE_FINI_CALL, elm->obj,
2318 (void *)fini_addr[index], 0, 0, elm->obj->path);
2319 call_initfini_pointer(elm->obj, fini_addr[index]);
2323 if (elm->obj->fini != (Elf_Addr)NULL) {
2324 dbg("calling fini function for %s at %p", elm->obj->path,
2325 (void *)elm->obj->fini);
2326 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini,
2327 0, 0, elm->obj->path);
2328 call_initfini_pointer(elm->obj, elm->obj->fini);
2330 wlock_acquire(rtld_bind_lock, lockstate);
2331 /* No need to free anything if process is going down. */
2335 * We must restart the list traversal after every fini call
2336 * because a dlclose() call from the fini function or from
2337 * another thread might have modified the reference counts.
2341 } while (elm != NULL);
2342 errmsg_restore(saved_msg);
2346 * Call the initialization functions for each of the objects in
2347 * "list". All of the objects are expected to have non-NULL init
2351 objlist_call_init(Objlist *list, RtldLockState *lockstate)
2356 Elf_Addr *init_addr;
2360 * Clean init_scanned flag so that objects can be rechecked and
2361 * possibly initialized earlier if any of vectors called below
2362 * cause the change by using dlopen.
2364 for (obj = obj_list; obj != NULL; obj = obj->next)
2365 obj->init_scanned = false;
2368 * Preserve the current error message since an init function might
2369 * call into the dynamic linker and overwrite it.
2371 saved_msg = errmsg_save();
2372 STAILQ_FOREACH(elm, list, link) {
2373 if (elm->obj->init_done) /* Initialized early. */
2376 * Race: other thread might try to use this object before current
2377 * one completes the initilization. Not much can be done here
2378 * without better locking.
2380 elm->obj->init_done = true;
2381 lock_release(rtld_bind_lock, lockstate);
2384 * It is legal to have both DT_INIT and DT_INIT_ARRAY defined.
2385 * When this happens, DT_INIT is processed first.
2387 if (elm->obj->init != (Elf_Addr)NULL) {
2388 dbg("calling init function for %s at %p", elm->obj->path,
2389 (void *)elm->obj->init);
2390 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init,
2391 0, 0, elm->obj->path);
2392 call_initfini_pointer(elm->obj, elm->obj->init);
2394 init_addr = (Elf_Addr *)elm->obj->init_array;
2395 if (init_addr != NULL) {
2396 for (index = 0; index < elm->obj->init_array_num; index++) {
2397 if (init_addr[index] != 0 && init_addr[index] != 1) {
2398 dbg("calling init function for %s at %p", elm->obj->path,
2399 (void *)init_addr[index]);
2400 LD_UTRACE(UTRACE_INIT_CALL, elm->obj,
2401 (void *)init_addr[index], 0, 0, elm->obj->path);
2402 call_init_pointer(elm->obj, init_addr[index]);
2406 wlock_acquire(rtld_bind_lock, lockstate);
2408 errmsg_restore(saved_msg);
2412 objlist_clear(Objlist *list)
2416 while (!STAILQ_EMPTY(list)) {
2417 elm = STAILQ_FIRST(list);
2418 STAILQ_REMOVE_HEAD(list, link);
2423 static Objlist_Entry *
2424 objlist_find(Objlist *list, const Obj_Entry *obj)
2428 STAILQ_FOREACH(elm, list, link)
2429 if (elm->obj == obj)
2435 objlist_init(Objlist *list)
2441 objlist_push_head(Objlist *list, Obj_Entry *obj)
2445 elm = NEW(Objlist_Entry);
2447 STAILQ_INSERT_HEAD(list, elm, link);
2451 objlist_push_tail(Objlist *list, Obj_Entry *obj)
2455 elm = NEW(Objlist_Entry);
2457 STAILQ_INSERT_TAIL(list, elm, link);
2461 objlist_put_after(Objlist *list, Obj_Entry *listobj, Obj_Entry *obj)
2463 Objlist_Entry *elm, *listelm;
2465 STAILQ_FOREACH(listelm, list, link) {
2466 if (listelm->obj == listobj)
2469 elm = NEW(Objlist_Entry);
2471 if (listelm != NULL)
2472 STAILQ_INSERT_AFTER(list, listelm, elm, link);
2474 STAILQ_INSERT_TAIL(list, elm, link);
2478 objlist_remove(Objlist *list, Obj_Entry *obj)
2482 if ((elm = objlist_find(list, obj)) != NULL) {
2483 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
2489 * Relocate dag rooted in the specified object.
2490 * Returns 0 on success, or -1 on failure.
2494 relocate_object_dag(Obj_Entry *root, bool bind_now, Obj_Entry *rtldobj,
2495 int flags, RtldLockState *lockstate)
2501 STAILQ_FOREACH(elm, &root->dagmembers, link) {
2502 error = relocate_object(elm->obj, bind_now, rtldobj, flags,
2511 * Relocate single object.
2512 * Returns 0 on success, or -1 on failure.
2515 relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj,
2516 int flags, RtldLockState *lockstate)
2521 obj->relocated = true;
2523 dbg("relocating \"%s\"", obj->path);
2525 if (obj->symtab == NULL || obj->strtab == NULL ||
2526 !(obj->valid_hash_sysv || obj->valid_hash_gnu)) {
2527 _rtld_error("%s: Shared object has no run-time symbol table",
2533 /* There are relocations to the write-protected text segment. */
2534 if (mprotect(obj->mapbase, obj->textsize,
2535 PROT_READ|PROT_WRITE|PROT_EXEC) == -1) {
2536 _rtld_error("%s: Cannot write-enable text segment: %s",
2537 obj->path, rtld_strerror(errno));
2542 /* Process the non-PLT relocations. */
2543 if (reloc_non_plt(obj, rtldobj, flags, lockstate))
2546 if (obj->textrel) { /* Re-protected the text segment. */
2547 if (mprotect(obj->mapbase, obj->textsize,
2548 PROT_READ|PROT_EXEC) == -1) {
2549 _rtld_error("%s: Cannot write-protect text segment: %s",
2550 obj->path, rtld_strerror(errno));
2556 /* Set the special PLT or GOT entries. */
2559 /* Process the PLT relocations. */
2560 if (reloc_plt(obj) == -1)
2562 /* Relocate the jump slots if we are doing immediate binding. */
2563 if (obj->bind_now || bind_now)
2564 if (reloc_jmpslots(obj, flags, lockstate) == -1)
2567 if (obj->relro_size > 0) {
2568 if (mprotect(obj->relro_page, obj->relro_size,
2570 _rtld_error("%s: Cannot enforce relro protection: %s",
2571 obj->path, rtld_strerror(errno));
2577 * Set up the magic number and version in the Obj_Entry. These
2578 * were checked in the crt1.o from the original ElfKit, so we
2579 * set them for backward compatibility.
2581 obj->magic = RTLD_MAGIC;
2582 obj->version = RTLD_VERSION;
2588 * Relocate newly-loaded shared objects. The argument is a pointer to
2589 * the Obj_Entry for the first such object. All objects from the first
2590 * to the end of the list of objects are relocated. Returns 0 on success,
2594 relocate_objects(Obj_Entry *first, bool bind_now, Obj_Entry *rtldobj,
2595 int flags, RtldLockState *lockstate)
2600 for (error = 0, obj = first; obj != NULL; obj = obj->next) {
2601 error = relocate_object(obj, bind_now, rtldobj, flags,
2610 * The handling of R_MACHINE_IRELATIVE relocations and jumpslots
2611 * referencing STT_GNU_IFUNC symbols is postponed till the other
2612 * relocations are done. The indirect functions specified as
2613 * ifunc are allowed to call other symbols, so we need to have
2614 * objects relocated before asking for resolution from indirects.
2616 * The R_MACHINE_IRELATIVE slots are resolved in greedy fashion,
2617 * instead of the usual lazy handling of PLT slots. It is
2618 * consistent with how GNU does it.
2621 resolve_object_ifunc(Obj_Entry *obj, bool bind_now, int flags,
2622 RtldLockState *lockstate)
2624 if (obj->irelative && reloc_iresolve(obj, lockstate) == -1)
2626 if ((obj->bind_now || bind_now) && obj->gnu_ifunc &&
2627 reloc_gnu_ifunc(obj, flags, lockstate) == -1)
2633 resolve_objects_ifunc(Obj_Entry *first, bool bind_now, int flags,
2634 RtldLockState *lockstate)
2638 for (obj = first; obj != NULL; obj = obj->next) {
2639 if (resolve_object_ifunc(obj, bind_now, flags, lockstate) == -1)
2646 initlist_objects_ifunc(Objlist *list, bool bind_now, int flags,
2647 RtldLockState *lockstate)
2651 STAILQ_FOREACH(elm, list, link) {
2652 if (resolve_object_ifunc(elm->obj, bind_now, flags,
2660 * Cleanup procedure. It will be called (by the atexit mechanism) just
2661 * before the process exits.
2666 RtldLockState lockstate;
2668 wlock_acquire(rtld_bind_lock, &lockstate);
2670 objlist_call_fini(&list_fini, NULL, &lockstate);
2671 /* No need to remove the items from the list, since we are exiting. */
2672 if (!libmap_disable)
2674 lock_release(rtld_bind_lock, &lockstate);
2678 * Iterate over a search path, translate each element, and invoke the
2679 * callback on the result.
2682 path_enumerate(const char *path, path_enum_proc callback, void *arg)
2688 path += strspn(path, ":;");
2689 while (*path != '\0') {
2693 len = strcspn(path, ":;");
2694 trans = lm_findn(NULL, path, len);
2696 res = callback(trans, strlen(trans), arg);
2698 res = callback(path, len, arg);
2704 path += strspn(path, ":;");
2710 struct try_library_args {
2718 try_library_path(const char *dir, size_t dirlen, void *param)
2720 struct try_library_args *arg;
2723 if (*dir == '/' || trust) {
2726 if (dirlen + 1 + arg->namelen + 1 > arg->buflen)
2729 pathname = arg->buffer;
2730 strncpy(pathname, dir, dirlen);
2731 pathname[dirlen] = '/';
2732 strcpy(pathname + dirlen + 1, arg->name);
2734 dbg(" Trying \"%s\"", pathname);
2735 if (access(pathname, F_OK) == 0) { /* We found it */
2736 pathname = xmalloc(dirlen + 1 + arg->namelen + 1);
2737 strcpy(pathname, arg->buffer);
2745 search_library_path(const char *name, const char *path)
2748 struct try_library_args arg;
2754 arg.namelen = strlen(name);
2755 arg.buffer = xmalloc(PATH_MAX);
2756 arg.buflen = PATH_MAX;
2758 p = path_enumerate(path, try_library_path, &arg);
2767 * Finds the library with the given name using the directory descriptors
2768 * listed in the LD_LIBRARY_PATH_FDS environment variable.
2770 * Returns a freshly-opened close-on-exec file descriptor for the library,
2771 * or -1 if the library cannot be found.
2774 search_library_pathfds(const char *name, const char *path, int *fdp)
2776 char *envcopy, *fdstr, *found, *last_token;
2780 dbg("%s('%s', '%s', fdp)\n", __func__, name, path);
2782 /* Don't load from user-specified libdirs into setuid binaries. */
2786 /* We can't do anything if LD_LIBRARY_PATH_FDS isn't set. */
2790 /* LD_LIBRARY_PATH_FDS only works with relative paths. */
2791 if (name[0] == '/') {
2792 dbg("Absolute path (%s) passed to %s", name, __func__);
2797 * Use strtok_r() to walk the FD:FD:FD list. This requires a local
2798 * copy of the path, as strtok_r rewrites separator tokens
2802 envcopy = xstrdup(path);
2803 for (fdstr = strtok_r(envcopy, ":", &last_token); fdstr != NULL;
2804 fdstr = strtok_r(NULL, ":", &last_token)) {
2805 dirfd = parse_libdir(fdstr);
2808 fd = openat(dirfd, name, O_RDONLY | O_CLOEXEC);
2811 len = strlen(fdstr) + strlen(name) + 3;
2812 found = xmalloc(len);
2813 if (rtld_snprintf(found, len, "#%d/%s", dirfd, name) < 0) {
2814 _rtld_error("error generating '%d/%s'",
2818 dbg("open('%s') => %d", found, fd);
2829 dlclose(void *handle)
2832 RtldLockState lockstate;
2834 wlock_acquire(rtld_bind_lock, &lockstate);
2835 root = dlcheck(handle);
2837 lock_release(rtld_bind_lock, &lockstate);
2840 LD_UTRACE(UTRACE_DLCLOSE_START, handle, NULL, 0, root->dl_refcount,
2843 /* Unreference the object and its dependencies. */
2844 root->dl_refcount--;
2846 if (root->refcount == 1) {
2848 * The object will be no longer referenced, so we must unload it.
2849 * First, call the fini functions.
2851 objlist_call_fini(&list_fini, root, &lockstate);
2855 /* Finish cleaning up the newly-unreferenced objects. */
2856 GDB_STATE(RT_DELETE,&root->linkmap);
2857 unload_object(root);
2858 GDB_STATE(RT_CONSISTENT,NULL);
2862 LD_UTRACE(UTRACE_DLCLOSE_STOP, handle, NULL, 0, 0, NULL);
2863 lock_release(rtld_bind_lock, &lockstate);
2870 char *msg = error_message;
2871 error_message = NULL;
2876 * This function is deprecated and has no effect.
2879 dllockinit(void *context,
2880 void *(*lock_create)(void *context),
2881 void (*rlock_acquire)(void *lock),
2882 void (*wlock_acquire)(void *lock),
2883 void (*lock_release)(void *lock),
2884 void (*lock_destroy)(void *lock),
2885 void (*context_destroy)(void *context))
2887 static void *cur_context;
2888 static void (*cur_context_destroy)(void *);
2890 /* Just destroy the context from the previous call, if necessary. */
2891 if (cur_context_destroy != NULL)
2892 cur_context_destroy(cur_context);
2893 cur_context = context;
2894 cur_context_destroy = context_destroy;
2898 dlopen(const char *name, int mode)
2901 return (rtld_dlopen(name, -1, mode));
2905 fdlopen(int fd, int mode)
2908 return (rtld_dlopen(NULL, fd, mode));
2912 rtld_dlopen(const char *name, int fd, int mode)
2914 RtldLockState lockstate;
2917 LD_UTRACE(UTRACE_DLOPEN_START, NULL, NULL, 0, mode, name);
2918 ld_tracing = (mode & RTLD_TRACE) == 0 ? NULL : "1";
2919 if (ld_tracing != NULL) {
2920 rlock_acquire(rtld_bind_lock, &lockstate);
2921 if (sigsetjmp(lockstate.env, 0) != 0)
2922 lock_upgrade(rtld_bind_lock, &lockstate);
2923 environ = (char **)*get_program_var_addr("environ", &lockstate);
2924 lock_release(rtld_bind_lock, &lockstate);
2926 lo_flags = RTLD_LO_DLOPEN;
2927 if (mode & RTLD_NODELETE)
2928 lo_flags |= RTLD_LO_NODELETE;
2929 if (mode & RTLD_NOLOAD)
2930 lo_flags |= RTLD_LO_NOLOAD;
2931 if (ld_tracing != NULL)
2932 lo_flags |= RTLD_LO_TRACE;
2934 return (dlopen_object(name, fd, obj_main, lo_flags,
2935 mode & (RTLD_MODEMASK | RTLD_GLOBAL), NULL));
2939 dlopen_cleanup(Obj_Entry *obj)
2944 if (obj->refcount == 0)
2949 dlopen_object(const char *name, int fd, Obj_Entry *refobj, int lo_flags,
2950 int mode, RtldLockState *lockstate)
2952 Obj_Entry **old_obj_tail;
2955 RtldLockState mlockstate;
2958 objlist_init(&initlist);
2960 if (lockstate == NULL && !(lo_flags & RTLD_LO_EARLY)) {
2961 wlock_acquire(rtld_bind_lock, &mlockstate);
2962 lockstate = &mlockstate;
2964 GDB_STATE(RT_ADD,NULL);
2966 old_obj_tail = obj_tail;
2968 if (name == NULL && fd == -1) {
2972 obj = load_object(name, fd, refobj, lo_flags);
2977 if (mode & RTLD_GLOBAL && objlist_find(&list_global, obj) == NULL)
2978 objlist_push_tail(&list_global, obj);
2979 if (*old_obj_tail != NULL) { /* We loaded something new. */
2980 assert(*old_obj_tail == obj);
2981 result = load_needed_objects(obj,
2982 lo_flags & (RTLD_LO_DLOPEN | RTLD_LO_EARLY));
2986 result = rtld_verify_versions(&obj->dagmembers);
2987 if (result != -1 && ld_tracing)
2989 if (result == -1 || relocate_object_dag(obj,
2990 (mode & RTLD_MODEMASK) == RTLD_NOW, &obj_rtld,
2991 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
2993 dlopen_cleanup(obj);
2995 } else if (lo_flags & RTLD_LO_EARLY) {
2997 * Do not call the init functions for early loaded
2998 * filtees. The image is still not initialized enough
3001 * Our object is found by the global object list and
3002 * will be ordered among all init calls done right
3003 * before transferring control to main.
3006 /* Make list of init functions to call. */
3007 initlist_add_objects(obj, &obj->next, &initlist);
3010 * Process all no_delete objects here, given them own
3011 * DAGs to prevent their dependencies from being unloaded.
3012 * This has to be done after we have loaded all of the
3013 * dependencies, so that we do not miss any.
3016 process_nodelete(obj);
3019 * Bump the reference counts for objects on this DAG. If
3020 * this is the first dlopen() call for the object that was
3021 * already loaded as a dependency, initialize the dag
3027 if ((lo_flags & RTLD_LO_TRACE) != 0)
3030 if (obj != NULL && ((lo_flags & RTLD_LO_NODELETE) != 0 ||
3031 obj->z_nodelete) && !obj->ref_nodel) {
3032 dbg("obj %s nodelete", obj->path);
3034 obj->z_nodelete = obj->ref_nodel = true;
3038 LD_UTRACE(UTRACE_DLOPEN_STOP, obj, NULL, 0, obj ? obj->dl_refcount : 0,
3040 GDB_STATE(RT_CONSISTENT,obj ? &obj->linkmap : NULL);
3042 if (!(lo_flags & RTLD_LO_EARLY)) {
3043 map_stacks_exec(lockstate);
3046 if (initlist_objects_ifunc(&initlist, (mode & RTLD_MODEMASK) == RTLD_NOW,
3047 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0,
3049 objlist_clear(&initlist);
3050 dlopen_cleanup(obj);
3051 if (lockstate == &mlockstate)
3052 lock_release(rtld_bind_lock, lockstate);
3056 if (!(lo_flags & RTLD_LO_EARLY)) {
3057 /* Call the init functions. */
3058 objlist_call_init(&initlist, lockstate);
3060 objlist_clear(&initlist);
3061 if (lockstate == &mlockstate)
3062 lock_release(rtld_bind_lock, lockstate);
3065 trace_loaded_objects(obj);
3066 if (lockstate == &mlockstate)
3067 lock_release(rtld_bind_lock, lockstate);
3072 do_dlsym(void *handle, const char *name, void *retaddr, const Ver_Entry *ve,
3076 const Obj_Entry *obj, *defobj;
3079 RtldLockState lockstate;
3087 symlook_init(&req, name);
3089 req.flags = flags | SYMLOOK_IN_PLT;
3090 req.lockstate = &lockstate;
3092 rlock_acquire(rtld_bind_lock, &lockstate);
3093 if (sigsetjmp(lockstate.env, 0) != 0)
3094 lock_upgrade(rtld_bind_lock, &lockstate);
3095 if (handle == NULL || handle == RTLD_NEXT ||
3096 handle == RTLD_DEFAULT || handle == RTLD_SELF) {
3098 if ((obj = obj_from_addr(retaddr)) == NULL) {
3099 _rtld_error("Cannot determine caller's shared object");
3100 lock_release(rtld_bind_lock, &lockstate);
3103 if (handle == NULL) { /* Just the caller's shared object. */
3104 res = symlook_obj(&req, obj);
3107 defobj = req.defobj_out;
3109 } else if (handle == RTLD_NEXT || /* Objects after caller's */
3110 handle == RTLD_SELF) { /* ... caller included */
3111 if (handle == RTLD_NEXT)
3113 for (; obj != NULL; obj = obj->next) {
3114 res = symlook_obj(&req, obj);
3117 ELF_ST_BIND(req.sym_out->st_info) != STB_WEAK) {
3119 defobj = req.defobj_out;
3120 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
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;
3138 assert(handle == RTLD_DEFAULT);
3139 res = symlook_default(&req, obj);
3141 defobj = req.defobj_out;
3146 if ((obj = dlcheck(handle)) == NULL) {
3147 lock_release(rtld_bind_lock, &lockstate);
3151 donelist_init(&donelist);
3152 if (obj->mainprog) {
3153 /* Handle obtained by dlopen(NULL, ...) implies global scope. */
3154 res = symlook_global(&req, &donelist);
3157 defobj = req.defobj_out;
3160 * Search the dynamic linker itself, and possibly resolve the
3161 * symbol from there. This is how the application links to
3162 * dynamic linker services such as dlopen.
3164 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) {
3165 res = symlook_obj(&req, &obj_rtld);
3168 defobj = req.defobj_out;
3173 /* Search the whole DAG rooted at the given object. */
3174 res = symlook_list(&req, &obj->dagmembers, &donelist);
3177 defobj = req.defobj_out;
3183 lock_release(rtld_bind_lock, &lockstate);
3186 * The value required by the caller is derived from the value
3187 * of the symbol. For the ia64 architecture, we need to
3188 * construct a function descriptor which the caller can use to
3189 * call the function with the right 'gp' value. For other
3190 * architectures and for non-functions, the value is simply
3191 * the relocated value of the symbol.
3193 if (ELF_ST_TYPE(def->st_info) == STT_FUNC)
3194 return (make_function_pointer(def, defobj));
3195 else if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC)
3196 return (rtld_resolve_ifunc(defobj, def));
3197 else if (ELF_ST_TYPE(def->st_info) == STT_TLS) {
3199 return (__tls_get_addr(defobj->tlsindex, def->st_value));
3201 ti.ti_module = defobj->tlsindex;
3202 ti.ti_offset = def->st_value;
3203 return (__tls_get_addr(&ti));
3206 return (defobj->relocbase + def->st_value);
3209 _rtld_error("Undefined symbol \"%s\"", name);
3210 lock_release(rtld_bind_lock, &lockstate);
3215 dlsym(void *handle, const char *name)
3217 return do_dlsym(handle, name, __builtin_return_address(0), NULL,
3222 dlfunc(void *handle, const char *name)
3229 rv.d = do_dlsym(handle, name, __builtin_return_address(0), NULL,
3235 dlvsym(void *handle, const char *name, const char *version)
3239 ventry.name = version;
3241 ventry.hash = elf_hash(version);
3243 return do_dlsym(handle, name, __builtin_return_address(0), &ventry,
3248 _rtld_addr_phdr(const void *addr, struct dl_phdr_info *phdr_info)
3250 const Obj_Entry *obj;
3251 RtldLockState lockstate;
3253 rlock_acquire(rtld_bind_lock, &lockstate);
3254 obj = obj_from_addr(addr);
3256 _rtld_error("No shared object contains address");
3257 lock_release(rtld_bind_lock, &lockstate);
3260 rtld_fill_dl_phdr_info(obj, phdr_info);
3261 lock_release(rtld_bind_lock, &lockstate);
3266 dladdr(const void *addr, Dl_info *info)
3268 const Obj_Entry *obj;
3271 unsigned long symoffset;
3272 RtldLockState lockstate;
3274 rlock_acquire(rtld_bind_lock, &lockstate);
3275 obj = obj_from_addr(addr);
3277 _rtld_error("No shared object contains address");
3278 lock_release(rtld_bind_lock, &lockstate);
3281 info->dli_fname = obj->path;
3282 info->dli_fbase = obj->mapbase;
3283 info->dli_saddr = (void *)0;
3284 info->dli_sname = NULL;
3287 * Walk the symbol list looking for the symbol whose address is
3288 * closest to the address sent in.
3290 for (symoffset = 0; symoffset < obj->dynsymcount; symoffset++) {
3291 def = obj->symtab + symoffset;
3294 * For skip the symbol if st_shndx is either SHN_UNDEF or
3297 if (def->st_shndx == SHN_UNDEF || def->st_shndx == SHN_COMMON)
3301 * If the symbol is greater than the specified address, or if it
3302 * is further away from addr than the current nearest symbol,
3305 symbol_addr = obj->relocbase + def->st_value;
3306 if (symbol_addr > addr || symbol_addr < info->dli_saddr)
3309 /* Update our idea of the nearest symbol. */
3310 info->dli_sname = obj->strtab + def->st_name;
3311 info->dli_saddr = symbol_addr;
3314 if (info->dli_saddr == addr)
3317 lock_release(rtld_bind_lock, &lockstate);
3322 dlinfo(void *handle, int request, void *p)
3324 const Obj_Entry *obj;
3325 RtldLockState lockstate;
3328 rlock_acquire(rtld_bind_lock, &lockstate);
3330 if (handle == NULL || handle == RTLD_SELF) {
3333 retaddr = __builtin_return_address(0); /* __GNUC__ only */
3334 if ((obj = obj_from_addr(retaddr)) == NULL)
3335 _rtld_error("Cannot determine caller's shared object");
3337 obj = dlcheck(handle);
3340 lock_release(rtld_bind_lock, &lockstate);
3346 case RTLD_DI_LINKMAP:
3347 *((struct link_map const **)p) = &obj->linkmap;
3349 case RTLD_DI_ORIGIN:
3350 error = rtld_dirname(obj->path, p);
3353 case RTLD_DI_SERINFOSIZE:
3354 case RTLD_DI_SERINFO:
3355 error = do_search_info(obj, request, (struct dl_serinfo *)p);
3359 _rtld_error("Invalid request %d passed to dlinfo()", request);
3363 lock_release(rtld_bind_lock, &lockstate);
3369 rtld_fill_dl_phdr_info(const Obj_Entry *obj, struct dl_phdr_info *phdr_info)
3372 phdr_info->dlpi_addr = (Elf_Addr)obj->relocbase;
3373 phdr_info->dlpi_name = STAILQ_FIRST(&obj->names) ?
3374 STAILQ_FIRST(&obj->names)->name : obj->path;
3375 phdr_info->dlpi_phdr = obj->phdr;
3376 phdr_info->dlpi_phnum = obj->phsize / sizeof(obj->phdr[0]);
3377 phdr_info->dlpi_tls_modid = obj->tlsindex;
3378 phdr_info->dlpi_tls_data = obj->tlsinit;
3379 phdr_info->dlpi_adds = obj_loads;
3380 phdr_info->dlpi_subs = obj_loads - obj_count;
3384 dl_iterate_phdr(__dl_iterate_hdr_callback callback, void *param)
3386 struct dl_phdr_info phdr_info;
3387 const Obj_Entry *obj;
3388 RtldLockState bind_lockstate, phdr_lockstate;
3391 wlock_acquire(rtld_phdr_lock, &phdr_lockstate);
3392 rlock_acquire(rtld_bind_lock, &bind_lockstate);
3396 for (obj = obj_list; obj != NULL; obj = obj->next) {
3397 rtld_fill_dl_phdr_info(obj, &phdr_info);
3398 if ((error = callback(&phdr_info, sizeof phdr_info, param)) != 0)
3403 rtld_fill_dl_phdr_info(&obj_rtld, &phdr_info);
3404 error = callback(&phdr_info, sizeof(phdr_info), param);
3407 lock_release(rtld_bind_lock, &bind_lockstate);
3408 lock_release(rtld_phdr_lock, &phdr_lockstate);
3414 fill_search_info(const char *dir, size_t dirlen, void *param)
3416 struct fill_search_info_args *arg;
3420 if (arg->request == RTLD_DI_SERINFOSIZE) {
3421 arg->serinfo->dls_cnt ++;
3422 arg->serinfo->dls_size += sizeof(struct dl_serpath) + dirlen + 1;
3424 struct dl_serpath *s_entry;
3426 s_entry = arg->serpath;
3427 s_entry->dls_name = arg->strspace;
3428 s_entry->dls_flags = arg->flags;
3430 strncpy(arg->strspace, dir, dirlen);
3431 arg->strspace[dirlen] = '\0';
3433 arg->strspace += dirlen + 1;
3441 do_search_info(const Obj_Entry *obj, int request, struct dl_serinfo *info)
3443 struct dl_serinfo _info;
3444 struct fill_search_info_args args;
3446 args.request = RTLD_DI_SERINFOSIZE;
3447 args.serinfo = &_info;
3449 _info.dls_size = __offsetof(struct dl_serinfo, dls_serpath);
3452 path_enumerate(obj->rpath, fill_search_info, &args);
3453 path_enumerate(ld_library_path, fill_search_info, &args);
3454 path_enumerate(obj->runpath, fill_search_info, &args);
3455 path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args);
3456 if (!obj->z_nodeflib)
3457 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args);
3460 if (request == RTLD_DI_SERINFOSIZE) {
3461 info->dls_size = _info.dls_size;
3462 info->dls_cnt = _info.dls_cnt;
3466 if (info->dls_cnt != _info.dls_cnt || info->dls_size != _info.dls_size) {
3467 _rtld_error("Uninitialized Dl_serinfo struct passed to dlinfo()");
3471 args.request = RTLD_DI_SERINFO;
3472 args.serinfo = info;
3473 args.serpath = &info->dls_serpath[0];
3474 args.strspace = (char *)&info->dls_serpath[_info.dls_cnt];
3476 args.flags = LA_SER_RUNPATH;
3477 if (path_enumerate(obj->rpath, fill_search_info, &args) != NULL)
3480 args.flags = LA_SER_LIBPATH;
3481 if (path_enumerate(ld_library_path, fill_search_info, &args) != NULL)
3484 args.flags = LA_SER_RUNPATH;
3485 if (path_enumerate(obj->runpath, fill_search_info, &args) != NULL)
3488 args.flags = LA_SER_CONFIG;
3489 if (path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args)
3493 args.flags = LA_SER_DEFAULT;
3494 if (!obj->z_nodeflib &&
3495 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args) != NULL)
3501 rtld_dirname(const char *path, char *bname)
3505 /* Empty or NULL string gets treated as "." */
3506 if (path == NULL || *path == '\0') {
3512 /* Strip trailing slashes */
3513 endp = path + strlen(path) - 1;
3514 while (endp > path && *endp == '/')
3517 /* Find the start of the dir */
3518 while (endp > path && *endp != '/')
3521 /* Either the dir is "/" or there are no slashes */
3523 bname[0] = *endp == '/' ? '/' : '.';
3529 } while (endp > path && *endp == '/');
3532 if (endp - path + 2 > PATH_MAX)
3534 _rtld_error("Filename is too long: %s", path);
3538 strncpy(bname, path, endp - path + 1);
3539 bname[endp - path + 1] = '\0';
3544 rtld_dirname_abs(const char *path, char *base)
3546 char base_rel[PATH_MAX];
3548 if (rtld_dirname(path, base) == -1)
3552 if (getcwd(base_rel, sizeof(base_rel)) == NULL ||
3553 strlcat(base_rel, "/", sizeof(base_rel)) >= sizeof(base_rel) ||
3554 strlcat(base_rel, base, sizeof(base_rel)) >= sizeof(base_rel))
3556 strcpy(base, base_rel);
3561 linkmap_add(Obj_Entry *obj)
3563 struct link_map *l = &obj->linkmap;
3564 struct link_map *prev;
3566 obj->linkmap.l_name = obj->path;
3567 obj->linkmap.l_addr = obj->mapbase;
3568 obj->linkmap.l_ld = obj->dynamic;
3570 /* GDB needs load offset on MIPS to use the symbols */
3571 obj->linkmap.l_offs = obj->relocbase;
3574 if (r_debug.r_map == NULL) {
3580 * Scan to the end of the list, but not past the entry for the
3581 * dynamic linker, which we want to keep at the very end.
3583 for (prev = r_debug.r_map;
3584 prev->l_next != NULL && prev->l_next != &obj_rtld.linkmap;
3585 prev = prev->l_next)
3588 /* Link in the new entry. */
3590 l->l_next = prev->l_next;
3591 if (l->l_next != NULL)
3592 l->l_next->l_prev = l;
3597 linkmap_delete(Obj_Entry *obj)
3599 struct link_map *l = &obj->linkmap;
3601 if (l->l_prev == NULL) {
3602 if ((r_debug.r_map = l->l_next) != NULL)
3603 l->l_next->l_prev = NULL;
3607 if ((l->l_prev->l_next = l->l_next) != NULL)
3608 l->l_next->l_prev = l->l_prev;
3612 * Function for the debugger to set a breakpoint on to gain control.
3614 * The two parameters allow the debugger to easily find and determine
3615 * what the runtime loader is doing and to whom it is doing it.
3617 * When the loadhook trap is hit (r_debug_state, set at program
3618 * initialization), the arguments can be found on the stack:
3620 * +8 struct link_map *m
3621 * +4 struct r_debug *rd
3625 r_debug_state(struct r_debug* rd, struct link_map *m)
3628 * The following is a hack to force the compiler to emit calls to
3629 * this function, even when optimizing. If the function is empty,
3630 * the compiler is not obliged to emit any code for calls to it,
3631 * even when marked __noinline. However, gdb depends on those
3634 __compiler_membar();
3638 * A function called after init routines have completed. This can be used to
3639 * break before a program's entry routine is called, and can be used when
3640 * main is not available in the symbol table.
3643 _r_debug_postinit(struct link_map *m)
3646 /* See r_debug_state(). */
3647 __compiler_membar();
3651 * Get address of the pointer variable in the main program.
3652 * Prefer non-weak symbol over the weak one.
3654 static const void **
3655 get_program_var_addr(const char *name, RtldLockState *lockstate)
3660 symlook_init(&req, name);
3661 req.lockstate = lockstate;
3662 donelist_init(&donelist);
3663 if (symlook_global(&req, &donelist) != 0)
3665 if (ELF_ST_TYPE(req.sym_out->st_info) == STT_FUNC)
3666 return ((const void **)make_function_pointer(req.sym_out,
3668 else if (ELF_ST_TYPE(req.sym_out->st_info) == STT_GNU_IFUNC)
3669 return ((const void **)rtld_resolve_ifunc(req.defobj_out, req.sym_out));
3671 return ((const void **)(req.defobj_out->relocbase +
3672 req.sym_out->st_value));
3676 * Set a pointer variable in the main program to the given value. This
3677 * is used to set key variables such as "environ" before any of the
3678 * init functions are called.
3681 set_program_var(const char *name, const void *value)
3685 if ((addr = get_program_var_addr(name, NULL)) != NULL) {
3686 dbg("\"%s\": *%p <-- %p", name, addr, value);
3692 * Search the global objects, including dependencies and main object,
3693 * for the given symbol.
3696 symlook_global(SymLook *req, DoneList *donelist)
3699 const Objlist_Entry *elm;
3702 symlook_init_from_req(&req1, req);
3704 /* Search all objects loaded at program start up. */
3705 if (req->defobj_out == NULL ||
3706 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3707 res = symlook_list(&req1, &list_main, donelist);
3708 if (res == 0 && (req->defobj_out == NULL ||
3709 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3710 req->sym_out = req1.sym_out;
3711 req->defobj_out = req1.defobj_out;
3712 assert(req->defobj_out != NULL);
3716 /* Search all DAGs whose roots are RTLD_GLOBAL objects. */
3717 STAILQ_FOREACH(elm, &list_global, link) {
3718 if (req->defobj_out != NULL &&
3719 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3721 res = symlook_list(&req1, &elm->obj->dagmembers, donelist);
3722 if (res == 0 && (req->defobj_out == NULL ||
3723 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3724 req->sym_out = req1.sym_out;
3725 req->defobj_out = req1.defobj_out;
3726 assert(req->defobj_out != NULL);
3730 return (req->sym_out != NULL ? 0 : ESRCH);
3734 * Given a symbol name in a referencing object, find the corresponding
3735 * definition of the symbol. Returns a pointer to the symbol, or NULL if
3736 * no definition was found. Returns a pointer to the Obj_Entry of the
3737 * defining object via the reference parameter DEFOBJ_OUT.
3740 symlook_default(SymLook *req, const Obj_Entry *refobj)
3743 const Objlist_Entry *elm;
3747 donelist_init(&donelist);
3748 symlook_init_from_req(&req1, req);
3750 /* Look first in the referencing object if linked symbolically. */
3751 if (refobj->symbolic && !donelist_check(&donelist, refobj)) {
3752 res = symlook_obj(&req1, refobj);
3754 req->sym_out = req1.sym_out;
3755 req->defobj_out = req1.defobj_out;
3756 assert(req->defobj_out != NULL);
3760 symlook_global(req, &donelist);
3762 /* Search all dlopened DAGs containing the referencing object. */
3763 STAILQ_FOREACH(elm, &refobj->dldags, link) {
3764 if (req->sym_out != NULL &&
3765 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)
3767 res = symlook_list(&req1, &elm->obj->dagmembers, &donelist);
3768 if (res == 0 && (req->sym_out == NULL ||
3769 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) {
3770 req->sym_out = req1.sym_out;
3771 req->defobj_out = req1.defobj_out;
3772 assert(req->defobj_out != NULL);
3777 * Search the dynamic linker itself, and possibly resolve the
3778 * symbol from there. This is how the application links to
3779 * dynamic linker services such as dlopen.
3781 if (req->sym_out == NULL ||
3782 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) {
3783 res = symlook_obj(&req1, &obj_rtld);
3785 req->sym_out = req1.sym_out;
3786 req->defobj_out = req1.defobj_out;
3787 assert(req->defobj_out != NULL);
3791 return (req->sym_out != NULL ? 0 : ESRCH);
3795 symlook_list(SymLook *req, const Objlist *objlist, DoneList *dlp)
3798 const Obj_Entry *defobj;
3799 const Objlist_Entry *elm;
3805 STAILQ_FOREACH(elm, objlist, link) {
3806 if (donelist_check(dlp, elm->obj))
3808 symlook_init_from_req(&req1, req);
3809 if ((res = symlook_obj(&req1, elm->obj)) == 0) {
3810 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3812 defobj = req1.defobj_out;
3813 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3820 req->defobj_out = defobj;
3827 * Search the chain of DAGS cointed to by the given Needed_Entry
3828 * for a symbol of the given name. Each DAG is scanned completely
3829 * before advancing to the next one. Returns a pointer to the symbol,
3830 * or NULL if no definition was found.
3833 symlook_needed(SymLook *req, const Needed_Entry *needed, DoneList *dlp)
3836 const Needed_Entry *n;
3837 const Obj_Entry *defobj;
3843 symlook_init_from_req(&req1, req);
3844 for (n = needed; n != NULL; n = n->next) {
3845 if (n->obj == NULL ||
3846 (res = symlook_list(&req1, &n->obj->dagmembers, dlp)) != 0)
3848 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) {
3850 defobj = req1.defobj_out;
3851 if (ELF_ST_BIND(def->st_info) != STB_WEAK)
3857 req->defobj_out = defobj;
3864 * Search the symbol table of a single shared object for a symbol of
3865 * the given name and version, if requested. Returns a pointer to the
3866 * symbol, or NULL if no definition was found. If the object is
3867 * filter, return filtered symbol from filtee.
3869 * The symbol's hash value is passed in for efficiency reasons; that
3870 * eliminates many recomputations of the hash value.
3873 symlook_obj(SymLook *req, const Obj_Entry *obj)
3877 int flags, res, mres;
3880 * If there is at least one valid hash at this point, we prefer to
3881 * use the faster GNU version if available.
3883 if (obj->valid_hash_gnu)
3884 mres = symlook_obj1_gnu(req, obj);
3885 else if (obj->valid_hash_sysv)
3886 mres = symlook_obj1_sysv(req, obj);
3891 if (obj->needed_filtees != NULL) {
3892 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3893 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3894 donelist_init(&donelist);
3895 symlook_init_from_req(&req1, req);
3896 res = symlook_needed(&req1, obj->needed_filtees, &donelist);
3898 req->sym_out = req1.sym_out;
3899 req->defobj_out = req1.defobj_out;
3903 if (obj->needed_aux_filtees != NULL) {
3904 flags = (req->flags & SYMLOOK_EARLY) ? RTLD_LO_EARLY : 0;
3905 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate);
3906 donelist_init(&donelist);
3907 symlook_init_from_req(&req1, req);
3908 res = symlook_needed(&req1, obj->needed_aux_filtees, &donelist);
3910 req->sym_out = req1.sym_out;
3911 req->defobj_out = req1.defobj_out;
3919 /* Symbol match routine common to both hash functions */
3921 matched_symbol(SymLook *req, const Obj_Entry *obj, Sym_Match_Result *result,
3922 const unsigned long symnum)
3925 const Elf_Sym *symp;
3928 symp = obj->symtab + symnum;
3929 strp = obj->strtab + symp->st_name;
3931 switch (ELF_ST_TYPE(symp->st_info)) {
3937 if (symp->st_value == 0)
3941 if (symp->st_shndx != SHN_UNDEF)
3944 else if (((req->flags & SYMLOOK_IN_PLT) == 0) &&
3945 (ELF_ST_TYPE(symp->st_info) == STT_FUNC))
3952 if (req->name[0] != strp[0] || strcmp(req->name, strp) != 0)
3955 if (req->ventry == NULL) {
3956 if (obj->versyms != NULL) {
3957 verndx = VER_NDX(obj->versyms[symnum]);
3958 if (verndx > obj->vernum) {
3960 "%s: symbol %s references wrong version %d",
3961 obj->path, obj->strtab + symnum, verndx);
3965 * If we are not called from dlsym (i.e. this
3966 * is a normal relocation from unversioned
3967 * binary), accept the symbol immediately if
3968 * it happens to have first version after this
3969 * shared object became versioned. Otherwise,
3970 * if symbol is versioned and not hidden,
3971 * remember it. If it is the only symbol with
3972 * this name exported by the shared object, it
3973 * will be returned as a match by the calling
3974 * function. If symbol is global (verndx < 2)
3975 * accept it unconditionally.
3977 if ((req->flags & SYMLOOK_DLSYM) == 0 &&
3978 verndx == VER_NDX_GIVEN) {
3979 result->sym_out = symp;
3982 else if (verndx >= VER_NDX_GIVEN) {
3983 if ((obj->versyms[symnum] & VER_NDX_HIDDEN)
3985 if (result->vsymp == NULL)
3986 result->vsymp = symp;
3992 result->sym_out = symp;
3995 if (obj->versyms == NULL) {
3996 if (object_match_name(obj, req->ventry->name)) {
3997 _rtld_error("%s: object %s should provide version %s "
3998 "for symbol %s", obj_rtld.path, obj->path,
3999 req->ventry->name, obj->strtab + symnum);
4003 verndx = VER_NDX(obj->versyms[symnum]);
4004 if (verndx > obj->vernum) {
4005 _rtld_error("%s: symbol %s references wrong version %d",
4006 obj->path, obj->strtab + symnum, verndx);
4009 if (obj->vertab[verndx].hash != req->ventry->hash ||
4010 strcmp(obj->vertab[verndx].name, req->ventry->name)) {
4012 * Version does not match. Look if this is a
4013 * global symbol and if it is not hidden. If
4014 * global symbol (verndx < 2) is available,
4015 * use it. Do not return symbol if we are
4016 * called by dlvsym, because dlvsym looks for
4017 * a specific version and default one is not
4018 * what dlvsym wants.
4020 if ((req->flags & SYMLOOK_DLSYM) ||
4021 (verndx >= VER_NDX_GIVEN) ||
4022 (obj->versyms[symnum] & VER_NDX_HIDDEN))
4026 result->sym_out = symp;
4031 * Search for symbol using SysV hash function.
4032 * obj->buckets is known not to be NULL at this point; the test for this was
4033 * performed with the obj->valid_hash_sysv assignment.
4036 symlook_obj1_sysv(SymLook *req, const Obj_Entry *obj)
4038 unsigned long symnum;
4039 Sym_Match_Result matchres;
4041 matchres.sym_out = NULL;
4042 matchres.vsymp = NULL;
4043 matchres.vcount = 0;
4045 for (symnum = obj->buckets[req->hash % obj->nbuckets];
4046 symnum != STN_UNDEF; symnum = obj->chains[symnum]) {
4047 if (symnum >= obj->nchains)
4048 return (ESRCH); /* Bad object */
4050 if (matched_symbol(req, obj, &matchres, symnum)) {
4051 req->sym_out = matchres.sym_out;
4052 req->defobj_out = obj;
4056 if (matchres.vcount == 1) {
4057 req->sym_out = matchres.vsymp;
4058 req->defobj_out = obj;
4064 /* Search for symbol using GNU hash function */
4066 symlook_obj1_gnu(SymLook *req, const Obj_Entry *obj)
4068 Elf_Addr bloom_word;
4069 const Elf32_Word *hashval;
4071 Sym_Match_Result matchres;
4072 unsigned int h1, h2;
4073 unsigned long symnum;
4075 matchres.sym_out = NULL;
4076 matchres.vsymp = NULL;
4077 matchres.vcount = 0;
4079 /* Pick right bitmask word from Bloom filter array */
4080 bloom_word = obj->bloom_gnu[(req->hash_gnu / __ELF_WORD_SIZE) &
4081 obj->maskwords_bm_gnu];
4083 /* Calculate modulus word size of gnu hash and its derivative */
4084 h1 = req->hash_gnu & (__ELF_WORD_SIZE - 1);
4085 h2 = ((req->hash_gnu >> obj->shift2_gnu) & (__ELF_WORD_SIZE - 1));
4087 /* Filter out the "definitely not in set" queries */
4088 if (((bloom_word >> h1) & (bloom_word >> h2) & 1) == 0)
4091 /* Locate hash chain and corresponding value element*/
4092 bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu];
4095 hashval = &obj->chain_zero_gnu[bucket];
4097 if (((*hashval ^ req->hash_gnu) >> 1) == 0) {
4098 symnum = hashval - obj->chain_zero_gnu;
4099 if (matched_symbol(req, obj, &matchres, symnum)) {
4100 req->sym_out = matchres.sym_out;
4101 req->defobj_out = obj;
4105 } while ((*hashval++ & 1) == 0);
4106 if (matchres.vcount == 1) {
4107 req->sym_out = matchres.vsymp;
4108 req->defobj_out = obj;
4115 trace_loaded_objects(Obj_Entry *obj)
4117 char *fmt1, *fmt2, *fmt, *main_local, *list_containers;
4120 if ((main_local = getenv(LD_ "TRACE_LOADED_OBJECTS_PROGNAME")) == NULL)
4123 if ((fmt1 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT1")) == NULL)
4124 fmt1 = "\t%o => %p (%x)\n";
4126 if ((fmt2 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT2")) == NULL)
4127 fmt2 = "\t%o (%x)\n";
4129 list_containers = getenv(LD_ "TRACE_LOADED_OBJECTS_ALL");
4131 for (; obj; obj = obj->next) {
4132 Needed_Entry *needed;
4136 if (list_containers && obj->needed != NULL)
4137 rtld_printf("%s:\n", obj->path);
4138 for (needed = obj->needed; needed; needed = needed->next) {
4139 if (needed->obj != NULL) {
4140 if (needed->obj->traced && !list_containers)
4142 needed->obj->traced = true;
4143 path = needed->obj->path;
4147 name = (char *)obj->strtab + needed->name;
4148 is_lib = strncmp(name, "lib", 3) == 0; /* XXX - bogus */
4150 fmt = is_lib ? fmt1 : fmt2;
4151 while ((c = *fmt++) != '\0') {
4177 rtld_putstr(main_local);
4180 rtld_putstr(obj_main->path);
4187 rtld_printf("%d", sodp->sod_major);
4190 rtld_printf("%d", sodp->sod_minor);
4197 rtld_printf("%p", needed->obj ? needed->obj->mapbase :
4210 * Unload a dlopened object and its dependencies from memory and from
4211 * our data structures. It is assumed that the DAG rooted in the
4212 * object has already been unreferenced, and that the object has a
4213 * reference count of 0.
4216 unload_object(Obj_Entry *root)
4221 assert(root->refcount == 0);
4224 * Pass over the DAG removing unreferenced objects from
4225 * appropriate lists.
4227 unlink_object(root);
4229 /* Unmap all objects that are no longer referenced. */
4230 linkp = &obj_list->next;
4231 while ((obj = *linkp) != NULL) {
4232 if (obj->refcount == 0) {
4233 LD_UTRACE(UTRACE_UNLOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0,
4235 dbg("unloading \"%s\"", obj->path);
4236 unload_filtees(root);
4237 munmap(obj->mapbase, obj->mapsize);
4238 linkmap_delete(obj);
4249 unlink_object(Obj_Entry *root)
4253 if (root->refcount == 0) {
4254 /* Remove the object from the RTLD_GLOBAL list. */
4255 objlist_remove(&list_global, root);
4257 /* Remove the object from all objects' DAG lists. */
4258 STAILQ_FOREACH(elm, &root->dagmembers, link) {
4259 objlist_remove(&elm->obj->dldags, root);
4260 if (elm->obj != root)
4261 unlink_object(elm->obj);
4267 ref_dag(Obj_Entry *root)
4271 assert(root->dag_inited);
4272 STAILQ_FOREACH(elm, &root->dagmembers, link)
4273 elm->obj->refcount++;
4277 unref_dag(Obj_Entry *root)
4281 assert(root->dag_inited);
4282 STAILQ_FOREACH(elm, &root->dagmembers, link)
4283 elm->obj->refcount--;
4287 * Common code for MD __tls_get_addr().
4289 static void *tls_get_addr_slow(Elf_Addr **, int, size_t) __noinline;
4291 tls_get_addr_slow(Elf_Addr **dtvp, int index, size_t offset)
4293 Elf_Addr *newdtv, *dtv;
4294 RtldLockState lockstate;
4298 /* Check dtv generation in case new modules have arrived */
4299 if (dtv[0] != tls_dtv_generation) {
4300 wlock_acquire(rtld_bind_lock, &lockstate);
4301 newdtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4303 if (to_copy > tls_max_index)
4304 to_copy = tls_max_index;
4305 memcpy(&newdtv[2], &dtv[2], to_copy * sizeof(Elf_Addr));
4306 newdtv[0] = tls_dtv_generation;
4307 newdtv[1] = tls_max_index;
4309 lock_release(rtld_bind_lock, &lockstate);
4310 dtv = *dtvp = newdtv;
4313 /* Dynamically allocate module TLS if necessary */
4314 if (dtv[index + 1] == 0) {
4315 /* Signal safe, wlock will block out signals. */
4316 wlock_acquire(rtld_bind_lock, &lockstate);
4317 if (!dtv[index + 1])
4318 dtv[index + 1] = (Elf_Addr)allocate_module_tls(index);
4319 lock_release(rtld_bind_lock, &lockstate);
4321 return ((void *)(dtv[index + 1] + offset));
4325 tls_get_addr_common(Elf_Addr **dtvp, int index, size_t offset)
4330 /* Check dtv generation in case new modules have arrived */
4331 if (__predict_true(dtv[0] == tls_dtv_generation &&
4332 dtv[index + 1] != 0))
4333 return ((void *)(dtv[index + 1] + offset));
4334 return (tls_get_addr_slow(dtvp, index, offset));
4337 #if defined(__arm__) || defined(__ia64__) || defined(__mips__) || defined(__powerpc__)
4340 * Allocate Static TLS using the Variant I method.
4343 allocate_tls(Obj_Entry *objs, void *oldtcb, size_t tcbsize, size_t tcbalign)
4352 if (oldtcb != NULL && tcbsize == TLS_TCB_SIZE)
4355 assert(tcbsize >= TLS_TCB_SIZE);
4356 tcb = xcalloc(1, tls_static_space - TLS_TCB_SIZE + tcbsize);
4357 tls = (Elf_Addr **)(tcb + tcbsize - TLS_TCB_SIZE);
4359 if (oldtcb != NULL) {
4360 memcpy(tls, oldtcb, tls_static_space);
4363 /* Adjust the DTV. */
4365 for (i = 0; i < dtv[1]; i++) {
4366 if (dtv[i+2] >= (Elf_Addr)oldtcb &&
4367 dtv[i+2] < (Elf_Addr)oldtcb + tls_static_space) {
4368 dtv[i+2] = dtv[i+2] - (Elf_Addr)oldtcb + (Elf_Addr)tls;
4372 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4374 dtv[0] = tls_dtv_generation;
4375 dtv[1] = tls_max_index;
4377 for (obj = objs; obj; obj = obj->next) {
4378 if (obj->tlsoffset > 0) {
4379 addr = (Elf_Addr)tls + obj->tlsoffset;
4380 if (obj->tlsinitsize > 0)
4381 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4382 if (obj->tlssize > obj->tlsinitsize)
4383 memset((void*) (addr + obj->tlsinitsize), 0,
4384 obj->tlssize - obj->tlsinitsize);
4385 dtv[obj->tlsindex + 1] = addr;
4394 free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4397 Elf_Addr tlsstart, tlsend;
4400 assert(tcbsize >= TLS_TCB_SIZE);
4402 tlsstart = (Elf_Addr)tcb + tcbsize - TLS_TCB_SIZE;
4403 tlsend = tlsstart + tls_static_space;
4405 dtv = *(Elf_Addr **)tlsstart;
4407 for (i = 0; i < dtvsize; i++) {
4408 if (dtv[i+2] && (dtv[i+2] < tlsstart || dtv[i+2] >= tlsend)) {
4409 free((void*)dtv[i+2]);
4418 #if defined(__i386__) || defined(__amd64__) || defined(__sparc64__)
4421 * Allocate Static TLS using the Variant II method.
4424 allocate_tls(Obj_Entry *objs, void *oldtls, size_t tcbsize, size_t tcbalign)
4427 size_t size, ralign;
4429 Elf_Addr *dtv, *olddtv;
4430 Elf_Addr segbase, oldsegbase, addr;
4434 if (tls_static_max_align > ralign)
4435 ralign = tls_static_max_align;
4436 size = round(tls_static_space, ralign) + round(tcbsize, ralign);
4438 assert(tcbsize >= 2*sizeof(Elf_Addr));
4439 tls = malloc_aligned(size, ralign);
4440 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr));
4442 segbase = (Elf_Addr)(tls + round(tls_static_space, ralign));
4443 ((Elf_Addr*)segbase)[0] = segbase;
4444 ((Elf_Addr*)segbase)[1] = (Elf_Addr) dtv;
4446 dtv[0] = tls_dtv_generation;
4447 dtv[1] = tls_max_index;
4451 * Copy the static TLS block over whole.
4453 oldsegbase = (Elf_Addr) oldtls;
4454 memcpy((void *)(segbase - tls_static_space),
4455 (const void *)(oldsegbase - tls_static_space),
4459 * If any dynamic TLS blocks have been created tls_get_addr(),
4462 olddtv = ((Elf_Addr**)oldsegbase)[1];
4463 for (i = 0; i < olddtv[1]; i++) {
4464 if (olddtv[i+2] < oldsegbase - size || olddtv[i+2] > oldsegbase) {
4465 dtv[i+2] = olddtv[i+2];
4471 * We assume that this block was the one we created with
4472 * allocate_initial_tls().
4474 free_tls(oldtls, 2*sizeof(Elf_Addr), sizeof(Elf_Addr));
4476 for (obj = objs; obj; obj = obj->next) {
4477 if (obj->tlsoffset) {
4478 addr = segbase - obj->tlsoffset;
4479 memset((void*) (addr + obj->tlsinitsize),
4480 0, obj->tlssize - obj->tlsinitsize);
4482 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize);
4483 dtv[obj->tlsindex + 1] = addr;
4488 return (void*) segbase;
4492 free_tls(void *tls, size_t tcbsize, size_t tcbalign)
4495 size_t size, ralign;
4497 Elf_Addr tlsstart, tlsend;
4500 * Figure out the size of the initial TLS block so that we can
4501 * find stuff which ___tls_get_addr() allocated dynamically.
4504 if (tls_static_max_align > ralign)
4505 ralign = tls_static_max_align;
4506 size = round(tls_static_space, ralign);
4508 dtv = ((Elf_Addr**)tls)[1];
4510 tlsend = (Elf_Addr) tls;
4511 tlsstart = tlsend - size;
4512 for (i = 0; i < dtvsize; i++) {
4513 if (dtv[i + 2] != 0 && (dtv[i + 2] < tlsstart || dtv[i + 2] > tlsend)) {
4514 free_aligned((void *)dtv[i + 2]);
4518 free_aligned((void *)tlsstart);
4525 * Allocate TLS block for module with given index.
4528 allocate_module_tls(int index)
4533 for (obj = obj_list; obj; obj = obj->next) {
4534 if (obj->tlsindex == index)
4538 _rtld_error("Can't find module with TLS index %d", index);
4542 p = malloc_aligned(obj->tlssize, obj->tlsalign);
4543 memcpy(p, obj->tlsinit, obj->tlsinitsize);
4544 memset(p + obj->tlsinitsize, 0, obj->tlssize - obj->tlsinitsize);
4550 allocate_tls_offset(Obj_Entry *obj)
4557 if (obj->tlssize == 0) {
4558 obj->tls_done = true;
4562 if (obj->tlsindex == 1)
4563 off = calculate_first_tls_offset(obj->tlssize, obj->tlsalign);
4565 off = calculate_tls_offset(tls_last_offset, tls_last_size,
4566 obj->tlssize, obj->tlsalign);
4569 * If we have already fixed the size of the static TLS block, we
4570 * must stay within that size. When allocating the static TLS, we
4571 * leave a small amount of space spare to be used for dynamically
4572 * loading modules which use static TLS.
4574 if (tls_static_space != 0) {
4575 if (calculate_tls_end(off, obj->tlssize) > tls_static_space)
4577 } else if (obj->tlsalign > tls_static_max_align) {
4578 tls_static_max_align = obj->tlsalign;
4581 tls_last_offset = obj->tlsoffset = off;
4582 tls_last_size = obj->tlssize;
4583 obj->tls_done = true;
4589 free_tls_offset(Obj_Entry *obj)
4593 * If we were the last thing to allocate out of the static TLS
4594 * block, we give our space back to the 'allocator'. This is a
4595 * simplistic workaround to allow libGL.so.1 to be loaded and
4596 * unloaded multiple times.
4598 if (calculate_tls_end(obj->tlsoffset, obj->tlssize)
4599 == calculate_tls_end(tls_last_offset, tls_last_size)) {
4600 tls_last_offset -= obj->tlssize;
4606 _rtld_allocate_tls(void *oldtls, size_t tcbsize, size_t tcbalign)
4609 RtldLockState lockstate;
4611 wlock_acquire(rtld_bind_lock, &lockstate);
4612 ret = allocate_tls(obj_list, oldtls, tcbsize, tcbalign);
4613 lock_release(rtld_bind_lock, &lockstate);
4618 _rtld_free_tls(void *tcb, size_t tcbsize, size_t tcbalign)
4620 RtldLockState lockstate;
4622 wlock_acquire(rtld_bind_lock, &lockstate);
4623 free_tls(tcb, tcbsize, tcbalign);
4624 lock_release(rtld_bind_lock, &lockstate);
4628 object_add_name(Obj_Entry *obj, const char *name)
4634 entry = malloc(sizeof(Name_Entry) + len);
4636 if (entry != NULL) {
4637 strcpy(entry->name, name);
4638 STAILQ_INSERT_TAIL(&obj->names, entry, link);
4643 object_match_name(const Obj_Entry *obj, const char *name)
4647 STAILQ_FOREACH(entry, &obj->names, link) {
4648 if (strcmp(name, entry->name) == 0)
4655 locate_dependency(const Obj_Entry *obj, const char *name)
4657 const Objlist_Entry *entry;
4658 const Needed_Entry *needed;
4660 STAILQ_FOREACH(entry, &list_main, link) {
4661 if (object_match_name(entry->obj, name))
4665 for (needed = obj->needed; needed != NULL; needed = needed->next) {
4666 if (strcmp(obj->strtab + needed->name, name) == 0 ||
4667 (needed->obj != NULL && object_match_name(needed->obj, name))) {
4669 * If there is DT_NEEDED for the name we are looking for,
4670 * we are all set. Note that object might not be found if
4671 * dependency was not loaded yet, so the function can
4672 * return NULL here. This is expected and handled
4673 * properly by the caller.
4675 return (needed->obj);
4678 _rtld_error("%s: Unexpected inconsistency: dependency %s not found",
4684 check_object_provided_version(Obj_Entry *refobj, const Obj_Entry *depobj,
4685 const Elf_Vernaux *vna)
4687 const Elf_Verdef *vd;
4688 const char *vername;
4690 vername = refobj->strtab + vna->vna_name;
4691 vd = depobj->verdef;
4693 _rtld_error("%s: version %s required by %s not defined",
4694 depobj->path, vername, refobj->path);
4698 if (vd->vd_version != VER_DEF_CURRENT) {
4699 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4700 depobj->path, vd->vd_version);
4703 if (vna->vna_hash == vd->vd_hash) {
4704 const Elf_Verdaux *aux = (const Elf_Verdaux *)
4705 ((char *)vd + vd->vd_aux);
4706 if (strcmp(vername, depobj->strtab + aux->vda_name) == 0)
4709 if (vd->vd_next == 0)
4711 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4713 if (vna->vna_flags & VER_FLG_WEAK)
4715 _rtld_error("%s: version %s required by %s not found",
4716 depobj->path, vername, refobj->path);
4721 rtld_verify_object_versions(Obj_Entry *obj)
4723 const Elf_Verneed *vn;
4724 const Elf_Verdef *vd;
4725 const Elf_Verdaux *vda;
4726 const Elf_Vernaux *vna;
4727 const Obj_Entry *depobj;
4728 int maxvernum, vernum;
4730 if (obj->ver_checked)
4732 obj->ver_checked = true;
4736 * Walk over defined and required version records and figure out
4737 * max index used by any of them. Do very basic sanity checking
4741 while (vn != NULL) {
4742 if (vn->vn_version != VER_NEED_CURRENT) {
4743 _rtld_error("%s: Unsupported version %d of Elf_Verneed entry",
4744 obj->path, vn->vn_version);
4747 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4749 vernum = VER_NEED_IDX(vna->vna_other);
4750 if (vernum > maxvernum)
4752 if (vna->vna_next == 0)
4754 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4756 if (vn->vn_next == 0)
4758 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4762 while (vd != NULL) {
4763 if (vd->vd_version != VER_DEF_CURRENT) {
4764 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry",
4765 obj->path, vd->vd_version);
4768 vernum = VER_DEF_IDX(vd->vd_ndx);
4769 if (vernum > maxvernum)
4771 if (vd->vd_next == 0)
4773 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4780 * Store version information in array indexable by version index.
4781 * Verify that object version requirements are satisfied along the
4784 obj->vernum = maxvernum + 1;
4785 obj->vertab = xcalloc(obj->vernum, sizeof(Ver_Entry));
4788 while (vd != NULL) {
4789 if ((vd->vd_flags & VER_FLG_BASE) == 0) {
4790 vernum = VER_DEF_IDX(vd->vd_ndx);
4791 assert(vernum <= maxvernum);
4792 vda = (const Elf_Verdaux *)((char *)vd + vd->vd_aux);
4793 obj->vertab[vernum].hash = vd->vd_hash;
4794 obj->vertab[vernum].name = obj->strtab + vda->vda_name;
4795 obj->vertab[vernum].file = NULL;
4796 obj->vertab[vernum].flags = 0;
4798 if (vd->vd_next == 0)
4800 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next);
4804 while (vn != NULL) {
4805 depobj = locate_dependency(obj, obj->strtab + vn->vn_file);
4808 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux);
4810 if (check_object_provided_version(obj, depobj, vna))
4812 vernum = VER_NEED_IDX(vna->vna_other);
4813 assert(vernum <= maxvernum);
4814 obj->vertab[vernum].hash = vna->vna_hash;
4815 obj->vertab[vernum].name = obj->strtab + vna->vna_name;
4816 obj->vertab[vernum].file = obj->strtab + vn->vn_file;
4817 obj->vertab[vernum].flags = (vna->vna_other & VER_NEED_HIDDEN) ?
4818 VER_INFO_HIDDEN : 0;
4819 if (vna->vna_next == 0)
4821 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next);
4823 if (vn->vn_next == 0)
4825 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next);
4831 rtld_verify_versions(const Objlist *objlist)
4833 Objlist_Entry *entry;
4837 STAILQ_FOREACH(entry, objlist, link) {
4839 * Skip dummy objects or objects that have their version requirements
4842 if (entry->obj->strtab == NULL || entry->obj->vertab != NULL)
4844 if (rtld_verify_object_versions(entry->obj) == -1) {
4846 if (ld_tracing == NULL)
4850 if (rc == 0 || ld_tracing != NULL)
4851 rc = rtld_verify_object_versions(&obj_rtld);
4856 fetch_ventry(const Obj_Entry *obj, unsigned long symnum)
4861 vernum = VER_NDX(obj->versyms[symnum]);
4862 if (vernum >= obj->vernum) {
4863 _rtld_error("%s: symbol %s has wrong verneed value %d",
4864 obj->path, obj->strtab + symnum, vernum);
4865 } else if (obj->vertab[vernum].hash != 0) {
4866 return &obj->vertab[vernum];
4873 _rtld_get_stack_prot(void)
4876 return (stack_prot);
4880 map_stacks_exec(RtldLockState *lockstate)
4882 void (*thr_map_stacks_exec)(void);
4884 if ((max_stack_flags & PF_X) == 0 || (stack_prot & PROT_EXEC) != 0)
4886 thr_map_stacks_exec = (void (*)(void))(uintptr_t)
4887 get_program_var_addr("__pthread_map_stacks_exec", lockstate);
4888 if (thr_map_stacks_exec != NULL) {
4889 stack_prot |= PROT_EXEC;
4890 thr_map_stacks_exec();
4895 symlook_init(SymLook *dst, const char *name)
4898 bzero(dst, sizeof(*dst));
4900 dst->hash = elf_hash(name);
4901 dst->hash_gnu = gnu_hash(name);
4905 symlook_init_from_req(SymLook *dst, const SymLook *src)
4908 dst->name = src->name;
4909 dst->hash = src->hash;
4910 dst->hash_gnu = src->hash_gnu;
4911 dst->ventry = src->ventry;
4912 dst->flags = src->flags;
4913 dst->defobj_out = NULL;
4914 dst->sym_out = NULL;
4915 dst->lockstate = src->lockstate;
4920 * Parse a file descriptor number without pulling in more of libc (e.g. atoi).
4923 parse_libdir(const char *str)
4925 static const int RADIX = 10; /* XXXJA: possibly support hex? */
4932 for (c = *str; c != '\0'; c = *++str) {
4933 if (c < '0' || c > '9')
4940 /* Make sure we actually parsed something. */
4942 _rtld_error("failed to parse directory FD from '%s'", str);
4949 * Overrides for libc_pic-provided functions.
4953 __getosreldate(void)
4963 oid[1] = KERN_OSRELDATE;
4965 len = sizeof(osrel);
4966 error = sysctl(oid, 2, &osrel, &len, NULL, 0);
4967 if (error == 0 && osrel > 0 && len == sizeof(osrel))
4979 void (*__cleanup)(void);
4980 int __isthreaded = 0;
4981 int _thread_autoinit_dummy_decl = 1;
4984 * No unresolved symbols for rtld.
4987 __pthread_cxa_finalize(struct dl_phdr_info *a)
4992 __stack_chk_fail(void)
4995 _rtld_error("stack overflow detected; terminated");
4998 __weak_reference(__stack_chk_fail, __stack_chk_fail_local);
5004 _rtld_error("buffer overflow detected; terminated");
5009 rtld_strerror(int errnum)
5012 if (errnum < 0 || errnum >= sys_nerr)
5013 return ("Unknown error");
5014 return (sys_errlist[errnum]);