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 * smatch_extra.c is supposed to track the value of every variable.
34 #include "smatch_slist.h"
35 #include "smatch_extra.h"
40 static void match_link_modify(struct sm_state
*sm
, struct expression
*mod_expr
);
42 struct string_list
*__ignored_macros
= NULL
;
43 static int in_warn_on_macro(void)
45 struct statement
*stmt
;
49 stmt
= get_current_statement();
52 macro
= get_macro_name(stmt
->pos
);
56 FOR_EACH_PTR(__ignored_macros
, tmp
) {
57 if (!strcmp(tmp
, macro
))
59 } END_FOR_EACH_PTR(tmp
);
63 typedef void (mod_hook
)(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
);
64 DECLARE_PTR_LIST(void_fn_list
, mod_hook
*);
65 static struct void_fn_list
*extra_mod_hooks
;
66 static struct void_fn_list
*extra_nomod_hooks
;
68 void add_extra_mod_hook(mod_hook
*fn
)
70 mod_hook
**p
= malloc(sizeof(mod_hook
*));
72 add_ptr_list(&extra_mod_hooks
, p
);
75 void add_extra_nomod_hook(mod_hook
*fn
)
77 mod_hook
**p
= malloc(sizeof(mod_hook
*));
79 add_ptr_list(&extra_nomod_hooks
, p
);
82 void call_extra_hooks(struct void_fn_list
*hooks
, const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
86 FOR_EACH_PTR(hooks
, fn
) {
87 (*fn
)(name
, sym
, expr
, state
);
88 } END_FOR_EACH_PTR(fn
);
91 void call_extra_mod_hooks(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
93 call_extra_hooks(extra_mod_hooks
, name
, sym
, expr
, state
);
96 void call_extra_nomod_hooks(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
98 call_extra_hooks(extra_nomod_hooks
, name
, sym
, expr
, state
);
101 static bool in_param_set
;
102 void set_extra_mod_helper(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
104 remove_from_equiv(name
, sym
);
105 call_extra_mod_hooks(name
, sym
, expr
, state
);
106 if ((__in_fake_assign
|| in_param_set
) &&
107 estate_is_unknown(state
) && !get_state(SMATCH_EXTRA
, name
, sym
))
109 set_state(SMATCH_EXTRA
, name
, sym
, state
);
112 static void set_extra_nomod_helper(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
114 call_extra_nomod_hooks(name
, sym
, expr
, state
);
115 set_state(SMATCH_EXTRA
, name
, sym
, state
);
118 static char *get_pointed_at(const char *name
, struct symbol
*sym
, struct symbol
**new_sym
)
120 struct expression
*assigned
;
124 if (strcmp(name
+ 1, sym
->ident
->name
) != 0)
127 assigned
= get_assigned_expr_name_sym(sym
->ident
->name
, sym
);
130 assigned
= strip_parens(assigned
);
131 if (assigned
->type
!= EXPR_PREOP
|| assigned
->op
!= '&')
134 return expr_to_var_sym(assigned
->unop
, new_sym
);
137 char *get_other_name_sym(const char *name
, struct symbol
*sym
, struct symbol
**new_sym
)
139 struct expression
*assigned
;
140 char *orig_name
= NULL
;
147 if (!sym
|| !sym
->ident
)
150 ret
= get_pointed_at(name
, sym
, new_sym
);
154 skip
= strlen(sym
->ident
->name
);
155 if (name
[skip
] != '-' || name
[skip
+ 1] != '>')
159 assigned
= get_assigned_expr_name_sym(sym
->ident
->name
, sym
);
162 if (assigned
->type
== EXPR_CALL
)
163 return map_call_to_other_name_sym(name
, sym
, new_sym
);
164 if (assigned
->type
== EXPR_PREOP
|| assigned
->op
== '&') {
166 orig_name
= expr_to_var_sym(assigned
, new_sym
);
167 if (!orig_name
|| !*new_sym
)
170 snprintf(buf
, sizeof(buf
), "%s.%s", orig_name
+ 1, name
+ skip
);
171 ret
= alloc_string(buf
);
172 free_string(orig_name
);
176 if (assigned
->type
!= EXPR_DEREF
)
179 orig_name
= expr_to_var_sym(assigned
, new_sym
);
180 if (!orig_name
|| !*new_sym
)
183 snprintf(buf
, sizeof(buf
), "%s->%s", orig_name
, name
+ skip
);
184 ret
= alloc_string(buf
);
185 free_string(orig_name
);
189 free_string(orig_name
);
193 void set_extra_mod(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
196 struct symbol
*new_sym
;
198 set_extra_mod_helper(name
, sym
, expr
, state
);
199 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
200 if (new_name
&& new_sym
)
201 set_extra_mod_helper(new_name
, new_sym
, expr
, state
);
202 free_string(new_name
);
205 static struct expression
*chunk_get_array_base(struct expression
*expr
)
208 * The problem with is_array() is that it only returns true for things
209 * like foo[1] but not for foo[1].bar.
212 expr
= strip_expr(expr
);
213 while (expr
&& expr
->type
== EXPR_DEREF
)
214 expr
= strip_expr(expr
->deref
);
215 return get_array_base(expr
);
218 static int chunk_has_array(struct expression
*expr
)
220 return !!chunk_get_array_base(expr
);
223 static void clear_array_states(struct expression
*array
)
227 sm
= get_sm_state_expr(link_id
, array
);
229 match_link_modify(sm
, NULL
);
232 static void set_extra_array_mod(struct expression
*expr
, struct smatch_state
*state
)
234 struct expression
*array
;
235 struct var_sym_list
*vsl
;
240 array
= chunk_get_array_base(expr
);
242 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
244 clear_array_states(array
);
248 FOR_EACH_PTR(vsl
, vs
) {
249 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
250 } END_FOR_EACH_PTR(vs
);
252 call_extra_mod_hooks(name
, sym
, expr
, state
);
253 set_state(SMATCH_EXTRA
, name
, sym
, state
);
258 void set_extra_expr_mod(struct expression
*expr
, struct smatch_state
*state
)
263 if (chunk_has_array(expr
)) {
264 set_extra_array_mod(expr
, state
);
268 expr
= strip_expr(expr
);
269 name
= expr_to_var_sym(expr
, &sym
);
272 set_extra_mod(name
, sym
, expr
, state
);
277 void set_extra_nomod(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
280 struct symbol
*new_sym
;
281 struct relation
*rel
;
282 struct smatch_state
*orig_state
;
284 orig_state
= get_state(SMATCH_EXTRA
, name
, sym
);
286 /* don't save unknown states if leaving it blank is the same */
287 if (!orig_state
&& estate_is_unknown(state
))
290 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
291 if (new_name
&& new_sym
)
292 set_extra_nomod_helper(new_name
, new_sym
, expr
, state
);
293 free_string(new_name
);
295 if (!estate_related(orig_state
)) {
296 set_extra_nomod_helper(name
, sym
, expr
, state
);
300 set_related(state
, estate_related(orig_state
));
301 FOR_EACH_PTR(estate_related(orig_state
), rel
) {
302 struct smatch_state
*estate
;
304 if (option_debug_related
)
305 sm_msg("%s updating related %s to %s", name
, rel
->name
, state
->name
);
306 estate
= get_state(SMATCH_EXTRA
, rel
->name
, rel
->sym
);
309 set_extra_nomod_helper(rel
->name
, rel
->sym
, expr
, clone_estate_cast(estate_type(estate
), state
));
310 } END_FOR_EACH_PTR(rel
);
313 void set_extra_nomod_vsl(const char *name
, struct symbol
*sym
, struct var_sym_list
*vsl
, struct expression
*expr
, struct smatch_state
*state
)
317 FOR_EACH_PTR(vsl
, vs
) {
318 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
319 } END_FOR_EACH_PTR(vs
);
321 set_extra_nomod(name
, sym
, expr
, state
);
325 * This is for return_implies_state() hooks which modify a SMATCH_EXTRA state
327 void set_extra_expr_nomod(struct expression
*expr
, struct smatch_state
*state
)
329 struct var_sym_list
*vsl
;
334 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
337 FOR_EACH_PTR(vsl
, vs
) {
338 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
339 } END_FOR_EACH_PTR(vs
);
341 set_extra_nomod(name
, sym
, expr
, state
);
346 static void set_extra_true_false(const char *name
, struct symbol
*sym
,
347 struct smatch_state
*true_state
,
348 struct smatch_state
*false_state
)
351 struct symbol
*new_sym
;
352 struct relation
*rel
;
353 struct smatch_state
*orig_state
;
355 if (!true_state
&& !false_state
)
358 if (in_warn_on_macro())
361 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
362 if (new_name
&& new_sym
)
363 set_true_false_states(SMATCH_EXTRA
, new_name
, new_sym
, true_state
, false_state
);
364 free_string(new_name
);
366 orig_state
= get_state(SMATCH_EXTRA
, name
, sym
);
368 if (!estate_related(orig_state
)) {
369 set_true_false_states(SMATCH_EXTRA
, name
, sym
, true_state
, false_state
);
374 set_related(true_state
, estate_related(orig_state
));
376 set_related(false_state
, estate_related(orig_state
));
378 FOR_EACH_PTR(estate_related(orig_state
), rel
) {
379 set_true_false_states(SMATCH_EXTRA
, rel
->name
, rel
->sym
,
380 true_state
, false_state
);
381 } END_FOR_EACH_PTR(rel
);
384 static void set_extra_chunk_true_false(struct expression
*expr
,
385 struct smatch_state
*true_state
,
386 struct smatch_state
*false_state
)
388 struct var_sym_list
*vsl
;
394 if (in_warn_on_macro())
397 type
= get_type(expr
);
401 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
404 FOR_EACH_PTR(vsl
, vs
) {
405 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
406 } END_FOR_EACH_PTR(vs
);
408 set_true_false_states(SMATCH_EXTRA
, name
, sym
,
409 clone_estate(true_state
),
410 clone_estate(false_state
));
415 static void set_extra_expr_true_false(struct expression
*expr
,
416 struct smatch_state
*true_state
,
417 struct smatch_state
*false_state
)
423 if (!true_state
&& !false_state
)
426 if (get_value(expr
, &sval
))
429 expr
= strip_expr(expr
);
430 name
= expr_to_var_sym(expr
, &sym
);
433 set_extra_chunk_true_false(expr
, true_state
, false_state
);
436 set_extra_true_false(name
, sym
, true_state
, false_state
);
440 static int get_countdown_info(struct expression
*condition
, struct expression
**unop
, int *op
, sval_t
*right
)
442 struct expression
*unop_expr
;
446 right
->type
= &int_ctype
;
449 condition
= strip_expr(condition
);
451 if (condition
->type
== EXPR_COMPARE
) {
452 comparison
= remove_unsigned_from_comparison(condition
->op
);
454 if (comparison
!= SPECIAL_GTE
&& comparison
!= '>')
456 if (!get_value(condition
->right
, &limit
))
459 unop_expr
= condition
->left
;
460 if (unop_expr
->type
!= EXPR_PREOP
&& unop_expr
->type
!= EXPR_POSTOP
)
462 if (unop_expr
->op
!= SPECIAL_DECREMENT
)
472 if (condition
->type
!= EXPR_PREOP
&& condition
->type
!= EXPR_POSTOP
)
474 if (condition
->op
!= SPECIAL_DECREMENT
)
483 static struct sm_state
*handle_canonical_while_count_down(struct statement
*loop
)
485 struct expression
*iter_var
;
486 struct expression
*condition
, *unop
;
488 struct smatch_state
*estate
;
492 right
.type
= &int_ctype
;
495 condition
= strip_expr(loop
->iterator_pre_condition
);
499 if (!get_countdown_info(condition
, &unop
, &op
, &right
))
502 iter_var
= unop
->unop
;
504 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
507 if (sval_cmp(estate_min(sm
->state
), right
) < 0)
509 start
= estate_max(sm
->state
);
510 if (sval_cmp(start
, right
) <= 0)
512 if (!sval_is_max(start
))
515 if (op
== SPECIAL_GTE
)
518 if (unop
->type
== EXPR_PREOP
) {
520 estate
= alloc_estate_range(right
, start
);
521 if (estate_has_hard_max(sm
->state
))
522 estate_set_hard_max(estate
);
523 estate_copy_fuzzy_max(estate
, sm
->state
);
524 set_extra_expr_mod(iter_var
, estate
);
526 if (unop
->type
== EXPR_POSTOP
) {
527 estate
= alloc_estate_range(right
, start
);
528 if (estate_has_hard_max(sm
->state
))
529 estate_set_hard_max(estate
);
530 estate_copy_fuzzy_max(estate
, sm
->state
);
531 set_extra_expr_mod(iter_var
, estate
);
533 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
536 static struct sm_state
*handle_canonical_for_inc(struct expression
*iter_expr
,
537 struct expression
*condition
)
539 struct expression
*iter_var
;
541 struct smatch_state
*estate
;
542 sval_t start
, end
, max
;
544 iter_var
= iter_expr
->unop
;
545 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
548 if (!estate_get_single_value(sm
->state
, &start
))
550 if (get_implied_max(condition
->right
, &end
))
551 end
= sval_cast(get_type(iter_var
), end
);
553 end
= sval_type_max(get_type(iter_var
));
555 if (get_sm_state_expr(SMATCH_EXTRA
, condition
->left
) != sm
)
558 switch (condition
->op
) {
559 case SPECIAL_UNSIGNED_LT
:
560 case SPECIAL_NOTEQUAL
:
562 if (!sval_is_min(end
))
565 case SPECIAL_UNSIGNED_LTE
:
571 if (sval_cmp(end
, start
) < 0)
573 estate
= alloc_estate_range(start
, end
);
574 if (get_hard_max(condition
->right
, &max
)) {
575 estate_set_hard_max(estate
);
576 if (condition
->op
== '<' ||
577 condition
->op
== SPECIAL_UNSIGNED_LT
||
578 condition
->op
== SPECIAL_NOTEQUAL
)
580 estate_set_fuzzy_max(estate
, max
);
582 set_extra_expr_mod(iter_var
, estate
);
583 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
586 static struct sm_state
*handle_canonical_for_dec(struct expression
*iter_expr
,
587 struct expression
*condition
)
589 struct expression
*iter_var
;
591 struct smatch_state
*estate
;
594 iter_var
= iter_expr
->unop
;
595 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
598 if (!estate_get_single_value(sm
->state
, &start
))
600 if (!get_implied_min(condition
->right
, &end
))
601 end
= sval_type_min(get_type(iter_var
));
602 if (get_sm_state_expr(SMATCH_EXTRA
, condition
->left
) != sm
)
605 switch (condition
->op
) {
606 case SPECIAL_NOTEQUAL
:
608 if (!sval_is_min(end
) && !sval_is_max(end
))
616 if (sval_cmp(end
, start
) > 0)
618 estate
= alloc_estate_range(end
, start
);
619 estate_set_hard_max(estate
);
620 estate_set_fuzzy_max(estate
, estate_get_fuzzy_max(estate
));
621 set_extra_expr_mod(iter_var
, estate
);
622 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
625 static struct sm_state
*handle_canonical_for_loops(struct statement
*loop
)
627 struct expression
*iter_expr
;
628 struct expression
*condition
;
630 if (!loop
->iterator_post_statement
)
632 if (loop
->iterator_post_statement
->type
!= STMT_EXPRESSION
)
634 iter_expr
= loop
->iterator_post_statement
->expression
;
635 if (!loop
->iterator_pre_condition
)
637 if (loop
->iterator_pre_condition
->type
!= EXPR_COMPARE
)
639 condition
= loop
->iterator_pre_condition
;
641 if (iter_expr
->op
== SPECIAL_INCREMENT
)
642 return handle_canonical_for_inc(iter_expr
, condition
);
643 if (iter_expr
->op
== SPECIAL_DECREMENT
)
644 return handle_canonical_for_dec(iter_expr
, condition
);
648 struct sm_state
*__extra_handle_canonical_loops(struct statement
*loop
, struct stree
**stree
)
650 struct sm_state
*ret
;
653 * Canonical loops are a hack. The proper way to handle this is to
654 * use two passes, but unfortunately, doing two passes makes parsing
655 * code twice as slow.
657 * What we do is we set the inside state here, which overwrites whatever
658 * __extra_match_condition() does. Then we set the outside state in
659 * __extra_pre_loop_hook_after().
662 __push_fake_cur_stree();
663 if (!loop
->iterator_post_statement
)
664 ret
= handle_canonical_while_count_down(loop
);
666 ret
= handle_canonical_for_loops(loop
);
667 *stree
= __pop_fake_cur_stree();
671 int __iterator_unchanged(struct sm_state
*sm
)
675 if (get_sm_state(my_id
, sm
->name
, sm
->sym
) == sm
)
680 static void while_count_down_after(struct sm_state
*sm
, struct expression
*condition
)
682 struct expression
*unop
;
684 sval_t limit
, after_value
;
686 if (!get_countdown_info(condition
, &unop
, &op
, &limit
))
688 after_value
= estate_min(sm
->state
);
690 set_extra_mod(sm
->name
, sm
->sym
, condition
->unop
, alloc_estate_sval(after_value
));
693 void __extra_pre_loop_hook_after(struct sm_state
*sm
,
694 struct statement
*iterator
,
695 struct expression
*condition
)
697 struct expression
*iter_expr
;
699 struct smatch_state
*state
;
702 while_count_down_after(sm
, condition
);
706 iter_expr
= iterator
->expression
;
708 if (condition
->type
!= EXPR_COMPARE
)
710 if (iter_expr
->op
== SPECIAL_INCREMENT
) {
711 limit
= sval_binop(estate_max(sm
->state
), '+',
712 sval_type_val(estate_type(sm
->state
), 1));
714 limit
= sval_binop(estate_min(sm
->state
), '-',
715 sval_type_val(estate_type(sm
->state
), 1));
717 if (!estate_has_hard_max(sm
->state
) && !__has_breaks()) {
718 if (iter_expr
->op
== SPECIAL_INCREMENT
)
719 state
= alloc_estate_range(estate_min(sm
->state
), limit
);
721 state
= alloc_estate_range(limit
, estate_max(sm
->state
));
723 state
= alloc_estate_sval(limit
);
725 if (!estate_has_hard_max(sm
->state
)) {
726 estate_clear_hard_max(state
);
728 if (estate_has_fuzzy_max(sm
->state
)) {
729 sval_t hmax
= estate_get_fuzzy_max(sm
->state
);
730 sval_t max
= estate_max(sm
->state
);
732 if (sval_cmp(hmax
, max
) != 0)
733 estate_clear_fuzzy_max(state
);
734 } else if (!estate_has_fuzzy_max(sm
->state
)) {
735 estate_clear_fuzzy_max(state
);
738 set_extra_mod(sm
->name
, sm
->sym
, iter_expr
, state
);
741 static struct stree
*unmatched_stree
;
742 static struct smatch_state
*unmatched_state(struct sm_state
*sm
)
744 struct smatch_state
*state
;
746 if (unmatched_stree
) {
747 state
= get_state_stree(unmatched_stree
, SMATCH_EXTRA
, sm
->name
, sm
->sym
);
751 if (parent_is_gone_var_sym(sm
->name
, sm
->sym
))
752 return alloc_estate_empty();
753 return alloc_estate_whole(estate_type(sm
->state
));
756 static void clear_the_pointed_at(struct expression
*expr
)
761 struct sm_state
*tmp
;
763 name
= expr_to_var_sym(expr
, &sym
);
767 stree
= __get_cur_stree();
768 FOR_EACH_MY_SM(SMATCH_EXTRA
, stree
, tmp
) {
769 if (tmp
->name
[0] != '*')
773 if (strcmp(tmp
->name
+ 1, name
) != 0)
775 set_extra_mod(tmp
->name
, tmp
->sym
, expr
, alloc_estate_whole(estate_type(tmp
->state
)));
776 } END_FOR_EACH_SM(tmp
);
782 static int is_const_param(struct expression
*expr
, int param
)
786 type
= get_arg_type(expr
, param
);
789 if (type
->ctype
.modifiers
& MOD_CONST
)
794 static void match_function_call(struct expression
*expr
)
796 struct expression
*arg
;
797 struct expression
*tmp
;
800 /* if we have the db this is handled in smatch_function_hooks.c */
803 if (inlinable(expr
->fn
))
806 FOR_EACH_PTR(expr
->args
, arg
) {
808 if (is_const_param(expr
->fn
, param
))
810 tmp
= strip_expr(arg
);
811 if (tmp
->type
== EXPR_PREOP
&& tmp
->op
== '&')
812 set_extra_expr_mod(tmp
->unop
, alloc_estate_whole(get_type(tmp
->unop
)));
814 clear_the_pointed_at(tmp
);
815 } END_FOR_EACH_PTR(arg
);
818 static int values_fit_type(struct expression
*left
, struct expression
*right
)
820 struct range_list
*rl
;
823 type
= get_type(left
);
826 get_absolute_rl(right
, &rl
);
827 if (type_unsigned(type
) && sval_is_negative(rl_min(rl
)))
829 if (sval_cmp(sval_type_min(type
), rl_min(rl
)) > 0)
831 if (sval_cmp(sval_type_max(type
), rl_max(rl
)) < 0)
836 static void save_chunk_info(struct expression
*left
, struct expression
*right
)
838 struct var_sym_list
*vsl
;
840 struct expression
*add_expr
;
846 if (right
->type
!= EXPR_BINOP
|| right
->op
!= '-')
848 if (!get_value(right
->left
, &sval
))
850 if (!expr_to_sym(right
->right
))
853 add_expr
= binop_expression(left
, '+', right
->right
);
854 type
= get_type(add_expr
);
857 name
= expr_to_chunk_sym_vsl(add_expr
, &sym
, &vsl
);
860 FOR_EACH_PTR(vsl
, vs
) {
861 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
862 } END_FOR_EACH_PTR(vs
);
864 set_state(SMATCH_EXTRA
, name
, sym
, alloc_estate_sval(sval_cast(type
, sval
)));
869 static void do_array_assign(struct expression
*left
, int op
, struct expression
*right
)
871 struct range_list
*rl
;
874 get_absolute_rl(right
, &rl
);
875 rl
= cast_rl(get_type(left
), rl
);
877 rl
= alloc_whole_rl(get_type(left
));
880 set_extra_array_mod(left
, alloc_estate_rl(rl
));
883 static void match_vanilla_assign(struct expression
*left
, struct expression
*right
)
885 struct range_list
*orig_rl
= NULL
;
886 struct range_list
*rl
= NULL
;
887 struct symbol
*right_sym
;
888 struct symbol
*left_type
;
889 struct symbol
*right_type
;
890 char *right_name
= NULL
;
894 struct smatch_state
*state
;
900 save_chunk_info(left
, right
);
902 name
= expr_to_var_sym(left
, &sym
);
904 if (chunk_has_array(left
))
905 do_array_assign(left
, '=', right
);
909 left_type
= get_type(left
);
910 right_type
= get_type(right
);
912 right_name
= expr_to_var_sym(right
, &right_sym
);
914 if (!__in_fake_assign
&&
915 !(right
->type
== EXPR_PREOP
&& right
->op
== '&') &&
916 right_name
&& right_sym
&&
917 values_fit_type(left
, strip_expr(right
)) &&
918 !has_symbol(right
, sym
)) {
919 set_equiv(left
, right
);
923 if (is_pointer(right
) && get_address_rl(right
, &rl
)) {
924 state
= alloc_estate_rl(rl
);
928 if (get_implied_value(right
, &sval
)) {
929 state
= alloc_estate_sval(sval_cast(left_type
, sval
));
933 if (__in_fake_assign
) {
934 struct smatch_state
*right_state
;
937 if (get_value(right
, &sval
)) {
938 sval
= sval_cast(left_type
, sval
);
939 state
= alloc_estate_sval(sval
);
943 right_state
= get_state(SMATCH_EXTRA
, right_name
, right_sym
);
945 /* simple assignment */
946 state
= clone_estate(right_state
);
950 state
= alloc_estate_rl(alloc_whole_rl(left_type
));
954 comparison
= get_comparison(left
, right
);
956 comparison
= flip_comparison(comparison
);
957 get_implied_rl(left
, &orig_rl
);
960 if (get_implied_rl(right
, &rl
)) {
961 rl
= cast_rl(left_type
, rl
);
963 filter_by_comparison(&rl
, comparison
, orig_rl
);
964 state
= alloc_estate_rl(rl
);
965 if (get_hard_max(right
, &max
)) {
966 estate_set_hard_max(state
);
967 estate_set_fuzzy_max(state
, max
);
970 rl
= alloc_whole_rl(right_type
);
971 rl
= cast_rl(left_type
, rl
);
973 filter_by_comparison(&rl
, comparison
, orig_rl
);
974 state
= alloc_estate_rl(rl
);
978 set_extra_mod(name
, sym
, left
, state
);
980 free_string(right_name
);
983 static int op_remove_assign(int op
)
986 case SPECIAL_ADD_ASSIGN
:
988 case SPECIAL_SUB_ASSIGN
:
990 case SPECIAL_MUL_ASSIGN
:
992 case SPECIAL_DIV_ASSIGN
:
994 case SPECIAL_MOD_ASSIGN
:
996 case SPECIAL_AND_ASSIGN
:
998 case SPECIAL_OR_ASSIGN
:
1000 case SPECIAL_XOR_ASSIGN
:
1002 case SPECIAL_SHL_ASSIGN
:
1003 return SPECIAL_LEFTSHIFT
;
1004 case SPECIAL_SHR_ASSIGN
:
1005 return SPECIAL_RIGHTSHIFT
;
1011 static void match_assign(struct expression
*expr
)
1013 struct range_list
*rl
= NULL
;
1014 struct expression
*left
;
1015 struct expression
*right
;
1016 struct expression
*binop_expr
;
1017 struct symbol
*left_type
;
1020 sval_t left_min
, left_max
;
1021 sval_t right_min
, right_max
;
1022 sval_t res_min
, res_max
;
1024 left
= strip_expr(expr
->left
);
1026 right
= strip_parens(expr
->right
);
1027 if (right
->type
== EXPR_CALL
&& sym_name_is("__builtin_expect", right
->fn
))
1028 right
= get_argument_from_call_expr(right
->args
, 0);
1029 while (right
->type
== EXPR_ASSIGNMENT
&& right
->op
== '=')
1030 right
= strip_parens(right
->left
);
1032 if (expr
->op
== '=' && is_condition(expr
->right
))
1033 return; /* handled in smatch_condition.c */
1034 if (expr
->op
== '=' && right
->type
== EXPR_CALL
)
1035 return; /* handled in smatch_function_hooks.c */
1036 if (expr
->op
== '=') {
1037 match_vanilla_assign(left
, right
);
1041 name
= expr_to_var_sym(left
, &sym
);
1045 left_type
= get_type(left
);
1047 res_min
= sval_type_min(left_type
);
1048 res_max
= sval_type_max(left_type
);
1051 case SPECIAL_ADD_ASSIGN
:
1052 get_absolute_max(left
, &left_max
);
1053 get_absolute_max(right
, &right_max
);
1054 if (sval_binop_overflows(left_max
, '+', sval_cast(left_type
, right_max
)))
1056 if (get_implied_min(left
, &left_min
) &&
1057 !sval_is_negative_min(left_min
) &&
1058 get_implied_min(right
, &right_min
) &&
1059 !sval_is_negative_min(right_min
)) {
1060 res_min
= sval_binop(left_min
, '+', right_min
);
1061 res_min
= sval_cast(left_type
, res_min
);
1063 if (inside_loop()) /* we are assuming loops don't lead to wrapping */
1065 res_max
= sval_binop(left_max
, '+', right_max
);
1066 res_max
= sval_cast(left_type
, res_max
);
1068 case SPECIAL_SUB_ASSIGN
:
1069 if (get_implied_max(left
, &left_max
) &&
1070 !sval_is_max(left_max
) &&
1071 get_implied_min(right
, &right_min
) &&
1072 !sval_is_min(right_min
)) {
1073 res_max
= sval_binop(left_max
, '-', right_min
);
1074 res_max
= sval_cast(left_type
, res_max
);
1078 if (get_implied_min(left
, &left_min
) &&
1079 !sval_is_min(left_min
) &&
1080 get_implied_max(right
, &right_max
) &&
1081 !sval_is_max(right_max
)) {
1082 res_min
= sval_binop(left_min
, '-', right_max
);
1083 res_min
= sval_cast(left_type
, res_min
);
1086 case SPECIAL_AND_ASSIGN
:
1087 case SPECIAL_MOD_ASSIGN
:
1088 case SPECIAL_SHL_ASSIGN
:
1089 case SPECIAL_SHR_ASSIGN
:
1090 case SPECIAL_OR_ASSIGN
:
1091 case SPECIAL_XOR_ASSIGN
:
1092 case SPECIAL_MUL_ASSIGN
:
1093 case SPECIAL_DIV_ASSIGN
:
1094 binop_expr
= binop_expression(expr
->left
,
1095 op_remove_assign(expr
->op
),
1097 if (get_absolute_rl(binop_expr
, &rl
)) {
1098 rl
= cast_rl(left_type
, rl
);
1099 set_extra_mod(name
, sym
, left
, alloc_estate_rl(rl
));
1104 rl
= cast_rl(left_type
, alloc_rl(res_min
, res_max
));
1105 set_extra_mod(name
, sym
, left
, alloc_estate_rl(rl
));
1110 static struct smatch_state
*increment_state(struct smatch_state
*state
)
1112 sval_t min
= estate_min(state
);
1113 sval_t max
= estate_max(state
);
1115 if (!estate_rl(state
))
1119 max
= sval_type_max(max
.type
);
1121 if (!sval_is_min(min
) && !sval_is_max(min
))
1123 if (!sval_is_min(max
) && !sval_is_max(max
))
1125 return alloc_estate_range(min
, max
);
1128 static struct smatch_state
*decrement_state(struct smatch_state
*state
)
1130 sval_t min
= estate_min(state
);
1131 sval_t max
= estate_max(state
);
1133 if (!estate_rl(state
))
1137 min
= sval_type_min(min
.type
);
1139 if (!sval_is_min(min
) && !sval_is_max(min
))
1141 if (!sval_is_min(max
) && !sval_is_max(max
))
1143 return alloc_estate_range(min
, max
);
1146 static void clear_pointed_at_state(struct expression
*expr
)
1148 struct symbol
*type
;
1151 * ALERT: This is sort of a mess. If it's is a struct assigment like
1152 * "foo = bar;", then that's handled by smatch_struct_assignment.c.
1153 * the same thing for p++ where "p" is a struct. Most modifications
1154 * are handled by the assignment hook or the db. Smatch_extra.c doesn't
1155 * use smatch_modification.c because we have to get the ordering right
1156 * or something. So if you have p++ where p is a pointer to a standard
1157 * c type then we handle that here. What a mess.
1159 expr
= strip_expr(expr
);
1160 type
= get_type(expr
);
1161 if (!type
|| type
->type
!= SYM_PTR
)
1163 type
= get_real_base_type(type
);
1164 if (!type
|| type
->type
!= SYM_BASETYPE
)
1166 set_extra_expr_nomod(deref_expression(expr
), alloc_estate_whole(type
));
1169 static void unop_expr(struct expression
*expr
)
1171 struct smatch_state
*state
;
1173 if (expr
->smatch_flags
& Handled
)
1177 case SPECIAL_INCREMENT
:
1178 state
= get_state_expr(SMATCH_EXTRA
, expr
->unop
);
1179 state
= increment_state(state
);
1181 state
= alloc_estate_whole(get_type(expr
));
1182 set_extra_expr_mod(expr
->unop
, state
);
1183 clear_pointed_at_state(expr
->unop
);
1185 case SPECIAL_DECREMENT
:
1186 state
= get_state_expr(SMATCH_EXTRA
, expr
->unop
);
1187 state
= decrement_state(state
);
1189 state
= alloc_estate_whole(get_type(expr
));
1190 set_extra_expr_mod(expr
->unop
, state
);
1191 clear_pointed_at_state(expr
->unop
);
1198 static void asm_expr(struct statement
*stmt
)
1201 struct expression
*expr
;
1202 struct symbol
*type
;
1205 FOR_EACH_PTR(stmt
->asm_outputs
, expr
) {
1207 case 0: /* identifier */
1208 case 1: /* constraint */
1211 case 2: /* expression */
1213 type
= get_type(strip_expr(expr
));
1214 set_extra_expr_mod(expr
, alloc_estate_whole(type
));
1217 } END_FOR_EACH_PTR(expr
);
1220 static void check_dereference(struct expression
*expr
)
1222 struct smatch_state
*state
;
1224 if (__in_fake_assign
)
1226 if (outside_of_function())
1228 state
= get_extra_state(expr
);
1230 struct range_list
*rl
;
1232 rl
= rl_intersection(estate_rl(state
), valid_ptr_rl
);
1233 if (rl_equiv(rl
, estate_rl(state
)))
1235 set_extra_expr_nomod(expr
, alloc_estate_rl(rl
));
1237 set_extra_expr_nomod(expr
, alloc_estate_range(valid_ptr_min_sval
, valid_ptr_max_sval
));
1241 static void match_dereferences(struct expression
*expr
)
1243 if (expr
->type
!= EXPR_PREOP
)
1245 /* it's saying that foo[1] = bar dereferences foo[1] */
1248 check_dereference(expr
->unop
);
1251 static void match_pointer_as_array(struct expression
*expr
)
1253 if (!is_array(expr
))
1255 check_dereference(get_array_base(expr
));
1258 static void find_dereferences(struct expression
*expr
)
1260 while (expr
->type
== EXPR_PREOP
) {
1261 if (expr
->op
== '*')
1262 check_dereference(expr
->unop
);
1263 expr
= strip_expr(expr
->unop
);
1267 static void set_param_dereferenced(struct expression
*call
, struct expression
*arg
, char *key
, char *unused
)
1272 name
= get_variable_from_key(arg
, key
, &sym
);
1274 struct smatch_state
*orig
, *new;
1275 struct range_list
*rl
;
1277 orig
= get_state(SMATCH_EXTRA
, name
, sym
);
1279 rl
= rl_intersection(estate_rl(orig
),
1280 alloc_rl(valid_ptr_min_sval
,
1281 valid_ptr_max_sval
));
1282 new = alloc_estate_rl(rl
);
1284 new = alloc_estate_range(valid_ptr_min_sval
, valid_ptr_max_sval
);
1287 set_extra_nomod(name
, sym
, NULL
, new);
1291 find_dereferences(arg
);
1294 static sval_t
add_one(sval_t sval
)
1300 static int handle_postop_inc(struct expression
*left
, int op
, struct expression
*right
)
1302 struct statement
*stmt
;
1303 struct expression
*cond
;
1304 struct smatch_state
*true_state
, *false_state
;
1309 * If we're decrementing here then that's a canonical while count down
1310 * so it's handled already. We're only handling loops like:
1312 * do { ... } while (i++ < 3);
1315 if (left
->type
!= EXPR_POSTOP
|| left
->op
!= SPECIAL_INCREMENT
)
1318 stmt
= __cur_stmt
->parent
;
1321 if (stmt
->type
== STMT_COMPOUND
)
1322 stmt
= stmt
->parent
;
1323 if (!stmt
|| stmt
->type
!= STMT_ITERATOR
|| !stmt
->iterator_post_condition
)
1326 cond
= strip_expr(stmt
->iterator_post_condition
);
1327 if (cond
->type
!= EXPR_COMPARE
|| cond
->op
!= op
)
1329 if (left
!= strip_expr(cond
->left
) || right
!= strip_expr(cond
->right
))
1332 if (!get_implied_value(left
->unop
, &start
))
1334 if (!get_implied_value(right
, &limit
))
1337 if (sval_cmp(start
, limit
) > 0)
1342 case SPECIAL_UNSIGNED_LT
:
1345 case SPECIAL_UNSIGNED_LTE
:
1346 limit
= add_one(limit
);
1352 true_state
= alloc_estate_range(add_one(start
), limit
);
1353 false_state
= alloc_estate_range(add_one(limit
), add_one(limit
));
1355 /* Currently we just discard the false state but when two passes is
1356 * implimented correctly then it will use it.
1359 set_extra_expr_true_false(left
->unop
, true_state
, false_state
);
1364 static bool is_impossible_variable(struct expression
*expr
)
1366 struct smatch_state
*state
;
1368 state
= get_extra_state(expr
);
1369 if (state
&& !estate_rl(state
))
1374 static void handle_comparison(struct symbol
*type
, struct expression
*left
, int op
, struct expression
*right
)
1376 struct range_list
*left_orig
;
1377 struct range_list
*left_true
;
1378 struct range_list
*left_false
;
1379 struct range_list
*right_orig
;
1380 struct range_list
*right_true
;
1381 struct range_list
*right_false
;
1382 struct smatch_state
*left_true_state
;
1383 struct smatch_state
*left_false_state
;
1384 struct smatch_state
*right_true_state
;
1385 struct smatch_state
*right_false_state
;
1386 sval_t dummy
, hard_max
;
1387 int left_postop
= 0;
1388 int right_postop
= 0;
1390 if (left
->op
== SPECIAL_INCREMENT
|| left
->op
== SPECIAL_DECREMENT
) {
1391 if (left
->type
== EXPR_POSTOP
) {
1392 left
->smatch_flags
|= Handled
;
1393 left_postop
= left
->op
;
1394 if (handle_postop_inc(left
, op
, right
))
1397 left
= strip_parens(left
->unop
);
1399 while (left
->type
== EXPR_ASSIGNMENT
)
1400 left
= strip_parens(left
->left
);
1402 if (right
->op
== SPECIAL_INCREMENT
|| right
->op
== SPECIAL_DECREMENT
) {
1403 if (right
->type
== EXPR_POSTOP
) {
1404 right
->smatch_flags
|= Handled
;
1405 right_postop
= right
->op
;
1407 right
= strip_parens(right
->unop
);
1410 if (is_impossible_variable(left
) || is_impossible_variable(right
))
1413 get_real_absolute_rl(left
, &left_orig
);
1414 left_orig
= cast_rl(type
, left_orig
);
1416 get_real_absolute_rl(right
, &right_orig
);
1417 right_orig
= cast_rl(type
, right_orig
);
1419 split_comparison_rl(left_orig
, op
, right_orig
, &left_true
, &left_false
, &right_true
, &right_false
);
1421 left_true
= rl_truncate_cast(get_type(strip_expr(left
)), left_true
);
1422 left_false
= rl_truncate_cast(get_type(strip_expr(left
)), left_false
);
1423 right_true
= rl_truncate_cast(get_type(strip_expr(right
)), right_true
);
1424 right_false
= rl_truncate_cast(get_type(strip_expr(right
)), right_false
);
1426 if (!left_true
|| !left_false
) {
1427 struct range_list
*tmp_true
, *tmp_false
;
1429 split_comparison_rl(alloc_whole_rl(type
), op
, right_orig
, &tmp_true
, &tmp_false
, NULL
, NULL
);
1430 tmp_true
= rl_truncate_cast(get_type(strip_expr(left
)), tmp_true
);
1431 tmp_false
= rl_truncate_cast(get_type(strip_expr(left
)), tmp_false
);
1432 if (tmp_true
&& tmp_false
)
1433 __save_imaginary_state(left
, tmp_true
, tmp_false
);
1436 if (!right_true
|| !right_false
) {
1437 struct range_list
*tmp_true
, *tmp_false
;
1439 split_comparison_rl(alloc_whole_rl(type
), op
, right_orig
, NULL
, NULL
, &tmp_true
, &tmp_false
);
1440 tmp_true
= rl_truncate_cast(get_type(strip_expr(right
)), tmp_true
);
1441 tmp_false
= rl_truncate_cast(get_type(strip_expr(right
)), tmp_false
);
1442 if (tmp_true
&& tmp_false
)
1443 __save_imaginary_state(right
, tmp_true
, tmp_false
);
1446 left_true_state
= alloc_estate_rl(left_true
);
1447 left_false_state
= alloc_estate_rl(left_false
);
1448 right_true_state
= alloc_estate_rl(right_true
);
1449 right_false_state
= alloc_estate_rl(right_false
);
1453 case SPECIAL_UNSIGNED_LT
:
1454 case SPECIAL_UNSIGNED_LTE
:
1456 if (get_hard_max(right
, &dummy
))
1457 estate_set_hard_max(left_true_state
);
1458 if (get_hard_max(left
, &dummy
))
1459 estate_set_hard_max(right_false_state
);
1462 case SPECIAL_UNSIGNED_GT
:
1463 case SPECIAL_UNSIGNED_GTE
:
1465 if (get_hard_max(left
, &dummy
))
1466 estate_set_hard_max(right_true_state
);
1467 if (get_hard_max(right
, &dummy
))
1468 estate_set_hard_max(left_false_state
);
1474 case SPECIAL_UNSIGNED_LT
:
1475 case SPECIAL_UNSIGNED_LTE
:
1477 if (get_hard_max(right
, &hard_max
)) {
1478 if (op
== '<' || op
== SPECIAL_UNSIGNED_LT
)
1480 estate_set_fuzzy_max(left_true_state
, hard_max
);
1482 if (get_implied_value(right
, &hard_max
)) {
1483 if (op
== SPECIAL_UNSIGNED_LTE
||
1486 estate_set_fuzzy_max(left_false_state
, hard_max
);
1488 if (get_hard_max(left
, &hard_max
)) {
1489 if (op
== SPECIAL_UNSIGNED_LTE
||
1492 estate_set_fuzzy_max(right_false_state
, hard_max
);
1494 if (get_implied_value(left
, &hard_max
)) {
1495 if (op
== '<' || op
== SPECIAL_UNSIGNED_LT
)
1497 estate_set_fuzzy_max(right_true_state
, hard_max
);
1501 case SPECIAL_UNSIGNED_GT
:
1502 case SPECIAL_UNSIGNED_GTE
:
1504 if (get_hard_max(left
, &hard_max
)) {
1505 if (op
== '>' || op
== SPECIAL_UNSIGNED_GT
)
1507 estate_set_fuzzy_max(right_true_state
, hard_max
);
1509 if (get_implied_value(left
, &hard_max
)) {
1510 if (op
== SPECIAL_UNSIGNED_GTE
||
1513 estate_set_fuzzy_max(right_false_state
, hard_max
);
1515 if (get_hard_max(right
, &hard_max
)) {
1516 if (op
== SPECIAL_UNSIGNED_LTE
||
1519 estate_set_fuzzy_max(left_false_state
, hard_max
);
1521 if (get_implied_value(right
, &hard_max
)) {
1523 op
== SPECIAL_UNSIGNED_GT
)
1525 estate_set_fuzzy_max(left_true_state
, hard_max
);
1529 if (get_hard_max(left
, &hard_max
))
1530 estate_set_fuzzy_max(right_true_state
, hard_max
);
1531 if (get_hard_max(right
, &hard_max
))
1532 estate_set_fuzzy_max(left_true_state
, hard_max
);
1536 if (get_hard_max(left
, &hard_max
)) {
1537 estate_set_hard_max(left_true_state
);
1538 estate_set_hard_max(left_false_state
);
1540 if (get_hard_max(right
, &hard_max
)) {
1541 estate_set_hard_max(right_true_state
);
1542 estate_set_hard_max(right_false_state
);
1545 if (left_postop
== SPECIAL_INCREMENT
) {
1546 left_true_state
= increment_state(left_true_state
);
1547 left_false_state
= increment_state(left_false_state
);
1549 if (left_postop
== SPECIAL_DECREMENT
) {
1550 left_true_state
= decrement_state(left_true_state
);
1551 left_false_state
= decrement_state(left_false_state
);
1553 if (right_postop
== SPECIAL_INCREMENT
) {
1554 right_true_state
= increment_state(right_true_state
);
1555 right_false_state
= increment_state(right_false_state
);
1557 if (right_postop
== SPECIAL_DECREMENT
) {
1558 right_true_state
= decrement_state(right_true_state
);
1559 right_false_state
= decrement_state(right_false_state
);
1562 if (estate_rl(left_true_state
) && estates_equiv(left_true_state
, left_false_state
)) {
1563 left_true_state
= NULL
;
1564 left_false_state
= NULL
;
1567 if (estate_rl(right_true_state
) && estates_equiv(right_true_state
, right_false_state
)) {
1568 right_true_state
= NULL
;
1569 right_false_state
= NULL
;
1572 /* Don't introduce new states for known true/false conditions */
1573 if (rl_equiv(left_orig
, estate_rl(left_true_state
)))
1574 left_true_state
= NULL
;
1575 if (rl_equiv(left_orig
, estate_rl(left_false_state
)))
1576 left_false_state
= NULL
;
1577 if (rl_equiv(right_orig
, estate_rl(right_true_state
)))
1578 right_true_state
= NULL
;
1579 if (rl_equiv(right_orig
, estate_rl(right_false_state
)))
1580 right_false_state
= NULL
;
1582 set_extra_expr_true_false(left
, left_true_state
, left_false_state
);
1583 set_extra_expr_true_false(right
, right_true_state
, right_false_state
);
1586 static int is_simple_math(struct expression
*expr
)
1590 if (expr
->type
!= EXPR_BINOP
)
1601 static void move_known_values(struct expression
**left_p
, struct expression
**right_p
)
1603 struct expression
*left
= *left_p
;
1604 struct expression
*right
= *right_p
;
1607 if (get_implied_value(left
, &sval
)) {
1608 if (!is_simple_math(right
))
1610 if (get_implied_value(right
, &dummy
))
1612 if (right
->op
== '*') {
1615 if (!get_value(right
->right
, &divisor
))
1617 if (divisor
.value
== 0 && sval
.value
% divisor
.value
)
1619 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->right
);
1620 *right_p
= right
->left
;
1623 if (right
->op
== '+' && get_value(right
->left
, &sval
)) {
1624 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->left
);
1625 *right_p
= right
->right
;
1628 if (get_value(right
->right
, &sval
)) {
1629 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->right
);
1630 *right_p
= right
->left
;
1635 if (get_implied_value(right
, &sval
)) {
1636 if (!is_simple_math(left
))
1638 if (get_implied_value(left
, &dummy
))
1640 if (left
->op
== '*') {
1643 if (!get_value(left
->right
, &divisor
))
1645 if (divisor
.value
== 0 && sval
.value
% divisor
.value
)
1647 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->right
);
1648 *left_p
= left
->left
;
1651 if (left
->op
== '+' && get_value(left
->left
, &sval
)) {
1652 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->left
);
1653 *left_p
= left
->right
;
1657 if (get_value(left
->right
, &sval
)) {
1658 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->right
);
1659 *left_p
= left
->left
;
1667 * The reason for do_simple_algebra() is to solve things like:
1668 * if (foo > 66 || foo + bar > 64) {
1669 * "foo" is not really a known variable so it won't be handled by
1670 * move_known_variables() but it's a super common idiom.
1673 static int do_simple_algebra(struct expression
**left_p
, struct expression
**right_p
)
1675 struct expression
*left
= *left_p
;
1676 struct expression
*right
= *right_p
;
1677 struct range_list
*rl
;
1680 if (left
->type
!= EXPR_BINOP
|| left
->op
!= '+')
1682 if (can_integer_overflow(get_type(left
), left
))
1684 if (!get_implied_value(right
, &tmp
))
1687 if (!get_implied_value(left
->left
, &tmp
) &&
1688 get_implied_rl(left
->left
, &rl
) &&
1690 *right_p
= binop_expression(right
, '-', left
->left
);
1691 *left_p
= left
->right
;
1694 if (!get_implied_value(left
->right
, &tmp
) &&
1695 get_implied_rl(left
->right
, &rl
) &&
1697 *right_p
= binop_expression(right
, '-', left
->right
);
1698 *left_p
= left
->left
;
1705 static int match_func_comparison(struct expression
*expr
)
1707 struct expression
*left
= strip_expr(expr
->left
);
1708 struct expression
*right
= strip_expr(expr
->right
);
1712 * fixme: think about this harder. We should always be trying to limit
1713 * the non-call side as well. If we can't determine the limitter does
1714 * that mean we aren't querying the database and are missing important
1718 if (left
->type
== EXPR_CALL
) {
1719 if (get_implied_value(left
, &sval
)) {
1720 handle_comparison(get_type(expr
), left
, expr
->op
, right
);
1723 function_comparison(left
, expr
->op
, right
);
1727 if (right
->type
== EXPR_CALL
) {
1728 if (get_implied_value(right
, &sval
)) {
1729 handle_comparison(get_type(expr
), left
, expr
->op
, right
);
1732 function_comparison(left
, expr
->op
, right
);
1739 /* Handle conditions like "if (foo + bar < foo) {" */
1740 static int handle_integer_overflow_test(struct expression
*expr
)
1742 struct expression
*left
, *right
;
1743 struct symbol
*type
;
1744 sval_t left_min
, right_min
, min
, max
;
1746 if (expr
->op
!= '<' && expr
->op
!= SPECIAL_UNSIGNED_LT
)
1749 left
= strip_parens(expr
->left
);
1750 right
= strip_parens(expr
->right
);
1752 if (left
->op
!= '+')
1755 type
= get_type(expr
);
1758 if (type_positive_bits(type
) == 32) {
1759 max
.type
= &uint_ctype
;
1760 max
.uvalue
= (unsigned int)-1;
1761 } else if (type_positive_bits(type
) == 64) {
1762 max
.type
= &ulong_ctype
;
1763 max
.value
= (unsigned long long)-1;
1768 if (!expr_equiv(left
->left
, right
) && !expr_equiv(left
->right
, right
))
1771 get_absolute_min(left
->left
, &left_min
);
1772 get_absolute_min(left
->right
, &right_min
);
1773 min
= sval_binop(left_min
, '+', right_min
);
1775 set_extra_chunk_true_false(left
, NULL
, alloc_estate_range(min
, max
));
1779 static void match_comparison(struct expression
*expr
)
1781 struct expression
*left_orig
= strip_parens(expr
->left
);
1782 struct expression
*right_orig
= strip_parens(expr
->right
);
1783 struct expression
*left
, *right
, *tmp
;
1784 struct expression
*prev
;
1785 struct symbol
*type
;
1788 if (match_func_comparison(expr
))
1791 type
= get_type(expr
);
1793 type
= &llong_ctype
;
1795 if (handle_integer_overflow_test(expr
))
1800 move_known_values(&left
, &right
);
1801 handle_comparison(type
, left
, expr
->op
, right
);
1805 if (do_simple_algebra(&left
, &right
))
1806 handle_comparison(type
, left
, expr
->op
, right
);
1808 prev
= get_assigned_expr(left_orig
);
1809 if (is_simple_math(prev
) && has_variable(prev
, left_orig
) == 0) {
1812 move_known_values(&left
, &right
);
1813 handle_comparison(type
, left
, expr
->op
, right
);
1816 prev
= get_assigned_expr(right_orig
);
1817 if (is_simple_math(prev
) && has_variable(prev
, right_orig
) == 0) {
1820 move_known_values(&left
, &right
);
1821 handle_comparison(type
, left
, expr
->op
, right
);
1827 if (get_last_expr_from_expression_stmt(left_orig
)) {
1828 left
= get_last_expr_from_expression_stmt(left_orig
);
1831 if (get_last_expr_from_expression_stmt(right_orig
)) {
1832 right
= get_last_expr_from_expression_stmt(right_orig
);
1840 while ((tmp
= get_assigned_expr(left
))) {
1843 left
= strip_expr(tmp
);
1846 while ((tmp
= get_assigned_expr(right
))) {
1849 right
= strip_expr(tmp
);
1852 handle_comparison(type
, left
, expr
->op
, right
);
1855 static sval_t
get_high_mask(sval_t known
)
1863 for (i
= type_bits(known
.type
) - 1; i
>= 0; i
--) {
1864 if (known
.uvalue
& (1ULL << i
))
1865 ret
.uvalue
|= (1ULL << i
);
1873 static void handle_AND_op(struct expression
*var
, sval_t known
)
1875 struct range_list
*orig_rl
;
1876 struct range_list
*true_rl
= NULL
;
1877 struct range_list
*false_rl
= NULL
;
1879 sval_t low_mask
= known
;
1883 get_absolute_rl(var
, &orig_rl
);
1885 if (known
.value
> 0) {
1886 bit
= ffsll(known
.value
) - 1;
1887 low_mask
.uvalue
= (1ULL << bit
) - 1;
1888 true_rl
= remove_range(orig_rl
, sval_type_val(known
.type
, 0), low_mask
);
1890 high_mask
= get_high_mask(known
);
1891 if (high_mask
.value
) {
1892 bit
= ffsll(high_mask
.value
) - 1;
1893 low_mask
.uvalue
= (1ULL << bit
) - 1;
1896 if (sval_is_negative(rl_min(orig_rl
)))
1897 false_rl
= remove_range(false_rl
, sval_type_min(known
.type
), sval_type_val(known
.type
, -1));
1898 false_rl
= remove_range(false_rl
, low_mask
, sval_type_max(known
.type
));
1899 if (type_signed(high_mask
.type
) && type_unsigned(rl_type(false_rl
))) {
1900 false_rl
= remove_range(false_rl
,
1901 sval_type_val(rl_type(false_rl
), sval_type_max(known
.type
).uvalue
),
1902 sval_type_val(rl_type(false_rl
), -1));
1904 } else if (known
.value
== 1 &&
1905 get_hard_max(var
, &max
) &&
1906 sval_cmp(max
, rl_max(orig_rl
)) == 0 &&
1908 false_rl
= remove_range(orig_rl
, max
, max
);
1910 set_extra_expr_true_false(var
,
1911 true_rl
? alloc_estate_rl(true_rl
) : NULL
,
1912 false_rl
? alloc_estate_rl(false_rl
) : NULL
);
1915 static void handle_AND_condition(struct expression
*expr
)
1919 if (get_implied_value(expr
->left
, &known
))
1920 handle_AND_op(expr
->right
, known
);
1921 else if (get_implied_value(expr
->right
, &known
))
1922 handle_AND_op(expr
->left
, known
);
1925 static void handle_MOD_condition(struct expression
*expr
)
1927 struct range_list
*orig_rl
;
1928 struct range_list
*true_rl
;
1929 struct range_list
*false_rl
= NULL
;
1935 if (!get_implied_value(expr
->right
, &right
) || right
.value
== 0)
1937 get_absolute_rl(expr
->left
, &orig_rl
);
1939 zero
.type
= rl_type(orig_rl
);
1941 /* We're basically dorking around the min and max here */
1942 true_rl
= remove_range(orig_rl
, zero
, zero
);
1943 if (!sval_is_max(rl_max(true_rl
)) &&
1944 !(rl_max(true_rl
).value
% right
.value
))
1945 true_rl
= remove_range(true_rl
, rl_max(true_rl
), rl_max(true_rl
));
1947 if (rl_equiv(true_rl
, orig_rl
))
1950 if (sval_is_positive(rl_min(orig_rl
)) &&
1951 (rl_max(orig_rl
).value
- rl_min(orig_rl
).value
) / right
.value
< 5) {
1955 add
= rl_min(orig_rl
);
1956 add
.value
+= right
.value
- (add
.value
% right
.value
);
1957 add
.value
-= right
.value
;
1959 for (i
= 0; i
< 5; i
++) {
1960 add
.value
+= right
.value
;
1961 if (add
.value
> rl_max(orig_rl
).value
)
1963 add_range(&false_rl
, add
, add
);
1966 if (rl_min(orig_rl
).uvalue
!= 0 &&
1967 rl_min(orig_rl
).uvalue
< right
.uvalue
) {
1968 sval_t chop
= right
;
1970 false_rl
= remove_range(orig_rl
, zero
, chop
);
1973 if (!sval_is_max(rl_max(orig_rl
)) &&
1974 (rl_max(orig_rl
).value
% right
.value
)) {
1975 sval_t chop
= rl_max(orig_rl
);
1976 chop
.value
-= chop
.value
% right
.value
;
1979 false_rl
= clone_rl(orig_rl
);
1980 false_rl
= remove_range(false_rl
, chop
, rl_max(orig_rl
));
1984 set_extra_expr_true_false(expr
->left
,
1985 true_rl
? alloc_estate_rl(true_rl
) : NULL
,
1986 false_rl
? alloc_estate_rl(false_rl
) : NULL
);
1989 /* this is actually hooked from smatch_implied.c... it's hacky, yes */
1990 void __extra_match_condition(struct expression
*expr
)
1992 struct smatch_state
*pre_state
;
1993 struct smatch_state
*true_state
;
1994 struct smatch_state
*false_state
;
1995 struct range_list
*pre_rl
;
1997 expr
= strip_expr(expr
);
1998 switch (expr
->type
) {
2000 function_comparison(expr
, SPECIAL_NOTEQUAL
, zero_expr());
2007 zero
= sval_blank(expr
);
2010 pre_state
= get_extra_state(expr
);
2011 if (estate_is_empty(pre_state
))
2014 pre_rl
= estate_rl(pre_state
);
2016 get_absolute_rl(expr
, &pre_rl
);
2017 if (possibly_true_rl(pre_rl
, SPECIAL_EQUAL
, rl_zero()))
2018 false_state
= alloc_estate_sval(zero
);
2020 false_state
= alloc_estate_empty();
2021 true_state
= alloc_estate_rl(remove_range(pre_rl
, zero
, zero
));
2022 set_extra_expr_true_false(expr
, true_state
, false_state
);
2026 match_comparison(expr
);
2028 case EXPR_ASSIGNMENT
:
2029 __extra_match_condition(expr
->left
);
2032 if (expr
->op
== '&')
2033 handle_AND_condition(expr
);
2034 if (expr
->op
== '%')
2035 handle_MOD_condition(expr
);
2040 static void assume_indexes_are_valid(struct expression
*expr
)
2042 struct expression
*array_expr
;
2044 struct expression
*offset
;
2045 struct symbol
*offset_type
;
2046 struct range_list
*rl_before
;
2047 struct range_list
*rl_after
;
2048 struct range_list
*filter
= NULL
;
2051 expr
= strip_expr(expr
);
2052 if (!is_array(expr
))
2055 offset
= get_array_offset(expr
);
2056 offset_type
= get_type(offset
);
2057 if (offset_type
&& type_signed(offset_type
)) {
2058 filter
= alloc_rl(sval_type_min(offset_type
),
2059 sval_type_val(offset_type
, -1));
2062 array_expr
= get_array_base(expr
);
2063 array_size
= get_real_array_size(array_expr
);
2064 if (array_size
> 1) {
2065 size
= sval_type_val(offset_type
, array_size
);
2066 add_range(&filter
, size
, sval_type_max(offset_type
));
2071 get_absolute_rl(offset
, &rl_before
);
2072 rl_after
= rl_filter(rl_before
, filter
);
2073 if (rl_equiv(rl_before
, rl_after
))
2075 set_extra_expr_nomod(offset
, alloc_estate_rl(rl_after
));
2078 /* returns 1 if it is not possible for expr to be value, otherwise returns 0 */
2079 int implied_not_equal(struct expression
*expr
, long long val
)
2081 return !possibly_false(expr
, SPECIAL_NOTEQUAL
, value_expr(val
));
2084 int implied_not_equal_name_sym(char *name
, struct symbol
*sym
, long long val
)
2086 struct smatch_state
*estate
;
2088 estate
= get_state(SMATCH_EXTRA
, name
, sym
);
2091 if (!rl_has_sval(estate_rl(estate
), sval_type_val(estate_type(estate
), 0)))
2096 int parent_is_null_var_sym(const char *name
, struct symbol
*sym
)
2101 struct smatch_state
*state
;
2103 strncpy(buf
, name
, sizeof(buf
) - 1);
2104 buf
[sizeof(buf
) - 1] = '\0';
2107 while (*start
== '*') {
2109 state
= get_state(SMATCH_EXTRA
, start
, sym
);
2112 if (!estate_rl(state
))
2114 if (estate_min(state
).value
== 0 &&
2115 estate_max(state
).value
== 0)
2120 while (*start
== '&')
2123 while ((end
= strrchr(start
, '-'))) {
2125 state
= __get_state(SMATCH_EXTRA
, start
, sym
);
2128 if (estate_min(state
).value
== 0 &&
2129 estate_max(state
).value
== 0)
2135 int parent_is_null(struct expression
*expr
)
2141 expr
= strip_expr(expr
);
2142 var
= expr_to_var_sym(expr
, &sym
);
2145 ret
= parent_is_null_var_sym(var
, sym
);
2151 static int param_used_callback(void *found
, int argc
, char **argv
, char **azColName
)
2157 static int filter_unused_kzalloc_info(struct expression
*call
, int param
, char *printed_name
, struct sm_state
*sm
)
2162 /* for function pointers assume everything is used */
2163 if (call
->fn
->type
!= EXPR_SYMBOL
)
2167 * kzalloc() information is treated as special because so there is just
2168 * a lot of stuff initialized to zero and it makes building the database
2169 * take hours and hours.
2171 * In theory, we should just remove this line and not pass any unused
2172 * information, but I'm not sure enough that this code works so I want
2173 * to hold off on that for now.
2175 if (!estate_get_single_value(sm
->state
, &sval
) || sval
.value
!= 0)
2178 run_sql(¶m_used_callback
, &found
,
2179 "select * from return_implies where %s and type = %d and parameter = %d and key = '%s';",
2180 get_static_filter(call
->fn
->symbol
), PARAM_USED
, param
, printed_name
);
2184 /* If the database is not built yet, then assume everything is used */
2185 run_sql(¶m_used_callback
, &found
,
2186 "select * from return_implies where %s and type = %d;",
2187 get_static_filter(call
->fn
->symbol
), PARAM_USED
);
2194 struct range_list
*intersect_with_real_abs_var_sym(const char *name
, struct symbol
*sym
, struct range_list
*start
)
2196 struct smatch_state
*state
;
2199 * Here is the difference between implied value and real absolute, say
2204 * Then you know that a is 0-255. That's real absolute. But you don't
2205 * know for sure that it actually goes up to 255. So it's not implied.
2206 * Implied indicates a degree of certainty.
2208 * But then say you cap "a" at 8. That means you know it goes up to
2209 * 8. So now the implied value is s32min-8. But you can combine it
2210 * with the real absolute to say that actually it's 0-8.
2212 * We are combining it here. But now that I think about it, this is
2213 * probably not the ideal place to combine it because it should proably
2214 * be done earlier. Oh well, this is an improvement on what was there
2215 * before so I'm going to commit this code.
2219 state
= get_real_absolute_state_var_sym(name
, sym
);
2220 if (!state
|| !estate_rl(state
))
2223 return rl_intersection(estate_rl(state
), start
);
2226 struct range_list
*intersect_with_real_abs_expr(struct expression
*expr
, struct range_list
*start
)
2228 struct smatch_state
*state
;
2230 state
= get_real_absolute_state(expr
);
2231 if (!state
|| !estate_rl(state
))
2234 return rl_intersection(estate_rl(state
), start
);
2237 static void struct_member_callback(struct expression
*call
, int param
, char *printed_name
, struct sm_state
*sm
)
2239 struct range_list
*rl
;
2241 if (estate_is_whole(sm
->state
))
2243 if (filter_unused_kzalloc_info(call
, param
, printed_name
, sm
))
2245 rl
= estate_rl(sm
->state
);
2246 rl
= intersect_with_real_abs_var_sym(sm
->name
, sm
->sym
, rl
);
2247 sql_insert_caller_info(call
, PARAM_VALUE
, param
, printed_name
, show_rl(rl
));
2248 if (estate_has_fuzzy_max(sm
->state
))
2249 sql_insert_caller_info(call
, FUZZY_MAX
, param
, printed_name
,
2250 sval_to_str(estate_get_fuzzy_max(sm
->state
)));
2253 static void returned_struct_members(int return_id
, char *return_ranges
, struct expression
*expr
)
2255 struct symbol
*returned_sym
;
2256 struct sm_state
*sm
;
2257 const char *param_name
;
2261 returned_sym
= expr_to_sym(expr
);
2265 FOR_EACH_MY_SM(my_id
, __get_cur_stree(), sm
) {
2266 if (!estate_rl(sm
->state
))
2268 if (returned_sym
!= sm
->sym
)
2271 param_name
= get_param_name(sm
);
2274 if (strcmp(param_name
, "$") == 0)
2276 compare_str
= name_sym_to_param_comparison(sm
->name
, sm
->sym
);
2277 if (!compare_str
&& estate_is_whole(sm
->state
))
2279 snprintf(buf
, sizeof(buf
), "%s%s", sm
->state
->name
, compare_str
?: "");
2281 sql_insert_return_states(return_id
, return_ranges
, PARAM_VALUE
,
2282 -1, param_name
, buf
);
2283 } END_FOR_EACH_SM(sm
);
2286 static void db_limited_before(void)
2288 unmatched_stree
= clone_stree(__get_cur_stree());
2291 static void db_limited_after(void)
2293 free_stree(&unmatched_stree
);
2296 static int rl_fits_in_type(struct range_list
*rl
, struct symbol
*type
)
2298 if (type_bits(rl_type(rl
)) <= type_bits(type
))
2300 if (sval_cmp(rl_max(rl
), sval_type_max(type
)) > 0)
2302 if (sval_is_negative(rl_min(rl
)) &&
2303 sval_cmp(rl_min(rl
), sval_type_min(type
)) < 0)
2308 static int basically_the_same(struct range_list
*orig
, struct range_list
*new)
2310 if (rl_equiv(orig
, new))
2314 * The whole range is essentially the same as 0,4096-27777777777 so
2315 * don't overwrite the implications just to store that.
2318 if (rl_type(orig
)->type
== SYM_PTR
&&
2319 is_whole_rl(orig
) &&
2320 rl_min(new).value
== 0 &&
2321 rl_max(new).value
== valid_ptr_max
)
2326 static void db_param_limit_binops(struct expression
*arg
, char *key
, struct range_list
*rl
)
2328 struct range_list
*left_rl
;
2329 sval_t zero
= { .type
= rl_type(rl
), };
2334 if (!get_implied_value(arg
->right
, &sval
))
2336 if (can_integer_overflow(get_type(arg
), arg
))
2339 left_rl
= rl_binop(rl
, '/', alloc_rl(sval
, sval
));
2340 if (!rl_has_sval(rl
, zero
))
2341 left_rl
= remove_range(left_rl
, zero
, zero
);
2343 set_extra_expr_nomod(arg
->left
, alloc_estate_rl(left_rl
));
2346 static void db_param_limit_filter(struct expression
*expr
, int param
, char *key
, char *value
, enum info_type op
)
2348 struct expression
*arg
;
2351 struct var_sym_list
*vsl
= NULL
;
2352 struct sm_state
*sm
;
2353 struct symbol
*compare_type
, *var_type
;
2354 struct range_list
*rl
;
2355 struct range_list
*limit
;
2356 struct range_list
*new;
2358 struct symbol
*tmp_sym
;
2360 while (expr
->type
== EXPR_ASSIGNMENT
)
2361 expr
= strip_expr(expr
->right
);
2362 if (expr
->type
!= EXPR_CALL
)
2365 arg
= get_argument_from_call_expr(expr
->args
, param
);
2369 name
= get_chunk_from_key(arg
, key
, &sym
, &vsl
);
2372 if (op
!= PARAM_LIMIT
&& !sym
)
2375 if (strcmp(key
, "$") == 0)
2376 compare_type
= get_arg_type(expr
->fn
, param
);
2378 compare_type
= get_member_type_from_key(arg
, key
);
2380 sm
= get_sm_state(SMATCH_EXTRA
, name
, sym
);
2382 rl
= estate_rl(sm
->state
);
2384 rl
= alloc_whole_rl(compare_type
);
2386 if (op
== PARAM_LIMIT
&& !rl_fits_in_type(rl
, compare_type
))
2389 call_results_to_rl(expr
, compare_type
, value
, &limit
);
2390 new = rl_intersection(rl
, limit
);
2392 var_type
= get_member_type_from_key(arg
, key
);
2393 new = cast_rl(var_type
, new);
2395 /* We want to preserve the implications here */
2396 if (sm
&& basically_the_same(estate_rl(sm
->state
), new))
2398 tmp_name
= map_long_to_short_name_sym(name
, sym
, &tmp_sym
);
2399 if (tmp_name
&& tmp_sym
) {
2405 if (op
== PARAM_LIMIT
)
2406 set_extra_nomod_vsl(name
, sym
, vsl
, NULL
, alloc_estate_rl(new));
2408 set_extra_mod(name
, sym
, NULL
, alloc_estate_rl(new));
2410 if (op
== PARAM_LIMIT
&& arg
->type
== EXPR_BINOP
)
2411 db_param_limit_binops(arg
, key
, new);
2416 static void db_param_limit(struct expression
*expr
, int param
, char *key
, char *value
)
2418 db_param_limit_filter(expr
, param
, key
, value
, PARAM_LIMIT
);
2421 static void db_param_filter(struct expression
*expr
, int param
, char *key
, char *value
)
2423 db_param_limit_filter(expr
, param
, key
, value
, PARAM_FILTER
);
2426 static void db_param_add_set(struct expression
*expr
, int param
, char *key
, char *value
, enum info_type op
)
2428 struct expression
*arg
;
2429 char *name
, *tmp_name
;
2430 struct symbol
*sym
, *tmp_sym
;
2431 struct symbol
*param_type
, *arg_type
;
2432 struct smatch_state
*state
;
2433 struct range_list
*new = NULL
;
2434 struct range_list
*added
= NULL
;
2436 while (expr
->type
== EXPR_ASSIGNMENT
)
2437 expr
= strip_expr(expr
->right
);
2438 if (expr
->type
!= EXPR_CALL
)
2441 arg
= get_argument_from_call_expr(expr
->args
, param
);
2445 arg_type
= get_arg_type_from_key(expr
->fn
, param
, arg
, key
);
2446 param_type
= get_member_type_from_key(arg
, key
);
2447 name
= get_variable_from_key(arg
, key
, &sym
);
2451 state
= get_state(SMATCH_EXTRA
, name
, sym
);
2453 new = estate_rl(state
);
2455 call_results_to_rl(expr
, arg_type
, value
, &added
);
2456 added
= cast_rl(param_type
, added
);
2457 if (op
== PARAM_SET
)
2460 new = rl_union(new, added
);
2462 tmp_name
= map_long_to_short_name_sym_nostack(name
, sym
, &tmp_sym
);
2463 if (tmp_name
&& tmp_sym
) {
2468 set_extra_mod(name
, sym
, NULL
, alloc_estate_rl(new));
2473 static void db_param_add(struct expression
*expr
, int param
, char *key
, char *value
)
2475 in_param_set
= true;
2476 db_param_add_set(expr
, param
, key
, value
, PARAM_ADD
);
2477 in_param_set
= false;
2480 static void db_param_set(struct expression
*expr
, int param
, char *key
, char *value
)
2482 in_param_set
= true;
2483 db_param_add_set(expr
, param
, key
, value
, PARAM_SET
);
2484 in_param_set
= false;
2487 static void db_param_value(struct expression
*expr
, int param
, char *key
, char *value
)
2489 struct expression
*call
;
2492 struct symbol
*type
;
2493 struct range_list
*rl
= NULL
;
2499 while (call
->type
== EXPR_ASSIGNMENT
)
2500 call
= strip_expr(call
->right
);
2501 if (call
->type
!= EXPR_CALL
)
2504 type
= get_member_type_from_key(expr
->left
, key
);
2505 name
= get_variable_from_key(expr
->left
, key
, &sym
);
2509 call_results_to_rl(call
, type
, value
, &rl
);
2511 set_extra_mod(name
, sym
, NULL
, alloc_estate_rl(rl
));
2516 static void match_call_info(struct expression
*expr
)
2518 struct smatch_state
*state
;
2519 struct range_list
*rl
= NULL
;
2520 struct expression
*arg
;
2521 struct symbol
*type
;
2524 FOR_EACH_PTR(expr
->args
, arg
) {
2525 type
= get_arg_type(expr
->fn
, i
);
2527 get_absolute_rl(arg
, &rl
);
2528 rl
= cast_rl(type
, rl
);
2530 if (!is_whole_rl(rl
)) {
2531 rl
= intersect_with_real_abs_expr(arg
, rl
);
2532 sql_insert_caller_info(expr
, PARAM_VALUE
, i
, "$", show_rl(rl
));
2534 state
= get_state_expr(SMATCH_EXTRA
, arg
);
2535 if (estate_has_fuzzy_max(state
)) {
2536 sql_insert_caller_info(expr
, FUZZY_MAX
, i
, "$",
2537 sval_to_str(estate_get_fuzzy_max(state
)));
2540 } END_FOR_EACH_PTR(arg
);
2543 static void set_param_value(const char *name
, struct symbol
*sym
, char *key
, char *value
)
2545 struct range_list
*rl
= NULL
;
2546 struct smatch_state
*state
;
2547 struct symbol
*type
;
2551 if (strcmp(key
, "*$") == 0)
2552 snprintf(fullname
, sizeof(fullname
), "*%s", name
);
2553 else if (strncmp(key
, "$", 1) == 0)
2554 snprintf(fullname
, 256, "%s%s", name
, key
+ 1);
2558 type
= get_member_type_from_key(symbol_expression(sym
), key
);
2559 str_to_rl(type
, value
, &rl
);
2560 state
= alloc_estate_rl(rl
);
2561 if (estate_get_single_value(state
, &dummy
))
2562 estate_set_hard_max(state
);
2563 set_state(SMATCH_EXTRA
, fullname
, sym
, state
);
2566 static void set_param_hard_max(const char *name
, struct symbol
*sym
, char *key
, char *value
)
2568 struct range_list
*rl
= NULL
;
2569 struct smatch_state
*state
;
2570 struct symbol
*type
;
2574 if (strcmp(key
, "*$") == 0)
2575 snprintf(fullname
, sizeof(fullname
), "*%s", name
);
2576 else if (strncmp(key
, "$", 1) == 0)
2577 snprintf(fullname
, 256, "%s%s", name
, key
+ 1);
2581 state
= get_state(SMATCH_EXTRA
, fullname
, sym
);
2584 type
= get_member_type_from_key(symbol_expression(sym
), key
);
2585 str_to_rl(type
, value
, &rl
);
2586 if (!rl_to_sval(rl
, &max
))
2588 estate_set_fuzzy_max(state
, max
);
2591 struct sm_state
*get_extra_sm_state(struct expression
*expr
)
2595 struct sm_state
*ret
= NULL
;
2597 name
= expr_to_known_chunk_sym(expr
, &sym
);
2601 ret
= get_sm_state(SMATCH_EXTRA
, name
, sym
);
2607 struct smatch_state
*get_extra_state(struct expression
*expr
)
2609 struct sm_state
*sm
;
2611 sm
= get_extra_sm_state(expr
);
2617 void register_smatch_extra(int id
)
2621 add_merge_hook(my_id
, &merge_estates
);
2622 add_unmatched_state_hook(my_id
, &unmatched_state
);
2623 select_caller_info_hook(set_param_value
, PARAM_VALUE
);
2624 select_caller_info_hook(set_param_hard_max
, FUZZY_MAX
);
2625 select_return_states_before(&db_limited_before
);
2626 select_return_states_hook(PARAM_LIMIT
, &db_param_limit
);
2627 select_return_states_hook(PARAM_FILTER
, &db_param_filter
);
2628 select_return_states_hook(PARAM_ADD
, &db_param_add
);
2629 select_return_states_hook(PARAM_SET
, &db_param_set
);
2630 select_return_states_hook(PARAM_VALUE
, &db_param_value
);
2631 select_return_states_after(&db_limited_after
);
2634 static void match_link_modify(struct sm_state
*sm
, struct expression
*mod_expr
)
2636 struct var_sym_list
*links
;
2637 struct var_sym
*tmp
;
2638 struct smatch_state
*state
;
2640 links
= sm
->state
->data
;
2642 FOR_EACH_PTR(links
, tmp
) {
2643 if (sm
->sym
== tmp
->sym
&&
2644 strcmp(sm
->name
, tmp
->var
) == 0)
2646 state
= get_state(SMATCH_EXTRA
, tmp
->var
, tmp
->sym
);
2649 set_state(SMATCH_EXTRA
, tmp
->var
, tmp
->sym
, alloc_estate_whole(estate_type(state
)));
2650 } END_FOR_EACH_PTR(tmp
);
2651 set_state(link_id
, sm
->name
, sm
->sym
, &undefined
);
2654 void register_smatch_extra_links(int id
)
2659 void register_smatch_extra_late(int id
)
2661 add_merge_hook(link_id
, &merge_link_states
);
2662 add_modification_hook(link_id
, &match_link_modify
);
2663 add_hook(&match_dereferences
, DEREF_HOOK
);
2664 add_hook(&match_pointer_as_array
, OP_HOOK
);
2665 select_return_implies_hook(DEREFERENCE
, &set_param_dereferenced
);
2666 add_hook(&match_function_call
, FUNCTION_CALL_HOOK
);
2667 add_hook(&match_assign
, ASSIGNMENT_HOOK
);
2668 add_hook(&match_assign
, GLOBAL_ASSIGNMENT_HOOK
);
2669 add_hook(&unop_expr
, OP_HOOK
);
2670 add_hook(&asm_expr
, ASM_HOOK
);
2672 add_hook(&match_call_info
, FUNCTION_CALL_HOOK
);
2673 add_member_info_callback(my_id
, struct_member_callback
);
2674 add_split_return_callback(&returned_struct_members
);
2676 // add_hook(&assume_indexes_are_valid, OP_HOOK);