obj.c 27 KB

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