dynlink.c 55 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066
  1. #define _GNU_SOURCE
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4. #include <stdarg.h>
  5. #include <stddef.h>
  6. #include <string.h>
  7. #include <unistd.h>
  8. #include <stdint.h>
  9. #include <elf.h>
  10. #include <sys/mman.h>
  11. #include <limits.h>
  12. #include <fcntl.h>
  13. #include <sys/stat.h>
  14. #include <errno.h>
  15. #include <link.h>
  16. #include <setjmp.h>
  17. #include <pthread.h>
  18. #include <ctype.h>
  19. #include <dlfcn.h>
  20. #include "pthread_impl.h"
  21. #include "libc.h"
  22. #include "dynlink.h"
  23. #include "malloc_impl.h"
  24. static void error(const char *, ...);
  25. #define MAXP2(a,b) (-(-(a)&-(b)))
  26. #define ALIGN(x,y) ((x)+(y)-1 & -(y))
  27. struct debug {
  28. int ver;
  29. void *head;
  30. void (*bp)(void);
  31. int state;
  32. void *base;
  33. };
  34. struct td_index {
  35. size_t args[2];
  36. struct td_index *next;
  37. };
  38. struct dso {
  39. #if DL_FDPIC
  40. struct fdpic_loadmap *loadmap;
  41. #else
  42. unsigned char *base;
  43. #endif
  44. char *name;
  45. size_t *dynv;
  46. struct dso *next, *prev;
  47. Phdr *phdr;
  48. int phnum;
  49. size_t phentsize;
  50. Sym *syms;
  51. Elf_Symndx *hashtab;
  52. uint32_t *ghashtab;
  53. int16_t *versym;
  54. char *strings;
  55. struct dso *syms_next, *lazy_next;
  56. size_t *lazy, lazy_cnt;
  57. unsigned char *map;
  58. size_t map_len;
  59. dev_t dev;
  60. ino_t ino;
  61. char relocated;
  62. char constructed;
  63. char kernel_mapped;
  64. struct dso **deps, *needed_by;
  65. char *rpath_orig, *rpath;
  66. struct tls_module tls;
  67. size_t tls_id;
  68. size_t relro_start, relro_end;
  69. void **new_dtv;
  70. unsigned char *new_tls;
  71. volatile int new_dtv_idx, new_tls_idx;
  72. struct td_index *td_index;
  73. struct dso *fini_next;
  74. char *shortname;
  75. #if DL_FDPIC
  76. unsigned char *base;
  77. #else
  78. struct fdpic_loadmap *loadmap;
  79. #endif
  80. struct funcdesc {
  81. void *addr;
  82. size_t *got;
  83. } *funcdescs;
  84. size_t *got;
  85. char buf[];
  86. };
  87. struct symdef {
  88. Sym *sym;
  89. struct dso *dso;
  90. };
  91. void __init_libc(char **, char *);
  92. static struct builtin_tls {
  93. char c;
  94. struct pthread pt;
  95. void *space[16];
  96. } builtin_tls[1];
  97. #define MIN_TLS_ALIGN offsetof(struct builtin_tls, pt)
  98. #define ADDEND_LIMIT 4096
  99. static size_t *saved_addends, *apply_addends_to;
  100. static struct dso ldso;
  101. static struct dso *head, *tail, *fini_head, *syms_tail, *lazy_head;
  102. static char *env_path, *sys_path;
  103. static unsigned long long gencnt;
  104. static int runtime;
  105. static int ldd_mode;
  106. static int ldso_fail;
  107. static int noload;
  108. static jmp_buf *rtld_fail;
  109. static pthread_rwlock_t lock;
  110. static struct debug debug;
  111. static struct tls_module *tls_tail;
  112. static size_t tls_cnt, tls_offset, tls_align = MIN_TLS_ALIGN;
  113. static size_t static_tls_cnt;
  114. static pthread_mutex_t init_fini_lock = { ._m_type = PTHREAD_MUTEX_RECURSIVE };
  115. static struct fdpic_loadmap *app_loadmap;
  116. static struct fdpic_dummy_loadmap app_dummy_loadmap;
  117. static struct dso *const nodeps_dummy;
  118. struct debug *_dl_debug_addr = &debug;
  119. extern hidden int __malloc_replaced;
  120. hidden void (*const __init_array_start)(void)=0, (*const __fini_array_start)(void)=0;
  121. extern hidden void (*const __init_array_end)(void), (*const __fini_array_end)(void);
  122. weak_alias(__init_array_start, __init_array_end);
  123. weak_alias(__fini_array_start, __fini_array_end);
  124. static int dl_strcmp(const char *l, const char *r)
  125. {
  126. for (; *l==*r && *l; l++, r++);
  127. return *(unsigned char *)l - *(unsigned char *)r;
  128. }
  129. #define strcmp(l,r) dl_strcmp(l,r)
  130. /* Compute load address for a virtual address in a given dso. */
  131. #if DL_FDPIC
  132. static void *laddr(const struct dso *p, size_t v)
  133. {
  134. size_t j=0;
  135. if (!p->loadmap) return p->base + v;
  136. for (j=0; v-p->loadmap->segs[j].p_vaddr >= p->loadmap->segs[j].p_memsz; j++);
  137. return (void *)(v - p->loadmap->segs[j].p_vaddr + p->loadmap->segs[j].addr);
  138. }
  139. static void *laddr_pg(const struct dso *p, size_t v)
  140. {
  141. size_t j=0;
  142. size_t pgsz = PAGE_SIZE;
  143. if (!p->loadmap) return p->base + v;
  144. for (j=0; ; j++) {
  145. size_t a = p->loadmap->segs[j].p_vaddr;
  146. size_t b = a + p->loadmap->segs[j].p_memsz;
  147. a &= -pgsz;
  148. b += pgsz-1;
  149. b &= -pgsz;
  150. if (v-a<b-a) break;
  151. }
  152. return (void *)(v - p->loadmap->segs[j].p_vaddr + p->loadmap->segs[j].addr);
  153. }
  154. #define fpaddr(p, v) ((void (*)())&(struct funcdesc){ \
  155. laddr(p, v), (p)->got })
  156. #else
  157. #define laddr(p, v) (void *)((p)->base + (v))
  158. #define laddr_pg(p, v) laddr(p, v)
  159. #define fpaddr(p, v) ((void (*)())laddr(p, v))
  160. #endif
  161. static void decode_vec(size_t *v, size_t *a, size_t cnt)
  162. {
  163. size_t i;
  164. for (i=0; i<cnt; i++) a[i] = 0;
  165. for (; v[0]; v+=2) if (v[0]-1<cnt-1) {
  166. a[0] |= 1UL<<v[0];
  167. a[v[0]] = v[1];
  168. }
  169. }
  170. static int search_vec(size_t *v, size_t *r, size_t key)
  171. {
  172. for (; v[0]!=key; v+=2)
  173. if (!v[0]) return 0;
  174. *r = v[1];
  175. return 1;
  176. }
  177. static uint32_t sysv_hash(const char *s0)
  178. {
  179. const unsigned char *s = (void *)s0;
  180. uint_fast32_t h = 0;
  181. while (*s) {
  182. h = 16*h + *s++;
  183. h ^= h>>24 & 0xf0;
  184. }
  185. return h & 0xfffffff;
  186. }
  187. static uint32_t gnu_hash(const char *s0)
  188. {
  189. const unsigned char *s = (void *)s0;
  190. uint_fast32_t h = 5381;
  191. for (; *s; s++)
  192. h += h*32 + *s;
  193. return h;
  194. }
  195. static Sym *sysv_lookup(const char *s, uint32_t h, struct dso *dso)
  196. {
  197. size_t i;
  198. Sym *syms = dso->syms;
  199. Elf_Symndx *hashtab = dso->hashtab;
  200. char *strings = dso->strings;
  201. for (i=hashtab[2+h%hashtab[0]]; i; i=hashtab[2+hashtab[0]+i]) {
  202. if ((!dso->versym || dso->versym[i] >= 0)
  203. && (!strcmp(s, strings+syms[i].st_name)))
  204. return syms+i;
  205. }
  206. return 0;
  207. }
  208. static Sym *gnu_lookup(uint32_t h1, uint32_t *hashtab, struct dso *dso, const char *s)
  209. {
  210. uint32_t nbuckets = hashtab[0];
  211. uint32_t *buckets = hashtab + 4 + hashtab[2]*(sizeof(size_t)/4);
  212. uint32_t i = buckets[h1 % nbuckets];
  213. if (!i) return 0;
  214. uint32_t *hashval = buckets + nbuckets + (i - hashtab[1]);
  215. for (h1 |= 1; ; i++) {
  216. uint32_t h2 = *hashval++;
  217. if ((h1 == (h2|1)) && (!dso->versym || dso->versym[i] >= 0)
  218. && !strcmp(s, dso->strings + dso->syms[i].st_name))
  219. return dso->syms+i;
  220. if (h2 & 1) break;
  221. }
  222. return 0;
  223. }
  224. static Sym *gnu_lookup_filtered(uint32_t h1, uint32_t *hashtab, struct dso *dso, const char *s, uint32_t fofs, size_t fmask)
  225. {
  226. const size_t *bloomwords = (const void *)(hashtab+4);
  227. size_t f = bloomwords[fofs & (hashtab[2]-1)];
  228. if (!(f & fmask)) return 0;
  229. f >>= (h1 >> hashtab[3]) % (8 * sizeof f);
  230. if (!(f & 1)) return 0;
  231. return gnu_lookup(h1, hashtab, dso, s);
  232. }
  233. #define OK_TYPES (1<<STT_NOTYPE | 1<<STT_OBJECT | 1<<STT_FUNC | 1<<STT_COMMON | 1<<STT_TLS)
  234. #define OK_BINDS (1<<STB_GLOBAL | 1<<STB_WEAK | 1<<STB_GNU_UNIQUE)
  235. #ifndef ARCH_SYM_REJECT_UND
  236. #define ARCH_SYM_REJECT_UND(s) 0
  237. #endif
  238. static struct symdef find_sym(struct dso *dso, const char *s, int need_def)
  239. {
  240. uint32_t h = 0, gh = gnu_hash(s), gho = gh / (8*sizeof(size_t)), *ght;
  241. size_t ghm = 1ul << gh % (8*sizeof(size_t));
  242. struct symdef def = {0};
  243. for (; dso; dso=dso->syms_next) {
  244. Sym *sym;
  245. if ((ght = dso->ghashtab)) {
  246. sym = gnu_lookup_filtered(gh, ght, dso, s, gho, ghm);
  247. } else {
  248. if (!h) h = sysv_hash(s);
  249. sym = sysv_lookup(s, h, dso);
  250. }
  251. if (!sym) continue;
  252. if (!sym->st_shndx)
  253. if (need_def || (sym->st_info&0xf) == STT_TLS
  254. || ARCH_SYM_REJECT_UND(sym))
  255. continue;
  256. if (!sym->st_value)
  257. if ((sym->st_info&0xf) != STT_TLS)
  258. continue;
  259. if (!(1<<(sym->st_info&0xf) & OK_TYPES)) continue;
  260. if (!(1<<(sym->st_info>>4) & OK_BINDS)) continue;
  261. def.sym = sym;
  262. def.dso = dso;
  263. break;
  264. }
  265. return def;
  266. }
  267. hidden ptrdiff_t __tlsdesc_static(), __tlsdesc_dynamic();
  268. static void do_relocs(struct dso *dso, size_t *rel, size_t rel_size, size_t stride)
  269. {
  270. unsigned char *base = dso->base;
  271. Sym *syms = dso->syms;
  272. char *strings = dso->strings;
  273. Sym *sym;
  274. const char *name;
  275. void *ctx;
  276. int type;
  277. int sym_index;
  278. struct symdef def;
  279. size_t *reloc_addr;
  280. size_t sym_val;
  281. size_t tls_val;
  282. size_t addend;
  283. int skip_relative = 0, reuse_addends = 0, save_slot = 0;
  284. if (dso == &ldso) {
  285. /* Only ldso's REL table needs addend saving/reuse. */
  286. if (rel == apply_addends_to)
  287. reuse_addends = 1;
  288. skip_relative = 1;
  289. }
  290. for (; rel_size; rel+=stride, rel_size-=stride*sizeof(size_t)) {
  291. if (skip_relative && IS_RELATIVE(rel[1], dso->syms)) continue;
  292. type = R_TYPE(rel[1]);
  293. if (type == REL_NONE) continue;
  294. reloc_addr = laddr(dso, rel[0]);
  295. if (stride > 2) {
  296. addend = rel[2];
  297. } else if (type==REL_GOT || type==REL_PLT|| type==REL_COPY) {
  298. addend = 0;
  299. } else if (reuse_addends) {
  300. /* Save original addend in stage 2 where the dso
  301. * chain consists of just ldso; otherwise read back
  302. * saved addend since the inline one was clobbered. */
  303. if (head==&ldso)
  304. saved_addends[save_slot] = *reloc_addr;
  305. addend = saved_addends[save_slot++];
  306. } else {
  307. addend = *reloc_addr;
  308. }
  309. sym_index = R_SYM(rel[1]);
  310. if (sym_index) {
  311. sym = syms + sym_index;
  312. name = strings + sym->st_name;
  313. ctx = type==REL_COPY ? head->syms_next : head;
  314. def = (sym->st_info&0xf) == STT_SECTION
  315. ? (struct symdef){ .dso = dso, .sym = sym }
  316. : find_sym(ctx, name, type==REL_PLT);
  317. if (!def.sym && (sym->st_shndx != SHN_UNDEF
  318. || sym->st_info>>4 != STB_WEAK)) {
  319. if (dso->lazy && (type==REL_PLT || type==REL_GOT)) {
  320. dso->lazy[3*dso->lazy_cnt+0] = rel[0];
  321. dso->lazy[3*dso->lazy_cnt+1] = rel[1];
  322. dso->lazy[3*dso->lazy_cnt+2] = addend;
  323. dso->lazy_cnt++;
  324. continue;
  325. }
  326. error("Error relocating %s: %s: symbol not found",
  327. dso->name, name);
  328. if (runtime) longjmp(*rtld_fail, 1);
  329. continue;
  330. }
  331. } else {
  332. sym = 0;
  333. def.sym = 0;
  334. def.dso = dso;
  335. }
  336. sym_val = def.sym ? (size_t)laddr(def.dso, def.sym->st_value) : 0;
  337. tls_val = def.sym ? def.sym->st_value : 0;
  338. if ((type == REL_TPOFF || type == REL_TPOFF_NEG)
  339. && runtime && def.dso->tls_id > static_tls_cnt) {
  340. error("Error relocating %s: %s: initial-exec TLS "
  341. "resolves to dynamic definition in %s",
  342. dso->name, name, def.dso->name);
  343. longjmp(*rtld_fail, 1);
  344. }
  345. switch(type) {
  346. case REL_NONE:
  347. break;
  348. case REL_OFFSET:
  349. addend -= (size_t)reloc_addr;
  350. case REL_SYMBOLIC:
  351. case REL_GOT:
  352. case REL_PLT:
  353. *reloc_addr = sym_val + addend;
  354. break;
  355. case REL_RELATIVE:
  356. *reloc_addr = (size_t)base + addend;
  357. break;
  358. case REL_SYM_OR_REL:
  359. if (sym) *reloc_addr = sym_val + addend;
  360. else *reloc_addr = (size_t)base + addend;
  361. break;
  362. case REL_COPY:
  363. memcpy(reloc_addr, (void *)sym_val, sym->st_size);
  364. break;
  365. case REL_OFFSET32:
  366. *(uint32_t *)reloc_addr = sym_val + addend
  367. - (size_t)reloc_addr;
  368. break;
  369. case REL_FUNCDESC:
  370. *reloc_addr = def.sym ? (size_t)(def.dso->funcdescs
  371. + (def.sym - def.dso->syms)) : 0;
  372. break;
  373. case REL_FUNCDESC_VAL:
  374. if ((sym->st_info&0xf) == STT_SECTION) *reloc_addr += sym_val;
  375. else *reloc_addr = sym_val;
  376. reloc_addr[1] = def.sym ? (size_t)def.dso->got : 0;
  377. break;
  378. case REL_DTPMOD:
  379. *reloc_addr = def.dso->tls_id;
  380. break;
  381. case REL_DTPOFF:
  382. *reloc_addr = tls_val + addend - DTP_OFFSET;
  383. break;
  384. #ifdef TLS_ABOVE_TP
  385. case REL_TPOFF:
  386. *reloc_addr = tls_val + def.dso->tls.offset + TPOFF_K + addend;
  387. break;
  388. #else
  389. case REL_TPOFF:
  390. *reloc_addr = tls_val - def.dso->tls.offset + addend;
  391. break;
  392. case REL_TPOFF_NEG:
  393. *reloc_addr = def.dso->tls.offset - tls_val + addend;
  394. break;
  395. #endif
  396. case REL_TLSDESC:
  397. if (stride<3) addend = reloc_addr[1];
  398. if (runtime && def.dso->tls_id > static_tls_cnt) {
  399. struct td_index *new = malloc(sizeof *new);
  400. if (!new) {
  401. error(
  402. "Error relocating %s: cannot allocate TLSDESC for %s",
  403. dso->name, sym ? name : "(local)" );
  404. longjmp(*rtld_fail, 1);
  405. }
  406. new->next = dso->td_index;
  407. dso->td_index = new;
  408. new->args[0] = def.dso->tls_id;
  409. new->args[1] = tls_val + addend;
  410. reloc_addr[0] = (size_t)__tlsdesc_dynamic;
  411. reloc_addr[1] = (size_t)new;
  412. } else {
  413. reloc_addr[0] = (size_t)__tlsdesc_static;
  414. #ifdef TLS_ABOVE_TP
  415. reloc_addr[1] = tls_val + def.dso->tls.offset
  416. + TPOFF_K + addend;
  417. #else
  418. reloc_addr[1] = tls_val - def.dso->tls.offset
  419. + addend;
  420. #endif
  421. }
  422. break;
  423. default:
  424. error("Error relocating %s: unsupported relocation type %d",
  425. dso->name, type);
  426. if (runtime) longjmp(*rtld_fail, 1);
  427. continue;
  428. }
  429. }
  430. }
  431. static void redo_lazy_relocs()
  432. {
  433. struct dso *p = lazy_head, *next;
  434. lazy_head = 0;
  435. for (; p; p=next) {
  436. next = p->lazy_next;
  437. size_t size = p->lazy_cnt*3*sizeof(size_t);
  438. p->lazy_cnt = 0;
  439. do_relocs(p, p->lazy, size, 3);
  440. if (p->lazy_cnt) {
  441. p->lazy_next = lazy_head;
  442. lazy_head = p;
  443. } else {
  444. free(p->lazy);
  445. p->lazy = 0;
  446. p->lazy_next = 0;
  447. }
  448. }
  449. }
  450. /* A huge hack: to make up for the wastefulness of shared libraries
  451. * needing at least a page of dirty memory even if they have no global
  452. * data, we reclaim the gaps at the beginning and end of writable maps
  453. * and "donate" them to the heap. */
  454. static void reclaim(struct dso *dso, size_t start, size_t end)
  455. {
  456. if (start >= dso->relro_start && start < dso->relro_end) start = dso->relro_end;
  457. if (end >= dso->relro_start && end < dso->relro_end) end = dso->relro_start;
  458. if (start >= end) return;
  459. char *base = laddr_pg(dso, start);
  460. __malloc_donate(base, base+(end-start));
  461. }
  462. static void reclaim_gaps(struct dso *dso)
  463. {
  464. Phdr *ph = dso->phdr;
  465. size_t phcnt = dso->phnum;
  466. for (; phcnt--; ph=(void *)((char *)ph+dso->phentsize)) {
  467. if (ph->p_type!=PT_LOAD) continue;
  468. if ((ph->p_flags&(PF_R|PF_W))!=(PF_R|PF_W)) continue;
  469. reclaim(dso, ph->p_vaddr & -PAGE_SIZE, ph->p_vaddr);
  470. reclaim(dso, ph->p_vaddr+ph->p_memsz,
  471. ph->p_vaddr+ph->p_memsz+PAGE_SIZE-1 & -PAGE_SIZE);
  472. }
  473. }
  474. static void *mmap_fixed(void *p, size_t n, int prot, int flags, int fd, off_t off)
  475. {
  476. static int no_map_fixed;
  477. char *q;
  478. if (!no_map_fixed) {
  479. q = mmap(p, n, prot, flags|MAP_FIXED, fd, off);
  480. if (!DL_NOMMU_SUPPORT || q != MAP_FAILED || errno != EINVAL)
  481. return q;
  482. no_map_fixed = 1;
  483. }
  484. /* Fallbacks for MAP_FIXED failure on NOMMU kernels. */
  485. if (flags & MAP_ANONYMOUS) {
  486. memset(p, 0, n);
  487. return p;
  488. }
  489. ssize_t r;
  490. if (lseek(fd, off, SEEK_SET) < 0) return MAP_FAILED;
  491. for (q=p; n; q+=r, off+=r, n-=r) {
  492. r = read(fd, q, n);
  493. if (r < 0 && errno != EINTR) return MAP_FAILED;
  494. if (!r) {
  495. memset(q, 0, n);
  496. break;
  497. }
  498. }
  499. return p;
  500. }
  501. static void unmap_library(struct dso *dso)
  502. {
  503. if (dso->loadmap) {
  504. size_t i;
  505. for (i=0; i<dso->loadmap->nsegs; i++) {
  506. if (!dso->loadmap->segs[i].p_memsz)
  507. continue;
  508. munmap((void *)dso->loadmap->segs[i].addr,
  509. dso->loadmap->segs[i].p_memsz);
  510. }
  511. free(dso->loadmap);
  512. } else if (dso->map && dso->map_len) {
  513. munmap(dso->map, dso->map_len);
  514. }
  515. }
  516. static void *map_library(int fd, struct dso *dso)
  517. {
  518. Ehdr buf[(896+sizeof(Ehdr))/sizeof(Ehdr)];
  519. void *allocated_buf=0;
  520. size_t phsize;
  521. size_t addr_min=SIZE_MAX, addr_max=0, map_len;
  522. size_t this_min, this_max;
  523. size_t nsegs = 0;
  524. off_t off_start;
  525. Ehdr *eh;
  526. Phdr *ph, *ph0;
  527. unsigned prot;
  528. unsigned char *map=MAP_FAILED, *base;
  529. size_t dyn=0;
  530. size_t tls_image=0;
  531. size_t i;
  532. ssize_t l = read(fd, buf, sizeof buf);
  533. eh = buf;
  534. if (l<0) return 0;
  535. if (l<sizeof *eh || (eh->e_type != ET_DYN && eh->e_type != ET_EXEC))
  536. goto noexec;
  537. phsize = eh->e_phentsize * eh->e_phnum;
  538. if (phsize > sizeof buf - sizeof *eh) {
  539. allocated_buf = malloc(phsize);
  540. if (!allocated_buf) return 0;
  541. l = pread(fd, allocated_buf, phsize, eh->e_phoff);
  542. if (l < 0) goto error;
  543. if (l != phsize) goto noexec;
  544. ph = ph0 = allocated_buf;
  545. } else if (eh->e_phoff + phsize > l) {
  546. l = pread(fd, buf+1, phsize, eh->e_phoff);
  547. if (l < 0) goto error;
  548. if (l != phsize) goto noexec;
  549. ph = ph0 = (void *)(buf + 1);
  550. } else {
  551. ph = ph0 = (void *)((char *)buf + eh->e_phoff);
  552. }
  553. for (i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
  554. if (ph->p_type == PT_DYNAMIC) {
  555. dyn = ph->p_vaddr;
  556. } else if (ph->p_type == PT_TLS) {
  557. tls_image = ph->p_vaddr;
  558. dso->tls.align = ph->p_align;
  559. dso->tls.len = ph->p_filesz;
  560. dso->tls.size = ph->p_memsz;
  561. } else if (ph->p_type == PT_GNU_RELRO) {
  562. dso->relro_start = ph->p_vaddr & -PAGE_SIZE;
  563. dso->relro_end = (ph->p_vaddr + ph->p_memsz) & -PAGE_SIZE;
  564. }
  565. if (ph->p_type != PT_LOAD) continue;
  566. nsegs++;
  567. if (ph->p_vaddr < addr_min) {
  568. addr_min = ph->p_vaddr;
  569. off_start = ph->p_offset;
  570. prot = (((ph->p_flags&PF_R) ? PROT_READ : 0) |
  571. ((ph->p_flags&PF_W) ? PROT_WRITE: 0) |
  572. ((ph->p_flags&PF_X) ? PROT_EXEC : 0));
  573. }
  574. if (ph->p_vaddr+ph->p_memsz > addr_max) {
  575. addr_max = ph->p_vaddr+ph->p_memsz;
  576. }
  577. }
  578. if (!dyn) goto noexec;
  579. if (DL_FDPIC && !(eh->e_flags & FDPIC_CONSTDISP_FLAG)) {
  580. dso->loadmap = calloc(1, sizeof *dso->loadmap
  581. + nsegs * sizeof *dso->loadmap->segs);
  582. if (!dso->loadmap) goto error;
  583. dso->loadmap->nsegs = nsegs;
  584. for (ph=ph0, i=0; i<nsegs; ph=(void *)((char *)ph+eh->e_phentsize)) {
  585. if (ph->p_type != PT_LOAD) continue;
  586. prot = (((ph->p_flags&PF_R) ? PROT_READ : 0) |
  587. ((ph->p_flags&PF_W) ? PROT_WRITE: 0) |
  588. ((ph->p_flags&PF_X) ? PROT_EXEC : 0));
  589. map = mmap(0, ph->p_memsz + (ph->p_vaddr & PAGE_SIZE-1),
  590. prot, MAP_PRIVATE,
  591. fd, ph->p_offset & -PAGE_SIZE);
  592. if (map == MAP_FAILED) {
  593. unmap_library(dso);
  594. goto error;
  595. }
  596. dso->loadmap->segs[i].addr = (size_t)map +
  597. (ph->p_vaddr & PAGE_SIZE-1);
  598. dso->loadmap->segs[i].p_vaddr = ph->p_vaddr;
  599. dso->loadmap->segs[i].p_memsz = ph->p_memsz;
  600. i++;
  601. if (prot & PROT_WRITE) {
  602. size_t brk = (ph->p_vaddr & PAGE_SIZE-1)
  603. + ph->p_filesz;
  604. size_t pgbrk = brk + PAGE_SIZE-1 & -PAGE_SIZE;
  605. size_t pgend = brk + ph->p_memsz - ph->p_filesz
  606. + PAGE_SIZE-1 & -PAGE_SIZE;
  607. if (pgend > pgbrk && mmap_fixed(map+pgbrk,
  608. pgend-pgbrk, prot,
  609. MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS,
  610. -1, off_start) == MAP_FAILED)
  611. goto error;
  612. memset(map + brk, 0, pgbrk-brk);
  613. }
  614. }
  615. map = (void *)dso->loadmap->segs[0].addr;
  616. map_len = 0;
  617. goto done_mapping;
  618. }
  619. addr_max += PAGE_SIZE-1;
  620. addr_max &= -PAGE_SIZE;
  621. addr_min &= -PAGE_SIZE;
  622. off_start &= -PAGE_SIZE;
  623. map_len = addr_max - addr_min + off_start;
  624. /* The first time, we map too much, possibly even more than
  625. * the length of the file. This is okay because we will not
  626. * use the invalid part; we just need to reserve the right
  627. * amount of virtual address space to map over later. */
  628. map = DL_NOMMU_SUPPORT
  629. ? mmap((void *)addr_min, map_len, PROT_READ|PROT_WRITE|PROT_EXEC,
  630. MAP_PRIVATE|MAP_ANONYMOUS, -1, 0)
  631. : mmap((void *)addr_min, map_len, prot,
  632. MAP_PRIVATE, fd, off_start);
  633. if (map==MAP_FAILED) goto error;
  634. dso->map = map;
  635. dso->map_len = map_len;
  636. /* If the loaded file is not relocatable and the requested address is
  637. * not available, then the load operation must fail. */
  638. if (eh->e_type != ET_DYN && addr_min && map!=(void *)addr_min) {
  639. errno = EBUSY;
  640. goto error;
  641. }
  642. base = map - addr_min;
  643. dso->phdr = 0;
  644. dso->phnum = 0;
  645. for (ph=ph0, i=eh->e_phnum; i; i--, ph=(void *)((char *)ph+eh->e_phentsize)) {
  646. if (ph->p_type != PT_LOAD) continue;
  647. /* Check if the programs headers are in this load segment, and
  648. * if so, record the address for use by dl_iterate_phdr. */
  649. if (!dso->phdr && eh->e_phoff >= ph->p_offset
  650. && eh->e_phoff+phsize <= ph->p_offset+ph->p_filesz) {
  651. dso->phdr = (void *)(base + ph->p_vaddr
  652. + (eh->e_phoff-ph->p_offset));
  653. dso->phnum = eh->e_phnum;
  654. dso->phentsize = eh->e_phentsize;
  655. }
  656. this_min = ph->p_vaddr & -PAGE_SIZE;
  657. this_max = ph->p_vaddr+ph->p_memsz+PAGE_SIZE-1 & -PAGE_SIZE;
  658. off_start = ph->p_offset & -PAGE_SIZE;
  659. prot = (((ph->p_flags&PF_R) ? PROT_READ : 0) |
  660. ((ph->p_flags&PF_W) ? PROT_WRITE: 0) |
  661. ((ph->p_flags&PF_X) ? PROT_EXEC : 0));
  662. /* Reuse the existing mapping for the lowest-address LOAD */
  663. if ((ph->p_vaddr & -PAGE_SIZE) != addr_min || DL_NOMMU_SUPPORT)
  664. if (mmap_fixed(base+this_min, this_max-this_min, prot, MAP_PRIVATE|MAP_FIXED, fd, off_start) == MAP_FAILED)
  665. goto error;
  666. if (ph->p_memsz > ph->p_filesz && (ph->p_flags&PF_W)) {
  667. size_t brk = (size_t)base+ph->p_vaddr+ph->p_filesz;
  668. size_t pgbrk = brk+PAGE_SIZE-1 & -PAGE_SIZE;
  669. memset((void *)brk, 0, pgbrk-brk & PAGE_SIZE-1);
  670. if (pgbrk-(size_t)base < this_max && mmap_fixed((void *)pgbrk, (size_t)base+this_max-pgbrk, prot, MAP_PRIVATE|MAP_FIXED|MAP_ANONYMOUS, -1, 0) == MAP_FAILED)
  671. goto error;
  672. }
  673. }
  674. for (i=0; ((size_t *)(base+dyn))[i]; i+=2)
  675. if (((size_t *)(base+dyn))[i]==DT_TEXTREL) {
  676. if (mprotect(map, map_len, PROT_READ|PROT_WRITE|PROT_EXEC)
  677. && errno != ENOSYS)
  678. goto error;
  679. break;
  680. }
  681. done_mapping:
  682. dso->base = base;
  683. dso->dynv = laddr(dso, dyn);
  684. if (dso->tls.size) dso->tls.image = laddr(dso, tls_image);
  685. free(allocated_buf);
  686. return map;
  687. noexec:
  688. errno = ENOEXEC;
  689. error:
  690. if (map!=MAP_FAILED) unmap_library(dso);
  691. free(allocated_buf);
  692. return 0;
  693. }
  694. static int path_open(const char *name, const char *s, char *buf, size_t buf_size)
  695. {
  696. size_t l;
  697. int fd;
  698. for (;;) {
  699. s += strspn(s, ":\n");
  700. l = strcspn(s, ":\n");
  701. if (l-1 >= INT_MAX) return -1;
  702. if (snprintf(buf, buf_size, "%.*s/%s", (int)l, s, name) < buf_size) {
  703. if ((fd = open(buf, O_RDONLY|O_CLOEXEC))>=0) return fd;
  704. switch (errno) {
  705. case ENOENT:
  706. case ENOTDIR:
  707. case EACCES:
  708. case ENAMETOOLONG:
  709. break;
  710. default:
  711. /* Any negative value but -1 will inhibit
  712. * futher path search. */
  713. return -2;
  714. }
  715. }
  716. s += l;
  717. }
  718. }
  719. static int fixup_rpath(struct dso *p, char *buf, size_t buf_size)
  720. {
  721. size_t n, l;
  722. const char *s, *t, *origin;
  723. char *d;
  724. if (p->rpath || !p->rpath_orig) return 0;
  725. if (!strchr(p->rpath_orig, '$')) {
  726. p->rpath = p->rpath_orig;
  727. return 0;
  728. }
  729. n = 0;
  730. s = p->rpath_orig;
  731. while ((t=strchr(s, '$'))) {
  732. if (strncmp(t, "$ORIGIN", 7) && strncmp(t, "${ORIGIN}", 9))
  733. return 0;
  734. s = t+1;
  735. n++;
  736. }
  737. if (n > SSIZE_MAX/PATH_MAX) return 0;
  738. if (p->kernel_mapped) {
  739. /* $ORIGIN searches cannot be performed for the main program
  740. * when it is suid/sgid/AT_SECURE. This is because the
  741. * pathname is under the control of the caller of execve.
  742. * For libraries, however, $ORIGIN can be processed safely
  743. * since the library's pathname came from a trusted source
  744. * (either system paths or a call to dlopen). */
  745. if (libc.secure)
  746. return 0;
  747. l = readlink("/proc/self/exe", buf, buf_size);
  748. if (l == -1) switch (errno) {
  749. case ENOENT:
  750. case ENOTDIR:
  751. case EACCES:
  752. break;
  753. default:
  754. return -1;
  755. }
  756. if (l >= buf_size)
  757. return 0;
  758. buf[l] = 0;
  759. origin = buf;
  760. } else {
  761. origin = p->name;
  762. }
  763. t = strrchr(origin, '/');
  764. if (t) {
  765. l = t-origin;
  766. } else {
  767. /* Normally p->name will always be an absolute or relative
  768. * pathname containing at least one '/' character, but in the
  769. * case where ldso was invoked as a command to execute a
  770. * program in the working directory, app.name may not. Fix. */
  771. origin = ".";
  772. l = 1;
  773. }
  774. /* Disallow non-absolute origins for suid/sgid/AT_SECURE. */
  775. if (libc.secure && *origin != '/')
  776. return 0;
  777. p->rpath = malloc(strlen(p->rpath_orig) + n*l + 1);
  778. if (!p->rpath) return -1;
  779. d = p->rpath;
  780. s = p->rpath_orig;
  781. while ((t=strchr(s, '$'))) {
  782. memcpy(d, s, t-s);
  783. d += t-s;
  784. memcpy(d, origin, l);
  785. d += l;
  786. /* It was determined previously that the '$' is followed
  787. * either by "ORIGIN" or "{ORIGIN}". */
  788. s = t + 7 + 2*(t[1]=='{');
  789. }
  790. strcpy(d, s);
  791. return 0;
  792. }
  793. static void decode_dyn(struct dso *p)
  794. {
  795. size_t dyn[DYN_CNT];
  796. decode_vec(p->dynv, dyn, DYN_CNT);
  797. p->syms = laddr(p, dyn[DT_SYMTAB]);
  798. p->strings = laddr(p, dyn[DT_STRTAB]);
  799. if (dyn[0]&(1<<DT_HASH))
  800. p->hashtab = laddr(p, dyn[DT_HASH]);
  801. if (dyn[0]&(1<<DT_RPATH))
  802. p->rpath_orig = p->strings + dyn[DT_RPATH];
  803. if (dyn[0]&(1<<DT_RUNPATH))
  804. p->rpath_orig = p->strings + dyn[DT_RUNPATH];
  805. if (dyn[0]&(1<<DT_PLTGOT))
  806. p->got = laddr(p, dyn[DT_PLTGOT]);
  807. if (search_vec(p->dynv, dyn, DT_GNU_HASH))
  808. p->ghashtab = laddr(p, *dyn);
  809. if (search_vec(p->dynv, dyn, DT_VERSYM))
  810. p->versym = laddr(p, *dyn);
  811. }
  812. static size_t count_syms(struct dso *p)
  813. {
  814. if (p->hashtab) return p->hashtab[1];
  815. size_t nsym, i;
  816. uint32_t *buckets = p->ghashtab + 4 + (p->ghashtab[2]*sizeof(size_t)/4);
  817. uint32_t *hashval;
  818. for (i = nsym = 0; i < p->ghashtab[0]; i++) {
  819. if (buckets[i] > nsym)
  820. nsym = buckets[i];
  821. }
  822. if (nsym) {
  823. hashval = buckets + p->ghashtab[0] + (nsym - p->ghashtab[1]);
  824. do nsym++;
  825. while (!(*hashval++ & 1));
  826. }
  827. return nsym;
  828. }
  829. static void *dl_mmap(size_t n)
  830. {
  831. void *p;
  832. int prot = PROT_READ|PROT_WRITE, flags = MAP_ANONYMOUS|MAP_PRIVATE;
  833. #ifdef SYS_mmap2
  834. p = (void *)__syscall(SYS_mmap2, 0, n, prot, flags, -1, 0);
  835. #else
  836. p = (void *)__syscall(SYS_mmap, 0, n, prot, flags, -1, 0);
  837. #endif
  838. return p == MAP_FAILED ? 0 : p;
  839. }
  840. static void makefuncdescs(struct dso *p)
  841. {
  842. static int self_done;
  843. size_t nsym = count_syms(p);
  844. size_t i, size = nsym * sizeof(*p->funcdescs);
  845. if (!self_done) {
  846. p->funcdescs = dl_mmap(size);
  847. self_done = 1;
  848. } else {
  849. p->funcdescs = malloc(size);
  850. }
  851. if (!p->funcdescs) {
  852. if (!runtime) a_crash();
  853. error("Error allocating function descriptors for %s", p->name);
  854. longjmp(*rtld_fail, 1);
  855. }
  856. for (i=0; i<nsym; i++) {
  857. if ((p->syms[i].st_info&0xf)==STT_FUNC && p->syms[i].st_shndx) {
  858. p->funcdescs[i].addr = laddr(p, p->syms[i].st_value);
  859. p->funcdescs[i].got = p->got;
  860. } else {
  861. p->funcdescs[i].addr = 0;
  862. p->funcdescs[i].got = 0;
  863. }
  864. }
  865. }
  866. static struct dso *load_library(const char *name, struct dso *needed_by)
  867. {
  868. char buf[2*NAME_MAX+2];
  869. const char *pathname;
  870. unsigned char *map;
  871. struct dso *p, temp_dso = {0};
  872. int fd;
  873. struct stat st;
  874. size_t alloc_size;
  875. int n_th = 0;
  876. int is_self = 0;
  877. if (!*name) {
  878. errno = EINVAL;
  879. return 0;
  880. }
  881. /* Catch and block attempts to reload the implementation itself */
  882. if (name[0]=='l' && name[1]=='i' && name[2]=='b') {
  883. static const char reserved[] =
  884. "c.pthread.rt.m.dl.util.xnet.";
  885. const char *rp, *next;
  886. for (rp=reserved; *rp; rp=next) {
  887. next = strchr(rp, '.') + 1;
  888. if (strncmp(name+3, rp, next-rp) == 0)
  889. break;
  890. }
  891. if (*rp) {
  892. if (ldd_mode) {
  893. /* Track which names have been resolved
  894. * and only report each one once. */
  895. static unsigned reported;
  896. unsigned mask = 1U<<(rp-reserved);
  897. if (!(reported & mask)) {
  898. reported |= mask;
  899. dprintf(1, "\t%s => %s (%p)\n",
  900. name, ldso.name,
  901. ldso.base);
  902. }
  903. }
  904. is_self = 1;
  905. }
  906. }
  907. if (!strcmp(name, ldso.name)) is_self = 1;
  908. if (is_self) {
  909. if (!ldso.prev) {
  910. tail->next = &ldso;
  911. ldso.prev = tail;
  912. tail = &ldso;
  913. }
  914. return &ldso;
  915. }
  916. if (strchr(name, '/')) {
  917. pathname = name;
  918. fd = open(name, O_RDONLY|O_CLOEXEC);
  919. } else {
  920. /* Search for the name to see if it's already loaded */
  921. for (p=head->next; p; p=p->next) {
  922. if (p->shortname && !strcmp(p->shortname, name)) {
  923. return p;
  924. }
  925. }
  926. if (strlen(name) > NAME_MAX) return 0;
  927. fd = -1;
  928. if (env_path) fd = path_open(name, env_path, buf, sizeof buf);
  929. for (p=needed_by; fd == -1 && p; p=p->needed_by) {
  930. if (fixup_rpath(p, buf, sizeof buf) < 0)
  931. fd = -2; /* Inhibit further search. */
  932. if (p->rpath)
  933. fd = path_open(name, p->rpath, buf, sizeof buf);
  934. }
  935. if (fd == -1) {
  936. if (!sys_path) {
  937. char *prefix = 0;
  938. size_t prefix_len;
  939. if (ldso.name[0]=='/') {
  940. char *s, *t, *z;
  941. for (s=t=z=ldso.name; *s; s++)
  942. if (*s=='/') z=t, t=s;
  943. prefix_len = z-ldso.name;
  944. if (prefix_len < PATH_MAX)
  945. prefix = ldso.name;
  946. }
  947. if (!prefix) {
  948. prefix = "";
  949. prefix_len = 0;
  950. }
  951. char etc_ldso_path[prefix_len + 1
  952. + sizeof "/etc/ld-musl-" LDSO_ARCH ".path"];
  953. snprintf(etc_ldso_path, sizeof etc_ldso_path,
  954. "%.*s/etc/ld-musl-" LDSO_ARCH ".path",
  955. (int)prefix_len, prefix);
  956. FILE *f = fopen(etc_ldso_path, "rbe");
  957. if (f) {
  958. if (getdelim(&sys_path, (size_t[1]){0}, 0, f) <= 0) {
  959. free(sys_path);
  960. sys_path = "";
  961. }
  962. fclose(f);
  963. } else if (errno != ENOENT) {
  964. sys_path = "";
  965. }
  966. }
  967. if (!sys_path) sys_path = "/lib:/usr/local/lib:/usr/lib";
  968. fd = path_open(name, sys_path, buf, sizeof buf);
  969. }
  970. pathname = buf;
  971. }
  972. if (fd < 0) return 0;
  973. if (fstat(fd, &st) < 0) {
  974. close(fd);
  975. return 0;
  976. }
  977. for (p=head->next; p; p=p->next) {
  978. if (p->dev == st.st_dev && p->ino == st.st_ino) {
  979. /* If this library was previously loaded with a
  980. * pathname but a search found the same inode,
  981. * setup its shortname so it can be found by name. */
  982. if (!p->shortname && pathname != name)
  983. p->shortname = strrchr(p->name, '/')+1;
  984. close(fd);
  985. return p;
  986. }
  987. }
  988. map = noload ? 0 : map_library(fd, &temp_dso);
  989. close(fd);
  990. if (!map) return 0;
  991. /* Avoid the danger of getting two versions of libc mapped into the
  992. * same process when an absolute pathname was used. The symbols
  993. * checked are chosen to catch both musl and glibc, and to avoid
  994. * false positives from interposition-hack libraries. */
  995. decode_dyn(&temp_dso);
  996. if (find_sym(&temp_dso, "__libc_start_main", 1).sym &&
  997. find_sym(&temp_dso, "stdin", 1).sym) {
  998. unmap_library(&temp_dso);
  999. return load_library("libc.so", needed_by);
  1000. }
  1001. /* Past this point, if we haven't reached runtime yet, ldso has
  1002. * committed either to use the mapped library or to abort execution.
  1003. * Unmapping is not possible, so we can safely reclaim gaps. */
  1004. if (!runtime) reclaim_gaps(&temp_dso);
  1005. /* Allocate storage for the new DSO. When there is TLS, this
  1006. * storage must include a reservation for all pre-existing
  1007. * threads to obtain copies of both the new TLS, and an
  1008. * extended DTV capable of storing an additional slot for
  1009. * the newly-loaded DSO. */
  1010. alloc_size = sizeof *p + strlen(pathname) + 1;
  1011. if (runtime && temp_dso.tls.image) {
  1012. size_t per_th = temp_dso.tls.size + temp_dso.tls.align
  1013. + sizeof(void *) * (tls_cnt+3);
  1014. n_th = libc.threads_minus_1 + 1;
  1015. if (n_th > SSIZE_MAX / per_th) alloc_size = SIZE_MAX;
  1016. else alloc_size += n_th * per_th;
  1017. }
  1018. p = calloc(1, alloc_size);
  1019. if (!p) {
  1020. unmap_library(&temp_dso);
  1021. return 0;
  1022. }
  1023. memcpy(p, &temp_dso, sizeof temp_dso);
  1024. p->dev = st.st_dev;
  1025. p->ino = st.st_ino;
  1026. p->needed_by = needed_by;
  1027. p->name = p->buf;
  1028. strcpy(p->name, pathname);
  1029. /* Add a shortname only if name arg was not an explicit pathname. */
  1030. if (pathname != name) p->shortname = strrchr(p->name, '/')+1;
  1031. if (p->tls.image) {
  1032. p->tls_id = ++tls_cnt;
  1033. tls_align = MAXP2(tls_align, p->tls.align);
  1034. #ifdef TLS_ABOVE_TP
  1035. p->tls.offset = tls_offset + ( (tls_align-1) &
  1036. -(tls_offset + (uintptr_t)p->tls.image) );
  1037. tls_offset += p->tls.size;
  1038. #else
  1039. tls_offset += p->tls.size + p->tls.align - 1;
  1040. tls_offset -= (tls_offset + (uintptr_t)p->tls.image)
  1041. & (p->tls.align-1);
  1042. p->tls.offset = tls_offset;
  1043. #endif
  1044. p->new_dtv = (void *)(-sizeof(size_t) &
  1045. (uintptr_t)(p->name+strlen(p->name)+sizeof(size_t)));
  1046. p->new_tls = (void *)(p->new_dtv + n_th*(tls_cnt+1));
  1047. if (tls_tail) tls_tail->next = &p->tls;
  1048. else libc.tls_head = &p->tls;
  1049. tls_tail = &p->tls;
  1050. }
  1051. tail->next = p;
  1052. p->prev = tail;
  1053. tail = p;
  1054. if (DL_FDPIC) makefuncdescs(p);
  1055. if (ldd_mode) dprintf(1, "\t%s => %s (%p)\n", name, pathname, p->base);
  1056. return p;
  1057. }
  1058. static void load_deps(struct dso *p)
  1059. {
  1060. size_t i, ndeps=0;
  1061. struct dso ***deps = &p->deps, **tmp, *dep;
  1062. for (; p; p=p->next) {
  1063. for (i=0; p->dynv[i]; i+=2) {
  1064. if (p->dynv[i] != DT_NEEDED) continue;
  1065. dep = load_library(p->strings + p->dynv[i+1], p);
  1066. if (!dep) {
  1067. error("Error loading shared library %s: %m (needed by %s)",
  1068. p->strings + p->dynv[i+1], p->name);
  1069. if (runtime) longjmp(*rtld_fail, 1);
  1070. continue;
  1071. }
  1072. if (runtime) {
  1073. tmp = realloc(*deps, sizeof(*tmp)*(ndeps+2));
  1074. if (!tmp) longjmp(*rtld_fail, 1);
  1075. tmp[ndeps++] = dep;
  1076. tmp[ndeps] = 0;
  1077. *deps = tmp;
  1078. }
  1079. }
  1080. }
  1081. if (!*deps) *deps = (struct dso **)&nodeps_dummy;
  1082. }
  1083. static void load_preload(char *s)
  1084. {
  1085. int tmp;
  1086. char *z;
  1087. for (z=s; *z; s=z) {
  1088. for ( ; *s && (isspace(*s) || *s==':'); s++);
  1089. for (z=s; *z && !isspace(*z) && *z!=':'; z++);
  1090. tmp = *z;
  1091. *z = 0;
  1092. load_library(s, 0);
  1093. *z = tmp;
  1094. }
  1095. }
  1096. static void add_syms(struct dso *p)
  1097. {
  1098. if (!p->syms_next && syms_tail != p) {
  1099. syms_tail->syms_next = p;
  1100. syms_tail = p;
  1101. }
  1102. }
  1103. static void revert_syms(struct dso *old_tail)
  1104. {
  1105. struct dso *p, *next;
  1106. /* Chop off the tail of the list of dsos that participate in
  1107. * the global symbol table, reverting them to RTLD_LOCAL. */
  1108. for (p=old_tail; p; p=next) {
  1109. next = p->syms_next;
  1110. p->syms_next = 0;
  1111. }
  1112. syms_tail = old_tail;
  1113. }
  1114. static void do_mips_relocs(struct dso *p, size_t *got)
  1115. {
  1116. size_t i, j, rel[2];
  1117. unsigned char *base = p->base;
  1118. i=0; search_vec(p->dynv, &i, DT_MIPS_LOCAL_GOTNO);
  1119. if (p==&ldso) {
  1120. got += i;
  1121. } else {
  1122. while (i--) *got++ += (size_t)base;
  1123. }
  1124. j=0; search_vec(p->dynv, &j, DT_MIPS_GOTSYM);
  1125. i=0; search_vec(p->dynv, &i, DT_MIPS_SYMTABNO);
  1126. Sym *sym = p->syms + j;
  1127. rel[0] = (unsigned char *)got - base;
  1128. for (i-=j; i; i--, sym++, rel[0]+=sizeof(size_t)) {
  1129. rel[1] = R_INFO(sym-p->syms, R_MIPS_JUMP_SLOT);
  1130. do_relocs(p, rel, sizeof rel, 2);
  1131. }
  1132. }
  1133. static void reloc_all(struct dso *p)
  1134. {
  1135. size_t dyn[DYN_CNT];
  1136. for (; p; p=p->next) {
  1137. if (p->relocated) continue;
  1138. decode_vec(p->dynv, dyn, DYN_CNT);
  1139. if (NEED_MIPS_GOT_RELOCS)
  1140. do_mips_relocs(p, laddr(p, dyn[DT_PLTGOT]));
  1141. do_relocs(p, laddr(p, dyn[DT_JMPREL]), dyn[DT_PLTRELSZ],
  1142. 2+(dyn[DT_PLTREL]==DT_RELA));
  1143. do_relocs(p, laddr(p, dyn[DT_REL]), dyn[DT_RELSZ], 2);
  1144. do_relocs(p, laddr(p, dyn[DT_RELA]), dyn[DT_RELASZ], 3);
  1145. if (head != &ldso && p->relro_start != p->relro_end &&
  1146. mprotect(laddr(p, p->relro_start), p->relro_end-p->relro_start, PROT_READ)
  1147. && errno != ENOSYS) {
  1148. error("Error relocating %s: RELRO protection failed: %m",
  1149. p->name);
  1150. if (runtime) longjmp(*rtld_fail, 1);
  1151. }
  1152. p->relocated = 1;
  1153. }
  1154. }
  1155. static void kernel_mapped_dso(struct dso *p)
  1156. {
  1157. size_t min_addr = -1, max_addr = 0, cnt;
  1158. Phdr *ph = p->phdr;
  1159. for (cnt = p->phnum; cnt--; ph = (void *)((char *)ph + p->phentsize)) {
  1160. if (ph->p_type == PT_DYNAMIC) {
  1161. p->dynv = laddr(p, ph->p_vaddr);
  1162. } else if (ph->p_type == PT_GNU_RELRO) {
  1163. p->relro_start = ph->p_vaddr & -PAGE_SIZE;
  1164. p->relro_end = (ph->p_vaddr + ph->p_memsz) & -PAGE_SIZE;
  1165. }
  1166. if (ph->p_type != PT_LOAD) continue;
  1167. if (ph->p_vaddr < min_addr)
  1168. min_addr = ph->p_vaddr;
  1169. if (ph->p_vaddr+ph->p_memsz > max_addr)
  1170. max_addr = ph->p_vaddr+ph->p_memsz;
  1171. }
  1172. min_addr &= -PAGE_SIZE;
  1173. max_addr = (max_addr + PAGE_SIZE-1) & -PAGE_SIZE;
  1174. p->map = p->base + min_addr;
  1175. p->map_len = max_addr - min_addr;
  1176. p->kernel_mapped = 1;
  1177. }
  1178. void __libc_exit_fini()
  1179. {
  1180. struct dso *p;
  1181. size_t dyn[DYN_CNT];
  1182. for (p=fini_head; p; p=p->fini_next) {
  1183. if (!p->constructed) continue;
  1184. decode_vec(p->dynv, dyn, DYN_CNT);
  1185. if (dyn[0] & (1<<DT_FINI_ARRAY)) {
  1186. size_t n = dyn[DT_FINI_ARRAYSZ]/sizeof(size_t);
  1187. size_t *fn = (size_t *)laddr(p, dyn[DT_FINI_ARRAY])+n;
  1188. while (n--) ((void (*)(void))*--fn)();
  1189. }
  1190. #ifndef NO_LEGACY_INITFINI
  1191. if ((dyn[0] & (1<<DT_FINI)) && dyn[DT_FINI])
  1192. fpaddr(p, dyn[DT_FINI])();
  1193. #endif
  1194. }
  1195. }
  1196. static void do_init_fini(struct dso *p)
  1197. {
  1198. size_t dyn[DYN_CNT];
  1199. int need_locking = libc.threads_minus_1;
  1200. /* Allow recursive calls that arise when a library calls
  1201. * dlopen from one of its constructors, but block any
  1202. * other threads until all ctors have finished. */
  1203. if (need_locking) pthread_mutex_lock(&init_fini_lock);
  1204. for (; p; p=p->prev) {
  1205. if (p->constructed) continue;
  1206. p->constructed = 1;
  1207. decode_vec(p->dynv, dyn, DYN_CNT);
  1208. if (dyn[0] & ((1<<DT_FINI) | (1<<DT_FINI_ARRAY))) {
  1209. p->fini_next = fini_head;
  1210. fini_head = p;
  1211. }
  1212. #ifndef NO_LEGACY_INITFINI
  1213. if ((dyn[0] & (1<<DT_INIT)) && dyn[DT_INIT])
  1214. fpaddr(p, dyn[DT_INIT])();
  1215. #endif
  1216. if (dyn[0] & (1<<DT_INIT_ARRAY)) {
  1217. size_t n = dyn[DT_INIT_ARRAYSZ]/sizeof(size_t);
  1218. size_t *fn = laddr(p, dyn[DT_INIT_ARRAY]);
  1219. while (n--) ((void (*)(void))*fn++)();
  1220. }
  1221. if (!need_locking && libc.threads_minus_1) {
  1222. need_locking = 1;
  1223. pthread_mutex_lock(&init_fini_lock);
  1224. }
  1225. }
  1226. if (need_locking) pthread_mutex_unlock(&init_fini_lock);
  1227. }
  1228. void __libc_start_init(void)
  1229. {
  1230. do_init_fini(tail);
  1231. }
  1232. static void dl_debug_state(void)
  1233. {
  1234. }
  1235. weak_alias(dl_debug_state, _dl_debug_state);
  1236. void __init_tls(size_t *auxv)
  1237. {
  1238. }
  1239. hidden void *__tls_get_new(tls_mod_off_t *v)
  1240. {
  1241. pthread_t self = __pthread_self();
  1242. /* Block signals to make accessing new TLS async-signal-safe */
  1243. sigset_t set;
  1244. __block_all_sigs(&set);
  1245. if (v[0]<=(size_t)self->dtv[0]) {
  1246. __restore_sigs(&set);
  1247. return (char *)self->dtv[v[0]]+v[1]+DTP_OFFSET;
  1248. }
  1249. /* This is safe without any locks held because, if the caller
  1250. * is able to request the Nth entry of the DTV, the DSO list
  1251. * must be valid at least that far out and it was synchronized
  1252. * at program startup or by an already-completed call to dlopen. */
  1253. struct dso *p;
  1254. for (p=head; p->tls_id != v[0]; p=p->next);
  1255. /* Get new DTV space from new DSO if needed */
  1256. if (v[0] > (size_t)self->dtv[0]) {
  1257. void **newdtv = p->new_dtv +
  1258. (v[0]+1)*a_fetch_add(&p->new_dtv_idx,1);
  1259. memcpy(newdtv, self->dtv,
  1260. ((size_t)self->dtv[0]+1) * sizeof(void *));
  1261. newdtv[0] = (void *)v[0];
  1262. self->dtv = self->dtv_copy = newdtv;
  1263. }
  1264. /* Get new TLS memory from all new DSOs up to the requested one */
  1265. unsigned char *mem;
  1266. for (p=head; ; p=p->next) {
  1267. if (!p->tls_id || self->dtv[p->tls_id]) continue;
  1268. mem = p->new_tls + (p->tls.size + p->tls.align)
  1269. * a_fetch_add(&p->new_tls_idx,1);
  1270. mem += ((uintptr_t)p->tls.image - (uintptr_t)mem)
  1271. & (p->tls.align-1);
  1272. self->dtv[p->tls_id] = mem;
  1273. memcpy(mem, p->tls.image, p->tls.len);
  1274. if (p->tls_id == v[0]) break;
  1275. }
  1276. __restore_sigs(&set);
  1277. return mem + v[1] + DTP_OFFSET;
  1278. }
  1279. static void update_tls_size()
  1280. {
  1281. libc.tls_cnt = tls_cnt;
  1282. libc.tls_align = tls_align;
  1283. libc.tls_size = ALIGN(
  1284. (1+tls_cnt) * sizeof(void *) +
  1285. tls_offset +
  1286. sizeof(struct pthread) +
  1287. tls_align * 2,
  1288. tls_align);
  1289. }
  1290. /* Stage 1 of the dynamic linker is defined in dlstart.c. It calls the
  1291. * following stage 2 and stage 3 functions via primitive symbolic lookup
  1292. * since it does not have access to their addresses to begin with. */
  1293. /* Stage 2 of the dynamic linker is called after relative relocations
  1294. * have been processed. It can make function calls to static functions
  1295. * and access string literals and static data, but cannot use extern
  1296. * symbols. Its job is to perform symbolic relocations on the dynamic
  1297. * linker itself, but some of the relocations performed may need to be
  1298. * replaced later due to copy relocations in the main program. */
  1299. hidden void __dls2(unsigned char *base, size_t *sp)
  1300. {
  1301. if (DL_FDPIC) {
  1302. void *p1 = (void *)sp[-2];
  1303. void *p2 = (void *)sp[-1];
  1304. if (!p1) {
  1305. size_t *auxv, aux[AUX_CNT];
  1306. for (auxv=sp+1+*sp+1; *auxv; auxv++); auxv++;
  1307. decode_vec(auxv, aux, AUX_CNT);
  1308. if (aux[AT_BASE]) ldso.base = (void *)aux[AT_BASE];
  1309. else ldso.base = (void *)(aux[AT_PHDR] & -4096);
  1310. }
  1311. app_loadmap = p2 ? p1 : 0;
  1312. ldso.loadmap = p2 ? p2 : p1;
  1313. ldso.base = laddr(&ldso, 0);
  1314. } else {
  1315. ldso.base = base;
  1316. }
  1317. Ehdr *ehdr = (void *)ldso.base;
  1318. ldso.name = ldso.shortname = "libc.so";
  1319. ldso.phnum = ehdr->e_phnum;
  1320. ldso.phdr = laddr(&ldso, ehdr->e_phoff);
  1321. ldso.phentsize = ehdr->e_phentsize;
  1322. kernel_mapped_dso(&ldso);
  1323. decode_dyn(&ldso);
  1324. if (DL_FDPIC) makefuncdescs(&ldso);
  1325. /* Prepare storage for to save clobbered REL addends so they
  1326. * can be reused in stage 3. There should be very few. If
  1327. * something goes wrong and there are a huge number, abort
  1328. * instead of risking stack overflow. */
  1329. size_t dyn[DYN_CNT];
  1330. decode_vec(ldso.dynv, dyn, DYN_CNT);
  1331. size_t *rel = laddr(&ldso, dyn[DT_REL]);
  1332. size_t rel_size = dyn[DT_RELSZ];
  1333. size_t symbolic_rel_cnt = 0;
  1334. apply_addends_to = rel;
  1335. for (; rel_size; rel+=2, rel_size-=2*sizeof(size_t))
  1336. if (!IS_RELATIVE(rel[1], ldso.syms)) symbolic_rel_cnt++;
  1337. if (symbolic_rel_cnt >= ADDEND_LIMIT) a_crash();
  1338. size_t addends[symbolic_rel_cnt+1];
  1339. saved_addends = addends;
  1340. head = &ldso;
  1341. reloc_all(&ldso);
  1342. ldso.relocated = 0;
  1343. /* Call dynamic linker stage-3, __dls3, looking it up
  1344. * symbolically as a barrier against moving the address
  1345. * load across the above relocation processing. */
  1346. struct symdef dls3_def = find_sym(&ldso, "__dls3", 0);
  1347. if (DL_FDPIC) ((stage3_func)&ldso.funcdescs[dls3_def.sym-ldso.syms])(sp);
  1348. else ((stage3_func)laddr(&ldso, dls3_def.sym->st_value))(sp);
  1349. }
  1350. /* Stage 3 of the dynamic linker is called with the dynamic linker/libc
  1351. * fully functional. Its job is to load (if not already loaded) and
  1352. * process dependencies and relocations for the main application and
  1353. * transfer control to its entry point. */
  1354. _Noreturn void __dls3(size_t *sp)
  1355. {
  1356. static struct dso app, vdso;
  1357. size_t aux[AUX_CNT], *auxv;
  1358. size_t i;
  1359. char *env_preload=0;
  1360. char *replace_argv0=0;
  1361. size_t vdso_base;
  1362. int argc = *sp;
  1363. char **argv = (void *)(sp+1);
  1364. char **argv_orig = argv;
  1365. char **envp = argv+argc+1;
  1366. /* Find aux vector just past environ[] and use it to initialize
  1367. * global data that may be needed before we can make syscalls. */
  1368. __environ = envp;
  1369. for (i=argc+1; argv[i]; i++);
  1370. libc.auxv = auxv = (void *)(argv+i+1);
  1371. decode_vec(auxv, aux, AUX_CNT);
  1372. __hwcap = aux[AT_HWCAP];
  1373. libc.page_size = aux[AT_PAGESZ];
  1374. libc.secure = ((aux[0]&0x7800)!=0x7800 || aux[AT_UID]!=aux[AT_EUID]
  1375. || aux[AT_GID]!=aux[AT_EGID] || aux[AT_SECURE]);
  1376. /* Setup early thread pointer in builtin_tls for ldso/libc itself to
  1377. * use during dynamic linking. If possible it will also serve as the
  1378. * thread pointer at runtime. */
  1379. libc.tls_size = sizeof builtin_tls;
  1380. libc.tls_align = tls_align;
  1381. if (__init_tp(__copy_tls((void *)builtin_tls)) < 0) {
  1382. a_crash();
  1383. }
  1384. /* Only trust user/env if kernel says we're not suid/sgid */
  1385. if (!libc.secure) {
  1386. env_path = getenv("LD_LIBRARY_PATH");
  1387. env_preload = getenv("LD_PRELOAD");
  1388. }
  1389. /* If the main program was already loaded by the kernel,
  1390. * AT_PHDR will point to some location other than the dynamic
  1391. * linker's program headers. */
  1392. if (aux[AT_PHDR] != (size_t)ldso.phdr) {
  1393. size_t interp_off = 0;
  1394. size_t tls_image = 0;
  1395. /* Find load address of the main program, via AT_PHDR vs PT_PHDR. */
  1396. Phdr *phdr = app.phdr = (void *)aux[AT_PHDR];
  1397. app.phnum = aux[AT_PHNUM];
  1398. app.phentsize = aux[AT_PHENT];
  1399. for (i=aux[AT_PHNUM]; i; i--, phdr=(void *)((char *)phdr + aux[AT_PHENT])) {
  1400. if (phdr->p_type == PT_PHDR)
  1401. app.base = (void *)(aux[AT_PHDR] - phdr->p_vaddr);
  1402. else if (phdr->p_type == PT_INTERP)
  1403. interp_off = (size_t)phdr->p_vaddr;
  1404. else if (phdr->p_type == PT_TLS) {
  1405. tls_image = phdr->p_vaddr;
  1406. app.tls.len = phdr->p_filesz;
  1407. app.tls.size = phdr->p_memsz;
  1408. app.tls.align = phdr->p_align;
  1409. }
  1410. }
  1411. if (DL_FDPIC) app.loadmap = app_loadmap;
  1412. if (app.tls.size) app.tls.image = laddr(&app, tls_image);
  1413. if (interp_off) ldso.name = laddr(&app, interp_off);
  1414. if ((aux[0] & (1UL<<AT_EXECFN))
  1415. && strncmp((char *)aux[AT_EXECFN], "/proc/", 6))
  1416. app.name = (char *)aux[AT_EXECFN];
  1417. else
  1418. app.name = argv[0];
  1419. kernel_mapped_dso(&app);
  1420. } else {
  1421. int fd;
  1422. char *ldname = argv[0];
  1423. size_t l = strlen(ldname);
  1424. if (l >= 3 && !strcmp(ldname+l-3, "ldd")) ldd_mode = 1;
  1425. argv++;
  1426. while (argv[0] && argv[0][0]=='-' && argv[0][1]=='-') {
  1427. char *opt = argv[0]+2;
  1428. *argv++ = (void *)-1;
  1429. if (!*opt) {
  1430. break;
  1431. } else if (!memcmp(opt, "list", 5)) {
  1432. ldd_mode = 1;
  1433. } else if (!memcmp(opt, "library-path", 12)) {
  1434. if (opt[12]=='=') env_path = opt+13;
  1435. else if (opt[12]) *argv = 0;
  1436. else if (*argv) env_path = *argv++;
  1437. } else if (!memcmp(opt, "preload", 7)) {
  1438. if (opt[7]=='=') env_preload = opt+8;
  1439. else if (opt[7]) *argv = 0;
  1440. else if (*argv) env_preload = *argv++;
  1441. } else if (!memcmp(opt, "argv0", 5)) {
  1442. if (opt[5]=='=') replace_argv0 = opt+6;
  1443. else if (opt[5]) *argv = 0;
  1444. else if (*argv) replace_argv0 = *argv++;
  1445. } else {
  1446. argv[0] = 0;
  1447. }
  1448. }
  1449. argv[-1] = (void *)(argc - (argv-argv_orig));
  1450. if (!argv[0]) {
  1451. dprintf(2, "musl libc (" LDSO_ARCH ")\n"
  1452. "Version %s\n"
  1453. "Dynamic Program Loader\n"
  1454. "Usage: %s [options] [--] pathname%s\n",
  1455. __libc_version, ldname,
  1456. ldd_mode ? "" : " [args]");
  1457. _exit(1);
  1458. }
  1459. fd = open(argv[0], O_RDONLY);
  1460. if (fd < 0) {
  1461. dprintf(2, "%s: cannot load %s: %s\n", ldname, argv[0], strerror(errno));
  1462. _exit(1);
  1463. }
  1464. Ehdr *ehdr = (void *)map_library(fd, &app);
  1465. if (!ehdr) {
  1466. dprintf(2, "%s: %s: Not a valid dynamic program\n", ldname, argv[0]);
  1467. _exit(1);
  1468. }
  1469. close(fd);
  1470. ldso.name = ldname;
  1471. app.name = argv[0];
  1472. aux[AT_ENTRY] = (size_t)laddr(&app, ehdr->e_entry);
  1473. /* Find the name that would have been used for the dynamic
  1474. * linker had ldd not taken its place. */
  1475. if (ldd_mode) {
  1476. for (i=0; i<app.phnum; i++) {
  1477. if (app.phdr[i].p_type == PT_INTERP)
  1478. ldso.name = laddr(&app, app.phdr[i].p_vaddr);
  1479. }
  1480. dprintf(1, "\t%s (%p)\n", ldso.name, ldso.base);
  1481. }
  1482. }
  1483. if (app.tls.size) {
  1484. libc.tls_head = tls_tail = &app.tls;
  1485. app.tls_id = tls_cnt = 1;
  1486. #ifdef TLS_ABOVE_TP
  1487. app.tls.offset = GAP_ABOVE_TP;
  1488. app.tls.offset += -GAP_ABOVE_TP & (app.tls.align-1);
  1489. tls_offset = app.tls.offset + app.tls.size
  1490. + ( -((uintptr_t)app.tls.image + app.tls.size)
  1491. & (app.tls.align-1) );
  1492. #else
  1493. tls_offset = app.tls.offset = app.tls.size
  1494. + ( -((uintptr_t)app.tls.image + app.tls.size)
  1495. & (app.tls.align-1) );
  1496. #endif
  1497. tls_align = MAXP2(tls_align, app.tls.align);
  1498. }
  1499. decode_dyn(&app);
  1500. if (DL_FDPIC) {
  1501. makefuncdescs(&app);
  1502. if (!app.loadmap) {
  1503. app.loadmap = (void *)&app_dummy_loadmap;
  1504. app.loadmap->nsegs = 1;
  1505. app.loadmap->segs[0].addr = (size_t)app.map;
  1506. app.loadmap->segs[0].p_vaddr = (size_t)app.map
  1507. - (size_t)app.base;
  1508. app.loadmap->segs[0].p_memsz = app.map_len;
  1509. }
  1510. argv[-3] = (void *)app.loadmap;
  1511. }
  1512. /* Initial dso chain consists only of the app. */
  1513. head = tail = syms_tail = &app;
  1514. /* Donate unused parts of app and library mapping to malloc */
  1515. reclaim_gaps(&app);
  1516. reclaim_gaps(&ldso);
  1517. /* Load preload/needed libraries, add symbols to global namespace. */
  1518. if (env_preload) load_preload(env_preload);
  1519. load_deps(&app);
  1520. for (struct dso *p=head; p; p=p->next)
  1521. add_syms(p);
  1522. /* Attach to vdso, if provided by the kernel, last so that it does
  1523. * not become part of the global namespace. */
  1524. if (search_vec(auxv, &vdso_base, AT_SYSINFO_EHDR) && vdso_base) {
  1525. Ehdr *ehdr = (void *)vdso_base;
  1526. Phdr *phdr = vdso.phdr = (void *)(vdso_base + ehdr->e_phoff);
  1527. vdso.phnum = ehdr->e_phnum;
  1528. vdso.phentsize = ehdr->e_phentsize;
  1529. for (i=ehdr->e_phnum; i; i--, phdr=(void *)((char *)phdr + ehdr->e_phentsize)) {
  1530. if (phdr->p_type == PT_DYNAMIC)
  1531. vdso.dynv = (void *)(vdso_base + phdr->p_offset);
  1532. if (phdr->p_type == PT_LOAD)
  1533. vdso.base = (void *)(vdso_base - phdr->p_vaddr + phdr->p_offset);
  1534. }
  1535. vdso.name = "";
  1536. vdso.shortname = "linux-gate.so.1";
  1537. vdso.relocated = 1;
  1538. decode_dyn(&vdso);
  1539. vdso.prev = tail;
  1540. tail->next = &vdso;
  1541. tail = &vdso;
  1542. }
  1543. for (i=0; app.dynv[i]; i+=2) {
  1544. if (!DT_DEBUG_INDIRECT && app.dynv[i]==DT_DEBUG)
  1545. app.dynv[i+1] = (size_t)&debug;
  1546. if (DT_DEBUG_INDIRECT && app.dynv[i]==DT_DEBUG_INDIRECT) {
  1547. size_t *ptr = (size_t *) app.dynv[i+1];
  1548. *ptr = (size_t)&debug;
  1549. }
  1550. }
  1551. /* The main program must be relocated LAST since it may contin
  1552. * copy relocations which depend on libraries' relocations. */
  1553. reloc_all(app.next);
  1554. reloc_all(&app);
  1555. update_tls_size();
  1556. if (libc.tls_size > sizeof builtin_tls || tls_align > MIN_TLS_ALIGN) {
  1557. void *initial_tls = calloc(libc.tls_size, 1);
  1558. if (!initial_tls) {
  1559. dprintf(2, "%s: Error getting %zu bytes thread-local storage: %m\n",
  1560. argv[0], libc.tls_size);
  1561. _exit(127);
  1562. }
  1563. if (__init_tp(__copy_tls(initial_tls)) < 0) {
  1564. a_crash();
  1565. }
  1566. } else {
  1567. size_t tmp_tls_size = libc.tls_size;
  1568. pthread_t self = __pthread_self();
  1569. /* Temporarily set the tls size to the full size of
  1570. * builtin_tls so that __copy_tls will use the same layout
  1571. * as it did for before. Then check, just to be safe. */
  1572. libc.tls_size = sizeof builtin_tls;
  1573. if (__copy_tls((void*)builtin_tls) != self) a_crash();
  1574. libc.tls_size = tmp_tls_size;
  1575. }
  1576. static_tls_cnt = tls_cnt;
  1577. if (ldso_fail) _exit(127);
  1578. if (ldd_mode) _exit(0);
  1579. /* Determine if malloc was interposed by a replacement implementation
  1580. * so that calloc and the memalign family can harden against the
  1581. * possibility of incomplete replacement. */
  1582. if (find_sym(head, "malloc", 1).dso != &ldso)
  1583. __malloc_replaced = 1;
  1584. /* Switch to runtime mode: any further failures in the dynamic
  1585. * linker are a reportable failure rather than a fatal startup
  1586. * error. */
  1587. runtime = 1;
  1588. debug.ver = 1;
  1589. debug.bp = dl_debug_state;
  1590. debug.head = head;
  1591. debug.base = ldso.base;
  1592. debug.state = 0;
  1593. _dl_debug_state();
  1594. if (replace_argv0) argv[0] = replace_argv0;
  1595. errno = 0;
  1596. CRTJMP((void *)aux[AT_ENTRY], argv-1);
  1597. for(;;);
  1598. }
  1599. static void prepare_lazy(struct dso *p)
  1600. {
  1601. size_t dyn[DYN_CNT], n, flags1=0;
  1602. decode_vec(p->dynv, dyn, DYN_CNT);
  1603. search_vec(p->dynv, &flags1, DT_FLAGS_1);
  1604. if (dyn[DT_BIND_NOW] || (dyn[DT_FLAGS] & DF_BIND_NOW) || (flags1 & DF_1_NOW))
  1605. return;
  1606. n = dyn[DT_RELSZ]/2 + dyn[DT_RELASZ]/3 + dyn[DT_PLTRELSZ]/2 + 1;
  1607. if (NEED_MIPS_GOT_RELOCS) {
  1608. size_t j=0; search_vec(p->dynv, &j, DT_MIPS_GOTSYM);
  1609. size_t i=0; search_vec(p->dynv, &i, DT_MIPS_SYMTABNO);
  1610. n += i-j;
  1611. }
  1612. p->lazy = calloc(n, 3*sizeof(size_t));
  1613. if (!p->lazy) {
  1614. error("Error preparing lazy relocation for %s: %m", p->name);
  1615. longjmp(*rtld_fail, 1);
  1616. }
  1617. p->lazy_next = lazy_head;
  1618. lazy_head = p;
  1619. }
  1620. void *dlopen(const char *file, int mode)
  1621. {
  1622. struct dso *volatile p, *orig_tail, *orig_syms_tail, *orig_lazy_head, *next;
  1623. struct tls_module *orig_tls_tail;
  1624. size_t orig_tls_cnt, orig_tls_offset, orig_tls_align;
  1625. size_t i;
  1626. int cs;
  1627. jmp_buf jb;
  1628. if (!file) return head;
  1629. pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &cs);
  1630. pthread_rwlock_wrlock(&lock);
  1631. __inhibit_ptc();
  1632. p = 0;
  1633. orig_tls_tail = tls_tail;
  1634. orig_tls_cnt = tls_cnt;
  1635. orig_tls_offset = tls_offset;
  1636. orig_tls_align = tls_align;
  1637. orig_lazy_head = lazy_head;
  1638. orig_syms_tail = syms_tail;
  1639. orig_tail = tail;
  1640. noload = mode & RTLD_NOLOAD;
  1641. rtld_fail = &jb;
  1642. if (setjmp(*rtld_fail)) {
  1643. /* Clean up anything new that was (partially) loaded */
  1644. revert_syms(orig_syms_tail);
  1645. for (p=orig_tail->next; p; p=next) {
  1646. next = p->next;
  1647. while (p->td_index) {
  1648. void *tmp = p->td_index->next;
  1649. free(p->td_index);
  1650. p->td_index = tmp;
  1651. }
  1652. free(p->funcdescs);
  1653. if (p->rpath != p->rpath_orig)
  1654. free(p->rpath);
  1655. if (p->deps != &nodeps_dummy)
  1656. free(p->deps);
  1657. unmap_library(p);
  1658. free(p);
  1659. }
  1660. if (!orig_tls_tail) libc.tls_head = 0;
  1661. tls_tail = orig_tls_tail;
  1662. if (tls_tail) tls_tail->next = 0;
  1663. tls_cnt = orig_tls_cnt;
  1664. tls_offset = orig_tls_offset;
  1665. tls_align = orig_tls_align;
  1666. lazy_head = orig_lazy_head;
  1667. tail = orig_tail;
  1668. tail->next = 0;
  1669. p = 0;
  1670. goto end;
  1671. } else p = load_library(file, head);
  1672. if (!p) {
  1673. error(noload ?
  1674. "Library %s is not already loaded" :
  1675. "Error loading shared library %s: %m",
  1676. file);
  1677. goto end;
  1678. }
  1679. /* First load handling */
  1680. int first_load = !p->deps;
  1681. if (first_load) {
  1682. load_deps(p);
  1683. if (!p->relocated && (mode & RTLD_LAZY)) {
  1684. prepare_lazy(p);
  1685. for (i=0; p->deps[i]; i++)
  1686. if (!p->deps[i]->relocated)
  1687. prepare_lazy(p->deps[i]);
  1688. }
  1689. }
  1690. if (first_load || (mode & RTLD_GLOBAL)) {
  1691. /* Make new symbols global, at least temporarily, so we can do
  1692. * relocations. If not RTLD_GLOBAL, this is reverted below. */
  1693. add_syms(p);
  1694. for (i=0; p->deps[i]; i++)
  1695. add_syms(p->deps[i]);
  1696. }
  1697. if (first_load) {
  1698. reloc_all(p);
  1699. }
  1700. /* If RTLD_GLOBAL was not specified, undo any new additions
  1701. * to the global symbol table. This is a nop if the library was
  1702. * previously loaded and already global. */
  1703. if (!(mode & RTLD_GLOBAL))
  1704. revert_syms(orig_syms_tail);
  1705. /* Processing of deferred lazy relocations must not happen until
  1706. * the new libraries are committed; otherwise we could end up with
  1707. * relocations resolved to symbol definitions that get removed. */
  1708. redo_lazy_relocs();
  1709. update_tls_size();
  1710. _dl_debug_state();
  1711. orig_tail = tail;
  1712. end:
  1713. __release_ptc();
  1714. if (p) gencnt++;
  1715. pthread_rwlock_unlock(&lock);
  1716. if (p) do_init_fini(orig_tail);
  1717. pthread_setcancelstate(cs, 0);
  1718. return p;
  1719. }
  1720. hidden int __dl_invalid_handle(void *h)
  1721. {
  1722. struct dso *p;
  1723. for (p=head; p; p=p->next) if (h==p) return 0;
  1724. error("Invalid library handle %p", (void *)h);
  1725. return 1;
  1726. }
  1727. static void *addr2dso(size_t a)
  1728. {
  1729. struct dso *p;
  1730. size_t i;
  1731. if (DL_FDPIC) for (p=head; p; p=p->next) {
  1732. i = count_syms(p);
  1733. if (a-(size_t)p->funcdescs < i*sizeof(*p->funcdescs))
  1734. return p;
  1735. }
  1736. for (p=head; p; p=p->next) {
  1737. if (DL_FDPIC && p->loadmap) {
  1738. for (i=0; i<p->loadmap->nsegs; i++) {
  1739. if (a-p->loadmap->segs[i].p_vaddr
  1740. < p->loadmap->segs[i].p_memsz)
  1741. return p;
  1742. }
  1743. } else {
  1744. Phdr *ph = p->phdr;
  1745. size_t phcnt = p->phnum;
  1746. size_t entsz = p->phentsize;
  1747. size_t base = (size_t)p->base;
  1748. for (; phcnt--; ph=(void *)((char *)ph+entsz)) {
  1749. if (ph->p_type != PT_LOAD) continue;
  1750. if (a-base-ph->p_vaddr < ph->p_memsz)
  1751. return p;
  1752. }
  1753. if (a-(size_t)p->map < p->map_len)
  1754. return 0;
  1755. }
  1756. }
  1757. return 0;
  1758. }
  1759. static void *do_dlsym(struct dso *p, const char *s, void *ra)
  1760. {
  1761. size_t i;
  1762. uint32_t h = 0, gh = 0, *ght;
  1763. Sym *sym;
  1764. if (p == head || p == RTLD_DEFAULT || p == RTLD_NEXT) {
  1765. if (p == RTLD_DEFAULT) {
  1766. p = head;
  1767. } else if (p == RTLD_NEXT) {
  1768. p = addr2dso((size_t)ra);
  1769. if (!p) p=head;
  1770. p = p->next;
  1771. }
  1772. struct symdef def = find_sym(p, s, 0);
  1773. if (!def.sym) goto failed;
  1774. if ((def.sym->st_info&0xf) == STT_TLS)
  1775. return __tls_get_addr((tls_mod_off_t []){def.dso->tls_id, def.sym->st_value});
  1776. if (DL_FDPIC && (def.sym->st_info&0xf) == STT_FUNC)
  1777. return def.dso->funcdescs + (def.sym - def.dso->syms);
  1778. return laddr(def.dso, def.sym->st_value);
  1779. }
  1780. if (__dl_invalid_handle(p))
  1781. return 0;
  1782. if ((ght = p->ghashtab)) {
  1783. gh = gnu_hash(s);
  1784. sym = gnu_lookup(gh, ght, p, s);
  1785. } else {
  1786. h = sysv_hash(s);
  1787. sym = sysv_lookup(s, h, p);
  1788. }
  1789. if (sym && (sym->st_info&0xf) == STT_TLS)
  1790. return __tls_get_addr((tls_mod_off_t []){p->tls_id, sym->st_value});
  1791. if (DL_FDPIC && sym && sym->st_shndx && (sym->st_info&0xf) == STT_FUNC)
  1792. return p->funcdescs + (sym - p->syms);
  1793. if (sym && sym->st_value && (1<<(sym->st_info&0xf) & OK_TYPES))
  1794. return laddr(p, sym->st_value);
  1795. for (i=0; p->deps[i]; i++) {
  1796. if ((ght = p->deps[i]->ghashtab)) {
  1797. if (!gh) gh = gnu_hash(s);
  1798. sym = gnu_lookup(gh, ght, p->deps[i], s);
  1799. } else {
  1800. if (!h) h = sysv_hash(s);
  1801. sym = sysv_lookup(s, h, p->deps[i]);
  1802. }
  1803. if (sym && (sym->st_info&0xf) == STT_TLS)
  1804. return __tls_get_addr((tls_mod_off_t []){p->deps[i]->tls_id, sym->st_value});
  1805. if (DL_FDPIC && sym && sym->st_shndx && (sym->st_info&0xf) == STT_FUNC)
  1806. return p->deps[i]->funcdescs + (sym - p->deps[i]->syms);
  1807. if (sym && sym->st_value && (1<<(sym->st_info&0xf) & OK_TYPES))
  1808. return laddr(p->deps[i], sym->st_value);
  1809. }
  1810. failed:
  1811. error("Symbol not found: %s", s);
  1812. return 0;
  1813. }
  1814. int dladdr(const void *addr_arg, Dl_info *info)
  1815. {
  1816. size_t addr = (size_t)addr_arg;
  1817. struct dso *p;
  1818. Sym *sym, *bestsym;
  1819. uint32_t nsym;
  1820. char *strings;
  1821. size_t best = 0;
  1822. size_t besterr = -1;
  1823. pthread_rwlock_rdlock(&lock);
  1824. p = addr2dso(addr);
  1825. pthread_rwlock_unlock(&lock);
  1826. if (!p) return 0;
  1827. sym = p->syms;
  1828. strings = p->strings;
  1829. nsym = count_syms(p);
  1830. if (DL_FDPIC) {
  1831. size_t idx = (addr-(size_t)p->funcdescs)
  1832. / sizeof(*p->funcdescs);
  1833. if (idx < nsym && (sym[idx].st_info&0xf) == STT_FUNC) {
  1834. best = (size_t)(p->funcdescs + idx);
  1835. bestsym = sym + idx;
  1836. besterr = 0;
  1837. }
  1838. }
  1839. if (!best) for (; nsym; nsym--, sym++) {
  1840. if (sym->st_value
  1841. && (1<<(sym->st_info&0xf) & OK_TYPES)
  1842. && (1<<(sym->st_info>>4) & OK_BINDS)) {
  1843. size_t symaddr = (size_t)laddr(p, sym->st_value);
  1844. if (symaddr > addr || symaddr <= best)
  1845. continue;
  1846. best = symaddr;
  1847. bestsym = sym;
  1848. besterr = addr - symaddr;
  1849. if (addr == symaddr)
  1850. break;
  1851. }
  1852. }
  1853. if (bestsym && besterr > bestsym->st_size-1) {
  1854. best = 0;
  1855. bestsym = 0;
  1856. }
  1857. info->dli_fname = p->name;
  1858. info->dli_fbase = p->map;
  1859. if (!best) {
  1860. info->dli_sname = 0;
  1861. info->dli_saddr = 0;
  1862. return 1;
  1863. }
  1864. if (DL_FDPIC && (bestsym->st_info&0xf) == STT_FUNC)
  1865. best = (size_t)(p->funcdescs + (bestsym - p->syms));
  1866. info->dli_sname = strings + bestsym->st_name;
  1867. info->dli_saddr = (void *)best;
  1868. return 1;
  1869. }
  1870. hidden void *__dlsym(void *restrict p, const char *restrict s, void *restrict ra)
  1871. {
  1872. void *res;
  1873. pthread_rwlock_rdlock(&lock);
  1874. res = do_dlsym(p, s, ra);
  1875. pthread_rwlock_unlock(&lock);
  1876. return res;
  1877. }
  1878. int dl_iterate_phdr(int(*callback)(struct dl_phdr_info *info, size_t size, void *data), void *data)
  1879. {
  1880. struct dso *current;
  1881. struct dl_phdr_info info;
  1882. int ret = 0;
  1883. for(current = head; current;) {
  1884. info.dlpi_addr = (uintptr_t)current->base;
  1885. info.dlpi_name = current->name;
  1886. info.dlpi_phdr = current->phdr;
  1887. info.dlpi_phnum = current->phnum;
  1888. info.dlpi_adds = gencnt;
  1889. info.dlpi_subs = 0;
  1890. info.dlpi_tls_modid = current->tls_id;
  1891. info.dlpi_tls_data = current->tls.image;
  1892. ret = (callback)(&info, sizeof (info), data);
  1893. if (ret != 0) break;
  1894. pthread_rwlock_rdlock(&lock);
  1895. current = current->next;
  1896. pthread_rwlock_unlock(&lock);
  1897. }
  1898. return ret;
  1899. }
  1900. hidden void __dl_vseterr(const char *, va_list);
  1901. static void error(const char *fmt, ...)
  1902. {
  1903. va_list ap;
  1904. va_start(ap, fmt);
  1905. if (!runtime) {
  1906. vdprintf(2, fmt, ap);
  1907. dprintf(2, "\n");
  1908. ldso_fail = 1;
  1909. va_end(ap);
  1910. return;
  1911. }
  1912. __dl_vseterr(fmt, ap);
  1913. va_end(ap);
  1914. }