obj.c 25 KB

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