2 * Copyright (C) 2011 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 * There are a couple checks that try to see if a variable
20 * comes from the user. It would be better to unify them
21 * into one place. Also it we should follow the data down
22 * the call paths. Hence this file.
26 #include "smatch_slist.h"
27 #include "smatch_extra.h"
30 static int my_call_id
;
33 static unsigned long func_gets_user_data
;
35 static const char *kstr_funcs
[] = {
36 "kstrtoull", "kstrtoll", "kstrtoul", "kstrtol", "kstrtouint",
37 "kstrtoint", "kstrtou64", "kstrtos64", "kstrtou32", "kstrtos32",
38 "kstrtou16", "kstrtos16", "kstrtou8", "kstrtos8", "kstrtoull_from_user"
39 "kstrtoll_from_user", "kstrtoul_from_user", "kstrtol_from_user",
40 "kstrtouint_from_user", "kstrtoint_from_user", "kstrtou16_from_user",
41 "kstrtos16_from_user", "kstrtou8_from_user", "kstrtos8_from_user",
42 "kstrtou64_from_user", "kstrtos64_from_user", "kstrtou32_from_user",
43 "kstrtos32_from_user",
46 static const char *returns_user_data
[] = {
47 "simple_strtol", "simple_strtoll", "simple_strtoul", "simple_strtoull",
51 static struct stree
*start_states
;
52 static void save_start_states(struct statement
*stmt
)
54 start_states
= clone_stree(__get_cur_stree());
57 static void free_start_states(void)
59 free_stree(&start_states
);
62 static struct smatch_state
*empty_state(struct sm_state
*sm
)
64 return alloc_estate_empty();
67 static struct smatch_state
*new_state(struct symbol
*type
)
69 struct smatch_state
*state
;
71 if (!type
|| type_is_ptr(type
))
74 state
= alloc_estate_whole(type
);
75 estate_set_new(state
);
79 static void pre_merge_hook(struct sm_state
*cur
, struct sm_state
*other
)
81 struct smatch_state
*user
= cur
->state
;
82 struct smatch_state
*extra
;
83 struct smatch_state
*state
;
84 struct range_list
*rl
;
86 extra
= __get_state(SMATCH_EXTRA
, cur
->name
, cur
->sym
);
89 rl
= rl_intersection(estate_rl(user
), estate_rl(extra
));
90 state
= alloc_estate_rl(clone_rl(rl
));
91 if (estate_capped(user
) || is_capped_var_sym(cur
->name
, cur
->sym
))
92 estate_set_capped(state
);
93 if (estate_treat_untagged(user
))
94 estate_set_treat_untagged(state
);
95 if (estates_equiv(state
, cur
->state
))
97 set_state(my_id
, cur
->name
, cur
->sym
, state
);
100 static void extra_nomod_hook(const char *name
, struct symbol
*sym
, struct expression
*expr
, struct smatch_state
*state
)
102 struct smatch_state
*user
, *new;
103 struct range_list
*rl
;
105 user
= __get_state(my_id
, name
, sym
);
108 rl
= rl_intersection(estate_rl(user
), estate_rl(state
));
109 if (rl_equiv(rl
, estate_rl(user
)))
111 new = alloc_estate_rl(rl
);
112 if (estate_capped(user
))
113 estate_set_capped(new);
114 if (estate_treat_untagged(user
))
115 estate_set_treat_untagged(new);
116 set_state(my_id
, name
, sym
, new);
119 static bool user_rl_known(struct expression
*expr
)
121 struct range_list
*rl
;
124 if (!get_user_rl(expr
, &rl
))
127 close_to_max
= sval_type_max(rl_type(rl
));
128 close_to_max
.value
-= 100;
130 if (sval_cmp(rl_max(rl
), close_to_max
) >= 0)
135 static bool is_array_index_mask_nospec(struct expression
*expr
)
137 struct expression
*orig
;
139 orig
= get_assigned_expr(expr
);
140 if (!orig
|| orig
->type
!= EXPR_CALL
)
142 return sym_name_is("array_index_mask_nospec", orig
->fn
);
145 static bool binop_capped(struct expression
*expr
)
147 struct range_list
*left_rl
;
151 if (expr
->op
== '-' && get_user_rl(expr
->left
, &left_rl
)) {
152 if (user_rl_capped(expr
->left
))
154 comparison
= get_comparison(expr
->left
, expr
->right
);
155 if (comparison
&& show_special(comparison
)[0] == '>')
160 if (expr
->op
== '&' || expr
->op
== '%') {
161 bool left_user
, left_capped
, right_user
, right_capped
;
163 if (!get_value(expr
->right
, &sval
) && is_capped(expr
->right
))
165 if (is_array_index_mask_nospec(expr
->right
))
167 if (is_capped(expr
->left
))
169 left_user
= is_user_rl(expr
->left
);
170 right_user
= is_user_rl(expr
->right
);
171 if (!left_user
&& !right_user
)
174 left_capped
= user_rl_capped(expr
->left
);
175 right_capped
= user_rl_capped(expr
->right
);
177 if (left_user
&& left_capped
) {
180 if (right_user
&& right_capped
)
184 if (right_user
&& right_capped
) {
193 * Generally "capped" means that we capped it to an unknown value.
194 * This is useful because if Smatch doesn't know what the value is then
195 * we have to trust that it is correct. But if we known cap value is
196 * 100 then we can check if 100 is correct and complain if it's wrong.
198 * So then the problem is with BINOP when we take a capped variable
199 * plus a user variable which is clamped to a known range (uncapped)
200 * the result should be capped.
202 if ((user_rl_capped(expr
->left
) || user_rl_known(expr
->left
)) &&
203 (user_rl_capped(expr
->right
) || user_rl_known(expr
->right
)))
209 bool user_rl_capped(struct expression
*expr
)
211 struct smatch_state
*state
;
212 struct range_list
*rl
;
215 expr
= strip_expr(expr
);
218 if (get_value(expr
, &sval
))
220 if (expr
->type
== EXPR_BINOP
)
221 return binop_capped(expr
);
222 if ((expr
->type
== EXPR_PREOP
|| expr
->type
== EXPR_POSTOP
) &&
223 (expr
->op
== SPECIAL_INCREMENT
|| expr
->op
== SPECIAL_DECREMENT
))
224 return user_rl_capped(expr
->unop
);
225 state
= get_state_expr(my_id
, expr
);
227 return estate_capped(state
);
229 if (!get_user_rl(expr
, &rl
)) {
231 * The non user data parts of a binop are capped and
232 * also empty user rl states are capped.
237 if (rl_to_sval(rl
, &sval
))
240 return false; /* uncapped user data */
243 bool user_rl_treat_untagged(struct expression
*expr
)
245 struct smatch_state
*state
;
246 struct range_list
*rl
;
249 expr
= strip_expr(expr
);
252 if (get_value(expr
, &sval
))
255 state
= get_state_expr(my_id
, expr
);
257 return estate_treat_untagged(state
);
259 if (get_user_rl(expr
, &rl
))
260 return false; /* uncapped user data */
262 return true; /* not actually user data */
265 static void tag_inner_struct_members(struct expression
*expr
, struct symbol
*member
)
267 struct expression
*edge_member
;
268 struct symbol
*base
= get_real_base_type(member
);
272 expr
= member_expression(expr
, '.', member
->ident
);
274 FOR_EACH_PTR(base
->symbol_list
, tmp
) {
277 type
= get_real_base_type(tmp
);
281 if (type
->type
== SYM_UNION
|| type
->type
== SYM_STRUCT
) {
282 tag_inner_struct_members(expr
, tmp
);
289 edge_member
= member_expression(expr
, '.', tmp
->ident
);
290 set_state_expr(my_id
, edge_member
, new_state(type
));
291 } END_FOR_EACH_PTR(tmp
);
294 void __set_user_string(struct expression
*expr
);
295 static void tag_struct_members(struct symbol
*type
, struct expression
*expr
)
298 struct expression
*member
;
301 if (expr
->type
== EXPR_PREOP
&& expr
->op
== '&') {
302 expr
= strip_expr(expr
->unop
);
306 FOR_EACH_PTR(type
->symbol_list
, tmp
) {
307 type
= get_real_base_type(tmp
);
311 if (type
->type
== SYM_UNION
|| type
->type
== SYM_STRUCT
) {
312 tag_inner_struct_members(expr
, tmp
);
319 member
= member_expression(expr
, op
, tmp
->ident
);
320 if (type
->type
== SYM_ARRAY
) {
321 set_points_to_user_data(member
);
323 set_state_expr(my_id
, member
, new_state(get_type(member
)));
325 } END_FOR_EACH_PTR(tmp
);
328 static void tag_base_type(struct expression
*expr
)
330 if (expr
->type
== EXPR_PREOP
&& expr
->op
== '&')
331 expr
= strip_expr(expr
->unop
);
333 expr
= deref_expression(expr
);
334 set_state_expr(my_id
, expr
, new_state(get_type(expr
)));
337 static void tag_as_user_data(struct expression
*expr
)
341 expr
= strip_expr(expr
);
343 type
= get_type(expr
);
344 if (!type
|| type
->type
!= SYM_PTR
)
346 type
= get_real_base_type(type
);
349 if (type
== &void_ctype
) {
350 set_state_expr(my_id
, deref_expression(expr
), new_state(&ulong_ctype
));
353 if (type
->type
== SYM_BASETYPE
) {
354 if (expr
->type
!= EXPR_PREOP
&& expr
->op
!= '&')
355 set_points_to_user_data(expr
);
359 if (type
->type
== SYM_STRUCT
|| type
->type
== SYM_UNION
) {
360 if (expr
->type
!= EXPR_PREOP
|| expr
->op
!= '&')
361 expr
= deref_expression(expr
);
363 set_state_expr(my_id
, deref_expression(expr
), new_state(&ulong_ctype
));
364 tag_struct_members(type
, expr
);
368 static void match_user_copy(const char *fn
, struct expression
*expr
, void *_param
)
370 int param
= PTR_INT(_param
);
371 struct expression
*dest
;
373 func_gets_user_data
= true;
375 dest
= get_argument_from_call_expr(expr
->args
, param
);
376 dest
= strip_expr(dest
);
379 tag_as_user_data(dest
);
382 static int is_dev_attr_name(struct expression
*expr
)
387 name
= expr_to_str(expr
);
390 if (strstr(name
, "->attr.name"))
396 static int ends_in_n(struct expression
*expr
)
402 if (expr
->type
!= EXPR_STRING
|| !expr
->string
)
409 if (str
->data
[str
->length
- 3] == '%' &&
410 str
->data
[str
->length
- 2] == 'n')
415 static void match_sscanf(const char *fn
, struct expression
*expr
, void *unused
)
417 struct expression
*str
, *format
, *arg
;
420 func_gets_user_data
= true;
422 str
= get_argument_from_call_expr(expr
->args
, 0);
423 if (is_dev_attr_name(str
))
426 format
= get_argument_from_call_expr(expr
->args
, 1);
427 if (is_dev_attr_name(format
))
430 last
= ptr_list_size((struct ptr_list
*)expr
->args
) - 1;
433 FOR_EACH_PTR(expr
->args
, arg
) {
437 if (i
== last
&& ends_in_n(format
))
439 tag_as_user_data(arg
);
440 } END_FOR_EACH_PTR(arg
);
443 static int get_rl_from_function(struct expression
*expr
, struct range_list
**rl
)
447 if (expr
->type
!= EXPR_CALL
|| expr
->fn
->type
!= EXPR_SYMBOL
||
448 !expr
->fn
->symbol_name
|| !expr
->fn
->symbol_name
->name
)
451 for (i
= 0; i
< ARRAY_SIZE(returns_user_data
); i
++) {
452 if (strcmp(expr
->fn
->symbol_name
->name
, returns_user_data
[i
]) == 0) {
453 *rl
= alloc_whole_rl(get_type(expr
));
460 static int comes_from_skb_data(struct expression
*expr
)
462 expr
= strip_expr(expr
);
463 if (!expr
|| expr
->type
!= EXPR_PREOP
|| expr
->op
!= '*')
466 expr
= strip_expr(expr
->unop
);
469 if (expr
->type
== EXPR_BINOP
&& expr
->op
== '+')
470 expr
= strip_expr(expr
->left
);
472 return is_skb_data(expr
);
475 static int handle_get_user(struct expression
*expr
)
480 name
= get_macro_name(expr
->pos
);
481 if (!name
|| strcmp(name
, "get_user") != 0)
484 name
= expr_to_var(expr
->right
);
485 if (!name
|| (strcmp(name
, "__val_gu") != 0 && strcmp(name
, "__gu_val") != 0))
487 set_state_expr(my_id
, expr
->left
, new_state(get_type(expr
->left
)));
494 static bool state_is_new(struct expression
*expr
)
496 struct smatch_state
*state
;
498 state
= get_state_expr(my_id
, expr
);
499 if (estate_new(state
))
502 if (expr
->type
== EXPR_BINOP
) {
503 if (state_is_new(expr
->left
))
505 if (state_is_new(expr
->right
))
511 static bool handle_op_assign(struct expression
*expr
)
513 struct expression
*binop_expr
;
514 struct smatch_state
*state
;
515 struct range_list
*rl
;
518 case SPECIAL_ADD_ASSIGN
:
519 case SPECIAL_SUB_ASSIGN
:
520 case SPECIAL_AND_ASSIGN
:
521 case SPECIAL_MOD_ASSIGN
:
522 case SPECIAL_SHL_ASSIGN
:
523 case SPECIAL_SHR_ASSIGN
:
524 case SPECIAL_OR_ASSIGN
:
525 case SPECIAL_XOR_ASSIGN
:
526 case SPECIAL_MUL_ASSIGN
:
527 case SPECIAL_DIV_ASSIGN
:
528 binop_expr
= binop_expression(expr
->left
,
529 op_remove_assign(expr
->op
),
531 if (!get_user_rl(binop_expr
, &rl
))
534 rl
= cast_rl(get_type(expr
->left
), rl
);
535 state
= alloc_estate_rl(rl
);
536 if (user_rl_capped(binop_expr
))
537 estate_set_capped(state
);
538 if (user_rl_treat_untagged(expr
->left
))
539 estate_set_treat_untagged(state
);
540 if (state_is_new(binop_expr
))
541 estate_set_new(state
);
542 set_state_expr(my_id
, expr
->left
, state
);
548 static void match_assign(struct expression
*expr
)
550 struct symbol
*left_type
, *right_type
;
551 struct range_list
*rl
;
552 static struct expression
*handled
;
553 struct smatch_state
*state
;
554 struct expression
*faked
;
555 bool is_capped
= false;
558 left_type
= get_type(expr
->left
);
559 if (left_type
== &void_ctype
)
562 faked
= get_faked_expression();
564 /* FIXME: handle fake array assignments frob(&user_array[x]); */
566 if (is_fake_call(expr
->right
) && faked
&&
567 faked
->type
== EXPR_ASSIGNMENT
&&
568 points_to_user_data(faked
->right
)) {
569 if (is_skb_data(faked
->right
))
570 func_gets_user_data
= true;
571 rl
= alloc_whole_rl(get_type(expr
->left
));
576 if (faked
&& faked
== handled
)
578 if (is_fake_call(expr
->right
))
579 goto clear_old_state
;
580 if (handle_get_user(expr
))
582 if (points_to_user_data(expr
->right
) &&
583 is_struct_ptr(get_type(expr
->left
))) {
585 // This should be handled by smatch_points_to_user_data.c
586 // set_points_to_user_data(expr->left);
589 if (handle_op_assign(expr
))
592 goto clear_old_state
;
594 /* Handled by DB code */
595 if (expr
->right
->type
== EXPR_CALL
|| __in_fake_parameter_assign
)
598 if (!get_user_rl(expr
->right
, &rl
))
599 goto clear_old_state
;
600 is_capped
= user_rl_capped(expr
->right
);
601 is_new
= state_is_new(expr
->right
);
604 if (type_is_ptr(left_type
)) {
605 right_type
= get_type(expr
->right
);
606 if (right_type
&& right_type
->type
== SYM_ARRAY
)
607 set_points_to_user_data(expr
->left
);
611 rl
= cast_rl(left_type
, rl
);
612 state
= alloc_estate_rl(rl
);
614 estate_set_new(state
);
616 estate_set_capped(state
);
617 if (user_rl_treat_untagged(expr
->right
))
618 estate_set_treat_untagged(state
);
620 set_state_expr(my_id
, expr
->left
, state
);
627 * HACK ALERT!!! This should be at the start of the function. The
628 * the problem is that handling "pointer = array;" assignments is
629 * handled in this function instead of in kernel_points_to_user_data.c.
631 if (type_is_ptr(left_type
))
634 if (get_state_expr(my_id
, expr
->left
))
635 set_state_expr(my_id
, expr
->left
, alloc_estate_empty());
638 static void handle_eq_noteq(struct expression
*expr
)
640 struct smatch_state
*left_orig
, *right_orig
;
642 left_orig
= get_state_expr(my_id
, expr
->left
);
643 right_orig
= get_state_expr(my_id
, expr
->right
);
645 if (!left_orig
&& !right_orig
)
647 if (left_orig
&& right_orig
)
651 set_true_false_states_expr(my_id
, expr
->left
,
652 expr
->op
== SPECIAL_EQUAL
? alloc_estate_empty() : NULL
,
653 expr
->op
== SPECIAL_EQUAL
? NULL
: alloc_estate_empty());
655 set_true_false_states_expr(my_id
, expr
->right
,
656 expr
->op
== SPECIAL_EQUAL
? alloc_estate_empty() : NULL
,
657 expr
->op
== SPECIAL_EQUAL
? NULL
: alloc_estate_empty());
661 static struct range_list
*strip_negatives(struct range_list
*rl
)
663 sval_t min
= rl_min(rl
);
664 sval_t minus_one
= { .type
= rl_type(rl
), .value
= -1 };
665 sval_t over
= { .type
= rl_type(rl
), .value
= INT_MAX
+ 1ULL };
666 sval_t max
= sval_type_max(rl_type(rl
));
671 if (type_unsigned(rl_type(rl
)) && type_bits(rl_type(rl
)) > 31)
672 return remove_range(rl
, over
, max
);
674 return remove_range(rl
, min
, minus_one
);
677 static void handle_compare(struct expression
*expr
)
679 struct expression
*left
, *right
;
680 struct range_list
*left_rl
= NULL
;
681 struct range_list
*right_rl
= NULL
;
682 struct range_list
*user_rl
;
683 struct smatch_state
*capped_state
;
684 struct smatch_state
*left_true
= NULL
;
685 struct smatch_state
*left_false
= NULL
;
686 struct smatch_state
*right_true
= NULL
;
687 struct smatch_state
*right_false
= NULL
;
691 left
= strip_expr(expr
->left
);
692 right
= strip_expr(expr
->right
);
694 while (left
->type
== EXPR_ASSIGNMENT
)
695 left
= strip_expr(left
->left
);
698 * Conditions are mostly handled by smatch_extra.c, but there are some
699 * times where the exact values are not known so we can't do that.
701 * Normally, we might consider using smatch_capped.c to supliment smatch
702 * extra but that doesn't work when we merge unknown uncapped kernel
703 * data with unknown capped user data. The result is uncapped user
704 * data. We need to keep it separate and say that the user data is
705 * capped. In the past, I would have marked this as just regular
706 * kernel data (not user data) but we can't do that these days because
707 * we need to track user data for Spectre.
709 * The other situation which we have to handle is when we do have an
710 * int and we compare against an unknown unsigned kernel variable. In
711 * that situation we assume that the kernel data is less than INT_MAX.
712 * Otherwise then we get all sorts of array underflow false positives.
716 /* Handled in smatch_extra.c */
717 if (get_implied_value(left
, &sval
) ||
718 get_implied_value(right
, &sval
))
721 get_user_rl(left
, &left_rl
);
722 get_user_rl(right
, &right_rl
);
725 if (!left_rl
&& !right_rl
)
727 /* if both sides are user data that's not a good limit */
728 if (left_rl
&& right_rl
)
736 type
= get_type(expr
);
737 if (type_unsigned(type
))
738 user_rl
= strip_negatives(user_rl
);
739 capped_state
= alloc_estate_rl(user_rl
);
740 estate_set_capped(capped_state
);
744 case SPECIAL_UNSIGNED_LT
:
746 case SPECIAL_UNSIGNED_LTE
:
748 left_true
= capped_state
;
750 right_false
= capped_state
;
753 case SPECIAL_UNSIGNED_GT
:
755 case SPECIAL_UNSIGNED_GTE
:
757 left_false
= capped_state
;
759 right_true
= capped_state
;
763 set_true_false_states_expr(my_id
, left
, left_true
, left_false
);
764 set_true_false_states_expr(my_id
, right
, right_true
, right_false
);
767 static void match_condition(struct expression
*expr
)
769 if (expr
->type
!= EXPR_COMPARE
)
772 if (expr
->op
== SPECIAL_EQUAL
||
773 expr
->op
== SPECIAL_NOTEQUAL
) {
774 handle_eq_noteq(expr
);
778 handle_compare(expr
);
781 static void match_returns_user_rl(const char *fn
, struct expression
*expr
, void *unused
)
783 func_gets_user_data
= true;
786 static int get_user_macro_rl(struct expression
*expr
, struct range_list
**rl
)
788 struct expression
*parent
;
794 macro
= get_macro_name(expr
->pos
);
798 /* handle ntohl(foo[i]) where "i" is trusted */
799 parent
= expr_get_parent_expr(expr
);
800 while (parent
&& parent
->type
!= EXPR_BINOP
)
801 parent
= expr_get_parent_expr(parent
);
802 if (parent
&& parent
->type
== EXPR_BINOP
) {
803 char *parent_macro
= get_macro_name(parent
->pos
);
805 if (parent_macro
&& strcmp(macro
, parent_macro
) == 0)
809 if (strcmp(macro
, "ntohl") == 0) {
810 *rl
= alloc_whole_rl(&uint_ctype
);
813 if (strcmp(macro
, "ntohs") == 0) {
814 *rl
= alloc_whole_rl(&ushort_ctype
);
820 static int has_user_data(struct symbol
*sym
)
822 struct sm_state
*tmp
;
824 FOR_EACH_MY_SM(my_id
, __get_cur_stree(), tmp
) {
827 } END_FOR_EACH_SM(tmp
);
831 bool we_pass_user_data(struct expression
*call
)
833 struct expression
*arg
;
836 FOR_EACH_PTR(call
->args
, arg
) {
837 if (points_to_user_data(arg
))
839 sym
= expr_to_sym(arg
);
842 if (has_user_data(sym
))
844 } END_FOR_EACH_PTR(arg
);
849 static int db_returned_user_rl(struct expression
*call
, struct range_list
**rl
)
851 struct smatch_state
*state
;
854 if (is_fake_call(call
))
856 snprintf(buf
, sizeof(buf
), "return %p", call
);
857 state
= get_state(my_id
, buf
, NULL
);
858 if (!state
|| !estate_rl(state
))
860 *rl
= estate_rl(state
);
864 struct stree
*get_user_stree(void)
866 return get_all_states_stree(my_id
);
869 static int user_data_flag
;
870 static int no_user_data_flag
;
871 struct range_list
*var_user_rl(struct expression
*expr
)
873 struct smatch_state
*state
;
874 struct range_list
*rl
;
875 struct range_list
*absolute_rl
;
877 if (expr
->type
== EXPR_PREOP
&& expr
->op
== '&') {
878 no_user_data_flag
= 1;
882 if (expr
->type
== EXPR_BINOP
&& expr
->op
== '%') {
883 struct range_list
*left
, *right
;
885 if (!get_user_rl(expr
->right
, &right
))
887 get_absolute_rl(expr
->left
, &left
);
888 rl
= rl_binop(left
, '%', right
);
892 if (expr
->type
== EXPR_BINOP
&& expr
->op
== '/') {
893 struct range_list
*left
= NULL
;
894 struct range_list
*right
= NULL
;
895 struct range_list
*abs_right
;
898 * The specific bug I'm dealing with is:
900 * foo = capped_user / unknown;
902 * Instead of just saying foo is now entirely user_rl we should
903 * probably say instead that it is not at all user data.
907 get_user_rl(expr
->left
, &left
);
908 get_user_rl(expr
->right
, &right
);
909 get_absolute_rl(expr
->right
, &abs_right
);
911 if (left
&& !right
) {
912 rl
= rl_binop(left
, '/', abs_right
);
913 if (sval_cmp(rl_max(left
), rl_max(rl
)) < 0)
914 no_user_data_flag
= 1;
920 if (get_rl_from_function(expr
, &rl
))
923 if (get_user_macro_rl(expr
, &rl
))
926 if (comes_from_skb_data(expr
)) {
927 rl
= alloc_whole_rl(get_type(expr
));
931 state
= get_state_expr(my_id
, expr
);
932 if (state
&& estate_rl(state
)) {
933 rl
= estate_rl(state
);
937 if (expr
->type
== EXPR_CALL
&& db_returned_user_rl(expr
, &rl
))
940 if (expr
->type
== EXPR_PREOP
&& expr
->op
== '*' &&
941 points_to_user_data(expr
->unop
)) {
942 rl
= var_to_absolute_rl(expr
);
946 if (is_array(expr
)) {
947 struct expression
*array
= get_array_base(expr
);
949 if (!get_state_expr(my_id
, array
)) {
950 no_user_data_flag
= 1;
958 absolute_rl
= var_to_absolute_rl(expr
);
959 return clone_rl(rl_intersection(rl
, absolute_rl
));
962 static bool is_ptr_subtract(struct expression
*expr
)
964 expr
= strip_expr(expr
);
967 if (expr
->type
== EXPR_BINOP
&& expr
->op
== '-' &&
968 type_is_ptr(get_type(expr
->left
))) {
974 int get_user_rl(struct expression
*expr
, struct range_list
**rl
)
976 if (is_ptr_subtract(expr
))
980 no_user_data_flag
= 0;
981 custom_get_absolute_rl(expr
, &var_user_rl
, rl
);
982 if (!user_data_flag
|| no_user_data_flag
)
988 int is_user_rl(struct expression
*expr
)
990 struct range_list
*tmp
;
992 return get_user_rl(expr
, &tmp
) && tmp
;
995 int get_user_rl_var_sym(const char *name
, struct symbol
*sym
, struct range_list
**rl
)
997 struct smatch_state
*state
;
999 state
= get_state(my_id
, name
, sym
);
1000 if (state
&& estate_rl(state
)) {
1001 *rl
= estate_rl(state
);
1007 static void return_info_callback(int return_id
, char *return_ranges
,
1008 struct expression
*returned_expr
,
1010 const char *printed_name
,
1011 struct sm_state
*sm
)
1013 struct smatch_state
*extra
;
1014 struct range_list
*rl
;
1018 if (strcmp(printed_name
, "$") == 0)
1020 if (!param_was_set_var_sym(sm
->name
, sm
->sym
))
1023 rl
= estate_rl(sm
->state
);
1026 extra
= get_state(SMATCH_EXTRA
, sm
->name
, sm
->sym
);
1027 if (estate_rl(extra
))
1028 rl
= rl_intersection(estate_rl(sm
->state
), estate_rl(extra
));
1032 snprintf(buf
, sizeof(buf
), "%s%s%s",
1034 estate_capped(sm
->state
) ? "[c]" : "",
1035 estate_treat_untagged(sm
->state
) ? "[u]" : "");
1036 sql_insert_return_states(return_id
, return_ranges
,
1037 estate_new(sm
->state
) ? USER_DATA_SET
: USER_DATA
,
1038 param
, printed_name
, buf
);
1041 static void caller_info_callback(struct expression
*call
, int param
, char *printed_name
, struct sm_state
*sm
)
1043 struct smatch_state
*state
;
1044 struct range_list
*rl
;
1045 struct symbol
*type
;
1049 * Smatch uses a hack where if we get an unsigned long we say it's
1050 * both user data and it points to user data. But if we pass it to a
1051 * function which takes an int, then it's just user data. There's not
1052 * enough bytes for it to be a pointer.
1055 type
= get_arg_type(call
->fn
, param
);
1056 if (strcmp(printed_name
, "$") != 0 && type
&& type_bits(type
) < type_bits(&ptr_ctype
))
1059 if (strcmp(sm
->state
->name
, "") == 0)
1062 state
= __get_state(SMATCH_EXTRA
, sm
->name
, sm
->sym
);
1063 if (!state
|| !estate_rl(state
))
1064 rl
= estate_rl(sm
->state
);
1066 rl
= rl_intersection(estate_rl(sm
->state
), estate_rl(state
));
1071 snprintf(buf
, sizeof(buf
), "%s%s%s", show_rl(rl
),
1072 estate_capped(sm
->state
) ? "[c]" : "",
1073 estate_treat_untagged(sm
->state
) ? "[u]" : "");
1074 sql_insert_caller_info(call
, USER_DATA
, param
, printed_name
, buf
);
1077 static void db_param_set(struct expression
*expr
, int param
, char *key
, char *value
)
1079 struct expression
*arg
;
1082 struct smatch_state
*state
;
1084 while (expr
->type
== EXPR_ASSIGNMENT
)
1085 expr
= strip_expr(expr
->right
);
1086 if (expr
->type
!= EXPR_CALL
)
1089 arg
= get_argument_from_call_expr(expr
->args
, param
);
1092 name
= get_variable_from_key(arg
, key
, &sym
);
1096 state
= get_state(my_id
, name
, sym
);
1100 set_state(my_id
, name
, sym
, alloc_estate_empty());
1105 static bool param_data_capped(const char *value
)
1107 if (strstr(value
, ",c") || strstr(value
, "[c"))
1112 static bool param_data_treat_untagged(const char *value
)
1114 if (strstr(value
, ",u") || strstr(value
, "[u"))
1119 static void set_param_user_data(const char *name
, struct symbol
*sym
, char *key
, char *value
)
1121 struct expression
*expr
;
1122 struct range_list
*rl
= NULL
;
1123 struct smatch_state
*state
;
1124 struct symbol
*type
;
1127 expr
= symbol_expression(sym
);
1128 fullname
= get_variable_from_key(expr
, key
, NULL
);
1132 type
= get_member_type_from_key(expr
, key
);
1133 if (type
&& type
->type
== SYM_STRUCT
)
1136 // FIXME: This is temporary. Just run this on Thursday and then
1137 // let's make it a printf() and then delete it.
1141 str_to_rl(type
, value
, &rl
);
1142 rl
= swap_mtag_seed(expr
, rl
);
1143 state
= alloc_estate_rl(rl
);
1144 if (param_data_capped(value
) || is_capped(expr
))
1145 estate_set_capped(state
);
1146 if (param_data_treat_untagged(value
) || sym
->ctype
.as
== 5)
1147 estate_set_treat_untagged(state
);
1148 set_state(my_id
, fullname
, sym
, state
);
1151 static void set_called(const char *name
, struct symbol
*sym
, char *key
, char *value
)
1153 set_state(my_call_id
, "this_function", NULL
, &called
);
1156 static void match_syscall_definition(struct symbol
*sym
)
1163 macro
= get_macro_name(sym
->pos
);
1165 (strncmp("SYSCALL_DEFINE", macro
, strlen("SYSCALL_DEFINE")) == 0 ||
1166 strncmp("COMPAT_SYSCALL_DEFINE", macro
, strlen("COMPAT_SYSCALL_DEFINE")) == 0))
1169 name
= get_function();
1170 if (!option_no_db
&& get_state(my_call_id
, "this_function", NULL
) != &called
) {
1171 if (name
&& strncmp(name
, "sys_", 4) == 0)
1175 if (name
&& strncmp(name
, "compat_sys_", 11) == 0)
1181 FOR_EACH_PTR(sym
->ctype
.base_type
->arguments
, arg
) {
1182 set_state(my_id
, arg
->ident
->name
, arg
, alloc_estate_whole(get_real_base_type(arg
)));
1183 } END_FOR_EACH_PTR(arg
);
1189 static void store_user_data_return(struct expression
*expr
, char *key
, char *value
, bool is_new
)
1191 struct smatch_state
*state
;
1192 struct range_list
*rl
;
1193 struct symbol
*type
;
1199 type
= get_type(expr
);
1200 snprintf(buf
, sizeof(buf
), "return %p%s", expr
, key
+ 1);
1201 call_results_to_rl(expr
, type
, value
, &rl
);
1203 state
= alloc_estate_rl(rl
);
1205 estate_set_new(state
);
1207 set_state(my_id
, buf
, NULL
, state
);
1210 static void set_to_user_data(struct expression
*expr
, char *key
, char *value
, bool is_new
)
1212 struct smatch_state
*state
;
1215 struct symbol
*type
;
1216 struct range_list
*rl
= NULL
;
1218 type
= get_member_type_from_key(expr
, key
);
1219 name
= get_variable_from_key(expr
, key
, &sym
);
1223 call_results_to_rl(expr
, type
, value
, &rl
);
1225 state
= alloc_estate_rl(rl
);
1226 if (param_data_capped(value
))
1227 estate_set_capped(state
);
1228 if (param_data_treat_untagged(value
))
1229 estate_set_treat_untagged(state
);
1231 estate_set_new(state
);
1232 set_state(my_id
, name
, sym
, state
);
1237 static void returns_param_user_data(struct expression
*expr
, int param
, char *key
, char *value
)
1239 struct expression
*arg
;
1240 struct expression
*call
;
1243 while (call
->type
== EXPR_ASSIGNMENT
)
1244 call
= strip_expr(call
->right
);
1245 if (call
->type
!= EXPR_CALL
)
1248 if (!we_pass_user_data(call
))
1252 if (expr
->type
!= EXPR_ASSIGNMENT
) {
1253 store_user_data_return(expr
, key
, value
, OLD
);
1256 set_to_user_data(expr
->left
, key
, value
, OLD
);
1260 arg
= get_argument_from_call_expr(call
->args
, param
);
1263 set_to_user_data(arg
, key
, value
, OLD
);
1266 static void returns_param_user_data_set(struct expression
*expr
, int param
, char *key
, char *value
)
1268 struct expression
*arg
;
1270 func_gets_user_data
= true;
1273 if (expr
->type
!= EXPR_ASSIGNMENT
) {
1274 store_user_data_return(expr
, key
, value
, NEW
);
1277 set_to_user_data(expr
->left
, key
, value
, NEW
);
1281 while (expr
->type
== EXPR_ASSIGNMENT
)
1282 expr
= strip_expr(expr
->right
);
1283 if (expr
->type
!= EXPR_CALL
)
1286 arg
= get_argument_from_call_expr(expr
->args
, param
);
1289 set_to_user_data(arg
, key
, value
, NEW
);
1292 static void returns_param_capped(struct expression
*expr
, int param
, char *key
, char *value
)
1294 struct smatch_state
*state
, *new;
1298 name
= get_name_sym_from_key(expr
, param
, key
, &sym
);
1302 state
= get_state(my_id
, name
, sym
);
1303 if (!state
|| estate_capped(state
))
1306 new = clone_estate(state
);
1307 estate_set_capped(new);
1309 set_state(my_id
, name
, sym
, new);
1314 static void match_function_def(struct symbol
*sym
)
1316 if (is_user_data_fn(sym
))
1317 func_gets_user_data
= true;
1320 void register_kernel_user_data(int id
)
1326 if (option_project
!= PROJ_KERNEL
)
1329 set_dynamic_states(my_id
);
1331 add_function_data(&func_gets_user_data
);
1332 add_hook(&match_function_def
, FUNC_DEF_HOOK
);
1334 add_hook(&save_start_states
, AFTER_DEF_HOOK
);
1335 add_hook(&free_start_states
, AFTER_FUNC_HOOK
);
1336 add_function_data((unsigned long *)&start_states
);
1338 add_unmatched_state_hook(my_id
, &empty_state
);
1339 add_extra_nomod_hook(&extra_nomod_hook
);
1340 add_pre_merge_hook(my_id
, &pre_merge_hook
);
1341 add_merge_hook(my_id
, &merge_estates
);
1343 add_function_hook("copy_from_user", &match_user_copy
, INT_PTR(0));
1344 add_function_hook("__copy_from_user", &match_user_copy
, INT_PTR(0));
1345 add_function_hook("memcpy_fromiovec", &match_user_copy
, INT_PTR(0));
1346 for (i
= 0; i
< ARRAY_SIZE(kstr_funcs
); i
++)
1347 add_function_hook(kstr_funcs
[i
], &match_user_copy
, INT_PTR(2));
1348 add_function_hook("usb_control_msg", &match_user_copy
, INT_PTR(6));
1350 for (i
= 0; i
< ARRAY_SIZE(returns_user_data
); i
++)
1351 add_function_hook(returns_user_data
[i
], &match_returns_user_rl
, NULL
);
1353 add_function_hook("sscanf", &match_sscanf
, NULL
);
1355 add_hook(&match_syscall_definition
, AFTER_DEF_HOOK
);
1357 add_hook(&match_assign
, ASSIGNMENT_HOOK
);
1358 select_return_states_hook(PARAM_SET
, &db_param_set
);
1359 add_hook(&match_condition
, CONDITION_HOOK
);
1361 add_caller_info_callback(my_id
, caller_info_callback
);
1362 add_return_info_callback(my_id
, return_info_callback
);
1363 select_caller_info_hook(set_param_user_data
, USER_DATA
);
1364 select_return_states_hook(USER_DATA
, &returns_param_user_data
);
1365 select_return_states_hook(USER_DATA_SET
, &returns_param_user_data_set
);
1366 select_return_states_hook(CAPPED_DATA
, &returns_param_capped
);
1369 void register_kernel_user_data2(int id
)
1373 if (option_project
!= PROJ_KERNEL
)
1375 select_caller_info_hook(set_called
, INTERNAL
);