1 /* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9 * or http://www.opensolaris.org/os/licensing. 10 * See the License for the specific language governing permissions 11 * and limitations under the License. 12 * 13 * When distributing Covered Code, include this CDDL HEADER in each 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15 * If applicable, add the following below this CDDL HEADER, with the 16 * fields enclosed by brackets "[]" replaced with your own identifying 17 * information: Portions Copyright [yyyy] [name of copyright owner] 18 * 19 * CDDL HEADER END 20 */ 21 22 /* 23 * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 24 * Use is subject to license terms. 25 */ 26 #ifndef _RTLD_H 27 #define _RTLD_H 28 29 /* 30 * Global include file for the runtime linker. 31 */ 32 #include <sys/mman.h> 33 #include <time.h> 34 #include <sgs.h> 35 #include <thread.h> 36 #include <synch.h> 37 #include <link.h> 38 #include <sys/avl.h> 39 #include <alist.h> 40 #include <libc_int.h> 41 42 #ifdef _SYSCALL32 43 #include <inttypes.h> 44 #endif 45 46 #ifdef __cplusplus 47 extern "C" { 48 #endif 49 50 /* 51 * We use rtld_ino_t instead of ino_t so that we can get 52 * access to large inode values from 32-bit code. 53 */ 54 #ifdef _LP64 55 typedef ino_t rtld_ino_t; 56 #else 57 typedef ino64_t rtld_ino_t; 58 #endif 59 60 typedef struct rt_map Rt_map; 61 typedef struct slookup Slookup; 62 63 /* 64 * A binding descriptor. Establishes the binding relationship between two 65 * objects, the caller (originator) and the dependency (destination). 66 * 67 * Every relationship between two objects is tracked by a binding descriptor. 68 * This descriptor is referenced from a link-map's DEPENDS and CALLERS lists. 69 * Note, Aplist's are diagramed to fully expose the allocations required to 70 * establish the data structure relationships. 71 * 72 * Bnd_desc 73 * ---------- 74 * ------------| b_caller | 75 * | | b_depend | ---------- 76 * | | | | 77 * Rt_map | ---------- | Rt_map 78 * ---------- | ^ ^ | ---------- 79 * | | <-- | | --> | | 80 * | | -------- | | | | 81 * | DEPENDS | ----> | | | | -------- | | 82 * | | | | | | | | <---- | CALLERS | 83 * | | | | --- | | | | | 84 * | | | | --- | | | | 85 * | | -------- | | | | 86 * ---------- Aplist -------- ---------- 87 * Aplist 88 */ 89 typedef struct { 90 Rt_map *b_caller; /* caller (originator) of a binding */ 91 Rt_map *b_depend; /* dependency (destination) of a */ 92 /* binding */ 93 uint_t b_flags; /* relationship of caller to the */ 94 /* dependency */ 95 } Bnd_desc; 96 97 #define BND_NEEDED 0x0001 /* caller NEEDED the dependency */ 98 #define BND_REFER 0x0002 /* caller relocation references the */ 99 /* dependency */ 100 #define BND_FILTER 0x0004 /* binding identifies filter, used */ 101 /* for diagnostics only */ 102 /* 103 * Private structure for communication between rtld_db and rtld. 104 * 105 * We must bump the version number when ever an update in one of the 106 * structures/fields that rtld_db reads is updated. This hopefully permits 107 * rtld_db implementations of the future to recognize core files produced on 108 * older systems and deal with these core files accordingly. 109 * 110 * As of version 'R_RTLDDB_VERSION <= 2' the following fields were valid for 111 * core file examination (basically the public Link_map): 112 * 113 * ADDR() 114 * NAME() 115 * DYN() 116 * NEXT() 117 * PREV() 118 * 119 * Valid fields for R_RTLDDB_VERSION3 120 * 121 * PATHNAME() 122 * PADSTART() 123 * PADIMLEN() 124 * MSIZE() 125 * FLAGS() 126 * FLAGS1() 127 * 128 * Valid fields for R_RTLDDB_VERSION4 129 * 130 * TLSMODID() 131 * 132 * Valid fields for R_RTLDDB_VERSION5 133 * 134 * Added rtld_flags & FLG_RT_RELOCED to stable flags range 135 * 136 */ 137 #define R_RTLDDB_VERSION1 1 /* base version level - used for core */ 138 /* file examination */ 139 #define R_RTLDDB_VERSION2 2 /* minor revision - not relevant for */ 140 /* core files */ 141 #define R_RTLDDB_VERSION3 3 142 #define R_RTLDDB_VERSION4 4 143 #define R_RTLDDB_VERSION5 5 144 #define R_RTLDDB_VERSION R_RTLDDB_VERSION5 /* current version */ 145 146 typedef struct rtld_db_priv { 147 struct r_debug rtd_rdebug; /* original r_debug structure */ 148 Word rtd_version; /* version no. */ 149 size_t rtd_objpad; /* padding around mmap()ed objects */ 150 APlist **rtd_dynlmlst; /* pointer to dynlm_list pointer */ 151 } Rtld_db_priv; 152 153 #ifdef _SYSCALL32 154 typedef struct rtld_db_priv32 { 155 struct r_debug32 rtd_rdebug; /* original r_debug structure */ 156 Elf32_Word rtd_version; /* version no. */ 157 Elf32_Word rtd_objpad; /* padding around mmap()ed objects */ 158 Elf32_Addr rtd_dynlmlst; /* pointer to dynlm_list */ 159 } Rtld_db_priv32; 160 #endif /* _SYSCALL32 */ 161 162 /* 163 * External function definitions. ld.so.1 must convey information to libc in 164 * regards to threading. libc also provides routines for atexit() and message 165 * localization. libc provides the necessary interfaces via its RTLDINFO 166 * structure and/or later _ld_libc() calls. 167 * 168 * These external functions are maintained for each link-map list, and used 169 * where appropriate. The functions are associated with the object that 170 * provided them, so that should the object be deleted (say, from an alternative 171 * link-map), the functions can be removed. 172 */ 173 typedef struct { 174 Rt_map *lc_lmp; /* function provider */ 175 union { 176 int (*lc_func)(); /* external function pointer */ 177 uintptr_t lc_val; /* external value */ 178 char *lc_ptr; /* external character pointer */ 179 } lc_un; 180 } Lc_desc; 181 182 /* 183 * Link map list definition. Link-maps are used to describe each loaded object. 184 * Lists of these link-maps describe the various namespaces within a process. 185 * The process executable and its dependencies are maintained on the lml_main 186 * list. The runtime linker, and its dependencies are maintained on the 187 * lml_rtld list. Additional lists can be created (see dlmopen()) for such 188 * things as auditors and their dependencies. 189 * 190 * Each link-map list maintains an Alist of one, or more, linked lists of 191 * link-maps. For backward compatibility, the lm_head/lm_tail elements are 192 * initialized to the first linked-list of link-maps: 193 * 194 * Lm_list 195 * ---------- 196 * | lm_tail | ------------------------------------ 197 * | lm_head | -------------------- | 198 * | | | Rt_map | Rt_map 199 * | | | ------ | ------ 200 * | | Alist --> | | |--> | | 201 * | | --------- | | | -- | | 202 * | lm_lists | ----> | | | | | --> | | 203 * | | |---------| | | | | | | 204 * | | | lc_head | -- ------ | ------ 205 * | | | lc_tail | ------------------ 206 * | | |---------| 207 * ---------- | lc_head | 208 * | lc_tail | 209 * |---------| 210 * 211 * Multiple link-map lists exist to support the addition of lazy loaded 212 * families, filtee families, and dlopen() families. The intent of these 213 * lists is to insure that a family of objects that are to be loaded are 214 * fully relocatable, and hence usable, before they become part of the main 215 * (al_data[0]) link-map control list. This main link-map control list is 216 * the only list in existence when control is transferred to user code. 217 * 218 * During process initialization, the dynamic executable and its non-lazy 219 * dependencies are maintained on al_data[0]. If a new object is loaded, then 220 * this object is added to the next available control list [1], typically 221 * al_data[1]. Any dependencies of this object that have not already been 222 * loaded are added to the same control list. Once all of the objects on the 223 * new control list have been successfully relocated, the objects are moved from 224 * the new control list to the highest control list to which objects of the new 225 * control list bound to, typically al_data[1] to al_data[0]. 226 * 227 * Each loading scenario can be broken down as follows: 228 * 229 * setup() - only the initial link-map control list is used: 230 * i. create al_data[0] 231 * ii. add new link-map for main on al_data[0] 232 * iii. analyze al_data[0] to add all non-lazy dependencies 233 * iv. relocate al_data[0] dependencies. 234 * 235 * dlopen() - the initiator can only be the initial link-map control list: 236 * i. create al_data[1] from caller al_data[0] 237 * ii. add new link-map for the dlopen'ed object on al_data[1] 238 * iii. analyze al_data[1] to add all non-lazy dependencies 239 * iv. relocate al_data[1] dependencies, and move to al_data[0]. 240 * 241 * filtee and lazy loading processing - the initiator can be any link-map 242 * control list that is being relocated: 243 * i. create al_data[y] from caller al_data[x] 244 * ii. add new link-map for the new object on al_data[y] 245 * iii. analyze al_data[y] to add all non-lazy dependencies 246 * iv. relocate al_data[y] dependencies, and move to al_data[x]. 247 * 248 * This Alist therefore maintains a stack of link-map control lists. The newest 249 * link-map control list can locate symbols within any of the former lists, 250 * however, control is not passed to a former list until the newest lists 251 * processing is complete. Thus, objects can't bind to new objects until they 252 * have been fully analyzed and relocated. 253 * 254 * [1] Note, additional link-map control list creation occurs after the head 255 * link-map object (typically the dynamic executable) has been relocated. This 256 * staging is required to satisfy the binding requirements of copy relocations. 257 * Copy relocations, effectively, transfer the bindings of the copied data 258 * (say _iob in libc.so.1) to the copy location (_iob in the application). 259 * Thus an object that might bind to the original copy data must be redirected 260 * to the copy reference. As the knowledge of a copy relocation having taken 261 * place is only known after relocating the application, link-map control list 262 * additions are suspended until after this relocation has completed. 263 */ 264 typedef struct { 265 Rt_map *lc_head; 266 Rt_map *lc_tail; 267 APlist *lc_now; /* pending promoted bind-now objects */ 268 uint_t lc_flags; 269 } Lm_cntl; 270 271 #define LMC_FLG_ANALYZING 0x01 /* control list is being analyzed */ 272 #define LMC_FLG_RELOCATING 0x02 /* control list is being relocated */ 273 #define LMC_FLG_REANALYZE 0x04 /* repeat analysis (established when */ 274 /* interposers are added */ 275 276 struct lm_list { 277 /* 278 * BEGIN: Exposed to rtld_db - don't move, don't delete 279 */ 280 Rt_map *lm_head; /* linked list pointers to active */ 281 Rt_map *lm_tail; /* link-map list */ 282 APlist *lm_handle; /* not used by rtld_db - but spacing */ 283 /* is required for flags */ 284 Word lm_flags; 285 /* 286 * END: Exposed to rtld_db - don't move, don't delete 287 */ 288 Alist *lm_rti; /* list of RTLDINFO tables */ 289 Audit_list *lm_alp; /* audit list descriptor */ 290 avl_tree_t *lm_fpavl; /* avl tree of objects loaded */ 291 Alist *lm_lists; /* active and pending link-map lists */ 292 char ***lm_environ; /* pointer to environment array */ 293 Word lm_tflags; /* transferable flags */ 294 uint_t lm_obj; /* total number of objs on link-map */ 295 uint_t lm_init; /* new obj since last init processing */ 296 uint_t lm_lazy; /* number of objects with pending */ 297 /* lazy dependencies */ 298 uint_t lm_tls; /* new obj that require TLS */ 299 uint_t lm_lmid; /* unique link-map list identifier, */ 300 char *lm_lmidstr; /* and associated diagnostic string */ 301 APlist *lm_actaudit; /* list of pending audit activity */ 302 Lc_desc lm_lcs[CI_MAX]; /* external libc functions */ 303 }; 304 305 #ifdef _SYSCALL32 306 struct lm_list32 { 307 /* 308 * BEGIN: Exposed to rtld_db - don't move, don't delete 309 */ 310 Elf32_Addr lm_head; 311 Elf32_Addr lm_tail; 312 Elf32_Addr lm_handle; 313 Elf32_Word lm_flags; 314 /* 315 * END: Exposed to rtld_db - don't move, don't delete 316 */ 317 Elf32_Addr lm_rti; 318 Elf32_Addr lm_fpavl; 319 Elf32_Addr lm_lists; 320 Elf32_Addr lm_environ; 321 Elf32_Word lm_tflags; 322 uint_t lm_obj; 323 uint_t lm_init; 324 uint_t lm_lazy; 325 uint_t lm_tls; 326 uint_t lm_lmid; 327 Elf32_Addr lm_lmidstr; 328 Elf32_Addr lm_actaudit; 329 Elf32_Addr lm_lcs[CI_MAX]; 330 }; 331 #endif /* _SYSCALL32 */ 332 333 /* 334 * Possible Link_map list flags (Lm_list.lm_flags) 335 */ 336 /* 337 * BEGIN: Exposed to rtld_db - don't move, don't delete 338 */ 339 #define LML_FLG_BASELM 0x00000001 /* primary link-map */ 340 #define LML_FLG_RTLDLM 0x00000002 /* rtld link-map */ 341 /* 342 * END: Exposed to rtld_db - don't move, don't delete 343 */ 344 #define LML_FLG_NOAUDIT 0x00000004 /* symbol auditing disabled */ 345 #define LML_FLG_PLTREL 0x00000008 /* deferred plt relocation */ 346 /* initialization */ 347 /* (ld.so.1 only) */ 348 #define LML_FLG_HOLDLOCK 0x00000010 /* hold the rtld mutex lock */ 349 #define LML_FLG_ENVIRON 0x00000020 /* environ var initialized */ 350 #define LML_FLG_INTRPOSE 0x00000040 /* interposing objs on list */ 351 #define LML_FLG_LOCAUDIT 0x00000080 /* local auditors exists for */ 352 /* this link-map list */ 353 #define LML_FLG_LOADAVAIL 0x00000100 /* load anything available */ 354 #define LML_FLG_IGNRELERR 0x00000200 /* ignore relocation errors - */ 355 /* internal for crle(1) */ 356 #define LML_FLG_DBNOTIF 0x00000400 /* binding activity going on */ 357 #define LML_FLG_STARTREL 0x00000800 /* relocation started */ 358 #define LML_FLG_ATEXIT 0x00001000 /* atexit processing */ 359 #define LML_FLG_OBJADDED 0x00002000 /* object(s) added */ 360 #define LML_FLG_OBJDELETED 0x00004000 /* object(s) deleted */ 361 #define LML_FLG_OBJREEVAL 0x00008000 /* existing object(s) needs */ 362 /* tsort reevaluation */ 363 #define LML_FLG_INTRPOSETSORT 0x00020000 /* interpose tsorting done */ 364 #define LML_FLG_AUDITNOTIFY 0x00040000 /* audit consistent required */ 365 #define LML_FLG_GROUPSEXIST 0x00080000 /* local groups exist */ 366 367 #define LML_FLG_TRC_LDDSTUB 0x00100000 /* identify lddstub */ 368 #define LML_FLG_TRC_ENABLE 0x00200000 /* tracing enabled (ldd) */ 369 #define LML_FLG_TRC_WARN 0x00400000 /* print warnings for undefs */ 370 #define LML_FLG_TRC_VERBOSE 0x00800000 /* verbose (versioning) trace */ 371 #define LML_FLG_TRC_SEARCH 0x01000000 /* trace search paths */ 372 #define LML_FLG_TRC_UNREF 0x02000000 /* trace unreferenced */ 373 /* dependencies */ 374 #define LML_FLG_TRC_UNUSED 0x04000000 /* trace unused dependencies */ 375 #define LML_FLG_TRC_INIT 0x08000000 /* print .init order */ 376 #define LML_FLG_TRC_NOUNRESWEAK 0x10000000 /* unresolved weak references */ 377 /* are not allowed */ 378 #define LML_FLG_TRC_NOPAREXT 0x20000000 /* unresolved PARENT/EXTERN */ 379 /* references are not */ 380 /* allowed */ 381 #define LML_MSK_TRC 0xfff00000 /* tracing mask */ 382 383 /* 384 * Possible Link_map transferable flags (Lm_list.lm_tflags), i.e., link-map 385 * list flags that can be propagated to any new link-map list created. 386 */ 387 #define LML_TFLG_NOLAZYLD 0x00000001 /* lazy loading disabled */ 388 #define LML_TFLG_NODIRECT 0x00000002 /* direct bindings disabled */ 389 390 #define LML_TFLG_LOADFLTR 0x00000008 /* trigger filtee loading */ 391 392 #define LML_TFLG_AUD_PREINIT 0x00001000 /* preinit (audit) exists */ 393 #define LML_TFLG_AUD_OBJSEARCH 0x00002000 /* objsearch (audit) exists */ 394 #define LML_TFLG_AUD_OBJOPEN 0x00004000 /* objopen (audit) exists */ 395 #define LML_TFLG_AUD_OBJFILTER 0x00008000 /* objfilter (audit) exists */ 396 #define LML_TFLG_AUD_OBJCLOSE 0x00010000 /* objclose (audit) exists */ 397 #define LML_TFLG_AUD_SYMBIND 0x00020000 /* symbind (audit) exists */ 398 #define LML_TFLG_AUD_PLTENTER 0x00040000 /* pltenter (audit) exists */ 399 #define LML_TFLG_AUD_PLTEXIT 0x00080000 /* pltexit (audit) exists */ 400 #define LML_TFLG_AUD_ACTIVITY 0x00100000 /* activity (audit) exists */ 401 402 /* 403 * NOTE: Each auditing module establishes a set of audit flags, AFLAGS(), that 404 * define the auditing interfaces the module offers. These auditing flags are 405 * the LML_TFLG_AUD_ flags defined above. Global auditors result in setting 406 * the lm_tflags too. Local auditors only use the AFLAGS(). All tests for 407 * auditing inspect the lm_tflags and AFLAGS() for a specific auditing 408 * interface, and thus use the same flag to test for both types of auditors. 409 */ 410 #define LML_TFLG_AUD_MASK 0x0ffff000 /* audit interfaces mask */ 411 412 /* 413 * Define a Group Handle. 414 * 415 * The capability of ld.so.1 to associate a group of objects, look for symbols 416 * within that group, ensure that groups are isolated from one another (with 417 * regard to relocations), and to unload a group, centers around a handle. 418 * 419 * Dependencies can be added to an existing handle as the dependencies are 420 * lazily loaded. The core dependencies on the handle are the ldd(1) list of 421 * the referenced object. 422 * 423 * Handles can be created from: 424 * 425 * - a dlopen() request. This associates a caller to a reference object, 426 * and the referenced objects dependencies. This group of objects can 427 * then be inspected for symbols (dlsym()). 428 * - a filtering request. This associates a filter (caller) to a referenced 429 * object (filtee). The redirection of filter symbols to their filtee 430 * counterpart is essentially a dlsym() using the filtee's handle. 431 * 432 * The handle created for these events is referred to as a public handle. This 433 * handle tracks the referenced object, all of the dependencies of the 434 * referenced object, and the caller (parent). 435 * 436 * Presently, an object may have two handles, one requested with RTLD_FIRST 437 * and one without. 438 * 439 * A handle may be referenced by any number of callers (parents). A reference 440 * count tracks the number. A dlclose() operation drops the reference count, 441 * and when the count is zero, the handle is used to determine the family of 442 * objects to unload. As bindings may occur to objects on the handle from 443 * other handles, it may not be possible to remove a complete family of objects 444 * or the handle itself. Handles in this state are moved to an orphan list. 445 * A handle on the orphan list is taken off the orphan list if the associated 446 * object is reopened. Otherwise, the handle remains on the orphan list for 447 * the duration of the process. The orphan list is inspected any time objects 448 * are unloaded, to determine if the orphaned objects can also be unloaded. 449 * 450 * Handles can also be created for internal uses: 451 * 452 * - to promote objects to RTLD_NOW. 453 * - to establish families for symbol binding fallback, required when lazy 454 * loadable objects are still pending. 455 * 456 * The handle created for these events is referred to as a private handle. This 457 * handle does not need to track the caller (parent), and because of this, does 458 * not need to be considered during dlclose() operations, as the handle can not 459 * be referenced by callers outside of the referenced objects family. 460 * 461 * Note, a private handle is essentially a subset of a public handle. Should 462 * an internal operation require a private handle, and a public handle already 463 * exist, the public handle can be used. Should an external operation require 464 * a public handle, and a private handle exist, the private handle is promoted 465 * to a public handle. Any handle that gets created will remain in existence 466 * for the life time of the referenced object. 467 * 468 * Objects can be dlopened using RTLD_NOW. This attribute requires that all 469 * relocations of the object, and its dependencies are processed immediately, 470 * before return to the caller. Typically, an object is loaded without 471 * RTLD_NOW, and procedure linkage relocations are satisfied when their 472 * associated function is first called. If an object is already loaded, and an 473 * RTLD_NOW request is made, then the object, and its dependencies, most undergo 474 * additional relocation processing. This promotion from lazy binding to 475 * immediate binding is carried out using handles, as the handle defines the 476 * dependencies that must be processed. 477 * 478 * To ensure that objects within a lazy loadable environment can be relocated, 479 * no matter whether the objects have their dependencies described completely, 480 * a symbol lookup fallback is employed. Any pending lazy loadable objects are 481 * loaded, and a handle established to search the object and it's dependencies 482 * for the required symbol. 483 * 484 * A group handle (and its associated group descriptors), is referenced from 485 * a link-map's HANDLES and GROUPS lists. Note, Aplist's are diagramed to 486 * fully expose the allocations required to establish the data structure 487 * relationships. 488 * 489 * Grp_desc 490 * Alist 491 * ----------- 492 * --> | | 493 * | |-----------| 494 * | | gd_depend | --------- 495 * | | | | 496 * | |-----------| | 497 * --------|--- | gd_depend | | 498 * | | | (parent) | | 499 * | | |-----------| | 500 * | | | gd_depend | | 501 * | | | | | 502 * | | | | | 503 * | | ----------- | 504 * | | | 505 * | | Grp_hdl | 506 * | | ----------- | 507 * | -- | gh_depends | | 508 * | --------- | gh_ownlmp | | 509 * | | | | | 510 * | | | | | 511 * | | | | | 512 * Rt_map | | ------------ | Rt_map 513 * ---------- | | ^ ^ | ---------- 514 * | | <- | | | --> | | 515 * | | <--- -------- | | | | 516 * | HANDLES | ----> | | | | -------- | | 517 * | | | | | | | | <---- | GROUPS | 518 * | | | | --- | | | | | 519 * | | | | --- | | | | 520 * | | -------- | | | | 521 * ---------- Aplist -------- ---------- 522 * Aplist 523 */ 524 typedef struct { 525 Alist *gh_depends; /* handle dependency list */ 526 Rt_map *gh_ownlmp; /* handle owners link-map */ 527 Lm_list *gh_ownlml; /* handle owners link-map list */ 528 uint_t gh_refcnt; /* handle reference count */ 529 uint_t gh_flags; /* handle flags (GPH_ values) */ 530 } Grp_hdl; 531 532 /* 533 * Define the two categories of handle. 534 */ 535 #define GPH_PUBLIC 0x0001 /* handle returned to caller(s) */ 536 #define GPH_PRIVATE 0x0002 /* handle used internally */ 537 538 /* 539 * Define any flags that affects how the handle is used. 540 */ 541 #define GPH_ZERO 0x0010 /* special handle for dlopen(0) */ 542 #define GPH_LDSO 0x0020 /* special handle for ld.so.1 */ 543 #define GPH_FIRST 0x0040 /* dlsym() can only use originating */ 544 /* dependency */ 545 #define GPH_FILTEE 0x0080 /* handle identifies a filtee, used */ 546 /* for diagnostics only */ 547 /* 548 * Define any state that is associated with the handle. 549 */ 550 #define GPH_INITIAL 0x0100 /* handle is initialized */ 551 552 /* 553 * Define a Group Descriptor. 554 * 555 * Each dependency associated with a group handle is maintained by a group 556 * descriptor. The descriptor defines the associated dependency together with 557 * flags that indicate how the dependency can be used. 558 */ 559 typedef struct { 560 Rt_map *gd_depend; /* dependency */ 561 uint_t gd_flags; /* dependency flags (GPD_ values) */ 562 } Grp_desc; 563 564 #define GPD_DLSYM 0x0001 /* dependency available to dlsym() */ 565 #define GPD_RELOC 0x0002 /* dependency available to satisfy */ 566 /* relocation binding */ 567 #define GPD_ADDEPS 0x0004 /* dependencies of this dependency */ 568 /* should be added to handle */ 569 #define GPD_PARENT 0x0008 /* dependency is a parent */ 570 #define GPD_FILTER 0x0010 /* dependency is our filter */ 571 #define GPD_REMOVE 0x0100 /* descriptor is a candidate for */ 572 /* removal from the group */ 573 574 /* 575 * Define threading structures. For compatibility with libthread (T1_VERSION 1 576 * and TI_VERSION 2) our locking structure is sufficient to hold a mutex or a 577 * readers/writers lock. 578 */ 579 typedef struct { 580 union { 581 mutex_t l_mutex; 582 rwlock_t l_rwlock; 583 } u; 584 } Rt_lock; 585 586 typedef cond_t Rt_cond; 587 588 /* 589 * Define a dynamic section information descriptor. This parallels the entries 590 * in the .dynamic section and holds auxiliary information to implement lazy 591 * loading and filtee processing. 592 */ 593 typedef struct { 594 uint_t di_flags; 595 void *di_info; 596 } Dyninfo; 597 598 #define FLG_DI_STDFLTR 0x00001 /* .dynamic entry for DT_FILTER */ 599 #define FLG_DI_AUXFLTR 0x00002 /* .dynamic entry for DT_AUXILIARY */ 600 #define FLG_DI_SYMFLTR 0x00004 /* .dynamic entry for DT_SYMFILTER */ 601 /* and DT_SYMAUXILIARY */ 602 #define MSK_DI_FILTER 0x0000f /* mask for all filter possibilities */ 603 604 #define FLG_DI_POSFLAG1 0x00010 /* .dynamic entry for DT_POSFLAG_1 */ 605 #define FLG_DI_NEEDED 0x00020 /* .dynamic entry for DT_NEEDED */ 606 #define FLG_DI_LAZY 0x00100 /* lazy needed entry - preceded by */ 607 /* DF_P1_LAZYLOAD (DT_POSFLAG_1) */ 608 #define FLG_DI_GROUP 0x00200 /* group needed entry - preceded by */ 609 /* DF_P1_GROUPPERM (DT_POSFLAG_1) */ 610 611 #define FLG_DI_LDD_DONE 0x01000 /* entry has been processed (ldd) */ 612 #define FLG_DI_LAZYFAIL 0x02000 /* the lazy loading of this entry */ 613 /* failed */ 614 /* 615 * Data structure to track AVL tree of pathnames. This structure provides the 616 * basis of both the "not-found" node tree, and the "full-path" node tree. Both 617 * of these trees persist for the life of a process, although the "not-found" 618 * tree may be moved aside during a dlopen() or dlsym() fall back operation. 619 */ 620 typedef struct { 621 const char *pn_name; /* path name */ 622 avl_node_t pn_avl; /* avl book-keeping (see SGSOFFSETOF) */ 623 uint_t pn_hash; /* path name hash value */ 624 } PathNode; 625 626 /* 627 * Data structure to track AVL tree for full path names of objects that are 628 * loaded into memory. 629 */ 630 typedef struct { 631 PathNode fpn_node; /* path node */ 632 Rt_map *fpn_lmp; /* object link-map */ 633 } FullPathNode; 634 635 /* 636 * A given link-map can hold either a supplier or receiver copy 637 * relocation list, but not both. This union is used to overlap 638 * the space used for the two lists. 639 */ 640 typedef union { 641 Alist *rtc_r; /* receiver list (Rel_copy) */ 642 APlist *rtc_s; /* supplier list (Rt_map *) */ 643 } Rt_map_copy; 644 645 646 /* 647 * Link-map definition. 648 */ 649 struct rt_map { 650 /* 651 * BEGIN: Exposed to rtld_db - don't move, don't delete 652 */ 653 Link_map rt_public; /* public data */ 654 const char *rt_pathname; /* full pathname of loaded object */ 655 ulong_t rt_padstart; /* start of image (including padding) */ 656 ulong_t rt_padimlen; /* size of image (including padding */ 657 ulong_t rt_msize; /* total memory reservation range */ 658 uint_t rt_flags; /* state flags, see FLG below */ 659 uint_t rt_flags1; /* state flags1, see FL1 below */ 660 ulong_t rt_tlsmodid; /* TLS module id */ 661 /* 662 * END: Exposed to rtld_db - don't move, don't delete 663 */ 664 APlist *rt_alias; /* list of linked file names */ 665 APlist *rt_fpnode; /* list of FullpathNode AVL nodes */ 666 char *rt_runpath; /* LD_RUN_PATH and its equivalent */ 667 Alist *rt_runlist; /* Pdesc structures */ 668 APlist *rt_depends; /* list of dependencies */ 669 APlist *rt_callers; /* list of callers */ 670 APlist *rt_handles; /* dlopen handles */ 671 APlist *rt_groups; /* groups we're a member of */ 672 struct fct *rt_fct; /* file class table for this object */ 673 void *rt_priv; /* private data, object type specific */ 674 Lm_list *rt_list; /* link map list we belong to */ 675 uint_t rt_objfltrndx; /* object filtees .dynamic index */ 676 uint_t rt_symsfltrcnt; /* number of standard symbol filtees */ 677 uint_t rt_symafltrcnt; /* number of auxiliary symbol filtees */ 678 int rt_mode; /* usage mode, see RTLD mode flags */ 679 int rt_sortval; /* temporary buffer to traverse graph */ 680 uint_t rt_cycgroup; /* cyclic group */ 681 dev_t rt_stdev; /* device id and inode number for .so */ 682 rtld_ino_t rt_stino; /* multiple inclusion checks */ 683 const char *rt_origname; /* original pathname of loaded object */ 684 size_t rt_dirsz; /* and its size */ 685 size_t rt_lmsize; /* size of the link-map allocation */ 686 Rt_map_copy rt_copy; /* list of copy relocations */ 687 Audit_desc *rt_auditors; /* audit descriptor array */ 688 Audit_info *rt_audinfo; /* audit information descriptor */ 689 Syminfo *rt_syminfo; /* elf .syminfo section - here */ 690 /* because it is checked in */ 691 /* common code */ 692 Addr *rt_initarray; /* .initarray table */ 693 Addr *rt_finiarray; /* .finiarray table */ 694 Addr *rt_preinitarray; /* .preinitarray table */ 695 mmapobj_result_t *rt_mmaps; /* array of mapping information */ 696 uint_t rt_mmapcnt; /* and associated number */ 697 uint_t rt_initarraysz; /* size of .initarray table */ 698 uint_t rt_finiarraysz; /* size of .finiarray table */ 699 uint_t rt_preinitarraysz; /* size of .preinitarray table */ 700 Dyninfo *rt_dyninfo; /* .dynamic information descriptors */ 701 uint_t rt_dyninfocnt; /* count of dyninfo entries */ 702 uint_t rt_relacount; /* no. of RELATIVE relocations */ 703 uint_t rt_idx; /* hold index within linkmap list */ 704 uint_t rt_lazy; /* number of lazy dependencies */ 705 /* pending */ 706 Xword rt_hwcap; /* hardware capabilities */ 707 Xword rt_sfcap; /* software capabilities */ 708 uint_t rt_cntl; /* link-map control list we belong to */ 709 uint_t rt_aflags; /* auditor flags, see LML_TFLG_AUD_ */ 710 /* address of _init */ 711 void (*rt_init)(void); 712 /* address of _fini */ 713 void (*rt_fini)(void); 714 /* link map symbol interpreter */ 715 Sym *(*rt_symintp)(Slookup *, Rt_map **, uint_t *, int *); 716 }; 717 718 #ifdef _SYSCALL32 719 /* 720 * Structure to allow 64-bit rtld_db to read 32-bit processes out of procfs. 721 */ 722 typedef union { 723 uint32_t rtc_r; 724 uint32_t rtc_s; 725 } Rt_map_copy32; 726 727 typedef struct rt_map32 { 728 /* 729 * BEGIN: Exposed to rtld_db - don't move, don't delete 730 */ 731 Link_map32 rt_public; 732 uint32_t rt_pathname; 733 uint32_t rt_padstart; 734 uint32_t rt_padimlen; 735 uint32_t rt_msize; 736 uint32_t rt_flags; 737 uint32_t rt_flags1; 738 uint32_t rt_tlsmodid; 739 /* 740 * END: Exposed to rtld_db - don't move, don't delete 741 */ 742 uint32_t rt_alias; 743 uint32_t rt_fpnode; 744 uint32_t rt_runpath; 745 uint32_t rt_runlist; 746 uint32_t rt_depends; 747 uint32_t rt_callers; 748 uint32_t rt_handles; 749 uint32_t rt_groups; 750 uint32_t rt_fct; 751 uint32_t rt_priv; 752 uint32_t rt_list; 753 uint32_t rt_objfltrndx; 754 uint32_t rt_symsfltrcnt; 755 uint32_t rt_symafltrcnt; 756 int32_t rt_mode; 757 int32_t rt_sortval; 758 uint32_t rt_cycgroup; 759 uint32_t rt_stdev; 760 uint32_t rt_stino; 761 uint32_t rt_origname; 762 uint32_t rt_dirsz; 763 Rt_map_copy32 rt_copy; 764 uint32_t rt_auditors; 765 uint32_t rt_audinfo; 766 uint32_t rt_syminfo; 767 uint32_t rt_initarray; 768 uint32_t rt_finiarray; 769 uint32_t rt_preinitarray; 770 uint32_t rt_mmaps; 771 uint32_t rt_mmapcnt; 772 uint32_t rt_initarraysz; 773 uint32_t rt_finiarraysz; 774 uint32_t rt_preinitarraysz; 775 uint32_t rt_dyninfo; 776 uint32_t rt_dyninfocnt; 777 uint32_t rt_relacount; 778 uint32_t rt_idx; 779 uint32_t rt_lazy; 780 uint32_t rt_hwcap; 781 uint32_t rt_sfcap; 782 uint32_t rt_cntl; 783 uint32_t rt_aflags; 784 uint32_t rt_init; 785 uint32_t rt_fini; 786 uint32_t rt_symintp; 787 } Rt_map32; 788 789 #endif /* _SYSCALL32 */ 790 791 /* 792 * Link map state flags. 793 */ 794 /* 795 * BEGIN: Exposed to rtld_db - don't move, don't delete 796 */ 797 #define FLG_RT_ISMAIN 0x00000001 /* object represents main executable */ 798 #define FLG_RT_IMGALLOC 0x00000002 /* image is allocated (not mmap'ed) */ 799 /* 800 * Available for r_debug version >= R_RTLDDB_VERSION5 801 */ 802 #define FLG_RT_RELOCED 0x00000004 /* object has been relocated */ 803 /* 804 * END: Exposed to rtld_db - don't move, don't delete 805 */ 806 #define FLG_RT_SETGROUP 0x00000008 /* group establishment required */ 807 #define FLG_RT_HWCAP 0x00000010 /* process $HWCAP expansion */ 808 #define FLG_RT_OBJECT 0x00000020 /* object processing (ie. .o's) */ 809 #define FLG_RT_NEWLOAD 0x00000040 /* object is newly loaded */ 810 #define FLG_RT_NODUMP 0x00000080 /* object can't be dldump(3x)'ed */ 811 #define FLG_RT_DELETE 0x00000100 /* object can be deleted */ 812 #define FLG_RT_ANALYZED 0x00000200 /* object has been analyzed */ 813 #define FLG_RT_INITDONE 0x00000400 /* objects .init has been completed */ 814 #define FLG_RT_TRANS 0x00000800 /* object is acting as a translator */ 815 #define FLG_RT_FIXED 0x00001000 /* image location is fixed */ 816 #define FLG_RT_PRELOAD 0x00002000 /* object was preloaded */ 817 #define FLG_RT_ALTER 0x00004000 /* alternative object used */ 818 #define FLG_RT_LOADFLTR 0x00008000 /* trigger filtee loading */ 819 #define FLG_RT_AUDIT 0x00010000 /* object is an auditor */ 820 #define FLG_RT_MODESET 0x00020000 /* MODE() has been initialized */ 821 #define FLG_RT_ANALZING 0x00040000 /* object is being analyzed */ 822 #define FLG_RT_INITFRST 0x00080000 /* execute .init first */ 823 #define FLG_RT_NOOPEN 0x00100000 /* dlopen() not allowed */ 824 #define FLG_RT_FINICLCT 0x00200000 /* fini has been collected (tsort) */ 825 #define FLG_RT_INITCALL 0x00400000 /* objects .init has been called */ 826 #define FLG_RT_OBJINTPO 0x00800000 /* object is a global interposer */ 827 #define FLG_RT_SYMINTPO 0x01000000 /* object contains symbol interposer */ 828 #define MSK_RT_INTPOSE 0x01800000 /* mask for all interposer */ 829 /* possibilities */ 830 #define FLG_RT_MOVE 0x02000000 /* object needs move operation */ 831 #define FLG_RT_RELOCING 0x04000000 /* object is being relocated */ 832 #define FLG_RT_REGSYMS 0x08000000 /* object has DT_REGISTER entries */ 833 #define FLG_RT_INITCLCT 0x10000000 /* init has been collected (tsort) */ 834 #define FLG_RT_PUBHDL 0x20000000 /* generate a handle for this object */ 835 #define FLG_RT_PRIHDL 0x40000000 /* either public or private */ 836 837 #define FL1_RT_COPYTOOK 0x00000001 /* copy relocation taken */ 838 839 #define FL1_RT_CONFSET 0x00000004 /* object was loaded by crle(1) */ 840 #define FL1_RT_NODEFLIB 0x00000008 /* ignore default library search */ 841 #define FL1_RT_ENDFILTE 0x00000010 /* filtee terminates filters search */ 842 #define FL1_RT_DISPREL 0x00000020 /* object has *disp* relocation */ 843 #define FL1_RT_DTFLAGS 0x00000040 /* DT_FLAGS element exists */ 844 845 #define FL1_RT_LDDSTUB 0x00000100 /* identify lddstub */ 846 #define FL1_RT_NOINIFIN 0x00000200 /* no .init or .fini exists */ 847 #define FL1_RT_USED 0x00000400 /* symbol referenced from this object */ 848 #define FL1_RT_SYMBOLIC 0x00000800 /* DF_SYMBOLIC was set - use */ 849 /* symbolic sym resolution */ 850 #define FL1_RT_OBJSFLTR 0x00001000 /* object is acting as a standard */ 851 #define FL1_RT_OBJAFLTR 0x00002000 /* or auxiliary filter */ 852 #define FL1_RT_SYMSFLTR 0x00004000 /* symbol is acting as a standard */ 853 #define FL1_RT_SYMAFLTR 0x00008000 /* or auxiliary filter */ 854 #define MSK_RT_FILTER 0x0000f000 /* mask for all filter possibilities */ 855 856 #define FL1_RT_TLSADD 0x00010000 /* objects TLS has been registered */ 857 #define FL1_RT_TLSSTAT 0x00020000 /* object requires static TLS */ 858 #define FL1_RT_DIRECT 0x00040000 /* object has DIRECT bindings enabled */ 859 #define FL1_RT_GLOBAUD 0x00080000 /* establish global auditing */ 860 861 /* 862 * Flags for the tls_modactivity() routine 863 */ 864 #define TM_FLG_MODADD 0x01 /* call tls_modadd() interface */ 865 #define TM_FLG_MODREM 0x02 /* call tls_modrem() interface */ 866 867 /* 868 * Macros for getting to exposed, link_map data (R_RTLDDB_VERSION <= 2). 869 */ 870 #define ADDR(X) ((X)->rt_public.l_addr) 871 #define NAME(X) ((X)->rt_public.l_name) 872 #define DYN(X) ((X)->rt_public.l_ld) 873 #define NEXT(X) ((X)->rt_public.l_next) 874 #define PREV(X) ((X)->rt_public.l_prev) 875 #define REFNAME(X) ((X)->rt_public.l_refname) 876 877 /* 878 * An Rt_map starts with a Link_map, followed by other information. 879 * ld.so.1 allocates Rt_map structures, and then casts them to Link_map, 880 * and back, depending on context. 881 * 882 * On some platforms, Rt_map can have a higher alignment requirement 883 * than Link_map. On such platforms, the cast from Link_map to Rt_map will 884 * draw an E_BAD_PTR_CAST_ALIGN warning from lint. Since we allocate 885 * the memory as the higher alignment Rt_map, we know that this is a safe 886 * conversion. The LINKMAP_TO_RTMAP macro is used to handle the conversion 887 * in a manner that satisfies lint. 888 */ 889 #ifdef lint 890 #define LINKMAP_TO_RTMAP(X) (Rt_map *)(void *)(X) 891 #else 892 #define LINKMAP_TO_RTMAP(X) (Rt_map *)(X) 893 #endif 894 895 /* 896 * Convenience macros for the common case of using 897 * NEXT()/PREV() and casting the result to (Rt_map *) 898 */ 899 #define NEXT_RT_MAP(X) LINKMAP_TO_RTMAP(NEXT(X)) 900 #define PREV_RT_MAP(X) LINKMAP_TO_RTMAP(PREV(X)) 901 902 /* 903 * Macros for getting to exposed, link_map data (R_RTLDDB_VERSION3). 904 */ 905 #define PATHNAME(X) ((X)->rt_pathname) 906 #define PADSTART(X) ((X)->rt_padstart) 907 #define PADIMLEN(X) ((X)->rt_padimlen) 908 #define MSIZE(X) ((X)->rt_msize) 909 #define FLAGS(X) ((X)->rt_flags) 910 #define FLAGS1(X) ((X)->rt_flags1) 911 912 /* 913 * Macros for getting to exposed, link_map data (R_RTLDDB_VERSION4). 914 */ 915 #define TLSMODID(X) ((X)->rt_tlsmodid) 916 917 /* 918 * Macros for getting to unexposed, link-map data. 919 */ 920 #define LMSIZE(X) ((X)->rt_lmsize) 921 #define AFLAGS(X) ((X)->rt_aflags) 922 #define ALIAS(X) ((X)->rt_alias) 923 #define FPNODE(X) ((X)->rt_fpnode) 924 #define INIT(X) ((X)->rt_init) 925 #define FINI(X) ((X)->rt_fini) 926 #define RPATH(X) ((X)->rt_runpath) 927 #define RLIST(X) ((X)->rt_runlist) 928 #define DEPENDS(X) ((X)->rt_depends) 929 #define CALLERS(X) ((X)->rt_callers) 930 #define HANDLES(X) ((X)->rt_handles) 931 #define GROUPS(X) ((X)->rt_groups) 932 #define FCT(X) ((X)->rt_fct) 933 #define SYMINTP(X) ((X)->rt_symintp) 934 #define LIST(X) ((X)->rt_list) 935 #define OBJFLTRNDX(X) ((X)->rt_objfltrndx) 936 #define SYMSFLTRCNT(X) ((X)->rt_symsfltrcnt) 937 #define SYMAFLTRCNT(X) ((X)->rt_symafltrcnt) 938 #define MODE(X) ((X)->rt_mode) 939 #define SORTVAL(X) ((X)->rt_sortval) 940 #define CYCGROUP(X) ((X)->rt_cycgroup) 941 #define STDEV(X) ((X)->rt_stdev) 942 #define STINO(X) ((X)->rt_stino) 943 #define ORIGNAME(X) ((X)->rt_origname) 944 #define DIRSZ(X) ((X)->rt_dirsz) 945 #define COPY_R(X) ((X)->rt_copy.rtc_r) 946 #define COPY_S(X) ((X)->rt_copy.rtc_s) 947 #define AUDITORS(X) ((X)->rt_auditors) 948 #define AUDINFO(X) ((X)->rt_audinfo) 949 #define SYMINFO(X) ((X)->rt_syminfo) 950 #define INITARRAY(X) ((X)->rt_initarray) 951 #define FINIARRAY(X) ((X)->rt_finiarray) 952 #define PREINITARRAY(X) ((X)->rt_preinitarray) 953 #define MMAPS(X) ((X)->rt_mmaps) 954 #define MMAPCNT(X) ((X)->rt_mmapcnt) 955 #define INITARRAYSZ(X) ((X)->rt_initarraysz) 956 #define FINIARRAYSZ(X) ((X)->rt_finiarraysz) 957 #define PREINITARRAYSZ(X) ((X)->rt_preinitarraysz) 958 #define DYNINFO(X) ((X)->rt_dyninfo) 959 #define DYNINFOCNT(X) ((X)->rt_dyninfocnt) 960 #define RELACOUNT(X) ((X)->rt_relacount) 961 #define IDX(X) ((X)->rt_idx) 962 #define LAZY(X) ((X)->rt_lazy) 963 #define CNTL(X) ((X)->rt_cntl) 964 #define HWCAP(X) ((X)->rt_hwcap) 965 #define SFCAP(X) ((X)->rt_sfcap) 966 967 /* 968 * Flags for tsorting. 969 */ 970 #define RT_SORT_FWD 0x01 /* topological sort (.fini) */ 971 #define RT_SORT_REV 0x02 /* reverse topological sort (.init) */ 972 #define RT_SORT_DELETE 0x10 /* process FLG_RT_DELETE objects */ 973 /* only (called via dlclose()) */ 974 #define RT_SORT_INTPOSE 0x20 /* process interposer objects */ 975 976 /* 977 * Flags for lookup_sym (and hence find_sym) routines. 978 */ 979 #define LKUP_DEFT 0x0000 /* simple lookup request */ 980 #define LKUP_SPEC 0x0001 /* special ELF lookup (allows address */ 981 /* resolutions to plt[] entries) */ 982 #define LKUP_LDOT 0x0002 /* indicates the original A_OUT */ 983 /* symbol had a leading `.' */ 984 #define LKUP_FIRST 0x0004 /* lookup symbol in first link map */ 985 /* only */ 986 #define LKUP_COPY 0x0008 /* lookup symbol for a COPY reloc, do */ 987 /* not bind to symbol at head */ 988 #define LKUP_STDRELOC 0x0010 /* lookup originates from a standard */ 989 /* relocation (elf_reloc()) */ 990 #define LKUP_SELF 0x0020 /* lookup symbol in ourself - undef */ 991 /* is valid */ 992 #define LKUP_WEAK 0x0040 /* relocation reference is weak */ 993 #define LKUP_NEXT 0x0080 /* request originates from RTLD_NEXT */ 994 #define LKUP_NODESCENT 0x0100 /* don't descend through dependencies */ 995 #define LKUP_NOFALLBACK 0x0200 /* don't fall back to loading */ 996 /* pending lazy dependencies */ 997 #define LKUP_DIRECT 0x0400 /* direct binding request */ 998 #define LKUP_SYMNDX 0x0800 /* establish symbol index */ 999 #define LKUP_SINGLETON 0x1000 /* search for a singleton symbol */ 1000 #define LKUP_STANDARD 0x2000 /* standard lookup - originated from */ 1001 /* head link-map element */ 1002 #define LKUP_WORLD 0x4000 /* ensure world lookup */ 1003 1004 /* 1005 * For the runtime linker to perform a symbol search, a number of data items 1006 * related to the search are required. An Slookup data structure is used to 1007 * convey this data to lookup_sym(), and in special cases, to other core 1008 * routines that provide the implementation details for lookup_sym() 1009 * 1010 * The symbol name (sl_name), the caller (sl_cmap), and the link-map from which 1011 * to start the search (sl_imap) are fundamental to the symbol search. The 1012 * initial search link-map might get modified by the core routines that provide 1013 * the implementation details for lookup_sym(). This modification accommodates 1014 * requirements such as processing a handle, direct binding and interposition. 1015 * The association between the caller and the potential destination also 1016 * determines whether the destination is a candidate to search. 1017 * 1018 * The lookup identifier (sl_id) is used to identify a runtime linker operation. 1019 * Within this operation, any lazy loads that fail are not re-examined. This 1020 * technique keeps the overhead of processing a failed lazy load to a minimum. 1021 * 1022 * Symbol searches that originate from a relocation record are accompanied by 1023 * the relocation index (sl_rsymndx), the symbol reference (sl_rsym) and 1024 * possibly the relocation type (sl_rtype). This data provides for determining 1025 * lazy loading, direct binding, and special symbol processing requirements 1026 * such as copy relocations and singleton lookup. 1027 * 1028 * The symbols hash value is computed by lookup_sym, and propagated throughout 1029 * the search engine. Note, occasionally the Slookup data is passed to a core 1030 * routine that provides the implementation details for lookup_sym(), ie. 1031 * elf_find_sym(), in which case the caller must initialize the hash value. 1032 * 1033 * The symbols binding information is established by lookup_sym() when the 1034 * symbols relocation type is supplied. Weak bindings allow relocations to 1035 * be set to zero should a symbol lookup fail. 1036 * 1037 * The flags allow the caller to control aspects of the search, including the 1038 * interpretation of copy relocations, etc. Note, a number of flag settings 1039 * are established in lookup_sym() from attributes of the symbol reference. 1040 */ 1041 struct slookup { 1042 const char *sl_name; /* symbol name */ 1043 Rt_map *sl_cmap; /* callers link-map */ 1044 Rt_map *sl_imap; /* initial link-map to search */ 1045 ulong_t sl_id; /* identifier for this lookup */ 1046 ulong_t sl_hash; /* symbol hash value */ 1047 ulong_t sl_rsymndx; /* referencing reloc symndx */ 1048 Sym *sl_rsym; /* referencing symbol */ 1049 uchar_t sl_rtype; /* relocation type associate with */ 1050 /* symbol */ 1051 uchar_t sl_bind; /* symbols binding (returned) */ 1052 uint_t sl_flags; /* lookup flags */ 1053 }; 1054 1055 #define SLOOKUP_INIT(sl, name, cmap, imap, id, hash, rsymndx, rsym, rtype, \ 1056 flags) \ 1057 (void) (sl.sl_name = (name), sl.sl_cmap = (cmap), sl.sl_imap = (imap), \ 1058 sl.sl_id = (id), sl.sl_hash = (hash), sl.sl_rsymndx = (rsymndx), \ 1059 sl.sl_rsym = (rsym), sl.sl_rtype = (rtype), sl.sl_bind = 0, \ 1060 sl.sl_flags = (flags)) 1061 1062 /* 1063 * Define a number of .plt lookup outcomes, for use in binding diagnostics. 1064 */ 1065 typedef enum { 1066 PLT_T_NONE = 0, 1067 PLT_T_21D, 1068 PLT_T_24D, 1069 PLT_T_U32, 1070 PLT_T_U44, 1071 PLT_T_FULL, 1072 PLT_T_FAR, 1073 PLT_T_NUM /* Must be last */ 1074 } Pltbindtype; 1075 1076 /* 1077 * Prototypes. 1078 */ 1079 extern ulong_t ld_entry_cnt; /* counter bumped on each entry to */ 1080 /* ld.so.1. */ 1081 extern Lm_list lml_main; /* main's link map list */ 1082 extern Lm_list lml_rtld; /* rtld's link map list */ 1083 extern Lm_list *lml_list[]; 1084 1085 extern Pltbindtype elf_plt_write(uintptr_t, uintptr_t, void *, uintptr_t, 1086 Xword); 1087 extern Rt_map *is_so_loaded(Lm_list *, const char *, int *); 1088 extern Sym *lookup_sym(Slookup *, Rt_map **, uint_t *, int *); 1089 extern int rt_dldump(Rt_map *, const char *, int, Addr); 1090 1091 #ifdef __cplusplus 1092 } 1093 #endif 1094 1095 #endif /* _RTLD_H */ 1096