obj.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266
  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\n", cputime(), library[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) {
  585. stop = memchr(&bloc[3], 0, bsize-&bloc[3]);
  586. if(stop == 0){
  587. bsize = readsome(f, buf.xbuf, bloc, bsize, c);
  588. if(bsize == 0)
  589. goto eof;
  590. bloc = buf.xbuf;
  591. stop = memchr(&bloc[3], 0, bsize-&bloc[3]);
  592. if(stop == 0){
  593. fprint(2, "%s: name too long\n", pn);
  594. errorexit();
  595. }
  596. }
  597. v = bloc[1]; /* type */
  598. o = bloc[2]; /* sym */
  599. bloc += 3;
  600. c -= 3;
  601. r = 0;
  602. if(v == D_STATIC)
  603. r = version;
  604. s = lookup((char*)bloc, r);
  605. c -= &stop[1] - bloc;
  606. bloc = stop + 1;
  607. if(debug['W'])
  608. print(" ANAME %s\n", s->name);
  609. h[o] = s;
  610. if((v == D_EXTERN || v == D_STATIC) && s->type == 0)
  611. s->type = SXREF;
  612. if(v == D_FILE) {
  613. if(s->type != SFILE) {
  614. histgen++;
  615. s->type = SFILE;
  616. s->value = histgen;
  617. }
  618. if(histfrogp < MAXHIST) {
  619. histfrog[histfrogp] = s;
  620. histfrogp++;
  621. } else
  622. collapsefrog(s);
  623. }
  624. goto loop;
  625. }
  626. if(nhunk < sizeof(Prog))
  627. gethunk();
  628. p = (Prog*)hunk;
  629. nhunk -= sizeof(Prog);
  630. hunk += sizeof(Prog);
  631. p->as = o;
  632. p->reg = bloc[1] & 0x7f;
  633. if(bloc[1] & 0x80)
  634. p->mark = NOSCHED;
  635. p->line = bloc[2] | (bloc[3]<<8) | (bloc[4]<<16) | (bloc[5]<<24);
  636. r = zaddr(bloc+6, &p->from, h) + 6;
  637. r += zaddr(bloc+r, &p->to, h);
  638. bloc += r;
  639. c -= r;
  640. if(p->reg < 0 || p->reg > NREG)
  641. diag("register out of range %d", p->reg);
  642. p->link = P;
  643. p->cond = P;
  644. if(debug['W'])
  645. print("%P\n", p);
  646. switch(o) {
  647. case AHISTORY:
  648. if(p->to.offset == -1) {
  649. addlib(pn);
  650. histfrogp = 0;
  651. goto loop;
  652. }
  653. addhist(p->line, D_FILE); /* 'z' */
  654. if(p->to.offset)
  655. addhist(p->to.offset, D_FILE1); /* 'Z' */
  656. histfrogp = 0;
  657. goto loop;
  658. case AEND:
  659. histtoauto();
  660. if(curtext != P)
  661. curtext->to.autom = curauto;
  662. curauto = 0;
  663. curtext = P;
  664. if(c)
  665. goto newloop;
  666. return;
  667. case AGLOBL:
  668. s = p->from.sym;
  669. if(s == S) {
  670. diag("GLOBL must have a name\n%P", p);
  671. errorexit();
  672. }
  673. if(s->type == 0 || s->type == SXREF) {
  674. s->type = SBSS;
  675. s->value = 0;
  676. }
  677. if(s->type != SBSS) {
  678. diag("redefinition: %s\n%P", s->name, p);
  679. s->type = SBSS;
  680. s->value = 0;
  681. }
  682. if(p->to.offset > s->value)
  683. s->value = p->to.offset;
  684. break;
  685. case ADYNT:
  686. if(p->to.sym == S) {
  687. diag("DYNT without a sym\n%P", p);
  688. break;
  689. }
  690. di = p->to.sym;
  691. p->reg = 4;
  692. if(di->type == SXREF) {
  693. if(debug['z'])
  694. Bprint(&bso, "%P set to %d\n", p, dtype);
  695. di->type = SCONST;
  696. di->value = dtype;
  697. dtype += 4;
  698. }
  699. if(p->from.sym == S)
  700. break;
  701. p->from.offset = di->value;
  702. p->from.sym->type = SDATA;
  703. if(curtext == P) {
  704. diag("DYNT not in text: %P", p);
  705. break;
  706. }
  707. p->to.sym = curtext->from.sym;
  708. p->to.type = D_CONST;
  709. p->link = datap;
  710. datap = p;
  711. break;
  712. case AINIT:
  713. if(p->from.sym == S) {
  714. diag("INIT without a sym\n%P", p);
  715. break;
  716. }
  717. if(di == S) {
  718. diag("INIT without previous DYNT\n%P", p);
  719. break;
  720. }
  721. p->from.offset = di->value;
  722. p->from.sym->type = SDATA;
  723. p->link = datap;
  724. datap = p;
  725. break;
  726. case ADATA:
  727. p->link = datap;
  728. datap = p;
  729. break;
  730. case AGOK:
  731. diag("unknown opcode\n%P", p);
  732. p->pc = pc;
  733. pc++;
  734. break;
  735. case ATEXT:
  736. if(curtext != P) {
  737. histtoauto();
  738. curtext->to.autom = curauto;
  739. curauto = 0;
  740. }
  741. curtext = p;
  742. autosize = (p->to.offset+3L) & ~3L;
  743. p->to.offset = autosize;
  744. autosize += 4;
  745. s = p->from.sym;
  746. if(s == S) {
  747. diag("TEXT must have a name\n%P", p);
  748. errorexit();
  749. }
  750. if(s->type != 0 && s->type != SXREF) {
  751. if(p->reg & DUPOK) {
  752. skip = 1;
  753. goto casedef;
  754. }
  755. diag("redefinition: %s\n%P", s->name, p);
  756. }
  757. s->type = STEXT;
  758. s->value = pc;
  759. if(textp != P) {
  760. for(t = textp; t->cond != P; t = t->cond)
  761. ;
  762. t->cond = p;
  763. } else
  764. textp = p;
  765. lastp->link = p;
  766. lastp = p;
  767. p->pc = pc;
  768. pc++;
  769. break;
  770. case AFMOVF:
  771. if(skip)
  772. goto casedef;
  773. if(p->from.type == D_FCONST) {
  774. /* size sb 9 max */
  775. sprint(literal, "$%lux", ieeedtof(&p->from.ieee));
  776. s = lookup(literal, 0);
  777. if(s->type == 0) {
  778. s->type = SBSS;
  779. s->value = 4;
  780. t = prg();
  781. t->as = ADATA;
  782. t->line = p->line;
  783. t->from.type = D_OREG;
  784. t->from.sym = s;
  785. t->from.name = D_EXTERN;
  786. t->reg = 4;
  787. t->to = p->from;
  788. t->link = datap;
  789. datap = t;
  790. }
  791. p->from.type = D_OREG;
  792. p->from.sym = s;
  793. p->from.name = D_EXTERN;
  794. p->from.offset = 0;
  795. }
  796. goto casedef;
  797. case AFMOVD:
  798. if(skip)
  799. goto casedef;
  800. if(p->from.type == D_FCONST) {
  801. /* size sb 18 max */
  802. sprint(literal, "$%lux.%lux",
  803. p->from.ieee.l, p->from.ieee.h);
  804. s = lookup(literal, 0);
  805. if(s->type == 0) {
  806. s->type = SBSS;
  807. s->value = 8;
  808. t = prg();
  809. t->as = ADATA;
  810. t->line = p->line;
  811. t->from.type = D_OREG;
  812. t->from.sym = s;
  813. t->from.name = D_EXTERN;
  814. t->reg = 8;
  815. t->to = p->from;
  816. t->link = datap;
  817. datap = t;
  818. }
  819. p->from.type = D_OREG;
  820. p->from.sym = s;
  821. p->from.name = D_EXTERN;
  822. p->from.offset = 0;
  823. }
  824. goto casedef;
  825. default:
  826. casedef:
  827. if(skip)
  828. nopout(p);
  829. if(p->to.type == D_BRANCH)
  830. p->to.offset += ipc;
  831. lastp->link = p;
  832. lastp = p;
  833. p->pc = pc;
  834. pc++;
  835. break;
  836. }
  837. goto loop;
  838. eof:
  839. diag("truncated object file: %s", pn);
  840. }
  841. Sym*
  842. lookup(char *symb, int v)
  843. {
  844. Sym *s;
  845. char *p;
  846. long h;
  847. int c, l;
  848. h = v;
  849. for(p=symb; c = *p; p++)
  850. h = h+h+h + c;
  851. l = (p - symb) + 1;
  852. if(h < 0)
  853. h = ~h;
  854. h %= NHASH;
  855. for(s = hash[h]; s != S; s = s->link)
  856. if(s->version == v)
  857. if(memcmp(s->name, symb, l) == 0)
  858. return s;
  859. while(nhunk < sizeof(Sym))
  860. gethunk();
  861. s = (Sym*)hunk;
  862. nhunk -= sizeof(Sym);
  863. hunk += sizeof(Sym);
  864. s->name = malloc(l + 1);
  865. memmove(s->name, symb, l);
  866. s->link = hash[h];
  867. s->type = 0;
  868. s->version = v;
  869. s->value = 0;
  870. hash[h] = s;
  871. return s;
  872. }
  873. Prog*
  874. prg(void)
  875. {
  876. Prog *p;
  877. int n;
  878. n = (sizeof(Prog) + 3) & ~3;
  879. while(nhunk < n)
  880. gethunk();
  881. p = (Prog*)hunk;
  882. nhunk -= n;
  883. hunk += n;
  884. *p = zprg;
  885. return p;
  886. }
  887. void
  888. gethunk(void)
  889. {
  890. char *h;
  891. h = mysbrk((int)NHUNK);
  892. if(h == (char *)-1) {
  893. diag("out of memory");
  894. errorexit();
  895. }
  896. hunk = h;
  897. nhunk = NHUNK;
  898. tothunk += NHUNK;
  899. }
  900. void
  901. doprof1(void)
  902. {
  903. Sym *s;
  904. long n;
  905. Prog *p, *q;
  906. if(debug['v'])
  907. Bprint(&bso, "%5.2f profile 1\n", cputime());
  908. Bflush(&bso);
  909. s = lookup("__mcount", 0);
  910. n = 1;
  911. for(p = firstp->link; p != P; p = p->link) {
  912. if(p->as == ATEXT) {
  913. q = prg();
  914. q->line = p->line;
  915. q->link = datap;
  916. datap = q;
  917. q->as = ADATA;
  918. q->from.type = D_OREG;
  919. q->from.name = D_EXTERN;
  920. q->from.offset = n*4;
  921. q->from.sym = s;
  922. q->reg = 4;
  923. q->to = p->from;
  924. q->to.type = D_CONST;
  925. q = prg();
  926. q->line = p->line;
  927. q->pc = p->pc;
  928. q->link = p->link;
  929. p->link = q;
  930. p = q;
  931. p->as = AMOVW;
  932. p->from.type = D_OREG;
  933. p->from.name = D_EXTERN;
  934. p->from.sym = s;
  935. p->from.offset = n*4 + 4;
  936. p->to.type = D_REG;
  937. p->to.reg = REGTMP;
  938. q = prg();
  939. q->line = p->line;
  940. q->pc = p->pc;
  941. q->link = p->link;
  942. p->link = q;
  943. p = q;
  944. p->as = AADD;
  945. p->from.type = D_CONST;
  946. p->from.offset = 1;
  947. p->to.type = D_REG;
  948. p->to.reg = REGTMP;
  949. q = prg();
  950. q->line = p->line;
  951. q->pc = p->pc;
  952. q->link = p->link;
  953. p->link = q;
  954. p = q;
  955. p->as = AMOVW;
  956. p->from.type = D_REG;
  957. p->from.reg = REGTMP;
  958. p->to.type = D_OREG;
  959. p->to.name = D_EXTERN;
  960. p->to.sym = s;
  961. p->to.offset = n*4 + 4;
  962. n += 2;
  963. continue;
  964. }
  965. }
  966. q = prg();
  967. q->line = 0;
  968. q->link = datap;
  969. datap = q;
  970. q->as = ADATA;
  971. q->from.type = D_OREG;
  972. q->from.name = D_EXTERN;
  973. q->from.sym = s;
  974. q->reg = 4;
  975. q->to.type = D_CONST;
  976. q->to.offset = n;
  977. s->type = SBSS;
  978. s->value = n*4;
  979. }
  980. void
  981. doprof2(void)
  982. {
  983. Sym *s2, *s4;
  984. Prog *p, *q, *ps2, *ps4;
  985. if(debug['v'])
  986. Bprint(&bso, "%5.2f profile 2\n", cputime());
  987. Bflush(&bso);
  988. s2 = lookup("_profin", 0);
  989. s4 = lookup("_profout", 0);
  990. if(s2->type != STEXT || s4->type != STEXT) {
  991. diag("_profin/_profout not defined");
  992. return;
  993. }
  994. ps2 = P;
  995. ps4 = P;
  996. for(p = firstp; p != P; p = p->link) {
  997. if(p->as == ATEXT) {
  998. if(p->from.sym == s2) {
  999. p->reg = 1;
  1000. ps2 = p;
  1001. }
  1002. if(p->from.sym == s4) {
  1003. p->reg = 1;
  1004. ps4 = p;
  1005. }
  1006. }
  1007. }
  1008. for(p = firstp; p != P; p = p->link) {
  1009. if(p->as == ATEXT) {
  1010. curtext = p;
  1011. if(p->reg & NOPROF) { /* dont profile */
  1012. for(;;) {
  1013. q = p->link;
  1014. if(q == P)
  1015. break;
  1016. if(q->as == ATEXT)
  1017. break;
  1018. p = q;
  1019. }
  1020. continue;
  1021. }
  1022. /*
  1023. * JMPL profin
  1024. */
  1025. q = prg();
  1026. q->line = p->line;
  1027. q->pc = p->pc;
  1028. q->link = p->link;
  1029. p->link = q;
  1030. p = q;
  1031. p->as = AJMPL;
  1032. p->to.type = D_BRANCH;
  1033. p->cond = ps2;
  1034. p->to.sym = s2;
  1035. continue;
  1036. }
  1037. if(p->as == ARETURN) {
  1038. /*
  1039. * RETURN
  1040. */
  1041. q = prg();
  1042. q->as = ARETURN;
  1043. q->from = p->from;
  1044. q->to = p->to;
  1045. q->link = p->link;
  1046. p->link = q;
  1047. /*
  1048. * JMPL profout
  1049. */
  1050. p->as = AJMPL;
  1051. p->from = zprg.from;
  1052. p->to = zprg.to;
  1053. p->to.type = D_BRANCH;
  1054. p->cond = ps4;
  1055. p->to.sym = s4;
  1056. p = q;
  1057. continue;
  1058. }
  1059. }
  1060. }
  1061. void
  1062. nuxiinit(void)
  1063. {
  1064. int i, c;
  1065. for(i=0; i<4; i++) {
  1066. c = find1(0x01020304L, i+1);
  1067. if(i >= 2)
  1068. inuxi2[i-2] = c;
  1069. if(i >= 3)
  1070. inuxi1[i-3] = c;
  1071. inuxi4[i] = c;
  1072. fnuxi8[i] = c+4;
  1073. fnuxi8[i+4] = c;
  1074. }
  1075. if(debug['v']) {
  1076. Bprint(&bso, "inuxi = ");
  1077. for(i=0; i<1; i++)
  1078. Bprint(&bso, "%d", inuxi1[i]);
  1079. Bprint(&bso, " ");
  1080. for(i=0; i<2; i++)
  1081. Bprint(&bso, "%d", inuxi2[i]);
  1082. Bprint(&bso, " ");
  1083. for(i=0; i<4; i++)
  1084. Bprint(&bso, "%d", inuxi4[i]);
  1085. Bprint(&bso, "\nfnuxi = ");
  1086. for(i=0; i<8; i++)
  1087. Bprint(&bso, "%d", fnuxi8[i]);
  1088. Bprint(&bso, "\n");
  1089. }
  1090. Bflush(&bso);
  1091. }
  1092. int
  1093. find1(long l, int c)
  1094. {
  1095. char *p;
  1096. int i;
  1097. p = (char*)&l;
  1098. for(i=0; i<4; i++)
  1099. if(*p++ == c)
  1100. return i;
  1101. return 0;
  1102. }
  1103. long
  1104. ieeedtof(Ieee *ieeep)
  1105. {
  1106. int exp;
  1107. long v;
  1108. if(ieeep->h == 0)
  1109. return 0;
  1110. exp = (ieeep->h>>20) & ((1L<<11)-1L);
  1111. exp -= (1L<<10) - 2L;
  1112. v = (ieeep->h & 0xfffffL) << 3;
  1113. v |= (ieeep->l >> 29) & 0x7L;
  1114. if((ieeep->l >> 28) & 1) {
  1115. v++;
  1116. if(v & 0x800000L) {
  1117. v = (v & 0x7fffffL) >> 1;
  1118. exp++;
  1119. }
  1120. }
  1121. if(exp <= -126 || exp >= 130)
  1122. diag("double fp to single fp overflow");
  1123. v |= ((exp + 126) & 0xffL) << 23;
  1124. v |= ieeep->h & 0x80000000L;
  1125. return v;
  1126. }
  1127. double
  1128. ieeedtod(Ieee *ieeep)
  1129. {
  1130. Ieee e;
  1131. double fr;
  1132. int exp;
  1133. if(ieeep->h & (1L<<31)) {
  1134. e.h = ieeep->h & ~(1L<<31);
  1135. e.l = ieeep->l;
  1136. return -ieeedtod(&e);
  1137. }
  1138. if(ieeep->l == 0 && ieeep->h == 0)
  1139. return 0;
  1140. fr = ieeep->l & ((1L<<16)-1L);
  1141. fr /= 1L<<16;
  1142. fr += (ieeep->l>>16) & ((1L<<16)-1L);
  1143. fr /= 1L<<16;
  1144. fr += (ieeep->h & (1L<<20)-1L) | (1L<<20);
  1145. fr /= 1L<<21;
  1146. exp = (ieeep->h>>20) & ((1L<<11)-1L);
  1147. exp -= (1L<<10) - 2L;
  1148. return ldexp(fr, exp);
  1149. }