obj.c 27 KB

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