obj.c 21 KB

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