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 smatch_state
*state
);
64 DECLARE_PTR_LIST(void_fn_list
, mod_hook
*);
65 static struct void_fn_list
*extra_mod_hooks
;
66 void add_extra_mod_hook(mod_hook
*fn
)
68 mod_hook
**p
= malloc(sizeof(mod_hook
*));
70 add_ptr_list(&extra_mod_hooks
, p
);
73 void call_extra_mod_hooks(const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
77 FOR_EACH_PTR(extra_mod_hooks
, fn
) {
78 (*fn
)(name
, sym
, state
);
79 } END_FOR_EACH_PTR(fn
);
82 struct sm_state
*set_extra_mod_helper(const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
84 remove_from_equiv(name
, sym
);
85 call_extra_mod_hooks(name
, sym
, state
);
86 if (__in_fake_assign
&& estate_is_unknown(state
) && !get_state(SMATCH_EXTRA
, name
, sym
))
88 return set_state(SMATCH_EXTRA
, name
, sym
, state
);
91 static char *get_other_name_sym(const char *name
, struct symbol
*sym
, struct symbol
**new_sym
)
93 struct expression
*assigned
;
94 char *orig_name
= NULL
;
101 if (!sym
|| !sym
->ident
)
104 skip
= strlen(sym
->ident
->name
);
105 if (name
[skip
] != '-' || name
[skip
+ 1] != '>')
109 assigned
= get_assigned_expr_name_sym(sym
->ident
->name
, sym
);
112 if (assigned
->type
== EXPR_PREOP
|| assigned
->op
== '&') {
114 orig_name
= expr_to_var_sym(assigned
, new_sym
);
115 if (!orig_name
|| !*new_sym
)
118 snprintf(buf
, sizeof(buf
), "%s.%s", orig_name
+ 1, name
+ skip
);
119 ret
= alloc_string(buf
);
120 free_string(orig_name
);
124 if (assigned
->type
!= EXPR_DEREF
)
127 orig_name
= expr_to_var_sym(assigned
, new_sym
);
128 if (!orig_name
|| !*new_sym
)
131 snprintf(buf
, sizeof(buf
), "%s->%s", orig_name
, name
+ skip
);
132 ret
= alloc_string(buf
);
133 free_string(orig_name
);
137 free_string(orig_name
);
141 struct sm_state
*set_extra_mod(const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
144 struct symbol
*new_sym
;
147 sm
= set_extra_mod_helper(name
, sym
, state
);
148 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
149 if (new_name
&& new_sym
)
150 set_extra_mod_helper(new_name
, new_sym
, state
);
151 free_string(new_name
);
155 static void clear_array_states(struct expression
*array
)
159 sm
= get_sm_state_expr(link_id
, array
);
161 match_link_modify(sm
, NULL
);
164 static struct sm_state
*set_extra_array_mod(struct expression
*expr
, struct smatch_state
*state
)
166 struct expression
*array
;
167 struct var_sym_list
*vsl
;
171 struct sm_state
*ret
= NULL
;
173 array
= get_array_base(expr
);
175 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
177 clear_array_states(array
);
181 FOR_EACH_PTR(vsl
, vs
) {
182 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
183 } END_FOR_EACH_PTR(vs
);
185 call_extra_mod_hooks(name
, sym
, state
);
186 ret
= set_state(SMATCH_EXTRA
, name
, sym
, state
);
192 struct sm_state
*set_extra_expr_mod(struct expression
*expr
, struct smatch_state
*state
)
196 struct sm_state
*ret
= NULL
;
199 return set_extra_array_mod(expr
, state
);
201 expr
= strip_expr(expr
);
202 name
= expr_to_var_sym(expr
, &sym
);
205 ret
= set_extra_mod(name
, sym
, state
);
211 void set_extra_nomod(const char *name
, struct symbol
*sym
, struct smatch_state
*state
)
214 struct symbol
*new_sym
;
215 struct relation
*rel
;
216 struct smatch_state
*orig_state
;
218 orig_state
= get_state(SMATCH_EXTRA
, name
, sym
);
220 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
221 if (new_name
&& new_sym
)
222 set_state(SMATCH_EXTRA
, new_name
, new_sym
, state
);
223 free_string(new_name
);
225 if (!estate_related(orig_state
)) {
226 set_state(SMATCH_EXTRA
, name
, sym
, state
);
230 set_related(state
, estate_related(orig_state
));
231 FOR_EACH_PTR(estate_related(orig_state
), rel
) {
232 struct smatch_state
*estate
;
234 if (option_debug_related
)
235 sm_msg("%s updating related %s to %s", name
, rel
->name
, state
->name
);
236 estate
= get_state(SMATCH_EXTRA
, rel
->name
, rel
->sym
);
239 set_state(SMATCH_EXTRA
, rel
->name
, rel
->sym
, clone_estate_cast(estate_type(estate
), state
));
240 } END_FOR_EACH_PTR(rel
);
243 void set_extra_nomod_vsl(const char *name
, struct symbol
*sym
, struct var_sym_list
*vsl
, struct smatch_state
*state
)
247 FOR_EACH_PTR(vsl
, vs
) {
248 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
249 } END_FOR_EACH_PTR(vs
);
251 set_extra_nomod(name
, sym
, state
);
255 * This is for return_implies_state() hooks which modify a SMATCH_EXTRA state
257 void set_extra_expr_nomod(struct expression
*expr
, struct smatch_state
*state
)
259 struct var_sym_list
*vsl
;
264 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
267 FOR_EACH_PTR(vsl
, vs
) {
268 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
269 } END_FOR_EACH_PTR(vs
);
271 set_extra_nomod(name
, sym
, state
);
276 static void set_extra_true_false(const char *name
, struct symbol
*sym
,
277 struct smatch_state
*true_state
,
278 struct smatch_state
*false_state
)
281 struct symbol
*new_sym
;
282 struct relation
*rel
;
283 struct smatch_state
*orig_state
;
285 if (!true_state
&& !false_state
)
288 if (in_warn_on_macro())
291 new_name
= get_other_name_sym(name
, sym
, &new_sym
);
292 if (new_name
&& new_sym
)
293 set_true_false_states(SMATCH_EXTRA
, new_name
, new_sym
, true_state
, false_state
);
294 free_string(new_name
);
296 orig_state
= get_state(SMATCH_EXTRA
, name
, sym
);
298 if (!estate_related(orig_state
)) {
299 set_true_false_states(SMATCH_EXTRA
, name
, sym
, true_state
, false_state
);
304 set_related(true_state
, estate_related(orig_state
));
306 set_related(false_state
, estate_related(orig_state
));
308 FOR_EACH_PTR(estate_related(orig_state
), rel
) {
309 set_true_false_states(SMATCH_EXTRA
, rel
->name
, rel
->sym
,
310 true_state
, false_state
);
311 } END_FOR_EACH_PTR(rel
);
314 static void set_extra_chunk_true_false(struct expression
*expr
,
315 struct smatch_state
*true_state
,
316 struct smatch_state
*false_state
)
318 struct var_sym_list
*vsl
;
324 if (in_warn_on_macro())
327 type
= get_type(expr
);
331 name
= expr_to_chunk_sym_vsl(expr
, &sym
, &vsl
);
334 FOR_EACH_PTR(vsl
, vs
) {
335 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
336 } END_FOR_EACH_PTR(vs
);
338 set_true_false_states(SMATCH_EXTRA
, name
, sym
,
339 clone_estate(true_state
),
340 clone_estate(false_state
));
345 static void set_extra_expr_true_false(struct expression
*expr
,
346 struct smatch_state
*true_state
,
347 struct smatch_state
*false_state
)
353 if (!true_state
&& !false_state
)
356 if (get_value(expr
, &sval
))
359 expr
= strip_expr(expr
);
360 name
= expr_to_var_sym(expr
, &sym
);
363 set_extra_chunk_true_false(expr
, true_state
, false_state
);
366 set_extra_true_false(name
, sym
, true_state
, false_state
);
370 static struct sm_state
*handle_canonical_while_count_down(struct statement
*loop
)
372 struct expression
*iter_var
;
373 struct expression
*condition
;
375 struct smatch_state
*estate
;
378 condition
= strip_expr(loop
->iterator_pre_condition
);
381 if (condition
->type
!= EXPR_PREOP
&& condition
->type
!= EXPR_POSTOP
)
383 if (condition
->op
!= SPECIAL_DECREMENT
)
386 iter_var
= condition
->unop
;
387 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
390 if (sval_cmp_val(estate_min(sm
->state
), 0) < 0)
392 start
= estate_max(sm
->state
);
393 if (sval_cmp_val(start
, 0) <= 0)
395 if (!sval_is_max(start
))
398 if (condition
->type
== EXPR_PREOP
) {
399 estate
= alloc_estate_range(sval_type_val(start
.type
, 1), start
);
400 if (estate_has_hard_max(sm
->state
))
401 estate_set_hard_max(estate
);
402 estate_copy_fuzzy_max(estate
, sm
->state
);
403 set_extra_expr_mod(iter_var
, estate
);
405 if (condition
->type
== EXPR_POSTOP
) {
406 estate
= alloc_estate_range(sval_type_val(start
.type
, 0), start
);
407 if (estate_has_hard_max(sm
->state
))
408 estate_set_hard_max(estate
);
409 estate_copy_fuzzy_max(estate
, sm
->state
);
410 set_extra_expr_mod(iter_var
, estate
);
412 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
415 static struct sm_state
*handle_canonical_for_inc(struct expression
*iter_expr
,
416 struct expression
*condition
)
418 struct expression
*iter_var
;
420 struct smatch_state
*estate
;
421 sval_t start
, end
, max
;
423 iter_var
= iter_expr
->unop
;
424 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
427 if (!estate_get_single_value(sm
->state
, &start
))
429 if (get_implied_max(condition
->right
, &end
))
430 end
= sval_cast(get_type(iter_var
), end
);
432 end
= sval_type_max(get_type(iter_var
));
434 if (get_sm_state_expr(SMATCH_EXTRA
, condition
->left
) != sm
)
437 switch (condition
->op
) {
438 case SPECIAL_UNSIGNED_LT
:
439 case SPECIAL_NOTEQUAL
:
441 if (!sval_is_min(end
))
444 case SPECIAL_UNSIGNED_LTE
:
450 if (sval_cmp(end
, start
) < 0)
452 estate
= alloc_estate_range(start
, end
);
453 if (get_hard_max(condition
->right
, &max
)) {
454 estate_set_hard_max(estate
);
455 if (condition
->op
== '<' ||
456 condition
->op
== SPECIAL_UNSIGNED_LT
||
457 condition
->op
== SPECIAL_NOTEQUAL
)
459 estate_set_fuzzy_max(estate
, max
);
461 set_extra_expr_mod(iter_var
, estate
);
462 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
465 static struct sm_state
*handle_canonical_for_dec(struct expression
*iter_expr
,
466 struct expression
*condition
)
468 struct expression
*iter_var
;
470 struct smatch_state
*estate
;
473 iter_var
= iter_expr
->unop
;
474 sm
= get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
477 if (!estate_get_single_value(sm
->state
, &start
))
479 if (!get_implied_min(condition
->right
, &end
))
480 end
= sval_type_min(get_type(iter_var
));
481 if (get_sm_state_expr(SMATCH_EXTRA
, condition
->left
) != sm
)
484 switch (condition
->op
) {
485 case SPECIAL_NOTEQUAL
:
487 if (!sval_is_min(end
) && !sval_is_max(end
))
495 if (sval_cmp(end
, start
) > 0)
497 estate
= alloc_estate_range(end
, start
);
498 estate_set_hard_max(estate
);
499 estate_set_fuzzy_max(estate
, estate_get_fuzzy_max(estate
));
500 set_extra_expr_mod(iter_var
, estate
);
501 return get_sm_state_expr(SMATCH_EXTRA
, iter_var
);
504 static struct sm_state
*handle_canonical_for_loops(struct statement
*loop
)
506 struct expression
*iter_expr
;
507 struct expression
*condition
;
509 if (!loop
->iterator_post_statement
)
511 if (loop
->iterator_post_statement
->type
!= STMT_EXPRESSION
)
513 iter_expr
= loop
->iterator_post_statement
->expression
;
514 if (!loop
->iterator_pre_condition
)
516 if (loop
->iterator_pre_condition
->type
!= EXPR_COMPARE
)
518 condition
= loop
->iterator_pre_condition
;
520 if (iter_expr
->op
== SPECIAL_INCREMENT
)
521 return handle_canonical_for_inc(iter_expr
, condition
);
522 if (iter_expr
->op
== SPECIAL_DECREMENT
)
523 return handle_canonical_for_dec(iter_expr
, condition
);
527 struct sm_state
*__extra_handle_canonical_loops(struct statement
*loop
, struct stree
**stree
)
529 struct sm_state
*ret
;
531 __push_fake_cur_stree();
532 if (!loop
->iterator_post_statement
)
533 ret
= handle_canonical_while_count_down(loop
);
535 ret
= handle_canonical_for_loops(loop
);
536 *stree
= __pop_fake_cur_stree();
540 int __iterator_unchanged(struct sm_state
*sm
)
544 if (get_sm_state(my_id
, sm
->name
, sm
->sym
) == sm
)
549 static void while_count_down_after(struct sm_state
*sm
, struct expression
*condition
)
553 /* paranoid checking. prolly not needed */
554 condition
= strip_expr(condition
);
557 if (condition
->type
!= EXPR_PREOP
&& condition
->type
!= EXPR_POSTOP
)
559 if (condition
->op
!= SPECIAL_DECREMENT
)
561 after_value
= estate_min(sm
->state
);
563 set_extra_mod(sm
->name
, sm
->sym
, alloc_estate_sval(after_value
));
566 void __extra_pre_loop_hook_after(struct sm_state
*sm
,
567 struct statement
*iterator
,
568 struct expression
*condition
)
570 struct expression
*iter_expr
;
572 struct smatch_state
*state
;
575 while_count_down_after(sm
, condition
);
579 iter_expr
= iterator
->expression
;
581 if (condition
->type
!= EXPR_COMPARE
)
583 if (iter_expr
->op
== SPECIAL_INCREMENT
) {
584 limit
= sval_binop(estate_max(sm
->state
), '+',
585 sval_type_val(estate_type(sm
->state
), 1));
587 limit
= sval_binop(estate_min(sm
->state
), '-',
588 sval_type_val(estate_type(sm
->state
), 1));
590 if (!estate_has_hard_max(sm
->state
) && !__has_breaks()) {
591 if (iter_expr
->op
== SPECIAL_INCREMENT
)
592 state
= alloc_estate_range(estate_min(sm
->state
), limit
);
594 state
= alloc_estate_range(limit
, estate_max(sm
->state
));
596 state
= alloc_estate_sval(limit
);
598 if (!estate_has_hard_max(sm
->state
)) {
599 estate_clear_hard_max(state
);
601 if (estate_has_fuzzy_max(sm
->state
)) {
602 sval_t hmax
= estate_get_fuzzy_max(sm
->state
);
603 sval_t max
= estate_max(sm
->state
);
605 if (sval_cmp(hmax
, max
) != 0)
606 estate_clear_fuzzy_max(state
);
607 } else if (!estate_has_fuzzy_max(sm
->state
)) {
608 estate_clear_fuzzy_max(state
);
611 set_extra_mod(sm
->name
, sm
->sym
, state
);
614 static struct stree
*unmatched_stree
;
615 static struct smatch_state
*unmatched_state(struct sm_state
*sm
)
617 struct smatch_state
*state
;
619 if (unmatched_stree
) {
620 state
= get_state_stree(unmatched_stree
, SMATCH_EXTRA
, sm
->name
, sm
->sym
);
624 if (parent_is_gone_var_sym(sm
->name
, sm
->sym
))
625 return alloc_estate_empty();
626 return alloc_estate_whole(estate_type(sm
->state
));
629 static void clear_the_pointed_at(struct expression
*expr
)
634 struct sm_state
*tmp
;
636 name
= expr_to_var_sym(expr
, &sym
);
640 stree
= __get_cur_stree();
641 FOR_EACH_MY_SM(SMATCH_EXTRA
, stree
, tmp
) {
642 if (tmp
->name
[0] != '*')
646 if (strcmp(tmp
->name
+ 1, name
) != 0)
648 set_extra_mod(tmp
->name
, tmp
->sym
, alloc_estate_whole(estate_type(tmp
->state
)));
649 } END_FOR_EACH_SM(tmp
);
655 static void match_function_call(struct expression
*expr
)
657 struct expression
*arg
;
658 struct expression
*tmp
;
660 /* if we have the db this is handled in smatch_function_hooks.c */
663 if (inlinable(expr
->fn
))
666 FOR_EACH_PTR(expr
->args
, arg
) {
667 tmp
= strip_expr(arg
);
668 if (tmp
->type
== EXPR_PREOP
&& tmp
->op
== '&')
669 set_extra_expr_mod(tmp
->unop
, alloc_estate_whole(get_type(tmp
->unop
)));
671 clear_the_pointed_at(tmp
);
672 } END_FOR_EACH_PTR(arg
);
675 static int values_fit_type(struct expression
*left
, struct expression
*right
)
677 struct range_list
*rl
;
680 type
= get_type(left
);
683 get_absolute_rl(right
, &rl
);
684 if (type_unsigned(type
) && sval_is_negative(rl_min(rl
)))
686 if (sval_cmp(sval_type_min(type
), rl_min(rl
)) > 0)
688 if (sval_cmp(sval_type_max(type
), rl_max(rl
)) < 0)
693 static void save_chunk_info(struct expression
*left
, struct expression
*right
)
695 struct var_sym_list
*vsl
;
697 struct expression
*add_expr
;
703 if (right
->type
!= EXPR_BINOP
|| right
->op
!= '-')
705 if (!get_value(right
->left
, &sval
))
707 if (!expr_to_sym(right
->right
))
710 add_expr
= binop_expression(left
, '+', right
->right
);
711 type
= get_type(add_expr
);
714 name
= expr_to_chunk_sym_vsl(add_expr
, &sym
, &vsl
);
717 FOR_EACH_PTR(vsl
, vs
) {
718 store_link(link_id
, vs
->var
, vs
->sym
, name
, sym
);
719 } END_FOR_EACH_PTR(vs
);
721 set_state(SMATCH_EXTRA
, name
, sym
, alloc_estate_sval(sval_cast(type
, sval
)));
726 static void do_array_assign(struct expression
*left
, int op
, struct expression
*right
)
728 struct range_list
*rl
;
731 get_absolute_rl(right
, &rl
);
732 rl
= cast_rl(get_type(left
), rl
);
734 rl
= alloc_whole_rl(get_type(left
));
737 set_extra_array_mod(left
, alloc_estate_rl(rl
));
740 static void match_untracked_array(struct expression
*call
, int param
)
742 struct expression
*arg
;
744 arg
= get_argument_from_call_expr(call
->args
, param
);
745 arg
= strip_expr(arg
);
747 clear_array_states(arg
);
750 static void match_vanilla_assign(struct expression
*left
, struct expression
*right
)
752 struct range_list
*orig_rl
= NULL
;
753 struct range_list
*rl
= NULL
;
754 struct symbol
*right_sym
;
755 struct symbol
*left_type
;
756 struct symbol
*right_type
;
757 char *right_name
= NULL
;
761 struct smatch_state
*state
;
767 save_chunk_info(left
, right
);
769 name
= expr_to_var_sym(left
, &sym
);
772 do_array_assign(left
, '=', right
);
776 left_type
= get_type(left
);
777 right_type
= get_type(right
);
779 right_name
= expr_to_var_sym(right
, &right_sym
);
781 if (!__in_fake_assign
&&
782 !(right
->type
== EXPR_PREOP
&& right
->op
== '&') &&
783 right_name
&& right_sym
&&
784 values_fit_type(left
, right
) &&
785 !has_symbol(right
, sym
)) {
786 set_equiv(left
, right
);
790 if (is_pointer(right
) && get_address_rl(right
, &rl
)) {
791 state
= alloc_estate_rl(rl
);
795 comparison
= get_comparison(left
, right
);
797 comparison
= flip_comparison(comparison
);
798 get_implied_rl(left
, &orig_rl
);
801 if (get_implied_rl(right
, &rl
)) {
802 rl
= cast_rl(left_type
, rl
);
804 filter_by_comparison(&rl
, comparison
, orig_rl
);
805 state
= alloc_estate_rl(rl
);
806 if (get_hard_max(right
, &max
)) {
807 estate_set_hard_max(state
);
808 estate_set_fuzzy_max(state
, max
);
811 rl
= alloc_whole_rl(right_type
);
812 rl
= cast_rl(left_type
, rl
);
814 filter_by_comparison(&rl
, comparison
, orig_rl
);
815 state
= alloc_estate_rl(rl
);
819 set_extra_mod(name
, sym
, state
);
821 free_string(right_name
);
824 static int op_remove_assign(int op
)
827 case SPECIAL_ADD_ASSIGN
:
829 case SPECIAL_SUB_ASSIGN
:
831 case SPECIAL_MUL_ASSIGN
:
833 case SPECIAL_DIV_ASSIGN
:
835 case SPECIAL_MOD_ASSIGN
:
837 case SPECIAL_AND_ASSIGN
:
839 case SPECIAL_OR_ASSIGN
:
841 case SPECIAL_XOR_ASSIGN
:
843 case SPECIAL_SHL_ASSIGN
:
844 return SPECIAL_LEFTSHIFT
;
845 case SPECIAL_SHR_ASSIGN
:
846 return SPECIAL_RIGHTSHIFT
;
852 static void match_assign(struct expression
*expr
)
854 struct range_list
*rl
= NULL
;
855 struct expression
*left
;
856 struct expression
*right
;
857 struct expression
*binop_expr
;
858 struct symbol
*left_type
;
859 struct symbol
*right_type
;
862 sval_t left_min
, left_max
;
863 sval_t right_min
, right_max
;
864 sval_t res_min
, res_max
;
866 left
= strip_expr(expr
->left
);
868 right
= strip_parens(expr
->right
);
869 if (right
->type
== EXPR_CALL
&& sym_name_is("__builtin_expect", right
->fn
))
870 right
= get_argument_from_call_expr(right
->args
, 0);
871 while (right
->type
== EXPR_ASSIGNMENT
&& right
->op
== '=')
872 right
= strip_parens(right
->left
);
874 if (expr
->op
== '=' && is_condition(expr
->right
))
875 return; /* handled in smatch_condition.c */
876 if (expr
->op
== '=' && right
->type
== EXPR_CALL
)
877 return; /* handled in smatch_function_hooks.c */
878 if (expr
->op
== '=') {
879 match_vanilla_assign(left
, right
);
883 name
= expr_to_var_sym(left
, &sym
);
887 left_type
= get_type(left
);
888 right_type
= get_type(right
);
890 res_min
= sval_type_min(left_type
);
891 res_max
= sval_type_max(left_type
);
894 case SPECIAL_ADD_ASSIGN
:
895 get_absolute_max(left
, &left_max
);
896 get_absolute_max(right
, &right_max
);
897 if (sval_binop_overflows(left_max
, '+', right_max
))
899 if (get_implied_min(left
, &left_min
) &&
900 !sval_is_negative_min(left_min
) &&
901 get_implied_min(right
, &right_min
) &&
902 !sval_is_negative_min(right_min
)) {
903 res_min
= sval_binop(left_min
, '+', right_min
);
904 res_min
= sval_cast(right_type
, res_min
);
906 if (inside_loop()) /* we are assuming loops don't lead to wrapping */
908 res_max
= sval_binop(left_max
, '+', right_max
);
909 res_max
= sval_cast(right_type
, res_max
);
911 case SPECIAL_SUB_ASSIGN
:
912 if (get_implied_max(left
, &left_max
) &&
913 !sval_is_max(left_max
) &&
914 get_implied_min(right
, &right_min
) &&
915 !sval_is_min(right_min
)) {
916 res_max
= sval_binop(left_max
, '-', right_min
);
917 res_max
= sval_cast(right_type
, res_max
);
921 if (get_implied_min(left
, &left_min
) &&
922 !sval_is_min(left_min
) &&
923 get_implied_max(right
, &right_max
) &&
924 !sval_is_max(right_max
)) {
925 res_min
= sval_binop(left_min
, '-', right_max
);
926 res_min
= sval_cast(right_type
, res_min
);
929 case SPECIAL_AND_ASSIGN
:
930 case SPECIAL_MOD_ASSIGN
:
931 case SPECIAL_SHL_ASSIGN
:
932 case SPECIAL_SHR_ASSIGN
:
933 case SPECIAL_OR_ASSIGN
:
934 case SPECIAL_XOR_ASSIGN
:
935 case SPECIAL_MUL_ASSIGN
:
936 case SPECIAL_DIV_ASSIGN
:
937 binop_expr
= binop_expression(expr
->left
,
938 op_remove_assign(expr
->op
),
940 if (get_absolute_rl(binop_expr
, &rl
)) {
941 rl
= cast_rl(left_type
, rl
);
942 set_extra_mod(name
, sym
, alloc_estate_rl(rl
));
947 rl
= cast_rl(left_type
, alloc_rl(res_min
, res_max
));
948 set_extra_mod(name
, sym
, alloc_estate_rl(rl
));
953 static struct smatch_state
*increment_state(struct smatch_state
*state
)
955 sval_t min
= estate_min(state
);
956 sval_t max
= estate_max(state
);
958 if (!estate_rl(state
))
962 max
= sval_type_max(max
.type
);
964 if (!sval_is_min(min
) && !sval_is_max(min
))
966 if (!sval_is_min(max
) && !sval_is_max(max
))
968 return alloc_estate_range(min
, max
);
971 static struct smatch_state
*decrement_state(struct smatch_state
*state
)
973 sval_t min
= estate_min(state
);
974 sval_t max
= estate_max(state
);
976 if (!estate_rl(state
))
980 min
= sval_type_min(min
.type
);
982 if (!sval_is_min(min
) && !sval_is_max(min
))
984 if (!sval_is_min(max
) && !sval_is_max(max
))
986 return alloc_estate_range(min
, max
);
989 static void clear_pointed_at_state(struct expression
*expr
)
994 * ALERT: This is sort of a mess. If it's is a struct assigment like
995 * "foo = bar;", then that's handled by smatch_struct_assignment.c.
996 * the same thing for p++ where "p" is a struct. Most modifications
997 * are handled by the assignment hook or the db. Smatch_extra.c doesn't
998 * use smatch_modification.c because we have to get the ordering right
999 * or something. So if you have p++ where p is a pointer to a standard
1000 * c type then we handle that here. What a mess.
1003 type
= get_type(expr
);
1004 if (!type
|| type
->type
!= SYM_PTR
)
1006 type
= get_real_base_type(type
);
1007 if (!type
|| type
->type
!= SYM_BASETYPE
)
1009 set_extra_expr_mod(deref_expression(expr
), alloc_estate_whole(type
));
1012 static void unop_expr(struct expression
*expr
)
1014 struct smatch_state
*state
;
1016 if (expr
->smatch_flags
& Handled
)
1020 case SPECIAL_INCREMENT
:
1021 state
= get_state_expr(SMATCH_EXTRA
, expr
->unop
);
1022 state
= increment_state(state
);
1024 state
= alloc_estate_whole(get_type(expr
));
1025 set_extra_expr_mod(expr
->unop
, state
);
1026 clear_pointed_at_state(expr
->unop
);
1028 case SPECIAL_DECREMENT
:
1029 state
= get_state_expr(SMATCH_EXTRA
, expr
->unop
);
1030 state
= decrement_state(state
);
1032 state
= alloc_estate_whole(get_type(expr
));
1033 set_extra_expr_mod(expr
->unop
, state
);
1034 clear_pointed_at_state(expr
->unop
);
1041 static void asm_expr(struct statement
*stmt
)
1044 struct expression
*expr
;
1045 struct symbol
*type
;
1048 FOR_EACH_PTR(stmt
->asm_outputs
, expr
) {
1050 case 0: /* identifier */
1051 case 1: /* constraint */
1054 case 2: /* expression */
1056 type
= get_type(strip_expr(expr
));
1057 set_extra_expr_mod(expr
, alloc_estate_whole(type
));
1060 } END_FOR_EACH_PTR(expr
);
1063 static void check_dereference(struct expression
*expr
)
1065 if (outside_of_function())
1067 if (implied_not_equal(expr
, 0))
1069 set_extra_expr_nomod(expr
, alloc_estate_range(valid_ptr_min_sval
, valid_ptr_max_sval
));
1072 static void match_dereferences(struct expression
*expr
)
1074 if (expr
->type
!= EXPR_PREOP
)
1076 /* it's saying that foo[1] = bar dereferences foo[1] */
1079 check_dereference(expr
->unop
);
1082 static void match_pointer_as_array(struct expression
*expr
)
1084 if (!is_array(expr
))
1086 check_dereference(get_array_base(expr
));
1089 static void set_param_dereferenced(struct expression
*arg
, char *key
, char *unused
)
1094 name
= get_variable_from_key(arg
, key
, &sym
);
1098 set_extra_nomod(name
, sym
, alloc_estate_range(valid_ptr_min_sval
, valid_ptr_max_sval
));
1104 static sval_t
add_one(sval_t sval
)
1110 static int handle_postop_inc(struct expression
*left
, int op
, struct expression
*right
)
1112 struct statement
*stmt
;
1113 struct expression
*cond
;
1114 struct smatch_state
*true_state
, *false_state
;
1119 * If we're decrementing here then that's a canonical while count down
1120 * so it's handled already. We're only handling loops like:
1122 * do { ... } while (i++ < 3);
1125 if (left
->type
!= EXPR_POSTOP
|| left
->op
!= SPECIAL_INCREMENT
)
1128 stmt
= __cur_stmt
->parent
;
1131 if (stmt
->type
== STMT_COMPOUND
)
1132 stmt
= stmt
->parent
;
1133 if (!stmt
|| stmt
->type
!= STMT_ITERATOR
|| !stmt
->iterator_post_condition
)
1136 cond
= strip_expr(stmt
->iterator_post_condition
);
1137 if (cond
->type
!= EXPR_COMPARE
|| cond
->op
!= op
)
1139 if (left
!= strip_expr(cond
->left
) || right
!= strip_expr(cond
->right
))
1142 if (!get_implied_value(left
->unop
, &start
))
1144 if (!get_implied_value(right
, &limit
))
1147 if (sval_cmp(start
, limit
) > 0)
1152 case SPECIAL_UNSIGNED_LT
:
1155 case SPECIAL_UNSIGNED_LTE
:
1156 limit
= add_one(limit
);
1162 true_state
= alloc_estate_range(add_one(start
), limit
);
1163 false_state
= alloc_estate_range(add_one(limit
), add_one(limit
));
1165 /* Currently we just discard the false state but when two passes is
1166 * implimented correctly then it will use it.
1169 set_extra_expr_true_false(left
->unop
, true_state
, false_state
);
1174 static void handle_comparison(struct symbol
*type
, struct expression
*left
, int op
, struct expression
*right
)
1176 struct range_list
*left_orig
;
1177 struct range_list
*left_true
;
1178 struct range_list
*left_false
;
1179 struct range_list
*right_orig
;
1180 struct range_list
*right_true
;
1181 struct range_list
*right_false
;
1182 struct smatch_state
*left_true_state
;
1183 struct smatch_state
*left_false_state
;
1184 struct smatch_state
*right_true_state
;
1185 struct smatch_state
*right_false_state
;
1186 sval_t dummy
, hard_max
;
1187 int left_postop
= 0;
1188 int right_postop
= 0;
1190 if (left
->op
== SPECIAL_INCREMENT
|| left
->op
== SPECIAL_DECREMENT
) {
1191 if (left
->type
== EXPR_POSTOP
) {
1192 left
->smatch_flags
|= Handled
;
1193 left_postop
= left
->op
;
1194 if (handle_postop_inc(left
, op
, right
))
1197 left
= strip_parens(left
->unop
);
1199 while (left
->type
== EXPR_ASSIGNMENT
)
1200 left
= strip_parens(left
->left
);
1202 if (right
->op
== SPECIAL_INCREMENT
|| right
->op
== SPECIAL_DECREMENT
) {
1203 if (right
->type
== EXPR_POSTOP
) {
1204 right
->smatch_flags
|= Handled
;
1205 right_postop
= right
->op
;
1207 right
= strip_parens(right
->unop
);
1210 get_real_absolute_rl(left
, &left_orig
);
1211 left_orig
= cast_rl(type
, left_orig
);
1213 get_real_absolute_rl(right
, &right_orig
);
1214 right_orig
= cast_rl(type
, right_orig
);
1216 split_comparison_rl(left_orig
, op
, right_orig
, &left_true
, &left_false
, &right_true
, &right_false
);
1218 left_true
= rl_truncate_cast(get_type(strip_expr(left
)), left_true
);
1219 left_false
= rl_truncate_cast(get_type(strip_expr(left
)), left_false
);
1220 right_true
= rl_truncate_cast(get_type(strip_expr(right
)), right_true
);
1221 right_false
= rl_truncate_cast(get_type(strip_expr(right
)), right_false
);
1223 if (!left_true
|| !left_false
) {
1224 struct range_list
*tmp_true
, *tmp_false
;
1226 split_comparison_rl(alloc_whole_rl(type
), op
, right_orig
, &tmp_true
, &tmp_false
, NULL
, NULL
);
1227 tmp_true
= rl_truncate_cast(get_type(strip_expr(left
)), tmp_true
);
1228 tmp_false
= rl_truncate_cast(get_type(strip_expr(left
)), tmp_false
);
1229 if (tmp_true
&& tmp_false
)
1230 __save_imaginary_state(left
, tmp_true
, tmp_false
);
1233 if (!right_true
|| !right_false
) {
1234 struct range_list
*tmp_true
, *tmp_false
;
1236 split_comparison_rl(alloc_whole_rl(type
), op
, right_orig
, NULL
, NULL
, &tmp_true
, &tmp_false
);
1237 tmp_true
= rl_truncate_cast(get_type(strip_expr(right
)), tmp_true
);
1238 tmp_false
= rl_truncate_cast(get_type(strip_expr(right
)), tmp_false
);
1239 if (tmp_true
&& tmp_false
)
1240 __save_imaginary_state(right
, tmp_true
, tmp_false
);
1243 left_true_state
= alloc_estate_rl(left_true
);
1244 left_false_state
= alloc_estate_rl(left_false
);
1245 right_true_state
= alloc_estate_rl(right_true
);
1246 right_false_state
= alloc_estate_rl(right_false
);
1250 case SPECIAL_UNSIGNED_LT
:
1251 case SPECIAL_UNSIGNED_LTE
:
1253 if (get_hard_max(right
, &dummy
))
1254 estate_set_hard_max(left_true_state
);
1255 if (get_hard_max(left
, &dummy
))
1256 estate_set_hard_max(right_false_state
);
1259 case SPECIAL_UNSIGNED_GT
:
1260 case SPECIAL_UNSIGNED_GTE
:
1262 if (get_hard_max(left
, &dummy
))
1263 estate_set_hard_max(right_true_state
);
1264 if (get_hard_max(right
, &dummy
))
1265 estate_set_hard_max(left_false_state
);
1271 case SPECIAL_UNSIGNED_LT
:
1272 case SPECIAL_UNSIGNED_LTE
:
1274 if (get_hard_max(right
, &hard_max
)) {
1275 if (op
== '<' || op
== SPECIAL_UNSIGNED_LT
)
1277 estate_set_fuzzy_max(left_true_state
, hard_max
);
1279 if (get_implied_value(right
, &hard_max
)) {
1280 if (op
== SPECIAL_UNSIGNED_LTE
||
1283 estate_set_fuzzy_max(left_false_state
, hard_max
);
1285 if (get_hard_max(left
, &hard_max
)) {
1286 if (op
== SPECIAL_UNSIGNED_LTE
||
1289 estate_set_fuzzy_max(right_false_state
, hard_max
);
1291 if (get_implied_value(left
, &hard_max
)) {
1292 if (op
== '<' || op
== SPECIAL_UNSIGNED_LT
)
1294 estate_set_fuzzy_max(right_true_state
, hard_max
);
1298 case SPECIAL_UNSIGNED_GT
:
1299 case SPECIAL_UNSIGNED_GTE
:
1301 if (get_hard_max(left
, &hard_max
)) {
1302 if (op
== '>' || op
== SPECIAL_UNSIGNED_GT
)
1304 estate_set_fuzzy_max(right_true_state
, hard_max
);
1306 if (get_implied_value(left
, &hard_max
)) {
1307 if (op
== SPECIAL_UNSIGNED_GTE
||
1310 estate_set_fuzzy_max(right_false_state
, hard_max
);
1312 if (get_hard_max(right
, &hard_max
)) {
1313 if (op
== SPECIAL_UNSIGNED_LTE
||
1316 estate_set_fuzzy_max(left_false_state
, hard_max
);
1318 if (get_implied_value(right
, &hard_max
)) {
1320 op
== SPECIAL_UNSIGNED_GT
)
1322 estate_set_fuzzy_max(left_true_state
, hard_max
);
1326 if (get_hard_max(left
, &hard_max
))
1327 estate_set_fuzzy_max(right_true_state
, hard_max
);
1328 if (get_hard_max(right
, &hard_max
))
1329 estate_set_fuzzy_max(left_true_state
, hard_max
);
1333 if (get_hard_max(left
, &hard_max
)) {
1334 estate_set_hard_max(left_true_state
);
1335 estate_set_hard_max(left_false_state
);
1337 if (get_hard_max(right
, &hard_max
)) {
1338 estate_set_hard_max(right_true_state
);
1339 estate_set_hard_max(right_false_state
);
1342 if (left_postop
== SPECIAL_INCREMENT
) {
1343 left_true_state
= increment_state(left_true_state
);
1344 left_false_state
= increment_state(left_false_state
);
1346 if (left_postop
== SPECIAL_DECREMENT
) {
1347 left_true_state
= decrement_state(left_true_state
);
1348 left_false_state
= decrement_state(left_false_state
);
1350 if (right_postop
== SPECIAL_INCREMENT
) {
1351 right_true_state
= increment_state(right_true_state
);
1352 right_false_state
= increment_state(right_false_state
);
1354 if (right_postop
== SPECIAL_DECREMENT
) {
1355 right_true_state
= decrement_state(right_true_state
);
1356 right_false_state
= decrement_state(right_false_state
);
1359 if (estate_rl(left_true_state
) && estates_equiv(left_true_state
, left_false_state
)) {
1360 left_true_state
= NULL
;
1361 left_false_state
= NULL
;
1364 if (estate_rl(right_true_state
) && estates_equiv(right_true_state
, right_false_state
)) {
1365 right_true_state
= NULL
;
1366 right_false_state
= NULL
;
1369 set_extra_expr_true_false(left
, left_true_state
, left_false_state
);
1370 set_extra_expr_true_false(right
, right_true_state
, right_false_state
);
1373 static int is_simple_math(struct expression
*expr
)
1377 if (expr
->type
!= EXPR_BINOP
)
1388 static void move_known_values(struct expression
**left_p
, struct expression
**right_p
)
1390 struct expression
*left
= *left_p
;
1391 struct expression
*right
= *right_p
;
1394 if (get_implied_value(left
, &sval
)) {
1395 if (!is_simple_math(right
))
1397 if (right
->op
== '*') {
1400 if (!get_value(right
->right
, &divisor
))
1402 if (divisor
.value
== 0 && sval
.value
% divisor
.value
)
1404 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->right
);
1405 *right_p
= right
->left
;
1408 if (right
->op
== '+' && get_value(right
->left
, &sval
)) {
1409 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->left
);
1410 *right_p
= right
->right
;
1413 if (get_value(right
->right
, &sval
)) {
1414 *left_p
= binop_expression(left
, invert_op(right
->op
), right
->right
);
1415 *right_p
= right
->left
;
1420 if (get_implied_value(right
, &sval
)) {
1421 if (!is_simple_math(left
))
1423 if (left
->op
== '*') {
1426 if (!get_value(left
->right
, &divisor
))
1428 if (divisor
.value
== 0 && sval
.value
% divisor
.value
)
1430 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->right
);
1431 *left_p
= left
->left
;
1434 if (left
->op
== '+' && get_value(left
->left
, &sval
)) {
1435 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->left
);
1436 *left_p
= left
->right
;
1440 if (get_value(left
->right
, &sval
)) {
1441 *right_p
= binop_expression(right
, invert_op(left
->op
), left
->right
);
1442 *left_p
= left
->left
;
1449 static int match_func_comparison(struct expression
*expr
)
1451 struct expression
*left
= strip_expr(expr
->left
);
1452 struct expression
*right
= strip_expr(expr
->right
);
1456 * fixme: think about this harder. We should always be trying to limit
1457 * the non-call side as well. If we can't determine the limitter does
1458 * that mean we aren't querying the database and are missing important
1462 if (left
->type
== EXPR_CALL
) {
1463 if (get_implied_value(left
, &sval
)) {
1464 handle_comparison(get_type(expr
), left
, expr
->op
, right
);
1467 function_comparison(left
, expr
->op
, right
);
1471 if (right
->type
== EXPR_CALL
) {
1472 if (get_implied_value(right
, &sval
)) {
1473 handle_comparison(get_type(expr
), left
, expr
->op
, right
);
1476 function_comparison(left
, expr
->op
, right
);
1483 static void match_comparison(struct expression
*expr
)
1485 struct expression
*left_orig
= strip_parens(expr
->left
);
1486 struct expression
*right_orig
= strip_parens(expr
->right
);
1487 struct expression
*left
, *right
;
1488 struct expression
*prev
;
1489 struct symbol
*type
;
1491 if (match_func_comparison(expr
))
1494 type
= get_type(expr
);
1496 type
= &llong_ctype
;
1500 move_known_values(&left
, &right
);
1501 handle_comparison(type
, left
, expr
->op
, right
);
1503 prev
= get_assigned_expr(left_orig
);
1504 if (is_simple_math(prev
) && has_variable(prev
, left_orig
) == 0) {
1507 move_known_values(&left
, &right
);
1508 handle_comparison(type
, left
, expr
->op
, right
);
1511 prev
= get_assigned_expr(right_orig
);
1512 if (is_simple_math(prev
) && has_variable(prev
, right_orig
) == 0) {
1515 move_known_values(&left
, &right
);
1516 handle_comparison(type
, left
, expr
->op
, right
);
1520 static void handle_AND_condition(struct expression
*expr
)
1522 struct range_list
*rl
= NULL
;
1526 if (get_implied_value(expr
->left
, &known
) && known
.value
> 0) {
1527 bit
= ffsll(known
.value
) - 1;
1528 known
.uvalue
= 1ULL << bit
;
1530 get_absolute_rl(expr
->right
, &rl
);
1531 rl
= remove_range(rl
, sval_type_val(known
.type
, 0), known
);
1532 set_extra_expr_true_false(expr
->right
, alloc_estate_rl(rl
), NULL
);
1536 if (get_implied_value(expr
->right
, &known
) && known
.value
> 0) {
1537 bit
= ffsll(known
.value
) - 1;
1538 known
.uvalue
= 1ULL << bit
;
1540 get_absolute_rl(expr
->left
, &rl
);
1541 rl
= remove_range(rl
, sval_type_val(known
.type
, 0), known
);
1542 set_extra_expr_true_false(expr
->left
, alloc_estate_rl(rl
), NULL
);
1547 /* this is actually hooked from smatch_implied.c... it's hacky, yes */
1548 void __extra_match_condition(struct expression
*expr
)
1550 struct smatch_state
*pre_state
;
1551 struct smatch_state
*true_state
;
1552 struct smatch_state
*false_state
;
1554 expr
= strip_expr(expr
);
1555 switch (expr
->type
) {
1557 function_comparison(expr
, SPECIAL_NOTEQUAL
, zero_expr());
1564 zero
= sval_blank(expr
);
1567 pre_state
= get_extra_state(expr
);
1568 true_state
= estate_filter_sval(pre_state
, zero
);
1569 if (possibly_true(expr
, SPECIAL_EQUAL
, zero_expr()))
1570 false_state
= alloc_estate_sval(zero
);
1572 false_state
= alloc_estate_empty();
1573 set_extra_expr_true_false(expr
, true_state
, false_state
);
1577 match_comparison(expr
);
1579 case EXPR_ASSIGNMENT
:
1580 __extra_match_condition(expr
->left
);
1583 if (expr
->op
== '&')
1584 handle_AND_condition(expr
);
1589 static void assume_indexes_are_valid(struct expression
*expr
)
1591 struct expression
*array_expr
;
1593 struct expression
*offset
;
1594 struct symbol
*offset_type
;
1595 struct range_list
*rl_before
;
1596 struct range_list
*rl_after
;
1597 struct range_list
*filter
= NULL
;
1600 expr
= strip_expr(expr
);
1601 if (!is_array(expr
))
1604 offset
= get_array_offset(expr
);
1605 offset_type
= get_type(offset
);
1606 if (offset_type
&& type_signed(offset_type
)) {
1607 filter
= alloc_rl(sval_type_min(offset_type
),
1608 sval_type_val(offset_type
, -1));
1611 array_expr
= get_array_base(expr
);
1612 array_size
= get_real_array_size(array_expr
);
1613 if (array_size
> 1) {
1614 size
= sval_type_val(offset_type
, array_size
);
1615 add_range(&filter
, size
, sval_type_max(offset_type
));
1620 get_absolute_rl(offset
, &rl_before
);
1621 rl_after
= rl_filter(rl_before
, filter
);
1622 if (rl_equiv(rl_before
, rl_after
))
1624 set_extra_expr_nomod(offset
, alloc_estate_rl(rl_after
));
1627 /* returns 1 if it is not possible for expr to be value, otherwise returns 0 */
1628 int implied_not_equal(struct expression
*expr
, long long val
)
1630 return !possibly_false(expr
, SPECIAL_NOTEQUAL
, value_expr(val
));
1633 int implied_not_equal_name_sym(char *name
, struct symbol
*sym
, long long val
)
1635 struct smatch_state
*estate
;
1637 estate
= get_state(SMATCH_EXTRA
, name
, sym
);
1640 if (!rl_has_sval(estate_rl(estate
), sval_type_val(estate_type(estate
), 0)))
1645 int parent_is_null_var_sym(const char *name
, struct symbol
*sym
)
1650 struct smatch_state
*state
;
1652 strncpy(buf
, name
, sizeof(buf
) - 1);
1653 buf
[sizeof(buf
) - 1] = '\0';
1656 while (*start
== '*') {
1658 state
= get_state(SMATCH_EXTRA
, start
, sym
);
1661 if (!estate_rl(state
))
1663 if (estate_min(state
).value
== 0 &&
1664 estate_max(state
).value
== 0)
1669 while (*start
== '&')
1672 while ((end
= strrchr(start
, '-'))) {
1674 state
= get_state(SMATCH_EXTRA
, start
, sym
);
1677 if (estate_min(state
).value
== 0 &&
1678 estate_max(state
).value
== 0)
1684 int parent_is_null(struct expression
*expr
)
1690 expr
= strip_expr(expr
);
1691 var
= expr_to_var_sym(expr
, &sym
);
1694 ret
= parent_is_null_var_sym(var
, sym
);
1700 static int param_used_callback(void *found
, int argc
, char **argv
, char **azColName
)
1706 static int filter_unused_kzalloc_info(struct expression
*call
, int param
, char *printed_name
, struct sm_state
*sm
)
1711 /* for function pointers assume everything is used */
1712 if (call
->fn
->type
!= EXPR_SYMBOL
)
1716 * kzalloc() information is treated as special because so there is just
1717 * a lot of stuff initialized to zero and it makes building the database
1718 * take hours and hours.
1720 * In theory, we should just remove this line and not pass any unused
1721 * information, but I'm not sure enough that this code works so I want
1722 * to hold off on that for now.
1724 if (!estate_get_single_value(sm
->state
, &sval
) || sval
.value
!= 0)
1727 run_sql(¶m_used_callback
, &found
,
1728 "select * from call_implies where %s and type = %d and parameter = %d and key = '%s';",
1729 get_static_filter(call
->fn
->symbol
), PARAM_USED
, param
, printed_name
);
1733 /* If the database is not built yet, then assume everything is used */
1734 run_sql(¶m_used_callback
, &found
,
1735 "select * from call_implies where %s and type = %d;",
1736 get_static_filter(call
->fn
->symbol
), PARAM_USED
);
1743 static void struct_member_callback(struct expression
*call
, int param
, char *printed_name
, struct sm_state
*sm
)
1745 if (estate_is_whole(sm
->state
))
1747 if (filter_unused_kzalloc_info(call
, param
, printed_name
, sm
))
1749 sql_insert_caller_info(call
, PARAM_VALUE
, param
, printed_name
, sm
->state
->name
);
1750 if (estate_has_fuzzy_max(sm
->state
))
1751 sql_insert_caller_info(call
, FUZZY_MAX
, param
, printed_name
,
1752 sval_to_str(estate_get_fuzzy_max(sm
->state
)));
1755 static void returned_struct_members(int return_id
, char *return_ranges
, struct expression
*expr
)
1757 struct symbol
*returned_sym
;
1758 struct sm_state
*sm
;
1759 const char *param_name
;
1763 returned_sym
= expr_to_sym(expr
);
1767 FOR_EACH_MY_SM(my_id
, __get_cur_stree(), sm
) {
1768 if (!estate_rl(sm
->state
))
1770 if (returned_sym
!= sm
->sym
)
1773 param_name
= get_param_name(sm
);
1776 if (strcmp(param_name
, "$") == 0)
1778 compare_str
= name_sym_to_param_comparison(sm
->name
, sm
->sym
);
1779 if (!compare_str
&& estate_is_whole(sm
->state
))
1781 snprintf(buf
, sizeof(buf
), "%s%s", sm
->state
->name
, compare_str
?: "");
1783 sql_insert_return_states(return_id
, return_ranges
, PARAM_VALUE
,
1784 -1, param_name
, buf
);
1785 } END_FOR_EACH_SM(sm
);
1788 static void db_limited_before(void)
1790 unmatched_stree
= clone_stree(__get_cur_stree());
1793 static void db_limited_after(void)
1795 free_stree(&unmatched_stree
);
1798 static void db_param_limit_filter(struct expression
*expr
, int param
, char *key
, char *value
, enum info_type op
)
1800 struct expression
*arg
;
1803 struct var_sym_list
*vsl
= NULL
;
1804 struct sm_state
*sm
;
1805 struct symbol
*compare_type
, *var_type
;
1806 struct range_list
*rl
;
1807 struct range_list
*limit
;
1808 struct range_list
*new;
1810 while (expr
->type
== EXPR_ASSIGNMENT
)
1811 expr
= strip_expr(expr
->right
);
1812 if (expr
->type
!= EXPR_CALL
)
1815 arg
= get_argument_from_call_expr(expr
->args
, param
);
1819 name
= get_chunk_from_key(arg
, key
, &sym
, &vsl
);
1822 if (op
!= PARAM_LIMIT
&& !sym
)
1825 if (strcmp(key
, "$") == 0)
1826 compare_type
= get_arg_type(expr
->fn
, param
);
1828 compare_type
= get_member_type_from_key(arg
, key
);
1830 sm
= get_sm_state(SMATCH_EXTRA
, name
, sym
);
1832 rl
= estate_rl(sm
->state
);
1834 rl
= alloc_whole_rl(compare_type
);
1836 call_results_to_rl(expr
, compare_type
, value
, &limit
);
1837 new = rl_intersection(rl
, limit
);
1839 var_type
= get_member_type_from_key(arg
, key
);
1840 new = cast_rl(var_type
, new);
1842 /* We want to preserve the implications here */
1843 if (sm
&& rl_equiv(estate_rl(sm
->state
), new))
1846 if (op
== PARAM_LIMIT
)
1847 set_extra_nomod_vsl(name
, sym
, vsl
, alloc_estate_rl(new));
1849 set_extra_mod(name
, sym
, alloc_estate_rl(new));
1856 static void db_param_limit(struct expression
*expr
, int param
, char *key
, char *value
)
1858 db_param_limit_filter(expr
, param
, key
, value
, PARAM_LIMIT
);
1861 static void db_param_filter(struct expression
*expr
, int param
, char *key
, char *value
)
1863 db_param_limit_filter(expr
, param
, key
, value
, PARAM_FILTER
);
1866 static void db_param_add_set(struct expression
*expr
, int param
, char *key
, char *value
, enum info_type op
)
1868 struct expression
*arg
;
1871 struct symbol
*type
;
1872 struct smatch_state
*state
;
1873 struct range_list
*new = NULL
;
1874 struct range_list
*added
= NULL
;
1876 while (expr
->type
== EXPR_ASSIGNMENT
)
1877 expr
= strip_expr(expr
->right
);
1878 if (expr
->type
!= EXPR_CALL
)
1881 arg
= get_argument_from_call_expr(expr
->args
, param
);
1884 type
= get_member_type_from_key(arg
, key
);
1885 name
= get_variable_from_key(arg
, key
, &sym
);
1889 state
= get_state(SMATCH_EXTRA
, name
, sym
);
1891 new = estate_rl(state
);
1893 call_results_to_rl(expr
, type
, value
, &added
);
1895 if (op
== PARAM_SET
)
1898 new = rl_union(new, added
);
1900 set_extra_mod(name
, sym
, alloc_estate_rl(new));
1905 static void db_param_add(struct expression
*expr
, int param
, char *key
, char *value
)
1907 db_param_add_set(expr
, param
, key
, value
, PARAM_ADD
);
1910 static void db_param_set(struct expression
*expr
, int param
, char *key
, char *value
)
1912 db_param_add_set(expr
, param
, key
, value
, PARAM_SET
);
1915 static void db_param_value(struct expression
*expr
, int param
, char *key
, char *value
)
1917 struct expression
*call
;
1920 struct symbol
*type
;
1921 struct range_list
*rl
= NULL
;
1927 while (call
->type
== EXPR_ASSIGNMENT
)
1928 call
= strip_expr(call
->right
);
1929 if (call
->type
!= EXPR_CALL
)
1932 type
= get_member_type_from_key(expr
->left
, key
);
1933 name
= get_variable_from_key(expr
->left
, key
, &sym
);
1937 call_results_to_rl(call
, type
, value
, &rl
);
1939 set_extra_mod(name
, sym
, alloc_estate_rl(rl
));
1944 static void match_call_info(struct expression
*expr
)
1946 struct smatch_state
*state
;
1947 struct range_list
*rl
= NULL
;
1948 struct expression
*arg
;
1949 struct symbol
*type
;
1952 FOR_EACH_PTR(expr
->args
, arg
) {
1953 type
= get_arg_type(expr
->fn
, i
);
1955 if (get_implied_rl(arg
, &rl
))
1956 rl
= cast_rl(type
, rl
);
1958 rl
= cast_rl(type
, alloc_whole_rl(get_type(arg
)));
1960 if (!is_whole_rl(rl
))
1961 sql_insert_caller_info(expr
, PARAM_VALUE
, i
, "$", show_rl(rl
));
1962 state
= get_state_expr(SMATCH_EXTRA
, arg
);
1963 if (estate_has_fuzzy_max(state
)) {
1964 sql_insert_caller_info(expr
, FUZZY_MAX
, i
, "$",
1965 sval_to_str(estate_get_fuzzy_max(state
)));
1968 } END_FOR_EACH_PTR(arg
);
1971 static void set_param_value(const char *name
, struct symbol
*sym
, char *key
, char *value
)
1973 struct range_list
*rl
= NULL
;
1974 struct smatch_state
*state
;
1975 struct symbol
*type
;
1978 if (strcmp(key
, "*$") == 0)
1979 snprintf(fullname
, sizeof(fullname
), "*%s", name
);
1980 else if (strncmp(key
, "$", 1) == 0)
1981 snprintf(fullname
, 256, "%s%s", name
, key
+ 1);
1985 type
= get_member_type_from_key(symbol_expression(sym
), key
);
1986 str_to_rl(type
, value
, &rl
);
1987 state
= alloc_estate_rl(rl
);
1988 set_state(SMATCH_EXTRA
, fullname
, sym
, state
);
1991 static void set_param_hard_max(const char *name
, struct symbol
*sym
, char *key
, char *value
)
1993 struct range_list
*rl
= NULL
;
1994 struct smatch_state
*state
;
1995 struct symbol
*type
;
1999 if (strcmp(key
, "*$") == 0)
2000 snprintf(fullname
, sizeof(fullname
), "*%s", name
);
2001 else if (strncmp(key
, "$", 1) == 0)
2002 snprintf(fullname
, 256, "%s%s", name
, key
+ 1);
2006 state
= get_state(SMATCH_EXTRA
, fullname
, sym
);
2009 type
= get_member_type_from_key(symbol_expression(sym
), key
);
2010 str_to_rl(type
, value
, &rl
);
2011 if (!rl_to_sval(rl
, &max
))
2013 estate_set_fuzzy_max(state
, max
);
2016 struct smatch_state
*get_extra_state(struct expression
*expr
)
2020 struct smatch_state
*ret
= NULL
;
2021 struct range_list
*rl
;
2023 if (is_pointer(expr
) && get_address_rl(expr
, &rl
))
2024 return alloc_estate_rl(rl
);
2026 name
= expr_to_known_chunk_sym(expr
, &sym
);
2030 ret
= get_state(SMATCH_EXTRA
, name
, sym
);
2036 void register_smatch_extra(int id
)
2040 add_merge_hook(my_id
, &merge_estates
);
2041 add_unmatched_state_hook(my_id
, &unmatched_state
);
2042 select_caller_info_hook(set_param_value
, PARAM_VALUE
);
2043 select_caller_info_hook(set_param_hard_max
, FUZZY_MAX
);
2044 select_return_states_before(&db_limited_before
);
2045 select_return_states_hook(PARAM_LIMIT
, &db_param_limit
);
2046 select_return_states_hook(PARAM_FILTER
, &db_param_filter
);
2047 select_return_states_hook(PARAM_ADD
, &db_param_add
);
2048 select_return_states_hook(PARAM_SET
, &db_param_set
);
2049 select_return_states_hook(PARAM_VALUE
, &db_param_value
);
2050 select_return_states_after(&db_limited_after
);
2053 static void match_link_modify(struct sm_state
*sm
, struct expression
*mod_expr
)
2055 struct var_sym_list
*links
;
2056 struct var_sym
*tmp
;
2057 struct smatch_state
*state
;
2059 links
= sm
->state
->data
;
2061 FOR_EACH_PTR(links
, tmp
) {
2062 state
= get_state(SMATCH_EXTRA
, tmp
->var
, tmp
->sym
);
2065 set_state(SMATCH_EXTRA
, tmp
->var
, tmp
->sym
, alloc_estate_whole(estate_type(state
)));
2066 } END_FOR_EACH_PTR(tmp
);
2067 set_state(link_id
, sm
->name
, sm
->sym
, &undefined
);
2070 void register_smatch_extra_links(int id
)
2075 void register_smatch_extra_late(int id
)
2077 add_merge_hook(link_id
, &merge_link_states
);
2078 add_modification_hook(link_id
, &match_link_modify
);
2079 add_hook(&match_dereferences
, DEREF_HOOK
);
2080 add_hook(&match_pointer_as_array
, OP_HOOK
);
2081 select_call_implies_hook(DEREFERENCE
, &set_param_dereferenced
);
2082 add_hook(&match_function_call
, FUNCTION_CALL_HOOK
);
2083 add_hook(&match_assign
, ASSIGNMENT_HOOK
);
2084 add_hook(&match_assign
, GLOBAL_ASSIGNMENT_HOOK
);
2085 add_hook(&unop_expr
, OP_HOOK
);
2086 add_hook(&asm_expr
, ASM_HOOK
);
2087 add_untracked_param_hook(&match_untracked_array
);
2089 add_hook(&match_call_info
, FUNCTION_CALL_HOOK
);
2090 add_member_info_callback(my_id
, struct_member_callback
);
2091 add_split_return_callback(&returned_struct_members
);
2093 add_hook(&assume_indexes_are_valid
, OP_HOOK
);