obj.c 25 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484
  1. /* vl - mips linker */
  2. #define EXTERN
  3. #include "l.h"
  4. #include <ar.h>
  5. #ifndef DEFAULT
  6. #define DEFAULT '9'
  7. #endif
  8. char *noname = "<none>";
  9. char symname[] = SYMDEF;
  10. char thechar = 'v';
  11. char *thestring = "mips";
  12. int little;
  13. char** libdir;
  14. int nlibdir = 0;
  15. static int maxlibdir = 0;
  16. /*
  17. * -H0 -T0x40004C -D0x10000000 is abbrev unix (boot image)
  18. * -H1 -T0x80020000 -R4 is bootp() format for 3k (boot image)
  19. * -H2 -T16416 -R16384 is plan9 format
  20. * -H3 -T0x80020000 -R8 is bootp() format for 4k (4k boot image)
  21. * -H4 -T0x400000 -R4 is sgi unix coff executable (4k boot image)
  22. * -H5 -T0x4000A0 -R4 is sgi unix elf executable
  23. * -H6 is headerless
  24. * -H7 is 64-bit elf executable
  25. */
  26. void
  27. usage(void)
  28. {
  29. diag("usage: %s [-options] objects", argv0);
  30. errorexit();
  31. }
  32. void
  33. main(int argc, char *argv[])
  34. {
  35. int c;
  36. char *a;
  37. char name[LIBNAMELEN];
  38. Binit(&bso, 1, OWRITE);
  39. cout = -1;
  40. listinit();
  41. outfile = 0;
  42. nerrors = 0;
  43. curtext = P;
  44. HEADTYPE = -1;
  45. INITTEXT = -1;
  46. INITTEXTP = -1;
  47. INITDAT = -1;
  48. INITRND = -1;
  49. INITENTRY = 0;
  50. ARGBEGIN {
  51. default:
  52. c = ARGC();
  53. if(c >= 0 && c < sizeof(debug))
  54. debug[c]++;
  55. break;
  56. case 'o':
  57. outfile = ARGF();
  58. break;
  59. case 'E':
  60. a = ARGF();
  61. if(a)
  62. INITENTRY = a;
  63. break;
  64. case 'm': /* for little-endian mips */
  65. thechar = '0';
  66. thestring = "spim";
  67. little = 1;
  68. break;
  69. case 'T':
  70. a = ARGF();
  71. if(a)
  72. INITTEXT = atolwhex(a);
  73. break;
  74. case 'P':
  75. a = ARGF();
  76. if(a)
  77. INITTEXTP = atolwhex(a);
  78. break;
  79. case 'D':
  80. a = ARGF();
  81. if(a)
  82. INITDAT = atolwhex(a);
  83. break;
  84. case 'R':
  85. a = ARGF();
  86. if(a)
  87. INITRND = atolwhex(a);
  88. break;
  89. case 'H':
  90. a = ARGF();
  91. if(a)
  92. HEADTYPE = atolwhex(a);
  93. /* do something about setting INITTEXT */
  94. break;
  95. case 'L':
  96. addlibpath(EARGF(usage()));
  97. break;
  98. } ARGEND
  99. USED(argc);
  100. if(*argv == 0)
  101. usage();
  102. if(!debug['9'] && !debug['U'] && !debug['B'])
  103. debug[DEFAULT] = 1;
  104. a = getenv("ccroot");
  105. if(a != nil && *a != '\0') {
  106. if(!fileexists(a)) {
  107. diag("nonexistent $ccroot: %s", a);
  108. errorexit();
  109. }
  110. }else
  111. a = "";
  112. snprint(name, sizeof(name), "%s/%s/lib", a, thestring);
  113. addlibpath(name);
  114. if(HEADTYPE == -1) {
  115. if(debug['U'])
  116. HEADTYPE = 0;
  117. if(debug['B'])
  118. HEADTYPE = 1;
  119. if(debug['9'])
  120. HEADTYPE = 2;
  121. }
  122. switch(HEADTYPE) {
  123. default:
  124. diag("unknown -H option");
  125. errorexit();
  126. case 0: /* unix simple */
  127. HEADR = 20L+56L;
  128. if(INITTEXT == -1)
  129. INITTEXT = 0x40004CL;
  130. if(INITDAT == -1)
  131. INITDAT = 0x10000000L;
  132. if(INITRND == -1)
  133. INITRND = 0;
  134. break;
  135. case 1: /* boot for 3k */
  136. HEADR = 20L+60L;
  137. if(INITTEXT == -1)
  138. INITTEXT = 0x80020000L;
  139. if(INITDAT == -1)
  140. INITDAT = 0;
  141. if(INITRND == -1)
  142. INITRND = 4;
  143. break;
  144. case 2: /* plan 9 */
  145. HEADR = 32L;
  146. if(INITDAT == -1)
  147. INITDAT = 0;
  148. if(INITRND == -1)
  149. INITRND = 16*1024;
  150. if(INITTEXT == -1)
  151. INITTEXT = INITRND + HEADR;
  152. break;
  153. case 3: /* boot for 4k */
  154. HEADR = 20L+56L+3*40L;
  155. if(INITTEXT == -1)
  156. INITTEXT = 0x80020000L;
  157. if(INITDAT == -1)
  158. INITDAT = 0;
  159. if(INITRND == -1)
  160. INITRND = 8;
  161. break;
  162. case 4: /* sgi unix coff executable */
  163. HEADR = 20L+56L+3*40L;
  164. if(INITTEXT == -1)
  165. INITTEXT = 0x00400000L+HEADR;
  166. if(INITDAT == -1)
  167. INITDAT = 0x10000000;
  168. if(INITRND == -1)
  169. INITRND = 0;
  170. break;
  171. case 5: /* sgi unix elf executable */
  172. HEADR = rnd(Ehdr32sz+3*Phdr32sz, 16);
  173. if(INITTEXT == -1)
  174. INITTEXT = 0x00400000L+HEADR;
  175. if(INITDAT == -1)
  176. INITDAT = 0x10000000;
  177. if(INITRND == -1)
  178. INITRND = 0;
  179. break;
  180. case 6: /* headerless */
  181. HEADR = 0;
  182. if(INITTEXT == -1)
  183. INITTEXT = 0x80000000L+HEADR;
  184. if(INITDAT == -1)
  185. INITDAT = 0;
  186. if(INITRND == -1)
  187. INITRND = 4096;
  188. break;
  189. case 7: /* 64-bit elf executable */
  190. HEADR = rnd(Ehdr64sz+3*Phdr64sz, 16);
  191. if(INITTEXT == -1)
  192. INITTEXT = 0x00400000L+HEADR;
  193. if(INITDAT == -1)
  194. INITDAT = 0x10000000;
  195. if(INITRND == -1)
  196. INITRND = 0;
  197. break;
  198. }
  199. if (INITTEXTP == -1)
  200. INITTEXTP = INITTEXT;
  201. if(INITDAT != 0 && INITRND != 0)
  202. print("warning: -D%#llux is ignored because of -R%#llux\n",
  203. INITDAT, INITRND);
  204. if(debug['v'])
  205. Bprint(&bso, "HEADER = -H%d -T%#llux -D%#llux -R%#llux\n",
  206. HEADTYPE, INITTEXT, INITDAT, INITRND);
  207. Bflush(&bso);
  208. zprg.as = AGOK;
  209. zprg.reg = NREG;
  210. zprg.from.name = D_NONE;
  211. zprg.from.type = D_NONE;
  212. zprg.from.reg = NREG;
  213. zprg.to = zprg.from;
  214. buildop();
  215. histgen = 0;
  216. textp = P;
  217. datap = P;
  218. pc = 0;
  219. dtype = 4;
  220. if(outfile == 0) {
  221. static char name[20];
  222. snprint(name, sizeof name, "%c.out", thechar);
  223. outfile = name;
  224. }
  225. cout = create(outfile, 1, 0775);
  226. if(cout < 0) {
  227. diag("cannot create %s: %r", outfile);
  228. errorexit();
  229. }
  230. nuxiinit();
  231. version = 0;
  232. cbp = buf.cbuf;
  233. cbc = sizeof(buf.cbuf);
  234. firstp = prg();
  235. lastp = firstp;
  236. if(INITENTRY == 0) {
  237. INITENTRY = "_main";
  238. if(debug['p'])
  239. INITENTRY = "_mainp";
  240. if(!debug['l'])
  241. lookup(INITENTRY, 0)->type = SXREF;
  242. } else if(!(*INITENTRY >= '0' && *INITENTRY <= '9'))
  243. lookup(INITENTRY, 0)->type = SXREF;
  244. while(*argv)
  245. objfile(*argv++);
  246. if(!debug['l'])
  247. loadlib();
  248. firstp = firstp->link;
  249. if(firstp == P)
  250. goto out;
  251. patch();
  252. if(debug['p'])
  253. if(debug['1'])
  254. doprof1();
  255. else
  256. doprof2();
  257. dodata();
  258. follow();
  259. if(firstp == P)
  260. goto out;
  261. noops();
  262. span();
  263. asmb();
  264. undef();
  265. out:
  266. if(debug['v']) {
  267. Bprint(&bso, "%5.2f cpu time\n", cputime());
  268. Bprint(&bso, "%ld memory used\n", thunk);
  269. Bprint(&bso, "%d sizeof adr\n", sizeof(Adr));
  270. Bprint(&bso, "%d sizeof prog\n", sizeof(Prog));
  271. }
  272. Bflush(&bso);
  273. errorexit();
  274. }
  275. void
  276. addlibpath(char *arg)
  277. {
  278. char **p;
  279. if(nlibdir >= maxlibdir) {
  280. if(maxlibdir == 0)
  281. maxlibdir = 8;
  282. else
  283. maxlibdir *= 2;
  284. p = malloc(maxlibdir*sizeof(*p));
  285. if(p == nil) {
  286. diag("out of memory");
  287. errorexit();
  288. }
  289. memmove(p, libdir, nlibdir*sizeof(*p));
  290. free(libdir);
  291. libdir = p;
  292. }
  293. libdir[nlibdir++] = strdup(arg);
  294. }
  295. char*
  296. findlib(char *file)
  297. {
  298. int i;
  299. char name[LIBNAMELEN];
  300. for(i = 0; i < nlibdir; i++) {
  301. snprint(name, sizeof(name), "%s/%s", libdir[i], file);
  302. if(fileexists(name))
  303. return libdir[i];
  304. }
  305. return nil;
  306. }
  307. void
  308. loadlib(void)
  309. {
  310. int i;
  311. long h;
  312. Sym *s;
  313. loop:
  314. xrefresolv = 0;
  315. for(i=0; i<libraryp; i++) {
  316. if(debug['v'])
  317. Bprint(&bso, "%5.2f autolib: %s (from %s)\n", cputime(), library[i], libraryobj[i]);
  318. objfile(library[i]);
  319. }
  320. if(xrefresolv)
  321. for(h=0; h<nelem(hash); h++)
  322. for(s = hash[h]; s != S; s = s->link)
  323. if(s->type == SXREF)
  324. goto loop;
  325. }
  326. void
  327. errorexit(void)
  328. {
  329. if(nerrors) {
  330. if(cout >= 0)
  331. remove(outfile);
  332. exits("error");
  333. }
  334. exits(0);
  335. }
  336. void
  337. objfile(char *file)
  338. {
  339. long off, esym, cnt, l;
  340. int f, work;
  341. Sym *s;
  342. char magbuf[SARMAG];
  343. char name[100], pname[150];
  344. struct ar_hdr arhdr;
  345. char *e, *start, *stop;
  346. if(file[0] == '-' && file[1] == 'l') {
  347. if(debug['9'])
  348. sprint(name, "/%s/lib/lib", thestring);
  349. else
  350. sprint(name, "/usr/%clib/lib", thechar);
  351. strcat(name, file+2);
  352. strcat(name, ".a");
  353. file = name;
  354. }
  355. if(debug['v'])
  356. Bprint(&bso, "%5.2f ldobj: %s\n", cputime(), file);
  357. Bflush(&bso);
  358. f = open(file, 0);
  359. if(f < 0) {
  360. diag("cannot open file: %s", file);
  361. errorexit();
  362. }
  363. l = read(f, magbuf, SARMAG);
  364. if(l != SARMAG || strncmp(magbuf, ARMAG, SARMAG)){
  365. /* load it as a regular file */
  366. l = seek(f, 0L, 2);
  367. seek(f, 0L, 0);
  368. ldobj(f, l, file);
  369. close(f);
  370. return;
  371. }
  372. if(debug['v'])
  373. Bprint(&bso, "%5.2f ldlib: %s\n", cputime(), file);
  374. l = read(f, &arhdr, SAR_HDR);
  375. if(l != SAR_HDR) {
  376. diag("%s: short read on archive file symbol header", file);
  377. goto out;
  378. }
  379. if(strncmp(arhdr.name, symname, strlen(symname))) {
  380. diag("%s: first entry not symbol header", file);
  381. goto out;
  382. }
  383. esym = SARMAG + SAR_HDR + atolwhex(arhdr.size);
  384. off = SARMAG + SAR_HDR;
  385. /*
  386. * just bang the whole symbol file into memory
  387. */
  388. seek(f, off, 0);
  389. cnt = esym - off;
  390. start = malloc(cnt + 10);
  391. cnt = read(f, start, cnt);
  392. if(cnt <= 0){
  393. close(f);
  394. return;
  395. }
  396. stop = &start[cnt];
  397. memset(stop, 0, 10);
  398. work = 1;
  399. while(work){
  400. if(debug['v'])
  401. Bprint(&bso, "%5.2f library pass: %s\n", cputime(), file);
  402. Bflush(&bso);
  403. work = 0;
  404. for(e = start; e < stop; e = strchr(e+5, 0) + 1) {
  405. s = lookup(e+5, 0);
  406. if(s->type != SXREF)
  407. continue;
  408. sprint(pname, "%s(%s)", file, s->name);
  409. if(debug['v'])
  410. Bprint(&bso, "%5.2f library: %s\n", cputime(), pname);
  411. Bflush(&bso);
  412. l = e[1] & 0xff;
  413. l |= (e[2] & 0xff) << 8;
  414. l |= (e[3] & 0xff) << 16;
  415. l |= (e[4] & 0xff) << 24;
  416. seek(f, l, 0);
  417. /* need readn to read the dumps (at least) */
  418. l = readn(f, &arhdr, SAR_HDR);
  419. if(l != SAR_HDR)
  420. goto bad;
  421. if(strncmp(arhdr.fmag, ARFMAG, sizeof(arhdr.fmag)))
  422. goto bad;
  423. l = atolwhex(arhdr.size);
  424. ldobj(f, l, pname);
  425. if(s->type == SXREF) {
  426. diag("%s: failed to load: %s", file, s->name);
  427. errorexit();
  428. }
  429. work = 1;
  430. xrefresolv = 1;
  431. }
  432. }
  433. return;
  434. bad:
  435. diag("%s: bad or out of date archive", file);
  436. out:
  437. close(f);
  438. }
  439. int
  440. zaddr(uchar *p, Adr *a, Sym *h[])
  441. {
  442. int i, c;
  443. int l;
  444. Sym *s;
  445. Auto *u;
  446. c = p[2];
  447. if(c < 0 || c > NSYM){
  448. print("sym out of range: %d\n", c);
  449. p[0] = ALAST+1;
  450. return 0;
  451. }
  452. a->type = p[0];
  453. a->reg = p[1];
  454. a->sym = h[c];
  455. a->name = p[3];
  456. c = 4;
  457. if(a->reg < 0 || a->reg > NREG) {
  458. print("register out of range %d\n", a->reg);
  459. p[0] = ALAST+1;
  460. return 0; /* force real diagnostic */
  461. }
  462. switch(a->type) {
  463. default:
  464. print("unknown type %d\n", a->type);
  465. p[0] = ALAST+1;
  466. return 0; /* force real diagnostic */
  467. case D_NONE:
  468. case D_REG:
  469. case D_FREG:
  470. case D_MREG:
  471. case D_FCREG:
  472. case D_LO:
  473. case D_HI:
  474. break;
  475. case D_BRANCH:
  476. case D_OREG:
  477. case D_CONST:
  478. case D_OCONST:
  479. a->offset = p[4] | (p[5]<<8) |
  480. (p[6]<<16) | (p[7]<<24);
  481. c += 4;
  482. break;
  483. case D_SCONST:
  484. while(nhunk < NSNAME)
  485. gethunk();
  486. a->sval = (char*)hunk;
  487. nhunk -= NSNAME;
  488. hunk += NSNAME;
  489. memmove(a->sval, p+4, NSNAME);
  490. c += NSNAME;
  491. break;
  492. case D_FCONST:
  493. while(nhunk < sizeof(Ieee))
  494. gethunk();
  495. a->ieee = (Ieee*)hunk;
  496. nhunk -= NSNAME;
  497. hunk += NSNAME;
  498. a->ieee->l = p[4] | (p[5]<<8) |
  499. (p[6]<<16) | (p[7]<<24);
  500. a->ieee->h = p[8] | (p[9]<<8) |
  501. (p[10]<<16) | (p[11]<<24);
  502. c += 8;
  503. break;
  504. }
  505. s = a->sym;
  506. if(s == S)
  507. return c;
  508. i = a->name;
  509. if(i != D_AUTO && i != D_PARAM)
  510. return c;
  511. l = a->offset;
  512. for(u=curauto; u; u=u->link)
  513. if(u->asym == s)
  514. if(u->type == i) {
  515. if(u->aoffset > l)
  516. u->aoffset = l;
  517. return c;
  518. }
  519. while(nhunk < sizeof(Auto))
  520. gethunk();
  521. u = (Auto*)hunk;
  522. nhunk -= sizeof(Auto);
  523. hunk += sizeof(Auto);
  524. u->link = curauto;
  525. curauto = u;
  526. u->asym = s;
  527. u->aoffset = l;
  528. u->type = i;
  529. return c;
  530. }
  531. void
  532. addlib(char *obj)
  533. {
  534. char fn1[LIBNAMELEN], fn2[LIBNAMELEN], comp[LIBNAMELEN], *p, *name;
  535. int i, search;
  536. if(histfrogp <= 0)
  537. return;
  538. name = fn1;
  539. search = 0;
  540. if(histfrog[0]->name[1] == '/') {
  541. sprint(name, "");
  542. i = 1;
  543. } else if(histfrog[0]->name[1] == '.') {
  544. sprint(name, ".");
  545. i = 0;
  546. } else {
  547. sprint(name, "");
  548. i = 0;
  549. search = 1;
  550. }
  551. for(; i<histfrogp; i++) {
  552. snprint(comp, sizeof comp, histfrog[i]->name+1);
  553. for(;;) {
  554. p = strstr(comp, "$O");
  555. if(p == 0)
  556. break;
  557. memmove(p+1, p+2, strlen(p+2)+1);
  558. p[0] = thechar;
  559. }
  560. for(;;) {
  561. p = strstr(comp, "$M");
  562. if(p == 0)
  563. break;
  564. if(strlen(comp)+strlen(thestring)-2+1 >= sizeof comp) {
  565. diag("library component too long");
  566. return;
  567. }
  568. memmove(p+strlen(thestring), p+2, strlen(p+2)+1);
  569. memmove(p, thestring, strlen(thestring));
  570. }
  571. if(strlen(fn1) + strlen(comp) + 3 >= sizeof(fn1)) {
  572. diag("library component too long");
  573. return;
  574. }
  575. if(i > 0 || !search)
  576. strcat(fn1, "/");
  577. strcat(fn1, comp);
  578. }
  579. cleanname(name);
  580. if(search){
  581. p = findlib(name);
  582. if(p != nil){
  583. snprint(fn2, sizeof(fn2), "%s/%s", p, name);
  584. name = fn2;
  585. }
  586. }
  587. for(i=0; i<libraryp; i++)
  588. if(strcmp(name, library[i]) == 0)
  589. return;
  590. if(libraryp == nelem(library)){
  591. diag("too many autolibs; skipping %s", name);
  592. return;
  593. }
  594. p = malloc(strlen(name) + 1);
  595. strcpy(p, name);
  596. library[libraryp] = p;
  597. p = malloc(strlen(obj) + 1);
  598. strcpy(p, obj);
  599. libraryobj[libraryp] = p;
  600. libraryp++;
  601. }
  602. void
  603. addhist(long line, int type)
  604. {
  605. Auto *u;
  606. Sym *s;
  607. int i, j, k;
  608. u = malloc(sizeof(Auto));
  609. s = malloc(sizeof(Sym));
  610. s->name = malloc(2*(histfrogp+1) + 1);
  611. u->asym = s;
  612. u->type = type;
  613. u->aoffset = line;
  614. u->link = curhist;
  615. curhist = u;
  616. j = 1;
  617. for(i=0; i<histfrogp; i++) {
  618. k = histfrog[i]->value;
  619. s->name[j+0] = k>>8;
  620. s->name[j+1] = k;
  621. j += 2;
  622. }
  623. }
  624. void
  625. histtoauto(void)
  626. {
  627. Auto *l;
  628. while(l = curhist) {
  629. curhist = l->link;
  630. l->link = curauto;
  631. curauto = l;
  632. }
  633. }
  634. void
  635. collapsefrog(Sym *s)
  636. {
  637. int i;
  638. /*
  639. * bad encoding of path components only allows
  640. * MAXHIST components. if there is an overflow,
  641. * first try to collapse xxx/..
  642. */
  643. for(i=1; i<histfrogp; i++)
  644. if(strcmp(histfrog[i]->name+1, "..") == 0) {
  645. memmove(histfrog+i-1, histfrog+i+1,
  646. (histfrogp-i-1)*sizeof(histfrog[0]));
  647. histfrogp--;
  648. goto out;
  649. }
  650. /*
  651. * next try to collapse .
  652. */
  653. for(i=0; i<histfrogp; i++)
  654. if(strcmp(histfrog[i]->name+1, ".") == 0) {
  655. memmove(histfrog+i, histfrog+i+1,
  656. (histfrogp-i-1)*sizeof(histfrog[0]));
  657. goto out;
  658. }
  659. /*
  660. * last chance, just truncate from front
  661. */
  662. memmove(histfrog+0, histfrog+1,
  663. (histfrogp-1)*sizeof(histfrog[0]));
  664. out:
  665. histfrog[histfrogp-1] = s;
  666. }
  667. void
  668. nopout(Prog *p)
  669. {
  670. p->as = ANOP;
  671. p->from.type = D_NONE;
  672. p->to.type = D_NONE;
  673. }
  674. uchar*
  675. readsome(int f, uchar *buf, uchar *good, uchar *stop, int max)
  676. {
  677. int n;
  678. n = stop - good;
  679. memmove(buf, good, stop - good);
  680. stop = buf + n;
  681. n = MAXIO - n;
  682. if(n > max)
  683. n = max;
  684. n = read(f, stop, n);
  685. if(n <= 0)
  686. return 0;
  687. return stop + n;
  688. }
  689. void
  690. ldobj(int f, long c, char *pn)
  691. {
  692. vlong ipc;
  693. Prog *p, *t;
  694. uchar *bloc, *bsize, *stop;
  695. Sym *h[NSYM], *s, *di;
  696. int v, o, r, skip;
  697. bsize = buf.xbuf;
  698. bloc = buf.xbuf;
  699. di = S;
  700. newloop:
  701. memset(h, 0, sizeof(h));
  702. version++;
  703. histfrogp = 0;
  704. ipc = pc;
  705. skip = 0;
  706. loop:
  707. if(c <= 0)
  708. goto eof;
  709. r = bsize - bloc;
  710. if(r < 100 && r < c) { /* enough for largest prog */
  711. bsize = readsome(f, buf.xbuf, bloc, bsize, c);
  712. if(bsize == 0)
  713. goto eof;
  714. bloc = buf.xbuf;
  715. goto loop;
  716. }
  717. o = bloc[0]; /* as */
  718. if(o <= AXXX || o >= ALAST) {
  719. diag("%s: line %lld: opcode out of range %d", pn, pc-ipc, o);
  720. print(" probably not a .%c file\n", thechar);
  721. errorexit();
  722. }
  723. if(o == ANAME || o == ASIGNAME) {
  724. if(o == ASIGNAME) {
  725. bloc += 4;
  726. c -= 4;
  727. }
  728. stop = memchr(&bloc[3], 0, bsize-&bloc[3]);
  729. if(stop == 0){
  730. bsize = readsome(f, buf.xbuf, bloc, bsize, c);
  731. if(bsize == 0)
  732. goto eof;
  733. bloc = buf.xbuf;
  734. stop = memchr(&bloc[3], 0, bsize-&bloc[3]);
  735. if(stop == 0){
  736. fprint(2, "%s: name too long\n", pn);
  737. errorexit();
  738. }
  739. }
  740. v = bloc[1]; /* type */
  741. o = bloc[2]; /* sym */
  742. bloc += 3;
  743. c -= 3;
  744. r = 0;
  745. if(v == D_STATIC)
  746. r = version;
  747. s = lookup((char*)bloc, r);
  748. c -= &stop[1] - bloc;
  749. bloc = stop + 1;
  750. if(debug['W'])
  751. print(" ANAME %s\n", s->name);
  752. h[o] = s;
  753. if((v == D_EXTERN || v == D_STATIC) && s->type == 0)
  754. s->type = SXREF;
  755. if(v == D_FILE) {
  756. if(s->type != SFILE) {
  757. histgen++;
  758. s->type = SFILE;
  759. s->value = histgen;
  760. }
  761. if(histfrogp < MAXHIST) {
  762. histfrog[histfrogp] = s;
  763. histfrogp++;
  764. } else
  765. collapsefrog(s);
  766. }
  767. goto loop;
  768. }
  769. if(nhunk < sizeof(Prog))
  770. gethunk();
  771. p = (Prog*)hunk;
  772. nhunk -= sizeof(Prog);
  773. hunk += sizeof(Prog);
  774. p->as = o;
  775. p->reg = bloc[1] & 0x7f;
  776. if(bloc[1] & 0x80)
  777. p->mark = NOSCHED;
  778. p->line = bloc[2] | (bloc[3]<<8) | (bloc[4]<<16) | (bloc[5]<<24);
  779. r = zaddr(bloc+6, &p->from, h) + 6;
  780. r += zaddr(bloc+r, &p->to, h);
  781. bloc += r;
  782. c -= r;
  783. if(p->reg < 0 || p->reg > NREG)
  784. diag("register out of range %d", p->reg);
  785. p->link = P;
  786. p->cond = P;
  787. if(debug['W'])
  788. print("%P\n", p);
  789. switch(o) {
  790. case AHISTORY:
  791. if(p->to.offset == -1) {
  792. addlib(pn);
  793. histfrogp = 0;
  794. goto loop;
  795. }
  796. addhist(p->line, D_FILE); /* 'z' */
  797. if(p->to.offset)
  798. addhist(p->to.offset, D_FILE1); /* 'Z' */
  799. histfrogp = 0;
  800. goto loop;
  801. case AEND:
  802. histtoauto();
  803. if(curtext != P)
  804. curtext->to.autom = curauto;
  805. curauto = 0;
  806. curtext = P;
  807. if(c)
  808. goto newloop;
  809. return;
  810. case AGLOBL:
  811. s = p->from.sym;
  812. if(s == S) {
  813. diag("GLOBL must have a name\n%P", p);
  814. errorexit();
  815. }
  816. if(s->type == 0 || s->type == SXREF) {
  817. s->type = SBSS;
  818. s->value = 0;
  819. }
  820. if(s->type != SBSS) {
  821. diag("redefinition: %s\n%P", s->name, p);
  822. s->type = SBSS;
  823. s->value = 0;
  824. }
  825. if(p->to.offset > s->value)
  826. s->value = p->to.offset;
  827. break;
  828. case ADYNT:
  829. if(p->to.sym == S) {
  830. diag("DYNT without a sym\n%P", p);
  831. break;
  832. }
  833. di = p->to.sym;
  834. p->reg = 4;
  835. if(di->type == SXREF) {
  836. if(debug['z'])
  837. Bprint(&bso, "%P set to %d\n", p, dtype);
  838. di->type = SCONST;
  839. di->value = dtype;
  840. dtype += 4;
  841. }
  842. if(p->from.sym == S)
  843. break;
  844. p->from.offset = di->value;
  845. p->from.sym->type = SDATA;
  846. if(curtext == P) {
  847. diag("DYNT not in text: %P", p);
  848. break;
  849. }
  850. p->to.sym = curtext->from.sym;
  851. p->to.type = D_CONST;
  852. p->link = datap;
  853. datap = p;
  854. break;
  855. case AINIT:
  856. if(p->from.sym == S) {
  857. diag("INIT without a sym\n%P", p);
  858. break;
  859. }
  860. if(di == S) {
  861. diag("INIT without previous DYNT\n%P", p);
  862. break;
  863. }
  864. p->from.offset = di->value;
  865. p->from.sym->type = SDATA;
  866. p->link = datap;
  867. datap = p;
  868. break;
  869. case ADATA:
  870. if(p->from.sym == S) {
  871. diag("DATA without a sym\n%P", p);
  872. break;
  873. }
  874. p->link = datap;
  875. datap = p;
  876. break;
  877. case AGOK:
  878. diag("unknown opcode\n%P", p);
  879. p->pc = pc;
  880. pc++;
  881. break;
  882. case ATEXT:
  883. if(curtext != P) {
  884. histtoauto();
  885. curtext->to.autom = curauto;
  886. curauto = 0;
  887. }
  888. skip = 0;
  889. curtext = p;
  890. autosize = (p->to.offset+3L) & ~3L;
  891. p->to.offset = autosize;
  892. autosize += 4;
  893. s = p->from.sym;
  894. if(s == S) {
  895. diag("TEXT must have a name\n%P", p);
  896. errorexit();
  897. }
  898. if(s->type != 0 && s->type != SXREF) {
  899. if(p->reg & DUPOK) {
  900. skip = 1;
  901. goto casedef;
  902. }
  903. diag("redefinition: %s\n%P", s->name, p);
  904. }
  905. s->type = STEXT;
  906. s->value = pc;
  907. lastp->link = p;
  908. lastp = p;
  909. p->pc = pc;
  910. pc++;
  911. if(textp == P) {
  912. textp = p;
  913. etextp = p;
  914. goto loop;
  915. }
  916. etextp->cond = p;
  917. etextp = p;
  918. break;
  919. case ASUB:
  920. case ASUBU:
  921. if(p->from.type == D_CONST)
  922. if(p->from.name == D_NONE) {
  923. p->from.offset = -p->from.offset;
  924. if(p->as == ASUB)
  925. p->as = AADD;
  926. else
  927. p->as = AADDU;
  928. }
  929. goto casedef;
  930. case AMOVF:
  931. if(skip)
  932. goto casedef;
  933. if(p->from.type == D_FCONST) {
  934. /* size sb 9 max */
  935. sprint(literal, "$%lux", ieeedtof(p->from.ieee));
  936. s = lookup(literal, 0);
  937. if(s->type == 0) {
  938. s->type = SBSS;
  939. s->value = 4;
  940. t = prg();
  941. t->as = ADATA;
  942. t->line = p->line;
  943. t->from.type = D_OREG;
  944. t->from.sym = s;
  945. t->from.name = D_EXTERN;
  946. t->reg = 4;
  947. t->to = p->from;
  948. t->link = datap;
  949. datap = t;
  950. }
  951. p->from.type = D_OREG;
  952. p->from.sym = s;
  953. p->from.name = D_EXTERN;
  954. p->from.offset = 0;
  955. }
  956. goto casedef;
  957. case AMOVD:
  958. if(skip)
  959. goto casedef;
  960. if(p->from.type == D_FCONST) {
  961. /* size sb 18 max */
  962. sprint(literal, "$%lux.%lux",
  963. p->from.ieee->l, p->from.ieee->h);
  964. s = lookup(literal, 0);
  965. if(s->type == 0) {
  966. s->type = SBSS;
  967. s->value = 8;
  968. t = prg();
  969. t->as = ADATA;
  970. t->line = p->line;
  971. t->from.type = D_OREG;
  972. t->from.sym = s;
  973. t->from.name = D_EXTERN;
  974. t->reg = 8;
  975. t->to = p->from;
  976. t->link = datap;
  977. datap = t;
  978. }
  979. p->from.type = D_OREG;
  980. p->from.sym = s;
  981. p->from.name = D_EXTERN;
  982. p->from.offset = 0;
  983. }
  984. goto casedef;
  985. default:
  986. casedef:
  987. if(skip)
  988. nopout(p);
  989. if(p->to.type == D_BRANCH)
  990. p->to.offset += ipc;
  991. lastp->link = p;
  992. lastp = p;
  993. p->pc = pc;
  994. pc++;
  995. break;
  996. }
  997. goto loop;
  998. eof:
  999. diag("truncated object file: %s", pn);
  1000. }
  1001. Sym*
  1002. lookup(char *symb, int v)
  1003. {
  1004. Sym *s;
  1005. char *p;
  1006. long h;
  1007. int c, l;
  1008. h = v;
  1009. for(p=symb; c = *p; p++)
  1010. h = h+h+h + c;
  1011. l = (p - symb) + 1;
  1012. h &= 0xffffff;
  1013. h %= NHASH;
  1014. for(s = hash[h]; s != S; s = s->link)
  1015. if(s->version == v)
  1016. if(memcmp(s->name, symb, l) == 0)
  1017. return s;
  1018. while(nhunk < sizeof(Sym))
  1019. gethunk();
  1020. s = (Sym*)hunk;
  1021. nhunk -= sizeof(Sym);
  1022. hunk += sizeof(Sym);
  1023. s->name = malloc(l);
  1024. memmove(s->name, symb, l);
  1025. s->link = hash[h];
  1026. s->type = 0;
  1027. s->version = v;
  1028. s->value = 0;
  1029. hash[h] = s;
  1030. return s;
  1031. }
  1032. Prog*
  1033. prg(void)
  1034. {
  1035. Prog *p;
  1036. while(nhunk < sizeof(Prog))
  1037. gethunk();
  1038. p = (Prog*)hunk;
  1039. nhunk -= sizeof(Prog);
  1040. hunk += sizeof(Prog);
  1041. *p = zprg;
  1042. return p;
  1043. }
  1044. void
  1045. gethunk(void)
  1046. {
  1047. char *h;
  1048. long nh;
  1049. nh = NHUNK;
  1050. if(thunk >= 5L*NHUNK) {
  1051. nh = 5L*NHUNK;
  1052. if(thunk >= 25L*NHUNK)
  1053. nh = 25L*NHUNK;
  1054. }
  1055. h = mysbrk(nh);
  1056. if(h == (char*)-1) {
  1057. diag("out of memory");
  1058. errorexit();
  1059. }
  1060. hunk = h;
  1061. nhunk = nh;
  1062. thunk += nh;
  1063. }
  1064. void
  1065. doprof1(void)
  1066. {
  1067. Sym *s;
  1068. long n;
  1069. Prog *p, *q;
  1070. if(debug['v'])
  1071. Bprint(&bso, "%5.2f profile 1\n", cputime());
  1072. Bflush(&bso);
  1073. s = lookup("__mcount", 0);
  1074. n = 1;
  1075. for(p = firstp->link; p != P; p = p->link) {
  1076. if(p->as == ATEXT) {
  1077. q = prg();
  1078. q->line = p->line;
  1079. q->link = datap;
  1080. datap = q;
  1081. q->as = ADATA;
  1082. q->from.type = D_OREG;
  1083. q->from.name = D_EXTERN;
  1084. q->from.offset = n*4;
  1085. q->from.sym = s;
  1086. q->reg = 4;
  1087. q->to = p->from;
  1088. q->to.type = D_CONST;
  1089. q = prg();
  1090. q->line = p->line;
  1091. q->pc = p->pc;
  1092. q->link = p->link;
  1093. p->link = q;
  1094. p = q;
  1095. p->as = AMOVW;
  1096. p->from.type = D_OREG;
  1097. p->from.name = D_EXTERN;
  1098. p->from.sym = s;
  1099. p->from.offset = n*4 + 4;
  1100. p->to.type = D_REG;
  1101. p->to.reg = REGTMP;
  1102. q = prg();
  1103. q->line = p->line;
  1104. q->pc = p->pc;
  1105. q->link = p->link;
  1106. p->link = q;
  1107. p = q;
  1108. p->as = AADDU;
  1109. p->from.type = D_CONST;
  1110. p->from.offset = 1;
  1111. p->to.type = D_REG;
  1112. p->to.reg = REGTMP;
  1113. q = prg();
  1114. q->line = p->line;
  1115. q->pc = p->pc;
  1116. q->link = p->link;
  1117. p->link = q;
  1118. p = q;
  1119. p->as = AMOVW;
  1120. p->from.type = D_REG;
  1121. p->from.reg = REGTMP;
  1122. p->to.type = D_OREG;
  1123. p->to.name = D_EXTERN;
  1124. p->to.sym = s;
  1125. p->to.offset = n*4 + 4;
  1126. n += 2;
  1127. continue;
  1128. }
  1129. }
  1130. q = prg();
  1131. q->line = 0;
  1132. q->link = datap;
  1133. datap = q;
  1134. q->as = ADATA;
  1135. q->from.type = D_OREG;
  1136. q->from.name = D_EXTERN;
  1137. q->from.sym = s;
  1138. q->reg = 4;
  1139. q->to.type = D_CONST;
  1140. q->to.offset = n;
  1141. s->type = SBSS;
  1142. s->value = n*4;
  1143. }
  1144. void
  1145. doprof2(void)
  1146. {
  1147. Sym *s2, *s4;
  1148. Prog *p, *q, *q2, *ps2, *ps4;
  1149. if(debug['v'])
  1150. Bprint(&bso, "%5.2f profile 2\n", cputime());
  1151. Bflush(&bso);
  1152. if(debug['e']){
  1153. s2 = lookup("_tracein", 0);
  1154. s4 = lookup("_traceout", 0);
  1155. }else{
  1156. s2 = lookup("_profin", 0);
  1157. s4 = lookup("_profout", 0);
  1158. }
  1159. if(s2->type != STEXT || s4->type != STEXT) {
  1160. if(debug['e'])
  1161. diag("_tracein/_traceout not defined %d %d", s2->type, s4->type);
  1162. else
  1163. diag("_profin/_profout not defined");
  1164. return;
  1165. }
  1166. ps2 = P;
  1167. ps4 = P;
  1168. for(p = firstp; p != P; p = p->link) {
  1169. if(p->as == ATEXT) {
  1170. if(p->from.sym == s2) {
  1171. ps2 = p;
  1172. p->reg = 1;
  1173. }
  1174. if(p->from.sym == s4) {
  1175. ps4 = p;
  1176. p->reg = 1;
  1177. }
  1178. }
  1179. }
  1180. for(p = firstp; p != P; p = p->link) {
  1181. if(p->as == ATEXT) {
  1182. if(p->reg & NOPROF) {
  1183. for(;;) {
  1184. q = p->link;
  1185. if(q == P)
  1186. break;
  1187. if(q->as == ATEXT)
  1188. break;
  1189. p = q;
  1190. }
  1191. continue;
  1192. }
  1193. /*
  1194. * JAL profin, R2
  1195. */
  1196. q = prg();
  1197. q->line = p->line;
  1198. q->pc = p->pc;
  1199. q->link = p->link;
  1200. if(debug['e']){ /* embedded tracing */
  1201. q2 = prg();
  1202. p->link = q2;
  1203. q2->link = q;
  1204. q2->line = p->line;
  1205. q2->pc = p->pc;
  1206. q2->as = AJMP;
  1207. q2->to.type = D_BRANCH;
  1208. q2->to.sym = p->to.sym;
  1209. q2->cond = q->link;
  1210. }else
  1211. p->link = q;
  1212. p = q;
  1213. p->as = AJAL;
  1214. p->to.type = D_BRANCH;
  1215. p->cond = ps2;
  1216. p->to.sym = s2;
  1217. continue;
  1218. }
  1219. if(p->as == ARET) {
  1220. /*
  1221. * RET (default)
  1222. */
  1223. if(debug['e']){ /* embedded tracing */
  1224. q = prg();
  1225. q->line = p->line;
  1226. q->pc = p->pc;
  1227. q->link = p->link;
  1228. p->link = q;
  1229. p = q;
  1230. }
  1231. /*
  1232. * RET
  1233. */
  1234. q = prg();
  1235. q->as = ARET;
  1236. q->from = p->from;
  1237. q->to = p->to;
  1238. q->link = p->link;
  1239. p->link = q;
  1240. /*
  1241. * JAL profout
  1242. */
  1243. p->as = AJAL;
  1244. p->from = zprg.from;
  1245. p->to = zprg.to;
  1246. p->to.type = D_BRANCH;
  1247. p->cond = ps4;
  1248. p->to.sym = s4;
  1249. p = q;
  1250. continue;
  1251. }
  1252. }
  1253. }
  1254. void
  1255. nuxiinit(void)
  1256. {
  1257. int i, c;
  1258. for(i=0; i<4; i++)
  1259. if (!little) { /* normal big-endian case */
  1260. c = find1(0x01020304L, i+1);
  1261. if(i >= 2)
  1262. inuxi2[i-2] = c;
  1263. if(i >= 3)
  1264. inuxi1[i-3] = c;
  1265. inuxi4[i] = c;
  1266. fnuxi8[i] = c+4;
  1267. fnuxi8[i+4] = c;
  1268. } else { /* oddball little-endian case */
  1269. c = find1(0x04030201L, i+1);
  1270. if(i < 2)
  1271. inuxi2[i] = c;
  1272. if(i < 1)
  1273. inuxi1[i] = c;
  1274. inuxi4[i] = c;
  1275. fnuxi4[i] = c;
  1276. fnuxi8[i] = c;
  1277. fnuxi8[i+4] = c+4;
  1278. }
  1279. if(debug['v']) {
  1280. Bprint(&bso, "inuxi = ");
  1281. for(i=0; i<1; i++)
  1282. Bprint(&bso, "%d", inuxi1[i]);
  1283. Bprint(&bso, " ");
  1284. for(i=0; i<2; i++)
  1285. Bprint(&bso, "%d", inuxi2[i]);
  1286. Bprint(&bso, " ");
  1287. for(i=0; i<4; i++)
  1288. Bprint(&bso, "%d", inuxi4[i]);
  1289. Bprint(&bso, "\nfnuxi = ");
  1290. for(i=0; i<8; i++)
  1291. Bprint(&bso, "%d", fnuxi8[i]);
  1292. Bprint(&bso, "\n");
  1293. }
  1294. Bflush(&bso);
  1295. }
  1296. find1(long l, int c)
  1297. {
  1298. char *p;
  1299. int i;
  1300. p = (char*)&l;
  1301. for(i=0; i<4; i++)
  1302. if(*p++ == c)
  1303. return i;
  1304. return 0;
  1305. }
  1306. long
  1307. ieeedtof(Ieee *ieeep)
  1308. {
  1309. int exp;
  1310. long v;
  1311. if(ieeep->h == 0)
  1312. return 0;
  1313. exp = (ieeep->h>>20) & ((1L<<11)-1L);
  1314. exp -= (1L<<10) - 2L;
  1315. v = (ieeep->h & 0xfffffL) << 3;
  1316. v |= (ieeep->l >> 29) & 0x7L;
  1317. if((ieeep->l >> 28) & 1) {
  1318. v++;
  1319. if(v & 0x800000L) {
  1320. v = (v & 0x7fffffL) >> 1;
  1321. exp++;
  1322. }
  1323. }
  1324. if(exp <= -126 || exp >= 130)
  1325. diag("double fp to single fp overflow");
  1326. v |= ((exp + 126) & 0xffL) << 23;
  1327. v |= ieeep->h & 0x80000000L;
  1328. return v;
  1329. }
  1330. double
  1331. ieeedtod(Ieee *ieeep)
  1332. {
  1333. Ieee e;
  1334. double fr;
  1335. int exp;
  1336. if(ieeep->h & (1L<<31)) {
  1337. e.h = ieeep->h & ~(1L<<31);
  1338. e.l = ieeep->l;
  1339. return -ieeedtod(&e);
  1340. }
  1341. if(ieeep->l == 0 && ieeep->h == 0)
  1342. return 0;
  1343. fr = ieeep->l & ((1L<<16)-1L);
  1344. fr /= 1L<<16;
  1345. fr += (ieeep->l>>16) & ((1L<<16)-1L);
  1346. fr /= 1L<<16;
  1347. fr += (ieeep->h & (1L<<20)-1L) | (1L<<20);
  1348. fr /= 1L<<21;
  1349. exp = (ieeep->h>>20) & ((1L<<11)-1L);
  1350. exp -= (1L<<10) - 2L;
  1351. return ldexp(fr, exp);
  1352. }