smatch_implied.c

   1 /*
   2  * sparse/smatch_implied.c
   3  *
   4  * Copyright (C) 2008 Dan Carpenter.
   5  *
   6  *  Licensed under the Open Software License version 1.1
   7  *
   8  */
   9
  10 /*
  11  * Imagine we have this code:
  12  * foo = 0;
  13  * if (bar)
  14  *         foo = 1;
  15  *                   //  <-- point #1
  16  * else
  17  *         frob();
  18  *                   //  <-- point #2
  19  * if (foo == 1)     //  <-- point #3
  20  *         bar->baz; //  <-- point #4
  21  *
  22  * Currently (Oct 2008) in smatch when we merge bar states
  23  * null and nonnull, at point #2, the state becomes undefined.
  24  * As a result we get an error at point #3.
  25  *
  26  * The idea behind "implied state pools" is to fix that.
  27  *
  28  * The implied pools get created in merge_slist().  Whatever
  29  * is unique to one slist being merged gets put into a pool.
  30  *
  31  * If we set a state that removes it from all pools.
  32  *
  33  * When we come to an if statement where "foo" has some pools
  34  * associated we take all the pools where "foo == 1" and keep
  35  * all the states that are consistent across those pools.
  36  *
  37  * The point of doing this is to turn an undefined state into
  38  * a defined state.  This hopefully gets rid of some false positives.
  39  * What it doesn't do is find new errors that were
  40  * missed before.
  41  *
  42  * There are quite a few implementation details I haven't figured
  43  * out.  How do you create implied state pools inside a
  44  * complex condition?  How do you determine what is implied
  45  * from a complex condition?  The initial patch is extremely rudimentary...
  46  */
  47
  48 #include "smatch.h"
  49 #include "smatch_slist.h"
  50
  51 #define EQUALS 0
  52 #define NOTEQUALS 1
  53
  54 int debug_implied_states = 0;
  55
  56 /*
  57  * What are the implications if (foo == num) ...
  58  */
  59
  60 static struct state_list_stack *get_eq_neq(struct sm_state *sm_state,
  61                                         int eq_neq, int num)
  62 {
  63         struct state_list *list;
  64         struct smatch_state *s;
  65         struct state_list_stack *ret = NULL;
  66
  67         FOR_EACH_PTR(sm_state->my_pools, list) {
  68                 s = get_state_slist(list, sm_state->name, sm_state->owner,
  69                                     sm_state->sym);
  70                 if (s == &undefined) {
  71                         free_stack(&ret);
  72                         DIMPLIED("%d '%s' is undefined\n", get_lineno(),
  73                                  sm_state->name);
  74                         return NULL;
  75                 }
  76                 if (s->data && ((eq_neq == EQUALS && *(int *)s->data == num) ||
  77                                 (eq_neq == NOTEQUALS && *(int *)s->data != num))) {
  78                         DIMPLIED("added pool where %s is %s\n", sm_state->name,
  79                                  show_state(s));
  80                         push_slist(&ret, list);
  81                 }
  82         } END_FOR_EACH_PTR(list);
  83         return ret;
  84 }
  85
  86 static struct state_list *filter_stack(struct state_list_stack *stack)
  87 {
  88         struct state_list *tmp;
  89         struct state_list *ret = NULL;
  90         int i = 0;
  91
  92         FOR_EACH_PTR(stack, tmp) {
  93                 if (!i++) {
  94                         ret = clone_states_in_pool(tmp, __get_cur_slist());
  95                         if (debug_implied_states) {
  96                                 printf("The first implied pool is:\n");
  97                                 __print_slist(ret);
  98                         }
  99                 } else {
 100                         filter(&ret, tmp, __get_cur_slist());
 101                         DIMPLIED("filtered\n");
 102                 }
 103         } END_FOR_EACH_PTR(tmp);
 104         return ret;
 105 }
 106
 107 void __implied_states_hook(struct expression *expr)
 108 {
 109         struct symbol *sym;
 110         char *name;
 111         struct sm_state *state;
 112         struct state_list_stack *true_pools;
 113         struct state_list_stack *false_pools;
 114         struct state_list *implied_true;
 115         struct state_list *implied_false;
 116
 117         name = get_variable_from_expr(expr, &sym);
 118         if (!name || !sym) {
 119                 free_string(name);
 120                 return;
 121         }
 122         state = get_sm_state(name, SMATCH_EXTRA, sym);
 123         free_string(name);
 124         if (!state)
 125                 return;
 126         if (!state->my_pools) {
 127                 DIMPLIED("%d '%s' has no pools.\n", get_lineno(), state->name);
 128                 return;
 129         }
 130
 131         if (debug_implied_states) {
 132                 printf("%s has the following possible states:\n", state->name);
 133                 __print_slist(state->possible);
 134         }
 135
 136         DIMPLIED("Gettin the implied states for (%s != 0)\n", state->name);
 137         true_pools = get_eq_neq(state, NOTEQUALS, 0);
 138         DIMPLIED("There are %s implied pools for (%s != 0).\n", (true_pools?"some":"no"), state->name);
 139         implied_true = filter_stack(true_pools);
 140         if (implied_true && (debug_states || debug_implied_states)) {
 141                 printf("Setting the following implied states for (%s != 0).\n",
 142                        state->name);
 143                 __print_slist(implied_true);
 144         }
 145         DIMPLIED("Gettin the implied states for (%s == 0)\n", state->name);
 146         false_pools = get_eq_neq(state, EQUALS, 0);
 147         DIMPLIED("There are %s implied pools for (%s == 0).\n", (true_pools?"some":"no"), state->name);
 148         implied_false = filter_stack(false_pools);
 149         if (implied_false && (debug_states || debug_implied_states)) {
 150                 printf("Setting the following implied states for (%s == 0).\n",
 151                        state->name);
 152                 __print_slist(implied_false);
 153         }
 154
 155         FOR_EACH_PTR(implied_true, state) {
 156                 __set_true_false_sm(state, NULL);
 157         } END_FOR_EACH_PTR(state);
 158         free_stack(&true_pools);
 159         free_slist(&implied_true);
 160
 161         FOR_EACH_PTR(implied_false, state) {
 162                 __set_true_false_sm(NULL, state);
 163         } END_FOR_EACH_PTR(state);
 164         free_stack(&false_pools);
 165         free_slist(&implied_false);
 166 }
 167
 168 void register_implications(int id)
 169 {
 170         add_hook(&__implied_states_hook, CONDITION_HOOK);
 171 }