asm.c 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387
  1. #include "l.h"
  2. long OFFSET;
  3. /*
  4. long BADOFFSET = -1;
  5. if(OFFSET <= BADOFFSET && OFFSET+4 > BADOFFSET)\
  6. abort();\
  7. OFFSET += 4;\
  8. if(OFFSET == BADOFFSET)\
  9. abort();\
  10. OFFSET++;\
  11. */
  12. #define LPUT(c)\
  13. {\
  14. cbp[0] = (c)>>24;\
  15. cbp[1] = (c)>>16;\
  16. cbp[2] = (c)>>8;\
  17. cbp[3] = (c);\
  18. cbp += 4;\
  19. cbc -= 4;\
  20. if(cbc <= 0)\
  21. cflush();\
  22. }
  23. #define CPUT(c)\
  24. {\
  25. cbp[0] = (c);\
  26. cbp++;\
  27. cbc--;\
  28. if(cbc <= 0)\
  29. cflush();\
  30. }
  31. long
  32. entryvalue(void)
  33. {
  34. char *a;
  35. Sym *s;
  36. a = INITENTRY;
  37. if(*a >= '0' && *a <= '9')
  38. return atolwhex(a);
  39. s = lookup(a, 0);
  40. if(s->type == 0)
  41. return INITTEXT;
  42. if(s->type != STEXT && s->type != SLEAF)
  43. diag("entry not text: %s", s->name);
  44. return s->value;
  45. }
  46. void
  47. asmb(void)
  48. {
  49. Prog *p;
  50. long t, etext;
  51. Optab *o;
  52. if(debug['v'])
  53. Bprint(&bso, "%5.2f asm\n", cputime());
  54. Bflush(&bso);
  55. OFFSET = HEADR;
  56. seek(cout, OFFSET, 0);
  57. pc = INITTEXT;
  58. for(p = firstp; p != P; p = p->link) {
  59. if(p->as == ATEXT) {
  60. curtext = p;
  61. autosize = p->to.offset + 4;
  62. }
  63. if(p->pc != pc) {
  64. diag("phase error %lux sb %lux\n",
  65. p->pc, pc);
  66. if(!debug['a'])
  67. prasm(curp);
  68. pc = p->pc;
  69. }
  70. curp = p;
  71. o = oplook(p); /* could probably avoid this call */
  72. if(asmout(p, o, 0)) {
  73. p = p->link;
  74. pc += 4;
  75. }
  76. pc += o->size;
  77. }
  78. if(debug['a'])
  79. Bprint(&bso, "\n");
  80. Bflush(&bso);
  81. cflush();
  82. etext = INITTEXT + textsize;
  83. for(t = pc; t < etext; t += sizeof(buf)-100) {
  84. if(etext-t > sizeof(buf)-100)
  85. datblk(t, sizeof(buf)-100, 1);
  86. else
  87. datblk(t, etext-t, 1);
  88. }
  89. Bflush(&bso);
  90. cflush();
  91. curtext = P;
  92. switch(HEADTYPE) {
  93. case 0:
  94. case 4:
  95. OFFSET = rnd(HEADR+textsize, 4096);
  96. seek(cout, OFFSET, 0);
  97. break;
  98. case 1:
  99. case 2:
  100. case 3:
  101. case 5:
  102. OFFSET = HEADR+textsize;
  103. seek(cout, OFFSET, 0);
  104. break;
  105. }
  106. for(t = 0; t < datsize; t += sizeof(buf)-100) {
  107. if(datsize-t > sizeof(buf)-100)
  108. datblk(t, sizeof(buf)-100, 0);
  109. else
  110. datblk(t, datsize-t, 0);
  111. }
  112. symsize = 0;
  113. lcsize = 0;
  114. if(!debug['s']) {
  115. if(debug['v'])
  116. Bprint(&bso, "%5.2f sym\n", cputime());
  117. Bflush(&bso);
  118. switch(HEADTYPE) {
  119. case 0:
  120. case 4:
  121. OFFSET = rnd(HEADR+textsize, 4096)+datsize;
  122. seek(cout, OFFSET, 0);
  123. break;
  124. case 3:
  125. case 2:
  126. case 1:
  127. case 5:
  128. OFFSET = HEADR+textsize+datsize;
  129. seek(cout, OFFSET, 0);
  130. break;
  131. }
  132. if(!debug['s'])
  133. asmsym();
  134. if(debug['v'])
  135. Bprint(&bso, "%5.2f pc\n", cputime());
  136. Bflush(&bso);
  137. if(!debug['s'])
  138. asmlc();
  139. cflush();
  140. }
  141. if(debug['v'])
  142. Bprint(&bso, "%5.2f header\n", cputime());
  143. Bflush(&bso);
  144. OFFSET = 0;
  145. seek(cout, OFFSET, 0);
  146. switch(HEADTYPE) {
  147. case 0:
  148. lput(0x160L<<16); /* magic and sections */
  149. lput(0L); /* time and date */
  150. lput(rnd(HEADR+textsize, 4096)+datsize);
  151. lput(symsize); /* nsyms */
  152. lput((0x38L<<16)|7L); /* size of optional hdr and flags */
  153. lput((0413<<16)|0437L); /* magic and version */
  154. lput(rnd(HEADR+textsize, 4096)); /* sizes */
  155. lput(datsize);
  156. lput(bsssize);
  157. lput(entryvalue()); /* va of entry */
  158. lput(INITTEXT-HEADR); /* va of base of text */
  159. lput(INITDAT); /* va of base of data */
  160. lput(INITDAT+datsize); /* va of base of bss */
  161. lput(~0L); /* gp reg mask */
  162. lput(0L);
  163. lput(0L);
  164. lput(0L);
  165. lput(0L);
  166. lput(~0L); /* gp value ?? */
  167. break;
  168. case 1:
  169. lput(0x160L<<16); /* magic and sections */
  170. lput(0L); /* time and date */
  171. lput(HEADR+textsize+datsize);
  172. lput(symsize); /* nsyms */
  173. lput((0x38L<<16)|7L); /* size of optional hdr and flags */
  174. lput((0407<<16)|0437L); /* magic and version */
  175. lput(textsize); /* sizes */
  176. lput(datsize);
  177. lput(bsssize);
  178. lput(entryvalue()); /* va of entry */
  179. lput(INITTEXT); /* va of base of text */
  180. lput(INITDAT); /* va of base of data */
  181. lput(INITDAT+datsize); /* va of base of bss */
  182. lput(~0L); /* gp reg mask */
  183. lput(lcsize);
  184. lput(0L);
  185. lput(0L);
  186. lput(0L);
  187. lput(~0L); /* gp value ?? */
  188. lput(0L); /* complete mystery */
  189. break;
  190. case 2:
  191. lput(0x407); /* magic */
  192. lput(textsize); /* sizes */
  193. lput(datsize);
  194. lput(bsssize);
  195. lput(symsize); /* nsyms */
  196. lput(entryvalue()); /* va of entry */
  197. lput(0L);
  198. lput(lcsize);
  199. break;
  200. case 3:
  201. lput((0x160L<<16)|3L); /* magic and sections */
  202. lput(time(0)); /* time and date */
  203. lput(HEADR+textsize+datsize);
  204. lput(symsize); /* nsyms */
  205. lput((0x38L<<16)|7L); /* size of optional hdr and flags */
  206. lput((0407<<16)|0437L); /* magic and version */
  207. lput(textsize); /* sizes */
  208. lput(datsize);
  209. lput(bsssize);
  210. lput(entryvalue()); /* va of entry */
  211. lput(INITTEXT); /* va of base of text */
  212. lput(INITDAT); /* va of base of data */
  213. lput(INITDAT+datsize); /* va of base of bss */
  214. lput(~0L); /* gp reg mask */
  215. lput(lcsize);
  216. lput(0L);
  217. lput(0L);
  218. lput(0L);
  219. lput(~0L); /* gp value ?? */
  220. strnput(".text", 8); /* text segment */
  221. lput(INITTEXT); /* address */
  222. lput(INITTEXT);
  223. lput(textsize);
  224. lput(HEADR);
  225. lput(0L);
  226. lput(HEADR+textsize+datsize+symsize);
  227. lput(lcsize); /* line number size */
  228. lput(0x20L); /* flags */
  229. strnput(".data", 8); /* data segment */
  230. lput(INITDAT); /* address */
  231. lput(INITDAT);
  232. lput(datsize);
  233. lput(HEADR+textsize);
  234. lput(0L);
  235. lput(0L);
  236. lput(0L);
  237. lput(0x40L); /* flags */
  238. strnput(".bss", 8); /* bss segment */
  239. lput(INITDAT+datsize); /* address */
  240. lput(INITDAT+datsize);
  241. lput(bsssize);
  242. lput(0L);
  243. lput(0L);
  244. lput(0L);
  245. lput(0L);
  246. lput(0x80L); /* flags */
  247. break;
  248. case 4:
  249. lput((0x160L<<16)|3L); /* magic and sections */
  250. lput(time(0)); /* time and date */
  251. lput(rnd(HEADR+textsize, 4096)+datsize);
  252. lput(symsize); /* nsyms */
  253. lput((0x38L<<16)|7L); /* size of optional hdr and flags */
  254. lput((0413<<16)|01012L); /* magic and version */
  255. lput(textsize); /* sizes */
  256. lput(datsize);
  257. lput(bsssize);
  258. lput(entryvalue()); /* va of entry */
  259. lput(INITTEXT); /* va of base of text */
  260. lput(INITDAT); /* va of base of data */
  261. lput(INITDAT+datsize); /* va of base of bss */
  262. lput(~0L); /* gp reg mask */
  263. lput(lcsize);
  264. lput(0L);
  265. lput(0L);
  266. lput(0L);
  267. lput(~0L); /* gp value ?? */
  268. strnput(".text", 8); /* text segment */
  269. lput(INITTEXT); /* address */
  270. lput(INITTEXT);
  271. lput(textsize);
  272. lput(HEADR);
  273. lput(0L);
  274. lput(HEADR+textsize+datsize+symsize);
  275. lput(lcsize); /* line number size */
  276. lput(0x20L); /* flags */
  277. strnput(".data", 8); /* data segment */
  278. lput(INITDAT); /* address */
  279. lput(INITDAT);
  280. lput(datsize);
  281. lput(rnd(HEADR+textsize, 4096)); /* sizes */
  282. lput(0L);
  283. lput(0L);
  284. lput(0L);
  285. lput(0x40L); /* flags */
  286. strnput(".bss", 8); /* bss segment */
  287. lput(INITDAT+datsize); /* address */
  288. lput(INITDAT+datsize);
  289. lput(bsssize);
  290. lput(0L);
  291. lput(0L);
  292. lput(0L);
  293. lput(0L);
  294. lput(0x80L); /* flags */
  295. break;
  296. case 5:
  297. strnput("\177ELF", 4); /* e_ident */
  298. CPUT(1); /* class = 32 bit */
  299. CPUT(2); /* data = MSB */
  300. CPUT(1); /* version = CURRENT */
  301. strnput("", 9);
  302. lput((2L<<16)|8L); /* type = EXEC; machine = MIPS */
  303. lput(1L); /* version = CURRENT */
  304. lput(entryvalue()); /* entry vaddr */
  305. lput(52L); /* offset to first phdr */
  306. lput(0L); /* offset to first shdr */
  307. lput(0L); /* flags = MIPS */
  308. lput((52L<<16)|32L); /* Ehdr & Phdr sizes*/
  309. lput((3L<<16)|0L); /* # Phdrs & Shdr size */
  310. lput((0L<<16)|0L); /* # Shdrs & shdr string size */
  311. lput(1L); /* text - type = PT_LOAD */
  312. lput(0L); /* file offset */
  313. lput(INITTEXT-HEADR); /* vaddr */
  314. lput(INITTEXT-HEADR); /* paddr */
  315. lput(HEADR+textsize); /* file size */
  316. lput(HEADR+textsize); /* memory size */
  317. lput(0x05L); /* protections = RX */
  318. lput(0x10000L); /* alignment code?? */
  319. lput(1L); /* data - type = PT_LOAD */
  320. lput(HEADR+textsize); /* file offset */
  321. lput(INITDAT); /* vaddr */
  322. lput(INITDAT); /* paddr */
  323. lput(datsize); /* file size */
  324. lput(datsize+bsssize); /* memory size */
  325. lput(0x06L); /* protections = RW */
  326. lput(0x10000L); /* alignment code?? */
  327. lput(0L); /* data - type = PT_NULL */
  328. lput(HEADR+textsize+datsize); /* file offset */
  329. lput(0L);
  330. lput(0L);
  331. lput(symsize); /* symbol table size */
  332. lput(lcsize); /* line number size */
  333. lput(0x04L); /* protections = R */
  334. lput(0x04L); /* alignment code?? */
  335. }
  336. cflush();
  337. }
  338. void
  339. strnput(char *s, int n)
  340. {
  341. for(; *s; s++){
  342. CPUT(*s);
  343. n--;
  344. }
  345. for(; n > 0; n--)
  346. CPUT(0);
  347. }
  348. void
  349. lput(long l)
  350. {
  351. LPUT(l);
  352. }
  353. void
  354. cflush(void)
  355. {
  356. int n;
  357. n = sizeof(buf.cbuf) - cbc;
  358. if(n)
  359. write(cout, buf.cbuf, n);
  360. cbp = buf.cbuf;
  361. cbc = sizeof(buf.cbuf);
  362. }
  363. void
  364. nopstat(char *f, Count *c)
  365. {
  366. if(c->outof)
  367. Bprint(&bso, "%s delay %ld/%ld (%.2f)\n", f,
  368. c->outof - c->count, c->outof,
  369. (double)(c->outof - c->count)/c->outof);
  370. }
  371. void
  372. asmsym(void)
  373. {
  374. Prog *p;
  375. Auto *a;
  376. Sym *s;
  377. int h;
  378. s = lookup("etext", 0);
  379. if(s->type == STEXT)
  380. putsymb(s->name, 'T', s->value, s->version);
  381. for(h=0; h<NHASH; h++)
  382. for(s=hash[h]; s!=S; s=s->link)
  383. switch(s->type) {
  384. case SCONST:
  385. putsymb(s->name, 'D', s->value, s->version);
  386. continue;
  387. case SSTRING:
  388. putsymb(s->name, 'T', s->value, s->version);
  389. continue;
  390. case SDATA:
  391. putsymb(s->name, 'D', s->value+INITDAT, s->version);
  392. continue;
  393. case SBSS:
  394. putsymb(s->name, 'B', s->value+INITDAT, s->version);
  395. continue;
  396. case SFILE:
  397. putsymb(s->name, 'f', s->value, s->version);
  398. continue;
  399. }
  400. for(p=textp; p!=P; p=p->cond) {
  401. s = p->from.sym;
  402. if(s->type != STEXT && s->type != SLEAF)
  403. continue;
  404. /* filenames first */
  405. for(a=p->to.autom; a; a=a->link)
  406. if(a->type == D_FILE)
  407. putsymb(a->asym->name, 'z', a->aoffset, 0);
  408. else
  409. if(a->type == D_FILE1)
  410. putsymb(a->asym->name, 'Z', a->aoffset, 0);
  411. if(s->type == STEXT)
  412. putsymb(s->name, 'T', s->value, s->version);
  413. else
  414. putsymb(s->name, 'L', s->value, s->version);
  415. /* frame, auto and param after */
  416. putsymb(".frame", 'm', p->to.offset+4, 0);
  417. for(a=p->to.autom; a; a=a->link)
  418. if(a->type == D_AUTO)
  419. putsymb(a->asym->name, 'a', -a->aoffset, 0);
  420. else
  421. if(a->type == D_PARAM)
  422. putsymb(a->asym->name, 'p', a->aoffset, 0);
  423. }
  424. if(debug['v'] || debug['n'])
  425. Bprint(&bso, "symsize = %lud\n", symsize);
  426. Bflush(&bso);
  427. }
  428. void
  429. putsymb(char *s, int t, long v, int ver)
  430. {
  431. int i, f;
  432. if(t == 'f')
  433. s++;
  434. LPUT(v);
  435. if(ver)
  436. t += 'a' - 'A';
  437. CPUT(t+0x80); /* 0x80 is variable length */
  438. if(t == 'Z' || t == 'z') {
  439. CPUT(s[0]);
  440. for(i=1; s[i] != 0 || s[i+1] != 0; i += 2) {
  441. CPUT(s[i]);
  442. CPUT(s[i+1]);
  443. }
  444. CPUT(0);
  445. CPUT(0);
  446. i++;
  447. }
  448. else {
  449. for(i=0; s[i]; i++)
  450. CPUT(s[i]);
  451. CPUT(0);
  452. }
  453. symsize += 4 + 1 + i + 1;
  454. if(debug['n']) {
  455. if(t == 'z' || t == 'Z') {
  456. Bprint(&bso, "%c %.8lux ", t, v);
  457. for(i=1; s[i] != 0 || s[i+1] != 0; i+=2) {
  458. f = ((s[i]&0xff) << 8) | (s[i+1]&0xff);
  459. Bprint(&bso, "/%x", f);
  460. }
  461. Bprint(&bso, "\n");
  462. return;
  463. }
  464. if(ver)
  465. Bprint(&bso, "%c %.8lux %s<%d>\n", t, v, s, ver);
  466. else
  467. Bprint(&bso, "%c %.8lux %s\n", t, v, s);
  468. }
  469. }
  470. #define MINLC 4
  471. void
  472. asmlc(void)
  473. {
  474. long oldpc, oldlc;
  475. Prog *p;
  476. long v, s;
  477. oldpc = INITTEXT;
  478. oldlc = 0;
  479. for(p = firstp; p != P; p = p->link) {
  480. if(p->line == oldlc || p->as == ATEXT || p->as == ANOP) {
  481. if(p->as == ATEXT)
  482. curtext = p;
  483. if(debug['L'])
  484. Bprint(&bso, "%6lux %P\n",
  485. p->pc, p);
  486. continue;
  487. }
  488. if(debug['L'])
  489. Bprint(&bso, "\t\t%6ld", lcsize);
  490. v = (p->pc - oldpc) / MINLC;
  491. while(v) {
  492. s = 127;
  493. if(v < 127)
  494. s = v;
  495. CPUT(s+128); /* 129-255 +pc */
  496. if(debug['L'])
  497. Bprint(&bso, " pc+%ld*%d(%ld)", s, MINLC, s+128);
  498. v -= s;
  499. lcsize++;
  500. }
  501. s = p->line - oldlc;
  502. oldlc = p->line;
  503. oldpc = p->pc + MINLC;
  504. if(s > 64 || s < -64) {
  505. CPUT(0); /* 0 vv +lc */
  506. CPUT(s>>24);
  507. CPUT(s>>16);
  508. CPUT(s>>8);
  509. CPUT(s);
  510. if(debug['L']) {
  511. if(s > 0)
  512. Bprint(&bso, " lc+%ld(%d,%ld)\n",
  513. s, 0, s);
  514. else
  515. Bprint(&bso, " lc%ld(%d,%ld)\n",
  516. s, 0, s);
  517. Bprint(&bso, "%6lux %P\n",
  518. p->pc, p);
  519. }
  520. lcsize += 5;
  521. continue;
  522. }
  523. if(s > 0) {
  524. CPUT(0+s); /* 1-64 +lc */
  525. if(debug['L']) {
  526. Bprint(&bso, " lc+%ld(%ld)\n", s, 0+s);
  527. Bprint(&bso, "%6lux %P\n",
  528. p->pc, p);
  529. }
  530. } else {
  531. CPUT(64-s); /* 65-128 -lc */
  532. if(debug['L']) {
  533. Bprint(&bso, " lc%ld(%ld)\n", s, 64-s);
  534. Bprint(&bso, "%6lux %P\n",
  535. p->pc, p);
  536. }
  537. }
  538. lcsize++;
  539. }
  540. while(lcsize & 1) {
  541. s = 129;
  542. CPUT(s);
  543. lcsize++;
  544. }
  545. if(debug['v'] || debug['L'])
  546. Bprint(&bso, "lcsize = %ld\n", lcsize);
  547. Bflush(&bso);
  548. }
  549. void
  550. datblk(long s, long n, int str)
  551. {
  552. Prog *p;
  553. char *cast;
  554. long l, fl, j, d;
  555. int i, c;
  556. memset(buf.dbuf, 0, n+100);
  557. for(p = datap; p != P; p = p->link) {
  558. curp = p;
  559. if(str != (p->from.sym->type == SSTRING))
  560. continue;
  561. l = p->from.sym->value + p->from.offset - s;
  562. c = p->reg;
  563. i = 0;
  564. if(l < 0) {
  565. if(l+c <= 0)
  566. continue;
  567. while(l < 0) {
  568. l++;
  569. i++;
  570. }
  571. }
  572. if(l >= n)
  573. continue;
  574. if(p->as != AINIT && p->as != ADYNT) {
  575. for(j=l+(c-i)-1; j>=l; j--)
  576. if(buf.dbuf[j]) {
  577. print("%P\n", p);
  578. diag("multiple initialization\n");
  579. break;
  580. }
  581. }
  582. switch(p->to.type) {
  583. default:
  584. diag("unknown mode in initialization\n%P\n", p);
  585. break;
  586. case D_FCONST:
  587. switch(c) {
  588. default:
  589. case 4:
  590. fl = ieeedtof(p->to.ieee);
  591. cast = (char*)&fl;
  592. for(; i<c; i++) {
  593. buf.dbuf[l] = cast[fnuxi8[i+4]];
  594. l++;
  595. }
  596. break;
  597. case 8:
  598. cast = (char*)p->to.ieee;
  599. for(; i<c; i++) {
  600. buf.dbuf[l] = cast[fnuxi8[i]];
  601. l++;
  602. }
  603. break;
  604. }
  605. break;
  606. case D_SCONST:
  607. for(; i<c; i++) {
  608. buf.dbuf[l] = p->to.sval[i];
  609. l++;
  610. }
  611. break;
  612. case D_CONST:
  613. d = p->to.offset;
  614. if(p->to.sym) {
  615. switch(p->to.sym->type) {
  616. case STEXT:
  617. case SLEAF:
  618. case SSTRING:
  619. d += p->to.sym->value;
  620. break;
  621. case SDATA:
  622. case SBSS:
  623. d += p->to.sym->value + INITDAT;
  624. break;
  625. }
  626. }
  627. cast = (char*)&d;
  628. switch(c) {
  629. default:
  630. diag("bad nuxi %d %d\n%P\n", c, i, curp);
  631. break;
  632. case 1:
  633. for(; i<c; i++) {
  634. buf.dbuf[l] = cast[inuxi1[i]];
  635. l++;
  636. }
  637. break;
  638. case 2:
  639. for(; i<c; i++) {
  640. buf.dbuf[l] = cast[inuxi2[i]];
  641. l++;
  642. }
  643. break;
  644. case 4:
  645. for(; i<c; i++) {
  646. buf.dbuf[l] = cast[inuxi4[i]];
  647. l++;
  648. }
  649. break;
  650. }
  651. break;
  652. }
  653. }
  654. write(cout, buf.dbuf, n);
  655. }
  656. #define OP_RRR(op,r1,r2,r3)\
  657. (op|(((r1)&31L)<<16)|(((r2)&31L)<<21)|(((r3)&31L)<<11))
  658. #define OP_IRR(op,i,r2,r3)\
  659. (op|((i)&0xffffL)|(((r2)&31L)<<21)|(((r3)&31L)<<16))
  660. #define OP_SRR(op,s,r2,r3)\
  661. (op|(((s)&31L)<<6)|(((r2)&31L)<<16)|(((r3)&31L)<<11))
  662. #define OP_FRRR(op,r1,r2,r3)\
  663. (op|(((r1)&31L)<<16)|(((r2)&31L)<<11)|(((r3)&31L)<<6))
  664. #define OP_JMP(op,i)\
  665. ((op)|((i)&0x3ffffffL))
  666. #define OP(x,y)\
  667. (((x)<<3)|((y)<<0))
  668. #define SP(x,y)\
  669. (((x)<<29)|((y)<<26))
  670. #define BCOND(x,y)\
  671. (((x)<<19)|((y)<<16))
  672. #define MMU(x,y)\
  673. (SP(2,0)|(16<<21)|((x)<<3)|((y)<<0))
  674. #define FPF(x,y)\
  675. (SP(2,1)|(16<<21)|((x)<<3)|((y)<<0))
  676. #define FPD(x,y)\
  677. (SP(2,1)|(17<<21)|((x)<<3)|((y)<<0))
  678. #define FPW(x,y)\
  679. (SP(2,1)|(20<<21)|((x)<<3)|((y)<<0))
  680. int
  681. asmout(Prog *p, Optab *o, int aflag)
  682. {
  683. long o1, o2, o3, o4, o5, o6, o7, v;
  684. Prog *ct;
  685. int r, a;
  686. o1 = 0;
  687. o2 = 0;
  688. o3 = 0;
  689. o4 = 0;
  690. o5 = 0;
  691. o6 = 0;
  692. o7 = 0;
  693. switch(o->type) {
  694. default:
  695. diag("unknown type %d\n", o->type);
  696. if(!debug['a'])
  697. prasm(p);
  698. break;
  699. case 0: /* pseudo ops */
  700. if(aflag) {
  701. if(p->link) {
  702. if(p->as == ATEXT) {
  703. ct = curtext;
  704. o2 = autosize;
  705. curtext = p;
  706. autosize = p->to.offset + 4;
  707. o1 = asmout(p->link, oplook(p->link), aflag);
  708. curtext = ct;
  709. autosize = o2;
  710. } else
  711. o1 = asmout(p->link, oplook(p->link), aflag);
  712. }
  713. return o1;
  714. }
  715. break;
  716. case 1: /* mov[v] r1,r2 ==> OR r1,r0,r2 */
  717. o1 = OP_RRR(oprrr(AOR), p->from.reg, REGZERO, p->to.reg);
  718. break;
  719. case 2: /* add/sub r1,[r2],r3 */
  720. r = p->reg;
  721. if(r == NREG)
  722. r = p->to.reg;
  723. o1 = OP_RRR(oprrr(p->as), p->from.reg, r, p->to.reg);
  724. break;
  725. case 3: /* mov $soreg, r ==> or/add $i,o,r */
  726. v = regoff(&p->from);
  727. r = p->from.reg;
  728. if(r == NREG)
  729. r = o->param;
  730. a = AADDU;
  731. if(o->a1 == C_ANDCON)
  732. a = AOR;
  733. o1 = OP_IRR(opirr(a), v, r, p->to.reg);
  734. break;
  735. case 4: /* add $scon,[r1],r2 */
  736. v = regoff(&p->from);
  737. r = p->reg;
  738. if(r == NREG)
  739. r = p->to.reg;
  740. o1 = OP_IRR(opirr(p->as), v, r, p->to.reg);
  741. break;
  742. case 5: /* syscall */
  743. if(aflag)
  744. return 0;
  745. o1 = oprrr(p->as);
  746. break;
  747. case 6: /* beq r1,[r2],sbra */
  748. if(aflag)
  749. return 0;
  750. if(p->cond == P)
  751. v = -4 >> 2;
  752. else
  753. v = (p->cond->pc - pc-4) >> 2;
  754. if(((v << 16) >> 16) != v)
  755. diag("short branch too far: %d\n%P\n", v, p);
  756. o1 = OP_IRR(opirr(p->as), v, p->from.reg, p->reg);
  757. break;
  758. case 7: /* mov r, soreg ==> sw o(r) */
  759. r = p->to.reg;
  760. if(r == NREG)
  761. r = o->param;
  762. v = regoff(&p->to);
  763. o1 = OP_IRR(opirr(p->as), v, r, p->from.reg);
  764. break;
  765. case 8: /* mov soreg, r ==> lw o(r) */
  766. r = p->from.reg;
  767. if(r == NREG)
  768. r = o->param;
  769. v = regoff(&p->from);
  770. o1 = OP_IRR(opirr(p->as+ALAST), v, r, p->to.reg);
  771. break;
  772. case 9: /* asl r1,[r2],r3 */
  773. r = p->reg;
  774. if(r == NREG)
  775. r = p->to.reg;
  776. o1 = OP_RRR(oprrr(p->as), r, p->from.reg, p->to.reg);
  777. break;
  778. case 10: /* add $con,[r1],r2 ==> mov $con,t; add t,[r1],r2 */
  779. v = regoff(&p->from);
  780. r = AOR;
  781. if(v < 0)
  782. r = AADDU;
  783. o1 = OP_IRR(opirr(r), v, 0, REGTMP);
  784. r = p->reg;
  785. if(r == NREG)
  786. r = p->to.reg;
  787. o2 = OP_RRR(oprrr(p->as), REGTMP, r, p->to.reg);
  788. break;
  789. case 11: /* jmp lbra */
  790. if(aflag)
  791. return 0;
  792. if(p->cond == P)
  793. v = p->pc >> 2;
  794. else
  795. v = p->cond->pc >> 2;
  796. o1 = OP_JMP(opirr(p->as), v);
  797. if(!debug['Y'] && p->link && p->cond && isnop(p->link)) {
  798. nop.branch.count--;
  799. nop.branch.outof--;
  800. nop.jump.outof++;
  801. o2 = asmout(p->cond, oplook(p->cond), 1);
  802. if(o2) {
  803. o1 += 1;
  804. if(debug['a'])
  805. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n",
  806. p->pc, o1, o2, p);
  807. LPUT(o1);
  808. LPUT(o2);
  809. return 1;
  810. }
  811. }
  812. break;
  813. case 12: /* movbs r,r */
  814. v = 16;
  815. if(p->as == AMOVB)
  816. v = 24;
  817. o1 = OP_SRR(opirr(ASLL), v, p->from.reg, p->to.reg);
  818. o2 = OP_SRR(opirr(ASRA), v, p->to.reg, p->to.reg);
  819. break;
  820. case 13: /* movbu r,r */
  821. if(p->as == AMOVBU)
  822. o1 = OP_IRR(opirr(AAND), 0xffL, p->from.reg, p->to.reg);
  823. else
  824. o1 = OP_IRR(opirr(AAND), 0xffffL, p->from.reg, p->to.reg);
  825. break;
  826. case 16: /* sll $c,[r1],r2 */
  827. v = regoff(&p->from);
  828. r = p->reg;
  829. if(r == NREG)
  830. r = p->to.reg;
  831. if(v >= 32)
  832. o1 = OP_SRR(opirr(p->as+ALAST), v-32, r, p->to.reg);
  833. else
  834. o1 = OP_SRR(opirr(p->as), v, r, p->to.reg);
  835. break;
  836. case 18: /* jmp [r1],0(r2) */
  837. if(aflag)
  838. return 0;
  839. r = p->reg;
  840. if(r == NREG)
  841. r = o->param;
  842. o1 = OP_RRR(oprrr(p->as), 0, p->to.reg, r);
  843. break;
  844. case 19: /* mov $lcon,r ==> lu+or */
  845. v = regoff(&p->from);
  846. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, p->to.reg);
  847. o2 = OP_IRR(opirr(AOR), v, p->to.reg, p->to.reg);
  848. break;
  849. case 20: /* mov lohi,r */
  850. r = OP(2,0); /* mfhi */
  851. if(p->from.type == D_LO)
  852. r = OP(2,2); /* mflo */
  853. o1 = OP_RRR(r, REGZERO, REGZERO, p->to.reg);
  854. break;
  855. case 21: /* mov r,lohi */
  856. r = OP(2,1); /* mthi */
  857. if(p->to.type == D_LO)
  858. r = OP(2,3); /* mtlo */
  859. o1 = OP_RRR(r, REGZERO, p->from.reg, REGZERO);
  860. break;
  861. case 22: /* mul r1,r2 */
  862. o1 = OP_RRR(oprrr(p->as), p->from.reg, p->reg, REGZERO);
  863. break;
  864. case 23: /* add $lcon,r1,r2 ==> lu+or+add */
  865. v = regoff(&p->from);
  866. if(p->to.reg == REGTMP || p->reg == REGTMP)
  867. diag("cant synthesize large constant\n%P\n", p);
  868. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  869. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  870. r = p->reg;
  871. if(r == NREG)
  872. r = p->to.reg;
  873. o3 = OP_RRR(oprrr(p->as), REGTMP, r, p->to.reg);
  874. break;
  875. case 24: /* mov $ucon,,r ==> lu r */
  876. v = regoff(&p->from);
  877. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, p->to.reg);
  878. break;
  879. case 25: /* add/and $ucon,[r1],r2 ==> lu $con,t; add t,[r1],r2 */
  880. v = regoff(&p->from);
  881. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  882. r = p->reg;
  883. if(r == NREG)
  884. r = p->to.reg;
  885. o2 = OP_RRR(oprrr(p->as), REGTMP, r, p->to.reg);
  886. break;
  887. case 26: /* mov $lsext/auto/oreg,,r2 ==> lu+or+add */
  888. v = regoff(&p->from);
  889. if(p->to.reg == REGTMP)
  890. diag("cant synthesize large constant\n%P\n", p);
  891. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  892. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  893. r = p->from.reg;
  894. if(r == NREG)
  895. r = o->param;
  896. o3 = OP_RRR(oprrr(AADDU), REGTMP, r, p->to.reg);
  897. break;
  898. case 27: /* mov [sl]ext/auto/oreg,fr ==> lwc1 o(r) */
  899. r = p->from.reg;
  900. if(r == NREG)
  901. r = o->param;
  902. v = regoff(&p->from);
  903. switch(o->size) {
  904. case 20:
  905. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  906. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  907. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  908. o4 = OP_IRR(opirr(AMOVF+ALAST), 0, REGTMP, p->to.reg+1);
  909. o5 = OP_IRR(opirr(AMOVF+ALAST), 4, REGTMP, p->to.reg);
  910. break;
  911. case 16:
  912. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  913. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  914. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  915. o4 = OP_IRR(opirr(AMOVF+ALAST), 0, REGTMP, p->to.reg);
  916. break;
  917. case 8:
  918. o1 = OP_IRR(opirr(AMOVF+ALAST), v, r, p->to.reg+1);
  919. o2 = OP_IRR(opirr(AMOVF+ALAST), v+4, r, p->to.reg);
  920. break;
  921. case 4:
  922. o1 = OP_IRR(opirr(AMOVF+ALAST), v, r, p->to.reg);
  923. break;
  924. }
  925. break;
  926. case 28: /* mov fr,[sl]ext/auto/oreg ==> swc1 o(r) */
  927. r = p->to.reg;
  928. if(r == NREG)
  929. r = o->param;
  930. v = regoff(&p->to);
  931. switch(o->size) {
  932. case 20:
  933. if(r == REGTMP)
  934. diag("cant synthesize large constant\n%P\n", p);
  935. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  936. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  937. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  938. o4 = OP_IRR(opirr(AMOVF), 0, REGTMP, p->from.reg+1);
  939. o5 = OP_IRR(opirr(AMOVF), 4, REGTMP, p->from.reg);
  940. break;
  941. case 16:
  942. if(r == REGTMP)
  943. diag("cant synthesize large constant\n%P\n", p);
  944. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  945. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  946. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  947. o4 = OP_IRR(opirr(AMOVF), 0, REGTMP, p->from.reg);
  948. break;
  949. case 8:
  950. o1 = OP_IRR(opirr(AMOVF), v, r, p->from.reg+1);
  951. o2 = OP_IRR(opirr(AMOVF), v+4, r, p->from.reg);
  952. break;
  953. case 4:
  954. o1 = OP_IRR(opirr(AMOVF), v, r, p->from.reg);
  955. break;
  956. }
  957. break;
  958. case 30: /* movw r,fr */
  959. r = SP(2,1)|(4<<21); /* mtc1 */
  960. o1 = OP_RRR(r, p->from.reg, 0, p->to.reg);
  961. break;
  962. case 31: /* movw fr,r */
  963. r = SP(2,1)|(0<<21); /* mfc1 */
  964. o1 = OP_RRR(r, p->to.reg, 0, p->from.reg);
  965. break;
  966. case 32: /* fadd fr1,[fr2],fr3 */
  967. r = p->reg;
  968. if(r == NREG)
  969. o1 = OP_FRRR(oprrr(p->as), p->from.reg, p->to.reg, p->to.reg);
  970. else
  971. o1 = OP_FRRR(oprrr(p->as), p->from.reg, r, p->to.reg);
  972. break;
  973. case 33: /* fabs fr1,fr3 */
  974. o1 = OP_FRRR(oprrr(p->as), 0, p->from.reg, p->to.reg);
  975. break;
  976. case 34: /* mov $con,fr ==> or/add $i,r,r2 */
  977. v = regoff(&p->from);
  978. r = AADDU;
  979. if(o->a1 == C_ANDCON)
  980. r = AOR;
  981. o1 = OP_IRR(opirr(r), v, 0, REGTMP);
  982. o2 = OP_RRR(SP(2,1)|(4<<21), REGTMP, 0, p->to.reg); /* mtc1 */
  983. break;
  984. case 35: /* mov r,lext/luto/oreg ==> sw o(r) */
  985. /*
  986. * the lowbits of the constant cannot
  987. * be moved into the offset of the load
  988. * because the mips 4000 in 64-bit mode
  989. * does a 64-bit add and it will screw up.
  990. */
  991. v = regoff(&p->to);
  992. r = p->to.reg;
  993. if(r == NREG)
  994. r = o->param;
  995. if(r == REGTMP)
  996. diag("cant synthesize large constant\n%P\n", p);
  997. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  998. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  999. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  1000. o4 = OP_IRR(opirr(p->as), 0, REGTMP, p->from.reg);
  1001. break;
  1002. case 36: /* mov lext/lauto/lreg,r ==> lw o(r30) */
  1003. v = regoff(&p->from);
  1004. r = p->from.reg;
  1005. if(r == NREG)
  1006. r = o->param;
  1007. if(r == REGTMP)
  1008. diag("cant synthesize large constant\n%P\n", p);
  1009. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  1010. o2 = OP_IRR(opirr(AOR), v, REGTMP, REGTMP);
  1011. o3 = OP_RRR(oprrr(AADDU), r, REGTMP, REGTMP);
  1012. o4 = OP_IRR(opirr(p->as+ALAST), 0, REGTMP, p->to.reg);
  1013. break;
  1014. case 37: /* movw r,mr */
  1015. r = SP(2,0)|(4<<21); /* mtc0 */
  1016. if(p->as == AMOVV)
  1017. r = SP(2,0)|(5<<21); /* dmtc0 */
  1018. o1 = OP_RRR(r, p->from.reg, 0, p->to.reg);
  1019. break;
  1020. case 38: /* movw mr,r */
  1021. r = SP(2,0)|(0<<21); /* mfc0 */
  1022. if(p->as == AMOVV)
  1023. r = SP(2,0)|(1<<21); /* dmfc0 */
  1024. o1 = OP_RRR(r, p->to.reg, 0, p->from.reg);
  1025. break;
  1026. case 39: /* rfe ==> jmp+rfe */
  1027. if(aflag)
  1028. return 0;
  1029. o1 = OP_RRR(oprrr(AJMP), 0, p->to.reg, REGZERO);
  1030. o2 = oprrr(p->as);
  1031. break;
  1032. case 40: /* word */
  1033. if(aflag)
  1034. return 0;
  1035. o1 = regoff(&p->to);
  1036. break;
  1037. case 41: /* movw r,fcr */
  1038. o1 = OP_RRR(SP(2,1)|(2<<21), REGZERO, 0, p->to.reg); /* mfcc1 */
  1039. o2 = OP_RRR(SP(2,1)|(6<<21), p->from.reg, 0, p->to.reg);/* mtcc1 */
  1040. break;
  1041. case 42: /* movw fcr,r */
  1042. o1 = OP_RRR(SP(2,1)|(2<<21), p->to.reg, 0, p->from.reg);/* mfcc1 */
  1043. break;
  1044. case 45: /* case r */
  1045. if(p->link == P)
  1046. v = p->pc+28;
  1047. else
  1048. v = p->link->pc;
  1049. if(v & (1<<15))
  1050. o1 = OP_IRR(opirr(ALAST), (v>>16)+1, REGZERO, REGTMP);
  1051. else
  1052. o1 = OP_IRR(opirr(ALAST), v>>16, REGZERO, REGTMP);
  1053. o2 = OP_SRR(opirr(ASLL), 2, p->from.reg, p->from.reg);
  1054. o3 = OP_RRR(oprrr(AADD), p->from.reg, REGTMP, REGTMP);
  1055. o4 = OP_IRR(opirr(AMOVW+ALAST), v, REGTMP, REGTMP);
  1056. o5 = OP_RRR(oprrr(ANOR), REGZERO, REGZERO, REGZERO);
  1057. o6 = OP_RRR(oprrr(AJMP), 0, REGTMP, REGZERO);
  1058. o7 = OP_RRR(oprrr(ANOR), REGZERO, REGZERO, REGZERO);
  1059. break;
  1060. case 46: /* bcase $con,lbra */
  1061. if(p->cond == P)
  1062. v = p->pc;
  1063. else
  1064. v = p->cond->pc;
  1065. o1 = v;
  1066. break;
  1067. }
  1068. if(aflag)
  1069. return o1;
  1070. v = p->pc;
  1071. switch(o->size) {
  1072. default:
  1073. if(debug['a'])
  1074. Bprint(&bso, " %.8lux:\t\t%P\n", v, p);
  1075. break;
  1076. case 4:
  1077. if(debug['a'])
  1078. Bprint(&bso, " %.8lux: %.8lux\t%P\n", v, o1, p);
  1079. LPUT(o1);
  1080. break;
  1081. case 8:
  1082. if(debug['a'])
  1083. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n", v, o1, o2, p);
  1084. LPUT(o1);
  1085. LPUT(o2);
  1086. break;
  1087. case 12:
  1088. if(debug['a'])
  1089. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux%P\n", v, o1, o2, o3, p);
  1090. LPUT(o1);
  1091. LPUT(o2);
  1092. LPUT(o3);
  1093. break;
  1094. case 16:
  1095. if(debug['a'])
  1096. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux %.8lux%P\n",
  1097. v, o1, o2, o3, o4, p);
  1098. LPUT(o1);
  1099. LPUT(o2);
  1100. LPUT(o3);
  1101. LPUT(o4);
  1102. break;
  1103. case 20:
  1104. if(debug['a'])
  1105. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux %.8lux %.8lux%P\n",
  1106. v, o1, o2, o3, o4, o5, p);
  1107. LPUT(o1);
  1108. LPUT(o2);
  1109. LPUT(o3);
  1110. LPUT(o4);
  1111. LPUT(o5);
  1112. break;
  1113. case 28:
  1114. if(debug['a'])
  1115. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux %.8lux %.8lux %.8lux %.8lux%P\n",
  1116. v, o1, o2, o3, o4, o5, o6, o7, p);
  1117. LPUT(o1);
  1118. LPUT(o2);
  1119. LPUT(o3);
  1120. LPUT(o4);
  1121. LPUT(o5);
  1122. LPUT(o6);
  1123. LPUT(o7);
  1124. break;
  1125. }
  1126. return 0;
  1127. }
  1128. int
  1129. isnop(Prog *p)
  1130. {
  1131. if(p->as != ANOR)
  1132. return 0;
  1133. if(p->reg != REGZERO && p->reg != NREG)
  1134. return 0;
  1135. if(p->from.type != D_REG || p->from.reg != REGZERO)
  1136. return 0;
  1137. if(p->to.type != D_REG || p->to.reg != REGZERO)
  1138. return 0;
  1139. return 1;
  1140. }
  1141. long
  1142. oprrr(int a)
  1143. {
  1144. switch(a) {
  1145. case AADD: return OP(4,0);
  1146. case AADDU: return OP(4,1);
  1147. case ASGT: return OP(5,2);
  1148. case ASGTU: return OP(5,3);
  1149. case AAND: return OP(4,4);
  1150. case AOR: return OP(4,5);
  1151. case AXOR: return OP(4,6);
  1152. case ASUB: return OP(4,2);
  1153. case ASUBU: return OP(4,3);
  1154. case ANOR: return OP(4,7);
  1155. case ASLL: return OP(0,4);
  1156. case ASRL: return OP(0,6);
  1157. case ASRA: return OP(0,7);
  1158. case AREM:
  1159. case ADIV: return OP(3,2);
  1160. case AREMU:
  1161. case ADIVU: return OP(3,3);
  1162. case AMUL: return OP(3,0);
  1163. case AMULU: return OP(3,1);
  1164. case AJMP: return OP(1,0);
  1165. case AJAL: return OP(1,1);
  1166. case ABREAK: return OP(1,5);
  1167. case ASYSCALL: return OP(1,4);
  1168. case ATLBP: return MMU(1,0);
  1169. case ATLBR: return MMU(0,1);
  1170. case ATLBWI: return MMU(0,2);
  1171. case ATLBWR: return MMU(0,6);
  1172. case ARFE: return MMU(2,0);
  1173. case ADIVF: return FPF(0,3);
  1174. case ADIVD: return FPD(0,3);
  1175. case AMULF: return FPF(0,2);
  1176. case AMULD: return FPD(0,2);
  1177. case ASUBF: return FPF(0,1);
  1178. case ASUBD: return FPD(0,1);
  1179. case AADDF: return FPF(0,0);
  1180. case AADDD: return FPD(0,0);
  1181. case AMOVFW: return FPF(4,4);
  1182. case AMOVDW: return FPD(4,4);
  1183. case AMOVWF: return FPW(4,0);
  1184. case AMOVDF: return FPD(4,0);
  1185. case AMOVWD: return FPW(4,1);
  1186. case AMOVFD: return FPF(4,1);
  1187. case AABSF: return FPF(0,5);
  1188. case AABSD: return FPD(0,5);
  1189. case AMOVF: return FPF(0,6);
  1190. case AMOVD: return FPD(0,6);
  1191. case ANEGF: return FPF(0,7);
  1192. case ANEGD: return FPD(0,7);
  1193. case ACMPEQF: return FPF(6,2);
  1194. case ACMPEQD: return FPD(6,2);
  1195. case ACMPGTF: return FPF(7,4);
  1196. case ACMPGTD: return FPD(7,4);
  1197. case ACMPGEF: return FPF(7,6);
  1198. case ACMPGED: return FPD(7,6);
  1199. case ADIVV: return OP(3,6);
  1200. case ADIVVU: return OP(3,7);
  1201. case AADDV: return OP(5,4);
  1202. case AADDVU: return OP(5,5);
  1203. }
  1204. diag("bad rrr %d\n", a);
  1205. return 0;
  1206. }
  1207. long
  1208. opirr(int a)
  1209. {
  1210. switch(a) {
  1211. case AADD: return SP(1,0);
  1212. case AADDU: return SP(1,1);
  1213. case ASGT: return SP(1,2);
  1214. case ASGTU: return SP(1,3);
  1215. case AAND: return SP(1,4);
  1216. case AOR: return SP(1,5);
  1217. case AXOR: return SP(1,6);
  1218. case ALAST: return SP(1,7);
  1219. case ASLL: return OP(0,0);
  1220. case ASRL: return OP(0,2);
  1221. case ASRA: return OP(0,3);
  1222. case AJMP: return SP(0,2);
  1223. case AJAL: return SP(0,3);
  1224. case ABEQ: return SP(0,4);
  1225. case ABNE: return SP(0,5);
  1226. case ABGEZ: return SP(0,1)|BCOND(0,1);
  1227. case ABGEZAL: return SP(0,1)|BCOND(2,1);
  1228. case ABGTZ: return SP(0,7);
  1229. case ABLEZ: return SP(0,6);
  1230. case ABLTZ: return SP(0,1)|BCOND(0,0);
  1231. case ABLTZAL: return SP(0,1)|BCOND(2,0);
  1232. case ABFPT: return SP(2,1)|(257<<16);
  1233. case ABFPF: return SP(2,1)|(256<<16);
  1234. case AMOVB:
  1235. case AMOVBU: return SP(5,0);
  1236. case AMOVH:
  1237. case AMOVHU: return SP(5,1);
  1238. case AMOVW: return SP(5,3);
  1239. case AMOVV: return SP(7,7);
  1240. case AMOVF: return SP(7,1);
  1241. case AMOVWL: return SP(5,2);
  1242. case AMOVWR: return SP(5,6);
  1243. case AMOVVL: return SP(5,4);
  1244. case AMOVVR: return SP(5,5);
  1245. case ABREAK: return SP(5,7);
  1246. case AMOVWL+ALAST: return SP(4,2);
  1247. case AMOVWR+ALAST: return SP(4,6);
  1248. case AMOVVL+ALAST: return SP(3,2);
  1249. case AMOVVR+ALAST: return SP(3,3);
  1250. case AMOVB+ALAST: return SP(4,0);
  1251. case AMOVBU+ALAST: return SP(4,4);
  1252. case AMOVH+ALAST: return SP(4,1);
  1253. case AMOVHU+ALAST: return SP(4,5);
  1254. case AMOVW+ALAST: return SP(4,3);
  1255. case AMOVV+ALAST: return SP(6,7);
  1256. case AMOVF+ALAST: return SP(6,1);
  1257. case ASLLV: return OP(7,0);
  1258. case ASRLV: return OP(7,2);
  1259. case ASRAV: return OP(7,3);
  1260. case ASLLV+ALAST: return OP(7,4);
  1261. case ASRLV+ALAST: return OP(7,6);
  1262. case ASRAV+ALAST: return OP(7,7);
  1263. case AADDV: return SP(3,0);
  1264. case AADDVU: return SP(3,1);
  1265. }
  1266. diag("bad irr %d\n", a);
  1267. return 0;
  1268. }