dynlink.c 56 KB

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