obj.c 28 KB

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