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 struct sm_state
*set_state(int owner
, const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
153 struct sm_state
*ret
;
159 sm_perror("cur_stree is read only.");
161 if (option_debug
|| strcmp(check_name(owner
), option_debug_check
) == 0) {
162 struct smatch_state
*s
;
164 s
= __get_state(owner
, name
, sym
);
166 sm_msg("%s new [%s] '%s' %s", __func__
,
167 check_name(owner
), name
, show_state(state
));
169 sm_msg("%s change [%s] '%s' %s => %s",
170 __func__
, check_name(owner
), name
, show_state(s
),
174 call_tracker_hooks(owner
, name
, sym
, state
);
176 if (owner
!= -1 && unreachable())
179 if (fake_cur_stree_stack
)
180 set_state_stree_stack(&fake_cur_stree_stack
, owner
, name
, sym
, state
);
182 ret
= set_state_stree(&cur_stree
, owner
, name
, sym
, state
);
187 struct sm_state
*set_state_expr(int owner
, struct expression
*expr
, struct smatch_state
*state
)
191 struct sm_state
*ret
= NULL
;
193 expr
= strip_expr(expr
);
194 name
= expr_to_var_sym(expr
, &sym
);
197 ret
= set_state(owner
, name
, sym
, state
);
203 struct stree
*__swap_cur_stree(struct stree
*stree
)
205 struct stree
*orig
= cur_stree
;
211 void __push_fake_cur_stree(void)
213 push_stree(&fake_cur_stree_stack
, NULL
);
214 __save_pre_cond_states();
217 struct stree
*__pop_fake_cur_stree(void)
219 if (!fake_cur_stree_stack
)
220 sm_perror("popping too many fake cur strees.");
221 __use_pre_cond_states();
222 return pop_stree(&fake_cur_stree_stack
);
225 void __free_fake_cur_stree(void)
229 stree
= __pop_fake_cur_stree();
233 void __set_fake_cur_stree_fast(struct stree
*stree
)
236 sm_perror("cannot nest fast overlay");
239 fast_overlay
= stree
;
240 set_fast_math_only();
243 void __pop_fake_cur_stree_fast(void)
246 clear_fast_math_only();
249 void __merge_stree_into_cur(struct stree
*stree
)
252 struct sm_state
*orig
;
253 struct sm_state
*merged
;
255 FOR_EACH_SM(stree
, sm
) {
256 orig
= get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
258 merged
= merge_sm_states(orig
, sm
);
262 } END_FOR_EACH_SM(sm
);
265 void __set_sm(struct sm_state
*sm
)
268 sm_perror("cur_stree is read only.");
271 strcmp(check_name(sm
->owner
), option_debug_check
) == 0) {
272 struct smatch_state
*s
;
274 s
= __get_state(sm
->owner
, sm
->name
, sm
->sym
);
276 sm_msg("%s new %s", __func__
, show_sm(sm
));
278 sm_msg("%s change %s (was %s)", __func__
, show_sm(sm
),
285 if (fake_cur_stree_stack
)
286 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
288 overwrite_sm_state_stree(&cur_stree
, sm
);
291 void __set_sm_cur_stree(struct sm_state
*sm
)
294 sm_perror("cur_stree is read only.");
297 strcmp(check_name(sm
->owner
), option_debug_check
) == 0) {
298 struct smatch_state
*s
;
300 s
= __get_state(sm
->owner
, sm
->name
, sm
->sym
);
302 sm_msg("%s new %s", __func__
, show_sm(sm
));
304 sm_msg("%s change %s (was %s)",
305 __func__
, show_sm(sm
), show_state(s
));
311 overwrite_sm_state_stree(&cur_stree
, sm
);
314 void __set_sm_fake_stree(struct sm_state
*sm
)
317 sm_perror("cur_stree is read only.");
320 strcmp(check_name(sm
->owner
), option_debug_check
) == 0) {
321 struct smatch_state
*s
;
323 s
= __get_state(sm
->owner
, sm
->name
, sm
->sym
);
325 sm_msg("%s new %s", __func__
, show_sm(sm
));
327 sm_msg("%s change %s (was %s)",
328 __func__
, show_sm(sm
), show_state(s
));
334 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
338 typedef void (get_state_hook
)(int owner
, const char *name
, struct symbol
*sym
);
339 DECLARE_PTR_LIST(fn_list
, get_state_hook
*);
340 static struct fn_list
*get_state_hooks
;
342 void add_get_state_hook(get_state_hook
*fn
)
344 get_state_hook
**p
= malloc(sizeof(get_state_hook
*));
346 add_ptr_list(&get_state_hooks
, p
);
349 static void call_get_state_hooks(int owner
, const char *name
, struct symbol
*sym
)
351 static int recursion
;
358 FOR_EACH_PTR(get_state_hooks
, fn
) {
359 (*fn
)(owner
, name
, sym
);
360 } END_FOR_EACH_PTR(fn
);
365 bool has_states(int owner
)
367 if (owner
< 0 || owner
>= USHRT_MAX
)
371 return cur_stree
->has_states
[owner
];
374 struct smatch_state
*__get_state(int owner
, const char *name
, struct symbol
*sym
)
378 sm
= get_sm_state(owner
, name
, sym
);
384 struct smatch_state
*get_state(int owner
, const char *name
, struct symbol
*sym
)
386 call_get_state_hooks(owner
, name
, sym
);
388 return __get_state(owner
, name
, sym
);
391 struct smatch_state
*get_state_expr(int owner
, struct expression
*expr
)
395 struct smatch_state
*ret
= NULL
;
397 expr
= strip_expr(expr
);
398 name
= expr_to_var_sym(expr
, &sym
);
401 ret
= get_state(owner
, name
, sym
);
407 struct state_list
*get_possible_states(int owner
, const char *name
, struct symbol
*sym
)
409 struct sm_state
*sms
;
411 sms
= get_sm_state_stree(cur_stree
, owner
, name
, sym
);
413 return sms
->possible
;
417 struct state_list
*get_possible_states_expr(int owner
, struct expression
*expr
)
421 struct state_list
*ret
= NULL
;
423 expr
= strip_expr(expr
);
424 name
= expr_to_var_sym(expr
, &sym
);
427 ret
= get_possible_states(owner
, name
, sym
);
433 struct sm_state
*get_sm_state(int owner
, const char *name
, struct symbol
*sym
)
435 struct sm_state
*ret
;
437 ret
= get_sm_state_stree(fast_overlay
, owner
, name
, sym
);
441 return get_sm_state_stree(cur_stree
, owner
, name
, sym
);
444 struct sm_state
*get_sm_state_expr(int owner
, struct expression
*expr
)
448 struct sm_state
*ret
= NULL
;
450 expr
= strip_expr(expr
);
451 name
= expr_to_var_sym(expr
, &sym
);
454 ret
= get_sm_state(owner
, name
, sym
);
460 void delete_state(int owner
, const char *name
, struct symbol
*sym
)
462 delete_state_stree(&cur_stree
, owner
, name
, sym
);
463 if (cond_true_stack
) {
464 delete_state_stree_stack(&pre_cond_stack
, owner
, name
, sym
);
465 delete_state_stree_stack(&cond_true_stack
, owner
, name
, sym
);
466 delete_state_stree_stack(&cond_false_stack
, owner
, name
, sym
);
470 void delete_state_expr(int owner
, struct expression
*expr
)
475 expr
= strip_expr(expr
);
476 name
= expr_to_var_sym(expr
, &sym
);
479 delete_state(owner
, name
, sym
);
484 static void delete_all_states_stree_sym(struct stree
**stree
, struct symbol
*sym
)
486 struct state_list
*slist
= NULL
;
489 FOR_EACH_SM(*stree
, sm
) {
491 add_ptr_list(&slist
, sm
);
492 } END_FOR_EACH_SM(sm
);
494 FOR_EACH_PTR(slist
, sm
) {
495 delete_state_stree(stree
, sm
->owner
, sm
->name
, sm
->sym
);
496 } END_FOR_EACH_PTR(sm
);
501 static void delete_all_states_stree_stack_sym(struct stree_stack
**stack
, struct symbol
*sym
)
508 stree
= pop_stree(stack
);
509 delete_all_states_stree_sym(&stree
, sym
);
510 push_stree(stack
, stree
);
513 void __delete_all_states_sym(struct symbol
*sym
)
515 delete_all_states_stree_sym(&cur_stree
, sym
);
517 delete_all_states_stree_stack_sym(&true_stack
, sym
);
518 delete_all_states_stree_stack_sym(&true_stack
, sym
);
519 delete_all_states_stree_stack_sym(&false_stack
, sym
);
520 delete_all_states_stree_stack_sym(&pre_cond_stack
, sym
);
521 delete_all_states_stree_stack_sym(&cond_true_stack
, sym
);
522 delete_all_states_stree_stack_sym(&cond_false_stack
, sym
);
523 delete_all_states_stree_stack_sym(&fake_cur_stree_stack
, sym
);
524 delete_all_states_stree_stack_sym(&break_stack
, sym
);
525 delete_all_states_stree_stack_sym(&fake_break_stack
, sym
);
526 delete_all_states_stree_stack_sym(&switch_stack
, sym
);
527 delete_all_states_stree_stack_sym(&continue_stack
, sym
);
530 * deleting from the goto stack is problematic because we don't know
531 * if the label is in scope and also we need the value for --two-passes.
535 struct stree
*get_all_states_from_stree(int owner
, struct stree
*source
)
537 struct stree
*ret
= NULL
;
538 struct sm_state
*tmp
;
540 FOR_EACH_SM(source
, tmp
) {
541 if (tmp
->owner
== owner
)
542 avl_insert(&ret
, tmp
);
543 } END_FOR_EACH_SM(tmp
);
548 struct stree
*get_all_states_stree(int owner
)
550 return get_all_states_from_stree(owner
, cur_stree
);
553 struct stree
*__get_cur_stree(void)
558 int is_reachable(void)
565 void set_true_false_states(int owner
, const char *name
, struct symbol
*sym
,
566 struct smatch_state
*true_state
,
567 struct smatch_state
*false_state
)
570 sm_perror("cur_stree is read only.");
572 if (option_debug
|| strcmp(check_name(owner
), option_debug_check
) == 0) {
573 struct smatch_state
*tmp
;
575 tmp
= __get_state(owner
, name
, sym
);
576 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
577 check_name(owner
), name
, show_state(tmp
),
578 show_state(true_state
), show_state(false_state
));
584 if (!cond_false_stack
|| !cond_true_stack
) {
585 sm_perror("missing true/false stacks");
590 set_state_stree_stack(&cond_true_stack
, owner
, name
, sym
, true_state
);
592 set_state_stree_stack(&cond_false_stack
, owner
, name
, sym
, false_state
);
595 void set_true_false_states_expr(int owner
, struct expression
*expr
,
596 struct smatch_state
*true_state
,
597 struct smatch_state
*false_state
)
602 expr
= strip_expr(expr
);
603 name
= expr_to_var_sym(expr
, &sym
);
606 set_true_false_states(owner
, name
, sym
, true_state
, false_state
);
611 void __set_true_false_sm(struct sm_state
*true_sm
, struct sm_state
*false_sm
)
617 if (!true_sm
&& !false_sm
)
623 owner
= true_sm
? true_sm
->owner
: false_sm
->owner
;
624 name
= true_sm
? true_sm
->name
: false_sm
->name
;
625 sym
= true_sm
? true_sm
->sym
: false_sm
->sym
;
626 if (option_debug
|| strcmp(check_name(owner
), option_debug_check
) == 0) {
627 struct smatch_state
*tmp
;
629 tmp
= __get_state(owner
, name
, sym
);
630 sm_msg("%s [%s] '%s'. Was %s. Now T:%s F:%s", __func__
,
631 check_name(owner
), name
, show_state(tmp
),
632 show_state(true_sm
? true_sm
->state
: NULL
),
633 show_state(false_sm
? false_sm
->state
: NULL
));
636 if (!cond_false_stack
|| !cond_true_stack
) {
637 sm_perror("missing true/false stacks");
642 overwrite_sm_state_stree_stack(&cond_true_stack
, true_sm
);
644 overwrite_sm_state_stree_stack(&cond_false_stack
, false_sm
);
647 void nullify_path(void)
649 if (fake_cur_stree_stack
) {
650 __free_fake_cur_stree();
651 __push_fake_cur_stree();
653 free_stree(&cur_stree
);
656 void __match_nullify_path_hook(const char *fn
, struct expression
*expr
,
663 * At the start of every function we mark the path
664 * as unnull. That way there is always at least one state
665 * in the cur_stree until nullify_path is called. This
666 * is used in merge_slist() for the first null check.
668 void __unnullify_path(void)
671 set_state(-1, "unnull_path", NULL
, &true_state
);
674 int __path_is_null(void)
681 static void check_stree_stack_free(struct stree_stack
**stack
)
684 sm_perror("stack not empty");
685 free_stack_and_strees(stack
);
689 void save_all_states(void)
691 __add_ptr_list(&backup
, cur_stree
);
694 __add_ptr_list(&backup
, true_stack
);
696 __add_ptr_list(&backup
, false_stack
);
698 __add_ptr_list(&backup
, pre_cond_stack
);
699 pre_cond_stack
= NULL
;
701 __add_ptr_list(&backup
, cond_true_stack
);
702 cond_true_stack
= NULL
;
703 __add_ptr_list(&backup
, cond_false_stack
);
704 cond_false_stack
= NULL
;
706 __add_ptr_list(&backup
, fake_cur_stree_stack
);
707 fake_cur_stree_stack
= NULL
;
709 __add_ptr_list(&backup
, break_stack
);
711 __add_ptr_list(&backup
, fake_break_stack
);
712 fake_break_stack
= NULL
;
714 __add_ptr_list(&backup
, switch_stack
);
716 __add_ptr_list(&backup
, remaining_cases
);
717 remaining_cases
= NULL
;
718 __add_ptr_list(&backup
, default_stack
);
719 default_stack
= NULL
;
720 __add_ptr_list(&backup
, continue_stack
);
721 continue_stack
= NULL
;
723 __add_ptr_list(&backup
, goto_stack
);
727 static void *pop_backup(void)
731 ret
= last_ptr_list(backup
);
732 delete_ptr_list_last(&backup
);
736 void restore_all_states(void)
738 goto_stack
= pop_backup();
740 continue_stack
= pop_backup();
741 default_stack
= pop_backup();
742 remaining_cases
= pop_backup();
743 switch_stack
= pop_backup();
744 fake_break_stack
= pop_backup();
745 break_stack
= pop_backup();
747 fake_cur_stree_stack
= pop_backup();
749 cond_false_stack
= pop_backup();
750 cond_true_stack
= pop_backup();
752 pre_cond_stack
= pop_backup();
753 false_stack
= pop_backup();
754 true_stack
= pop_backup();
756 cur_stree
= pop_backup();
759 void free_goto_stack(void)
761 struct named_stree
*named_stree
;
763 FOR_EACH_PTR(goto_stack
, named_stree
) {
764 free_stree(&named_stree
->stree
);
765 } END_FOR_EACH_PTR(named_stree
);
766 __free_ptr_list((struct ptr_list
**)&goto_stack
);
769 void clear_all_states(void)
772 check_stree_stack_free(&true_stack
);
773 check_stree_stack_free(&false_stack
);
774 check_stree_stack_free(&pre_cond_stack
);
775 check_stree_stack_free(&cond_true_stack
);
776 check_stree_stack_free(&cond_false_stack
);
777 check_stree_stack_free(&break_stack
);
778 check_stree_stack_free(&fake_break_stack
);
779 check_stree_stack_free(&switch_stack
);
780 check_stree_stack_free(&continue_stack
);
781 check_stree_stack_free(&fake_cur_stree_stack
);
785 free_every_single_sm_state();
786 free_tmp_expressions();
789 void __push_cond_stacks(void)
791 push_stree(&cond_true_stack
, NULL
);
792 push_stree(&cond_false_stack
, NULL
);
793 __push_fake_cur_stree();
796 void __fold_in_set_states(void)
798 struct stree
*new_states
;
801 new_states
= __pop_fake_cur_stree();
802 FOR_EACH_SM(new_states
, sm
) {
804 __set_true_false_sm(sm
, sm
);
805 } END_FOR_EACH_SM(sm
);
806 free_stree(&new_states
);
809 void __free_set_states(void)
811 struct stree
*new_states
;
813 new_states
= __pop_fake_cur_stree();
814 free_stree(&new_states
);
817 struct stree
*__copy_cond_true_states(void)
821 ret
= pop_stree(&cond_true_stack
);
822 push_stree(&cond_true_stack
, clone_stree(ret
));
826 struct stree
*__copy_cond_false_states(void)
830 ret
= pop_stree(&cond_false_stack
);
831 push_stree(&cond_false_stack
, clone_stree(ret
));
835 struct stree
*__pop_cond_true_stack(void)
837 return pop_stree(&cond_true_stack
);
840 struct stree
*__pop_cond_false_stack(void)
842 return pop_stree(&cond_false_stack
);
846 * This combines the pre cond states with either the true or false states.
848 * a = kmalloc() ; if (a !! foo(a)
849 * In the pre state a is possibly null. In the true state it is non null.
850 * In the false state it is null. Combine the pre and the false to get
851 * that when we call 'foo', 'a' is null.
853 static void __use_cond_stack(struct stree_stack
**stack
)
857 free_stree(&cur_stree
);
859 cur_stree
= pop_stree(&pre_cond_stack
);
860 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
862 stree
= pop_stree(stack
);
863 overwrite_stree(stree
, &cur_stree
);
864 push_stree(stack
, stree
);
867 void __use_pre_cond_states(void)
869 free_stree(&cur_stree
);
870 cur_stree
= pop_stree(&pre_cond_stack
);
873 void __use_cond_true_states(void)
875 __use_cond_stack(&cond_true_stack
);
878 void __use_cond_false_states(void)
880 __use_cond_stack(&cond_false_stack
);
883 void __negate_cond_stacks(void)
885 struct stree
*old_false
, *old_true
;
887 old_false
= pop_stree(&cond_false_stack
);
888 old_true
= pop_stree(&cond_true_stack
);
889 push_stree(&cond_false_stack
, old_true
);
890 push_stree(&cond_true_stack
, old_false
);
893 void __and_cond_states(void)
895 and_stree_stack(&cond_true_stack
);
896 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_false_stack
);
899 void __or_cond_states(void)
901 or_stree_stack(&pre_cond_stack
, cur_stree
, &cond_true_stack
);
902 and_stree_stack(&cond_false_stack
);
905 void __save_pre_cond_states(void)
907 push_stree(&pre_cond_stack
, clone_stree(cur_stree
));
910 void __discard_pre_cond_states(void)
914 tmp
= pop_stree(&pre_cond_stack
);
918 struct stree
*__get_true_states(void)
920 return clone_stree(top_stree(cond_true_stack
));
923 struct stree
*__get_false_states(void)
925 return clone_stree(top_stree(cond_false_stack
));
928 void __use_cond_states(void)
930 struct stree
*pre
, *pre_clone
, *true_states
, *false_states
;
932 pre
= pop_stree(&pre_cond_stack
);
933 pre_clone
= clone_stree(pre
);
935 true_states
= pop_stree(&cond_true_stack
);
936 overwrite_stree(true_states
, &pre
);
937 free_stree(&true_states
);
938 /* we use the true states right away */
939 free_stree(&cur_stree
);
942 false_states
= pop_stree(&cond_false_stack
);
943 overwrite_stree(false_states
, &pre_clone
);
944 free_stree(&false_states
);
945 push_stree(&false_stack
, pre_clone
);
948 void __push_true_states(void)
950 push_stree(&true_stack
, clone_stree(cur_stree
));
953 void __use_false_states(void)
955 free_stree(&cur_stree
);
956 cur_stree
= pop_stree(&false_stack
);
959 void __discard_false_states(void)
963 stree
= pop_stree(&false_stack
);
967 void __merge_false_states(void)
971 stree
= pop_stree(&false_stack
);
972 merge_stree(&cur_stree
, stree
);
977 * This function probably seemed common sensical when I wrote it but, oh wow,
978 * does it look subtle in retrospect. Say we set a state on one side of the if
979 * else path but not on the other, then what we should record in the fake stree
980 * is the merged state.
982 * This function relies on the fact that the we always set the cur_stree as well
983 * and we already have the infrastructure to merge things correctly into the
986 * So instead of merging fake strees together which is probably a lot of work,
987 * we just use it as a list of set states and look up the actual current values
991 static void update_stree_with_merged(struct stree
**stree
)
993 struct state_list
*slist
= NULL
;
994 struct sm_state
*sm
, *new;
996 FOR_EACH_SM(*stree
, sm
) {
997 new = get_sm_state(sm
->owner
, sm
->name
, sm
->sym
);
998 if (!new) /* This can happen if we go out of scope */
1000 add_ptr_list(&slist
, new);
1001 } END_FOR_EACH_SM(sm
);
1003 FOR_EACH_PTR(slist
, sm
) {
1004 overwrite_sm_state_stree(stree
, sm
);
1005 } END_FOR_EACH_PTR(sm
);
1010 static void update_fake_stree_with_merged(void)
1012 struct stree
*stree
;
1014 if (!fake_cur_stree_stack
)
1016 stree
= pop_stree(&fake_cur_stree_stack
);
1017 update_stree_with_merged(&stree
);
1018 push_stree(&fake_cur_stree_stack
, stree
);
1021 void __merge_true_states(void)
1023 struct stree
*stree
;
1025 stree
= pop_stree(&true_stack
);
1026 merge_stree(&cur_stree
, stree
);
1027 update_fake_stree_with_merged();
1031 void __push_continues(void)
1033 push_stree(&continue_stack
, NULL
);
1036 void __discard_continues(void)
1038 struct stree
*stree
;
1040 stree
= pop_stree(&continue_stack
);
1044 void __process_continues(void)
1046 struct stree
*stree
;
1048 stree
= pop_stree(&continue_stack
);
1050 stree
= clone_stree(cur_stree
);
1052 merge_stree(&stree
, cur_stree
);
1054 push_stree(&continue_stack
, stree
);
1057 void __merge_continues(void)
1059 struct stree
*stree
;
1061 stree
= pop_stree(&continue_stack
);
1062 merge_stree(&cur_stree
, stree
);
1066 void __push_breaks(void)
1068 push_stree(&break_stack
, NULL
);
1069 if (fake_cur_stree_stack
)
1070 push_stree(&fake_break_stack
, NULL
);
1073 void __process_breaks(void)
1075 struct stree
*stree
;
1077 stree
= pop_stree(&break_stack
);
1079 stree
= clone_stree(cur_stree
);
1081 merge_stree(&stree
, cur_stree
);
1082 push_stree(&break_stack
, stree
);
1084 if (!fake_cur_stree_stack
)
1087 stree
= pop_stree(&fake_break_stack
);
1089 stree
= clone_stree(top_stree(fake_cur_stree_stack
));
1091 merge_stree(&stree
, top_stree(fake_cur_stree_stack
));
1092 push_stree(&fake_break_stack
, stree
);
1095 int __has_breaks(void)
1097 struct stree
*stree
;
1100 stree
= pop_stree(&break_stack
);
1102 push_stree(&break_stack
, stree
);
1106 void __merge_breaks(void)
1108 struct stree
*stree
;
1109 struct sm_state
*sm
;
1111 stree
= pop_stree(&break_stack
);
1112 merge_stree(&cur_stree
, stree
);
1115 if (!fake_cur_stree_stack
)
1118 stree
= pop_stree(&fake_break_stack
);
1119 update_stree_with_merged(&stree
);
1120 FOR_EACH_SM(stree
, sm
) {
1121 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1122 } END_FOR_EACH_SM(sm
);
1126 void __use_breaks(void)
1128 struct stree
*stree
;
1129 struct sm_state
*sm
;
1131 free_stree(&cur_stree
);
1132 cur_stree
= pop_stree(&break_stack
);
1134 if (!fake_cur_stree_stack
)
1136 stree
= pop_stree(&fake_break_stack
);
1137 FOR_EACH_SM(stree
, sm
) {
1138 overwrite_sm_state_stree_stack(&fake_cur_stree_stack
, sm
);
1139 } END_FOR_EACH_SM(sm
);
1145 void __save_switch_states(struct expression
*switch_expr
)
1147 struct range_list
*rl
;
1149 get_absolute_rl(switch_expr
, &rl
);
1151 push_rl(&remaining_cases
, rl
);
1152 push_stree(&switch_stack
, clone_stree(cur_stree
));
1155 int have_remaining_cases(void)
1157 return !!top_rl(remaining_cases
);
1160 void __merge_switches(struct expression
*switch_expr
, struct range_list
*case_rl
)
1162 struct stree
*stree
;
1163 struct stree
*implied_stree
;
1165 stree
= pop_stree(&switch_stack
);
1168 * If the cur_stree was NULL before the start of the switch
1169 * statement then we don't want to unnullify it.
1172 push_stree(&switch_stack
, stree
);
1175 implied_stree
= __implied_case_stree(switch_expr
, case_rl
, &remaining_cases
, &stree
);
1176 merge_stree(&cur_stree
, implied_stree
);
1177 free_stree(&implied_stree
);
1178 push_stree(&switch_stack
, stree
);
1181 void __discard_switches(void)
1183 struct stree
*stree
;
1185 pop_rl(&remaining_cases
);
1186 stree
= pop_stree(&switch_stack
);
1190 void __push_default(void)
1192 push_stree(&default_stack
, NULL
);
1195 void __set_default(void)
1197 set_state_stree_stack(&default_stack
, 0, "has_default", NULL
, &true_state
);
1200 int __pop_default(void)
1202 struct stree
*stree
;
1204 stree
= pop_stree(&default_stack
);
1212 static struct named_stree
*alloc_named_stree(const char *name
, struct symbol
*sym
, struct stree
*stree
)
1214 struct named_stree
*named_stree
= __alloc_named_stree(0);
1216 named_stree
->name
= (char *)name
;
1217 named_stree
->stree
= stree
;
1218 named_stree
->sym
= sym
;
1222 void __save_gotos(const char *name
, struct symbol
*sym
)
1224 struct stree
**stree
;
1225 struct stree
*clone
;
1227 stree
= get_named_stree(goto_stack
, name
, sym
);
1229 merge_stree(stree
, cur_stree
);
1232 struct named_stree
*named_stree
;
1234 clone
= clone_stree(cur_stree
);
1235 named_stree
= alloc_named_stree(name
, sym
, clone
);
1236 add_ptr_list(&goto_stack
, named_stree
);
1240 void __merge_gotos(const char *name
, struct symbol
*sym
)
1242 struct stree
**stree
;
1244 stree
= get_named_stree(goto_stack
, name
, sym
);
1246 merge_stree(&cur_stree
, *stree
);
1249 void __discard_fake_states(struct expression
*call
)
1251 struct stree
*new = NULL
;
1252 struct sm_state
*sm
;
1256 if (__fake_state_cnt
== 0)
1260 * This is just a best effort type of thing. There could be
1261 * fake states in the true/false trees already. They might
1262 * eventually get cleared out too because we call after probably
1263 * 50% of function calls. But the point is that I don't want to
1264 * waste resources tracking them.
1266 FOR_EACH_SM(cur_stree
, sm
) {
1268 len
= snprintf(buf
, sizeof(buf
), "__fake_param_%p_", call
);
1269 if (strncmp(sm
->name
, buf
, len
) != 0)
1270 avl_insert(&new, sm
);
1273 if (strncmp(sm
->name
, "__fake_param_", 13) != 0)
1274 avl_insert(&new, sm
);
1275 } END_FOR_EACH_SM(sm
);
1277 free_stree(&cur_stree
);
1279 __fake_state_cnt
= 0;