set.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155
  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. #include "param.h"
  6. #include "property.h"
  7. #include "set.h"
  8. #include "token.h"
  9. #include "lookup.h"
  10. #include "reg.h"
  11. #include "error.h"
  12. #include "subr.h"
  13. #include "extern.h"
  14. extern set_t l_sets[];
  15. int setlookup(set_t s)
  16. {
  17. set_p p;
  18. int i;
  19. int setno;
  20. for(p=l_sets;p<&l_sets[nsets];p++) {
  21. if (p->set_size != s.set_size)
  22. continue;
  23. for (i=0;i<SETSIZE;i++)
  24. if (p->set_val[i] != s.set_val[i])
  25. goto cont;
  26. return(p-l_sets);
  27. cont:;
  28. }
  29. setno = NEXT(nsets,MAXSETS,"Sets");
  30. l_sets[setno] = s;
  31. return(setno);
  32. }
  33. void make_std_sets()
  34. {
  35. set_t s;
  36. int i;
  37. for(i=0;i<SETSIZE;i++)
  38. s.set_val[i]=0;
  39. for(i=0;i<nregs+ntokens;i++)
  40. BIS(s.set_val,i);
  41. s.set_size = 0;
  42. allsetno = setlookup(s);
  43. n_set("ALL",allsetno);
  44. }
  45. set_t emptyset;
  46. set_t ident_to_set(char *name)
  47. {
  48. symbol *sy_p;
  49. int i;
  50. struct propinfo *pp;
  51. int bitno;
  52. set_t result;
  53. sy_p = lookup(name,symany,mustexist);
  54. switch(sy_p->sy_type) {
  55. default:
  56. error("%s is wrong kind of symbol",name);
  57. return(emptyset);
  58. case symprop:
  59. pp = &l_props[sy_p->sy_value.syv_propno];
  60. result.set_size = pp->pr_size;
  61. for (i=0;i<SZOFSET(MAXREGS);i++)
  62. result.set_val[i] = pp->pr_regset[i];
  63. BIS(result.set_val,0);
  64. for (;i<SETSIZE;i++)
  65. result.set_val[i] = 0;
  66. break;
  67. case symtok:
  68. bitno = sy_p->sy_value.syv_tokno+nregs;
  69. for (i=0;i<SETSIZE;i++)
  70. result.set_val[i] = 0;
  71. BIS(result.set_val,bitno);
  72. result.set_size = l_tokens[sy_p->sy_value.syv_tokno]->tk_size;
  73. break;
  74. case symset:
  75. return(l_sets[sy_p->sy_value.syv_setno]);
  76. }
  77. return(result);
  78. }
  79. static void checksize(set_p s)
  80. {
  81. int i;
  82. int size = -1;
  83. s->set_size = 0;
  84. for (i = 1; i <= nregs; i++) {
  85. if (BIT(s->set_val, i)) {
  86. int sz = l_regs[i].ri_size;
  87. if (size == -1) size = sz;
  88. else if (size != sz) return;
  89. }
  90. }
  91. for (i = 1; i <= ntokens; i++) {
  92. if (BIT(s->set_val, i+nregs)) {
  93. int sz = l_tokens[i]->tk_size;
  94. if (size == -1) size = sz;
  95. else if (size != sz) return;
  96. }
  97. }
  98. if (size != -1) s->set_size = size;
  99. }
  100. set_t setproduct(set_t s1, set_t s2)
  101. {
  102. set_t result;
  103. int i;
  104. for(i=0;i<SETSIZE;i++)
  105. result.set_val[i] = s1.set_val[i] & s2.set_val[i];
  106. checksize(&result);
  107. return(result);
  108. }
  109. set_t setsum(set_t s1, set_t s2)
  110. {
  111. set_t result;
  112. int i;
  113. if (s1.set_size == s2.set_size)
  114. result.set_size = s1.set_size;
  115. else
  116. result.set_size = 0;
  117. for(i=0;i<SETSIZE;i++)
  118. result.set_val[i] = s1.set_val[i] | s2.set_val[i];
  119. return(result);
  120. }
  121. set_t setdiff(set_t s1, set_t s2)
  122. {
  123. set_t result;
  124. int i;
  125. for(i=0;i<SETSIZE;i++)
  126. result.set_val[i] = s1.set_val[i] & ~ s2.set_val[i];
  127. /* make sure that we don't loose the lowest bit of the set, which
  128. indicates that it contains registers
  129. */
  130. for (i=1;i <= nregs; i++) {
  131. if (BIT(result.set_val, i)) {
  132. BIS(result.set_val,0);
  133. break;
  134. }
  135. }
  136. checksize(&result);
  137. return(result);
  138. }