smatch_math.c

   1 /*
   2  * Copyright (C) 2010 Dan Carpenter.
   3  *
   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.
   8  *
   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.
  13  *
  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
  16  */
  17
  18 #include "symbol.h"
  19 #include "smatch.h"
  20 #include "smatch_slist.h"
  21 #include "smatch_extra.h"
  22
  23 static struct range_list *_get_rl(struct expression *expr, int implied, int *recurse_cnt);
  24 static struct range_list *handle_variable(struct expression *expr, int implied, int *recurse_cnt);
  25 static struct range_list *(*custom_handle_variable)(struct expression *expr);
  26
  27 static int get_implied_value_internal(struct expression *expr, sval_t *sval, int *recurse_cnt);
  28 static int get_absolute_rl_internal(struct expression *expr, struct range_list **rl, int *recurse_cnt);
  29
  30 static sval_t zero  = {.type = &int_ctype, {.value = 0} };
  31 static sval_t one   = {.type = &int_ctype, {.value = 1} };
  32
  33 struct range_list *rl_zero(void)
  34 {
  35         return alloc_rl(zero, zero);
  36 }
  37
  38 struct range_list *rl_one(void)
  39 {
  40         return alloc_rl(one, one);
  41 }
  42
  43 enum {
  44         RL_EXACT,
  45         RL_HARD,
  46         RL_FUZZY,
  47         RL_IMPLIED,
  48         RL_ABSOLUTE,
  49         RL_REAL_ABSOLUTE,
  50 };
  51
  52 static struct range_list *last_stmt_rl(struct statement *stmt, int implied, int *recurse_cnt)
  53 {
  54         struct expression *expr;
  55
  56         if (!stmt)
  57                 return NULL;
  58
  59         stmt = last_ptr_list((struct ptr_list *)stmt->stmts);
  60         if (stmt->type == STMT_LABEL) {
  61                 if (stmt->label_statement &&
  62                     stmt->label_statement->type == STMT_EXPRESSION)
  63                         expr = stmt->label_statement->expression;
  64                 else
  65                         return NULL;
  66         } else if (stmt->type == STMT_EXPRESSION) {
  67                 expr = stmt->expression;
  68         } else {
  69                 return NULL;
  70         }
  71         return _get_rl(expr, implied, recurse_cnt);
  72 }
  73
  74 static struct range_list *handle_expression_statement_rl(struct expression *expr, int implied, int *recurse_cnt)
  75 {
  76         return last_stmt_rl(get_expression_statement(expr), implied, recurse_cnt);
  77 }
  78
  79 static struct range_list *handle_ampersand_rl(struct expression *expr, int implied, int *recurse_cnt)
  80 {
  81         struct range_list *rl;
  82
  83         if (implied == RL_EXACT || implied == RL_HARD)
  84                 return NULL;
  85         if (get_address_rl(expr, &rl))
  86                 return rl;
  87         return alloc_rl(valid_ptr_min_sval, valid_ptr_max_sval);
  88 }
  89
  90 static struct range_list *handle_negate_rl(struct expression *expr, int implied, int *recurse_cnt)
  91 {
  92         if (known_condition_true(expr->unop))
  93                 return rl_zero();
  94         if (known_condition_false(expr->unop))
  95                 return rl_one();
  96
  97         if (implied == RL_EXACT)
  98                 return NULL;
  99
 100         if (implied_condition_true(expr->unop))
 101                 return rl_zero();
 102         if (implied_condition_false(expr->unop))
 103                 return rl_one();
 104         return alloc_rl(zero, one);
 105 }
 106
 107 static struct range_list *handle_bitwise_negate(struct expression *expr, int implied, int *recurse_cnt)
 108 {
 109         struct range_list *rl;
 110         sval_t sval;
 111
 112         rl = _get_rl(expr->unop, implied, recurse_cnt);
 113         if (!rl_to_sval(rl, &sval))
 114                 return NULL;
 115         sval = sval_preop(sval, '~');
 116         sval_cast(get_type(expr->unop), sval);
 117         return alloc_rl(sval, sval);
 118 }
 119
 120 static struct range_list *handle_minus_preop(struct expression *expr, int implied, int *recurse_cnt)
 121 {
 122         struct range_list *rl;
 123         sval_t sval;
 124
 125         rl = _get_rl(expr->unop, implied, recurse_cnt);
 126         if (!rl_to_sval(rl, &sval))
 127                 return NULL;
 128         sval = sval_preop(sval, '-');
 129         return alloc_rl(sval, sval);
 130 }
 131
 132 static struct range_list *handle_preop_rl(struct expression *expr, int implied, int *recurse_cnt)
 133 {
 134         switch (expr->op) {
 135         case '&':
 136                 return handle_ampersand_rl(expr, implied, recurse_cnt);
 137         case '!':
 138                 return handle_negate_rl(expr, implied, recurse_cnt);
 139         case '~':
 140                 return handle_bitwise_negate(expr, implied, recurse_cnt);
 141         case '-':
 142                 return handle_minus_preop(expr, implied, recurse_cnt);
 143         case '*':
 144                 return handle_variable(expr, implied, recurse_cnt);
 145         case '(':
 146                 return handle_expression_statement_rl(expr, implied, recurse_cnt);
 147         default:
 148                 return NULL;
 149         }
 150 }
 151
 152 static struct range_list *handle_divide_rl(struct expression *expr, int implied, int *recurse_cnt)
 153 {
 154         struct range_list *left_rl, *right_rl;
 155         struct symbol *type;
 156
 157         type = get_type(expr);
 158
 159         left_rl = _get_rl(expr->left, implied, recurse_cnt);
 160         left_rl = cast_rl(type, left_rl);
 161         right_rl = _get_rl(expr->right, implied, recurse_cnt);
 162         right_rl = cast_rl(type, right_rl);
 163
 164         if (!left_rl || !right_rl)
 165                 return NULL;
 166
 167         if (implied != RL_REAL_ABSOLUTE) {
 168                 if (is_whole_rl(left_rl) || is_whole_rl(right_rl))
 169                         return NULL;
 170         }
 171
 172         return rl_binop(left_rl, '/', right_rl);
 173 }
 174
 175 static struct range_list *handle_subtract_rl(struct expression *expr, int implied, int *recurse_cnt)
 176 {
 177         struct symbol *type;
 178         struct range_list *left_rl, *right_rl;
 179         sval_t max, min, tmp;
 180         int comparison;
 181
 182         type = get_type(expr);
 183         comparison = get_comparison(expr->left, expr->right);
 184
 185         left_rl = _get_rl(expr->left, implied, recurse_cnt);
 186         left_rl = cast_rl(type, left_rl);
 187         right_rl = _get_rl(expr->right, implied, recurse_cnt);
 188         right_rl = cast_rl(type, right_rl);
 189
 190         if ((!left_rl || !right_rl) &&
 191             (implied == RL_EXACT || implied == RL_HARD || implied == RL_FUZZY))
 192                 return NULL;
 193
 194         if (!left_rl)
 195                 left_rl = alloc_whole_rl(type);
 196         if (!right_rl)
 197                 right_rl = alloc_whole_rl(type);
 198
 199         /* negative values complicate everything fix this later */
 200         if (sval_is_negative(rl_min(right_rl)))
 201                 return NULL;
 202         max = rl_max(left_rl);
 203
 204         switch (comparison) {
 205         case '>':
 206         case SPECIAL_UNSIGNED_GT:
 207                 min = sval_type_val(type, 1);
 208                 max = rl_max(left_rl);
 209                 break;
 210         case SPECIAL_GTE:
 211         case SPECIAL_UNSIGNED_GTE:
 212                 min = sval_type_val(type, 0);
 213                 max = rl_max(left_rl);
 214                 break;
 215         default:
 216                 if (sval_binop_overflows(rl_min(left_rl), '-', rl_max(right_rl)))
 217                         return NULL;
 218                 min = sval_type_min(type);
 219         }
 220
 221         if (!sval_binop_overflows(rl_min(left_rl), '-', rl_max(right_rl))) {
 222                 tmp = sval_binop(rl_min(left_rl), '-', rl_max(right_rl));
 223                 if (sval_cmp(tmp, min) > 0)
 224                         min = tmp;
 225         }
 226
 227         if (!sval_is_max(rl_max(left_rl))) {
 228                 tmp = sval_binop(rl_max(left_rl), '-', rl_min(right_rl));
 229                 if (sval_cmp(tmp, max) < 0)
 230                         max = tmp;
 231         }
 232
 233         if (sval_is_min(min) && sval_is_max(max))
 234                 return NULL;
 235
 236         return cast_rl(type, alloc_rl(min, max));
 237 }
 238
 239 static struct range_list *handle_mod_rl(struct expression *expr, int implied, int *recurse_cnt)
 240 {
 241         struct range_list *rl;
 242         sval_t left, right, sval;
 243
 244         if (implied == RL_EXACT) {
 245                 if (!get_value(expr->right, &right))
 246                         return NULL;
 247                 if (!get_value(expr->left, &left))
 248                         return NULL;
 249                 sval = sval_binop(left, '%', right);
 250                 return alloc_rl(sval, sval);
 251         }
 252         /* if we can't figure out the right side it's probably hopeless */
 253         if (!get_implied_value_internal(expr->right, &right, recurse_cnt))
 254                 return NULL;
 255
 256         right = sval_cast(get_type(expr), right);
 257         right.value--;
 258
 259         rl = _get_rl(expr->left, implied, recurse_cnt);
 260         if (rl && rl_max(rl).uvalue < right.uvalue)
 261                 right.uvalue = rl_max(rl).uvalue;
 262
 263         return alloc_rl(zero, right);
 264 }
 265
 266 static sval_t sval_lowest_set_bit(sval_t sval)
 267 {
 268         int i;
 269         int found = 0;
 270
 271         for (i = 0; i < 64; i++) {
 272                 if (sval.uvalue & 1ULL << i) {
 273                         if (!found++)
 274                                 continue;
 275                         sval.uvalue &= ~(1ULL << i);
 276                 }
 277         }
 278         return sval;
 279 }
 280
 281 static struct range_list *handle_bitwise_AND(struct expression *expr, int implied, int *recurse_cnt)
 282 {
 283         struct symbol *type;
 284         struct range_list *left_rl, *right_rl;
 285         sval_t known;
 286
 287         if (implied != RL_IMPLIED && implied != RL_ABSOLUTE && implied != RL_REAL_ABSOLUTE)
 288                 return NULL;
 289
 290         type = get_type(expr);
 291
 292         if (get_implied_value_internal(expr->left, &known, recurse_cnt)) {
 293                 sval_t min;
 294
 295                 min = sval_lowest_set_bit(known);
 296                 left_rl = alloc_rl(min, known);
 297                 left_rl = cast_rl(type, left_rl);
 298                 add_range(&left_rl, sval_type_val(type, 0), sval_type_val(type, 0));
 299         } else {
 300                 left_rl = _get_rl(expr->left, implied, recurse_cnt);
 301                 if (left_rl) {
 302                         left_rl = cast_rl(type, left_rl);
 303                         left_rl = alloc_rl(sval_type_val(type, 0), rl_max(left_rl));
 304                 } else {
 305                         if (implied == RL_HARD)
 306                                 return NULL;
 307                         left_rl = alloc_whole_rl(type);
 308                 }
 309         }
 310
 311         if (get_implied_value_internal(expr->right, &known, recurse_cnt)) {
 312                 sval_t min, left_max, mod;
 313
 314                 min = sval_lowest_set_bit(known);
 315                 right_rl = alloc_rl(min, known);
 316                 right_rl = cast_rl(type, right_rl);
 317                 add_range(&right_rl, sval_type_val(type, 0), sval_type_val(type, 0));
 318
 319                 if (min.value != 0) {
 320                         left_max = rl_max(left_rl);
 321                         mod = sval_binop(left_max, '%', min);
 322                         if (mod.value) {
 323                                 left_max = sval_binop(left_max, '-', mod);
 324                                 left_max.value++;
 325                                 if (left_max.value > 0 && sval_cmp(left_max, rl_max(left_rl)) < 0)
 326                                         left_rl = remove_range(left_rl, left_max, rl_max(left_rl));
 327                         }
 328                 }
 329         } else {
 330                 right_rl = _get_rl(expr->right, implied, recurse_cnt);
 331                 if (right_rl) {
 332                         right_rl = cast_rl(type, right_rl);
 333                         right_rl = alloc_rl(sval_type_val(type, 0), rl_max(right_rl));
 334                 } else {
 335                         if (implied == RL_HARD)
 336                                 return NULL;
 337                         right_rl = alloc_whole_rl(type);
 338                 }
 339         }
 340
 341         return rl_intersection(left_rl, right_rl);
 342 }
 343
 344 static struct range_list *use_rl_binop(struct expression *expr, int implied, int *recurse_cnt)
 345 {
 346         struct symbol *type;
 347         struct range_list *left_rl, *right_rl;
 348
 349         if (implied != RL_IMPLIED && implied != RL_ABSOLUTE && implied != RL_REAL_ABSOLUTE)
 350                 return NULL;
 351
 352         type = get_type(expr);
 353
 354         get_absolute_rl_internal(expr->left, &left_rl, recurse_cnt);
 355         get_absolute_rl_internal(expr->right, &right_rl, recurse_cnt);
 356         left_rl = cast_rl(type, left_rl);
 357         right_rl = cast_rl(type, right_rl);
 358         if (!left_rl || !right_rl)
 359                 return NULL;
 360
 361         return rl_binop(left_rl, expr->op, right_rl);
 362 }
 363
 364 static struct range_list *handle_right_shift(struct expression *expr, int implied, int *recurse_cnt)
 365 {
 366         struct range_list *left_rl;
 367         sval_t right;
 368         sval_t min, max;
 369
 370         if (implied == RL_EXACT || implied == RL_HARD)
 371                 return NULL;
 372
 373         left_rl = _get_rl(expr->left, implied, recurse_cnt);
 374         if (left_rl) {
 375                 max = rl_max(left_rl);
 376                 min = rl_min(left_rl);
 377         } else {
 378                 if (implied == RL_FUZZY)
 379                         return NULL;
 380                 max = sval_type_max(get_type(expr->left));
 381                 min = sval_type_val(get_type(expr->left), 0);
 382         }
 383
 384         if (get_implied_value_internal(expr->right, &right, recurse_cnt)) {
 385                 min = sval_binop(min, SPECIAL_RIGHTSHIFT, right);
 386                 max = sval_binop(max, SPECIAL_RIGHTSHIFT, right);
 387         } else if (!sval_is_negative(min)) {
 388                 min.value = 0;
 389                 max = sval_type_max(max.type);
 390         } else {
 391                 return NULL;
 392         }
 393
 394         return alloc_rl(min, max);
 395 }
 396
 397 static struct range_list *handle_left_shift(struct expression *expr, int implied, int *recurse_cnt)
 398 {
 399         struct range_list *left_rl, *res;
 400         sval_t right;
 401         sval_t min, max;
 402         int add_zero = 0;
 403
 404         if (implied == RL_EXACT || implied == RL_HARD)
 405                 return NULL;
 406         /* this is hopeless without the right side */
 407         if (!get_implied_value_internal(expr->right, &right, recurse_cnt))
 408                 return NULL;
 409         left_rl = _get_rl(expr->left, implied, recurse_cnt);
 410         if (left_rl) {
 411                 max = rl_max(left_rl);
 412                 min = rl_min(left_rl);
 413                 if (min.value == 0) {
 414                         min.value = 1;
 415                         add_zero = 1;
 416                 }
 417         } else {
 418                 if (implied == RL_FUZZY)
 419                         return NULL;
 420                 max = sval_type_max(get_type(expr->left));
 421                 min = sval_type_val(get_type(expr->left), 1);
 422                 add_zero = 1;
 423         }
 424
 425         max = sval_binop(max, SPECIAL_LEFTSHIFT, right);
 426         min = sval_binop(min, SPECIAL_LEFTSHIFT, right);
 427         res = alloc_rl(min, max);
 428         if (add_zero)
 429                 res = rl_union(res, rl_zero());
 430         return res;
 431 }
 432
 433 static struct range_list *handle_known_binop(struct expression *expr)
 434 {
 435         sval_t left, right;
 436
 437         if (!get_value(expr->left, &left))
 438                 return NULL;
 439         if (!get_value(expr->right, &right))
 440                 return NULL;
 441         left = sval_binop(left, expr->op, right);
 442         return alloc_rl(left, left);
 443 }
 444
 445 static int has_actual_ranges(struct range_list *rl)
 446 {
 447         struct data_range *tmp;
 448
 449         FOR_EACH_PTR(rl, tmp) {
 450                 if (sval_cmp(tmp->min, tmp->max) != 0)
 451                         return 1;
 452         } END_FOR_EACH_PTR(tmp);
 453         return 0;
 454 }
 455
 456 static struct range_list *handle_implied_binop(struct range_list *left_rl, int op, struct range_list *right_rl)
 457 {
 458         struct range_list *res_rl;
 459         struct data_range *left_drange, *right_drange;
 460         sval_t res;
 461
 462         if (!left_rl || !right_rl)
 463                 return NULL;
 464         if (has_actual_ranges(left_rl))
 465                 return NULL;
 466         if (has_actual_ranges(right_rl))
 467                 return NULL;
 468
 469         if (ptr_list_size((struct ptr_list *)left_rl) * ptr_list_size((struct ptr_list *)right_rl) > 20)
 470                 return NULL;
 471
 472         res_rl = NULL;
 473
 474         FOR_EACH_PTR(left_rl, left_drange) {
 475                 FOR_EACH_PTR(right_rl, right_drange) {
 476                         if ((op == '%' || op == '/') &&
 477                             right_drange->min.value == 0)
 478                                 return NULL;
 479                         res = sval_binop(left_drange->min, op, right_drange->min);
 480                         add_range(&res_rl, res, res);
 481                 } END_FOR_EACH_PTR(right_drange);
 482         } END_FOR_EACH_PTR(left_drange);
 483
 484         return res_rl;
 485 }
 486
 487 static struct range_list *handle_binop_rl(struct expression *expr, int implied, int *recurse_cnt)
 488 {
 489         struct smatch_state *state;
 490         struct symbol *type;
 491         struct range_list *left_rl, *right_rl, *rl;
 492         sval_t min, max;
 493
 494         rl = handle_known_binop(expr);
 495         if (rl)
 496                 return rl;
 497         if (implied == RL_EXACT)
 498                 return NULL;
 499
 500         state = get_extra_state(expr);
 501         if (state && !is_whole_rl(estate_rl(state)))
 502                 return clone_rl(estate_rl(state));
 503
 504         type = get_type(expr);
 505         left_rl = _get_rl(expr->left, implied, recurse_cnt);
 506         left_rl = cast_rl(type, left_rl);
 507         right_rl = _get_rl(expr->right, implied, recurse_cnt);
 508         right_rl = cast_rl(type, right_rl);
 509
 510         if (!left_rl && !right_rl)
 511                 return NULL;
 512
 513         rl = handle_implied_binop(left_rl, expr->op, right_rl);
 514         if (rl)
 515                 return rl;
 516
 517         switch (expr->op) {
 518         case '%':
 519                 return handle_mod_rl(expr, implied, recurse_cnt);
 520         case '&':
 521                 return handle_bitwise_AND(expr, implied, recurse_cnt);
 522         case '|':
 523         case '^':
 524                 return use_rl_binop(expr, implied, recurse_cnt);
 525         case SPECIAL_RIGHTSHIFT:
 526                 return handle_right_shift(expr, implied, recurse_cnt);
 527         case SPECIAL_LEFTSHIFT:
 528                 return handle_left_shift(expr, implied, recurse_cnt);
 529         case '-':
 530                 return handle_subtract_rl(expr, implied, recurse_cnt);
 531         case '/':
 532                 return handle_divide_rl(expr, implied, recurse_cnt);
 533         }
 534
 535         if (!left_rl || !right_rl)
 536                 return NULL;
 537
 538         if (sval_binop_overflows(rl_min(left_rl), expr->op, rl_min(right_rl)))
 539                 return NULL;
 540         if (sval_binop_overflows(rl_max(left_rl), expr->op, rl_max(right_rl)))
 541                 return NULL;
 542
 543         min = sval_binop(rl_min(left_rl), expr->op, rl_min(right_rl));
 544         max = sval_binop(rl_max(left_rl), expr->op, rl_max(right_rl));
 545
 546         return alloc_rl(min, max);
 547 }
 548
 549 static int do_comparison(struct expression *expr)
 550 {
 551         struct range_list *left_ranges = NULL;
 552         struct range_list *right_ranges = NULL;
 553         int poss_true, poss_false;
 554         struct symbol *type;
 555
 556         type = get_type(expr);
 557         get_absolute_rl(expr->left, &left_ranges);
 558         get_absolute_rl(expr->right, &right_ranges);
 559
 560         left_ranges = cast_rl(type, left_ranges);
 561         right_ranges = cast_rl(type, right_ranges);
 562
 563         poss_true = possibly_true_rl(left_ranges, expr->op, right_ranges);
 564         poss_false = possibly_false_rl(left_ranges, expr->op, right_ranges);
 565
 566         free_rl(&left_ranges);
 567         free_rl(&right_ranges);
 568
 569         if (!poss_true && !poss_false)
 570                 return 0x0;
 571         if (poss_true && !poss_false)
 572                 return 0x1;
 573         if (!poss_true && poss_false)
 574                 return 0x2;
 575         return 0x3;
 576 }
 577
 578 static struct range_list *handle_comparison_rl(struct expression *expr, int implied, int *recurse_cnt)
 579 {
 580         sval_t left, right;
 581         int res;
 582
 583         if (expr->op == SPECIAL_EQUAL && expr->left->type == EXPR_TYPE) {
 584                 struct symbol *left, *right;
 585
 586                 left = get_real_base_type(expr->left->symbol);
 587                 right = get_real_base_type(expr->left->symbol);
 588                 if (left == right)
 589                         return rl_one();
 590                 return rl_zero();
 591         }
 592
 593         if (get_value(expr->left, &left) && get_value(expr->right, &right)) {
 594                 struct data_range tmp_left, tmp_right;
 595
 596                 tmp_left.min = left;
 597                 tmp_left.max = left;
 598                 tmp_right.min = right;
 599                 tmp_right.max = right;
 600                 if (true_comparison_range(&tmp_left, expr->op, &tmp_right))
 601                         return rl_one();
 602                 return rl_zero();
 603         }
 604
 605         if (implied == RL_EXACT)
 606                 return NULL;
 607
 608         res = do_comparison(expr);
 609         if (res == 1)
 610                 return rl_one();
 611         if (res == 2)
 612                 return rl_zero();
 613
 614         return alloc_rl(zero, one);
 615 }
 616
 617 static struct range_list *handle_logical_rl(struct expression *expr, int implied, int *recurse_cnt)
 618 {
 619         sval_t left, right;
 620         int left_known = 0;
 621         int right_known = 0;
 622
 623         if (implied == RL_EXACT) {
 624                 if (get_value(expr->left, &left))
 625                         left_known = 1;
 626                 if (get_value(expr->right, &right))
 627                         right_known = 1;
 628         } else {
 629                 if (get_implied_value_internal(expr->left, &left, recurse_cnt))
 630                         left_known = 1;
 631                 if (get_implied_value_internal(expr->right, &right, recurse_cnt))
 632                         right_known = 1;
 633         }
 634
 635         switch (expr->op) {
 636         case SPECIAL_LOGICAL_OR:
 637                 if (left_known && left.value)
 638                         return rl_one();
 639                 if (right_known && right.value)
 640                         return rl_one();
 641                 if (left_known && right_known)
 642                         return rl_zero();
 643                 break;
 644         case SPECIAL_LOGICAL_AND:
 645                 if (left_known && right_known) {
 646                         if (left.value && right.value)
 647                                 return rl_one();
 648                         return rl_zero();
 649                 }
 650                 break;
 651         default:
 652                 return NULL;
 653         }
 654
 655         if (implied == RL_EXACT)
 656                 return NULL;
 657
 658         return alloc_rl(zero, one);
 659 }
 660
 661 static struct range_list *handle_conditional_rl(struct expression *expr, int implied, int *recurse_cnt)
 662 {
 663         struct range_list *true_rl, *false_rl;
 664         struct symbol *type;
 665         int final_pass_orig = final_pass;
 666
 667         if (known_condition_true(expr->conditional))
 668                 return _get_rl(expr->cond_true, implied, recurse_cnt);
 669         if (known_condition_false(expr->conditional))
 670                 return _get_rl(expr->cond_false, implied, recurse_cnt);
 671
 672         if (implied == RL_EXACT)
 673                 return NULL;
 674
 675         if (implied_condition_true(expr->conditional))
 676                 return _get_rl(expr->cond_true, implied, recurse_cnt);
 677         if (implied_condition_false(expr->conditional))
 678                 return _get_rl(expr->cond_false, implied, recurse_cnt);
 679
 680
 681         /* this becomes a problem with deeply nested conditional statements */
 682         if (low_on_memory())
 683                 return NULL;
 684
 685         type = get_type(expr);
 686
 687         __push_fake_cur_stree();
 688         final_pass = 0;
 689         __split_whole_condition(expr->conditional);
 690         true_rl = _get_rl(expr->cond_true, implied, recurse_cnt);
 691         __push_true_states();
 692         __use_false_states();
 693         false_rl = _get_rl(expr->cond_false, implied, recurse_cnt);
 694         __merge_true_states();
 695         __free_fake_cur_stree();
 696         final_pass = final_pass_orig;
 697
 698         if (!true_rl || !false_rl)
 699                 return NULL;
 700         true_rl = cast_rl(type, true_rl);
 701         false_rl = cast_rl(type, false_rl);
 702
 703         return rl_union(true_rl, false_rl);
 704 }
 705
 706 static int get_fuzzy_max_helper(struct expression *expr, sval_t *max)
 707 {
 708         struct smatch_state *state;
 709         sval_t sval;
 710
 711         if (get_hard_max(expr, &sval)) {
 712                 *max = sval;
 713                 return 1;
 714         }
 715
 716         state = get_extra_state(expr);
 717         if (!state || !estate_has_fuzzy_max(state))
 718                 return 0;
 719         *max = sval_cast(get_type(expr), estate_get_fuzzy_max(state));
 720         return 1;
 721 }
 722
 723 static int get_fuzzy_min_helper(struct expression *expr, sval_t *min)
 724 {
 725         struct smatch_state *state;
 726         sval_t sval;
 727
 728         state = get_extra_state(expr);
 729         if (!state || !estate_rl(state))
 730                 return 0;
 731
 732         sval = estate_min(state);
 733         if (sval_is_negative(sval) && sval_is_min(sval))
 734                 return 0;
 735
 736         if (sval_is_max(sval))
 737                 return 0;
 738
 739         *min = sval_cast(get_type(expr), sval);
 740         return 1;
 741 }
 742
 743 int get_const_value(struct expression *expr, sval_t *sval)
 744 {
 745         struct symbol *sym;
 746         sval_t right;
 747
 748         if (expr->type != EXPR_SYMBOL || !expr->symbol)
 749                 return 0;
 750         sym = expr->symbol;
 751         if (!(sym->ctype.modifiers & MOD_CONST))
 752                 return 0;
 753         if (get_value(sym->initializer, &right)) {
 754                 *sval = sval_cast(get_type(expr), right);
 755                 return 1;
 756         }
 757         return 0;
 758 }
 759
 760 struct range_list *var_to_absolute_rl(struct expression *expr)
 761 {
 762         struct smatch_state *state;
 763         struct range_list *rl;
 764
 765         state = get_extra_state(expr);
 766         if (!state || is_whole_rl(estate_rl(state))) {
 767                 state = get_real_absolute_state(expr);
 768                 if (state && state->data && !estate_is_whole(state))
 769                         return clone_rl(estate_rl(state));
 770                 if (get_local_rl(expr, &rl) && !is_whole_rl(rl))
 771                         return rl;
 772                 if (get_db_type_rl(expr, &rl) && !is_whole_rl(rl))
 773                         return rl;
 774                 return alloc_whole_rl(get_type(expr));
 775         }
 776         /* err on the side of saying things are possible */
 777         if (!estate_rl(state))
 778                 return alloc_whole_rl(get_type(expr));
 779         return clone_rl(estate_rl(state));
 780 }
 781
 782 static struct range_list *handle_variable(struct expression *expr, int implied, int *recurse_cnt)
 783 {
 784         struct smatch_state *state;
 785         struct range_list *rl;
 786         sval_t sval, min, max;
 787
 788         if (get_const_value(expr, &sval))
 789                 return alloc_rl(sval, sval);
 790
 791         if (custom_handle_variable) {
 792                 rl = custom_handle_variable(expr);
 793                 if (!rl)
 794                         return var_to_absolute_rl(expr);
 795                 return rl;
 796         }
 797
 798         switch (implied) {
 799         case RL_EXACT:
 800                 return NULL;
 801         case RL_HARD:
 802         case RL_IMPLIED:
 803         case RL_ABSOLUTE:
 804                 state = get_extra_state(expr);
 805                 if (!state || !state->data) {
 806                         if (implied == RL_HARD)
 807                                 return NULL;
 808                         if (get_local_rl(expr, &rl))
 809                                 return rl;
 810                         if (get_db_type_rl(expr, &rl))
 811                                 return rl;
 812                         return NULL;
 813                 }
 814                 if (implied == RL_HARD && !estate_has_hard_max(state))
 815                         return NULL;
 816                 return clone_rl(estate_rl(state));
 817         case RL_REAL_ABSOLUTE:
 818                 state = get_extra_state(expr);
 819                 if (!state || !state->data || is_whole_rl(estate_rl(state))) {
 820                         state = get_real_absolute_state(expr);
 821                         if (state && state->data)
 822                                 return clone_rl(estate_rl(state));
 823                         if (get_local_rl(expr, &rl))
 824                                 return rl;
 825                         if (get_db_type_rl(expr, &rl))
 826                                 return rl;
 827                         return NULL;
 828                 }
 829                 return clone_rl(estate_rl(state));
 830         case RL_FUZZY:
 831                 if (!get_fuzzy_min_helper(expr, &min))
 832                         min = sval_type_min(get_type(expr));
 833                 if (!get_fuzzy_max_helper(expr, &max))
 834                         return NULL;
 835                 /* fuzzy ranges are often inverted */
 836                 if (sval_cmp(min, max) > 0) {
 837                         sval = min;
 838                         min = max;
 839                         max = sval;
 840                 }
 841                 return alloc_rl(min, max);
 842         }
 843         return NULL;
 844 }
 845
 846 static sval_t handle_sizeof(struct expression *expr)
 847 {
 848         struct symbol *sym;
 849         sval_t ret;
 850
 851         ret = sval_blank(expr);
 852         sym = expr->cast_type;
 853         if (!sym) {
 854                 sym = evaluate_expression(expr->cast_expression);
 855                 /*
 856                  * Expressions of restricted types will possibly get
 857                  * promoted - check that here
 858                  */
 859                 if (is_restricted_type(sym)) {
 860                         if (type_bits(sym) < bits_in_int)
 861                                 sym = &int_ctype;
 862                 } else if (is_fouled_type(sym)) {
 863                         sym = &int_ctype;
 864                 }
 865         }
 866         examine_symbol_type(sym);
 867
 868         ret.type = size_t_ctype;
 869         if (type_bits(sym) <= 0) /* sizeof(void) */ {
 870                 if (get_real_base_type(sym) == &void_ctype)
 871                         ret.value = 1;
 872                 else
 873                         ret.value = 0;
 874         } else
 875                 ret.value = type_bytes(sym);
 876
 877         return ret;
 878 }
 879
 880 static struct range_list *handle_strlen(struct expression *expr, int implied, int *recurse_cnt)
 881 {
 882         struct range_list *rl;
 883         struct expression *arg;
 884         sval_t sval = { .type = &ulong_ctype };
 885
 886         if (implied == RL_EXACT)
 887                 return NULL;
 888
 889         arg = get_argument_from_call_expr(expr->args, 0);
 890         if (!arg)
 891                 return NULL;
 892         if (arg->type == EXPR_STRING) {
 893                 sval.value = arg->string->length - 1;
 894                 return alloc_rl(sval, sval);
 895         }
 896
 897         if (implied == RL_HARD || implied == RL_FUZZY)
 898                 return NULL;
 899
 900         if (get_implied_return(expr, &rl))
 901                 return rl;
 902
 903         return NULL;
 904 }
 905
 906 static struct range_list *handle_call_rl(struct expression *expr, int implied, int *recurse_cnt)
 907 {
 908         struct range_list *rl;
 909
 910         if (sym_name_is("__builtin_expect", expr->fn)) {
 911                 struct expression *arg;
 912
 913                 arg = get_argument_from_call_expr(expr->args, 0);
 914                 return _get_rl(arg, implied, recurse_cnt);
 915         }
 916
 917         if (sym_name_is("strlen", expr->fn))
 918                 return handle_strlen(expr, implied, recurse_cnt);
 919
 920         if (implied == RL_EXACT || implied == RL_HARD || implied == RL_FUZZY)
 921                 return NULL;
 922
 923         if (get_implied_return(expr, &rl))
 924                 return rl;
 925         return db_return_vals(expr);
 926 }
 927
 928 static struct range_list *handle_cast(struct expression *expr, int implied, int *recurse_cnt)
 929 {
 930         struct range_list *rl;
 931         struct symbol *type;
 932
 933         type = get_type(expr);
 934         rl = _get_rl(expr->cast_expression, implied, recurse_cnt);
 935         if (rl)
 936                 return cast_rl(type, rl);
 937         if (implied == RL_ABSOLUTE || implied == RL_REAL_ABSOLUTE)
 938                 return alloc_whole_rl(type);
 939         if (implied == RL_IMPLIED && type &&
 940             type_bits(type) > 0 && type_bits(type) < 32)
 941                 return alloc_whole_rl(type);
 942         return NULL;
 943 }
 944
 945 static struct range_list *_get_rl(struct expression *expr, int implied, int *recurse_cnt)
 946 {
 947         struct range_list *rl;
 948         struct symbol *type;
 949         sval_t sval;
 950
 951         type = get_type(expr);
 952         expr = strip_parens(expr);
 953         if (!expr)
 954                 return NULL;
 955
 956         if (++(*recurse_cnt) >= 200)
 957                 return NULL;
 958
 959         switch(expr->type) {
 960         case EXPR_CAST:
 961         case EXPR_FORCE_CAST:
 962         case EXPR_IMPLIED_CAST:
 963                 rl = handle_cast(expr, implied, recurse_cnt);
 964                 goto out_cast;
 965         }
 966
 967         expr = strip_expr(expr);
 968         if (!expr)
 969                 return NULL;
 970
 971         switch (expr->type) {
 972         case EXPR_VALUE:
 973                 sval = sval_from_val(expr, expr->value);
 974                 rl = alloc_rl(sval, sval);
 975                 break;
 976         case EXPR_PREOP:
 977                 rl = handle_preop_rl(expr, implied, recurse_cnt);
 978                 break;
 979         case EXPR_POSTOP:
 980                 rl = _get_rl(expr->unop, implied, recurse_cnt);
 981                 break;
 982         case EXPR_BINOP:
 983                 rl = handle_binop_rl(expr, implied, recurse_cnt);
 984                 break;
 985         case EXPR_COMPARE:
 986                 rl = handle_comparison_rl(expr, implied, recurse_cnt);
 987                 break;
 988         case EXPR_LOGICAL:
 989                 rl = handle_logical_rl(expr, implied, recurse_cnt);
 990                 break;
 991         case EXPR_PTRSIZEOF:
 992         case EXPR_SIZEOF:
 993                 sval = handle_sizeof(expr);
 994                 rl = alloc_rl(sval, sval);
 995                 break;
 996         case EXPR_SELECT:
 997         case EXPR_CONDITIONAL:
 998                 rl = handle_conditional_rl(expr, implied, recurse_cnt);
 999                 break;
1000         case EXPR_CALL:
1001                 rl = handle_call_rl(expr, implied, recurse_cnt);
1002                 break;
1003         default:
1004                 rl = handle_variable(expr, implied, recurse_cnt);
1005         }
1006
1007 out_cast:
1008         if (rl)
1009                 return rl;
1010         if (type && (implied == RL_ABSOLUTE || implied == RL_REAL_ABSOLUTE))
1011                 return alloc_whole_rl(type);
1012         return NULL;
1013 }
1014
1015 /* returns 1 if it can get a value literal or else returns 0 */
1016 int get_value(struct expression *expr, sval_t *sval)
1017 {
1018         struct range_list *rl;
1019         int recurse_cnt = 0;
1020
1021         rl = _get_rl(expr, RL_EXACT, &recurse_cnt);
1022         if (!rl_to_sval(rl, sval))
1023                 return 0;
1024         return 1;
1025 }
1026
1027 static int get_implied_value_internal(struct expression *expr, sval_t *sval, int *recurse_cnt)
1028 {
1029         struct range_list *rl;
1030
1031         rl =  _get_rl(expr, RL_IMPLIED, recurse_cnt);
1032         if (!rl_to_sval(rl, sval))
1033                 return 0;
1034         return 1;
1035 }
1036
1037 int get_implied_value(struct expression *expr, sval_t *sval)
1038 {
1039         struct range_list *rl;
1040         int recurse_cnt = 0;
1041
1042         rl =  _get_rl(expr, RL_IMPLIED, &recurse_cnt);
1043         if (!rl_to_sval(rl, sval))
1044                 return 0;
1045         return 1;
1046 }
1047
1048 int get_implied_min(struct expression *expr, sval_t *sval)
1049 {
1050         struct range_list *rl;
1051         int recurse_cnt = 0;
1052
1053         rl =  _get_rl(expr, RL_IMPLIED, &recurse_cnt);
1054         if (!rl)
1055                 return 0;
1056         *sval = rl_min(rl);
1057         return 1;
1058 }
1059
1060 int get_implied_max(struct expression *expr, sval_t *sval)
1061 {
1062         struct range_list *rl;
1063         int recurse_cnt = 0;
1064
1065         rl =  _get_rl(expr, RL_IMPLIED, &recurse_cnt);
1066         if (!rl)
1067                 return 0;
1068         *sval = rl_max(rl);
1069         return 1;
1070 }
1071
1072 int get_implied_rl(struct expression *expr, struct range_list **rl)
1073 {
1074         int recurse_cnt = 0;
1075
1076         *rl = _get_rl(expr, RL_IMPLIED, &recurse_cnt);
1077         if (*rl)
1078                 return 1;
1079         return 0;
1080 }
1081
1082 static int get_absolute_rl_internal(struct expression *expr, struct range_list **rl, int *recurse_cnt)
1083 {
1084         *rl = _get_rl(expr, RL_ABSOLUTE, recurse_cnt);
1085         if (!*rl)
1086                 *rl = alloc_whole_rl(get_type(expr));
1087         return 1;
1088 }
1089
1090 int get_absolute_rl(struct expression *expr, struct range_list **rl)
1091 {
1092         int recurse_cnt = 0;
1093
1094         *rl = _get_rl(expr, RL_ABSOLUTE, &recurse_cnt);
1095         if (!*rl)
1096                 *rl = alloc_whole_rl(get_type(expr));
1097         return 1;
1098 }
1099
1100 int get_real_absolute_rl(struct expression *expr, struct range_list **rl)
1101 {
1102         int recurse_cnt = 0;
1103
1104         *rl = _get_rl(expr, RL_REAL_ABSOLUTE, &recurse_cnt);
1105         if (!*rl)
1106                 *rl = alloc_whole_rl(get_type(expr));
1107         return 1;
1108 }
1109
1110 int custom_get_absolute_rl(struct expression *expr,
1111                            struct range_list *(*fn)(struct expression *expr),
1112                            struct range_list **rl)
1113 {
1114         int recurse_cnt = 0;
1115
1116         *rl = NULL;
1117         custom_handle_variable = fn;
1118         *rl = _get_rl(expr, RL_REAL_ABSOLUTE, &recurse_cnt);
1119         custom_handle_variable = NULL;
1120         return 1;
1121 }
1122
1123 int get_implied_rl_var_sym(const char *var, struct symbol *sym, struct range_list **rl)
1124 {
1125         struct smatch_state *state;
1126
1127         state = get_state(SMATCH_EXTRA, var, sym);
1128         *rl = estate_rl(state);
1129         if (*rl)
1130                 return 1;
1131         return 0;
1132 }
1133
1134 int get_hard_max(struct expression *expr, sval_t *sval)
1135 {
1136         struct range_list *rl;
1137         int recurse_cnt = 0;
1138
1139         rl =  _get_rl(expr, RL_HARD, &recurse_cnt);
1140         if (!rl)
1141                 return 0;
1142         *sval = rl_max(rl);
1143         return 1;
1144 }
1145
1146 int get_fuzzy_min(struct expression *expr, sval_t *sval)
1147 {
1148         struct range_list *rl;
1149         sval_t tmp;
1150         int recurse_cnt = 0;
1151
1152         rl =  _get_rl(expr, RL_FUZZY, &recurse_cnt);
1153         if (!rl)
1154                 return 0;
1155         tmp = rl_min(rl);
1156         if (sval_is_negative(tmp) && sval_is_min(tmp))
1157                 return 0;
1158         *sval = tmp;
1159         return 1;
1160 }
1161
1162 int get_fuzzy_max(struct expression *expr, sval_t *sval)
1163 {
1164         struct range_list *rl;
1165         sval_t max;
1166         int recurse_cnt = 0;
1167
1168         rl =  _get_rl(expr, RL_FUZZY, &recurse_cnt);
1169         if (!rl)
1170                 return 0;
1171         max = rl_max(rl);
1172         if (max.uvalue > INT_MAX - 10000)
1173                 return 0;
1174         *sval = max;
1175         return 1;
1176 }
1177
1178 int get_absolute_min(struct expression *expr, sval_t *sval)
1179 {
1180         struct range_list *rl;
1181         struct symbol *type;
1182         int recurse_cnt = 0;
1183
1184         type = get_type(expr);
1185         if (!type)
1186                 type = &llong_ctype;  // FIXME: this is wrong but places assume get type can't fail.
1187         rl = _get_rl(expr, RL_ABSOLUTE, &recurse_cnt);
1188         if (rl)
1189                 *sval = rl_min(rl);
1190         else
1191                 *sval = sval_type_min(type);
1192
1193         if (sval_cmp(*sval, sval_type_min(type)) < 0)
1194                 *sval = sval_type_min(type);
1195         return 1;
1196 }
1197
1198 int get_absolute_max(struct expression *expr, sval_t *sval)
1199 {
1200         struct range_list *rl;
1201         struct symbol *type;
1202         int recurse_cnt = 0;
1203
1204         type = get_type(expr);
1205         if (!type)
1206                 type = &llong_ctype;
1207         rl = _get_rl(expr, RL_ABSOLUTE, &recurse_cnt);
1208         if (rl)
1209                 *sval = rl_max(rl);
1210         else
1211                 *sval = sval_type_max(type);
1212
1213         if (sval_cmp(sval_type_max(type), *sval) < 0)
1214                 *sval = sval_type_max(type);
1215         return 1;
1216 }
1217
1218 int known_condition_true(struct expression *expr)
1219 {
1220         sval_t tmp;
1221
1222         if (!expr)
1223                 return 0;
1224
1225         if (get_value(expr, &tmp) && tmp.value)
1226                 return 1;
1227
1228         return 0;
1229 }
1230
1231 int known_condition_false(struct expression *expr)
1232 {
1233         if (!expr)
1234                 return 0;
1235
1236         if (is_zero(expr))
1237                 return 1;
1238
1239         if (expr->type == EXPR_CALL) {
1240                 if (sym_name_is("__builtin_constant_p", expr->fn))
1241                         return 1;
1242         }
1243         return 0;
1244 }
1245
1246 int implied_condition_true(struct expression *expr)
1247 {
1248         sval_t tmp;
1249
1250         if (!expr)
1251                 return 0;
1252
1253         if (known_condition_true(expr))
1254                 return 1;
1255         if (get_implied_value(expr, &tmp) && tmp.value)
1256                 return 1;
1257
1258         if (expr->type == EXPR_POSTOP)
1259                 return implied_condition_true(expr->unop);
1260
1261         if (expr->type == EXPR_PREOP && expr->op == SPECIAL_DECREMENT)
1262                 return implied_not_equal(expr->unop, 1);
1263         if (expr->type == EXPR_PREOP && expr->op == SPECIAL_INCREMENT)
1264                 return implied_not_equal(expr->unop, -1);
1265
1266         expr = strip_expr(expr);
1267         switch (expr->type) {
1268         case EXPR_COMPARE:
1269                 if (do_comparison(expr) == 1)
1270                         return 1;
1271                 break;
1272         case EXPR_PREOP:
1273                 if (expr->op == '!') {
1274                         if (implied_condition_false(expr->unop))
1275                                 return 1;
1276                         break;
1277                 }
1278                 break;
1279         default:
1280                 if (implied_not_equal(expr, 0) == 1)
1281                         return 1;
1282                 break;
1283         }
1284         return 0;
1285 }
1286
1287 int implied_condition_false(struct expression *expr)
1288 {
1289         struct expression *tmp;
1290         sval_t sval;
1291
1292         if (!expr)
1293                 return 0;
1294
1295         if (known_condition_false(expr))
1296                 return 1;
1297
1298         switch (expr->type) {
1299         case EXPR_COMPARE:
1300                 if (do_comparison(expr) == 2)
1301                         return 1;
1302         case EXPR_PREOP:
1303                 if (expr->op == '!') {
1304                         if (implied_condition_true(expr->unop))
1305                                 return 1;
1306                         break;
1307                 }
1308                 tmp = strip_expr(expr);
1309                 if (tmp != expr)
1310                         return implied_condition_false(tmp);
1311                 break;
1312         default:
1313                 if (get_implied_value(expr, &sval) && sval.value == 0)
1314                         return 1;
1315                 break;
1316         }
1317         return 0;
1318 }
1319
1320 int can_integer_overflow(struct symbol *type, struct expression *expr)
1321 {
1322         int op;
1323         sval_t lmax, rmax, res;
1324
1325         if (!type)
1326                 type = &int_ctype;
1327
1328         expr = strip_expr(expr);
1329
1330         if (expr->type == EXPR_ASSIGNMENT) {
1331                 switch(expr->op) {
1332                 case SPECIAL_MUL_ASSIGN:
1333                         op = '*';
1334                         break;
1335                 case SPECIAL_ADD_ASSIGN:
1336                         op = '+';
1337                         break;
1338                 case SPECIAL_SHL_ASSIGN:
1339                         op = SPECIAL_LEFTSHIFT;
1340                         break;
1341                 default:
1342                         return 0;
1343                 }
1344         } else if (expr->type == EXPR_BINOP) {
1345                 if (expr->op != '*' && expr->op != '+' && expr->op != SPECIAL_LEFTSHIFT)
1346                         return 0;
1347                 op = expr->op;
1348         } else {
1349                 return 0;
1350         }
1351
1352         get_absolute_max(expr->left, &lmax);
1353         get_absolute_max(expr->right, &rmax);
1354
1355         if (sval_binop_overflows(lmax, op, rmax))
1356                 return 1;
1357
1358         res = sval_binop(lmax, op, rmax);
1359         if (sval_cmp(res, sval_type_max(type)) > 0)
1360                 return 1;
1361         return 0;
1362 }