obj.c 23 KB

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