smatch_address.c

   1 /*
   2  * Copyright (C) 2015 Oracle.
   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 "smatch.h"
  19 #include "smatch_slist.h"
  20 #include "smatch_extra.h"
  21
  22 static bool is_non_null_array(struct expression *expr)
  23 {
  24         struct symbol *type;
  25         struct symbol *sym;
  26         struct symbol *tmp;
  27         int i;
  28
  29         type = get_type(expr);
  30         if (!type || type->type != SYM_ARRAY)
  31                 return 0;
  32         if (expr->type == EXPR_SYMBOL)
  33                 return 1;
  34         if (implied_not_equal(expr, 0))
  35                 return 1;
  36
  37         /* verify that it's not the first member of the struct */
  38         if (expr->type != EXPR_DEREF || !expr->member)
  39                 return 0;
  40         sym = expr_to_sym(expr);
  41         if (!sym)
  42                 return 0;
  43         type = get_real_base_type(sym);
  44         if (!type || type->type != SYM_PTR)
  45                 return 0;
  46         type = get_real_base_type(type);
  47         if (type->type != SYM_STRUCT)
  48                 return 0;
  49
  50         i = 0;
  51         FOR_EACH_PTR(type->symbol_list, tmp) {
  52                 i++;
  53                 if (!tmp->ident)
  54                         continue;
  55                 if (strcmp(expr->member->name, tmp->ident->name) == 0) {
  56                         if (i == 1)
  57                                 return 0;
  58                         return 1;
  59                 }
  60         } END_FOR_EACH_PTR(tmp);
  61
  62         return 0;
  63 }
  64
  65 int get_member_offset(struct symbol *type, const char *member_name)
  66 {
  67         struct symbol *tmp;
  68         int offset;
  69
  70         if (!type || type->type != SYM_STRUCT)
  71                 return -1;
  72
  73         offset = 0;
  74         FOR_EACH_PTR(type->symbol_list, tmp) {
  75                 if (!type->ctype.attribute->is_packed)
  76                         offset = ALIGN(offset, tmp->ctype.alignment);
  77                 if (tmp->ident &&
  78                     strcmp(member_name, tmp->ident->name) == 0) {
  79                         return offset;
  80                 }
  81                 offset += type_bytes(tmp);
  82         } END_FOR_EACH_PTR(tmp);
  83         return -1;
  84 }
  85
  86 int get_member_offset_from_deref(struct expression *expr)
  87 {
  88         struct symbol *type;
  89         struct ident *member;
  90         int offset;
  91
  92         if (expr->type != EXPR_DEREF)  /* hopefully, this doesn't happen */
  93                 return -1;
  94
  95         if (expr->member_offset >= 0)
  96                 return expr->member_offset;
  97
  98         member = expr->member;
  99         if (!member)
 100                 return -1;
 101
 102         type = get_type(expr->deref);
 103         if (!type || type->type != SYM_STRUCT)
 104                 return -1;
 105
 106         offset = get_member_offset(type, member->name);
 107         if (offset >= 0)
 108                 expr->member_offset = offset;
 109         return offset;
 110 }
 111
 112 static struct range_list *filter_unknown_negatives(struct range_list *rl)
 113 {
 114         struct data_range *first;
 115         struct range_list *filter = NULL;
 116
 117         first = first_ptr_list((struct ptr_list *)rl);
 118
 119         if (sval_is_min(first->min) &&
 120             sval_is_negative(first->max) &&
 121             first->max.value == -1) {
 122                 add_ptr_list(&filter, first);
 123                 return rl_filter(rl, filter);
 124         }
 125
 126         return rl;
 127 }
 128
 129 static void add_offset_to_pointer(struct range_list **rl, int offset)
 130 {
 131         sval_t min, remove, max;
 132         struct range_list *orig = *rl;
 133
 134         /*
 135          * Ha ha.  Treating zero as a special case means I'm correct at least a
 136          * tiny fraction of the time.  Which is better than nothing.
 137          *
 138          */
 139         if (offset == 0)
 140                 return;
 141
 142         /*
 143          * This function doesn't necessarily work how you might expect...
 144          *
 145          * Say you have s64min-(-1),1-s64max and you add 8 then I guess what
 146          * we want to say is maybe something like 9-s64max.  This shows that the
 147          * min it could be is 9 which is potentially useful information.  But
 148          * if we start with (-12),5000000-57777777 and we add 8 then we'd want
 149          * the result to be (-4),5000008-57777777 but (-4),5000000-57777777 is
 150          * also probably acceptable.  If you start with s64min-s64max then the
 151          * result should be 8-s64max.
 152          *
 153          */
 154
 155         if (!orig || is_whole_rl(orig)) {
 156                 min = sval_type_min(&ptr_ctype);
 157                 max = sval_type_max(&ptr_ctype);
 158
 159                 min.value = offset;
 160                 *rl = alloc_rl(min, max);
 161                 return;
 162         }
 163
 164         orig = filter_unknown_negatives(orig);
 165
 166         min = rl_min(orig);
 167
 168         /*
 169          * FIXME:  This is not really accurate but we're a bit screwed anyway
 170          * when we start doing pointer math with error pointers so it's probably
 171          * not important.
 172          *
 173          */
 174         if (sval_is_negative(min))
 175                 return;
 176
 177         remove = min;
 178         remove.value += (offset - 1);
 179         *rl = remove_range(orig, min, remove);
 180 }
 181
 182 static struct range_list *where_allocated_rl(struct symbol *sym)
 183 {
 184         if (!sym)
 185                 return NULL;
 186
 187         if (sym->ctype.modifiers & (MOD_TOPLEVEL | MOD_STATIC)) {
 188                 if (sym->initializer)
 189                         return alloc_rl(data_seg_min, data_seg_max);
 190                 else
 191                         return alloc_rl(bss_seg_min, bss_seg_max);
 192         }
 193         return alloc_rl(stack_seg_min, stack_seg_max);
 194 }
 195
 196 int get_address_rl(struct expression *expr, struct range_list **rl)
 197 {
 198         expr = strip_expr(expr);
 199         if (!expr)
 200                 return 0;
 201
 202         if (expr->type == EXPR_STRING) {
 203                 *rl = alloc_rl(text_seg_min, text_seg_max);
 204                 return 1;
 205         }
 206
 207         if (expr->type == EXPR_PREOP && expr->op == '&') {
 208                 struct expression *unop;
 209
 210                 unop = strip_expr(expr->unop);
 211                 if (unop->type == EXPR_SYMBOL) {
 212                         *rl = where_allocated_rl(unop->symbol);
 213                         return 1;
 214                 }
 215
 216                 if (unop->type == EXPR_DEREF) {
 217                         int offset = get_member_offset_from_deref(unop);
 218
 219                         unop = strip_expr(unop->unop);
 220                         if (unop->type == EXPR_SYMBOL) {
 221                                 *rl = where_allocated_rl(unop->symbol);
 222                         } else if (unop->type == EXPR_PREOP && unop->op == '*') {
 223                                 unop = strip_expr(unop->unop);
 224                                 get_absolute_rl(unop, rl);
 225                         } else {
 226                                 return 0;
 227                         }
 228
 229                         add_offset_to_pointer(rl, offset);
 230                         return 1;
 231                 }
 232
 233                 return 0;
 234         }
 235
 236         if (is_non_null_array(expr)) {
 237                 *rl = alloc_rl(array_min_sval, array_max_sval);
 238                 return 1;
 239         }
 240
 241         return 0;
 242 }