2 * sparse/smatch_states.c
4 * Copyright (C) 2006 Dan Carpenter.
6 * Licensed under the Open Software License version 1.1
13 #include "smatch_slist.h"
15 struct state_list
*cur_slist
; /* current states */
17 static struct state_list_stack
*true_stack
; /* states after a t/f branch */
18 static struct state_list_stack
*false_stack
;
19 static struct state_list_stack
*pre_cond_stack
; /* states before a t/f branch */
21 static struct state_list_stack
*cond_true_stack
; /* states affected by a branch */
22 static struct state_list_stack
*cond_false_stack
;
24 static struct state_list_stack
*break_stack
;
25 static struct state_list_stack
*switch_stack
;
26 static struct state_list_stack
*default_stack
;
27 static struct state_list_stack
*continue_stack
;
28 static struct state_list_stack
*false_only_stack
;
30 struct slist_stack
*goto_stack
;
34 void __print_slist(struct state_list
*slist
)
36 struct smatch_state
*state
;
38 printf("dumping slist at %d\n", get_lineno());
39 FOR_EACH_PTR(slist
, state
) {
40 printf("%s=%d\n", state
->name
, state
->state
);
41 } END_FOR_EACH_PTR(state
);
45 void __print_cur_slist()
47 __print_slist(cur_slist
);
50 void set_state(const char *name
, int owner
, struct symbol
*sym
, int state
)
58 s
= get_state(name
, owner
, sym
);
60 printf("%d new state. name='%s' owner=%d: %d\n",
61 get_lineno(), name
, owner
, state
);
63 printf("%d state change name='%s' owner=%d: %d => %d\n",
64 get_lineno(), name
, owner
, s
, state
);
66 set_state_slist(&cur_slist
, name
, owner
, sym
, state
);
69 int get_state(const char *name
, int owner
, struct symbol
*sym
)
71 return get_state_slist(cur_slist
, name
, owner
, sym
);
74 void delete_state(const char *name
, int owner
, struct symbol
*sym
)
76 delete_state_slist(&cur_slist
, name
, owner
, sym
);
79 struct state_list
*get_current_states(int owner
)
81 struct state_list
*slist
;
82 struct smatch_state
*tmp
;
84 FOR_EACH_PTR(cur_slist
, tmp
) {
85 if (tmp
->owner
== owner
) {
86 add_ptr_list(&slist
, tmp
);
88 } END_FOR_EACH_PTR(tmp
);
93 void set_true_false_states(const char *name
, int owner
, struct symbol
*sym
,
94 int true_state
, int false_state
)
97 /* fixme. save history */
99 SM_DEBUG("%d set_true_false %s. Was %d. Now T:%d F:%d\n",
100 get_lineno(), name
, get_state(name
, owner
, sym
), true_state
,
103 if (!cond_false_stack
|| !cond_true_stack
) {
104 printf("Error: missing true/false stacks\n");
108 set_state_slist(&cur_slist
, name
, owner
, sym
, true_state
);
109 set_state_stack(&cond_true_stack
, name
, owner
, sym
, true_state
);
110 set_state_stack(&cond_false_stack
, name
, owner
, sym
, false_state
);
116 del_slist(&cur_slist
);
119 void clear_all_states()
121 struct named_slist
*named_slist
;
124 del_slist_stack(&true_stack
);
125 del_slist_stack(&false_stack
);
126 del_slist_stack(&false_only_stack
);
127 del_slist_stack(&pre_cond_stack
);
128 del_slist_stack(&cond_true_stack
);
129 del_slist_stack(&cond_false_stack
);
130 del_slist_stack(&break_stack
);
131 del_slist_stack(&switch_stack
);
132 del_slist_stack(&continue_stack
);
134 FOR_EACH_PTR(goto_stack
, named_slist
) {
135 del_slist(&named_slist
->slist
);
136 } END_FOR_EACH_PTR(named_slist
);
137 __free_ptr_list((struct ptr_list
**)&goto_stack
);
141 void __push_cond_stacks()
143 push_slist(&cond_true_stack
, NULL
);
144 push_slist(&cond_false_stack
, NULL
);
147 static void __use_cond_stack(struct state_list_stack
**stack
)
149 struct state_list
*slist
;
150 struct smatch_state
*tmp
;
152 del_slist(&cur_slist
);
153 cur_slist
= pop_slist(&pre_cond_stack
);
154 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
156 slist
= pop_slist(stack
);
157 FOR_EACH_PTR(slist
, tmp
) {
158 set_state(tmp
->name
, tmp
->owner
, tmp
->sym
, tmp
->state
);
159 } END_FOR_EACH_PTR(tmp
);
160 push_slist(stack
, slist
);
164 void __use_cond_true_states()
166 __use_cond_stack(&cond_true_stack
);
169 void __use_cond_false_states()
171 __use_cond_stack(&cond_false_stack
);
174 void __negate_cond_stacks()
176 struct state_list
*old_false
, *old_true
;
178 old_false
= pop_slist(&cond_false_stack
);
179 old_true
= pop_slist(&cond_true_stack
);
181 overwrite_slist(old_false
, &cur_slist
);
183 push_slist(&cond_false_stack
, old_true
);
184 push_slist(&cond_true_stack
, old_false
);
188 void __and_cond_states()
190 struct state_list
*tmp_slist
;
192 tmp_slist
= pop_slist(&cond_true_stack
);
193 and_slist_stack(&cond_true_stack
, tmp_slist
);
194 or_slist_stack(&cond_false_stack
);
197 void __or_cond_states()
199 struct state_list
*tmp_slist
;
201 or_slist_stack(&cond_true_stack
);
202 tmp_slist
= pop_slist(&cond_false_stack
);
203 and_slist_stack(&cond_false_stack
, tmp_slist
);
207 void __save_pre_cond_states()
209 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
212 void __pop_pre_cond_states()
214 struct state_list
*tmp
;
216 tmp
= pop_slist(&pre_cond_stack
);
220 void __use_false_only_stack()
222 struct state_list
*slist
;
224 slist
= pop_slist(&false_only_stack
);
225 overwrite_slist(slist
, &cur_slist
);
229 void __pop_false_only_stack()
231 struct state_list
*slist
;
233 slist
= pop_slist(&false_only_stack
);
237 void __use_cond_states()
239 struct state_list
*tmp
, *tmp2
, *tmp3
;
241 tmp
= pop_slist(&cond_false_stack
);
242 push_slist(&false_only_stack
, clone_slist(tmp
));
243 push_slist(&cond_false_stack
, tmp
);
245 /* Everyone calls __use_true_states so setting up
246 the true stack is enough here */
247 tmp
= pop_slist(&pre_cond_stack
);
248 tmp3
= clone_slist(tmp
);
249 tmp2
= pop_slist(&cond_true_stack
);
250 overwrite_slist(tmp2
, &tmp3
);
251 push_slist(&true_stack
, tmp3
);
253 tmp2
= pop_slist(&cond_false_stack
);
254 overwrite_slist(tmp2
, &tmp
);
255 push_slist(&false_stack
, tmp
);
258 void __use_true_states()
260 del_slist(&cur_slist
);
261 cur_slist
= pop_slist(&true_stack
);
264 void __use_false_states()
266 push_slist(&true_stack
, clone_slist(cur_slist
));
267 del_slist(&cur_slist
);
268 cur_slist
= pop_slist(&false_stack
);
271 void __pop_false_states()
273 struct state_list
*slist
;
275 slist
= pop_slist(&false_stack
);
279 void __merge_false_states()
281 struct state_list
*slist
;
283 slist
= pop_slist(&false_stack
);
288 void __merge_true_states()
290 struct state_list
*slist
;
292 slist
= pop_slist(&true_stack
);
297 void __pop_true_states()
299 struct state_list
*slist
;
301 slist
= pop_slist(&true_stack
);
305 void __push_continues()
307 push_slist(&continue_stack
, NULL
);
310 void __pop_continues()
312 struct state_list
*slist
;
314 slist
= pop_slist(&continue_stack
);
318 void __process_continues()
320 struct smatch_state
*state
;
322 FOR_EACH_PTR(cur_slist
, state
) {
323 merge_state_stack(&continue_stack
, state
->name
, state
->owner
,
324 state
->sym
, state
->state
);
325 } END_FOR_EACH_PTR(state
);
328 void __merge_continues()
330 struct state_list
*slist
;
332 slist
= pop_slist(&continue_stack
);
339 push_slist(&break_stack
, NULL
);
342 void __process_breaks()
344 struct smatch_state
*state
;
346 FOR_EACH_PTR(cur_slist
, state
) {
347 merge_state_stack(&break_stack
, state
->name
, state
->owner
,
348 state
->sym
, state
->state
);
349 } END_FOR_EACH_PTR(state
);
352 void __merge_breaks()
354 struct state_list
*slist
;
356 slist
= pop_slist(&break_stack
);
363 del_slist(&cur_slist
);
364 cur_slist
= pop_slist(&break_stack
);
369 struct state_list
*slist
;
371 slist
= pop_slist(&break_stack
);
375 void __save_switch_states()
377 push_slist(&switch_stack
, clone_slist(cur_slist
));
380 void __merge_switches()
382 struct state_list
*slist
;
384 slist
= pop_slist(&switch_stack
);
386 push_slist(&switch_stack
, slist
);
389 void __pop_switches()
391 struct state_list
*slist
;
393 slist
= pop_slist(&switch_stack
);
397 void __push_default()
399 push_slist(&default_stack
, NULL
);
400 set_state_stack(&default_stack
, "has_default", 0, NULL
, 0);
405 set_state_stack(&default_stack
, "has_default", 0, NULL
, 1);
410 struct state_list
*slist
;
411 struct smatch_state
*state
;
414 slist
= pop_slist(&default_stack
);
415 FOR_EACH_PTR(slist
, state
) {
416 if (!strcmp(state
->name
, "has_default"))
418 } END_FOR_EACH_PTR(state
);
423 static struct named_slist
*alloc_named_slist(const char *name
,
424 struct state_list
*slist
)
426 struct named_slist
*named_slist
= __alloc_named_slist(0);
428 named_slist
->name
= (char *)name
;
429 named_slist
->slist
= slist
;
433 void __save_gotos(const char *name
)
435 struct state_list
*slist
;
437 slist
= get_slist_from_slist_stack(name
);
439 struct smatch_state
*state
;
440 FOR_EACH_PTR(cur_slist
, state
) {
441 merge_state_slist(&slist
, state
->name
, state
->owner
,
442 state
->sym
, state
->state
);
443 } END_FOR_EACH_PTR(state
);
446 struct state_list
*slist
;
447 struct named_slist
*named_slist
;
448 slist
= clone_slist(cur_slist
);
449 named_slist
= alloc_named_slist(name
, slist
);
450 add_ptr_list(&goto_stack
, named_slist
);
454 void __merge_gotos(const char *name
)
456 struct state_list
*slist
;
458 slist
= get_slist_from_slist_stack(name
);