kernel.no_return_funcs: add kunit_do_failed_assertion()
[smatch/bkmgit.git] / smatch_capped.c
blob3c39b16946d1534d36d810e1c84ccdc43047467d
1 /*
2 * Copyright (C) 2011 Oracle. All rights reserved.
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 * This is trying to make a list of the variables which
20 * have capped values. Sometimes we don't know what the
21 * cap is, for example if we are comparing variables but
22 * we don't know the values of the variables. In that
23 * case we only know that our variable is capped and we
24 * sort that information here.
27 #include "smatch.h"
28 #include "smatch_slist.h"
29 #include "smatch_extra.h"
31 static int my_id;
33 STATE(capped);
34 STATE(uncapped);
36 static void set_uncapped(struct sm_state *sm, struct expression *mod_expr)
38 set_state(my_id, sm->name, sm->sym, &uncapped);
41 static struct smatch_state *unmatched_state(struct sm_state *sm)
43 struct smatch_state *state;
45 state = __get_state(SMATCH_EXTRA, sm->name, sm->sym);
46 if (state && !estate_is_whole(state))
47 return &capped;
48 return &uncapped;
51 static int is_capped_macro(struct expression *expr)
53 char *name;
55 name = get_macro_name(expr->pos);
56 if (!name)
57 return 0;
59 if (strcmp(name, "min") == 0)
60 return 1;
61 if (strcmp(name, "MIN") == 0)
62 return 1;
63 if (strcmp(name, "min_t") == 0)
64 return 1;
66 return 0;
69 static bool binop_capped(struct expression *expr)
71 bool left_capped, right_capped;
72 sval_t sval;
74 if (expr->op == '&' && !get_value(expr->right, &sval))
75 return true;
76 if (expr->op == SPECIAL_RIGHTSHIFT)
77 return false;
78 if (expr->op == '%' &&
79 !get_value(expr->right, &sval) && is_capped(expr->right))
80 return true;
82 left_capped = is_capped(expr->left);
83 right_capped = is_capped(expr->right);
85 if (left_capped && right_capped)
86 return true;
87 if (!left_capped && !right_capped)
88 return false;
89 if (left_capped && get_hard_max(expr->right, &sval))
90 return true;
91 if (right_capped && get_hard_max(expr->left, &sval))
92 return true;
94 return false;
97 int is_capped(struct expression *expr)
99 struct symbol *type;
101 expr = strip_expr(expr);
102 while (expr && expr->type == EXPR_POSTOP) {
103 expr = strip_expr(expr->unop);
105 if (!expr)
106 return 0;
108 type = get_type(expr);
109 if (is_ptr_type(type))
110 return 0;
111 if (type == &bool_ctype)
112 return 0;
113 if (type_bits(type) >= 0 && type_bits(type) <= 2)
114 return 0;
116 if (is_capped_macro(expr))
117 return 1;
119 if (expr->type == EXPR_BINOP)
120 return binop_capped(expr);
122 if (get_state_expr(my_id, expr) == &capped)
123 return 1;
124 return 0;
127 int is_capped_var_sym(const char *name, struct symbol *sym)
129 if (get_state(my_id, name, sym) == &capped)
130 return 1;
131 return 0;
134 void set_param_capped_data(const char *name, struct symbol *sym, char *key, char *value)
136 char fullname[256];
138 if (strncmp(key, "$", 1))
139 return;
140 snprintf(fullname, 256, "%s%s", name, key + 1);
141 set_state(my_id, fullname, sym, &capped);
144 static void match_condition(struct expression *expr)
146 struct expression *left, *right;
147 struct smatch_state *left_true = NULL;
148 struct smatch_state *left_false = NULL;
149 struct smatch_state *right_true = NULL;
150 struct smatch_state *right_false = NULL;
151 sval_t sval;
154 if (expr->type != EXPR_COMPARE)
155 return;
157 left = strip_expr(expr->left);
158 right = strip_expr(expr->right);
160 while (left->type == EXPR_ASSIGNMENT)
161 left = strip_expr(left->left);
163 /* If we're dealing with known expressions, that's for smatch_extra.c */
164 if (__in_pre_condition) {
165 if (get_implied_value(right, &sval))
166 return;
167 } else {
168 if (get_implied_value(left, &sval) ||
169 get_implied_value(right, &sval))
170 return;
173 switch (expr->op) {
174 case '<':
175 case SPECIAL_LTE:
176 case SPECIAL_UNSIGNED_LT:
177 case SPECIAL_UNSIGNED_LTE:
178 left_true = &capped;
179 right_false = &capped;
180 break;
181 case '>':
182 case SPECIAL_GTE:
183 case SPECIAL_UNSIGNED_GT:
184 case SPECIAL_UNSIGNED_GTE:
185 left_false = &capped;
186 right_true = &capped;
187 break;
188 case SPECIAL_EQUAL:
189 left_true = &capped;
190 right_true = &capped;
191 break;
192 case SPECIAL_NOTEQUAL:
193 left_false = &capped;
194 right_false = &capped;
195 break;
197 default:
198 return;
201 set_true_false_states_expr(my_id, left, left_true, left_false);
202 set_true_false_states_expr(my_id, right, right_true, right_false);
205 static void match_assign(struct expression *expr)
207 struct symbol *type;
209 if (expr->op != '=' && !is_capped(expr->left))
210 return;
212 type = get_type(expr);
213 if (is_ptr_type(type))
214 return;
215 if (type == &bool_ctype)
216 return;
217 if (type_bits(type) >= 0 && type_bits(type) <= 2)
218 return;
220 if (is_capped(expr->right)) {
221 set_state_expr(my_id, expr->left, &capped);
222 } else {
223 if (get_state_expr(my_id, expr->left))
224 set_state_expr(my_id, expr->left, &uncapped);
228 static void match_caller_info(struct expression *expr)
230 struct expression *tmp;
231 sval_t sval;
232 int i;
234 i = -1;
235 FOR_EACH_PTR(expr->args, tmp) {
236 i++;
237 if (get_implied_value(tmp, &sval))
238 continue;
239 if (!is_capped(tmp))
240 continue;
241 sql_insert_caller_info(expr, CAPPED_DATA, i, "$", "1");
242 } END_FOR_EACH_PTR(tmp);
245 static void struct_member_callback(struct expression *call, int param, char *printed_name, struct sm_state *sm)
247 struct smatch_state *estate;
248 sval_t sval;
250 if (sm->state != &capped)
251 return;
252 estate = __get_state(SMATCH_EXTRA, sm->name, sm->sym);
253 if (estate_get_single_value(estate, &sval))
254 return;
255 sql_insert_caller_info(call, CAPPED_DATA, param, printed_name, "1");
258 static void return_info_callback(int return_id, char *return_ranges,
259 struct expression *returned_expr,
260 int param,
261 const char *printed_name,
262 struct sm_state *sm)
264 struct smatch_state *orig, *estate;
265 sval_t sval;
267 if (param < -1 || sm->state != &capped)
268 return;
269 if (printed_name[0] == '&')
270 return;
272 estate = __get_state(SMATCH_EXTRA, sm->name, sm->sym);
273 if (estate_get_single_value(estate, &sval))
274 return;
276 orig = get_state_stree(get_start_states(), my_id, sm->name, sm->sym);
277 if (orig == &capped && !param_was_set_var_sym(sm->name, sm->sym))
278 return;
280 sql_insert_return_states(return_id, return_ranges, CAPPED_DATA,
281 param, printed_name, "");
284 static void db_return_states_capped(struct expression *expr, int param, char *key, char *value)
286 char *name;
287 struct symbol *sym;
289 name = get_name_sym_from_param_key(expr, param, key, &sym);
290 if (!name || !sym)
291 goto free;
293 set_state(my_id, name, sym, &capped);
294 free:
295 free_string(name);
298 void register_capped(int id)
300 my_id = id;
302 add_unmatched_state_hook(my_id, &unmatched_state);
303 select_caller_info_hook(set_param_capped_data, CAPPED_DATA);
304 add_hook(&match_condition, CONDITION_HOOK);
305 add_hook(&match_assign, ASSIGNMENT_HOOK);
306 add_modification_hook(my_id, &set_uncapped);
308 add_hook(&match_caller_info, FUNCTION_CALL_HOOK);
309 add_member_info_callback(my_id, struct_member_callback);
311 add_return_info_callback(my_id, return_info_callback);
312 select_return_states_hook(CAPPED_DATA, &db_return_states_capped);