swt.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583
  1. #include "gc.h"
  2. void
  3. swit1(C1 *q, int nc, long def, Node *n)
  4. {
  5. Node tn;
  6. regalloc(&tn, &regnode, Z);
  7. swit2(q, nc, def, n, &tn);
  8. regfree(&tn);
  9. }
  10. void
  11. swit2(C1 *q, int nc, long def, Node *n, Node *tn)
  12. {
  13. C1 *r;
  14. int i;
  15. Prog *sp;
  16. if(nc < 5) {
  17. for(i=0; i<nc; i++) {
  18. if(sval(q->val)) {
  19. gopcode(OEQ, n, Z, nodconst(q->val));
  20. } else {
  21. gopcode(OSUB, nodconst(q->val), n, tn);
  22. gopcode(OEQ, tn, Z, nodconst(0));
  23. }
  24. patch(p, q->label);
  25. q++;
  26. }
  27. gbranch(OGOTO);
  28. patch(p, def);
  29. return;
  30. }
  31. i = nc / 2;
  32. r = q+i;
  33. if(sval(r->val)) {
  34. gopcode(OGT, n, Z, nodconst(r->val));
  35. sp = p;
  36. } else {
  37. gopcode(OSUB, nodconst(r->val), n, tn);
  38. gopcode(OGT, tn, Z, nodconst(0));
  39. sp = p;
  40. }
  41. gbranch(OGOTO);
  42. p->as = ABE;
  43. patch(p, r->label);
  44. swit2(q, i, def, n, tn);
  45. patch(sp, pc);
  46. swit2(r+1, nc-i-1, def, n, tn);
  47. }
  48. void
  49. bitload(Node *b, Node *n1, Node *n2, Node *n3, Node *nn)
  50. {
  51. int sh;
  52. long v;
  53. Node *l;
  54. /*
  55. * n1 gets adjusted/masked value
  56. * n2 gets address of cell
  57. * n3 gets contents of cell
  58. */
  59. l = b->left;
  60. if(n2 != Z) {
  61. regalloc(n1, l, nn);
  62. reglcgen(n2, l, Z);
  63. regalloc(n3, l, Z);
  64. gopcode(OAS, n2, Z, n3);
  65. gopcode(OAS, n3, Z, n1);
  66. } else {
  67. regalloc(n1, l, nn);
  68. cgen(l, n1);
  69. }
  70. if(b->type->shift == 0 && typeu[b->type->etype]) {
  71. v = ~0 + (1L << b->type->nbits);
  72. gopcode(OAND, nodconst(v), Z, n1);
  73. } else {
  74. sh = 32 - b->type->shift - b->type->nbits;
  75. if(sh > 0)
  76. gopcode(OASHL, nodconst(sh), Z, n1);
  77. sh += b->type->shift;
  78. if(sh > 0)
  79. if(typeu[b->type->etype])
  80. gopcode(OLSHR, nodconst(sh), Z, n1);
  81. else
  82. gopcode(OASHR, nodconst(sh), Z, n1);
  83. }
  84. }
  85. void
  86. bitstore(Node *b, Node *n1, Node *n2, Node *n3, Node *nn)
  87. {
  88. long v;
  89. Node nod, *l;
  90. int sh;
  91. /*
  92. * n1 has adjusted/masked value
  93. * n2 has address of cell
  94. * n3 has contents of cell
  95. */
  96. l = b->left;
  97. regalloc(&nod, l, Z);
  98. v = ~0 + (1L << b->type->nbits);
  99. gopcode(OAND, nodconst(v), Z, n1);
  100. gopcode(OAS, n1, Z, &nod);
  101. if(nn != Z)
  102. gopcode(OAS, n1, Z, nn);
  103. sh = b->type->shift;
  104. if(sh > 0)
  105. gopcode(OASHL, nodconst(sh), Z, &nod);
  106. v <<= sh;
  107. gopcode(OAND, nodconst(~v), Z, n3);
  108. gopcode(OOR, n3, Z, &nod);
  109. gopcode(OAS, &nod, Z, n2);
  110. regfree(&nod);
  111. regfree(n1);
  112. regfree(n2);
  113. regfree(n3);
  114. }
  115. long
  116. outstring(char *s, long n)
  117. {
  118. long r;
  119. r = nstring;
  120. while(n) {
  121. string[mnstring] = *s++;
  122. mnstring++;
  123. nstring++;
  124. if(mnstring >= NSNAME) {
  125. gpseudo(ADATA, symstring, nodconst(0L));
  126. p->from.offset += nstring - NSNAME;
  127. p->reg = NSNAME;
  128. p->to.type = D_SCONST;
  129. memmove(p->to.sval, string, NSNAME);
  130. mnstring = 0;
  131. }
  132. n--;
  133. }
  134. return r;
  135. }
  136. int
  137. mulcon(Node *n, Node *nn)
  138. {
  139. Node *l, *r, nod1, nod2;
  140. Multab *m;
  141. long v;
  142. int o;
  143. char code[sizeof(m->code)+2], *p;
  144. if(typefd[n->type->etype])
  145. return 0;
  146. l = n->left;
  147. r = n->right;
  148. if(l->op == OCONST) {
  149. l = r;
  150. r = n->left;
  151. }
  152. if(r->op != OCONST)
  153. return 0;
  154. v = convvtox(r->vconst, n->type->etype);
  155. if(v != r->vconst) {
  156. if(debug['M'])
  157. print("%L multiply conv: %lld\n", n->lineno, r->vconst);
  158. return 0;
  159. }
  160. m = mulcon0(n, v);
  161. if(!m) {
  162. if(debug['M'])
  163. print("%L multiply table: %lld\n", n->lineno, r->vconst);
  164. return 0;
  165. }
  166. memmove(code, m->code, sizeof(m->code));
  167. code[sizeof(m->code)] = 0;
  168. p = code;
  169. if(p[1] == 'i')
  170. p += 2;
  171. regalloc(&nod1, n, nn);
  172. cgen(l, &nod1);
  173. if(v < 0)
  174. gopcode(OSUB, &nod1, nodconst(0), &nod1);
  175. regalloc(&nod2, n, Z);
  176. loop:
  177. switch(*p) {
  178. case 0:
  179. regfree(&nod2);
  180. gopcode(OAS, &nod1, Z, nn);
  181. regfree(&nod1);
  182. return 1;
  183. case '+':
  184. o = OADD;
  185. goto addsub;
  186. case '-':
  187. o = OSUB;
  188. addsub: /* number is r,n,l */
  189. v = p[1] - '0';
  190. r = &nod1;
  191. if(v&4)
  192. r = &nod2;
  193. n = &nod1;
  194. if(v&2)
  195. n = &nod2;
  196. l = &nod1;
  197. if(v&1)
  198. l = &nod2;
  199. gopcode(o, l, n, r);
  200. break;
  201. default: /* op is shiftcount, number is r,l */
  202. v = p[1] - '0';
  203. r = &nod1;
  204. if(v&2)
  205. r = &nod2;
  206. l = &nod1;
  207. if(v&1)
  208. l = &nod2;
  209. v = *p - 'a';
  210. if(v < 0 || v >= 32) {
  211. diag(n, "mulcon unknown op: %c%c", p[0], p[1]);
  212. break;
  213. }
  214. gopcode(OASHL, nodconst(v), l, r);
  215. break;
  216. }
  217. p += 2;
  218. goto loop;
  219. }
  220. void
  221. gextern(Sym *s, Node *a, long o, long w)
  222. {
  223. if(a->op == OCONST && typev[a->type->etype]) {
  224. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  225. gpseudo(ADATA, s, nod32const(a->vconst>>32));
  226. else
  227. gpseudo(ADATA, s, nod32const(a->vconst));
  228. p->from.offset += o;
  229. p->reg = 4;
  230. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  231. gpseudo(ADATA, s, nod32const(a->vconst));
  232. else
  233. gpseudo(ADATA, s, nod32const(a->vconst>>32));
  234. p->from.offset += o + 4;
  235. p->reg = 4;
  236. return;
  237. }
  238. gpseudo(ADATA, s, a);
  239. p->from.offset += o;
  240. p->reg = w;
  241. if(p->to.type == D_OREG)
  242. p->to.type = D_CONST;
  243. }
  244. void zname(Biobuf*, Sym*, int);
  245. void zaddr(Biobuf*, Adr*, int);
  246. void zwrite(Biobuf*, Prog*, int, int);
  247. void outhist(Biobuf*);
  248. void
  249. outcode(void)
  250. {
  251. struct { Sym *sym; short type; } h[NSYM];
  252. Prog *p;
  253. Sym *s;
  254. int sf, st, t, sym;
  255. if(debug['S']) {
  256. for(p = firstp; p != P; p = p->link)
  257. if(p->as != ADATA && p->as != AGLOBL)
  258. pc--;
  259. for(p = firstp; p != P; p = p->link) {
  260. print("%P\n", p);
  261. if(p->as != ADATA && p->as != AGLOBL)
  262. pc++;
  263. }
  264. }
  265. outhist(&outbuf);
  266. for(sym=0; sym<NSYM; sym++) {
  267. h[sym].sym = S;
  268. h[sym].type = 0;
  269. }
  270. sym = 1;
  271. for(p = firstp; p != P; p = p->link) {
  272. jackpot:
  273. sf = 0;
  274. s = p->from.sym;
  275. while(s != S) {
  276. sf = s->sym;
  277. if(sf < 0 || sf >= NSYM)
  278. sf = 0;
  279. t = p->from.name;
  280. if(h[sf].type == t)
  281. if(h[sf].sym == s)
  282. break;
  283. s->sym = sym;
  284. zname(&outbuf, s, t);
  285. h[sym].sym = s;
  286. h[sym].type = t;
  287. sf = sym;
  288. sym++;
  289. if(sym >= NSYM)
  290. sym = 1;
  291. break;
  292. }
  293. st = 0;
  294. s = p->to.sym;
  295. while(s != S) {
  296. st = s->sym;
  297. if(st < 0 || st >= NSYM)
  298. st = 0;
  299. t = p->to.name;
  300. if(h[st].type == t)
  301. if(h[st].sym == s)
  302. break;
  303. s->sym = sym;
  304. zname(&outbuf, s, t);
  305. h[sym].sym = s;
  306. h[sym].type = t;
  307. st = sym;
  308. sym++;
  309. if(sym >= NSYM)
  310. sym = 1;
  311. if(st == sf)
  312. goto jackpot;
  313. break;
  314. }
  315. zwrite(&outbuf, p, sf, st);
  316. }
  317. firstp = P;
  318. lastp = P;
  319. }
  320. void
  321. zwrite(Biobuf *b, Prog *p, int sf, int st)
  322. {
  323. long l;
  324. Bputc(b, p->as);
  325. Bputc(b, p->reg);
  326. l = p->lineno;
  327. Bputc(b, l);
  328. Bputc(b, l>>8);
  329. Bputc(b, l>>16);
  330. Bputc(b, l>>24);
  331. zaddr(b, &p->from, sf);
  332. zaddr(b, &p->to, st);
  333. }
  334. void
  335. outhist(Biobuf *b)
  336. {
  337. Hist *h;
  338. char *p, *q, *op, c;
  339. Prog pg;
  340. int n;
  341. pg = zprog;
  342. pg.as = AHISTORY;
  343. c = pathchar();
  344. for(h = hist; h != H; h = h->link) {
  345. p = h->name;
  346. op = 0;
  347. /* on windows skip drive specifier in pathname */
  348. if(systemtype(Windows) && p && p[1] == ':'){
  349. p += 2;
  350. c = *p;
  351. }
  352. if(p && p[0] != c && h->offset == 0 && pathname){
  353. /* on windows skip drive specifier in pathname */
  354. if(systemtype(Windows) && pathname[1] == ':') {
  355. op = p;
  356. p = pathname+2;
  357. c = *p;
  358. } else if(pathname[0] == c){
  359. op = p;
  360. p = pathname;
  361. }
  362. }
  363. while(p) {
  364. q = utfrune(p, c);
  365. if(q) {
  366. n = q-p;
  367. if(n == 0){
  368. n = 1; /* leading "/" */
  369. *p = '/'; /* don't emit "\" on windows */
  370. }
  371. q++;
  372. } else {
  373. n = strlen(p);
  374. q = 0;
  375. }
  376. if(n) {
  377. Bputc(b, ANAME);
  378. Bputc(b, D_FILE);
  379. Bputc(b, 1);
  380. Bputc(b, '<');
  381. Bwrite(b, p, n);
  382. Bputc(b, 0);
  383. }
  384. p = q;
  385. if(p == 0 && op) {
  386. p = op;
  387. op = 0;
  388. }
  389. }
  390. pg.lineno = h->line;
  391. pg.to.type = zprog.to.type;
  392. pg.to.offset = h->offset;
  393. if(h->offset)
  394. pg.to.type = D_CONST;
  395. zwrite(b, &pg, 0, 0);
  396. }
  397. }
  398. void
  399. zname(Biobuf *b, Sym *s, int t)
  400. {
  401. char *n;
  402. ulong sig;
  403. if(debug['T'] && t == D_EXTERN && s->sig != SIGDONE && s->type != types[TENUM] && s != symrathole){
  404. sig = sign(s);
  405. Bputc(b, ASIGNAME);
  406. Bputc(b, sig);
  407. Bputc(b, sig>>8);
  408. Bputc(b, sig>>16);
  409. Bputc(b, sig>>24);
  410. s->sig = SIGDONE;
  411. }
  412. else
  413. Bputc(b, ANAME); /* as */
  414. Bputc(b, t); /* type */
  415. Bputc(b, s->sym); /* sym */
  416. n = s->name;
  417. while(*n) {
  418. Bputc(b, *n);
  419. n++;
  420. }
  421. Bputc(b, 0);
  422. }
  423. void
  424. zaddr(Biobuf *b, Adr *a, int s)
  425. {
  426. long l;
  427. int i;
  428. char *n;
  429. Ieee e;
  430. Bputc(b, a->type);
  431. Bputc(b, a->reg);
  432. Bputc(b, s);
  433. Bputc(b, a->name);
  434. switch(a->type) {
  435. default:
  436. diag(Z, "unknown type %d in zaddr", a->type);
  437. case D_NONE:
  438. case D_REG:
  439. case D_FREG:
  440. case D_CREG:
  441. break;
  442. case D_OREG:
  443. case D_CONST:
  444. case D_BRANCH:
  445. l = a->offset;
  446. Bputc(b, l);
  447. Bputc(b, l>>8);
  448. Bputc(b, l>>16);
  449. Bputc(b, l>>24);
  450. break;
  451. case D_SCONST:
  452. n = a->sval;
  453. for(i=0; i<NSNAME; i++) {
  454. Bputc(b, *n);
  455. n++;
  456. }
  457. break;
  458. case D_FCONST:
  459. ieeedtod(&e, a->dval);
  460. l = e.l;
  461. Bputc(b, l);
  462. Bputc(b, l>>8);
  463. Bputc(b, l>>16);
  464. Bputc(b, l>>24);
  465. l = e.h;
  466. Bputc(b, l);
  467. Bputc(b, l>>8);
  468. Bputc(b, l>>16);
  469. Bputc(b, l>>24);
  470. break;
  471. }
  472. }
  473. long
  474. align(long i, Type *t, int op)
  475. {
  476. long o;
  477. Type *v;
  478. int w;
  479. o = i;
  480. w = 1;
  481. switch(op) {
  482. default:
  483. diag(Z, "unknown align opcode %d", op);
  484. break;
  485. case Asu2: /* padding at end of a struct */
  486. w = SZ_LONG;
  487. if(packflg)
  488. w = packflg;
  489. break;
  490. case Ael1: /* initial allign of struct element */
  491. for(v=t; v->etype==TARRAY; v=v->link)
  492. ;
  493. w = ewidth[v->etype];
  494. if(w <= 0 || w >= SZ_LONG)
  495. w = SZ_LONG;
  496. if(packflg)
  497. w = packflg;
  498. break;
  499. case Ael2: /* width of a struct element */
  500. o += t->width;
  501. break;
  502. case Aarg0: /* initial passbyptr argument in arg list */
  503. if(typesuv[t->etype]) {
  504. o = align(o, types[TIND], Aarg1);
  505. o = align(o, types[TIND], Aarg2);
  506. }
  507. break;
  508. case Aarg1: /* initial allign of parameter */
  509. w = ewidth[t->etype];
  510. if(w <= 0 || w >= SZ_LONG) {
  511. w = SZ_LONG;
  512. break;
  513. }
  514. o += SZ_LONG - w; /* big endian adjustment */
  515. w = 1;
  516. break;
  517. case Aarg2: /* width of a parameter */
  518. o += t->width;
  519. w = SZ_LONG;
  520. break;
  521. case Aaut3: /* total allign of automatic */
  522. o = align(o, t, Ael1);
  523. o = align(o, t, Ael2);
  524. break;
  525. }
  526. o = round(o, w);
  527. if(debug['A'])
  528. print("align %s %ld %T = %ld\n", bnames[op], i, t, o);
  529. return o;
  530. }
  531. long
  532. maxround(long max, long v)
  533. {
  534. v += SZ_LONG-1;
  535. if(v > max)
  536. max = round(v, SZ_LONG);
  537. return max;
  538. }