2 * Copyright (C) 2008 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 * Imagine we have this code:
26 * if (foo == 99) // <-- point #2
27 * bar->baz; // <-- point #3
30 * At point #3 bar is non null and can be dereferenced.
32 * It's smatch_implied.c which sets bar to non null at point #2.
34 * At point #1 merge_slist() stores the list of states from both
35 * the true and false paths. On the true path foo == 99 and on
36 * the false path foo == 1. merge_slist() sets their pool
37 * list to show the other states which were there when foo == 99.
39 * When it comes to the if (foo == 99) the smatch implied hook
40 * looks for all the pools where foo was not 99. It makes a list
43 * Then for bar (and all the other states) it says, ok bar is a
44 * merged state that came from these previous states. We'll
45 * chop out all the states where it came from a pool where
46 * foo != 99 and merge it all back together.
48 * That is the implied state of bar.
50 * merge_slist() sets up ->pool. An sm_state only has one ->pool and
51 * that is the pool where it was first set. The my pool gets set when
52 * code paths merge. States that have been set since the last merge do
54 * merge_sm_state() sets ->left and ->right. (These are the states which were
55 * merged to form the current state.)
56 * a pool: a pool is an slist that has been merged with another slist.
62 #include "smatch_slist.h"
63 #include "smatch_extra.h"
65 char *implied_debug_msg
;
66 #define DIMPLIED(msg...) do { if (option_debug_implied) printf(msg); } while (0)
68 int option_debug_implied
= 0;
72 * It messes things up to free range list allocations. This helper fuction
73 * lets us reuse memory instead of doing new allocations.
75 static struct range_list
*tmp_range_list(struct symbol
*type
, long long num
)
77 static struct range_list
*my_list
= NULL
;
78 static struct data_range
*my_range
;
80 __free_ptr_list((struct ptr_list
**)&my_list
);
81 my_range
= alloc_range(ll_to_sval(num
), ll_to_sval(num
));
82 add_ptr_list(&my_list
, my_range
);
86 static void print_debug_tf(struct sm_state
*sm
, int istrue
, int isfalse
)
88 if (!option_debug_implied
&& !option_debug
)
91 if (istrue
&& isfalse
) {
92 printf("%s: %d: does not exist.\n", show_sm(sm
), sm
->line
);
94 printf("'%s = %s' from %d is true. %s[stree %d]\n", sm
->name
, show_state(sm
->state
),
95 sm
->line
, sm
->merged
? "[merged]" : "[leaf]",
96 get_stree_id(sm
->pool
));
98 printf("'%s = %s' from %d is false. %s[stree %d]\n", sm
->name
, show_state(sm
->state
),
100 sm
->merged
? "[merged]" : "[leaf]",
101 get_stree_id(sm
->pool
));
103 printf("'%s = %s' from %d could be true or false. %s[stree %d]\n", sm
->name
,
104 show_state(sm
->state
), sm
->line
,
105 sm
->merged
? "[merged]" : "[leaf]",
106 get_stree_id(sm
->pool
));
110 static int create_fake_history(struct sm_state
*sm
, int comparison
, struct range_list
*rl
)
112 struct range_list
*orig_rl
;
113 struct range_list
*true_rl
, *false_rl
;
114 struct stree
*true_stree
, *false_stree
;
115 struct sm_state
*true_sm
, *false_sm
;
118 if (is_merged(sm
) || sm
->left
|| sm
->right
)
120 if (!rl_to_sval(rl
, &sval
))
122 if (!estate_rl(sm
->state
))
125 orig_rl
= cast_rl(rl_type(rl
), estate_rl(sm
->state
));
126 split_comparison_rl(orig_rl
, comparison
, rl
, &true_rl
, &false_rl
, NULL
, NULL
);
128 true_rl
= rl_truncate_cast(estate_type(sm
->state
), true_rl
);
129 false_rl
= rl_truncate_cast(estate_type(sm
->state
), false_rl
);
130 if (is_whole_rl(true_rl
) || is_whole_rl(false_rl
) ||
131 !true_rl
|| !false_rl
||
132 rl_equiv(orig_rl
, true_rl
) || rl_equiv(orig_rl
, false_rl
) ||
133 rl_equiv(estate_rl(sm
->state
), true_rl
) || rl_equiv(estate_rl(sm
->state
), false_rl
))
136 if (rl_intersection(true_rl
, false_rl
)) {
137 sm_msg("internal error parsing (%s (%s) %s %s)",
138 sm
->name
, sm
->state
->name
, show_special(comparison
), show_rl(rl
));
139 sm_msg("true_rl = %s false_rl = %s intersection = %s",
140 show_rl(true_rl
), show_rl(false_rl
), show_rl(rl_intersection(true_rl
, false_rl
)));
145 sm_msg("fake_history: %s vs %s. %s %s %s. --> T: %s F: %s",
146 sm
->name
, show_rl(rl
), sm
->state
->name
, show_special(comparison
), show_rl(rl
),
147 show_rl(true_rl
), show_rl(false_rl
));
149 true_sm
= clone_sm(sm
);
150 false_sm
= clone_sm(sm
);
152 true_sm
->state
= alloc_estate_rl(cast_rl(estate_type(sm
->state
), true_rl
));
153 free_slist(&true_sm
->possible
);
154 add_possible_sm(true_sm
, true_sm
);
155 false_sm
->state
= alloc_estate_rl(cast_rl(estate_type(sm
->state
), false_rl
));
156 free_slist(&false_sm
->possible
);
157 add_possible_sm(false_sm
, false_sm
);
159 true_stree
= clone_stree(sm
->pool
);
160 false_stree
= clone_stree(sm
->pool
);
162 overwrite_sm_state_stree(&true_stree
, true_sm
);
163 overwrite_sm_state_stree(&false_stree
, false_sm
);
165 true_sm
->pool
= true_stree
;
166 false_sm
->pool
= false_stree
;
170 sm
->right
= false_sm
;
176 * If 'foo' == 99 add it that pool to the true pools. If it's false, add it to
177 * the false pools. If we're not sure, then we don't add it to either.
179 static void do_compare(struct sm_state
*sm
, int comparison
, struct range_list
*rl
,
180 struct state_list
**true_stack
,
181 struct state_list
**false_stack
, int *mixed
, struct sm_state
*gate_sm
)
186 struct range_list
*var_rl
;
191 if (is_implied(sm
)) {
192 s
= get_sm_state_stree(sm
->pool
,
200 if (option_debug_implied
|| option_debug
)
201 sm_msg("%s from %d, has borrowed implications.",
206 var_rl
= cast_rl(rl_type(rl
), estate_rl(s
->state
));
208 istrue
= !possibly_false_rl(var_rl
, comparison
, rl
);
209 isfalse
= !possibly_true_rl(var_rl
, comparison
, rl
);
211 print_debug_tf(s
, istrue
, isfalse
);
213 /* give up if we have borrowed implications (smatch_equiv.c) */
214 if (sm
->sym
!= gate_sm
->sym
||
215 strcmp(sm
->name
, gate_sm
->name
) != 0) {
220 if (mixed
&& !*mixed
&& !is_merged(sm
) && !istrue
&& !isfalse
) {
221 if (!create_fake_history(sm
, comparison
, rl
)) {
228 add_ptr_list(true_stack
, s
);
231 add_ptr_list(false_stack
, s
);
234 static int pool_in_pools(struct stree
*pool
,
235 const struct state_list
*slist
)
237 struct sm_state
*tmp
;
239 FOR_EACH_PTR(slist
, tmp
) {
242 if (tmp
->pool
== pool
)
244 } END_FOR_EACH_PTR(tmp
);
248 static int is_checked(struct state_list
*checked
, struct sm_state
*sm
)
250 struct sm_state
*tmp
;
252 FOR_EACH_PTR(checked
, tmp
) {
255 } END_FOR_EACH_PTR(tmp
);
261 * Example code: if (foo == 99) {
263 * Say 'foo' is a merged state that has many possible values. It is the combination
264 * of merges. separate_pools() iterates through the pools recursively and calls
265 * do_compare() for each time 'foo' was set.
267 static void __separate_pools(struct sm_state
*sm
, int comparison
, struct range_list
*rl
,
268 struct state_list
**true_stack
,
269 struct state_list
**false_stack
,
270 struct state_list
**checked
, int *mixed
, struct sm_state
*gate_sm
)
272 int free_checked
= 0;
273 struct state_list
*checked_states
= NULL
;
279 * If it looks like this is going to take too long as-is, then don't
280 * create even more fake history.
282 if (mixed
&& sm
->nr_children
> 100)
286 Sometimes the implications are just too big to deal with
287 so we bail. Theoretically, bailing out here can cause more false
288 positives but won't hide actual bugs.
290 if (sm
->nr_children
> 4000) {
291 if (option_debug
|| option_debug_implied
) {
292 static char buf
[1028];
293 snprintf(buf
, sizeof(buf
), "debug: %s: nr_children over 4000 (%d). (%s %s)",
294 __func__
, sm
->nr_children
, sm
->name
, show_state(sm
->state
));
295 implied_debug_msg
= buf
;
300 if (checked
== NULL
) {
301 checked
= &checked_states
;
304 if (is_checked(*checked
, sm
))
306 add_ptr_list(checked
, sm
);
308 do_compare(sm
, comparison
, rl
, true_stack
, false_stack
, mixed
, gate_sm
);
310 __separate_pools(sm
->left
, comparison
, rl
, true_stack
, false_stack
, checked
, mixed
, gate_sm
);
311 __separate_pools(sm
->right
, comparison
, rl
, true_stack
, false_stack
, checked
, mixed
, gate_sm
);
316 static void separate_pools(struct sm_state
*sm
, int comparison
, struct range_list
*rl
,
317 struct state_list
**true_stack
,
318 struct state_list
**false_stack
,
319 struct state_list
**checked
, int *mixed
)
321 __separate_pools(sm
, comparison
, rl
, true_stack
, false_stack
, checked
, mixed
, sm
);
325 * NOTE: If a state is in both the keep stack and the remove stack then it is
326 * removed. If that happens it means you have a bug. Only add states which are
327 * definitely true or definitely false. If you have a leaf state that could be
328 * both true and false, then create a fake split history where one side is true
329 * and one side is false. Otherwise, if you can't do that, then don't add it to
330 * either list, and it will be treated as true.
332 struct sm_state
*filter_pools(struct sm_state
*sm
,
333 const struct state_list
*remove_stack
,
334 const struct state_list
*keep_stack
,
337 struct sm_state
*ret
= NULL
;
338 struct sm_state
*left
;
339 struct sm_state
*right
;
345 if (sm
->nr_children
> 4000) {
346 if (option_debug
|| option_debug_implied
) {
347 static char buf
[1028];
348 snprintf(buf
, sizeof(buf
), "debug: %s: nr_children over 4000 (%d). (%s %s)",
349 __func__
, sm
->nr_children
, sm
->name
, show_state(sm
->state
));
350 implied_debug_msg
= buf
;
355 if (pool_in_pools(sm
->pool
, remove_stack
)) {
356 DIMPLIED("removed %s from %d [stree %d]\n", show_sm(sm
), sm
->line
, get_stree_id(sm
->pool
));
361 if (!is_merged(sm
) || pool_in_pools(sm
->pool
, keep_stack
)) {
362 DIMPLIED("kept %s from %d [stree %d]\n", show_sm(sm
), sm
->line
, get_stree_id(sm
->pool
));
366 DIMPLIED("checking %s from %d (%d) [stree %d] left = %s [stree %d] right = %s [stree %d]\n",
367 show_sm(sm
), sm
->line
, sm
->nr_children
, get_stree_id(sm
->pool
),
368 sm
->left
? show_sm(sm
->left
) : "<none>", sm
->left
? get_stree_id(sm
->left
->pool
) : -1,
369 sm
->right
? show_sm(sm
->right
) : "<none>", sm
->right
? get_stree_id(sm
->right
->pool
) : -1);
370 left
= filter_pools(sm
->left
, remove_stack
, keep_stack
, &removed
);
371 right
= filter_pools(sm
->right
, remove_stack
, keep_stack
, &removed
);
373 DIMPLIED("kept %s from %d [stree %d]\n", show_sm(sm
), sm
->line
, get_stree_id(sm
->pool
));
377 if (!left
&& !right
) {
378 DIMPLIED("removed %s from %d <none> [stree %d]\n", show_sm(sm
), sm
->line
, get_stree_id(sm
->pool
));
383 ret
= clone_sm(right
);
388 ret
= clone_sm(left
);
393 ret
= merge_sm_states(left
, right
);
396 ret
->pool
= sm
->pool
;
399 DIMPLIED("partial %s => ", show_sm(sm
));
400 DIMPLIED("%s from %d [stree %d]\n", show_sm(ret
), sm
->line
, get_stree_id(sm
->pool
));
404 static int sm_in_keep_leafs(struct sm_state
*sm
, const struct state_list
*keep_gates
)
406 struct sm_state
*tmp
, *old
;
408 FOR_EACH_PTR(keep_gates
, tmp
) {
411 old
= get_sm_state_stree(tmp
->pool
, sm
->owner
, sm
->name
, sm
->sym
);
414 } END_FOR_EACH_PTR(tmp
);
418 static struct stree
*filter_stack(struct sm_state
*gate_sm
,
419 struct stree
*pre_stree
,
420 const struct state_list
*remove_stack
,
421 const struct state_list
*keep_stack
)
423 struct stree
*ret
= NULL
;
424 struct sm_state
*tmp
;
425 struct sm_state
*filtered_sm
;
431 FOR_EACH_SM(pre_stree
, tmp
) {
434 if (sm_in_keep_leafs(tmp
, keep_stack
))
437 filtered_sm
= filter_pools(tmp
, remove_stack
, keep_stack
, &modified
);
438 if (filtered_sm
&& modified
) {
439 /* the assignments here are for borrowed implications */
440 filtered_sm
->name
= tmp
->name
;
441 filtered_sm
->sym
= tmp
->sym
;
442 avl_insert(&ret
, filtered_sm
);
447 } END_FOR_EACH_SM(tmp
);
451 static void separate_and_filter(struct sm_state
*sm
, int comparison
, struct range_list
*rl
,
452 struct stree
*pre_stree
,
453 struct stree
**true_states
,
454 struct stree
**false_states
,
457 struct state_list
*true_stack
= NULL
;
458 struct state_list
*false_stack
= NULL
;
459 struct timeval time_before
;
460 struct timeval time_after
;
462 gettimeofday(&time_before
, NULL
);
464 if (!is_merged(sm
)) {
465 DIMPLIED("%d '%s' is not merged.\n", get_lineno(), sm
->name
);
469 if (option_debug_implied
|| option_debug
) {
470 sm_msg("checking implications: (%s %s %s)",
471 sm
->name
, show_special(comparison
), show_rl(rl
));
474 separate_pools(sm
, comparison
, rl
, &true_stack
, &false_stack
, NULL
, mixed
);
476 DIMPLIED("filtering true stack.\n");
477 *true_states
= filter_stack(sm
, pre_stree
, false_stack
, true_stack
);
478 DIMPLIED("filtering false stack.\n");
479 *false_states
= filter_stack(sm
, pre_stree
, true_stack
, false_stack
);
480 free_slist(&true_stack
);
481 free_slist(&false_stack
);
482 if (option_debug_implied
|| option_debug
) {
483 printf("These are the implied states for the true path:\n");
484 __print_stree(*true_states
);
485 printf("These are the implied states for the false path:\n");
486 __print_stree(*false_states
);
489 gettimeofday(&time_after
, NULL
);
490 if (time_after
.tv_sec
- time_before
.tv_sec
> 20) {
491 sm
->nr_children
= 4000;
492 sm_msg("Function too hairy. Giving up.");
496 static struct expression
*get_last_expr(struct statement
*stmt
)
498 struct statement
*last
;
500 last
= last_ptr_list((struct ptr_list
*)stmt
->stmts
);
501 if (last
->type
== STMT_EXPRESSION
)
502 return last
->expression
;
504 if (last
->type
== STMT_LABEL
) {
505 if (last
->label_statement
&&
506 last
->label_statement
->type
== STMT_EXPRESSION
)
507 return last
->label_statement
->expression
;
513 static struct expression
*get_left_most_expr(struct expression
*expr
)
515 struct statement
*compound
;
517 compound
= get_expression_statement(expr
);
519 return get_last_expr(compound
);
521 expr
= strip_parens(expr
);
522 if (expr
->type
== EXPR_ASSIGNMENT
)
523 return get_left_most_expr(expr
->left
);
527 static int is_merged_expr(struct expression
*expr
)
532 if (get_value(expr
, &dummy
))
534 sm
= get_sm_state_expr(SMATCH_EXTRA
, expr
);
542 static void delete_gate_sm_equiv(struct stree
**stree
, const char *name
, struct symbol
*sym
)
544 struct smatch_state
*state
;
545 struct relation
*rel
;
547 state
= get_state(SMATCH_EXTRA
, name
, sym
);
550 FOR_EACH_PTR(estate_related(state
), rel
) {
551 delete_state_stree(stree
, SMATCH_EXTRA
, rel
->name
, rel
->sym
);
552 } END_FOR_EACH_PTR(rel
);
555 static void delete_gate_sm(struct stree
**stree
, const char *name
, struct symbol
*sym
)
557 delete_state_stree(stree
, SMATCH_EXTRA
, name
, sym
);
560 static int handle_comparison(struct expression
*expr
,
561 struct stree
**implied_true
,
562 struct stree
**implied_false
)
564 struct sm_state
*sm
= NULL
;
565 struct range_list
*rl
= NULL
;
566 struct expression
*left
;
567 struct expression
*right
;
569 int comparison
= expr
->op
;
572 left
= get_left_most_expr(expr
->left
);
573 right
= get_left_most_expr(expr
->right
);
575 if (is_merged_expr(left
)) {
576 sm
= get_sm_state_expr(SMATCH_EXTRA
, left
);
577 get_implied_rl(right
, &rl
);
578 } else if (is_merged_expr(right
)) {
579 sm
= get_sm_state_expr(SMATCH_EXTRA
, right
);
580 get_implied_rl(left
, &rl
);
581 comparison
= flip_comparison(comparison
);
589 type
= get_type(expr
);
592 if (type_positive_bits(rl_type(rl
)) > type_positive_bits(type
))
594 if (type_positive_bits(type
) < 31)
596 rl
= cast_rl(type
, rl
);
598 separate_and_filter(sm
, comparison
, rl
, __get_cur_stree(), implied_true
, implied_false
, &mixed
);
601 delete_gate_sm_equiv(implied_true
, sm
->name
, sm
->sym
);
602 delete_gate_sm_equiv(implied_false
, sm
->name
, sm
->sym
);
604 delete_gate_sm(implied_true
, sm
->name
, sm
->sym
);
605 delete_gate_sm(implied_false
, sm
->name
, sm
->sym
);
611 static int handle_zero_comparison(struct expression
*expr
,
612 struct stree
**implied_true
,
613 struct stree
**implied_false
)
621 if (expr
->type
== EXPR_POSTOP
)
622 expr
= strip_expr(expr
->unop
);
624 if (expr
->type
== EXPR_ASSIGNMENT
) {
625 /* most of the time ->pools will be empty here because we
626 just set the state, but if have assigned a conditional
627 function there are implications. */
631 name
= expr_to_var_sym(expr
, &sym
);
634 sm
= get_sm_state(SMATCH_EXTRA
, name
, sym
);
638 separate_and_filter(sm
, SPECIAL_NOTEQUAL
, tmp_range_list(estate_type(sm
->state
), 0), __get_cur_stree(), implied_true
, implied_false
, &mixed
);
639 delete_gate_sm_equiv(implied_true
, sm
->name
, sm
->sym
);
640 delete_gate_sm_equiv(implied_false
, sm
->name
, sm
->sym
);
642 delete_gate_sm(implied_true
, sm
->name
, sm
->sym
);
643 delete_gate_sm(implied_false
, sm
->name
, sm
->sym
);
652 static int handled_by_implied_hook(struct expression
*expr
,
653 struct stree
**implied_true
,
654 struct stree
**implied_false
)
656 struct state_list
*true_stack
= NULL
;
657 struct state_list
*false_stack
= NULL
;
658 struct stree
*pre_stree
;
661 sm
= comparison_implication_hook(expr
, &true_stack
, &false_stack
);
665 pre_stree
= clone_stree(__get_cur_stree());
667 *implied_true
= filter_stack(sm
, pre_stree
, false_stack
, true_stack
);
668 *implied_false
= filter_stack(sm
, pre_stree
, true_stack
, false_stack
);
670 free_stree(&pre_stree
);
671 free_slist(&true_stack
);
672 free_slist(&false_stack
);
677 static int handled_by_extra_states(struct expression
*expr
,
678 struct stree
**implied_true
,
679 struct stree
**implied_false
)
681 if (expr
->type
== EXPR_COMPARE
)
682 return handle_comparison(expr
, implied_true
, implied_false
);
684 return handle_zero_comparison(expr
, implied_true
, implied_false
);
687 static int handled_by_stored_conditions(struct expression
*expr
,
688 struct stree
**implied_true
,
689 struct stree
**implied_false
)
691 struct state_list
*true_stack
= NULL
;
692 struct state_list
*false_stack
= NULL
;
693 struct stree
*pre_stree
;
696 sm
= stored_condition_implication_hook(expr
, &true_stack
, &false_stack
);
700 pre_stree
= clone_stree(__get_cur_stree());
702 *implied_true
= filter_stack(sm
, pre_stree
, false_stack
, true_stack
);
703 *implied_false
= filter_stack(sm
, pre_stree
, true_stack
, false_stack
);
705 free_stree(&pre_stree
);
706 free_slist(&true_stack
);
707 free_slist(&false_stack
);
712 static int found_implications
;
713 static struct stree
*saved_implied_true
;
714 static struct stree
*saved_implied_false
;
715 static struct stree
*extra_saved_implied_true
;
716 static struct stree
*extra_saved_implied_false
;
718 static void get_tf_states(struct expression
*expr
,
719 struct stree
**implied_true
,
720 struct stree
**implied_false
)
722 if (handled_by_implied_hook(expr
, implied_true
, implied_false
))
725 if (handled_by_extra_states(expr
, implied_true
, implied_false
)) {
726 /* We process these later. */
727 extra_saved_implied_true
= *implied_true
;
728 extra_saved_implied_false
= *implied_false
;
729 *implied_true
= NULL
;
730 *implied_false
= NULL
;
734 if (handled_by_stored_conditions(expr
, implied_true
, implied_false
))
739 found_implications
= 1;
742 static void save_implications_hook(struct expression
*expr
)
744 get_tf_states(expr
, &saved_implied_true
, &saved_implied_false
);
747 static void set_implied_states(struct expression
*expr
)
751 FOR_EACH_SM(saved_implied_true
, sm
) {
752 __set_true_false_sm(sm
, NULL
);
753 } END_FOR_EACH_SM(sm
);
754 free_stree(&saved_implied_true
);
756 FOR_EACH_SM(saved_implied_false
, sm
) {
757 __set_true_false_sm(NULL
, sm
);
758 } END_FOR_EACH_SM(sm
);
759 free_stree(&saved_implied_false
);
762 static void set_extra_implied_states(struct expression
*expr
)
764 saved_implied_true
= extra_saved_implied_true
;
765 saved_implied_false
= extra_saved_implied_false
;
766 extra_saved_implied_true
= NULL
;
767 extra_saved_implied_false
= NULL
;
768 set_implied_states(NULL
);
771 void param_limit_implications(struct expression
*expr
, int param
, char *key
, char *value
)
773 struct expression
*arg
;
774 struct symbol
*compare_type
;
778 struct sm_state
*tmp
;
779 struct stree
*implied_true
= NULL
;
780 struct stree
*implied_false
= NULL
;
781 struct range_list
*orig
, *limit
, *rl
;
783 while (expr
->type
== EXPR_ASSIGNMENT
)
784 expr
= strip_expr(expr
->right
);
785 if (expr
->type
!= EXPR_CALL
)
788 arg
= get_argument_from_call_expr(expr
->args
, param
);
792 name
= get_variable_from_key(arg
, key
, &sym
);
796 sm
= get_sm_state(SMATCH_EXTRA
, name
, sym
);
797 if (!sm
|| !sm
->merged
)
800 if (strcmp(key
, "$") == 0)
801 compare_type
= get_arg_type(expr
->fn
, param
);
803 compare_type
= get_member_type_from_key(arg
, key
);
805 orig
= estate_rl(sm
->state
);
806 orig
= cast_rl(compare_type
, orig
);
808 call_results_to_rl(expr
, compare_type
, value
, &limit
);
809 rl
= rl_intersection(orig
, limit
);
811 separate_and_filter(sm
, SPECIAL_EQUAL
, rl
, __get_cur_stree(), &implied_true
, &implied_false
, NULL
);
813 FOR_EACH_SM(implied_true
, tmp
) {
814 __set_sm_fake_stree(tmp
);
815 } END_FOR_EACH_SM(tmp
);
817 free_stree(&implied_true
);
818 free_stree(&implied_false
);
823 struct stree
*__implied_case_stree(struct expression
*switch_expr
,
824 struct range_list
*rl
,
825 struct range_list_stack
**remaining_cases
,
826 struct stree
**raw_stree
)
830 struct var_sym_list
*vsl
;
832 struct stree
*true_states
= NULL
;
833 struct stree
*false_states
= NULL
;
834 struct stree
*extra_states
;
835 struct stree
*ret
= clone_stree(*raw_stree
);
837 name
= expr_to_chunk_sym_vsl(switch_expr
, &sym
, &vsl
);
842 filter_top_rl(remaining_cases
, rl
);
844 rl
= clone_rl(top_rl(*remaining_cases
));
846 sm
= get_sm_state_stree(*raw_stree
, SMATCH_EXTRA
, name
, sym
);
848 separate_and_filter(sm
, SPECIAL_EQUAL
, rl
, *raw_stree
, &true_states
, &false_states
, NULL
);
850 __push_fake_cur_stree();
852 set_extra_nomod_vsl(name
, sym
, vsl
, alloc_estate_rl(rl
));
853 __pass_case_to_client(switch_expr
, rl
);
854 extra_states
= __pop_fake_cur_stree();
855 overwrite_stree(extra_states
, &true_states
);
856 overwrite_stree(true_states
, &ret
);
857 free_stree(&extra_states
);
858 free_stree(&true_states
);
859 free_stree(&false_states
);
865 static void match_end_func(struct symbol
*sym
)
869 implied_debug_msg
= NULL
;
872 static void get_tf_stacks_from_pool(struct sm_state
*gate_sm
,
873 struct sm_state
*pool_sm
,
874 struct state_list
**true_stack
,
875 struct state_list
**false_stack
)
877 struct sm_state
*tmp
;
878 int possibly_true
= 0;
883 if (strcmp(gate_sm
->state
->name
, pool_sm
->state
->name
) == 0) {
884 add_ptr_list(true_stack
, pool_sm
);
888 FOR_EACH_PTR(gate_sm
->possible
, tmp
) {
889 if (strcmp(tmp
->state
->name
, pool_sm
->state
->name
) == 0) {
893 } END_FOR_EACH_PTR(tmp
);
895 if (!possibly_true
) {
896 add_ptr_list(false_stack
, gate_sm
);
900 get_tf_stacks_from_pool(gate_sm
->left
, pool_sm
, true_stack
, false_stack
);
901 get_tf_stacks_from_pool(gate_sm
->right
, pool_sm
, true_stack
, false_stack
);
905 * The situation is we have a SMATCH_EXTRA state and we want to break it into
906 * each of the ->possible states and find the implications of each. The caller
907 * has to use __push_fake_cur_stree() to preserve the correct states so they
908 * can be restored later.
910 void overwrite_states_using_pool(struct sm_state
*gate_sm
, struct sm_state
*pool_sm
)
912 struct state_list
*true_stack
= NULL
;
913 struct state_list
*false_stack
= NULL
;
914 struct stree
*pre_stree
;
915 struct stree
*implied_true
;
916 struct sm_state
*tmp
;
921 get_tf_stacks_from_pool(gate_sm
, pool_sm
, &true_stack
, &false_stack
);
923 pre_stree
= clone_stree(__get_cur_stree());
925 implied_true
= filter_stack(gate_sm
, pre_stree
, false_stack
, true_stack
);
927 free_stree(&pre_stree
);
928 free_slist(&true_stack
);
929 free_slist(&false_stack
);
931 FOR_EACH_SM(implied_true
, tmp
) {
932 set_state(tmp
->owner
, tmp
->name
, tmp
->sym
, tmp
->state
);
933 } END_FOR_EACH_SM(tmp
);
935 free_stree(&implied_true
);
938 int assume(struct expression
*expr
)
940 int orig_final_pass
= final_pass
;
943 __push_fake_cur_stree();
944 found_implications
= 0;
945 __split_whole_condition(expr
);
946 final_pass
= orig_final_pass
;
948 if (!found_implications
) {
949 __discard_false_states();
950 __free_fake_cur_stree();
957 void end_assume(void)
959 __discard_false_states();
960 __free_fake_cur_stree();
963 void __extra_match_condition(struct expression
*expr
);
964 void __comparison_match_condition(struct expression
*expr
);
965 void __stored_condition(struct expression
*expr
);
966 void register_implications(int id
)
968 add_hook(&save_implications_hook
, CONDITION_HOOK
);
969 add_hook(&set_implied_states
, CONDITION_HOOK
);
970 add_hook(&__extra_match_condition
, CONDITION_HOOK
);
971 add_hook(&set_extra_implied_states
, CONDITION_HOOK
);
972 add_hook(&__comparison_match_condition
, CONDITION_HOOK
);
973 add_hook(&__stored_condition
, CONDITION_HOOK
);
974 add_hook(&match_end_func
, END_FUNC_HOOK
);