swt.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628
  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 = ABEQ;
  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. if(suppress)
  120. return nstring;
  121. r = nstring;
  122. while(n) {
  123. string[mnstring] = *s++;
  124. mnstring++;
  125. nstring++;
  126. if(mnstring >= NSNAME) {
  127. gpseudo(ADATA, symstring, nodconst(0L));
  128. p->from.offset += nstring - NSNAME;
  129. p->reg = NSNAME;
  130. p->to.type = D_SCONST;
  131. memmove(p->to.sval, string, NSNAME);
  132. mnstring = 0;
  133. }
  134. n--;
  135. }
  136. return r;
  137. }
  138. int
  139. mulcon(Node *n, Node *nn)
  140. {
  141. Node *l, *r, nod1, nod2;
  142. Multab *m;
  143. long v;
  144. int o;
  145. char code[sizeof(m->code)+2], *p;
  146. if(typefd[n->type->etype])
  147. return 0;
  148. l = n->left;
  149. r = n->right;
  150. if(l->op == OCONST) {
  151. l = r;
  152. r = n->left;
  153. }
  154. if(r->op != OCONST)
  155. return 0;
  156. v = convvtox(r->vconst, n->type->etype);
  157. if(v != r->vconst) {
  158. if(debug['M'])
  159. print("%L multiply conv: %lld\n", n->lineno, r->vconst);
  160. return 0;
  161. }
  162. m = mulcon0(n, v);
  163. if(!m) {
  164. if(debug['M'])
  165. print("%L multiply table: %lld\n", n->lineno, r->vconst);
  166. return 0;
  167. }
  168. memmove(code, m->code, sizeof(m->code));
  169. code[sizeof(m->code)] = 0;
  170. p = code;
  171. if(p[1] == 'i')
  172. p += 2;
  173. regalloc(&nod1, n, nn);
  174. cgen(l, &nod1);
  175. if(v < 0)
  176. gopcode(ONEG, &nod1, Z, &nod1);
  177. regalloc(&nod2, n, Z);
  178. loop:
  179. switch(*p) {
  180. case 0:
  181. regfree(&nod2);
  182. gopcode(OAS, &nod1, Z, nn);
  183. regfree(&nod1);
  184. return 1;
  185. case '+':
  186. o = OADD;
  187. goto addsub;
  188. case '-':
  189. o = OSUB;
  190. addsub: /* number is r,n,l */
  191. v = p[1] - '0';
  192. r = &nod1;
  193. if(v&4)
  194. r = &nod2;
  195. n = &nod1;
  196. if(v&2)
  197. n = &nod2;
  198. l = &nod1;
  199. if(v&1)
  200. l = &nod2;
  201. gopcode(o, l, n, r);
  202. break;
  203. default: /* op is shiftcount, number is r,l */
  204. v = p[1] - '0';
  205. r = &nod1;
  206. if(v&2)
  207. r = &nod2;
  208. l = &nod1;
  209. if(v&1)
  210. l = &nod2;
  211. v = *p - 'a';
  212. if(v < 0 || v >= 32) {
  213. diag(n, "mulcon unknown op: %c%c", p[0], p[1]);
  214. break;
  215. }
  216. gopcode(OASHL, nodconst(v), l, r);
  217. break;
  218. }
  219. p += 2;
  220. goto loop;
  221. }
  222. void
  223. sextern(Sym *s, Node *a, long o, long w)
  224. {
  225. long e, lw;
  226. for(e=0; e<w; e+=NSNAME) {
  227. lw = NSNAME;
  228. if(w-e < lw)
  229. lw = w-e;
  230. gpseudo(ADATA, s, nodconst(0));
  231. p->from.offset += o+e;
  232. p->reg = lw;
  233. p->to.type = D_SCONST;
  234. memmove(p->to.sval, a->cstring+e, lw);
  235. }
  236. }
  237. void
  238. gextern(Sym *s, Node *a, long o, long w)
  239. {
  240. if(a->op == OCONST && typev[a->type->etype]) {
  241. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  242. gpseudo(ADATA, s, nod32const(a->vconst>>32));
  243. else
  244. gpseudo(ADATA, s, nod32const(a->vconst));
  245. p->from.offset += o;
  246. p->reg = 4;
  247. if(align(0, types[TCHAR], Aarg1)) /* isbigendian */
  248. gpseudo(ADATA, s, nod32const(a->vconst));
  249. else
  250. gpseudo(ADATA, s, nod32const(a->vconst>>32));
  251. p->from.offset += o + 4;
  252. p->reg = 4;
  253. return;
  254. }
  255. gpseudo(ADATA, s, a);
  256. p->from.offset += o;
  257. p->reg = w;
  258. if(p->to.type == D_OREG)
  259. p->to.type = D_CONST;
  260. }
  261. void zname(Biobuf*, Sym*, int);
  262. char* zaddr(char*, Adr*, int);
  263. void zwrite(Biobuf*, Prog*, int, int);
  264. void outhist(Biobuf*);
  265. void
  266. outcode(void)
  267. {
  268. struct { Sym *sym; short type; } h[NSYM];
  269. Prog *p;
  270. Sym *s;
  271. int sf, st, t, sym;
  272. if(debug['S']) {
  273. for(p = firstp; p != P; p = p->link)
  274. if(p->as != ADATA && p->as != AGLOBL)
  275. pc--;
  276. for(p = firstp; p != P; p = p->link) {
  277. print("%P\n", p);
  278. if(p->as != ADATA && p->as != AGLOBL)
  279. pc++;
  280. }
  281. }
  282. outhist(&outbuf);
  283. for(sym=0; sym<NSYM; sym++) {
  284. h[sym].sym = S;
  285. h[sym].type = 0;
  286. }
  287. sym = 1;
  288. for(p = firstp; p != P; p = p->link) {
  289. jackpot:
  290. sf = 0;
  291. s = p->from.sym;
  292. while(s != S) {
  293. sf = s->sym;
  294. if(sf < 0 || sf >= NSYM)
  295. sf = 0;
  296. t = p->from.name;
  297. if(h[sf].type == t)
  298. if(h[sf].sym == s)
  299. break;
  300. s->sym = sym;
  301. zname(&outbuf, s, t);
  302. h[sym].sym = s;
  303. h[sym].type = t;
  304. sf = sym;
  305. sym++;
  306. if(sym >= NSYM)
  307. sym = 1;
  308. break;
  309. }
  310. st = 0;
  311. s = p->to.sym;
  312. while(s != S) {
  313. st = s->sym;
  314. if(st < 0 || st >= NSYM)
  315. st = 0;
  316. t = p->to.name;
  317. if(h[st].type == t)
  318. if(h[st].sym == s)
  319. break;
  320. s->sym = sym;
  321. zname(&outbuf, s, t);
  322. h[sym].sym = s;
  323. h[sym].type = t;
  324. st = sym;
  325. sym++;
  326. if(sym >= NSYM)
  327. sym = 1;
  328. if(st == sf)
  329. goto jackpot;
  330. break;
  331. }
  332. zwrite(&outbuf, p, sf, st);
  333. }
  334. firstp = P;
  335. lastp = P;
  336. }
  337. void
  338. zwrite(Biobuf *b, Prog *p, int sf, int st)
  339. {
  340. char bf[100], *bp;
  341. long l;
  342. bf[0] = p->as;
  343. bf[1] = p->as>>8;
  344. bf[2] = p->reg;
  345. l = p->lineno;
  346. bf[3] = l;
  347. bf[4] = l>>8;
  348. bf[5] = l>>16;
  349. bf[6] = l>>24;
  350. bp = zaddr(bf+7, &p->from, sf);
  351. bp = zaddr(bp, &p->to, st);
  352. Bwrite(b, bf, bp-bf);
  353. }
  354. void
  355. outhist(Biobuf *b)
  356. {
  357. Hist *h;
  358. char *p, *q, *op, c;
  359. Prog pg;
  360. int n;
  361. pg = zprog;
  362. pg.as = AHISTORY;
  363. c = pathchar();
  364. for(h = hist; h != H; h = h->link) {
  365. p = h->name;
  366. op = 0;
  367. /* on windows skip drive specifier in pathname */
  368. if(systemtype(Windows) && p && p[1] == ':'){
  369. p += 2;
  370. c = *p;
  371. }
  372. if(p && p[0] != c && h->offset == 0 && pathname){
  373. /* on windows skip drive specifier in pathname */
  374. if(systemtype(Windows) && pathname[1] == ':') {
  375. op = p;
  376. p = pathname+2;
  377. c = *p;
  378. } else if(pathname[0] == c){
  379. op = p;
  380. p = pathname;
  381. }
  382. }
  383. while(p) {
  384. q = utfrune(p, c);
  385. if(q) {
  386. n = q-p;
  387. if(n == 0){
  388. n = 1; /* leading "/" */
  389. *p = '/'; /* don't emit "\" on windows */
  390. }
  391. q++;
  392. } else {
  393. n = strlen(p);
  394. q = 0;
  395. }
  396. if(n) {
  397. Bputc(b, ANAME);
  398. Bputc(b, ANAME>>8);
  399. Bputc(b, D_FILE);
  400. Bputc(b, 1);
  401. Bputc(b, '<');
  402. Bwrite(b, p, n);
  403. Bputc(b, 0);
  404. }
  405. p = q;
  406. if(p == 0 && op) {
  407. p = op;
  408. op = 0;
  409. }
  410. }
  411. pg.lineno = h->line;
  412. pg.to.type = zprog.to.type;
  413. pg.to.offset = h->offset;
  414. if(h->offset)
  415. pg.to.type = D_CONST;
  416. zwrite(b, &pg, 0, 0);
  417. }
  418. }
  419. void
  420. zname(Biobuf *b, Sym *s, int t)
  421. {
  422. char *n, bf[8];
  423. ulong sig;
  424. n = s->name;
  425. if(debug['T'] && t == D_EXTERN && s->sig != SIGDONE && s->type != types[TENUM] && s != symrathole){
  426. sig = sign(s);
  427. bf[0] = ASIGNAME;
  428. bf[1] = ASIGNAME>>8;
  429. bf[2] = sig;
  430. bf[3] = sig>>8;
  431. bf[4] = sig>>16;
  432. bf[5] = sig>>24;
  433. bf[6] = t;
  434. bf[7] = s->sym;
  435. Bwrite(b, bf, 8);
  436. s->sig = SIGDONE;
  437. }
  438. else{
  439. bf[0] = ANAME;
  440. bf[1] = ANAME>>8;
  441. bf[2] = t; /* type */
  442. bf[3] = s->sym; /* sym */
  443. Bwrite(b, bf, 4);
  444. }
  445. Bwrite(b, n, strlen(n)+1);
  446. }
  447. char*
  448. zaddr(char *bp, Adr *a, int s)
  449. {
  450. long l;
  451. Ieee e;
  452. if(a->type == D_CONST){
  453. l = a->offset;
  454. if((vlong)l != a->offset)
  455. a->type = D_DCONST;
  456. }
  457. bp[0] = a->type;
  458. bp[1] = a->reg;
  459. bp[2] = s;
  460. bp[3] = a->name;
  461. bp += 4;
  462. switch(a->type) {
  463. default:
  464. diag(Z, "unknown type %d in zaddr", a->type);
  465. case D_NONE:
  466. case D_REG:
  467. case D_FREG:
  468. case D_CREG:
  469. break;
  470. case D_OREG:
  471. case D_CONST:
  472. case D_BRANCH:
  473. l = a->offset;
  474. bp[0] = l;
  475. bp[1] = l>>8;
  476. bp[2] = l>>16;
  477. bp[3] = l>>24;
  478. bp += 4;
  479. break;
  480. case D_DCONST:
  481. l = a->offset;
  482. bp[0] = l;
  483. bp[1] = l>>8;
  484. bp[2] = l>>16;
  485. bp[3] = l>>24;
  486. bp += 4;
  487. l = a->offset>>32;
  488. bp[0] = l;
  489. bp[1] = l>>8;
  490. bp[2] = l>>16;
  491. bp[3] = l>>24;
  492. bp += 4;
  493. break;
  494. case D_SCONST:
  495. memmove(bp, a->sval, NSNAME);
  496. bp += NSNAME;
  497. break;
  498. case D_FCONST:
  499. ieeedtod(&e, a->dval);
  500. l = e.l;
  501. bp[0] = l;
  502. bp[1] = l>>8;
  503. bp[2] = l>>16;
  504. bp[3] = l>>24;
  505. bp += 4;
  506. l = e.h;
  507. bp[0] = l;
  508. bp[1] = l>>8;
  509. bp[2] = l>>16;
  510. bp[3] = l>>24;
  511. bp += 4;
  512. break;
  513. }
  514. return bp;
  515. }
  516. long
  517. align(long i, Type *t, int op)
  518. {
  519. long o;
  520. Type *v;
  521. int w;
  522. o = i;
  523. w = 1;
  524. switch(op) {
  525. default:
  526. diag(Z, "unknown align opcode %d", op);
  527. break;
  528. case Asu2: /* padding at end of a struct */
  529. w = SZ_VLONG;
  530. if(packflg)
  531. w = packflg;
  532. break;
  533. case Ael1: /* initial allign of struct element */
  534. for(v=t; v->etype==TARRAY; v=v->link)
  535. ;
  536. w = ewidth[v->etype];
  537. if(w <= 0 || w >= SZ_VLONG)
  538. w = SZ_VLONG;
  539. if(packflg)
  540. w = packflg;
  541. break;
  542. case Ael2: /* width of a struct element */
  543. o += t->width;
  544. break;
  545. case Aarg0: /* initial passbyptr argument in arg list */
  546. if(typesu[t->etype]) {
  547. o = align(o, types[TIND], Aarg1);
  548. o = align(o, types[TIND], Aarg2);
  549. }
  550. break;
  551. case Aarg1: /* initial align of parameter */
  552. w = ewidth[t->etype];
  553. if(w <= 0 || w >= SZ_VLONG) {
  554. w = SZ_VLONG;
  555. break;
  556. }
  557. o += SZ_VLONG - w; /* big endian adjustment */
  558. w = 1;
  559. break;
  560. case Aarg2: /* width of a parameter */
  561. o += t->width;
  562. w = SZ_VLONG;
  563. break;
  564. case Aaut3: /* total align of automatic */
  565. o = align(o, t, Ael1);
  566. o = align(o, t, Ael2);
  567. break;
  568. }
  569. o = round(o, w);
  570. if(debug['A'])
  571. print("align %s %ld %T = %ld\n", bnames[op], i, t, o);
  572. return o;
  573. }
  574. long
  575. maxround(long max, long v)
  576. {
  577. v = round(v, SZ_VLONG);
  578. if(v > max)
  579. return v;
  580. return max;
  581. }