swt.c 12 KB

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