obj.c 22 KB

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