PageRenderTime 72ms CodeModel.GetById 32ms RepoModel.GetById 0ms app.codeStats 0ms

/utils/8c/cgen64.c

https://bitbucket.org/1337p337/inferno-os
C | 2723 lines | 2409 code | 208 blank | 106 comment | 368 complexity | 621d169e9af2198f5093e2810c2b1a05 MD5 | raw file
Possible License(s): GPL-2.0, LGPL-2.1, MPL-2.0-no-copyleft-exception 
    

  1. #include "gc.h"
    2. 

  2. 

  3. void
    4. 

  4. zeroregm(Node *n)
    5. 

  5. {
    6. 

  6. 	gins(AMOVL, nodconst(0), n);
    7. 

  7. }
    8. 

  8. 

  9. /* do we need to load the address of a vlong? */
    10. 

  10. int
    11. 

  11. vaddr(Node *n, int a)
    12. 

  12. {
    13. 

  13. 	switch(n->op) {
    14. 

  14. 	case ONAME:
    15. 

  15. 		if(a)
    16. 

  16. 			return 1;
    17. 

  17. 		return !(n->class == CEXTERN || n->class == CGLOBL || n->class == CSTATIC);
    18. 

  18. 

  19. 	case OCONST:
    20. 

  20. 	case OREGISTER:
    21. 

  21. 	case OINDREG:
    22. 

  22. 		return 1;
    23. 

  23. 	}
    24. 

  24. 	return 0;
    25. 

  25. }
    26. 

  26. 

  27. long
    28. 

  28. hi64v(Node *n)
    29. 

  29. {
    30. 

  30. 	if(align(0, types[TCHAR], Aarg1))	/* isbigendian */
    31. 

  31. 		return (long)(n->vconst) & ~0L;
    32. 

  32. 	else
    33. 

  33. 		return (long)((uvlong)n->vconst>>32) & ~0L;
    34. 

  34. }
    35. 

  35. 

  36. long
    37. 

  37. lo64v(Node *n)
    38. 

  38. {
    39. 

  39. 	if(align(0, types[TCHAR], Aarg1))	/* isbigendian */
    40. 

  40. 		return (long)((uvlong)n->vconst>>32) & ~0L;
    41. 

  41. 	else
    42. 

  42. 		return (long)(n->vconst) & ~0L;
    43. 

  43. }
    44. 

  44. 

  45. Node *
    46. 

  46. hi64(Node *n)
    47. 

  47. {
    48. 

  48. 	return nodconst(hi64v(n));
    49. 

  49. }
    50. 

  50. 

  51. Node *
    52. 

  52. lo64(Node *n)
    53. 

  53. {
    54. 

  54. 	return nodconst(lo64v(n));
    55. 

  55. }
    56. 

  56. 

  57. static Node *
    58. 

  58. anonreg(void)
    59. 

  59. {
    60. 

  60. 	Node *n;
    61. 

  61. 

  62. 	n = new(OREGISTER, Z, Z);
    63. 

  63. 	n->reg = D_NONE;
    64. 

  64. 	n->type = types[TLONG];
    65. 

  65. 	return n;
    66. 

  66. }
    67. 

  67. 

  68. static Node *
    69. 

  69. regpair(Node *n, Node *t)
    70. 

  70. {
    71. 

  71. 	Node *r;
    72. 

  72. 

  73. 	if(n != Z && n->op == OREGPAIR)
    74. 

  74. 		return n;
    75. 

  75. 	r = new(OREGPAIR, anonreg(), anonreg());
    76. 

  76. 	if(n != Z)
    77. 

  77. 		r->type = n->type;
    78. 

  78. 	else
    79. 

  79. 		r->type = t->type;
    80. 

  80. 	return r;
    81. 

  81. }
    82. 

  82. 

  83. static void
    84. 

  84. evacaxdx(Node *r)
    85. 

  85. {
    86. 

  86. 	Node nod1, nod2;
    87. 

  87. 

  88. 	if(r->reg == D_AX || r->reg == D_DX) {
    89. 

  89. 		reg[D_AX]++;
    90. 

  90. 		reg[D_DX]++;
    91. 

  91. 		/*
    92. 

  92. 		 * this is just an optim that should
    93. 

  93. 		 * check for spill
    94. 

  94. 		 */
    95. 

  95. 		r->type = types[TULONG];
    96. 

  96. 		regalloc(&nod1, r, Z);
    97. 

  97. 		nodreg(&nod2, Z, r->reg);
    98. 

  98. 		gins(AMOVL, &nod2, &nod1);
    99. 

  99. 		regfree(r);
    100. 

  100. 		r->reg = nod1.reg;
    101. 

  101. 		reg[D_AX]--;
    102. 

  102. 		reg[D_DX]--;
    103. 

  103. 	}
    104. 

  104. }
    105. 

  105. 

  106. /* lazy instantiation of register pair */
    107. 

  107. static int
    108. 

  108. instpair(Node *n, Node *l)
    109. 

  109. {
    110. 

  110. 	int r;
    111. 

  111. 

  112. 	r = 0;
    113. 

  113. 	if(n->left->reg == D_NONE) {
    114. 

  114. 		if(l != Z) {
    115. 

  115. 			n->left->reg = l->reg;
    116. 

  116. 			r = 1;
    117. 

  117. 		}
    118. 

  118. 		else
    119. 

  119. 			regalloc(n->left, n->left, Z);
    120. 

  120. 	}
    121. 

  121. 	if(n->right->reg == D_NONE)
    122. 

  122. 		regalloc(n->right, n->right, Z);
    123. 

  123. 	return r;
    124. 

  124. }
    125. 

  125. 

  126. static void
    127. 

  127. zapreg(Node *n)
    128. 

  128. {
    129. 

  129. 	if(n->reg != D_NONE) {
    130. 

  130. 		regfree(n);
    131. 

  131. 		n->reg = D_NONE;
    132. 

  132. 	}
    133. 

  133. }
    134. 

  134. 

  135. static void
    136. 

  136. freepair(Node *n)
    137. 

  137. {
    138. 

  138. 	regfree(n->left);
    139. 

  139. 	regfree(n->right);
    140. 

  140. }
    141. 

  141. 

  142. /* n is not OREGPAIR, nn is */
    143. 

  143. void
    144. 

  144. loadpair(Node *n, Node *nn)
    145. 

  145. {
    146. 

  146. 	Node nod;
    147. 

  147. 

  148. 	instpair(nn, Z);
    149. 

  149. 	if(n->op == OCONST) {
    150. 

  150. 		gins(AMOVL, lo64(n), nn->left);
    151. 

  151. 		n->xoffset += SZ_LONG;
    152. 

  152. 		gins(AMOVL, hi64(n), nn->right);
    153. 

  153. 		n->xoffset -= SZ_LONG;
    154. 

  154. 		return;
    155. 

  155. 	}
    156. 

  156. 	if(!vaddr(n, 0)) {
    157. 

  157. 		/* steal the right register for the laddr */
    158. 

  158. 		nod = regnode;
    159. 

  159. 		nod.reg = nn->right->reg;
    160. 

  160. 		lcgen(n, &nod);
    161. 

  161. 		n = &nod;
    162. 

  162. 		regind(n, n);
    163. 

  163. 		n->xoffset = 0;
    164. 

  164. 	}
    165. 

  165. 	gins(AMOVL, n, nn->left);
    166. 

  166. 	n->xoffset += SZ_LONG;
    167. 

  167. 	gins(AMOVL, n, nn->right);
    168. 

  168. 	n->xoffset -= SZ_LONG;
    169. 

  169. }
    170. 

  170. 

  171. /* n is OREGPAIR, nn is not */
    172. 

  172. static void
    173. 

  173. storepair(Node *n, Node *nn, int f)
    174. 

  174. {
    175. 

  175. 	Node nod;
    176. 

  176. 

  177. 	if(!vaddr(nn, 0)) {
    178. 

  178. 		reglcgen(&nod, nn, Z);
    179. 

  179. 		nn = &nod;
    180. 

  180. 	}
    181. 

  181. 	gins(AMOVL, n->left, nn);
    182. 

  182. 	nn->xoffset += SZ_LONG;
    183. 

  183. 	gins(AMOVL, n->right, nn);
    184. 

  184. 	nn->xoffset -= SZ_LONG;
    185. 

  185. 	if(nn == &nod)
    186. 

  186. 		regfree(&nod);
    187. 

  187. 	if(f)
    188. 

  188. 		freepair(n);
    189. 

  189. }
    190. 

  190. 

  191. /* generate a cast t from n to tt */
    192. 

  192. static void
    193. 

  193. cast(Node *n, Type *t, Node *nn)
    194. 

  194. {
    195. 

  195. 	Node *r;
    196. 

  196. 

  197. 	r = new(OCAST, n, Z);
    198. 

  198. 	r->type = t;
    199. 

  199. 	sugen(r, nn, 8);
    200. 

  200. }
    201. 

  201. 

  202. static void
    203. 

  203. swapregs(Node *a, Node *b)
    204. 

  204. {
    205. 

  205. 	int t;
    206. 

  206. 

  207. 	t = a->reg;
    208. 

  208. 	a->reg = b->reg;
    209. 

  209. 	b->reg = t;
    210. 

  210. }
    211. 

  211. 

  212. static void
    213. 

  213. swappairs(Node *a, Node *b)
    214. 

  214. {
    215. 

  215. 	swapregs(a->left, b->left);
    216. 

  216. 	swapregs(a->right, b->right);
    217. 

  217. }
    218. 

  218. 

  219. static int
    220. 

  220. saveme(Node *n)
    221. 

  221. {
    222. 

  222. 	int r;
    223. 

  223. 

  224. 	r = n->reg;
    225. 

  225. 	return r >= D_AX && r <= D_DI;
    226. 

  226. }
    227. 

  227. 

  228. static void
    229. 

  229. saveit(Node *n, Node *t, Node *r)
    230. 

  230. {
    231. 

  231. 	Node nod;
    232. 

  232. 

  233. 	if(saveme(n)) {
    234. 

  234. 		t->reg = n->reg;
    235. 

  235. 		gins(AMOVL, t, r);
    236. 

  236. 		r->xoffset += SZ_LONG;
    237. 

  237. 		if(n->reg == D_AX) {
    238. 

  238. 			regalloc(&nod, n, Z);
    239. 

  239. 			regfree(n);
    240. 

  240. 			n->reg = nod.reg;
    241. 

  241. 		}
    242. 

  242. 	}
    243. 

  243. }
    244. 

  244. 

  245. static void
    246. 

  246. restoreit(Node *n, Node *t, Node *r)
    247. 

  247. {
    248. 

  248. 	if(saveme(n)) {
    249. 

  249. 		t->reg = n->reg;
    250. 

  250. 		gins(AMOVL, r, t);
    251. 

  251. 		r->xoffset += SZ_LONG;
    252. 

  252. 	}
    253. 

  253. }
    254. 

  254. 

  255. enum
    256. 

  256. {
    257. 

  257. /* 4 only, see WW */
    258. 

  258. 	WNONE	= 0,
    259. 

  259. 	WCONST,
    260. 

  260. 	WADDR,
    261. 

  261. 	WHARD,
    262. 

  262. };
    263. 

  263. 

  264. static int
    265. 

  265. whatof(Node *n, int a)
    266. 

  266. {
    267. 

  267. 	if(n->op == OCONST)
    268. 

  268. 		return WCONST;
    269. 

  269. 	return !vaddr(n, a) ? WHARD : WADDR;
    270. 

  270. }
    271. 

  271. 

  272. /* can upgrade an extern to addr for AND */
    273. 

  273. static int
    274. 

  274. reduxv(Node *n)
    275. 

  275. {
    276. 

  276. 	return lo64v(n) == 0 || hi64v(n) == 0;
    277. 

  277. }
    278. 

  278. 

  279. int
    280. 

  280. cond(int op)
    281. 

  281. {
    282. 

  282. 	switch(op) {
    283. 

  283. 	case OANDAND:
    284. 

  284. 	case OOROR:
    285. 

  285. 	case ONOT:
    286. 

  286. 		return 1;
    287. 

  287. 

  288. 	case OEQ:
    289. 

  289. 	case ONE:
    290. 

  290. 	case OLE:
    291. 

  291. 	case OLT:
    292. 

  292. 	case OGE:
    293. 

  293. 	case OGT:
    294. 

  294. 	case OHI:
    295. 

  295. 	case OHS:
    296. 

  296. 	case OLO:
    297. 

  297. 	case OLS:
    298. 

  298. 		return 1;
    299. 

  299. 	}
    300. 

  300. 	return 0;
    301. 

  301. }
    302. 

  302. 

  303. /*
    304. 

  304.  * for a func operand call it and then return
    305. 

  305.  * the safe node
    306. 

  306.  */
    307. 

  307. static Node *
    308. 

  308. vfunc(Node *n, Node *nn)
    309. 

  309. {
    310. 

  310. 	Node *t;
    311. 

  311. 

  312. 	if(n->op != OFUNC)
    313. 

  313. 		return n;
    314. 

  314. 	t = new(0, Z, Z);
    315. 

  315. 	if(nn == Z || nn == nodret)
    316. 

  316. 		nn = n;
    317. 

  317. 	regsalloc(t, nn);
    318. 

  318. 	sugen(n, t, 8);
    319. 

  319. 	return t;
    320. 

  320. }
    321. 

  321. 

  322. static int
    323. 

  323. forcereg(Node *d, int r, int o, Node *t)
    324. 

  324. {
    325. 

  325. 	int a;
    326. 

  326. 

  327. 	if(d->reg != D_NONE)
    328. 

  328. 		diag(Z, "force alloc");
    329. 

  329. 	d->reg = r;
    330. 

  330. 	a = 0;
    331. 

  331. 	if(reg[r]) {
    332. 

  332. 		reg[o]++;
    333. 

  333. 		regalloc(t, d, Z);
    334. 

  334. 		a = 1;
    335. 

  335. 		gins(AMOVL, d, t);
    336. 

  336. 		reg[o]--;
    337. 

  337. 	}
    338. 

  338. 	reg[r]++;
    339. 

  339. 	return a;
    340. 

  340. }
    341. 

  341. 

  342. /* try to steal a reg */
    343. 

  343. static int
    344. 

  344. getreg(Node **np, Node *t, int r)
    345. 

  345. {
    346. 

  346. 	Node *n, *p;
    347. 

  347. 

  348. 	n = *np;
    349. 

  349. 	if(n->reg == r) {
    350. 

  350. 		p = new(0, Z, Z);
    351. 

  351. 		regalloc(p, n, Z);
    352. 

  352. 		gins(AMOVL, n, p);
    353. 

  353. 		*t = *n;
    354. 

  354. 		*np = p;
    355. 

  355. 		return 1;
    356. 

  356. 	}
    357. 

  357. 	return 0;
    358. 

  358. }
    359. 

  359. 

  360. static Node *
    361. 

  361. snarfreg(Node *n, Node *t, int r, Node *d, Node *c)
    362. 

  362. {
    363. 

  363. 	if(n == Z || n->op != OREGPAIR || (!getreg(&n->left, t, r) && !getreg(&n->right, t, r))) {
    364. 

  364. 		if(nodreg(t, Z, r)) {
    365. 

  365. 			regalloc(c, d, Z);
    366. 

  366. 			gins(AMOVL, t, c);
    367. 

  367. 			reg[r]++;
    368. 

  368. 			return c;
    369. 

  369. 		}
    370. 

  370. 		reg[r]++;
    371. 

  371. 	}
    372. 

  372. 	return Z;
    373. 

  373. }
    374. 

  374. 

  375. enum
    376. 

  376. {
    377. 

  377. 	Vstart	= OEND,
    378. 

  378. 

  379. 	Vgo,
    380. 

  380. 	Vamv,
    381. 

  381. 	Vmv,
    382. 

  382. 	Vzero,
    383. 

  383. 	Vop,
    384. 

  384. 	Vopx,
    385. 

  385. 	Vins,
    386. 

  386. 	Vins0,
    387. 

  387. 	Vinsl,
    388. 

  388. 	Vinsr,
    389. 

  389. 	Vinsla,
    390. 

  390. 	Vinsra,
    391. 

  391. 	Vinsx,
    392. 

  392. 	Vmul,
    393. 

  393. 	Vshll,
    394. 

  394. 	VT,
    395. 

  395. 	VF,
    396. 

  396. 	V_l_lo_f,
    397. 

  397. 	V_l_hi_f,
    398. 

  398. 	V_l_lo_t,
    399. 

  399. 	V_l_hi_t,
    400. 

  400. 	V_l_lo_u,
    401. 

  401. 	V_l_hi_u,
    402. 

  402. 	V_r_lo_f,
    403. 

  403. 	V_r_hi_f,
    404. 

  404. 	V_r_lo_t,
    405. 

  405. 	V_r_hi_t,
    406. 

  406. 	V_r_lo_u,
    407. 

  407. 	V_r_hi_u,
    408. 

  408. 	Vspazz,
    409. 

  409. 	Vend,
    410. 

  410. 

  411. 	V_T0,
    412. 

  412. 	V_T1,
    413. 

  413. 	V_F0,
    414. 

  414. 	V_F1,
    415. 

  415. 

  416. 	V_a0,
    417. 

  417. 	V_a1,
    418. 

  418. 	V_f0,
    419. 

  419. 	V_f1,
    420. 

  420. 

  421. 	V_p0,
    422. 

  422. 	V_p1,
    423. 

  423. 	V_p2,
    424. 

  424. 	V_p3,
    425. 

  425. 	V_p4,
    426. 

  426. 

  427. 	V_s0,
    428. 

  428. 	V_s1,
    429. 

  429. 	V_s2,
    430. 

  430. 	V_s3,
    431. 

  431. 	V_s4,
    432. 

  432. 

  433. 	C00,
    434. 

  434. 	C01,
    435. 

  435. 	C31,
    436. 

  436. 	C32,
    437. 

  437. 

  438. 	O_l_lo,
    439. 

  439. 	O_l_hi,
    440. 

  440. 	O_r_lo,
    441. 

  441. 	O_r_hi,
    442. 

  442. 	O_t_lo,
    443. 

  443. 	O_t_hi,
    444. 

  444. 	O_l,
    445. 

  445. 	O_r,
    446. 

  446. 	O_l_rp,
    447. 

  447. 	O_r_rp,
    448. 

  448. 	O_t_rp,
    449. 

  449. 	O_r0,
    450. 

  450. 	O_r1,
    451. 

  451. 	O_Zop,
    452. 

  452. 

  453. 	O_a0,
    454. 

  454. 	O_a1,
    455. 

  455. 

  456. 	V_C0,
    457. 

  457. 	V_C1,
    458. 

  458. 

  459. 	V_S0,
    460. 

  460. 	V_S1,
    461. 

  461. 

  462. 	VOPS	= 5,
    463. 

  463. 	VLEN	= 5,
    464. 

  464. 	VARGS	= 2,
    465. 

  465. 

  466. 	S00	= 0,
    467. 

  467. 	Sc0,
    468. 

  468. 	Sc1,
    469. 

  469. 	Sc2,
    470. 

  470. 	Sac3,
    471. 

  471. 	Sac4,
    472. 

  472. 	S10,
    473. 

  473. 

  474. 	SAgen	= 0,
    475. 

  475. 	SAclo,
    476. 

  476. 	SAc32,
    477. 

  477. 	SAchi,
    478. 

  478. 	SAdgen,
    479. 

  479. 	SAdclo,
    480. 

  480. 	SAdc32,
    481. 

  481. 	SAdchi,
    482. 

  482. 

  483. 	B0c	= 0,
    484. 

  484. 	Bca,
    485. 

  485. 	Bac,
    486. 

  486. 

  487. 	T0i	= 0,
    488. 

  488. 	Tii,
    489. 

  489. 

  490. 	Bop0	= 0,
    491. 

  491. 	Bop1,
    492. 

  492. };
    493. 

  493. 

  494. /*
    495. 

  495.  * _testv:
    496. 

  496.  * 	CMPL	lo,$0
    497. 

  497.  * 	JNE	true
    498. 

  498.  * 	CMPL	hi,$0
    499. 

  499.  * 	JNE	true
    500. 

  500.  * 	GOTO	false
    501. 

  501.  * false:
    502. 

  502.  * 	GOTO	code
    503. 

  503.  * true:
    504. 

  504.  * 	GOTO	patchme
    505. 

  505.  * code:
    506. 

  506.  */
    507. 

  507. 

  508. static uchar	testi[][VLEN] =
    509. 

  509. {
    510. 

  510. 	{Vop, ONE, O_l_lo, C00},
    511. 

  511. 	{V_s0, Vop, ONE, O_l_hi, C00},
    512. 

  512. 	{V_s1, Vgo, V_s2, Vgo, V_s3},
    513. 

  513. 	{VF, V_p0, V_p1, VT, V_p2},
    514. 

  514. 	{Vgo, V_p3},
    515. 

  515. 	{VT, V_p0, V_p1, VF, V_p2},
    516. 

  516. 	{Vend},
    517. 

  517. };
    518. 

  518. 

  519. /* shift left general case */
    520. 

  520. static uchar	shll00[][VLEN] =
    521. 

  521. {
    522. 

  522. 	{Vop, OGE, O_r, C32},
    523. 

  523. 	{V_s0, Vinsl, ASHLL, O_r, O_l_rp},
    524. 

  524. 	{Vins, ASHLL, O_r, O_l_lo, Vgo},
    525. 

  525. 	{V_p0, V_s0},
    526. 

  526. 	{Vins, ASHLL, O_r, O_l_lo},
    527. 

  527. 	{Vins, AMOVL, O_l_lo, O_l_hi},
    528. 

  528. 	{Vzero, O_l_lo, V_p0, Vend},
    529. 

  529. };
    530. 

  530. 

  531. /* shift left rp, const < 32 */
    532. 

  532. static uchar	shllc0[][VLEN] =
    533. 

  533. {
    534. 

  534. 	{Vinsl, ASHLL, O_r, O_l_rp},
    535. 

  535. 	{Vshll, O_r, O_l_lo, Vend},
    536. 

  536. };
    537. 

  537. 

  538. /* shift left rp, const == 32 */
    539. 

  539. static uchar	shllc1[][VLEN] =
    540. 

  540. {
    541. 

  541. 	{Vins, AMOVL, O_l_lo, O_l_hi},
    542. 

  542. 	{Vzero, O_l_lo, Vend},
    543. 

  543. };
    544. 

  544. 

  545. /* shift left rp, const > 32 */
    546. 

  546. static uchar	shllc2[][VLEN] =
    547. 

  547. {
    548. 

  548. 	{Vshll, O_r, O_l_lo},
    549. 

  549. 	{Vins, AMOVL, O_l_lo, O_l_hi},
    550. 

  550. 	{Vzero, O_l_lo, Vend},
    551. 

  551. };
    552. 

  552. 

  553. /* shift left addr, const == 32 */
    554. 

  554. static uchar	shllac3[][VLEN] =
    555. 

  555. {
    556. 

  556. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    557. 

  557. 	{Vzero, O_t_lo, Vend},
    558. 

  558. };
    559. 

  559. 

  560. /* shift left addr, const > 32 */
    561. 

  561. static uchar	shllac4[][VLEN] =
    562. 

  562. {
    563. 

  563. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    564. 

  564. 	{Vshll, O_r, O_t_hi},
    565. 

  565. 	{Vzero, O_t_lo, Vend},
    566. 

  566. };
    567. 

  567. 

  568. /* shift left of constant */
    569. 

  569. static uchar	shll10[][VLEN] =
    570. 

  570. {
    571. 

  571. 	{Vop, OGE, O_r, C32},
    572. 

  572. 	{V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
    573. 

  573. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    574. 

  574. 	{Vinsl, ASHLL, O_r, O_t_rp},
    575. 

  575. 	{Vins, ASHLL, O_r, O_t_lo, Vgo},
    576. 

  576. 	{V_p0, V_s0},
    577. 

  577. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    578. 

  578. 	{V_l_lo_t, Vins, ASHLL, O_r, O_t_hi},
    579. 

  579. 	{Vzero, O_t_lo, V_p0, Vend},
    580. 

  580. };
    581. 

  581. 

  582. static uchar	(*shlltab[])[VLEN] =
    583. 

  583. {
    584. 

  584. 	shll00,
    585. 

  585. 	shllc0,
    586. 

  586. 	shllc1,
    587. 

  587. 	shllc2,
    588. 

  588. 	shllac3,
    589. 

  589. 	shllac4,
    590. 

  590. 	shll10,
    591. 

  591. };
    592. 

  592. 

  593. /* shift right general case */
    594. 

  594. static uchar	shrl00[][VLEN] =
    595. 

  595. {
    596. 

  596. 	{Vop, OGE, O_r, C32},
    597. 

  597. 	{V_s0, Vinsr, ASHRL, O_r, O_l_rp},
    598. 

  598. 	{Vins, O_a0, O_r, O_l_hi, Vgo},
    599. 

  599. 	{V_p0, V_s0},
    600. 

  600. 	{Vins, O_a0, O_r, O_l_hi},
    601. 

  601. 	{Vins, AMOVL, O_l_hi, O_l_lo},
    602. 

  602. 	{V_T1, Vzero, O_l_hi},
    603. 

  603. 	{V_F1, Vins, ASARL, C31, O_l_hi},
    604. 

  604. 	{V_p0, Vend},
    605. 

  605. };
    606. 

  606. 

  607. /* shift right rp, const < 32 */
    608. 

  608. static uchar	shrlc0[][VLEN] =
    609. 

  609. {
    610. 

  610. 	{Vinsr, ASHRL, O_r, O_l_rp},
    611. 

  611. 	{Vins, O_a0, O_r, O_l_hi, Vend},
    612. 

  612. };
    613. 

  613. 

  614. /* shift right rp, const == 32 */
    615. 

  615. static uchar	shrlc1[][VLEN] =
    616. 

  616. {
    617. 

  617. 	{Vins, AMOVL, O_l_hi, O_l_lo},
    618. 

  618. 	{V_T1, Vzero, O_l_hi},
    619. 

  619. 	{V_F1, Vins, ASARL, C31, O_l_hi},
    620. 

  620. 	{Vend},
    621. 

  621. };
    622. 

  622. 

  623. /* shift right rp, const > 32 */
    624. 

  624. static uchar	shrlc2[][VLEN] =
    625. 

  625. {
    626. 

  626. 	{Vins, O_a0, O_r, O_l_hi},
    627. 

  627. 	{Vins, AMOVL, O_l_hi, O_l_lo},
    628. 

  628. 	{V_T1, Vzero, O_l_hi},
    629. 

  629. 	{V_F1, Vins, ASARL, C31, O_l_hi},
    630. 

  630. 	{Vend},
    631. 

  631. };
    632. 

  632. 

  633. /* shift right addr, const == 32 */
    634. 

  634. static uchar	shrlac3[][VLEN] =
    635. 

  635. {
    636. 

  636. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    637. 

  637. 	{V_T1, Vzero, O_t_hi},
    638. 

  638. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    639. 

  639. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    640. 

  640. 	{Vend},
    641. 

  641. };
    642. 

  642. 

  643. /* shift right addr, const > 32 */
    644. 

  644. static uchar	shrlac4[][VLEN] =
    645. 

  645. {
    646. 

  646. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    647. 

  647. 	{Vins, O_a0, O_r, O_t_lo},
    648. 

  648. 	{V_T1, Vzero, O_t_hi},
    649. 

  649. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    650. 

  650. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    651. 

  651. 	{Vend},
    652. 

  652. };
    653. 

  653. 

  654. /* shift right of constant */
    655. 

  655. static uchar	shrl10[][VLEN] =
    656. 

  656. {
    657. 

  657. 	{Vop, OGE, O_r, C32},
    658. 

  658. 	{V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
    659. 

  659. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    660. 

  660. 	{Vinsr, ASHRL, O_r, O_t_rp},
    661. 

  661. 	{Vins, O_a0, O_r, O_t_hi, Vgo},
    662. 

  662. 	{V_p0, V_s0},
    663. 

  663. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    664. 

  664. 	{V_l_hi_t, Vins, O_a0, O_r, O_t_lo},
    665. 

  665. 	{V_l_hi_u, V_S1},
    666. 

  666. 	{V_T1, Vzero, O_t_hi, V_p0},
    667. 

  667. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    668. 

  668. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    669. 

  669. 	{Vend},
    670. 

  670. };
    671. 

  671. 

  672. static uchar	(*shrltab[])[VLEN] =
    673. 

  673. {
    674. 

  674. 	shrl00,
    675. 

  675. 	shrlc0,
    676. 

  676. 	shrlc1,
    677. 

  677. 	shrlc2,
    678. 

  678. 	shrlac3,
    679. 

  679. 	shrlac4,
    680. 

  680. 	shrl10,
    681. 

  681. };
    682. 

  682. 

  683. /* shift asop left general case */
    684. 

  684. static uchar	asshllgen[][VLEN] =
    685. 

  685. {
    686. 

  686. 	{V_a0, V_a1},
    687. 

  687. 	{Vop, OGE, O_r, C32},
    688. 

  688. 	{V_s0, Vins, AMOVL, O_l_lo, O_r0},
    689. 

  689. 	{Vins, AMOVL, O_l_hi, O_r1},
    690. 

  690. 	{Vinsla, ASHLL, O_r, O_r0},
    691. 

  691. 	{Vins, ASHLL, O_r, O_r0},
    692. 

  692. 	{Vins, AMOVL, O_r1, O_l_hi},
    693. 

  693. 	{Vins, AMOVL, O_r0, O_l_lo, Vgo},
    694. 

  694. 	{V_p0, V_s0},
    695. 

  695. 	{Vins, AMOVL, O_l_lo, O_r0},
    696. 

  696. 	{Vzero, O_l_lo},
    697. 

  697. 	{Vins, ASHLL, O_r, O_r0},
    698. 

  698. 	{Vins, AMOVL, O_r0, O_l_hi, V_p0},
    699. 

  699. 	{V_f0, V_f1, Vend},
    700. 

  700. };
    701. 

  701. 

  702. /* shift asop left, const < 32 */
    703. 

  703. static uchar	asshllclo[][VLEN] =
    704. 

  704. {
    705. 

  705. 	{V_a0, V_a1},
    706. 

  706. 	{Vins, AMOVL, O_l_lo, O_r0},
    707. 

  707. 	{Vins, AMOVL, O_l_hi, O_r1},
    708. 

  708. 	{Vinsla, ASHLL, O_r, O_r0},
    709. 

  709. 	{Vshll, O_r, O_r0},
    710. 

  710. 	{Vins, AMOVL, O_r1, O_l_hi},
    711. 

  711. 	{Vins, AMOVL, O_r0, O_l_lo},
    712. 

  712. 	{V_f0, V_f1, Vend},
    713. 

  713. };
    714. 

  714. 

  715. /* shift asop left, const == 32 */
    716. 

  716. static uchar	asshllc32[][VLEN] =
    717. 

  717. {
    718. 

  718. 	{V_a0},
    719. 

  719. 	{Vins, AMOVL, O_l_lo, O_r0},
    720. 

  720. 	{Vzero, O_l_lo},
    721. 

  721. 	{Vins, AMOVL, O_r0, O_l_hi},
    722. 

  722. 	{V_f0, Vend},
    723. 

  723. };
    724. 

  724. 

  725. /* shift asop left, const > 32 */
    726. 

  726. static uchar	asshllchi[][VLEN] =
    727. 

  727. {
    728. 

  728. 	{V_a0},
    729. 

  729. 	{Vins, AMOVL, O_l_lo, O_r0},
    730. 

  730. 	{Vzero, O_l_lo},
    731. 

  731. 	{Vshll, O_r, O_r0},
    732. 

  732. 	{Vins, AMOVL, O_r0, O_l_hi},
    733. 

  733. 	{V_f0, Vend},
    734. 

  734. };
    735. 

  735. 

  736. /* shift asop dest left general case */
    737. 

  737. static uchar	asdshllgen[][VLEN] =
    738. 

  738. {
    739. 

  739. 	{Vop, OGE, O_r, C32},
    740. 

  740. 	{V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
    741. 

  741. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    742. 

  742. 	{Vinsl, ASHLL, O_r, O_t_rp},
    743. 

  743. 	{Vins, ASHLL, O_r, O_t_lo},
    744. 

  744. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    745. 

  745. 	{Vins, AMOVL, O_t_lo, O_l_lo, Vgo},
    746. 

  746. 	{V_p0, V_s0},
    747. 

  747. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    748. 

  748. 	{Vzero, O_l_lo},
    749. 

  749. 	{Vins, ASHLL, O_r, O_t_hi},
    750. 

  750. 	{Vzero, O_t_lo},
    751. 

  751. 	{Vins, AMOVL, O_t_hi, O_l_hi, V_p0},
    752. 

  752. 	{Vend},
    753. 

  753. };
    754. 

  754. 

  755. /* shift asop dest left, const < 32 */
    756. 

  756. static uchar	asdshllclo[][VLEN] =
    757. 

  757. {
    758. 

  758. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    759. 

  759. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    760. 

  760. 	{Vinsl, ASHLL, O_r, O_t_rp},
    761. 

  761. 	{Vshll, O_r, O_t_lo},
    762. 

  762. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    763. 

  763. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    764. 

  764. 	{Vend},
    765. 

  765. };
    766. 

  766. 

  767. /* shift asop dest left, const == 32 */
    768. 

  768. static uchar	asdshllc32[][VLEN] =
    769. 

  769. {
    770. 

  770. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    771. 

  771. 	{Vzero, O_t_lo},
    772. 

  772. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    773. 

  773. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    774. 

  774. 	{Vend},
    775. 

  775. };
    776. 

  776. 

  777. /* shift asop dest, const > 32 */
    778. 

  778. static uchar	asdshllchi[][VLEN] =
    779. 

  779. {
    780. 

  780. 	{Vins, AMOVL, O_l_lo, O_t_hi},
    781. 

  781. 	{Vzero, O_t_lo},
    782. 

  782. 	{Vshll, O_r, O_t_hi},
    783. 

  783. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    784. 

  784. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    785. 

  785. 	{Vend},
    786. 

  786. };
    787. 

  787. 

  788. static uchar	(*asshlltab[])[VLEN] =
    789. 

  789. {
    790. 

  790. 	asshllgen,
    791. 

  791. 	asshllclo,
    792. 

  792. 	asshllc32,
    793. 

  793. 	asshllchi,
    794. 

  794. 	asdshllgen,
    795. 

  795. 	asdshllclo,
    796. 

  796. 	asdshllc32,
    797. 

  797. 	asdshllchi,
    798. 

  798. };
    799. 

  799. 

  800. /* shift asop right general case */
    801. 

  801. static uchar	asshrlgen[][VLEN] =
    802. 

  802. {
    803. 

  803. 	{V_a0, V_a1},
    804. 

  804. 	{Vop, OGE, O_r, C32},
    805. 

  805. 	{V_s0, Vins, AMOVL, O_l_lo, O_r0},
    806. 

  806. 	{Vins, AMOVL, O_l_hi, O_r1},
    807. 

  807. 	{Vinsra, ASHRL, O_r, O_r0},
    808. 

  808. 	{Vinsx, Bop0, O_r, O_r1},
    809. 

  809. 	{Vins, AMOVL, O_r0, O_l_lo},
    810. 

  810. 	{Vins, AMOVL, O_r1, O_l_hi, Vgo},
    811. 

  811. 	{V_p0, V_s0},
    812. 

  812. 	{Vins, AMOVL, O_l_hi, O_r0},
    813. 

  813. 	{Vinsx, Bop0, O_r, O_r0},
    814. 

  814. 	{V_T1, Vzero, O_l_hi},
    815. 

  815. 	{Vins, AMOVL, O_r0, O_l_lo},
    816. 

  816. 	{V_F1, Vins, ASARL, C31, O_r0},
    817. 

  817. 	{V_F1, Vins, AMOVL, O_r0, O_l_hi},
    818. 

  818. 	{V_p0, V_f0, V_f1, Vend},
    819. 

  819. };
    820. 

  820. 

  821. /* shift asop right, const < 32 */
    822. 

  822. static uchar	asshrlclo[][VLEN] =
    823. 

  823. {
    824. 

  824. 	{V_a0, V_a1},
    825. 

  825. 	{Vins, AMOVL, O_l_lo, O_r0},
    826. 

  826. 	{Vins, AMOVL, O_l_hi, O_r1},
    827. 

  827. 	{Vinsra, ASHRL, O_r, O_r0},
    828. 

  828. 	{Vinsx, Bop0, O_r, O_r1},
    829. 

  829. 	{Vins, AMOVL, O_r0, O_l_lo},
    830. 

  830. 	{Vins, AMOVL, O_r1, O_l_hi},
    831. 

  831. 	{V_f0, V_f1, Vend},
    832. 

  832. };
    833. 

  833. 

  834. /* shift asop right, const == 32 */
    835. 

  835. static uchar	asshrlc32[][VLEN] =
    836. 

  836. {
    837. 

  837. 	{V_a0},
    838. 

  838. 	{Vins, AMOVL, O_l_hi, O_r0},
    839. 

  839. 	{V_T1, Vzero, O_l_hi},
    840. 

  840. 	{Vins, AMOVL, O_r0, O_l_lo},
    841. 

  841. 	{V_F1, Vins, ASARL, C31, O_r0},
    842. 

  842. 	{V_F1, Vins, AMOVL, O_r0, O_l_hi},
    843. 

  843. 	{V_f0, Vend},
    844. 

  844. };
    845. 

  845. 

  846. /* shift asop right, const > 32 */
    847. 

  847. static uchar	asshrlchi[][VLEN] =
    848. 

  848. {
    849. 

  849. 	{V_a0},
    850. 

  850. 	{Vins, AMOVL, O_l_hi, O_r0},
    851. 

  851. 	{V_T1, Vzero, O_l_hi},
    852. 

  852. 	{Vinsx, Bop0, O_r, O_r0},
    853. 

  853. 	{Vins, AMOVL, O_r0, O_l_lo},
    854. 

  854. 	{V_F1, Vins, ASARL, C31, O_r0},
    855. 

  855. 	{V_F1, Vins, AMOVL, O_r0, O_l_hi},
    856. 

  856. 	{V_f0, Vend},
    857. 

  857. };
    858. 

  858. 

  859. /* shift asop dest right general case */
    860. 

  860. static uchar	asdshrlgen[][VLEN] =
    861. 

  861. {
    862. 

  862. 	{Vop, OGE, O_r, C32},
    863. 

  863. 	{V_s0, Vins, AMOVL, O_l_lo, O_t_lo},
    864. 

  864. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    865. 

  865. 	{Vinsr, ASHRL, O_r, O_t_rp},
    866. 

  866. 	{Vinsx, Bop0, O_r, O_t_hi},
    867. 

  867. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    868. 

  868. 	{Vins, AMOVL, O_t_hi, O_l_hi, Vgo},
    869. 

  869. 	{V_p0, V_s0},
    870. 

  870. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    871. 

  871. 	{V_T1, Vzero, O_t_hi},
    872. 

  872. 	{Vinsx, Bop0, O_r, O_t_lo},
    873. 

  873. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    874. 

  874. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    875. 

  875. 	{Vins, AMOVL, O_t_hi, O_l_hi, V_p0},
    876. 

  876. 	{Vend},
    877. 

  877. };
    878. 

  878. 

  879. /* shift asop dest right, const < 32 */
    880. 

  880. static uchar	asdshrlclo[][VLEN] =
    881. 

  881. {
    882. 

  882. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    883. 

  883. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    884. 

  884. 	{Vinsr, ASHRL, O_r, O_t_rp},
    885. 

  885. 	{Vinsx, Bop0, O_r, O_t_hi},
    886. 

  886. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    887. 

  887. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    888. 

  888. 	{Vend},
    889. 

  889. };
    890. 

  890. 

  891. /* shift asop dest right, const == 32 */
    892. 

  892. static uchar	asdshrlc32[][VLEN] =
    893. 

  893. {
    894. 

  894. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    895. 

  895. 	{V_T1, Vzero, O_t_hi},
    896. 

  896. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    897. 

  897. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    898. 

  898. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    899. 

  899. 	{Vins, AMOVL, O_t_hi, O_l_hi},
    900. 

  900. 	{Vend},
    901. 

  901. };
    902. 

  902. 

  903. /* shift asop dest, const > 32 */
    904. 

  904. static uchar	asdshrlchi[][VLEN] =
    905. 

  905. {
    906. 

  906. 	{Vins, AMOVL, O_l_hi, O_t_lo},
    907. 

  907. 	{V_T1, Vzero, O_t_hi},
    908. 

  908. 	{Vinsx, Bop0, O_r, O_t_lo},
    909. 

  909. 	{V_T1, Vins, AMOVL, O_t_hi, O_l_hi},
    910. 

  910. 	{V_T1, Vins, AMOVL, O_t_lo, O_l_lo},
    911. 

  911. 	{V_F1, Vins, AMOVL, O_t_lo, O_t_hi},
    912. 

  912. 	{V_F1, Vins, ASARL, C31, O_t_hi},
    913. 

  913. 	{V_F1, Vins, AMOVL, O_t_lo, O_l_lo},
    914. 

  914. 	{V_F1, Vins, AMOVL, O_t_hi, O_l_hi},
    915. 

  915. 	{Vend},
    916. 

  916. };
    917. 

  917. 

  918. static uchar	(*asshrltab[])[VLEN] =
    919. 

  919. {
    920. 

  920. 	asshrlgen,
    921. 

  921. 	asshrlclo,
    922. 

  922. 	asshrlc32,
    923. 

  923. 	asshrlchi,
    924. 

  924. 	asdshrlgen,
    925. 

  925. 	asdshrlclo,
    926. 

  926. 	asdshrlc32,
    927. 

  927. 	asdshrlchi,
    928. 

  928. };
    929. 

  929. 

  930. static uchar	shrlargs[]	= { ASHRL, 1 };
    931. 

  931. static uchar	sarlargs[]	= { ASARL, 0 };
    932. 

  932. 

  933. /* ++ -- */
    934. 

  934. static uchar	incdec[][VLEN] =
    935. 

  935. {
    936. 

  936. 	{Vinsx, Bop0, C01, O_l_lo},
    937. 

  937. 	{Vinsx, Bop1, C00, O_l_hi, Vend},
    938. 

  938. };
    939. 

  939. 

  940. /* ++ -- *p */
    941. 

  941. static uchar	incdecpre[][VLEN] =
    942. 

  942. {
    943. 

  943. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    944. 

  944. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    945. 

  945. 	{Vinsx, Bop0, C01, O_t_lo},
    946. 

  946. 	{Vinsx, Bop1, C00, O_t_hi},
    947. 

  947. 	{Vins, AMOVL, O_t_lo, O_l_lo},
    948. 

  948. 	{Vins, AMOVL, O_t_hi, O_l_hi, Vend},
    949. 

  949. };
    950. 

  950. 

  951. /* *p ++ -- */
    952. 

  952. static uchar	incdecpost[][VLEN] =
    953. 

  953. {
    954. 

  954. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    955. 

  955. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    956. 

  956. 	{Vinsx, Bop0, C01, O_l_lo},
    957. 

  957. 	{Vinsx, Bop1, C00, O_l_hi, Vend},
    958. 

  958. };
    959. 

  959. 

  960. /* binop rp, rp */
    961. 

  961. static uchar	binop00[][VLEN] =
    962. 

  962. {
    963. 

  963. 	{Vinsx, Bop0, O_r_lo, O_l_lo},
    964. 

  964. 	{Vinsx, Bop1, O_r_hi, O_l_hi, Vend},
    965. 

  965. 	{Vend},
    966. 

  966. };
    967. 

  967. 

  968. /* binop rp, addr */
    969. 

  969. static uchar	binoptmp[][VLEN] =
    970. 

  970. {
    971. 

  971. 	{V_a0, Vins, AMOVL, O_r_lo, O_r0},
    972. 

  972. 	{Vinsx, Bop0, O_r0, O_l_lo},
    973. 

  973. 	{Vins, AMOVL, O_r_hi, O_r0},
    974. 

  974. 	{Vinsx, Bop1, O_r0, O_l_hi},
    975. 

  975. 	{V_f0, Vend},
    976. 

  976. };
    977. 

  977. 

  978. /* binop t = *a op *b */
    979. 

  979. static uchar	binop11[][VLEN] =
    980. 

  980. {
    981. 

  981. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    982. 

  982. 	{Vinsx, Bop0, O_r_lo, O_t_lo},
    983. 

  983. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    984. 

  984. 	{Vinsx, Bop1, O_r_hi, O_t_hi, Vend},
    985. 

  985. };
    986. 

  986. 

  987. /* binop t = rp +- c */
    988. 

  988. static uchar	add0c[][VLEN] =
    989. 

  989. {
    990. 

  990. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
    991. 

  991. 	{V_r_lo_f, Vamv, Bop0, Bop1},
    992. 

  992. 	{Vinsx, Bop1, O_r_hi, O_l_hi},
    993. 

  993. 	{Vend},
    994. 

  994. };
    995. 

  995. 

  996. /* binop t = rp & c */
    997. 

  997. static uchar	and0c[][VLEN] =
    998. 

  998. {
    999. 

  999. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
    1000. 

  1000. 	{V_r_lo_f, Vins, AMOVL, C00, O_l_lo},
    1001. 

  1001. 	{V_r_hi_t, Vinsx, Bop1, O_r_hi, O_l_hi},
    1002. 

  1002. 	{V_r_hi_f, Vins, AMOVL, C00, O_l_hi},
    1003. 

  1003. 	{Vend},
    1004. 

  1004. };
    1005. 

  1005. 

  1006. /* binop t = rp | c */
    1007. 

  1007. static uchar	or0c[][VLEN] =
    1008. 

  1008. {
    1009. 

  1009. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_l_lo},
    1010. 

  1010. 	{V_r_hi_t, Vinsx, Bop1, O_r_hi, O_l_hi},
    1011. 

  1011. 	{Vend},
    1012. 

  1012. };
    1013. 

  1013. 

  1014. /* binop t = c - rp */
    1015. 

  1015. static uchar	sub10[][VLEN] =
    1016. 

  1016. {
    1017. 

  1017. 	{V_a0, Vins, AMOVL, O_l_lo, O_r0},
    1018. 

  1018. 	{Vinsx, Bop0, O_r_lo, O_r0},
    1019. 

  1019. 	{Vins, AMOVL, O_l_hi, O_r_lo},
    1020. 

  1020. 	{Vinsx, Bop1, O_r_hi, O_r_lo},
    1021. 

  1021. 	{Vspazz, V_f0, Vend},
    1022. 

  1022. };
    1023. 

  1023. 

  1024. /* binop t = c + *b */
    1025. 

  1025. static uchar	addca[][VLEN] =
    1026. 

  1026. {
    1027. 

  1027. 	{Vins, AMOVL, O_r_lo, O_t_lo},
    1028. 

  1028. 	{V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
    1029. 

  1029. 	{V_l_lo_f, Vamv, Bop0, Bop1},
    1030. 

  1030. 	{Vins, AMOVL, O_r_hi, O_t_hi},
    1031. 

  1031. 	{Vinsx, Bop1, O_l_hi, O_t_hi},
    1032. 

  1032. 	{Vend},
    1033. 

  1033. };
    1034. 

  1034. 

  1035. /* binop t = c & *b */
    1036. 

  1036. static uchar	andca[][VLEN] =
    1037. 

  1037. {
    1038. 

  1038. 	{V_l_lo_t, Vins, AMOVL, O_r_lo, O_t_lo},
    1039. 

  1039. 	{V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
    1040. 

  1040. 	{V_l_lo_f, Vzero, O_t_lo},
    1041. 

  1041. 	{V_l_hi_t, Vins, AMOVL, O_r_hi, O_t_hi},
    1042. 

  1042. 	{V_l_hi_t, Vinsx, Bop1, O_l_hi, O_t_hi},
    1043. 

  1043. 	{V_l_hi_f, Vzero, O_t_hi},
    1044. 

  1044. 	{Vend},
    1045. 

  1045. };
    1046. 

  1046. 

  1047. /* binop t = c | *b */
    1048. 

  1048. static uchar	orca[][VLEN] =
    1049. 

  1049. {
    1050. 

  1050. 	{Vins, AMOVL, O_r_lo, O_t_lo},
    1051. 

  1051. 	{V_l_lo_t, Vinsx, Bop0, O_l_lo, O_t_lo},
    1052. 

  1052. 	{Vins, AMOVL, O_r_hi, O_t_hi},
    1053. 

  1053. 	{V_l_hi_t, Vinsx, Bop1, O_l_hi, O_t_hi},
    1054. 

  1054. 	{Vend},
    1055. 

  1055. };
    1056. 

  1056. 

  1057. /* binop t = c - *b */
    1058. 

  1058. static uchar	subca[][VLEN] =
    1059. 

  1059. {
    1060. 

  1060. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    1061. 

  1061. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    1062. 

  1062. 	{Vinsx, Bop0, O_r_lo, O_t_lo},
    1063. 

  1063. 	{Vinsx, Bop1, O_r_hi, O_t_hi},
    1064. 

  1064. 	{Vend},
    1065. 

  1065. };
    1066. 

  1066. 

  1067. /* binop t = *a +- c */
    1068. 

  1068. static uchar	addac[][VLEN] =
    1069. 

  1069. {
    1070. 

  1070. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    1071. 

  1071. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
    1072. 

  1072. 	{V_r_lo_f, Vamv, Bop0, Bop1},
    1073. 

  1073. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    1074. 

  1074. 	{Vinsx, Bop1, O_r_hi, O_t_hi},
    1075. 

  1075. 	{Vend},
    1076. 

  1076. };
    1077. 

  1077. 

  1078. /* binop t = *a | c */
    1079. 

  1079. static uchar	orac[][VLEN] =
    1080. 

  1080. {
    1081. 

  1081. 	{Vins, AMOVL, O_l_lo, O_t_lo},
    1082. 

  1082. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
    1083. 

  1083. 	{Vins, AMOVL, O_l_hi, O_t_hi},
    1084. 

  1084. 	{V_r_hi_t, Vinsx, Bop1, O_r_hi, O_t_hi},
    1085. 

  1085. 	{Vend},
    1086. 

  1086. };
    1087. 

  1087. 

  1088. /* binop t = *a & c */
    1089. 

  1089. static uchar	andac[][VLEN] =
    1090. 

  1090. {
    1091. 

  1091. 	{V_r_lo_t, Vins, AMOVL, O_l_lo, O_t_lo},
    1092. 

  1092. 	{V_r_lo_t, Vinsx, Bop0, O_r_lo, O_t_lo},
    1093. 

  1093. 	{V_r_lo_f, Vzero, O_t_lo},
    1094. 

  1094. 	{V_r_hi_t, Vins, AMOVL, O_l_hi, O_t_hi},
    1095. 

  1095. 	{V_r_hi_t, Vinsx, Bop0, O_r_hi, O_t_hi},
    1096. 

  1096. 	{V_r_hi_f, Vzero, O_t_hi},
    1097. 

  1097. 	{Vend},
    1098. 

  1098. };
    1099. 

  1099. 

  1100. static uchar	ADDargs[]	= { AADDL, AADCL };
    1101. 

  1101. static uchar	ANDargs[]	= { AANDL, AANDL };
    1102. 

  1102. static uchar	ORargs[]	= { AORL, AORL };
    1103. 

  1103. static uchar	SUBargs[]	= { ASUBL, ASBBL };
    1104. 

  1104. static uchar	XORargs[]	= { AXORL, AXORL };
    1105. 

  1105. 

  1106. static uchar	(*ADDtab[])[VLEN] =
    1107. 

  1107. {
    1108. 

  1108. 	add0c, addca, addac,
    1109. 

  1109. };
    1110. 

  1110. 

  1111. static uchar	(*ANDtab[])[VLEN] =
    1112. 

  1112. {
    1113. 

  1113. 	and0c, andca, andac,
    1114. 

  1114. };
    1115. 

  1115. 

  1116. static uchar	(*ORtab[])[VLEN] =
    1117. 

  1117. {
    1118. 

  1118. 	or0c, orca, orac,
    1119. 

  1119. };
    1120. 

  1120. 

  1121. static uchar	(*SUBtab[])[VLEN] =
    1122. 

  1122. {
    1123. 

  1123. 	add0c, subca, addac,
    1124. 

  1124. };
    1125. 

  1125. 

  1126. /* mul of const32 */
    1127. 

  1127. static uchar	mulc32[][VLEN] =
    1128. 

  1128. {
    1129. 

  1129. 	{V_a0, Vop, ONE, O_l_hi, C00},
    1130. 

  1130. 	{V_s0, Vins, AMOVL, O_r_lo, O_r0},
    1131. 

  1131. 	{Vins, AMULL, O_r0, O_Zop},
    1132. 

  1132. 	{Vgo, V_p0, V_s0},
    1133. 

  1133. 	{Vins, AMOVL, O_l_hi, O_r0},
    1134. 

  1134. 	{Vmul, O_r_lo, O_r0},
    1135. 

  1135. 	{Vins, AMOVL, O_r_lo, O_l_hi},
    1136. 

  1136. 	{Vins, AMULL, O_l_hi, O_Zop},
    1137. 

  1137. 	{Vins, AADDL, O_r0, O_l_hi},
    1138. 

  1138. 	{V_f0, V_p0, Vend},
    1139. 

  1139. };
    1140. 

  1140. 

  1141. /* mul of const64 */
    1142. 

  1142. static uchar	mulc64[][VLEN] =
    1143. 

  1143. {
    1144. 

  1144. 	{V_a0, Vins, AMOVL, O_r_hi, O_r0},
    1145. 

  1145. 	{Vop, OOR, O_l_hi, O_r0},
    1146. 

  1146. 	{Vop, ONE, O_r0, C00},
    1147. 

  1147. 	{V_s0, Vins, AMOVL, O_r_lo, O_r0},
    1148. 

  1148. 	{Vins, AMULL, O_r0, O_Zop},
    1149. 

  1149. 	{Vgo, V_p0, V_s0},
    1150. 

  1150. 	{Vmul, O_r_lo, O_l_hi},
    1151. 

  1151. 	{Vins, AMOVL, O_l_lo, O_r0},
    1152. 

  1152. 	{Vmul, O_r_hi, O_r0},
    1153. 

  1153. 	{Vins, AADDL, O_l_hi, O_r0},
    1154. 

  1154. 	{Vins, AMOVL, O_r_lo, O_l_hi},
    1155. 

  1155. 	{Vins, AMULL, O_l_hi, O_Zop},
    1156. 

  1156. 	{Vins, AADDL, O_r0, O_l_hi},
    1157. 

  1157. 	{V_f0, V_p0, Vend},
    1158. 

  1158. };
    1159. 

  1159. 

  1160. /* mul general */
    1161. 

  1161. static uchar	mull[][VLEN] =
    1162. 

  1162. {
    1163. 

  1163. 	{V_a0, Vins, AMOVL, O_r_hi, O_r0},
    1164. 

  1164. 	{Vop, OOR, O_l_hi, O_r0},
    1165. 

  1165. 	{Vop, ONE, O_r0, C00},
    1166. 

  1166. 	{V_s0, Vins, AMOVL, O_r_lo, O_r0},
    1167. 

  1167. 	{Vins, AMULL, O_r0, O_Zop},
    1168. 

  1168. 	{Vgo, V_p0, V_s0},
    1169. 

  1169. 	{Vins, AIMULL, O_r_lo, O_l_hi},
    1170. 

  1170. 	{Vins, AMOVL, O_l_lo, O_r0},
    1171. 

  1171. 	{Vins, AIMULL, O_r_hi, O_r0},
    1172. 

  1172. 	{Vins, AADDL, O_l_hi, O_r0},
    1173. 

  1173. 	{Vins, AMOVL, O_r_lo, O_l_hi},
    1174. 

  1174. 	{Vins, AMULL, O_l_hi, O_Zop},
    1175. 

  1175. 	{Vins, AADDL, O_r0, O_l_hi},
    1176. 

  1176. 	{V_f0, V_p0, Vend},
    1177. 

  1177. };
    1178. 

  1178. 

  1179. /* cast rp l to rp t */
    1180. 

  1180. static uchar	castrp[][VLEN] =
    1181. 

  1181. {
    1182. 

  1182. 	{Vmv, O_l, O_t_lo},
    1183. 

  1183. 	{VT, Vins, AMOVL, O_t_lo, O_t_hi},
    1184. 

  1184. 	{VT, Vins, ASARL, C31, O_t_hi},
    1185. 

  1185. 	{VF, Vzero, O_t_hi},
    1186. 

  1186. 	{Vend},
    1187. 

  1187. };
    1188. 

  1188. 

  1189. /* cast rp l to addr t */
    1190. 

  1190. static uchar	castrpa[][VLEN] =
    1191. 

  1191. {
    1192. 

  1192. 	{VT, V_a0, Vmv, O_l, O_r0},
    1193. 

  1193. 	{VT, Vins, AMOVL, O_r0, O_t_lo},
    1194. 

  1194. 	{VT, Vins, ASARL, C31, O_r0},
    1195. 

  1195. 	{VT, Vins, AMOVL, O_r0, O_t_hi},
    1196. 

  1196. 	{VT, V_f0},
    1197. 

  1197. 	{VF, Vmv, O_l, O_t_lo},
    1198. 

  1198. 	{VF, Vzero, O_t_hi},
    1199. 

  1199. 	{Vend},
    1200. 

  1200. };
    1201. 

  1201. 

  1202. static uchar	netab0i[][VLEN] =
    1203. 

  1203. {
    1204. 

  1204. 	{Vop, ONE, O_l_lo, O_r_lo},
    1205. 

  1205. 	{V_s0, Vop, ONE, O_l_hi, O_r_hi},
    1206. 

  1206. 	{V_s1, Vgo, V_s2, Vgo, V_s3},
    1207. 

  1207. 	{VF, V_p0, V_p1, VT, V_p2},
    1208. 

  1208. 	{Vgo, V_p3},
    1209. 

  1209. 	{VT, V_p0, V_p1, VF, V_p2},
    1210. 

  1210. 	{Vend},
    1211. 

  1211. };
    1212. 

  1212. 

  1213. static uchar	netabii[][VLEN] =
    1214. 

  1214. {
    1215. 

  1215. 	{V_a0, Vins, AMOVL, O_l_lo, O_r0},
    1216. 

  1216. 	{Vop, ONE, O_r0, O_r_lo},
    1217. 

  1217. 	{V_s0, Vins, AMOVL, O_l_hi, O_r0},
    1218. 

  1218. 	{Vop, ONE, O_r0, O_r_hi},
    1219. 

  1219. 	{V_s1, Vgo, V_s2, Vgo, V_s3},
    1220. 

  1220. 	{VF, V_p0, V_p1, VT, V_p2},
    1221. 

  1221. 	{Vgo, V_p3},
    1222. 

  1222. 	{VT, V_p0, V_p1, VF, V_p2},
    1223. 

  1223. 	{V_f0, Vend},
    1224. 

  1224. };
    1225. 

  1225. 

  1226. static uchar	cmptab0i[][VLEN] =
    1227. 

  1227. {
    1228. 

  1228. 	{Vopx, Bop0, O_l_hi, O_r_hi},
    1229. 

  1229. 	{V_s0, Vins0, AJNE},
    1230. 

  1230. 	{V_s1, Vopx, Bop1, O_l_lo, O_r_lo},
    1231. 

  1231. 	{V_s2, Vgo, V_s3, Vgo, V_s4},
    1232. 

  1232. 	{VT, V_p1, V_p3},
    1233. 

  1233. 	{VF, V_p0, V_p2},
    1234. 

  1234. 	{Vgo, V_p4},
    1235. 

  1235. 	{VT, V_p0, V_p2},
    1236. 

  1236. 	{VF, V_p1, V_p3},
    1237. 

  1237. 	{Vend},
    1238. 

  1238. };
    1239. 

  1239. 

  1240. static uchar	cmptabii[][VLEN] =
    1241. 

  1241. {
    1242. 

  1242. 	{V_a0, Vins, AMOVL, O_l_hi, O_r0},
    1243. 

  1243. 	{Vopx, Bop0, O_r0, O_r_hi},
    1244. 

  1244. 	{V_s0, Vins0, AJNE},
    1245. 

  1245. 	{V_s1, Vins, AMOVL, O_l_lo, O_r0},
    1246. 

  1246. 	{Vopx, Bop1, O_r0, O_r_lo},
    1247. 

  1247. 	{V_s2, Vgo, V_s3, Vgo, V_s4},
    1248. 

  1248. 	{VT, V_p1, V_p3},
    1249. 

  1249. 	{VF, V_p0, V_p2},
    1250. 

  1250. 	{Vgo, V_p4},
    1251. 

  1251. 	{VT, V_p0, V_p2},
    1252. 

  1252. 	{VF, V_p1, V_p3},
    1253. 

  1253. 	{V_f0, Vend},
    1254. 

  1254. };
    1255. 

  1255. 

  1256. static uchar	(*NEtab[])[VLEN] =
    1257. 

  1257. {
    1258. 

  1258. 	netab0i, netabii,
    1259. 

  1259. };
    1260. 

  1260. 

  1261. static uchar	(*cmptab[])[VLEN] =
    1262. 

  1262. {
    1263. 

  1263. 	cmptab0i, cmptabii,
    1264. 

  1264. };
    1265. 

  1265. 

  1266. static uchar	GEargs[]	= { OGT, OHS };
    1267. 

  1267. static uchar	GTargs[]	= { OGT, OHI };
    1268. 

  1268. static uchar	HIargs[]	= { OHI, OHI };
    1269. 

  1269. static uchar	HSargs[]	= { OHI, OHS };
    1270. 

  1270. 

  1271. /* Big Generator */
    1272. 

  1272. static void
    1273. 

  1273. biggen(Node *l, Node *r, Node *t, int true, uchar code[][VLEN], uchar *a)
    1274. 

  1274. {
    1275. 

  1275. 	int i, j, g, oc, op, lo, ro, to, xo, *xp;
    1276. 

  1276. 	Type *lt;
    1277. 

  1277. 	Prog *pr[VOPS];
    1278. 

  1278. 	Node *ot, *tl, *tr, tmps[2];
    1279. 

  1279. 	uchar *c, (*cp)[VLEN], args[VARGS];
    1280. 

  1280. 

  1281. 	if(a != nil)
    1282. 

  1282. 		memmove(args, a, VARGS);
    1283. 

  1283. //print("biggen %d %d %d\n", args[0], args[1], args[2]);
    1284. 

  1284. //if(l) prtree(l, "l");
    1285. 

  1285. //if(r) prtree(r, "r");
    1286. 

  1286. //if(t) prtree(t, "t");
    1287. 

  1287. 	lo = ro = to = 0;
    1288. 

  1288. 	cp = code;
    1289. 

  1289. 

  1290. 	for (;;) {
    1291. 

  1291. 		c = *cp++;
    1292. 

  1292. 		g = 1;
    1293. 

  1293. 		i = 0;
    1294. 

  1294. //print("code %d %d %d %d %d\n", c[0], c[1], c[2], c[3], c[4]);
    1295. 

  1295. 		for(;;) {
    1296. 

  1296. 			switch(op = c[i]) {
    1297. 

  1297. 			case Vgo:
    1298. 

  1298. 				if(g)
    1299. 

  1299. 					gbranch(OGOTO);
    1300. 

  1300. 				i++;
    1301. 

  1301. 				break;
    1302. 

  1302. 

  1303. 			case Vamv:
    1304. 

  1304. 				i += 3;
    1305. 

  1305. 				if(i > VLEN) {
    1306. 

  1306. 					diag(l, "bad Vop");
    1307. 

  1307. 					return;
    1308. 

  1308. 				}
    1309. 

  1309. 				if(g)
    1310. 

  1310. 					args[c[i - 1]] = args[c[i - 2]];
    1311. 

  1311. 				break;
    1312. 

  1312. 

  1313. 			case Vzero:
    1314. 

  1314. 				i += 2;
    1315. 

  1315. 				if(i > VLEN) {
    1316. 

  1316. 					diag(l, "bad Vop");
    1317. 

  1317. 					return;
    1318. 

  1318. 				}
    1319. 

  1319. 				j = i - 1;
    1320. 

  1320. 				goto op;
    1321. 

  1321. 

  1322. 			case Vspazz:	// nasty hack to save a reg in SUB
    1323. 

  1323. //print("spazz\n");
    1324. 

  1324. 				if(g) {
    1325. 

  1325. //print("hi %R lo %R t %R\n", r->right->reg, r->left->reg, tmps[0].reg);
    1326. 

  1326. 					ot = r->right;
    1327. 

  1327. 					r->right = r->left;
    1328. 

  1328. 					tl = new(0, Z, Z);
    1329. 

  1329. 					*tl = tmps[0];
    1330. 

  1330. 					r->left = tl;
    1331. 

  1331. 					tmps[0] = *ot;
    1332. 

  1332. //print("hi %R lo %R t %R\n", r->right->reg, r->left->reg, tmps[0].reg);
    1333. 

  1333. 				}
    1334. 

  1334. 				i++;
    1335. 

  1335. 				break;
    1336. 

  1336. 

  1337. 			case Vmv:
    1338. 

  1338. 			case Vmul:
    1339. 

  1339. 			case Vshll:
    1340. 

  1340. 				i += 3;
    1341. 

  1341. 				if(i > VLEN) {
    1342. 

  1342. 					diag(l, "bad Vop");
    1343. 

  1343. 					return;
    1344. 

  1344. 				}
    1345. 

  1345. 				j = i - 2;
    1346. 

  1346. 				goto op;
    1347. 

  1347. 

  1348. 			case Vins0:
    1349. 

  1349. 				i += 2;
    1350. 

  1350. 				if(i > VLEN) {
    1351. 

  1351. 					diag(l, "bad Vop");
    1352. 

  1352. 					return;
    1353. 

  1353. 				}
    1354. 

  1354. 				gins(c[i - 1], Z, Z);
    1355. 

  1355. 				break;
    1356. 

  1356. 

  1357. 			case Vop:
    1358. 

  1358. 			case Vopx:
    1359. 

  1359. 			case Vins:
    1360. 

  1360. 			case Vinsl:
    1361. 

  1361. 			case Vinsr:
    1362. 

  1362. 			case Vinsla:
    1363. 

  1363. 			case Vinsra:
    1364. 

  1364. 			case Vinsx:
    1365. 

  1365. 				i += 4;
    1366. 

  1366. 				if(i > VLEN) {
    1367. 

  1367. 					diag(l, "bad Vop");
    1368. 

  1368. 					return;
    1369. 

  1369. 				}
    1370. 

  1370. 				j = i - 2;
    1371. 

  1371. 				goto op;
    1372. 

  1372. 

  1373. 			op:
    1374. 

  1374. 				if(!g)
    1375. 

  1375. 					break;
    1376. 

  1376. 				tl = Z;
    1377. 

  1377. 				tr = Z;
    1378. 

  1378. 				for(; j < i; j++) {
    1379. 

  1379. 					switch(c[j]) {
    1380. 

  1380. 					case C00:
    1381. 

  1381. 						ot = nodconst(0);
    1382. 

  1382. 						break;
    1383. 

  1383. 					case C01:
    1384. 

  1384. 						ot = nodconst(1);
    1385. 

  1385. 						break;
    1386. 

  1386. 					case C31:
    1387. 

  1387. 						ot = nodconst(31);
    1388. 

  1388. 						break;
    1389. 

  1389. 					case C32:
    1390. 

  1390. 						ot = nodconst(32);
    1391. 

  1391. 						break;
    1392. 

  1392. 

  1393. 					case O_l:
    1394. 

  1394. 					case O_l_lo:
    1395. 

  1395. 						ot = l; xp = &lo; xo = 0;
    1396. 

  1396. 						goto op0;
    1397. 

  1397. 					case O_l_hi:
    1398. 

  1398. 						ot = l; xp = &lo; xo = SZ_LONG;
    1399. 

  1399. 						goto op0;
    1400. 

  1400. 					case O_r:
    1401. 

  1401. 					case O_r_lo:
    1402. 

  1402. 						ot = r; xp = &ro; xo = 0;
    1403. 

  1403. 						goto op0;
    1404. 

  1404. 					case O_r_hi:
    1405. 

  1405. 						ot = r; xp = &ro; xo = SZ_LONG;
    1406. 

  1406. 						goto op0;
    1407. 

  1407. 					case O_t_lo:
    1408. 

  1408. 						ot = t; xp = &to; xo = 0;
    1409. 

  1409. 						goto op0;
    1410. 

  1410. 					case O_t_hi:
    1411. 

  1411. 						ot = t; xp = &to; xo = SZ_LONG;
    1412. 

  1412. 						goto op0;
    1413. 

  1413. 					case O_l_rp:
    1414. 

  1414. 						ot = l;
    1415. 

  1415. 						break;
    1416. 

  1416. 					case O_r_rp:
    1417. 

  1417. 						ot = r;
    1418. 

  1418. 						break;
    1419. 

  1419. 					case O_t_rp:
    1420. 

  1420. 						ot = t;
    1421. 

  1421. 						break;
    1422. 

  1422. 					case O_r0:
    1423. 

  1423. 					case O_r1:
    1424. 

  1424. 						ot = &tmps[c[j] - O_r0];
    1425. 

  1425. 						break;
    1426. 

  1426. 					case O_Zop:
    1427. 

  1427. 						ot = Z;
    1428. 

  1428. 						break;
    1429. 

  1429. 

  1430. 					op0:
    1431. 

  1431. 						switch(ot->op) {
    1432. 

  1432. 						case OCONST:
    1433. 

  1433. 							if(xo)
    1434. 

  1434. 								ot = hi64(ot);
    1435. 

  1435. 							else
    1436. 

  1436. 								ot = lo64(ot);
    1437. 

  1437. 							break;
    1438. 

  1438. 						case OREGPAIR:
    1439. 

  1439. 							if(xo)
    1440. 

  1440. 								ot = ot->right;
    1441. 

  1441. 							else
    1442. 

  1442. 								ot = ot->left;
    1443. 

  1443. 							break;
    1444. 

  1444. 						case OREGISTER:
    1445. 

  1445. 							break;
    1446. 

  1446. 						default:
    1447. 

  1447. 							if(xo != *xp) {
    1448. 

  1448. 								ot->xoffset += xo - *xp;
    1449. 

  1449. 								*xp = xo;
    1450. 

  1450. 							}
    1451. 

  1451. 						}
    1452. 

  1452. 						break;
    1453. 

  1453. 					
    1454. 

  1454. 					default:
    1455. 

  1455. 						diag(l, "bad V_lop");
    1456. 

  1456. 						return;
    1457. 

  1457. 					}
    1458. 

  1458. 					if(tl == nil)
    1459. 

  1459. 						tl = ot;
    1460. 

  1460. 					else
    1461. 

  1461. 						tr = ot;
    1462. 

  1462. 				}
    1463. 

  1463. 				if(op == Vzero) {
    1464. 

  1464. 					zeroregm(tl);
    1465. 

  1465. 					break;
    1466. 

  1466. 				}
    1467. 

  1467. 				oc = c[i - 3];
    1468. 

  1468. 				if(op == Vinsx || op == Vopx) {
    1469. 

  1469. //print("%d -> %d\n", oc, args[oc]);
    1470. 

  1470. 					oc = args[oc];
    1471. 

  1471. 				}
    1472. 

  1472. 				else {
    1473. 

  1473. 					switch(oc) {
    1474. 

  1474. 					case O_a0:
    1475. 

  1475. 					case O_a1:
    1476. 

  1476. 						oc = args[oc - O_a0];
    1477. 

  1477. 						break;
    1478. 

  1478. 					}
    1479. 

  1479. 				}
    1480. 

  1480. 				switch(op) {
    1481. 

  1481. 				case Vmul:
    1482. 

  1482. 					mulgen(tr->type, tl, tr);
    1483. 

  1483. 					break;
    1484. 

  1484. 				case Vmv:
    1485. 

  1485. 					gmove(tl, tr);
    1486. 

  1486. 					break;
    1487. 

  1487. 				case Vshll:
    1488. 

  1488. 					shiftit(tr->type, tl, tr);
    1489. 

  1489. 					break;
    1490. 

  1490. 				case Vop:
    1491. 

  1491. 				case Vopx:
    1492. 

  1492. 					gopcode(oc, types[TULONG], tl, tr);
    1493. 

  1493. 					break;
    1494. 

  1494. 				case Vins:
    1495. 

  1495. 				case Vinsx:
    1496. 

  1496. 					gins(oc, tl, tr);
    1497. 

  1497. 					break;
    1498. 

  1498. 				case Vinsl:
    1499. 

  1499. 					gins(oc, tl, tr->right);
    1500. 

  1500. 					p->from.index = tr->left->reg;
    1501. 

  1501. 					break;
    1502. 

  1502. 				case Vinsr:
    1503. 

  1503. 					gins(oc, tl, tr->left);
    1504. 

  1504. 					p->from.index = tr->right->reg;
    1505. 

  1505. 					break;
    1506. 

  1506. 				case Vinsla:
    1507. 

  1507. 					gins(oc, tl, tr + 1);
    1508. 

  1508. 					p->from.index = tr->reg;
    1509. 

  1509. 					break;
    1510. 

  1510. 				case Vinsra:
    1511. 

  1511. 					gins(oc, tl, tr);
    1512. 

  1512. 					p->from.index = (tr + 1)->reg;
    1513. 

  1513. 					break;
    1514. 

  1514. 				}
    1515. 

  1515. 				break;
    1516. 

  1516. 

  1517. 			case VT:
    1518. 

  1518. 				g = true;
    1519. 

  1519. 				i++;
    1520. 

  1520. 				break;
    1521. 

  1521. 			case VF:
    1522. 

  1522. 				g = !true;
    1523. 

  1523. 				i++;
    1524. 

  1524. 				break;
    1525. 

  1525. 

  1526. 			case V_T0: case V_T1:
    1527. 

  1527. 				g = args[op - V_T0];
    1528. 

  1528. 				i++;
    1529. 

  1529. 				break;
    1530. 

  1530. 

  1531. 			case V_F0: case V_F1:
    1532. 

  1532. 				g = !args[op - V_F0];
    1533. 

  1533. 				i++;
    1534. 

  1534. 				break;
    1535. 

  1535. 

  1536. 			case V_C0: case V_C1:
    1537. 

  1537. 				if(g)
    1538. 

  1538. 					args[op - V_C0] = 0;
    1539. 

  1539. 				i++;
    1540. 

  1540. 				break;
    1541. 

  1541. 

  1542. 			case V_S0: case V_S1:
    1543. 

  1543. 				if(g)
    1544. 

  1544. 					args[op - V_S0] = 1;
    1545. 

  1545. 				i++;
    1546. 

  1546. 				break;
    1547. 

  1547. 

  1548. 			case V_l_lo_f:
    1549. 

  1549. 				g = lo64v(l) == 0;
    1550. 

  1550. 				i++;
    1551. 

  1551. 				break;
    1552. 

  1552. 			case V_l_hi_f:
    1553. 

  1553. 				g = hi64v(l) == 0;
    1554. 

  1554. 				i++;
    1555. 

  1555. 				break;
    1556. 

  1556. 			case V_l_lo_t:
    1557. 

  1557. 				g = lo64v(l) != 0;
    1558. 

  1558. 				i++;
    1559. 

  1559. 				break;
    1560. 

  1560. 			case V_l_hi_t:
    1561. 

  1561. 				g = hi64v(l) != 0;
    1562. 

  1562. 				i++;
    1563. 

  1563. 				break;
    1564. 

  1564. 			case V_l_lo_u:
    1565. 

  1565. 				g = lo64v(l) >= 0;
    1566. 

  1566. 				i++;
    1567. 

  1567. 				break;
    1568. 

  1568. 			case V_l_hi_u:
    1569. 

  1569. 				g = hi64v(l) >= 0;
    1570. 

  1570. 				i++;
    1571. 

  1571. 				break;
    1572. 

  1572. 			case V_r_lo_f:
    1573. 

  1573. 				g = lo64v(r) == 0;
    1574. 

  1574. 				i++;
    1575. 

  1575. 				break;
    1576. 

  1576. 			case V_r_hi_f:
    1577. 

  1577. 				g = hi64v(r) == 0;
    1578. 

  1578. 				i++;
    1579. 

  1579. 				break;
    1580. 

  1580. 			case V_r_lo_t:
    1581. 

  1581. 				g = lo64v(r) != 0;
    1582. 

  1582. 				i++;
    1583. 

  1583. 				break;
    1584. 

  1584. 			case V_r_hi_t:
    1585. 

  1585. 				g = hi64v(r) != 0;
    1586. 

  1586. 				i++;
    1587. 

  1587. 				break;
    1588. 

  1588. 			case V_r_lo_u:
    1589. 

  1589. 				g = lo64v(r) >= 0;
    1590. 

  1590. 				i++;
    1591. 

  1591. 				break;
    1592. 

  1592. 			case V_r_hi_u:
    1593. 

  1593. 				g = hi64v(r) >= 0;
    1594. 

  1594. 				i++;
    1595. 

  1595. 				break;
    1596. 

  1596. 

  1597. 			case Vend:
    1598. 

  1598. 				goto out;
    1599. 

  1599. 

  1600. 			case V_a0: case V_a1:
    1601. 

  1601. 				if(g) {
    1602. 

  1602. 					lt = l->type;
    1603. 

  1603. 					l->type = types[TULONG];
    1604. 

  1604. 					regalloc(&tmps[op - V_a0], l, Z);
    1605. 

  1605. 					l->type = lt;
    1606. 

  1606. 				}
    1607. 

  1607. 				i++;
    1608. 

  1608. 				break;
    1609. 

  1609. 

  1610. 			case V_f0: case V_f1:
    1611. 

  1611. 				if(g)
    1612. 

  1612. 					regfree(&tmps[op - V_f0]);
    1613. 

  1613. 				i++;
    1614. 

  1614. 				break;
    1615. 

  1615. 

  1616. 			case V_p0: case V_p1: case V_p2: case V_p3: case V_p4:
    1617. 

  1617. 				if(g)
    1618. 

  1618. 					patch(pr[op - V_p0], pc);
    1619. 

  1619. 				i++;
    1620. 

  1620. 				break;
    1621. 

  1621. 

  1622. 			case V_s0: case V_s1: case V_s2: case V_s3: case V_s4:
    1623. 

  1623. 				if(g)
    1624. 

  1624. 					pr[op - V_s0] = p;
    1625. 

  1625. 				i++;
    1626. 

  1626. 				break;
    1627. 

  1627. 

  1628. 			default:
    1629. 

  1629. 				diag(l, "bad biggen: %d", op);
    1630. 

  1630. 				return;
    1631. 

  1631. 			}
    1632. 

  1632. 			if(i == VLEN || c[i] == 0)
    1633. 

  1633. 				break;
    1634. 

  1634. 		}
    1635. 

  1635. 	}
    1636. 

  1636. out:
    1637. 

  1637. 	if(lo)
    1638. 

  1638. 		l->xoffset -= lo;
    1639. 

  1639. 	if(ro)
    1640. 

  1640. 		r->xoffset -= ro;
    1641. 

  1641. 	if(to)
    1642. 

  1642. 		t->xoffset -= to;
    1643. 

  1643. }
    1644. 

  1644. 

  1645. int
    1646. 

  1646. cgen64(Node *n, Node *nn)
    1647. 

  1647. {
    1648. 

  1648. 	Type *dt;
    1649. 

  1649. 	uchar *args, (*cp)[VLEN], (**optab)[VLEN];
    1650. 

  1650. 	int li, ri, lri, dr, si, m, op, sh, cmp, true;
    1651. 

  1651. 	Node *c, *d, *l, *r, *t, *s, nod1, nod2, nod3, nod4, nod5;
    1652. 

  1652. 

  1653. 	if(debug['g']) {
    1654. 

  1654. 		prtree(nn, "cgen64 lhs");
    1655. 

  1655. 		prtree(n, "cgen64");
    1656. 

  1656. 		print("AX = %d\n", reg[D_AX]);
    1657. 

  1657. 	}
    1658. 

  1658. 	cmp = 0;
    1659. 

  1659. 	sh = 0;
    1660. 

  1660. 

  1661. 	switch(n->op) {
    1662. 

  1662. 	case ONEG:
    1663. 

  1663. 		d = regpair(nn, n);
    1664. 

  1664. 		sugen(n->left, d, 8);
    1665. 

  1665. 		gins(ANOTL, Z, d->right);
    1666. 

  1666. 		gins(ANEGL, Z, d->left);
    1667. 

  1667. 		gins(ASBBL, nodconst(-1), d->right);
    1668. 

  1668. 		break;
    1669. 

  1669. 

  1670. 	case OCOM:
    1671. 

  1671. 		if(!vaddr(n->left, 0) || !vaddr(nn, 0))
    1672. 

  1672. 			d = regpair(nn, n);
    1673. 

  1673. 		else
    1674. 

  1674. 			return 0;
    1675. 

  1675. 		sugen(n->left, d, 8);
    1676. 

  1676. 		gins(ANOTL, Z, d->left);
    1677. 

  1677. 		gins(ANOTL, Z, d->right);
    1678. 

  1678. 		break;
    1679. 

  1679. 

  1680. 	case OADD:
    1681. 

  1681. 		optab = ADDtab;
    1682. 

  1682. 		args = ADDargs;
    1683. 

  1683. 		goto twoop;
    1684. 

  1684. 	case OAND:
    1685. 

  1685. 		optab = ANDtab;
    1686. 

  1686. 		args = ANDargs;
    1687. 

  1687. 		goto twoop;
    1688. 

  1688. 	case OOR:
    1689. 

  1689. 		optab = ORtab;
    1690. 

  1690. 		args = ORargs;
    1691. 

  1691. 		goto twoop;
    1692. 

  1692. 	case OSUB:
    1693. 

  1693. 		optab = SUBtab;
    1694. 

  1694. 		args = SUBargs;
    1695. 

  1695. 		goto twoop;
    1696. 

  1696. 	case OXOR:
    1697. 

  1697. 		optab = ORtab;
    1698. 

  1698. 		args = XORargs;
    1699. 

  1699. 		goto twoop;
    1700. 

  1700. 	case OASHL:
    1701. 

  1701. 		sh = 1;
    1702. 

  1702. 		args = nil;
    1703. 

  1703. 		optab = shlltab;
    1704. 

  1704. 		goto twoop;
    1705. 

  1705. 	case OLSHR:
    1706. 

  1706. 		sh = 1;
    1707. 

  1707. 		args = shrlargs;
    1708. 

  1708. 		optab = shrltab;
    1709. 

  1709. 		goto twoop;
    1710. 

  1710. 	case OASHR:
    1711. 

  1711. 		sh = 1;
    1712. 

  1712. 		args = sarlargs;
    1713. 

  1713. 		optab = shrltab;
    1714. 

  1714. 		goto twoop;
    1715. 

  1715. 	case OEQ:
    1716. 

  1716. 		cmp = 1;
    1717. 

  1717. 		args = nil;
    1718. 

  1718. 		optab = nil;
    1719. 

  1719. 		goto twoop;
    1720. 

  1720. 	case ONE:
    1721. 

  1721. 		cmp = 1;
    1722. 

  1722. 		args = nil;
    1723. 

  1723. 		optab = nil;
    1724. 

  1724. 		goto twoop;
    1725. 

  1725. 	case OLE:
    1726. 

  1726. 		cmp = 1;
    1727. 

  1727. 		args = nil;
    1728. 

  1728. 		optab = nil;
    1729. 

  1729. 		goto twoop;
    1730. 

  1730. 	case OLT:
    1731. 

  1731. 		cmp = 1;
    1732. 

  1732. 		args = nil;
    1733. 

  1733. 		optab = nil;
    1734. 

  1734. 		goto twoop;
    1735. 

  1735. 	case OGE:
    1736. 

  1736. 		cmp = 1;
    1737. 

  1737. 		args = nil;
    1738. 

  1738. 		optab = nil;
    1739. 

  1739. 		goto twoop;
    1740. 

  1740. 	case OGT:
    1741. 

  1741. 		cmp = 1;
    1742. 

  1742. 		args = nil;
    1743. 

  1743. 		optab = nil;
    1744. 

  1744. 		goto twoop;
    1745. 

  1745. 	case OHI:
    1746. 

  1746. 		cmp = 1;
    1747. 

  1747. 		args = nil;
    1748. 

  1748. 		optab = nil;
    1749. 

  1749. 		goto twoop;
    1750. 

  1750. 	case OHS:
    1751. 

  1751. 		cmp = 1;
    1752. 

  1752. 		args = nil;
    1753. 

  1753. 		optab = nil;
    1754. 

  1754. 		goto twoop;
    1755. 

  1755. 	case OLO:
    1756. 

  1756. 		cmp = 1;
    1757. 

  1757. 		args = nil;
    1758. 

  1758. 		optab = nil;
    1759. 

  1759. 		goto twoop;
    1760. 

  1760. 	case OLS:
    1761. 

  1761. 		cmp = 1;
    1762. 

  1762. 		args = nil;
    1763. 

  1763. 		optab = nil;
    1764. 

  1764. 		goto twoop;
    1765. 

  1765. 

  1766. twoop:
    1767. 

  1767. 		dr = nn != Z && nn->op == OREGPAIR;
    1768. 

  1768. 		l = vfunc(n->left, nn);
    1769. 

  1769. 		if(sh)
    1770. 

  1770. 			r = n->right;
    1771. 

  1771. 		else
    1772. 

  1772. 			r = vfunc(n->right, nn);
    1773. 

  1773. 

  1774. 		li = l->op == ONAME || l->op == OINDREG || l->op == OCONST;
    1775. 

  1775. 		ri = r->op == ONAME || r->op == OINDREG || r->op == OCONST;
    1776. 

  1776. 

  1777. #define	IMM(l, r)	((l) | ((r) << 1))
    1778. 

  1778. 

  1779. 		lri = IMM(li, ri);
    1780. 

  1780. 

  1781. 		/* find out what is so easy about some operands */
    1782. 

  1782. 		if(li)
    1783. 

  1783. 			li = whatof(l, sh | cmp);
    1784. 

  1784. 		if(ri)
    1785. 

  1785. 			ri = whatof(r, cmp);
    1786. 

  1786. 

  1787. 		if(sh)
    1788. 

  1788. 			goto shift;
    1789. 

  1789. 

  1790. 		if(cmp)
    1791. 

  1791. 			goto cmp;
    1792. 

  1792. 

  1793. 		/* evaluate hard subexps, stealing nn if possible. */
    1794. 

  1794. 		switch(lri) {
    1795. 

  1795. 		case IMM(0, 0):
    1796. 

  1796. 		bin00:
    1797. 

  1797. 			if(l->complex > r->complex) {
    1798. 

  1798. 				if(dr)
    1799. 

  1799. 					t = nn;
    1800. 

  1800. 				else
    1801. 

  1801. 					t = regpair(Z, n);
    1802. 

  1802. 				sugen(l, t, 8);
    1803. 

  1803. 				l = t;
    1804. 

  1804. 				t = regpair(Z, n);
    1805. 

  1805. 				sugen(r, t, 8);
    1806. 

  1806. 				r = t;
    1807. 

  1807. 			}
    1808. 

  1808. 			else {
    1809. 

  1809. 				t = regpair(Z, n);
    1810. 

  1810. 				sugen(r, t, 8);
    1811. 

  1811. 				r = t;
    1812. 

  1812. 				if(dr)
    1813. 

  1813. 					t = nn;
    1814. 

  1814. 				else
    1815. 

  1815. 					t = regpair(Z, n);
    1816. 

  1816. 				sugen(l, t, 8);
    1817. 

  1817. 				l = t;
    1818. 

  1818. 			}
    1819. 

  1819. 			break;
    1820. 

  1820. 		case IMM(0, 1):
    1821. 

  1821. 			if(dr)
    1822. 

  1822. 				t = nn;
    1823. 

  1823. 			else
    1824. 

  1824. 				t = regpair(Z, n);
    1825. 

  1825. 			sugen(l, t, 8);
    1826. 

  1826. 			l = t;
    1827. 

  1827. 			break;
    1828. 

  1828. 		case IMM(1, 0):
    1829. 

  1829. 			if(n->op == OSUB && l->op == OCONST && hi64v(l) == 0) {
    1830. 

  1830. 				lri = IMM(0, 0);
    1831. 

  1831. 				goto bin00;
    1832. 

  1832. 			}
    1833. 

  1833. 			if(dr)
    1834. 

  1834. 				t = nn;
    1835. 

  1835. 			else
    1836. 

  1836. 				t = regpair(Z, n);
    1837. 

  1837. 			sugen(r, t, 8);
    1838. 

  1838. 			r = t;
    1839. 

  1839. 			break;
    1840. 

  1840. 		case IMM(1, 1):
    1841. 

  1841. 			break;
    1842. 

  1842. 		}
    1843. 

  1843. 

  1844. #define	WW(l, r)	((l) | ((r) << 2))
    1845. 

  1845. 		d = Z;
    1846. 

  1846. 		dt = nn->type;
    1847. 

  1847. 		nn->type = types[TLONG];
    1848. 

  1848. 

  1849. 		switch(lri) {
    1850. 

  1850. 		case IMM(0, 0):
    1851. 

  1851. 			biggen(l, r, Z, 0, binop00, args);
    1852. 

  1852. 			break;
    1853. 

  1853. 		case IMM(0, 1):
    1854. 

  1854. 			switch(ri) {
    1855. 

  1855. 			case WNONE:
    1856. 

  1856. 				diag(r, "bad whatof\n");
    1857. 

  1857. 				break;
    1858. 

  1858. 			case WCONST:
    1859. 

  1859. 				biggen(l, r, Z, 0, optab[B0c], args);
    1860. 

  1860. 				break;
    1861. 

  1861. 			case WHARD:
    1862. 

  1862. 				reglcgen(&nod2, r, Z);
    1863. 

  1863. 				r = &nod2;
    1864. 

  1864. 				/* fall thru */
    1865. 

  1865. 			case WADDR:
    1866. 

  1866. 				biggen(l, r, Z, 0, binoptmp, args);
    1867. 

  1867. 				if(ri == WHARD)
    1868. 

  1868. 					regfree(r);
    1869. 

  1869. 				break;
    1870. 

  1870. 			}
    1871. 

  1871. 			break;
    1872. 

  1872. 		case IMM(1, 0):
    1873. 

  1873. 			if(n->op == OSUB) {
    1874. 

  1874. 				switch(li) {
    1875. 

  1875. 				case WNONE:
    1876. 

  1876. 					diag(l, "bad whatof\n");
    1877. 

  1877. 					break;
    1878. 

  1878. 				case WHARD:
    1879. 

  1879. 					reglcgen(&nod2, l, Z);
    1880. 

  1880. 					l = &nod2;
    1881. 

  1881. 					/* fall thru */
    1882. 

  1882. 				case WADDR:
    1883. 

  1883. 				case WCONST:
    1884. 

  1884. 					biggen(l, r, Z, 0, sub10, args);
    1885. 

  1885. 					break;
    1886. 

  1886. 				}
    1887. 

  1887. 				if(li == WHARD)
    1888. 

  1888. 					regfree(l);
    1889. 

  1889. 			}
    1890. 

  1890. 			else {
    1891. 

  1891. 				switch(li) {
    1892. 

  1892. 				case WNONE:
    1893. 

  1893. 					diag(l, "bad whatof\n");
    1894. 

  1894. 					break;
    1895. 

  1895. 				case WCONST:
    1896. 

  1896. 					biggen(r, l, Z, 0, optab[B0c], args);
    1897. 

  1897. 					break;
    1898. 

  1898. 				case WHARD:
    1899. 

  1899. 					reglcgen(&nod2, l, Z);
    1900. 

  1900. 					l = &nod2;
    1901. 

  1901. 					/* fall thru */
    1902. 

  1902. 				case WADDR:
    1903. 

  1903. 					biggen(r, l, Z, 0, binoptmp, args);
    1904. 

  1904. 					if(li == WHARD)
    1905. 

  1905. 						regfree(l);
    1906. 

  1906. 					break;
    1907. 

  1907. 				}
    1908. 

  1908. 			}
    1909. 

  1909. 			break;
    1910. 

  1910. 		case IMM(1, 1):
    1911. 

  1911. 			switch(WW(li, ri)) {
    1912. 

  1912. 			case WW(WCONST, WHARD):
    1913. 

  1913. 				if(r->op == ONAME && n->op == OAND && reduxv(l))
    1914. 

  1914. 					ri = WADDR;
    1915. 

  1915. 				break;
    1916. 

  1916. 			case WW(WHARD, WCONST):
    1917. 

  1917. 				if(l->op == ONAME && n->op == OAND && reduxv(r))
    1918. 

  1918. 					li = WADDR;
    1919. 

  1919. 				break;
    1920. 

  1920. 			}
    1921. 

  1921. 			if(li == WHARD) {
    1922. 

  1922. 				reglcgen(&nod3, l, Z);
    1923. 

  1923. 				l = &nod3;
    1924. 

  1924. 			}
    1925. 

  1925. 			if(ri == WHARD) {
    1926. 

  1926. 				reglcgen(&nod2, r, Z);
    1927. 

  1927. 				r = &nod2;
    1928. 

  1928. 			}
    1929. 

  1929. 			d = regpair(nn, n);
    1930. 

  1930. 			instpair(d, Z);
    1931. 

  1931. 			switch(WW(li, ri)) {
    1932. 

  1932. 			case WW(WCONST, WADDR):
    1933. 

  1933. 			case WW(WCONST, WHARD):
    1934. 

  1934. 				biggen(l, r, d, 0, optab[Bca], args);
    1935. 

  1935. 				break;
    1936. 

  1936. 

  1937. 			case WW(WADDR, WCONST):
    1938. 

  1938. 			case WW(WHARD, WCONST):
    1939. 

  1939. 				biggen(l, r, d, 0, optab[Bac], args);
    1940. 

  1940. 				break;
    1941. 

  1941. 

  1942. 			case WW(WADDR, WADDR):
    1943. 

  1943. 			case WW(WADDR, WHARD):
    1944. 

  1944. 			case WW(WHARD, WADDR):
    1945. 

  1945. 			case WW(WHARD, WHARD):
    1946. 

  1946. 				biggen(l, r, d, 0, binop11, args);
    1947. 

  1947. 				break;
    1948. 

  1948. 

  1949. 			default:
    1950. 

  1950. 				diag(r, "bad whatof pair %d %d\n", li, ri);
    1951. 

  1951. 				break;
    1952. 

  1952. 			}
    1953. 

  1953. 			if(li == WHARD)
    1954. 

  1954. 				regfree(l);
    1955. 

  1955. 			if(ri == WHARD)
    1956. 

  1956. 				regfree(r);
    1957. 

  1957. 			break;
    1958. 

  1958. 		}
    1959. 

  1959. 

  1960. 		nn->type = dt;
    1961. 

  1961. 

  1962. 		if(d != Z)
    1963. 

  1963. 			goto finished;
    1964. 

  1964. 

  1965. 		switch(lri) {
    1966. 

  1966. 		case IMM(0, 0):
    1967. 

  1967. 			freepair(r);
    1968. 

  1968. 			/* fall thru */;
    1969. 

  1969. 		case IMM(0, 1):
    1970. 

  1970. 			if(!dr)
    1971. 

  1971. 				storepair(l, nn, 1);
    1972. 

  1972. 			break;
    1973. 

  1973. 		case IMM(1, 0):
    1974. 

  1974. 			if(!dr)
    1975. 

  1975. 				storepair(r, nn, 1);
    1976. 

  1976. 			break;
    1977. 

  1977. 		case IMM(1, 1):
    1978. 

  1978. 			break;
    1979. 

  1979. 		}
    1980. 

  1980. 		return 1;
    1981. 

  1981. 

  1982. 	shift:
    1983. 

  1983. 		c = Z;
    1984. 

  1984. 

  1985. 		/* evaluate hard subexps, stealing nn if possible. */
    1986. 

  1986. 		/* must also secure CX.  not as many optims as binop. */
    1987. 

  1987. 		switch(lri) {
    1988. 

  1988. 		case IMM(0, 0):
    1989. 

  1989. 		imm00:
    1990. 

  1990. 			if(l->complex + 1 > r->complex) {
    1991. 

  1991. 				if(dr)
    1992. 

  1992. 					t = nn;
    1993. 

  1993. 				else
    1994. 

  1994. 					t = regpair(Z, l);
    1995. 

  1995. 				sugen(l, t, 8);
    1996. 

  1996. 				l = t;
    1997. 

  1997. 				t = &nod1;
    1998. 

  1998. 				c = snarfreg(l, t, D_CX, r, &nod2);
    1999. 

  1999. 				cgen(r, t);
    2000. 

  2000. 				r = t;
    2001. 

  2001. 			}
    2002. 

  2002. 			else {
    2003. 

  2003. 				t = &nod1;
    2004. 

  2004. 				c = snarfreg(nn, t, D_CX, r, &nod2);
    2005. 

  2005. 				cgen(r, t);
    2006. 

  2006. 				r = t;
    2007. 

  2007. 				if(dr)
    2008. 

  2008. 					t = nn;
    2009. 

  2009. 				else
    2010. 

  2010. 					t = regpair(Z, l);
    2011. 

  2011. 				sugen(l, t, 8);
    2012. 

  2012. 				l = t;
    2013. 

  2013. 			}
    2014. 

  2014. 			break;
    2015. 

  2015. 		case IMM(0, 1):
    2016. 

  2016. 		imm01:
    2017. 

  2017. 			if(ri != WCONST) {
    2018. 

  2018. 				lri = IMM(0, 0);
    2019. 

  2019. 				goto imm00;
    2020. 

  2020. 			}
    2021. 

  2021. 			if(dr)
    2022. 

  2022. 				t = nn;
    2023. 

  2023. 			else
    2024. 

  2024. 				t = regpair(Z, n);
    2025. 

  2025. 			sugen(l, t, 8);
    2026. 

  2026. 			l = t;
    2027. 

  2027. 			break;
    2028. 

  2028. 		case IMM(1, 0):
    2029. 

  2029. 		imm10:
    2030. 

  2030. 			if(li != WCONST) {
    2031. 

  2031. 				lri = IMM(0, 0);
    2032. 

  2032. 				goto imm00;
    2033. 

  2033. 			}
    2034. 

  2034. 			t = &nod1;
    2035. 

  2035. 			c = snarfreg(nn, t, D_CX, r, &nod2);
    2036. 

  2036. 			cgen(r, t);
    2037. 

  2037. 			r = t;
    2038. 

  2038. 			break;
    2039. 

  2039. 		case IMM(1, 1):
    2040. 

  2040. 			if(ri != WCONST) {
    2041. 

  2041. 				lri = IMM(1, 0);
    2042. 

  2042. 				goto imm10;
    2043. 

  2043. 			}
    2044. 

  2044. 			if(li == WHARD) {
    2045. 

  2045. 				lri = IMM(0, 1);
    2046. 

  2046. 				goto imm01;
    2047. 

  2047. 			}
    2048. 

  2048. 			break;
    2049. 

  2049. 		}
    2050. 

  2050. 

  2051. 		d = Z;
    2052. 

  2052. 

  2053. 		switch(lri) {
    2054. 

  2054. 		case IMM(0, 0):
    2055. 

  2055. 			biggen(l, r, Z, 0, optab[S00], args);
    2056. 

  2056. 			break;
    2057. 

  2057. 		case IMM(0, 1):
    2058. 

  2058. 			switch(ri) {
    2059. 

  2059. 			case WNONE:
    2060. 

  2060. 			case WADDR:
    2061. 

  2061. 			case WHARD:
    2062. 

  2062. 				diag(r, "bad whatof\n");
    2063. 

  2063. 				break;
    2064. 

  2064. 			case WCONST:
    2065. 

  2065. 				m = r->vconst & 63;
    2066. 

  2066. 				s = nodconst(m);
    2067. 

  2067. 				if(m < 32)
    2068. 

  2068. 					cp = optab[Sc0];
    2069. 

  2069. 				else if(m == 32)
    2070. 

  2070. 					cp = optab[Sc1];
    2071. 

  2071. 				else
    2072. 

  2072. 					cp = optab[Sc2];
    2073. 

  2073. 				biggen(l, s, Z, 0, cp, args);
    2074. 

  2074. 				break;
    2075. 

  2075. 			}
    2076. 

  2076. 			break;
    2077. 

  2077. 		case IMM(1, 0):
    2078. 

  2078. 			/* left is const */
    2079. 

  2079. 			d = regpair(nn, n);
    2080. 

  2080. 			instpair(d, Z);
    2081. 

  2081. 			biggen(l, r, d, 0, optab[S10], args);
    2082. 

  2082. 			regfree(r);
    2083. 

  2083. 			break;
    2084. 

  2084. 		case IMM(1, 1):
    2085. 

  2085. 			d = regpair(nn, n);
    2086. 

  2086. 			instpair(d, Z);
    2087. 

  2087. 			switch(WW(li, ri)) {
    2088. 

  2088. 			case WW(WADDR, WCONST):
    2089. 

  2089. 				m = r->vconst & 63;
    2090. 

  2090. 				s = nodconst(m);
    2091. 

  2091. 				if(m < 32) {
    2092. 

  2092. 					loadpair(l, d);
    2093. 

  2093. 					l = d;
    2094. 

  2094. 					cp = optab[Sc0];
    2095. 

  2095. 				}
    2096. 

  2096. 				else if(m == 32)
    2097. 

  2097. 					cp = optab[Sac3];
    2098. 

  2098. 				else
    2099. 

  2099. 					cp = optab[Sac4];
    2100. 

  2100. 				biggen(l, s, d, 0, cp, args);
    2101. 

  2101. 				break;
    2102. 

  2102. 

  2103. 			default:
    2104. 

  2104. 				diag(r, "bad whatof pair %d %d\n", li, ri);
    2105. 

  2105. 				break;
    2106. 

  2106. 			}
    2107. 

  2107. 			break;
    2108. 

  2108. 		}
    2109. 

  2109. 

  2110. 		if(c != Z) {
    2111. 

  2111. 			gins(AMOVL, c, r);
    2112. 

  2112. 			regfree(c);
    2113. 

  2113. 		}
    2114. 

  2114. 

  2115. 		if(d != Z)
    2116. 

  2116. 			goto finished;
    2117. 

  2117. 

  2118. 		switch(lri) {
    2119. 

  2119. 		case IMM(0, 0):
    2120. 

  2120. 			regfree(r);
    2121. 

  2121. 			/* fall thru */
    2122. 

  2122. 		case IMM(0, 1):
    2123. 

  2123. 			if(!dr)
    2124. 

  2124. 				storepair(l, nn, 1);
    2125. 

  2125. 			break;
    2126. 

  2126. 		case IMM(1, 0):
    2127. 

  2127. 			regfree(r);
    2128. 

  2128. 			break;
    2129. 

  2129. 		case IMM(1, 1):
    2130. 

  2130. 			break;
    2131. 

  2131. 		}
    2132. 

  2132. 		return 1;
    2133. 

  2133. 

  2134. 	cmp:
    2135. 

  2135. 		op = n->op;
    2136. 

  2136. 		/* evaluate hard subexps */
    2137. 

  2137. 		switch(lri) {
    2138. 

  2138. 		case IMM(0, 0):
    2139. 

  2139. 			if(l->complex > r->complex) {
    2140. 

  2140. 				t = regpair(Z, l);
    2141. 

  2141. 				sugen(l, t, 8);
    2142. 

  2142. 				l = t;
    2143. 

  2143. 				t = regpair(Z, r);
    2144. 

  2144. 				sugen(r, t, 8);
    2145. 

  2145. 				r = t;
    2146. 

  2146. 			}
    2147. 

  2147. 			else {
    2148. 

  2148. 				t = regpair(Z, r);
    2149. 

  2149. 				sugen(r, t, 8);
    2150. 

  2150. 				r = t;
    2151. 

  2151. 				t = regpair(Z, l);
    2152. 

  2152. 				sugen(l, t, 8);
    2153. 

  2153. 				l = t;
    2154. 

  2154. 			}
    2155. 

  2155. 			break;
    2156. 

  2156. 		case IMM(1, 0):
    2157. 

  2157. 			t = r;
    2158. 

  2158. 			r = l;
    2159. 

  2159. 			l = t;
    2160. 

  2160. 			ri = li;
    2161. 

  2161. 			op = invrel[relindex(op)];
    2162. 

  2162. 			/* fall thru */
    2163. 

  2163. 		case IMM(0, 1):
    2164. 

  2164. 			t = regpair(Z, l);
    2165. 

  2165. 			sugen(l, t, 8);
    2166. 

  2166. 			l = t;
    2167. 

  2167. 			break;
    2168. 

  2168. 		case IMM(1, 1):
    2169. 

  2169. 			break;
    2170. 

  2170. 		}
    2171. 

  2171. 

  2172. 		true = 1;
    2173. 

  2173. 		optab = cmptab;
    2174. 

  2174. 		switch(op) {
    2175. 

  2175. 		case OEQ:
    2176. 

  2176. 			optab = NEtab;
    2177. 

  2177. 			true = 0;
    2178. 

  2178. 			break;
    2179. 

  2179. 		case ONE:
    2180. 

  2180. 			optab = NEtab;
    2181. 

  2181. 			break;
    2182. 

  2182. 		case OLE:
    2183. 

  2183. 			args = GTargs;
    2184. 

  2184. 			true = 0;
    2185. 

  2185. 			break;
    2186. 

  2186. 		case OGT:
    2187. 

  2187. 			args = GTargs;
    2188. 

  2188. 			break;
    2189. 

  2189. 		case OLS:
    2190. 

  2190. 			args = HIargs;
    2191. 

  2191. 			true = 0;
    2192. 

  2192. 			break;
    2193. 

  2193. 		case OHI:
    2194. 

  2194. 			args = HIargs;
    2195. 

  2195. 			break;
    2196. 

  2196. 		case OLT:
    2197. 

  2197. 			args = GEargs;
    2198. 

  2198. 			true = 0;
    2199. 

  2199. 			break;
    2200. 

  2200. 		case OGE:
    2201. 

  2201. 			args = GEargs;
    2202. 

  2202. 			break;
    2203. 

  2203. 		case OLO:
    2204. 

  2204. 			args = HSargs;
    2205. 

  2205. 			true = 0;
    2206. 

  2206. 			break;
    2207. 

  2207. 		case OHS:
    2208. 

  2208. 			args = HSargs;
    2209. 

  2209. 			break;
    2210. 

  2210. 		default:
    2211. 

  2211. 			diag(n, "bad cmp\n");
    2212. 

  2212. 			SET(optab);
    2213. 

  2213. 		}
    2214. 

  2214. 

  2215. 		switch(lri) {
    2216. 

  2216. 		case IMM(0, 0):
    2217. 

  2217. 			biggen(l, r, Z, true, optab[T0i], args);
    2218. 

  2218. 			break;
    2219. 

  2219. 		case IMM(0, 1):
    2220. 

  2220. 		case IMM(1, 0):
    2221. 

  2221. 			switch(ri) {
    2222. 

  2222. 			case WNONE:
    2223. 

  2223. 				diag(l, "bad whatof\n");
    2224. 

  2224. 				break;
    2225. 

  2225. 			case WCONST:
    2226. 

  2226. 				biggen(l, r, Z, true, optab[T0i], args);
    2227. 

  2227. 				break;
    2228. 

  2228. 			case WHARD:
    2229. 

  2229. 				reglcgen(&nod2, r, Z);
    2230. 

  2230. 				r = &nod2;
    2231. 

  2231. 				/* fall thru */
    2232. 

  2232. 			case WADDR:
    2233. 

  2233. 				biggen(l, r, Z, true, optab[T0i], args);
    2234. 

  2234. 				if(ri == WHARD)
    2235. 

  2235. 					regfree(r);
    2236. 

  2236. 				break;
    2237. 

  2237. 			}
    2238. 

  2238. 			break;
    2239. 

  2239. 		case IMM(1, 1):
    2240. 

  2240. 			if(li == WHARD) {
    2241. 

  2241. 				reglcgen(&nod3, l, Z);
    2242. 

  2242. 				l = &nod3;
    2243. 

  2243. 			}
    2244. 

  2244. 			if(ri == WHARD) {
    2245. 

  2245. 				reglcgen(&nod2, r, Z);
    2246. 

  2246. 				r = &nod2;
    2247. 

  2247. 			}
    2248. 

  2248. 			biggen(l, r, Z, true, optab[Tii], args);
    2249. 

  2249. 			if(li == WHARD)
    2250. 

  2250. 				regfree(l);
    2251. 

  2251. 			if(ri == WHARD)
    2252. 

  2252. 				regfree(r);
    2253. 

  2253. 			break;
    2254. 

  2254. 		}
    2255. 

  2255. 

  2256. 		switch(lri) {
    2257. 

  2257. 		case IMM(0, 0):
    2258. 

  2258. 			freepair(r);
    2259. 

  2259. 			/* fall thru */;
    2260. 

  2260. 		case IMM(0, 1):
    2261. 

  2261. 		case IMM(1, 0):
    2262. 

  2262. 			freepair(l);
    2263. 

  2263. 			break;
    2264. 

  2264. 		case IMM(1, 1):
    2265. 

  2265. 			break;
    2266. 

  2266. 		}
    2267. 

  2267. 		return 1;
    2268. 

  2268. 

  2269. 	case OASMUL:
    2270. 

  2270. 	case OASLMUL:
    2271. 

  2271. 		m = 0;
    2272. 

  2272. 		goto mulop;
    2273. 

  2273. 

  2274. 	case OMUL:
    2275. 

  2275. 	case OLMUL:
    2276. 

  2276. 		m = 1;
    2277. 

  2277. 		goto mulop;
    2278. 

  2278. 

  2279. 	mulop:
    2280. 

  2280. 		dr = nn != Z && nn->op == OREGPAIR;
    2281. 

  2281. 		l = vfunc(n->left, nn);
    2282. 

  2282. 		r = vfunc(n->right, nn);
    2283. 

  2283. 		if(r->op != OCONST) {
    2284. 

  2284. 			if(l->complex > r->complex) {
    2285. 

  2285. 				if(m) {
    2286. 

  2286. 					t = l;
    2287. 

  2287. 					l = r;
    2288. 

  2288. 					r = t;
    2289. 

  2289. 				}
    2290. 

  2290. 				else if(!vaddr(l, 1)) {
    2291. 

  2291. 					reglcgen(&nod5, l, Z);
    2292. 

  2292. 					l = &nod5;
    2293. 

  2293. 					evacaxdx(l);
    2294. 

  2294. 				}
    2295. 

  2295. 			}
    2296. 

  2296. 			t = regpair(Z, n);
    2297. 

  2297. 			sugen(r, t, 8);
    2298. 

  2298. 			r = t;
    2299. 

  2299. 			evacaxdx(r->left);
    2300. 

  2300. 			evacaxdx(r->right);
    2301. 

  2301. 			if(l->complex <= r->complex && !m && !vaddr(l, 1)) {
    2302. 

  2302. 				reglcgen(&nod5, l, Z);
    2303. 

  2303. 				l = &nod5;
    2304. 

  2304. 				evacaxdx(l);
    2305. 

  2305. 			}
    2306. 

  2306. 		}
    2307. 

  2307. 		if(dr)
    2308. 

  2308. 			t = nn;
    2309. 

  2309. 		else
    2310. 

  2310. 			t = regpair(Z, n);
    2311. 

  2311. 		c = Z;
    2312. 

  2312. 		d = Z;
    2313. 

  2313. 		if(!nodreg(&nod1, t->left, D_AX)) {
    2314. 

  2314. 			if(t->left->reg != D_AX){
    2315. 

  2315. 				t->left->reg = D_AX;
    2316. 

  2316. 				reg[D_AX]++;
    2317. 

  2317. 			}else if(reg[D_AX] == 0)
    2318. 

  2318. 				fatal(Z, "vlong mul AX botch");
    2319. 

  2319. 		}
    2320. 

  2320. 		if(!nodreg(&nod2, t->right, D_DX)) {
    2321. 

  2321. 			if(t->right->reg != D_DX){
    2322. 

  2322. 				t->right->reg = D_DX;
    2323. 

  2323. 				reg[D_DX]++;
    2324. 

  2324. 			}else if(reg[D_DX] == 0)
    2325. 

  2325. 				fatal(Z, "vlong mul DX botch");
    2326. 

  2326. 		}
    2327. 

  2327. 		if(m)
    2328. 

  2328. 			sugen(l, t, 8);
    2329. 

  2329. 		else
    2330. 

  2330. 			loadpair(l, t);
    2331. 

  2331. 		if(t->left->reg != D_AX) {
    2332. 

  2332. 			c = &nod3;
    2333. 

  2333. 			regsalloc(c, t->left);
    2334. 

  2334. 			gmove(&nod1, c);
    2335. 

  2335. 			gmove(t->left, &nod1);
    2336. 

  2336. 			zapreg(t->left);
    2337. 

  2337. 		}
    2338. 

  2338. 		if(t->right->reg != D_DX) {
    2339. 

  2339. 			d = &nod4;
    2340. 

  2340. 			regsalloc(d, t->right);
    2341. 

  2341. 			gmove(&nod2, d);
    2342. 

  2342. 			gmove(t->right, &nod2);
    2343. 

  2343. 			zapreg(t->right);
    2344. 

  2344. 		}
    2345. 

  2345. 		if(c != Z || d != Z) {
    2346. 

  2346. 			s = regpair(Z, n);
    2347. 

  2347. 			s->left = &nod1;
    2348. 

  2348. 			s->right = &nod2;
    2349. 

  2349. 		}
    2350. 

  2350. 		else
    2351. 

  2351. 			s = t;
    2352. 

  2352. 		if(r->op == OCONST) {
    2353. 

  2353. 			if(hi64v(r) == 0)
    2354. 

  2354. 				biggen(s, r, Z, 0, mulc32, nil);
    2355. 

  2355. 			else
    2356. 

  2356. 				biggen(s, r, Z, 0, mulc64, nil);
    2357. 

  2357. 		}
    2358. 

  2358. 		else
    2359. 

  2359. 			biggen(s, r, Z, 0, mull, nil);
    2360. 

  2360. 		instpair(t, Z);
    2361. 

  2361. 		if(c != Z) {
    2362. 

  2362. 			gmove(&nod1, t->left);
    2363. 

  2363. 			gmove(&nod3, &nod1);
    2364. 

  2364. 		}
    2365. 

  2365. 		if(d != Z) {
    2366. 

  2366. 			gmove(&nod2, t->right);
    2367. 

  2367. 			gmove(&nod4, &nod2);
    2368. 

  2368. 		}
    2369. 

  2369. 		if(r->op == OREGPAIR)
    2370. 

  2370. 			freepair(r);
    2371. 

  2371. 		if(!m)
    2372. 

  2372. 			storepair(t, l, 0);
    2373. 

  2373. 		if(l == &nod5)
    2374. 

  2374. 			regfree(l);
    2375. 

  2375. 		if(!dr) {
    2376. 

  2376. 			if(nn != Z)
    2377. 

  2377. 				storepair(t, nn, 1);
    2378. 

  2378. 			else
    2379. 

  2379. 				freepair(t);
    2380. 

  2380. 		}
    2381. 

  2381. 		return 1;
    2382. 

  2382. 

  2383. 	case OASADD:
    2384. 

  2384. 		args = ADDargs;
    2385. 

  2385. 		goto vasop;
    2386. 

  2386. 	case OASAND:
    2387. 

  2387. 		args = ANDargs;
    2388. 

  2388. 		goto vasop;
    2389. 

  2389. 	case OASOR:
    2390. 

  2390. 		args = ORargs;
    2391. 

  2391. 		goto vasop;
    2392. 

  2392. 	case OASSUB:
    2393. 

  2393. 		args = SUBargs;
    2394. 

  2394. 		goto vasop;
    2395. 

  2395. 	case OASXOR:
    2396. 

  2396. 		args = XORargs;
    2397. 

  2397. 		goto vasop;
    2398. 

  2398. 

  2399. 	vasop:
    2400. 

  2400. 		l = n->left;
    2401. 

  2401. 		r = n->right;
    2402. 

  2402. 		dr = nn != Z && nn->op == OREGPAIR;
    2403. 

  2403. 		m = 0;
    2404. 

  2404. 		if(l->complex > r->complex) {
    2405. 

  2405. 			if(!vaddr(l, 1)) {
    2406. 

  2406. 				reglcgen(&nod1, l, Z);
    2407. 

  2407. 				l = &nod1;
    2408. 

  2408. 			}
    2409. 

  2409. 			if(!vaddr(r, 1) || nn != Z || r->op == OCONST) {
    2410. 

  2410. 				if(dr)
    2411. 

  2411. 					t = nn;
    2412. 

  2412. 				else
    2413. 

  2413. 					t = regpair(Z, r);
    2414. 

  2414. 				sugen(r, t, 8);
    2415. 

  2415. 				r = t;
    2416. 

  2416. 				m = 1;
    2417. 

  2417. 			}
    2418. 

  2418. 		}
    2419. 

  2419. 		else {
    2420. 

  2420. 			if(!vaddr(r, 1) || nn != Z || r->op == OCONST) {
    2421. 

  2421. 				if(dr)
    2422. 

  2422. 					t = nn;
    2423. 

  2423. 				else
    2424. 

  2424. 					t = regpair(Z, r);
    2425. 

  2425. 				sugen(r, t, 8);
    2426. 

  2426. 				r = t;
    2427. 

  2427. 				m = 1;
    2428. 

  2428. 			}
    2429. 

  2429. 			if(!vaddr(l, 1)) {
    2430. 

  2430. 				reglcgen(&nod1, l, Z);
    2431. 

  2431. 				l = &nod1;
    2432. 

  2432. 			}
    2433. 

  2433. 		}
    2434. 

  2434. 		if(nn != Z) {
    2435. 

  2435. 			if(n->op == OASSUB)
    2436. 

  2436. 				biggen(l, r, Z, 0, sub10, args);
    2437. 

  2437. 			else
    2438. 

  2438. 				biggen(r, l, Z, 0, binoptmp, args);
    2439. 

  2439. 			storepair(r, l, 0);
    2440. 

  2440. 		}
    2441. 

  2441. 		else {
    2442. 

  2442. 			if(m)
    2443. 

  2443. 				biggen(l, r, Z, 0, binop00, args);
    2444. 

  2444. 			else
    2445. 

  2445. 				biggen(l, r, Z, 0, binoptmp, args);
    2446. 

  2446. 		}
    2447. 

  2447. 		if(l == &nod1)
    2448. 

  2448. 			regfree(&nod1);
    2449. 

  2449. 		if(m) {
    2450. 

  2450. 			if(nn == Z)
    2451. 

  2451. 				freepair(r);
    2452. 

  2452. 			else if(!dr)
    2453. 

  2453. 				storepair(r, nn, 1);
    2454. 

  2454. 		}
    2455. 

  2455. 		return 1;
    2456. 

  2456. 

  2457. 	case OASASHL:
    2458. 

  2458. 		args = nil;
    2459. 

  2459. 		optab = asshlltab;
    2460. 

  2460. 		goto assh;
    2461. 

  2461. 	case OASLSHR:
    2462. 

  2462. 		args = shrlargs;
    2463. 

  2463. 		optab = asshrltab;
    2464. 

  2464. 		goto assh;
    2465. 

  2465. 	case OASASHR:
    2466. 

  2466. 		args = sarlargs;
    2467. 

  2467. 		optab = asshrltab;
    2468. 

  2468. 		goto assh;
    2469. 

  2469. 

  2470. 	assh:
    2471. 

  2471. 		c = Z;
    2472. 

  2472. 		l = n->left;
    2473. 

  2473. 		r = n->right;
    2474. 

  2474. 		if(r->op == OCONST) {
    2475. 

  2475. 			m = r->vconst & 63;
    2476. 

  2476. 			if(m < 32)
    2477. 

  2477. 				m = SAclo;
    2478. 

  2478. 			else if(m == 32)
    2479. 

  2479. 				m = SAc32;
    2480. 

  2480. 			else
    2481. 

  2481. 				m = SAchi;
    2482. 

  2482. 		}
    2483. 

  2483. 		else
    2484. 

  2484. 			m = SAgen;
    2485. 

  2485. 		if(l->complex > r->complex) {
    2486. 

  2486. 			if(!vaddr(l, 0)) {
    2487. 

  2487. 				reglcgen(&nod1, l, Z);
    2488. 

  2488. 				l = &nod1;
    2489. 

  2489. 			}
    2490. 

  2490. 			if(m == SAgen) {
    2491. 

  2491. 				t = &nod2;
    2492. 

  2492. 				if(l->reg == D_CX) {
    2493. 

  2493. 					regalloc(t, r, Z);
    2494. 

  2494. 					gmove(l, t);
    2495. 

  2495. 					l->reg = t->reg;
    2496. 

  2496. 					t->reg = D_CX;
    2497. 

  2497. 				}
    2498. 

  2498. 				else
    2499. 

  2499. 					c = snarfreg(nn, t, D_CX, r, &nod3);
    2500. 

  2500. 				cgen(r, t);
    2501. 

  2501. 				r = t;
    2502. 

  2502. 			}
    2503. 

  2503. 		}
    2504. 

  2504. 		else {
    2505. 

  2505. 			if(m == SAgen) {
    2506. 

  2506. 				t = &nod2;
    2507. 

  2507. 				c = snarfreg(nn, t, D_CX, r, &nod3);
    2508. 

  2508. 				cgen(r, t);
    2509. 

  2509. 				r = t;
    2510. 

  2510. 			}
    2511. 

  2511. 			if(!vaddr(l, 0)) {
    2512. 

  2512. 				reglcgen(&nod1, l, Z);
    2513. 

  2513. 				l = &nod1;
    2514. 

  2514. 			}
    2515. 

  2515. 		}
    2516. 

  2516. 

  2517. 		if(nn != Z) {
    2518. 

  2518. 			m += SAdgen - SAgen;
    2519. 

  2519. 			d = regpair(nn, n);
    2520. 

  2520. 			instpair(d, Z);
    2521. 

  2521. 			biggen(l, r, d, 0, optab[m], args);
    2522. 

  2522. 			if(l == &nod1) {
    2523. 

  2523. 				regfree(&nod1);
    2524. 

  2524. 				l = Z;
    2525. 

  2525. 			}
    2526. 

  2526. 			if(r == &nod2 && c == Z) {
    2527. 

  2527. 				regfree(&nod2);
    2528. 

  2528. 				r = Z;
    2529. 

  2529. 			}
    2530. 

  2530. 			if(d != nn)
    2531. 

  2531. 				storepair(d, nn, 1);
    2532. 

  2532. 		}
    2533. 

  2533. 		else
    2534. 

  2534. 			biggen(l, r, Z, 0, optab[m], args);
    2535. 

  2535. 

  2536. 		if(c != Z) {
    2537. 

  2537. 			gins(AMOVL, c, r);
    2538. 

  2538. 			regfree(c);
    2539. 

  2539. 		}
    2540. 

  2540. 		if(l == &nod1)
    2541. 

  2541. 			regfree(&nod1);
    2542. 

  2542. 		if(r == &nod2)
    2543. 

  2543. 			regfree(&nod2);
    2544. 

  2544. 		return 1;
    2545. 

  2545. 

  2546. 	case OPOSTINC:
    2547. 

  2547. 		args = ADDargs;
    2548. 

  2548. 		cp = incdecpost;
    2549. 

  2549. 		goto vinc;
    2550. 

  2550. 	case OPOSTDEC:
    2551. 

  2551. 		args = SUBargs;
    2552. 

  2552. 		cp = incdecpost;
    2553. 

  2553. 		goto vinc;
    2554. 

  2554. 	case OPREINC:
    2555. 

  2555. 		args = ADDargs;
    2556. 

  2556. 		cp = incdecpre;
    2557. 

  2557. 		goto vinc;
    2558. 

  2558. 	case OPREDEC:
    2559. 

  2559. 		args = SUBargs;
    2560. 

  2560. 		cp = incdecpre;
    2561. 

  2561. 		goto vinc;
    2562. 

  2562. 

  2563. 	vinc:
    2564. 

  2564. 		l = n->left;
    2565. 

  2565. 		if(!vaddr(l, 1)) {
    2566. 

  2566. 			reglcgen(&nod1, l, Z);
    2567. 

  2567. 			l = &nod1;
    2568. 

  2568. 		}
    2569. 

  2569. 		
    2570. 

  2570. 		if(nn != Z) {
    2571. 

  2571. 			d = regpair(nn, n);
    2572. 

  2572. 			instpair(d, Z);
    2573. 

  2573. 			biggen(l, Z, d, 0, cp, args);
    2574. 

  2574. 			if(l == &nod1) {
    2575. 

  2575. 				regfree(&nod1);
    2576. 

  2576. 				l = Z;
    2577. 

  2577. 			}
    2578. 

  2578. 			if(d != nn)
    2579. 

  2579. 				storepair(d, nn, 1);
    2580. 

  2580. 		}
    2581. 

  2581. 		else
    2582. 

  2582. 			biggen(l, Z, Z, 0, incdec, args);
    2583. 

  2583. 

  2584. 		if(l == &nod1)
    2585. 

  2585. 			regfree(&nod1);
    2586. 

  2586. 		return 1;
    2587. 

  2587. 

  2588. 	case OCAST:
    2589. 

  2589. 		l = n->left;
    2590. 

  2590. 		if(typev[l->type->etype]) {
    2591. 

  2591. 			if(!vaddr(l, 1)) {
    2592. 

  2592. 				if(l->complex + 1 > nn->complex) {
    2593. 

  2593. 					d = regpair(Z, l);
    2594. 

  2594. 					sugen(l, d, 8);
    2595. 

  2595. 					if(!vaddr(nn, 1)) {
    2596. 

  2596. 						reglcgen(&nod1, nn, Z);
    2597. 

  2597. 						r = &nod1;
    2598. 

  2598. 					}
    2599. 

  2599. 					else
    2600. 

  2600. 						r = nn;
    2601. 

  2601. 				}
    2602. 

  2602. 				else {
    2603. 

  2603. 					if(!vaddr(nn, 1)) {
    2604. 

  2604. 						reglcgen(&nod1, nn, Z);
    2605. 

  2605. 						r = &nod1;
    2606. 

  2606. 					}
    2607. 

  2607. 					else
    2608. 

  2608. 						r = nn;
    2609. 

  2609. 					d = regpair(Z, l);
    2610. 

  2610. 					sugen(l, d, 8);
    2611. 

  2611. 				}
    2612. 

  2612. //				d->left->type = r->type;
    2613. 

  2613. 				d->left->type = types[TLONG];
    2614. 

  2614. 				gmove(d->left, r);
    2615. 

  2615. 				freepair(d);
    2616. 

  2616. 			}
    2617. 

  2617. 			else {
    2618. 

  2618. 				if(nn->op != OREGISTER && !vaddr(nn, 1)) {
    2619. 

  2619. 					reglcgen(&nod1, nn, Z);
    2620. 

  2620. 					r = &nod1;
    2621. 

  2621. 				}
    2622. 

  2622. 				else
    2623. 

  2623. 					r = nn;
    2624. 

  2624. //				l->type = r->type;
    2625. 

  2625. 				l->type = types[TLONG];
    2626. 

  2626. 				gmove(l, r);
    2627. 

  2627. 			}
    2628. 

  2628. 			if(r != nn)
    2629. 

  2629. 				regfree(r);
    2630. 

  2630. 		}
    2631. 

  2631. 		else {
    2632. 

  2632. 			if(typeu[l->type->etype] || cond(l->op))
    2633. 

  2633. 				si = TUNSIGNED;
    2634. 

  2634. 			else
    2635. 

  2635. 				si = TSIGNED;
    2636. 

  2636. 			regalloc(&nod1, l, Z);
    2637. 

  2637. 			cgen(l, &nod1);
    2638. 

  2638. 			if(nn->op == OREGPAIR) {
    2639. 

  2639. 				m = instpair(nn, &nod1);
    2640. 

  2640. 				biggen(&nod1, Z, nn, si == TSIGNED, castrp, nil);
    2641. 

  2641. 			}
    2642. 

  2642. 			else {
    2643. 

  2643. 				m = 0;
    2644. 

  2644. 				if(!vaddr(nn, si != TSIGNED)) {
    2645. 

  2645. 					dt = nn->type;
    2646. 

  2646. 					nn->type = types[TLONG];
    2647. 

  2647. 					reglcgen(&nod2, nn, Z);
    2648. 

  2648. 					nn->type = dt;
    2649. 

  2649. 					nn = &nod2;
    2650. 

  2650. 				}
    2651. 

  2651. 				dt = nn->type;
    2652. 

  2652. 				nn->type = types[TLONG];
    2653. 

  2653. 				biggen(&nod1, Z, nn, si == TSIGNED, castrpa, nil);
    2654. 

  2654. 				nn->type = dt;
    2655. 

  2655. 				if(nn == &nod2)
    2656. 

  2656. 					regfree(&nod2);
    2657. 

  2657. 			}
    2658. 

  2658. 			if(!m)
    2659. 

  2659. 				regfree(&nod1);
    2660. 

  2660. 		}
    2661. 

  2661. 		return 1;
    2662. 

  2662. 

  2663. 	default:
    2664. 

  2664. 		if(n->op == OREGPAIR) {
    2665. 

  2665. 			storepair(n, nn, 1);
    2666. 

  2666. 			return 1;
    2667. 

  2667. 		}
    2668. 

  2668. 		if(nn->op == OREGPAIR) {
    2669. 

  2669. 			loadpair(n, nn);
    2670. 

  2670. 			return 1;
    2671. 

  2671. 		}
    2672. 

  2672. 		return 0;
    2673. 

  2673. 	}
    2674. 

  2674. finished:
    2675. 

  2675. 	if(d != nn)
    2676. 

  2676. 		storepair(d, nn, 1);
    2677. 

  2677. 	return 1;
    2678. 

  2678. }
    2679. 

  2679. 

  2680. void
    2681. 

  2681. testv(Node *n, int true)
    2682. 

  2682. {
    2683. 

  2683. 	Type *t;
    2684. 

  2684. 	Node *nn, nod, *b;
    2685. 

  2685. 

  2686. 	if(machcap(Z)) {
    2687. 

  2687. 		b = &nod;
    2688. 

  2688. 		b->op = true ? ONE : OEQ;
    2689. 

  2689. 		b->left = n;
    2690. 

  2690. 		b->right = new(0, Z, Z);
    2691. 

  2691. 		*b->right = *nodconst(0);
    2692. 

  2692. 		b->right->type = n->type;
    2693. 

  2693. 		b->type = types[TLONG];
    2694. 

  2694. 		cgen64(b, Z);
    2695. 

  2695. 		return;
    2696. 

  2696. 	}
    2697. 

  2697. 

  2698. 	switch(n->op) {
    2699. 

  2699. 	case OINDREG:
    2700. 

  2700. 	case ONAME:
    2701. 

  2701. 		biggen(n, Z, Z, true, testi, nil);
    2702. 

  2702. 		break;
    2703. 

  2703. 

  2704. 	default:
    2705. 

  2705. 		n = vfunc(n, n);
    2706. 

  2706. 		if(n->addable >= INDEXED) {
    2707. 

  2707. 			t = n->type;
    2708. 

  2708. 			n->type = types[TLONG];
    2709. 

  2709. 			reglcgen(&nod, n, Z);
    2710. 

  2710. 			n->type = t;
    2711. 

  2711. 			n = &nod;
    2712. 

  2712. 			biggen(n, Z, Z, true, testi, nil);
    2713. 

  2713. 			if(n == &nod)
    2714. 

  2714. 				regfree(n);
    2715. 

  2715. 		}
    2716. 

  2716. 		else {
    2717. 

  2717. 			nn = regpair(Z, n);
    2718. 

  2718. 			sugen(n, nn, 8);
    2719. 

  2719. 			biggen(nn, Z, Z, true, testi, nil);
    2720. 

  2720. 			freepair(nn);
    2721. 

  2721. 		}
    2722. 

  2722. 	}
    2723. 

  2723. }
    2724. 

  2724.