signed: unsigned variables are allowed to do math with negatives
[smatch.git] / smatch_conditions.c
blobe57248e5b047ec01b7f047f212a430e3843d68cb
1 /*
2 * sparse/smatch_conditions.c
4 * Copyright (C) 2006,2008 Dan Carpenter.
6 * Licensed under the Open Software License version 1.1
8 */
11 * The simplest type of condition is
12 * if (a) { ...
14 * The next simplest kind of conditions is
15 * if (a && b) { c;
16 * In that case 'a' is true when we get to 'b' and both are true
17 * when we get to c.
19 * Or's are a little more complicated.
20 * if (a || b) { c;
21 * We know 'a' is not true when we get to 'b' but it may be true
22 * when we get to c.
24 * If we mix and's and or's that's even more complicated.
25 * if (a && b && c || a && d) { d ;
26 * 'a' is true when we evaluate 'b', and 'd'.
27 * 'b' is true when we evaluate 'c' but otherwise we don't.
29 * The other thing that complicates matters is if we negate
30 * some if conditions.
31 * if (!a) { ...
32 * Smatch has passes the un-negated version to the client and flip
33 * the true and false values internally. This makes it easier
34 * to write checks.
36 * And negations can be part of a compound.
37 * if (a && !(b || c)) { d;
38 * In that situation we multiply the negative through to simplify
39 * stuff so that we can remove the parens like this:
40 * if (a && !b && !c) { d;
42 * One other thing is that:
43 * if ((a) != 0){ ...
44 * that's basically the same as testing for just 'a' and we simplify
45 * comparisons with zero before passing it to the script.
49 #include "smatch.h"
50 #include "smatch_slist.h"
51 #include "smatch_extra.h"
52 #include "smatch_expression_stacks.h"
54 extern int __expr_stmt_count;
56 static void split_conditions(struct expression *expr);
58 static int is_logical_and(struct expression *expr)
60 if (expr->op == SPECIAL_LOGICAL_AND)
61 return 1;
62 return 0;
65 static int handle_zero_comparisons(struct expression *expr)
67 struct expression *tmp = NULL;
69 // if left is zero or right is zero
70 if (is_zero(expr->left))
71 tmp = expr->right;
72 else if (is_zero(expr->right))
73 tmp = expr->left;
74 else
75 return 0;
77 // "if (foo != 0)" is the same as "if (foo)"
78 if (expr->op == SPECIAL_NOTEQUAL) {
79 split_conditions(tmp);
80 return 1;
83 // "if (foo == 0)" is the same as "if (!foo)"
84 if (expr->op == SPECIAL_EQUAL) {
85 split_conditions(tmp);
86 __negate_cond_stacks();
87 return 1;
90 return 0;
94 * This function is for handling calls to likely/unlikely
97 static int ignore_builtin_expect(struct expression *expr)
99 if (sym_name_is("__builtin_expect", expr->fn)) {
100 split_conditions(first_ptr_list((struct ptr_list *) expr->args));
101 return 1;
103 return 0;
107 * handle_compound_stmt() is for: foo = ({blah; blah; blah; 1})
110 static void handle_compound_stmt(struct statement *stmt)
112 struct expression *expr = NULL;
113 struct statement *last;
114 struct statement *s;
116 last = last_ptr_list((struct ptr_list *)stmt->stmts);
117 if (last->type != STMT_EXPRESSION) {
118 last = NULL;
119 } else {
120 expr = last->expression;
122 FOR_EACH_PTR(stmt->stmts, s) {
123 if (s != last)
124 __split_stmt(s);
125 } END_FOR_EACH_PTR(s);
126 split_conditions(expr);
127 return;
130 static int handle_preop(struct expression *expr)
132 struct statement *stmt;
134 if (expr->op == '!') {
135 split_conditions(expr->unop);
136 __negate_cond_stacks();
137 return 1;
139 stmt = get_expression_statement(expr);
140 if (stmt) {
141 handle_compound_stmt(stmt);
142 return 1;
144 return 0;
147 static void handle_logical(struct expression *expr)
150 * If we come to an "and" expr then:
151 * We split the left side.
152 * We keep all the current states.
153 * We split the right side.
154 * We keep all the states from both true sides.
156 * If it's an "or" expr then:
157 * We save the current slist.
158 * We split the left side.
159 * We use the false states for the right side.
160 * We split the right side.
161 * We save all the states that are the same on both sides.
164 split_conditions(expr->left);
166 if (!is_logical_and(expr))
167 __use_cond_false_states();
169 __push_cond_stacks();
171 __save_pre_cond_states();
172 split_conditions(expr->right);
173 __discard_pre_cond_states();
175 if (is_logical_and(expr)) {
176 __and_cond_states();
177 } else {
178 __or_cond_states();
180 __use_cond_true_states();
183 static struct state_list *combine(struct state_list *orig, struct state_list *fake,
184 struct state_list *new)
186 struct state_list *ret = NULL;
188 overwrite_slist(orig, &ret);
189 overwrite_slist(fake, &ret);
190 overwrite_slist(new, &ret);
191 free_slist(&new);
193 return ret;
197 * handle_select()
198 * if ((aaa()?bbb():ccc())) { ...
200 * This is almost the same as:
201 * if ((aaa() && bbb()) || (!aaa() && ccc())) { ...
203 * It's a bit complicated because we shouldn't pass aaa()
204 * to the clients more than once.
207 static void handle_select(struct expression *expr)
209 struct state_list *a_T = NULL;
210 struct state_list *a_F = NULL;
211 struct state_list *a_T_b_T = NULL;
212 struct state_list *a_T_b_F = NULL;
213 struct state_list *a_T_b_fake = NULL;
214 struct state_list *a_F_c_T = NULL;
215 struct state_list *a_F_c_F = NULL;
216 struct state_list *a_F_c_fake = NULL;
217 struct sm_state *sm;
220 * Imagine we have this: if (a ? b : c) { ...
222 * The condition is true if "a" is true and "b" is true or
223 * "a" is false and "c" is true. It's false if "a" is true
224 * and "b" is false or "a" is false and "c" is false.
226 * The variable name "a_T_b_T" stands for "a true b true" etc.
228 * But if we know "b" is true then we can simpilify things.
229 * The condition is true if "a" is true or if "a" is false and
230 * "c" is true. The only way the condition can be false is if
231 * "a" is false and "c" is false.
233 * The remaining thing is the "a_T_b_fake". When we simplify
234 * the equations we have to take into consideration that other
235 * states may have changed that don't play into the true false
236 * equation. Take the following example:
237 * if ({
238 * (flags) = __raw_local_irq_save();
239 * _spin_trylock(lock) ? 1 :
240 * ({ raw_local_irq_restore(flags); 0; });
241 * })
242 * Smatch has to record that the irq flags were restored on the
243 * false path.
247 __save_pre_cond_states();
249 split_conditions(expr->conditional);
251 a_T = __copy_cond_true_states();
252 a_F = __copy_cond_false_states();
254 __push_cond_stacks();
255 __push_fake_cur_slist();
256 split_conditions(expr->cond_true);
257 a_T_b_fake = __pop_fake_cur_slist();
258 a_T_b_T = combine(a_T, a_T_b_fake, __pop_cond_true_stack());
259 a_T_b_F = combine(a_T, a_T_b_fake,__pop_cond_false_stack());
261 __use_cond_false_states();
263 __push_cond_stacks();
264 __push_fake_cur_slist();
265 split_conditions(expr->cond_false);
266 a_F_c_fake = __pop_fake_cur_slist();
267 a_F_c_T = combine(a_F, a_F_c_fake, __pop_cond_true_stack());
268 a_F_c_F = combine(a_F, a_F_c_fake, __pop_cond_false_stack());
270 /* We have to restore the pre condition states so that
271 implied_condition_true() will use the right cur_slist */
272 __use_pre_cond_states();
274 if (implied_condition_true(expr->cond_true)) {
275 free_slist(&a_T_b_T);
276 free_slist(&a_T_b_F);
277 a_T_b_T = clone_slist(a_T);
278 overwrite_slist(a_T_b_fake, &a_T_b_T);
280 if (implied_condition_false(expr->cond_true)) {
281 free_slist(&a_T_b_T);
282 free_slist(&a_T_b_F);
283 a_T_b_F = clone_slist(a_T);
284 overwrite_slist(a_T_b_fake, &a_T_b_F);
286 if (implied_condition_true(expr->cond_false)) {
287 free_slist(&a_F_c_T);
288 free_slist(&a_F_c_F);
289 a_F_c_T = clone_slist(a_F);
290 overwrite_slist(a_F_c_fake, &a_F_c_T);
292 if (implied_condition_false(expr->cond_false)) {
293 free_slist(&a_F_c_T);
294 free_slist(&a_F_c_F);
295 a_F_c_F = clone_slist(a_F);
296 overwrite_slist(a_F_c_fake, &a_F_c_F);
299 merge_slist(&a_T_b_T, a_F_c_T);
300 merge_slist(&a_T_b_F, a_F_c_F);
302 __pop_cond_true_stack();
303 __pop_cond_false_stack();
304 __push_cond_stacks();
305 FOR_EACH_PTR(a_T_b_T, sm) {
306 __set_true_false_sm(sm, NULL);
307 } END_FOR_EACH_PTR(sm);
308 FOR_EACH_PTR(a_T_b_F, sm) {
309 __set_true_false_sm(NULL, sm);
310 } END_FOR_EACH_PTR(sm);
313 static void split_conditions(struct expression *expr)
315 if (option_debug) {
316 char *cond = get_variable_from_expr_complex(expr, NULL);
318 sm_debug("%d in split_conditions (%s)\n", get_lineno(), cond);
319 free_string(cond);
322 expr = strip_expr(expr);
323 if (!expr)
324 return;
326 switch (expr->type) {
327 case EXPR_LOGICAL:
328 handle_logical(expr);
329 return;
330 case EXPR_COMPARE:
331 if (handle_zero_comparisons(expr))
332 return;
333 break;
334 case EXPR_CALL:
335 if (ignore_builtin_expect(expr))
336 return;
337 break;
338 case EXPR_PREOP:
339 if (handle_preop(expr))
340 return;
341 break;
342 case EXPR_CONDITIONAL:
343 case EXPR_SELECT:
344 handle_select(expr);
345 return;
348 /* fixme: this should be in smatch_flow.c
349 but because of the funny stuff we do with conditions
350 it's awkward to put it there. We would need to
351 call CONDITION_HOOK in smatch_flow as well.
353 push_expression(&big_expression_stack, expr);
354 if (expr->type == EXPR_COMPARE) {
355 if (expr->left->type != EXPR_POSTOP)
356 __split_expr(expr->left);
357 if (expr->right->type != EXPR_POSTOP)
358 __split_expr(expr->right);
359 } else if (expr->type != EXPR_POSTOP) {
360 __split_expr(expr);
362 __pass_to_client(expr, CONDITION_HOOK);
363 if (expr->type == EXPR_COMPARE) {
364 if (expr->left->type == EXPR_POSTOP)
365 __split_expr(expr->left);
366 if (expr->right->type == EXPR_POSTOP)
367 __split_expr(expr->right);
368 } else if (expr->type == EXPR_POSTOP) {
369 __split_expr(expr);
371 pop_expression(&big_expression_stack);
374 static int inside_condition;
375 void __split_whole_condition(struct expression *expr)
377 sm_debug("%d in __split_whole_condition\n", get_lineno());
378 inside_condition++;
379 __save_pre_cond_states();
380 __push_cond_stacks();
381 /* it's a hack, but it's sometimes handy to have this stuff
382 on the big_expression_stack. */
383 push_expression(&big_expression_stack, expr);
384 if (expr)
385 split_conditions(expr);
386 __use_cond_states();
387 __pass_to_client(expr, WHOLE_CONDITION_HOOK);
388 pop_expression(&big_expression_stack);
389 inside_condition--;
390 sm_debug("%d done __split_whole_condition\n", get_lineno());
393 void __handle_logic(struct expression *expr)
395 sm_debug("%d in __handle_logic\n", get_lineno());
396 inside_condition++;
397 __save_pre_cond_states();
398 __push_cond_stacks();
399 /* it's a hack, but it's sometimes handy to have this stuff
400 on the big_expression_stack. */
401 push_expression(&big_expression_stack, expr);
402 if (expr)
403 split_conditions(expr);
404 __use_cond_states();
405 __pass_to_client(expr, WHOLE_CONDITION_HOOK);
406 pop_expression(&big_expression_stack);
407 __merge_false_states();
408 inside_condition--;
409 sm_debug("%d done __handle_logic\n", get_lineno());
412 static int is_condition_assign(struct expression *expr)
414 struct expression *right;
416 right = strip_expr(expr->right);
417 switch(right->type) {
418 case EXPR_LOGICAL:
419 case EXPR_COMPARE:
420 break;
421 case EXPR_PREOP:
422 if (right->op == '!')
423 break;
424 return 0;
425 default:
426 return 0;
428 return 1;
431 int __handle_condition_assigns(struct expression *expr)
433 struct expression *right;
435 right = strip_expr(expr->right);
436 if (!is_condition_assign(expr))
437 return 0;
439 sm_debug("%d in __handle_condition_assigns\n", get_lineno());
440 inside_condition++;
441 __save_pre_cond_states();
442 __push_cond_stacks();
443 /* it's a hack, but it's sometimes handy to have this stuff
444 on the big_expression_stack. */
445 push_expression(&big_expression_stack, right);
446 split_conditions(right);
447 set_true_false_states_expr(SMATCH_EXTRA, expr->left, alloc_extra_state(1), alloc_extra_state(0));
448 __use_cond_states();
449 __pass_to_client(right, WHOLE_CONDITION_HOOK);
450 pop_expression(&big_expression_stack);
451 inside_condition--;
452 sm_debug("%d done __handle_condition_assigns\n", get_lineno());
454 __push_true_states();
455 __use_false_states();
456 __merge_true_states();
457 return 1;
460 static int is_select_assign(struct expression *expr)
462 struct expression *right;
464 right = strip_expr(expr->right);
465 if (right->type == EXPR_CONDITIONAL)
466 return 1;
467 if (right->type == EXPR_SELECT)
468 return 1;
469 return 0;
472 static void set_fake_assign(struct expression *new,
473 struct expression *left, struct expression *right)
476 new->pos = left->pos;
477 new->op = (int)'=';
478 new->type = EXPR_ASSIGNMENT;
479 new->left = left;
480 new->right = right;
483 int __handle_select_assigns(struct expression *expr)
485 struct expression *right;
486 struct state_list *final_states = NULL;
487 struct sm_state *sm;
488 int is_true;
489 int is_false;
491 if (!is_select_assign(expr))
492 return 0;
493 sm_debug("%d in __handle_ternary_assigns\n", get_lineno());
494 right = strip_expr(expr->right);
496 is_true = implied_condition_true(right->conditional);
497 is_false = implied_condition_false(right->conditional);
499 /* hah hah. the ultra fake out */
500 __save_pre_cond_states();
501 __split_whole_condition(right->conditional);
503 if (!is_false) {
504 struct expression fake_expr;
506 if (right->cond_true)
507 set_fake_assign(&fake_expr, expr->left, right->cond_true);
508 else
509 set_fake_assign(&fake_expr, expr->left, right->conditional);
510 __split_expr(&fake_expr);
511 final_states = clone_slist(__get_cur_slist());
514 __use_false_states();
515 if (!is_true) {
516 struct expression fake_expr;
518 set_fake_assign(&fake_expr, expr->left, right->cond_false);
519 __split_expr(&fake_expr);
520 merge_slist(&final_states, __get_cur_slist());
523 __use_pre_cond_states();
525 FOR_EACH_PTR(final_states, sm) {
526 __set_sm(sm);
527 } END_FOR_EACH_PTR(sm);
529 free_slist(&final_states);
531 sm_debug("%d done __handle_ternary_assigns\n", get_lineno());
533 return 1;
536 static struct statement *split_then_return_last(struct statement *stmt)
538 struct statement *tmp;
539 struct statement *last_stmt;
541 last_stmt = last_ptr_list((struct ptr_list *)stmt->stmts);
542 if (!last_stmt)
543 return NULL;
545 __push_scope_hooks();
546 FOR_EACH_PTR(stmt->stmts, tmp) {
547 if (tmp == last_stmt)
548 return last_stmt;
549 __split_stmt(tmp);
550 } END_FOR_EACH_PTR(tmp);
551 return NULL;
554 int __handle_expr_statement_assigns(struct expression *expr)
556 struct expression *right;
557 struct statement *stmt;
559 right = expr->right;
560 if (right->type == EXPR_PREOP && right->op == '(')
561 right = right->unop;
562 if (right->type != EXPR_STATEMENT)
563 return 0;
565 __expr_stmt_count++;
566 stmt = right->statement;
567 if (stmt->type == STMT_COMPOUND) {
568 struct statement *last_stmt;
569 struct expression fake_assign;
570 struct expression fake_expr_stmt;
572 last_stmt = split_then_return_last(stmt);
573 if (!last_stmt) {
574 __expr_stmt_count--;
575 return 0;
578 fake_expr_stmt.pos = last_stmt->pos;
579 fake_expr_stmt.type = EXPR_STATEMENT;
580 fake_expr_stmt.statement = last_stmt;
582 fake_assign.pos = last_stmt->pos;
583 fake_assign.op = (int)'=';
584 fake_assign.type = EXPR_ASSIGNMENT;
585 fake_assign.left = expr->left;
586 fake_assign.right = &fake_expr_stmt;
588 __split_expr(&fake_assign);
590 __call_scope_hooks();
591 } else if (stmt->type == STMT_EXPRESSION) {
592 struct expression fake_assign;
594 fake_assign.pos = stmt->pos;
595 fake_assign.op = (int)'=';
596 fake_assign.type = EXPR_ASSIGNMENT;
597 fake_assign.left = expr->left;
598 fake_assign.right = stmt->expression;
600 __split_expr(&fake_assign);
601 } else {
602 __split_stmt(stmt);
604 __expr_stmt_count--;
605 return 1;
608 int in_condition(void)
610 return inside_condition;