obj.c 22 KB

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