coerc.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249
  1. #ifndef NORCSID
  2. static char rcsid[]= "$Header$";
  3. #endif
  4. #include "assert.h"
  5. #include "param.h"
  6. #include "set.h"
  7. #include "property.h"
  8. #include "reg.h"
  9. #include "token.h"
  10. #include "varinfo.h"
  11. #include "iocc.h"
  12. #include <cgg_cg.h>
  13. #include "pseudo.h"
  14. #include "extern.h"
  15. extern set_t l_sets[];
  16. int nmoves;
  17. move_t l_moves[MAXMOVES];
  18. short posmoves[MAXREGS+MAXTOKENS][SETSIZE];
  19. n_move(s1,e1,s2,e2,vi) struct varinfo *vi; {
  20. register move_p mp;
  21. register i,j;
  22. NEXT(nmoves,MAXMOVES,"Moves");
  23. mp = &l_moves[nmoves-1];
  24. mp->m_set1 = s1;
  25. mp->m_expr1 = e1;
  26. mp->m_set2 = s2;
  27. mp->m_expr2 = e2;
  28. mp->m_cindex = codeindex;
  29. dopattern(0,VI_NULL,VI_NULL,vi,VI_NULL,VI_NULL);
  30. if (mp->m_expr1!=0 || mp->m_expr2!=0)
  31. return;
  32. for (i=0;i<MAXREGS+MAXTOKENS;i++)
  33. if (BIT(l_sets[mp->m_set1].set_val,i))
  34. for(j=0;j<SETSIZE;j++)
  35. posmoves[i][j] |= l_sets[mp->m_set2].set_val[j];
  36. }
  37. existmove(from,sp) iocc_t from; short *sp; {
  38. register i;
  39. for (i=0;i<MAXREGS+MAXTOKENS;i++)
  40. if(BIT(from.in_set,i))
  41. if (!subset(sp,posmoves[i],SETSIZE))
  42. return(0);
  43. return(1);
  44. }
  45. existalmove(from,prpno) iocc_t from; {
  46. short s[SETSIZE];
  47. register i;
  48. for (i=0;i<SETSIZE;i++)
  49. s[i] = i<SZOFSET(MAXREGS) ? l_props[prpno].pr_regset[i] : 0;
  50. return(existmove(from,s));
  51. }
  52. struct varinfo *gen_move(from,to) iocc_t from,to; {
  53. register struct varinfo *vp;
  54. if (existmove(from,to.in_set)==0) {
  55. error("No such move defined");
  56. return(VI_NULL);
  57. }
  58. NEW(vp,struct varinfo);
  59. vp->vi_int[0] = INSMOVE;
  60. vp->vi_int[1] = from.in_index;
  61. vp->vi_int[2] = to.in_index;
  62. return(vp);
  63. }
  64. int ntests;
  65. test_t l_tests[MAXTESTS];
  66. short postests[SETSIZE];
  67. n_test(s,e,vi) struct varinfo *vi; {
  68. register test_p tp;
  69. register i;
  70. NEXT(ntests,MAXTESTS,"Tests");
  71. tp = &l_tests[ntests-1];
  72. tp->t_set = s;
  73. tp->t_expr = e;
  74. tp->t_cindex = codeindex;
  75. dopattern(0,VI_NULL,VI_NULL,vi,VI_NULL,VI_NULL);
  76. if (tp->t_expr!=0)
  77. return;
  78. for(i=0;i<SETSIZE;i++)
  79. postests[i] |= l_sets[tp->t_set].set_val[i];
  80. }
  81. struct varinfo *gen_test(from) iocc_t from; {
  82. register struct varinfo *vp;
  83. if (!subset(from.in_set,postests,SETSIZE)) {
  84. error("No such test");
  85. return(0);
  86. }
  87. NEW(vp,struct varinfo);
  88. vp->vi_int[0] = INSTEST;
  89. vp->vi_int[1] = from.in_index;
  90. return(vp);
  91. }
  92. struct varinfo *gen_preturn() {
  93. register struct varinfo *vp;
  94. NEW(vp,struct varinfo);
  95. vp->vi_int[0] = INSPRETURN;
  96. return(vp);
  97. }
  98. struct varinfo *gen_tlab(n) {
  99. register struct varinfo *vp;
  100. assert(n>=0 && n<=9);
  101. NEW(vp,struct varinfo);
  102. vp->vi_int[0] = INSTLAB;
  103. vp->vi_int[1] = n;
  104. return(vp);
  105. }
  106. int nstacks;
  107. c1_t l_stacks[MAXSTACKS];
  108. set_t ustackset,cstackset;
  109. n_stack(s,e,p,vi) struct varinfo *vi; {
  110. register c1_p c1p;
  111. register short *sp;
  112. register i;
  113. NEXT(nstacks,MAXSTACKS,"Stacks");
  114. c1p= & l_stacks[nstacks-1];
  115. c1p->c1_texpno = s;
  116. c1p->c1_expr = e;
  117. c1p->c1_prop = p;
  118. c1p->c1_codep = codeindex;
  119. dopattern(0,VI_NULL,VI_NULL,vi,VI_NULL,VI_NULL);
  120. if (e==0 && p==0)
  121. sp = ustackset.set_val;
  122. else
  123. sp = cstackset.set_val;
  124. for(i=0;i<SETSIZE;i++)
  125. sp[i] |= l_sets[s].set_val[i];
  126. }
  127. checkstacking(sp) register short *sp; {
  128. register i;
  129. register short *chkset;
  130. char *warn;
  131. if (subset(sp,ustackset.set_val,SETSIZE))
  132. return;
  133. chkset = ustackset.set_val; warn = "";
  134. for (i=1;i<nregs;i++)
  135. if (BIT(sp,i) && !BIT(chkset,i))
  136. error("No %sstacking rule for register %s",warn,
  137. l_regs[i].ri_name);
  138. for(;i<nregs+MAXTOKENS;i++)
  139. if (BIT(sp,i) && !BIT(chkset,i))
  140. error("No %sstacking rule for token %s",warn,
  141. l_tokens[i-nregs]->tk_name);
  142. }
  143. int ncoercs;
  144. c3_t l_coercs[MAXCOERCS];
  145. set_t unstackset;
  146. /*VARARGS5*/
  147. n_coerc(ti,be,al,ge,rp,in) struct varinfo *al,*ge,*rp; iocc_t in; {
  148. register c3_p c3p;
  149. register i;
  150. register struct varinfo *vi;
  151. if (ti!=0) {
  152. for(i=0,vi=rp;vi!=0;vi=vi->vi_next,i++)
  153. ;
  154. if (i>1) {
  155. n_split(ti,be,al,ge,rp,i);
  156. return;
  157. } else {
  158. if (i==0) {
  159. error("Coercion should have a result!");
  160. return;
  161. }
  162. }
  163. } else {
  164. NEW(rp,struct varinfo);
  165. rp->vi_next = 0;
  166. rp->vi_int[0] = in.in_index;
  167. }
  168. if (nallreg>1)
  169. error("More than 1 register may not be allocated");
  170. NEXT(ncoercs,MAXCOERCS,"Coercions");
  171. c3p = & l_coercs[ncoercs-1];
  172. c3p->c3_texpno = ti;
  173. c3p->c3_expr = be;
  174. c3p->c3_prop = nallreg==0 ? 0 : allreg[0];
  175. c3p->c3_repl = rp->vi_int[0];
  176. c3p->c3_codep = codeindex;
  177. dopattern(ti==0,VI_NULL,al,ge,rp,VI_NULL);
  178. if (ti==0)
  179. for(i=0;i<SETSIZE;i++)
  180. unstackset.set_val[i] |= in.in_set[i];
  181. freevi(rp);
  182. }
  183. checkunstacking(setno) {
  184. register short *sp;
  185. register i;
  186. short hallset[SETSIZE];
  187. sp = l_sets[setno].set_val;
  188. for (i=0;i<SETSIZE;i++)
  189. hallset[i]=sp[i]&unstackset.set_val[i];
  190. nexthall(hallset);
  191. }
  192. int nsplit,maxsplit;
  193. c2_t l_split[MAXSPLCOERC];
  194. n_split(ti,be,al,ge,rp,n) struct varinfo *al,*ge,*rp; {
  195. register c2_p c2p;
  196. register i;
  197. register struct varinfo *vi;
  198. NEXT(nsplit,MAXSPLCOERC,"Splitting coercions");
  199. c2p = &l_split[nsplit-1];
  200. if (n>MAXSPLIT) {
  201. error("Maximum split factor is %d",MAXSPLIT);
  202. n = MAXSPLIT;
  203. }
  204. if (n>maxsplit) maxsplit=n;
  205. c2p->c2_texpno = ti;
  206. c2p->c2_expr = be;
  207. if (nallreg)
  208. error("No register uses allowed in splitting coercion");
  209. c2p->c2_nsplit = n;
  210. for (i=0,vi=rp; i<n; i++,vi=vi->vi_next)
  211. c2p->c2_repl[i] = vi->vi_int[0];
  212. c2p->c2_codep = codeindex;
  213. dopattern(0,VI_NULL,al,ge,rp,VI_NULL);
  214. }