cgen64.c 45 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663
  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 "gc.h"
  10. void
  11. zeroregm(Node *n)
  12. {
  13. gins(AMOVL, nodconst(0), n);
  14. }
  15. /* do we need to load the address of a vlong? */
  16. int
  17. vaddr(Node *n, int a)
  18. {
  19. switch(n->op) {
  20. case ONAME:
  21. if(a)
  22. return 1;
  23. return !(n->class == CEXTERN || n->class == CGLOBL || n->class == CSTATIC);
  24. case OCONST:
  25. case OREGISTER:
  26. case OINDREG:
  27. return 1;
  28. }
  29. return 0;
  30. }
  31. long
  32. hi64v(Node *n)
  33. {
  34. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  35. return (long)(n->vconst) & ~0L;
  36. else
  37. return (long)((uvlong)n->vconst>>32) & ~0L;
  38. }
  39. long
  40. lo64v(Node *n)
  41. {
  42. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  43. return (long)((uvlong)n->vconst>>32) & ~0L;
  44. else
  45. return (long)(n->vconst) & ~0L;
  46. }
  47. Node *
  48. hi64(Node *n)
  49. {
  50. return nodconst(hi64v(n));
  51. }
  52. Node *
  53. lo64(Node *n)
  54. {
  55. return nodconst(lo64v(n));
  56. }
  57. static Node *
  58. anonreg(void)
  59. {
  60. Node *n;
  61. n = new(OREGISTER, Z, Z);
  62. n->reg = D_NONE;
  63. n->type = types[TLONG];
  64. return n;
  65. }
  66. static Node *
  67. regpair(Node *n, Node *t)
  68. {
  69. Node *r;
  70. if(n != Z && n->op == OREGPAIR)
  71. return n;
  72. r = new(OREGPAIR, anonreg(), anonreg());
  73. if(n != Z)
  74. r->type = n->type;
  75. else
  76. r->type = t->type;
  77. return r;
  78. }
  79. static void
  80. evacaxdx(Node *r)
  81. {
  82. Node nod1, nod2;
  83. if(r->reg == D_AX || r->reg == D_DX) {
  84. reg[D_AX]++;
  85. reg[D_DX]++;
  86. /*
  87. * this is just an optim that should
  88. * check for spill
  89. */
  90. r->type = types[TULONG];
  91. regalloc(&nod1, r, Z);
  92. nodreg(&nod2, Z, r->reg);
  93. gins(AMOVL, &nod2, &nod1);
  94. regfree(r);
  95. r->reg = nod1.reg;
  96. reg[D_AX]--;
  97. reg[D_DX]--;
  98. }
  99. }
  100. /* lazy instantiation of register pair */
  101. static int
  102. instpair(Node *n, Node *l)
  103. {
  104. int r;
  105. r = 0;
  106. if(n->left->reg == D_NONE) {
  107. if(l != Z) {
  108. n->left->reg = l->reg;
  109. r = 1;
  110. }
  111. else
  112. regalloc(n->left, n->left, Z);
  113. }
  114. if(n->right->reg == D_NONE)
  115. regalloc(n->right, n->right, Z);
  116. return r;
  117. }
  118. static void
  119. zapreg(Node *n)
  120. {
  121. if(n->reg != D_NONE) {
  122. //prtree(n, "zapreg");
  123. regfree(n);
  124. n->reg = D_NONE;
  125. }
  126. }
  127. static void
  128. freepair(Node *n)
  129. {
  130. regfree(n->left);
  131. regfree(n->right);
  132. }
  133. /* n is not OREGPAIR, nn is */
  134. void
  135. loadpair(Node *n, Node *nn)
  136. {
  137. Node nod;
  138. instpair(nn, Z);
  139. if(n->op == OCONST) {
  140. gins(AMOVL, lo64(n), nn->left);
  141. n->xoffset += SZ_LONG;
  142. gins(AMOVL, hi64(n), nn->right);
  143. n->xoffset -= SZ_LONG;
  144. return;
  145. }
  146. if(!vaddr(n, 0)) {
  147. /* steal the right register for the laddr */
  148. nod = regnode;
  149. nod.reg = nn->right->reg;
  150. lcgen(n, &nod);
  151. n = &nod;
  152. regind(n, n);
  153. n->xoffset = 0;
  154. }
  155. gins(AMOVL, n, nn->left);
  156. n->xoffset += SZ_LONG;
  157. gins(AMOVL, n, nn->right);
  158. n->xoffset -= SZ_LONG;
  159. }
  160. /* n is OREGPAIR, nn is not */
  161. static void
  162. storepair(Node *n, Node *nn, int f)
  163. {
  164. Node nod;
  165. if(!vaddr(nn, 0)) {
  166. reglcgen(&nod, nn, Z);
  167. nn = &nod;
  168. }
  169. gins(AMOVL, n->left, nn);
  170. nn->xoffset += SZ_LONG;
  171. gins(AMOVL, n->right, nn);
  172. nn->xoffset -= SZ_LONG;
  173. if(nn == &nod)
  174. regfree(&nod);
  175. if(f)
  176. freepair(n);
  177. }
  178. enum
  179. {
  180. /* 4 only, see WW */
  181. WNONE = 0,
  182. WCONST,
  183. WADDR,
  184. WHARD,
  185. };
  186. static int
  187. whatof(Node *n, int a)
  188. {
  189. if(n->op == OCONST)
  190. return WCONST;
  191. return !vaddr(n, a) ? WHARD : WADDR;
  192. }
  193. /* can upgrade an extern to addr for AND */
  194. static int
  195. reduxv(Node *n)
  196. {
  197. return lo64v(n) == 0 || hi64v(n) == 0;
  198. }
  199. int
  200. cond(int op)
  201. {
  202. switch(op) {
  203. case OANDAND:
  204. case OOROR:
  205. case ONOT:
  206. return 1;
  207. case OEQ:
  208. case ONE:
  209. case OLE:
  210. case OLT:
  211. case OGE:
  212. case OGT:
  213. case OHI:
  214. case OHS:
  215. case OLO:
  216. case OLS:
  217. return 1;
  218. }
  219. return 0;
  220. }
  221. /*
  222. * for a func operand call it and then return
  223. * the safe node
  224. */
  225. static Node *
  226. vfunc(Node *n, Node *nn)
  227. {
  228. Node *t;
  229. if(n->op != OFUNC)
  230. return n;
  231. t = new(0, Z, Z);
  232. if(nn == Z || nn == nodret)
  233. nn = n;
  234. regsalloc(t, nn);
  235. sugen(n, t, 8);
  236. return t;
  237. }
  238. /* try to steal a reg */
  239. static int
  240. getreg(Node **np, Node *t, int r)
  241. {
  242. Node *n, *p;
  243. n = *np;
  244. if(n->reg == r) {
  245. p = new(0, Z, Z);
  246. regalloc(p, n, Z);
  247. gins(AMOVL, n, p);
  248. *t = *n;
  249. *np = p;
  250. return 1;
  251. }
  252. return 0;
  253. }
  254. static Node *
  255. snarfreg(Node *n, Node *t, int r, Node *d, Node *c)
  256. {
  257. if(n == Z || n->op != OREGPAIR || (!getreg(&n->left, t, r) && !getreg(&n->right, t, r))) {
  258. if(nodreg(t, Z, r)) {
  259. regalloc(c, d, Z);
  260. gins(AMOVL, t, c);
  261. reg[r]++;
  262. return c;
  263. }
  264. reg[r]++;
  265. }
  266. return Z;
  267. }
  268. enum
  269. {
  270. Vstart = OEND,
  271. Vgo,
  272. Vamv,
  273. Vmv,
  274. Vzero,
  275. Vop,
  276. Vopx,
  277. Vins,
  278. Vins0,
  279. Vinsl,
  280. Vinsr,
  281. Vinsla,
  282. Vinsra,
  283. Vinsx,
  284. Vmul,
  285. Vshll,
  286. VT,
  287. VF,
  288. V_l_lo_f,
  289. V_l_hi_f,
  290. V_l_lo_t,
  291. V_l_hi_t,
  292. V_l_lo_u,
  293. V_l_hi_u,
  294. V_r_lo_f,
  295. V_r_hi_f,
  296. V_r_lo_t,
  297. V_r_hi_t,
  298. V_r_lo_u,
  299. V_r_hi_u,
  300. Vspazz,
  301. Vend,
  302. V_T0,
  303. V_T1,
  304. V_F0,
  305. V_F1,
  306. V_a0,
  307. V_a1,
  308. V_f0,
  309. V_f1,
  310. V_p0,
  311. V_p1,
  312. V_p2,
  313. V_p3,
  314. V_p4,
  315. V_s0,
  316. V_s1,
  317. V_s2,
  318. V_s3,
  319. V_s4,
  320. C00,
  321. C01,
  322. C31,
  323. C32,
  324. O_l_lo,
  325. O_l_hi,
  326. O_r_lo,
  327. O_r_hi,
  328. O_t_lo,
  329. O_t_hi,
  330. O_l,
  331. O_r,
  332. O_l_rp,
  333. O_r_rp,
  334. O_t_rp,
  335. O_r0,
  336. O_r1,
  337. O_Zop,
  338. O_a0,
  339. O_a1,
  340. V_C0,
  341. V_C1,
  342. V_S0,
  343. V_S1,
  344. VOPS = 5,
  345. VLEN = 5,
  346. VARGS = 2,
  347. S00 = 0,
  348. Sc0,
  349. Sc1,
  350. Sc2,
  351. Sac3,
  352. Sac4,
  353. S10,
  354. SAgen = 0,
  355. SAclo,
  356. SAc32,
  357. SAchi,
  358. SAdgen,
  359. SAdclo,
  360. SAdc32,
  361. SAdchi,
  362. B0c = 0,
  363. Bca,
  364. Bac,
  365. T0i = 0,
  366. Tii,
  367. Bop0 = 0,
  368. Bop1,
  369. };
  370. /*
  371. * _testv:
  372. * CMPL lo,$0
  373. * JNE true
  374. * CMPL hi,$0
  375. * JNE true
  376. * GOTO false
  377. * false:
  378. * GOTO code
  379. * true:
  380. * GOTO patchme
  381. * code:
  382. */
  383. static uchar testi[][VLEN] =
  384. {
  385. {Vop, ONE, O_l_lo, C00},
  386. {V_s0, Vop, ONE, O_l_hi, C00},
  387. {V_s1, Vgo, V_s2, Vgo, V_s3},
  388. {VF, V_p0, V_p1, VT, V_p2},
  389. {Vgo, V_p3},
  390. {VT, V_p0, V_p1, VF, V_p2},
  391. {Vend},
  392. };
  393. /* shift left general case */
  394. static uchar shll00[][VLEN] =
  395. {
  396. {Vop, OGE, O_r, C32},
  397. {V_s0, Vinsl, ASHLL, O_r, O_l_rp},
  398. {Vins, ASHLL, O_r, O_l_lo, Vgo},
  399. {V_p0, V_s0},
  400. {Vins, ASHLL, O_r, O_l_lo},
  401. {Vins, AMOVL, O_l_lo, O_l_hi},
  402. {Vzero, O_l_lo, V_p0, Vend},
  403. };
  404. /* shift left rp, const < 32 */
  405. static uchar shllc0[][VLEN] =
  406. {
  407. {Vinsl, ASHLL, O_r, O_l_rp},
  408. {Vshll, O_r, O_l_lo, Vend},
  409. };
  410. /* shift left rp, const == 32 */
  411. static uchar shllc1[][VLEN] =
  412. {
  413. {Vins, AMOVL, O_l_lo, O_l_hi},
  414. {Vzero, O_l_lo, Vend},
  415. };
  416. /* shift left rp, const > 32 */
  417. static uchar shllc2[][VLEN] =
  418. {
  419. {Vshll, O_r, O_l_lo},
  420. {Vins, AMOVL, O_l_lo, O_l_hi},
  421. {Vzero, O_l_lo, Vend},
  422. };
  423. /* shift left addr, const == 32 */
  424. static uchar shllac3[][VLEN] =
  425. {
  426. {Vins, AMOVL, O_l_lo, O_t_hi},
  427. {Vzero, O_t_lo, Vend},
  428. };
  429. /* shift left addr, const > 32 */
  430. static uchar shllac4[][VLEN] =
  431. {
  432. {Vins, AMOVL, O_l_lo, O_t_hi},
  433. {Vshll, O_r, O_t_hi},
  434. {Vzero, O_t_lo, Vend},
  435. };
  436. /* shift left of constant */
  437. static uchar shll10[][VLEN] =
  438. {
  439. {Vop, OGE, O_r, C32},
  440. {V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
  441. {Vins, AMOVL, O_l_hi, O_t_hi},
  442. {Vinsl, ASHLL, O_r, O_t_rp},
  443. {Vins, ASHLL, O_r, O_t_lo, Vgo},
  444. {V_p0, V_s0},
  445. {Vins, AMOVL, O_l_lo, O_t_hi},
  446. {V_l_lo_t, Vins, ASHLL, O_r, O_t_hi},
  447. {Vzero, O_t_lo, V_p0, Vend},
  448. };
  449. static uchar (*shlltab[])[VLEN] =
  450. {
  451. shll00,
  452. shllc0,
  453. shllc1,
  454. shllc2,
  455. shllac3,
  456. shllac4,
  457. shll10,
  458. };
  459. /* shift right general case */
  460. static uchar shrl00[][VLEN] =
  461. {
  462. {Vop, OGE, O_r, C32},
  463. {V_s0, Vinsr, ASHRL, O_r, O_l_rp},
  464. {Vins, O_a0, O_r, O_l_hi, Vgo},
  465. {V_p0, V_s0},
  466. {Vins, O_a0, O_r, O_l_hi},
  467. {Vins, AMOVL, O_l_hi, O_l_lo},
  468. {V_T1, Vzero, O_l_hi},
  469. {V_F1, Vins, ASARL, C31, O_l_hi},
  470. {V_p0, Vend},
  471. };
  472. /* shift right rp, const < 32 */
  473. static uchar shrlc0[][VLEN] =
  474. {
  475. {Vinsr, ASHRL, O_r, O_l_rp},
  476. {Vins, O_a0, O_r, O_l_hi, Vend},
  477. };
  478. /* shift right rp, const == 32 */
  479. static uchar shrlc1[][VLEN] =
  480. {
  481. {Vins, AMOVL, O_l_hi, O_l_lo},
  482. {V_T1, Vzero, O_l_hi},
  483. {V_F1, Vins, ASARL, C31, O_l_hi},
  484. {Vend},
  485. };
  486. /* shift right rp, const > 32 */
  487. static uchar shrlc2[][VLEN] =
  488. {
  489. {Vins, O_a0, O_r, O_l_hi},
  490. {Vins, AMOVL, O_l_hi, O_l_lo},
  491. {V_T1, Vzero, O_l_hi},
  492. {V_F1, Vins, ASARL, C31, O_l_hi},
  493. {Vend},
  494. };
  495. /* shift right addr, const == 32 */
  496. static uchar shrlac3[][VLEN] =
  497. {
  498. {Vins, AMOVL, O_l_hi, O_t_lo},
  499. {V_T1, Vzero, O_t_hi},
  500. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  501. {V_F1, Vins, ASARL, C31, O_t_hi},
  502. {Vend},
  503. };
  504. /* shift right addr, const > 32 */
  505. static uchar shrlac4[][VLEN] =
  506. {
  507. {Vins, AMOVL, O_l_hi, O_t_lo},
  508. {Vins, O_a0, O_r, O_t_lo},
  509. {V_T1, Vzero, O_t_hi},
  510. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  511. {V_F1, Vins, ASARL, C31, O_t_hi},
  512. {Vend},
  513. };
  514. /* shift right of constant */
  515. static uchar shrl10[][VLEN] =
  516. {
  517. {Vop, OGE, O_r, C32},
  518. {V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
  519. {Vins, AMOVL, O_l_hi, O_t_hi},
  520. {Vinsr, ASHRL, O_r, O_t_rp},
  521. {Vins, O_a0, O_r, O_t_hi, Vgo},
  522. {V_p0, V_s0},
  523. {Vins, AMOVL, O_l_hi, O_t_lo},
  524. {V_l_hi_t, Vins, O_a0, O_r, O_t_lo},
  525. {V_l_hi_u, V_S1},
  526. {V_T1, Vzero, O_t_hi, V_p0},
  527. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  528. {V_F1, Vins, ASARL, C31, O_t_hi},
  529. {Vend},
  530. };
  531. static uchar (*shrltab[])[VLEN] =
  532. {
  533. shrl00,
  534. shrlc0,
  535. shrlc1,
  536. shrlc2,
  537. shrlac3,
  538. shrlac4,
  539. shrl10,
  540. };
  541. /* shift asop left general case */
  542. static uchar asshllgen[][VLEN] =
  543. {
  544. {V_a0, V_a1},
  545. {Vop, OGE, O_r, C32},
  546. {V_s0, Vins, AMOVL, O_l_lo, O_r0},
  547. {Vins, AMOVL, O_l_hi, O_r1},
  548. {Vinsla, ASHLL, O_r, O_r0},
  549. {Vins, ASHLL, O_r, O_r0},
  550. {Vins, AMOVL, O_r1, O_l_hi},
  551. {Vins, AMOVL, O_r0, O_l_lo, Vgo},
  552. {V_p0, V_s0},
  553. {Vins, AMOVL, O_l_lo, O_r0},
  554. {Vzero, O_l_lo},
  555. {Vins, ASHLL, O_r, O_r0},
  556. {Vins, AMOVL, O_r0, O_l_hi, V_p0},
  557. {V_f0, V_f1, Vend},
  558. };
  559. /* shift asop left, const < 32 */
  560. static uchar asshllclo[][VLEN] =
  561. {
  562. {V_a0, V_a1},
  563. {Vins, AMOVL, O_l_lo, O_r0},
  564. {Vins, AMOVL, O_l_hi, O_r1},
  565. {Vinsla, ASHLL, O_r, O_r0},
  566. {Vshll, O_r, O_r0},
  567. {Vins, AMOVL, O_r1, O_l_hi},
  568. {Vins, AMOVL, O_r0, O_l_lo},
  569. {V_f0, V_f1, Vend},
  570. };
  571. /* shift asop left, const == 32 */
  572. static uchar asshllc32[][VLEN] =
  573. {
  574. {V_a0},
  575. {Vins, AMOVL, O_l_lo, O_r0},
  576. {Vzero, O_l_lo},
  577. {Vins, AMOVL, O_r0, O_l_hi},
  578. {V_f0, Vend},
  579. };
  580. /* shift asop left, const > 32 */
  581. static uchar asshllchi[][VLEN] =
  582. {
  583. {V_a0},
  584. {Vins, AMOVL, O_l_lo, O_r0},
  585. {Vzero, O_l_lo},
  586. {Vshll, O_r, O_r0},
  587. {Vins, AMOVL, O_r0, O_l_hi},
  588. {V_f0, Vend},
  589. };
  590. /* shift asop dest left general case */
  591. static uchar asdshllgen[][VLEN] =
  592. {
  593. {Vop, OGE, O_r, C32},
  594. {V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
  595. {Vins, AMOVL, O_l_hi, O_t_hi},
  596. {Vinsl, ASHLL, O_r, O_t_rp},
  597. {Vins, ASHLL, O_r, O_t_lo},
  598. {Vins, AMOVL, O_t_hi, O_l_hi},
  599. {Vins, AMOVL, O_t_lo, O_l_lo, Vgo},
  600. {V_p0, V_s0},
  601. {Vins, AMOVL, O_l_lo, O_t_hi},
  602. {Vzero, O_l_lo},
  603. {Vins, ASHLL, O_r, O_t_hi},
  604. {Vzero, O_t_lo},
  605. {Vins, AMOVL, O_t_hi, O_l_hi, V_p0},
  606. {Vend},
  607. };
  608. /* shift asop dest left, const < 32 */
  609. static uchar asdshllclo[][VLEN] =
  610. {
  611. {Vins, AMOVL, O_l_lo, O_t_lo},
  612. {Vins, AMOVL, O_l_hi, O_t_hi},
  613. {Vinsl, ASHLL, O_r, O_t_rp},
  614. {Vshll, O_r, O_t_lo},
  615. {Vins, AMOVL, O_t_hi, O_l_hi},
  616. {Vins, AMOVL, O_t_lo, O_l_lo},
  617. {Vend},
  618. };
  619. /* shift asop dest left, const == 32 */
  620. static uchar asdshllc32[][VLEN] =
  621. {
  622. {Vins, AMOVL, O_l_lo, O_t_hi},
  623. {Vzero, O_t_lo},
  624. {Vins, AMOVL, O_t_hi, O_l_hi},
  625. {Vins, AMOVL, O_t_lo, O_l_lo},
  626. {Vend},
  627. };
  628. /* shift asop dest, const > 32 */
  629. static uchar asdshllchi[][VLEN] =
  630. {
  631. {Vins, AMOVL, O_l_lo, O_t_hi},
  632. {Vzero, O_t_lo},
  633. {Vshll, O_r, O_t_hi},
  634. {Vins, AMOVL, O_t_lo, O_l_lo},
  635. {Vins, AMOVL, O_t_hi, O_l_hi},
  636. {Vend},
  637. };
  638. static uchar (*asshlltab[])[VLEN] =
  639. {
  640. asshllgen,
  641. asshllclo,
  642. asshllc32,
  643. asshllchi,
  644. asdshllgen,
  645. asdshllclo,
  646. asdshllc32,
  647. asdshllchi,
  648. };
  649. /* shift asop right general case */
  650. static uchar asshrlgen[][VLEN] =
  651. {
  652. {V_a0, V_a1},
  653. {Vop, OGE, O_r, C32},
  654. {V_s0, Vins, AMOVL, O_l_lo, O_r0},
  655. {Vins, AMOVL, O_l_hi, O_r1},
  656. {Vinsra, ASHRL, O_r, O_r0},
  657. {Vinsx, Bop0, O_r, O_r1},
  658. {Vins, AMOVL, O_r0, O_l_lo},
  659. {Vins, AMOVL, O_r1, O_l_hi, Vgo},
  660. {V_p0, V_s0},
  661. {Vins, AMOVL, O_l_hi, O_r0},
  662. {Vinsx, Bop0, O_r, O_r0},
  663. {V_T1, Vzero, O_l_hi},
  664. {Vins, AMOVL, O_r0, O_l_lo},
  665. {V_F1, Vins, ASARL, C31, O_r0},
  666. {V_F1, Vins, AMOVL, O_r0, O_l_hi},
  667. {V_p0, V_f0, V_f1, Vend},
  668. };
  669. /* shift asop right, const < 32 */
  670. static uchar asshrlclo[][VLEN] =
  671. {
  672. {V_a0, V_a1},
  673. {Vins, AMOVL, O_l_lo, O_r0},
  674. {Vins, AMOVL, O_l_hi, O_r1},
  675. {Vinsra, ASHRL, O_r, O_r0},
  676. {Vinsx, Bop0, O_r, O_r1},
  677. {Vins, AMOVL, O_r0, O_l_lo},
  678. {Vins, AMOVL, O_r1, O_l_hi},
  679. {V_f0, V_f1, Vend},
  680. };
  681. /* shift asop right, const == 32 */
  682. static uchar asshrlc32[][VLEN] =
  683. {
  684. {V_a0},
  685. {Vins, AMOVL, O_l_hi, O_r0},
  686. {V_T1, Vzero, O_l_hi},
  687. {Vins, AMOVL, O_r0, O_l_lo},
  688. {V_F1, Vins, ASARL, C31, O_r0},
  689. {V_F1, Vins, AMOVL, O_r0, O_l_hi},
  690. {V_f0, Vend},
  691. };
  692. /* shift asop right, const > 32 */
  693. static uchar asshrlchi[][VLEN] =
  694. {
  695. {V_a0},
  696. {Vins, AMOVL, O_l_hi, O_r0},
  697. {V_T1, Vzero, O_l_hi},
  698. {Vinsx, Bop0, O_r, O_r0},
  699. {Vins, AMOVL, O_r0, O_l_lo},
  700. {V_F1, Vins, ASARL, C31, O_r0},
  701. {V_F1, Vins, AMOVL, O_r0, O_l_hi},
  702. {V_f0, Vend},
  703. };
  704. /* shift asop dest right general case */
  705. static uchar asdshrlgen[][VLEN] =
  706. {
  707. {Vop, OGE, O_r, C32},
  708. {V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
  709. {Vins, AMOVL, O_l_hi, O_t_hi},
  710. {Vinsr, ASHRL, O_r, O_t_rp},
  711. {Vinsx, Bop0, O_r, O_t_hi},
  712. {Vins, AMOVL, O_t_lo, O_l_lo},
  713. {Vins, AMOVL, O_t_hi, O_l_hi, Vgo},
  714. {V_p0, V_s0},
  715. {Vins, AMOVL, O_l_hi, O_t_lo},
  716. {V_T1, Vzero, O_t_hi},
  717. {Vinsx, Bop0, O_r, O_t_lo},
  718. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  719. {V_F1, Vins, ASARL, C31, O_t_hi},
  720. {Vins, AMOVL, O_t_hi, O_l_hi, V_p0},
  721. {Vend},
  722. };
  723. /* shift asop dest right, const < 32 */
  724. static uchar asdshrlclo[][VLEN] =
  725. {
  726. {Vins, AMOVL, O_l_lo, O_t_lo},
  727. {Vins, AMOVL, O_l_hi, O_t_hi},
  728. {Vinsr, ASHRL, O_r, O_t_rp},
  729. {Vinsx, Bop0, O_r, O_t_hi},
  730. {Vins, AMOVL, O_t_lo, O_l_lo},
  731. {Vins, AMOVL, O_t_hi, O_l_hi},
  732. {Vend},
  733. };
  734. /* shift asop dest right, const == 32 */
  735. static uchar asdshrlc32[][VLEN] =
  736. {
  737. {Vins, AMOVL, O_l_hi, O_t_lo},
  738. {V_T1, Vzero, O_t_hi},
  739. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  740. {V_F1, Vins, ASARL, C31, O_t_hi},
  741. {Vins, AMOVL, O_t_lo, O_l_lo},
  742. {Vins, AMOVL, O_t_hi, O_l_hi},
  743. {Vend},
  744. };
  745. /* shift asop dest, const > 32 */
  746. static uchar asdshrlchi[][VLEN] =
  747. {
  748. {Vins, AMOVL, O_l_hi, O_t_lo},
  749. {V_T1, Vzero, O_t_hi},
  750. {Vinsx, Bop0, O_r, O_t_lo},
  751. {V_T1, Vins, AMOVL, O_t_hi, O_l_hi},
  752. {V_T1, Vins, AMOVL, O_t_lo, O_l_lo},
  753. {V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
  754. {V_F1, Vins, ASARL, C31, O_t_hi},
  755. {V_F1, Vins, AMOVL, O_t_lo, O_l_lo},
  756. {V_F1, Vins, AMOVL, O_t_hi, O_l_hi},
  757. {Vend},
  758. };
  759. static uchar (*asshrltab[])[VLEN] =
  760. {
  761. asshrlgen,
  762. asshrlclo,
  763. asshrlc32,
  764. asshrlchi,
  765. asdshrlgen,
  766. asdshrlclo,
  767. asdshrlc32,
  768. asdshrlchi,
  769. };
  770. static uchar shrlargs[] = { ASHRL, 1 };
  771. static uchar sarlargs[] = { ASARL, 0 };
  772. /* ++ -- */
  773. static uchar incdec[][VLEN] =
  774. {
  775. {Vinsx, Bop0, C01, O_l_lo},
  776. {Vinsx, Bop1, C00, O_l_hi, Vend},
  777. };
  778. /* ++ -- *p */
  779. static uchar incdecpre[][VLEN] =
  780. {
  781. {Vins, AMOVL, O_l_lo, O_t_lo},
  782. {Vins, AMOVL, O_l_hi, O_t_hi},
  783. {Vinsx, Bop0, C01, O_t_lo},
  784. {Vinsx, Bop1, C00, O_t_hi},
  785. {Vins, AMOVL, O_t_lo, O_l_lo},
  786. {Vins, AMOVL, O_t_hi, O_l_hi, Vend},
  787. };
  788. /* *p ++ -- */
  789. static uchar incdecpost[][VLEN] =
  790. {
  791. {Vins, AMOVL, O_l_lo, O_t_lo},
  792. {Vins, AMOVL, O_l_hi, O_t_hi},
  793. {Vinsx, Bop0, C01, O_l_lo},
  794. {Vinsx, Bop1, C00, O_l_hi, Vend},
  795. };
  796. /* binop rp, rp */
  797. static uchar binop00[][VLEN] =
  798. {
  799. {Vinsx, Bop0, O_r_lo, O_l_lo},
  800. {Vinsx, Bop1, O_r_hi, O_l_hi, Vend},
  801. {Vend},
  802. };
  803. /* binop rp, addr */
  804. static uchar binoptmp[][VLEN] =
  805. {
  806. {V_a0, Vins, AMOVL, O_r_lo, O_r0},
  807. {Vinsx, Bop0, O_r0, O_l_lo},
  808. {Vins, AMOVL, O_r_hi, O_r0},
  809. {Vinsx, Bop1, O_r0, O_l_hi},
  810. {V_f0, Vend},
  811. };
  812. /* binop t = *a op *b */
  813. static uchar binop11[][VLEN] =
  814. {
  815. {Vins, AMOVL, O_l_lo, O_t_lo},
  816. {Vinsx, Bop0, O_r_lo, O_t_lo},
  817. {Vins, AMOVL, O_l_hi, O_t_hi},
  818. {Vinsx, Bop1, O_r_hi, O_t_hi, Vend},
  819. };
  820. /* binop t = rp +- c */
  821. static uchar add0c[][VLEN] =
  822. {
  823. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
  824. {V_r_lo_f, Vamv, Bop0, Bop1},
  825. {Vinsx, Bop1, O_r_hi, O_l_hi},
  826. {Vend},
  827. };
  828. /* binop t = rp & c */
  829. static uchar and0c[][VLEN] =
  830. {
  831. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
  832. {V_r_lo_f, Vins, AMOVL, C00, O_l_lo},
  833. {V_r_hi_t, Vinsx, Bop1, O_r_hi, O_l_hi},
  834. {V_r_hi_f, Vins, AMOVL, C00, O_l_hi},
  835. {Vend},
  836. };
  837. /* binop t = rp | c */
  838. static uchar or0c[][VLEN] =
  839. {
  840. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
  841. {V_r_hi_t, Vinsx, Bop1, O_r_hi, O_l_hi},
  842. {Vend},
  843. };
  844. /* binop t = c - rp */
  845. static uchar sub10[][VLEN] =
  846. {
  847. {V_a0, Vins, AMOVL, O_l_lo, O_r0},
  848. {Vinsx, Bop0, O_r_lo, O_r0},
  849. {Vins, AMOVL, O_l_hi, O_r_lo},
  850. {Vinsx, Bop1, O_r_hi, O_r_lo},
  851. {Vspazz, V_f0, Vend},
  852. };
  853. /* binop t = c + *b */
  854. static uchar addca[][VLEN] =
  855. {
  856. {Vins, AMOVL, O_r_lo, O_t_lo},
  857. {V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
  858. {V_l_lo_f, Vamv, Bop0, Bop1},
  859. {Vins, AMOVL, O_r_hi, O_t_hi},
  860. {Vinsx, Bop1, O_l_hi, O_t_hi},
  861. {Vend},
  862. };
  863. /* binop t = c & *b */
  864. static uchar andca[][VLEN] =
  865. {
  866. {V_l_lo_t, Vins, AMOVL, O_r_lo, O_t_lo},
  867. {V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
  868. {V_l_lo_f, Vzero, O_t_lo},
  869. {V_l_hi_t, Vins, AMOVL, O_r_hi, O_t_hi},
  870. {V_l_hi_t, Vinsx, Bop1, O_l_hi, O_t_hi},
  871. {V_l_hi_f, Vzero, O_t_hi},
  872. {Vend},
  873. };
  874. /* binop t = c | *b */
  875. static uchar orca[][VLEN] =
  876. {
  877. {Vins, AMOVL, O_r_lo, O_t_lo},
  878. {V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
  879. {Vins, AMOVL, O_r_hi, O_t_hi},
  880. {V_l_hi_t, Vinsx, Bop1, O_l_hi, O_t_hi},
  881. {Vend},
  882. };
  883. /* binop t = c - *b */
  884. static uchar subca[][VLEN] =
  885. {
  886. {Vins, AMOVL, O_l_lo, O_t_lo},
  887. {Vins, AMOVL, O_l_hi, O_t_hi},
  888. {Vinsx, Bop0, O_r_lo, O_t_lo},
  889. {Vinsx, Bop1, O_r_hi, O_t_hi},
  890. {Vend},
  891. };
  892. /* binop t = *a +- c */
  893. static uchar addac[][VLEN] =
  894. {
  895. {Vins, AMOVL, O_l_lo, O_t_lo},
  896. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
  897. {V_r_lo_f, Vamv, Bop0, Bop1},
  898. {Vins, AMOVL, O_l_hi, O_t_hi},
  899. {Vinsx, Bop1, O_r_hi, O_t_hi},
  900. {Vend},
  901. };
  902. /* binop t = *a | c */
  903. static uchar orac[][VLEN] =
  904. {
  905. {Vins, AMOVL, O_l_lo, O_t_lo},
  906. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
  907. {Vins, AMOVL, O_l_hi, O_t_hi},
  908. {V_r_hi_t, Vinsx, Bop1, O_r_hi, O_t_hi},
  909. {Vend},
  910. };
  911. /* binop t = *a & c */
  912. static uchar andac[][VLEN] =
  913. {
  914. {V_r_lo_t, Vins, AMOVL, O_l_lo, O_t_lo},
  915. {V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
  916. {V_r_lo_f, Vzero, O_t_lo},
  917. {V_r_hi_t, Vins, AMOVL, O_l_hi, O_t_hi},
  918. {V_r_hi_t, Vinsx, Bop0, O_r_hi, O_t_hi},
  919. {V_r_hi_f, Vzero, O_t_hi},
  920. {Vend},
  921. };
  922. static uchar ADDargs[] = { AADDL, AADCL };
  923. static uchar ANDargs[] = { AANDL, AANDL };
  924. static uchar ORargs[] = { AORL, AORL };
  925. static uchar SUBargs[] = { ASUBL, ASBBL };
  926. static uchar XORargs[] = { AXORL, AXORL };
  927. static uchar (*ADDtab[])[VLEN] =
  928. {
  929. add0c, addca, addac,
  930. };
  931. static uchar (*ANDtab[])[VLEN] =
  932. {
  933. and0c, andca, andac,
  934. };
  935. static uchar (*ORtab[])[VLEN] =
  936. {
  937. or0c, orca, orac,
  938. };
  939. static uchar (*SUBtab[])[VLEN] =
  940. {
  941. add0c, subca, addac,
  942. };
  943. /* mul of const32 */
  944. static uchar mulc32[][VLEN] =
  945. {
  946. {V_a0, Vop, ONE, O_l_hi, C00},
  947. {V_s0, Vins, AMOVL, O_r_lo, O_r0},
  948. {Vins, AMULL, O_r0, O_Zop},
  949. {Vgo, V_p0, V_s0},
  950. {Vins, AMOVL, O_l_hi, O_r0},
  951. {Vmul, O_r_lo, O_r0},
  952. {Vins, AMOVL, O_r_lo, O_l_hi},
  953. {Vins, AMULL, O_l_hi, O_Zop},
  954. {Vins, AADDL, O_r0, O_l_hi},
  955. {V_f0, V_p0, Vend},
  956. };
  957. /* mul of const64 */
  958. static uchar mulc64[][VLEN] =
  959. {
  960. {V_a0, Vins, AMOVL, O_r_hi, O_r0},
  961. {Vop, OOR, O_l_hi, O_r0},
  962. {Vop, ONE, O_r0, C00},
  963. {V_s0, Vins, AMOVL, O_r_lo, O_r0},
  964. {Vins, AMULL, O_r0, O_Zop},
  965. {Vgo, V_p0, V_s0},
  966. {Vmul, O_r_lo, O_l_hi},
  967. {Vins, AMOVL, O_l_lo, O_r0},
  968. {Vmul, O_r_hi, O_r0},
  969. {Vins, AADDL, O_l_hi, O_r0},
  970. {Vins, AMOVL, O_r_lo, O_l_hi},
  971. {Vins, AMULL, O_l_hi, O_Zop},
  972. {Vins, AADDL, O_r0, O_l_hi},
  973. {V_f0, V_p0, Vend},
  974. };
  975. /* mul general */
  976. static uchar mull[][VLEN] =
  977. {
  978. {V_a0, Vins, AMOVL, O_r_hi, O_r0},
  979. {Vop, OOR, O_l_hi, O_r0},
  980. {Vop, ONE, O_r0, C00},
  981. {V_s0, Vins, AMOVL, O_r_lo, O_r0},
  982. {Vins, AMULL, O_r0, O_Zop},
  983. {Vgo, V_p0, V_s0},
  984. {Vins, AIMULL, O_r_lo, O_l_hi},
  985. {Vins, AMOVL, O_l_lo, O_r0},
  986. {Vins, AIMULL, O_r_hi, O_r0},
  987. {Vins, AADDL, O_l_hi, O_r0},
  988. {Vins, AMOVL, O_r_lo, O_l_hi},
  989. {Vins, AMULL, O_l_hi, O_Zop},
  990. {Vins, AADDL, O_r0, O_l_hi},
  991. {V_f0, V_p0, Vend},
  992. };
  993. /* cast rp l to rp t */
  994. static uchar castrp[][VLEN] =
  995. {
  996. {Vmv, O_l, O_t_lo},
  997. {VT, Vins, AMOVL, O_t_lo, O_t_hi},
  998. {VT, Vins, ASARL, C31, O_t_hi},
  999. {VF, Vzero, O_t_hi},
  1000. {Vend},
  1001. };
  1002. /* cast rp l to addr t */
  1003. static uchar castrpa[][VLEN] =
  1004. {
  1005. {VT, V_a0, Vmv, O_l, O_r0},
  1006. {VT, Vins, AMOVL, O_r0, O_t_lo},
  1007. {VT, Vins, ASARL, C31, O_r0},
  1008. {VT, Vins, AMOVL, O_r0, O_t_hi},
  1009. {VT, V_f0},
  1010. {VF, Vmv, O_l, O_t_lo},
  1011. {VF, Vzero, O_t_hi},
  1012. {Vend},
  1013. };
  1014. static uchar netab0i[][VLEN] =
  1015. {
  1016. {Vop, ONE, O_l_lo, O_r_lo},
  1017. {V_s0, Vop, ONE, O_l_hi, O_r_hi},
  1018. {V_s1, Vgo, V_s2, Vgo, V_s3},
  1019. {VF, V_p0, V_p1, VT, V_p2},
  1020. {Vgo, V_p3},
  1021. {VT, V_p0, V_p1, VF, V_p2},
  1022. {Vend},
  1023. };
  1024. static uchar netabii[][VLEN] =
  1025. {
  1026. {V_a0, Vins, AMOVL, O_l_lo, O_r0},
  1027. {Vop, ONE, O_r0, O_r_lo},
  1028. {V_s0, Vins, AMOVL, O_l_hi, O_r0},
  1029. {Vop, ONE, O_r0, O_r_hi},
  1030. {V_s1, Vgo, V_s2, Vgo, V_s3},
  1031. {VF, V_p0, V_p1, VT, V_p2},
  1032. {Vgo, V_p3},
  1033. {VT, V_p0, V_p1, VF, V_p2},
  1034. {V_f0, Vend},
  1035. };
  1036. static uchar cmptab0i[][VLEN] =
  1037. {
  1038. {Vopx, Bop0, O_l_hi, O_r_hi},
  1039. {V_s0, Vins0, AJNE},
  1040. {V_s1, Vopx, Bop1, O_l_lo, O_r_lo},
  1041. {V_s2, Vgo, V_s3, Vgo, V_s4},
  1042. {VT, V_p1, V_p3},
  1043. {VF, V_p0, V_p2},
  1044. {Vgo, V_p4},
  1045. {VT, V_p0, V_p2},
  1046. {VF, V_p1, V_p3},
  1047. {Vend},
  1048. };
  1049. static uchar cmptabii[][VLEN] =
  1050. {
  1051. {V_a0, Vins, AMOVL, O_l_hi, O_r0},
  1052. {Vopx, Bop0, O_r0, O_r_hi},
  1053. {V_s0, Vins0, AJNE},
  1054. {V_s1, Vins, AMOVL, O_l_lo, O_r0},
  1055. {Vopx, Bop1, O_r0, O_r_lo},
  1056. {V_s2, Vgo, V_s3, Vgo, V_s4},
  1057. {VT, V_p1, V_p3},
  1058. {VF, V_p0, V_p2},
  1059. {Vgo, V_p4},
  1060. {VT, V_p0, V_p2},
  1061. {VF, V_p1, V_p3},
  1062. {V_f0, Vend},
  1063. };
  1064. static uchar (*NEtab[])[VLEN] =
  1065. {
  1066. netab0i, netabii,
  1067. };
  1068. static uchar (*cmptab[])[VLEN] =
  1069. {
  1070. cmptab0i, cmptabii,
  1071. };
  1072. static uchar GEargs[] = { OGT, OHS };
  1073. static uchar GTargs[] = { OGT, OHI };
  1074. static uchar HIargs[] = { OHI, OHI };
  1075. static uchar HSargs[] = { OHI, OHS };
  1076. /* Big Generator */
  1077. static void
  1078. biggen(Node *l, Node *r, Node *t, int true, uchar code[][VLEN], uchar *a)
  1079. {
  1080. int i, j, g, oc, op, lo, ro, to, xo, *xp;
  1081. Type *lt;
  1082. Prog *pr[VOPS];
  1083. Node *ot, *tl, *tr, tmps[2];
  1084. uchar *c, (*cp)[VLEN], args[VARGS];
  1085. if(a != nil)
  1086. memmove(args, a, VARGS);
  1087. //print("biggen %d %d %d\n", args[0], args[1], args[2]);
  1088. //if(l) prtree(l, "l");
  1089. //if(r) prtree(r, "r");
  1090. //if(t) prtree(t, "t");
  1091. lo = ro = to = 0;
  1092. cp = code;
  1093. for (;;) {
  1094. c = *cp++;
  1095. g = 1;
  1096. i = 0;
  1097. //print("code %d %d %d %d %d\n", c[0], c[1], c[2], c[3], c[4]);
  1098. for(;;) {
  1099. switch(op = c[i]) {
  1100. case Vgo:
  1101. if(g)
  1102. gbranch(OGOTO);
  1103. i++;
  1104. break;
  1105. case Vamv:
  1106. i += 3;
  1107. if(i > VLEN) {
  1108. diag(l, "bad Vop");
  1109. return;
  1110. }
  1111. if(g)
  1112. args[c[i - 1]] = args[c[i - 2]];
  1113. break;
  1114. case Vzero:
  1115. i += 2;
  1116. if(i > VLEN) {
  1117. diag(l, "bad Vop");
  1118. return;
  1119. }
  1120. j = i - 1;
  1121. goto op;
  1122. case Vspazz: // nasty hack to save a reg in SUB
  1123. //print("spazz\n");
  1124. if(g) {
  1125. //print("hi %R lo %R t %R\n", r->right->reg, r->left->reg, tmps[0].reg);
  1126. ot = r->right;
  1127. r->right = r->left;
  1128. tl = new(0, Z, Z);
  1129. *tl = tmps[0];
  1130. r->left = tl;
  1131. tmps[0] = *ot;
  1132. //print("hi %R lo %R t %R\n", r->right->reg, r->left->reg, tmps[0].reg);
  1133. }
  1134. i++;
  1135. break;
  1136. case Vmv:
  1137. case Vmul:
  1138. case Vshll:
  1139. i += 3;
  1140. if(i > VLEN) {
  1141. diag(l, "bad Vop");
  1142. return;
  1143. }
  1144. j = i - 2;
  1145. goto op;
  1146. case Vins0:
  1147. i += 2;
  1148. if(i > VLEN) {
  1149. diag(l, "bad Vop");
  1150. return;
  1151. }
  1152. gins(c[i - 1], Z, Z);
  1153. break;
  1154. case Vop:
  1155. case Vopx:
  1156. case Vins:
  1157. case Vinsl:
  1158. case Vinsr:
  1159. case Vinsla:
  1160. case Vinsra:
  1161. case Vinsx:
  1162. i += 4;
  1163. if(i > VLEN) {
  1164. diag(l, "bad Vop");
  1165. return;
  1166. }
  1167. j = i - 2;
  1168. goto op;
  1169. op:
  1170. if(!g)
  1171. break;
  1172. tl = Z;
  1173. tr = Z;
  1174. for(; j < i; j++) {
  1175. switch(c[j]) {
  1176. case C00:
  1177. ot = nodconst(0);
  1178. break;
  1179. case C01:
  1180. ot = nodconst(1);
  1181. break;
  1182. case C31:
  1183. ot = nodconst(31);
  1184. break;
  1185. case C32:
  1186. ot = nodconst(32);
  1187. break;
  1188. case O_l:
  1189. case O_l_lo:
  1190. ot = l; xp = &lo; xo = 0;
  1191. goto op0;
  1192. case O_l_hi:
  1193. ot = l; xp = &lo; xo = SZ_LONG;
  1194. goto op0;
  1195. case O_r:
  1196. case O_r_lo:
  1197. ot = r; xp = &ro; xo = 0;
  1198. goto op0;
  1199. case O_r_hi:
  1200. ot = r; xp = &ro; xo = SZ_LONG;
  1201. goto op0;
  1202. case O_t_lo:
  1203. ot = t; xp = &to; xo = 0;
  1204. goto op0;
  1205. case O_t_hi:
  1206. ot = t; xp = &to; xo = SZ_LONG;
  1207. goto op0;
  1208. case O_l_rp:
  1209. ot = l;
  1210. break;
  1211. case O_r_rp:
  1212. ot = r;
  1213. break;
  1214. case O_t_rp:
  1215. ot = t;
  1216. break;
  1217. case O_r0:
  1218. case O_r1:
  1219. ot = &tmps[c[j] - O_r0];
  1220. break;
  1221. case O_Zop:
  1222. ot = Z;
  1223. break;
  1224. op0:
  1225. switch(ot->op) {
  1226. case OCONST:
  1227. if(xo)
  1228. ot = hi64(ot);
  1229. else
  1230. ot = lo64(ot);
  1231. break;
  1232. case OREGPAIR:
  1233. if(xo)
  1234. ot = ot->right;
  1235. else
  1236. ot = ot->left;
  1237. break;
  1238. case OREGISTER:
  1239. break;
  1240. default:
  1241. if(xo != *xp) {
  1242. ot->xoffset += xo - *xp;
  1243. *xp = xo;
  1244. }
  1245. }
  1246. break;
  1247. default:
  1248. diag(l, "bad V_lop");
  1249. return;
  1250. }
  1251. if(tl == nil)
  1252. tl = ot;
  1253. else
  1254. tr = ot;
  1255. }
  1256. if(op == Vzero) {
  1257. zeroregm(tl);
  1258. break;
  1259. }
  1260. oc = c[i - 3];
  1261. if(op == Vinsx || op == Vopx) {
  1262. //print("%d -> %d\n", oc, args[oc]);
  1263. oc = args[oc];
  1264. }
  1265. else {
  1266. switch(oc) {
  1267. case O_a0:
  1268. case O_a1:
  1269. oc = args[oc - O_a0];
  1270. break;
  1271. }
  1272. }
  1273. switch(op) {
  1274. case Vmul:
  1275. mulgen(tr->type, tl, tr);
  1276. break;
  1277. case Vmv:
  1278. gmove(tl, tr);
  1279. break;
  1280. case Vshll:
  1281. shiftit(tr->type, tl, tr);
  1282. break;
  1283. case Vop:
  1284. case Vopx:
  1285. gopcode(oc, types[TULONG], tl, tr);
  1286. break;
  1287. case Vins:
  1288. case Vinsx:
  1289. gins(oc, tl, tr);
  1290. break;
  1291. case Vinsl:
  1292. gins(oc, tl, tr->right);
  1293. p->from.index = tr->left->reg;
  1294. break;
  1295. case Vinsr:
  1296. gins(oc, tl, tr->left);
  1297. p->from.index = tr->right->reg;
  1298. break;
  1299. case Vinsla:
  1300. gins(oc, tl, tr + 1);
  1301. p->from.index = tr->reg;
  1302. break;
  1303. case Vinsra:
  1304. gins(oc, tl, tr);
  1305. p->from.index = (tr + 1)->reg;
  1306. break;
  1307. }
  1308. break;
  1309. case VT:
  1310. g = true;
  1311. i++;
  1312. break;
  1313. case VF:
  1314. g = !true;
  1315. i++;
  1316. break;
  1317. case V_T0: case V_T1:
  1318. g = args[op - V_T0];
  1319. i++;
  1320. break;
  1321. case V_F0: case V_F1:
  1322. g = !args[op - V_F0];
  1323. i++;
  1324. break;
  1325. case V_C0: case V_C1:
  1326. if(g)
  1327. args[op - V_C0] = 0;
  1328. i++;
  1329. break;
  1330. case V_S0: case V_S1:
  1331. if(g)
  1332. args[op - V_S0] = 1;
  1333. i++;
  1334. break;
  1335. case V_l_lo_f:
  1336. g = lo64v(l) == 0;
  1337. i++;
  1338. break;
  1339. case V_l_hi_f:
  1340. g = hi64v(l) == 0;
  1341. i++;
  1342. break;
  1343. case V_l_lo_t:
  1344. g = lo64v(l) != 0;
  1345. i++;
  1346. break;
  1347. case V_l_hi_t:
  1348. g = hi64v(l) != 0;
  1349. i++;
  1350. break;
  1351. case V_l_lo_u:
  1352. g = lo64v(l) >= 0;
  1353. i++;
  1354. break;
  1355. case V_l_hi_u:
  1356. g = hi64v(l) >= 0;
  1357. i++;
  1358. break;
  1359. case V_r_lo_f:
  1360. g = lo64v(r) == 0;
  1361. i++;
  1362. break;
  1363. case V_r_hi_f:
  1364. g = hi64v(r) == 0;
  1365. i++;
  1366. break;
  1367. case V_r_lo_t:
  1368. g = lo64v(r) != 0;
  1369. i++;
  1370. break;
  1371. case V_r_hi_t:
  1372. g = hi64v(r) != 0;
  1373. i++;
  1374. break;
  1375. case V_r_lo_u:
  1376. g = lo64v(r) >= 0;
  1377. i++;
  1378. break;
  1379. case V_r_hi_u:
  1380. g = hi64v(r) >= 0;
  1381. i++;
  1382. break;
  1383. case Vend:
  1384. goto out;
  1385. case V_a0: case V_a1:
  1386. if(g) {
  1387. lt = l->type;
  1388. l->type = types[TULONG];
  1389. regalloc(&tmps[op - V_a0], l, Z);
  1390. l->type = lt;
  1391. }
  1392. i++;
  1393. break;
  1394. case V_f0: case V_f1:
  1395. if(g)
  1396. regfree(&tmps[op - V_f0]);
  1397. i++;
  1398. break;
  1399. case V_p0: case V_p1: case V_p2: case V_p3: case V_p4:
  1400. if(g)
  1401. patch(pr[op - V_p0], pc);
  1402. i++;
  1403. break;
  1404. case V_s0: case V_s1: case V_s2: case V_s3: case V_s4:
  1405. if(g)
  1406. pr[op - V_s0] = p;
  1407. i++;
  1408. break;
  1409. default:
  1410. diag(l, "bad biggen: %d", op);
  1411. return;
  1412. }
  1413. if(i == VLEN || c[i] == 0)
  1414. break;
  1415. }
  1416. }
  1417. out:
  1418. if(lo)
  1419. l->xoffset -= lo;
  1420. if(ro)
  1421. r->xoffset -= ro;
  1422. if(to)
  1423. t->xoffset -= to;
  1424. }
  1425. int
  1426. cgen64(Node *n, Node *nn)
  1427. {
  1428. Type *dt;
  1429. uchar *args, (*cp)[VLEN], (**optab)[VLEN];
  1430. int li, ri, lri, dr, si, m, op, sh, cmp, true;
  1431. Node *c, *d, *l, *r, *t, *s, nod1, nod2, nod3, nod4, nod5;
  1432. if(debug['g']) {
  1433. prtree(nn, "cgen64 lhs");
  1434. prtree(n, "cgen64");
  1435. print("AX = %d\n", reg[D_AX]);
  1436. }
  1437. cmp = 0;
  1438. sh = 0;
  1439. switch(n->op) {
  1440. case ONEG:
  1441. d = regpair(nn, n);
  1442. sugen(n->left, d, 8);
  1443. gins(ANOTL, Z, d->right);
  1444. gins(ANEGL, Z, d->left);
  1445. gins(ASBBL, nodconst(-1), d->right);
  1446. break;
  1447. case OCOM:
  1448. if(!vaddr(n->left, 0) || !vaddr(nn, 0))
  1449. d = regpair(nn, n);
  1450. else
  1451. return 0;
  1452. sugen(n->left, d, 8);
  1453. gins(ANOTL, Z, d->left);
  1454. gins(ANOTL, Z, d->right);
  1455. break;
  1456. case OADD:
  1457. optab = ADDtab;
  1458. args = ADDargs;
  1459. goto twoop;
  1460. case OAND:
  1461. optab = ANDtab;
  1462. args = ANDargs;
  1463. goto twoop;
  1464. case OOR:
  1465. optab = ORtab;
  1466. args = ORargs;
  1467. goto twoop;
  1468. case OSUB:
  1469. optab = SUBtab;
  1470. args = SUBargs;
  1471. goto twoop;
  1472. case OXOR:
  1473. optab = ORtab;
  1474. args = XORargs;
  1475. goto twoop;
  1476. case OASHL:
  1477. sh = 1;
  1478. args = nil;
  1479. optab = shlltab;
  1480. goto twoop;
  1481. case OLSHR:
  1482. sh = 1;
  1483. args = shrlargs;
  1484. optab = shrltab;
  1485. goto twoop;
  1486. case OASHR:
  1487. sh = 1;
  1488. args = sarlargs;
  1489. optab = shrltab;
  1490. goto twoop;
  1491. case OEQ:
  1492. cmp = 1;
  1493. args = nil;
  1494. optab = nil;
  1495. goto twoop;
  1496. case ONE:
  1497. cmp = 1;
  1498. args = nil;
  1499. optab = nil;
  1500. goto twoop;
  1501. case OLE:
  1502. cmp = 1;
  1503. args = nil;
  1504. optab = nil;
  1505. goto twoop;
  1506. case OLT:
  1507. cmp = 1;
  1508. args = nil;
  1509. optab = nil;
  1510. goto twoop;
  1511. case OGE:
  1512. cmp = 1;
  1513. args = nil;
  1514. optab = nil;
  1515. goto twoop;
  1516. case OGT:
  1517. cmp = 1;
  1518. args = nil;
  1519. optab = nil;
  1520. goto twoop;
  1521. case OHI:
  1522. cmp = 1;
  1523. args = nil;
  1524. optab = nil;
  1525. goto twoop;
  1526. case OHS:
  1527. cmp = 1;
  1528. args = nil;
  1529. optab = nil;
  1530. goto twoop;
  1531. case OLO:
  1532. cmp = 1;
  1533. args = nil;
  1534. optab = nil;
  1535. goto twoop;
  1536. case OLS:
  1537. cmp = 1;
  1538. args = nil;
  1539. optab = nil;
  1540. goto twoop;
  1541. twoop:
  1542. dr = nn != Z && nn->op == OREGPAIR;
  1543. l = vfunc(n->left, nn);
  1544. if(sh)
  1545. r = n->right;
  1546. else
  1547. r = vfunc(n->right, nn);
  1548. li = l->op == ONAME || l->op == OINDREG || l->op == OCONST;
  1549. ri = r->op == ONAME || r->op == OINDREG || r->op == OCONST;
  1550. #define IMM(l, r) ((l) | ((r) << 1))
  1551. lri = IMM(li, ri);
  1552. /* find out what is so easy about some operands */
  1553. if(li)
  1554. li = whatof(l, sh | cmp);
  1555. if(ri)
  1556. ri = whatof(r, cmp);
  1557. if(sh)
  1558. goto shift;
  1559. if(cmp)
  1560. goto cmp;
  1561. /* evaluate hard subexps, stealing nn if possible. */
  1562. switch(lri) {
  1563. case IMM(0, 0):
  1564. bin00:
  1565. if(l->complex > r->complex) {
  1566. if(dr)
  1567. t = nn;
  1568. else
  1569. t = regpair(Z, n);
  1570. sugen(l, t, 8);
  1571. l = t;
  1572. t = regpair(Z, n);
  1573. sugen(r, t, 8);
  1574. r = t;
  1575. }
  1576. else {
  1577. t = regpair(Z, n);
  1578. sugen(r, t, 8);
  1579. r = t;
  1580. if(dr)
  1581. t = nn;
  1582. else
  1583. t = regpair(Z, n);
  1584. sugen(l, t, 8);
  1585. l = t;
  1586. }
  1587. break;
  1588. case IMM(0, 1):
  1589. if(dr)
  1590. t = nn;
  1591. else
  1592. t = regpair(Z, n);
  1593. sugen(l, t, 8);
  1594. l = t;
  1595. break;
  1596. case IMM(1, 0):
  1597. if(n->op == OSUB && l->op == OCONST && hi64v(l) == 0) {
  1598. lri = IMM(0, 0);
  1599. goto bin00;
  1600. }
  1601. if(dr)
  1602. t = nn;
  1603. else
  1604. t = regpair(Z, n);
  1605. sugen(r, t, 8);
  1606. r = t;
  1607. break;
  1608. case IMM(1, 1):
  1609. break;
  1610. }
  1611. #define WW(l, r) ((l) | ((r) << 2))
  1612. d = Z;
  1613. dt = nn->type;
  1614. nn->type = types[TLONG];
  1615. switch(lri) {
  1616. case IMM(0, 0):
  1617. biggen(l, r, Z, 0, binop00, args);
  1618. break;
  1619. case IMM(0, 1):
  1620. switch(ri) {
  1621. case WNONE:
  1622. diag(r, "bad whatof\n");
  1623. break;
  1624. case WCONST:
  1625. biggen(l, r, Z, 0, optab[B0c], args);
  1626. break;
  1627. case WHARD:
  1628. reglcgen(&nod2, r, Z);
  1629. r = &nod2;
  1630. /* fall thru */
  1631. case WADDR:
  1632. biggen(l, r, Z, 0, binoptmp, args);
  1633. if(ri == WHARD)
  1634. regfree(r);
  1635. break;
  1636. }
  1637. break;
  1638. case IMM(1, 0):
  1639. if(n->op == OSUB) {
  1640. switch(li) {
  1641. case WNONE:
  1642. diag(l, "bad whatof\n");
  1643. break;
  1644. case WHARD:
  1645. reglcgen(&nod2, l, Z);
  1646. l = &nod2;
  1647. /* fall thru */
  1648. case WADDR:
  1649. case WCONST:
  1650. biggen(l, r, Z, 0, sub10, args);
  1651. break;
  1652. }
  1653. if(li == WHARD)
  1654. regfree(l);
  1655. }
  1656. else {
  1657. switch(li) {
  1658. case WNONE:
  1659. diag(l, "bad whatof\n");
  1660. break;
  1661. case WCONST:
  1662. biggen(r, l, Z, 0, optab[B0c], args);
  1663. break;
  1664. case WHARD:
  1665. reglcgen(&nod2, l, Z);
  1666. l = &nod2;
  1667. /* fall thru */
  1668. case WADDR:
  1669. biggen(r, l, Z, 0, binoptmp, args);
  1670. if(li == WHARD)
  1671. regfree(l);
  1672. break;
  1673. }
  1674. }
  1675. break;
  1676. case IMM(1, 1):
  1677. switch(WW(li, ri)) {
  1678. case WW(WCONST, WHARD):
  1679. if(r->op == ONAME && n->op == OAND && reduxv(l))
  1680. ri = WADDR;
  1681. break;
  1682. case WW(WHARD, WCONST):
  1683. if(l->op == ONAME && n->op == OAND && reduxv(r))
  1684. li = WADDR;
  1685. break;
  1686. }
  1687. if(li == WHARD) {
  1688. reglcgen(&nod3, l, Z);
  1689. l = &nod3;
  1690. }
  1691. if(ri == WHARD) {
  1692. reglcgen(&nod2, r, Z);
  1693. r = &nod2;
  1694. }
  1695. d = regpair(nn, n);
  1696. instpair(d, Z);
  1697. switch(WW(li, ri)) {
  1698. case WW(WCONST, WADDR):
  1699. case WW(WCONST, WHARD):
  1700. biggen(l, r, d, 0, optab[Bca], args);
  1701. break;
  1702. case WW(WADDR, WCONST):
  1703. case WW(WHARD, WCONST):
  1704. biggen(l, r, d, 0, optab[Bac], args);
  1705. break;
  1706. case WW(WADDR, WADDR):
  1707. case WW(WADDR, WHARD):
  1708. case WW(WHARD, WADDR):
  1709. case WW(WHARD, WHARD):
  1710. biggen(l, r, d, 0, binop11, args);
  1711. break;
  1712. default:
  1713. diag(r, "bad whatof pair %d %d\n", li, ri);
  1714. break;
  1715. }
  1716. if(li == WHARD)
  1717. regfree(l);
  1718. if(ri == WHARD)
  1719. regfree(r);
  1720. break;
  1721. }
  1722. nn->type = dt;
  1723. if(d != Z)
  1724. goto finished;
  1725. switch(lri) {
  1726. case IMM(0, 0):
  1727. freepair(r);
  1728. /* fall thru */;
  1729. case IMM(0, 1):
  1730. if(!dr)
  1731. storepair(l, nn, 1);
  1732. break;
  1733. case IMM(1, 0):
  1734. if(!dr)
  1735. storepair(r, nn, 1);
  1736. break;
  1737. case IMM(1, 1):
  1738. break;
  1739. }
  1740. return 1;
  1741. shift:
  1742. c = Z;
  1743. /* evaluate hard subexps, stealing nn if possible. */
  1744. /* must also secure CX. not as many optims as binop. */
  1745. switch(lri) {
  1746. case IMM(0, 0):
  1747. imm00:
  1748. if(l->complex + 1 > r->complex) {
  1749. if(dr)
  1750. t = nn;
  1751. else
  1752. t = regpair(Z, l);
  1753. sugen(l, t, 8);
  1754. l = t;
  1755. t = &nod1;
  1756. c = snarfreg(l, t, D_CX, r, &nod2);
  1757. cgen(r, t);
  1758. r = t;
  1759. }
  1760. else {
  1761. t = &nod1;
  1762. c = snarfreg(nn, t, D_CX, r, &nod2);
  1763. cgen(r, t);
  1764. r = t;
  1765. if(dr)
  1766. t = nn;
  1767. else
  1768. t = regpair(Z, l);
  1769. sugen(l, t, 8);
  1770. l = t;
  1771. }
  1772. break;
  1773. case IMM(0, 1):
  1774. imm01:
  1775. if(ri != WCONST) {
  1776. lri = IMM(0, 0);
  1777. goto imm00;
  1778. }
  1779. if(dr)
  1780. t = nn;
  1781. else
  1782. t = regpair(Z, n);
  1783. sugen(l, t, 8);
  1784. l = t;
  1785. break;
  1786. case IMM(1, 0):
  1787. imm10:
  1788. if(li != WCONST) {
  1789. lri = IMM(0, 0);
  1790. goto imm00;
  1791. }
  1792. t = &nod1;
  1793. c = snarfreg(nn, t, D_CX, r, &nod2);
  1794. cgen(r, t);
  1795. r = t;
  1796. break;
  1797. case IMM(1, 1):
  1798. if(ri != WCONST) {
  1799. lri = IMM(1, 0);
  1800. goto imm10;
  1801. }
  1802. if(li == WHARD) {
  1803. lri = IMM(0, 1);
  1804. goto imm01;
  1805. }
  1806. break;
  1807. }
  1808. d = Z;
  1809. switch(lri) {
  1810. case IMM(0, 0):
  1811. biggen(l, r, Z, 0, optab[S00], args);
  1812. break;
  1813. case IMM(0, 1):
  1814. switch(ri) {
  1815. case WNONE:
  1816. case WADDR:
  1817. case WHARD:
  1818. diag(r, "bad whatof\n");
  1819. break;
  1820. case WCONST:
  1821. m = r->vconst & 63;
  1822. s = nodconst(m);
  1823. if(m < 32)
  1824. cp = optab[Sc0];
  1825. else if(m == 32)
  1826. cp = optab[Sc1];
  1827. else
  1828. cp = optab[Sc2];
  1829. biggen(l, s, Z, 0, cp, args);
  1830. break;
  1831. }
  1832. break;
  1833. case IMM(1, 0):
  1834. /* left is const */
  1835. d = regpair(nn, n);
  1836. instpair(d, Z);
  1837. biggen(l, r, d, 0, optab[S10], args);
  1838. regfree(r);
  1839. break;
  1840. case IMM(1, 1):
  1841. d = regpair(nn, n);
  1842. instpair(d, Z);
  1843. switch(WW(li, ri)) {
  1844. case WW(WADDR, WCONST):
  1845. m = r->vconst & 63;
  1846. s = nodconst(m);
  1847. if(m < 32) {
  1848. loadpair(l, d);
  1849. l = d;
  1850. cp = optab[Sc0];
  1851. }
  1852. else if(m == 32)
  1853. cp = optab[Sac3];
  1854. else
  1855. cp = optab[Sac4];
  1856. biggen(l, s, d, 0, cp, args);
  1857. break;
  1858. default:
  1859. diag(r, "bad whatof pair %d %d\n", li, ri);
  1860. break;
  1861. }
  1862. break;
  1863. }
  1864. if(c != Z) {
  1865. gins(AMOVL, c, r);
  1866. regfree(c);
  1867. }
  1868. if(d != Z)
  1869. goto finished;
  1870. switch(lri) {
  1871. case IMM(0, 0):
  1872. regfree(r);
  1873. /* fall thru */
  1874. case IMM(0, 1):
  1875. if(!dr)
  1876. storepair(l, nn, 1);
  1877. break;
  1878. case IMM(1, 0):
  1879. regfree(r);
  1880. break;
  1881. case IMM(1, 1):
  1882. break;
  1883. }
  1884. return 1;
  1885. cmp:
  1886. op = n->op;
  1887. /* evaluate hard subexps */
  1888. switch(lri) {
  1889. case IMM(0, 0):
  1890. if(l->complex > r->complex) {
  1891. t = regpair(Z, l);
  1892. sugen(l, t, 8);
  1893. l = t;
  1894. t = regpair(Z, r);
  1895. sugen(r, t, 8);
  1896. r = t;
  1897. }
  1898. else {
  1899. t = regpair(Z, r);
  1900. sugen(r, t, 8);
  1901. r = t;
  1902. t = regpair(Z, l);
  1903. sugen(l, t, 8);
  1904. l = t;
  1905. }
  1906. break;
  1907. case IMM(1, 0):
  1908. t = r;
  1909. r = l;
  1910. l = t;
  1911. ri = li;
  1912. op = invrel[relindex(op)];
  1913. /* fall thru */
  1914. case IMM(0, 1):
  1915. t = regpair(Z, l);
  1916. sugen(l, t, 8);
  1917. l = t;
  1918. break;
  1919. case IMM(1, 1):
  1920. break;
  1921. }
  1922. true = 1;
  1923. optab = cmptab;
  1924. switch(op) {
  1925. case OEQ:
  1926. optab = NEtab;
  1927. true = 0;
  1928. break;
  1929. case ONE:
  1930. optab = NEtab;
  1931. break;
  1932. case OLE:
  1933. args = GTargs;
  1934. true = 0;
  1935. break;
  1936. case OGT:
  1937. args = GTargs;
  1938. break;
  1939. case OLS:
  1940. args = HIargs;
  1941. true = 0;
  1942. break;
  1943. case OHI:
  1944. args = HIargs;
  1945. break;
  1946. case OLT:
  1947. args = GEargs;
  1948. true = 0;
  1949. break;
  1950. case OGE:
  1951. args = GEargs;
  1952. break;
  1953. case OLO:
  1954. args = HSargs;
  1955. true = 0;
  1956. break;
  1957. case OHS:
  1958. args = HSargs;
  1959. break;
  1960. default:
  1961. diag(n, "bad cmp\n");
  1962. SET(optab);
  1963. }
  1964. switch(lri) {
  1965. case IMM(0, 0):
  1966. biggen(l, r, Z, true, optab[T0i], args);
  1967. break;
  1968. case IMM(0, 1):
  1969. case IMM(1, 0):
  1970. switch(ri) {
  1971. case WNONE:
  1972. diag(l, "bad whatof\n");
  1973. break;
  1974. case WCONST:
  1975. biggen(l, r, Z, true, optab[T0i], args);
  1976. break;
  1977. case WHARD:
  1978. reglcgen(&nod2, r, Z);
  1979. r = &nod2;
  1980. /* fall thru */
  1981. case WADDR:
  1982. biggen(l, r, Z, true, optab[T0i], args);
  1983. if(ri == WHARD)
  1984. regfree(r);
  1985. break;
  1986. }
  1987. break;
  1988. case IMM(1, 1):
  1989. if(li == WHARD) {
  1990. reglcgen(&nod3, l, Z);
  1991. l = &nod3;
  1992. }
  1993. if(ri == WHARD) {
  1994. reglcgen(&nod2, r, Z);
  1995. r = &nod2;
  1996. }
  1997. biggen(l, r, Z, true, optab[Tii], args);
  1998. if(li == WHARD)
  1999. regfree(l);
  2000. if(ri == WHARD)
  2001. regfree(r);
  2002. break;
  2003. }
  2004. switch(lri) {
  2005. case IMM(0, 0):
  2006. freepair(r);
  2007. /* fall thru */;
  2008. case IMM(0, 1):
  2009. case IMM(1, 0):
  2010. freepair(l);
  2011. break;
  2012. case IMM(1, 1):
  2013. break;
  2014. }
  2015. return 1;
  2016. case OASMUL:
  2017. case OASLMUL:
  2018. m = 0;
  2019. goto mulop;
  2020. case OMUL:
  2021. case OLMUL:
  2022. m = 1;
  2023. goto mulop;
  2024. mulop:
  2025. dr = nn != Z && nn->op == OREGPAIR;
  2026. l = vfunc(n->left, nn);
  2027. r = vfunc(n->right, nn);
  2028. if(r->op != OCONST) {
  2029. if(l->complex > r->complex) {
  2030. if(m) {
  2031. t = l;
  2032. l = r;
  2033. r = t;
  2034. }
  2035. else if(!vaddr(l, 1)) {
  2036. reglcgen(&nod5, l, Z);
  2037. l = &nod5;
  2038. evacaxdx(l);
  2039. }
  2040. }
  2041. t = regpair(Z, n);
  2042. sugen(r, t, 8);
  2043. r = t;
  2044. evacaxdx(r->left);
  2045. evacaxdx(r->right);
  2046. if(l->complex <= r->complex && !m && !vaddr(l, 1)) {
  2047. reglcgen(&nod5, l, Z);
  2048. l = &nod5;
  2049. evacaxdx(l);
  2050. }
  2051. }
  2052. if(dr)
  2053. t = nn;
  2054. else
  2055. t = regpair(Z, n);
  2056. //print("dr=%d ", dr); prtree(t, "t");
  2057. c = Z;
  2058. d = Z;
  2059. if(!nodreg(&nod1, t->left, D_AX)) {
  2060. if(t->left->reg != D_AX){
  2061. t->left->reg = D_AX;
  2062. reg[D_AX]++;
  2063. }else if(reg[D_AX] == 0)
  2064. fatal(Z, "vlong mul AX botch");
  2065. }
  2066. if(!nodreg(&nod2, t->right, D_DX)) {
  2067. if(t->right->reg != D_DX){
  2068. t->right->reg = D_DX;
  2069. reg[D_DX]++;
  2070. }else if(reg[D_DX] == 0)
  2071. fatal(Z, "vlong mul DX botch");
  2072. }
  2073. //prtree(t, "t1"); print("reg/ax = %d reg/dx = %d\n", reg[D_AX], reg[D_DX]);
  2074. if(m)
  2075. sugen(l, t, 8);
  2076. else
  2077. loadpair(l, t);
  2078. //prtree(t, "t2"); print("reg/ax = %d reg/dx = %d\n", reg[D_AX], reg[D_DX]);
  2079. if(t->left->reg != D_AX) {
  2080. c = &nod3;
  2081. regsalloc(c, t->left);
  2082. gmove(&nod1, c);
  2083. gmove(t->left, &nod1);
  2084. zapreg(t->left);
  2085. }
  2086. //print("reg/ax = %d reg/dx = %d\n", reg[D_AX], reg[D_DX]);
  2087. if(t->right->reg != D_DX) {
  2088. d = &nod4;
  2089. regsalloc(d, t->right);
  2090. gmove(&nod2, d);
  2091. if(t->right->reg == D_AX && c != nil){
  2092. /* need previous value of AX in DX */
  2093. gmove(c, &nod2);
  2094. }else
  2095. gmove(t->right, &nod2);
  2096. zapreg(t->right);
  2097. }
  2098. if(c != Z || d != Z) {
  2099. s = regpair(Z, n);
  2100. s->left = &nod1;
  2101. s->right = &nod2;
  2102. }
  2103. else
  2104. s = t;
  2105. reg[D_AX]++; /* don't allow biggen to allocate AX or DX (smashed by MUL) as temp */
  2106. reg[D_DX]++;
  2107. if(r->op == OCONST) {
  2108. if(hi64v(r) == 0)
  2109. biggen(s, r, Z, 0, mulc32, nil);
  2110. else
  2111. biggen(s, r, Z, 0, mulc64, nil);
  2112. }
  2113. else
  2114. biggen(s, r, Z, 0, mull, nil);
  2115. instpair(t, Z);
  2116. reg[D_AX]--;
  2117. reg[D_DX]--;
  2118. if(c != Z) {
  2119. gmove(&nod1, t->left);
  2120. gmove(&nod3, &nod1);
  2121. }
  2122. if(d != Z) {
  2123. gmove(&nod2, t->right);
  2124. gmove(&nod4, &nod2);
  2125. }
  2126. if(r->op == OREGPAIR)
  2127. freepair(r);
  2128. if(!m)
  2129. storepair(t, l, 0);
  2130. if(l == &nod5)
  2131. regfree(l);
  2132. if(!dr) {
  2133. if(nn != Z)
  2134. storepair(t, nn, 1);
  2135. else
  2136. freepair(t);
  2137. }
  2138. return 1;
  2139. case OASADD:
  2140. args = ADDargs;
  2141. goto vasop;
  2142. case OASAND:
  2143. args = ANDargs;
  2144. goto vasop;
  2145. case OASOR:
  2146. args = ORargs;
  2147. goto vasop;
  2148. case OASSUB:
  2149. args = SUBargs;
  2150. goto vasop;
  2151. case OASXOR:
  2152. args = XORargs;
  2153. goto vasop;
  2154. vasop:
  2155. l = n->left;
  2156. r = n->right;
  2157. dr = nn != Z && nn->op == OREGPAIR;
  2158. m = 0;
  2159. if(l->complex > r->complex) {
  2160. if(!vaddr(l, 1)) {
  2161. reglcgen(&nod1, l, Z);
  2162. l = &nod1;
  2163. }
  2164. if(!vaddr(r, 1) || nn != Z || r->op == OCONST) {
  2165. if(dr)
  2166. t = nn;
  2167. else
  2168. t = regpair(Z, r);
  2169. sugen(r, t, 8);
  2170. r = t;
  2171. m = 1;
  2172. }
  2173. }
  2174. else {
  2175. if(!vaddr(r, 1) || nn != Z || r->op == OCONST) {
  2176. if(dr)
  2177. t = nn;
  2178. else
  2179. t = regpair(Z, r);
  2180. sugen(r, t, 8);
  2181. r = t;
  2182. m = 1;
  2183. }
  2184. if(!vaddr(l, 1)) {
  2185. reglcgen(&nod1, l, Z);
  2186. l = &nod1;
  2187. }
  2188. }
  2189. if(nn != Z) {
  2190. if(n->op == OASSUB)
  2191. biggen(l, r, Z, 0, sub10, args);
  2192. else
  2193. biggen(r, l, Z, 0, binoptmp, args);
  2194. storepair(r, l, 0);
  2195. }
  2196. else {
  2197. if(m)
  2198. biggen(l, r, Z, 0, binop00, args);
  2199. else
  2200. biggen(l, r, Z, 0, binoptmp, args);
  2201. }
  2202. if(l == &nod1)
  2203. regfree(&nod1);
  2204. if(m) {
  2205. if(nn == Z)
  2206. freepair(r);
  2207. else if(!dr)
  2208. storepair(r, nn, 1);
  2209. }
  2210. return 1;
  2211. case OASASHL:
  2212. args = nil;
  2213. optab = asshlltab;
  2214. goto assh;
  2215. case OASLSHR:
  2216. args = shrlargs;
  2217. optab = asshrltab;
  2218. goto assh;
  2219. case OASASHR:
  2220. args = sarlargs;
  2221. optab = asshrltab;
  2222. goto assh;
  2223. assh:
  2224. c = Z;
  2225. l = n->left;
  2226. r = n->right;
  2227. if(r->op == OCONST) {
  2228. m = r->vconst & 63;
  2229. if(m < 32)
  2230. m = SAclo;
  2231. else if(m == 32)
  2232. m = SAc32;
  2233. else
  2234. m = SAchi;
  2235. }
  2236. else
  2237. m = SAgen;
  2238. if(l->complex > r->complex) {
  2239. if(!vaddr(l, 0)) {
  2240. reglcgen(&nod1, l, Z);
  2241. l = &nod1;
  2242. }
  2243. if(m == SAgen) {
  2244. t = &nod2;
  2245. if(l->reg == D_CX) {
  2246. regalloc(t, r, Z);
  2247. gmove(l, t);
  2248. l->reg = t->reg;
  2249. t->reg = D_CX;
  2250. }
  2251. else
  2252. c = snarfreg(nn, t, D_CX, r, &nod3);
  2253. cgen(r, t);
  2254. r = t;
  2255. }
  2256. }
  2257. else {
  2258. if(m == SAgen) {
  2259. t = &nod2;
  2260. c = snarfreg(nn, t, D_CX, r, &nod3);
  2261. cgen(r, t);
  2262. r = t;
  2263. }
  2264. if(!vaddr(l, 0)) {
  2265. reglcgen(&nod1, l, Z);
  2266. l = &nod1;
  2267. }
  2268. }
  2269. if(nn != Z) {
  2270. m += SAdgen - SAgen;
  2271. d = regpair(nn, n);
  2272. instpair(d, Z);
  2273. biggen(l, r, d, 0, optab[m], args);
  2274. if(l == &nod1) {
  2275. regfree(&nod1);
  2276. l = Z;
  2277. }
  2278. if(r == &nod2 && c == Z) {
  2279. regfree(&nod2);
  2280. r = Z;
  2281. }
  2282. if(d != nn)
  2283. storepair(d, nn, 1);
  2284. }
  2285. else
  2286. biggen(l, r, Z, 0, optab[m], args);
  2287. if(c != Z) {
  2288. gins(AMOVL, c, r);
  2289. regfree(c);
  2290. }
  2291. if(l == &nod1)
  2292. regfree(&nod1);
  2293. if(r == &nod2)
  2294. regfree(&nod2);
  2295. return 1;
  2296. case OPOSTINC:
  2297. args = ADDargs;
  2298. cp = incdecpost;
  2299. goto vinc;
  2300. case OPOSTDEC:
  2301. args = SUBargs;
  2302. cp = incdecpost;
  2303. goto vinc;
  2304. case OPREINC:
  2305. args = ADDargs;
  2306. cp = incdecpre;
  2307. goto vinc;
  2308. case OPREDEC:
  2309. args = SUBargs;
  2310. cp = incdecpre;
  2311. goto vinc;
  2312. vinc:
  2313. l = n->left;
  2314. if(!vaddr(l, 1)) {
  2315. reglcgen(&nod1, l, Z);
  2316. l = &nod1;
  2317. }
  2318. if(nn != Z) {
  2319. d = regpair(nn, n);
  2320. instpair(d, Z);
  2321. biggen(l, Z, d, 0, cp, args);
  2322. if(l == &nod1) {
  2323. regfree(&nod1);
  2324. l = Z;
  2325. }
  2326. if(d != nn)
  2327. storepair(d, nn, 1);
  2328. }
  2329. else
  2330. biggen(l, Z, Z, 0, incdec, args);
  2331. if(l == &nod1)
  2332. regfree(&nod1);
  2333. return 1;
  2334. case OCAST:
  2335. l = n->left;
  2336. if(typev[l->type->etype]) {
  2337. if(!vaddr(l, 1)) {
  2338. if(l->complex + 1 > nn->complex) {
  2339. d = regpair(Z, l);
  2340. sugen(l, d, 8);
  2341. if(!vaddr(nn, 1)) {
  2342. reglcgen(&nod1, nn, Z);
  2343. r = &nod1;
  2344. }
  2345. else
  2346. r = nn;
  2347. }
  2348. else {
  2349. if(!vaddr(nn, 1)) {
  2350. reglcgen(&nod1, nn, Z);
  2351. r = &nod1;
  2352. }
  2353. else
  2354. r = nn;
  2355. d = regpair(Z, l);
  2356. sugen(l, d, 8);
  2357. }
  2358. // d->left->type = r->type;
  2359. d->left->type = types[TLONG];
  2360. gmove(d->left, r);
  2361. freepair(d);
  2362. }
  2363. else {
  2364. if(nn->op != OREGISTER && !vaddr(nn, 1)) {
  2365. reglcgen(&nod1, nn, Z);
  2366. r = &nod1;
  2367. }
  2368. else
  2369. r = nn;
  2370. // l->type = r->type;
  2371. l->type = types[TLONG];
  2372. gmove(l, r);
  2373. }
  2374. if(r != nn)
  2375. regfree(r);
  2376. }
  2377. else {
  2378. if(typeu[l->type->etype] || cond(l->op))
  2379. si = TUNSIGNED;
  2380. else
  2381. si = TSIGNED;
  2382. regalloc(&nod1, l, Z);
  2383. cgen(l, &nod1);
  2384. if(nn->op == OREGPAIR) {
  2385. m = instpair(nn, &nod1);
  2386. biggen(&nod1, Z, nn, si == TSIGNED, castrp, nil);
  2387. }
  2388. else {
  2389. m = 0;
  2390. if(!vaddr(nn, si != TSIGNED)) {
  2391. dt = nn->type;
  2392. nn->type = types[TLONG];
  2393. reglcgen(&nod2, nn, Z);
  2394. nn->type = dt;
  2395. nn = &nod2;
  2396. }
  2397. dt = nn->type;
  2398. nn->type = types[TLONG];
  2399. biggen(&nod1, Z, nn, si == TSIGNED, castrpa, nil);
  2400. nn->type = dt;
  2401. if(nn == &nod2)
  2402. regfree(&nod2);
  2403. }
  2404. if(!m)
  2405. regfree(&nod1);
  2406. }
  2407. return 1;
  2408. default:
  2409. if(n->op == OREGPAIR) {
  2410. storepair(n, nn, 1);
  2411. return 1;
  2412. }
  2413. if(nn->op == OREGPAIR) {
  2414. loadpair(n, nn);
  2415. return 1;
  2416. }
  2417. return 0;
  2418. }
  2419. finished:
  2420. if(d != nn)
  2421. storepair(d, nn, 1);
  2422. return 1;
  2423. }
  2424. void
  2425. testv(Node *n, int true)
  2426. {
  2427. Type *t;
  2428. Node *nn, nod, *b;
  2429. if(machcap(Z)) {
  2430. b = &nod;
  2431. b->op = true ? ONE : OEQ;
  2432. b->left = n;
  2433. b->right = new(0, Z, Z);
  2434. *b->right = *nodconst(0);
  2435. b->right->type = n->type;
  2436. b->type = types[TLONG];
  2437. cgen64(b, Z);
  2438. return;
  2439. }
  2440. switch(n->op) {
  2441. case OINDREG:
  2442. case ONAME:
  2443. biggen(n, Z, Z, true, testi, nil);
  2444. break;
  2445. default:
  2446. n = vfunc(n, n);
  2447. if(n->addable >= INDEXED) {
  2448. t = n->type;
  2449. n->type = types[TLONG];
  2450. reglcgen(&nod, n, Z);
  2451. n->type = t;
  2452. n = &nod;
  2453. biggen(n, Z, Z, true, testi, nil);
  2454. if(n == &nod)
  2455. regfree(n);
  2456. }
  2457. else {
  2458. nn = regpair(Z, n);
  2459. sugen(n, nn, 8);
  2460. biggen(nn, Z, Z, true, testi, nil);
  2461. freepair(nn);
  2462. }
  2463. }
  2464. }