asm.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251
  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. #include "l.h"
  10. #define LPUT(c)\
  11. {\
  12. cbp[0] = (c)>>24;\
  13. cbp[1] = (c)>>16;\
  14. cbp[2] = (c)>>8;\
  15. cbp[3] = (c);\
  16. cbp += 4;\
  17. cbc -= 4;\
  18. if(cbc <= 0)\
  19. cflush();\
  20. }
  21. #define CPUT(c)\
  22. {\
  23. cbp[0] = (c);\
  24. cbp++;\
  25. cbc--;\
  26. if(cbc <= 0)\
  27. cflush();\
  28. }
  29. int32_t
  30. entryvalue(void)
  31. {
  32. char *a;
  33. Sym *s;
  34. a = INITENTRY;
  35. if(*a >= '0' && *a <= '9')
  36. return atolwhex(a);
  37. s = lookup(a, 0);
  38. if(s->type == 0)
  39. return INITTEXT;
  40. if(s->type != STEXT && s->type != SLEAF)
  41. diag("entry not text: %s", s->name);
  42. return s->value;
  43. }
  44. void
  45. asmb(void)
  46. {
  47. Prog *p;
  48. int32_t t;
  49. Optab *o;
  50. if(debug['v'])
  51. Bprint(&bso, "%5.2f asm\n", cputime());
  52. Bflush(&bso);
  53. seek(cout, HEADR, 0);
  54. pc = INITTEXT;
  55. for(p = firstp; p != P; p = p->link) {
  56. if(p->as == ATEXT) {
  57. curtext = p;
  58. autosize = p->to.offset + 4;
  59. }
  60. if(p->pc != pc) {
  61. diag("phase error %lux sb %lux",
  62. p->pc, pc);
  63. if(!debug['a'])
  64. prasm(curp);
  65. pc = p->pc;
  66. }
  67. curp = p;
  68. o = oplook(p); /* could probably avoid this call */
  69. if(asmout(p, o, 0)) {
  70. p = p->link;
  71. pc += 4;
  72. }
  73. pc += o->size;
  74. }
  75. if(debug['a'])
  76. Bprint(&bso, "\n");
  77. Bflush(&bso);
  78. cflush();
  79. curtext = P;
  80. switch(HEADTYPE) {
  81. case 0:
  82. case 3:
  83. seek(cout, HEADR+textsize, 0);
  84. break;
  85. case 1:
  86. case 2:
  87. seek(cout, HEADR+textsize, 0);
  88. break;
  89. }
  90. for(t = 0; t < datsize; t += sizeof(buf)-100) {
  91. if(datsize-t > sizeof(buf)-100)
  92. datblk(t, sizeof(buf)-100);
  93. else
  94. datblk(t, datsize-t);
  95. }
  96. symsize = 0;
  97. lcsize = 0;
  98. if(!debug['s']) {
  99. if(debug['v'])
  100. Bprint(&bso, "%5.2f sym\n", cputime());
  101. Bflush(&bso);
  102. switch(HEADTYPE) {
  103. case 0:
  104. case 3:
  105. seek(cout, HEADR+textsize+datsize, 0);
  106. break;
  107. case 2:
  108. case 1:
  109. seek(cout, HEADR+textsize+datsize, 0);
  110. break;
  111. }
  112. if(!debug['s'])
  113. asmsym();
  114. if(debug['v'])
  115. Bprint(&bso, "%5.2f sp\n", cputime());
  116. Bflush(&bso);
  117. if(!debug['s'])
  118. asmlc();
  119. /* round up file length for boot image */
  120. if(HEADTYPE == 0 || HEADTYPE == 3)
  121. if((symsize+lcsize) & 1)
  122. CPUT(0);
  123. cflush();
  124. }
  125. seek(cout, 0L, 0);
  126. switch(HEADTYPE) {
  127. case 0:
  128. lput(0x1030107); /* magic and sections */
  129. lput(textsize); /* sizes */
  130. lput(datsize);
  131. lput(bsssize);
  132. lput(symsize); /* nsyms */
  133. lput(entryvalue()); /* va of entry */
  134. lput(0L);
  135. lput(lcsize);
  136. break;
  137. case 1:
  138. break;
  139. case 2:
  140. lput(4*13*13+7); /* magic */
  141. lput(textsize); /* sizes */
  142. lput(datsize);
  143. lput(bsssize);
  144. lput(symsize); /* nsyms */
  145. lput(entryvalue()); /* va of entry */
  146. lput(0L);
  147. lput(lcsize);
  148. break;
  149. case 3:
  150. lput(0x1030107); /* magic and sections */
  151. lput(0x90100000);
  152. #define SPARC_NOOP 0x01000000
  153. lput(SPARC_NOOP);
  154. lput(SPARC_NOOP);
  155. lput(SPARC_NOOP);
  156. lput(SPARC_NOOP);
  157. lput(SPARC_NOOP);
  158. lput(SPARC_NOOP);
  159. break;
  160. }
  161. cflush();
  162. }
  163. void
  164. lput(int32_t l)
  165. {
  166. LPUT(l);
  167. }
  168. void
  169. cflush(void)
  170. {
  171. int n;
  172. n = sizeof(buf.cbuf) - cbc;
  173. if(n)
  174. write(cout, buf.cbuf, n);
  175. cbp = buf.cbuf;
  176. cbc = sizeof(buf.cbuf);
  177. }
  178. void
  179. asmsym(void)
  180. {
  181. Prog *p;
  182. Auto *a;
  183. Sym *s;
  184. int h;
  185. s = lookup("etext", 0);
  186. if(s->type == STEXT)
  187. putsymb(s->name, 'T', s->value, s->version);
  188. for(h=0; h<NHASH; h++)
  189. for(s=hash[h]; s!=S; s=s->link)
  190. switch(s->type) {
  191. case SCONST:
  192. putsymb(s->name, 'D', s->value, s->version);
  193. continue;
  194. case SDATA:
  195. putsymb(s->name, 'D', s->value+INITDAT, s->version);
  196. continue;
  197. case SBSS:
  198. putsymb(s->name, 'B', s->value+INITDAT, s->version);
  199. continue;
  200. case SFILE:
  201. putsymb(s->name, 'f', s->value, s->version);
  202. continue;
  203. }
  204. for(p=textp; p!=P; p=p->cond) {
  205. s = p->from.sym;
  206. if(s->type != STEXT && s->type != SLEAF)
  207. continue;
  208. /* filenames first */
  209. for(a=p->to.autom; a; a=a->link)
  210. if(a->type == D_FILE)
  211. putsymb(a->asym->name, 'z', a->aoffset, 0);
  212. else
  213. if(a->type == D_FILE1)
  214. putsymb(a->asym->name, 'Z', a->aoffset, 0);
  215. if(s->type == STEXT)
  216. putsymb(s->name, 'T', s->value, s->version);
  217. else
  218. putsymb(s->name, 'L', s->value, s->version);
  219. /* frame, auto and param after */
  220. putsymb(".frame", 'm', p->to.offset+4, 0);
  221. for(a=p->to.autom; a; a=a->link)
  222. if(a->type == D_AUTO)
  223. putsymb(a->asym->name, 'a', -a->aoffset, 0);
  224. else
  225. if(a->type == D_PARAM)
  226. putsymb(a->asym->name, 'p', a->aoffset, 0);
  227. }
  228. if(debug['v'] || debug['n'])
  229. Bprint(&bso, "symsize = %lud\n", symsize);
  230. Bflush(&bso);
  231. }
  232. void
  233. putsymb(char *s, int t, int32_t v, int ver)
  234. {
  235. int i, f;
  236. if(t == 'f')
  237. s++;
  238. LPUT(v);
  239. if(ver)
  240. t += 'a' - 'A';
  241. CPUT(t+0x80); /* 0x80 is variable length */
  242. if(t == 'Z' || t == 'z') {
  243. CPUT(s[0]);
  244. for(i=1; s[i] != 0 || s[i+1] != 0; i += 2) {
  245. CPUT(s[i]);
  246. CPUT(s[i+1]);
  247. }
  248. CPUT(0);
  249. CPUT(0);
  250. i++;
  251. }
  252. else {
  253. for(i=0; s[i]; i++)
  254. CPUT(s[i]);
  255. CPUT(0);
  256. }
  257. symsize += 4 + 1 + i + 1;
  258. if(debug['n']) {
  259. if(t == 'z' || t == 'Z') {
  260. Bprint(&bso, "%c %.8lux ", t, v);
  261. for(i=1; s[i] != 0 || s[i+1] != 0; i+=2) {
  262. f = ((s[i]&0xff) << 8) | (s[i+1]&0xff);
  263. Bprint(&bso, "/%x", f);
  264. }
  265. Bprint(&bso, "\n");
  266. return;
  267. }
  268. if(ver)
  269. Bprint(&bso, "%c %.8lux %s<%d>\n", t, v, s, ver);
  270. else
  271. Bprint(&bso, "%c %.8lux %s\n", t, v, s);
  272. }
  273. }
  274. #define MINLC 4
  275. void
  276. asmlc(void)
  277. {
  278. int32_t oldpc, oldlc;
  279. Prog *p;
  280. int32_t v, s;
  281. oldpc = INITTEXT;
  282. oldlc = 0;
  283. for(p = firstp; p != P; p = p->link) {
  284. if(p->line == oldlc || p->as == ATEXT || p->as == ANOP) {
  285. if(p->as == ATEXT)
  286. curtext = p;
  287. if(debug['V'])
  288. Bprint(&bso, "%6lux %P\n",
  289. p->pc, p);
  290. continue;
  291. }
  292. if(debug['V'])
  293. Bprint(&bso, "\t\t%6ld", lcsize);
  294. v = (p->pc - oldpc) / MINLC;
  295. while(v) {
  296. s = 127;
  297. if(v < 127)
  298. s = v;
  299. CPUT(s+128); /* 129-255 +pc */
  300. if(debug['V'])
  301. Bprint(&bso, " pc+%ld*%d(%ld)", s, MINLC, s+128);
  302. v -= s;
  303. lcsize++;
  304. }
  305. s = p->line - oldlc;
  306. oldlc = p->line;
  307. oldpc = p->pc + MINLC;
  308. if(s > 64 || s < -64) {
  309. CPUT(0); /* 0 vv +lc */
  310. CPUT(s>>24);
  311. CPUT(s>>16);
  312. CPUT(s>>8);
  313. CPUT(s);
  314. if(debug['V']) {
  315. if(s > 0)
  316. Bprint(&bso, " lc+%ld(%d,%ld)\n",
  317. s, 0, s);
  318. else
  319. Bprint(&bso, " lc%ld(%d,%ld)\n",
  320. s, 0, s);
  321. Bprint(&bso, "%6lux %P\n",
  322. p->pc, p);
  323. }
  324. lcsize += 5;
  325. continue;
  326. }
  327. if(s > 0) {
  328. CPUT(0+s); /* 1-64 +lc */
  329. if(debug['V']) {
  330. Bprint(&bso, " lc+%ld(%ld)\n", s, 0+s);
  331. Bprint(&bso, "%6lux %P\n",
  332. p->pc, p);
  333. }
  334. } else {
  335. CPUT(64-s); /* 65-128 -lc */
  336. if(debug['V']) {
  337. Bprint(&bso, " lc%ld(%ld)\n", s, 64-s);
  338. Bprint(&bso, "%6lux %P\n",
  339. p->pc, p);
  340. }
  341. }
  342. lcsize++;
  343. }
  344. while(lcsize & 1) {
  345. s = 129;
  346. CPUT(s);
  347. lcsize++;
  348. }
  349. if(debug['v'] || debug['V'])
  350. Bprint(&bso, "lcsize = %ld\n", lcsize);
  351. Bflush(&bso);
  352. }
  353. void
  354. datblk(int32_t s, int32_t n)
  355. {
  356. Prog *p;
  357. char *cast;
  358. int32_t l, fl, j, d;
  359. int i, c;
  360. memset(buf.dbuf, 0, n+100);
  361. for(p = datap; p != P; p = p->link) {
  362. curp = p;
  363. l = p->from.sym->value + p->from.offset - s;
  364. c = p->reg;
  365. i = 0;
  366. if(l < 0) {
  367. if(l+c <= 0)
  368. continue;
  369. while(l < 0) {
  370. l++;
  371. i++;
  372. }
  373. }
  374. if(l >= n)
  375. continue;
  376. if(p->as != AINIT && p->as != ADYNT) {
  377. for(j=l+(c-i)-1; j>=l; j--)
  378. if(buf.dbuf[j]) {
  379. print("%P\n", p);
  380. diag("multiple initialization");
  381. break;
  382. }
  383. }
  384. switch(p->to.type) {
  385. default:
  386. diag("unknown mode in initialization\n%P", p);
  387. break;
  388. case D_FCONST:
  389. switch(c) {
  390. default:
  391. case 4:
  392. fl = ieeedtof(&p->to.ieee);
  393. cast = (char*)&fl;
  394. for(; i<c; i++) {
  395. buf.dbuf[l] = cast[fnuxi8[i+4]];
  396. l++;
  397. }
  398. break;
  399. case 8:
  400. cast = (char*)&p->to.ieee;
  401. for(; i<c; i++) {
  402. buf.dbuf[l] = cast[fnuxi8[i]];
  403. l++;
  404. }
  405. break;
  406. }
  407. break;
  408. case D_SCONST:
  409. for(; i<c; i++) {
  410. buf.dbuf[l] = p->to.sval[i];
  411. l++;
  412. }
  413. break;
  414. case D_CONST:
  415. d = p->to.offset;
  416. if(p->to.sym) {
  417. if(p->to.sym->type == STEXT ||
  418. p->to.sym->type == SLEAF)
  419. d += p->to.sym->value;
  420. if(p->to.sym->type == SDATA)
  421. d += p->to.sym->value + INITDAT;
  422. if(p->to.sym->type == SBSS)
  423. d += p->to.sym->value + INITDAT;
  424. }
  425. cast = (char*)&d;
  426. switch(c) {
  427. default:
  428. diag("bad nuxi %d %d\n%P", c, i, curp);
  429. break;
  430. case 1:
  431. for(; i<c; i++) {
  432. buf.dbuf[l] = cast[inuxi1[i]];
  433. l++;
  434. }
  435. break;
  436. case 2:
  437. for(; i<c; i++) {
  438. buf.dbuf[l] = cast[inuxi2[i]];
  439. l++;
  440. }
  441. break;
  442. case 4:
  443. for(; i<c; i++) {
  444. buf.dbuf[l] = cast[inuxi4[i]];
  445. l++;
  446. }
  447. break;
  448. }
  449. break;
  450. }
  451. }
  452. write(cout, buf.dbuf, n);
  453. }
  454. #define OP2(x) (0x80000000|((x)<<19))
  455. #define OP3(x) (0xc0000000|((x)<<19))
  456. #define OPB(x) (0x00800000|((x)<<25))
  457. #define OPT(x) (0x81d02000|((x)<<25))
  458. #define OPF1(x) (0x81a00000|((x)<<5))
  459. #define OPF2(x) (0x81a80000|((x)<<5))
  460. #define OPFB(x) (0x01800000|((x)<<25))
  461. #define OP_RRR(op,r1,r2,r3)\
  462. (0x00000000 | op |\
  463. (((r1)&31L)<<0) |\
  464. (((r2)&31L)<<14) |\
  465. (((r3)&31L)<<25))
  466. #define OP_IRR(op,i,r2,r3)\
  467. (0x00002000L | (op) |\
  468. (((i)&0x1fffL)<<0) |\
  469. (((r2)&31L)<<14) |\
  470. (((r3)&31L)<<25))
  471. #define OP_BRA(op,pc)\
  472. ((op) |\
  473. (((pc)&0x3fffff)<<0))
  474. int
  475. asmout(Prog *p, Optab *o, int aflag)
  476. {
  477. int32_t o1, o2, o3, o4, o5, v;
  478. Prog *ct;
  479. int r;
  480. o1 = 0;
  481. o2 = 0;
  482. o3 = 0;
  483. o4 = 0;
  484. o5 = 0;
  485. switch(o->type) {
  486. default:
  487. if(aflag)
  488. return 0;
  489. diag("unknown type %d", o->type);
  490. if(!debug['a'])
  491. prasm(p);
  492. break;
  493. case 0: /* pseudo ops */
  494. if(aflag) {
  495. if(p->link) {
  496. if(p->as == ATEXT) {
  497. ct = curtext;
  498. o2 = autosize;
  499. curtext = p;
  500. autosize = p->to.offset + 4;
  501. o1 = asmout(p->link, oplook(p->link), aflag);
  502. curtext = ct;
  503. autosize = o2;
  504. } else
  505. o1 = asmout(p->link, oplook(p->link), aflag);
  506. }
  507. return o1;
  508. }
  509. break;
  510. case 1: /* mov r1,r2 ==> OR r1,r0,r2 */
  511. o1 = OP_RRR(opcode(AOR), p->from.reg, REGZERO, p->to.reg);
  512. break;
  513. case 2: /* mov $c,r ==> add r1,r0,r2 */
  514. r = p->from.reg;
  515. if(r == NREG)
  516. r = o->param;
  517. v = regoff(&p->from);
  518. o1 = OP_IRR(opcode(AADD), v, r, p->to.reg);
  519. break;
  520. case 3: /* mov soreg, r */
  521. r = p->from.reg;
  522. if(r == NREG)
  523. r = o->param;
  524. v = regoff(&p->from);
  525. if(v == 0 && p->reg != NREG)
  526. o1 = OP_RRR(opcode(p->as), p->reg, r, p->to.reg);
  527. else
  528. o1 = OP_IRR(opcode(p->as), v, r, p->to.reg);
  529. break;
  530. case 4: /* mov r, soreg */
  531. r = p->to.reg;
  532. if(r == NREG)
  533. r = o->param;
  534. v = regoff(&p->to);
  535. if(v == 0 && p->reg != NREG)
  536. o1 = OP_RRR(opcode(p->as+AEND), p->reg, r, p->from.reg);
  537. else
  538. o1 = OP_IRR(opcode(p->as+AEND), v, r, p->from.reg);
  539. break;
  540. case 5: /* mov $lcon, reg => sethi, add */
  541. v = regoff(&p->from);
  542. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  543. o2 = OP_IRR(opcode(AADD), (v&0x3ff), REGTMP, p->to.reg);
  544. break;
  545. case 6: /* mov asi, r[+r] */
  546. o1 = OP_RRR(opcode(p->as), p->reg, p->from.reg, p->to.reg);
  547. o1 |= (1<<23) | ((p->from.offset&0xff)<<5);
  548. break;
  549. case 7: /* mov [+r]r, asi */
  550. o1 = OP_RRR(opcode(p->as+AEND), p->reg, p->to.reg, p->from.reg);
  551. o1 |= (1<<23) | ((p->to.offset&0xff)<<5);
  552. break;
  553. case 8: /* mov r, preg and mov preg, r */
  554. if(p->to.type == D_PREG) {
  555. r = p->from.reg;
  556. switch(p->to.reg)
  557. {
  558. default:
  559. diag("unknown register P%d", p->to.reg);
  560. case D_Y:
  561. o1 = OP2(48); /* wry */
  562. break;
  563. case D_PSR:
  564. o1 = OP2(49); /* wrpsr */
  565. break;
  566. case D_WIM:
  567. o1 = OP2(50); /* wrwim */
  568. break;
  569. case D_TBR:
  570. o1 = OP2(51); /* wrtbr */
  571. break;
  572. }
  573. o1 = OP_IRR(o1, 0, r, 0);
  574. break;
  575. }
  576. if(p->from.type == D_PREG) {
  577. r = p->to.reg;
  578. switch(p->from.reg)
  579. {
  580. default:
  581. diag("unknown register P%d", p->to.reg);
  582. case D_Y:
  583. o1 = OP2(40); /* rdy */
  584. break;
  585. case D_PSR:
  586. o1 = OP2(41); /* rdpsr */
  587. break;
  588. case D_WIM:
  589. o1 = OP2(42); /* rdwim */
  590. break;
  591. case D_TBR:
  592. o1 = OP2(43); /* rdtbr */
  593. break;
  594. }
  595. o1 = OP_RRR(o1, 0, 0, r);
  596. break;
  597. }
  598. break;
  599. case 9: /* movb r,r */
  600. v = 24;
  601. if(p->as == AMOVH || p->as == AMOVHU)
  602. v = 16;
  603. r = ASRA;
  604. if(p->as == AMOVBU || p->as == AMOVHU)
  605. r = ASRL;
  606. o1 = OP_IRR(opcode(ASLL), v, p->from.reg, p->to.reg);
  607. o2 = OP_IRR(opcode(r), v, p->to.reg, p->to.reg);
  608. break;
  609. case 10: /* mov $loreg, reg */
  610. r = p->from.reg;
  611. if(r == NREG)
  612. r = o->param;
  613. v = regoff(&p->from);
  614. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  615. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  616. o3 = OP_IRR(opcode(AADD), (v&0x3ff), REGTMP, p->to.reg);
  617. break;
  618. case 11: /* mov loreg, r */
  619. r = p->from.reg;
  620. if(r == NREG)
  621. r = o->param;
  622. v = regoff(&p->from);
  623. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  624. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  625. o3 = OP_IRR(opcode(p->as), (v&0x3ff), REGTMP, p->to.reg);
  626. break;
  627. case 12: /* mov r, loreg */
  628. r = p->to.reg;
  629. if(r == NREG)
  630. r = o->param;
  631. v = regoff(&p->to);
  632. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  633. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  634. o3 = OP_IRR(opcode(p->as+AEND), (v&0x3ff), REGTMP, p->from.reg);
  635. break;
  636. case 13: /* mov $ucon, r */
  637. v = regoff(&p->from);
  638. o1 = 0x1000000 | (p->to.reg<<25) | ((v>>10) & 0x3fffff); /* sethi */
  639. break;
  640. case 20: /* op $scon,r */
  641. v = regoff(&p->from);
  642. r = p->reg;
  643. if(r == NREG)
  644. r = p->to.reg;
  645. o1 = OP_IRR(opcode(p->as), v, r, p->to.reg);
  646. break;
  647. case 21: /* op r1,r2 */
  648. r = p->reg;
  649. if(r == NREG)
  650. r = p->to.reg;
  651. o1 = OP_RRR(opcode(p->as), p->from.reg, r, p->to.reg);
  652. break;
  653. case 22: /* op $lcon,r */
  654. v = regoff(&p->from);
  655. r = p->reg;
  656. if(r == NREG)
  657. r = p->to.reg;
  658. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  659. o2 = OP_IRR(opcode(AADD), (v&0x3ff), REGTMP, REGTMP);
  660. o3 = OP_RRR(opcode(p->as), REGTMP, r, p->to.reg);
  661. break;
  662. case 23: /* cmp r,r */
  663. o1 = OP_RRR(opcode(ASUBCC), p->to.reg, p->from.reg, REGZERO);
  664. break;
  665. case 24: /* cmp r,$c */
  666. v = regoff(&p->to);
  667. o1 = OP_IRR(opcode(ASUBCC), v, p->from.reg, REGZERO);
  668. break;
  669. case 25: /* cmp $c,r BOTCH, fix compiler */
  670. v = regoff(&p->from);
  671. o1 = OP_IRR(opcode(AADD), v, NREG, REGTMP);
  672. o2 = OP_RRR(opcode(ASUBCC), p->to.reg, REGTMP, REGZERO);
  673. break;
  674. case 26: /* op $ucon,r */
  675. v = regoff(&p->from);
  676. r = p->reg;
  677. if(r == NREG)
  678. r = p->to.reg;
  679. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  680. o2 = OP_RRR(opcode(p->as), REGTMP, r, p->to.reg);
  681. break;
  682. case 30: /* jmp/jmpl soreg */
  683. if(aflag)
  684. return 0;
  685. v = regoff(&p->to);
  686. r = p->reg;
  687. if(r == NREG && p->as == AJMPL)
  688. r = 15;
  689. o1 = OP_IRR(opcode(AJMPL), v, p->to.reg, r);
  690. break;
  691. case 31: /* ba jmp */
  692. if(aflag)
  693. return 0;
  694. r = p->as;
  695. if(r == AJMP)
  696. r = ABA;
  697. v = 0;
  698. if(p->cond)
  699. v = p->cond->pc - p->pc;
  700. o1 = OP_BRA(opcode(r), v/4);
  701. if(r == ABA && p->link && p->cond && isnop(p->link)) {
  702. o2 = asmout(p->cond, oplook(p->cond), 1);
  703. if(o2) {
  704. o1 += 1;
  705. if(debug['a'])
  706. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n", p->pc, o1, o2, p);
  707. LPUT(o1);
  708. LPUT(o2);
  709. return 1;
  710. }
  711. /* cant set annul here because pc has already been counted */
  712. }
  713. break;
  714. case 32: /* jmpl lbra */
  715. if(aflag)
  716. return 0;
  717. v = 0;
  718. if(p->cond)
  719. v = p->cond->pc - p->pc;
  720. r = p->reg;
  721. if(r != NREG && r != 15)
  722. diag("cant jmpl other than R15");
  723. o1 = 0x40000000 | ((v/4) & 0x3fffffffL); /* call */
  724. if(p->link && p->cond && isnop(p->link)) {
  725. o2 = asmout(p->cond, oplook(p->cond), 1);
  726. if(o2) {
  727. o1 += 1;
  728. if(debug['a'])
  729. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n", p->pc, o1, o2, p);
  730. LPUT(o1);
  731. LPUT(o2);
  732. return 1;
  733. }
  734. }
  735. break;
  736. case 33: /* trap r */
  737. if(aflag)
  738. return 0;
  739. o1 = opcode(p->as) | (p->from.reg<<14);
  740. break;
  741. case 34: /* rett r1,r2 -> jmpl (r1); rett (r2) */
  742. if(aflag)
  743. return 0;
  744. o1 = OP_IRR(opcode(AJMPL), 0, p->from.reg, REGZERO);
  745. o2 = OP_IRR(opcode(ARETT), 0, p->to.reg, REGZERO);
  746. break;
  747. case 40: /* ldfsr, stfsr, stdq */
  748. if(p->to.type == D_PREG) {
  749. r = p->from.reg;
  750. if(r == NREG)
  751. r = o->param;
  752. v = regoff(&p->from);
  753. if(p->to.reg == D_FSR) {
  754. o1 = OP_IRR(OP3(33), v, r, 0);
  755. break;
  756. }
  757. diag("unknown reg load %d", p->to.reg);
  758. } else {
  759. r = p->to.reg;
  760. if(r == NREG)
  761. r = o->param;
  762. v = regoff(&p->to);
  763. if(p->from.reg == D_FSR) {
  764. o1 = OP_IRR(OP3(37), v, r, 0);
  765. break;
  766. }
  767. if(p->as == AMOVD && p->from.reg == D_FPQ) {
  768. o1 = OP_IRR(OP3(38), v, r, 0);
  769. break;
  770. }
  771. diag("unknown reg store %d", p->from.reg);
  772. }
  773. break;
  774. case 41: /* ldf,ldd */
  775. r = p->from.reg;
  776. if(r == NREG)
  777. r = o->param;
  778. v = regoff(&p->from);
  779. if(p->as == AFMOVF || p->as == AMOVW) {
  780. o1 = OP_IRR(OP3(32), v, r, p->to.reg);
  781. break;
  782. }
  783. if(p->as == AMOVD || p->as == AFMOVD) {
  784. o1 = OP_IRR(OP3(35), v, r, p->to.reg);
  785. break;
  786. }
  787. diag("only MOVD and MOVW to FREG");
  788. break;
  789. case 42: /* ldd -> ldf,ldf */
  790. /* note should be ldd with proper allignment */
  791. r = p->from.reg;
  792. if(r == NREG)
  793. r = o->param;
  794. v = regoff(&p->from);
  795. o1 = OP_IRR(OP3(32), v, r, p->to.reg);
  796. o2 = OP_IRR(OP3(32), v+4, r, p->to.reg+1);
  797. break;
  798. case 43: /* stf */
  799. r = p->to.reg;
  800. if(r == NREG)
  801. r = o->param;
  802. v = regoff(&p->to);
  803. if(p->as == AFMOVF || p->as == AMOVW) {
  804. o1 = OP_IRR(OP3(36), v, r, p->from.reg);
  805. break;
  806. }
  807. if(p->as == AMOVD || p->as == AFMOVD) {
  808. o1 = OP_IRR(OP3(39), v, r, p->from.reg);
  809. break;
  810. }
  811. diag("only MOVD and MOVW from FREG");
  812. break;
  813. case 44: /* std -> stf,stf */
  814. /* note should be std with proper allignment */
  815. r = p->to.reg;
  816. if(r == NREG)
  817. r = o->param;
  818. v = regoff(&p->to);
  819. o1 = OP_IRR(OP3(36), v, r, p->from.reg);
  820. o2 = OP_IRR(OP3(36), v+4, r, p->from.reg+1);
  821. break;
  822. case 45: /* ldf lorg */
  823. r = p->from.reg;
  824. if(r == NREG)
  825. r = o->param;
  826. v = regoff(&p->from);
  827. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  828. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  829. o3 = OP_IRR(OP3(32), v&0x3ff, REGTMP, p->to.reg);
  830. break;
  831. case 46: /* ldd lorg -> ldf,ldf */
  832. /* note should be ldd with proper allignment */
  833. r = p->from.reg;
  834. if(r == NREG)
  835. r = o->param;
  836. v = regoff(&p->from);
  837. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  838. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  839. o3 = OP_IRR(OP3(32), (v&0x3ff), REGTMP, p->to.reg);
  840. o4 = OP_IRR(OP3(32), (v&0x3ff)+4, REGTMP, p->to.reg+1);
  841. break;
  842. case 47: /* stf lorg */
  843. r = p->to.reg;
  844. if(r == NREG)
  845. r = o->param;
  846. v = regoff(&p->to);
  847. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  848. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  849. o3 = OP_IRR(OP3(36), v&0x3ff, REGTMP, p->from.reg);
  850. break;
  851. case 48: /* std lorg -> stf,stf */
  852. /* note should be std with proper allignment */
  853. r = p->to.reg;
  854. if(r == NREG)
  855. r = o->param;
  856. v = regoff(&p->to);
  857. o1 = 0x1000000 | (REGTMP<<25) | ((v>>10) & 0x3fffff); /* sethi */
  858. o2 = OP_RRR(opcode(AADD), r, REGTMP, REGTMP);
  859. o3 = OP_IRR(OP3(36), (v&0x3ff), REGTMP, p->from.reg);
  860. o4 = OP_IRR(OP3(36), (v&0x3ff)+4, REGTMP, p->from.reg+1);
  861. break;
  862. case 49: /* fmovd -> fmovf,fmovf */
  863. o1 = OP_RRR(opcode(AFMOVF), p->from.reg, 0, p->to.reg);
  864. o2 = OP_RRR(opcode(AFMOVF), p->from.reg+1, 0, p->to.reg+1);
  865. break;
  866. case 50: /* fcmp */
  867. o1 = OP_RRR(opcode(p->as), p->to.reg, p->from.reg, 0);
  868. break;
  869. case 51: /* word */
  870. if(aflag)
  871. return 0;
  872. o1 = regoff(&p->from);
  873. break;
  874. case 52: /* div */
  875. r = p->reg;
  876. if(r == NREG)
  877. r = p->to.reg;
  878. o1 = OP_IRR(opcode(ASRA), 31, r, REGTMP);
  879. o2 = OP_IRR(OP2(48), 0, REGTMP, 0);
  880. o3 = OP_RRR(opcode(ADIV), p->from.reg, r, p->to.reg);
  881. break;
  882. case 53: /* divl */
  883. r = p->reg;
  884. if(r == NREG)
  885. r = p->to.reg;
  886. o1 = OP_IRR(OP2(48), 0, REGZERO, 0);
  887. o2 = OP_RRR(opcode(ADIVL), p->from.reg, r, p->to.reg);
  888. break;
  889. case 54: /* mod */
  890. r = p->reg;
  891. if(r == NREG)
  892. r = p->to.reg;
  893. o1 = OP_IRR(opcode(ASRA), 31, r, REGTMP);
  894. o2 = OP_IRR(OP2(48), 0, REGTMP, 0);
  895. o3 = OP_RRR(opcode(ADIV), p->from.reg, r, REGTMP);
  896. o4 = OP_RRR(opcode(AMUL), p->from.reg, REGTMP, REGTMP);
  897. o5 = OP_RRR(opcode(ASUB), REGTMP, r, p->to.reg);
  898. break;
  899. case 55: /* modl */
  900. r = p->reg;
  901. if(r == NREG)
  902. r = p->to.reg;
  903. o1 = OP_IRR(OP2(48), 0, REGZERO, 0);
  904. o2 = OP_RRR(opcode(ADIVL), p->from.reg, r, REGTMP);
  905. o3 = OP_RRR(opcode(AMUL), p->from.reg, REGTMP, REGTMP);
  906. o4 = OP_RRR(opcode(ASUB), REGTMP, r, p->to.reg);
  907. break;
  908. case 56: /* b(cc) -- annullable */
  909. if(aflag)
  910. return 0;
  911. r = p->as;
  912. v = 0;
  913. if(p->cond)
  914. v = p->cond->pc - p->pc;
  915. o1 = OP_BRA(opcode(r), v/4);
  916. if(p->link && p->cond && isnop(p->link))
  917. if(!debug['A']) {
  918. o2 = asmout(p->cond, oplook(p->cond), 2);
  919. if(o2) {
  920. o1 |= 1<<29; /* annul */
  921. o1 += 1;
  922. if(debug['a'])
  923. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n", p->pc, o1, o2, p);
  924. LPUT(o1);
  925. LPUT(o2);
  926. return 1;
  927. }
  928. }
  929. break;
  930. case 57: /* op r1,r2 with reserved rs1 */
  931. r = 0;
  932. o1 = OP_RRR(opcode(p->as), p->from.reg, r, p->to.reg);
  933. break;
  934. }
  935. if(aflag)
  936. return o1;
  937. v = p->pc;
  938. switch(o->size) {
  939. default:
  940. if(debug['a'])
  941. Bprint(&bso, " %.8lux:\t\t%P\n", v, p);
  942. break;
  943. case 4:
  944. if(debug['a'])
  945. Bprint(&bso, " %.8lux: %.8lux\t%P\n", v, o1, p);
  946. LPUT(o1);
  947. break;
  948. case 8:
  949. if(debug['a'])
  950. Bprint(&bso, " %.8lux: %.8lux %.8lux%P\n", v, o1, o2, p);
  951. LPUT(o1);
  952. LPUT(o2);
  953. break;
  954. case 12:
  955. if(debug['a'])
  956. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux%P\n", v, o1, o2, o3, p);
  957. LPUT(o1);
  958. LPUT(o2);
  959. LPUT(o3);
  960. break;
  961. case 16:
  962. if(debug['a'])
  963. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux %.8lux%P\n",
  964. v, o1, o2, o3, o4, p);
  965. LPUT(o1);
  966. LPUT(o2);
  967. LPUT(o3);
  968. LPUT(o4);
  969. break;
  970. case 20:
  971. if(debug['a'])
  972. Bprint(&bso, " %.8lux: %.8lux %.8lux %.8lux %.8lux %.8lux%P\n",
  973. v, o1, o2, o3, o4, o5, p);
  974. LPUT(o1);
  975. LPUT(o2);
  976. LPUT(o3);
  977. LPUT(o4);
  978. LPUT(o5);
  979. break;
  980. }
  981. return 0;
  982. }
  983. int
  984. isnop(Prog *p)
  985. {
  986. if(p->as != AORN)
  987. return 0;
  988. if(p->reg != REGZERO && p->reg != NREG)
  989. return 0;
  990. if(p->from.type != D_REG || p->from.reg != REGZERO)
  991. return 0;
  992. if(p->to.type != D_REG || p->to.reg != REGZERO)
  993. return 0;
  994. return 1;
  995. }
  996. int32_t
  997. opcode(int a)
  998. {
  999. switch(a) {
  1000. case AADD: return OP2(0);
  1001. case AADDCC: return OP2(16);
  1002. case AADDX: return OP2(8);
  1003. case AADDXCC: return OP2(24);
  1004. case AMUL: return OP2(10);
  1005. case ADIV: return OP2(15);
  1006. case ADIVL: return OP2(14);
  1007. case ATADDCC: return OP2(32);
  1008. case ATADDCCTV: return OP2(34);
  1009. case ASUB: return OP2(4);
  1010. case ASUBCC: return OP2(20);
  1011. case ASUBX: return OP2(12);
  1012. case ASUBXCC: return OP2(28);
  1013. case ATSUBCC: return OP2(33);
  1014. case ATSUBCCTV: return OP2(35);
  1015. case AMULSCC: return OP2(36);
  1016. case ASAVE: return OP2(60);
  1017. case ARESTORE: return OP2(61);
  1018. case AAND: return OP2(1);
  1019. case AANDCC: return OP2(17);
  1020. case AANDN: return OP2(5);
  1021. case AANDNCC: return OP2(21);
  1022. case AOR: return OP2(2);
  1023. case AORCC: return OP2(18);
  1024. case AORN: return OP2(6);
  1025. case AORNCC: return OP2(22);
  1026. case AXOR: return OP2(3);
  1027. case AXORCC: return OP2(19);
  1028. case AXNOR: return OP2(7);
  1029. case AXNORCC: return OP2(23);
  1030. case ASLL: return OP2(37);
  1031. case ASRL: return OP2(38);
  1032. case ASRA: return OP2(39);
  1033. case AJMPL:
  1034. case AJMP: return OP2(56);
  1035. case ARETT: return OP2(57);
  1036. case AMOVBU: return OP3(1); /* ldub */
  1037. case AMOVB: return OP3(9); /* ldsb */
  1038. case AMOVHU: return OP3(2); /* lduh */
  1039. case AMOVH: return OP3(10); /* ldsh */
  1040. case AMOVW: return OP3(0); /* ld */
  1041. case AMOVD: return OP3(3); /* ldd */
  1042. case AMOVBU+AEND:
  1043. case AMOVB+AEND:return OP3(5); /* stb */
  1044. case AMOVHU+AEND:
  1045. case AMOVH+AEND:return OP3(6); /* sth */
  1046. case AMOVW+AEND:return OP3(4); /* st */
  1047. case AMOVD+AEND:return OP3(7); /* std */
  1048. case ASWAP: /* swap is symmetric */
  1049. case ASWAP+AEND:return OP3(15);
  1050. case ATAS: return OP3(13); /* tas is really ldstub */
  1051. case ABN: return OPB(0);
  1052. case ABE: return OPB(1);
  1053. case ABLE: return OPB(2);
  1054. case ABL: return OPB(3);
  1055. case ABLEU: return OPB(4);
  1056. case ABCS: return OPB(5);
  1057. case ABNEG: return OPB(6);
  1058. case ABVS: return OPB(7);
  1059. case ABA: return OPB(8);
  1060. case ABNE: return OPB(9);
  1061. case ABG: return OPB(10);
  1062. case ABGE: return OPB(11);
  1063. case ABGU: return OPB(12);
  1064. case ABCC: return OPB(13);
  1065. case ABPOS: return OPB(14);
  1066. case ABVC: return OPB(15);
  1067. case AFBA: return OPFB(8);
  1068. case AFBE: return OPFB(9);
  1069. case AFBG: return OPFB(6);
  1070. case AFBGE: return OPFB(11);
  1071. case AFBL: return OPFB(4);
  1072. case AFBLE: return OPFB(13);
  1073. case AFBLG: return OPFB(2);
  1074. case AFBN: return OPFB(0);
  1075. case AFBNE: return OPFB(1);
  1076. case AFBO: return OPFB(15);
  1077. case AFBU: return OPFB(7);
  1078. case AFBUE: return OPFB(10);
  1079. case AFBUG: return OPFB(5);
  1080. case AFBUGE: return OPFB(12);
  1081. case AFBUL: return OPFB(3);
  1082. case AFBULE: return OPFB(14);
  1083. case ATN: return OPT(0);
  1084. case ATE: return OPT(1);
  1085. case ATLE: return OPT(2);
  1086. case ATL: return OPT(3);
  1087. case ATLEU: return OPT(4);
  1088. case ATCS: return OPT(5);
  1089. case ATNEG: return OPT(6);
  1090. case ATVS: return OPT(7);
  1091. case ATA: return OPT(8);
  1092. case ATNE: return OPT(9);
  1093. case ATG: return OPT(10);
  1094. case ATGE: return OPT(11);
  1095. case ATGU: return OPT(12);
  1096. case ATCC: return OPT(13);
  1097. case ATPOS: return OPT(14);
  1098. case ATVC: return OPT(15);
  1099. case AFADDF: return OPF1(65);
  1100. case AFADDD: return OPF1(66);
  1101. case AFADDX: return OPF1(67);
  1102. case AFSUBF: return OPF1(69);
  1103. case AFSUBD: return OPF1(70);
  1104. case AFSUBX: return OPF1(71);
  1105. case AFMULF: return OPF1(73);
  1106. case AFMULD: return OPF1(74);
  1107. case AFMULX: return OPF1(75);
  1108. case AFDIVF: return OPF1(77);
  1109. case AFDIVD: return OPF1(78);
  1110. case AFDIVX: return OPF1(79);
  1111. case AFMOVF: return OPF1(1);
  1112. case AFNEGF: return OPF1(5);
  1113. case AFABSF: return OPF1(9);
  1114. case AFSQRTF: return OPF1(41);
  1115. case AFSQRTD: return OPF1(42);
  1116. case AFSQRTX: return OPF1(43);
  1117. case AFMOVWF: return OPF1(196);
  1118. case AFMOVWD: return OPF1(200);
  1119. case AFMOVWX: return OPF1(204);
  1120. case AFMOVFW: return OPF1(209);
  1121. case AFMOVDW: return OPF1(210);
  1122. case AFMOVXW: return OPF1(211);
  1123. case AFMOVFD: return OPF1(201);
  1124. case AFMOVFX: return OPF1(205);
  1125. case AFMOVDF: return OPF1(198);
  1126. case AFMOVDX: return OPF1(206);
  1127. case AFMOVXF: return OPF1(199);
  1128. case AFMOVXD: return OPF1(203);
  1129. case AFCMPF: return OPF2(81);
  1130. case AFCMPD: return OPF2(82);
  1131. case AFCMPX: return OPF2(83);
  1132. case AFCMPEF: return OPF2(85);
  1133. case AFCMPED: return OPF2(86);
  1134. case AFCMPEX: return OPF2(87);
  1135. case AUNIMP: return 0;
  1136. }
  1137. diag("bad opcode %A", a);
  1138. return 0;
  1139. }