ldso.c 32 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055
  1. /* Run an ELF binary on a linux system.
  2. Copyright (C) 1993-1996, Eric Youngdale.
  3. This program is free software; you can redistribute it and/or modify
  4. it under the terms of the GNU General Public License as published by
  5. the Free Software Foundation; either version 2, or (at your option)
  6. any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License
  12. along with this program; if not, write to the Free Software
  13. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
  14. /* Program to load an ELF binary on a linux system, and run it.
  15. * References to symbols in sharable libraries can be resolved by
  16. * an ELF sharable library. */
  17. /* Disclaimer: I have never seen any AT&T source code for SVr4, nor have
  18. I ever taken any courses on internals. This program was developed using
  19. information available through the book "UNIX SYSTEM V RELEASE 4,
  20. Programmers guide: Ansi C and Programming Support Tools", which did
  21. a more than adequate job of explaining everything required to get this
  22. working. */
  23. /*
  24. * The main trick with this program is that initially, we ourselves are not
  25. * dynamicly linked. This means that we cannot access any global variables
  26. * since the GOT is initialized by the linker assuming a virtual address of 0,
  27. * and we cannot call any functions since the PLT is not initialized at all
  28. * (it will tend to want to call the dynamic linker
  29. *
  30. * There are further restrictions - we cannot use large switch statements,
  31. * since the compiler generates tables of addresses and jumps through them.
  32. * We can use inline functions, because these do not transfer control to
  33. * a new address, but they must be static so that they are not exported
  34. * from the modules. We cannot use normal syscall stubs, because these
  35. * all reference the errno global variable which is not yet initialized.
  36. * We can use all of the local stack variables that we want, since these
  37. * are all referenced to %ebp or %esp.
  38. *
  39. * Life is further complicated by the fact that initially we do not want
  40. * to do a complete dynamic linking. We want to allow the user to supply
  41. * new functions replacing some of the library versions, and until we have
  42. * the list of modules that we should search set up, we do not want to do
  43. * any of this. Thus I have chosen to only perform the relocations for
  44. * variables that start with "_dl_" since ANSI specifies that the user is
  45. * not supposed to redefine any of these variables.
  46. *
  47. * Fortunately, the linker itself leaves a few clues lying around, and
  48. * when the kernel starts the image, there are a few further clues.
  49. * First of all, there is information buried on the stack that the kernel
  50. * leaves, which includes information about the load address that the
  51. * program interpreter was loaded at, the number of sections, the address
  52. * the application was loaded at and so forth. Here this information
  53. * is stored in the array dl_info, and the indicies are taken from the
  54. * file /usr/include/sys/auxv.h on any SVr4 system.
  55. *
  56. * The linker itself leaves a pointer to the .dynamic section in the first
  57. * slot of the GOT, and as it turns out, %ebx points to ghe GOT when
  58. * you are using PIC code, so we just dereference this to get the address
  59. * of the dynamic sections.
  60. *
  61. * Typically you must load all text pages as writable so that dynamic linking
  62. * can succeed. The kernel under SVr4 loads these as R/O, so we must call
  63. * mprotect to change the protections. Once we are done, we should set these
  64. * back again, so the desired behavior is achieved. Under linux there is
  65. * currently no mprotect function in the distribution kernel (although
  66. * someone has alpha patches), so for now everything is loaded writable.
  67. *
  68. * We do not have access to malloc and friends at the initial stages of dynamic
  69. * linking, and it would be handy to have some scratchpad memory available for
  70. * use as we set things up. We mmap one page of scratch space, and have a
  71. * simple _dl_malloc that uses this memory. This is a good thing, since we do
  72. * not want to use the same memory pool as malloc anyway - esp if the user
  73. * redefines malloc to do something funky.
  74. *
  75. * Our first task is to perform a minimal linking so that we can call other
  76. * portions of the dynamic linker. Once we have done this, we then build
  77. * the list of modules that the application requires, using LD_LIBRARY_PATH
  78. * if this is not a suid program (/usr/lib otherwise). Once this is done,
  79. * we can do the dynamic linking as required (and we must omit the things
  80. * we did to get the dynamic linker up and running in the first place.
  81. * After we have done this, we just have a few housekeeping chores and we
  82. * can transfer control to the user's application.
  83. */
  84. #include <stdarg.h>
  85. #include "sysdep.h" /* before elf.h to get ELF_USES_RELOCA right */
  86. #include <elf.h>
  87. #include "linuxelf.h"
  88. #include "link.h"
  89. #include "hash.h"
  90. #include "syscall.h"
  91. #include "string.h"
  92. #include "../config.h"
  93. #define ALLOW_ZERO_PLTGOT
  94. /* This is a poor man's malloc, used prior to resolving our internal poor man's malloc */
  95. #define DL_MALLOC(SIZE) ((void *) (malloc_buffer += SIZE, malloc_buffer - SIZE)) ; REALIGN();
  96. /*
  97. * Make sure that the malloc buffer is aligned on 4 byte boundary. For 64 bit
  98. * platforms we may need to increase this to 8, but this is good enough for
  99. * now. This is typically called after DL_MALLOC.
  100. */
  101. #define REALIGN() malloc_buffer = (char *) (((unsigned long) malloc_buffer + 3) & ~(3))
  102. #define ELF_HASH(RESULT,NAME) { \
  103. unsigned long hash = 0; \
  104. unsigned long tmp; \
  105. char * name = NAME; \
  106. while (*name){ \
  107. hash = (hash << 4) + *name++; \
  108. if((tmp = hash & 0xf0000000)) hash ^= tmp >> 24; \
  109. hash &= ~tmp; \
  110. } \
  111. RESULT = hash; \
  112. }
  113. static char *_dl_malloc_addr, *_dl_mmap_zero;
  114. char *_dl_library_path = 0; /* Where we look for libraries */
  115. char *_dl_preload = 0; /* Things to be loaded before the libs. */
  116. #include "ld.so.h" /* Pull in the name of ld.so */
  117. static char *_dl_not_lazy = 0;
  118. static char *_dl_warn = 0; /* Used by ldd */
  119. static char *_dl_trace_loaded_objects = 0;
  120. static int (*_dl_elf_main) (int, char **, char **);
  121. static int (*_dl_elf_init) (void);
  122. void *(*_dl_malloc_function) (int size) = NULL;
  123. struct r_debug *_dl_debug_addr = NULL;
  124. unsigned long *_dl_brkp;
  125. unsigned long *_dl_envp;
  126. char *_dl_getenv(char *symbol, char **envp);
  127. void _dl_unsetenv(char *symbol, char **envp);
  128. int _dl_fixup(struct elf_resolve *tpnt);
  129. void _dl_debug_state(void);
  130. char *_dl_get_last_path_component(char *path);
  131. /* When we enter this piece of code, the program stack looks like this:
  132. argc argument counter (integer)
  133. argv[0] program name (pointer)
  134. argv[1...N] program args (pointers)
  135. argv[argc-1] end of args (integer)
  136. NULL
  137. env[0...N] environment variables (pointers)
  138. NULL
  139. auxv_t[0...N] Auxiliary Vector Table elements (mixed types)
  140. */
  141. void _dl_boot(unsigned int args)
  142. {
  143. unsigned int argc;
  144. char **argv, **envp;
  145. int status;
  146. unsigned long load_addr;
  147. unsigned long *got;
  148. unsigned long *aux_dat;
  149. int goof = 0;
  150. elfhdr *header;
  151. struct elf_resolve *tpnt;
  152. struct dyn_elf *rpnt;
  153. struct elf_resolve *app_tpnt;
  154. unsigned long brk_addr;
  155. Elf32_auxv_t auxv_t[AT_EGID + 1];
  156. unsigned char *malloc_buffer, *mmap_zero;
  157. int (*_dl_atexit) (void *);
  158. unsigned long *lpnt;
  159. Elf32_Dyn *dpnt;
  160. unsigned long *hash_addr;
  161. struct r_debug *debug_addr;
  162. unsigned long *chains;
  163. int indx;
  164. int _dl_secure;
  165. /* First obtain the information on the stack that tells us more about
  166. what binary is loaded, where it is loaded, etc, etc */
  167. GET_ARGV(aux_dat, args);
  168. argc = *(aux_dat - 1);
  169. argv = (char **) aux_dat;
  170. aux_dat += argc; /* Skip over the argv pointers */
  171. aux_dat++; /* Skip over NULL at end of argv */
  172. envp = (char **) aux_dat;
  173. while (*aux_dat)
  174. aux_dat++; /* Skip over the envp pointers */
  175. aux_dat++; /* Skip over NULL at end of envp */
  176. /* Place -1 here as a checkpoint. We check later to see if it got changed
  177. * when we read in the auxv_t */
  178. auxv_t[AT_UID].a_type = -1;
  179. /* The junk on the stack immediately following the environment is
  180. * the Auxiliary Vector Table. Read out the elements of the auxv_t,
  181. * sort and store them in auxv_t for later use. */
  182. while (*aux_dat)
  183. {
  184. Elf32_auxv_t *auxv_entry = (Elf32_auxv_t*) aux_dat;
  185. if (auxv_entry->a_type <= AT_EGID) {
  186. _dl_memcpy(&(auxv_t[auxv_entry->a_type]), auxv_entry, sizeof(Elf32_auxv_t));
  187. }
  188. aux_dat += 2;
  189. }
  190. /* Next, locate the GOT */
  191. load_addr = auxv_t[AT_BASE].a_un.a_val;
  192. if (load_addr == 0x0) {
  193. /* Looks like they decided to run ld-linux-uclibc.so as
  194. * an executable. Exit gracefully for now. */
  195. /* TODO -- actually accept executables and args to run... */
  196. //SEND_STDERR("Usage: ld.so EXECUTABLE [ARGS...]\n");
  197. SEND_STDERR("You have run `ld.so', the helper program for shared\n");
  198. SEND_STDERR("library executables. You probably did not intend to\n");
  199. SEND_STDERR("run this as a program. Goodbye.\n\n");
  200. _dl_exit(0);
  201. }
  202. #ifdef DL_DEBUG
  203. SEND_STDERR("load_addr=");
  204. SEND_STDERR(_dl_simple_ltoahex(load_addr));
  205. SEND_STDERR("\n");
  206. #endif
  207. GET_GOT(got);
  208. #ifdef DL_DEBUG
  209. SEND_STDERR("Found got=");
  210. SEND_STDERR(_dl_simple_ltoahex((unsigned long)*got));
  211. SEND_STDERR("\n");
  212. #endif
  213. dpnt = (Elf32_Dyn *) (*got + load_addr);
  214. #ifdef DL_DEBUG
  215. SEND_STDERR("First Dynamic section entry=");
  216. SEND_STDERR(_dl_simple_ltoahex((unsigned long)dpnt));
  217. SEND_STDERR("\n");
  218. #endif
  219. /* Call mmap to get a page of writable memory that can be used
  220. * for _dl_malloc throughout the shared lib loader. */
  221. mmap_zero = malloc_buffer = _dl_mmap((void *) 0, 4096,
  222. PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, 0, 0);
  223. if (_dl_mmap_check_error(mmap_zero)) {
  224. SEND_STDERR("dl_boot: mmap of a spare page failed!\n");
  225. _dl_exit(13);
  226. }
  227. tpnt = DL_MALLOC(sizeof(struct elf_resolve));
  228. _dl_memset(tpnt, 0, sizeof(*tpnt));
  229. app_tpnt = DL_MALLOC(sizeof(struct elf_resolve));
  230. _dl_memset(app_tpnt, 0, sizeof(*app_tpnt));
  231. /*
  232. * This is used by gdb to locate the chain of shared libraries that are currently loaded.
  233. */
  234. debug_addr = DL_MALLOC(sizeof(struct r_debug));
  235. _dl_memset(debug_addr, 0, sizeof(*debug_addr));
  236. /* OK, that was easy. Next scan the DYNAMIC section of the image.
  237. We are only doing ourself right now - we will have to do the rest later */
  238. while (dpnt->d_tag) {
  239. tpnt->dynamic_info[dpnt->d_tag] = dpnt->d_un.d_val;
  240. if (dpnt->d_tag == DT_TEXTREL || SVR4_BUGCOMPAT)
  241. tpnt->dynamic_info[DT_TEXTREL] = 1;
  242. dpnt++;
  243. }
  244. {
  245. elf_phdr *ppnt;
  246. int i;
  247. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  248. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++)
  249. if (ppnt->p_type == PT_DYNAMIC) {
  250. dpnt = (Elf32_Dyn *) ppnt->p_vaddr;
  251. while (dpnt->d_tag) {
  252. if (dpnt->d_tag > DT_JMPREL) {
  253. dpnt++;
  254. continue;
  255. }
  256. app_tpnt->dynamic_info[dpnt->d_tag] = dpnt->d_un.d_val;
  257. if (dpnt->d_tag == DT_DEBUG)
  258. dpnt->d_un.d_val = (unsigned long) debug_addr;
  259. if (dpnt->d_tag == DT_TEXTREL || SVR4_BUGCOMPAT)
  260. app_tpnt->dynamic_info[DT_TEXTREL] = 1;
  261. dpnt++;
  262. }
  263. }
  264. }
  265. /* Get some more of the information that we will need to dynamicly link
  266. this module to itself */
  267. hash_addr = (unsigned long *) (tpnt->dynamic_info[DT_HASH] + load_addr);
  268. tpnt->nbucket = *hash_addr++;
  269. tpnt->nchain = *hash_addr++;
  270. tpnt->elf_buckets = hash_addr;
  271. hash_addr += tpnt->nbucket;
  272. chains = hash_addr;
  273. /* Ugly, ugly. We need to call mprotect to change the protection of
  274. the text pages so that we can do the dynamic linking. We can set the
  275. protection back again once we are done */
  276. {
  277. elf_phdr *ppnt;
  278. int i;
  279. /* First cover the shared library/dynamic linker. */
  280. if (tpnt->dynamic_info[DT_TEXTREL]) {
  281. header = (elfhdr *) auxv_t[AT_BASE].a_un.a_ptr;
  282. ppnt = (elf_phdr *) (auxv_t[AT_BASE].a_un.a_ptr + header->e_phoff);
  283. for (i = 0; i < header->e_phnum; i++, ppnt++) {
  284. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W))
  285. _dl_mprotect((void *) (load_addr + (ppnt->p_vaddr & 0xfffff000)),
  286. (ppnt->p_vaddr & 0xfff) + (unsigned long) ppnt->p_filesz,
  287. PROT_READ | PROT_WRITE | PROT_EXEC);
  288. }
  289. }
  290. /* Now cover the application program. */
  291. if (app_tpnt->dynamic_info[DT_TEXTREL]) {
  292. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  293. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++) {
  294. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W))
  295. _dl_mprotect((void *) (ppnt->p_vaddr & 0xfffff000),
  296. (ppnt->p_vaddr & 0xfff) +
  297. (unsigned long) ppnt->p_filesz,
  298. PROT_READ | PROT_WRITE | PROT_EXEC);
  299. }
  300. }
  301. }
  302. /* OK, now do the relocations. We do not do a lazy binding here, so
  303. that once we are done, we have considerably more flexibility. */
  304. goof = 0;
  305. for (indx = 0; indx < 2; indx++) {
  306. int i;
  307. ELF_RELOC *rpnt;
  308. unsigned long *reloc_addr;
  309. unsigned long symbol_addr;
  310. int symtab_index;
  311. unsigned long rel_addr, rel_size;
  312. #ifdef ELF_USES_RELOCA
  313. rel_addr =
  314. (indx ? tpnt->dynamic_info[DT_JMPREL] : tpnt->
  315. dynamic_info[DT_RELA]);
  316. rel_size =
  317. (indx ? tpnt->dynamic_info[DT_PLTRELSZ] : tpnt->
  318. dynamic_info[DT_RELASZ]);
  319. #else
  320. rel_addr =
  321. (indx ? tpnt->dynamic_info[DT_JMPREL] : tpnt->
  322. dynamic_info[DT_REL]);
  323. rel_size =
  324. (indx ? tpnt->dynamic_info[DT_PLTRELSZ] : tpnt->
  325. dynamic_info[DT_RELSZ]);
  326. #endif
  327. if (!rel_addr)
  328. continue;
  329. /* Now parse the relocation information */
  330. rpnt = (ELF_RELOC *) (rel_addr + load_addr);
  331. for (i = 0; i < rel_size; i += sizeof(ELF_RELOC), rpnt++) {
  332. reloc_addr = (unsigned long *) (load_addr + (unsigned long) rpnt->r_offset);
  333. symtab_index = ELF32_R_SYM(rpnt->r_info);
  334. symbol_addr = 0;
  335. if (symtab_index) {
  336. char *strtab;
  337. Elf32_Sym *symtab;
  338. symtab = (Elf32_Sym *) (tpnt->dynamic_info[DT_SYMTAB] + load_addr);
  339. strtab = (char *) (tpnt->dynamic_info[DT_STRTAB] + load_addr);
  340. /* We only do a partial dynamic linking right now. The user
  341. is not supposed to redefine any symbols that start with
  342. a '_', so we can do this with confidence. */
  343. if (!_dl_symbol(strtab + symtab[symtab_index].st_name))
  344. continue;
  345. symbol_addr = load_addr + symtab[symtab_index].st_value;
  346. if (!symbol_addr) {
  347. /*
  348. * This will segfault - you cannot call a function until
  349. * we have finished the relocations.
  350. */
  351. SEND_STDERR("ELF dynamic loader - unable to "
  352. "self-bootstrap - symbol ");
  353. SEND_STDERR(strtab + symtab[symtab_index].st_name);
  354. SEND_STDERR(" undefined.\n");
  355. goof++;
  356. }
  357. }
  358. /*
  359. * Use this machine-specific macro to perform the actual relocation.
  360. */
  361. PERFORM_BOOTSTRAP_RELOC(rpnt, reloc_addr, symbol_addr, load_addr);
  362. }
  363. }
  364. if (goof) {
  365. _dl_exit(14);
  366. }
  367. /* OK, at this point we have a crude malloc capability. Start to build
  368. the tables of the modules that are required for this beast to run.
  369. We start with the basic executable, and then go from there. Eventually
  370. we will run across ourself, and we will need to properly deal with that
  371. as well. */
  372. _dl_malloc_addr = malloc_buffer;
  373. _dl_mmap_zero = mmap_zero;
  374. /* Now we have done the mandatory linking of some things. We are now
  375. free to start using global variables, since these things have all been
  376. fixed up by now. Still no function calls outside of this library ,
  377. since the dynamic resolver is not yet ready. */
  378. lpnt = (unsigned long *) (tpnt->dynamic_info[DT_PLTGOT] + load_addr);
  379. INIT_GOT(lpnt, tpnt);
  380. /* OK, this was a big step, now we need to scan all of the user images
  381. and load them properly. */
  382. tpnt->next = 0;
  383. tpnt->libname = 0;
  384. tpnt->libtype = program_interpreter;
  385. {
  386. elfhdr *epnt;
  387. elf_phdr *ppnt;
  388. int i;
  389. epnt = (elfhdr *) auxv_t[AT_BASE].a_un.a_ptr;
  390. tpnt->n_phent = epnt->e_phnum;
  391. tpnt->ppnt = ppnt = (elf_phdr *) (load_addr + epnt->e_phoff);
  392. for (i = 0; i < epnt->e_phnum; i++, ppnt++) {
  393. if (ppnt->p_type == PT_DYNAMIC) {
  394. tpnt->dynamic_addr = ppnt->p_vaddr + load_addr;
  395. tpnt->dynamic_size = ppnt->p_filesz;
  396. }
  397. }
  398. }
  399. tpnt->chains = chains;
  400. tpnt->loadaddr = (char *) load_addr;
  401. brk_addr = 0;
  402. rpnt = NULL;
  403. /* At this point we are now free to examine the user application,
  404. and figure out which libraries are supposed to be called. Until
  405. we have this list, we will not be completely ready for dynamic linking */
  406. {
  407. elf_phdr *ppnt;
  408. int i;
  409. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  410. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++) {
  411. if (ppnt->p_type == PT_LOAD) {
  412. if (ppnt->p_vaddr + ppnt->p_memsz > brk_addr)
  413. brk_addr = ppnt->p_vaddr + ppnt->p_memsz;
  414. }
  415. if (ppnt->p_type == PT_DYNAMIC) {
  416. #ifndef ALLOW_ZERO_PLTGOT
  417. /* make sure it's really there. */
  418. if (app_tpnt->dynamic_info[DT_PLTGOT] == 0)
  419. continue;
  420. #endif
  421. /* OK, we have what we need - slip this one into the list. */
  422. app_tpnt = _dl_add_elf_hash_table("", 0,
  423. app_tpnt->dynamic_info, ppnt->p_vaddr, ppnt->p_filesz);
  424. _dl_loaded_modules->libtype = elf_executable;
  425. _dl_loaded_modules->ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  426. _dl_loaded_modules->n_phent = auxv_t[AT_PHNUM].a_un.a_val;
  427. _dl_symbol_tables = rpnt = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  428. _dl_memset(rpnt, 0, sizeof(*rpnt));
  429. rpnt->dyn = _dl_loaded_modules;
  430. app_tpnt->usage_count++;
  431. app_tpnt->symbol_scope = _dl_symbol_tables;
  432. lpnt = (unsigned long *) (app_tpnt->dynamic_info[DT_PLTGOT]);
  433. #ifdef ALLOW_ZERO_PLTGOT
  434. if (lpnt)
  435. #endif
  436. INIT_GOT(lpnt, _dl_loaded_modules);
  437. }
  438. if (ppnt->p_type == PT_INTERP) { /* OK, fill this in - we did not
  439. have this before */
  440. tpnt->libname = _dl_strdup((char *) ppnt->p_offset +
  441. (auxv_t[AT_PHDR].a_un.a_val & 0xfffff000));
  442. }
  443. }
  444. }
  445. if (argv[0]) {
  446. _dl_progname = argv[0];
  447. }
  448. /* Now we need to figure out what kind of options are selected.
  449. Note that for SUID programs we ignore the settings in LD_LIBRARY_PATH */
  450. {
  451. _dl_not_lazy = _dl_getenv("LD_BIND_NOW", envp);
  452. if ((auxv_t[AT_UID].a_un.a_val == -1 && _dl_suid_ok()) ||
  453. (auxv_t[AT_UID].a_un.a_val != -1 &&
  454. auxv_t[AT_UID].a_un.a_val == auxv_t[AT_EUID].a_un.a_val
  455. && auxv_t[AT_GID].a_un.a_val== auxv_t[AT_EGID].a_un.a_val)) {
  456. _dl_secure = 0;
  457. _dl_preload = _dl_getenv("LD_PRELOAD", envp);
  458. _dl_library_path = _dl_getenv("LD_LIBRARY_PATH", envp);
  459. } else {
  460. _dl_secure = 1;
  461. _dl_preload = _dl_getenv("LD_PRELOAD", envp);
  462. _dl_unsetenv("LD_AOUT_PRELOAD", envp);
  463. _dl_unsetenv("LD_LIBRARY_PATH", envp);
  464. _dl_unsetenv("LD_AOUT_LIBRARY_PATH", envp);
  465. _dl_library_path = NULL;
  466. }
  467. }
  468. _dl_trace_loaded_objects = _dl_getenv("LD_TRACE_LOADED_OBJECTS", envp);
  469. /* OK, we now have the application in the list, and we have some
  470. basic stuff in place. Now search through the list for other shared
  471. libraries that should be loaded, and insert them on the list in the
  472. correct order. */
  473. #ifdef USE_CACHE
  474. _dl_map_cache();
  475. #endif
  476. {
  477. struct elf_resolve *tcurr;
  478. struct elf_resolve *tpnt1;
  479. char *lpnt;
  480. if (_dl_preload)
  481. {
  482. char c, *str, *str2;
  483. str = _dl_preload;
  484. while (*str == ':' || *str == ' ' || *str == '\t')
  485. str++;
  486. while (*str)
  487. {
  488. str2 = str;
  489. while (*str2 && *str2 != ':' && *str2 != ' ' && *str2 != '\t')
  490. str2++;
  491. c = *str2;
  492. *str2 = '\0';
  493. if (!_dl_secure || _dl_strchr(str, '/') == NULL)
  494. {
  495. tpnt1 = _dl_load_shared_library(_dl_secure, NULL, str);
  496. if (!tpnt1) {
  497. if (_dl_trace_loaded_objects)
  498. _dl_fdprintf(1, "\t%s => not found\n", str);
  499. else {
  500. _dl_fdprintf(2, "%s: can't load "
  501. "library '%s'\n", _dl_progname, str);
  502. _dl_exit(15);
  503. }
  504. } else {
  505. if (_dl_trace_loaded_objects
  506. && !tpnt1->usage_count) {
  507. /* this is a real hack to make ldd not print
  508. * the library itself when run on a library. */
  509. if (_dl_strcmp(_dl_progname, str) != 0)
  510. _dl_fdprintf(1, "\t%s => %s (0x%x)\n", str, tpnt1->libname,
  511. (unsigned) tpnt1->loadaddr);
  512. }
  513. rpnt->next = (struct dyn_elf *)
  514. _dl_malloc(sizeof(struct dyn_elf));
  515. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  516. rpnt = rpnt->next;
  517. tpnt1->usage_count++;
  518. tpnt1->symbol_scope = _dl_symbol_tables;
  519. tpnt1->libtype = elf_lib;
  520. rpnt->dyn = tpnt1;
  521. }
  522. }
  523. *str2 = c;
  524. str = str2;
  525. while (*str == ':' || *str == ' ' || *str == '\t')
  526. str++;
  527. }
  528. }
  529. {
  530. int fd;
  531. struct kernel_stat st;
  532. char *preload;
  533. if (!_dl_stat(LDSO_PRELOAD, &st)) {
  534. if ((fd = _dl_open(LDSO_PRELOAD, O_RDONLY)) < 0) {
  535. _dl_fdprintf(2, "%s: can't open file '%s'\n",
  536. _dl_progname, LDSO_PRELOAD);
  537. } else {
  538. preload = (caddr_t) _dl_mmap(0, st.st_size + 1,
  539. PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
  540. _dl_close(fd);
  541. if (preload == (caddr_t) - 1) {
  542. _dl_fdprintf(2, "%s: can't map file '%s'\n",
  543. _dl_progname, LDSO_PRELOAD);
  544. } else {
  545. char c, *cp, *cp2;
  546. /* convert all separators and comments to spaces */
  547. for (cp = preload; *cp; /*nada */ ) {
  548. if (*cp == ':' || *cp == '\t' || *cp == '\n') {
  549. *cp++ = ' ';
  550. } else if (*cp == '#') {
  551. do
  552. *cp++ = ' ';
  553. while (*cp != '\n' && *cp != '\0');
  554. } else {
  555. cp++;
  556. }
  557. }
  558. /* find start of first library */
  559. for (cp = preload; *cp && *cp == ' '; cp++)
  560. /*nada */ ;
  561. while (*cp) {
  562. /* find end of library */
  563. for (cp2 = cp; *cp && *cp != ' '; cp++)
  564. /*nada */ ;
  565. c = *cp;
  566. *cp = '\0';
  567. tpnt1 = _dl_load_shared_library(0, NULL, cp2);
  568. if (!tpnt1) {
  569. if (_dl_trace_loaded_objects)
  570. _dl_fdprintf(1, "\t%s => not found\n", cp2);
  571. else {
  572. _dl_fdprintf(2, "%s: can't load library '%s'\n",
  573. _dl_progname, cp2);
  574. _dl_exit(15);
  575. }
  576. } else {
  577. if (_dl_trace_loaded_objects
  578. && !tpnt1->usage_count) {
  579. _dl_fdprintf(1, "\t%s => %s (0x%x)\n", cp2,
  580. tpnt1->libname, (unsigned) tpnt1->loadaddr);
  581. }
  582. rpnt->next = (struct dyn_elf *)
  583. _dl_malloc(sizeof(struct dyn_elf));
  584. _dl_memset(rpnt->next, 0,
  585. sizeof(*(rpnt->next)));
  586. rpnt = rpnt->next;
  587. tpnt1->usage_count++;
  588. tpnt1->symbol_scope = _dl_symbol_tables;
  589. tpnt1->libtype = elf_lib;
  590. rpnt->dyn = tpnt1;
  591. }
  592. /* find start of next library */
  593. *cp = c;
  594. for ( /*nada */ ; *cp && *cp == ' '; cp++)
  595. /*nada */ ;
  596. }
  597. _dl_munmap(preload, st.st_size + 1);
  598. }
  599. }
  600. }
  601. }
  602. for (tcurr = _dl_loaded_modules; tcurr; tcurr = tcurr->next) {
  603. for (dpnt = (Elf32_Dyn *) tcurr->dynamic_addr; dpnt->d_tag;
  604. dpnt++) {
  605. if (dpnt->d_tag == DT_NEEDED) {
  606. lpnt = tcurr->loadaddr + tcurr->dynamic_info[DT_STRTAB] +
  607. dpnt->d_un.d_val;
  608. if (tpnt && _dl_strcmp(lpnt,
  609. _dl_get_last_path_component(tpnt->libname)) == 0) {
  610. struct elf_resolve *ttmp;
  611. if (_dl_trace_loaded_objects && !tpnt->usage_count) {
  612. _dl_fdprintf(1, "\t%s => %s (0x%x)\n",
  613. lpnt, tpnt->libname, (unsigned) tpnt->loadaddr);
  614. }
  615. ttmp = _dl_loaded_modules;
  616. while (ttmp->next)
  617. ttmp = ttmp->next;
  618. ttmp->next = tpnt;
  619. tpnt->prev = ttmp;
  620. tpnt->next = NULL;
  621. rpnt->next = (struct dyn_elf *)
  622. _dl_malloc(sizeof(struct dyn_elf));
  623. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  624. rpnt = rpnt->next;
  625. rpnt->dyn = tpnt;
  626. tpnt->usage_count++;
  627. tpnt->symbol_scope = _dl_symbol_tables;
  628. tpnt = NULL;
  629. continue;
  630. }
  631. if (!(tpnt1 = _dl_load_shared_library(0, tcurr, lpnt))) {
  632. if (_dl_trace_loaded_objects)
  633. _dl_fdprintf(1, "\t%s => not found\n", lpnt);
  634. else {
  635. _dl_fdprintf(2, "%s: can't load library '%s'\n",
  636. _dl_progname, lpnt);
  637. _dl_exit(16);
  638. }
  639. } else {
  640. if (_dl_trace_loaded_objects && !tpnt1->usage_count)
  641. _dl_fdprintf(1, "\t%s => %s (0x%x)\n", lpnt, tpnt1->libname,
  642. (unsigned) tpnt1->loadaddr);
  643. rpnt->next = (struct dyn_elf *)
  644. _dl_malloc(sizeof(struct dyn_elf));
  645. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  646. rpnt = rpnt->next;
  647. tpnt1->usage_count++;
  648. tpnt1->symbol_scope = _dl_symbol_tables;
  649. tpnt1->libtype = elf_lib;
  650. rpnt->dyn = tpnt1;
  651. }
  652. }
  653. }
  654. }
  655. }
  656. #ifdef USE_CACHE
  657. _dl_unmap_cache();
  658. #endif
  659. /* ldd uses uses this. I am not sure how you pick up the other flags */
  660. if (_dl_trace_loaded_objects) {
  661. _dl_warn = _dl_getenv("LD_WARN", envp);
  662. if (!_dl_warn)
  663. _dl_exit(0);
  664. }
  665. /*
  666. * If the program interpreter is not in the module chain, add it. This will
  667. * be required for dlopen to be able to access the internal functions in the
  668. * dynamic linker.
  669. */
  670. if (tpnt) {
  671. struct elf_resolve *tcurr;
  672. tcurr = _dl_loaded_modules;
  673. if (tcurr)
  674. while (tcurr->next)
  675. tcurr = tcurr->next;
  676. tpnt->next = NULL;
  677. tpnt->usage_count++;
  678. if (tcurr) {
  679. tcurr->next = tpnt;
  680. tpnt->prev = tcurr;
  681. } else {
  682. _dl_loaded_modules = tpnt;
  683. tpnt->prev = NULL;
  684. }
  685. if (rpnt) {
  686. rpnt->next = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  687. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  688. rpnt = rpnt->next;
  689. } else {
  690. rpnt = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  691. _dl_memset(rpnt, 0, sizeof(*(rpnt->next)));
  692. }
  693. rpnt->dyn = tpnt;
  694. tpnt = NULL;
  695. }
  696. /*
  697. * OK, now all of the kids are tucked into bed in their proper addresses.
  698. * Now we go through and look for REL and RELA records that indicate fixups
  699. * to the GOT tables. We need to do this in reverse order so that COPY
  700. * directives work correctly */
  701. goof = _dl_loaded_modules ? _dl_fixup(_dl_loaded_modules) : 0;
  702. /* Some flavors of SVr4 do not generate the R_*_COPY directive,
  703. and we have to manually search for entries that require fixups.
  704. Solaris gets this one right, from what I understand. */
  705. if (_dl_symbol_tables)
  706. goof += _dl_copy_fixups(_dl_symbol_tables);
  707. if (goof || _dl_trace_loaded_objects)
  708. _dl_exit(0);
  709. /* OK, at this point things are pretty much ready to run. Now we
  710. need to touch up a few items that are required, and then
  711. we can let the user application have at it. Note that
  712. the dynamic linker itself is not guaranteed to be fully
  713. dynamicly linked if we are using ld.so.1, so we have to look
  714. up each symbol individually. */
  715. _dl_brkp = (unsigned long *) _dl_find_hash("___brk_addr", NULL, 1, NULL, 0);
  716. if (_dl_brkp)
  717. *_dl_brkp = brk_addr;
  718. _dl_envp =
  719. (unsigned long *) _dl_find_hash("__environ", NULL, 1, NULL, 0);
  720. if (_dl_envp)
  721. *_dl_envp = (unsigned long) envp;
  722. {
  723. int i;
  724. elf_phdr *ppnt;
  725. /* We had to set the protections of all pages to R/W for dynamic linking.
  726. Set text pages back to R/O */
  727. for (tpnt = _dl_loaded_modules; tpnt; tpnt = tpnt->next)
  728. for (ppnt = tpnt->ppnt, i = 0; i < tpnt->n_phent; i++, ppnt++)
  729. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W) &&
  730. tpnt->dynamic_info[DT_TEXTREL])
  731. _dl_mprotect((void *) (tpnt->loadaddr + (ppnt->p_vaddr & 0xfffff000)),
  732. (ppnt->p_vaddr & 0xfff) + (unsigned long) ppnt->p_filesz,
  733. LXFLAGS(ppnt->p_flags));
  734. }
  735. _dl_atexit = (int (*)(void *)) _dl_find_hash("atexit", NULL, 1, NULL, 0);
  736. /*
  737. * OK, fix one more thing - set up the debug_addr structure to point
  738. * to our chain. Later we may need to fill in more fields, but this
  739. * should be enough for now.
  740. */
  741. debug_addr->r_map = (struct link_map *) _dl_loaded_modules;
  742. debug_addr->r_version = 1;
  743. debug_addr->r_ldbase = load_addr;
  744. debug_addr->r_brk = (unsigned long) &_dl_debug_state;
  745. _dl_debug_addr = debug_addr;
  746. debug_addr->r_state = RT_CONSISTENT;
  747. /* This is written in this funny way to keep gcc from inlining the
  748. function call. */
  749. ((void (*)(void)) debug_addr->r_brk) ();
  750. for (tpnt = _dl_loaded_modules; tpnt; tpnt = tpnt->next) {
  751. /* Apparently crt1 for the application is responsible for handling this.
  752. * We only need to run the init/fini for shared libraries
  753. */
  754. if (tpnt->libtype == program_interpreter ||
  755. tpnt->libtype == elf_executable)
  756. continue;
  757. if (tpnt->init_flag & INIT_FUNCS_CALLED)
  758. continue;
  759. tpnt->init_flag |= INIT_FUNCS_CALLED;
  760. if (tpnt->dynamic_info[DT_INIT]) {
  761. _dl_elf_init = (int (*)(void)) (tpnt->loadaddr +
  762. tpnt->dynamic_info[DT_INIT]);
  763. (*_dl_elf_init) ();
  764. }
  765. if (_dl_atexit && tpnt->dynamic_info[DT_FINI]) {
  766. (*_dl_atexit) (tpnt->loadaddr + tpnt->dynamic_info[DT_FINI]);
  767. }
  768. #undef DL_DEBUG
  769. #ifdef DL_DEBUG
  770. else {
  771. _dl_fdprintf(2, tpnt->libname);
  772. _dl_fdprintf(2, ": ");
  773. if (!_dl_atexit)
  774. _dl_fdprintf(2, "The address is atexit () is 0x0.");
  775. if (!tpnt->dynamic_info[DT_FINI])
  776. _dl_fdprintf(2, "Invalid .fini section.");
  777. _dl_fdprintf(2, "\n");
  778. }
  779. #endif
  780. #undef DL_DEBUG
  781. }
  782. /* OK we are done here. Turn out the lights, and lock up. */
  783. _dl_elf_main = (int (*)(int, char **, char **)) auxv_t[AT_ENTRY].a_un.a_fcn;
  784. /*
  785. * Transfer control to the application.
  786. */
  787. START();
  788. }
  789. /*
  790. * This stub function is used by some debuggers. The idea is that they
  791. * can set an internal breakpoint on it, so that we are notified when the
  792. * address mapping is changed in some way.
  793. */
  794. void _dl_debug_state()
  795. {
  796. return;
  797. }
  798. int _dl_fixup(struct elf_resolve *tpnt)
  799. {
  800. int goof = 0;
  801. if (tpnt->next)
  802. goof += _dl_fixup(tpnt->next);
  803. if (tpnt->dynamic_info[DT_REL]) {
  804. #ifdef ELF_USES_RELOCA
  805. _dl_fdprintf(2, "%s: can't handle REL relocation records\n",
  806. _dl_progname);
  807. _dl_exit(17);
  808. #else
  809. if (tpnt->init_flag & RELOCS_DONE)
  810. return goof;
  811. tpnt->init_flag |= RELOCS_DONE;
  812. goof += _dl_parse_relocation_information(tpnt,
  813. tpnt->dynamic_info[DT_REL], tpnt->dynamic_info[DT_RELSZ], 0);
  814. #endif
  815. }
  816. if (tpnt->dynamic_info[DT_RELA]) {
  817. #ifdef ELF_USES_RELOCA
  818. if (tpnt->init_flag & RELOCS_DONE)
  819. return goof;
  820. tpnt->init_flag |= RELOCS_DONE;
  821. goof += _dl_parse_relocation_information(tpnt,
  822. tpnt->dynamic_info[DT_RELA], tpnt->dynamic_info[DT_RELASZ], 0);
  823. #else
  824. _dl_fdprintf(2, "%s: can't handle RELA relocation records\n",
  825. _dl_progname);
  826. _dl_exit(18);
  827. #endif
  828. }
  829. if (tpnt->dynamic_info[DT_JMPREL]) {
  830. if (tpnt->init_flag & JMP_RELOCS_DONE)
  831. return goof;
  832. tpnt->init_flag |= JMP_RELOCS_DONE;
  833. if (!_dl_not_lazy || *_dl_not_lazy == 0)
  834. _dl_parse_lazy_relocation_information(tpnt,
  835. tpnt->dynamic_info[DT_JMPREL], tpnt->dynamic_info[DT_PLTRELSZ], 0);
  836. else
  837. goof += _dl_parse_relocation_information(tpnt,
  838. tpnt->dynamic_info[DT_JMPREL], tpnt->dynamic_info[DT_PLTRELSZ], 0);
  839. }
  840. return goof;
  841. }
  842. void *_dl_malloc(int size)
  843. {
  844. void *retval;
  845. #ifdef DL_DEBUG
  846. SEND_STDERR("malloc: request for ");
  847. SEND_STDERR(_dl_simple_itoa(size));
  848. SEND_STDERR(" bytes\n");
  849. #endif
  850. if (_dl_malloc_function)
  851. return (*_dl_malloc_function) (size);
  852. if (_dl_malloc_addr - _dl_mmap_zero + size > 4096) {
  853. #ifdef DL_DEBUG
  854. SEND_STDERR("malloc: mmapping more memory\n");
  855. #endif
  856. _dl_mmap_zero = _dl_malloc_addr = _dl_mmap((void *) 0, size,
  857. PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, 0, 0);
  858. if (_dl_mmap_check_error(_dl_mmap_zero)) {
  859. _dl_fdprintf(2, "%s: mmap of a spare page failed!\n", _dl_progname);
  860. _dl_exit(20);
  861. }
  862. }
  863. retval = _dl_malloc_addr;
  864. _dl_malloc_addr += size;
  865. /*
  866. * Align memory to 4 byte boundary. Some platforms require this, others
  867. * simply get better performance.
  868. */
  869. _dl_malloc_addr = (char *) (((unsigned long) _dl_malloc_addr + 3) & ~(3));
  870. return retval;
  871. }
  872. char *_dl_getenv(char *symbol, char **envp)
  873. {
  874. char *pnt;
  875. char *pnt1;
  876. while ((pnt = *envp++)) {
  877. pnt1 = symbol;
  878. while (*pnt && *pnt == *pnt1)
  879. pnt1++, pnt++;
  880. if (!*pnt || *pnt != '=' || *pnt1)
  881. continue;
  882. return pnt + 1;
  883. }
  884. return 0;
  885. }
  886. void _dl_unsetenv(char *symbol, char **envp)
  887. {
  888. char *pnt;
  889. char *pnt1;
  890. char **newenvp = envp;
  891. for (pnt = *envp; pnt; pnt = *++envp) {
  892. pnt1 = symbol;
  893. while (*pnt && *pnt == *pnt1)
  894. pnt1++, pnt++;
  895. if (!*pnt || *pnt != '=' || *pnt1)
  896. *newenvp++ = *envp;
  897. }
  898. *newenvp++ = *envp;
  899. return;
  900. }
  901. char *_dl_strdup(const char *string)
  902. {
  903. char *retval;
  904. int len;
  905. len = _dl_strlen(string);
  906. retval = _dl_malloc(len + 1);
  907. _dl_strcpy(retval, string);
  908. return retval;
  909. }
  910. char *_dl_get_last_path_component(char *path)
  911. {
  912. char *s;
  913. s=path+_dl_strlen(path)-1;
  914. /* strip trailing slashes */
  915. while (s != path && *s == '/') {
  916. *s-- = '\0';
  917. }
  918. /* find last component */
  919. s = _dl_strrchr(path, '/');
  920. if (s == NULL || s[1] == '\0')
  921. return path;
  922. else
  923. return s+1;
  924. }