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 bool has_possible_state(int owner
, const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
405 sm
= get_sm_state(owner
, name
, sym
);
409 return slist_has_state(sm
->possible
, state
);
412 bool expr_has_possible_state(int owner
, struct expression
*expr
, struct smatch_state
*state
)
416 sm
= get_sm_state_expr(owner
, expr
);
420 return slist_has_state(sm
->possible
, state
);
423 struct state_list
*get_possible_states(int owner
, const char *name
, struct symbol
*sym
)
425 struct sm_state
*sms
;
427 sms
= get_sm_state_stree(cur_stree
, owner
, name
, sym
);
429 return sms
->possible
;
433 struct state_list
*get_possible_states_expr(int owner
, struct expression
*expr
)
437 struct state_list
*ret
= NULL
;
439 expr
= strip_expr(expr
);
440 name
= expr_to_var_sym(expr
, &sym
);
443 ret
= get_possible_states(owner
, name
, sym
);
449 struct sm_state
*get_sm_state(int owner
, const char *name
, struct symbol
*sym
)
451 struct sm_state
*ret
;
453 ret
= get_sm_state_stree(fast_overlay
, owner
, name
, sym
);
457 return get_sm_state_stree(cur_stree
, owner
, name
, sym
);
460 struct sm_state
*get_sm_state_expr(int owner
, struct expression
*expr
)
464 struct sm_state
*ret
= NULL
;
466 expr
= strip_expr(expr
);
467 name
= expr_to_var_sym(expr
, &sym
);
470 ret
= get_sm_state(owner
, name
, sym
);
476 void __delete_state(int owner
, const char *name
, struct symbol
*sym
)
478 delete_state_stree(&cur_stree
, owner
, name
, sym
);
479 if (cond_true_stack
) {
480 delete_state_stree_stack(&pre_cond_stack
, owner
, name
, sym
);
481 delete_state_stree_stack(&cond_true_stack
, owner
, name
, sym
);
482 delete_state_stree_stack(&cond_false_stack
, owner
, name
, sym
);
486 static void delete_all_states_stree_sym(struct stree
**stree
, struct symbol
*sym
)
488 struct state_list
*slist
= NULL
;
491 FOR_EACH_SM(*stree
, sm
) {
493 add_ptr_list(&slist
, sm
);
494 } END_FOR_EACH_SM(sm
);
496 FOR_EACH_PTR(slist
, sm
) {
497 delete_state_stree(stree
, sm
->owner
, sm
->name
, sm
->sym
);
498 } END_FOR_EACH_PTR(sm
);
503 static void delete_all_states_stree_stack_sym(struct stree_stack
**stack
, struct symbol
*sym
)
510 stree
= pop_stree(stack
);
511 delete_all_states_stree_sym(&stree
, sym
);
512 push_stree(stack
, stree
);
515 void __delete_all_states_sym(struct symbol
*sym
)
517 delete_all_states_stree_sym(&cur_stree
, sym
);
519 delete_all_states_stree_stack_sym(&true_stack
, sym
);
520 delete_all_states_stree_stack_sym(&true_stack
, sym
);
521 delete_all_states_stree_stack_sym(&false_stack
, sym
);
522 delete_all_states_stree_stack_sym(&pre_cond_stack
, sym
);
523 delete_all_states_stree_stack_sym(&cond_true_stack
, sym
);
524 delete_all_states_stree_stack_sym(&cond_false_stack
, sym
);
525 delete_all_states_stree_stack_sym(&fake_cur_stree_stack
, sym
);
526 delete_all_states_stree_stack_sym(&break_stack
, sym
);
527 delete_all_states_stree_stack_sym(&fake_break_stack
, sym
);
528 delete_all_states_stree_stack_sym(&switch_stack
, sym
);
529 delete_all_states_stree_stack_sym(&continue_stack
, sym
);
532 * deleting from the goto stack is problematic because we don't know
533 * if the label is in scope and also we need the value for --two-passes.
537 struct stree
*get_all_states_from_stree(int owner
, struct stree
*source
)
539 struct stree
*ret
= NULL
;
540 struct sm_state
*tmp
;
542 FOR_EACH_SM(source
, tmp
) {
543 if (tmp
->owner
== owner
)
544 avl_insert(&ret
, tmp
);
545 } END_FOR_EACH_SM(tmp
);
550 struct stree
*get_all_states_stree(int owner
)
552 return get_all_states_from_stree(owner
, cur_stree
);
555 struct stree
*__get_cur_stree(void)
560 int is_reachable(void)
567 void set_true_false_states(int owner
, const char *name
, struct symbol
*sym
,
568 struct smatch_state
*true_state
,
569 struct smatch_state
*false_state
)
572 sm_perror("cur_stree is read only.");
574 if (debug_on(check_name(owner
), name
)) {
575 struct smatch_state
*tmp
;
577 tmp
= __get_state(owner
, name
, sym
);
578 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
579 check_name(owner
), name
, show_state(tmp
),
580 show_state(true_state
), show_state(false_state
));
586 if (!cond_false_stack
|| !cond_true_stack
) {
587 sm_perror("missing true/false stacks");
592 set_state_stree_stack(&cond_true_stack
, owner
, name
, sym
, true_state
);
594 set_state_stree_stack(&cond_false_stack
, owner
, name
, sym
, false_state
);
597 void set_true_false_states_expr(int owner
, struct expression
*expr
,
598 struct smatch_state
*true_state
,
599 struct smatch_state
*false_state
)
604 expr
= strip_expr(expr
);
605 name
= expr_to_var_sym(expr
, &sym
);
608 set_true_false_states(owner
, name
, sym
, true_state
, false_state
);
613 void __set_true_false_sm(struct sm_state
*true_sm
, struct sm_state
*false_sm
)
619 if (!true_sm
&& !false_sm
)
625 owner
= true_sm
? true_sm
->owner
: false_sm
->owner
;
626 name
= true_sm
? true_sm
->name
: false_sm
->name
;
627 sym
= true_sm
? true_sm
->sym
: false_sm
->sym
;
628 if (debug_on(check_name(owner
), name
)) {
629 struct smatch_state
*tmp
;
631 tmp
= __get_state(owner
, name
, sym
);
632 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
633 check_name(owner
), name
, show_state(tmp
),
634 show_state(true_sm
? true_sm
->state
: NULL
),
635 show_state(false_sm
? false_sm
->state
: NULL
));
638 if (!cond_false_stack
|| !cond_true_stack
) {
639 sm_perror("missing true/false stacks");
644 overwrite_sm_state_stree_stack(&cond_true_stack
, true_sm
);
646 overwrite_sm_state_stree_stack(&cond_false_stack
, false_sm
);
649 void nullify_path(void)
651 if (fake_cur_stree_stack
) {
652 __free_fake_cur_stree();
653 __push_fake_cur_stree();
655 free_stree(&cur_stree
);
658 void __match_nullify_path_hook(const char *fn
, struct expression
*expr
,
665 * At the start of every function we mark the path
666 * as unnull. That way there is always at least one state
667 * in the cur_stree until nullify_path is called. This
668 * is used in merge_slist() for the first null check.
670 void __unnullify_path(void)
673 set_state(-1, "unnull_path", NULL
, &true_state
);
676 int __path_is_null(void)
683 static void check_stree_stack_free(struct stree_stack
**stack
)
686 sm_perror("stack not empty");
687 free_stack_and_strees(stack
);
691 void save_all_states(void)
693 __add_ptr_list(&backup
, cur_stree
);
696 __add_ptr_list(&backup
, true_stack
);
698 __add_ptr_list(&backup
, false_stack
);
700 __add_ptr_list(&backup
, pre_cond_stack
);
701 pre_cond_stack
= NULL
;
703 __add_ptr_list(&backup
, cond_true_stack
);
704 cond_true_stack
= NULL
;
705 __add_ptr_list(&backup
, cond_false_stack
);
706 cond_false_stack
= NULL
;
708 __add_ptr_list(&backup
, fake_cur_stree_stack
);
709 fake_cur_stree_stack
= NULL
;
711 __add_ptr_list(&backup
, break_stack
);
713 __add_ptr_list(&backup
, fake_break_stack
);
714 fake_break_stack
= NULL
;
716 __add_ptr_list(&backup
, switch_stack
);
718 __add_ptr_list(&backup
, remaining_cases
);
719 remaining_cases
= NULL
;
720 __add_ptr_list(&backup
, default_stack
);
721 default_stack
= NULL
;
722 __add_ptr_list(&backup
, continue_stack
);
723 continue_stack
= NULL
;
725 __add_ptr_list(&backup
, goto_stack
);
729 static void *pop_backup(void)
733 ret
= last_ptr_list(backup
);
734 delete_ptr_list_last(&backup
);
738 void restore_all_states(void)
740 goto_stack
= pop_backup();
742 continue_stack
= pop_backup();
743 default_stack
= pop_backup();
744 remaining_cases
= pop_backup();
745 switch_stack
= pop_backup();
746 fake_break_stack
= pop_backup();
747 break_stack
= pop_backup();
749 fake_cur_stree_stack
= pop_backup();
751 cond_false_stack
= pop_backup();
752 cond_true_stack
= pop_backup();
754 pre_cond_stack
= pop_backup();
755 false_stack
= pop_backup();
756 true_stack
= pop_backup();
758 cur_stree
= pop_backup();
761 void free_goto_stack(void)
763 struct named_stree
*named_stree
;
765 FOR_EACH_PTR(goto_stack
, named_stree
) {
766 free_stree(&named_stree
->stree
);
767 } END_FOR_EACH_PTR(named_stree
);
768 __free_ptr_list((struct ptr_list
**)&goto_stack
);
771 void clear_all_states(void)
774 check_stree_stack_free(&true_stack
);
775 check_stree_stack_free(&false_stack
);
776 check_stree_stack_free(&pre_cond_stack
);
777 check_stree_stack_free(&cond_true_stack
);
778 check_stree_stack_free(&cond_false_stack
);
779 check_stree_stack_free(&break_stack
);
780 check_stree_stack_free(&fake_break_stack
);
781 check_stree_stack_free(&switch_stack
);
782 check_stree_stack_free(&continue_stack
);
783 check_stree_stack_free(&fake_cur_stree_stack
);
787 free_every_single_sm_state();
788 free_tmp_expressions();
791 void __push_cond_stacks(void)
793 push_stree(&cond_true_stack
, NULL
);
794 push_stree(&cond_false_stack
, NULL
);
795 __push_fake_cur_stree();
798 void __fold_in_set_states(void)
800 struct stree
*new_states
;
803 new_states
= __pop_fake_cur_stree();
804 FOR_EACH_SM(new_states
, sm
) {
806 __set_true_false_sm(sm
, sm
);
807 } END_FOR_EACH_SM(sm
);
808 free_stree(&new_states
);
811 void __free_set_states(void)
813 struct stree
*new_states
;
815 new_states
= __pop_fake_cur_stree();
816 free_stree(&new_states
);
819 struct stree
*__copy_cond_true_states(void)
823 ret
= pop_stree(&cond_true_stack
);
824 push_stree(&cond_true_stack
, clone_stree(ret
));
828 struct stree
*__copy_cond_false_states(void)
832 ret
= pop_stree(&cond_false_stack
);
833 push_stree(&cond_false_stack
, clone_stree(ret
));
837 struct stree
*__pop_cond_true_stack(void)
839 return pop_stree(&cond_true_stack
);
842 struct stree
*__pop_cond_false_stack(void)
844 return pop_stree(&cond_false_stack
);
848 * This combines the pre cond states with either the true or false states.
850 * a = kmalloc() ; if (a !! foo(a)
851 * In the pre state a is possibly null. In the true state it is non null.
852 * In the false state it is null. Combine the pre and the false to get
853 * that when we call 'foo', 'a' is null.
855 static void __use_cond_stack(struct stree_stack
**stack
)
859 free_stree(&cur_stree
);
861 cur_stree
= pop_stree(&pre_cond_stack
);
862 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
864 stree
= pop_stree(stack
);
865 overwrite_stree(stree
, &cur_stree
);
866 push_stree(stack
, stree
);
869 void __use_pre_cond_states(void)
871 free_stree(&cur_stree
);
872 cur_stree
= pop_stree(&pre_cond_stack
);
875 void __use_cond_true_states(void)
877 __use_cond_stack(&cond_true_stack
);
880 void __use_cond_false_states(void)
882 __use_cond_stack(&cond_false_stack
);
885 void __negate_cond_stacks(void)
887 struct stree
*old_false
, *old_true
;
889 old_false
= pop_stree(&cond_false_stack
);
890 old_true
= pop_stree(&cond_true_stack
);
891 push_stree(&cond_false_stack
, old_true
);
892 push_stree(&cond_true_stack
, old_false
);
895 void __and_cond_states(void)
897 and_stree_stack(&cond_true_stack
);
898 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_false_stack
);
901 void __or_cond_states(void)
903 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_true_stack
);
904 and_stree_stack(&cond_false_stack
);
907 void __save_pre_cond_states(void)
909 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
912 void __discard_pre_cond_states(void)
916 tmp
= pop_stree(&pre_cond_stack
);
920 struct stree
*__get_true_states(void)
922 return clone_stree(top_stree(cond_true_stack
));
925 struct stree
*__get_false_states(void)
927 return clone_stree(top_stree(cond_false_stack
));
930 void __use_cond_states(void)
932 struct stree
*pre
, *pre_clone
, *true_states
, *false_states
;
934 pre
= pop_stree(&pre_cond_stack
);
935 pre_clone
= clone_stree(pre
);
937 true_states
= pop_stree(&cond_true_stack
);
938 overwrite_stree(true_states
, &pre
);
939 free_stree(&true_states
);
940 /* we use the true states right away */
941 free_stree(&cur_stree
);
944 false_states
= pop_stree(&cond_false_stack
);
945 overwrite_stree(false_states
, &pre_clone
);
946 free_stree(&false_states
);
947 push_stree(&false_stack
, pre_clone
);
950 void __push_true_states(void)
952 push_stree(&true_stack
, clone_stree(cur_stree
));
955 void __use_false_states(void)
957 free_stree(&cur_stree
);
958 cur_stree
= pop_stree(&false_stack
);
961 void __discard_false_states(void)
965 stree
= pop_stree(&false_stack
);
969 void __merge_false_states(void)
973 stree
= pop_stree(&false_stack
);
974 merge_stree(&cur_stree
, stree
);
979 * This function probably seemed common sensical when I wrote it but, oh wow,
980 * does it look subtle in retrospect. Say we set a state on one side of the if
981 * else path but not on the other, then what we should record in the fake stree
982 * is the merged state.
984 * This function relies on the fact that the we always set the cur_stree as well
985 * and we already have the infrastructure to merge things correctly into the
988 * So instead of merging fake strees together which is probably a lot of work,
989 * we just use it as a list of set states and look up the actual current values
993 static void update_stree_with_merged(struct stree
**stree
)
995 struct state_list
*slist
= NULL
;
996 struct sm_state
*sm
, *new;
998 FOR_EACH_SM(*stree
, sm
) {
999 new = get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
1000 if (!new) /* This can happen if we go out of scope */
1002 add_ptr_list(&slist
, new);
1003 } END_FOR_EACH_SM(sm
);
1005 FOR_EACH_PTR(slist
, sm
) {
1006 overwrite_sm_state_stree(stree
, sm
);
1007 } END_FOR_EACH_PTR(sm
);
1012 static void update_fake_stree_with_merged(void)
1014 struct stree
*stree
;
1016 if (!fake_cur_stree_stack
)
1018 stree
= pop_stree(&fake_cur_stree_stack
);
1019 update_stree_with_merged(&stree
);
1020 push_stree(&fake_cur_stree_stack
, stree
);
1023 void __merge_true_states(void)
1025 struct stree
*stree
;
1027 stree
= pop_stree(&true_stack
);
1028 merge_stree(&cur_stree
, stree
);
1029 update_fake_stree_with_merged();
1033 void __push_continues(void)
1035 push_stree(&continue_stack
, NULL
);
1038 void __discard_continues(void)
1040 struct stree
*stree
;
1042 stree
= pop_stree(&continue_stack
);
1046 void __process_continues(void)
1048 struct stree
*stree
;
1050 stree
= pop_stree(&continue_stack
);
1052 stree
= clone_stree(cur_stree
);
1054 merge_stree(&stree
, cur_stree
);
1056 push_stree(&continue_stack
, stree
);
1059 void __merge_continues(void)
1061 struct stree
*stree
;
1063 stree
= pop_stree(&continue_stack
);
1064 merge_stree(&cur_stree
, stree
);
1068 void __push_breaks(void)
1070 push_stree(&break_stack
, NULL
);
1071 if (fake_cur_stree_stack
)
1072 push_stree(&fake_break_stack
, NULL
);
1075 void __process_breaks(void)
1077 struct stree
*stree
;
1079 stree
= pop_stree(&break_stack
);
1081 stree
= clone_stree(cur_stree
);
1083 merge_stree(&stree
, cur_stree
);
1084 push_stree(&break_stack
, stree
);
1086 if (!fake_cur_stree_stack
)
1089 stree
= pop_stree(&fake_break_stack
);
1091 stree
= clone_stree(top_stree(fake_cur_stree_stack
));
1093 merge_stree(&stree
, top_stree(fake_cur_stree_stack
));
1094 push_stree(&fake_break_stack
, stree
);
1097 int __has_breaks(void)
1099 struct stree
*stree
;
1102 stree
= pop_stree(&break_stack
);
1104 push_stree(&break_stack
, stree
);
1108 void __merge_breaks(void)
1110 struct stree
*stree
;
1111 struct sm_state
*sm
;
1113 stree
= pop_stree(&break_stack
);
1114 merge_stree(&cur_stree
, stree
);
1117 if (!fake_cur_stree_stack
)
1120 stree
= pop_stree(&fake_break_stack
);
1121 update_stree_with_merged(&stree
);
1122 FOR_EACH_SM(stree
, sm
) {
1123 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1124 } END_FOR_EACH_SM(sm
);
1128 void __use_breaks(void)
1130 struct stree
*stree
;
1131 struct sm_state
*sm
;
1133 free_stree(&cur_stree
);
1134 cur_stree
= pop_stree(&break_stack
);
1136 if (!fake_cur_stree_stack
)
1138 stree
= pop_stree(&fake_break_stack
);
1139 FOR_EACH_SM(stree
, sm
) {
1140 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1141 } END_FOR_EACH_SM(sm
);
1147 void __save_switch_states(struct expression
*switch_expr
)
1149 struct range_list
*rl
;
1151 get_absolute_rl(switch_expr
, &rl
);
1153 push_rl(&remaining_cases
, rl
);
1154 push_stree(&switch_stack
, clone_stree(cur_stree
));
1157 int have_remaining_cases(void)
1159 return !!top_rl(remaining_cases
);
1162 void __merge_switches(struct expression
*switch_expr
, struct range_list
*case_rl
)
1164 struct stree
*stree
;
1165 struct stree
*implied_stree
;
1167 stree
= pop_stree(&switch_stack
);
1170 * If the cur_stree was NULL before the start of the switch
1171 * statement then we don't want to unnullify it.
1174 push_stree(&switch_stack
, stree
);
1177 implied_stree
= __implied_case_stree(switch_expr
, case_rl
, &remaining_cases
, &stree
);
1178 merge_stree(&cur_stree
, implied_stree
);
1179 free_stree(&implied_stree
);
1180 push_stree(&switch_stack
, stree
);
1183 void __discard_switches(void)
1185 struct stree
*stree
;
1187 pop_rl(&remaining_cases
);
1188 stree
= pop_stree(&switch_stack
);
1192 void __push_default(void)
1194 push_stree(&default_stack
, NULL
);
1197 void __set_default(void)
1199 set_state_stree_stack(&default_stack
, 0, "has_default", NULL
, &true_state
);
1202 int __pop_default(void)
1204 struct stree
*stree
;
1206 stree
= pop_stree(&default_stack
);
1214 static struct named_stree
*alloc_named_stree(const char *name
, struct symbol
*sym
, struct stree
*stree
)
1216 struct named_stree
*named_stree
= __alloc_named_stree(0);
1218 named_stree
->name
= (char *)name
;
1219 named_stree
->stree
= stree
;
1220 named_stree
->sym
= sym
;
1224 void __save_gotos(const char *name
, struct symbol
*sym
)
1226 struct stree
**stree
;
1227 struct stree
*clone
;
1229 stree
= get_named_stree(goto_stack
, name
, sym
);
1231 merge_stree(stree
, cur_stree
);
1234 struct named_stree
*named_stree
;
1236 clone
= clone_stree(cur_stree
);
1237 named_stree
= alloc_named_stree(name
, sym
, clone
);
1238 add_ptr_list(&goto_stack
, named_stree
);
1242 void __merge_gotos(const char *name
, struct symbol
*sym
)
1244 struct stree
**stree
;
1246 stree
= get_named_stree(goto_stack
, name
, sym
);
1248 merge_stree(&cur_stree
, *stree
);
1251 void __discard_fake_states(struct expression
*call
)
1253 struct stree
*new = NULL
;
1254 struct sm_state
*sm
;
1258 if (__fake_state_cnt
== 0)
1262 * This is just a best effort type of thing. There could be
1263 * fake states in the true/false trees already. They might
1264 * eventually get cleared out too because we call after probably
1265 * 50% of function calls. But the point is that I don't want to
1266 * waste resources tracking them.
1268 FOR_EACH_SM(cur_stree
, sm
) {
1270 len
= snprintf(buf
, sizeof(buf
), "__fake_param_%p_", call
);
1271 if (strncmp(sm
->name
, buf
, len
) != 0)
1272 avl_insert(&new, sm
);
1275 if (strncmp(sm
->name
, "__fake_param_", 13) != 0)
1276 avl_insert(&new, sm
);
1277 } END_FOR_EACH_SM(sm
);
1279 free_stree(&cur_stree
);
1281 __fake_state_cnt
= 0;