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
);
117 printf("debug. nullifying path\n");
123 del_slist(&cur_slist
);
127 void __unnullify_path()
129 printf("debug. path is now nonnull\n");
133 void clear_all_states()
135 struct named_slist
*named_slist
;
138 del_slist_stack(&true_stack
);
139 del_slist_stack(&false_stack
);
140 del_slist_stack(&false_only_stack
);
141 del_slist_stack(&pre_cond_stack
);
142 del_slist_stack(&cond_true_stack
);
143 del_slist_stack(&cond_false_stack
);
144 del_slist_stack(&break_stack
);
145 del_slist_stack(&switch_stack
);
146 del_slist_stack(&continue_stack
);
148 FOR_EACH_PTR(goto_stack
, named_slist
) {
149 del_slist(&named_slist
->slist
);
150 } END_FOR_EACH_PTR(named_slist
);
151 __free_ptr_list((struct ptr_list
**)&goto_stack
);
155 void __push_cond_stacks()
157 push_slist(&cond_true_stack
, NULL
);
158 push_slist(&cond_false_stack
, NULL
);
162 * This combines the pre cond states with either the true or false states.
164 * a = kmalloc() ; if (a !! foo(a)
165 * In the pre state a is possibly null. In the true state it is non null.
166 * In the false state it is null. Combine the pre and the false to get
167 * that when we call 'foo', 'a' is null.
170 static void __use_cond_stack(struct state_list_stack
**stack
)
172 struct state_list
*slist
;
173 struct smatch_state
*tmp
;
175 del_slist(&cur_slist
);
176 cur_slist
= pop_slist(&pre_cond_stack
);
177 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
179 slist
= pop_slist(stack
);
180 FOR_EACH_PTR(slist
, tmp
) {
181 set_state(tmp
->name
, tmp
->owner
, tmp
->sym
, tmp
->state
);
182 } END_FOR_EACH_PTR(tmp
);
183 push_slist(stack
, slist
);
187 void __use_cond_true_states()
189 __use_cond_stack(&cond_true_stack
);
192 void __use_cond_false_states()
194 __use_cond_stack(&cond_false_stack
);
197 void __negate_cond_stacks()
199 struct state_list
*old_false
, *old_true
;
201 old_false
= pop_slist(&cond_false_stack
);
202 old_true
= pop_slist(&cond_true_stack
);
204 overwrite_slist(old_false
, &cur_slist
);
206 push_slist(&cond_false_stack
, old_true
);
207 push_slist(&cond_true_stack
, old_false
);
211 void __and_cond_states()
213 struct state_list
*tmp_slist
;
215 tmp_slist
= pop_slist(&cond_true_stack
);
216 and_slist_stack(&cond_true_stack
, tmp_slist
);
217 or_slist_stack(&cond_false_stack
);
220 void __or_cond_states()
222 struct state_list
*tmp_slist
;
224 or_slist_stack(&cond_true_stack
);
225 tmp_slist
= pop_slist(&cond_false_stack
);
226 and_slist_stack(&cond_false_stack
, tmp_slist
);
230 void __save_pre_cond_states()
232 push_slist(&pre_cond_stack
, clone_slist(cur_slist
));
235 void __pop_pre_cond_states()
237 struct state_list
*tmp
;
239 tmp
= pop_slist(&pre_cond_stack
);
243 void __use_false_only_stack()
245 struct state_list
*slist
;
247 slist
= pop_slist(&false_only_stack
);
248 overwrite_slist(slist
, &cur_slist
);
252 void __pop_false_only_stack()
254 struct state_list
*slist
;
256 slist
= pop_slist(&false_only_stack
);
260 void __use_cond_states()
262 struct state_list
*tmp
, *tmp2
, *tmp3
;
264 tmp
= pop_slist(&cond_false_stack
);
265 push_slist(&false_only_stack
, clone_slist(tmp
));
266 push_slist(&cond_false_stack
, tmp
);
268 tmp
= pop_slist(&pre_cond_stack
);
269 tmp3
= clone_slist(tmp
);
270 tmp2
= pop_slist(&cond_true_stack
);
271 overwrite_slist(tmp2
, &tmp3
);
273 /* we use the true states right away */
274 del_slist(&cur_slist
);
277 tmp2
= pop_slist(&cond_false_stack
);
278 overwrite_slist(tmp2
, &tmp
);
279 push_slist(&false_stack
, tmp
);
282 void __push_true_states()
284 push_slist(&true_stack
, clone_slist(cur_slist
));
287 void __use_false_states()
289 del_slist(&cur_slist
);
290 cur_slist
= pop_slist(&false_stack
);
293 void __pop_false_states()
295 struct state_list
*slist
;
297 slist
= pop_slist(&false_stack
);
301 void __merge_false_states()
303 struct state_list
*slist
;
305 slist
= pop_slist(&false_stack
);
306 printf("%d in __merge_false_states\n", get_lineno());
307 merge_slist_new(slist
);
311 void __merge_true_states()
313 struct state_list
*slist
;
315 slist
= pop_slist(&true_stack
);
316 printf("%d in __merge_true_states\n", get_lineno());
317 merge_slist_new(slist
);
321 void __push_continues()
323 push_slist(&continue_stack
, NULL
);
326 void __pop_continues()
328 struct state_list
*slist
;
330 slist
= pop_slist(&continue_stack
);
334 void __process_continues()
336 struct smatch_state
*state
;
338 FOR_EACH_PTR(cur_slist
, state
) {
339 merge_state_stack(&continue_stack
, state
->name
, state
->owner
,
340 state
->sym
, state
->state
);
341 } END_FOR_EACH_PTR(state
);
344 void __merge_continues()
346 struct state_list
*slist
;
348 slist
= pop_slist(&continue_stack
);
355 push_slist(&break_stack
, NULL
);
358 void __process_breaks()
360 struct smatch_state
*state
;
362 FOR_EACH_PTR(cur_slist
, state
) {
363 merge_state_stack(&break_stack
, state
->name
, state
->owner
,
364 state
->sym
, state
->state
);
365 } END_FOR_EACH_PTR(state
);
368 void __merge_breaks()
370 struct state_list
*slist
;
372 slist
= pop_slist(&break_stack
);
379 del_slist(&cur_slist
);
380 cur_slist
= pop_slist(&break_stack
);
385 struct state_list
*slist
;
387 slist
= pop_slist(&break_stack
);
391 void __save_switch_states()
393 push_slist(&switch_stack
, clone_slist(cur_slist
));
396 void __merge_switches()
398 struct state_list
*slist
;
400 slist
= pop_slist(&switch_stack
);
402 push_slist(&switch_stack
, slist
);
405 void __pop_switches()
407 struct state_list
*slist
;
409 slist
= pop_slist(&switch_stack
);
413 void __push_default()
415 push_slist(&default_stack
, NULL
);
416 set_state_stack(&default_stack
, "has_default", 0, NULL
, 0);
421 set_state_stack(&default_stack
, "has_default", 0, NULL
, 1);
426 struct state_list
*slist
;
427 struct smatch_state
*state
;
430 slist
= pop_slist(&default_stack
);
431 FOR_EACH_PTR(slist
, state
) {
432 if (!strcmp(state
->name
, "has_default"))
434 } END_FOR_EACH_PTR(state
);
439 static struct named_slist
*alloc_named_slist(const char *name
,
440 struct state_list
*slist
)
442 struct named_slist
*named_slist
= __alloc_named_slist(0);
444 named_slist
->name
= (char *)name
;
445 named_slist
->slist
= slist
;
449 void __save_gotos(const char *name
)
451 struct state_list
*slist
;
453 slist
= get_slist_from_slist_stack(goto_stack
, name
);
455 struct smatch_state
*state
;
457 FOR_EACH_PTR(cur_slist
, state
) {
458 merge_state_slist(&slist
, state
->name
, state
->owner
,
459 state
->sym
, state
->state
);
460 } END_FOR_EACH_PTR(state
);
463 struct state_list
*slist
;
464 struct named_slist
*named_slist
;
466 slist
= clone_slist(cur_slist
);
467 named_slist
= alloc_named_slist(name
, slist
);
468 add_ptr_list(&goto_stack
, named_slist
);
472 void __merge_gotos(const char *name
)
474 struct state_list
*slist
;
476 slist
= get_slist_from_slist_stack(goto_stack
, name
);