1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright 1996, 1997, 1998, 1999, 2000 John D. Polstra. 5 * Copyright 2003 Alexander Kabaev <kan@FreeBSD.ORG>. 6 * Copyright 2009-2013 Konstantin Belousov <kib@FreeBSD.ORG>. 7 * Copyright 2012 John Marino <draco@marino.st>. 8 * Copyright 2014-2017 The FreeBSD Foundation 9 * All rights reserved. 10 * 11 * Portions of this software were developed by Konstantin Belousov 12 * under sponsorship from the FreeBSD Foundation. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions 16 * are met: 17 * 1. Redistributions of source code must retain the above copyright 18 * notice, this list of conditions and the following disclaimer. 19 * 2. Redistributions in binary form must reproduce the above copyright 20 * notice, this list of conditions and the following disclaimer in the 21 * documentation and/or other materials provided with the distribution. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 33 */ 34 35 /* 36 * Dynamic linker for ELF. 37 * 38 * John Polstra <jdp@polstra.com>. 39 */ 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_paths.h" 64 #include "rtld_tls.h" 65 #include "rtld_printf.h" 66 #include "rtld_malloc.h" 67 #include "rtld_utrace.h" 68 #include "notes.h" 69 #include "rtld_libc.h" 70 71 /* Types. */ 72 typedef void (*func_ptr_type)(void); 73 typedef void * (*path_enum_proc) (const char *path, size_t len, void *arg); 74 75 76 /* Variables that cannot be static: */ 77 extern struct r_debug r_debug; /* For GDB */ 78 extern int _thread_autoinit_dummy_decl; 79 extern void (*__cleanup)(void); 80 81 struct dlerror_save { 82 int seen; 83 char *msg; 84 }; 85 86 /* 87 * Function declarations. 88 */ 89 static const char *basename(const char *); 90 static void digest_dynamic1(Obj_Entry *, int, const Elf_Dyn **, 91 const Elf_Dyn **, const Elf_Dyn **); 92 static bool digest_dynamic2(Obj_Entry *, const Elf_Dyn *, const Elf_Dyn *, 93 const Elf_Dyn *); 94 static bool digest_dynamic(Obj_Entry *, int); 95 static Obj_Entry *digest_phdr(const Elf_Phdr *, int, caddr_t, const char *); 96 static void distribute_static_tls(Objlist *, RtldLockState *); 97 static Obj_Entry *dlcheck(void *); 98 static int dlclose_locked(void *, RtldLockState *); 99 static Obj_Entry *dlopen_object(const char *name, int fd, Obj_Entry *refobj, 100 int lo_flags, int mode, RtldLockState *lockstate); 101 static Obj_Entry *do_load_object(int, const char *, char *, struct stat *, int); 102 static int do_search_info(const Obj_Entry *obj, int, struct dl_serinfo *); 103 static bool donelist_check(DoneList *, const Obj_Entry *); 104 static void dump_auxv(Elf_Auxinfo **aux_info); 105 static void errmsg_restore(struct dlerror_save *); 106 static struct dlerror_save *errmsg_save(void); 107 static void *fill_search_info(const char *, size_t, void *); 108 static char *find_library(const char *, const Obj_Entry *, int *); 109 static const char *gethints(bool); 110 static void hold_object(Obj_Entry *); 111 static void unhold_object(Obj_Entry *); 112 static void init_dag(Obj_Entry *); 113 static void init_marker(Obj_Entry *); 114 static void init_pagesizes(Elf_Auxinfo **aux_info); 115 static void init_rtld(caddr_t, Elf_Auxinfo **); 116 static void initlist_add_neededs(Needed_Entry *, Objlist *); 117 static void initlist_add_objects(Obj_Entry *, Obj_Entry *, Objlist *); 118 static int initlist_objects_ifunc(Objlist *, bool, int, RtldLockState *); 119 static void linkmap_add(Obj_Entry *); 120 static void linkmap_delete(Obj_Entry *); 121 static void load_filtees(Obj_Entry *, int flags, RtldLockState *); 122 static void unload_filtees(Obj_Entry *, RtldLockState *); 123 static int load_needed_objects(Obj_Entry *, int); 124 static int load_preload_objects(const char *, bool); 125 static int load_kpreload(const void *addr); 126 static Obj_Entry *load_object(const char *, int fd, const Obj_Entry *, int); 127 static void map_stacks_exec(RtldLockState *); 128 static int obj_disable_relro(Obj_Entry *); 129 static int obj_enforce_relro(Obj_Entry *); 130 static void objlist_call_fini(Objlist *, Obj_Entry *, RtldLockState *); 131 static void objlist_call_init(Objlist *, RtldLockState *); 132 static void objlist_clear(Objlist *); 133 static Objlist_Entry *objlist_find(Objlist *, const Obj_Entry *); 134 static void objlist_init(Objlist *); 135 static void objlist_push_head(Objlist *, Obj_Entry *); 136 static void objlist_push_tail(Objlist *, Obj_Entry *); 137 static void objlist_put_after(Objlist *, Obj_Entry *, Obj_Entry *); 138 static void objlist_remove(Objlist *, Obj_Entry *); 139 static int open_binary_fd(const char *argv0, bool search_in_path, 140 const char **binpath_res); 141 static int parse_args(char* argv[], int argc, bool *use_pathp, int *fdp, 142 const char **argv0, bool *dir_ignore); 143 static int parse_integer(const char *); 144 static void *path_enumerate(const char *, path_enum_proc, const char *, void *); 145 static void print_usage(const char *argv0); 146 static void release_object(Obj_Entry *); 147 static int relocate_object_dag(Obj_Entry *root, bool bind_now, 148 Obj_Entry *rtldobj, int flags, RtldLockState *lockstate); 149 static int relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj, 150 int flags, RtldLockState *lockstate); 151 static int relocate_objects(Obj_Entry *, bool, Obj_Entry *, int, 152 RtldLockState *); 153 static int resolve_object_ifunc(Obj_Entry *, bool, int, RtldLockState *); 154 static int rtld_dirname(const char *, char *); 155 static int rtld_dirname_abs(const char *, char *); 156 static void *rtld_dlopen(const char *name, int fd, int mode); 157 static void rtld_exit(void); 158 static void rtld_nop_exit(void); 159 static char *search_library_path(const char *, const char *, const char *, 160 int *); 161 static char *search_library_pathfds(const char *, const char *, int *); 162 static const void **get_program_var_addr(const char *, RtldLockState *); 163 static void set_program_var(const char *, const void *); 164 static int symlook_default(SymLook *, const Obj_Entry *refobj); 165 static int symlook_global(SymLook *, DoneList *); 166 static void symlook_init_from_req(SymLook *, const SymLook *); 167 static int symlook_list(SymLook *, const Objlist *, DoneList *); 168 static int symlook_needed(SymLook *, const Needed_Entry *, DoneList *); 169 static int symlook_obj1_sysv(SymLook *, const Obj_Entry *); 170 static int symlook_obj1_gnu(SymLook *, const Obj_Entry *); 171 static void *tls_get_addr_slow(Elf_Addr **, int, size_t, bool) __noinline; 172 static void trace_loaded_objects(Obj_Entry *, bool); 173 static void unlink_object(Obj_Entry *); 174 static void unload_object(Obj_Entry *, RtldLockState *lockstate); 175 static void unref_dag(Obj_Entry *); 176 static void ref_dag(Obj_Entry *); 177 static char *origin_subst_one(Obj_Entry *, char *, const char *, 178 const char *, bool); 179 static char *origin_subst(Obj_Entry *, const char *); 180 static bool obj_resolve_origin(Obj_Entry *obj); 181 static void preinit_main(void); 182 static int rtld_verify_versions(const Objlist *); 183 static int rtld_verify_object_versions(Obj_Entry *); 184 static void object_add_name(Obj_Entry *, const char *); 185 static int object_match_name(const Obj_Entry *, const char *); 186 static void ld_utrace_log(int, void *, void *, size_t, int, const char *); 187 static void rtld_fill_dl_phdr_info(const Obj_Entry *obj, 188 struct dl_phdr_info *phdr_info); 189 static uint32_t gnu_hash(const char *); 190 static bool matched_symbol(SymLook *, const Obj_Entry *, Sym_Match_Result *, 191 const unsigned long); 192 193 void r_debug_state(struct r_debug *, struct link_map *) __noinline __exported; 194 void _r_debug_postinit(struct link_map *) __noinline __exported; 195 196 int __sys_openat(int, const char *, int, ...); 197 198 /* 199 * Data declarations. 200 */ 201 struct r_debug r_debug __exported; /* for GDB; */ 202 static bool libmap_disable; /* Disable libmap */ 203 static bool ld_loadfltr; /* Immediate filters processing */ 204 static const char *libmap_override;/* Maps to use in addition to libmap.conf */ 205 static bool trust; /* False for setuid and setgid programs */ 206 static bool dangerous_ld_env; /* True if environment variables have been 207 used to affect the libraries loaded */ 208 bool ld_bind_not; /* Disable PLT update */ 209 static const char *ld_bind_now; /* Environment variable for immediate binding */ 210 static const char *ld_debug; /* Environment variable for debugging */ 211 static bool ld_dynamic_weak = true; /* True if non-weak definition overrides 212 weak definition */ 213 static const char *ld_library_path;/* Environment variable for search path */ 214 static const char *ld_library_dirs;/* Environment variable for library descriptors */ 215 static const char *ld_preload; /* Environment variable for libraries to 216 load first */ 217 static const char *ld_preload_fds;/* Environment variable for libraries represented by 218 descriptors */ 219 static const char *ld_elf_hints_path; /* Environment variable for alternative hints path */ 220 static const char *ld_tracing; /* Called from ldd to print libs */ 221 static const char *ld_utrace; /* Use utrace() to log events. */ 222 static struct obj_entry_q obj_list; /* Queue of all loaded objects */ 223 static Obj_Entry *obj_main; /* The main program shared object */ 224 static Obj_Entry obj_rtld; /* The dynamic linker shared object */ 225 static unsigned int obj_count; /* Number of objects in obj_list */ 226 static unsigned int obj_loads; /* Number of loads of objects (gen count) */ 227 size_t ld_static_tls_extra = /* Static TLS extra space (bytes) */ 228 RTLD_STATIC_TLS_EXTRA; 229 230 static Objlist list_global = /* Objects dlopened with RTLD_GLOBAL */ 231 STAILQ_HEAD_INITIALIZER(list_global); 232 static Objlist list_main = /* Objects loaded at program startup */ 233 STAILQ_HEAD_INITIALIZER(list_main); 234 static Objlist list_fini = /* Objects needing fini() calls */ 235 STAILQ_HEAD_INITIALIZER(list_fini); 236 237 Elf_Sym sym_zero; /* For resolving undefined weak refs. */ 238 239 #define GDB_STATE(s,m) r_debug.r_state = s; r_debug_state(&r_debug,m); 240 241 extern Elf_Dyn _DYNAMIC; 242 #pragma weak _DYNAMIC 243 244 int dlclose(void *) __exported; 245 char *dlerror(void) __exported; 246 void *dlopen(const char *, int) __exported; 247 void *fdlopen(int, int) __exported; 248 void *dlsym(void *, const char *) __exported; 249 dlfunc_t dlfunc(void *, const char *) __exported; 250 void *dlvsym(void *, const char *, const char *) __exported; 251 int dladdr(const void *, Dl_info *) __exported; 252 void dllockinit(void *, void *(*)(void *), void (*)(void *), void (*)(void *), 253 void (*)(void *), void (*)(void *), void (*)(void *)) __exported; 254 int dlinfo(void *, int , void *) __exported; 255 int dl_iterate_phdr(__dl_iterate_hdr_callback, void *) __exported; 256 int _rtld_addr_phdr(const void *, struct dl_phdr_info *) __exported; 257 int _rtld_get_stack_prot(void) __exported; 258 int _rtld_is_dlopened(void *) __exported; 259 void _rtld_error(const char *, ...) __exported; 260 261 /* Only here to fix -Wmissing-prototypes warnings */ 262 int __getosreldate(void); 263 func_ptr_type _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp); 264 Elf_Addr _rtld_bind(Obj_Entry *obj, Elf_Size reloff); 265 266 int npagesizes; 267 static int osreldate; 268 size_t *pagesizes; 269 size_t page_size; 270 271 static int stack_prot = PROT_READ | PROT_WRITE | PROT_EXEC; 272 static int max_stack_flags; 273 274 /* 275 * Global declarations normally provided by crt1. The dynamic linker is 276 * not built with crt1, so we have to provide them ourselves. 277 */ 278 char *__progname; 279 char **environ; 280 281 /* 282 * Used to pass argc, argv to init functions. 283 */ 284 int main_argc; 285 char **main_argv; 286 287 /* 288 * Globals to control TLS allocation. 289 */ 290 size_t tls_last_offset; /* Static TLS offset of last module */ 291 size_t tls_last_size; /* Static TLS size of last module */ 292 size_t tls_static_space; /* Static TLS space allocated */ 293 static size_t tls_static_max_align; 294 Elf_Addr tls_dtv_generation = 1; /* Used to detect when dtv size changes */ 295 int tls_max_index = 1; /* Largest module index allocated */ 296 297 static bool ld_library_path_rpath = false; 298 bool ld_fast_sigblock = false; 299 300 /* 301 * Globals for path names, and such 302 */ 303 const char *ld_elf_hints_default = _PATH_ELF_HINTS; 304 const char *ld_path_libmap_conf = _PATH_LIBMAP_CONF; 305 const char *ld_path_rtld = _PATH_RTLD; 306 const char *ld_standard_library_path = STANDARD_LIBRARY_PATH; 307 const char *ld_env_prefix = LD_; 308 309 static void (*rtld_exit_ptr)(void); 310 311 /* 312 * Fill in a DoneList with an allocation large enough to hold all of 313 * the currently-loaded objects. Keep this as a macro since it calls 314 * alloca and we want that to occur within the scope of the caller. 315 */ 316 #define donelist_init(dlp) \ 317 ((dlp)->objs = alloca(obj_count * sizeof (dlp)->objs[0]), \ 318 assert((dlp)->objs != NULL), \ 319 (dlp)->num_alloc = obj_count, \ 320 (dlp)->num_used = 0) 321 322 #define LD_UTRACE(e, h, mb, ms, r, n) do { \ 323 if (ld_utrace != NULL) \ 324 ld_utrace_log(e, h, mb, ms, r, n); \ 325 } while (0) 326 327 static void 328 ld_utrace_log(int event, void *handle, void *mapbase, size_t mapsize, 329 int refcnt, const char *name) 330 { 331 struct utrace_rtld ut; 332 static const char rtld_utrace_sig[RTLD_UTRACE_SIG_SZ] = RTLD_UTRACE_SIG; 333 334 memcpy(ut.sig, rtld_utrace_sig, sizeof(ut.sig)); 335 ut.event = event; 336 ut.handle = handle; 337 ut.mapbase = mapbase; 338 ut.mapsize = mapsize; 339 ut.refcnt = refcnt; 340 bzero(ut.name, sizeof(ut.name)); 341 if (name) 342 strlcpy(ut.name, name, sizeof(ut.name)); 343 utrace(&ut, sizeof(ut)); 344 } 345 346 enum { 347 LD_BIND_NOW = 0, 348 LD_PRELOAD, 349 LD_LIBMAP, 350 LD_LIBRARY_PATH, 351 LD_LIBRARY_PATH_FDS, 352 LD_LIBMAP_DISABLE, 353 LD_BIND_NOT, 354 LD_DEBUG, 355 LD_ELF_HINTS_PATH, 356 LD_LOADFLTR, 357 LD_LIBRARY_PATH_RPATH, 358 LD_PRELOAD_FDS, 359 LD_DYNAMIC_WEAK, 360 LD_TRACE_LOADED_OBJECTS, 361 LD_UTRACE, 362 LD_DUMP_REL_PRE, 363 LD_DUMP_REL_POST, 364 LD_TRACE_LOADED_OBJECTS_PROGNAME, 365 LD_TRACE_LOADED_OBJECTS_FMT1, 366 LD_TRACE_LOADED_OBJECTS_FMT2, 367 LD_TRACE_LOADED_OBJECTS_ALL, 368 LD_SHOW_AUXV, 369 LD_STATIC_TLS_EXTRA, 370 }; 371 372 struct ld_env_var_desc { 373 const char * const n; 374 const char *val; 375 const bool unsecure; 376 }; 377 #define LD_ENV_DESC(var, unsec) \ 378 [LD_##var] = { .n = #var, .unsecure = unsec } 379 380 static struct ld_env_var_desc ld_env_vars[] = { 381 LD_ENV_DESC(BIND_NOW, false), 382 LD_ENV_DESC(PRELOAD, true), 383 LD_ENV_DESC(LIBMAP, true), 384 LD_ENV_DESC(LIBRARY_PATH, true), 385 LD_ENV_DESC(LIBRARY_PATH_FDS, true), 386 LD_ENV_DESC(LIBMAP_DISABLE, true), 387 LD_ENV_DESC(BIND_NOT, true), 388 LD_ENV_DESC(DEBUG, true), 389 LD_ENV_DESC(ELF_HINTS_PATH, true), 390 LD_ENV_DESC(LOADFLTR, true), 391 LD_ENV_DESC(LIBRARY_PATH_RPATH, true), 392 LD_ENV_DESC(PRELOAD_FDS, true), 393 LD_ENV_DESC(DYNAMIC_WEAK, true), 394 LD_ENV_DESC(TRACE_LOADED_OBJECTS, false), 395 LD_ENV_DESC(UTRACE, false), 396 LD_ENV_DESC(DUMP_REL_PRE, false), 397 LD_ENV_DESC(DUMP_REL_POST, false), 398 LD_ENV_DESC(TRACE_LOADED_OBJECTS_PROGNAME, false), 399 LD_ENV_DESC(TRACE_LOADED_OBJECTS_FMT1, false), 400 LD_ENV_DESC(TRACE_LOADED_OBJECTS_FMT2, false), 401 LD_ENV_DESC(TRACE_LOADED_OBJECTS_ALL, false), 402 LD_ENV_DESC(SHOW_AUXV, false), 403 LD_ENV_DESC(STATIC_TLS_EXTRA, false), 404 }; 405 406 static const char * 407 ld_get_env_var(int idx) 408 { 409 return (ld_env_vars[idx].val); 410 } 411 412 static const char * 413 rtld_get_env_val(char **env, const char *name, size_t name_len) 414 { 415 char **m, *n, *v; 416 417 for (m = env; *m != NULL; m++) { 418 n = *m; 419 v = strchr(n, '='); 420 if (v == NULL) { 421 /* corrupt environment? */ 422 continue; 423 } 424 if (v - n == (ptrdiff_t)name_len && 425 strncmp(name, n, name_len) == 0) 426 return (v + 1); 427 } 428 return (NULL); 429 } 430 431 static void 432 rtld_init_env_vars_for_prefix(char **env, const char *env_prefix) 433 { 434 struct ld_env_var_desc *lvd; 435 size_t prefix_len, nlen; 436 char **m, *n, *v; 437 int i; 438 439 prefix_len = strlen(env_prefix); 440 for (m = env; *m != NULL; m++) { 441 n = *m; 442 if (strncmp(env_prefix, n, prefix_len) != 0) { 443 /* Not a rtld environment variable. */ 444 continue; 445 } 446 n += prefix_len; 447 v = strchr(n, '='); 448 if (v == NULL) { 449 /* corrupt environment? */ 450 continue; 451 } 452 for (i = 0; i < (int)nitems(ld_env_vars); i++) { 453 lvd = &ld_env_vars[i]; 454 if (lvd->val != NULL) { 455 /* Saw higher-priority variable name already. */ 456 continue; 457 } 458 nlen = strlen(lvd->n); 459 if (v - n == (ptrdiff_t)nlen && 460 strncmp(lvd->n, n, nlen) == 0) { 461 lvd->val = v + 1; 462 break; 463 } 464 } 465 } 466 } 467 468 static void 469 rtld_init_env_vars(char **env) 470 { 471 rtld_init_env_vars_for_prefix(env, ld_env_prefix); 472 } 473 474 static void 475 set_ld_elf_hints_path(void) 476 { 477 if (ld_elf_hints_path == NULL || strlen(ld_elf_hints_path) == 0) 478 ld_elf_hints_path = ld_elf_hints_default; 479 } 480 481 uintptr_t 482 rtld_round_page(uintptr_t x) 483 { 484 return (roundup2(x, page_size)); 485 } 486 487 uintptr_t 488 rtld_trunc_page(uintptr_t x) 489 { 490 return (rounddown2(x, page_size)); 491 } 492 493 /* 494 * Main entry point for dynamic linking. The first argument is the 495 * stack pointer. The stack is expected to be laid out as described 496 * in the SVR4 ABI specification, Intel 386 Processor Supplement. 497 * Specifically, the stack pointer points to a word containing 498 * ARGC. Following that in the stack is a null-terminated sequence 499 * of pointers to argument strings. Then comes a null-terminated 500 * sequence of pointers to environment strings. Finally, there is a 501 * sequence of "auxiliary vector" entries. 502 * 503 * The second argument points to a place to store the dynamic linker's 504 * exit procedure pointer and the third to a place to store the main 505 * program's object. 506 * 507 * The return value is the main program's entry point. 508 */ 509 func_ptr_type 510 _rtld(Elf_Addr *sp, func_ptr_type *exit_proc, Obj_Entry **objp) 511 { 512 Elf_Auxinfo *aux, *auxp, *auxpf, *aux_info[AT_COUNT]; 513 Objlist_Entry *entry; 514 Obj_Entry *last_interposer, *obj, *preload_tail; 515 const Elf_Phdr *phdr; 516 Objlist initlist; 517 RtldLockState lockstate; 518 struct stat st; 519 Elf_Addr *argcp; 520 char **argv, **env, **envp, *kexecpath; 521 const char *argv0, *binpath, *library_path_rpath, *static_tls_extra; 522 struct ld_env_var_desc *lvd; 523 caddr_t imgentry; 524 char buf[MAXPATHLEN]; 525 int argc, fd, i, mib[4], old_osrel, osrel, phnum, rtld_argc; 526 size_t sz; 527 #ifdef __powerpc__ 528 int old_auxv_format = 1; 529 #endif 530 bool dir_enable, dir_ignore, direct_exec, explicit_fd, search_in_path; 531 532 /* 533 * On entry, the dynamic linker itself has not been relocated yet. 534 * Be very careful not to reference any global data until after 535 * init_rtld has returned. It is OK to reference file-scope statics 536 * and string constants, and to call static and global functions. 537 */ 538 539 /* Find the auxiliary vector on the stack. */ 540 argcp = sp; 541 argc = *sp++; 542 argv = (char **) sp; 543 sp += argc + 1; /* Skip over arguments and NULL terminator */ 544 env = (char **) sp; 545 while (*sp++ != 0) /* Skip over environment, and NULL terminator */ 546 ; 547 aux = (Elf_Auxinfo *) sp; 548 549 /* Digest the auxiliary vector. */ 550 for (i = 0; i < AT_COUNT; i++) 551 aux_info[i] = NULL; 552 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) { 553 if (auxp->a_type < AT_COUNT) 554 aux_info[auxp->a_type] = auxp; 555 #ifdef __powerpc__ 556 if (auxp->a_type == 23) /* AT_STACKPROT */ 557 old_auxv_format = 0; 558 #endif 559 } 560 561 #ifdef __powerpc__ 562 if (old_auxv_format) { 563 /* Remap from old-style auxv numbers. */ 564 aux_info[23] = aux_info[21]; /* AT_STACKPROT */ 565 aux_info[21] = aux_info[19]; /* AT_PAGESIZESLEN */ 566 aux_info[19] = aux_info[17]; /* AT_NCPUS */ 567 aux_info[17] = aux_info[15]; /* AT_CANARYLEN */ 568 aux_info[15] = aux_info[13]; /* AT_EXECPATH */ 569 aux_info[13] = NULL; /* AT_GID */ 570 571 aux_info[20] = aux_info[18]; /* AT_PAGESIZES */ 572 aux_info[18] = aux_info[16]; /* AT_OSRELDATE */ 573 aux_info[16] = aux_info[14]; /* AT_CANARY */ 574 aux_info[14] = NULL; /* AT_EGID */ 575 } 576 #endif 577 578 /* Initialize and relocate ourselves. */ 579 assert(aux_info[AT_BASE] != NULL); 580 init_rtld((caddr_t) aux_info[AT_BASE]->a_un.a_ptr, aux_info); 581 582 dlerror_dflt_init(); 583 584 __progname = obj_rtld.path; 585 argv0 = argv[0] != NULL ? argv[0] : "(null)"; 586 environ = env; 587 main_argc = argc; 588 main_argv = argv; 589 590 if (aux_info[AT_BSDFLAGS] != NULL && 591 (aux_info[AT_BSDFLAGS]->a_un.a_val & ELF_BSDF_SIGFASTBLK) != 0) 592 ld_fast_sigblock = true; 593 594 trust = !issetugid(); 595 direct_exec = false; 596 597 md_abi_variant_hook(aux_info); 598 rtld_init_env_vars(env); 599 600 fd = -1; 601 if (aux_info[AT_EXECFD] != NULL) { 602 fd = aux_info[AT_EXECFD]->a_un.a_val; 603 } else { 604 assert(aux_info[AT_PHDR] != NULL); 605 phdr = (const Elf_Phdr *)aux_info[AT_PHDR]->a_un.a_ptr; 606 if (phdr == obj_rtld.phdr) { 607 if (!trust) { 608 _rtld_error("Tainted process refusing to run binary %s", 609 argv0); 610 rtld_die(); 611 } 612 direct_exec = true; 613 614 dbg("opening main program in direct exec mode"); 615 if (argc >= 2) { 616 rtld_argc = parse_args(argv, argc, &search_in_path, &fd, 617 &argv0, &dir_ignore); 618 explicit_fd = (fd != -1); 619 binpath = NULL; 620 if (!explicit_fd) 621 fd = open_binary_fd(argv0, search_in_path, &binpath); 622 if (fstat(fd, &st) == -1) { 623 _rtld_error("Failed to fstat FD %d (%s): %s", fd, 624 explicit_fd ? "user-provided descriptor" : argv0, 625 rtld_strerror(errno)); 626 rtld_die(); 627 } 628 629 /* 630 * Rough emulation of the permission checks done by 631 * execve(2), only Unix DACs are checked, ACLs are 632 * ignored. Preserve the semantic of disabling owner 633 * to execute if owner x bit is cleared, even if 634 * others x bit is enabled. 635 * mmap(2) does not allow to mmap with PROT_EXEC if 636 * binary' file comes from noexec mount. We cannot 637 * set a text reference on the binary. 638 */ 639 dir_enable = false; 640 if (st.st_uid == geteuid()) { 641 if ((st.st_mode & S_IXUSR) != 0) 642 dir_enable = true; 643 } else if (st.st_gid == getegid()) { 644 if ((st.st_mode & S_IXGRP) != 0) 645 dir_enable = true; 646 } else if ((st.st_mode & S_IXOTH) != 0) { 647 dir_enable = true; 648 } 649 if (!dir_enable && !dir_ignore) { 650 _rtld_error("No execute permission for binary %s", 651 argv0); 652 rtld_die(); 653 } 654 655 /* 656 * For direct exec mode, argv[0] is the interpreter 657 * name, we must remove it and shift arguments left 658 * before invoking binary main. Since stack layout 659 * places environment pointers and aux vectors right 660 * after the terminating NULL, we must shift 661 * environment and aux as well. 662 */ 663 main_argc = argc - rtld_argc; 664 for (i = 0; i <= main_argc; i++) 665 argv[i] = argv[i + rtld_argc]; 666 *argcp -= rtld_argc; 667 environ = env = envp = argv + main_argc + 1; 668 dbg("move env from %p to %p", envp + rtld_argc, envp); 669 do { 670 *envp = *(envp + rtld_argc); 671 } while (*envp++ != NULL); 672 aux = auxp = (Elf_Auxinfo *)envp; 673 auxpf = (Elf_Auxinfo *)(envp + rtld_argc); 674 dbg("move aux from %p to %p", auxpf, aux); 675 /* XXXKIB insert place for AT_EXECPATH if not present */ 676 for (;; auxp++, auxpf++) { 677 *auxp = *auxpf; 678 if (auxp->a_type == AT_NULL) 679 break; 680 } 681 /* Since the auxiliary vector has moved, redigest it. */ 682 for (i = 0; i < AT_COUNT; i++) 683 aux_info[i] = NULL; 684 for (auxp = aux; auxp->a_type != AT_NULL; auxp++) { 685 if (auxp->a_type < AT_COUNT) 686 aux_info[auxp->a_type] = auxp; 687 } 688 689 /* Point AT_EXECPATH auxv and aux_info to the binary path. */ 690 if (binpath == NULL) { 691 aux_info[AT_EXECPATH] = NULL; 692 } else { 693 if (aux_info[AT_EXECPATH] == NULL) { 694 aux_info[AT_EXECPATH] = xmalloc(sizeof(Elf_Auxinfo)); 695 aux_info[AT_EXECPATH]->a_type = AT_EXECPATH; 696 } 697 aux_info[AT_EXECPATH]->a_un.a_ptr = __DECONST(void *, 698 binpath); 699 } 700 } else { 701 _rtld_error("No binary"); 702 rtld_die(); 703 } 704 } 705 } 706 707 ld_bind_now = ld_get_env_var(LD_BIND_NOW); 708 709 /* 710 * If the process is tainted, then we un-set the dangerous environment 711 * variables. The process will be marked as tainted until setuid(2) 712 * is called. If any child process calls setuid(2) we do not want any 713 * future processes to honor the potentially un-safe variables. 714 */ 715 if (!trust) { 716 for (i = 0; i < (int)nitems(ld_env_vars); i++) { 717 lvd = &ld_env_vars[i]; 718 if (lvd->unsecure) 719 lvd->val = NULL; 720 } 721 } 722 723 ld_debug = ld_get_env_var(LD_DEBUG); 724 if (ld_bind_now == NULL) 725 ld_bind_not = ld_get_env_var(LD_BIND_NOT) != NULL; 726 ld_dynamic_weak = ld_get_env_var(LD_DYNAMIC_WEAK) == NULL; 727 libmap_disable = ld_get_env_var(LD_LIBMAP_DISABLE) != NULL; 728 libmap_override = ld_get_env_var(LD_LIBMAP); 729 ld_library_path = ld_get_env_var(LD_LIBRARY_PATH); 730 ld_library_dirs = ld_get_env_var(LD_LIBRARY_PATH_FDS); 731 ld_preload = ld_get_env_var(LD_PRELOAD); 732 ld_preload_fds = ld_get_env_var(LD_PRELOAD_FDS); 733 ld_elf_hints_path = ld_get_env_var(LD_ELF_HINTS_PATH); 734 ld_loadfltr = ld_get_env_var(LD_LOADFLTR) != NULL; 735 library_path_rpath = ld_get_env_var(LD_LIBRARY_PATH_RPATH); 736 if (library_path_rpath != NULL) { 737 if (library_path_rpath[0] == 'y' || 738 library_path_rpath[0] == 'Y' || 739 library_path_rpath[0] == '1') 740 ld_library_path_rpath = true; 741 else 742 ld_library_path_rpath = false; 743 } 744 static_tls_extra = ld_get_env_var(LD_STATIC_TLS_EXTRA); 745 if (static_tls_extra != NULL && static_tls_extra[0] != '\0') { 746 sz = parse_integer(static_tls_extra); 747 if (sz >= RTLD_STATIC_TLS_EXTRA && sz <= SIZE_T_MAX) 748 ld_static_tls_extra = sz; 749 } 750 dangerous_ld_env = libmap_disable || libmap_override != NULL || 751 ld_library_path != NULL || ld_preload != NULL || 752 ld_elf_hints_path != NULL || ld_loadfltr || !ld_dynamic_weak || 753 static_tls_extra != NULL; 754 ld_tracing = ld_get_env_var(LD_TRACE_LOADED_OBJECTS); 755 ld_utrace = ld_get_env_var(LD_UTRACE); 756 757 set_ld_elf_hints_path(); 758 if (ld_debug != NULL && *ld_debug != '\0') 759 debug = 1; 760 dbg("%s is initialized, base address = %p", __progname, 761 (caddr_t) aux_info[AT_BASE]->a_un.a_ptr); 762 dbg("RTLD dynamic = %p", obj_rtld.dynamic); 763 dbg("RTLD pltgot = %p", obj_rtld.pltgot); 764 765 dbg("initializing thread locks"); 766 lockdflt_init(); 767 768 /* 769 * Load the main program, or process its program header if it is 770 * already loaded. 771 */ 772 if (fd != -1) { /* Load the main program. */ 773 dbg("loading main program"); 774 obj_main = map_object(fd, argv0, NULL); 775 close(fd); 776 if (obj_main == NULL) 777 rtld_die(); 778 max_stack_flags = obj_main->stack_flags; 779 } else { /* Main program already loaded. */ 780 dbg("processing main program's program header"); 781 assert(aux_info[AT_PHDR] != NULL); 782 phdr = (const Elf_Phdr *) aux_info[AT_PHDR]->a_un.a_ptr; 783 assert(aux_info[AT_PHNUM] != NULL); 784 phnum = aux_info[AT_PHNUM]->a_un.a_val; 785 assert(aux_info[AT_PHENT] != NULL); 786 assert(aux_info[AT_PHENT]->a_un.a_val == sizeof(Elf_Phdr)); 787 assert(aux_info[AT_ENTRY] != NULL); 788 imgentry = (caddr_t) aux_info[AT_ENTRY]->a_un.a_ptr; 789 if ((obj_main = digest_phdr(phdr, phnum, imgentry, argv0)) == NULL) 790 rtld_die(); 791 } 792 793 if (aux_info[AT_EXECPATH] != NULL && fd == -1) { 794 kexecpath = aux_info[AT_EXECPATH]->a_un.a_ptr; 795 dbg("AT_EXECPATH %p %s", kexecpath, kexecpath); 796 if (kexecpath[0] == '/') 797 obj_main->path = kexecpath; 798 else if (getcwd(buf, sizeof(buf)) == NULL || 799 strlcat(buf, "/", sizeof(buf)) >= sizeof(buf) || 800 strlcat(buf, kexecpath, sizeof(buf)) >= sizeof(buf)) 801 obj_main->path = xstrdup(argv0); 802 else 803 obj_main->path = xstrdup(buf); 804 } else { 805 dbg("No AT_EXECPATH or direct exec"); 806 obj_main->path = xstrdup(argv0); 807 } 808 dbg("obj_main path %s", obj_main->path); 809 obj_main->mainprog = true; 810 811 if (aux_info[AT_STACKPROT] != NULL && 812 aux_info[AT_STACKPROT]->a_un.a_val != 0) 813 stack_prot = aux_info[AT_STACKPROT]->a_un.a_val; 814 815 #ifndef COMPAT_libcompat 816 /* 817 * Get the actual dynamic linker pathname from the executable if 818 * possible. (It should always be possible.) That ensures that 819 * gdb will find the right dynamic linker even if a non-standard 820 * one is being used. 821 */ 822 if (obj_main->interp != NULL && 823 strcmp(obj_main->interp, obj_rtld.path) != 0) { 824 free(obj_rtld.path); 825 obj_rtld.path = xstrdup(obj_main->interp); 826 __progname = obj_rtld.path; 827 } 828 #endif 829 830 if (!digest_dynamic(obj_main, 0)) 831 rtld_die(); 832 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d", 833 obj_main->path, obj_main->valid_hash_sysv, obj_main->valid_hash_gnu, 834 obj_main->dynsymcount); 835 836 linkmap_add(obj_main); 837 linkmap_add(&obj_rtld); 838 839 /* Link the main program into the list of objects. */ 840 TAILQ_INSERT_HEAD(&obj_list, obj_main, next); 841 obj_count++; 842 obj_loads++; 843 844 /* Initialize a fake symbol for resolving undefined weak references. */ 845 sym_zero.st_info = ELF_ST_INFO(STB_GLOBAL, STT_NOTYPE); 846 sym_zero.st_shndx = SHN_UNDEF; 847 sym_zero.st_value = -(uintptr_t)obj_main->relocbase; 848 849 if (!libmap_disable) 850 libmap_disable = (bool)lm_init(libmap_override); 851 852 if (aux_info[AT_KPRELOAD] != NULL && 853 aux_info[AT_KPRELOAD]->a_un.a_ptr != NULL) { 854 dbg("loading kernel vdso"); 855 if (load_kpreload(aux_info[AT_KPRELOAD]->a_un.a_ptr) == -1) 856 rtld_die(); 857 } 858 859 dbg("loading LD_PRELOAD_FDS libraries"); 860 if (load_preload_objects(ld_preload_fds, true) == -1) 861 rtld_die(); 862 863 dbg("loading LD_PRELOAD libraries"); 864 if (load_preload_objects(ld_preload, false) == -1) 865 rtld_die(); 866 preload_tail = globallist_curr(TAILQ_LAST(&obj_list, obj_entry_q)); 867 868 dbg("loading needed objects"); 869 if (load_needed_objects(obj_main, ld_tracing != NULL ? RTLD_LO_TRACE : 870 0) == -1) 871 rtld_die(); 872 873 /* Make a list of all objects loaded at startup. */ 874 last_interposer = obj_main; 875 TAILQ_FOREACH(obj, &obj_list, next) { 876 if (obj->marker) 877 continue; 878 if (obj->z_interpose && obj != obj_main) { 879 objlist_put_after(&list_main, last_interposer, obj); 880 last_interposer = obj; 881 } else { 882 objlist_push_tail(&list_main, obj); 883 } 884 obj->refcount++; 885 } 886 887 dbg("checking for required versions"); 888 if (rtld_verify_versions(&list_main) == -1 && !ld_tracing) 889 rtld_die(); 890 891 if (ld_get_env_var(LD_SHOW_AUXV) != NULL) 892 dump_auxv(aux_info); 893 894 if (ld_tracing) { /* We're done */ 895 trace_loaded_objects(obj_main, true); 896 exit(0); 897 } 898 899 if (ld_get_env_var(LD_DUMP_REL_PRE) != NULL) { 900 dump_relocations(obj_main); 901 exit (0); 902 } 903 904 /* 905 * Processing tls relocations requires having the tls offsets 906 * initialized. Prepare offsets before starting initial 907 * relocation processing. 908 */ 909 dbg("initializing initial thread local storage offsets"); 910 STAILQ_FOREACH(entry, &list_main, link) { 911 /* 912 * Allocate all the initial objects out of the static TLS 913 * block even if they didn't ask for it. 914 */ 915 allocate_tls_offset(entry->obj); 916 } 917 918 if (relocate_objects(obj_main, 919 ld_bind_now != NULL && *ld_bind_now != '\0', 920 &obj_rtld, SYMLOOK_EARLY, NULL) == -1) 921 rtld_die(); 922 923 dbg("doing copy relocations"); 924 if (do_copy_relocations(obj_main) == -1) 925 rtld_die(); 926 927 if (ld_get_env_var(LD_DUMP_REL_POST) != NULL) { 928 dump_relocations(obj_main); 929 exit (0); 930 } 931 932 ifunc_init(aux); 933 934 /* 935 * Setup TLS for main thread. This must be done after the 936 * relocations are processed, since tls initialization section 937 * might be the subject for relocations. 938 */ 939 dbg("initializing initial thread local storage"); 940 allocate_initial_tls(globallist_curr(TAILQ_FIRST(&obj_list))); 941 942 dbg("initializing key program variables"); 943 set_program_var("__progname", argv[0] != NULL ? basename(argv[0]) : ""); 944 set_program_var("environ", env); 945 set_program_var("__elf_aux_vector", aux); 946 947 /* Make a list of init functions to call. */ 948 objlist_init(&initlist); 949 initlist_add_objects(globallist_curr(TAILQ_FIRST(&obj_list)), 950 preload_tail, &initlist); 951 952 r_debug_state(NULL, &obj_main->linkmap); /* say hello to gdb! */ 953 954 map_stacks_exec(NULL); 955 956 if (!obj_main->crt_no_init) { 957 /* 958 * Make sure we don't call the main program's init and fini 959 * functions for binaries linked with old crt1 which calls 960 * _init itself. 961 */ 962 obj_main->init = obj_main->fini = (Elf_Addr)NULL; 963 obj_main->preinit_array = obj_main->init_array = 964 obj_main->fini_array = (Elf_Addr)NULL; 965 } 966 967 if (direct_exec) { 968 /* Set osrel for direct-execed binary */ 969 mib[0] = CTL_KERN; 970 mib[1] = KERN_PROC; 971 mib[2] = KERN_PROC_OSREL; 972 mib[3] = getpid(); 973 osrel = obj_main->osrel; 974 sz = sizeof(old_osrel); 975 dbg("setting osrel to %d", osrel); 976 (void)sysctl(mib, 4, &old_osrel, &sz, &osrel, sizeof(osrel)); 977 } 978 979 wlock_acquire(rtld_bind_lock, &lockstate); 980 981 dbg("resolving ifuncs"); 982 if (initlist_objects_ifunc(&initlist, ld_bind_now != NULL && 983 *ld_bind_now != '\0', SYMLOOK_EARLY, &lockstate) == -1) 984 rtld_die(); 985 986 rtld_exit_ptr = rtld_exit; 987 if (obj_main->crt_no_init) 988 preinit_main(); 989 objlist_call_init(&initlist, &lockstate); 990 _r_debug_postinit(&obj_main->linkmap); 991 objlist_clear(&initlist); 992 dbg("loading filtees"); 993 TAILQ_FOREACH(obj, &obj_list, next) { 994 if (obj->marker) 995 continue; 996 if (ld_loadfltr || obj->z_loadfltr) 997 load_filtees(obj, 0, &lockstate); 998 } 999 1000 dbg("enforcing main obj relro"); 1001 if (obj_enforce_relro(obj_main) == -1) 1002 rtld_die(); 1003 1004 lock_release(rtld_bind_lock, &lockstate); 1005 1006 dbg("transferring control to program entry point = %p", obj_main->entry); 1007 1008 /* Return the exit procedure and the program entry point. */ 1009 *exit_proc = rtld_exit_ptr; 1010 *objp = obj_main; 1011 return ((func_ptr_type)obj_main->entry); 1012 } 1013 1014 void * 1015 rtld_resolve_ifunc(const Obj_Entry *obj, const Elf_Sym *def) 1016 { 1017 void *ptr; 1018 Elf_Addr target; 1019 1020 ptr = (void *)make_function_pointer(def, obj); 1021 target = call_ifunc_resolver(ptr); 1022 return ((void *)target); 1023 } 1024 1025 Elf_Addr 1026 _rtld_bind(Obj_Entry *obj, Elf_Size reloff) 1027 { 1028 const Elf_Rel *rel; 1029 const Elf_Sym *def; 1030 const Obj_Entry *defobj; 1031 Elf_Addr *where; 1032 Elf_Addr target; 1033 RtldLockState lockstate; 1034 1035 rlock_acquire(rtld_bind_lock, &lockstate); 1036 if (sigsetjmp(lockstate.env, 0) != 0) 1037 lock_upgrade(rtld_bind_lock, &lockstate); 1038 if (obj->pltrel) 1039 rel = (const Elf_Rel *)((const char *)obj->pltrel + reloff); 1040 else 1041 rel = (const Elf_Rel *)((const char *)obj->pltrela + reloff); 1042 1043 where = (Elf_Addr *)(obj->relocbase + rel->r_offset); 1044 def = find_symdef(ELF_R_SYM(rel->r_info), obj, &defobj, SYMLOOK_IN_PLT, 1045 NULL, &lockstate); 1046 if (def == NULL) 1047 rtld_die(); 1048 if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC) 1049 target = (Elf_Addr)rtld_resolve_ifunc(defobj, def); 1050 else 1051 target = (Elf_Addr)(defobj->relocbase + def->st_value); 1052 1053 dbg("\"%s\" in \"%s\" ==> %p in \"%s\"", 1054 defobj->strtab + def->st_name, 1055 obj->path == NULL ? NULL : basename(obj->path), 1056 (void *)target, 1057 defobj->path == NULL ? NULL : basename(defobj->path)); 1058 1059 /* 1060 * Write the new contents for the jmpslot. Note that depending on 1061 * architecture, the value which we need to return back to the 1062 * lazy binding trampoline may or may not be the target 1063 * address. The value returned from reloc_jmpslot() is the value 1064 * that the trampoline needs. 1065 */ 1066 target = reloc_jmpslot(where, target, defobj, obj, rel); 1067 lock_release(rtld_bind_lock, &lockstate); 1068 return (target); 1069 } 1070 1071 /* 1072 * Error reporting function. Use it like printf. If formats the message 1073 * into a buffer, and sets things up so that the next call to dlerror() 1074 * will return the message. 1075 */ 1076 void 1077 _rtld_error(const char *fmt, ...) 1078 { 1079 va_list ap; 1080 1081 va_start(ap, fmt); 1082 rtld_vsnprintf(lockinfo.dlerror_loc(), lockinfo.dlerror_loc_sz, 1083 fmt, ap); 1084 va_end(ap); 1085 *lockinfo.dlerror_seen() = 0; 1086 dbg("rtld_error: %s", lockinfo.dlerror_loc()); 1087 LD_UTRACE(UTRACE_RTLD_ERROR, NULL, NULL, 0, 0, lockinfo.dlerror_loc()); 1088 } 1089 1090 /* 1091 * Return a dynamically-allocated copy of the current error message, if any. 1092 */ 1093 static struct dlerror_save * 1094 errmsg_save(void) 1095 { 1096 struct dlerror_save *res; 1097 1098 res = xmalloc(sizeof(*res)); 1099 res->seen = *lockinfo.dlerror_seen(); 1100 if (res->seen == 0) 1101 res->msg = xstrdup(lockinfo.dlerror_loc()); 1102 return (res); 1103 } 1104 1105 /* 1106 * Restore the current error message from a copy which was previously saved 1107 * by errmsg_save(). The copy is freed. 1108 */ 1109 static void 1110 errmsg_restore(struct dlerror_save *saved_msg) 1111 { 1112 if (saved_msg == NULL || saved_msg->seen == 1) { 1113 *lockinfo.dlerror_seen() = 1; 1114 } else { 1115 *lockinfo.dlerror_seen() = 0; 1116 strlcpy(lockinfo.dlerror_loc(), saved_msg->msg, 1117 lockinfo.dlerror_loc_sz); 1118 free(saved_msg->msg); 1119 } 1120 free(saved_msg); 1121 } 1122 1123 static const char * 1124 basename(const char *name) 1125 { 1126 const char *p; 1127 1128 p = strrchr(name, '/'); 1129 return (p != NULL ? p + 1 : name); 1130 } 1131 1132 static struct utsname uts; 1133 1134 static char * 1135 origin_subst_one(Obj_Entry *obj, char *real, const char *kw, 1136 const char *subst, bool may_free) 1137 { 1138 char *p, *p1, *res, *resp; 1139 int subst_len, kw_len, subst_count, old_len, new_len; 1140 1141 kw_len = strlen(kw); 1142 1143 /* 1144 * First, count the number of the keyword occurrences, to 1145 * preallocate the final string. 1146 */ 1147 for (p = real, subst_count = 0;; p = p1 + kw_len, subst_count++) { 1148 p1 = strstr(p, kw); 1149 if (p1 == NULL) 1150 break; 1151 } 1152 1153 /* 1154 * If the keyword is not found, just return. 1155 * 1156 * Return non-substituted string if resolution failed. We 1157 * cannot do anything more reasonable, the failure mode of the 1158 * caller is unresolved library anyway. 1159 */ 1160 if (subst_count == 0 || (obj != NULL && !obj_resolve_origin(obj))) 1161 return (may_free ? real : xstrdup(real)); 1162 if (obj != NULL) 1163 subst = obj->origin_path; 1164 1165 /* 1166 * There is indeed something to substitute. Calculate the 1167 * length of the resulting string, and allocate it. 1168 */ 1169 subst_len = strlen(subst); 1170 old_len = strlen(real); 1171 new_len = old_len + (subst_len - kw_len) * subst_count; 1172 res = xmalloc(new_len + 1); 1173 1174 /* 1175 * Now, execute the substitution loop. 1176 */ 1177 for (p = real, resp = res, *resp = '\0';;) { 1178 p1 = strstr(p, kw); 1179 if (p1 != NULL) { 1180 /* Copy the prefix before keyword. */ 1181 memcpy(resp, p, p1 - p); 1182 resp += p1 - p; 1183 /* Keyword replacement. */ 1184 memcpy(resp, subst, subst_len); 1185 resp += subst_len; 1186 *resp = '\0'; 1187 p = p1 + kw_len; 1188 } else 1189 break; 1190 } 1191 1192 /* Copy to the end of string and finish. */ 1193 strcat(resp, p); 1194 if (may_free) 1195 free(real); 1196 return (res); 1197 } 1198 1199 static const struct { 1200 const char *kw; 1201 bool pass_obj; 1202 const char *subst; 1203 } tokens[] = { 1204 { .kw = "$ORIGIN", .pass_obj = true, .subst = NULL }, 1205 { .kw = "${ORIGIN}", .pass_obj = true, .subst = NULL }, 1206 { .kw = "$OSNAME", .pass_obj = false, .subst = uts.sysname }, 1207 { .kw = "${OSNAME}", .pass_obj = false, .subst = uts.sysname }, 1208 { .kw = "$OSREL", .pass_obj = false, .subst = uts.release }, 1209 { .kw = "${OSREL}", .pass_obj = false, .subst = uts.release }, 1210 { .kw = "$PLATFORM", .pass_obj = false, .subst = uts.machine }, 1211 { .kw = "${PLATFORM}", .pass_obj = false, .subst = uts.machine }, 1212 { .kw = "$LIB", .pass_obj = false, .subst = TOKEN_LIB }, 1213 { .kw = "${LIB}", .pass_obj = false, .subst = TOKEN_LIB }, 1214 }; 1215 1216 static char * 1217 origin_subst(Obj_Entry *obj, const char *real) 1218 { 1219 char *res; 1220 int i; 1221 1222 if (obj == NULL || !trust) 1223 return (xstrdup(real)); 1224 if (uts.sysname[0] == '\0') { 1225 if (uname(&uts) != 0) { 1226 _rtld_error("utsname failed: %d", errno); 1227 return (NULL); 1228 } 1229 } 1230 1231 /* __DECONST is safe here since without may_free real is unchanged */ 1232 res = __DECONST(char *, real); 1233 for (i = 0; i < (int)nitems(tokens); i++) { 1234 res = origin_subst_one(tokens[i].pass_obj ? obj : NULL, 1235 res, tokens[i].kw, tokens[i].subst, i != 0); 1236 } 1237 return (res); 1238 } 1239 1240 void 1241 rtld_die(void) 1242 { 1243 const char *msg = dlerror(); 1244 1245 if (msg == NULL) 1246 msg = "Fatal error"; 1247 rtld_fdputstr(STDERR_FILENO, _BASENAME_RTLD ": "); 1248 rtld_fdputstr(STDERR_FILENO, msg); 1249 rtld_fdputchar(STDERR_FILENO, '\n'); 1250 _exit(1); 1251 } 1252 1253 /* 1254 * Process a shared object's DYNAMIC section, and save the important 1255 * information in its Obj_Entry structure. 1256 */ 1257 static void 1258 digest_dynamic1(Obj_Entry *obj, int early, const Elf_Dyn **dyn_rpath, 1259 const Elf_Dyn **dyn_soname, const Elf_Dyn **dyn_runpath) 1260 { 1261 const Elf_Dyn *dynp; 1262 Needed_Entry **needed_tail = &obj->needed; 1263 Needed_Entry **needed_filtees_tail = &obj->needed_filtees; 1264 Needed_Entry **needed_aux_filtees_tail = &obj->needed_aux_filtees; 1265 const Elf_Hashelt *hashtab; 1266 const Elf32_Word *hashval; 1267 Elf32_Word bkt, nmaskwords; 1268 int bloom_size32; 1269 int plttype = DT_REL; 1270 1271 *dyn_rpath = NULL; 1272 *dyn_soname = NULL; 1273 *dyn_runpath = NULL; 1274 1275 obj->bind_now = false; 1276 dynp = obj->dynamic; 1277 if (dynp == NULL) 1278 return; 1279 for (; dynp->d_tag != DT_NULL; dynp++) { 1280 switch (dynp->d_tag) { 1281 1282 case DT_REL: 1283 obj->rel = (const Elf_Rel *)(obj->relocbase + dynp->d_un.d_ptr); 1284 break; 1285 1286 case DT_RELSZ: 1287 obj->relsize = dynp->d_un.d_val; 1288 break; 1289 1290 case DT_RELENT: 1291 assert(dynp->d_un.d_val == sizeof(Elf_Rel)); 1292 break; 1293 1294 case DT_JMPREL: 1295 obj->pltrel = (const Elf_Rel *) 1296 (obj->relocbase + dynp->d_un.d_ptr); 1297 break; 1298 1299 case DT_PLTRELSZ: 1300 obj->pltrelsize = dynp->d_un.d_val; 1301 break; 1302 1303 case DT_RELA: 1304 obj->rela = (const Elf_Rela *)(obj->relocbase + dynp->d_un.d_ptr); 1305 break; 1306 1307 case DT_RELASZ: 1308 obj->relasize = dynp->d_un.d_val; 1309 break; 1310 1311 case DT_RELAENT: 1312 assert(dynp->d_un.d_val == sizeof(Elf_Rela)); 1313 break; 1314 1315 case DT_RELR: 1316 obj->relr = (const Elf_Relr *)(obj->relocbase + dynp->d_un.d_ptr); 1317 break; 1318 1319 case DT_RELRSZ: 1320 obj->relrsize = dynp->d_un.d_val; 1321 break; 1322 1323 case DT_RELRENT: 1324 assert(dynp->d_un.d_val == sizeof(Elf_Relr)); 1325 break; 1326 1327 case DT_PLTREL: 1328 plttype = dynp->d_un.d_val; 1329 assert(dynp->d_un.d_val == DT_REL || plttype == DT_RELA); 1330 break; 1331 1332 case DT_SYMTAB: 1333 obj->symtab = (const Elf_Sym *) 1334 (obj->relocbase + dynp->d_un.d_ptr); 1335 break; 1336 1337 case DT_SYMENT: 1338 assert(dynp->d_un.d_val == sizeof(Elf_Sym)); 1339 break; 1340 1341 case DT_STRTAB: 1342 obj->strtab = (const char *)(obj->relocbase + dynp->d_un.d_ptr); 1343 break; 1344 1345 case DT_STRSZ: 1346 obj->strsize = dynp->d_un.d_val; 1347 break; 1348 1349 case DT_VERNEED: 1350 obj->verneed = (const Elf_Verneed *)(obj->relocbase + 1351 dynp->d_un.d_val); 1352 break; 1353 1354 case DT_VERNEEDNUM: 1355 obj->verneednum = dynp->d_un.d_val; 1356 break; 1357 1358 case DT_VERDEF: 1359 obj->verdef = (const Elf_Verdef *)(obj->relocbase + 1360 dynp->d_un.d_val); 1361 break; 1362 1363 case DT_VERDEFNUM: 1364 obj->verdefnum = dynp->d_un.d_val; 1365 break; 1366 1367 case DT_VERSYM: 1368 obj->versyms = (const Elf_Versym *)(obj->relocbase + 1369 dynp->d_un.d_val); 1370 break; 1371 1372 case DT_HASH: 1373 { 1374 hashtab = (const Elf_Hashelt *)(obj->relocbase + 1375 dynp->d_un.d_ptr); 1376 obj->nbuckets = hashtab[0]; 1377 obj->nchains = hashtab[1]; 1378 obj->buckets = hashtab + 2; 1379 obj->chains = obj->buckets + obj->nbuckets; 1380 obj->valid_hash_sysv = obj->nbuckets > 0 && obj->nchains > 0 && 1381 obj->buckets != NULL; 1382 } 1383 break; 1384 1385 case DT_GNU_HASH: 1386 { 1387 hashtab = (const Elf_Hashelt *)(obj->relocbase + 1388 dynp->d_un.d_ptr); 1389 obj->nbuckets_gnu = hashtab[0]; 1390 obj->symndx_gnu = hashtab[1]; 1391 nmaskwords = hashtab[2]; 1392 bloom_size32 = (__ELF_WORD_SIZE / 32) * nmaskwords; 1393 obj->maskwords_bm_gnu = nmaskwords - 1; 1394 obj->shift2_gnu = hashtab[3]; 1395 obj->bloom_gnu = (const Elf_Addr *)(hashtab + 4); 1396 obj->buckets_gnu = hashtab + 4 + bloom_size32; 1397 obj->chain_zero_gnu = obj->buckets_gnu + obj->nbuckets_gnu - 1398 obj->symndx_gnu; 1399 /* Number of bitmask words is required to be power of 2 */ 1400 obj->valid_hash_gnu = powerof2(nmaskwords) && 1401 obj->nbuckets_gnu > 0 && obj->buckets_gnu != NULL; 1402 } 1403 break; 1404 1405 case DT_NEEDED: 1406 if (!obj->rtld) { 1407 Needed_Entry *nep = NEW(Needed_Entry); 1408 nep->name = dynp->d_un.d_val; 1409 nep->obj = NULL; 1410 nep->next = NULL; 1411 1412 *needed_tail = nep; 1413 needed_tail = &nep->next; 1414 } 1415 break; 1416 1417 case DT_FILTER: 1418 if (!obj->rtld) { 1419 Needed_Entry *nep = NEW(Needed_Entry); 1420 nep->name = dynp->d_un.d_val; 1421 nep->obj = NULL; 1422 nep->next = NULL; 1423 1424 *needed_filtees_tail = nep; 1425 needed_filtees_tail = &nep->next; 1426 1427 if (obj->linkmap.l_refname == NULL) 1428 obj->linkmap.l_refname = (char *)dynp->d_un.d_val; 1429 } 1430 break; 1431 1432 case DT_AUXILIARY: 1433 if (!obj->rtld) { 1434 Needed_Entry *nep = NEW(Needed_Entry); 1435 nep->name = dynp->d_un.d_val; 1436 nep->obj = NULL; 1437 nep->next = NULL; 1438 1439 *needed_aux_filtees_tail = nep; 1440 needed_aux_filtees_tail = &nep->next; 1441 } 1442 break; 1443 1444 case DT_PLTGOT: 1445 obj->pltgot = (Elf_Addr *)(obj->relocbase + dynp->d_un.d_ptr); 1446 break; 1447 1448 case DT_TEXTREL: 1449 obj->textrel = true; 1450 break; 1451 1452 case DT_SYMBOLIC: 1453 obj->symbolic = true; 1454 break; 1455 1456 case DT_RPATH: 1457 /* 1458 * We have to wait until later to process this, because we 1459 * might not have gotten the address of the string table yet. 1460 */ 1461 *dyn_rpath = dynp; 1462 break; 1463 1464 case DT_SONAME: 1465 *dyn_soname = dynp; 1466 break; 1467 1468 case DT_RUNPATH: 1469 *dyn_runpath = dynp; 1470 break; 1471 1472 case DT_INIT: 1473 obj->init = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1474 break; 1475 1476 case DT_PREINIT_ARRAY: 1477 obj->preinit_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1478 break; 1479 1480 case DT_PREINIT_ARRAYSZ: 1481 obj->preinit_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1482 break; 1483 1484 case DT_INIT_ARRAY: 1485 obj->init_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1486 break; 1487 1488 case DT_INIT_ARRAYSZ: 1489 obj->init_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1490 break; 1491 1492 case DT_FINI: 1493 obj->fini = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1494 break; 1495 1496 case DT_FINI_ARRAY: 1497 obj->fini_array = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1498 break; 1499 1500 case DT_FINI_ARRAYSZ: 1501 obj->fini_array_num = dynp->d_un.d_val / sizeof(Elf_Addr); 1502 break; 1503 1504 case DT_DEBUG: 1505 if (!early) 1506 dbg("Filling in DT_DEBUG entry"); 1507 (__DECONST(Elf_Dyn *, dynp))->d_un.d_ptr = (Elf_Addr)&r_debug; 1508 break; 1509 1510 case DT_FLAGS: 1511 if (dynp->d_un.d_val & DF_ORIGIN) 1512 obj->z_origin = true; 1513 if (dynp->d_un.d_val & DF_SYMBOLIC) 1514 obj->symbolic = true; 1515 if (dynp->d_un.d_val & DF_TEXTREL) 1516 obj->textrel = true; 1517 if (dynp->d_un.d_val & DF_BIND_NOW) 1518 obj->bind_now = true; 1519 if (dynp->d_un.d_val & DF_STATIC_TLS) 1520 obj->static_tls = true; 1521 break; 1522 1523 #ifdef __powerpc__ 1524 #ifdef __powerpc64__ 1525 case DT_PPC64_GLINK: 1526 obj->glink = (Elf_Addr)(obj->relocbase + dynp->d_un.d_ptr); 1527 break; 1528 #else 1529 case DT_PPC_GOT: 1530 obj->gotptr = (Elf_Addr *)(obj->relocbase + dynp->d_un.d_ptr); 1531 break; 1532 #endif 1533 #endif 1534 1535 case DT_FLAGS_1: 1536 if (dynp->d_un.d_val & DF_1_NOOPEN) 1537 obj->z_noopen = true; 1538 if (dynp->d_un.d_val & DF_1_ORIGIN) 1539 obj->z_origin = true; 1540 if (dynp->d_un.d_val & DF_1_GLOBAL) 1541 obj->z_global = true; 1542 if (dynp->d_un.d_val & DF_1_BIND_NOW) 1543 obj->bind_now = true; 1544 if (dynp->d_un.d_val & DF_1_NODELETE) 1545 obj->z_nodelete = true; 1546 if (dynp->d_un.d_val & DF_1_LOADFLTR) 1547 obj->z_loadfltr = true; 1548 if (dynp->d_un.d_val & DF_1_INTERPOSE) 1549 obj->z_interpose = true; 1550 if (dynp->d_un.d_val & DF_1_NODEFLIB) 1551 obj->z_nodeflib = true; 1552 if (dynp->d_un.d_val & DF_1_PIE) 1553 obj->z_pie = true; 1554 break; 1555 1556 default: 1557 if (!early) { 1558 dbg("Ignoring d_tag %ld = %#lx", (long)dynp->d_tag, 1559 (long)dynp->d_tag); 1560 } 1561 break; 1562 } 1563 } 1564 1565 obj->traced = false; 1566 1567 if (plttype == DT_RELA) { 1568 obj->pltrela = (const Elf_Rela *) obj->pltrel; 1569 obj->pltrel = NULL; 1570 obj->pltrelasize = obj->pltrelsize; 1571 obj->pltrelsize = 0; 1572 } 1573 1574 /* Determine size of dynsym table (equal to nchains of sysv hash) */ 1575 if (obj->valid_hash_sysv) 1576 obj->dynsymcount = obj->nchains; 1577 else if (obj->valid_hash_gnu) { 1578 obj->dynsymcount = 0; 1579 for (bkt = 0; bkt < obj->nbuckets_gnu; bkt++) { 1580 if (obj->buckets_gnu[bkt] == 0) 1581 continue; 1582 hashval = &obj->chain_zero_gnu[obj->buckets_gnu[bkt]]; 1583 do 1584 obj->dynsymcount++; 1585 while ((*hashval++ & 1u) == 0); 1586 } 1587 obj->dynsymcount += obj->symndx_gnu; 1588 } 1589 1590 if (obj->linkmap.l_refname != NULL) 1591 obj->linkmap.l_refname = obj->strtab + (unsigned long)obj-> 1592 linkmap.l_refname; 1593 } 1594 1595 static bool 1596 obj_resolve_origin(Obj_Entry *obj) 1597 { 1598 1599 if (obj->origin_path != NULL) 1600 return (true); 1601 obj->origin_path = xmalloc(PATH_MAX); 1602 return (rtld_dirname_abs(obj->path, obj->origin_path) != -1); 1603 } 1604 1605 static bool 1606 digest_dynamic2(Obj_Entry *obj, const Elf_Dyn *dyn_rpath, 1607 const Elf_Dyn *dyn_soname, const Elf_Dyn *dyn_runpath) 1608 { 1609 1610 if (obj->z_origin && !obj_resolve_origin(obj)) 1611 return (false); 1612 1613 if (dyn_runpath != NULL) { 1614 obj->runpath = (const char *)obj->strtab + dyn_runpath->d_un.d_val; 1615 obj->runpath = origin_subst(obj, obj->runpath); 1616 } else if (dyn_rpath != NULL) { 1617 obj->rpath = (const char *)obj->strtab + dyn_rpath->d_un.d_val; 1618 obj->rpath = origin_subst(obj, obj->rpath); 1619 } 1620 if (dyn_soname != NULL) 1621 object_add_name(obj, obj->strtab + dyn_soname->d_un.d_val); 1622 return (true); 1623 } 1624 1625 static bool 1626 digest_dynamic(Obj_Entry *obj, int early) 1627 { 1628 const Elf_Dyn *dyn_rpath; 1629 const Elf_Dyn *dyn_soname; 1630 const Elf_Dyn *dyn_runpath; 1631 1632 digest_dynamic1(obj, early, &dyn_rpath, &dyn_soname, &dyn_runpath); 1633 return (digest_dynamic2(obj, dyn_rpath, dyn_soname, dyn_runpath)); 1634 } 1635 1636 /* 1637 * Process a shared object's program header. This is used only for the 1638 * main program, when the kernel has already loaded the main program 1639 * into memory before calling the dynamic linker. It creates and 1640 * returns an Obj_Entry structure. 1641 */ 1642 static Obj_Entry * 1643 digest_phdr(const Elf_Phdr *phdr, int phnum, caddr_t entry, const char *path) 1644 { 1645 Obj_Entry *obj; 1646 const Elf_Phdr *phlimit = phdr + phnum; 1647 const Elf_Phdr *ph; 1648 Elf_Addr note_start, note_end; 1649 int nsegs = 0; 1650 1651 obj = obj_new(); 1652 for (ph = phdr; ph < phlimit; ph++) { 1653 if (ph->p_type != PT_PHDR) 1654 continue; 1655 1656 obj->phdr = phdr; 1657 obj->phsize = ph->p_memsz; 1658 obj->relocbase = __DECONST(char *, phdr) - ph->p_vaddr; 1659 break; 1660 } 1661 1662 obj->stack_flags = PF_X | PF_R | PF_W; 1663 1664 for (ph = phdr; ph < phlimit; ph++) { 1665 switch (ph->p_type) { 1666 1667 case PT_INTERP: 1668 obj->interp = (const char *)(ph->p_vaddr + obj->relocbase); 1669 break; 1670 1671 case PT_LOAD: 1672 if (nsegs == 0) { /* First load segment */ 1673 obj->vaddrbase = rtld_trunc_page(ph->p_vaddr); 1674 obj->mapbase = obj->vaddrbase + obj->relocbase; 1675 } else { /* Last load segment */ 1676 obj->mapsize = rtld_round_page(ph->p_vaddr + ph->p_memsz) - 1677 obj->vaddrbase; 1678 } 1679 nsegs++; 1680 break; 1681 1682 case PT_DYNAMIC: 1683 obj->dynamic = (const Elf_Dyn *)(ph->p_vaddr + obj->relocbase); 1684 break; 1685 1686 case PT_TLS: 1687 obj->tlsindex = 1; 1688 obj->tlssize = ph->p_memsz; 1689 obj->tlsalign = ph->p_align; 1690 obj->tlsinitsize = ph->p_filesz; 1691 obj->tlsinit = (void*)(ph->p_vaddr + obj->relocbase); 1692 obj->tlspoffset = ph->p_offset; 1693 break; 1694 1695 case PT_GNU_STACK: 1696 obj->stack_flags = ph->p_flags; 1697 break; 1698 1699 case PT_GNU_RELRO: 1700 obj->relro_page = obj->relocbase + rtld_trunc_page(ph->p_vaddr); 1701 obj->relro_size = rtld_trunc_page(ph->p_vaddr + ph->p_memsz) - 1702 rtld_trunc_page(ph->p_vaddr); 1703 break; 1704 1705 case PT_NOTE: 1706 note_start = (Elf_Addr)obj->relocbase + ph->p_vaddr; 1707 note_end = note_start + ph->p_filesz; 1708 digest_notes(obj, note_start, note_end); 1709 break; 1710 } 1711 } 1712 if (nsegs < 1) { 1713 _rtld_error("%s: too few PT_LOAD segments", path); 1714 return (NULL); 1715 } 1716 1717 obj->entry = entry; 1718 return (obj); 1719 } 1720 1721 void 1722 digest_notes(Obj_Entry *obj, Elf_Addr note_start, Elf_Addr note_end) 1723 { 1724 const Elf_Note *note; 1725 const char *note_name; 1726 uintptr_t p; 1727 1728 for (note = (const Elf_Note *)note_start; (Elf_Addr)note < note_end; 1729 note = (const Elf_Note *)((const char *)(note + 1) + 1730 roundup2(note->n_namesz, sizeof(Elf32_Addr)) + 1731 roundup2(note->n_descsz, sizeof(Elf32_Addr)))) { 1732 if (note->n_namesz != sizeof(NOTE_FREEBSD_VENDOR) || 1733 note->n_descsz != sizeof(int32_t)) 1734 continue; 1735 if (note->n_type != NT_FREEBSD_ABI_TAG && 1736 note->n_type != NT_FREEBSD_FEATURE_CTL && 1737 note->n_type != NT_FREEBSD_NOINIT_TAG) 1738 continue; 1739 note_name = (const char *)(note + 1); 1740 if (strncmp(NOTE_FREEBSD_VENDOR, note_name, 1741 sizeof(NOTE_FREEBSD_VENDOR)) != 0) 1742 continue; 1743 switch (note->n_type) { 1744 case NT_FREEBSD_ABI_TAG: 1745 /* FreeBSD osrel note */ 1746 p = (uintptr_t)(note + 1); 1747 p += roundup2(note->n_namesz, sizeof(Elf32_Addr)); 1748 obj->osrel = *(const int32_t *)(p); 1749 dbg("note osrel %d", obj->osrel); 1750 break; 1751 case NT_FREEBSD_FEATURE_CTL: 1752 /* FreeBSD ABI feature control note */ 1753 p = (uintptr_t)(note + 1); 1754 p += roundup2(note->n_namesz, sizeof(Elf32_Addr)); 1755 obj->fctl0 = *(const uint32_t *)(p); 1756 dbg("note fctl0 %#x", obj->fctl0); 1757 break; 1758 case NT_FREEBSD_NOINIT_TAG: 1759 /* FreeBSD 'crt does not call init' note */ 1760 obj->crt_no_init = true; 1761 dbg("note crt_no_init"); 1762 break; 1763 } 1764 } 1765 } 1766 1767 static Obj_Entry * 1768 dlcheck(void *handle) 1769 { 1770 Obj_Entry *obj; 1771 1772 TAILQ_FOREACH(obj, &obj_list, next) { 1773 if (obj == (Obj_Entry *) handle) 1774 break; 1775 } 1776 1777 if (obj == NULL || obj->refcount == 0 || obj->dl_refcount == 0) { 1778 _rtld_error("Invalid shared object handle %p", handle); 1779 return (NULL); 1780 } 1781 return (obj); 1782 } 1783 1784 /* 1785 * If the given object is already in the donelist, return true. Otherwise 1786 * add the object to the list and return false. 1787 */ 1788 static bool 1789 donelist_check(DoneList *dlp, const Obj_Entry *obj) 1790 { 1791 unsigned int i; 1792 1793 for (i = 0; i < dlp->num_used; i++) 1794 if (dlp->objs[i] == obj) 1795 return (true); 1796 /* 1797 * Our donelist allocation should always be sufficient. But if 1798 * our threads locking isn't working properly, more shared objects 1799 * could have been loaded since we allocated the list. That should 1800 * never happen, but we'll handle it properly just in case it does. 1801 */ 1802 if (dlp->num_used < dlp->num_alloc) 1803 dlp->objs[dlp->num_used++] = obj; 1804 return (false); 1805 } 1806 1807 /* 1808 * SysV hash function for symbol table lookup. It is a slightly optimized 1809 * version of the hash specified by the System V ABI. 1810 */ 1811 Elf32_Word 1812 elf_hash(const char *name) 1813 { 1814 const unsigned char *p = (const unsigned char *)name; 1815 Elf32_Word h = 0; 1816 1817 while (*p != '\0') { 1818 h = (h << 4) + *p++; 1819 h ^= (h >> 24) & 0xf0; 1820 } 1821 return (h & 0x0fffffff); 1822 } 1823 1824 /* 1825 * The GNU hash function is the Daniel J. Bernstein hash clipped to 32 bits 1826 * unsigned in case it's implemented with a wider type. 1827 */ 1828 static uint32_t 1829 gnu_hash(const char *s) 1830 { 1831 uint32_t h; 1832 unsigned char c; 1833 1834 h = 5381; 1835 for (c = *s; c != '\0'; c = *++s) 1836 h = h * 33 + c; 1837 return (h & 0xffffffff); 1838 } 1839 1840 1841 /* 1842 * Find the library with the given name, and return its full pathname. 1843 * The returned string is dynamically allocated. Generates an error 1844 * message and returns NULL if the library cannot be found. 1845 * 1846 * If the second argument is non-NULL, then it refers to an already- 1847 * loaded shared object, whose library search path will be searched. 1848 * 1849 * If a library is successfully located via LD_LIBRARY_PATH_FDS, its 1850 * descriptor (which is close-on-exec) will be passed out via the third 1851 * argument. 1852 * 1853 * The search order is: 1854 * DT_RPATH in the referencing file _unless_ DT_RUNPATH is present (1) 1855 * DT_RPATH of the main object if DSO without defined DT_RUNPATH (1) 1856 * LD_LIBRARY_PATH 1857 * DT_RUNPATH in the referencing file 1858 * ldconfig hints (if -z nodefaultlib, filter out default library directories 1859 * from list) 1860 * /lib:/usr/lib _unless_ the referencing file is linked with -z nodefaultlib 1861 * 1862 * (1) Handled in digest_dynamic2 - rpath left NULL if runpath defined. 1863 */ 1864 static char * 1865 find_library(const char *xname, const Obj_Entry *refobj, int *fdp) 1866 { 1867 char *pathname, *refobj_path; 1868 const char *name; 1869 bool nodeflib, objgiven; 1870 1871 objgiven = refobj != NULL; 1872 1873 if (libmap_disable || !objgiven || 1874 (name = lm_find(refobj->path, xname)) == NULL) 1875 name = xname; 1876 1877 if (strchr(name, '/') != NULL) { /* Hard coded pathname */ 1878 if (name[0] != '/' && !trust) { 1879 _rtld_error("Absolute pathname required " 1880 "for shared object \"%s\"", name); 1881 return (NULL); 1882 } 1883 return (origin_subst(__DECONST(Obj_Entry *, refobj), 1884 __DECONST(char *, name))); 1885 } 1886 1887 dbg(" Searching for \"%s\"", name); 1888 refobj_path = objgiven ? refobj->path : NULL; 1889 1890 /* 1891 * If refobj->rpath != NULL, then refobj->runpath is NULL. Fall 1892 * back to pre-conforming behaviour if user requested so with 1893 * LD_LIBRARY_PATH_RPATH environment variable and ignore -z 1894 * nodeflib. 1895 */ 1896 if (objgiven && refobj->rpath != NULL && ld_library_path_rpath) { 1897 pathname = search_library_path(name, ld_library_path, 1898 refobj_path, fdp); 1899 if (pathname != NULL) 1900 return (pathname); 1901 if (refobj != NULL) { 1902 pathname = search_library_path(name, refobj->rpath, 1903 refobj_path, fdp); 1904 if (pathname != NULL) 1905 return (pathname); 1906 } 1907 pathname = search_library_pathfds(name, ld_library_dirs, fdp); 1908 if (pathname != NULL) 1909 return (pathname); 1910 pathname = search_library_path(name, gethints(false), 1911 refobj_path, fdp); 1912 if (pathname != NULL) 1913 return (pathname); 1914 pathname = search_library_path(name, ld_standard_library_path, 1915 refobj_path, fdp); 1916 if (pathname != NULL) 1917 return (pathname); 1918 } else { 1919 nodeflib = objgiven ? refobj->z_nodeflib : false; 1920 if (objgiven) { 1921 pathname = search_library_path(name, refobj->rpath, 1922 refobj->path, fdp); 1923 if (pathname != NULL) 1924 return (pathname); 1925 } 1926 if (objgiven && refobj->runpath == NULL && refobj != obj_main) { 1927 pathname = search_library_path(name, obj_main->rpath, 1928 refobj_path, fdp); 1929 if (pathname != NULL) 1930 return (pathname); 1931 } 1932 pathname = search_library_path(name, ld_library_path, 1933 refobj_path, fdp); 1934 if (pathname != NULL) 1935 return (pathname); 1936 if (objgiven) { 1937 pathname = search_library_path(name, refobj->runpath, 1938 refobj_path, fdp); 1939 if (pathname != NULL) 1940 return (pathname); 1941 } 1942 pathname = search_library_pathfds(name, ld_library_dirs, fdp); 1943 if (pathname != NULL) 1944 return (pathname); 1945 pathname = search_library_path(name, gethints(nodeflib), 1946 refobj_path, fdp); 1947 if (pathname != NULL) 1948 return (pathname); 1949 if (objgiven && !nodeflib) { 1950 pathname = search_library_path(name, 1951 ld_standard_library_path, refobj_path, fdp); 1952 if (pathname != NULL) 1953 return (pathname); 1954 } 1955 } 1956 1957 if (objgiven && refobj->path != NULL) { 1958 _rtld_error("Shared object \"%s\" not found, " 1959 "required by \"%s\"", name, basename(refobj->path)); 1960 } else { 1961 _rtld_error("Shared object \"%s\" not found", name); 1962 } 1963 return (NULL); 1964 } 1965 1966 /* 1967 * Given a symbol number in a referencing object, find the corresponding 1968 * definition of the symbol. Returns a pointer to the symbol, or NULL if 1969 * no definition was found. Returns a pointer to the Obj_Entry of the 1970 * defining object via the reference parameter DEFOBJ_OUT. 1971 */ 1972 const Elf_Sym * 1973 find_symdef(unsigned long symnum, const Obj_Entry *refobj, 1974 const Obj_Entry **defobj_out, int flags, SymCache *cache, 1975 RtldLockState *lockstate) 1976 { 1977 const Elf_Sym *ref; 1978 const Elf_Sym *def; 1979 const Obj_Entry *defobj; 1980 const Ver_Entry *ve; 1981 SymLook req; 1982 const char *name; 1983 int res; 1984 1985 /* 1986 * If we have already found this symbol, get the information from 1987 * the cache. 1988 */ 1989 if (symnum >= refobj->dynsymcount) 1990 return (NULL); /* Bad object */ 1991 if (cache != NULL && cache[symnum].sym != NULL) { 1992 *defobj_out = cache[symnum].obj; 1993 return (cache[symnum].sym); 1994 } 1995 1996 ref = refobj->symtab + symnum; 1997 name = refobj->strtab + ref->st_name; 1998 def = NULL; 1999 defobj = NULL; 2000 ve = NULL; 2001 2002 /* 2003 * We don't have to do a full scale lookup if the symbol is local. 2004 * We know it will bind to the instance in this load module; to 2005 * which we already have a pointer (ie ref). By not doing a lookup, 2006 * we not only improve performance, but it also avoids unresolvable 2007 * symbols when local symbols are not in the hash table. This has 2008 * been seen with the ia64 toolchain. 2009 */ 2010 if (ELF_ST_BIND(ref->st_info) != STB_LOCAL) { 2011 if (ELF_ST_TYPE(ref->st_info) == STT_SECTION) { 2012 _rtld_error("%s: Bogus symbol table entry %lu", refobj->path, 2013 symnum); 2014 } 2015 symlook_init(&req, name); 2016 req.flags = flags; 2017 ve = req.ventry = fetch_ventry(refobj, symnum); 2018 req.lockstate = lockstate; 2019 res = symlook_default(&req, refobj); 2020 if (res == 0) { 2021 def = req.sym_out; 2022 defobj = req.defobj_out; 2023 } 2024 } else { 2025 def = ref; 2026 defobj = refobj; 2027 } 2028 2029 /* 2030 * If we found no definition and the reference is weak, treat the 2031 * symbol as having the value zero. 2032 */ 2033 if (def == NULL && ELF_ST_BIND(ref->st_info) == STB_WEAK) { 2034 def = &sym_zero; 2035 defobj = obj_main; 2036 } 2037 2038 if (def != NULL) { 2039 *defobj_out = defobj; 2040 /* Record the information in the cache to avoid subsequent lookups. */ 2041 if (cache != NULL) { 2042 cache[symnum].sym = def; 2043 cache[symnum].obj = defobj; 2044 } 2045 } else { 2046 if (refobj != &obj_rtld) 2047 _rtld_error("%s: Undefined symbol \"%s%s%s\"", refobj->path, name, 2048 ve != NULL ? "@" : "", ve != NULL ? ve->name : ""); 2049 } 2050 return (def); 2051 } 2052 2053 /* 2054 * Return the search path from the ldconfig hints file, reading it if 2055 * necessary. If nostdlib is true, then the default search paths are 2056 * not added to result. 2057 * 2058 * Returns NULL if there are problems with the hints file, 2059 * or if the search path there is empty. 2060 */ 2061 static const char * 2062 gethints(bool nostdlib) 2063 { 2064 static char *filtered_path; 2065 static const char *hints; 2066 static struct elfhints_hdr hdr; 2067 struct fill_search_info_args sargs, hargs; 2068 struct dl_serinfo smeta, hmeta, *SLPinfo, *hintinfo; 2069 struct dl_serpath *SLPpath, *hintpath; 2070 char *p; 2071 struct stat hint_stat; 2072 unsigned int SLPndx, hintndx, fndx, fcount; 2073 int fd; 2074 size_t flen; 2075 uint32_t dl; 2076 bool skip; 2077 2078 /* First call, read the hints file */ 2079 if (hints == NULL) { 2080 /* Keep from trying again in case the hints file is bad. */ 2081 hints = ""; 2082 2083 if ((fd = open(ld_elf_hints_path, O_RDONLY | O_CLOEXEC)) == -1) 2084 return (NULL); 2085 2086 /* 2087 * Check of hdr.dirlistlen value against type limit 2088 * intends to pacify static analyzers. Further 2089 * paranoia leads to checks that dirlist is fully 2090 * contained in the file range. 2091 */ 2092 if (read(fd, &hdr, sizeof hdr) != sizeof hdr || 2093 hdr.magic != ELFHINTS_MAGIC || 2094 hdr.version != 1 || hdr.dirlistlen > UINT_MAX / 2 || 2095 fstat(fd, &hint_stat) == -1) { 2096 cleanup1: 2097 close(fd); 2098 hdr.dirlistlen = 0; 2099 return (NULL); 2100 } 2101 dl = hdr.strtab; 2102 if (dl + hdr.dirlist < dl) 2103 goto cleanup1; 2104 dl += hdr.dirlist; 2105 if (dl + hdr.dirlistlen < dl) 2106 goto cleanup1; 2107 dl += hdr.dirlistlen; 2108 if (dl > hint_stat.st_size) 2109 goto cleanup1; 2110 p = xmalloc(hdr.dirlistlen + 1); 2111 if (pread(fd, p, hdr.dirlistlen + 1, 2112 hdr.strtab + hdr.dirlist) != (ssize_t)hdr.dirlistlen + 1 || 2113 p[hdr.dirlistlen] != '\0') { 2114 free(p); 2115 goto cleanup1; 2116 } 2117 hints = p; 2118 close(fd); 2119 } 2120 2121 /* 2122 * If caller agreed to receive list which includes the default 2123 * paths, we are done. Otherwise, if we still did not 2124 * calculated filtered result, do it now. 2125 */ 2126 if (!nostdlib) 2127 return (hints[0] != '\0' ? hints : NULL); 2128 if (filtered_path != NULL) 2129 goto filt_ret; 2130 2131 /* 2132 * Obtain the list of all configured search paths, and the 2133 * list of the default paths. 2134 * 2135 * First estimate the size of the results. 2136 */ 2137 smeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 2138 smeta.dls_cnt = 0; 2139 hmeta.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 2140 hmeta.dls_cnt = 0; 2141 2142 sargs.request = RTLD_DI_SERINFOSIZE; 2143 sargs.serinfo = &smeta; 2144 hargs.request = RTLD_DI_SERINFOSIZE; 2145 hargs.serinfo = &hmeta; 2146 2147 path_enumerate(ld_standard_library_path, fill_search_info, NULL, 2148 &sargs); 2149 path_enumerate(hints, fill_search_info, NULL, &hargs); 2150 2151 SLPinfo = xmalloc(smeta.dls_size); 2152 hintinfo = xmalloc(hmeta.dls_size); 2153 2154 /* 2155 * Next fetch both sets of paths. 2156 */ 2157 sargs.request = RTLD_DI_SERINFO; 2158 sargs.serinfo = SLPinfo; 2159 sargs.serpath = &SLPinfo->dls_serpath[0]; 2160 sargs.strspace = (char *)&SLPinfo->dls_serpath[smeta.dls_cnt]; 2161 2162 hargs.request = RTLD_DI_SERINFO; 2163 hargs.serinfo = hintinfo; 2164 hargs.serpath = &hintinfo->dls_serpath[0]; 2165 hargs.strspace = (char *)&hintinfo->dls_serpath[hmeta.dls_cnt]; 2166 2167 path_enumerate(ld_standard_library_path, fill_search_info, NULL, 2168 &sargs); 2169 path_enumerate(hints, fill_search_info, NULL, &hargs); 2170 2171 /* 2172 * Now calculate the difference between two sets, by excluding 2173 * standard paths from the full set. 2174 */ 2175 fndx = 0; 2176 fcount = 0; 2177 filtered_path = xmalloc(hdr.dirlistlen + 1); 2178 hintpath = &hintinfo->dls_serpath[0]; 2179 for (hintndx = 0; hintndx < hmeta.dls_cnt; hintndx++, hintpath++) { 2180 skip = false; 2181 SLPpath = &SLPinfo->dls_serpath[0]; 2182 /* 2183 * Check each standard path against current. 2184 */ 2185 for (SLPndx = 0; SLPndx < smeta.dls_cnt; SLPndx++, SLPpath++) { 2186 /* matched, skip the path */ 2187 if (!strcmp(hintpath->dls_name, SLPpath->dls_name)) { 2188 skip = true; 2189 break; 2190 } 2191 } 2192 if (skip) 2193 continue; 2194 /* 2195 * Not matched against any standard path, add the path 2196 * to result. Separate consequtive paths with ':'. 2197 */ 2198 if (fcount > 0) { 2199 filtered_path[fndx] = ':'; 2200 fndx++; 2201 } 2202 fcount++; 2203 flen = strlen(hintpath->dls_name); 2204 strncpy((filtered_path + fndx), hintpath->dls_name, flen); 2205 fndx += flen; 2206 } 2207 filtered_path[fndx] = '\0'; 2208 2209 free(SLPinfo); 2210 free(hintinfo); 2211 2212 filt_ret: 2213 return (filtered_path[0] != '\0' ? filtered_path : NULL); 2214 } 2215 2216 static void 2217 init_dag(Obj_Entry *root) 2218 { 2219 const Needed_Entry *needed; 2220 const Objlist_Entry *elm; 2221 DoneList donelist; 2222 2223 if (root->dag_inited) 2224 return; 2225 donelist_init(&donelist); 2226 2227 /* Root object belongs to own DAG. */ 2228 objlist_push_tail(&root->dldags, root); 2229 objlist_push_tail(&root->dagmembers, root); 2230 donelist_check(&donelist, root); 2231 2232 /* 2233 * Add dependencies of root object to DAG in breadth order 2234 * by exploiting the fact that each new object get added 2235 * to the tail of the dagmembers list. 2236 */ 2237 STAILQ_FOREACH(elm, &root->dagmembers, link) { 2238 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) { 2239 if (needed->obj == NULL || donelist_check(&donelist, needed->obj)) 2240 continue; 2241 objlist_push_tail(&needed->obj->dldags, root); 2242 objlist_push_tail(&root->dagmembers, needed->obj); 2243 } 2244 } 2245 root->dag_inited = true; 2246 } 2247 2248 static void 2249 init_marker(Obj_Entry *marker) 2250 { 2251 2252 bzero(marker, sizeof(*marker)); 2253 marker->marker = true; 2254 } 2255 2256 Obj_Entry * 2257 globallist_curr(const Obj_Entry *obj) 2258 { 2259 2260 for (;;) { 2261 if (obj == NULL) 2262 return (NULL); 2263 if (!obj->marker) 2264 return (__DECONST(Obj_Entry *, obj)); 2265 obj = TAILQ_PREV(obj, obj_entry_q, next); 2266 } 2267 } 2268 2269 Obj_Entry * 2270 globallist_next(const Obj_Entry *obj) 2271 { 2272 2273 for (;;) { 2274 obj = TAILQ_NEXT(obj, next); 2275 if (obj == NULL) 2276 return (NULL); 2277 if (!obj->marker) 2278 return (__DECONST(Obj_Entry *, obj)); 2279 } 2280 } 2281 2282 /* Prevent the object from being unmapped while the bind lock is dropped. */ 2283 static void 2284 hold_object(Obj_Entry *obj) 2285 { 2286 2287 obj->holdcount++; 2288 } 2289 2290 static void 2291 unhold_object(Obj_Entry *obj) 2292 { 2293 2294 assert(obj->holdcount > 0); 2295 if (--obj->holdcount == 0 && obj->unholdfree) 2296 release_object(obj); 2297 } 2298 2299 static void 2300 process_z(Obj_Entry *root) 2301 { 2302 const Objlist_Entry *elm; 2303 Obj_Entry *obj; 2304 2305 /* 2306 * Walk over object DAG and process every dependent object 2307 * that is marked as DF_1_NODELETE or DF_1_GLOBAL. They need 2308 * to grow their own DAG. 2309 * 2310 * For DF_1_GLOBAL, DAG is required for symbol lookups in 2311 * symlook_global() to work. 2312 * 2313 * For DF_1_NODELETE, the DAG should have its reference upped. 2314 */ 2315 STAILQ_FOREACH(elm, &root->dagmembers, link) { 2316 obj = elm->obj; 2317 if (obj == NULL) 2318 continue; 2319 if (obj->z_nodelete && !obj->ref_nodel) { 2320 dbg("obj %s -z nodelete", obj->path); 2321 init_dag(obj); 2322 ref_dag(obj); 2323 obj->ref_nodel = true; 2324 } 2325 if (obj->z_global && objlist_find(&list_global, obj) == NULL) { 2326 dbg("obj %s -z global", obj->path); 2327 objlist_push_tail(&list_global, obj); 2328 init_dag(obj); 2329 } 2330 } 2331 } 2332 2333 static void 2334 parse_rtld_phdr(Obj_Entry *obj) 2335 { 2336 const Elf_Phdr *ph; 2337 Elf_Addr note_start, note_end; 2338 2339 obj->stack_flags = PF_X | PF_R | PF_W; 2340 for (ph = obj->phdr; (const char *)ph < (const char *)obj->phdr + 2341 obj->phsize; ph++) { 2342 switch (ph->p_type) { 2343 case PT_GNU_STACK: 2344 obj->stack_flags = ph->p_flags; 2345 break; 2346 case PT_GNU_RELRO: 2347 obj->relro_page = obj->relocbase + 2348 rtld_trunc_page(ph->p_vaddr); 2349 obj->relro_size = rtld_round_page(ph->p_memsz); 2350 break; 2351 case PT_NOTE: 2352 note_start = (Elf_Addr)obj->relocbase + ph->p_vaddr; 2353 note_end = note_start + ph->p_filesz; 2354 digest_notes(obj, note_start, note_end); 2355 break; 2356 } 2357 } 2358 } 2359 2360 /* 2361 * Initialize the dynamic linker. The argument is the address at which 2362 * the dynamic linker has been mapped into memory. The primary task of 2363 * this function is to relocate the dynamic linker. 2364 */ 2365 static void 2366 init_rtld(caddr_t mapbase, Elf_Auxinfo **aux_info) 2367 { 2368 Obj_Entry objtmp; /* Temporary rtld object */ 2369 const Elf_Ehdr *ehdr; 2370 const Elf_Dyn *dyn_rpath; 2371 const Elf_Dyn *dyn_soname; 2372 const Elf_Dyn *dyn_runpath; 2373 2374 #ifdef RTLD_INIT_PAGESIZES_EARLY 2375 /* The page size is required by the dynamic memory allocator. */ 2376 init_pagesizes(aux_info); 2377 #endif 2378 2379 /* 2380 * Conjure up an Obj_Entry structure for the dynamic linker. 2381 * 2382 * The "path" member can't be initialized yet because string constants 2383 * cannot yet be accessed. Below we will set it correctly. 2384 */ 2385 memset(&objtmp, 0, sizeof(objtmp)); 2386 objtmp.path = NULL; 2387 objtmp.rtld = true; 2388 objtmp.mapbase = mapbase; 2389 #ifdef PIC 2390 objtmp.relocbase = mapbase; 2391 #endif 2392 2393 objtmp.dynamic = rtld_dynamic(&objtmp); 2394 digest_dynamic1(&objtmp, 1, &dyn_rpath, &dyn_soname, &dyn_runpath); 2395 assert(objtmp.needed == NULL); 2396 assert(!objtmp.textrel); 2397 /* 2398 * Temporarily put the dynamic linker entry into the object list, so 2399 * that symbols can be found. 2400 */ 2401 relocate_objects(&objtmp, true, &objtmp, 0, NULL); 2402 2403 ehdr = (Elf_Ehdr *)mapbase; 2404 objtmp.phdr = (Elf_Phdr *)((char *)mapbase + ehdr->e_phoff); 2405 objtmp.phsize = ehdr->e_phnum * sizeof(objtmp.phdr[0]); 2406 2407 /* Initialize the object list. */ 2408 TAILQ_INIT(&obj_list); 2409 2410 /* Now that non-local variables can be accesses, copy out obj_rtld. */ 2411 memcpy(&obj_rtld, &objtmp, sizeof(obj_rtld)); 2412 2413 #ifndef RTLD_INIT_PAGESIZES_EARLY 2414 /* The page size is required by the dynamic memory allocator. */ 2415 init_pagesizes(aux_info); 2416 #endif 2417 2418 if (aux_info[AT_OSRELDATE] != NULL) 2419 osreldate = aux_info[AT_OSRELDATE]->a_un.a_val; 2420 2421 digest_dynamic2(&obj_rtld, dyn_rpath, dyn_soname, dyn_runpath); 2422 2423 /* Replace the path with a dynamically allocated copy. */ 2424 obj_rtld.path = xstrdup(ld_path_rtld); 2425 2426 parse_rtld_phdr(&obj_rtld); 2427 if (obj_enforce_relro(&obj_rtld) == -1) 2428 rtld_die(); 2429 2430 r_debug.r_version = R_DEBUG_VERSION; 2431 r_debug.r_brk = r_debug_state; 2432 r_debug.r_state = RT_CONSISTENT; 2433 r_debug.r_ldbase = obj_rtld.relocbase; 2434 } 2435 2436 /* 2437 * Retrieve the array of supported page sizes. The kernel provides the page 2438 * sizes in increasing order. 2439 */ 2440 static void 2441 init_pagesizes(Elf_Auxinfo **aux_info) 2442 { 2443 static size_t psa[MAXPAGESIZES]; 2444 int mib[2]; 2445 size_t len, size; 2446 2447 if (aux_info[AT_PAGESIZES] != NULL && aux_info[AT_PAGESIZESLEN] != 2448 NULL) { 2449 size = aux_info[AT_PAGESIZESLEN]->a_un.a_val; 2450 pagesizes = aux_info[AT_PAGESIZES]->a_un.a_ptr; 2451 } else { 2452 len = 2; 2453 if (sysctlnametomib("hw.pagesizes", mib, &len) == 0) 2454 size = sizeof(psa); 2455 else { 2456 /* As a fallback, retrieve the base page size. */ 2457 size = sizeof(psa[0]); 2458 if (aux_info[AT_PAGESZ] != NULL) { 2459 psa[0] = aux_info[AT_PAGESZ]->a_un.a_val; 2460 goto psa_filled; 2461 } else { 2462 mib[0] = CTL_HW; 2463 mib[1] = HW_PAGESIZE; 2464 len = 2; 2465 } 2466 } 2467 if (sysctl(mib, len, psa, &size, NULL, 0) == -1) { 2468 _rtld_error("sysctl for hw.pagesize(s) failed"); 2469 rtld_die(); 2470 } 2471 psa_filled: 2472 pagesizes = psa; 2473 } 2474 npagesizes = size / sizeof(pagesizes[0]); 2475 /* Discard any invalid entries at the end of the array. */ 2476 while (npagesizes > 0 && pagesizes[npagesizes - 1] == 0) 2477 npagesizes--; 2478 2479 page_size = pagesizes[0]; 2480 } 2481 2482 /* 2483 * Add the init functions from a needed object list (and its recursive 2484 * needed objects) to "list". This is not used directly; it is a helper 2485 * function for initlist_add_objects(). The write lock must be held 2486 * when this function is called. 2487 */ 2488 static void 2489 initlist_add_neededs(Needed_Entry *needed, Objlist *list) 2490 { 2491 /* Recursively process the successor needed objects. */ 2492 if (needed->next != NULL) 2493 initlist_add_neededs(needed->next, list); 2494 2495 /* Process the current needed object. */ 2496 if (needed->obj != NULL) 2497 initlist_add_objects(needed->obj, needed->obj, list); 2498 } 2499 2500 /* 2501 * Scan all of the DAGs rooted in the range of objects from "obj" to 2502 * "tail" and add their init functions to "list". This recurses over 2503 * the DAGs and ensure the proper init ordering such that each object's 2504 * needed libraries are initialized before the object itself. At the 2505 * same time, this function adds the objects to the global finalization 2506 * list "list_fini" in the opposite order. The write lock must be 2507 * held when this function is called. 2508 */ 2509 static void 2510 initlist_add_objects(Obj_Entry *obj, Obj_Entry *tail, Objlist *list) 2511 { 2512 Obj_Entry *nobj; 2513 2514 if (obj->init_scanned || obj->init_done) 2515 return; 2516 obj->init_scanned = true; 2517 2518 /* Recursively process the successor objects. */ 2519 nobj = globallist_next(obj); 2520 if (nobj != NULL && obj != tail) 2521 initlist_add_objects(nobj, tail, list); 2522 2523 /* Recursively process the needed objects. */ 2524 if (obj->needed != NULL) 2525 initlist_add_neededs(obj->needed, list); 2526 if (obj->needed_filtees != NULL) 2527 initlist_add_neededs(obj->needed_filtees, list); 2528 if (obj->needed_aux_filtees != NULL) 2529 initlist_add_neededs(obj->needed_aux_filtees, list); 2530 2531 /* Add the object to the init list. */ 2532 objlist_push_tail(list, obj); 2533 2534 /* Add the object to the global fini list in the reverse order. */ 2535 if ((obj->fini != (Elf_Addr)NULL || obj->fini_array != (Elf_Addr)NULL) 2536 && !obj->on_fini_list) { 2537 objlist_push_head(&list_fini, obj); 2538 obj->on_fini_list = true; 2539 } 2540 } 2541 2542 static void 2543 free_needed_filtees(Needed_Entry *n, RtldLockState *lockstate) 2544 { 2545 Needed_Entry *needed, *needed1; 2546 2547 for (needed = n; needed != NULL; needed = needed->next) { 2548 if (needed->obj != NULL) { 2549 dlclose_locked(needed->obj, lockstate); 2550 needed->obj = NULL; 2551 } 2552 } 2553 for (needed = n; needed != NULL; needed = needed1) { 2554 needed1 = needed->next; 2555 free(needed); 2556 } 2557 } 2558 2559 static void 2560 unload_filtees(Obj_Entry *obj, RtldLockState *lockstate) 2561 { 2562 2563 free_needed_filtees(obj->needed_filtees, lockstate); 2564 obj->needed_filtees = NULL; 2565 free_needed_filtees(obj->needed_aux_filtees, lockstate); 2566 obj->needed_aux_filtees = NULL; 2567 obj->filtees_loaded = false; 2568 } 2569 2570 static void 2571 load_filtee1(Obj_Entry *obj, Needed_Entry *needed, int flags, 2572 RtldLockState *lockstate) 2573 { 2574 2575 for (; needed != NULL; needed = needed->next) { 2576 needed->obj = dlopen_object(obj->strtab + needed->name, -1, obj, 2577 flags, ((ld_loadfltr || obj->z_loadfltr) ? RTLD_NOW : RTLD_LAZY) | 2578 RTLD_LOCAL, lockstate); 2579 } 2580 } 2581 2582 static void 2583 load_filtees(Obj_Entry *obj, int flags, RtldLockState *lockstate) 2584 { 2585 if (obj->filtees_loaded || obj->filtees_loading) 2586 return; 2587 lock_restart_for_upgrade(lockstate); 2588 obj->filtees_loading = true; 2589 load_filtee1(obj, obj->needed_filtees, flags, lockstate); 2590 load_filtee1(obj, obj->needed_aux_filtees, flags, lockstate); 2591 obj->filtees_loaded = true; 2592 obj->filtees_loading = false; 2593 } 2594 2595 static int 2596 process_needed(Obj_Entry *obj, Needed_Entry *needed, int flags) 2597 { 2598 Obj_Entry *obj1; 2599 2600 for (; needed != NULL; needed = needed->next) { 2601 obj1 = needed->obj = load_object(obj->strtab + needed->name, -1, obj, 2602 flags & ~RTLD_LO_NOLOAD); 2603 if (obj1 == NULL && !ld_tracing && (flags & RTLD_LO_FILTEES) == 0) 2604 return (-1); 2605 } 2606 return (0); 2607 } 2608 2609 /* 2610 * Given a shared object, traverse its list of needed objects, and load 2611 * each of them. Returns 0 on success. Generates an error message and 2612 * returns -1 on failure. 2613 */ 2614 static int 2615 load_needed_objects(Obj_Entry *first, int flags) 2616 { 2617 Obj_Entry *obj; 2618 2619 for (obj = first; obj != NULL; obj = TAILQ_NEXT(obj, next)) { 2620 if (obj->marker) 2621 continue; 2622 if (process_needed(obj, obj->needed, flags) == -1) 2623 return (-1); 2624 } 2625 return (0); 2626 } 2627 2628 static int 2629 load_preload_objects(const char *penv, bool isfd) 2630 { 2631 Obj_Entry *obj; 2632 const char *name; 2633 size_t len; 2634 char savech, *p, *psave; 2635 int fd; 2636 static const char delim[] = " \t:;"; 2637 2638 if (penv == NULL) 2639 return (0); 2640 2641 p = psave = xstrdup(penv); 2642 p += strspn(p, delim); 2643 while (*p != '\0') { 2644 len = strcspn(p, delim); 2645 2646 savech = p[len]; 2647 p[len] = '\0'; 2648 if (isfd) { 2649 name = NULL; 2650 fd = parse_integer(p); 2651 if (fd == -1) { 2652 free(psave); 2653 return (-1); 2654 } 2655 } else { 2656 name = p; 2657 fd = -1; 2658 } 2659 2660 obj = load_object(name, fd, NULL, 0); 2661 if (obj == NULL) { 2662 free(psave); 2663 return (-1); /* XXX - cleanup */ 2664 } 2665 obj->z_interpose = true; 2666 p[len] = savech; 2667 p += len; 2668 p += strspn(p, delim); 2669 } 2670 LD_UTRACE(UTRACE_PRELOAD_FINISHED, NULL, NULL, 0, 0, NULL); 2671 2672 free(psave); 2673 return (0); 2674 } 2675 2676 static const char * 2677 printable_path(const char *path) 2678 { 2679 2680 return (path == NULL ? "<unknown>" : path); 2681 } 2682 2683 /* 2684 * Load a shared object into memory, if it is not already loaded. The 2685 * object may be specified by name or by user-supplied file descriptor 2686 * fd_u. In the later case, the fd_u descriptor is not closed, but its 2687 * duplicate is. 2688 * 2689 * Returns a pointer to the Obj_Entry for the object. Returns NULL 2690 * on failure. 2691 */ 2692 static Obj_Entry * 2693 load_object(const char *name, int fd_u, const Obj_Entry *refobj, int flags) 2694 { 2695 Obj_Entry *obj; 2696 int fd; 2697 struct stat sb; 2698 char *path; 2699 2700 fd = -1; 2701 if (name != NULL) { 2702 TAILQ_FOREACH(obj, &obj_list, next) { 2703 if (obj->marker || obj->doomed) 2704 continue; 2705 if (object_match_name(obj, name)) 2706 return (obj); 2707 } 2708 2709 path = find_library(name, refobj, &fd); 2710 if (path == NULL) 2711 return (NULL); 2712 } else 2713 path = NULL; 2714 2715 if (fd >= 0) { 2716 /* 2717 * search_library_pathfds() opens a fresh file descriptor for the 2718 * library, so there is no need to dup(). 2719 */ 2720 } else if (fd_u == -1) { 2721 /* 2722 * If we didn't find a match by pathname, or the name is not 2723 * supplied, open the file and check again by device and inode. 2724 * This avoids false mismatches caused by multiple links or ".." 2725 * in pathnames. 2726 * 2727 * To avoid a race, we open the file and use fstat() rather than 2728 * using stat(). 2729 */ 2730 if ((fd = open(path, O_RDONLY | O_CLOEXEC | O_VERIFY)) == -1) { 2731 _rtld_error("Cannot open \"%s\"", path); 2732 free(path); 2733 return (NULL); 2734 } 2735 } else { 2736 fd = fcntl(fd_u, F_DUPFD_CLOEXEC, 0); 2737 if (fd == -1) { 2738 _rtld_error("Cannot dup fd"); 2739 free(path); 2740 return (NULL); 2741 } 2742 } 2743 if (fstat(fd, &sb) == -1) { 2744 _rtld_error("Cannot fstat \"%s\"", printable_path(path)); 2745 close(fd); 2746 free(path); 2747 return (NULL); 2748 } 2749 TAILQ_FOREACH(obj, &obj_list, next) { 2750 if (obj->marker || obj->doomed) 2751 continue; 2752 if (obj->ino == sb.st_ino && obj->dev == sb.st_dev) 2753 break; 2754 } 2755 if (obj != NULL && name != NULL) { 2756 object_add_name(obj, name); 2757 free(path); 2758 close(fd); 2759 return (obj); 2760 } 2761 if (flags & RTLD_LO_NOLOAD) { 2762 free(path); 2763 close(fd); 2764 return (NULL); 2765 } 2766 2767 /* First use of this object, so we must map it in */ 2768 obj = do_load_object(fd, name, path, &sb, flags); 2769 if (obj == NULL) 2770 free(path); 2771 close(fd); 2772 2773 return (obj); 2774 } 2775 2776 static Obj_Entry * 2777 do_load_object(int fd, const char *name, char *path, struct stat *sbp, 2778 int flags) 2779 { 2780 Obj_Entry *obj; 2781 struct statfs fs; 2782 2783 /* 2784 * First, make sure that environment variables haven't been 2785 * used to circumvent the noexec flag on a filesystem. 2786 * We ignore fstatfs(2) failures, since fd might reference 2787 * not a file, e.g. shmfd. 2788 */ 2789 if (dangerous_ld_env && fstatfs(fd, &fs) == 0 && 2790 (fs.f_flags & MNT_NOEXEC) != 0) { 2791 _rtld_error("Cannot execute objects on %s", fs.f_mntonname); 2792 return (NULL); 2793 } 2794 2795 dbg("loading \"%s\"", printable_path(path)); 2796 obj = map_object(fd, printable_path(path), sbp); 2797 if (obj == NULL) 2798 return (NULL); 2799 2800 /* 2801 * If DT_SONAME is present in the object, digest_dynamic2 already 2802 * added it to the object names. 2803 */ 2804 if (name != NULL) 2805 object_add_name(obj, name); 2806 obj->path = path; 2807 if (!digest_dynamic(obj, 0)) 2808 goto errp; 2809 dbg("%s valid_hash_sysv %d valid_hash_gnu %d dynsymcount %d", obj->path, 2810 obj->valid_hash_sysv, obj->valid_hash_gnu, obj->dynsymcount); 2811 if (obj->z_pie && (flags & RTLD_LO_TRACE) == 0) { 2812 dbg("refusing to load PIE executable \"%s\"", obj->path); 2813 _rtld_error("Cannot load PIE binary %s as DSO", obj->path); 2814 goto errp; 2815 } 2816 if (obj->z_noopen && (flags & (RTLD_LO_DLOPEN | RTLD_LO_TRACE)) == 2817 RTLD_LO_DLOPEN) { 2818 dbg("refusing to load non-loadable \"%s\"", obj->path); 2819 _rtld_error("Cannot dlopen non-loadable %s", obj->path); 2820 goto errp; 2821 } 2822 2823 obj->dlopened = (flags & RTLD_LO_DLOPEN) != 0; 2824 TAILQ_INSERT_TAIL(&obj_list, obj, next); 2825 obj_count++; 2826 obj_loads++; 2827 linkmap_add(obj); /* for GDB & dlinfo() */ 2828 max_stack_flags |= obj->stack_flags; 2829 2830 dbg(" %p .. %p: %s", obj->mapbase, 2831 obj->mapbase + obj->mapsize - 1, obj->path); 2832 if (obj->textrel) 2833 dbg(" WARNING: %s has impure text", obj->path); 2834 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, obj->mapsize, 0, 2835 obj->path); 2836 2837 return (obj); 2838 2839 errp: 2840 munmap(obj->mapbase, obj->mapsize); 2841 obj_free(obj); 2842 return (NULL); 2843 } 2844 2845 static int 2846 load_kpreload(const void *addr) 2847 { 2848 Obj_Entry *obj; 2849 const Elf_Ehdr *ehdr; 2850 const Elf_Phdr *phdr, *phlimit, *phdyn, *seg0, *segn; 2851 static const char kname[] = "[vdso]"; 2852 2853 ehdr = addr; 2854 if (!check_elf_headers(ehdr, "kpreload")) 2855 return (-1); 2856 obj = obj_new(); 2857 phdr = (const Elf_Phdr *)((const char *)addr + ehdr->e_phoff); 2858 obj->phdr = phdr; 2859 obj->phsize = ehdr->e_phnum * sizeof(*phdr); 2860 phlimit = phdr + ehdr->e_phnum; 2861 seg0 = segn = NULL; 2862 2863 for (; phdr < phlimit; phdr++) { 2864 switch (phdr->p_type) { 2865 case PT_DYNAMIC: 2866 phdyn = phdr; 2867 break; 2868 case PT_GNU_STACK: 2869 /* Absense of PT_GNU_STACK implies stack_flags == 0. */ 2870 obj->stack_flags = phdr->p_flags; 2871 break; 2872 case PT_LOAD: 2873 if (seg0 == NULL || seg0->p_vaddr > phdr->p_vaddr) 2874 seg0 = phdr; 2875 if (segn == NULL || segn->p_vaddr + segn->p_memsz < 2876 phdr->p_vaddr + phdr->p_memsz) 2877 segn = phdr; 2878 break; 2879 } 2880 } 2881 2882 obj->mapbase = __DECONST(caddr_t, addr); 2883 obj->mapsize = segn->p_vaddr + segn->p_memsz - (Elf_Addr)addr; 2884 obj->vaddrbase = 0; 2885 obj->relocbase = obj->mapbase; 2886 2887 object_add_name(obj, kname); 2888 obj->path = xstrdup(kname); 2889 obj->dynamic = (const Elf_Dyn *)(obj->relocbase + phdyn->p_vaddr); 2890 2891 if (!digest_dynamic(obj, 0)) { 2892 obj_free(obj); 2893 return (-1); 2894 } 2895 2896 /* 2897 * We assume that kernel-preloaded object does not need 2898 * relocation. It is currently written into read-only page, 2899 * handling relocations would mean we need to allocate at 2900 * least one additional page per AS. 2901 */ 2902 dbg("%s mapbase %p phdrs %p PT_LOAD phdr %p vaddr %p dynamic %p", 2903 obj->path, obj->mapbase, obj->phdr, seg0, 2904 obj->relocbase + seg0->p_vaddr, obj->dynamic); 2905 2906 TAILQ_INSERT_TAIL(&obj_list, obj, next); 2907 obj_count++; 2908 obj_loads++; 2909 linkmap_add(obj); /* for GDB & dlinfo() */ 2910 max_stack_flags |= obj->stack_flags; 2911 2912 LD_UTRACE(UTRACE_LOAD_OBJECT, obj, obj->mapbase, 0, 0, obj->path); 2913 return (0); 2914 } 2915 2916 Obj_Entry * 2917 obj_from_addr(const void *addr) 2918 { 2919 Obj_Entry *obj; 2920 2921 TAILQ_FOREACH(obj, &obj_list, next) { 2922 if (obj->marker) 2923 continue; 2924 if (addr < (void *) obj->mapbase) 2925 continue; 2926 if (addr < (void *)(obj->mapbase + obj->mapsize)) 2927 return obj; 2928 } 2929 return (NULL); 2930 } 2931 2932 static void 2933 preinit_main(void) 2934 { 2935 Elf_Addr *preinit_addr; 2936 int index; 2937 2938 preinit_addr = (Elf_Addr *)obj_main->preinit_array; 2939 if (preinit_addr == NULL) 2940 return; 2941 2942 for (index = 0; index < obj_main->preinit_array_num; index++) { 2943 if (preinit_addr[index] != 0 && preinit_addr[index] != 1) { 2944 dbg("calling preinit function for %s at %p", obj_main->path, 2945 (void *)preinit_addr[index]); 2946 LD_UTRACE(UTRACE_INIT_CALL, obj_main, (void *)preinit_addr[index], 2947 0, 0, obj_main->path); 2948 call_init_pointer(obj_main, preinit_addr[index]); 2949 } 2950 } 2951 } 2952 2953 /* 2954 * Call the finalization functions for each of the objects in "list" 2955 * belonging to the DAG of "root" and referenced once. If NULL "root" 2956 * is specified, every finalization function will be called regardless 2957 * of the reference count and the list elements won't be freed. All of 2958 * the objects are expected to have non-NULL fini functions. 2959 */ 2960 static void 2961 objlist_call_fini(Objlist *list, Obj_Entry *root, RtldLockState *lockstate) 2962 { 2963 Objlist_Entry *elm; 2964 struct dlerror_save *saved_msg; 2965 Elf_Addr *fini_addr; 2966 int index; 2967 2968 assert(root == NULL || root->refcount == 1); 2969 2970 if (root != NULL) 2971 root->doomed = true; 2972 2973 /* 2974 * Preserve the current error message since a fini function might 2975 * call into the dynamic linker and overwrite it. 2976 */ 2977 saved_msg = errmsg_save(); 2978 do { 2979 STAILQ_FOREACH(elm, list, link) { 2980 if (root != NULL && (elm->obj->refcount != 1 || 2981 objlist_find(&root->dagmembers, elm->obj) == NULL)) 2982 continue; 2983 /* Remove object from fini list to prevent recursive invocation. */ 2984 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link); 2985 /* Ensure that new references cannot be acquired. */ 2986 elm->obj->doomed = true; 2987 2988 hold_object(elm->obj); 2989 lock_release(rtld_bind_lock, lockstate); 2990 /* 2991 * It is legal to have both DT_FINI and DT_FINI_ARRAY defined. 2992 * When this happens, DT_FINI_ARRAY is processed first. 2993 */ 2994 fini_addr = (Elf_Addr *)elm->obj->fini_array; 2995 if (fini_addr != NULL && elm->obj->fini_array_num > 0) { 2996 for (index = elm->obj->fini_array_num - 1; index >= 0; 2997 index--) { 2998 if (fini_addr[index] != 0 && fini_addr[index] != 1) { 2999 dbg("calling fini function for %s at %p", 3000 elm->obj->path, (void *)fini_addr[index]); 3001 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, 3002 (void *)fini_addr[index], 0, 0, elm->obj->path); 3003 call_initfini_pointer(elm->obj, fini_addr[index]); 3004 } 3005 } 3006 } 3007 if (elm->obj->fini != (Elf_Addr)NULL) { 3008 dbg("calling fini function for %s at %p", elm->obj->path, 3009 (void *)elm->obj->fini); 3010 LD_UTRACE(UTRACE_FINI_CALL, elm->obj, (void *)elm->obj->fini, 3011 0, 0, elm->obj->path); 3012 call_initfini_pointer(elm->obj, elm->obj->fini); 3013 } 3014 wlock_acquire(rtld_bind_lock, lockstate); 3015 unhold_object(elm->obj); 3016 /* No need to free anything if process is going down. */ 3017 if (root != NULL) 3018 free(elm); 3019 /* 3020 * We must restart the list traversal after every fini call 3021 * because a dlclose() call from the fini function or from 3022 * another thread might have modified the reference counts. 3023 */ 3024 break; 3025 } 3026 } while (elm != NULL); 3027 errmsg_restore(saved_msg); 3028 } 3029 3030 /* 3031 * Call the initialization functions for each of the objects in 3032 * "list". All of the objects are expected to have non-NULL init 3033 * functions. 3034 */ 3035 static void 3036 objlist_call_init(Objlist *list, RtldLockState *lockstate) 3037 { 3038 Objlist_Entry *elm; 3039 Obj_Entry *obj; 3040 struct dlerror_save *saved_msg; 3041 Elf_Addr *init_addr; 3042 void (*reg)(void (*)(void)); 3043 int index; 3044 3045 /* 3046 * Clean init_scanned flag so that objects can be rechecked and 3047 * possibly initialized earlier if any of vectors called below 3048 * cause the change by using dlopen. 3049 */ 3050 TAILQ_FOREACH(obj, &obj_list, next) { 3051 if (obj->marker) 3052 continue; 3053 obj->init_scanned = false; 3054 } 3055 3056 /* 3057 * Preserve the current error message since an init function might 3058 * call into the dynamic linker and overwrite it. 3059 */ 3060 saved_msg = errmsg_save(); 3061 STAILQ_FOREACH(elm, list, link) { 3062 if (elm->obj->init_done) /* Initialized early. */ 3063 continue; 3064 /* 3065 * Race: other thread might try to use this object before current 3066 * one completes the initialization. Not much can be done here 3067 * without better locking. 3068 */ 3069 elm->obj->init_done = true; 3070 hold_object(elm->obj); 3071 reg = NULL; 3072 if (elm->obj == obj_main && obj_main->crt_no_init) { 3073 reg = (void (*)(void (*)(void)))get_program_var_addr( 3074 "__libc_atexit", lockstate); 3075 } 3076 lock_release(rtld_bind_lock, lockstate); 3077 if (reg != NULL) { 3078 reg(rtld_exit); 3079 rtld_exit_ptr = rtld_nop_exit; 3080 } 3081 3082 /* 3083 * It is legal to have both DT_INIT and DT_INIT_ARRAY defined. 3084 * When this happens, DT_INIT is processed first. 3085 */ 3086 if (elm->obj->init != (Elf_Addr)NULL) { 3087 dbg("calling init function for %s at %p", elm->obj->path, 3088 (void *)elm->obj->init); 3089 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, (void *)elm->obj->init, 3090 0, 0, elm->obj->path); 3091 call_init_pointer(elm->obj, elm->obj->init); 3092 } 3093 init_addr = (Elf_Addr *)elm->obj->init_array; 3094 if (init_addr != NULL) { 3095 for (index = 0; index < elm->obj->init_array_num; index++) { 3096 if (init_addr[index] != 0 && init_addr[index] != 1) { 3097 dbg("calling init function for %s at %p", elm->obj->path, 3098 (void *)init_addr[index]); 3099 LD_UTRACE(UTRACE_INIT_CALL, elm->obj, 3100 (void *)init_addr[index], 0, 0, elm->obj->path); 3101 call_init_pointer(elm->obj, init_addr[index]); 3102 } 3103 } 3104 } 3105 wlock_acquire(rtld_bind_lock, lockstate); 3106 unhold_object(elm->obj); 3107 } 3108 errmsg_restore(saved_msg); 3109 } 3110 3111 static void 3112 objlist_clear(Objlist *list) 3113 { 3114 Objlist_Entry *elm; 3115 3116 while (!STAILQ_EMPTY(list)) { 3117 elm = STAILQ_FIRST(list); 3118 STAILQ_REMOVE_HEAD(list, link); 3119 free(elm); 3120 } 3121 } 3122 3123 static Objlist_Entry * 3124 objlist_find(Objlist *list, const Obj_Entry *obj) 3125 { 3126 Objlist_Entry *elm; 3127 3128 STAILQ_FOREACH(elm, list, link) 3129 if (elm->obj == obj) 3130 return elm; 3131 return (NULL); 3132 } 3133 3134 static void 3135 objlist_init(Objlist *list) 3136 { 3137 STAILQ_INIT(list); 3138 } 3139 3140 static void 3141 objlist_push_head(Objlist *list, Obj_Entry *obj) 3142 { 3143 Objlist_Entry *elm; 3144 3145 elm = NEW(Objlist_Entry); 3146 elm->obj = obj; 3147 STAILQ_INSERT_HEAD(list, elm, link); 3148 } 3149 3150 static void 3151 objlist_push_tail(Objlist *list, Obj_Entry *obj) 3152 { 3153 Objlist_Entry *elm; 3154 3155 elm = NEW(Objlist_Entry); 3156 elm->obj = obj; 3157 STAILQ_INSERT_TAIL(list, elm, link); 3158 } 3159 3160 static void 3161 objlist_put_after(Objlist *list, Obj_Entry *listobj, Obj_Entry *obj) 3162 { 3163 Objlist_Entry *elm, *listelm; 3164 3165 STAILQ_FOREACH(listelm, list, link) { 3166 if (listelm->obj == listobj) 3167 break; 3168 } 3169 elm = NEW(Objlist_Entry); 3170 elm->obj = obj; 3171 if (listelm != NULL) 3172 STAILQ_INSERT_AFTER(list, listelm, elm, link); 3173 else 3174 STAILQ_INSERT_TAIL(list, elm, link); 3175 } 3176 3177 static void 3178 objlist_remove(Objlist *list, Obj_Entry *obj) 3179 { 3180 Objlist_Entry *elm; 3181 3182 if ((elm = objlist_find(list, obj)) != NULL) { 3183 STAILQ_REMOVE(list, elm, Struct_Objlist_Entry, link); 3184 free(elm); 3185 } 3186 } 3187 3188 /* 3189 * Relocate dag rooted in the specified object. 3190 * Returns 0 on success, or -1 on failure. 3191 */ 3192 3193 static int 3194 relocate_object_dag(Obj_Entry *root, bool bind_now, Obj_Entry *rtldobj, 3195 int flags, RtldLockState *lockstate) 3196 { 3197 Objlist_Entry *elm; 3198 int error; 3199 3200 error = 0; 3201 STAILQ_FOREACH(elm, &root->dagmembers, link) { 3202 error = relocate_object(elm->obj, bind_now, rtldobj, flags, 3203 lockstate); 3204 if (error == -1) 3205 break; 3206 } 3207 return (error); 3208 } 3209 3210 /* 3211 * Prepare for, or clean after, relocating an object marked with 3212 * DT_TEXTREL or DF_TEXTREL. Before relocating, all read-only 3213 * segments are remapped read-write. After relocations are done, the 3214 * segment's permissions are returned back to the modes specified in 3215 * the phdrs. If any relocation happened, or always for wired 3216 * program, COW is triggered. 3217 */ 3218 static int 3219 reloc_textrel_prot(Obj_Entry *obj, bool before) 3220 { 3221 const Elf_Phdr *ph; 3222 void *base; 3223 size_t l, sz; 3224 int prot; 3225 3226 for (l = obj->phsize / sizeof(*ph), ph = obj->phdr; l > 0; 3227 l--, ph++) { 3228 if (ph->p_type != PT_LOAD || (ph->p_flags & PF_W) != 0) 3229 continue; 3230 base = obj->relocbase + rtld_trunc_page(ph->p_vaddr); 3231 sz = rtld_round_page(ph->p_vaddr + ph->p_filesz) - 3232 rtld_trunc_page(ph->p_vaddr); 3233 prot = before ? (PROT_READ | PROT_WRITE) : 3234 convert_prot(ph->p_flags); 3235 if (mprotect(base, sz, prot) == -1) { 3236 _rtld_error("%s: Cannot write-%sable text segment: %s", 3237 obj->path, before ? "en" : "dis", 3238 rtld_strerror(errno)); 3239 return (-1); 3240 } 3241 } 3242 return (0); 3243 } 3244 3245 /* Process RELR relative relocations. */ 3246 static void 3247 reloc_relr(Obj_Entry *obj) 3248 { 3249 const Elf_Relr *relr, *relrlim; 3250 Elf_Addr *where; 3251 3252 relrlim = (const Elf_Relr *)((const char *)obj->relr + obj->relrsize); 3253 for (relr = obj->relr; relr < relrlim; relr++) { 3254 Elf_Relr entry = *relr; 3255 3256 if ((entry & 1) == 0) { 3257 where = (Elf_Addr *)(obj->relocbase + entry); 3258 *where++ += (Elf_Addr)obj->relocbase; 3259 } else { 3260 for (long i = 0; (entry >>= 1) != 0; i++) 3261 if ((entry & 1) != 0) 3262 where[i] += (Elf_Addr)obj->relocbase; 3263 where += CHAR_BIT * sizeof(Elf_Relr) - 1; 3264 } 3265 } 3266 } 3267 3268 /* 3269 * Relocate single object. 3270 * Returns 0 on success, or -1 on failure. 3271 */ 3272 static int 3273 relocate_object(Obj_Entry *obj, bool bind_now, Obj_Entry *rtldobj, 3274 int flags, RtldLockState *lockstate) 3275 { 3276 3277 if (obj->relocated) 3278 return (0); 3279 obj->relocated = true; 3280 if (obj != rtldobj) 3281 dbg("relocating \"%s\"", obj->path); 3282 3283 if (obj->symtab == NULL || obj->strtab == NULL || 3284 !(obj->valid_hash_sysv || obj->valid_hash_gnu)) 3285 dbg("object %s has no run-time symbol table", obj->path); 3286 3287 /* There are relocations to the write-protected text segment. */ 3288 if (obj->textrel && reloc_textrel_prot(obj, true) != 0) 3289 return (-1); 3290 3291 /* Process the non-PLT non-IFUNC relocations. */ 3292 if (reloc_non_plt(obj, rtldobj, flags, lockstate)) 3293 return (-1); 3294 reloc_relr(obj); 3295 3296 /* Re-protected the text segment. */ 3297 if (obj->textrel && reloc_textrel_prot(obj, false) != 0) 3298 return (-1); 3299 3300 /* Set the special PLT or GOT entries. */ 3301 init_pltgot(obj); 3302 3303 /* Process the PLT relocations. */ 3304 if (reloc_plt(obj, flags, lockstate) == -1) 3305 return (-1); 3306 /* Relocate the jump slots if we are doing immediate binding. */ 3307 if ((obj->bind_now || bind_now) && reloc_jmpslots(obj, flags, 3308 lockstate) == -1) 3309 return (-1); 3310 3311 if (!obj->mainprog && obj_enforce_relro(obj) == -1) 3312 return (-1); 3313 3314 /* 3315 * Set up the magic number and version in the Obj_Entry. These 3316 * were checked in the crt1.o from the original ElfKit, so we 3317 * set them for backward compatibility. 3318 */ 3319 obj->magic = RTLD_MAGIC; 3320 obj->version = RTLD_VERSION; 3321 3322 return (0); 3323 } 3324 3325 /* 3326 * Relocate newly-loaded shared objects. The argument is a pointer to 3327 * the Obj_Entry for the first such object. All objects from the first 3328 * to the end of the list of objects are relocated. Returns 0 on success, 3329 * or -1 on failure. 3330 */ 3331 static int 3332 relocate_objects(Obj_Entry *first, bool bind_now, Obj_Entry *rtldobj, 3333 int flags, RtldLockState *lockstate) 3334 { 3335 Obj_Entry *obj; 3336 int error; 3337 3338 for (error = 0, obj = first; obj != NULL; 3339 obj = TAILQ_NEXT(obj, next)) { 3340 if (obj->marker) 3341 continue; 3342 error = relocate_object(obj, bind_now, rtldobj, flags, 3343 lockstate); 3344 if (error == -1) 3345 break; 3346 } 3347 return (error); 3348 } 3349 3350 /* 3351 * The handling of R_MACHINE_IRELATIVE relocations and jumpslots 3352 * referencing STT_GNU_IFUNC symbols is postponed till the other 3353 * relocations are done. The indirect functions specified as 3354 * ifunc are allowed to call other symbols, so we need to have 3355 * objects relocated before asking for resolution from indirects. 3356 * 3357 * The R_MACHINE_IRELATIVE slots are resolved in greedy fashion, 3358 * instead of the usual lazy handling of PLT slots. It is 3359 * consistent with how GNU does it. 3360 */ 3361 static int 3362 resolve_object_ifunc(Obj_Entry *obj, bool bind_now, int flags, 3363 RtldLockState *lockstate) 3364 { 3365 3366 if (obj->ifuncs_resolved) 3367 return (0); 3368 obj->ifuncs_resolved = true; 3369 if (!obj->irelative && !obj->irelative_nonplt && 3370 !((obj->bind_now || bind_now) && obj->gnu_ifunc) && 3371 !obj->non_plt_gnu_ifunc) 3372 return (0); 3373 if (obj_disable_relro(obj) == -1 || 3374 (obj->irelative && reloc_iresolve(obj, lockstate) == -1) || 3375 (obj->irelative_nonplt && reloc_iresolve_nonplt(obj, 3376 lockstate) == -1) || 3377 ((obj->bind_now || bind_now) && obj->gnu_ifunc && 3378 reloc_gnu_ifunc(obj, flags, lockstate) == -1) || 3379 (obj->non_plt_gnu_ifunc && reloc_non_plt(obj, &obj_rtld, 3380 flags | SYMLOOK_IFUNC, lockstate) == -1) || 3381 obj_enforce_relro(obj) == -1) 3382 return (-1); 3383 return (0); 3384 } 3385 3386 static int 3387 initlist_objects_ifunc(Objlist *list, bool bind_now, int flags, 3388 RtldLockState *lockstate) 3389 { 3390 Objlist_Entry *elm; 3391 Obj_Entry *obj; 3392 3393 STAILQ_FOREACH(elm, list, link) { 3394 obj = elm->obj; 3395 if (obj->marker) 3396 continue; 3397 if (resolve_object_ifunc(obj, bind_now, flags, 3398 lockstate) == -1) 3399 return (-1); 3400 } 3401 return (0); 3402 } 3403 3404 /* 3405 * Cleanup procedure. It will be called (by the atexit mechanism) just 3406 * before the process exits. 3407 */ 3408 static void 3409 rtld_exit(void) 3410 { 3411 RtldLockState lockstate; 3412 3413 wlock_acquire(rtld_bind_lock, &lockstate); 3414 dbg("rtld_exit()"); 3415 objlist_call_fini(&list_fini, NULL, &lockstate); 3416 /* No need to remove the items from the list, since we are exiting. */ 3417 if (!libmap_disable) 3418 lm_fini(); 3419 lock_release(rtld_bind_lock, &lockstate); 3420 } 3421 3422 static void 3423 rtld_nop_exit(void) 3424 { 3425 } 3426 3427 /* 3428 * Iterate over a search path, translate each element, and invoke the 3429 * callback on the result. 3430 */ 3431 static void * 3432 path_enumerate(const char *path, path_enum_proc callback, 3433 const char *refobj_path, void *arg) 3434 { 3435 const char *trans; 3436 if (path == NULL) 3437 return (NULL); 3438 3439 path += strspn(path, ":;"); 3440 while (*path != '\0') { 3441 size_t len; 3442 char *res; 3443 3444 len = strcspn(path, ":;"); 3445 trans = lm_findn(refobj_path, path, len); 3446 if (trans) 3447 res = callback(trans, strlen(trans), arg); 3448 else 3449 res = callback(path, len, arg); 3450 3451 if (res != NULL) 3452 return (res); 3453 3454 path += len; 3455 path += strspn(path, ":;"); 3456 } 3457 3458 return (NULL); 3459 } 3460 3461 struct try_library_args { 3462 const char *name; 3463 size_t namelen; 3464 char *buffer; 3465 size_t buflen; 3466 int fd; 3467 }; 3468 3469 static void * 3470 try_library_path(const char *dir, size_t dirlen, void *param) 3471 { 3472 struct try_library_args *arg; 3473 int fd; 3474 3475 arg = param; 3476 if (*dir == '/' || trust) { 3477 char *pathname; 3478 3479 if (dirlen + 1 + arg->namelen + 1 > arg->buflen) 3480 return (NULL); 3481 3482 pathname = arg->buffer; 3483 strncpy(pathname, dir, dirlen); 3484 pathname[dirlen] = '/'; 3485 strcpy(pathname + dirlen + 1, arg->name); 3486 3487 dbg(" Trying \"%s\"", pathname); 3488 fd = open(pathname, O_RDONLY | O_CLOEXEC | O_VERIFY); 3489 if (fd >= 0) { 3490 dbg(" Opened \"%s\", fd %d", pathname, fd); 3491 pathname = xmalloc(dirlen + 1 + arg->namelen + 1); 3492 strcpy(pathname, arg->buffer); 3493 arg->fd = fd; 3494 return (pathname); 3495 } else { 3496 dbg(" Failed to open \"%s\": %s", 3497 pathname, rtld_strerror(errno)); 3498 } 3499 } 3500 return (NULL); 3501 } 3502 3503 static char * 3504 search_library_path(const char *name, const char *path, 3505 const char *refobj_path, int *fdp) 3506 { 3507 char *p; 3508 struct try_library_args arg; 3509 3510 if (path == NULL) 3511 return (NULL); 3512 3513 arg.name = name; 3514 arg.namelen = strlen(name); 3515 arg.buffer = xmalloc(PATH_MAX); 3516 arg.buflen = PATH_MAX; 3517 arg.fd = -1; 3518 3519 p = path_enumerate(path, try_library_path, refobj_path, &arg); 3520 *fdp = arg.fd; 3521 3522 free(arg.buffer); 3523 3524 return (p); 3525 } 3526 3527 3528 /* 3529 * Finds the library with the given name using the directory descriptors 3530 * listed in the LD_LIBRARY_PATH_FDS environment variable. 3531 * 3532 * Returns a freshly-opened close-on-exec file descriptor for the library, 3533 * or -1 if the library cannot be found. 3534 */ 3535 static char * 3536 search_library_pathfds(const char *name, const char *path, int *fdp) 3537 { 3538 char *envcopy, *fdstr, *found, *last_token; 3539 size_t len; 3540 int dirfd, fd; 3541 3542 dbg("%s('%s', '%s', fdp)", __func__, name, path); 3543 3544 /* Don't load from user-specified libdirs into setuid binaries. */ 3545 if (!trust) 3546 return (NULL); 3547 3548 /* We can't do anything if LD_LIBRARY_PATH_FDS isn't set. */ 3549 if (path == NULL) 3550 return (NULL); 3551 3552 /* LD_LIBRARY_PATH_FDS only works with relative paths. */ 3553 if (name[0] == '/') { 3554 dbg("Absolute path (%s) passed to %s", name, __func__); 3555 return (NULL); 3556 } 3557 3558 /* 3559 * Use strtok_r() to walk the FD:FD:FD list. This requires a local 3560 * copy of the path, as strtok_r rewrites separator tokens 3561 * with '\0'. 3562 */ 3563 found = NULL; 3564 envcopy = xstrdup(path); 3565 for (fdstr = strtok_r(envcopy, ":", &last_token); fdstr != NULL; 3566 fdstr = strtok_r(NULL, ":", &last_token)) { 3567 dirfd = parse_integer(fdstr); 3568 if (dirfd < 0) { 3569 _rtld_error("failed to parse directory FD: '%s'", 3570 fdstr); 3571 break; 3572 } 3573 fd = __sys_openat(dirfd, name, O_RDONLY | O_CLOEXEC | O_VERIFY); 3574 if (fd >= 0) { 3575 *fdp = fd; 3576 len = strlen(fdstr) + strlen(name) + 3; 3577 found = xmalloc(len); 3578 if (rtld_snprintf(found, len, "#%d/%s", dirfd, name) < 0) { 3579 _rtld_error("error generating '%d/%s'", 3580 dirfd, name); 3581 rtld_die(); 3582 } 3583 dbg("open('%s') => %d", found, fd); 3584 break; 3585 } 3586 } 3587 free(envcopy); 3588 3589 return (found); 3590 } 3591 3592 3593 int 3594 dlclose(void *handle) 3595 { 3596 RtldLockState lockstate; 3597 int error; 3598 3599 wlock_acquire(rtld_bind_lock, &lockstate); 3600 error = dlclose_locked(handle, &lockstate); 3601 lock_release(rtld_bind_lock, &lockstate); 3602 return (error); 3603 } 3604 3605 static int 3606 dlclose_locked(void *handle, RtldLockState *lockstate) 3607 { 3608 Obj_Entry *root; 3609 3610 root = dlcheck(handle); 3611 if (root == NULL) 3612 return (-1); 3613 LD_UTRACE(UTRACE_DLCLOSE_START, handle, NULL, 0, root->dl_refcount, 3614 root->path); 3615 3616 /* Unreference the object and its dependencies. */ 3617 root->dl_refcount--; 3618 3619 if (root->refcount == 1) { 3620 /* 3621 * The object will be no longer referenced, so we must unload it. 3622 * First, call the fini functions. 3623 */ 3624 objlist_call_fini(&list_fini, root, lockstate); 3625 3626 unref_dag(root); 3627 3628 /* Finish cleaning up the newly-unreferenced objects. */ 3629 GDB_STATE(RT_DELETE,&root->linkmap); 3630 unload_object(root, lockstate); 3631 GDB_STATE(RT_CONSISTENT,NULL); 3632 } else 3633 unref_dag(root); 3634 3635 LD_UTRACE(UTRACE_DLCLOSE_STOP, handle, NULL, 0, 0, NULL); 3636 return (0); 3637 } 3638 3639 char * 3640 dlerror(void) 3641 { 3642 if (*(lockinfo.dlerror_seen()) != 0) 3643 return (NULL); 3644 *lockinfo.dlerror_seen() = 1; 3645 return (lockinfo.dlerror_loc()); 3646 } 3647 3648 /* 3649 * This function is deprecated and has no effect. 3650 */ 3651 void 3652 dllockinit(void *context, 3653 void *(*_lock_create)(void *context) __unused, 3654 void (*_rlock_acquire)(void *lock) __unused, 3655 void (*_wlock_acquire)(void *lock) __unused, 3656 void (*_lock_release)(void *lock) __unused, 3657 void (*_lock_destroy)(void *lock) __unused, 3658 void (*context_destroy)(void *context)) 3659 { 3660 static void *cur_context; 3661 static void (*cur_context_destroy)(void *); 3662 3663 /* Just destroy the context from the previous call, if necessary. */ 3664 if (cur_context_destroy != NULL) 3665 cur_context_destroy(cur_context); 3666 cur_context = context; 3667 cur_context_destroy = context_destroy; 3668 } 3669 3670 void * 3671 dlopen(const char *name, int mode) 3672 { 3673 3674 return (rtld_dlopen(name, -1, mode)); 3675 } 3676 3677 void * 3678 fdlopen(int fd, int mode) 3679 { 3680 3681 return (rtld_dlopen(NULL, fd, mode)); 3682 } 3683 3684 static void * 3685 rtld_dlopen(const char *name, int fd, int mode) 3686 { 3687 RtldLockState lockstate; 3688 int lo_flags; 3689 3690 LD_UTRACE(UTRACE_DLOPEN_START, NULL, NULL, 0, mode, name); 3691 ld_tracing = (mode & RTLD_TRACE) == 0 ? NULL : "1"; 3692 if (ld_tracing != NULL) { 3693 rlock_acquire(rtld_bind_lock, &lockstate); 3694 if (sigsetjmp(lockstate.env, 0) != 0) 3695 lock_upgrade(rtld_bind_lock, &lockstate); 3696 environ = __DECONST(char **, *get_program_var_addr("environ", &lockstate)); 3697 lock_release(rtld_bind_lock, &lockstate); 3698 } 3699 lo_flags = RTLD_LO_DLOPEN; 3700 if (mode & RTLD_NODELETE) 3701 lo_flags |= RTLD_LO_NODELETE; 3702 if (mode & RTLD_NOLOAD) 3703 lo_flags |= RTLD_LO_NOLOAD; 3704 if (mode & RTLD_DEEPBIND) 3705 lo_flags |= RTLD_LO_DEEPBIND; 3706 if (ld_tracing != NULL) 3707 lo_flags |= RTLD_LO_TRACE | RTLD_LO_IGNSTLS; 3708 3709 return (dlopen_object(name, fd, obj_main, lo_flags, 3710 mode & (RTLD_MODEMASK | RTLD_GLOBAL), NULL)); 3711 } 3712 3713 static void 3714 dlopen_cleanup(Obj_Entry *obj, RtldLockState *lockstate) 3715 { 3716 3717 obj->dl_refcount--; 3718 unref_dag(obj); 3719 if (obj->refcount == 0) 3720 unload_object(obj, lockstate); 3721 } 3722 3723 static Obj_Entry * 3724 dlopen_object(const char *name, int fd, Obj_Entry *refobj, int lo_flags, 3725 int mode, RtldLockState *lockstate) 3726 { 3727 Obj_Entry *obj; 3728 Objlist initlist; 3729 RtldLockState mlockstate; 3730 int result; 3731 3732 dbg("dlopen_object name \"%s\" fd %d refobj \"%s\" lo_flags %#x mode %#x", 3733 name != NULL ? name : "<null>", fd, refobj == NULL ? "<null>" : 3734 refobj->path, lo_flags, mode); 3735 objlist_init(&initlist); 3736 3737 if (lockstate == NULL && !(lo_flags & RTLD_LO_EARLY)) { 3738 wlock_acquire(rtld_bind_lock, &mlockstate); 3739 lockstate = &mlockstate; 3740 } 3741 GDB_STATE(RT_ADD,NULL); 3742 3743 obj = NULL; 3744 if (name == NULL && fd == -1) { 3745 obj = obj_main; 3746 obj->refcount++; 3747 } else { 3748 obj = load_object(name, fd, refobj, lo_flags); 3749 } 3750 3751 if (obj) { 3752 obj->dl_refcount++; 3753 if (mode & RTLD_GLOBAL && objlist_find(&list_global, obj) == NULL) 3754 objlist_push_tail(&list_global, obj); 3755 3756 if (!obj->init_done) { 3757 /* We loaded something new and have to init something. */ 3758 if ((lo_flags & RTLD_LO_DEEPBIND) != 0) 3759 obj->deepbind = true; 3760 result = 0; 3761 if ((lo_flags & (RTLD_LO_EARLY | RTLD_LO_IGNSTLS)) == 0 && 3762 obj->static_tls && !allocate_tls_offset(obj)) { 3763 _rtld_error("%s: No space available " 3764 "for static Thread Local Storage", obj->path); 3765 result = -1; 3766 } 3767 if (result != -1) 3768 result = load_needed_objects(obj, lo_flags & (RTLD_LO_DLOPEN | 3769 RTLD_LO_EARLY | RTLD_LO_IGNSTLS | RTLD_LO_TRACE)); 3770 init_dag(obj); 3771 ref_dag(obj); 3772 if (result != -1) 3773 result = rtld_verify_versions(&obj->dagmembers); 3774 if (result != -1 && ld_tracing) 3775 goto trace; 3776 if (result == -1 || relocate_object_dag(obj, 3777 (mode & RTLD_MODEMASK) == RTLD_NOW, &obj_rtld, 3778 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0, 3779 lockstate) == -1) { 3780 dlopen_cleanup(obj, lockstate); 3781 obj = NULL; 3782 } else if (lo_flags & RTLD_LO_EARLY) { 3783 /* 3784 * Do not call the init functions for early loaded 3785 * filtees. The image is still not initialized enough 3786 * for them to work. 3787 * 3788 * Our object is found by the global object list and 3789 * will be ordered among all init calls done right 3790 * before transferring control to main. 3791 */ 3792 } else { 3793 /* Make list of init functions to call. */ 3794 initlist_add_objects(obj, obj, &initlist); 3795 } 3796 /* 3797 * Process all no_delete or global objects here, given 3798 * them own DAGs to prevent their dependencies from being 3799 * unloaded. This has to be done after we have loaded all 3800 * of the dependencies, so that we do not miss any. 3801 */ 3802 if (obj != NULL) 3803 process_z(obj); 3804 } else { 3805 /* 3806 * Bump the reference counts for objects on this DAG. If 3807 * this is the first dlopen() call for the object that was 3808 * already loaded as a dependency, initialize the dag 3809 * starting at it. 3810 */ 3811 init_dag(obj); 3812 ref_dag(obj); 3813 3814 if ((lo_flags & RTLD_LO_TRACE) != 0) 3815 goto trace; 3816 } 3817 if (obj != NULL && ((lo_flags & RTLD_LO_NODELETE) != 0 || 3818 obj->z_nodelete) && !obj->ref_nodel) { 3819 dbg("obj %s nodelete", obj->path); 3820 ref_dag(obj); 3821 obj->z_nodelete = obj->ref_nodel = true; 3822 } 3823 } 3824 3825 LD_UTRACE(UTRACE_DLOPEN_STOP, obj, NULL, 0, obj ? obj->dl_refcount : 0, 3826 name); 3827 GDB_STATE(RT_CONSISTENT,obj ? &obj->linkmap : NULL); 3828 3829 if ((lo_flags & RTLD_LO_EARLY) == 0) { 3830 map_stacks_exec(lockstate); 3831 if (obj != NULL) 3832 distribute_static_tls(&initlist, lockstate); 3833 } 3834 3835 if (initlist_objects_ifunc(&initlist, (mode & RTLD_MODEMASK) == RTLD_NOW, 3836 (lo_flags & RTLD_LO_EARLY) ? SYMLOOK_EARLY : 0, 3837 lockstate) == -1) { 3838 objlist_clear(&initlist); 3839 dlopen_cleanup(obj, lockstate); 3840 if (lockstate == &mlockstate) 3841 lock_release(rtld_bind_lock, lockstate); 3842 return (NULL); 3843 } 3844 3845 if (!(lo_flags & RTLD_LO_EARLY)) { 3846 /* Call the init functions. */ 3847 objlist_call_init(&initlist, lockstate); 3848 } 3849 objlist_clear(&initlist); 3850 if (lockstate == &mlockstate) 3851 lock_release(rtld_bind_lock, lockstate); 3852 return (obj); 3853 trace: 3854 trace_loaded_objects(obj, false); 3855 if (lockstate == &mlockstate) 3856 lock_release(rtld_bind_lock, lockstate); 3857 exit(0); 3858 } 3859 3860 static void * 3861 do_dlsym(void *handle, const char *name, void *retaddr, const Ver_Entry *ve, 3862 int flags) 3863 { 3864 DoneList donelist; 3865 const Obj_Entry *obj, *defobj; 3866 const Elf_Sym *def; 3867 SymLook req; 3868 RtldLockState lockstate; 3869 tls_index ti; 3870 void *sym; 3871 int res; 3872 3873 def = NULL; 3874 defobj = NULL; 3875 symlook_init(&req, name); 3876 req.ventry = ve; 3877 req.flags = flags | SYMLOOK_IN_PLT; 3878 req.lockstate = &lockstate; 3879 3880 LD_UTRACE(UTRACE_DLSYM_START, handle, NULL, 0, 0, name); 3881 rlock_acquire(rtld_bind_lock, &lockstate); 3882 if (sigsetjmp(lockstate.env, 0) != 0) 3883 lock_upgrade(rtld_bind_lock, &lockstate); 3884 if (handle == NULL || handle == RTLD_NEXT || 3885 handle == RTLD_DEFAULT || handle == RTLD_SELF) { 3886 3887 if ((obj = obj_from_addr(retaddr)) == NULL) { 3888 _rtld_error("Cannot determine caller's shared object"); 3889 lock_release(rtld_bind_lock, &lockstate); 3890 LD_UTRACE(UTRACE_DLSYM_STOP, handle, NULL, 0, 0, name); 3891 return (NULL); 3892 } 3893 if (handle == NULL) { /* Just the caller's shared object. */ 3894 res = symlook_obj(&req, obj); 3895 if (res == 0) { 3896 def = req.sym_out; 3897 defobj = req.defobj_out; 3898 } 3899 } else if (handle == RTLD_NEXT || /* Objects after caller's */ 3900 handle == RTLD_SELF) { /* ... caller included */ 3901 if (handle == RTLD_NEXT) 3902 obj = globallist_next(obj); 3903 for (; obj != NULL; obj = TAILQ_NEXT(obj, next)) { 3904 if (obj->marker) 3905 continue; 3906 res = symlook_obj(&req, obj); 3907 if (res == 0) { 3908 if (def == NULL || (ld_dynamic_weak && 3909 ELF_ST_BIND(req.sym_out->st_info) != STB_WEAK)) { 3910 def = req.sym_out; 3911 defobj = req.defobj_out; 3912 if (!ld_dynamic_weak || 3913 ELF_ST_BIND(def->st_info) != STB_WEAK) 3914 break; 3915 } 3916 } 3917 } 3918 /* 3919 * Search the dynamic linker itself, and possibly resolve the 3920 * symbol from there. This is how the application links to 3921 * dynamic linker services such as dlopen. 3922 * Note that we ignore ld_dynamic_weak == false case, 3923 * always overriding weak symbols by rtld definitions. 3924 */ 3925 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) { 3926 res = symlook_obj(&req, &obj_rtld); 3927 if (res == 0) { 3928 def = req.sym_out; 3929 defobj = req.defobj_out; 3930 } 3931 } 3932 } else { 3933 assert(handle == RTLD_DEFAULT); 3934 res = symlook_default(&req, obj); 3935 if (res == 0) { 3936 defobj = req.defobj_out; 3937 def = req.sym_out; 3938 } 3939 } 3940 } else { 3941 if ((obj = dlcheck(handle)) == NULL) { 3942 lock_release(rtld_bind_lock, &lockstate); 3943 LD_UTRACE(UTRACE_DLSYM_STOP, handle, NULL, 0, 0, name); 3944 return (NULL); 3945 } 3946 3947 donelist_init(&donelist); 3948 if (obj->mainprog) { 3949 /* Handle obtained by dlopen(NULL, ...) implies global scope. */ 3950 res = symlook_global(&req, &donelist); 3951 if (res == 0) { 3952 def = req.sym_out; 3953 defobj = req.defobj_out; 3954 } 3955 /* 3956 * Search the dynamic linker itself, and possibly resolve the 3957 * symbol from there. This is how the application links to 3958 * dynamic linker services such as dlopen. 3959 */ 3960 if (def == NULL || ELF_ST_BIND(def->st_info) == STB_WEAK) { 3961 res = symlook_obj(&req, &obj_rtld); 3962 if (res == 0) { 3963 def = req.sym_out; 3964 defobj = req.defobj_out; 3965 } 3966 } 3967 } 3968 else { 3969 /* Search the whole DAG rooted at the given object. */ 3970 res = symlook_list(&req, &obj->dagmembers, &donelist); 3971 if (res == 0) { 3972 def = req.sym_out; 3973 defobj = req.defobj_out; 3974 } 3975 } 3976 } 3977 3978 if (def != NULL) { 3979 lock_release(rtld_bind_lock, &lockstate); 3980 3981 /* 3982 * The value required by the caller is derived from the value 3983 * of the symbol. this is simply the relocated value of the 3984 * symbol. 3985 */ 3986 if (ELF_ST_TYPE(def->st_info) == STT_FUNC) 3987 sym = make_function_pointer(def, defobj); 3988 else if (ELF_ST_TYPE(def->st_info) == STT_GNU_IFUNC) 3989 sym = rtld_resolve_ifunc(defobj, def); 3990 else if (ELF_ST_TYPE(def->st_info) == STT_TLS) { 3991 ti.ti_module = defobj->tlsindex; 3992 ti.ti_offset = def->st_value; 3993 sym = __tls_get_addr(&ti); 3994 } else 3995 sym = defobj->relocbase + def->st_value; 3996 LD_UTRACE(UTRACE_DLSYM_STOP, handle, sym, 0, 0, name); 3997 return (sym); 3998 } 3999 4000 _rtld_error("Undefined symbol \"%s%s%s\"", name, ve != NULL ? "@" : "", 4001 ve != NULL ? ve->name : ""); 4002 lock_release(rtld_bind_lock, &lockstate); 4003 LD_UTRACE(UTRACE_DLSYM_STOP, handle, NULL, 0, 0, name); 4004 return (NULL); 4005 } 4006 4007 void * 4008 dlsym(void *handle, const char *name) 4009 { 4010 return (do_dlsym(handle, name, __builtin_return_address(0), NULL, 4011 SYMLOOK_DLSYM)); 4012 } 4013 4014 dlfunc_t 4015 dlfunc(void *handle, const char *name) 4016 { 4017 union { 4018 void *d; 4019 dlfunc_t f; 4020 } rv; 4021 4022 rv.d = do_dlsym(handle, name, __builtin_return_address(0), NULL, 4023 SYMLOOK_DLSYM); 4024 return (rv.f); 4025 } 4026 4027 void * 4028 dlvsym(void *handle, const char *name, const char *version) 4029 { 4030 Ver_Entry ventry; 4031 4032 ventry.name = version; 4033 ventry.file = NULL; 4034 ventry.hash = elf_hash(version); 4035 ventry.flags= 0; 4036 return (do_dlsym(handle, name, __builtin_return_address(0), &ventry, 4037 SYMLOOK_DLSYM)); 4038 } 4039 4040 int 4041 _rtld_addr_phdr(const void *addr, struct dl_phdr_info *phdr_info) 4042 { 4043 const Obj_Entry *obj; 4044 RtldLockState lockstate; 4045 4046 rlock_acquire(rtld_bind_lock, &lockstate); 4047 obj = obj_from_addr(addr); 4048 if (obj == NULL) { 4049 _rtld_error("No shared object contains address"); 4050 lock_release(rtld_bind_lock, &lockstate); 4051 return (0); 4052 } 4053 rtld_fill_dl_phdr_info(obj, phdr_info); 4054 lock_release(rtld_bind_lock, &lockstate); 4055 return (1); 4056 } 4057 4058 int 4059 dladdr(const void *addr, Dl_info *info) 4060 { 4061 const Obj_Entry *obj; 4062 const Elf_Sym *def; 4063 void *symbol_addr; 4064 unsigned long symoffset; 4065 RtldLockState lockstate; 4066 4067 rlock_acquire(rtld_bind_lock, &lockstate); 4068 obj = obj_from_addr(addr); 4069 if (obj == NULL) { 4070 _rtld_error("No shared object contains address"); 4071 lock_release(rtld_bind_lock, &lockstate); 4072 return (0); 4073 } 4074 info->dli_fname = obj->path; 4075 info->dli_fbase = obj->mapbase; 4076 info->dli_saddr = (void *)0; 4077 info->dli_sname = NULL; 4078 4079 /* 4080 * Walk the symbol list looking for the symbol whose address is 4081 * closest to the address sent in. 4082 */ 4083 for (symoffset = 0; symoffset < obj->dynsymcount; symoffset++) { 4084 def = obj->symtab + symoffset; 4085 4086 /* 4087 * For skip the symbol if st_shndx is either SHN_UNDEF or 4088 * SHN_COMMON. 4089 */ 4090 if (def->st_shndx == SHN_UNDEF || def->st_shndx == SHN_COMMON) 4091 continue; 4092 4093 /* 4094 * If the symbol is greater than the specified address, or if it 4095 * is further away from addr than the current nearest symbol, 4096 * then reject it. 4097 */ 4098 symbol_addr = obj->relocbase + def->st_value; 4099 if (symbol_addr > addr || symbol_addr < info->dli_saddr) 4100 continue; 4101 4102 /* Update our idea of the nearest symbol. */ 4103 info->dli_sname = obj->strtab + def->st_name; 4104 info->dli_saddr = symbol_addr; 4105 4106 /* Exact match? */ 4107 if (info->dli_saddr == addr) 4108 break; 4109 } 4110 lock_release(rtld_bind_lock, &lockstate); 4111 return (1); 4112 } 4113 4114 int 4115 dlinfo(void *handle, int request, void *p) 4116 { 4117 const Obj_Entry *obj; 4118 RtldLockState lockstate; 4119 int error; 4120 4121 rlock_acquire(rtld_bind_lock, &lockstate); 4122 4123 if (handle == NULL || handle == RTLD_SELF) { 4124 void *retaddr; 4125 4126 retaddr = __builtin_return_address(0); /* __GNUC__ only */ 4127 if ((obj = obj_from_addr(retaddr)) == NULL) 4128 _rtld_error("Cannot determine caller's shared object"); 4129 } else 4130 obj = dlcheck(handle); 4131 4132 if (obj == NULL) { 4133 lock_release(rtld_bind_lock, &lockstate); 4134 return (-1); 4135 } 4136 4137 error = 0; 4138 switch (request) { 4139 case RTLD_DI_LINKMAP: 4140 *((struct link_map const **)p) = &obj->linkmap; 4141 break; 4142 case RTLD_DI_ORIGIN: 4143 error = rtld_dirname(obj->path, p); 4144 break; 4145 4146 case RTLD_DI_SERINFOSIZE: 4147 case RTLD_DI_SERINFO: 4148 error = do_search_info(obj, request, (struct dl_serinfo *)p); 4149 break; 4150 4151 default: 4152 _rtld_error("Invalid request %d passed to dlinfo()", request); 4153 error = -1; 4154 } 4155 4156 lock_release(rtld_bind_lock, &lockstate); 4157 4158 return (error); 4159 } 4160 4161 static void 4162 rtld_fill_dl_phdr_info(const Obj_Entry *obj, struct dl_phdr_info *phdr_info) 4163 { 4164 uintptr_t **dtvp; 4165 4166 phdr_info->dlpi_addr = (Elf_Addr)obj->relocbase; 4167 phdr_info->dlpi_name = obj->path; 4168 phdr_info->dlpi_phdr = obj->phdr; 4169 phdr_info->dlpi_phnum = obj->phsize / sizeof(obj->phdr[0]); 4170 phdr_info->dlpi_tls_modid = obj->tlsindex; 4171 dtvp = &_tcb_get()->tcb_dtv; 4172 phdr_info->dlpi_tls_data = (char *)tls_get_addr_slow(dtvp, 4173 obj->tlsindex, 0, true) + TLS_DTV_OFFSET; 4174 phdr_info->dlpi_adds = obj_loads; 4175 phdr_info->dlpi_subs = obj_loads - obj_count; 4176 } 4177 4178 int 4179 dl_iterate_phdr(__dl_iterate_hdr_callback callback, void *param) 4180 { 4181 struct dl_phdr_info phdr_info; 4182 Obj_Entry *obj, marker; 4183 RtldLockState bind_lockstate, phdr_lockstate; 4184 int error; 4185 4186 init_marker(&marker); 4187 error = 0; 4188 4189 wlock_acquire(rtld_phdr_lock, &phdr_lockstate); 4190 wlock_acquire(rtld_bind_lock, &bind_lockstate); 4191 for (obj = globallist_curr(TAILQ_FIRST(&obj_list)); obj != NULL;) { 4192 TAILQ_INSERT_AFTER(&obj_list, obj, &marker, next); 4193 rtld_fill_dl_phdr_info(obj, &phdr_info); 4194 hold_object(obj); 4195 lock_release(rtld_bind_lock, &bind_lockstate); 4196 4197 error = callback(&phdr_info, sizeof phdr_info, param); 4198 4199 wlock_acquire(rtld_bind_lock, &bind_lockstate); 4200 unhold_object(obj); 4201 obj = globallist_next(&marker); 4202 TAILQ_REMOVE(&obj_list, &marker, next); 4203 if (error != 0) { 4204 lock_release(rtld_bind_lock, &bind_lockstate); 4205 lock_release(rtld_phdr_lock, &phdr_lockstate); 4206 return (error); 4207 } 4208 } 4209 4210 if (error == 0) { 4211 rtld_fill_dl_phdr_info(&obj_rtld, &phdr_info); 4212 lock_release(rtld_bind_lock, &bind_lockstate); 4213 error = callback(&phdr_info, sizeof(phdr_info), param); 4214 } 4215 lock_release(rtld_phdr_lock, &phdr_lockstate); 4216 return (error); 4217 } 4218 4219 static void * 4220 fill_search_info(const char *dir, size_t dirlen, void *param) 4221 { 4222 struct fill_search_info_args *arg; 4223 4224 arg = param; 4225 4226 if (arg->request == RTLD_DI_SERINFOSIZE) { 4227 arg->serinfo->dls_cnt ++; 4228 arg->serinfo->dls_size += sizeof(struct dl_serpath) + dirlen + 1; 4229 } else { 4230 struct dl_serpath *s_entry; 4231 4232 s_entry = arg->serpath; 4233 s_entry->dls_name = arg->strspace; 4234 s_entry->dls_flags = arg->flags; 4235 4236 strncpy(arg->strspace, dir, dirlen); 4237 arg->strspace[dirlen] = '\0'; 4238 4239 arg->strspace += dirlen + 1; 4240 arg->serpath++; 4241 } 4242 4243 return (NULL); 4244 } 4245 4246 static int 4247 do_search_info(const Obj_Entry *obj, int request, struct dl_serinfo *info) 4248 { 4249 struct dl_serinfo _info; 4250 struct fill_search_info_args args; 4251 4252 args.request = RTLD_DI_SERINFOSIZE; 4253 args.serinfo = &_info; 4254 4255 _info.dls_size = __offsetof(struct dl_serinfo, dls_serpath); 4256 _info.dls_cnt = 0; 4257 4258 path_enumerate(obj->rpath, fill_search_info, NULL, &args); 4259 path_enumerate(ld_library_path, fill_search_info, NULL, &args); 4260 path_enumerate(obj->runpath, fill_search_info, NULL, &args); 4261 path_enumerate(gethints(obj->z_nodeflib), fill_search_info, NULL, &args); 4262 if (!obj->z_nodeflib) 4263 path_enumerate(ld_standard_library_path, fill_search_info, NULL, &args); 4264 4265 4266 if (request == RTLD_DI_SERINFOSIZE) { 4267 info->dls_size = _info.dls_size; 4268 info->dls_cnt = _info.dls_cnt; 4269 return (0); 4270 } 4271 4272 if (info->dls_cnt != _info.dls_cnt || info->dls_size != _info.dls_size) { 4273 _rtld_error("Uninitialized Dl_serinfo struct passed to dlinfo()"); 4274 return (-1); 4275 } 4276 4277 args.request = RTLD_DI_SERINFO; 4278 args.serinfo = info; 4279 args.serpath = &info->dls_serpath[0]; 4280 args.strspace = (char *)&info->dls_serpath[_info.dls_cnt]; 4281 4282 args.flags = LA_SER_RUNPATH; 4283 if (path_enumerate(obj->rpath, fill_search_info, NULL, &args) != NULL) 4284 return (-1); 4285 4286 args.flags = LA_SER_LIBPATH; 4287 if (path_enumerate(ld_library_path, fill_search_info, NULL, &args) != NULL) 4288 return (-1); 4289 4290 args.flags = LA_SER_RUNPATH; 4291 if (path_enumerate(obj->runpath, fill_search_info, NULL, &args) != NULL) 4292 return (-1); 4293 4294 args.flags = LA_SER_CONFIG; 4295 if (path_enumerate(gethints(obj->z_nodeflib), fill_search_info, NULL, &args) 4296 != NULL) 4297 return (-1); 4298 4299 args.flags = LA_SER_DEFAULT; 4300 if (!obj->z_nodeflib && path_enumerate(ld_standard_library_path, 4301 fill_search_info, NULL, &args) != NULL) 4302 return (-1); 4303 return (0); 4304 } 4305 4306 static int 4307 rtld_dirname(const char *path, char *bname) 4308 { 4309 const char *endp; 4310 4311 /* Empty or NULL string gets treated as "." */ 4312 if (path == NULL || *path == '\0') { 4313 bname[0] = '.'; 4314 bname[1] = '\0'; 4315 return (0); 4316 } 4317 4318 /* Strip trailing slashes */ 4319 endp = path + strlen(path) - 1; 4320 while (endp > path && *endp == '/') 4321 endp--; 4322 4323 /* Find the start of the dir */ 4324 while (endp > path && *endp != '/') 4325 endp--; 4326 4327 /* Either the dir is "/" or there are no slashes */ 4328 if (endp == path) { 4329 bname[0] = *endp == '/' ? '/' : '.'; 4330 bname[1] = '\0'; 4331 return (0); 4332 } else { 4333 do { 4334 endp--; 4335 } while (endp > path && *endp == '/'); 4336 } 4337 4338 if (endp - path + 2 > PATH_MAX) 4339 { 4340 _rtld_error("Filename is too long: %s", path); 4341 return(-1); 4342 } 4343 4344 strncpy(bname, path, endp - path + 1); 4345 bname[endp - path + 1] = '\0'; 4346 return (0); 4347 } 4348 4349 static int 4350 rtld_dirname_abs(const char *path, char *base) 4351 { 4352 char *last; 4353 4354 if (realpath(path, base) == NULL) { 4355 _rtld_error("realpath \"%s\" failed (%s)", path, 4356 rtld_strerror(errno)); 4357 return (-1); 4358 } 4359 dbg("%s -> %s", path, base); 4360 last = strrchr(base, '/'); 4361 if (last == NULL) { 4362 _rtld_error("non-abs result from realpath \"%s\"", path); 4363 return (-1); 4364 } 4365 if (last != base) 4366 *last = '\0'; 4367 return (0); 4368 } 4369 4370 static void 4371 linkmap_add(Obj_Entry *obj) 4372 { 4373 struct link_map *l, *prev; 4374 4375 l = &obj->linkmap; 4376 l->l_name = obj->path; 4377 l->l_base = obj->mapbase; 4378 l->l_ld = obj->dynamic; 4379 l->l_addr = obj->relocbase; 4380 4381 if (r_debug.r_map == NULL) { 4382 r_debug.r_map = l; 4383 return; 4384 } 4385 4386 /* 4387 * Scan to the end of the list, but not past the entry for the 4388 * dynamic linker, which we want to keep at the very end. 4389 */ 4390 for (prev = r_debug.r_map; 4391 prev->l_next != NULL && prev->l_next != &obj_rtld.linkmap; 4392 prev = prev->l_next) 4393 ; 4394 4395 /* Link in the new entry. */ 4396 l->l_prev = prev; 4397 l->l_next = prev->l_next; 4398 if (l->l_next != NULL) 4399 l->l_next->l_prev = l; 4400 prev->l_next = l; 4401 } 4402 4403 static void 4404 linkmap_delete(Obj_Entry *obj) 4405 { 4406 struct link_map *l; 4407 4408 l = &obj->linkmap; 4409 if (l->l_prev == NULL) { 4410 if ((r_debug.r_map = l->l_next) != NULL) 4411 l->l_next->l_prev = NULL; 4412 return; 4413 } 4414 4415 if ((l->l_prev->l_next = l->l_next) != NULL) 4416 l->l_next->l_prev = l->l_prev; 4417 } 4418 4419 /* 4420 * Function for the debugger to set a breakpoint on to gain control. 4421 * 4422 * The two parameters allow the debugger to easily find and determine 4423 * what the runtime loader is doing and to whom it is doing it. 4424 * 4425 * When the loadhook trap is hit (r_debug_state, set at program 4426 * initialization), the arguments can be found on the stack: 4427 * 4428 * +8 struct link_map *m 4429 * +4 struct r_debug *rd 4430 * +0 RetAddr 4431 */ 4432 void 4433 r_debug_state(struct r_debug* rd __unused, struct link_map *m __unused) 4434 { 4435 /* 4436 * The following is a hack to force the compiler to emit calls to 4437 * this function, even when optimizing. If the function is empty, 4438 * the compiler is not obliged to emit any code for calls to it, 4439 * even when marked __noinline. However, gdb depends on those 4440 * calls being made. 4441 */ 4442 __compiler_membar(); 4443 } 4444 4445 /* 4446 * A function called after init routines have completed. This can be used to 4447 * break before a program's entry routine is called, and can be used when 4448 * main is not available in the symbol table. 4449 */ 4450 void 4451 _r_debug_postinit(struct link_map *m __unused) 4452 { 4453 4454 /* See r_debug_state(). */ 4455 __compiler_membar(); 4456 } 4457 4458 static void 4459 release_object(Obj_Entry *obj) 4460 { 4461 4462 if (obj->holdcount > 0) { 4463 obj->unholdfree = true; 4464 return; 4465 } 4466 munmap(obj->mapbase, obj->mapsize); 4467 linkmap_delete(obj); 4468 obj_free(obj); 4469 } 4470 4471 /* 4472 * Get address of the pointer variable in the main program. 4473 * Prefer non-weak symbol over the weak one. 4474 */ 4475 static const void ** 4476 get_program_var_addr(const char *name, RtldLockState *lockstate) 4477 { 4478 SymLook req; 4479 DoneList donelist; 4480 4481 symlook_init(&req, name); 4482 req.lockstate = lockstate; 4483 donelist_init(&donelist); 4484 if (symlook_global(&req, &donelist) != 0) 4485 return (NULL); 4486 if (ELF_ST_TYPE(req.sym_out->st_info) == STT_FUNC) 4487 return ((const void **)make_function_pointer(req.sym_out, 4488 req.defobj_out)); 4489 else if (ELF_ST_TYPE(req.sym_out->st_info) == STT_GNU_IFUNC) 4490 return ((const void **)rtld_resolve_ifunc(req.defobj_out, req.sym_out)); 4491 else 4492 return ((const void **)(req.defobj_out->relocbase + 4493 req.sym_out->st_value)); 4494 } 4495 4496 /* 4497 * Set a pointer variable in the main program to the given value. This 4498 * is used to set key variables such as "environ" before any of the 4499 * init functions are called. 4500 */ 4501 static void 4502 set_program_var(const char *name, const void *value) 4503 { 4504 const void **addr; 4505 4506 if ((addr = get_program_var_addr(name, NULL)) != NULL) { 4507 dbg("\"%s\": *%p <-- %p", name, addr, value); 4508 *addr = value; 4509 } 4510 } 4511 4512 /* 4513 * Search the global objects, including dependencies and main object, 4514 * for the given symbol. 4515 */ 4516 static int 4517 symlook_global(SymLook *req, DoneList *donelist) 4518 { 4519 SymLook req1; 4520 const Objlist_Entry *elm; 4521 int res; 4522 4523 symlook_init_from_req(&req1, req); 4524 4525 /* Search all objects loaded at program start up. */ 4526 if (req->defobj_out == NULL || (ld_dynamic_weak && 4527 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK)) { 4528 res = symlook_list(&req1, &list_main, donelist); 4529 if (res == 0 && (!ld_dynamic_weak || req->defobj_out == NULL || 4530 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) { 4531 req->sym_out = req1.sym_out; 4532 req->defobj_out = req1.defobj_out; 4533 assert(req->defobj_out != NULL); 4534 } 4535 } 4536 4537 /* Search all DAGs whose roots are RTLD_GLOBAL objects. */ 4538 STAILQ_FOREACH(elm, &list_global, link) { 4539 if (req->defobj_out != NULL && (!ld_dynamic_weak || 4540 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)) 4541 break; 4542 res = symlook_list(&req1, &elm->obj->dagmembers, donelist); 4543 if (res == 0 && (req->defobj_out == NULL || 4544 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) { 4545 req->sym_out = req1.sym_out; 4546 req->defobj_out = req1.defobj_out; 4547 assert(req->defobj_out != NULL); 4548 } 4549 } 4550 4551 return (req->sym_out != NULL ? 0 : ESRCH); 4552 } 4553 4554 /* 4555 * Given a symbol name in a referencing object, find the corresponding 4556 * definition of the symbol. Returns a pointer to the symbol, or NULL if 4557 * no definition was found. Returns a pointer to the Obj_Entry of the 4558 * defining object via the reference parameter DEFOBJ_OUT. 4559 */ 4560 static int 4561 symlook_default(SymLook *req, const Obj_Entry *refobj) 4562 { 4563 DoneList donelist; 4564 const Objlist_Entry *elm; 4565 SymLook req1; 4566 int res; 4567 4568 donelist_init(&donelist); 4569 symlook_init_from_req(&req1, req); 4570 4571 /* 4572 * Look first in the referencing object if linked symbolically, 4573 * and similarly handle protected symbols. 4574 */ 4575 res = symlook_obj(&req1, refobj); 4576 if (res == 0 && (refobj->symbolic || 4577 ELF_ST_VISIBILITY(req1.sym_out->st_other) == STV_PROTECTED)) { 4578 req->sym_out = req1.sym_out; 4579 req->defobj_out = req1.defobj_out; 4580 assert(req->defobj_out != NULL); 4581 } 4582 if (refobj->symbolic || req->defobj_out != NULL) 4583 donelist_check(&donelist, refobj); 4584 4585 if (!refobj->deepbind) 4586 symlook_global(req, &donelist); 4587 4588 /* Search all dlopened DAGs containing the referencing object. */ 4589 STAILQ_FOREACH(elm, &refobj->dldags, link) { 4590 if (req->sym_out != NULL && (!ld_dynamic_weak || 4591 ELF_ST_BIND(req->sym_out->st_info) != STB_WEAK)) 4592 break; 4593 res = symlook_list(&req1, &elm->obj->dagmembers, &donelist); 4594 if (res == 0 && (req->sym_out == NULL || 4595 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) { 4596 req->sym_out = req1.sym_out; 4597 req->defobj_out = req1.defobj_out; 4598 assert(req->defobj_out != NULL); 4599 } 4600 } 4601 4602 if (refobj->deepbind) 4603 symlook_global(req, &donelist); 4604 4605 /* 4606 * Search the dynamic linker itself, and possibly resolve the 4607 * symbol from there. This is how the application links to 4608 * dynamic linker services such as dlopen. 4609 */ 4610 if (req->sym_out == NULL || 4611 ELF_ST_BIND(req->sym_out->st_info) == STB_WEAK) { 4612 res = symlook_obj(&req1, &obj_rtld); 4613 if (res == 0) { 4614 req->sym_out = req1.sym_out; 4615 req->defobj_out = req1.defobj_out; 4616 assert(req->defobj_out != NULL); 4617 } 4618 } 4619 4620 return (req->sym_out != NULL ? 0 : ESRCH); 4621 } 4622 4623 static int 4624 symlook_list(SymLook *req, const Objlist *objlist, DoneList *dlp) 4625 { 4626 const Elf_Sym *def; 4627 const Obj_Entry *defobj; 4628 const Objlist_Entry *elm; 4629 SymLook req1; 4630 int res; 4631 4632 def = NULL; 4633 defobj = NULL; 4634 STAILQ_FOREACH(elm, objlist, link) { 4635 if (donelist_check(dlp, elm->obj)) 4636 continue; 4637 symlook_init_from_req(&req1, req); 4638 if ((res = symlook_obj(&req1, elm->obj)) == 0) { 4639 if (def == NULL || (ld_dynamic_weak && 4640 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) { 4641 def = req1.sym_out; 4642 defobj = req1.defobj_out; 4643 if (!ld_dynamic_weak || ELF_ST_BIND(def->st_info) != STB_WEAK) 4644 break; 4645 } 4646 } 4647 } 4648 if (def != NULL) { 4649 req->sym_out = def; 4650 req->defobj_out = defobj; 4651 return (0); 4652 } 4653 return (ESRCH); 4654 } 4655 4656 /* 4657 * Search the chain of DAGS cointed to by the given Needed_Entry 4658 * for a symbol of the given name. Each DAG is scanned completely 4659 * before advancing to the next one. Returns a pointer to the symbol, 4660 * or NULL if no definition was found. 4661 */ 4662 static int 4663 symlook_needed(SymLook *req, const Needed_Entry *needed, DoneList *dlp) 4664 { 4665 const Elf_Sym *def; 4666 const Needed_Entry *n; 4667 const Obj_Entry *defobj; 4668 SymLook req1; 4669 int res; 4670 4671 def = NULL; 4672 defobj = NULL; 4673 symlook_init_from_req(&req1, req); 4674 for (n = needed; n != NULL; n = n->next) { 4675 if (n->obj == NULL || 4676 (res = symlook_list(&req1, &n->obj->dagmembers, dlp)) != 0) 4677 continue; 4678 if (def == NULL || (ld_dynamic_weak && 4679 ELF_ST_BIND(req1.sym_out->st_info) != STB_WEAK)) { 4680 def = req1.sym_out; 4681 defobj = req1.defobj_out; 4682 if (!ld_dynamic_weak || ELF_ST_BIND(def->st_info) != STB_WEAK) 4683 break; 4684 } 4685 } 4686 if (def != NULL) { 4687 req->sym_out = def; 4688 req->defobj_out = defobj; 4689 return (0); 4690 } 4691 return (ESRCH); 4692 } 4693 4694 static int 4695 symlook_obj_load_filtees(SymLook *req, SymLook *req1, const Obj_Entry *obj, 4696 Needed_Entry *needed) 4697 { 4698 DoneList donelist; 4699 int flags; 4700 4701 flags = (req->flags & SYMLOOK_EARLY) != 0 ? RTLD_LO_EARLY : 0; 4702 load_filtees(__DECONST(Obj_Entry *, obj), flags, req->lockstate); 4703 donelist_init(&donelist); 4704 symlook_init_from_req(req1, req); 4705 return (symlook_needed(req1, needed, &donelist)); 4706 } 4707 4708 /* 4709 * Search the symbol table of a single shared object for a symbol of 4710 * the given name and version, if requested. Returns a pointer to the 4711 * symbol, or NULL if no definition was found. If the object is 4712 * filter, return filtered symbol from filtee. 4713 * 4714 * The symbol's hash value is passed in for efficiency reasons; that 4715 * eliminates many recomputations of the hash value. 4716 */ 4717 int 4718 symlook_obj(SymLook *req, const Obj_Entry *obj) 4719 { 4720 SymLook req1; 4721 int res, mres; 4722 4723 /* 4724 * If there is at least one valid hash at this point, we prefer to 4725 * use the faster GNU version if available. 4726 */ 4727 if (obj->valid_hash_gnu) 4728 mres = symlook_obj1_gnu(req, obj); 4729 else if (obj->valid_hash_sysv) 4730 mres = symlook_obj1_sysv(req, obj); 4731 else 4732 return (EINVAL); 4733 4734 if (mres == 0) { 4735 if (obj->needed_filtees != NULL) { 4736 res = symlook_obj_load_filtees(req, &req1, obj, 4737 obj->needed_filtees); 4738 if (res == 0) { 4739 req->sym_out = req1.sym_out; 4740 req->defobj_out = req1.defobj_out; 4741 } 4742 return (res); 4743 } 4744 if (obj->needed_aux_filtees != NULL) { 4745 res = symlook_obj_load_filtees(req, &req1, obj, 4746 obj->needed_aux_filtees); 4747 if (res == 0) { 4748 req->sym_out = req1.sym_out; 4749 req->defobj_out = req1.defobj_out; 4750 return (res); 4751 } 4752 } 4753 } 4754 return (mres); 4755 } 4756 4757 /* Symbol match routine common to both hash functions */ 4758 static bool 4759 matched_symbol(SymLook *req, const Obj_Entry *obj, Sym_Match_Result *result, 4760 const unsigned long symnum) 4761 { 4762 Elf_Versym verndx; 4763 const Elf_Sym *symp; 4764 const char *strp; 4765 4766 symp = obj->symtab + symnum; 4767 strp = obj->strtab + symp->st_name; 4768 4769 switch (ELF_ST_TYPE(symp->st_info)) { 4770 case STT_FUNC: 4771 case STT_NOTYPE: 4772 case STT_OBJECT: 4773 case STT_COMMON: 4774 case STT_GNU_IFUNC: 4775 if (symp->st_value == 0) 4776 return (false); 4777 /* fallthrough */ 4778 case STT_TLS: 4779 if (symp->st_shndx != SHN_UNDEF) 4780 break; 4781 else if (((req->flags & SYMLOOK_IN_PLT) == 0) && 4782 (ELF_ST_TYPE(symp->st_info) == STT_FUNC)) 4783 break; 4784 /* fallthrough */ 4785 default: 4786 return (false); 4787 } 4788 if (req->name[0] != strp[0] || strcmp(req->name, strp) != 0) 4789 return (false); 4790 4791 if (req->ventry == NULL) { 4792 if (obj->versyms != NULL) { 4793 verndx = VER_NDX(obj->versyms[symnum]); 4794 if (verndx > obj->vernum) { 4795 _rtld_error( 4796 "%s: symbol %s references wrong version %d", 4797 obj->path, obj->strtab + symnum, verndx); 4798 return (false); 4799 } 4800 /* 4801 * If we are not called from dlsym (i.e. this 4802 * is a normal relocation from unversioned 4803 * binary), accept the symbol immediately if 4804 * it happens to have first version after this 4805 * shared object became versioned. Otherwise, 4806 * if symbol is versioned and not hidden, 4807 * remember it. If it is the only symbol with 4808 * this name exported by the shared object, it 4809 * will be returned as a match by the calling 4810 * function. If symbol is global (verndx < 2) 4811 * accept it unconditionally. 4812 */ 4813 if ((req->flags & SYMLOOK_DLSYM) == 0 && 4814 verndx == VER_NDX_GIVEN) { 4815 result->sym_out = symp; 4816 return (true); 4817 } 4818 else if (verndx >= VER_NDX_GIVEN) { 4819 if ((obj->versyms[symnum] & VER_NDX_HIDDEN) 4820 == 0) { 4821 if (result->vsymp == NULL) 4822 result->vsymp = symp; 4823 result->vcount++; 4824 } 4825 return (false); 4826 } 4827 } 4828 result->sym_out = symp; 4829 return (true); 4830 } 4831 if (obj->versyms == NULL) { 4832 if (object_match_name(obj, req->ventry->name)) { 4833 _rtld_error("%s: object %s should provide version %s " 4834 "for symbol %s", obj_rtld.path, obj->path, 4835 req->ventry->name, obj->strtab + symnum); 4836 return (false); 4837 } 4838 } else { 4839 verndx = VER_NDX(obj->versyms[symnum]); 4840 if (verndx > obj->vernum) { 4841 _rtld_error("%s: symbol %s references wrong version %d", 4842 obj->path, obj->strtab + symnum, verndx); 4843 return (false); 4844 } 4845 if (obj->vertab[verndx].hash != req->ventry->hash || 4846 strcmp(obj->vertab[verndx].name, req->ventry->name)) { 4847 /* 4848 * Version does not match. Look if this is a 4849 * global symbol and if it is not hidden. If 4850 * global symbol (verndx < 2) is available, 4851 * use it. Do not return symbol if we are 4852 * called by dlvsym, because dlvsym looks for 4853 * a specific version and default one is not 4854 * what dlvsym wants. 4855 */ 4856 if ((req->flags & SYMLOOK_DLSYM) || 4857 (verndx >= VER_NDX_GIVEN) || 4858 (obj->versyms[symnum] & VER_NDX_HIDDEN)) 4859 return (false); 4860 } 4861 } 4862 result->sym_out = symp; 4863 return (true); 4864 } 4865 4866 /* 4867 * Search for symbol using SysV hash function. 4868 * obj->buckets is known not to be NULL at this point; the test for this was 4869 * performed with the obj->valid_hash_sysv assignment. 4870 */ 4871 static int 4872 symlook_obj1_sysv(SymLook *req, const Obj_Entry *obj) 4873 { 4874 unsigned long symnum; 4875 Sym_Match_Result matchres; 4876 4877 matchres.sym_out = NULL; 4878 matchres.vsymp = NULL; 4879 matchres.vcount = 0; 4880 4881 for (symnum = obj->buckets[req->hash % obj->nbuckets]; 4882 symnum != STN_UNDEF; symnum = obj->chains[symnum]) { 4883 if (symnum >= obj->nchains) 4884 return (ESRCH); /* Bad object */ 4885 4886 if (matched_symbol(req, obj, &matchres, symnum)) { 4887 req->sym_out = matchres.sym_out; 4888 req->defobj_out = obj; 4889 return (0); 4890 } 4891 } 4892 if (matchres.vcount == 1) { 4893 req->sym_out = matchres.vsymp; 4894 req->defobj_out = obj; 4895 return (0); 4896 } 4897 return (ESRCH); 4898 } 4899 4900 /* Search for symbol using GNU hash function */ 4901 static int 4902 symlook_obj1_gnu(SymLook *req, const Obj_Entry *obj) 4903 { 4904 Elf_Addr bloom_word; 4905 const Elf32_Word *hashval; 4906 Elf32_Word bucket; 4907 Sym_Match_Result matchres; 4908 unsigned int h1, h2; 4909 unsigned long symnum; 4910 4911 matchres.sym_out = NULL; 4912 matchres.vsymp = NULL; 4913 matchres.vcount = 0; 4914 4915 /* Pick right bitmask word from Bloom filter array */ 4916 bloom_word = obj->bloom_gnu[(req->hash_gnu / __ELF_WORD_SIZE) & 4917 obj->maskwords_bm_gnu]; 4918 4919 /* Calculate modulus word size of gnu hash and its derivative */ 4920 h1 = req->hash_gnu & (__ELF_WORD_SIZE - 1); 4921 h2 = ((req->hash_gnu >> obj->shift2_gnu) & (__ELF_WORD_SIZE - 1)); 4922 4923 /* Filter out the "definitely not in set" queries */ 4924 if (((bloom_word >> h1) & (bloom_word >> h2) & 1) == 0) 4925 return (ESRCH); 4926 4927 /* Locate hash chain and corresponding value element*/ 4928 bucket = obj->buckets_gnu[req->hash_gnu % obj->nbuckets_gnu]; 4929 if (bucket == 0) 4930 return (ESRCH); 4931 hashval = &obj->chain_zero_gnu[bucket]; 4932 do { 4933 if (((*hashval ^ req->hash_gnu) >> 1) == 0) { 4934 symnum = hashval - obj->chain_zero_gnu; 4935 if (matched_symbol(req, obj, &matchres, symnum)) { 4936 req->sym_out = matchres.sym_out; 4937 req->defobj_out = obj; 4938 return (0); 4939 } 4940 } 4941 } while ((*hashval++ & 1) == 0); 4942 if (matchres.vcount == 1) { 4943 req->sym_out = matchres.vsymp; 4944 req->defobj_out = obj; 4945 return (0); 4946 } 4947 return (ESRCH); 4948 } 4949 4950 static void 4951 trace_calc_fmts(const char **main_local, const char **fmt1, const char **fmt2) 4952 { 4953 *main_local = ld_get_env_var(LD_TRACE_LOADED_OBJECTS_PROGNAME); 4954 if (*main_local == NULL) 4955 *main_local = ""; 4956 4957 *fmt1 = ld_get_env_var(LD_TRACE_LOADED_OBJECTS_FMT1); 4958 if (*fmt1 == NULL) 4959 *fmt1 = "\t%o => %p (%x)\n"; 4960 4961 *fmt2 = ld_get_env_var(LD_TRACE_LOADED_OBJECTS_FMT2); 4962 if (*fmt2 == NULL) 4963 *fmt2 = "\t%o (%x)\n"; 4964 } 4965 4966 static void 4967 trace_print_obj(Obj_Entry *obj, const char *name, const char *path, 4968 const char *main_local, const char *fmt1, const char *fmt2) 4969 { 4970 const char *fmt; 4971 int c; 4972 4973 if (fmt1 == NULL) 4974 fmt = fmt2; 4975 else 4976 /* XXX bogus */ 4977 fmt = strncmp(name, "lib", 3) == 0 ? fmt1 : fmt2; 4978 4979 while ((c = *fmt++) != '\0') { 4980 switch (c) { 4981 default: 4982 rtld_putchar(c); 4983 continue; 4984 case '\\': 4985 switch (c = *fmt) { 4986 case '\0': 4987 continue; 4988 case 'n': 4989 rtld_putchar('\n'); 4990 break; 4991 case 't': 4992 rtld_putchar('\t'); 4993 break; 4994 } 4995 break; 4996 case '%': 4997 switch (c = *fmt) { 4998 case '\0': 4999 continue; 5000 case '%': 5001 default: 5002 rtld_putchar(c); 5003 break; 5004 case 'A': 5005 rtld_putstr(main_local); 5006 break; 5007 case 'a': 5008 rtld_putstr(obj_main->path); 5009 break; 5010 case 'o': 5011 rtld_putstr(name); 5012 break; 5013 case 'p': 5014 rtld_putstr(path); 5015 break; 5016 case 'x': 5017 rtld_printf("%p", obj != NULL ? 5018 obj->mapbase : NULL); 5019 break; 5020 } 5021 break; 5022 } 5023 ++fmt; 5024 } 5025 } 5026 5027 static void 5028 trace_loaded_objects(Obj_Entry *obj, bool show_preload) 5029 { 5030 const char *fmt1, *fmt2, *main_local; 5031 const char *name, *path; 5032 bool first_spurious, list_containers; 5033 5034 trace_calc_fmts(&main_local, &fmt1, &fmt2); 5035 list_containers = ld_get_env_var(LD_TRACE_LOADED_OBJECTS_ALL) != NULL; 5036 5037 for (; obj != NULL; obj = TAILQ_NEXT(obj, next)) { 5038 Needed_Entry *needed; 5039 5040 if (obj->marker) 5041 continue; 5042 if (list_containers && obj->needed != NULL) 5043 rtld_printf("%s:\n", obj->path); 5044 for (needed = obj->needed; needed; needed = needed->next) { 5045 if (needed->obj != NULL) { 5046 if (needed->obj->traced && !list_containers) 5047 continue; 5048 needed->obj->traced = true; 5049 path = needed->obj->path; 5050 } else 5051 path = "not found"; 5052 5053 name = obj->strtab + needed->name; 5054 trace_print_obj(needed->obj, name, path, main_local, 5055 fmt1, fmt2); 5056 } 5057 } 5058 5059 if (show_preload) { 5060 if (ld_get_env_var(LD_TRACE_LOADED_OBJECTS_FMT2) == NULL) 5061 fmt2 = "\t%p (%x)\n"; 5062 first_spurious = true; 5063 5064 TAILQ_FOREACH(obj, &obj_list, next) { 5065 if (obj->marker || obj == obj_main || obj->traced) 5066 continue; 5067 5068 if (list_containers && first_spurious) { 5069 rtld_printf("[preloaded]\n"); 5070 first_spurious = false; 5071 } 5072 5073 Name_Entry *fname = STAILQ_FIRST(&obj->names); 5074 name = fname == NULL ? "<unknown>" : fname->name; 5075 trace_print_obj(obj, name, obj->path, main_local, 5076 NULL, fmt2); 5077 } 5078 } 5079 } 5080 5081 /* 5082 * Unload a dlopened object and its dependencies from memory and from 5083 * our data structures. It is assumed that the DAG rooted in the 5084 * object has already been unreferenced, and that the object has a 5085 * reference count of 0. 5086 */ 5087 static void 5088 unload_object(Obj_Entry *root, RtldLockState *lockstate) 5089 { 5090 Obj_Entry marker, *obj, *next; 5091 5092 assert(root->refcount == 0); 5093 5094 /* 5095 * Pass over the DAG removing unreferenced objects from 5096 * appropriate lists. 5097 */ 5098 unlink_object(root); 5099 5100 /* Unmap all objects that are no longer referenced. */ 5101 for (obj = TAILQ_FIRST(&obj_list); obj != NULL; obj = next) { 5102 next = TAILQ_NEXT(obj, next); 5103 if (obj->marker || obj->refcount != 0) 5104 continue; 5105 LD_UTRACE(UTRACE_UNLOAD_OBJECT, obj, obj->mapbase, 5106 obj->mapsize, 0, obj->path); 5107 dbg("unloading \"%s\"", obj->path); 5108 /* 5109 * Unlink the object now to prevent new references from 5110 * being acquired while the bind lock is dropped in 5111 * recursive dlclose() invocations. 5112 */ 5113 TAILQ_REMOVE(&obj_list, obj, next); 5114 obj_count--; 5115 5116 if (obj->filtees_loaded) { 5117 if (next != NULL) { 5118 init_marker(&marker); 5119 TAILQ_INSERT_BEFORE(next, &marker, next); 5120 unload_filtees(obj, lockstate); 5121 next = TAILQ_NEXT(&marker, next); 5122 TAILQ_REMOVE(&obj_list, &marker, next); 5123 } else 5124 unload_filtees(obj, lockstate); 5125 } 5126 release_object(obj); 5127 } 5128 } 5129 5130 static void 5131 unlink_object(Obj_Entry *root) 5132 { 5133 Objlist_Entry *elm; 5134 5135 if (root->refcount == 0) { 5136 /* Remove the object from the RTLD_GLOBAL list. */ 5137 objlist_remove(&list_global, root); 5138 5139 /* Remove the object from all objects' DAG lists. */ 5140 STAILQ_FOREACH(elm, &root->dagmembers, link) { 5141 objlist_remove(&elm->obj->dldags, root); 5142 if (elm->obj != root) 5143 unlink_object(elm->obj); 5144 } 5145 } 5146 } 5147 5148 static void 5149 ref_dag(Obj_Entry *root) 5150 { 5151 Objlist_Entry *elm; 5152 5153 assert(root->dag_inited); 5154 STAILQ_FOREACH(elm, &root->dagmembers, link) 5155 elm->obj->refcount++; 5156 } 5157 5158 static void 5159 unref_dag(Obj_Entry *root) 5160 { 5161 Objlist_Entry *elm; 5162 5163 assert(root->dag_inited); 5164 STAILQ_FOREACH(elm, &root->dagmembers, link) 5165 elm->obj->refcount--; 5166 } 5167 5168 /* 5169 * Common code for MD __tls_get_addr(). 5170 */ 5171 static void * 5172 tls_get_addr_slow(Elf_Addr **dtvp, int index, size_t offset, bool locked) 5173 { 5174 Elf_Addr *newdtv, *dtv; 5175 RtldLockState lockstate; 5176 int to_copy; 5177 5178 dtv = *dtvp; 5179 /* Check dtv generation in case new modules have arrived */ 5180 if (dtv[0] != tls_dtv_generation) { 5181 if (!locked) 5182 wlock_acquire(rtld_bind_lock, &lockstate); 5183 newdtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr)); 5184 to_copy = dtv[1]; 5185 if (to_copy > tls_max_index) 5186 to_copy = tls_max_index; 5187 memcpy(&newdtv[2], &dtv[2], to_copy * sizeof(Elf_Addr)); 5188 newdtv[0] = tls_dtv_generation; 5189 newdtv[1] = tls_max_index; 5190 free(dtv); 5191 if (!locked) 5192 lock_release(rtld_bind_lock, &lockstate); 5193 dtv = *dtvp = newdtv; 5194 } 5195 5196 /* Dynamically allocate module TLS if necessary */ 5197 if (dtv[index + 1] == 0) { 5198 /* Signal safe, wlock will block out signals. */ 5199 if (!locked) 5200 wlock_acquire(rtld_bind_lock, &lockstate); 5201 if (!dtv[index + 1]) 5202 dtv[index + 1] = (Elf_Addr)allocate_module_tls(index); 5203 if (!locked) 5204 lock_release(rtld_bind_lock, &lockstate); 5205 } 5206 return ((void *)(dtv[index + 1] + offset)); 5207 } 5208 5209 void * 5210 tls_get_addr_common(uintptr_t **dtvp, int index, size_t offset) 5211 { 5212 uintptr_t *dtv; 5213 5214 dtv = *dtvp; 5215 /* Check dtv generation in case new modules have arrived */ 5216 if (__predict_true(dtv[0] == tls_dtv_generation && 5217 dtv[index + 1] != 0)) 5218 return ((void *)(dtv[index + 1] + offset)); 5219 return (tls_get_addr_slow(dtvp, index, offset, false)); 5220 } 5221 5222 #ifdef TLS_VARIANT_I 5223 5224 /* 5225 * Return pointer to allocated TLS block 5226 */ 5227 static void * 5228 get_tls_block_ptr(void *tcb, size_t tcbsize) 5229 { 5230 size_t extra_size, post_size, pre_size, tls_block_size; 5231 size_t tls_init_align; 5232 5233 tls_init_align = MAX(obj_main->tlsalign, 1); 5234 5235 /* Compute fragments sizes. */ 5236 extra_size = tcbsize - TLS_TCB_SIZE; 5237 post_size = calculate_tls_post_size(tls_init_align); 5238 tls_block_size = tcbsize + post_size; 5239 pre_size = roundup2(tls_block_size, tls_init_align) - tls_block_size; 5240 5241 return ((char *)tcb - pre_size - extra_size); 5242 } 5243 5244 /* 5245 * Allocate Static TLS using the Variant I method. 5246 * 5247 * For details on the layout, see lib/libc/gen/tls.c. 5248 * 5249 * NB: rtld's tls_static_space variable includes TLS_TCB_SIZE and post_size as 5250 * it is based on tls_last_offset, and TLS offsets here are really TCB 5251 * offsets, whereas libc's tls_static_space is just the executable's static 5252 * TLS segment. 5253 */ 5254 void * 5255 allocate_tls(Obj_Entry *objs, void *oldtcb, size_t tcbsize, size_t tcbalign) 5256 { 5257 Obj_Entry *obj; 5258 char *tls_block; 5259 Elf_Addr *dtv, **tcb; 5260 Elf_Addr addr; 5261 Elf_Addr i; 5262 size_t extra_size, maxalign, post_size, pre_size, tls_block_size; 5263 size_t tls_init_align, tls_init_offset; 5264 5265 if (oldtcb != NULL && tcbsize == TLS_TCB_SIZE) 5266 return (oldtcb); 5267 5268 assert(tcbsize >= TLS_TCB_SIZE); 5269 maxalign = MAX(tcbalign, tls_static_max_align); 5270 tls_init_align = MAX(obj_main->tlsalign, 1); 5271 5272 /* Compute fragmets sizes. */ 5273 extra_size = tcbsize - TLS_TCB_SIZE; 5274 post_size = calculate_tls_post_size(tls_init_align); 5275 tls_block_size = tcbsize + post_size; 5276 pre_size = roundup2(tls_block_size, tls_init_align) - tls_block_size; 5277 tls_block_size += pre_size + tls_static_space - TLS_TCB_SIZE - post_size; 5278 5279 /* Allocate whole TLS block */ 5280 tls_block = xmalloc_aligned(tls_block_size, maxalign, 0); 5281 tcb = (Elf_Addr **)(tls_block + pre_size + extra_size); 5282 5283 if (oldtcb != NULL) { 5284 memcpy(tls_block, get_tls_block_ptr(oldtcb, tcbsize), 5285 tls_static_space); 5286 free(get_tls_block_ptr(oldtcb, tcbsize)); 5287 5288 /* Adjust the DTV. */ 5289 dtv = tcb[0]; 5290 for (i = 0; i < dtv[1]; i++) { 5291 if (dtv[i+2] >= (Elf_Addr)oldtcb && 5292 dtv[i+2] < (Elf_Addr)oldtcb + tls_static_space) { 5293 dtv[i+2] = dtv[i+2] - (Elf_Addr)oldtcb + (Elf_Addr)tcb; 5294 } 5295 } 5296 } else { 5297 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr)); 5298 tcb[0] = dtv; 5299 dtv[0] = tls_dtv_generation; 5300 dtv[1] = tls_max_index; 5301 5302 for (obj = globallist_curr(objs); obj != NULL; 5303 obj = globallist_next(obj)) { 5304 if (obj->tlsoffset == 0) 5305 continue; 5306 tls_init_offset = obj->tlspoffset & (obj->tlsalign - 1); 5307 addr = (Elf_Addr)tcb + obj->tlsoffset; 5308 if (tls_init_offset > 0) 5309 memset((void *)addr, 0, tls_init_offset); 5310 if (obj->tlsinitsize > 0) { 5311 memcpy((void *)(addr + tls_init_offset), obj->tlsinit, 5312 obj->tlsinitsize); 5313 } 5314 if (obj->tlssize > obj->tlsinitsize) { 5315 memset((void *)(addr + tls_init_offset + obj->tlsinitsize), 5316 0, obj->tlssize - obj->tlsinitsize - tls_init_offset); 5317 } 5318 dtv[obj->tlsindex + 1] = addr; 5319 } 5320 } 5321 5322 return (tcb); 5323 } 5324 5325 void 5326 free_tls(void *tcb, size_t tcbsize, size_t tcbalign __unused) 5327 { 5328 Elf_Addr *dtv; 5329 Elf_Addr tlsstart, tlsend; 5330 size_t post_size; 5331 size_t dtvsize, i, tls_init_align __unused; 5332 5333 assert(tcbsize >= TLS_TCB_SIZE); 5334 tls_init_align = MAX(obj_main->tlsalign, 1); 5335 5336 /* Compute fragments sizes. */ 5337 post_size = calculate_tls_post_size(tls_init_align); 5338 5339 tlsstart = (Elf_Addr)tcb + TLS_TCB_SIZE + post_size; 5340 tlsend = (Elf_Addr)tcb + tls_static_space; 5341 5342 dtv = *(Elf_Addr **)tcb; 5343 dtvsize = dtv[1]; 5344 for (i = 0; i < dtvsize; i++) { 5345 if (dtv[i+2] && (dtv[i+2] < tlsstart || dtv[i+2] >= tlsend)) { 5346 free((void*)dtv[i+2]); 5347 } 5348 } 5349 free(dtv); 5350 free(get_tls_block_ptr(tcb, tcbsize)); 5351 } 5352 5353 #endif /* TLS_VARIANT_I */ 5354 5355 #ifdef TLS_VARIANT_II 5356 5357 /* 5358 * Allocate Static TLS using the Variant II method. 5359 */ 5360 void * 5361 allocate_tls(Obj_Entry *objs, void *oldtls, size_t tcbsize, size_t tcbalign) 5362 { 5363 Obj_Entry *obj; 5364 size_t size, ralign; 5365 char *tls; 5366 Elf_Addr *dtv, *olddtv; 5367 Elf_Addr segbase, oldsegbase, addr; 5368 size_t i; 5369 5370 ralign = tcbalign; 5371 if (tls_static_max_align > ralign) 5372 ralign = tls_static_max_align; 5373 size = roundup(tls_static_space, ralign) + roundup(tcbsize, ralign); 5374 5375 assert(tcbsize >= 2*sizeof(Elf_Addr)); 5376 tls = xmalloc_aligned(size, ralign, 0 /* XXX */); 5377 dtv = xcalloc(tls_max_index + 2, sizeof(Elf_Addr)); 5378 5379 segbase = (Elf_Addr)(tls + roundup(tls_static_space, ralign)); 5380 ((Elf_Addr *)segbase)[0] = segbase; 5381 ((Elf_Addr *)segbase)[1] = (Elf_Addr) dtv; 5382 5383 dtv[0] = tls_dtv_generation; 5384 dtv[1] = tls_max_index; 5385 5386 if (oldtls) { 5387 /* 5388 * Copy the static TLS block over whole. 5389 */ 5390 oldsegbase = (Elf_Addr) oldtls; 5391 memcpy((void *)(segbase - tls_static_space), 5392 (const void *)(oldsegbase - tls_static_space), 5393 tls_static_space); 5394 5395 /* 5396 * If any dynamic TLS blocks have been created tls_get_addr(), 5397 * move them over. 5398 */ 5399 olddtv = ((Elf_Addr **)oldsegbase)[1]; 5400 for (i = 0; i < olddtv[1]; i++) { 5401 if (olddtv[i + 2] < oldsegbase - size || 5402 olddtv[i + 2] > oldsegbase) { 5403 dtv[i + 2] = olddtv[i + 2]; 5404 olddtv[i + 2] = 0; 5405 } 5406 } 5407 5408 /* 5409 * We assume that this block was the one we created with 5410 * allocate_initial_tls(). 5411 */ 5412 free_tls(oldtls, 2 * sizeof(Elf_Addr), sizeof(Elf_Addr)); 5413 } else { 5414 for (obj = objs; obj != NULL; obj = TAILQ_NEXT(obj, next)) { 5415 if (obj->marker || obj->tlsoffset == 0) 5416 continue; 5417 addr = segbase - obj->tlsoffset; 5418 memset((void *)(addr + obj->tlsinitsize), 5419 0, obj->tlssize - obj->tlsinitsize); 5420 if (obj->tlsinit) { 5421 memcpy((void *)addr, obj->tlsinit, obj->tlsinitsize); 5422 obj->static_tls_copied = true; 5423 } 5424 dtv[obj->tlsindex + 1] = addr; 5425 } 5426 } 5427 5428 return ((void *)segbase); 5429 } 5430 5431 void 5432 free_tls(void *tls, size_t tcbsize __unused, size_t tcbalign) 5433 { 5434 Elf_Addr* dtv; 5435 size_t size, ralign; 5436 int dtvsize, i; 5437 Elf_Addr tlsstart, tlsend; 5438 5439 /* 5440 * Figure out the size of the initial TLS block so that we can 5441 * find stuff which ___tls_get_addr() allocated dynamically. 5442 */ 5443 ralign = tcbalign; 5444 if (tls_static_max_align > ralign) 5445 ralign = tls_static_max_align; 5446 size = roundup(tls_static_space, ralign); 5447 5448 dtv = ((Elf_Addr **)tls)[1]; 5449 dtvsize = dtv[1]; 5450 tlsend = (Elf_Addr)tls; 5451 tlsstart = tlsend - size; 5452 for (i = 0; i < dtvsize; i++) { 5453 if (dtv[i + 2] != 0 && (dtv[i + 2] < tlsstart || 5454 dtv[i + 2] > tlsend)) { 5455 free((void *)dtv[i + 2]); 5456 } 5457 } 5458 5459 free((void *)tlsstart); 5460 free((void *)dtv); 5461 } 5462 5463 #endif /* TLS_VARIANT_II */ 5464 5465 /* 5466 * Allocate TLS block for module with given index. 5467 */ 5468 void * 5469 allocate_module_tls(int index) 5470 { 5471 Obj_Entry *obj; 5472 char *p; 5473 5474 TAILQ_FOREACH(obj, &obj_list, next) { 5475 if (obj->marker) 5476 continue; 5477 if (obj->tlsindex == index) 5478 break; 5479 } 5480 if (obj == NULL) { 5481 _rtld_error("Can't find module with TLS index %d", index); 5482 rtld_die(); 5483 } 5484 5485 if (obj->tls_static) { 5486 #ifdef TLS_VARIANT_I 5487 p = (char *)_tcb_get() + obj->tlsoffset + TLS_TCB_SIZE; 5488 #else 5489 p = (char *)_tcb_get() - obj->tlsoffset; 5490 #endif 5491 return (p); 5492 } 5493 5494 obj->tls_dynamic = true; 5495 5496 p = xmalloc_aligned(obj->tlssize, obj->tlsalign, obj->tlspoffset); 5497 memcpy(p, obj->tlsinit, obj->tlsinitsize); 5498 memset(p + obj->tlsinitsize, 0, obj->tlssize - obj->tlsinitsize); 5499 return (p); 5500 } 5501 5502 bool 5503 allocate_tls_offset(Obj_Entry *obj) 5504 { 5505 size_t off; 5506 5507 if (obj->tls_dynamic) 5508 return (false); 5509 5510 if (obj->tls_static) 5511 return (true); 5512 5513 if (obj->tlssize == 0) { 5514 obj->tls_static = true; 5515 return (true); 5516 } 5517 5518 if (tls_last_offset == 0) 5519 off = calculate_first_tls_offset(obj->tlssize, obj->tlsalign, 5520 obj->tlspoffset); 5521 else 5522 off = calculate_tls_offset(tls_last_offset, tls_last_size, 5523 obj->tlssize, obj->tlsalign, obj->tlspoffset); 5524 5525 obj->tlsoffset = off; 5526 #ifdef TLS_VARIANT_I 5527 off += obj->tlssize; 5528 #endif 5529 5530 /* 5531 * If we have already fixed the size of the static TLS block, we 5532 * must stay within that size. When allocating the static TLS, we 5533 * leave a small amount of space spare to be used for dynamically 5534 * loading modules which use static TLS. 5535 */ 5536 if (tls_static_space != 0) { 5537 if (off > tls_static_space) 5538 return (false); 5539 } else if (obj->tlsalign > tls_static_max_align) { 5540 tls_static_max_align = obj->tlsalign; 5541 } 5542 5543 tls_last_offset = off; 5544 tls_last_size = obj->tlssize; 5545 obj->tls_static = true; 5546 5547 return (true); 5548 } 5549 5550 void 5551 free_tls_offset(Obj_Entry *obj) 5552 { 5553 5554 /* 5555 * If we were the last thing to allocate out of the static TLS 5556 * block, we give our space back to the 'allocator'. This is a 5557 * simplistic workaround to allow libGL.so.1 to be loaded and 5558 * unloaded multiple times. 5559 */ 5560 size_t off = obj->tlsoffset; 5561 #ifdef TLS_VARIANT_I 5562 off += obj->tlssize; 5563 #endif 5564 if (off == tls_last_offset) { 5565 tls_last_offset -= obj->tlssize; 5566 tls_last_size = 0; 5567 } 5568 } 5569 5570 void * 5571 _rtld_allocate_tls(void *oldtls, size_t tcbsize, size_t tcbalign) 5572 { 5573 void *ret; 5574 RtldLockState lockstate; 5575 5576 wlock_acquire(rtld_bind_lock, &lockstate); 5577 ret = allocate_tls(globallist_curr(TAILQ_FIRST(&obj_list)), oldtls, 5578 tcbsize, tcbalign); 5579 lock_release(rtld_bind_lock, &lockstate); 5580 return (ret); 5581 } 5582 5583 void 5584 _rtld_free_tls(void *tcb, size_t tcbsize, size_t tcbalign) 5585 { 5586 RtldLockState lockstate; 5587 5588 wlock_acquire(rtld_bind_lock, &lockstate); 5589 free_tls(tcb, tcbsize, tcbalign); 5590 lock_release(rtld_bind_lock, &lockstate); 5591 } 5592 5593 static void 5594 object_add_name(Obj_Entry *obj, const char *name) 5595 { 5596 Name_Entry *entry; 5597 size_t len; 5598 5599 len = strlen(name); 5600 entry = malloc(sizeof(Name_Entry) + len); 5601 5602 if (entry != NULL) { 5603 strcpy(entry->name, name); 5604 STAILQ_INSERT_TAIL(&obj->names, entry, link); 5605 } 5606 } 5607 5608 static int 5609 object_match_name(const Obj_Entry *obj, const char *name) 5610 { 5611 Name_Entry *entry; 5612 5613 STAILQ_FOREACH(entry, &obj->names, link) { 5614 if (strcmp(name, entry->name) == 0) 5615 return (1); 5616 } 5617 return (0); 5618 } 5619 5620 static Obj_Entry * 5621 locate_dependency(const Obj_Entry *obj, const char *name) 5622 { 5623 const Objlist_Entry *entry; 5624 const Needed_Entry *needed; 5625 5626 STAILQ_FOREACH(entry, &list_main, link) { 5627 if (object_match_name(entry->obj, name)) 5628 return (entry->obj); 5629 } 5630 5631 for (needed = obj->needed; needed != NULL; needed = needed->next) { 5632 if (strcmp(obj->strtab + needed->name, name) == 0 || 5633 (needed->obj != NULL && object_match_name(needed->obj, name))) { 5634 /* 5635 * If there is DT_NEEDED for the name we are looking for, 5636 * we are all set. Note that object might not be found if 5637 * dependency was not loaded yet, so the function can 5638 * return NULL here. This is expected and handled 5639 * properly by the caller. 5640 */ 5641 return (needed->obj); 5642 } 5643 } 5644 _rtld_error("%s: Unexpected inconsistency: dependency %s not found", 5645 obj->path, name); 5646 rtld_die(); 5647 } 5648 5649 static int 5650 check_object_provided_version(Obj_Entry *refobj, const Obj_Entry *depobj, 5651 const Elf_Vernaux *vna) 5652 { 5653 const Elf_Verdef *vd; 5654 const char *vername; 5655 5656 vername = refobj->strtab + vna->vna_name; 5657 vd = depobj->verdef; 5658 if (vd == NULL) { 5659 _rtld_error("%s: version %s required by %s not defined", 5660 depobj->path, vername, refobj->path); 5661 return (-1); 5662 } 5663 for (;;) { 5664 if (vd->vd_version != VER_DEF_CURRENT) { 5665 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry", 5666 depobj->path, vd->vd_version); 5667 return (-1); 5668 } 5669 if (vna->vna_hash == vd->vd_hash) { 5670 const Elf_Verdaux *aux = (const Elf_Verdaux *) 5671 ((const char *)vd + vd->vd_aux); 5672 if (strcmp(vername, depobj->strtab + aux->vda_name) == 0) 5673 return (0); 5674 } 5675 if (vd->vd_next == 0) 5676 break; 5677 vd = (const Elf_Verdef *)((const char *)vd + vd->vd_next); 5678 } 5679 if (vna->vna_flags & VER_FLG_WEAK) 5680 return (0); 5681 _rtld_error("%s: version %s required by %s not found", 5682 depobj->path, vername, refobj->path); 5683 return (-1); 5684 } 5685 5686 static int 5687 rtld_verify_object_versions(Obj_Entry *obj) 5688 { 5689 const Elf_Verneed *vn; 5690 const Elf_Verdef *vd; 5691 const Elf_Verdaux *vda; 5692 const Elf_Vernaux *vna; 5693 const Obj_Entry *depobj; 5694 int maxvernum, vernum; 5695 5696 if (obj->ver_checked) 5697 return (0); 5698 obj->ver_checked = true; 5699 5700 maxvernum = 0; 5701 /* 5702 * Walk over defined and required version records and figure out 5703 * max index used by any of them. Do very basic sanity checking 5704 * while there. 5705 */ 5706 vn = obj->verneed; 5707 while (vn != NULL) { 5708 if (vn->vn_version != VER_NEED_CURRENT) { 5709 _rtld_error("%s: Unsupported version %d of Elf_Verneed entry", 5710 obj->path, vn->vn_version); 5711 return (-1); 5712 } 5713 vna = (const Elf_Vernaux *)((const char *)vn + vn->vn_aux); 5714 for (;;) { 5715 vernum = VER_NEED_IDX(vna->vna_other); 5716 if (vernum > maxvernum) 5717 maxvernum = vernum; 5718 if (vna->vna_next == 0) 5719 break; 5720 vna = (const Elf_Vernaux *)((const char *)vna + vna->vna_next); 5721 } 5722 if (vn->vn_next == 0) 5723 break; 5724 vn = (const Elf_Verneed *)((const char *)vn + vn->vn_next); 5725 } 5726 5727 vd = obj->verdef; 5728 while (vd != NULL) { 5729 if (vd->vd_version != VER_DEF_CURRENT) { 5730 _rtld_error("%s: Unsupported version %d of Elf_Verdef entry", 5731 obj->path, vd->vd_version); 5732 return (-1); 5733 } 5734 vernum = VER_DEF_IDX(vd->vd_ndx); 5735 if (vernum > maxvernum) 5736 maxvernum = vernum; 5737 if (vd->vd_next == 0) 5738 break; 5739 vd = (const Elf_Verdef *)((const char *)vd + vd->vd_next); 5740 } 5741 5742 if (maxvernum == 0) 5743 return (0); 5744 5745 /* 5746 * Store version information in array indexable by version index. 5747 * Verify that object version requirements are satisfied along the 5748 * way. 5749 */ 5750 obj->vernum = maxvernum + 1; 5751 obj->vertab = xcalloc(obj->vernum, sizeof(Ver_Entry)); 5752 5753 vd = obj->verdef; 5754 while (vd != NULL) { 5755 if ((vd->vd_flags & VER_FLG_BASE) == 0) { 5756 vernum = VER_DEF_IDX(vd->vd_ndx); 5757 assert(vernum <= maxvernum); 5758 vda = (const Elf_Verdaux *)((const char *)vd + vd->vd_aux); 5759 obj->vertab[vernum].hash = vd->vd_hash; 5760 obj->vertab[vernum].name = obj->strtab + vda->vda_name; 5761 obj->vertab[vernum].file = NULL; 5762 obj->vertab[vernum].flags = 0; 5763 } 5764 if (vd->vd_next == 0) 5765 break; 5766 vd = (const Elf_Verdef *)((const char *)vd + vd->vd_next); 5767 } 5768 5769 vn = obj->verneed; 5770 while (vn != NULL) { 5771 depobj = locate_dependency(obj, obj->strtab + vn->vn_file); 5772 if (depobj == NULL) 5773 return (-1); 5774 vna = (const Elf_Vernaux *)((const char *)vn + vn->vn_aux); 5775 for (;;) { 5776 if (check_object_provided_version(obj, depobj, vna)) 5777 return (-1); 5778 vernum = VER_NEED_IDX(vna->vna_other); 5779 assert(vernum <= maxvernum); 5780 obj->vertab[vernum].hash = vna->vna_hash; 5781 obj->vertab[vernum].name = obj->strtab + vna->vna_name; 5782 obj->vertab[vernum].file = obj->strtab + vn->vn_file; 5783 obj->vertab[vernum].flags = (vna->vna_other & VER_NEED_HIDDEN) ? 5784 VER_INFO_HIDDEN : 0; 5785 if (vna->vna_next == 0) 5786 break; 5787 vna = (const Elf_Vernaux *)((const char *)vna + vna->vna_next); 5788 } 5789 if (vn->vn_next == 0) 5790 break; 5791 vn = (const Elf_Verneed *)((const char *)vn + vn->vn_next); 5792 } 5793 return (0); 5794 } 5795 5796 static int 5797 rtld_verify_versions(const Objlist *objlist) 5798 { 5799 Objlist_Entry *entry; 5800 int rc; 5801 5802 rc = 0; 5803 STAILQ_FOREACH(entry, objlist, link) { 5804 /* 5805 * Skip dummy objects or objects that have their version requirements 5806 * already checked. 5807 */ 5808 if (entry->obj->strtab == NULL || entry->obj->vertab != NULL) 5809 continue; 5810 if (rtld_verify_object_versions(entry->obj) == -1) { 5811 rc = -1; 5812 if (ld_tracing == NULL) 5813 break; 5814 } 5815 } 5816 if (rc == 0 || ld_tracing != NULL) 5817 rc = rtld_verify_object_versions(&obj_rtld); 5818 return (rc); 5819 } 5820 5821 const Ver_Entry * 5822 fetch_ventry(const Obj_Entry *obj, unsigned long symnum) 5823 { 5824 Elf_Versym vernum; 5825 5826 if (obj->vertab) { 5827 vernum = VER_NDX(obj->versyms[symnum]); 5828 if (vernum >= obj->vernum) { 5829 _rtld_error("%s: symbol %s has wrong verneed value %d", 5830 obj->path, obj->strtab + symnum, vernum); 5831 } else if (obj->vertab[vernum].hash != 0) { 5832 return (&obj->vertab[vernum]); 5833 } 5834 } 5835 return (NULL); 5836 } 5837 5838 int 5839 _rtld_get_stack_prot(void) 5840 { 5841 5842 return (stack_prot); 5843 } 5844 5845 int 5846 _rtld_is_dlopened(void *arg) 5847 { 5848 Obj_Entry *obj; 5849 RtldLockState lockstate; 5850 int res; 5851 5852 rlock_acquire(rtld_bind_lock, &lockstate); 5853 obj = dlcheck(arg); 5854 if (obj == NULL) 5855 obj = obj_from_addr(arg); 5856 if (obj == NULL) { 5857 _rtld_error("No shared object contains address"); 5858 lock_release(rtld_bind_lock, &lockstate); 5859 return (-1); 5860 } 5861 res = obj->dlopened ? 1 : 0; 5862 lock_release(rtld_bind_lock, &lockstate); 5863 return (res); 5864 } 5865 5866 static int 5867 obj_remap_relro(Obj_Entry *obj, int prot) 5868 { 5869 5870 if (obj->relro_size > 0 && mprotect(obj->relro_page, obj->relro_size, 5871 prot) == -1) { 5872 _rtld_error("%s: Cannot set relro protection to %#x: %s", 5873 obj->path, prot, rtld_strerror(errno)); 5874 return (-1); 5875 } 5876 return (0); 5877 } 5878 5879 static int 5880 obj_disable_relro(Obj_Entry *obj) 5881 { 5882 5883 return (obj_remap_relro(obj, PROT_READ | PROT_WRITE)); 5884 } 5885 5886 static int 5887 obj_enforce_relro(Obj_Entry *obj) 5888 { 5889 5890 return (obj_remap_relro(obj, PROT_READ)); 5891 } 5892 5893 static void 5894 map_stacks_exec(RtldLockState *lockstate) 5895 { 5896 void (*thr_map_stacks_exec)(void); 5897 5898 if ((max_stack_flags & PF_X) == 0 || (stack_prot & PROT_EXEC) != 0) 5899 return; 5900 thr_map_stacks_exec = (void (*)(void))(uintptr_t) 5901 get_program_var_addr("__pthread_map_stacks_exec", lockstate); 5902 if (thr_map_stacks_exec != NULL) { 5903 stack_prot |= PROT_EXEC; 5904 thr_map_stacks_exec(); 5905 } 5906 } 5907 5908 static void 5909 distribute_static_tls(Objlist *list, RtldLockState *lockstate) 5910 { 5911 Objlist_Entry *elm; 5912 Obj_Entry *obj; 5913 void (*distrib)(size_t, void *, size_t, size_t); 5914 5915 distrib = (void (*)(size_t, void *, size_t, size_t))(uintptr_t) 5916 get_program_var_addr("__pthread_distribute_static_tls", lockstate); 5917 if (distrib == NULL) 5918 return; 5919 STAILQ_FOREACH(elm, list, link) { 5920 obj = elm->obj; 5921 if (obj->marker || !obj->tls_static || obj->static_tls_copied) 5922 continue; 5923 lock_release(rtld_bind_lock, lockstate); 5924 distrib(obj->tlsoffset, obj->tlsinit, obj->tlsinitsize, 5925 obj->tlssize); 5926 wlock_acquire(rtld_bind_lock, lockstate); 5927 obj->static_tls_copied = true; 5928 } 5929 } 5930 5931 void 5932 symlook_init(SymLook *dst, const char *name) 5933 { 5934 5935 bzero(dst, sizeof(*dst)); 5936 dst->name = name; 5937 dst->hash = elf_hash(name); 5938 dst->hash_gnu = gnu_hash(name); 5939 } 5940 5941 static void 5942 symlook_init_from_req(SymLook *dst, const SymLook *src) 5943 { 5944 5945 dst->name = src->name; 5946 dst->hash = src->hash; 5947 dst->hash_gnu = src->hash_gnu; 5948 dst->ventry = src->ventry; 5949 dst->flags = src->flags; 5950 dst->defobj_out = NULL; 5951 dst->sym_out = NULL; 5952 dst->lockstate = src->lockstate; 5953 } 5954 5955 static int 5956 open_binary_fd(const char *argv0, bool search_in_path, 5957 const char **binpath_res) 5958 { 5959 char *binpath, *pathenv, *pe, *res1; 5960 const char *res; 5961 int fd; 5962 5963 binpath = NULL; 5964 res = NULL; 5965 if (search_in_path && strchr(argv0, '/') == NULL) { 5966 binpath = xmalloc(PATH_MAX); 5967 pathenv = getenv("PATH"); 5968 if (pathenv == NULL) { 5969 _rtld_error("-p and no PATH environment variable"); 5970 rtld_die(); 5971 } 5972 pathenv = strdup(pathenv); 5973 if (pathenv == NULL) { 5974 _rtld_error("Cannot allocate memory"); 5975 rtld_die(); 5976 } 5977 fd = -1; 5978 errno = ENOENT; 5979 while ((pe = strsep(&pathenv, ":")) != NULL) { 5980 if (strlcpy(binpath, pe, PATH_MAX) >= PATH_MAX) 5981 continue; 5982 if (binpath[0] != '\0' && 5983 strlcat(binpath, "/", PATH_MAX) >= PATH_MAX) 5984 continue; 5985 if (strlcat(binpath, argv0, PATH_MAX) >= PATH_MAX) 5986 continue; 5987 fd = open(binpath, O_RDONLY | O_CLOEXEC | O_VERIFY); 5988 if (fd != -1 || errno != ENOENT) { 5989 res = binpath; 5990 break; 5991 } 5992 } 5993 free(pathenv); 5994 } else { 5995 fd = open(argv0, O_RDONLY | O_CLOEXEC | O_VERIFY); 5996 res = argv0; 5997 } 5998 5999 if (fd == -1) { 6000 _rtld_error("Cannot open %s: %s", argv0, rtld_strerror(errno)); 6001 rtld_die(); 6002 } 6003 if (res != NULL && res[0] != '/') { 6004 res1 = xmalloc(PATH_MAX); 6005 if (realpath(res, res1) != NULL) { 6006 if (res != argv0) 6007 free(__DECONST(char *, res)); 6008 res = res1; 6009 } else { 6010 free(res1); 6011 } 6012 } 6013 *binpath_res = res; 6014 return (fd); 6015 } 6016 6017 /* 6018 * Parse a set of command-line arguments. 6019 */ 6020 static int 6021 parse_args(char* argv[], int argc, bool *use_pathp, int *fdp, 6022 const char **argv0, bool *dir_ignore) 6023 { 6024 const char *arg; 6025 char machine[64]; 6026 size_t sz; 6027 int arglen, fd, i, j, mib[2]; 6028 char opt; 6029 bool seen_b, seen_f; 6030 6031 dbg("Parsing command-line arguments"); 6032 *use_pathp = false; 6033 *fdp = -1; 6034 *dir_ignore = false; 6035 seen_b = seen_f = false; 6036 6037 for (i = 1; i < argc; i++ ) { 6038 arg = argv[i]; 6039 dbg("argv[%d]: '%s'", i, arg); 6040 6041 /* 6042 * rtld arguments end with an explicit "--" or with the first 6043 * non-prefixed argument. 6044 */ 6045 if (strcmp(arg, "--") == 0) { 6046 i++; 6047 break; 6048 } 6049 if (arg[0] != '-') 6050 break; 6051 6052 /* 6053 * All other arguments are single-character options that can 6054 * be combined, so we need to search through `arg` for them. 6055 */ 6056 arglen = strlen(arg); 6057 for (j = 1; j < arglen; j++) { 6058 opt = arg[j]; 6059 if (opt == 'h') { 6060 print_usage(argv[0]); 6061 _exit(0); 6062 } else if (opt == 'b') { 6063 if (seen_f) { 6064 _rtld_error("Both -b and -f specified"); 6065 rtld_die(); 6066 } 6067 if (j != arglen - 1) { 6068 _rtld_error("Invalid options: %s", arg); 6069 rtld_die(); 6070 } 6071 i++; 6072 *argv0 = argv[i]; 6073 seen_b = true; 6074 break; 6075 } else if (opt == 'd') { 6076 *dir_ignore = true; 6077 } else if (opt == 'f') { 6078 if (seen_b) { 6079 _rtld_error("Both -b and -f specified"); 6080 rtld_die(); 6081 } 6082 6083 /* 6084 * -f XX can be used to specify a 6085 * descriptor for the binary named at 6086 * the command line (i.e., the later 6087 * argument will specify the process 6088 * name but the descriptor is what 6089 * will actually be executed). 6090 * 6091 * -f must be the last option in the 6092 * group, e.g., -abcf <fd>. 6093 */ 6094 if (j != arglen - 1) { 6095 _rtld_error("Invalid options: %s", arg); 6096 rtld_die(); 6097 } 6098 i++; 6099 fd = parse_integer(argv[i]); 6100 if (fd == -1) { 6101 _rtld_error( 6102 "Invalid file descriptor: '%s'", 6103 argv[i]); 6104 rtld_die(); 6105 } 6106 *fdp = fd; 6107 seen_f = true; 6108 break; 6109 } else if (opt == 'p') { 6110 *use_pathp = true; 6111 } else if (opt == 'u') { 6112 trust = false; 6113 } else if (opt == 'v') { 6114 machine[0] = '\0'; 6115 mib[0] = CTL_HW; 6116 mib[1] = HW_MACHINE; 6117 sz = sizeof(machine); 6118 sysctl(mib, nitems(mib), machine, &sz, NULL, 0); 6119 ld_elf_hints_path = ld_get_env_var( 6120 LD_ELF_HINTS_PATH); 6121 set_ld_elf_hints_path(); 6122 rtld_printf( 6123 "FreeBSD ld-elf.so.1 %s\n" 6124 "FreeBSD_version %d\n" 6125 "Default lib path %s\n" 6126 "Hints lib path %s\n" 6127 "Env prefix %s\n" 6128 "Default hint file %s\n" 6129 "Hint file %s\n" 6130 "libmap file %s\n" 6131 "Optional static TLS size %zd bytes\n", 6132 machine, 6133 __FreeBSD_version, ld_standard_library_path, 6134 gethints(false), 6135 ld_env_prefix, ld_elf_hints_default, 6136 ld_elf_hints_path, 6137 ld_path_libmap_conf, 6138 ld_static_tls_extra); 6139 _exit(0); 6140 } else { 6141 _rtld_error("Invalid argument: '%s'", arg); 6142 print_usage(argv[0]); 6143 rtld_die(); 6144 } 6145 } 6146 } 6147 6148 if (!seen_b) 6149 *argv0 = argv[i]; 6150 return (i); 6151 } 6152 6153 /* 6154 * Parse a file descriptor number without pulling in more of libc (e.g. atoi). 6155 */ 6156 static int 6157 parse_integer(const char *str) 6158 { 6159 static const int RADIX = 10; /* XXXJA: possibly support hex? */ 6160 const char *orig; 6161 int n; 6162 char c; 6163 6164 orig = str; 6165 n = 0; 6166 for (c = *str; c != '\0'; c = *++str) { 6167 if (c < '0' || c > '9') 6168 return (-1); 6169 6170 n *= RADIX; 6171 n += c - '0'; 6172 } 6173 6174 /* Make sure we actually parsed something. */ 6175 if (str == orig) 6176 return (-1); 6177 return (n); 6178 } 6179 6180 static void 6181 print_usage(const char *argv0) 6182 { 6183 6184 rtld_printf( 6185 "Usage: %s [-h] [-b <exe>] [-d] [-f <FD>] [-p] [--] <binary> [<args>]\n" 6186 "\n" 6187 "Options:\n" 6188 " -h Display this help message\n" 6189 " -b <exe> Execute <exe> instead of <binary>, arg0 is <binary>\n" 6190 " -d Ignore lack of exec permissions for the binary\n" 6191 " -f <FD> Execute <FD> instead of searching for <binary>\n" 6192 " -p Search in PATH for named binary\n" 6193 " -u Ignore LD_ environment variables\n" 6194 " -v Display identification information\n" 6195 " -- End of RTLD options\n" 6196 " <binary> Name of process to execute\n" 6197 " <args> Arguments to the executed process\n", argv0); 6198 } 6199 6200 #define AUXFMT(at, xfmt) [at] = { .name = #at, .fmt = xfmt } 6201 static const struct auxfmt { 6202 const char *name; 6203 const char *fmt; 6204 } auxfmts[] = { 6205 AUXFMT(AT_NULL, NULL), 6206 AUXFMT(AT_IGNORE, NULL), 6207 AUXFMT(AT_EXECFD, "%ld"), 6208 AUXFMT(AT_PHDR, "%p"), 6209 AUXFMT(AT_PHENT, "%lu"), 6210 AUXFMT(AT_PHNUM, "%lu"), 6211 AUXFMT(AT_PAGESZ, "%lu"), 6212 AUXFMT(AT_BASE, "%#lx"), 6213 AUXFMT(AT_FLAGS, "%#lx"), 6214 AUXFMT(AT_ENTRY, "%p"), 6215 AUXFMT(AT_NOTELF, NULL), 6216 AUXFMT(AT_UID, "%ld"), 6217 AUXFMT(AT_EUID, "%ld"), 6218 AUXFMT(AT_GID, "%ld"), 6219 AUXFMT(AT_EGID, "%ld"), 6220 AUXFMT(AT_EXECPATH, "%s"), 6221 AUXFMT(AT_CANARY, "%p"), 6222 AUXFMT(AT_CANARYLEN, "%lu"), 6223 AUXFMT(AT_OSRELDATE, "%lu"), 6224 AUXFMT(AT_NCPUS, "%lu"), 6225 AUXFMT(AT_PAGESIZES, "%p"), 6226 AUXFMT(AT_PAGESIZESLEN, "%lu"), 6227 AUXFMT(AT_TIMEKEEP, "%p"), 6228 AUXFMT(AT_STACKPROT, "%#lx"), 6229 AUXFMT(AT_EHDRFLAGS, "%#lx"), 6230 AUXFMT(AT_HWCAP, "%#lx"), 6231 AUXFMT(AT_HWCAP2, "%#lx"), 6232 AUXFMT(AT_BSDFLAGS, "%#lx"), 6233 AUXFMT(AT_ARGC, "%lu"), 6234 AUXFMT(AT_ARGV, "%p"), 6235 AUXFMT(AT_ENVC, "%p"), 6236 AUXFMT(AT_ENVV, "%p"), 6237 AUXFMT(AT_PS_STRINGS, "%p"), 6238 AUXFMT(AT_FXRNG, "%p"), 6239 AUXFMT(AT_KPRELOAD, "%p"), 6240 AUXFMT(AT_USRSTACKBASE, "%#lx"), 6241 AUXFMT(AT_USRSTACKLIM, "%#lx"), 6242 }; 6243 6244 static bool 6245 is_ptr_fmt(const char *fmt) 6246 { 6247 char last; 6248 6249 last = fmt[strlen(fmt) - 1]; 6250 return (last == 'p' || last == 's'); 6251 } 6252 6253 static void 6254 dump_auxv(Elf_Auxinfo **aux_info) 6255 { 6256 Elf_Auxinfo *auxp; 6257 const struct auxfmt *fmt; 6258 int i; 6259 6260 for (i = 0; i < AT_COUNT; i++) { 6261 auxp = aux_info[i]; 6262 if (auxp == NULL) 6263 continue; 6264 fmt = &auxfmts[i]; 6265 if (fmt->fmt == NULL) 6266 continue; 6267 rtld_fdprintf(STDOUT_FILENO, "%s:\t", fmt->name); 6268 if (is_ptr_fmt(fmt->fmt)) { 6269 rtld_fdprintfx(STDOUT_FILENO, fmt->fmt, 6270 auxp->a_un.a_ptr); 6271 } else { 6272 rtld_fdprintfx(STDOUT_FILENO, fmt->fmt, 6273 auxp->a_un.a_val); 6274 } 6275 rtld_fdprintf(STDOUT_FILENO, "\n"); 6276 } 6277 } 6278 6279 /* 6280 * Overrides for libc_pic-provided functions. 6281 */ 6282 6283 int 6284 __getosreldate(void) 6285 { 6286 size_t len; 6287 int oid[2]; 6288 int error, osrel; 6289 6290 if (osreldate != 0) 6291 return (osreldate); 6292 6293 oid[0] = CTL_KERN; 6294 oid[1] = KERN_OSRELDATE; 6295 osrel = 0; 6296 len = sizeof(osrel); 6297 error = sysctl(oid, 2, &osrel, &len, NULL, 0); 6298 if (error == 0 && osrel > 0 && len == sizeof(osrel)) 6299 osreldate = osrel; 6300 return (osreldate); 6301 } 6302 const char * 6303 rtld_strerror(int errnum) 6304 { 6305 6306 if (errnum < 0 || errnum >= sys_nerr) 6307 return ("Unknown error"); 6308 return (sys_errlist[errnum]); 6309 } 6310 6311 char * 6312 getenv(const char *name) 6313 { 6314 return (__DECONST(char *, rtld_get_env_val(environ, name, 6315 strlen(name)))); 6316 } 6317 6318 /* malloc */ 6319 void * 6320 malloc(size_t nbytes) 6321 { 6322 6323 return (__crt_malloc(nbytes)); 6324 } 6325 6326 void * 6327 calloc(size_t num, size_t size) 6328 { 6329 6330 return (__crt_calloc(num, size)); 6331 } 6332 6333 void 6334 free(void *cp) 6335 { 6336 6337 __crt_free(cp); 6338 } 6339 6340 void * 6341 realloc(void *cp, size_t nbytes) 6342 { 6343 6344 return (__crt_realloc(cp, nbytes)); 6345 } 6346 6347 extern int _rtld_version__FreeBSD_version __exported; 6348 int _rtld_version__FreeBSD_version = __FreeBSD_version; 6349 6350 extern char _rtld_version_laddr_offset __exported; 6351 char _rtld_version_laddr_offset; 6352 6353 extern char _rtld_version_dlpi_tls_data __exported; 6354 char _rtld_version_dlpi_tls_data; 6355