swt.c 8.5 KB

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