obj.c 29 KB

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