obj.c 26 KB

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