smatch_estate.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 /*
  19  * smatch_dinfo.c has helper functions for handling data_info structs
  20  *
  21  */
  22
  23 #include <stdlib.h>
  24 #ifndef __USE_ISOC99
  25 #define __USE_ISOC99
  26 #endif
  27 #include <limits.h>
  28 #include "parse.h"
  29 #include "smatch.h"
  30 #include "smatch_slist.h"
  31 #include "smatch_extra.h"
  32
  33 struct smatch_state *merge_estates(struct smatch_state *s1, struct smatch_state *s2)
  34 {
  35         struct smatch_state *tmp;
  36         struct range_list *value_ranges;
  37         struct related_list *rlist;
  38
  39         if (estates_equiv(s1, s2))
  40                 return s1;
  41
  42         value_ranges = rl_union(estate_rl(s1), estate_rl(s2));
  43         tmp = alloc_estate_rl(value_ranges);
  44         rlist = get_shared_relations(estate_related(s1), estate_related(s2));
  45         set_related(tmp, rlist);
  46         if (estate_has_hard_max(s1) && estate_has_hard_max(s2))
  47                 estate_set_hard_max(tmp);
  48
  49         estate_set_fuzzy_max(tmp, sval_max(estate_get_fuzzy_max(s1), estate_get_fuzzy_max(s2)));
  50
  51         return tmp;
  52 }
  53
  54 struct data_info *get_dinfo(struct smatch_state *state)
  55 {
  56         if (!state)
  57                 return NULL;
  58         return (struct data_info *)state->data;
  59 }
  60
  61 struct range_list *estate_rl(struct smatch_state *state)
  62 {
  63         if (!state)
  64                 return NULL;
  65         return get_dinfo(state)->value_ranges;
  66 }
  67
  68 struct related_list *estate_related(struct smatch_state *state)
  69 {
  70         if (!state)
  71                 return NULL;
  72         return get_dinfo(state)->related;
  73 }
  74
  75 sval_t estate_get_fuzzy_max(struct smatch_state *state)
  76 {
  77         sval_t empty = {};
  78
  79         if (!state || !get_dinfo(state))
  80                 return empty;
  81         return get_dinfo(state)->fuzzy_max;
  82 }
  83
  84 int estate_has_fuzzy_max(struct smatch_state *state)
  85 {
  86         if (estate_get_fuzzy_max(state).type)
  87                 return 1;
  88         return 0;
  89 }
  90
  91 void estate_set_fuzzy_max(struct smatch_state *state, sval_t fuzzy_max)
  92 {
  93         if (!rl_has_sval(estate_rl(state), fuzzy_max))
  94                 return;
  95         get_dinfo(state)->fuzzy_max = fuzzy_max;
  96 }
  97
  98 void estate_copy_fuzzy_max(struct smatch_state *new, struct smatch_state *old)
  99 {
 100         if (!estate_has_fuzzy_max(old))
 101                 return;
 102         estate_set_fuzzy_max(new, estate_get_fuzzy_max(old));
 103 }
 104
 105 void estate_clear_fuzzy_max(struct smatch_state *state)
 106 {
 107         sval_t empty = {};
 108
 109         get_dinfo(state)->fuzzy_max = empty;
 110 }
 111
 112 int estate_has_hard_max(struct smatch_state *state)
 113 {
 114         if (!state)
 115                 return 0;
 116         return get_dinfo(state)->hard_max;
 117 }
 118
 119 void estate_set_hard_max(struct smatch_state *state)
 120 {
 121          get_dinfo(state)->hard_max = 1;
 122 }
 123
 124 void estate_clear_hard_max(struct smatch_state *state)
 125 {
 126          get_dinfo(state)->hard_max = 0;
 127 }
 128
 129 int estate_get_hard_max(struct smatch_state *state, sval_t *sval)
 130 {
 131         if (!state || !get_dinfo(state)->hard_max || !estate_rl(state))
 132                 return 0;
 133         *sval = rl_max(estate_rl(state));
 134         return 1;
 135 }
 136
 137 sval_t estate_min(struct smatch_state *state)
 138 {
 139         return rl_min(estate_rl(state));
 140 }
 141
 142 sval_t estate_max(struct smatch_state *state)
 143 {
 144         return rl_max(estate_rl(state));
 145 }
 146
 147 struct symbol *estate_type(struct smatch_state *state)
 148 {
 149         return rl_max(estate_rl(state)).type;
 150 }
 151
 152 static int rlists_equiv(struct related_list *one, struct related_list *two)
 153 {
 154         struct relation *one_rel;
 155         struct relation *two_rel;
 156
 157         PREPARE_PTR_LIST(one, one_rel);
 158         PREPARE_PTR_LIST(two, two_rel);
 159         for (;;) {
 160                 if (!one_rel && !two_rel)
 161                         return 1;
 162                 if (!one_rel || !two_rel)
 163                         return 0;
 164                 if (one_rel->sym != two_rel->sym)
 165                         return 0;
 166                 if (strcmp(one_rel->name, two_rel->name))
 167                         return 0;
 168                 NEXT_PTR_LIST(one_rel);
 169                 NEXT_PTR_LIST(two_rel);
 170         }
 171         FINISH_PTR_LIST(two_rel);
 172         FINISH_PTR_LIST(one_rel);
 173
 174         return 1;
 175 }
 176
 177 int estates_equiv(struct smatch_state *one, struct smatch_state *two)
 178 {
 179         if (!one || !two)
 180                 return 0;
 181         if (one == two)
 182                 return 1;
 183         if (!rlists_equiv(estate_related(one), estate_related(two)))
 184                 return 0;
 185         if (strcmp(one->name, two->name) == 0)
 186                 return 1;
 187         return 0;
 188 }
 189
 190 int estate_is_whole(struct smatch_state *state)
 191 {
 192         return is_whole_rl(estate_rl(state));
 193 }
 194
 195 int estate_is_unknown(struct smatch_state *state)
 196 {
 197         if (!estate_is_whole(state))
 198                 return 0;
 199         if (estate_related(state))
 200                 return 0;
 201         if (estate_has_fuzzy_max(state))
 202                 return 0;
 203         return 1;
 204 }
 205
 206 int estate_get_single_value(struct smatch_state *state, sval_t *sval)
 207 {
 208         sval_t min, max;
 209
 210         min = rl_min(estate_rl(state));
 211         max = rl_max(estate_rl(state));
 212         if (sval_cmp(min, max) != 0)
 213                 return 0;
 214         *sval = min;
 215         return 1;
 216 }
 217
 218 static struct data_info *alloc_dinfo(void)
 219 {
 220         struct data_info *ret;
 221
 222         ret = __alloc_data_info(0);
 223         memset(ret, 0, sizeof(*ret));
 224         return ret;
 225 }
 226
 227 static struct data_info *alloc_dinfo_range(sval_t min, sval_t max)
 228 {
 229         struct data_info *ret;
 230
 231         ret = alloc_dinfo();
 232         add_range(&ret->value_ranges, min, max);
 233         return ret;
 234 }
 235
 236 static struct data_info *alloc_dinfo_range_list(struct range_list *rl)
 237 {
 238         struct data_info *ret;
 239
 240         ret = alloc_dinfo();
 241         ret->value_ranges = rl;
 242         return ret;
 243 }
 244
 245 static struct data_info *clone_dinfo(struct data_info *dinfo)
 246 {
 247         struct data_info *ret;
 248
 249         ret = alloc_dinfo();
 250         ret->related = clone_related_list(dinfo->related);
 251         ret->value_ranges = clone_rl(dinfo->value_ranges);
 252         ret->hard_max = dinfo->hard_max;
 253         ret->fuzzy_max = dinfo->fuzzy_max;
 254         return ret;
 255 }
 256
 257 struct smatch_state *clone_estate(struct smatch_state *state)
 258 {
 259         struct smatch_state *ret;
 260
 261         ret = __alloc_smatch_state(0);
 262         ret->name = state->name;
 263         ret->data = clone_dinfo(get_dinfo(state));
 264         return ret;
 265 }
 266
 267 struct smatch_state *alloc_estate_empty(void)
 268 {
 269         struct smatch_state *state;
 270         struct data_info *dinfo;
 271
 272         dinfo = alloc_dinfo();
 273         state = __alloc_smatch_state(0);
 274         state->data = dinfo;
 275         state->name = "";
 276         return state;
 277 }
 278
 279 struct smatch_state *alloc_estate_whole(struct symbol *type)
 280 {
 281         return alloc_estate_rl(alloc_whole_rl(type));
 282 }
 283
 284 struct smatch_state *extra_empty(void)
 285 {
 286         struct smatch_state *ret;
 287
 288         ret = __alloc_smatch_state(0);
 289         ret->name = "empty";
 290         ret->data = alloc_dinfo();
 291         return ret;
 292 }
 293
 294 struct smatch_state *alloc_estate_sval(sval_t sval)
 295 {
 296         struct smatch_state *state;
 297
 298         state = __alloc_smatch_state(0);
 299         state->data = alloc_dinfo_range(sval, sval);
 300         state->name = show_rl(get_dinfo(state)->value_ranges);
 301         estate_set_hard_max(state);
 302         estate_set_fuzzy_max(state, sval);
 303         return state;
 304 }
 305
 306 struct smatch_state *alloc_estate_range(sval_t min, sval_t max)
 307 {
 308         struct smatch_state *state;
 309
 310         state = __alloc_smatch_state(0);
 311         state->data = alloc_dinfo_range(min, max);
 312         state->name = show_rl(get_dinfo(state)->value_ranges);
 313         return state;
 314 }
 315
 316 struct smatch_state *alloc_estate_rl(struct range_list *rl)
 317 {
 318         struct smatch_state *state;
 319
 320         if (!rl)
 321                 return extra_empty();
 322
 323         state = __alloc_smatch_state(0);
 324         state->data = alloc_dinfo_range_list(rl);
 325         state->name = show_rl(rl);
 326         return state;
 327 }
 328
 329 struct smatch_state *get_implied_estate(struct expression *expr)
 330 {
 331         struct smatch_state *state;
 332         struct range_list *rl;
 333
 334         state = get_state_expr(SMATCH_EXTRA, expr);
 335         if (state)
 336                 return state;
 337         if (!get_implied_rl(expr, &rl))
 338                 rl = alloc_whole_rl(get_type(expr));
 339         return alloc_estate_rl(rl);
 340 }
 341
 342 struct smatch_state *estate_filter_range(struct smatch_state *orig,
 343                                  sval_t filter_min, sval_t filter_max)
 344 {
 345         struct range_list *rl;
 346         struct smatch_state *state;
 347
 348         if (!orig)
 349                 orig = alloc_estate_whole(filter_min.type);
 350
 351         rl = remove_range(estate_rl(orig), filter_min, filter_max);
 352         state = alloc_estate_rl(rl);
 353         if (estate_has_hard_max(orig))
 354                 estate_set_hard_max(state);
 355         if (estate_has_fuzzy_max(orig))
 356                 estate_set_fuzzy_max(state, estate_get_fuzzy_max(orig));
 357         return state;
 358 }
 359
 360 struct smatch_state *estate_filter_sval(struct smatch_state *orig, sval_t sval)
 361 {
 362         return estate_filter_range(orig, sval, sval);
 363 }
 364
 365 /*
 366  * One of the complications is that smatch tries to free a bunch of data at the
 367  * end of every function.
 368  */
 369 struct data_info *clone_dinfo_perm(struct data_info *dinfo)
 370 {
 371         struct data_info *ret;
 372
 373         ret = malloc(sizeof(*ret));
 374         ret->related = NULL;
 375         ret->value_ranges = clone_rl_permanent(dinfo->value_ranges);
 376         ret->hard_max = 0;
 377         ret->fuzzy_max = dinfo->fuzzy_max;
 378         return ret;
 379 }
 380
 381 struct smatch_state *clone_estate_perm(struct smatch_state *state)
 382 {
 383         struct smatch_state *ret;
 384
 385         ret = malloc(sizeof(*ret));
 386         ret->name = alloc_string(state->name);
 387         ret->data = clone_dinfo_perm(get_dinfo(state));
 388         return ret;
 389 }
 390
 391