obj.c 28 KB

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