boot1.c 36 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214
  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 "hash.h"
  89. #include "syscall.h"
  90. #include "string.h"
  91. #include "../config.h"
  92. #define ALLOW_ZERO_PLTGOT
  93. /* Some arches may need to override this in boot1_arch.h */
  94. #define ELFMAGIC ELFMAG
  95. /* This is a poor man's malloc, used prior to resolving our internal poor man's malloc */
  96. #define DL_MALLOC(SIZE) ((void *) (malloc_buffer += SIZE, malloc_buffer - SIZE)) ; REALIGN();
  97. /*
  98. * Make sure that the malloc buffer is aligned on 4 byte boundary. For 64 bit
  99. * platforms we may need to increase this to 8, but this is good enough for
  100. * now. This is typically called after DL_MALLOC.
  101. */
  102. #define REALIGN() malloc_buffer = (char *) (((unsigned long) malloc_buffer + 3) & ~(3))
  103. static char *_dl_malloc_addr, *_dl_mmap_zero;
  104. char *_dl_library_path = 0; /* Where we look for libraries */
  105. char *_dl_preload = 0; /* Things to be loaded before the libs. */
  106. #include "ld.so.h" /* Pull in the name of ld.so */
  107. const char *_dl_progname=_dl_static_progname;
  108. static char *_dl_not_lazy = 0;
  109. #ifdef DL_TRACE
  110. static char *_dl_trace_loaded_objects = 0;
  111. #endif
  112. static int (*_dl_elf_main) (int, char **, char **);
  113. static int (*_dl_elf_init) (void);
  114. void *(*_dl_malloc_function) (int size) = NULL;
  115. struct r_debug *_dl_debug_addr = NULL;
  116. unsigned long *_dl_brkp;
  117. unsigned long *_dl_envp;
  118. char *_dl_getenv(char *symbol, char **envp);
  119. void _dl_unsetenv(char *symbol, char **envp);
  120. int _dl_fixup(struct elf_resolve *tpnt);
  121. void _dl_debug_state(void);
  122. char *_dl_get_last_path_component(char *path);
  123. #include "boot1_arch.h"
  124. /* When we enter this piece of code, the program stack looks like this:
  125. argc argument counter (integer)
  126. argv[0] program name (pointer)
  127. argv[1...N] program args (pointers)
  128. argv[argc-1] end of args (integer)
  129. NULL
  130. env[0...N] environment variables (pointers)
  131. NULL
  132. auxv_t[0...N] Auxiliary Vector Table elements (mixed types)
  133. */
  134. #ifdef DL_DEBUG
  135. /* Debugging is especially tricky on PowerPC, since string literals
  136. * require relocations. Thus, you can't use _dl_dprintf() for
  137. * anything until the bootstrap relocations are finished. */
  138. static inline void hexprint(unsigned long x)
  139. {
  140. int i;
  141. char c;
  142. for(i=0;i<8;i++){
  143. c=((x>>28)+'0');
  144. if(c>'9')c+='a'-'9'-1;
  145. _dl_write(1,&c,1);
  146. x<<=4;
  147. }
  148. c='\n';
  149. _dl_write(1,&c,1);
  150. }
  151. #endif
  152. DL_BOOT(unsigned long args)
  153. {
  154. unsigned int argc;
  155. char **argv, **envp;
  156. unsigned long load_addr;
  157. unsigned long *got;
  158. unsigned long *aux_dat;
  159. int goof = 0;
  160. elfhdr *header;
  161. struct elf_resolve *tpnt;
  162. struct dyn_elf *rpnt;
  163. struct elf_resolve *app_tpnt;
  164. unsigned long brk_addr;
  165. Elf32_auxv_t auxv_t[AT_EGID + 1];
  166. unsigned char *malloc_buffer, *mmap_zero;
  167. int (*_dl_atexit) (void *);
  168. unsigned long *lpnt;
  169. Elf32_Dyn *dpnt;
  170. unsigned long *hash_addr;
  171. struct r_debug *debug_addr;
  172. unsigned long *chains;
  173. int indx;
  174. int _dl_secure;
  175. int status;
  176. /* WARNING! -- we cannot make _any_ funtion calls until we have
  177. * taken care of fixing up our own relocations. Making static
  178. * lnline calls is ok, but _no_ function calls. Not yet
  179. * anyways. */
  180. /* First obtain the information on the stack that tells us more about
  181. what binary is loaded, where it is loaded, etc, etc */
  182. GET_ARGV(aux_dat,args);
  183. #if defined(__arm__)
  184. aux_dat+=1;
  185. #endif
  186. argc = *(aux_dat - 1);
  187. argv = (char **) aux_dat;
  188. aux_dat += argc; /* Skip over the argv pointers */
  189. aux_dat++; /* Skip over NULL at end of argv */
  190. envp = (char **) aux_dat;
  191. while (*aux_dat)
  192. aux_dat++; /* Skip over the envp pointers */
  193. aux_dat++; /* Skip over NULL at end of envp */
  194. /* Place -1 here as a checkpoint. We later check if it was changed
  195. * when we read in the auxv_t */
  196. auxv_t[AT_UID].a_type = -1;
  197. /* The junk on the stack immediately following the environment is
  198. * the Auxiliary Vector Table. Read out the elements of the auxv_t,
  199. * sort and store them in auxv_t for later use. */
  200. while (*aux_dat)
  201. {
  202. Elf32_auxv_t *auxv_entry = (Elf32_auxv_t*) aux_dat;
  203. if (auxv_entry->a_type <= AT_EGID) {
  204. _dl_memcpy(&(auxv_t[auxv_entry->a_type]),
  205. auxv_entry, sizeof(Elf32_auxv_t));
  206. }
  207. aux_dat += 2;
  208. }
  209. /* locate the ELF header. We need this done as soon as possible
  210. * (esp since SEND_STDERR() needs this on some platforms... */
  211. load_addr = auxv_t[AT_BASE].a_un.a_val;
  212. header = (elfhdr *) auxv_t[AT_BASE].a_un.a_ptr;
  213. /* Check the ELF header to make sure everything looks ok. */
  214. if (! header || header->e_ident[EI_CLASS] != ELFCLASS32 ||
  215. header->e_ident[EI_VERSION] != EV_CURRENT
  216. #ifndef __powerpc__
  217. || _dl_strncmp((void *)header, ELFMAGIC, SELFMAG) != 0
  218. #endif
  219. )
  220. {
  221. SEND_STDERR("Invalid ELF header\n");
  222. _dl_exit(0);
  223. }
  224. #ifdef DL_DEBUG
  225. SEND_STDERR("ELF header =");
  226. SEND_ADDRESS_STDERR(load_addr, 1);
  227. #endif
  228. /* Locate the global offset table. Since this code must be PIC
  229. * we can take advantage of the magic offset register, if we
  230. * happen to know what that is for this architecture. If not,
  231. * we can always read stuff out of the ELF file to find it... */
  232. #if defined(__i386__)
  233. __asm__("\tmovl %%ebx,%0\n\t" : "=a" (got));
  234. #elif defined(__m68k__)
  235. __asm__ ("movel %%a5,%0" : "=g" (got))
  236. #elif defined(__sparc__)
  237. __asm__("\tmov %%l7,%0\n\t" : "=r" (got))
  238. #elif defined(__arm__)
  239. __asm__("\tmov %0, r10\n\t" : "=r"(got));
  240. #elif defined(__powerpc__)
  241. __asm__("\tbl _GLOBAL_OFFSET_TABLE_-4@local\n\t" : "=l"(got));
  242. #else
  243. /* Do things the slow way in C */
  244. {
  245. unsigned long tx_reloc;
  246. Elf32_Dyn *dynamic=NULL;
  247. Elf32_Shdr *shdr;
  248. Elf32_Phdr *pt_load;
  249. #ifdef DL_DEBUG
  250. SEND_STDERR("Finding the got using C code to read the ELF file\n");
  251. #endif
  252. /* Find where the dynamic linking information section is hiding */
  253. shdr = (Elf32_Shdr *)(header->e_shoff + (char *)header);
  254. for (indx = header->e_shnum; --indx>=0; ++shdr) {
  255. if (shdr->sh_type == SHT_DYNAMIC) {
  256. goto found_dynamic;
  257. }
  258. }
  259. SEND_STDERR("missing dynamic linking information section \n");
  260. _dl_exit(0);
  261. found_dynamic:
  262. dynamic = (Elf32_Dyn*)(shdr->sh_offset + (char *)header);
  263. /* Find where PT_LOAD is hiding */
  264. pt_load = (Elf32_Phdr *)(header->e_phoff + (char *)header);
  265. for (indx = header->e_phnum; --indx>=0; ++pt_load) {
  266. if (pt_load->p_type == PT_LOAD) {
  267. goto found_pt_load;
  268. }
  269. }
  270. SEND_STDERR("missing loadable program segment\n");
  271. _dl_exit(0);
  272. found_pt_load:
  273. /* Now (finally) find where DT_PLTGOT is hiding */
  274. tx_reloc = pt_load->p_vaddr - pt_load->p_offset;
  275. for (; DT_NULL!=dynamic->d_tag; ++dynamic) {
  276. if (dynamic->d_tag == DT_PLTGOT) {
  277. goto found_got;
  278. }
  279. }
  280. SEND_STDERR("missing global offset table\n");
  281. _dl_exit(0);
  282. found_got:
  283. got = (unsigned long *)(dynamic->d_un.d_val - tx_reloc + (char *)header );
  284. }
  285. #endif
  286. /* Now, finally, fix up the location of the dynamic stuff */
  287. dpnt = (Elf32_Dyn *) (*got + load_addr);
  288. #ifdef DL_DEBUG
  289. SEND_STDERR("First Dynamic section entry=");
  290. SEND_ADDRESS_STDERR(dpnt, 1);
  291. #endif
  292. /* Call mmap to get a page of writable memory that can be used
  293. * for _dl_malloc throughout the shared lib loader. */
  294. mmap_zero = malloc_buffer = _dl_mmap((void *) 0, 4096,
  295. PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, 0, 0);
  296. if (_dl_mmap_check_error(mmap_zero)) {
  297. SEND_STDERR("dl_boot: mmap of a spare page failed!\n");
  298. _dl_exit(13);
  299. }
  300. tpnt = DL_MALLOC(sizeof(struct elf_resolve));
  301. _dl_memset(tpnt, 0, sizeof(*tpnt));
  302. app_tpnt = DL_MALLOC(sizeof(struct elf_resolve));
  303. _dl_memset(app_tpnt, 0, sizeof(*app_tpnt));
  304. /*
  305. * This is used by gdb to locate the chain of shared libraries that are currently loaded.
  306. */
  307. debug_addr = DL_MALLOC(sizeof(struct r_debug));
  308. _dl_memset(debug_addr, 0, sizeof(*debug_addr));
  309. /* OK, that was easy. Next scan the DYNAMIC section of the image.
  310. We are only doing ourself right now - we will have to do the rest later */
  311. while (dpnt->d_tag) {
  312. if(dpnt->d_tag<24) {
  313. tpnt->dynamic_info[dpnt->d_tag] = dpnt->d_un.d_val;
  314. if (dpnt->d_tag == DT_TEXTREL || SVR4_BUGCOMPAT) {
  315. tpnt->dynamic_info[DT_TEXTREL] = 1;
  316. }
  317. }
  318. dpnt++;
  319. }
  320. {
  321. elf_phdr *ppnt;
  322. int i;
  323. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  324. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++)
  325. if (ppnt->p_type == PT_DYNAMIC) {
  326. dpnt = (Elf32_Dyn *) ppnt->p_vaddr;
  327. while (dpnt->d_tag) {
  328. if (dpnt->d_tag > DT_JMPREL) {
  329. dpnt++;
  330. continue;
  331. }
  332. app_tpnt->dynamic_info[dpnt->d_tag] = dpnt->d_un.d_val;
  333. if (dpnt->d_tag == DT_DEBUG)
  334. dpnt->d_un.d_val = (unsigned long) debug_addr;
  335. if (dpnt->d_tag == DT_TEXTREL || SVR4_BUGCOMPAT)
  336. app_tpnt->dynamic_info[DT_TEXTREL] = 1;
  337. dpnt++;
  338. }
  339. }
  340. }
  341. /* Get some more of the information that we will need to dynamicly link
  342. this module to itself */
  343. hash_addr = (unsigned long *) (tpnt->dynamic_info[DT_HASH] + load_addr);
  344. tpnt->nbucket = *hash_addr++;
  345. tpnt->nchain = *hash_addr++;
  346. tpnt->elf_buckets = hash_addr;
  347. hash_addr += tpnt->nbucket;
  348. chains = hash_addr;
  349. /* Ugly, ugly. We need to call mprotect to change the protection of
  350. the text pages so that we can do the dynamic linking. We can set the
  351. protection back again once we are done */
  352. {
  353. elf_phdr *ppnt;
  354. int i;
  355. /* First cover the shared library/dynamic linker. */
  356. if (tpnt->dynamic_info[DT_TEXTREL]) {
  357. header = (elfhdr *) auxv_t[AT_BASE].a_un.a_ptr;
  358. ppnt = (elf_phdr *) (auxv_t[AT_BASE].a_un.a_ptr + header->e_phoff);
  359. for (i = 0; i < header->e_phnum; i++, ppnt++) {
  360. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W))
  361. _dl_mprotect((void *) (load_addr + (ppnt->p_vaddr & 0xfffff000)),
  362. (ppnt->p_vaddr & 0xfff) + (unsigned long) ppnt->p_filesz,
  363. PROT_READ | PROT_WRITE | PROT_EXEC);
  364. }
  365. }
  366. /* Now cover the application program. */
  367. if (app_tpnt->dynamic_info[DT_TEXTREL]) {
  368. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  369. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++) {
  370. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W))
  371. _dl_mprotect((void *) (ppnt->p_vaddr & 0xfffff000),
  372. (ppnt->p_vaddr & 0xfff) +
  373. (unsigned long) ppnt->p_filesz,
  374. PROT_READ | PROT_WRITE | PROT_EXEC);
  375. }
  376. }
  377. }
  378. /* OK, now do the relocations. We do not do a lazy binding here, so
  379. that once we are done, we have considerably more flexibility. */
  380. goof = 0;
  381. for (indx = 0; indx < 2; indx++) {
  382. int i;
  383. ELF_RELOC *rpnt;
  384. unsigned long *reloc_addr;
  385. unsigned long symbol_addr;
  386. int symtab_index;
  387. unsigned long rel_addr, rel_size;
  388. #ifdef ELF_USES_RELOCA
  389. rel_addr =
  390. (indx ? tpnt->dynamic_info[DT_JMPREL] : tpnt->
  391. dynamic_info[DT_RELA]);
  392. rel_size =
  393. (indx ? tpnt->dynamic_info[DT_PLTRELSZ] : tpnt->
  394. dynamic_info[DT_RELASZ]);
  395. #else
  396. rel_addr =
  397. (indx ? tpnt->dynamic_info[DT_JMPREL] : tpnt->
  398. dynamic_info[DT_REL]);
  399. rel_size =
  400. (indx ? tpnt->dynamic_info[DT_PLTRELSZ] : tpnt->
  401. dynamic_info[DT_RELSZ]);
  402. #endif
  403. if (!rel_addr)
  404. continue;
  405. /* Now parse the relocation information */
  406. rpnt = (ELF_RELOC *) (rel_addr + load_addr);
  407. for (i = 0; i < rel_size; i += sizeof(ELF_RELOC), rpnt++) {
  408. reloc_addr = (unsigned long *) (load_addr + (unsigned long) rpnt->r_offset);
  409. symtab_index = ELF32_R_SYM(rpnt->r_info);
  410. symbol_addr = 0;
  411. if (symtab_index) {
  412. char *strtab;
  413. Elf32_Sym *symtab;
  414. symtab = (Elf32_Sym *) (tpnt->dynamic_info[DT_SYMTAB] + load_addr);
  415. strtab = (char *) (tpnt->dynamic_info[DT_STRTAB] + load_addr);
  416. /* We only do a partial dynamic linking right now. The user
  417. is not supposed to redefine any symbols that start with
  418. a '_', so we can do this with confidence. */
  419. if (!_dl_symbol(strtab + symtab[symtab_index].st_name))
  420. continue;
  421. symbol_addr = load_addr + symtab[symtab_index].st_value;
  422. if (!symbol_addr) {
  423. /*
  424. * This will segfault - you cannot call a function until
  425. * we have finished the relocations.
  426. */
  427. SEND_STDERR("ELF dynamic loader - unable to "
  428. "self-bootstrap - symbol ");
  429. SEND_STDERR(strtab + symtab[symtab_index].st_name);
  430. SEND_STDERR(" undefined.\n");
  431. goof++;
  432. }
  433. }
  434. /*
  435. * Use this machine-specific macro to perform the actual relocation.
  436. */
  437. PERFORM_BOOTSTRAP_RELOC(rpnt, reloc_addr, symbol_addr, load_addr);
  438. }
  439. }
  440. if (goof) {
  441. _dl_exit(14);
  442. }
  443. /* OK, at this point we have a crude malloc capability. Start to build
  444. the tables of the modules that are required for this beast to run.
  445. We start with the basic executable, and then go from there. Eventually
  446. we will run across ourself, and we will need to properly deal with that
  447. as well. */
  448. _dl_malloc_addr = malloc_buffer;
  449. _dl_mmap_zero = mmap_zero;
  450. /* Now we have done the mandatory linking of some things. We are now
  451. free to start using global variables, since these things have all been
  452. fixed up by now. Still no function calls outside of this library ,
  453. since the dynamic resolver is not yet ready. */
  454. lpnt = (unsigned long *) (tpnt->dynamic_info[DT_PLTGOT] + load_addr);
  455. INIT_GOT(lpnt, tpnt);
  456. /* OK, this was a big step, now we need to scan all of the user images
  457. and load them properly. */
  458. tpnt->next = 0;
  459. tpnt->libname = 0;
  460. tpnt->libtype = program_interpreter;
  461. {
  462. elfhdr *epnt;
  463. elf_phdr *ppnt;
  464. int i;
  465. epnt = (elfhdr *) auxv_t[AT_BASE].a_un.a_ptr;
  466. tpnt->n_phent = epnt->e_phnum;
  467. tpnt->ppnt = ppnt = (elf_phdr *) (load_addr + epnt->e_phoff);
  468. for (i = 0; i < epnt->e_phnum; i++, ppnt++) {
  469. if (ppnt->p_type == PT_DYNAMIC) {
  470. tpnt->dynamic_addr = ppnt->p_vaddr + load_addr;
  471. tpnt->dynamic_size = ppnt->p_filesz;
  472. }
  473. }
  474. }
  475. tpnt->chains = chains;
  476. tpnt->loadaddr = (char *) load_addr;
  477. brk_addr = 0;
  478. rpnt = NULL;
  479. /* At this point we are now free to examine the user application,
  480. and figure out which libraries are supposed to be called. Until
  481. we have this list, we will not be completely ready for dynamic linking */
  482. {
  483. elf_phdr *ppnt;
  484. int i;
  485. ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  486. for (i = 0; i < auxv_t[AT_PHNUM].a_un.a_val; i++, ppnt++) {
  487. if (ppnt->p_type == PT_LOAD) {
  488. if (ppnt->p_vaddr + ppnt->p_memsz > brk_addr)
  489. brk_addr = ppnt->p_vaddr + ppnt->p_memsz;
  490. }
  491. if (ppnt->p_type == PT_DYNAMIC) {
  492. #ifndef ALLOW_ZERO_PLTGOT
  493. /* make sure it's really there. */
  494. if (app_tpnt->dynamic_info[DT_PLTGOT] == 0)
  495. continue;
  496. #endif
  497. /* OK, we have what we need - slip this one into the list. */
  498. app_tpnt = _dl_add_elf_hash_table("", 0,
  499. app_tpnt->dynamic_info, ppnt->p_vaddr, ppnt->p_filesz);
  500. _dl_loaded_modules->libtype = elf_executable;
  501. _dl_loaded_modules->ppnt = (elf_phdr *) auxv_t[AT_PHDR].a_un.a_ptr;
  502. _dl_loaded_modules->n_phent = auxv_t[AT_PHNUM].a_un.a_val;
  503. _dl_symbol_tables = rpnt = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  504. _dl_memset(rpnt, 0, sizeof(*rpnt));
  505. rpnt->dyn = _dl_loaded_modules;
  506. app_tpnt->usage_count++;
  507. app_tpnt->symbol_scope = _dl_symbol_tables;
  508. lpnt = (unsigned long *) (app_tpnt->dynamic_info[DT_PLTGOT]);
  509. #ifdef ALLOW_ZERO_PLTGOT
  510. if (lpnt)
  511. #endif
  512. INIT_GOT(lpnt, _dl_loaded_modules);
  513. }
  514. if (ppnt->p_type == PT_INTERP) { /* OK, fill this in - we did not
  515. have this before */
  516. tpnt->libname = _dl_strdup((char *) ppnt->p_offset +
  517. (auxv_t[AT_PHDR].a_un.a_val & 0xfffff000));
  518. }
  519. }
  520. }
  521. if (argv[0]) {
  522. _dl_progname = argv[0];
  523. }
  524. /* Now we need to figure out what kind of options are selected.
  525. Note that for SUID programs we ignore the settings in LD_LIBRARY_PATH */
  526. {
  527. _dl_not_lazy = _dl_getenv("LD_BIND_NOW", envp);
  528. if ((auxv_t[AT_UID].a_un.a_val == -1 && _dl_suid_ok()) ||
  529. (auxv_t[AT_UID].a_un.a_val != -1 &&
  530. auxv_t[AT_UID].a_un.a_val == auxv_t[AT_EUID].a_un.a_val
  531. && auxv_t[AT_GID].a_un.a_val== auxv_t[AT_EGID].a_un.a_val)) {
  532. _dl_secure = 0;
  533. _dl_preload = _dl_getenv("LD_PRELOAD", envp);
  534. _dl_library_path = _dl_getenv("LD_LIBRARY_PATH", envp);
  535. } else {
  536. _dl_secure = 1;
  537. _dl_preload = _dl_getenv("LD_PRELOAD", envp);
  538. _dl_unsetenv("LD_AOUT_PRELOAD", envp);
  539. _dl_unsetenv("LD_LIBRARY_PATH", envp);
  540. _dl_unsetenv("LD_AOUT_LIBRARY_PATH", envp);
  541. _dl_library_path = NULL;
  542. }
  543. }
  544. #ifdef DL_TRACE
  545. _dl_trace_loaded_objects = _dl_getenv("LD_TRACE_LOADED_OBJECTS", envp);
  546. #endif
  547. /* OK, we now have the application in the list, and we have some
  548. basic stuff in place. Now search through the list for other shared
  549. libraries that should be loaded, and insert them on the list in the
  550. correct order. */
  551. #ifdef USE_CACHE
  552. _dl_map_cache();
  553. #endif
  554. {
  555. struct elf_resolve *tcurr;
  556. struct elf_resolve *tpnt1;
  557. char *lpnt;
  558. if (_dl_preload)
  559. {
  560. char c, *str, *str2;
  561. str = _dl_preload;
  562. while (*str == ':' || *str == ' ' || *str == '\t')
  563. str++;
  564. while (*str)
  565. {
  566. str2 = str;
  567. while (*str2 && *str2 != ':' && *str2 != ' ' && *str2 != '\t')
  568. str2++;
  569. c = *str2;
  570. *str2 = '\0';
  571. if (!_dl_secure || _dl_strchr(str, '/') == NULL)
  572. {
  573. tpnt1 = _dl_load_shared_library(_dl_secure, NULL, str);
  574. if (!tpnt1) {
  575. #ifdef DL_TRACE
  576. if (_dl_trace_loaded_objects)
  577. _dl_dprintf(1, "\t%s => not found\n", str);
  578. else {
  579. #endif
  580. _dl_dprintf(2, "%s: can't load "
  581. "library '%s'\n", _dl_progname, str);
  582. _dl_exit(15);
  583. #ifdef DL_TRACE
  584. }
  585. #endif
  586. } else {
  587. #ifdef DL_TRACE
  588. if (_dl_trace_loaded_objects
  589. && !tpnt1->usage_count) {
  590. /* this is a real hack to make ldd not print
  591. * the library itself when run on a library. */
  592. if (_dl_strcmp(_dl_progname, str) != 0)
  593. _dl_dprintf(1, "\t%s => %s (0x%x)\n", str, tpnt1->libname,
  594. (unsigned) tpnt1->loadaddr);
  595. }
  596. #endif
  597. rpnt->next = (struct dyn_elf *)
  598. _dl_malloc(sizeof(struct dyn_elf));
  599. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  600. rpnt = rpnt->next;
  601. tpnt1->usage_count++;
  602. tpnt1->symbol_scope = _dl_symbol_tables;
  603. tpnt1->libtype = elf_lib;
  604. rpnt->dyn = tpnt1;
  605. }
  606. }
  607. *str2 = c;
  608. str = str2;
  609. while (*str == ':' || *str == ' ' || *str == '\t')
  610. str++;
  611. }
  612. }
  613. {
  614. int fd;
  615. struct stat st;
  616. char *preload;
  617. if (!_dl_stat(LDSO_PRELOAD, &st) && st.st_size > 0) {
  618. if ((fd = _dl_open(LDSO_PRELOAD, O_RDONLY)) < 0) {
  619. _dl_dprintf(2, "%s: can't open file '%s'\n",
  620. _dl_progname, LDSO_PRELOAD);
  621. } else {
  622. preload = (caddr_t) _dl_mmap(0, st.st_size + 1,
  623. PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
  624. _dl_close(fd);
  625. if (preload == (caddr_t) - 1) {
  626. _dl_dprintf(2, "%s: can't map file '%s'\n",
  627. _dl_progname, LDSO_PRELOAD);
  628. } else {
  629. char c, *cp, *cp2;
  630. /* convert all separators and comments to spaces */
  631. for (cp = preload; *cp; /*nada */ ) {
  632. if (*cp == ':' || *cp == '\t' || *cp == '\n') {
  633. *cp++ = ' ';
  634. } else if (*cp == '#') {
  635. do
  636. *cp++ = ' ';
  637. while (*cp != '\n' && *cp != '\0');
  638. } else {
  639. cp++;
  640. }
  641. }
  642. /* find start of first library */
  643. for (cp = preload; *cp && *cp == ' '; cp++)
  644. /*nada */ ;
  645. while (*cp) {
  646. /* find end of library */
  647. for (cp2 = cp; *cp && *cp != ' '; cp++)
  648. /*nada */ ;
  649. c = *cp;
  650. *cp = '\0';
  651. tpnt1 = _dl_load_shared_library(0, NULL, cp2);
  652. if (!tpnt1) {
  653. #ifdef DL_TRACE
  654. if (_dl_trace_loaded_objects)
  655. _dl_dprintf(1, "\t%s => not found\n", cp2);
  656. else {
  657. #endif
  658. _dl_dprintf(2, "%s: can't load library '%s'\n",
  659. _dl_progname, cp2);
  660. _dl_exit(15);
  661. #ifdef DL_TRACE
  662. }
  663. #endif
  664. } else {
  665. #ifdef DL_TRACE
  666. if (_dl_trace_loaded_objects
  667. && !tpnt1->usage_count) {
  668. _dl_dprintf(1, "\t%s => %s (0x%x)\n", cp2,
  669. tpnt1->libname, (unsigned) tpnt1->loadaddr);
  670. }
  671. #endif
  672. rpnt->next = (struct dyn_elf *)
  673. _dl_malloc(sizeof(struct dyn_elf));
  674. _dl_memset(rpnt->next, 0,
  675. sizeof(*(rpnt->next)));
  676. rpnt = rpnt->next;
  677. tpnt1->usage_count++;
  678. tpnt1->symbol_scope = _dl_symbol_tables;
  679. tpnt1->libtype = elf_lib;
  680. rpnt->dyn = tpnt1;
  681. }
  682. /* find start of next library */
  683. *cp = c;
  684. for ( /*nada */ ; *cp && *cp == ' '; cp++)
  685. /*nada */ ;
  686. }
  687. _dl_munmap(preload, st.st_size + 1);
  688. }
  689. }
  690. }
  691. }
  692. for (tcurr = _dl_loaded_modules; tcurr; tcurr = tcurr->next) {
  693. for (dpnt = (Elf32_Dyn *) tcurr->dynamic_addr; dpnt->d_tag;
  694. dpnt++) {
  695. if (dpnt->d_tag == DT_NEEDED) {
  696. lpnt = tcurr->loadaddr + tcurr->dynamic_info[DT_STRTAB] +
  697. dpnt->d_un.d_val;
  698. if (tpnt && _dl_strcmp(lpnt,
  699. _dl_get_last_path_component(tpnt->libname)) == 0) {
  700. struct elf_resolve *ttmp;
  701. #ifdef DL_TRACE
  702. if (_dl_trace_loaded_objects && !tpnt->usage_count) {
  703. _dl_dprintf(1, "\t%s => %s (0x%x)\n",
  704. lpnt, tpnt->libname, (unsigned) tpnt->loadaddr);
  705. }
  706. #endif
  707. ttmp = _dl_loaded_modules;
  708. while (ttmp->next)
  709. ttmp = ttmp->next;
  710. ttmp->next = tpnt;
  711. tpnt->prev = ttmp;
  712. tpnt->next = NULL;
  713. rpnt->next = (struct dyn_elf *)
  714. _dl_malloc(sizeof(struct dyn_elf));
  715. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  716. rpnt = rpnt->next;
  717. rpnt->dyn = tpnt;
  718. tpnt->usage_count++;
  719. tpnt->symbol_scope = _dl_symbol_tables;
  720. tpnt = NULL;
  721. continue;
  722. }
  723. if (!(tpnt1 = _dl_load_shared_library(0, tcurr, lpnt))) {
  724. #ifdef DL_TRACE
  725. if (_dl_trace_loaded_objects)
  726. _dl_dprintf(1, "\t%s => not found\n", lpnt);
  727. else {
  728. #endif
  729. _dl_dprintf(2, "%s: can't load library '%s'\n",
  730. _dl_progname, lpnt);
  731. _dl_exit(16);
  732. #ifdef DL_TRACE
  733. }
  734. #endif
  735. } else {
  736. #ifdef DL_TRACE
  737. if (_dl_trace_loaded_objects && !tpnt1->usage_count)
  738. _dl_dprintf(1, "\t%s => %s (0x%x)\n", lpnt, tpnt1->libname,
  739. (unsigned) tpnt1->loadaddr);
  740. #endif
  741. rpnt->next = (struct dyn_elf *)
  742. _dl_malloc(sizeof(struct dyn_elf));
  743. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  744. rpnt = rpnt->next;
  745. tpnt1->usage_count++;
  746. tpnt1->symbol_scope = _dl_symbol_tables;
  747. tpnt1->libtype = elf_lib;
  748. rpnt->dyn = tpnt1;
  749. }
  750. }
  751. }
  752. }
  753. }
  754. #ifdef USE_CACHE
  755. _dl_unmap_cache();
  756. #endif
  757. /* ldd uses uses this. I am not sure how you pick up the other flags */
  758. #ifdef DL_TRACE
  759. if (_dl_trace_loaded_objects) {
  760. char *_dl_warn = 0;
  761. _dl_warn = _dl_getenv("LD_WARN", envp);
  762. if (!_dl_warn)
  763. _dl_exit(0);
  764. }
  765. #endif
  766. /*
  767. * If the program interpreter is not in the module chain, add it. This will
  768. * be required for dlopen to be able to access the internal functions in the
  769. * dynamic linker.
  770. */
  771. if (tpnt) {
  772. struct elf_resolve *tcurr;
  773. tcurr = _dl_loaded_modules;
  774. if (tcurr)
  775. while (tcurr->next)
  776. tcurr = tcurr->next;
  777. tpnt->next = NULL;
  778. tpnt->usage_count++;
  779. if (tcurr) {
  780. tcurr->next = tpnt;
  781. tpnt->prev = tcurr;
  782. } else {
  783. _dl_loaded_modules = tpnt;
  784. tpnt->prev = NULL;
  785. }
  786. if (rpnt) {
  787. rpnt->next = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  788. _dl_memset(rpnt->next, 0, sizeof(*(rpnt->next)));
  789. rpnt = rpnt->next;
  790. } else {
  791. rpnt = (struct dyn_elf *) _dl_malloc(sizeof(struct dyn_elf));
  792. _dl_memset(rpnt, 0, sizeof(*(rpnt->next)));
  793. }
  794. rpnt->dyn = tpnt;
  795. tpnt = NULL;
  796. }
  797. /*
  798. * OK, now all of the kids are tucked into bed in their proper addresses.
  799. * Now we go through and look for REL and RELA records that indicate fixups
  800. * to the GOT tables. We need to do this in reverse order so that COPY
  801. * directives work correctly */
  802. goof = _dl_loaded_modules ? _dl_fixup(_dl_loaded_modules) : 0;
  803. /* Some flavors of SVr4 do not generate the R_*_COPY directive,
  804. and we have to manually search for entries that require fixups.
  805. Solaris gets this one right, from what I understand. */
  806. if (_dl_symbol_tables)
  807. goof += _dl_copy_fixups(_dl_symbol_tables);
  808. #ifdef DL_TRACE
  809. if (goof || _dl_trace_loaded_objects)
  810. _dl_exit(0);
  811. #endif
  812. /* OK, at this point things are pretty much ready to run. Now we
  813. need to touch up a few items that are required, and then
  814. we can let the user application have at it. Note that
  815. the dynamic linker itself is not guaranteed to be fully
  816. dynamicly linked if we are using ld.so.1, so we have to look
  817. up each symbol individually. */
  818. _dl_brkp = (unsigned long *) _dl_find_hash("___brk_addr", NULL, 1, NULL, 0);
  819. if (_dl_brkp)
  820. *_dl_brkp = brk_addr;
  821. _dl_envp =
  822. (unsigned long *) _dl_find_hash("__environ", NULL, 1, NULL, 0);
  823. if (_dl_envp)
  824. *_dl_envp = (unsigned long) envp;
  825. {
  826. int i;
  827. elf_phdr *ppnt;
  828. /* We had to set the protections of all pages to R/W for dynamic linking.
  829. Set text pages back to R/O */
  830. for (tpnt = _dl_loaded_modules; tpnt; tpnt = tpnt->next)
  831. for (ppnt = tpnt->ppnt, i = 0; i < tpnt->n_phent; i++, ppnt++)
  832. if (ppnt->p_type == PT_LOAD && !(ppnt->p_flags & PF_W) &&
  833. tpnt->dynamic_info[DT_TEXTREL])
  834. _dl_mprotect((void *) (tpnt->loadaddr + (ppnt->p_vaddr & 0xfffff000)),
  835. (ppnt->p_vaddr & 0xfff) + (unsigned long) ppnt->p_filesz,
  836. LXFLAGS(ppnt->p_flags));
  837. }
  838. _dl_atexit = (int (*)(void *)) _dl_find_hash("atexit", NULL, 1, NULL, 0);
  839. /*
  840. * OK, fix one more thing - set up the debug_addr structure to point
  841. * to our chain. Later we may need to fill in more fields, but this
  842. * should be enough for now.
  843. */
  844. debug_addr->r_map = (struct link_map *) _dl_loaded_modules;
  845. debug_addr->r_version = 1;
  846. debug_addr->r_ldbase = load_addr;
  847. debug_addr->r_brk = (unsigned long) &_dl_debug_state;
  848. _dl_debug_addr = debug_addr;
  849. debug_addr->r_state = RT_CONSISTENT;
  850. /* This is written in this funny way to keep gcc from inlining the
  851. function call. */
  852. ((void (*)(void)) debug_addr->r_brk) ();
  853. for (tpnt = _dl_loaded_modules; tpnt; tpnt = tpnt->next) {
  854. /* Apparently crt1 for the application is responsible for handling this.
  855. * We only need to run the init/fini for shared libraries
  856. */
  857. if (tpnt->libtype == program_interpreter ||
  858. tpnt->libtype == elf_executable)
  859. continue;
  860. if (tpnt->init_flag & INIT_FUNCS_CALLED)
  861. continue;
  862. tpnt->init_flag |= INIT_FUNCS_CALLED;
  863. if (tpnt->dynamic_info[DT_INIT]) {
  864. _dl_elf_init = (int (*)(void)) (tpnt->loadaddr +
  865. tpnt->dynamic_info[DT_INIT]);
  866. (*_dl_elf_init) ();
  867. }
  868. if (_dl_atexit && tpnt->dynamic_info[DT_FINI]) {
  869. (*_dl_atexit) (tpnt->loadaddr + tpnt->dynamic_info[DT_FINI]);
  870. }
  871. #undef DL_DEBUG
  872. #ifdef DL_DEBUG
  873. else {
  874. _dl_dprintf(2, tpnt->libname);
  875. _dl_dprintf(2, ": ");
  876. if (!_dl_atexit)
  877. _dl_dprintf(2, "The address is atexit () is 0x0.");
  878. if (!tpnt->dynamic_info[DT_FINI])
  879. _dl_dprintf(2, "Invalid .fini section.");
  880. _dl_dprintf(2, "\n");
  881. }
  882. #endif
  883. #undef DL_DEBUG
  884. }
  885. /* OK we are done here. Turn out the lights, and lock up. */
  886. _dl_elf_main = (int (*)(int, char **, char **)) auxv_t[AT_ENTRY].a_un.a_fcn;
  887. /*
  888. * Transfer control to the application.
  889. */
  890. status = 0; /* Used on x86, but not on other arches */
  891. START();
  892. }
  893. /*
  894. * This stub function is used by some debuggers. The idea is that they
  895. * can set an internal breakpoint on it, so that we are notified when the
  896. * address mapping is changed in some way.
  897. */
  898. void _dl_debug_state()
  899. {
  900. return;
  901. }
  902. int _dl_fixup(struct elf_resolve *tpnt)
  903. {
  904. int goof = 0;
  905. if (tpnt->next)
  906. goof += _dl_fixup(tpnt->next);
  907. if (tpnt->dynamic_info[DT_REL]) {
  908. #ifdef ELF_USES_RELOCA
  909. _dl_dprintf(2, "%s: can't handle REL relocation records\n",
  910. _dl_progname);
  911. _dl_exit(17);
  912. #else
  913. if (tpnt->init_flag & RELOCS_DONE)
  914. return goof;
  915. tpnt->init_flag |= RELOCS_DONE;
  916. goof += _dl_parse_relocation_information(tpnt,
  917. tpnt->dynamic_info[DT_REL], tpnt->dynamic_info[DT_RELSZ], 0);
  918. #endif
  919. }
  920. if (tpnt->dynamic_info[DT_RELA]) {
  921. #ifdef ELF_USES_RELOCA
  922. if (tpnt->init_flag & RELOCS_DONE)
  923. return goof;
  924. tpnt->init_flag |= RELOCS_DONE;
  925. goof += _dl_parse_relocation_information(tpnt,
  926. tpnt->dynamic_info[DT_RELA], tpnt->dynamic_info[DT_RELASZ], 0);
  927. #else
  928. _dl_dprintf(2, "%s: can't handle RELA relocation records\n",
  929. _dl_progname);
  930. _dl_exit(18);
  931. #endif
  932. }
  933. if (tpnt->dynamic_info[DT_JMPREL]) {
  934. if (tpnt->init_flag & JMP_RELOCS_DONE)
  935. return goof;
  936. tpnt->init_flag |= JMP_RELOCS_DONE;
  937. if (!_dl_not_lazy || *_dl_not_lazy == 0)
  938. _dl_parse_lazy_relocation_information(tpnt,
  939. tpnt->dynamic_info[DT_JMPREL], tpnt->dynamic_info[DT_PLTRELSZ], 0);
  940. else
  941. goof += _dl_parse_relocation_information(tpnt,
  942. tpnt->dynamic_info[DT_JMPREL], tpnt->dynamic_info[DT_PLTRELSZ], 0);
  943. }
  944. return goof;
  945. }
  946. void *_dl_malloc(int size)
  947. {
  948. void *retval;
  949. #ifdef DL_DEBUG
  950. SEND_STDERR("malloc: request for ");
  951. SEND_NUMBER_STDERR(size, 0);
  952. SEND_STDERR(" bytes\n");
  953. #endif
  954. if (_dl_malloc_function)
  955. return (*_dl_malloc_function) (size);
  956. if (_dl_malloc_addr - _dl_mmap_zero + size > 4096) {
  957. #ifdef DL_DEBUG
  958. SEND_STDERR("malloc: mmapping more memory\n");
  959. #endif
  960. _dl_mmap_zero = _dl_malloc_addr = _dl_mmap((void *) 0, size,
  961. PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, 0, 0);
  962. if (_dl_mmap_check_error(_dl_mmap_zero)) {
  963. _dl_dprintf(2, "%s: mmap of a spare page failed!\n", _dl_progname);
  964. _dl_exit(20);
  965. }
  966. }
  967. retval = _dl_malloc_addr;
  968. _dl_malloc_addr += size;
  969. /*
  970. * Align memory to 4 byte boundary. Some platforms require this, others
  971. * simply get better performance.
  972. */
  973. _dl_malloc_addr = (char *) (((unsigned long) _dl_malloc_addr + 3) & ~(3));
  974. return retval;
  975. }
  976. char *_dl_getenv(char *symbol, char **envp)
  977. {
  978. char *pnt;
  979. char *pnt1;
  980. while ((pnt = *envp++)) {
  981. pnt1 = symbol;
  982. while (*pnt && *pnt == *pnt1)
  983. pnt1++, pnt++;
  984. if (!*pnt || *pnt != '=' || *pnt1)
  985. continue;
  986. return pnt + 1;
  987. }
  988. return 0;
  989. }
  990. void _dl_unsetenv(char *symbol, char **envp)
  991. {
  992. char *pnt;
  993. char *pnt1;
  994. char **newenvp = envp;
  995. for (pnt = *envp; pnt; pnt = *++envp) {
  996. pnt1 = symbol;
  997. while (*pnt && *pnt == *pnt1)
  998. pnt1++, pnt++;
  999. if (!*pnt || *pnt != '=' || *pnt1)
  1000. *newenvp++ = *envp;
  1001. }
  1002. *newenvp++ = *envp;
  1003. return;
  1004. }
  1005. char *_dl_strdup(const char *string)
  1006. {
  1007. char *retval;
  1008. int len;
  1009. len = _dl_strlen(string);
  1010. retval = _dl_malloc(len + 1);
  1011. _dl_strcpy(retval, string);
  1012. return retval;
  1013. }
  1014. /* Minimum printf which handles only characters, %d's and %s's */
  1015. void _dl_dprintf(int fd, const char *fmt, ...)
  1016. {
  1017. int num;
  1018. va_list args;
  1019. char *start, *ptr, *string;
  1020. char buf[2048];
  1021. start = ptr = buf;
  1022. if (!fmt)
  1023. return;
  1024. if (_dl_strlen(fmt) >= (sizeof(buf)-1))
  1025. _dl_write(fd, "(overflow)\n", 10);
  1026. _dl_strcpy(buf, fmt);
  1027. va_start(args, fmt);
  1028. while(start)
  1029. {
  1030. while(*ptr != '%' && *ptr) {
  1031. ptr++;
  1032. }
  1033. if(*ptr == '%')
  1034. {
  1035. *ptr++ = '\0';
  1036. _dl_write(fd, start, _dl_strlen(start));
  1037. switch(*ptr++)
  1038. {
  1039. case 's':
  1040. string = va_arg(args, char *);
  1041. if (!string)
  1042. _dl_write(fd, "(null)", 6);
  1043. else
  1044. _dl_write(fd, string, _dl_strlen(string));
  1045. break;
  1046. case 'i':
  1047. case 'd':
  1048. {
  1049. char tmp[13];
  1050. num = va_arg(args, int);
  1051. string = _dl_simple_ltoa(tmp, num);
  1052. _dl_write(fd, string, _dl_strlen(string));
  1053. break;
  1054. }
  1055. case 'x':
  1056. case 'X':
  1057. {
  1058. char tmp[13];
  1059. num = va_arg(args, int);
  1060. string = _dl_simple_ltoahex(tmp, num);
  1061. _dl_write(fd, string, _dl_strlen(string));
  1062. break;
  1063. }
  1064. default:
  1065. _dl_write(fd, "(null)", 6);
  1066. break;
  1067. }
  1068. start = ptr;
  1069. }
  1070. else
  1071. {
  1072. _dl_write(fd, start, _dl_strlen(start));
  1073. start = NULL;
  1074. }
  1075. }
  1076. return;
  1077. }