itemlist.cc 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248
  1. /* $Header$ */
  2. #include <alloc.h>
  3. #include <stdio.h>
  4. #include <assert.h>
  5. #include "position.h"
  6. #include "tree.h"
  7. #include "operator.h"
  8. #include "message.h"
  9. extern FILE *db_out;
  10. extern int db_ss;
  11. int stop_reason;
  12. typedef struct item {
  13. struct item *i_next;
  14. struct tree *i_node;
  15. int i_disabled;
  16. int i_itemno;
  17. } t_item, *p_item;
  18. /* STATICALLOCDEF "item" 10 */
  19. struct itemlist {
  20. p_item il_first, il_last;
  21. };
  22. static struct itemlist item_list;
  23. int item_count;
  24. static int
  25. in_item_list(p)
  26. p_tree p;
  27. {
  28. register p_item i = item_list.il_first;
  29. while (i) {
  30. if (i->i_node == p) return 1;
  31. i = i->i_next;
  32. }
  33. return 0;
  34. }
  35. static
  36. pr_item(i)
  37. p_item i;
  38. {
  39. fprintf(db_out, "(%d)\t", i->i_itemno);
  40. print_node(db_out, i->i_node, 0);
  41. fputs(i->i_disabled ? " (disabled)\n": "\n", db_out);
  42. }
  43. int
  44. item_addr_actions(a, mess_type, may_stop)
  45. t_addr a;
  46. int mess_type;
  47. int may_stop;
  48. {
  49. /* Perform actions associated with position 'a', and return 1 if we must stop
  50. there, and 0 if not.
  51. */
  52. register p_item i = item_list.il_first;
  53. int stopping = 0;
  54. stop_reason = 0;
  55. for (i = item_list.il_first; i != 0; i = i->i_next) {
  56. register p_tree p = i->i_node;
  57. if (! i->i_disabled
  58. && (p->t_address == a || p->t_address == NO_ADDR)) {
  59. switch(p->t_oper) {
  60. case OP_STOP:
  61. if (mess_type != M_DB_SS && mess_type != M_OK) break;
  62. if (! p->t_args[1] || eval_cond(p->t_args[1])) {
  63. if (! stop_reason) stop_reason = i->i_itemno;
  64. stopping = 1;
  65. }
  66. break;
  67. case OP_TRACE:
  68. case OP_WHEN:
  69. case OP_DUMP:
  70. case OP_DISPLAY:
  71. break;
  72. default:
  73. assert(0);
  74. }
  75. }
  76. }
  77. for (i = item_list.il_first; i != 0; i = i->i_next) {
  78. register p_tree p = i->i_node;
  79. if (! i->i_disabled
  80. && (p->t_address == a || p->t_address == NO_ADDR)) {
  81. switch(p->t_oper) {
  82. case OP_TRACE:
  83. if ((! stopping && mess_type != M_END_SS)
  84. || p->t_args[2] || ! may_stop) {
  85. perform(p, a);
  86. }
  87. break;
  88. case OP_WHEN:
  89. perform(p, a);
  90. break;
  91. case OP_STOP:
  92. case OP_DUMP:
  93. case OP_DISPLAY:
  94. break;
  95. default:
  96. assert(0);
  97. }
  98. }
  99. }
  100. return stopping;
  101. }
  102. handle_displays()
  103. {
  104. register p_item i = item_list.il_first;
  105. while (i) {
  106. register p_tree p = i->i_node;
  107. if (! i->i_disabled && p->t_oper == OP_DISPLAY) do_print(p);
  108. i = i->i_next;
  109. }
  110. }
  111. add_to_item_list(p)
  112. p_tree p;
  113. {
  114. p_item i;
  115. if (in_item_list(p)) return 1;
  116. i = new_item();
  117. i->i_node = p;
  118. if (p->t_address == NO_ADDR
  119. && (p->t_oper != OP_TRACE || ! p->t_args[0])) db_ss++;
  120. if (item_list.il_first == 0) {
  121. item_list.il_first = i;
  122. }
  123. else {
  124. item_list.il_last->i_next = i;
  125. }
  126. i->i_itemno = ++item_count;
  127. item_list.il_last = i;
  128. pr_item(i);
  129. return 1;
  130. }
  131. p_tree
  132. remove_from_item_list(n)
  133. int n;
  134. {
  135. register p_item i = item_list.il_first, prev = 0;
  136. p_tree p;
  137. if (n <= 0) n = item_count - n;
  138. while (i) {
  139. if (i->i_itemno == n) break;
  140. prev = i;
  141. i = i->i_next;
  142. }
  143. if (! i) {
  144. error("no item %d in current status", n);
  145. return 0;
  146. }
  147. if (i->i_itemno == stop_reason) stop_reason = 0;
  148. if (prev) {
  149. prev->i_next = i->i_next;
  150. }
  151. else item_list.il_first = i->i_next;
  152. if (i == item_list.il_last) item_list.il_last = prev;
  153. p = i->i_node;
  154. if (p->t_address == NO_ADDR
  155. && (p->t_oper != OP_TRACE || ! p->t_args[0])) db_ss--;
  156. free_item(i);
  157. return p;
  158. }
  159. p_tree
  160. get_from_item_list(n)
  161. int n;
  162. {
  163. register p_item i = item_list.il_first;
  164. if (n <= 0) n = item_count - n;
  165. while (i) {
  166. if (i->i_itemno == n) return i->i_node;
  167. i = i->i_next;
  168. }
  169. return 0;
  170. }
  171. able_item(n, kind)
  172. int n;
  173. {
  174. register p_item i = item_list.il_first;
  175. register p_tree p;
  176. if (n <= 0) n = item_count - n;
  177. while (i) {
  178. if (i->i_itemno == n) break;
  179. i = i->i_next;
  180. }
  181. if (! i) {
  182. error("no item %d in current status", n);
  183. return;
  184. }
  185. p = i->i_node;
  186. if (i->i_disabled == kind) {
  187. warning("item %d already %sabled", n, kind ? "dis" : "en");
  188. return;
  189. }
  190. if (p->t_address == NO_ADDR
  191. && (p->t_oper != OP_TRACE || ! p->t_args[0])) {
  192. db_ss += kind == 1 ? (-1) : 1;
  193. }
  194. i->i_disabled = kind;
  195. switch(p->t_oper) {
  196. case OP_STOP:
  197. case OP_WHEN:
  198. setstop(p, kind ? M_CLRBP : M_SETBP);
  199. break;
  200. case OP_TRACE:
  201. settrace(p, kind ? M_CLRTRACE : M_SETTRACE);
  202. break;
  203. }
  204. }
  205. print_items()
  206. {
  207. register p_item i = item_list.il_first;
  208. for (; i; i = i->i_next) {
  209. pr_item(i);
  210. }
  211. }
  212. perform_items()
  213. {
  214. register p_item i = item_list.il_first;
  215. for (; i; i = i->i_next) {
  216. if (! i->i_disabled && i->i_node->t_oper != OP_DUMP) eval(i->i_node);
  217. }
  218. }