2 * Copyright (C) 2010 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
20 #include "smatch_slist.h"
21 #include "smatch_extra.h"
23 static struct range_list
*_get_rl(struct expression
*expr
, int implied
);
24 static struct range_list
*handle_variable(struct expression
*expr
, int implied
);
26 static sval_t zero
= {.type
= &int_ctype
, {.value
= 0} };
27 static sval_t one
= {.type
= &int_ctype
, {.value
= 1} };
29 static struct range_list
*rl_zero(void)
31 return alloc_rl(zero
, zero
);
34 static struct range_list
*rl_one(void)
36 return alloc_rl(one
, one
);
47 static struct range_list
*last_stmt_rl(struct statement
*stmt
, int implied
)
52 stmt
= last_ptr_list((struct ptr_list
*)stmt
->stmts
);
53 if (stmt
->type
!= STMT_EXPRESSION
)
55 return _get_rl(stmt
->expression
, implied
);
58 static struct range_list
*handle_expression_statement_rl(struct expression
*expr
, int implied
)
60 return last_stmt_rl(get_expression_statement(expr
), implied
);
63 static struct range_list
*handle_ampersand_rl(int implied
)
65 if (implied
== RL_EXACT
|| implied
== RL_HARD
)
67 return alloc_rl(valid_ptr_min_sval
, valid_ptr_max_sval
);
70 static struct range_list
*handle_negate_rl(struct expression
*expr
, int implied
)
72 if (known_condition_true(expr
->unop
))
74 if (known_condition_false(expr
->unop
))
77 if (implied
== RL_EXACT
)
80 if (implied_condition_true(expr
->unop
))
82 if (implied_condition_false(expr
->unop
))
84 return alloc_rl(zero
, one
);
87 static struct range_list
*handle_bitwise_negate(struct expression
*expr
, int implied
)
89 struct range_list
*rl
;
92 rl
= _get_rl(expr
->unop
, implied
);
93 if (!rl_to_sval(rl
, &sval
))
95 sval
= sval_preop(sval
, '~');
96 sval_cast(get_type(expr
->unop
), sval
);
97 return alloc_rl(sval
, sval
);
100 static struct range_list
*handle_minus_preop(struct expression
*expr
, int implied
)
102 struct range_list
*rl
;
105 rl
= _get_rl(expr
->unop
, implied
);
106 if (!rl_to_sval(rl
, &sval
))
108 sval
= sval_preop(sval
, '-');
109 return alloc_rl(sval
, sval
);
112 static struct range_list
*handle_preop_rl(struct expression
*expr
, int implied
)
116 return handle_ampersand_rl(implied
);
118 return handle_negate_rl(expr
, implied
);
120 return handle_bitwise_negate(expr
, implied
);
122 return handle_minus_preop(expr
, implied
);
124 return handle_variable(expr
, implied
);
126 return handle_expression_statement_rl(expr
, implied
);
132 static struct range_list
*handle_divide_rl(struct expression
*expr
, int implied
)
134 struct range_list
*left_rl
, *right_rl
;
138 type
= get_type(expr
);
140 left_rl
= _get_rl(expr
->left
, implied
);
141 left_rl
= cast_rl(type
, left_rl
);
142 right_rl
= _get_rl(expr
->right
, implied
);
143 right_rl
= cast_rl(type
, right_rl
);
145 if (!left_rl
|| !right_rl
)
147 if (is_whole_rl(left_rl
) || is_whole_rl(right_rl
))
149 if (sval_is_negative(rl_min(left_rl
)) || sval_cmp_val(rl_min(right_rl
), 0) <= 0)
152 max
= rl_max(left_rl
);
153 if (!sval_is_max(max
))
154 max
= sval_binop(max
, '/', rl_min(right_rl
));
155 min
= sval_binop(rl_min(left_rl
), '/', rl_max(right_rl
));
156 return alloc_rl(min
, max
);
159 static struct range_list
*handle_subtract_rl(struct expression
*expr
, int implied
)
162 struct range_list
*left_rl
, *right_rl
;
163 sval_t max
, min
, tmp
;
166 type
= get_type(expr
);
167 comparison
= get_comparison(expr
->left
, expr
->right
);
169 left_rl
= _get_rl(expr
->left
, implied
);
170 left_rl
= cast_rl(type
, left_rl
);
171 right_rl
= _get_rl(expr
->right
, implied
);
172 right_rl
= cast_rl(type
, right_rl
);
174 if ((!left_rl
|| !right_rl
) &&
175 (implied
== RL_EXACT
|| implied
== RL_HARD
|| implied
== RL_FUZZY
))
179 left_rl
= alloc_whole_rl(type
);
181 right_rl
= alloc_whole_rl(type
);
183 /* negative values complicate everything fix this later */
184 if (sval_is_negative(rl_min(right_rl
)))
186 max
= rl_max(left_rl
);
188 switch (comparison
) {
190 case SPECIAL_UNSIGNED_GT
:
191 min
= sval_type_val(type
, 1);
192 max
= rl_max(left_rl
);
195 case SPECIAL_UNSIGNED_GTE
:
196 min
= sval_type_val(type
, 0);
197 max
= rl_max(left_rl
);
200 if (sval_binop_overflows(rl_min(left_rl
), '-', rl_max(right_rl
)))
202 min
= sval_type_min(type
);
205 if (!sval_binop_overflows(rl_min(left_rl
), '-', rl_max(right_rl
))) {
206 tmp
= sval_binop(rl_min(left_rl
), '-', rl_max(right_rl
));
207 if (sval_cmp(tmp
, min
) > 0)
211 if (!sval_is_max(rl_max(left_rl
))) {
212 tmp
= sval_binop(rl_max(left_rl
), '-', rl_min(right_rl
));
213 if (sval_cmp(tmp
, max
) < 0)
217 if (sval_is_min(min
) && sval_is_max(max
))
220 return cast_rl(type
, alloc_rl(min
, max
));
223 static struct range_list
*handle_mod_rl(struct expression
*expr
, int implied
)
225 struct range_list
*rl
;
226 sval_t left
, right
, sval
;
228 if (implied
== RL_EXACT
) {
229 if (!get_value(expr
->right
, &right
))
231 if (!get_value(expr
->left
, &left
))
233 sval
= sval_binop(left
, '%', right
);
234 return alloc_rl(sval
, sval
);
236 /* if we can't figure out the right side it's probably hopeless */
237 if (!get_implied_value(expr
->right
, &right
))
240 right
= sval_cast(get_type(expr
), right
);
243 rl
= _get_rl(expr
->left
, implied
);
244 if (rl
&& rl_max(rl
).uvalue
< right
.uvalue
)
245 right
.uvalue
= rl_max(rl
).uvalue
;
247 return alloc_rl(zero
, right
);
250 static sval_t
sval_lowest_set_bit(sval_t sval
)
255 for (i
= 0; i
< 64; i
++) {
256 if (sval
.uvalue
& 1ULL << i
) {
259 sval
.uvalue
&= ~(1ULL << i
);
265 static struct range_list
*handle_bitwise_AND(struct expression
*expr
, int implied
)
268 struct range_list
*left_rl
, *right_rl
;
271 if (implied
!= RL_IMPLIED
&& implied
!= RL_ABSOLUTE
)
274 type
= get_type(expr
);
276 if (get_implied_value(expr
->left
, &known
)) {
279 min
= sval_lowest_set_bit(known
);
280 left_rl
= alloc_rl(min
, known
);
281 left_rl
= cast_rl(type
, left_rl
);
282 add_range(&left_rl
, sval_type_val(type
, 0), sval_type_val(type
, 0));
284 left_rl
= _get_rl(expr
->left
, implied
);
286 left_rl
= cast_rl(type
, left_rl
);
287 left_rl
= alloc_rl(sval_type_val(type
, 0), rl_max(left_rl
));
289 if (implied
== RL_HARD
)
291 left_rl
= alloc_whole_rl(type
);
295 if (get_implied_value(expr
->right
, &known
)) {
296 sval_t min
, left_max
, mod
;
298 min
= sval_lowest_set_bit(known
);
299 right_rl
= alloc_rl(min
, known
);
300 right_rl
= cast_rl(type
, right_rl
);
301 add_range(&right_rl
, sval_type_val(type
, 0), sval_type_val(type
, 0));
303 if (min
.value
!= 0) {
304 left_max
= rl_max(left_rl
);
305 mod
= sval_binop(left_max
, '%', min
);
306 left_max
= sval_binop(left_max
, '-', mod
);
308 if (left_max
.value
> 0 && sval_cmp(left_max
, rl_max(left_rl
)) < 0)
309 left_rl
= remove_range(left_rl
, left_max
, rl_max(left_rl
));
312 right_rl
= _get_rl(expr
->right
, implied
);
314 right_rl
= cast_rl(type
, right_rl
);
315 right_rl
= alloc_rl(sval_type_val(type
, 0), rl_max(right_rl
));
317 if (implied
== RL_HARD
)
319 right_rl
= alloc_whole_rl(type
);
323 return rl_intersection(left_rl
, right_rl
);
326 static struct range_list
*handle_bitwise_OR(struct expression
*expr
, int implied
)
329 struct range_list
*left_rl
, *right_rl
;
331 if (implied
!= RL_IMPLIED
&& implied
!= RL_ABSOLUTE
)
334 type
= get_type(expr
);
336 get_absolute_rl(expr
->left
, &left_rl
);
337 get_absolute_rl(expr
->right
, &right_rl
);
338 left_rl
= cast_rl(type
, left_rl
);
339 right_rl
= cast_rl(type
, right_rl
);
341 return rl_union(left_rl
, right_rl
);
344 static struct range_list
*handle_right_shift(struct expression
*expr
, int implied
)
346 struct range_list
*left_rl
;
350 if (implied
== RL_EXACT
|| implied
== RL_HARD
)
353 left_rl
= _get_rl(expr
->left
, implied
);
355 max
= rl_max(left_rl
);
356 min
= rl_min(left_rl
);
358 if (implied
== RL_FUZZY
)
360 max
= sval_type_max(get_type(expr
->left
));
361 min
= sval_type_val(get_type(expr
->left
), 0);
364 if (get_implied_value(expr
->right
, &right
)) {
365 min
= sval_binop(min
, SPECIAL_RIGHTSHIFT
, right
);
366 max
= sval_binop(max
, SPECIAL_RIGHTSHIFT
, right
);
367 } else if (!sval_is_negative(min
)) {
369 max
= sval_type_max(max
.type
);
374 return alloc_rl(min
, max
);
377 static struct range_list
*handle_left_shift(struct expression
*expr
, int implied
)
379 struct range_list
*left_rl
, *res
;
384 if (implied
== RL_EXACT
|| implied
== RL_HARD
)
386 /* this is hopeless without the right side */
387 if (!get_implied_value(expr
->right
, &right
))
389 left_rl
= _get_rl(expr
->left
, implied
);
391 max
= rl_max(left_rl
);
392 min
= rl_min(left_rl
);
393 if (min
.value
== 0) {
398 if (implied
== RL_FUZZY
)
400 max
= sval_type_max(get_type(expr
->left
));
401 min
= sval_type_val(get_type(expr
->left
), 1);
405 max
= sval_binop(max
, SPECIAL_LEFTSHIFT
, right
);
406 min
= sval_binop(min
, SPECIAL_LEFTSHIFT
, right
);
407 res
= alloc_rl(min
, max
);
409 res
= rl_union(res
, rl_zero());
413 static struct range_list
*handle_known_binop(struct expression
*expr
)
417 if (!get_value(expr
->left
, &left
))
419 if (!get_value(expr
->right
, &right
))
421 left
= sval_binop(left
, expr
->op
, right
);
422 return alloc_rl(left
, left
);
425 static struct range_list
*handle_binop_rl(struct expression
*expr
, int implied
)
428 struct range_list
*left_rl
, *right_rl
, *rl
;
431 rl
= handle_known_binop(expr
);
434 if (implied
== RL_EXACT
)
439 return handle_mod_rl(expr
, implied
);
441 return handle_bitwise_AND(expr
, implied
);
443 return handle_bitwise_OR(expr
, implied
);
444 case SPECIAL_RIGHTSHIFT
:
445 return handle_right_shift(expr
, implied
);
446 case SPECIAL_LEFTSHIFT
:
447 return handle_left_shift(expr
, implied
);
449 return handle_subtract_rl(expr
, implied
);
451 return handle_divide_rl(expr
, implied
);
454 type
= get_type(expr
);
455 left_rl
= _get_rl(expr
->left
, implied
);
456 left_rl
= cast_rl(type
, left_rl
);
457 right_rl
= _get_rl(expr
->right
, implied
);
458 right_rl
= cast_rl(type
, right_rl
);
460 if (!left_rl
|| !right_rl
)
463 if (sval_binop_overflows(rl_min(left_rl
), expr
->op
, rl_min(right_rl
)))
465 min
= sval_binop(rl_min(left_rl
), expr
->op
, rl_min(right_rl
));
467 if (sval_binop_overflows(rl_max(left_rl
), expr
->op
, rl_max(right_rl
))) {
473 max
= sval_type_max(get_type(expr
));
476 max
= sval_binop(rl_max(left_rl
), expr
->op
, rl_max(right_rl
));
479 return alloc_rl(min
, max
);
482 static int do_comparison(struct expression
*expr
)
484 struct range_list
*left_ranges
= NULL
;
485 struct range_list
*right_ranges
= NULL
;
486 int poss_true
, poss_false
;
489 type
= get_type(expr
);
491 get_implied_rl(expr
->left
, &left_ranges
);
492 get_implied_rl(expr
->right
, &right_ranges
);
493 left_ranges
= cast_rl(type
, left_ranges
);
494 right_ranges
= cast_rl(type
, right_ranges
);
496 poss_true
= possibly_true_rl(left_ranges
, expr
->op
, right_ranges
);
497 poss_false
= possibly_false_rl(left_ranges
, expr
->op
, right_ranges
);
499 free_rl(&left_ranges
);
500 free_rl(&right_ranges
);
502 if (!poss_true
&& !poss_false
)
504 if (poss_true
&& !poss_false
)
506 if (!poss_true
&& poss_false
)
511 static struct range_list
*handle_comparison_rl(struct expression
*expr
, int implied
)
516 if (get_value(expr
->left
, &left
) && get_value(expr
->right
, &right
)) {
517 struct data_range tmp_left
, tmp_right
;
521 tmp_right
.min
= right
;
522 tmp_right
.max
= right
;
523 if (true_comparison_range(&tmp_left
, expr
->op
, &tmp_right
))
528 if (implied
== RL_EXACT
)
531 res
= do_comparison(expr
);
537 return alloc_rl(zero
, one
);
540 static struct range_list
*handle_logical_rl(struct expression
*expr
, int implied
)
546 if (implied
== RL_EXACT
) {
547 if (get_value(expr
->left
, &left
))
549 if (get_value(expr
->right
, &right
))
552 if (get_implied_value(expr
->left
, &left
))
554 if (get_implied_value(expr
->right
, &right
))
559 case SPECIAL_LOGICAL_OR
:
560 if (left_known
&& left
.value
)
562 if (right_known
&& right
.value
)
564 if (left_known
&& right_known
)
567 case SPECIAL_LOGICAL_AND
:
568 if (left_known
&& right_known
) {
569 if (left
.value
&& right
.value
)
578 if (implied
== RL_EXACT
)
581 return alloc_rl(zero
, one
);
584 static struct range_list
*handle_conditional_rl(struct expression
*expr
, int implied
)
586 struct range_list
*true_rl
, *false_rl
;
588 int final_pass_orig
= final_pass
;
590 if (known_condition_true(expr
->conditional
))
591 return _get_rl(expr
->cond_true
, implied
);
592 if (known_condition_false(expr
->conditional
))
593 return _get_rl(expr
->cond_false
, implied
);
595 if (implied
== RL_EXACT
)
598 if (implied_condition_true(expr
->conditional
))
599 return _get_rl(expr
->cond_true
, implied
);
600 if (implied_condition_false(expr
->conditional
))
601 return _get_rl(expr
->cond_false
, implied
);
604 /* this becomes a problem with deeply nested conditional statements */
608 type
= get_type(expr
);
610 __push_fake_cur_stree();
612 __split_whole_condition(expr
->conditional
);
613 true_rl
= _get_rl(expr
->cond_true
, implied
);
614 __push_true_states();
615 __use_false_states();
616 false_rl
= _get_rl(expr
->cond_false
, implied
);
617 __merge_true_states();
618 __free_fake_cur_stree();
619 final_pass
= final_pass_orig
;
621 if (!true_rl
|| !false_rl
)
623 true_rl
= cast_rl(type
, true_rl
);
624 false_rl
= cast_rl(type
, false_rl
);
626 return rl_union(true_rl
, false_rl
);
629 static int get_fuzzy_max_helper(struct expression
*expr
, sval_t
*max
)
631 struct smatch_state
*state
;
634 if (get_hard_max(expr
, &sval
)) {
639 state
= get_state_expr(SMATCH_EXTRA
, expr
);
640 if (!state
|| !estate_has_fuzzy_max(state
))
642 *max
= sval_cast(get_type(expr
), estate_get_fuzzy_max(state
));
646 static int get_fuzzy_min_helper(struct expression
*expr
, sval_t
*min
)
648 struct smatch_state
*state
;
651 state
= get_state_expr(SMATCH_EXTRA
, expr
);
652 if (!state
|| !estate_rl(state
))
655 sval
= estate_min(state
);
656 if (sval_is_negative(sval
) && sval_is_min(sval
))
659 if (sval_is_max(sval
))
662 *min
= sval_cast(get_type(expr
), sval
);
666 int get_const_value(struct expression
*expr
, sval_t
*sval
)
671 if (expr
->type
!= EXPR_SYMBOL
|| !expr
->symbol
)
674 if (!(sym
->ctype
.modifiers
& MOD_CONST
))
676 if (get_value(sym
->initializer
, &right
)) {
677 *sval
= sval_cast(get_type(expr
), right
);
683 static struct range_list
*handle_variable(struct expression
*expr
, int implied
)
685 struct smatch_state
*state
;
686 struct range_list
*rl
;
687 sval_t sval
, min
, max
;
689 if (get_const_value(expr
, &sval
))
690 return alloc_rl(sval
, sval
);
698 state
= get_state_expr(SMATCH_EXTRA
, expr
);
699 if (!state
|| !state
->data
) {
700 if (implied
== RL_HARD
)
702 if (get_local_rl(expr
, &rl
))
704 if (get_db_type_rl(expr
, &rl
))
708 if (implied
== RL_HARD
&& !estate_has_hard_max(state
))
710 return clone_rl(estate_rl(state
));
712 if (!get_fuzzy_min_helper(expr
, &min
))
713 min
= sval_type_min(get_type(expr
));
714 if (!get_fuzzy_max_helper(expr
, &max
))
716 /* fuzzy ranges are often inverted */
717 if (sval_cmp(min
, max
) > 0) {
722 return alloc_rl(min
, max
);
727 static sval_t
handle_sizeof(struct expression
*expr
)
732 ret
= sval_blank(expr
);
733 sym
= expr
->cast_type
;
735 sym
= evaluate_expression(expr
->cast_expression
);
737 * Expressions of restricted types will possibly get
738 * promoted - check that here
740 if (is_restricted_type(sym
)) {
741 if (type_bits(sym
) < bits_in_int
)
743 } else if (is_fouled_type(sym
)) {
747 examine_symbol_type(sym
);
749 ret
.type
= size_t_ctype
;
750 if (type_bits(sym
) <= 0) /* sizeof(void) */ {
751 if (get_real_base_type(sym
) == &void_ctype
)
756 ret
.value
= type_bytes(sym
);
761 static struct range_list
*handle_call_rl(struct expression
*expr
, int implied
)
763 struct range_list
*rl
;
765 if (implied
== RL_EXACT
|| implied
== RL_HARD
|| implied
== RL_FUZZY
)
768 if (get_implied_return(expr
, &rl
))
770 return db_return_vals(expr
);
773 static struct range_list
*handle_cast(struct expression
*expr
, int implied
)
775 struct range_list
*rl
;
778 type
= get_type(expr
);
779 rl
= _get_rl(expr
->cast_expression
, implied
);
781 return cast_rl(type
, rl
);
782 if (implied
== RL_ABSOLUTE
)
783 return alloc_whole_rl(type
);
784 if (implied
== RL_IMPLIED
&& type
&&
785 type_bits(type
) > 0 && type_bits(type
) < 32)
786 return alloc_whole_rl(type
);
790 static struct range_list
*_get_rl(struct expression
*expr
, int implied
)
792 struct range_list
*rl
;
796 type
= get_type(expr
);
797 expr
= strip_parens(expr
);
803 case EXPR_FORCE_CAST
:
804 case EXPR_IMPLIED_CAST
:
805 rl
= handle_cast(expr
, implied
);
809 expr
= strip_expr(expr
);
813 switch (expr
->type
) {
815 sval
= sval_from_val(expr
, expr
->value
);
816 rl
= alloc_rl(sval
, sval
);
819 rl
= handle_preop_rl(expr
, implied
);
822 rl
= _get_rl(expr
->unop
, implied
);
825 rl
= handle_binop_rl(expr
, implied
);
828 rl
= handle_comparison_rl(expr
, implied
);
831 rl
= handle_logical_rl(expr
, implied
);
835 sval
= handle_sizeof(expr
);
836 rl
= alloc_rl(sval
, sval
);
839 case EXPR_CONDITIONAL
:
840 rl
= handle_conditional_rl(expr
, implied
);
843 rl
= handle_call_rl(expr
, implied
);
846 rl
= handle_variable(expr
, implied
);
852 if (type
&& implied
== RL_ABSOLUTE
)
853 return alloc_whole_rl(type
);
857 /* returns 1 if it can get a value literal or else returns 0 */
858 int get_value(struct expression
*expr
, sval_t
*sval
)
860 struct range_list
*rl
;
862 rl
= _get_rl(expr
, RL_EXACT
);
863 if (!rl_to_sval(rl
, sval
))
868 int get_implied_value(struct expression
*expr
, sval_t
*sval
)
870 struct range_list
*rl
;
872 rl
= _get_rl(expr
, RL_IMPLIED
);
873 if (!rl_to_sval(rl
, sval
))
878 int get_implied_min(struct expression
*expr
, sval_t
*sval
)
880 struct range_list
*rl
;
882 rl
= _get_rl(expr
, RL_IMPLIED
);
889 int get_implied_max(struct expression
*expr
, sval_t
*sval
)
891 struct range_list
*rl
;
893 rl
= _get_rl(expr
, RL_IMPLIED
);
900 int get_implied_rl(struct expression
*expr
, struct range_list
**rl
)
902 *rl
= _get_rl(expr
, RL_IMPLIED
);
908 int get_absolute_rl(struct expression
*expr
, struct range_list
**rl
)
910 *rl
= _get_rl(expr
, RL_ABSOLUTE
);
912 *rl
= alloc_whole_rl(get_type(expr
));
916 int get_implied_rl_var_sym(const char *var
, struct symbol
*sym
, struct range_list
**rl
)
918 struct smatch_state
*state
;
920 state
= get_state(SMATCH_EXTRA
, var
, sym
);
921 *rl
= estate_rl(state
);
927 int get_hard_max(struct expression
*expr
, sval_t
*sval
)
929 struct range_list
*rl
;
931 rl
= _get_rl(expr
, RL_HARD
);
938 int get_fuzzy_min(struct expression
*expr
, sval_t
*sval
)
940 struct range_list
*rl
;
943 rl
= _get_rl(expr
, RL_FUZZY
);
947 if (sval_is_negative(tmp
) && sval_is_min(tmp
))
953 int get_fuzzy_max(struct expression
*expr
, sval_t
*sval
)
955 struct range_list
*rl
;
958 rl
= _get_rl(expr
, RL_FUZZY
);
962 if (max
.uvalue
> INT_MAX
- 10000)
968 int get_absolute_min(struct expression
*expr
, sval_t
*sval
)
970 struct range_list
*rl
;
973 type
= get_type(expr
);
975 type
= &llong_ctype
; // FIXME: this is wrong but places assume get type can't fail.
976 rl
= _get_rl(expr
, RL_ABSOLUTE
);
980 *sval
= sval_type_min(type
);
982 if (sval_cmp(*sval
, sval_type_min(type
)) < 0)
983 *sval
= sval_type_min(type
);
987 int get_absolute_max(struct expression
*expr
, sval_t
*sval
)
989 struct range_list
*rl
;
992 type
= get_type(expr
);
995 rl
= _get_rl(expr
, RL_ABSOLUTE
);
999 *sval
= sval_type_max(type
);
1001 if (sval_cmp(sval_type_max(type
), *sval
) < 0)
1002 *sval
= sval_type_max(type
);
1006 int known_condition_true(struct expression
*expr
)
1013 if (get_value(expr
, &tmp
) && tmp
.value
)
1019 int known_condition_false(struct expression
*expr
)
1027 if (expr
->type
== EXPR_CALL
) {
1028 if (sym_name_is("__builtin_constant_p", expr
->fn
))
1034 int implied_condition_true(struct expression
*expr
)
1041 if (known_condition_true(expr
))
1043 if (get_implied_value(expr
, &tmp
) && tmp
.value
)
1046 if (expr
->type
== EXPR_POSTOP
)
1047 return implied_condition_true(expr
->unop
);
1049 if (expr
->type
== EXPR_PREOP
&& expr
->op
== SPECIAL_DECREMENT
)
1050 return implied_not_equal(expr
->unop
, 1);
1051 if (expr
->type
== EXPR_PREOP
&& expr
->op
== SPECIAL_INCREMENT
)
1052 return implied_not_equal(expr
->unop
, -1);
1054 expr
= strip_expr(expr
);
1055 switch (expr
->type
) {
1057 if (do_comparison(expr
) == 1)
1061 if (expr
->op
== '!') {
1062 if (implied_condition_false(expr
->unop
))
1068 if (implied_not_equal(expr
, 0) == 1)
1075 int implied_condition_false(struct expression
*expr
)
1077 struct expression
*tmp
;
1083 if (known_condition_false(expr
))
1086 switch (expr
->type
) {
1088 if (do_comparison(expr
) == 2)
1091 if (expr
->op
== '!') {
1092 if (implied_condition_true(expr
->unop
))
1096 tmp
= strip_expr(expr
);
1098 return implied_condition_false(tmp
);
1101 if (get_implied_value(expr
, &sval
) && sval
.value
== 0)
1108 int can_integer_overflow(struct symbol
*type
, struct expression
*expr
)
1111 sval_t lmax
, rmax
, res
;
1116 expr
= strip_expr(expr
);
1118 if (expr
->type
== EXPR_ASSIGNMENT
) {
1120 case SPECIAL_MUL_ASSIGN
:
1123 case SPECIAL_ADD_ASSIGN
:
1126 case SPECIAL_SHL_ASSIGN
:
1127 op
= SPECIAL_LEFTSHIFT
;
1132 } else if (expr
->type
== EXPR_BINOP
) {
1133 if (expr
->op
!= '*' && expr
->op
!= '+' && expr
->op
!= SPECIAL_LEFTSHIFT
)
1140 get_absolute_max(expr
->left
, &lmax
);
1141 get_absolute_max(expr
->right
, &rmax
);
1143 if (sval_binop_overflows(lmax
, op
, rmax
))
1146 res
= sval_binop(lmax
, op
, rmax
);
1147 if (sval_cmp(res
, sval_type_max(type
)) > 0)