obj.c 28 KB

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