obj.c 25 KB

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