coerc.c 5.5 KB

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