1 /*- 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>. 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 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. 16 * 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. 27 * 28 * $FreeBSD$ 29 */ 30 31 /* 32 * Dynamic linker for ELF. 33 * 34 * John Polstra <jdp@polstra.com>. 35 */ 36 37 #ifndef __GNUC__ 38 #error "GCC is needed to compile this file" 39 #endif 40 41 #include <sys/param.h> 42 #include <sys/mount.h> 43 #include <sys/mman.h> 44 #include <sys/stat.h> 45 #include <sys/sysctl.h> 46 #include <sys/uio.h> 47 #include <sys/utsname.h> 48 #include <sys/ktrace.h> 49 50 #include <dlfcn.h> 51 #include <err.h> 52 #include <errno.h> 53 #include <fcntl.h> 54 #include <stdarg.h> 55 #include <stdio.h> 56 #include <stdlib.h> 57 #include <string.h> 58 #include <unistd.h> 59 60 #include "debug.h" 61 #include "rtld.h" 62 #include "libmap.h" 63 #include "rtld_tls.h" 64 #include "rtld_printf.h" 65 #include "notes.h" 66 67 #ifndef COMPAT_32BIT 68 #define PATH_RTLD "/libexec/ld-elf.so.1" 69 #else 70 #define PATH_RTLD "/libexec/ld-elf32.so.1" 71 #endif 72 73 /* Types. */ 74 typedef void (*func_ptr_type)(); 75 typedef void * (*path_enum_proc) (const char *path, size_t len, void *arg); 76 77 /* 78 * Function declarations. 79 */ 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 *, 85 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, 129 RtldLockState *); 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); 165 166 void r_debug_state(struct r_debug *, struct link_map *) __noinline; 167 void _r_debug_postinit(struct link_map *) __noinline; 168 169 /* 170 * Data declarations. 171 */ 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 185 load first */ 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 */ 195 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); 202 203 Elf_Sym sym_zero; /* For resolving undefined weak refs. */ 204 205 #define GDB_STATE(s,m) r_debug.r_state = s; r_debug_state(&r_debug,m); 206 207 extern Elf_Dyn _DYNAMIC; 208 #pragma weak _DYNAMIC 209 #ifndef RTLD_IS_DYNAMIC 210 #define RTLD_IS_DYNAMIC() (&_DYNAMIC != NULL) 211 #endif 212 213 int npagesizes, osreldate; 214 size_t *pagesizes; 215 216 long __stack_chk_guard[8] = {0, 0, 0, 0, 0, 0, 0, 0}; 217 218 static int stack_prot = PROT_READ | PROT_WRITE | RTLD_DEFAULT_STACK_EXEC; 219 static int max_stack_flags; 220 221 /* 222 * Global declarations normally provided by crt1. The dynamic linker is 223 * not built with crt1, so we have to provide them ourselves. 224 */ 225 char *__progname; 226 char **environ; 227 228 /* 229 * Used to pass argc, argv to init functions. 230 */ 231 int main_argc; 232 char **main_argv; 233 234 /* 235 * Globals to control TLS allocation. 236 */ 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 */ 243 244 bool ld_library_path_rpath = false; 245 246 /* 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. 250 */ 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, \ 255 (dlp)->num_used = 0) 256 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 267 268 struct utrace_rtld { 269 char sig[4]; /* 'RTLD' */ 270 int event; 271 void *handle; 272 void *mapbase; /* Used for 'parent' and 'init/fini' */ 273 size_t mapsize; 274 int refcnt; /* Used for 'mode' */ 275 char name[MAXPATHLEN]; 276 }; 277 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); \ 281 } while (0) 282 283 static void 284 ld_utrace_log(int event, void *handle, void *mapbase, size_t mapsize, 285 int refcnt, const char *name) 286 { 287 struct utrace_rtld ut; 288 289 ut.sig[0] = 'R'; 290 ut.sig[1] = 'T'; 291 ut.sig[2] = 'L'; 292 ut.sig[3] = 'D'; 293 ut.event = event; 294 ut.handle = handle; 295 ut.mapbase = mapbase; 296 ut.mapsize = mapsize; 297 ut.refcnt = refcnt; 298 bzero(ut.name, sizeof(ut.name)); 299 if (name) 300 strlcpy(ut.name, name, sizeof(ut.name)); 301 utrace(&ut, sizeof(ut)); 302 } 303 304 /* 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. 313 * 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 316 * program's object. 317 * 318 * The return value is the main program's entry point. 319 */ 320 func_ptr_type 321 _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp) 322 { 323 Elf_Auxinfo *aux_info[AT_COUNT]; 324 int i; 325 int argc; 326 char **argv; 327 char **env; 328 Elf_Auxinfo *aux; 329 Elf_Auxinfo *auxp; 330 const char *argv0; 331 Objlist_Entry *entry; 332 Obj_Entry *obj; 333 Obj_Entry **preload_tail; 334 Obj_Entry *last_interposer; 335 Objlist initlist; 336 RtldLockState lockstate; 337 char *library_path_rpath; 338 int mib[2]; 339 size_t len; 340 341 /* 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. 346 */ 347 348 /* Find the auxiliary vector on the stack. */ 349 argc = *sp++; 350 argv = (char **) sp; 351 sp += argc + 1; /* Skip over arguments and NULL terminator */ 352 env = (char **) sp; 353 while (*sp++ != 0) /* Skip over environment, and NULL terminator */ 354 ; 355 aux = (Elf_Auxinfo *) sp; 356 357 /* Digest the auxiliary vector. */ 358 for (i = 0; i < AT_COUNT; i++) 359 aux_info[i] = NULL; 360 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) { 361 if (auxp->a_type < AT_COUNT) 362 aux_info[auxp->a_type] = auxp; 363 } 364 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); 368 369 __progname = obj_rtld.path; 370 argv0 = argv[0] != NULL ? argv[0] : "(null)"; 371 environ = env; 372 main_argc = argc; 373 main_argv = argv; 374 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); 381 } else { 382 mib[0] = CTL_KERN; 383 mib[1] = KERN_ARND; 384 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; 393 } 394 } 395 396 trust = !issetugid(); 397 398 ld_bind_now = getenv(LD_ "BIND_NOW"); 399 /* 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. 404 */ 405 if (!trust) { 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"); 412 die(); 413 } 414 } 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; 429 else 430 ld_library_path_rpath = false; 431 } 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"); 437 438 if ((ld_elf_hints_path == NULL) || strlen(ld_elf_hints_path) == 0) 439 ld_elf_hints_path = _PATH_ELF_HINTS; 440 441 if (ld_debug != NULL && *ld_debug != '\0') 442 debug = 1; 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); 447 448 dbg("initializing thread locks"); 449 lockdflt_init(); 450 451 /* 452 * Load the main program, or process its program header if it is 453 * already loaded. 454 */ 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); 459 close(fd); 460 if (obj_main == NULL) 461 die(); 462 max_stack_flags = obj->stack_flags; 463 } else { /* Main program already loaded. */ 464 const Elf_Phdr *phdr; 465 int phnum; 466 caddr_t entry; 467 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) 478 die(); 479 } 480 481 if (aux_info[AT_EXECPATH] != 0) { 482 char *kexecpath; 483 char buf[MAXPATHLEN]; 484 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); 493 else 494 obj_main->path = xstrdup(buf); 495 } else { 496 dbg("No AT_EXECPATH"); 497 obj_main->path = xstrdup(argv0); 498 } 499 dbg("obj_main path %s", obj_main->path); 500 obj_main->mainprog = true; 501 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; 505 506 /* 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 510 * one is being used. 511 */ 512 if (obj_main->interp != NULL && 513 strcmp(obj_main->interp, obj_rtld.path) != 0) { 514 free(obj_rtld.path); 515 obj_rtld.path = xstrdup(obj_main->interp); 516 __progname = obj_rtld.path; 517 } 518 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); 523 524 linkmap_add(obj_main); 525 linkmap_add(&obj_rtld); 526 527 /* Link the main program into the list of objects. */ 528 *obj_tail = obj_main; 529 obj_tail = &obj_main->next; 530 obj_count++; 531 obj_loads++; 532 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; 537 538 if (!libmap_disable) 539 libmap_disable = (bool)lm_init(libmap_override); 540 541 dbg("loading LD_PRELOAD libraries"); 542 if (load_preload_objects() == -1) 543 die(); 544 preload_tail = obj_tail; 545 546 dbg("loading needed objects"); 547 if (load_needed_objects(obj_main, 0) == -1) 548 die(); 549 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; 556 } else { 557 objlist_push_tail(&list_main, obj); 558 } 559 obj->refcount++; 560 } 561 562 dbg("checking for required versions"); 563 if (rtld_verify_versions(&list_main) == -1 && !ld_tracing) 564 die(); 565 566 if (ld_tracing) { /* We're done */ 567 trace_loaded_objects(obj_main); 568 exit(0); 569 } 570 571 if (getenv(LD_ "DUMP_REL_PRE") != NULL) { 572 dump_relocations(obj_main); 573 exit (0); 574 } 575 576 /* 577 * Processing tls relocations requires having the tls offsets 578 * initialized. Prepare offsets before starting initial 579 * relocation processing. 580 */ 581 dbg("initializing initial thread local storage offsets"); 582 STAILQ_FOREACH(entry, &list_main, link) { 583 /* 584 * Allocate all the initial objects out of the static TLS 585 * block even if they didn't ask for it. 586 */ 587 allocate_tls_offset(entry->obj); 588 } 589 590 if (relocate_objects(obj_main, 591 ld_bind_now != NULL && *ld_bind_now != '\0', 592 &obj_rtld, SYMLOOK_EARLY, NULL) == -1) 593 die(); 594 595 dbg("doing copy relocations"); 596 if (do_copy_relocations(obj_main) == -1) 597 die(); 598 599 if (getenv(LD_ "DUMP_REL_POST") != NULL) { 600 dump_relocations(obj_main); 601 exit (0); 602 } 603 604 /* 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. 608 */ 609 dbg("initializing initial thread local storage"); 610 allocate_initial_tls(obj_list); 611 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); 616 617 /* Make a list of init functions to call. */ 618 objlist_init(&initlist); 619 initlist_add_objects(obj_list, preload_tail, &initlist); 620 621 r_debug_state(NULL, &obj_main->linkmap); /* say hello to gdb! */ 622 623 map_stacks_exec(NULL); 624 625 dbg("resolving ifuncs"); 626 if (resolve_objects_ifunc(obj_main, 627 ld_bind_now != NULL && *ld_bind_now != '\0', SYMLOOK_EARLY, 628 NULL) == -1) 629 die(); 630 631 if (!obj_main->crt_no_init) { 632 /* 633 * Make sure we don't call the main program's init and fini 634 * functions for binaries linked with old crt1 which calls 635 * _init itself. 636 */ 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; 640 } 641 642 wlock_acquire(rtld_bind_lock, &lockstate); 643 if (obj_main->crt_no_init) 644 preinit_main(); 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); 652 } 653 lock_release(rtld_bind_lock, &lockstate); 654 655 dbg("transferring control to program entry point = %p", obj_main->entry); 656 657 /* Return the exit procedure and the program entry point. */ 658 *exit_proc = rtld_exit; 659 *objp = obj_main; 660 return (func_ptr_type) obj_main->entry; 661 } 662 663 void * 664 rtld_resolve_ifunc(const Obj_Entry *obj, const Elf_Sym *def) 665 { 666 void *ptr; 667 Elf_Addr target; 668 669 ptr = (void *)make_function_pointer(def, obj); 670 target = ((Elf_Addr (*)(void))ptr)(); 671 return ((void *)target); 672 } 673 674 Elf_Addr 675 _rtld_bind(Obj_Entry *obj, Elf_Size reloff) 676 { 677 const Elf_Rel *rel; 678 const Elf_Sym *def; 679 const Obj_Entry *defobj; 680 Elf_Addr *where; 681 Elf_Addr target; 682 RtldLockState lockstate; 683 684 rlock_acquire(rtld_bind_lock, &lockstate); 685 if (sigsetjmp(lockstate.env, 0) != 0) 686 lock_upgrade(rtld_bind_lock, &lockstate); 687 if (obj->pltrel) 688 rel = (const Elf_Rel *) ((caddr_t) obj->pltrel + reloff); 689 else 690 rel = (const Elf_Rel *) ((caddr_t) obj->pltrela + reloff); 691 692 where = (Elf_Addr *) (obj->relocbase + rel->r_offset); 693 def = find_symdef(ELF_R_SYM(rel->r_info), obj, &defobj, true, NULL, 694 &lockstate); 695 if (def == NULL) 696 die(); 697 if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC) 698 target = (Elf_Addr)rtld_resolve_ifunc(defobj, def); 699 else 700 target = (Elf_Addr)(defobj->relocbase + def->st_value); 701 702 dbg("\"%s\" in \"%s\" ==> %p in \"%s\"", 703 defobj->strtab + def->st_name, basename(obj->path), 704 (void *)target, basename(defobj->path)); 705 706 /* 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. 712 */ 713 target = reloc_jmpslot(where, target, defobj, obj, rel); 714 lock_release(rtld_bind_lock, &lockstate); 715 return target; 716 } 717 718 /* 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. 722 */ 723 void 724 _rtld_error(const char *fmt, ...) 725 { 726 static char buf[512]; 727 va_list ap; 728 729 va_start(ap, fmt); 730 rtld_vsnprintf(buf, sizeof buf, fmt, ap); 731 error_message = buf; 732 va_end(ap); 733 } 734 735 /* 736 * Return a dynamically-allocated copy of the current error message, if any. 737 */ 738 static char * 739 errmsg_save(void) 740 { 741 return error_message == NULL ? NULL : xstrdup(error_message); 742 } 743 744 /* 745 * Restore the current error message from a copy which was previously saved 746 * by errmsg_save(). The copy is freed. 747 */ 748 static void 749 errmsg_restore(char *saved_msg) 750 { 751 if (saved_msg == NULL) 752 error_message = NULL; 753 else { 754 _rtld_error("%s", saved_msg); 755 free(saved_msg); 756 } 757 } 758 759 static const char * 760 basename(const char *name) 761 { 762 const char *p = strrchr(name, '/'); 763 return p != NULL ? p + 1 : name; 764 } 765 766 static struct utsname uts; 767 768 static char * 769 origin_subst_one(char *real, const char *kw, const char *subst, 770 bool may_free) 771 { 772 char *p, *p1, *res, *resp; 773 int subst_len, kw_len, subst_count, old_len, new_len; 774 775 kw_len = strlen(kw); 776 777 /* 778 * First, count the number of the keyword occurences, to 779 * preallocate the final string. 780 */ 781 for (p = real, subst_count = 0;; p = p1 + kw_len, subst_count++) { 782 p1 = strstr(p, kw); 783 if (p1 == NULL) 784 break; 785 } 786 787 /* 788 * If the keyword is not found, just return. 789 */ 790 if (subst_count == 0) 791 return (may_free ? real : xstrdup(real)); 792 793 /* 794 * There is indeed something to substitute. Calculate the 795 * length of the resulting string, and allocate it. 796 */ 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); 801 802 /* 803 * Now, execute the substitution loop. 804 */ 805 for (p = real, resp = res, *resp = '\0';;) { 806 p1 = strstr(p, kw); 807 if (p1 != NULL) { 808 /* Copy the prefix before keyword. */ 809 memcpy(resp, p, p1 - p); 810 resp += p1 - p; 811 /* Keyword replacement. */ 812 memcpy(resp, subst, subst_len); 813 resp += subst_len; 814 *resp = '\0'; 815 p = p1 + kw_len; 816 } else 817 break; 818 } 819 820 /* Copy to the end of string and finish. */ 821 strcat(resp, p); 822 if (may_free) 823 free(real); 824 return (res); 825 } 826 827 static char * 828 origin_subst(char *real, const char *origin_path) 829 { 830 char *res1, *res2, *res3, *res4; 831 832 if (uts.sysname[0] == '\0') { 833 if (uname(&uts) != 0) { 834 _rtld_error("utsname failed: %d", errno); 835 return (NULL); 836 } 837 } 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); 842 return (res4); 843 } 844 845 static void 846 die(void) 847 { 848 const char *msg = dlerror(); 849 850 if (msg == NULL) 851 msg = "Fatal error"; 852 rtld_fdputstr(STDERR_FILENO, msg); 853 rtld_fdputchar(STDERR_FILENO, '\n'); 854 _exit(1); 855 } 856 857 /* 858 * Process a shared object's DYNAMIC section, and save the important 859 * information in its Obj_Entry structure. 860 */ 861 static void 862 digest_dynamic1(Obj_Entry *obj, int early, const Elf_Dyn **dyn_rpath, 863 const Elf_Dyn **dyn_soname, const Elf_Dyn **dyn_runpath) 864 { 865 const Elf_Dyn *dynp; 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; 872 int bloom_size32; 873 bool nmw_power2; 874 int plttype = DT_REL; 875 876 *dyn_rpath = NULL; 877 *dyn_soname = NULL; 878 *dyn_runpath = NULL; 879 880 obj->bind_now = false; 881 for (dynp = obj->dynamic; dynp->d_tag != DT_NULL; dynp++) { 882 switch (dynp->d_tag) { 883 884 case DT_REL: 885 obj->rel = (const Elf_Rel *) (obj->relocbase + dynp->d_un.d_ptr); 886 break; 887 888 case DT_RELSZ: 889 obj->relsize = dynp->d_un.d_val; 890 break; 891 892 case DT_RELENT: 893 assert(dynp->d_un.d_val == sizeof(Elf_Rel)); 894 break; 895 896 case DT_JMPREL: 897 obj->pltrel = (const Elf_Rel *) 898 (obj->relocbase + dynp->d_un.d_ptr); 899 break; 900 901 case DT_PLTRELSZ: 902 obj->pltrelsize = dynp->d_un.d_val; 903 break; 904 905 case DT_RELA: 906 obj->rela = (const Elf_Rela *) (obj->relocbase + dynp->d_un.d_ptr); 907 break; 908 909 case DT_RELASZ: 910 obj->relasize = dynp->d_un.d_val; 911 break; 912 913 case DT_RELAENT: 914 assert(dynp->d_un.d_val == sizeof(Elf_Rela)); 915 break; 916 917 case DT_PLTREL: 918 plttype = dynp->d_un.d_val; 919 assert(dynp->d_un.d_val == DT_REL || plttype == DT_RELA); 920 break; 921 922 case DT_SYMTAB: 923 obj->symtab = (const Elf_Sym *) 924 (obj->relocbase + dynp->d_un.d_ptr); 925 break; 926 927 case DT_SYMENT: 928 assert(dynp->d_un.d_val == sizeof(Elf_Sym)); 929 break; 930 931 case DT_STRTAB: 932 obj->strtab = (const char *) (obj->relocbase + dynp->d_un.d_ptr); 933 break; 934 935 case DT_STRSZ: 936 obj->strsize = dynp->d_un.d_val; 937 break; 938 939 case DT_VERNEED: 940 obj->verneed = (const Elf_Verneed *) (obj->relocbase + 941 dynp->d_un.d_val); 942 break; 943 944 case DT_VERNEEDNUM: 945 obj->verneednum = dynp->d_un.d_val; 946 break; 947 948 case DT_VERDEF: 949 obj->verdef = (const Elf_Verdef *) (obj->relocbase + 950 dynp->d_un.d_val); 951 break; 952 953 case DT_VERDEFNUM: 954 obj->verdefnum = dynp->d_un.d_val; 955 break; 956 957 case DT_VERSYM: 958 obj->versyms = (const Elf_Versym *)(obj->relocbase + 959 dynp->d_un.d_val); 960 break; 961 962 case DT_HASH: 963 { 964 hashtab = (const Elf_Hashelt *)(obj->relocbase + 965 dynp->d_un.d_ptr); 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; 972 } 973 break; 974 975 case DT_GNU_HASH: 976 { 977 hashtab = (const Elf_Hashelt *)(obj->relocbase + 978 dynp->d_un.d_ptr); 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 - 990 obj->symndx_gnu; 991 obj->valid_hash_gnu = nmw_power2 && obj->nbuckets_gnu > 0 && 992 obj->buckets_gnu != NULL; 993 } 994 break; 995 996 case DT_NEEDED: 997 if (!obj->rtld) { 998 Needed_Entry *nep = NEW(Needed_Entry); 999 nep->name = dynp->d_un.d_val; 1000 nep->obj = NULL; 1001 nep->next = NULL; 1002 1003 *needed_tail = nep; 1004 needed_tail = &nep->next; 1005 } 1006 break; 1007 1008 case DT_FILTER: 1009 if (!obj->rtld) { 1010 Needed_Entry *nep = NEW(Needed_Entry); 1011 nep->name = dynp->d_un.d_val; 1012 nep->obj = NULL; 1013 nep->next = NULL; 1014 1015 *needed_filtees_tail = nep; 1016 needed_filtees_tail = &nep->next; 1017 } 1018 break; 1019 1020 case DT_AUXILIARY: 1021 if (!obj->rtld) { 1022 Needed_Entry *nep = NEW(Needed_Entry); 1023 nep->name = dynp->d_un.d_val; 1024 nep->obj = NULL; 1025 nep->next = NULL; 1026 1027 *needed_aux_filtees_tail = nep; 1028 needed_aux_filtees_tail = &nep->next; 1029 } 1030 break; 1031 1032 case DT_PLTGOT: 1033 obj->pltgot = (Elf_Addr *) (obj->relocbase + dynp->d_un.d_ptr); 1034 break; 1035 1036 case DT_TEXTREL: 1037 obj->textrel = true; 1038 break; 1039 1040 case DT_SYMBOLIC: 1041 obj->symbolic = true; 1042 break; 1043 1044 case DT_RPATH: 1045 /* 1046 * We have to wait until later to process this, because we 1047 * might not have gotten the address of the string table yet. 1048 */ 1049 *dyn_rpath = dynp; 1050 break; 1051 1052 case DT_SONAME: 1053 *dyn_soname = dynp; 1054 break; 1055 1056 case DT_RUNPATH: 1057 *dyn_runpath = dynp; 1058 break; 1059 1060 case DT_INIT: 1061 obj->init = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr); 1062 break; 1063 1064 case DT_PREINIT_ARRAY: 1065 obj->preinit_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1066 break; 1067 1068 case DT_PREINIT_ARRAYSZ: 1069 obj->preinit_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1070 break; 1071 1072 case DT_INIT_ARRAY: 1073 obj->init_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1074 break; 1075 1076 case DT_INIT_ARRAYSZ: 1077 obj->init_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1078 break; 1079 1080 case DT_FINI: 1081 obj->fini = (Elf_Addr) (obj->relocbase + dynp->d_un.d_ptr); 1082 break; 1083 1084 case DT_FINI_ARRAY: 1085 obj->fini_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1086 break; 1087 1088 case DT_FINI_ARRAYSZ: 1089 obj->fini_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1090 break; 1091 1092 /* 1093 * Don't process DT_DEBUG on MIPS as the dynamic section 1094 * is mapped read-only. DT_MIPS_RLD_MAP is used instead. 1095 */ 1096 1097 #ifndef __mips__ 1098 case DT_DEBUG: 1099 /* XXX - not implemented yet */ 1100 if (!early) 1101 dbg("Filling in DT_DEBUG entry"); 1102 ((Elf_Dyn*)dynp)->d_un.d_ptr = (Elf_Addr) &r_debug; 1103 break; 1104 #endif 1105 1106 case DT_FLAGS: 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) 1116 ;*/ 1117 break; 1118 #ifdef __mips__ 1119 case DT_MIPS_LOCAL_GOTNO: 1120 obj->local_gotno = dynp->d_un.d_val; 1121 break; 1122 1123 case DT_MIPS_SYMTABNO: 1124 obj->symtabno = dynp->d_un.d_val; 1125 break; 1126 1127 case DT_MIPS_GOTSYM: 1128 obj->gotsym = dynp->d_un.d_val; 1129 break; 1130 1131 case DT_MIPS_RLD_MAP: 1132 *((Elf_Addr *)(dynp->d_un.d_ptr)) = (Elf_Addr) &r_debug; 1133 break; 1134 #endif 1135 1136 case DT_FLAGS_1: 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) 1142 XXX ;*/ 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; 1153 break; 1154 1155 default: 1156 if (!early) { 1157 dbg("Ignoring d_tag %ld = %#lx", (long)dynp->d_tag, 1158 (long)dynp->d_tag); 1159 } 1160 break; 1161 } 1162 } 1163 1164 obj->traced = false; 1165 1166 if (plttype == DT_RELA) { 1167 obj->pltrela = (const Elf_Rela *) obj->pltrel; 1168 obj->pltrel = NULL; 1169 obj->pltrelasize = obj->pltrelsize; 1170 obj->pltrelsize = 0; 1171 } 1172 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) 1180 continue; 1181 hashval = &obj->chain_zero_gnu[obj->buckets_gnu[bkt]]; 1182 do 1183 obj->dynsymcount++; 1184 while ((*hashval++ & 1u) == 0); 1185 } 1186 obj->dynsymcount += obj->symndx_gnu; 1187 } 1188 } 1189 1190 static void 1191 digest_dynamic2(Obj_Entry *obj, const Elf_Dyn *dyn_rpath, 1192 const Elf_Dyn *dyn_soname, const Elf_Dyn *dyn_runpath) 1193 { 1194 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) 1198 die(); 1199 } 1200 1201 if (dyn_runpath != NULL) { 1202 obj->runpath = (char *)obj->strtab + dyn_runpath->d_un.d_val; 1203 if (obj->z_origin) 1204 obj->runpath = origin_subst(obj->runpath, obj->origin_path); 1205 } 1206 else if (dyn_rpath != NULL) { 1207 obj->rpath = (char *)obj->strtab + dyn_rpath->d_un.d_val; 1208 if (obj->z_origin) 1209 obj->rpath = origin_subst(obj->rpath, obj->origin_path); 1210 } 1211 1212 if (dyn_soname != NULL) 1213 object_add_name(obj, obj->strtab + dyn_soname->d_un.d_val); 1214 } 1215 1216 static void 1217 digest_dynamic(Obj_Entry *obj, int early) 1218 { 1219 const Elf_Dyn *dyn_rpath; 1220 const Elf_Dyn *dyn_soname; 1221 const Elf_Dyn *dyn_runpath; 1222 1223 digest_dynamic1(obj, early, &dyn_rpath, &dyn_soname, &dyn_runpath); 1224 digest_dynamic2(obj, dyn_rpath, dyn_soname, dyn_runpath); 1225 } 1226 1227 /* 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. 1232 */ 1233 static Obj_Entry * 1234 digest_phdr(const Elf_Phdr *phdr, int phnum, caddr_t entry, const char *path) 1235 { 1236 Obj_Entry *obj; 1237 const Elf_Phdr *phlimit = phdr + phnum; 1238 const Elf_Phdr *ph; 1239 Elf_Addr note_start, note_end; 1240 int nsegs = 0; 1241 1242 obj = obj_new(); 1243 for (ph = phdr; ph < phlimit; ph++) { 1244 if (ph->p_type != PT_PHDR) 1245 continue; 1246 1247 obj->phdr = phdr; 1248 obj->phsize = ph->p_memsz; 1249 obj->relocbase = (caddr_t)phdr - ph->p_vaddr; 1250 break; 1251 } 1252 1253 obj->stack_flags = PF_X | PF_R | PF_W; 1254 1255 for (ph = phdr; ph < phlimit; ph++) { 1256 switch (ph->p_type) { 1257 1258 case PT_INTERP: 1259 obj->interp = (const char *)(ph->p_vaddr + obj->relocbase); 1260 break; 1261 1262 case PT_LOAD: 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) - 1267 obj->vaddrbase; 1268 } else { /* Last load segment */ 1269 obj->mapsize = round_page(ph->p_vaddr + ph->p_memsz) - 1270 obj->vaddrbase; 1271 } 1272 nsegs++; 1273 break; 1274 1275 case PT_DYNAMIC: 1276 obj->dynamic = (const Elf_Dyn *)(ph->p_vaddr + obj->relocbase); 1277 break; 1278 1279 case PT_TLS: 1280 obj->tlsindex = 1; 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); 1285 break; 1286 1287 case PT_GNU_STACK: 1288 obj->stack_flags = ph->p_flags; 1289 break; 1290 1291 case PT_GNU_RELRO: 1292 obj->relro_page = obj->relocbase + trunc_page(ph->p_vaddr); 1293 obj->relro_size = round_page(ph->p_memsz); 1294 break; 1295 1296 case PT_NOTE: 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); 1300 break; 1301 } 1302 } 1303 if (nsegs < 1) { 1304 _rtld_error("%s: too few PT_LOAD segments", path); 1305 return NULL; 1306 } 1307 1308 obj->entry = entry; 1309 return obj; 1310 } 1311 1312 void 1313 digest_notes(Obj_Entry *obj, Elf_Addr note_start, Elf_Addr note_end) 1314 { 1315 const Elf_Note *note; 1316 const char *note_name; 1317 uintptr_t p; 1318 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)) 1325 continue; 1326 if (note->n_type != ABI_NOTETYPE && 1327 note->n_type != CRT_NOINIT_NOTETYPE) 1328 continue; 1329 note_name = (const char *)(note + 1); 1330 if (strncmp(NOTE_FREEBSD_VENDOR, note_name, 1331 sizeof(NOTE_FREEBSD_VENDOR)) != 0) 1332 continue; 1333 switch (note->n_type) { 1334 case ABI_NOTETYPE: 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); 1340 break; 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"); 1345 break; 1346 } 1347 } 1348 } 1349 1350 static Obj_Entry * 1351 dlcheck(void *handle) 1352 { 1353 Obj_Entry *obj; 1354 1355 for (obj = obj_list; obj != NULL; obj = obj->next) 1356 if (obj == (Obj_Entry *) handle) 1357 break; 1358 1359 if (obj == NULL || obj->refcount == 0 || obj->dl_refcount == 0) { 1360 _rtld_error("Invalid shared object handle %p", handle); 1361 return NULL; 1362 } 1363 return obj; 1364 } 1365 1366 /* 1367 * If the given object is already in the donelist, return true. Otherwise 1368 * add the object to the list and return false. 1369 */ 1370 static bool 1371 donelist_check(DoneList *dlp, const Obj_Entry *obj) 1372 { 1373 unsigned int i; 1374 1375 for (i = 0; i < dlp->num_used; i++) 1376 if (dlp->objs[i] == obj) 1377 return true; 1378 /* 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. 1383 */ 1384 if (dlp->num_used < dlp->num_alloc) 1385 dlp->objs[dlp->num_used++] = obj; 1386 return false; 1387 } 1388 1389 /* 1390 * Hash function for symbol table lookup. Don't even think about changing 1391 * this. It is specified by the System V ABI. 1392 */ 1393 unsigned long 1394 elf_hash(const char *name) 1395 { 1396 const unsigned char *p = (const unsigned char *) name; 1397 unsigned long h = 0; 1398 unsigned long g; 1399 1400 while (*p != '\0') { 1401 h = (h << 4) + *p++; 1402 if ((g = h & 0xf0000000) != 0) 1403 h ^= g >> 24; 1404 h &= ~g; 1405 } 1406 return h; 1407 } 1408 1409 /* 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. 1412 */ 1413 static uint32_t 1414 gnu_hash(const char *s) 1415 { 1416 uint32_t h; 1417 unsigned char c; 1418 1419 h = 5381; 1420 for (c = *s; c != '\0'; c = *++s) 1421 h = h * 33 + c; 1422 return (h & 0xffffffff); 1423 } 1424 1425 1426 /* 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. 1430 * 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. 1433 * 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 1436 * argument. 1437 * 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) 1441 * LD_LIBRARY_PATH 1442 * DT_RUNPATH in the referencing file 1443 * ldconfig hints (if -z nodefaultlib, filter out default library directories 1444 * from list) 1445 * /lib:/usr/lib _unless_ the referencing file is linked with -z nodefaultlib 1446 * 1447 * (1) Handled in digest_dynamic2 - rpath left NULL if runpath defined. 1448 */ 1449 static char * 1450 find_library(const char *xname, const Obj_Entry *refobj, int *fdp) 1451 { 1452 char *pathname; 1453 char *name; 1454 bool nodeflib, objgiven; 1455 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\"", 1460 xname); 1461 return NULL; 1462 } 1463 if (objgiven && refobj->z_origin) { 1464 return (origin_subst(__DECONST(char *, xname), 1465 refobj->origin_path)); 1466 } else { 1467 return (xstrdup(xname)); 1468 } 1469 } 1470 1471 if (libmap_disable || !objgiven || 1472 (name = lm_find(refobj->path, xname)) == NULL) 1473 name = (char *)xname; 1474 1475 dbg(" Searching for \"%s\"", name); 1476 1477 /* 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 1481 * nodeflib. 1482 */ 1483 if (objgiven && refobj->rpath != NULL && ld_library_path_rpath) { 1484 if ((pathname = search_library_path(name, ld_library_path)) != NULL || 1485 (refobj != 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) 1490 return (pathname); 1491 } else { 1492 nodeflib = objgiven ? refobj->z_nodeflib : false; 1493 if ((objgiven && 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 || 1498 (objgiven && 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)) 1504 return (pathname); 1505 } 1506 1507 if (objgiven && refobj->path != NULL) { 1508 _rtld_error("Shared object \"%s\" not found, required by \"%s\"", 1509 name, basename(refobj->path)); 1510 } else { 1511 _rtld_error("Shared object \"%s\" not found", name); 1512 } 1513 return NULL; 1514 } 1515 1516 /* 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. 1521 */ 1522 const Elf_Sym * 1523 find_symdef(unsigned long symnum, const Obj_Entry *refobj, 1524 const Obj_Entry **defobj_out, int flags, SymCache *cache, 1525 RtldLockState *lockstate) 1526 { 1527 const Elf_Sym *ref; 1528 const Elf_Sym *def; 1529 const Obj_Entry *defobj; 1530 SymLook req; 1531 const char *name; 1532 int res; 1533 1534 /* 1535 * If we have already found this symbol, get the information from 1536 * the cache. 1537 */ 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; 1543 } 1544 1545 ref = refobj->symtab + symnum; 1546 name = refobj->strtab + ref->st_name; 1547 def = NULL; 1548 defobj = NULL; 1549 1550 /* 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. 1557 */ 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, 1561 symnum); 1562 } 1563 symlook_init(&req, name); 1564 req.flags = flags; 1565 req.ventry = fetch_ventry(refobj, symnum); 1566 req.lockstate = lockstate; 1567 res = symlook_default(&req, refobj); 1568 if (res == 0) { 1569 def = req.sym_out; 1570 defobj = req.defobj_out; 1571 } 1572 } else { 1573 def = ref; 1574 defobj = refobj; 1575 } 1576 1577 /* 1578 * If we found no definition and the reference is weak, treat the 1579 * symbol as having the value zero. 1580 */ 1581 if (def == NULL && ELF_ST_BIND(ref->st_info) == STB_WEAK) { 1582 def = &sym_zero; 1583 defobj = obj_main; 1584 } 1585 1586 if (def != NULL) { 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; 1592 } 1593 } else { 1594 if (refobj != &obj_rtld) 1595 _rtld_error("%s: Undefined symbol \"%s\"", refobj->path, name); 1596 } 1597 return def; 1598 } 1599 1600 /* 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. 1604 * 1605 * Returns NULL if there are problems with the hints file, 1606 * or if the search path there is empty. 1607 */ 1608 static const char * 1609 gethints(bool nostdlib) 1610 { 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; 1616 char *p; 1617 unsigned int SLPndx, hintndx, fndx, fcount; 1618 int fd; 1619 size_t flen; 1620 bool skip; 1621 1622 /* First call, read the hints file */ 1623 if (hints == NULL) { 1624 /* Keep from trying again in case the hints file is bad. */ 1625 hints = ""; 1626 1627 if ((fd = open(ld_elf_hints_path, O_RDONLY | O_CLOEXEC)) == -1) 1628 return (NULL); 1629 if (read(fd, &hdr, sizeof hdr) != sizeof hdr || 1630 hdr.magic != ELFHINTS_MAGIC || 1631 hdr.version != 1) { 1632 close(fd); 1633 return (NULL); 1634 } 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) { 1639 free(p); 1640 close(fd); 1641 return (NULL); 1642 } 1643 hints = p; 1644 close(fd); 1645 } 1646 1647 /* 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. 1651 */ 1652 if (!nostdlib) 1653 return (hints[0] != '\0' ? hints : NULL); 1654 if (filtered_path != NULL) 1655 goto filt_ret; 1656 1657 /* 1658 * Obtain the list of all configured search paths, and the 1659 * list of the default paths. 1660 * 1661 * First estimate the size of the results. 1662 */ 1663 smeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 1664 smeta.dls_cnt = 0; 1665 hmeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 1666 hmeta.dls_cnt = 0; 1667 1668 sargs.request = RTLD_DI_SERINFOSIZE; 1669 sargs.serinfo = &smeta; 1670 hargs.request = RTLD_DI_SERINFOSIZE; 1671 hargs.serinfo = &hmeta; 1672 1673 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs); 1674 path_enumerate(p, fill_search_info, &hargs); 1675 1676 SLPinfo = xmalloc(smeta.dls_size); 1677 hintinfo = xmalloc(hmeta.dls_size); 1678 1679 /* 1680 * Next fetch both sets of paths. 1681 */ 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]; 1686 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]; 1691 1692 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &sargs); 1693 path_enumerate(p, fill_search_info, &hargs); 1694 1695 /* 1696 * Now calculate the difference between two sets, by excluding 1697 * standard paths from the full set. 1698 */ 1699 fndx = 0; 1700 fcount = 0; 1701 filtered_path = xmalloc(hdr.dirlistlen + 1); 1702 hintpath = &hintinfo->dls_serpath[0]; 1703 for (hintndx = 0; hintndx < hmeta.dls_cnt; hintndx++, hintpath++) { 1704 skip = false; 1705 SLPpath = &SLPinfo->dls_serpath[0]; 1706 /* 1707 * Check each standard path against current. 1708 */ 1709 for (SLPndx = 0; SLPndx < smeta.dls_cnt; SLPndx++, SLPpath++) { 1710 /* matched, skip the path */ 1711 if (!strcmp(hintpath->dls_name, SLPpath->dls_name)) { 1712 skip = true; 1713 break; 1714 } 1715 } 1716 if (skip) 1717 continue; 1718 /* 1719 * Not matched against any standard path, add the path 1720 * to result. Separate consequtive paths with ':'. 1721 */ 1722 if (fcount > 0) { 1723 filtered_path[fndx] = ':'; 1724 fndx++; 1725 } 1726 fcount++; 1727 flen = strlen(hintpath->dls_name); 1728 strncpy((filtered_path + fndx), hintpath->dls_name, flen); 1729 fndx += flen; 1730 } 1731 filtered_path[fndx] = '\0'; 1732 1733 free(SLPinfo); 1734 free(hintinfo); 1735 1736 filt_ret: 1737 return (filtered_path[0] != '\0' ? filtered_path : NULL); 1738 } 1739 1740 static void 1741 init_dag(Obj_Entry *root) 1742 { 1743 const Needed_Entry *needed; 1744 const Objlist_Entry *elm; 1745 DoneList donelist; 1746 1747 if (root->dag_inited) 1748 return; 1749 donelist_init(&donelist); 1750 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); 1755 1756 /* 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. 1760 */ 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)) 1764 continue; 1765 objlist_push_tail(&needed->obj->dldags, root); 1766 objlist_push_tail(&root->dagmembers, needed->obj); 1767 } 1768 } 1769 root->dag_inited = true; 1770 } 1771 1772 static void 1773 process_nodelete(Obj_Entry *root) 1774 { 1775 const Objlist_Entry *elm; 1776 1777 /* 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. 1781 */ 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); 1786 init_dag(elm->obj); 1787 ref_dag(elm->obj); 1788 elm->obj->ref_nodel = true; 1789 } 1790 } 1791 } 1792 /* 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. 1796 */ 1797 static void 1798 init_rtld(caddr_t mapbase, Elf_Auxinfo **aux_info) 1799 { 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; 1804 1805 /* 1806 * Conjure up an Obj_Entry structure for the dynamic linker. 1807 * 1808 * The "path" member can't be initialized yet because string constants 1809 * cannot yet be accessed. Below we will set it correctly. 1810 */ 1811 memset(&objtmp, 0, sizeof(objtmp)); 1812 objtmp.path = NULL; 1813 objtmp.rtld = true; 1814 objtmp.mapbase = mapbase; 1815 #ifdef PIC 1816 objtmp.relocbase = mapbase; 1817 #endif 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); 1825 #endif 1826 1827 /* 1828 * Temporarily put the dynamic linker entry into the object list, so 1829 * that symbols can be found. 1830 */ 1831 1832 relocate_objects(&objtmp, true, &objtmp, 0, NULL); 1833 } 1834 1835 /* Initialize the object list. */ 1836 obj_tail = &obj_list; 1837 1838 /* Now that non-local variables can be accesses, copy out obj_rtld. */ 1839 memcpy(&obj_rtld, &objtmp, sizeof(obj_rtld)); 1840 1841 /* The page size is required by the dynamic memory allocator. */ 1842 init_pagesizes(aux_info); 1843 1844 if (aux_info[AT_OSRELDATE] != NULL) 1845 osreldate = aux_info[AT_OSRELDATE]->a_un.a_val; 1846 1847 digest_dynamic2(&obj_rtld, dyn_rpath, dyn_soname, dyn_runpath); 1848 1849 /* Replace the path with a dynamically allocated copy. */ 1850 obj_rtld.path = xstrdup(PATH_RTLD); 1851 1852 r_debug.r_brk = r_debug_state; 1853 r_debug.r_state = RT_CONSISTENT; 1854 } 1855 1856 /* 1857 * Retrieve the array of supported page sizes. The kernel provides the page 1858 * sizes in increasing order. 1859 */ 1860 static void 1861 init_pagesizes(Elf_Auxinfo **aux_info) 1862 { 1863 static size_t psa[MAXPAGESIZES]; 1864 int mib[2]; 1865 size_t len, size; 1866 1867 if (aux_info[AT_PAGESIZES] != NULL && aux_info[AT_PAGESIZESLEN] != 1868 NULL) { 1869 size = aux_info[AT_PAGESIZESLEN]->a_un.a_val; 1870 pagesizes = aux_info[AT_PAGESIZES]->a_un.a_ptr; 1871 } else { 1872 len = 2; 1873 if (sysctlnametomib("hw.pagesizes", mib, &len) == 0) 1874 size = sizeof(psa); 1875 else { 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; 1880 goto psa_filled; 1881 } else { 1882 mib[0] = CTL_HW; 1883 mib[1] = HW_PAGESIZE; 1884 len = 2; 1885 } 1886 } 1887 if (sysctl(mib, len, psa, &size, NULL, 0) == -1) { 1888 _rtld_error("sysctl for hw.pagesize(s) failed"); 1889 die(); 1890 } 1891 psa_filled: 1892 pagesizes = psa; 1893 } 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) 1897 npagesizes--; 1898 } 1899 1900 /* 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. 1905 */ 1906 static void 1907 initlist_add_neededs(Needed_Entry *needed, Objlist *list) 1908 { 1909 /* Recursively process the successor needed objects. */ 1910 if (needed->next != NULL) 1911 initlist_add_neededs(needed->next, list); 1912 1913 /* Process the current needed object. */ 1914 if (needed->obj != NULL) 1915 initlist_add_objects(needed->obj, &needed->obj->next, list); 1916 } 1917 1918 /* 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. 1926 */ 1927 static void 1928 initlist_add_objects(Obj_Entry *obj, Obj_Entry **tail, Objlist *list) 1929 { 1930 1931 if (obj->init_scanned || obj->init_done) 1932 return; 1933 obj->init_scanned = true; 1934 1935 /* Recursively process the successor objects. */ 1936 if (&obj->next != tail) 1937 initlist_add_objects(obj->next, tail, list); 1938 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); 1946 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); 1951 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; 1957 } 1958 } 1959 1960 #ifndef FPTR_TARGET 1961 #define FPTR_TARGET(f) ((Elf_Addr) (f)) 1962 #endif 1963 1964 static void 1965 free_needed_filtees(Needed_Entry *n) 1966 { 1967 Needed_Entry *needed, *needed1; 1968 1969 for (needed = n; needed != NULL; needed = needed->next) { 1970 if (needed->obj != NULL) { 1971 dlclose(needed->obj); 1972 needed->obj = NULL; 1973 } 1974 } 1975 for (needed = n; needed != NULL; needed = needed1) { 1976 needed1 = needed->next; 1977 free(needed); 1978 } 1979 } 1980 1981 static void 1982 unload_filtees(Obj_Entry *obj) 1983 { 1984 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; 1990 } 1991 1992 static void 1993 load_filtee1(Obj_Entry *obj, Needed_Entry *needed, int flags, 1994 RtldLockState *lockstate) 1995 { 1996 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); 2001 } 2002 } 2003 2004 static void 2005 load_filtees(Obj_Entry *obj, int flags, RtldLockState *lockstate) 2006 { 2007 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; 2013 } 2014 } 2015 2016 static int 2017 process_needed(Obj_Entry *obj, Needed_Entry *needed, int flags) 2018 { 2019 Obj_Entry *obj1; 2020 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) 2025 return (-1); 2026 } 2027 return (0); 2028 } 2029 2030 /* 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. 2034 */ 2035 static int 2036 load_needed_objects(Obj_Entry *first, int flags) 2037 { 2038 Obj_Entry *obj; 2039 2040 for (obj = first; obj != NULL; obj = obj->next) { 2041 if (process_needed(obj, obj->needed, flags) == -1) 2042 return (-1); 2043 } 2044 return (0); 2045 } 2046 2047 static int 2048 load_preload_objects(void) 2049 { 2050 char *p = ld_preload; 2051 Obj_Entry *obj; 2052 static const char delim[] = " \t:;"; 2053 2054 if (p == NULL) 2055 return 0; 2056 2057 p += strspn(p, delim); 2058 while (*p != '\0') { 2059 size_t len = strcspn(p, delim); 2060 char savech; 2061 2062 savech = p[len]; 2063 p[len] = '\0'; 2064 obj = load_object(p, -1, NULL, 0); 2065 if (obj == NULL) 2066 return -1; /* XXX - cleanup */ 2067 obj->z_interpose = true; 2068 p[len] = savech; 2069 p += len; 2070 p += strspn(p, delim); 2071 } 2072 LD_UTRACE(UTRACE_PRELOAD_FINISHED, NULL, NULL, 0, 0, NULL); 2073 return 0; 2074 } 2075 2076 static const char * 2077 printable_path(const char *path) 2078 { 2079 2080 return (path == NULL ? "<unknown>" : path); 2081 } 2082 2083 /* 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 2087 * duplicate is. 2088 * 2089 * Returns a pointer to the Obj_Entry for the object. Returns NULL 2090 * on failure. 2091 */ 2092 static Obj_Entry * 2093 load_object(const char *name, int fd_u, const Obj_Entry *refobj, int flags) 2094 { 2095 Obj_Entry *obj; 2096 int fd; 2097 struct stat sb; 2098 char *path; 2099 2100 fd = -1; 2101 if (name != NULL) { 2102 for (obj = obj_list->next; obj != NULL; obj = obj->next) { 2103 if (object_match_name(obj, name)) 2104 return (obj); 2105 } 2106 2107 path = find_library(name, refobj, &fd); 2108 if (path == NULL) 2109 return (NULL); 2110 } else 2111 path = NULL; 2112 2113 if (fd >= 0) { 2114 /* 2115 * search_library_pathfds() opens a fresh file descriptor for the 2116 * library, so there is no need to dup(). 2117 */ 2118 } else if (fd_u == -1) { 2119 /* 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 ".." 2123 * in pathnames. 2124 * 2125 * To avoid a race, we open the file and use fstat() rather than 2126 * using stat(). 2127 */ 2128 if ((fd = open(path, O_RDONLY | O_CLOEXEC)) == -1) { 2129 _rtld_error("Cannot open \"%s\"", path); 2130 free(path); 2131 return (NULL); 2132 } 2133 } else { 2134 fd = fcntl(fd_u, F_DUPFD_CLOEXEC, 0); 2135 if (fd == -1) { 2136 _rtld_error("Cannot dup fd"); 2137 free(path); 2138 return (NULL); 2139 } 2140 } 2141 if (fstat(fd, &sb) == -1) { 2142 _rtld_error("Cannot fstat \"%s\"", printable_path(path)); 2143 close(fd); 2144 free(path); 2145 return NULL; 2146 } 2147 for (obj = obj_list->next; obj != NULL; obj = obj->next) 2148 if (obj->ino == sb.st_ino && obj->dev == sb.st_dev) 2149 break; 2150 if (obj != NULL && name != NULL) { 2151 object_add_name(obj, name); 2152 free(path); 2153 close(fd); 2154 return obj; 2155 } 2156 if (flags & RTLD_LO_NOLOAD) { 2157 free(path); 2158 close(fd); 2159 return (NULL); 2160 } 2161 2162 /* First use of this object, so we must map it in */ 2163 obj = do_load_object(fd, name, path, &sb, flags); 2164 if (obj == NULL) 2165 free(path); 2166 close(fd); 2167 2168 return obj; 2169 } 2170 2171 static Obj_Entry * 2172 do_load_object(int fd, const char *name, char *path, struct stat *sbp, 2173 int flags) 2174 { 2175 Obj_Entry *obj; 2176 struct statfs fs; 2177 2178 /* 2179 * but first, make sure that environment variables haven't been 2180 * used to circumvent the noexec flag on a filesystem. 2181 */ 2182 if (dangerous_ld_env) { 2183 if (fstatfs(fd, &fs) != 0) { 2184 _rtld_error("Cannot fstatfs \"%s\"", printable_path(path)); 2185 return NULL; 2186 } 2187 if (fs.f_flags & MNT_NOEXEC) { 2188 _rtld_error("Cannot execute objects on %s\n", fs.f_mntonname); 2189 return NULL; 2190 } 2191 } 2192 dbg("loading \"%s\"", printable_path(path)); 2193 obj = map_object(fd, printable_path(path), sbp); 2194 if (obj == NULL) 2195 return NULL; 2196 2197 /* 2198 * If DT_SONAME is present in the object, digest_dynamic2 already 2199 * added it to the object names. 2200 */ 2201 if (name != NULL) 2202 object_add_name(obj, name); 2203 obj->path = path; 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)) == 2208 RTLD_LO_DLOPEN) { 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); 2212 obj_free(obj); 2213 return (NULL); 2214 } 2215 2216 *obj_tail = obj; 2217 obj_tail = &obj->next; 2218 obj_count++; 2219 obj_loads++; 2220 linkmap_add(obj); /* for GDB & dlinfo() */ 2221 max_stack_flags |= obj->stack_flags; 2222 2223 dbg(" %p .. %p: %s", obj->mapbase, 2224 obj->mapbase + obj->mapsize - 1, obj->path); 2225 if (obj->textrel) 2226 dbg(" WARNING: %s has impure text", obj->path); 2227 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0, 2228 obj->path); 2229 2230 return obj; 2231 } 2232 2233 static Obj_Entry * 2234 obj_from_addr(const void *addr) 2235 { 2236 Obj_Entry *obj; 2237 2238 for (obj = obj_list; obj != NULL; obj = obj->next) { 2239 if (addr < (void *) obj->mapbase) 2240 continue; 2241 if (addr < (void *) (obj->mapbase + obj->mapsize)) 2242 return obj; 2243 } 2244 return NULL; 2245 } 2246 2247 static void 2248 preinit_main(void) 2249 { 2250 Elf_Addr *preinit_addr; 2251 int index; 2252 2253 preinit_addr = (Elf_Addr *)obj_main->preinit_array; 2254 if (preinit_addr == NULL) 2255 return; 2256 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]); 2264 } 2265 } 2266 } 2267 2268 /* 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. 2274 */ 2275 static void 2276 objlist_call_fini(Objlist *list, Obj_Entry *root, RtldLockState *lockstate) 2277 { 2278 Objlist_Entry *elm; 2279 char *saved_msg; 2280 Elf_Addr *fini_addr; 2281 int index; 2282 2283 assert(root == NULL || root->refcount == 1); 2284 2285 /* 2286 * Preserve the current error message since a fini function might 2287 * call into the dynamic linker and overwrite it. 2288 */ 2289 saved_msg = errmsg_save(); 2290 do { 2291 STAILQ_FOREACH(elm, list, link) { 2292 if (root != NULL && (elm->obj->refcount != 1 || 2293 objlist_find(&root->dagmembers, elm->obj) == NULL)) 2294 continue; 2295 /* Remove object from fini list to prevent recursive invocation. */ 2296 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link); 2297 /* 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 2302 * called. 2303 */ 2304 lock_release(rtld_bind_lock, lockstate); 2305 2306 /* 2307 * It is legal to have both DT_FINI and DT_FINI_ARRAY defined. 2308 * When this happens, DT_FINI_ARRAY is processed first. 2309 */ 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; 2313 index--) { 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]); 2320 } 2321 } 2322 } 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); 2329 } 2330 wlock_acquire(rtld_bind_lock, lockstate); 2331 /* No need to free anything if process is going down. */ 2332 if (root != NULL) 2333 free(elm); 2334 /* 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. 2338 */ 2339 break; 2340 } 2341 } while (elm != NULL); 2342 errmsg_restore(saved_msg); 2343 } 2344 2345 /* 2346 * Call the initialization functions for each of the objects in 2347 * "list". All of the objects are expected to have non-NULL init 2348 * functions. 2349 */ 2350 static void 2351 objlist_call_init(Objlist *list, RtldLockState *lockstate) 2352 { 2353 Objlist_Entry *elm; 2354 Obj_Entry *obj; 2355 char *saved_msg; 2356 Elf_Addr *init_addr; 2357 int index; 2358 2359 /* 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. 2363 */ 2364 for (obj = obj_list; obj != NULL; obj = obj->next) 2365 obj->init_scanned = false; 2366 2367 /* 2368 * Preserve the current error message since an init function might 2369 * call into the dynamic linker and overwrite it. 2370 */ 2371 saved_msg = errmsg_save(); 2372 STAILQ_FOREACH(elm, list, link) { 2373 if (elm->obj->init_done) /* Initialized early. */ 2374 continue; 2375 /* 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. 2379 */ 2380 elm->obj->init_done = true; 2381 lock_release(rtld_bind_lock, lockstate); 2382 2383 /* 2384 * It is legal to have both DT_INIT and DT_INIT_ARRAY defined. 2385 * When this happens, DT_INIT is processed first. 2386 */ 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); 2393 } 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]); 2403 } 2404 } 2405 } 2406 wlock_acquire(rtld_bind_lock, lockstate); 2407 } 2408 errmsg_restore(saved_msg); 2409 } 2410 2411 static void 2412 objlist_clear(Objlist *list) 2413 { 2414 Objlist_Entry *elm; 2415 2416 while (!STAILQ_EMPTY(list)) { 2417 elm = STAILQ_FIRST(list); 2418 STAILQ_REMOVE_HEAD(list, link); 2419 free(elm); 2420 } 2421 } 2422 2423 static Objlist_Entry * 2424 objlist_find(Objlist *list, const Obj_Entry *obj) 2425 { 2426 Objlist_Entry *elm; 2427 2428 STAILQ_FOREACH(elm, list, link) 2429 if (elm->obj == obj) 2430 return elm; 2431 return NULL; 2432 } 2433 2434 static void 2435 objlist_init(Objlist *list) 2436 { 2437 STAILQ_INIT(list); 2438 } 2439 2440 static void 2441 objlist_push_head(Objlist *list, Obj_Entry *obj) 2442 { 2443 Objlist_Entry *elm; 2444 2445 elm = NEW(Objlist_Entry); 2446 elm->obj = obj; 2447 STAILQ_INSERT_HEAD(list, elm, link); 2448 } 2449 2450 static void 2451 objlist_push_tail(Objlist *list, Obj_Entry *obj) 2452 { 2453 Objlist_Entry *elm; 2454 2455 elm = NEW(Objlist_Entry); 2456 elm->obj = obj; 2457 STAILQ_INSERT_TAIL(list, elm, link); 2458 } 2459 2460 static void 2461 objlist_put_after(Objlist *list, Obj_Entry *listobj, Obj_Entry *obj) 2462 { 2463 Objlist_Entry *elm, *listelm; 2464 2465 STAILQ_FOREACH(listelm, list, link) { 2466 if (listelm->obj == listobj) 2467 break; 2468 } 2469 elm = NEW(Objlist_Entry); 2470 elm->obj = obj; 2471 if (listelm != NULL) 2472 STAILQ_INSERT_AFTER(list, listelm, elm, link); 2473 else 2474 STAILQ_INSERT_TAIL(list, elm, link); 2475 } 2476 2477 static void 2478 objlist_remove(Objlist *list, Obj_Entry *obj) 2479 { 2480 Objlist_Entry *elm; 2481 2482 if ((elm = objlist_find(list, obj)) != NULL) { 2483 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link); 2484 free(elm); 2485 } 2486 } 2487 2488 /* 2489 * Relocate dag rooted in the specified object. 2490 * Returns 0 on success, or -1 on failure. 2491 */ 2492 2493 static int 2494 relocate_object_dag(Obj_Entry *root, bool bind_now, Obj_Entry *rtldobj, 2495 int flags, RtldLockState *lockstate) 2496 { 2497 Objlist_Entry *elm; 2498 int error; 2499 2500 error = 0; 2501 STAILQ_FOREACH(elm, &root->dagmembers, link) { 2502 error = relocate_object(elm->obj, bind_now, rtldobj, flags, 2503 lockstate); 2504 if (error == -1) 2505 break; 2506 } 2507 return (error); 2508 } 2509 2510 /* 2511 * Relocate single object. 2512 * Returns 0 on success, or -1 on failure. 2513 */ 2514 static int 2515 relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj, 2516 int flags, RtldLockState *lockstate) 2517 { 2518 2519 if (obj->relocated) 2520 return (0); 2521 obj->relocated = true; 2522 if (obj != rtldobj) 2523 dbg("relocating \"%s\"", obj->path); 2524 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", 2528 obj->path); 2529 return (-1); 2530 } 2531 2532 if (obj->textrel) { 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)); 2538 return (-1); 2539 } 2540 } 2541 2542 /* Process the non-PLT relocations. */ 2543 if (reloc_non_plt(obj, rtldobj, flags, lockstate)) 2544 return (-1); 2545 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)); 2551 return (-1); 2552 } 2553 } 2554 2555 2556 /* Set the special PLT or GOT entries. */ 2557 init_pltgot(obj); 2558 2559 /* Process the PLT relocations. */ 2560 if (reloc_plt(obj) == -1) 2561 return (-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) 2565 return (-1); 2566 2567 if (obj->relro_size > 0) { 2568 if (mprotect(obj->relro_page, obj->relro_size, 2569 PROT_READ) == -1) { 2570 _rtld_error("%s: Cannot enforce relro protection: %s", 2571 obj->path, rtld_strerror(errno)); 2572 return (-1); 2573 } 2574 } 2575 2576 /* 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. 2580 */ 2581 obj->magic = RTLD_MAGIC; 2582 obj->version = RTLD_VERSION; 2583 2584 return (0); 2585 } 2586 2587 /* 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, 2591 * or -1 on failure. 2592 */ 2593 static int 2594 relocate_objects(Obj_Entry *first, bool bind_now, Obj_Entry *rtldobj, 2595 int flags, RtldLockState *lockstate) 2596 { 2597 Obj_Entry *obj; 2598 int error; 2599 2600 for (error = 0, obj = first; obj != NULL; obj = obj->next) { 2601 error = relocate_object(obj, bind_now, rtldobj, flags, 2602 lockstate); 2603 if (error == -1) 2604 break; 2605 } 2606 return (error); 2607 } 2608 2609 /* 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. 2615 * 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. 2619 */ 2620 static int 2621 resolve_object_ifunc(Obj_Entry *obj, bool bind_now, int flags, 2622 RtldLockState *lockstate) 2623 { 2624 if (obj->irelative && reloc_iresolve(obj, lockstate) == -1) 2625 return (-1); 2626 if ((obj->bind_now || bind_now) && obj->gnu_ifunc && 2627 reloc_gnu_ifunc(obj, flags, lockstate) == -1) 2628 return (-1); 2629 return (0); 2630 } 2631 2632 static int 2633 resolve_objects_ifunc(Obj_Entry *first, bool bind_now, int flags, 2634 RtldLockState *lockstate) 2635 { 2636 Obj_Entry *obj; 2637 2638 for (obj = first; obj != NULL; obj = obj->next) { 2639 if (resolve_object_ifunc(obj, bind_now, flags, lockstate) == -1) 2640 return (-1); 2641 } 2642 return (0); 2643 } 2644 2645 static int 2646 initlist_objects_ifunc(Objlist *list, bool bind_now, int flags, 2647 RtldLockState *lockstate) 2648 { 2649 Objlist_Entry *elm; 2650 2651 STAILQ_FOREACH(elm, list, link) { 2652 if (resolve_object_ifunc(elm->obj, bind_now, flags, 2653 lockstate) == -1) 2654 return (-1); 2655 } 2656 return (0); 2657 } 2658 2659 /* 2660 * Cleanup procedure. It will be called (by the atexit mechanism) just 2661 * before the process exits. 2662 */ 2663 static void 2664 rtld_exit(void) 2665 { 2666 RtldLockState lockstate; 2667 2668 wlock_acquire(rtld_bind_lock, &lockstate); 2669 dbg("rtld_exit()"); 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) 2673 lm_fini(); 2674 lock_release(rtld_bind_lock, &lockstate); 2675 } 2676 2677 /* 2678 * Iterate over a search path, translate each element, and invoke the 2679 * callback on the result. 2680 */ 2681 static void * 2682 path_enumerate(const char *path, path_enum_proc callback, void *arg) 2683 { 2684 const char *trans; 2685 if (path == NULL) 2686 return (NULL); 2687 2688 path += strspn(path, ":;"); 2689 while (*path != '\0') { 2690 size_t len; 2691 char *res; 2692 2693 len = strcspn(path, ":;"); 2694 trans = lm_findn(NULL, path, len); 2695 if (trans) 2696 res = callback(trans, strlen(trans), arg); 2697 else 2698 res = callback(path, len, arg); 2699 2700 if (res != NULL) 2701 return (res); 2702 2703 path += len; 2704 path += strspn(path, ":;"); 2705 } 2706 2707 return (NULL); 2708 } 2709 2710 struct try_library_args { 2711 const char *name; 2712 size_t namelen; 2713 char *buffer; 2714 size_t buflen; 2715 }; 2716 2717 static void * 2718 try_library_path(const char *dir, size_t dirlen, void *param) 2719 { 2720 struct try_library_args *arg; 2721 2722 arg = param; 2723 if (*dir == '/' || trust) { 2724 char *pathname; 2725 2726 if (dirlen + 1 + arg->namelen + 1 > arg->buflen) 2727 return (NULL); 2728 2729 pathname = arg->buffer; 2730 strncpy(pathname, dir, dirlen); 2731 pathname[dirlen] = '/'; 2732 strcpy(pathname + dirlen + 1, arg->name); 2733 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); 2738 return (pathname); 2739 } 2740 } 2741 return (NULL); 2742 } 2743 2744 static char * 2745 search_library_path(const char *name, const char *path) 2746 { 2747 char *p; 2748 struct try_library_args arg; 2749 2750 if (path == NULL) 2751 return NULL; 2752 2753 arg.name = name; 2754 arg.namelen = strlen(name); 2755 arg.buffer = xmalloc(PATH_MAX); 2756 arg.buflen = PATH_MAX; 2757 2758 p = path_enumerate(path, try_library_path, &arg); 2759 2760 free(arg.buffer); 2761 2762 return (p); 2763 } 2764 2765 2766 /* 2767 * Finds the library with the given name using the directory descriptors 2768 * listed in the LD_LIBRARY_PATH_FDS environment variable. 2769 * 2770 * Returns a freshly-opened close-on-exec file descriptor for the library, 2771 * or -1 if the library cannot be found. 2772 */ 2773 static char * 2774 search_library_pathfds(const char *name, const char *path, int *fdp) 2775 { 2776 char *envcopy, *fdstr, *found, *last_token; 2777 size_t len; 2778 int dirfd, fd; 2779 2780 dbg("%s('%s', '%s', fdp)\n", __func__, name, path); 2781 2782 /* Don't load from user-specified libdirs into setuid binaries. */ 2783 if (!trust) 2784 return (NULL); 2785 2786 /* We can't do anything if LD_LIBRARY_PATH_FDS isn't set. */ 2787 if (path == NULL) 2788 return (NULL); 2789 2790 /* LD_LIBRARY_PATH_FDS only works with relative paths. */ 2791 if (name[0] == '/') { 2792 dbg("Absolute path (%s) passed to %s", name, __func__); 2793 return (NULL); 2794 } 2795 2796 /* 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 2799 * with '\0'. 2800 */ 2801 found = NULL; 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); 2806 if (dirfd < 0) 2807 break; 2808 fd = openat(dirfd, name, O_RDONLY | O_CLOEXEC); 2809 if (fd >= 0) { 2810 *fdp = fd; 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'", 2815 dirfd, name); 2816 die(); 2817 } 2818 dbg("open('%s') => %d", found, fd); 2819 break; 2820 } 2821 } 2822 free(envcopy); 2823 2824 return (found); 2825 } 2826 2827 2828 int 2829 dlclose(void *handle) 2830 { 2831 Obj_Entry *root; 2832 RtldLockState lockstate; 2833 2834 wlock_acquire(rtld_bind_lock, &lockstate); 2835 root = dlcheck(handle); 2836 if (root == NULL) { 2837 lock_release(rtld_bind_lock, &lockstate); 2838 return -1; 2839 } 2840 LD_UTRACE(UTRACE_DLCLOSE_START, handle, NULL, 0, root->dl_refcount, 2841 root->path); 2842 2843 /* Unreference the object and its dependencies. */ 2844 root->dl_refcount--; 2845 2846 if (root->refcount == 1) { 2847 /* 2848 * The object will be no longer referenced, so we must unload it. 2849 * First, call the fini functions. 2850 */ 2851 objlist_call_fini(&list_fini, root, &lockstate); 2852 2853 unref_dag(root); 2854 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); 2859 } else 2860 unref_dag(root); 2861 2862 LD_UTRACE(UTRACE_DLCLOSE_STOP, handle, NULL, 0, 0, NULL); 2863 lock_release(rtld_bind_lock, &lockstate); 2864 return 0; 2865 } 2866 2867 char * 2868 dlerror(void) 2869 { 2870 char *msg = error_message; 2871 error_message = NULL; 2872 return msg; 2873 } 2874 2875 /* 2876 * This function is deprecated and has no effect. 2877 */ 2878 void 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)) 2886 { 2887 static void *cur_context; 2888 static void (*cur_context_destroy)(void *); 2889 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; 2895 } 2896 2897 void * 2898 dlopen(const char *name, int mode) 2899 { 2900 2901 return (rtld_dlopen(name, -1, mode)); 2902 } 2903 2904 void * 2905 fdlopen(int fd, int mode) 2906 { 2907 2908 return (rtld_dlopen(NULL, fd, mode)); 2909 } 2910 2911 static void * 2912 rtld_dlopen(const char *name, int fd, int mode) 2913 { 2914 RtldLockState lockstate; 2915 int lo_flags; 2916 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); 2925 } 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; 2933 2934 return (dlopen_object(name, fd, obj_main, lo_flags, 2935 mode & (RTLD_MODEMASK | RTLD_GLOBAL), NULL)); 2936 } 2937 2938 static void 2939 dlopen_cleanup(Obj_Entry *obj) 2940 { 2941 2942 obj->dl_refcount--; 2943 unref_dag(obj); 2944 if (obj->refcount == 0) 2945 unload_object(obj); 2946 } 2947 2948 static Obj_Entry * 2949 dlopen_object(const char *name, int fd, Obj_Entry *refobj, int lo_flags, 2950 int mode, RtldLockState *lockstate) 2951 { 2952 Obj_Entry **old_obj_tail; 2953 Obj_Entry *obj; 2954 Objlist initlist; 2955 RtldLockState mlockstate; 2956 int result; 2957 2958 objlist_init(&initlist); 2959 2960 if (lockstate == NULL && !(lo_flags & RTLD_LO_EARLY)) { 2961 wlock_acquire(rtld_bind_lock, &mlockstate); 2962 lockstate = &mlockstate; 2963 } 2964 GDB_STATE(RT_ADD,NULL); 2965 2966 old_obj_tail = obj_tail; 2967 obj = NULL; 2968 if (name == NULL && fd == -1) { 2969 obj = obj_main; 2970 obj->refcount++; 2971 } else { 2972 obj = load_object(name, fd, refobj, lo_flags); 2973 } 2974 2975 if (obj) { 2976 obj->dl_refcount++; 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)); 2983 init_dag(obj); 2984 ref_dag(obj); 2985 if (result != -1) 2986 result = rtld_verify_versions(&obj->dagmembers); 2987 if (result != -1 && ld_tracing) 2988 goto trace; 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, 2992 lockstate) == -1) { 2993 dlopen_cleanup(obj); 2994 obj = NULL; 2995 } else if (lo_flags & RTLD_LO_EARLY) { 2996 /* 2997 * Do not call the init functions for early loaded 2998 * filtees. The image is still not initialized enough 2999 * for them to work. 3000 * 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. 3004 */ 3005 } else { 3006 /* Make list of init functions to call. */ 3007 initlist_add_objects(obj, &obj->next, &initlist); 3008 } 3009 /* 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. 3014 */ 3015 if (obj != NULL) 3016 process_nodelete(obj); 3017 } else { 3018 /* 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 3022 * starting at it. 3023 */ 3024 init_dag(obj); 3025 ref_dag(obj); 3026 3027 if ((lo_flags & RTLD_LO_TRACE) != 0) 3028 goto trace; 3029 } 3030 if (obj != NULL && ((lo_flags & RTLD_LO_NODELETE) != 0 || 3031 obj->z_nodelete) && !obj->ref_nodel) { 3032 dbg("obj %s nodelete", obj->path); 3033 ref_dag(obj); 3034 obj->z_nodelete = obj->ref_nodel = true; 3035 } 3036 } 3037 3038 LD_UTRACE(UTRACE_DLOPEN_STOP, obj, NULL, 0, obj ? obj->dl_refcount : 0, 3039 name); 3040 GDB_STATE(RT_CONSISTENT,obj ? &obj->linkmap : NULL); 3041 3042 if (!(lo_flags & RTLD_LO_EARLY)) { 3043 map_stacks_exec(lockstate); 3044 } 3045 3046 if (initlist_objects_ifunc(&initlist, (mode & RTLD_MODEMASK) == RTLD_NOW, 3047 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0, 3048 lockstate) == -1) { 3049 objlist_clear(&initlist); 3050 dlopen_cleanup(obj); 3051 if (lockstate == &mlockstate) 3052 lock_release(rtld_bind_lock, lockstate); 3053 return (NULL); 3054 } 3055 3056 if (!(lo_flags & RTLD_LO_EARLY)) { 3057 /* Call the init functions. */ 3058 objlist_call_init(&initlist, lockstate); 3059 } 3060 objlist_clear(&initlist); 3061 if (lockstate == &mlockstate) 3062 lock_release(rtld_bind_lock, lockstate); 3063 return obj; 3064 trace: 3065 trace_loaded_objects(obj); 3066 if (lockstate == &mlockstate) 3067 lock_release(rtld_bind_lock, lockstate); 3068 exit(0); 3069 } 3070 3071 static void * 3072 do_dlsym(void *handle, const char *name, void *retaddr, const Ver_Entry *ve, 3073 int flags) 3074 { 3075 DoneList donelist; 3076 const Obj_Entry *obj, *defobj; 3077 const Elf_Sym *def; 3078 SymLook req; 3079 RtldLockState lockstate; 3080 #ifndef __ia64__ 3081 tls_index ti; 3082 #endif 3083 int res; 3084 3085 def = NULL; 3086 defobj = NULL; 3087 symlook_init(&req, name); 3088 req.ventry = ve; 3089 req.flags = flags | SYMLOOK_IN_PLT; 3090 req.lockstate = &lockstate; 3091 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) { 3097 3098 if ((obj = obj_from_addr(retaddr)) == NULL) { 3099 _rtld_error("Cannot determine caller's shared object"); 3100 lock_release(rtld_bind_lock, &lockstate); 3101 return NULL; 3102 } 3103 if (handle == NULL) { /* Just the caller's shared object. */ 3104 res = symlook_obj(&req, obj); 3105 if (res == 0) { 3106 def = req.sym_out; 3107 defobj = req.defobj_out; 3108 } 3109 } else if (handle == RTLD_NEXT || /* Objects after caller's */ 3110 handle == RTLD_SELF) { /* ... caller included */ 3111 if (handle == RTLD_NEXT) 3112 obj = obj->next; 3113 for (; obj != NULL; obj = obj->next) { 3114 res = symlook_obj(&req, obj); 3115 if (res == 0) { 3116 if (def == NULL || 3117 ELF_ST_BIND(req.sym_out->st_info) != STB_WEAK) { 3118 def = req.sym_out; 3119 defobj = req.defobj_out; 3120 if (ELF_ST_BIND(def->st_info) != STB_WEAK) 3121 break; 3122 } 3123 } 3124 } 3125 /* 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. 3129 */ 3130 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) { 3131 res = symlook_obj(&req, &obj_rtld); 3132 if (res == 0) { 3133 def = req.sym_out; 3134 defobj = req.defobj_out; 3135 } 3136 } 3137 } else { 3138 assert(handle == RTLD_DEFAULT); 3139 res = symlook_default(&req, obj); 3140 if (res == 0) { 3141 defobj = req.defobj_out; 3142 def = req.sym_out; 3143 } 3144 } 3145 } else { 3146 if ((obj = dlcheck(handle)) == NULL) { 3147 lock_release(rtld_bind_lock, &lockstate); 3148 return NULL; 3149 } 3150 3151 donelist_init(&donelist); 3152 if (obj->mainprog) { 3153 /* Handle obtained by dlopen(NULL, ...) implies global scope. */ 3154 res = symlook_global(&req, &donelist); 3155 if (res == 0) { 3156 def = req.sym_out; 3157 defobj = req.defobj_out; 3158 } 3159 /* 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. 3163 */ 3164 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) { 3165 res = symlook_obj(&req, &obj_rtld); 3166 if (res == 0) { 3167 def = req.sym_out; 3168 defobj = req.defobj_out; 3169 } 3170 } 3171 } 3172 else { 3173 /* Search the whole DAG rooted at the given object. */ 3174 res = symlook_list(&req, &obj->dagmembers, &donelist); 3175 if (res == 0) { 3176 def = req.sym_out; 3177 defobj = req.defobj_out; 3178 } 3179 } 3180 } 3181 3182 if (def != NULL) { 3183 lock_release(rtld_bind_lock, &lockstate); 3184 3185 /* 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. 3192 */ 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) { 3198 #ifdef __ia64__ 3199 return (__tls_get_addr(defobj->tlsindex, def->st_value)); 3200 #else 3201 ti.ti_module = defobj->tlsindex; 3202 ti.ti_offset = def->st_value; 3203 return (__tls_get_addr(&ti)); 3204 #endif 3205 } else 3206 return (defobj->relocbase + def->st_value); 3207 } 3208 3209 _rtld_error("Undefined symbol \"%s\"", name); 3210 lock_release(rtld_bind_lock, &lockstate); 3211 return NULL; 3212 } 3213 3214 void * 3215 dlsym(void *handle, const char *name) 3216 { 3217 return do_dlsym(handle, name, __builtin_return_address(0), NULL, 3218 SYMLOOK_DLSYM); 3219 } 3220 3221 dlfunc_t 3222 dlfunc(void *handle, const char *name) 3223 { 3224 union { 3225 void *d; 3226 dlfunc_t f; 3227 } rv; 3228 3229 rv.d = do_dlsym(handle, name, __builtin_return_address(0), NULL, 3230 SYMLOOK_DLSYM); 3231 return (rv.f); 3232 } 3233 3234 void * 3235 dlvsym(void *handle, const char *name, const char *version) 3236 { 3237 Ver_Entry ventry; 3238 3239 ventry.name = version; 3240 ventry.file = NULL; 3241 ventry.hash = elf_hash(version); 3242 ventry.flags= 0; 3243 return do_dlsym(handle, name, __builtin_return_address(0), &ventry, 3244 SYMLOOK_DLSYM); 3245 } 3246 3247 int 3248 _rtld_addr_phdr(const void *addr, struct dl_phdr_info *phdr_info) 3249 { 3250 const Obj_Entry *obj; 3251 RtldLockState lockstate; 3252 3253 rlock_acquire(rtld_bind_lock, &lockstate); 3254 obj = obj_from_addr(addr); 3255 if (obj == NULL) { 3256 _rtld_error("No shared object contains address"); 3257 lock_release(rtld_bind_lock, &lockstate); 3258 return (0); 3259 } 3260 rtld_fill_dl_phdr_info(obj, phdr_info); 3261 lock_release(rtld_bind_lock, &lockstate); 3262 return (1); 3263 } 3264 3265 int 3266 dladdr(const void *addr, Dl_info *info) 3267 { 3268 const Obj_Entry *obj; 3269 const Elf_Sym *def; 3270 void *symbol_addr; 3271 unsigned long symoffset; 3272 RtldLockState lockstate; 3273 3274 rlock_acquire(rtld_bind_lock, &lockstate); 3275 obj = obj_from_addr(addr); 3276 if (obj == NULL) { 3277 _rtld_error("No shared object contains address"); 3278 lock_release(rtld_bind_lock, &lockstate); 3279 return 0; 3280 } 3281 info->dli_fname = obj->path; 3282 info->dli_fbase = obj->mapbase; 3283 info->dli_saddr = (void *)0; 3284 info->dli_sname = NULL; 3285 3286 /* 3287 * Walk the symbol list looking for the symbol whose address is 3288 * closest to the address sent in. 3289 */ 3290 for (symoffset = 0; symoffset < obj->dynsymcount; symoffset++) { 3291 def = obj->symtab + symoffset; 3292 3293 /* 3294 * For skip the symbol if st_shndx is either SHN_UNDEF or 3295 * SHN_COMMON. 3296 */ 3297 if (def->st_shndx == SHN_UNDEF || def->st_shndx == SHN_COMMON) 3298 continue; 3299 3300 /* 3301 * If the symbol is greater than the specified address, or if it 3302 * is further away from addr than the current nearest symbol, 3303 * then reject it. 3304 */ 3305 symbol_addr = obj->relocbase + def->st_value; 3306 if (symbol_addr > addr || symbol_addr < info->dli_saddr) 3307 continue; 3308 3309 /* Update our idea of the nearest symbol. */ 3310 info->dli_sname = obj->strtab + def->st_name; 3311 info->dli_saddr = symbol_addr; 3312 3313 /* Exact match? */ 3314 if (info->dli_saddr == addr) 3315 break; 3316 } 3317 lock_release(rtld_bind_lock, &lockstate); 3318 return 1; 3319 } 3320 3321 int 3322 dlinfo(void *handle, int request, void *p) 3323 { 3324 const Obj_Entry *obj; 3325 RtldLockState lockstate; 3326 int error; 3327 3328 rlock_acquire(rtld_bind_lock, &lockstate); 3329 3330 if (handle == NULL || handle == RTLD_SELF) { 3331 void *retaddr; 3332 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"); 3336 } else 3337 obj = dlcheck(handle); 3338 3339 if (obj == NULL) { 3340 lock_release(rtld_bind_lock, &lockstate); 3341 return (-1); 3342 } 3343 3344 error = 0; 3345 switch (request) { 3346 case RTLD_DI_LINKMAP: 3347 *((struct link_map const **)p) = &obj->linkmap; 3348 break; 3349 case RTLD_DI_ORIGIN: 3350 error = rtld_dirname(obj->path, p); 3351 break; 3352 3353 case RTLD_DI_SERINFOSIZE: 3354 case RTLD_DI_SERINFO: 3355 error = do_search_info(obj, request, (struct dl_serinfo *)p); 3356 break; 3357 3358 default: 3359 _rtld_error("Invalid request %d passed to dlinfo()", request); 3360 error = -1; 3361 } 3362 3363 lock_release(rtld_bind_lock, &lockstate); 3364 3365 return (error); 3366 } 3367 3368 static void 3369 rtld_fill_dl_phdr_info(const Obj_Entry *obj, struct dl_phdr_info *phdr_info) 3370 { 3371 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; 3381 } 3382 3383 int 3384 dl_iterate_phdr(__dl_iterate_hdr_callback callback, void *param) 3385 { 3386 struct dl_phdr_info phdr_info; 3387 const Obj_Entry *obj; 3388 RtldLockState bind_lockstate, phdr_lockstate; 3389 int error; 3390 3391 wlock_acquire(rtld_phdr_lock, &phdr_lockstate); 3392 rlock_acquire(rtld_bind_lock, &bind_lockstate); 3393 3394 error = 0; 3395 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) 3399 break; 3400 3401 } 3402 if (error == 0) { 3403 rtld_fill_dl_phdr_info(&obj_rtld, &phdr_info); 3404 error = callback(&phdr_info, sizeof(phdr_info), param); 3405 } 3406 3407 lock_release(rtld_bind_lock, &bind_lockstate); 3408 lock_release(rtld_phdr_lock, &phdr_lockstate); 3409 3410 return (error); 3411 } 3412 3413 static void * 3414 fill_search_info(const char *dir, size_t dirlen, void *param) 3415 { 3416 struct fill_search_info_args *arg; 3417 3418 arg = param; 3419 3420 if (arg->request == RTLD_DI_SERINFOSIZE) { 3421 arg->serinfo->dls_cnt ++; 3422 arg->serinfo->dls_size += sizeof(struct dl_serpath) + dirlen + 1; 3423 } else { 3424 struct dl_serpath *s_entry; 3425 3426 s_entry = arg->serpath; 3427 s_entry->dls_name = arg->strspace; 3428 s_entry->dls_flags = arg->flags; 3429 3430 strncpy(arg->strspace, dir, dirlen); 3431 arg->strspace[dirlen] = '\0'; 3432 3433 arg->strspace += dirlen + 1; 3434 arg->serpath++; 3435 } 3436 3437 return (NULL); 3438 } 3439 3440 static int 3441 do_search_info(const Obj_Entry *obj, int request, struct dl_serinfo *info) 3442 { 3443 struct dl_serinfo _info; 3444 struct fill_search_info_args args; 3445 3446 args.request = RTLD_DI_SERINFOSIZE; 3447 args.serinfo = &_info; 3448 3449 _info.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 3450 _info.dls_cnt = 0; 3451 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); 3458 3459 3460 if (request == RTLD_DI_SERINFOSIZE) { 3461 info->dls_size = _info.dls_size; 3462 info->dls_cnt = _info.dls_cnt; 3463 return (0); 3464 } 3465 3466 if (info->dls_cnt != _info.dls_cnt || info->dls_size != _info.dls_size) { 3467 _rtld_error("Uninitialized Dl_serinfo struct passed to dlinfo()"); 3468 return (-1); 3469 } 3470 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]; 3475 3476 args.flags = LA_SER_RUNPATH; 3477 if (path_enumerate(obj->rpath, fill_search_info, &args) != NULL) 3478 return (-1); 3479 3480 args.flags = LA_SER_LIBPATH; 3481 if (path_enumerate(ld_library_path, fill_search_info, &args) != NULL) 3482 return (-1); 3483 3484 args.flags = LA_SER_RUNPATH; 3485 if (path_enumerate(obj->runpath, fill_search_info, &args) != NULL) 3486 return (-1); 3487 3488 args.flags = LA_SER_CONFIG; 3489 if (path_enumerate(gethints(obj->z_nodeflib), fill_search_info, &args) 3490 != NULL) 3491 return (-1); 3492 3493 args.flags = LA_SER_DEFAULT; 3494 if (!obj->z_nodeflib && 3495 path_enumerate(STANDARD_LIBRARY_PATH, fill_search_info, &args) != NULL) 3496 return (-1); 3497 return (0); 3498 } 3499 3500 static int 3501 rtld_dirname(const char *path, char *bname) 3502 { 3503 const char *endp; 3504 3505 /* Empty or NULL string gets treated as "." */ 3506 if (path == NULL || *path == '\0') { 3507 bname[0] = '.'; 3508 bname[1] = '\0'; 3509 return (0); 3510 } 3511 3512 /* Strip trailing slashes */ 3513 endp = path + strlen(path) - 1; 3514 while (endp > path && *endp == '/') 3515 endp--; 3516 3517 /* Find the start of the dir */ 3518 while (endp > path && *endp != '/') 3519 endp--; 3520 3521 /* Either the dir is "/" or there are no slashes */ 3522 if (endp == path) { 3523 bname[0] = *endp == '/' ? '/' : '.'; 3524 bname[1] = '\0'; 3525 return (0); 3526 } else { 3527 do { 3528 endp--; 3529 } while (endp > path && *endp == '/'); 3530 } 3531 3532 if (endp - path + 2 > PATH_MAX) 3533 { 3534 _rtld_error("Filename is too long: %s", path); 3535 return(-1); 3536 } 3537 3538 strncpy(bname, path, endp - path + 1); 3539 bname[endp - path + 1] = '\0'; 3540 return (0); 3541 } 3542 3543 static int 3544 rtld_dirname_abs(const char *path, char *base) 3545 { 3546 char base_rel[PATH_MAX]; 3547 3548 if (rtld_dirname(path, base) == -1) 3549 return (-1); 3550 if (base[0] == '/') 3551 return (0); 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)) 3555 return (-1); 3556 strcpy(base, base_rel); 3557 return (0); 3558 } 3559 3560 static void 3561 linkmap_add(Obj_Entry *obj) 3562 { 3563 struct link_map *l = &obj->linkmap; 3564 struct link_map *prev; 3565 3566 obj->linkmap.l_name = obj->path; 3567 obj->linkmap.l_addr = obj->mapbase; 3568 obj->linkmap.l_ld = obj->dynamic; 3569 #ifdef __mips__ 3570 /* GDB needs load offset on MIPS to use the symbols */ 3571 obj->linkmap.l_offs = obj->relocbase; 3572 #endif 3573 3574 if (r_debug.r_map == NULL) { 3575 r_debug.r_map = l; 3576 return; 3577 } 3578 3579 /* 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. 3582 */ 3583 for (prev = r_debug.r_map; 3584 prev->l_next != NULL && prev->l_next != &obj_rtld.linkmap; 3585 prev = prev->l_next) 3586 ; 3587 3588 /* Link in the new entry. */ 3589 l->l_prev = prev; 3590 l->l_next = prev->l_next; 3591 if (l->l_next != NULL) 3592 l->l_next->l_prev = l; 3593 prev->l_next = l; 3594 } 3595 3596 static void 3597 linkmap_delete(Obj_Entry *obj) 3598 { 3599 struct link_map *l = &obj->linkmap; 3600 3601 if (l->l_prev == NULL) { 3602 if ((r_debug.r_map = l->l_next) != NULL) 3603 l->l_next->l_prev = NULL; 3604 return; 3605 } 3606 3607 if ((l->l_prev->l_next = l->l_next) != NULL) 3608 l->l_next->l_prev = l->l_prev; 3609 } 3610 3611 /* 3612 * Function for the debugger to set a breakpoint on to gain control. 3613 * 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. 3616 * 3617 * When the loadhook trap is hit (r_debug_state, set at program 3618 * initialization), the arguments can be found on the stack: 3619 * 3620 * +8 struct link_map *m 3621 * +4 struct r_debug *rd 3622 * +0 RetAddr 3623 */ 3624 void 3625 r_debug_state(struct r_debug* rd, struct link_map *m) 3626 { 3627 /* 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 3632 * calls being made. 3633 */ 3634 __compiler_membar(); 3635 } 3636 3637 /* 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. 3641 */ 3642 void 3643 _r_debug_postinit(struct link_map *m) 3644 { 3645 3646 /* See r_debug_state(). */ 3647 __compiler_membar(); 3648 } 3649 3650 /* 3651 * Get address of the pointer variable in the main program. 3652 * Prefer non-weak symbol over the weak one. 3653 */ 3654 static const void ** 3655 get_program_var_addr(const char *name, RtldLockState *lockstate) 3656 { 3657 SymLook req; 3658 DoneList donelist; 3659 3660 symlook_init(&req, name); 3661 req.lockstate = lockstate; 3662 donelist_init(&donelist); 3663 if (symlook_global(&req, &donelist) != 0) 3664 return (NULL); 3665 if (ELF_ST_TYPE(req.sym_out->st_info) == STT_FUNC) 3666 return ((const void **)make_function_pointer(req.sym_out, 3667 req.defobj_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)); 3670 else 3671 return ((const void **)(req.defobj_out->relocbase + 3672 req.sym_out->st_value)); 3673 } 3674 3675 /* 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. 3679 */ 3680 static void 3681 set_program_var(const char *name, const void *value) 3682 { 3683 const void **addr; 3684 3685 if ((addr = get_program_var_addr(name, NULL)) != NULL) { 3686 dbg("\"%s\": *%p <-- %p", name, addr, value); 3687 *addr = value; 3688 } 3689 } 3690 3691 /* 3692 * Search the global objects, including dependencies and main object, 3693 * for the given symbol. 3694 */ 3695 static int 3696 symlook_global(SymLook *req, DoneList *donelist) 3697 { 3698 SymLook req1; 3699 const Objlist_Entry *elm; 3700 int res; 3701 3702 symlook_init_from_req(&req1, req); 3703 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); 3713 } 3714 } 3715 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) 3720 break; 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); 3727 } 3728 } 3729 3730 return (req->sym_out != NULL ? 0 : ESRCH); 3731 } 3732 3733 /* 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. 3738 */ 3739 static int 3740 symlook_default(SymLook *req, const Obj_Entry *refobj) 3741 { 3742 DoneList donelist; 3743 const Objlist_Entry *elm; 3744 SymLook req1; 3745 int res; 3746 3747 donelist_init(&donelist); 3748 symlook_init_from_req(&req1, req); 3749 3750 /* Look first in the referencing object if linked symbolically. */ 3751 if (refobj->symbolic && !donelist_check(&donelist, refobj)) { 3752 res = symlook_obj(&req1, refobj); 3753 if (res == 0) { 3754 req->sym_out = req1.sym_out; 3755 req->defobj_out = req1.defobj_out; 3756 assert(req->defobj_out != NULL); 3757 } 3758 } 3759 3760 symlook_global(req, &donelist); 3761 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) 3766 break; 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); 3773 } 3774 } 3775 3776 /* 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. 3780 */ 3781 if (req->sym_out == NULL || 3782 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) { 3783 res = symlook_obj(&req1, &obj_rtld); 3784 if (res == 0) { 3785 req->sym_out = req1.sym_out; 3786 req->defobj_out = req1.defobj_out; 3787 assert(req->defobj_out != NULL); 3788 } 3789 } 3790 3791 return (req->sym_out != NULL ? 0 : ESRCH); 3792 } 3793 3794 static int 3795 symlook_list(SymLook *req, const Objlist *objlist, DoneList *dlp) 3796 { 3797 const Elf_Sym *def; 3798 const Obj_Entry *defobj; 3799 const Objlist_Entry *elm; 3800 SymLook req1; 3801 int res; 3802 3803 def = NULL; 3804 defobj = NULL; 3805 STAILQ_FOREACH(elm, objlist, link) { 3806 if (donelist_check(dlp, elm->obj)) 3807 continue; 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) { 3811 def = req1.sym_out; 3812 defobj = req1.defobj_out; 3813 if (ELF_ST_BIND(def->st_info) != STB_WEAK) 3814 break; 3815 } 3816 } 3817 } 3818 if (def != NULL) { 3819 req->sym_out = def; 3820 req->defobj_out = defobj; 3821 return (0); 3822 } 3823 return (ESRCH); 3824 } 3825 3826 /* 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. 3831 */ 3832 static int 3833 symlook_needed(SymLook *req, const Needed_Entry *needed, DoneList *dlp) 3834 { 3835 const Elf_Sym *def; 3836 const Needed_Entry *n; 3837 const Obj_Entry *defobj; 3838 SymLook req1; 3839 int res; 3840 3841 def = NULL; 3842 defobj = NULL; 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) 3847 continue; 3848 if (def == NULL || ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK) { 3849 def = req1.sym_out; 3850 defobj = req1.defobj_out; 3851 if (ELF_ST_BIND(def->st_info) != STB_WEAK) 3852 break; 3853 } 3854 } 3855 if (def != NULL) { 3856 req->sym_out = def; 3857 req->defobj_out = defobj; 3858 return (0); 3859 } 3860 return (ESRCH); 3861 } 3862 3863 /* 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. 3868 * 3869 * The symbol's hash value is passed in for efficiency reasons; that 3870 * eliminates many recomputations of the hash value. 3871 */ 3872 int 3873 symlook_obj(SymLook *req, const Obj_Entry *obj) 3874 { 3875 DoneList donelist; 3876 SymLook req1; 3877 int flags, res, mres; 3878 3879 /* 3880 * If there is at least one valid hash at this point, we prefer to 3881 * use the faster GNU version if available. 3882 */ 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); 3887 else 3888 return (EINVAL); 3889 3890 if (mres == 0) { 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); 3897 if (res == 0) { 3898 req->sym_out = req1.sym_out; 3899 req->defobj_out = req1.defobj_out; 3900 } 3901 return (res); 3902 } 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); 3909 if (res == 0) { 3910 req->sym_out = req1.sym_out; 3911 req->defobj_out = req1.defobj_out; 3912 return (res); 3913 } 3914 } 3915 } 3916 return (mres); 3917 } 3918 3919 /* Symbol match routine common to both hash functions */ 3920 static bool 3921 matched_symbol(SymLook *req, const Obj_Entry *obj, Sym_Match_Result *result, 3922 const unsigned long symnum) 3923 { 3924 Elf_Versym verndx; 3925 const Elf_Sym *symp; 3926 const char *strp; 3927 3928 symp = obj->symtab + symnum; 3929 strp = obj->strtab + symp->st_name; 3930 3931 switch (ELF_ST_TYPE(symp->st_info)) { 3932 case STT_FUNC: 3933 case STT_NOTYPE: 3934 case STT_OBJECT: 3935 case STT_COMMON: 3936 case STT_GNU_IFUNC: 3937 if (symp->st_value == 0) 3938 return (false); 3939 /* fallthrough */ 3940 case STT_TLS: 3941 if (symp->st_shndx != SHN_UNDEF) 3942 break; 3943 #ifndef __mips__ 3944 else if (((req->flags & SYMLOOK_IN_PLT) == 0) && 3945 (ELF_ST_TYPE(symp->st_info) == STT_FUNC)) 3946 break; 3947 /* fallthrough */ 3948 #endif 3949 default: 3950 return (false); 3951 } 3952 if (req->name[0] != strp[0] || strcmp(req->name, strp) != 0) 3953 return (false); 3954 3955 if (req->ventry == NULL) { 3956 if (obj->versyms != NULL) { 3957 verndx = VER_NDX(obj->versyms[symnum]); 3958 if (verndx > obj->vernum) { 3959 _rtld_error( 3960 "%s: symbol %s references wrong version %d", 3961 obj->path, obj->strtab + symnum, verndx); 3962 return (false); 3963 } 3964 /* 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. 3976 */ 3977 if ((req->flags & SYMLOOK_DLSYM) == 0 && 3978 verndx == VER_NDX_GIVEN) { 3979 result->sym_out = symp; 3980 return (true); 3981 } 3982 else if (verndx >= VER_NDX_GIVEN) { 3983 if ((obj->versyms[symnum] & VER_NDX_HIDDEN) 3984 == 0) { 3985 if (result->vsymp == NULL) 3986 result->vsymp = symp; 3987 result->vcount++; 3988 } 3989 return (false); 3990 } 3991 } 3992 result->sym_out = symp; 3993 return (true); 3994 } 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); 4000 return (false); 4001 } 4002 } else { 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); 4007 return (false); 4008 } 4009 if (obj->vertab[verndx].hash != req->ventry->hash || 4010 strcmp(obj->vertab[verndx].name, req->ventry->name)) { 4011 /* 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. 4019 */ 4020 if ((req->flags & SYMLOOK_DLSYM) || 4021 (verndx >= VER_NDX_GIVEN) || 4022 (obj->versyms[symnum] & VER_NDX_HIDDEN)) 4023 return (false); 4024 } 4025 } 4026 result->sym_out = symp; 4027 return (true); 4028 } 4029 4030 /* 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. 4034 */ 4035 static int 4036 symlook_obj1_sysv(SymLook *req, const Obj_Entry *obj) 4037 { 4038 unsigned long symnum; 4039 Sym_Match_Result matchres; 4040 4041 matchres.sym_out = NULL; 4042 matchres.vsymp = NULL; 4043 matchres.vcount = 0; 4044 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 */ 4049 4050 if (matched_symbol(req, obj, &matchres, symnum)) { 4051 req->sym_out = matchres.sym_out; 4052 req->defobj_out = obj; 4053 return (0); 4054 } 4055 } 4056 if (matchres.vcount == 1) { 4057 req->sym_out = matchres.vsymp; 4058 req->defobj_out = obj; 4059 return (0); 4060 } 4061 return (ESRCH); 4062 } 4063 4064 /* Search for symbol using GNU hash function */ 4065 static int 4066 symlook_obj1_gnu(SymLook *req, const Obj_Entry *obj) 4067 { 4068 Elf_Addr bloom_word; 4069 const Elf32_Word *hashval; 4070 Elf32_Word bucket; 4071 Sym_Match_Result matchres; 4072 unsigned int h1, h2; 4073 unsigned long symnum; 4074 4075 matchres.sym_out = NULL; 4076 matchres.vsymp = NULL; 4077 matchres.vcount = 0; 4078 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]; 4082 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)); 4086 4087 /* Filter out the "definitely not in set" queries */ 4088 if (((bloom_word >> h1) & (bloom_word >> h2) & 1) == 0) 4089 return (ESRCH); 4090 4091 /* Locate hash chain and corresponding value element*/ 4092 bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu]; 4093 if (bucket == 0) 4094 return (ESRCH); 4095 hashval = &obj->chain_zero_gnu[bucket]; 4096 do { 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; 4102 return (0); 4103 } 4104 } 4105 } while ((*hashval++ & 1) == 0); 4106 if (matchres.vcount == 1) { 4107 req->sym_out = matchres.vsymp; 4108 req->defobj_out = obj; 4109 return (0); 4110 } 4111 return (ESRCH); 4112 } 4113 4114 static void 4115 trace_loaded_objects(Obj_Entry *obj) 4116 { 4117 char *fmt1, *fmt2, *fmt, *main_local, *list_containers; 4118 int c; 4119 4120 if ((main_local = getenv(LD_ "TRACE_LOADED_OBJECTS_PROGNAME")) == NULL) 4121 main_local = ""; 4122 4123 if ((fmt1 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT1")) == NULL) 4124 fmt1 = "\t%o => %p (%x)\n"; 4125 4126 if ((fmt2 = getenv(LD_ "TRACE_LOADED_OBJECTS_FMT2")) == NULL) 4127 fmt2 = "\t%o (%x)\n"; 4128 4129 list_containers = getenv(LD_ "TRACE_LOADED_OBJECTS_ALL"); 4130 4131 for (; obj; obj = obj->next) { 4132 Needed_Entry *needed; 4133 char *name, *path; 4134 bool is_lib; 4135 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) 4141 continue; 4142 needed->obj->traced = true; 4143 path = needed->obj->path; 4144 } else 4145 path = "not found"; 4146 4147 name = (char *)obj->strtab + needed->name; 4148 is_lib = strncmp(name, "lib", 3) == 0; /* XXX - bogus */ 4149 4150 fmt = is_lib ? fmt1 : fmt2; 4151 while ((c = *fmt++) != '\0') { 4152 switch (c) { 4153 default: 4154 rtld_putchar(c); 4155 continue; 4156 case '\\': 4157 switch (c = *fmt) { 4158 case '\0': 4159 continue; 4160 case 'n': 4161 rtld_putchar('\n'); 4162 break; 4163 case 't': 4164 rtld_putchar('\t'); 4165 break; 4166 } 4167 break; 4168 case '%': 4169 switch (c = *fmt) { 4170 case '\0': 4171 continue; 4172 case '%': 4173 default: 4174 rtld_putchar(c); 4175 break; 4176 case 'A': 4177 rtld_putstr(main_local); 4178 break; 4179 case 'a': 4180 rtld_putstr(obj_main->path); 4181 break; 4182 case 'o': 4183 rtld_putstr(name); 4184 break; 4185 #if 0 4186 case 'm': 4187 rtld_printf("%d", sodp->sod_major); 4188 break; 4189 case 'n': 4190 rtld_printf("%d", sodp->sod_minor); 4191 break; 4192 #endif 4193 case 'p': 4194 rtld_putstr(path); 4195 break; 4196 case 'x': 4197 rtld_printf("%p", needed->obj ? needed->obj->mapbase : 4198 0); 4199 break; 4200 } 4201 break; 4202 } 4203 ++fmt; 4204 } 4205 } 4206 } 4207 } 4208 4209 /* 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. 4214 */ 4215 static void 4216 unload_object(Obj_Entry *root) 4217 { 4218 Obj_Entry *obj; 4219 Obj_Entry **linkp; 4220 4221 assert(root->refcount == 0); 4222 4223 /* 4224 * Pass over the DAG removing unreferenced objects from 4225 * appropriate lists. 4226 */ 4227 unlink_object(root); 4228 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, 4234 obj->path); 4235 dbg("unloading \"%s\"", obj->path); 4236 unload_filtees(root); 4237 munmap(obj->mapbase, obj->mapsize); 4238 linkmap_delete(obj); 4239 *linkp = obj->next; 4240 obj_count--; 4241 obj_free(obj); 4242 } else 4243 linkp = &obj->next; 4244 } 4245 obj_tail = linkp; 4246 } 4247 4248 static void 4249 unlink_object(Obj_Entry *root) 4250 { 4251 Objlist_Entry *elm; 4252 4253 if (root->refcount == 0) { 4254 /* Remove the object from the RTLD_GLOBAL list. */ 4255 objlist_remove(&list_global, root); 4256 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); 4262 } 4263 } 4264 } 4265 4266 static void 4267 ref_dag(Obj_Entry *root) 4268 { 4269 Objlist_Entry *elm; 4270 4271 assert(root->dag_inited); 4272 STAILQ_FOREACH(elm, &root->dagmembers, link) 4273 elm->obj->refcount++; 4274 } 4275 4276 static void 4277 unref_dag(Obj_Entry *root) 4278 { 4279 Objlist_Entry *elm; 4280 4281 assert(root->dag_inited); 4282 STAILQ_FOREACH(elm, &root->dagmembers, link) 4283 elm->obj->refcount--; 4284 } 4285 4286 /* 4287 * Common code for MD __tls_get_addr(). 4288 */ 4289 static void *tls_get_addr_slow(Elf_Addr **, int, size_t) __noinline; 4290 static void * 4291 tls_get_addr_slow(Elf_Addr **dtvp, int index, size_t offset) 4292 { 4293 Elf_Addr *newdtv, *dtv; 4294 RtldLockState lockstate; 4295 int to_copy; 4296 4297 dtv = *dtvp; 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)); 4302 to_copy = dtv[1]; 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; 4308 free(dtv); 4309 lock_release(rtld_bind_lock, &lockstate); 4310 dtv = *dtvp = newdtv; 4311 } 4312 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); 4320 } 4321 return ((void *)(dtv[index + 1] + offset)); 4322 } 4323 4324 void * 4325 tls_get_addr_common(Elf_Addr **dtvp, int index, size_t offset) 4326 { 4327 Elf_Addr *dtv; 4328 4329 dtv = *dtvp; 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)); 4335 } 4336 4337 #if defined(__arm__) || defined(__ia64__) || defined(__mips__) || defined(__powerpc__) 4338 4339 /* 4340 * Allocate Static TLS using the Variant I method. 4341 */ 4342 void * 4343 allocate_tls(Obj_Entry *objs, void *oldtcb, size_t tcbsize, size_t tcbalign) 4344 { 4345 Obj_Entry *obj; 4346 char *tcb; 4347 Elf_Addr **tls; 4348 Elf_Addr *dtv; 4349 Elf_Addr addr; 4350 int i; 4351 4352 if (oldtcb != NULL && tcbsize == TLS_TCB_SIZE) 4353 return (oldtcb); 4354 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); 4358 4359 if (oldtcb != NULL) { 4360 memcpy(tls, oldtcb, tls_static_space); 4361 free(oldtcb); 4362 4363 /* Adjust the DTV. */ 4364 dtv = tls[0]; 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; 4369 } 4370 } 4371 } else { 4372 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr)); 4373 tls[0] = dtv; 4374 dtv[0] = tls_dtv_generation; 4375 dtv[1] = tls_max_index; 4376 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; 4386 } 4387 } 4388 } 4389 4390 return (tcb); 4391 } 4392 4393 void 4394 free_tls(void *tcb, size_t tcbsize, size_t tcbalign) 4395 { 4396 Elf_Addr *dtv; 4397 Elf_Addr tlsstart, tlsend; 4398 int dtvsize, i; 4399 4400 assert(tcbsize >= TLS_TCB_SIZE); 4401 4402 tlsstart = (Elf_Addr)tcb + tcbsize - TLS_TCB_SIZE; 4403 tlsend = tlsstart + tls_static_space; 4404 4405 dtv = *(Elf_Addr **)tlsstart; 4406 dtvsize = dtv[1]; 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]); 4410 } 4411 } 4412 free(dtv); 4413 free(tcb); 4414 } 4415 4416 #endif 4417 4418 #if defined(__i386__) || defined(__amd64__) || defined(__sparc64__) 4419 4420 /* 4421 * Allocate Static TLS using the Variant II method. 4422 */ 4423 void * 4424 allocate_tls(Obj_Entry *objs, void *oldtls, size_t tcbsize, size_t tcbalign) 4425 { 4426 Obj_Entry *obj; 4427 size_t size, ralign; 4428 char *tls; 4429 Elf_Addr *dtv, *olddtv; 4430 Elf_Addr segbase, oldsegbase, addr; 4431 int i; 4432 4433 ralign = tcbalign; 4434 if (tls_static_max_align > ralign) 4435 ralign = tls_static_max_align; 4436 size = round(tls_static_space, ralign) + round(tcbsize, ralign); 4437 4438 assert(tcbsize >= 2*sizeof(Elf_Addr)); 4439 tls = malloc_aligned(size, ralign); 4440 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr)); 4441 4442 segbase = (Elf_Addr)(tls + round(tls_static_space, ralign)); 4443 ((Elf_Addr*)segbase)[0] = segbase; 4444 ((Elf_Addr*)segbase)[1] = (Elf_Addr) dtv; 4445 4446 dtv[0] = tls_dtv_generation; 4447 dtv[1] = tls_max_index; 4448 4449 if (oldtls) { 4450 /* 4451 * Copy the static TLS block over whole. 4452 */ 4453 oldsegbase = (Elf_Addr) oldtls; 4454 memcpy((void *)(segbase - tls_static_space), 4455 (const void *)(oldsegbase - tls_static_space), 4456 tls_static_space); 4457 4458 /* 4459 * If any dynamic TLS blocks have been created tls_get_addr(), 4460 * move them over. 4461 */ 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]; 4466 olddtv[i+2] = 0; 4467 } 4468 } 4469 4470 /* 4471 * We assume that this block was the one we created with 4472 * allocate_initial_tls(). 4473 */ 4474 free_tls(oldtls, 2*sizeof(Elf_Addr), sizeof(Elf_Addr)); 4475 } else { 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); 4481 if (obj->tlsinit) 4482 memcpy((void*) addr, obj->tlsinit, obj->tlsinitsize); 4483 dtv[obj->tlsindex + 1] = addr; 4484 } 4485 } 4486 } 4487 4488 return (void*) segbase; 4489 } 4490 4491 void 4492 free_tls(void *tls, size_t tcbsize, size_t tcbalign) 4493 { 4494 Elf_Addr* dtv; 4495 size_t size, ralign; 4496 int dtvsize, i; 4497 Elf_Addr tlsstart, tlsend; 4498 4499 /* 4500 * Figure out the size of the initial TLS block so that we can 4501 * find stuff which ___tls_get_addr() allocated dynamically. 4502 */ 4503 ralign = tcbalign; 4504 if (tls_static_max_align > ralign) 4505 ralign = tls_static_max_align; 4506 size = round(tls_static_space, ralign); 4507 4508 dtv = ((Elf_Addr**)tls)[1]; 4509 dtvsize = dtv[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]); 4515 } 4516 } 4517 4518 free_aligned((void *)tlsstart); 4519 free((void*) dtv); 4520 } 4521 4522 #endif 4523 4524 /* 4525 * Allocate TLS block for module with given index. 4526 */ 4527 void * 4528 allocate_module_tls(int index) 4529 { 4530 Obj_Entry* obj; 4531 char* p; 4532 4533 for (obj = obj_list; obj; obj = obj->next) { 4534 if (obj->tlsindex == index) 4535 break; 4536 } 4537 if (!obj) { 4538 _rtld_error("Can't find module with TLS index %d", index); 4539 die(); 4540 } 4541 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); 4545 4546 return p; 4547 } 4548 4549 bool 4550 allocate_tls_offset(Obj_Entry *obj) 4551 { 4552 size_t off; 4553 4554 if (obj->tls_done) 4555 return true; 4556 4557 if (obj->tlssize == 0) { 4558 obj->tls_done = true; 4559 return true; 4560 } 4561 4562 if (obj->tlsindex == 1) 4563 off = calculate_first_tls_offset(obj->tlssize, obj->tlsalign); 4564 else 4565 off = calculate_tls_offset(tls_last_offset, tls_last_size, 4566 obj->tlssize, obj->tlsalign); 4567 4568 /* 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. 4573 */ 4574 if (tls_static_space != 0) { 4575 if (calculate_tls_end(off, obj->tlssize) > tls_static_space) 4576 return false; 4577 } else if (obj->tlsalign > tls_static_max_align) { 4578 tls_static_max_align = obj->tlsalign; 4579 } 4580 4581 tls_last_offset = obj->tlsoffset = off; 4582 tls_last_size = obj->tlssize; 4583 obj->tls_done = true; 4584 4585 return true; 4586 } 4587 4588 void 4589 free_tls_offset(Obj_Entry *obj) 4590 { 4591 4592 /* 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. 4597 */ 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; 4601 tls_last_size = 0; 4602 } 4603 } 4604 4605 void * 4606 _rtld_allocate_tls(void *oldtls, size_t tcbsize, size_t tcbalign) 4607 { 4608 void *ret; 4609 RtldLockState lockstate; 4610 4611 wlock_acquire(rtld_bind_lock, &lockstate); 4612 ret = allocate_tls(obj_list, oldtls, tcbsize, tcbalign); 4613 lock_release(rtld_bind_lock, &lockstate); 4614 return (ret); 4615 } 4616 4617 void 4618 _rtld_free_tls(void *tcb, size_t tcbsize, size_t tcbalign) 4619 { 4620 RtldLockState lockstate; 4621 4622 wlock_acquire(rtld_bind_lock, &lockstate); 4623 free_tls(tcb, tcbsize, tcbalign); 4624 lock_release(rtld_bind_lock, &lockstate); 4625 } 4626 4627 static void 4628 object_add_name(Obj_Entry *obj, const char *name) 4629 { 4630 Name_Entry *entry; 4631 size_t len; 4632 4633 len = strlen(name); 4634 entry = malloc(sizeof(Name_Entry) + len); 4635 4636 if (entry != NULL) { 4637 strcpy(entry->name, name); 4638 STAILQ_INSERT_TAIL(&obj->names, entry, link); 4639 } 4640 } 4641 4642 static int 4643 object_match_name(const Obj_Entry *obj, const char *name) 4644 { 4645 Name_Entry *entry; 4646 4647 STAILQ_FOREACH(entry, &obj->names, link) { 4648 if (strcmp(name, entry->name) == 0) 4649 return (1); 4650 } 4651 return (0); 4652 } 4653 4654 static Obj_Entry * 4655 locate_dependency(const Obj_Entry *obj, const char *name) 4656 { 4657 const Objlist_Entry *entry; 4658 const Needed_Entry *needed; 4659 4660 STAILQ_FOREACH(entry, &list_main, link) { 4661 if (object_match_name(entry->obj, name)) 4662 return entry->obj; 4663 } 4664 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))) { 4668 /* 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. 4674 */ 4675 return (needed->obj); 4676 } 4677 } 4678 _rtld_error("%s: Unexpected inconsistency: dependency %s not found", 4679 obj->path, name); 4680 die(); 4681 } 4682 4683 static int 4684 check_object_provided_version(Obj_Entry *refobj, const Obj_Entry *depobj, 4685 const Elf_Vernaux *vna) 4686 { 4687 const Elf_Verdef *vd; 4688 const char *vername; 4689 4690 vername = refobj->strtab + vna->vna_name; 4691 vd = depobj->verdef; 4692 if (vd == NULL) { 4693 _rtld_error("%s: version %s required by %s not defined", 4694 depobj->path, vername, refobj->path); 4695 return (-1); 4696 } 4697 for (;;) { 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); 4701 return (-1); 4702 } 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) 4707 return (0); 4708 } 4709 if (vd->vd_next == 0) 4710 break; 4711 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next); 4712 } 4713 if (vna->vna_flags & VER_FLG_WEAK) 4714 return (0); 4715 _rtld_error("%s: version %s required by %s not found", 4716 depobj->path, vername, refobj->path); 4717 return (-1); 4718 } 4719 4720 static int 4721 rtld_verify_object_versions(Obj_Entry *obj) 4722 { 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; 4729 4730 if (obj->ver_checked) 4731 return (0); 4732 obj->ver_checked = true; 4733 4734 maxvernum = 0; 4735 /* 4736 * Walk over defined and required version records and figure out 4737 * max index used by any of them. Do very basic sanity checking 4738 * while there. 4739 */ 4740 vn = obj->verneed; 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); 4745 return (-1); 4746 } 4747 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux); 4748 for (;;) { 4749 vernum = VER_NEED_IDX(vna->vna_other); 4750 if (vernum > maxvernum) 4751 maxvernum = vernum; 4752 if (vna->vna_next == 0) 4753 break; 4754 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next); 4755 } 4756 if (vn->vn_next == 0) 4757 break; 4758 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next); 4759 } 4760 4761 vd = obj->verdef; 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); 4766 return (-1); 4767 } 4768 vernum = VER_DEF_IDX(vd->vd_ndx); 4769 if (vernum > maxvernum) 4770 maxvernum = vernum; 4771 if (vd->vd_next == 0) 4772 break; 4773 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next); 4774 } 4775 4776 if (maxvernum == 0) 4777 return (0); 4778 4779 /* 4780 * Store version information in array indexable by version index. 4781 * Verify that object version requirements are satisfied along the 4782 * way. 4783 */ 4784 obj->vernum = maxvernum + 1; 4785 obj->vertab = xcalloc(obj->vernum, sizeof(Ver_Entry)); 4786 4787 vd = obj->verdef; 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; 4797 } 4798 if (vd->vd_next == 0) 4799 break; 4800 vd = (const Elf_Verdef *) ((char *)vd + vd->vd_next); 4801 } 4802 4803 vn = obj->verneed; 4804 while (vn != NULL) { 4805 depobj = locate_dependency(obj, obj->strtab + vn->vn_file); 4806 if (depobj == NULL) 4807 return (-1); 4808 vna = (const Elf_Vernaux *) ((char *)vn + vn->vn_aux); 4809 for (;;) { 4810 if (check_object_provided_version(obj, depobj, vna)) 4811 return (-1); 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) 4820 break; 4821 vna = (const Elf_Vernaux *) ((char *)vna + vna->vna_next); 4822 } 4823 if (vn->vn_next == 0) 4824 break; 4825 vn = (const Elf_Verneed *) ((char *)vn + vn->vn_next); 4826 } 4827 return 0; 4828 } 4829 4830 static int 4831 rtld_verify_versions(const Objlist *objlist) 4832 { 4833 Objlist_Entry *entry; 4834 int rc; 4835 4836 rc = 0; 4837 STAILQ_FOREACH(entry, objlist, link) { 4838 /* 4839 * Skip dummy objects or objects that have their version requirements 4840 * already checked. 4841 */ 4842 if (entry->obj->strtab == NULL || entry->obj->vertab != NULL) 4843 continue; 4844 if (rtld_verify_object_versions(entry->obj) == -1) { 4845 rc = -1; 4846 if (ld_tracing == NULL) 4847 break; 4848 } 4849 } 4850 if (rc == 0 || ld_tracing != NULL) 4851 rc = rtld_verify_object_versions(&obj_rtld); 4852 return rc; 4853 } 4854 4855 const Ver_Entry * 4856 fetch_ventry(const Obj_Entry *obj, unsigned long symnum) 4857 { 4858 Elf_Versym vernum; 4859 4860 if (obj->vertab) { 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]; 4867 } 4868 } 4869 return NULL; 4870 } 4871 4872 int 4873 _rtld_get_stack_prot(void) 4874 { 4875 4876 return (stack_prot); 4877 } 4878 4879 static void 4880 map_stacks_exec(RtldLockState *lockstate) 4881 { 4882 void (*thr_map_stacks_exec)(void); 4883 4884 if ((max_stack_flags & PF_X) == 0 || (stack_prot & PROT_EXEC) != 0) 4885 return; 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(); 4891 } 4892 } 4893 4894 void 4895 symlook_init(SymLook *dst, const char *name) 4896 { 4897 4898 bzero(dst, sizeof(*dst)); 4899 dst->name = name; 4900 dst->hash = elf_hash(name); 4901 dst->hash_gnu = gnu_hash(name); 4902 } 4903 4904 static void 4905 symlook_init_from_req(SymLook *dst, const SymLook *src) 4906 { 4907 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; 4916 } 4917 4918 4919 /* 4920 * Parse a file descriptor number without pulling in more of libc (e.g. atoi). 4921 */ 4922 static int 4923 parse_libdir(const char *str) 4924 { 4925 static const int RADIX = 10; /* XXXJA: possibly support hex? */ 4926 const char *orig; 4927 int fd; 4928 char c; 4929 4930 orig = str; 4931 fd = 0; 4932 for (c = *str; c != '\0'; c = *++str) { 4933 if (c < '0' || c > '9') 4934 return (-1); 4935 4936 fd *= RADIX; 4937 fd += c - '0'; 4938 } 4939 4940 /* Make sure we actually parsed something. */ 4941 if (str == orig) { 4942 _rtld_error("failed to parse directory FD from '%s'", str); 4943 return (-1); 4944 } 4945 return (fd); 4946 } 4947 4948 /* 4949 * Overrides for libc_pic-provided functions. 4950 */ 4951 4952 int 4953 __getosreldate(void) 4954 { 4955 size_t len; 4956 int oid[2]; 4957 int error, osrel; 4958 4959 if (osreldate != 0) 4960 return (osreldate); 4961 4962 oid[0] = CTL_KERN; 4963 oid[1] = KERN_OSRELDATE; 4964 osrel = 0; 4965 len = sizeof(osrel); 4966 error = sysctl(oid, 2, &osrel, &len, NULL, 0); 4967 if (error == 0 && osrel > 0 && len == sizeof(osrel)) 4968 osreldate = osrel; 4969 return (osreldate); 4970 } 4971 4972 void 4973 exit(int status) 4974 { 4975 4976 _exit(status); 4977 } 4978 4979 void (*__cleanup)(void); 4980 int __isthreaded = 0; 4981 int _thread_autoinit_dummy_decl = 1; 4982 4983 /* 4984 * No unresolved symbols for rtld. 4985 */ 4986 void 4987 __pthread_cxa_finalize(struct dl_phdr_info *a) 4988 { 4989 } 4990 4991 void 4992 __stack_chk_fail(void) 4993 { 4994 4995 _rtld_error("stack overflow detected; terminated"); 4996 die(); 4997 } 4998 __weak_reference(__stack_chk_fail, __stack_chk_fail_local); 4999 5000 void 5001 __chk_fail(void) 5002 { 5003 5004 _rtld_error("buffer overflow detected; terminated"); 5005 die(); 5006 } 5007 5008 const char * 5009 rtld_strerror(int errnum) 5010 { 5011 5012 if (errnum < 0 || errnum >= sys_nerr) 5013 return ("Unknown error"); 5014 return (sys_errlist[errnum]); 5015 } 5016