obj.c 24 KB

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