obj.c 27 KB

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