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 set_state("null_path", 0, NULL
, 1);
121 del_slist(&cur_slist
);
125 void __unnullify_path()
127 set_state("null_path", 0, NULL
, 0);
130 void clear_all_states()
132 struct named_slist
*named_slist
;
135 del_slist_stack(&true_stack
);
136 del_slist_stack(&false_stack
);
137 del_slist_stack(&false_only_stack
);
138 del_slist_stack(&pre_cond_stack
);
139 del_slist_stack(&cond_true_stack
);
140 del_slist_stack(&cond_false_stack
);
141 del_slist_stack(&break_stack
);
142 del_slist_stack(&switch_stack
);
143 del_slist_stack(&continue_stack
);
145 FOR_EACH_PTR(goto_stack
, named_slist
) {
146 del_slist(&named_slist
->slist
);
147 } END_FOR_EACH_PTR(named_slist
);
148 __free_ptr_list((struct ptr_list
**)&goto_stack
);
152 void __push_cond_stacks()
154 push_slist(&cond_true_stack
, NULL
);
155 push_slist(&cond_false_stack
, NULL
);
159 * This combines the pre cond states with either the true or false states.
161 * a = kmalloc() ; if (a !! foo(a)
162 * In the pre state a is possibly null. In the true state it is non null.
163 * In the false state it is null. Combine the pre and the false to get
164 * that when we call 'foo', 'a' is null.
167 static void __use_cond_stack(struct state_list_stack
**stack
)
169 struct state_list
*slist
;
171 del_slist(&cur_slist
);
173 cur_slist
= pop_slist(&pre_cond_stack
);
174 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
176 slist
= pop_slist(stack
);
177 overwrite_slist(slist
, &cur_slist
);
178 push_slist(stack
, slist
);
182 void __use_cond_true_states()
184 __use_cond_stack(&cond_true_stack
);
187 void __use_cond_false_states()
189 __use_cond_stack(&cond_false_stack
);
192 void __negate_cond_stacks()
194 struct state_list
*old_false
, *old_true
;
196 old_false
= pop_slist(&cond_false_stack
);
197 old_true
= pop_slist(&cond_true_stack
);
199 overwrite_slist(old_false
, &cur_slist
);
201 push_slist(&cond_false_stack
, old_true
);
202 push_slist(&cond_true_stack
, old_false
);
206 void __and_cond_states()
208 struct state_list
*tmp_slist
;
210 tmp_slist
= pop_slist(&cond_true_stack
);
211 and_slist_stack(&cond_true_stack
, tmp_slist
);
212 or_slist_stack(&cond_false_stack
);
215 void __or_cond_states()
217 struct state_list
*tmp_slist
;
219 or_slist_stack(&cond_true_stack
);
220 tmp_slist
= pop_slist(&cond_false_stack
);
221 and_slist_stack(&cond_false_stack
, tmp_slist
);
225 void __save_pre_cond_states()
227 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
230 void __pop_pre_cond_states()
232 struct state_list
*tmp
;
234 tmp
= pop_slist(&pre_cond_stack
);
238 void __use_false_only_stack()
240 struct state_list
*slist
;
242 slist
= pop_slist(&false_only_stack
);
243 overwrite_slist(slist
, &cur_slist
);
247 void __pop_false_only_stack()
249 struct state_list
*slist
;
251 slist
= pop_slist(&false_only_stack
);
255 void __use_cond_states()
257 struct state_list
*pre
, *pre_clone
, *true_states
, *false_states
;
259 pre
= pop_slist(&pre_cond_stack
);
260 pre_clone
= clone_slist(pre
);
262 true_states
= pop_slist(&cond_true_stack
);
263 overwrite_slist(true_states
, &pre
);
264 /* we use the true states right away */
265 del_slist(&cur_slist
);
268 false_states
= pop_slist(&cond_false_stack
);
269 push_slist(&false_only_stack
, clone_slist(false_states
));
270 overwrite_slist(false_states
, &pre_clone
);
271 push_slist(&false_stack
, pre_clone
);
274 void __push_true_states()
276 push_slist(&true_stack
, clone_slist(cur_slist
));
279 void __use_false_states()
281 del_slist(&cur_slist
);
282 cur_slist
= pop_slist(&false_stack
);
285 void __pop_false_states()
287 struct state_list
*slist
;
289 slist
= pop_slist(&false_stack
);
293 void __merge_false_states()
295 struct state_list
*slist
;
297 slist
= pop_slist(&false_stack
);
302 void __merge_true_states()
304 struct state_list
*slist
;
306 slist
= pop_slist(&true_stack
);
311 void __push_continues()
313 push_slist(&continue_stack
, NULL
);
314 set_state_stack(&continue_stack
, "__smatch_continue_used", 0, NULL
, 0);
317 void __pop_continues()
319 struct state_list
*slist
;
321 slist
= pop_slist(&continue_stack
);
325 void __process_continues()
327 struct smatch_state
*state
;
329 set_state_stack(&continue_stack
, "__smatch_continue_used", 1, NULL
, 0);
330 FOR_EACH_PTR(cur_slist
, state
) {
331 merge_state_stack(&continue_stack
, state
->name
, state
->owner
,
332 state
->sym
, state
->state
);
333 } END_FOR_EACH_PTR(state
);
336 void __merge_continues()
338 struct state_list
*slist
;
341 slist
= pop_slist(&continue_stack
);
342 tmp
= get_state_slist(slist
, "__smatch_continue_used", 0, NULL
);
343 delete_state_slist(&slist
, "__smatch_continue_used", 0, NULL
);
351 if (get_state_stack(break_stack
, "__smatch_break_used", 0, NULL
) == 1)
358 push_slist(&break_stack
, NULL
);
359 set_state_stack(&break_stack
, "__smatch_break_used", 0, NULL
, 0);
362 void __process_breaks()
364 struct smatch_state
*state
;
366 set_state_stack(&break_stack
, "__smatch_break_used", 0, NULL
, 1);
367 FOR_EACH_PTR(cur_slist
, state
) {
368 merge_state_stack(&break_stack
, state
->name
, state
->owner
,
369 state
->sym
, state
->state
);
370 } END_FOR_EACH_PTR(state
);
373 void __merge_breaks()
375 struct state_list
*slist
;
378 slist
= pop_slist(&break_stack
);
379 tmp
= get_state_slist(slist
, "__smatch_break_used", 0, NULL
);
380 delete_state_slist(&slist
, "__smatch_break_used", 0, NULL
);
388 struct state_list
*slist
;
391 del_slist(&cur_slist
);
392 slist
= pop_slist(&break_stack
);
394 tmp
= get_state_slist(slist
, "__smatch_break_used", 0, NULL
);
395 delete_state_slist(&slist
, "__smatch_break_used", 0, NULL
);
405 struct state_list
*slist
;
407 slist
= pop_slist(&break_stack
);
411 void __save_switch_states()
413 push_slist(&switch_stack
, clone_slist(cur_slist
));
416 void __merge_switches()
418 struct state_list
*slist
;
420 slist
= pop_slist(&switch_stack
);
422 push_slist(&switch_stack
, slist
);
425 void __pop_switches()
427 struct state_list
*slist
;
429 slist
= pop_slist(&switch_stack
);
433 void __push_default()
435 push_slist(&default_stack
, NULL
);
436 set_state_stack(&default_stack
, "has_default", 0, NULL
, 0);
441 set_state_stack(&default_stack
, "has_default", 0, NULL
, 1);
446 struct state_list
*slist
;
447 struct smatch_state
*state
;
450 slist
= pop_slist(&default_stack
);
451 FOR_EACH_PTR(slist
, state
) {
452 if (!strcmp(state
->name
, "has_default"))
454 } END_FOR_EACH_PTR(state
);
459 static struct named_slist
*alloc_named_slist(const char *name
,
460 struct state_list
*slist
)
462 struct named_slist
*named_slist
= __alloc_named_slist(0);
464 named_slist
->name
= (char *)name
;
465 named_slist
->slist
= slist
;
469 void __save_gotos(const char *name
)
471 struct state_list
*slist
;
473 slist
= get_slist_from_slist_stack(goto_stack
, name
);
475 struct smatch_state
*state
;
477 FOR_EACH_PTR(cur_slist
, state
) {
478 merge_state_slist(&slist
, state
->name
, state
->owner
,
479 state
->sym
, state
->state
);
480 } END_FOR_EACH_PTR(state
);
483 struct state_list
*slist
;
484 struct named_slist
*named_slist
;
486 slist
= clone_slist(cur_slist
);
487 named_slist
= alloc_named_slist(name
, slist
);
488 add_ptr_list(&goto_stack
, named_slist
);
492 void __merge_gotos(const char *name
)
494 struct state_list
*slist
;
496 slist
= get_slist_from_slist_stack(goto_stack
, name
);