2 * Copyright (C) 2006 Dan Carpenter.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, see http://www.gnu.org/copyleft/gpl.txt
19 * You have a lists of states. kernel = locked, foo = NULL, ...
20 * When you hit an if {} else {} statement then you swap the list
21 * of states for a different list of states. The lists are stored
24 * At the beginning of this file there are list of the stacks that
25 * we use. Each function in this file does something to one of
28 * So the smatch_flow.c understands code but it doesn't understand states.
29 * smatch_flow calls functions in this file. This file calls functions
30 * in smatch_slist.c which just has boring generic plumbing for handling
31 * state lists. But really it's this file where all the magic happens.
37 #include "smatch_slist.h"
38 #include "smatch_extra.h"
40 struct smatch_state undefined
= { .name
= "undefined" };
41 struct smatch_state ghost
= { .name
= "ghost" };
42 struct smatch_state merged
= { .name
= "merged" };
43 struct smatch_state true_state
= { .name
= "true" };
44 struct smatch_state false_state
= { .name
= "false" };
46 static struct stree
*cur_stree
; /* current states */
47 static struct stree
*fast_overlay
;
49 static struct stree_stack
*true_stack
; /* states after a t/f branch */
50 static struct stree_stack
*false_stack
;
51 static struct stree_stack
*pre_cond_stack
; /* states before a t/f branch */
53 static struct stree_stack
*cond_true_stack
; /* states affected by a branch */
54 static struct stree_stack
*cond_false_stack
;
56 static struct stree_stack
*fake_cur_stree_stack
;
59 static struct stree_stack
*break_stack
;
60 static struct stree_stack
*fake_break_stack
;
61 static struct stree_stack
*switch_stack
;
62 static struct range_list_stack
*remaining_cases
;
63 static struct stree_stack
*default_stack
;
64 static struct stree_stack
*continue_stack
;
66 static struct named_stree_stack
*goto_stack
;
68 static struct ptr_list
*backup
;
72 void __print_cur_stree(void)
74 __print_stree(cur_stree
);
77 bool __print_states(const char *owner
)
85 FOR_EACH_SM(__get_cur_stree(), sm
) {
86 if (!strstr(check_name(sm
->owner
), owner
))
88 sm_msg("%s", show_sm(sm
));
90 } END_FOR_EACH_SM(sm
);
102 void __set_cur_stree_readonly(void)
107 void __set_cur_stree_writable(void)
112 DECLARE_PTR_LIST(check_tracker_list
, check_tracker_hook
*);
113 static struct check_tracker_list
**tracker_hooks
;
115 void add_check_tracker(const char *check_name
, check_tracker_hook
*fn
)
117 check_tracker_hook
**p
;
120 owner
= id_from_name(check_name
);
122 printf("check not found. '%s'\n", check_name
);
126 p
= malloc(sizeof(check_tracker_hook
*));
128 add_ptr_list(&tracker_hooks
[owner
], p
);
131 static void call_tracker_hooks(int owner
, const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
133 struct check_tracker_list
*hooks
;
134 check_tracker_hook
**fn
;
136 if ((unsigned short)owner
== USHRT_MAX
)
139 hooks
= tracker_hooks
[owner
];
140 FOR_EACH_PTR(hooks
, fn
) {
141 (*fn
)(owner
, name
, sym
, state
);
142 } END_FOR_EACH_PTR(fn
);
145 void allocate_tracker_array(int num_checks
)
147 tracker_hooks
= malloc(num_checks
* sizeof(void *));
148 memset(tracker_hooks
, 0, num_checks
* sizeof(void *));
151 bool debug_on(const char *check_name
, const char *var
)
155 if (option_debug_check
&& strstr(check_name
, option_debug_check
))
157 if (option_debug_var
&& strcmp(var
, option_debug_var
) == 0)
162 struct sm_state
*set_state(int owner
, const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
164 struct sm_state
*ret
;
170 sm_perror("cur_stree is read only.");
172 if (debug_on(check_name(owner
), name
)) {
173 struct smatch_state
*s
;
175 s
= __get_state(owner
, name
, sym
);
177 sm_msg("%s new [%s] '%s' %s", __func__
,
178 check_name(owner
), name
, show_state(state
));
180 sm_msg("%s change [%s] '%s' %s => %s",
181 __func__
, check_name(owner
), name
, show_state(s
),
185 call_tracker_hooks(owner
, name
, sym
, state
);
187 if (owner
!= -1 && unreachable())
190 if (fake_cur_stree_stack
)
191 set_state_stree_stack(&fake_cur_stree_stack
, owner
, name
, sym
, state
);
193 ret
= set_state_stree(&cur_stree
, owner
, name
, sym
, state
);
198 struct sm_state
*set_state_expr(int owner
, struct expression
*expr
, struct smatch_state
*state
)
202 struct sm_state
*ret
= NULL
;
204 expr
= strip_expr(expr
);
205 name
= expr_to_var_sym(expr
, &sym
);
208 ret
= set_state(owner
, name
, sym
, state
);
214 struct stree
*__swap_cur_stree(struct stree
*stree
)
216 struct stree
*orig
= cur_stree
;
222 void __push_fake_cur_stree(void)
224 push_stree(&fake_cur_stree_stack
, NULL
);
225 __save_pre_cond_states();
228 struct stree
*__pop_fake_cur_stree(void)
230 if (!fake_cur_stree_stack
)
231 sm_perror("popping too many fake cur strees.");
232 __use_pre_cond_states();
233 return pop_stree(&fake_cur_stree_stack
);
236 void __free_fake_cur_stree(void)
240 stree
= __pop_fake_cur_stree();
244 void __set_fake_cur_stree_fast(struct stree
*stree
)
247 sm_perror("cannot nest fast overlay");
250 fast_overlay
= stree
;
251 set_fast_math_only();
254 void __pop_fake_cur_stree_fast(void)
257 clear_fast_math_only();
260 void __merge_stree_into_cur(struct stree
*stree
)
263 struct sm_state
*orig
;
264 struct sm_state
*merged
;
266 FOR_EACH_SM(stree
, sm
) {
267 orig
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
269 merged
= merge_sm_states(orig
, sm
);
273 } END_FOR_EACH_SM(sm
);
276 void __set_sm(struct sm_state
*sm
)
279 sm_perror("cur_stree is read only.");
281 if (debug_on(check_name(sm
->owner
), sm
->name
)) {
282 struct smatch_state
*s
;
284 s
= __get_state(sm
->owner
, sm
->name
, sm
->sym
);
286 sm_msg("%s new %s", __func__
, show_sm(sm
));
288 sm_msg("%s change %s (was %s)", __func__
, show_sm(sm
),
295 if (fake_cur_stree_stack
)
296 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
298 overwrite_sm_state_stree(&cur_stree
, sm
);
301 void __set_sm_cur_stree(struct sm_state
*sm
)
304 sm_perror("cur_stree is read only.");
306 if (debug_on(check_name(sm
->owner
), sm
->name
)) {
307 struct smatch_state
*s
;
309 s
= __get_state(sm
->owner
, sm
->name
, sm
->sym
);
311 sm_msg("%s new %s", __func__
, show_sm(sm
));
313 sm_msg("%s change %s (was %s)",
314 __func__
, show_sm(sm
), show_state(s
));
320 overwrite_sm_state_stree(&cur_stree
, sm
);
323 typedef void (get_state_hook
)(int owner
, const char *name
, struct symbol
*sym
);
324 DECLARE_PTR_LIST(fn_list
, get_state_hook
*);
325 static struct fn_list
*get_state_hooks
;
327 void add_get_state_hook(get_state_hook
*fn
)
329 get_state_hook
**p
= malloc(sizeof(get_state_hook
*));
331 add_ptr_list(&get_state_hooks
, p
);
334 static void call_get_state_hooks(int owner
, const char *name
, struct symbol
*sym
)
336 static int recursion
;
343 FOR_EACH_PTR(get_state_hooks
, fn
) {
344 (*fn
)(owner
, name
, sym
);
345 } END_FOR_EACH_PTR(fn
);
350 bool has_states(struct stree
*stree
, int owner
)
352 if (owner
< 0 || owner
> USHRT_MAX
)
356 if (owner
== USHRT_MAX
)
358 return stree
->has_states
[owner
];
361 struct smatch_state
*__get_state(int owner
, const char *name
, struct symbol
*sym
)
365 sm
= get_sm_state(owner
, name
, sym
);
371 struct smatch_state
*get_state(int owner
, const char *name
, struct symbol
*sym
)
373 call_get_state_hooks(owner
, name
, sym
);
375 return __get_state(owner
, name
, sym
);
378 struct smatch_state
*get_state_expr(int owner
, struct expression
*expr
)
380 struct expression
*fake_parent
;
383 struct smatch_state
*ret
= NULL
;
385 expr
= strip_expr(expr
);
386 name
= expr_to_var_sym(expr
, &sym
);
387 if ((!name
|| !sym
) && cur_func_sym
&& !cur_func_sym
->parsed
) {
388 fake_parent
= expr_get_fake_parent_expr(expr
);
391 name
= expr_to_var_sym(fake_parent
->left
, &sym
);
395 ret
= get_state(owner
, name
, sym
);
401 struct state_list
*get_possible_states(int owner
, const char *name
, struct symbol
*sym
)
403 struct sm_state
*sms
;
405 sms
= get_sm_state_stree(cur_stree
, owner
, name
, sym
);
407 return sms
->possible
;
411 struct state_list
*get_possible_states_expr(int owner
, struct expression
*expr
)
415 struct state_list
*ret
= NULL
;
417 expr
= strip_expr(expr
);
418 name
= expr_to_var_sym(expr
, &sym
);
421 ret
= get_possible_states(owner
, name
, sym
);
427 struct sm_state
*get_sm_state(int owner
, const char *name
, struct symbol
*sym
)
429 struct sm_state
*ret
;
431 ret
= get_sm_state_stree(fast_overlay
, owner
, name
, sym
);
435 return get_sm_state_stree(cur_stree
, owner
, name
, sym
);
438 struct sm_state
*get_sm_state_expr(int owner
, struct expression
*expr
)
442 struct sm_state
*ret
= NULL
;
444 expr
= strip_expr(expr
);
445 name
= expr_to_var_sym(expr
, &sym
);
448 ret
= get_sm_state(owner
, name
, sym
);
454 void __delete_state(int owner
, const char *name
, struct symbol
*sym
)
456 delete_state_stree(&cur_stree
, owner
, name
, sym
);
457 if (cond_true_stack
) {
458 delete_state_stree_stack(&pre_cond_stack
, owner
, name
, sym
);
459 delete_state_stree_stack(&cond_true_stack
, owner
, name
, sym
);
460 delete_state_stree_stack(&cond_false_stack
, owner
, name
, sym
);
464 static void delete_all_states_stree_sym(struct stree
**stree
, struct symbol
*sym
)
466 struct state_list
*slist
= NULL
;
469 FOR_EACH_SM(*stree
, sm
) {
471 add_ptr_list(&slist
, sm
);
472 } END_FOR_EACH_SM(sm
);
474 FOR_EACH_PTR(slist
, sm
) {
475 delete_state_stree(stree
, sm
->owner
, sm
->name
, sm
->sym
);
476 } END_FOR_EACH_PTR(sm
);
481 static void delete_all_states_stree_stack_sym(struct stree_stack
**stack
, struct symbol
*sym
)
488 stree
= pop_stree(stack
);
489 delete_all_states_stree_sym(&stree
, sym
);
490 push_stree(stack
, stree
);
493 void __delete_all_states_sym(struct symbol
*sym
)
495 delete_all_states_stree_sym(&cur_stree
, sym
);
497 delete_all_states_stree_stack_sym(&true_stack
, sym
);
498 delete_all_states_stree_stack_sym(&true_stack
, sym
);
499 delete_all_states_stree_stack_sym(&false_stack
, sym
);
500 delete_all_states_stree_stack_sym(&pre_cond_stack
, sym
);
501 delete_all_states_stree_stack_sym(&cond_true_stack
, sym
);
502 delete_all_states_stree_stack_sym(&cond_false_stack
, sym
);
503 delete_all_states_stree_stack_sym(&fake_cur_stree_stack
, sym
);
504 delete_all_states_stree_stack_sym(&break_stack
, sym
);
505 delete_all_states_stree_stack_sym(&fake_break_stack
, sym
);
506 delete_all_states_stree_stack_sym(&switch_stack
, sym
);
507 delete_all_states_stree_stack_sym(&continue_stack
, sym
);
510 * deleting from the goto stack is problematic because we don't know
511 * if the label is in scope and also we need the value for --two-passes.
515 struct stree
*get_all_states_from_stree(int owner
, struct stree
*source
)
517 struct stree
*ret
= NULL
;
518 struct sm_state
*tmp
;
520 FOR_EACH_SM(source
, tmp
) {
521 if (tmp
->owner
== owner
)
522 avl_insert(&ret
, tmp
);
523 } END_FOR_EACH_SM(tmp
);
528 struct stree
*get_all_states_stree(int owner
)
530 return get_all_states_from_stree(owner
, cur_stree
);
533 struct stree
*__get_cur_stree(void)
538 int is_reachable(void)
545 void set_true_false_states(int owner
, const char *name
, struct symbol
*sym
,
546 struct smatch_state
*true_state
,
547 struct smatch_state
*false_state
)
550 sm_perror("cur_stree is read only.");
552 if (debug_on(check_name(owner
), name
)) {
553 struct smatch_state
*tmp
;
555 tmp
= __get_state(owner
, name
, sym
);
556 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
557 check_name(owner
), name
, show_state(tmp
),
558 show_state(true_state
), show_state(false_state
));
564 if (!cond_false_stack
|| !cond_true_stack
) {
565 sm_perror("missing true/false stacks");
570 set_state_stree_stack(&cond_true_stack
, owner
, name
, sym
, true_state
);
572 set_state_stree_stack(&cond_false_stack
, owner
, name
, sym
, false_state
);
575 void set_true_false_states_expr(int owner
, struct expression
*expr
,
576 struct smatch_state
*true_state
,
577 struct smatch_state
*false_state
)
582 expr
= strip_expr(expr
);
583 name
= expr_to_var_sym(expr
, &sym
);
586 set_true_false_states(owner
, name
, sym
, true_state
, false_state
);
591 void __set_true_false_sm(struct sm_state
*true_sm
, struct sm_state
*false_sm
)
597 if (!true_sm
&& !false_sm
)
603 owner
= true_sm
? true_sm
->owner
: false_sm
->owner
;
604 name
= true_sm
? true_sm
->name
: false_sm
->name
;
605 sym
= true_sm
? true_sm
->sym
: false_sm
->sym
;
606 if (debug_on(check_name(owner
), name
)) {
607 struct smatch_state
*tmp
;
609 tmp
= __get_state(owner
, name
, sym
);
610 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
611 check_name(owner
), name
, show_state(tmp
),
612 show_state(true_sm
? true_sm
->state
: NULL
),
613 show_state(false_sm
? false_sm
->state
: NULL
));
616 if (!cond_false_stack
|| !cond_true_stack
) {
617 sm_perror("missing true/false stacks");
622 overwrite_sm_state_stree_stack(&cond_true_stack
, true_sm
);
624 overwrite_sm_state_stree_stack(&cond_false_stack
, false_sm
);
627 void nullify_path(void)
629 if (fake_cur_stree_stack
) {
630 __free_fake_cur_stree();
631 __push_fake_cur_stree();
633 free_stree(&cur_stree
);
636 void __match_nullify_path_hook(const char *fn
, struct expression
*expr
,
643 * At the start of every function we mark the path
644 * as unnull. That way there is always at least one state
645 * in the cur_stree until nullify_path is called. This
646 * is used in merge_slist() for the first null check.
648 void __unnullify_path(void)
651 set_state(-1, "unnull_path", NULL
, &true_state
);
654 int __path_is_null(void)
661 static void check_stree_stack_free(struct stree_stack
**stack
)
664 sm_perror("stack not empty");
665 free_stack_and_strees(stack
);
669 void save_all_states(void)
671 __add_ptr_list(&backup
, cur_stree
);
674 __add_ptr_list(&backup
, true_stack
);
676 __add_ptr_list(&backup
, false_stack
);
678 __add_ptr_list(&backup
, pre_cond_stack
);
679 pre_cond_stack
= NULL
;
681 __add_ptr_list(&backup
, cond_true_stack
);
682 cond_true_stack
= NULL
;
683 __add_ptr_list(&backup
, cond_false_stack
);
684 cond_false_stack
= NULL
;
686 __add_ptr_list(&backup
, fake_cur_stree_stack
);
687 fake_cur_stree_stack
= NULL
;
689 __add_ptr_list(&backup
, break_stack
);
691 __add_ptr_list(&backup
, fake_break_stack
);
692 fake_break_stack
= NULL
;
694 __add_ptr_list(&backup
, switch_stack
);
696 __add_ptr_list(&backup
, remaining_cases
);
697 remaining_cases
= NULL
;
698 __add_ptr_list(&backup
, default_stack
);
699 default_stack
= NULL
;
700 __add_ptr_list(&backup
, continue_stack
);
701 continue_stack
= NULL
;
703 __add_ptr_list(&backup
, goto_stack
);
707 static void *pop_backup(void)
711 ret
= last_ptr_list(backup
);
712 delete_ptr_list_last(&backup
);
716 void restore_all_states(void)
718 goto_stack
= pop_backup();
720 continue_stack
= pop_backup();
721 default_stack
= pop_backup();
722 remaining_cases
= pop_backup();
723 switch_stack
= pop_backup();
724 fake_break_stack
= pop_backup();
725 break_stack
= pop_backup();
727 fake_cur_stree_stack
= pop_backup();
729 cond_false_stack
= pop_backup();
730 cond_true_stack
= pop_backup();
732 pre_cond_stack
= pop_backup();
733 false_stack
= pop_backup();
734 true_stack
= pop_backup();
736 cur_stree
= pop_backup();
739 void free_goto_stack(void)
741 struct named_stree
*named_stree
;
743 FOR_EACH_PTR(goto_stack
, named_stree
) {
744 free_stree(&named_stree
->stree
);
745 } END_FOR_EACH_PTR(named_stree
);
746 __free_ptr_list((struct ptr_list
**)&goto_stack
);
749 void clear_all_states(void)
752 check_stree_stack_free(&true_stack
);
753 check_stree_stack_free(&false_stack
);
754 check_stree_stack_free(&pre_cond_stack
);
755 check_stree_stack_free(&cond_true_stack
);
756 check_stree_stack_free(&cond_false_stack
);
757 check_stree_stack_free(&break_stack
);
758 check_stree_stack_free(&fake_break_stack
);
759 check_stree_stack_free(&switch_stack
);
760 check_stree_stack_free(&continue_stack
);
761 check_stree_stack_free(&fake_cur_stree_stack
);
765 free_every_single_sm_state();
766 free_tmp_expressions();
769 void __push_cond_stacks(void)
771 push_stree(&cond_true_stack
, NULL
);
772 push_stree(&cond_false_stack
, NULL
);
773 __push_fake_cur_stree();
776 void __fold_in_set_states(void)
778 struct stree
*new_states
;
781 new_states
= __pop_fake_cur_stree();
782 FOR_EACH_SM(new_states
, sm
) {
784 __set_true_false_sm(sm
, sm
);
785 } END_FOR_EACH_SM(sm
);
786 free_stree(&new_states
);
789 void __free_set_states(void)
791 struct stree
*new_states
;
793 new_states
= __pop_fake_cur_stree();
794 free_stree(&new_states
);
797 struct stree
*__copy_cond_true_states(void)
801 ret
= pop_stree(&cond_true_stack
);
802 push_stree(&cond_true_stack
, clone_stree(ret
));
806 struct stree
*__copy_cond_false_states(void)
810 ret
= pop_stree(&cond_false_stack
);
811 push_stree(&cond_false_stack
, clone_stree(ret
));
815 struct stree
*__pop_cond_true_stack(void)
817 return pop_stree(&cond_true_stack
);
820 struct stree
*__pop_cond_false_stack(void)
822 return pop_stree(&cond_false_stack
);
826 * This combines the pre cond states with either the true or false states.
828 * a = kmalloc() ; if (a !! foo(a)
829 * In the pre state a is possibly null. In the true state it is non null.
830 * In the false state it is null. Combine the pre and the false to get
831 * that when we call 'foo', 'a' is null.
833 static void __use_cond_stack(struct stree_stack
**stack
)
837 free_stree(&cur_stree
);
839 cur_stree
= pop_stree(&pre_cond_stack
);
840 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
842 stree
= pop_stree(stack
);
843 overwrite_stree(stree
, &cur_stree
);
844 push_stree(stack
, stree
);
847 void __use_pre_cond_states(void)
849 free_stree(&cur_stree
);
850 cur_stree
= pop_stree(&pre_cond_stack
);
853 void __use_cond_true_states(void)
855 __use_cond_stack(&cond_true_stack
);
858 void __use_cond_false_states(void)
860 __use_cond_stack(&cond_false_stack
);
863 void __negate_cond_stacks(void)
865 struct stree
*old_false
, *old_true
;
867 old_false
= pop_stree(&cond_false_stack
);
868 old_true
= pop_stree(&cond_true_stack
);
869 push_stree(&cond_false_stack
, old_true
);
870 push_stree(&cond_true_stack
, old_false
);
873 void __and_cond_states(void)
875 and_stree_stack(&cond_true_stack
);
876 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_false_stack
);
879 void __or_cond_states(void)
881 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_true_stack
);
882 and_stree_stack(&cond_false_stack
);
885 void __save_pre_cond_states(void)
887 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
890 void __discard_pre_cond_states(void)
894 tmp
= pop_stree(&pre_cond_stack
);
898 struct stree
*__get_true_states(void)
900 return clone_stree(top_stree(cond_true_stack
));
903 struct stree
*__get_false_states(void)
905 return clone_stree(top_stree(cond_false_stack
));
908 void __use_cond_states(void)
910 struct stree
*pre
, *pre_clone
, *true_states
, *false_states
;
912 pre
= pop_stree(&pre_cond_stack
);
913 pre_clone
= clone_stree(pre
);
915 true_states
= pop_stree(&cond_true_stack
);
916 overwrite_stree(true_states
, &pre
);
917 free_stree(&true_states
);
918 /* we use the true states right away */
919 free_stree(&cur_stree
);
922 false_states
= pop_stree(&cond_false_stack
);
923 overwrite_stree(false_states
, &pre_clone
);
924 free_stree(&false_states
);
925 push_stree(&false_stack
, pre_clone
);
928 void __push_true_states(void)
930 push_stree(&true_stack
, clone_stree(cur_stree
));
933 void __use_false_states(void)
935 free_stree(&cur_stree
);
936 cur_stree
= pop_stree(&false_stack
);
939 void __discard_false_states(void)
943 stree
= pop_stree(&false_stack
);
947 void __merge_false_states(void)
951 stree
= pop_stree(&false_stack
);
952 merge_stree(&cur_stree
, stree
);
957 * This function probably seemed common sensical when I wrote it but, oh wow,
958 * does it look subtle in retrospect. Say we set a state on one side of the if
959 * else path but not on the other, then what we should record in the fake stree
960 * is the merged state.
962 * This function relies on the fact that the we always set the cur_stree as well
963 * and we already have the infrastructure to merge things correctly into the
966 * So instead of merging fake strees together which is probably a lot of work,
967 * we just use it as a list of set states and look up the actual current values
971 static void update_stree_with_merged(struct stree
**stree
)
973 struct state_list
*slist
= NULL
;
974 struct sm_state
*sm
, *new;
976 FOR_EACH_SM(*stree
, sm
) {
977 new = get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
978 if (!new) /* This can happen if we go out of scope */
980 add_ptr_list(&slist
, new);
981 } END_FOR_EACH_SM(sm
);
983 FOR_EACH_PTR(slist
, sm
) {
984 overwrite_sm_state_stree(stree
, sm
);
985 } END_FOR_EACH_PTR(sm
);
990 static void update_fake_stree_with_merged(void)
994 if (!fake_cur_stree_stack
)
996 stree
= pop_stree(&fake_cur_stree_stack
);
997 update_stree_with_merged(&stree
);
998 push_stree(&fake_cur_stree_stack
, stree
);
1001 void __merge_true_states(void)
1003 struct stree
*stree
;
1005 stree
= pop_stree(&true_stack
);
1006 merge_stree(&cur_stree
, stree
);
1007 update_fake_stree_with_merged();
1011 void __push_continues(void)
1013 push_stree(&continue_stack
, NULL
);
1016 void __discard_continues(void)
1018 struct stree
*stree
;
1020 stree
= pop_stree(&continue_stack
);
1024 void __process_continues(void)
1026 struct stree
*stree
;
1028 stree
= pop_stree(&continue_stack
);
1030 stree
= clone_stree(cur_stree
);
1032 merge_stree(&stree
, cur_stree
);
1034 push_stree(&continue_stack
, stree
);
1037 void __merge_continues(void)
1039 struct stree
*stree
;
1041 stree
= pop_stree(&continue_stack
);
1042 merge_stree(&cur_stree
, stree
);
1046 void __push_breaks(void)
1048 push_stree(&break_stack
, NULL
);
1049 if (fake_cur_stree_stack
)
1050 push_stree(&fake_break_stack
, NULL
);
1053 void __process_breaks(void)
1055 struct stree
*stree
;
1057 stree
= pop_stree(&break_stack
);
1059 stree
= clone_stree(cur_stree
);
1061 merge_stree(&stree
, cur_stree
);
1062 push_stree(&break_stack
, stree
);
1064 if (!fake_cur_stree_stack
)
1067 stree
= pop_stree(&fake_break_stack
);
1069 stree
= clone_stree(top_stree(fake_cur_stree_stack
));
1071 merge_stree(&stree
, top_stree(fake_cur_stree_stack
));
1072 push_stree(&fake_break_stack
, stree
);
1075 int __has_breaks(void)
1077 struct stree
*stree
;
1080 stree
= pop_stree(&break_stack
);
1082 push_stree(&break_stack
, stree
);
1086 void __merge_breaks(void)
1088 struct stree
*stree
;
1089 struct sm_state
*sm
;
1091 stree
= pop_stree(&break_stack
);
1092 merge_stree(&cur_stree
, stree
);
1095 if (!fake_cur_stree_stack
)
1098 stree
= pop_stree(&fake_break_stack
);
1099 update_stree_with_merged(&stree
);
1100 FOR_EACH_SM(stree
, sm
) {
1101 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1102 } END_FOR_EACH_SM(sm
);
1106 void __use_breaks(void)
1108 struct stree
*stree
;
1109 struct sm_state
*sm
;
1111 free_stree(&cur_stree
);
1112 cur_stree
= pop_stree(&break_stack
);
1114 if (!fake_cur_stree_stack
)
1116 stree
= pop_stree(&fake_break_stack
);
1117 FOR_EACH_SM(stree
, sm
) {
1118 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1119 } END_FOR_EACH_SM(sm
);
1125 void __save_switch_states(struct expression
*switch_expr
)
1127 struct range_list
*rl
;
1129 get_absolute_rl(switch_expr
, &rl
);
1131 push_rl(&remaining_cases
, rl
);
1132 push_stree(&switch_stack
, clone_stree(cur_stree
));
1135 int have_remaining_cases(void)
1137 return !!top_rl(remaining_cases
);
1140 void __merge_switches(struct expression
*switch_expr
, struct range_list
*case_rl
)
1142 struct stree
*stree
;
1143 struct stree
*implied_stree
;
1145 stree
= pop_stree(&switch_stack
);
1148 * If the cur_stree was NULL before the start of the switch
1149 * statement then we don't want to unnullify it.
1152 push_stree(&switch_stack
, stree
);
1155 implied_stree
= __implied_case_stree(switch_expr
, case_rl
, &remaining_cases
, &stree
);
1156 merge_stree(&cur_stree
, implied_stree
);
1157 free_stree(&implied_stree
);
1158 push_stree(&switch_stack
, stree
);
1161 void __discard_switches(void)
1163 struct stree
*stree
;
1165 pop_rl(&remaining_cases
);
1166 stree
= pop_stree(&switch_stack
);
1170 void __push_default(void)
1172 push_stree(&default_stack
, NULL
);
1175 void __set_default(void)
1177 set_state_stree_stack(&default_stack
, 0, "has_default", NULL
, &true_state
);
1180 int __pop_default(void)
1182 struct stree
*stree
;
1184 stree
= pop_stree(&default_stack
);
1192 static struct named_stree
*alloc_named_stree(const char *name
, struct symbol
*sym
, struct stree
*stree
)
1194 struct named_stree
*named_stree
= __alloc_named_stree(0);
1196 named_stree
->name
= (char *)name
;
1197 named_stree
->stree
= stree
;
1198 named_stree
->sym
= sym
;
1202 void __save_gotos(const char *name
, struct symbol
*sym
)
1204 struct stree
**stree
;
1205 struct stree
*clone
;
1207 stree
= get_named_stree(goto_stack
, name
, sym
);
1209 merge_stree(stree
, cur_stree
);
1212 struct named_stree
*named_stree
;
1214 clone
= clone_stree(cur_stree
);
1215 named_stree
= alloc_named_stree(name
, sym
, clone
);
1216 add_ptr_list(&goto_stack
, named_stree
);
1220 void __merge_gotos(const char *name
, struct symbol
*sym
)
1222 struct stree
**stree
;
1224 stree
= get_named_stree(goto_stack
, name
, sym
);
1226 merge_stree(&cur_stree
, *stree
);
1229 void __discard_fake_states(struct expression
*call
)
1231 struct stree
*new = NULL
;
1232 struct sm_state
*sm
;
1236 if (__fake_state_cnt
== 0)
1240 * This is just a best effort type of thing. There could be
1241 * fake states in the true/false trees already. They might
1242 * eventually get cleared out too because we call after probably
1243 * 50% of function calls. But the point is that I don't want to
1244 * waste resources tracking them.
1246 FOR_EACH_SM(cur_stree
, sm
) {
1248 len
= snprintf(buf
, sizeof(buf
), "__fake_param_%p_", call
);
1249 if (strncmp(sm
->name
, buf
, len
) != 0)
1250 avl_insert(&new, sm
);
1253 if (strncmp(sm
->name
, "__fake_param_", 13) != 0)
1254 avl_insert(&new, sm
);
1255 } END_FOR_EACH_SM(sm
);
1257 free_stree(&cur_stree
);
1259 __fake_state_cnt
= 0;