nsz Git - cparser/blob - type_hash.c

   1 /*
   2  * This file is part of cparser.
   3  * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
   4  *
   5  * This program is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU General Public License
   7  * as published by the Free Software Foundation; either version 2
   8  * of the License, or (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  18  * 02111-1307, USA.
  19  */
  20 #include <config.h>
  21
  22 #include <stdbool.h>
  23
  24 #include "type_hash.h"
  25
  26 #include "adt/error.h"
  27 #include "type_t.h"
  28
  29 #include <assert.h>
  30
  31 #define HashSet         type_hash_t
  32 #define HashSetIterator type_hash_iterator_t
  33 #define ValueType       type_t*
  34 #include "adt/hashset.h"
  35 #undef ValueType
  36 #undef HashSetIterator
  37 #undef HashSet
  38
  39 typedef struct type_hash_iterator_t  type_hash_iterator_t;
  40 typedef struct type_hash_t           type_hash_t;
  41
  42 /* TODO: ^= is a bad way of combining hashes since most addresses are very
  43  * similar */
  44
  45 static unsigned hash_ptr(const void *ptr)
  46 {
  47         unsigned ptr_int = ((char*) ptr - (char*) NULL);
  48         return ptr_int >> 3;
  49 }
  50
  51 static unsigned hash_atomic_type(const atomic_type_t *type)
  52 {
  53         unsigned some_prime = 27644437;
  54         unsigned result     = type->akind * some_prime;
  55
  56         return result;
  57 }
  58
  59 static unsigned hash_complex_type(const complex_type_t *type)
  60 {
  61         unsigned some_prime = 27644437;
  62         unsigned result     = type->akind * some_prime;
  63
  64         return result;
  65 }
  66
  67 static unsigned hash_imaginary_type(const imaginary_type_t *type)
  68 {
  69         unsigned some_prime = 27644437;
  70         unsigned result     = type->akind * some_prime;
  71
  72         return result;
  73 }
  74
  75 static unsigned hash_pointer_type(const pointer_type_t *type)
  76 {
  77         return hash_ptr(type->points_to) ^ hash_ptr(type->base_variable);
  78 }
  79
  80 static unsigned hash_reference_type(const reference_type_t *type)
  81 {
  82         return hash_ptr(type->refers_to);
  83 }
  84
  85 static unsigned hash_array_type(const array_type_t *type)
  86 {
  87         return hash_ptr(type->element_type);
  88 }
  89
  90 static unsigned hash_compound_type(const compound_type_t *type)
  91 {
  92         return hash_ptr(type->compound);
  93 }
  94
  95 static unsigned hash_function_type(const function_type_t *type)
  96 {
  97         unsigned result = hash_ptr(type->return_type);
  98
  99         function_parameter_t *parameter = type->parameters;
 100         while (parameter != NULL) {
 101                 result   ^= hash_ptr(parameter->type);
 102                 parameter = parameter->next;
 103         }
 104         result += type->linkage;
 105         result += type->calling_convention;
 106
 107         return result;
 108 }
 109
 110 static unsigned hash_enum_type(const enum_type_t *type)
 111 {
 112         return hash_ptr(type->enume);
 113 }
 114
 115 static unsigned hash_typeof_type(const typeof_type_t *type)
 116 {
 117         unsigned result = hash_ptr(type->expression);
 118         result         ^= hash_ptr(type->typeof_type);
 119
 120         return result;
 121 }
 122
 123 static unsigned hash_bitfield_type(const bitfield_type_t *type)
 124 {
 125         unsigned result  = hash_ptr(type->base_type);
 126         result          ^= 27172145;
 127
 128         return result;
 129 }
 130
 131 static unsigned hash_type(const type_t *type)
 132 {
 133         unsigned hash = 0;
 134
 135         switch (type->kind) {
 136         case TYPE_INVALID:
 137                 panic("internalizing void or invalid types not possible");
 138         case TYPE_ERROR:
 139                 return 0;
 140         case TYPE_ATOMIC:
 141                 hash = hash_atomic_type(&type->atomic);
 142                 break;
 143         case TYPE_COMPLEX:
 144                 hash = hash_complex_type(&type->complex);
 145                 break;
 146         case TYPE_IMAGINARY:
 147                 hash = hash_imaginary_type(&type->imaginary);
 148                 break;
 149         case TYPE_ENUM:
 150                 hash = hash_enum_type(&type->enumt);
 151                 break;
 152         case TYPE_COMPOUND_STRUCT:
 153         case TYPE_COMPOUND_UNION:
 154                 hash = hash_compound_type(&type->compound);
 155                 break;
 156         case TYPE_FUNCTION:
 157                 hash = hash_function_type(&type->function);
 158                 break;
 159         case TYPE_POINTER:
 160                 hash = hash_pointer_type(&type->pointer);
 161                 break;
 162         case TYPE_REFERENCE:
 163                 hash = hash_reference_type(&type->reference);
 164                 break;
 165         case TYPE_ARRAY:
 166                 hash = hash_array_type(&type->array);
 167                 break;
 168         case TYPE_BUILTIN:
 169                 hash = hash_ptr(type->builtin.symbol);
 170                 break;
 171         case TYPE_TYPEDEF:
 172                 hash = hash_ptr(type->typedeft.typedefe);
 173                 break;
 174         case TYPE_TYPEOF:
 175                 hash = hash_typeof_type(&type->typeoft);
 176                 break;
 177         case TYPE_BITFIELD:
 178                 hash = hash_bitfield_type(&type->bitfield);
 179                 break;
 180         }
 181
 182         unsigned some_prime = 99991;
 183         hash ^= some_prime * type->base.qualifiers;
 184         hash ^= some_prime * type->base.alignment;
 185
 186         return hash;
 187 }
 188
 189 static bool atomic_types_equal(const atomic_type_t *type1,
 190                                                            const atomic_type_t *type2)
 191 {
 192         return type1->akind == type2->akind;
 193 }
 194
 195 static bool complex_types_equal(const complex_type_t *type1,
 196                                                             const complex_type_t *type2)
 197 {
 198         return type1->akind == type2->akind;
 199 }
 200
 201 static bool imaginary_types_equal(const imaginary_type_t *type1,
 202                                                               const imaginary_type_t *type2)
 203 {
 204         return type1->akind == type2->akind;
 205 }
 206
 207 static bool function_types_equal(const function_type_t *type1,
 208                                  const function_type_t *type2)
 209 {
 210         if (type1->return_type != type2->return_type)
 211                 return false;
 212         if (type1->variadic != type2->variadic)
 213                 return false;
 214         if (type1->unspecified_parameters != type2->unspecified_parameters)
 215                 return false;
 216         if (type1->kr_style_parameters != type2->kr_style_parameters)
 217                 return false;
 218         if (type1->linkage != type2->linkage)
 219                 return false;
 220         if (type1->calling_convention != type2->calling_convention)
 221                 return false;
 222
 223         function_parameter_t *param1 = type1->parameters;
 224         function_parameter_t *param2 = type2->parameters;
 225         while (param1 != NULL && param2 != NULL) {
 226                 if (param1->type != param2->type)
 227                         return false;
 228                 param1 = param1->next;
 229                 param2 = param2->next;
 230         }
 231         if (param1 != NULL || param2 != NULL)
 232                 return false;
 233
 234         return true;
 235 }
 236
 237 static bool pointer_types_equal(const pointer_type_t *type1,
 238                                 const pointer_type_t *type2)
 239 {
 240         return type1->points_to     == type2->points_to &&
 241                type1->base_variable == type2->base_variable;
 242 }
 243
 244 static bool reference_types_equal(const reference_type_t *type1,
 245                                   const reference_type_t *type2)
 246 {
 247         return type1->refers_to == type2->refers_to;
 248 }
 249
 250 static bool array_types_equal(const array_type_t *type1,
 251                               const array_type_t *type2)
 252 {
 253         if (type1->element_type != type2->element_type)
 254                 return false;
 255         if (type1->is_variable != type2->is_variable)
 256                 return false;
 257         if (type1->is_static != type2->is_static)
 258                 return false;
 259         if (type1->size_constant != type2->size_constant)
 260                 return false;
 261
 262         /* never identify vla types, because we need them for caching calculated
 263          * sizes later in ast2firm */
 264         if (type1->is_vla || type2->is_vla)
 265                 return false;
 266
 267         /* TODO: compare size expressions for equality... */
 268
 269         return false;
 270 }
 271
 272 static bool builtin_types_equal(const builtin_type_t *type1,
 273                                 const builtin_type_t *type2)
 274 {
 275         return type1->symbol == type2->symbol;
 276 }
 277
 278 static bool compound_types_equal(const compound_type_t *type1,
 279                                  const compound_type_t *type2)
 280 {
 281         return type1->compound == type2->compound;
 282 }
 283
 284 static bool enum_types_equal(const enum_type_t *type1,
 285                              const enum_type_t *type2)
 286 {
 287         return type1->enume == type2->enume;
 288 }
 289
 290 static bool typedef_types_equal(const typedef_type_t *type1,
 291                                 const typedef_type_t *type2)
 292 {
 293         return type1->typedefe == type2->typedefe;
 294 }
 295
 296 static bool typeof_types_equal(const typeof_type_t *type1,
 297                                const typeof_type_t *type2)
 298 {
 299         if (type1->expression != type2->expression)
 300                 return false;
 301         if (type1->typeof_type != type2->typeof_type)
 302                 return false;
 303
 304         return true;
 305 }
 306
 307 static bool bitfield_types_equal(const bitfield_type_t *type1,
 308                                  const bitfield_type_t *type2)
 309 {
 310         if (type1->base_type != type2->base_type)
 311                 return false;
 312         /* TODO: compare size expression */
 313         return false;
 314 }
 315
 316 static bool types_equal(const type_t *type1, const type_t *type2)
 317 {
 318         if (type1 == type2)
 319                 return true;
 320         if (type1->kind != type2->kind)
 321                 return false;
 322         if (type1->base.qualifiers != type2->base.qualifiers)
 323                 return false;
 324         if (type1->base.modifiers != type2->base.modifiers)
 325                 return false;
 326         if (type1->base.alignment != type2->base.alignment)
 327                 return false;
 328
 329         switch (type1->kind) {
 330         case TYPE_ERROR:
 331                 /* Hmm, the error type is never equal */
 332                 return false;
 333         case TYPE_INVALID:
 334                 return false;
 335         case TYPE_ATOMIC:
 336                 return atomic_types_equal(&type1->atomic, &type2->atomic);
 337         case TYPE_COMPLEX:
 338                 return complex_types_equal(&type1->complex, &type2->complex);
 339         case TYPE_IMAGINARY:
 340                 return imaginary_types_equal(&type1->imaginary, &type2->imaginary);
 341         case TYPE_ENUM:
 342                 return enum_types_equal(&type1->enumt, &type2->enumt);
 343         case TYPE_COMPOUND_STRUCT:
 344         case TYPE_COMPOUND_UNION:
 345                 return compound_types_equal(&type1->compound, &type2->compound);
 346         case TYPE_FUNCTION:
 347                 return function_types_equal(&type1->function, &type2->function);
 348         case TYPE_POINTER:
 349                 return pointer_types_equal(&type1->pointer, &type2->pointer);
 350         case TYPE_REFERENCE:
 351                 return reference_types_equal(&type1->reference, &type2->reference);
 352         case TYPE_ARRAY:
 353                 return array_types_equal(&type1->array, &type2->array);
 354         case TYPE_BUILTIN:
 355                 return builtin_types_equal(&type1->builtin, &type2->builtin);
 356         case TYPE_TYPEOF:
 357                 return typeof_types_equal(&type1->typeoft, &type2->typeoft);
 358         case TYPE_TYPEDEF:
 359                 return typedef_types_equal(&type1->typedeft, &type2->typedeft);
 360         case TYPE_BITFIELD:
 361                 return bitfield_types_equal(&type1->bitfield, &type2->bitfield);
 362         }
 363
 364         abort();
 365 }
 366
 367 #define HashSet                    type_hash_t
 368 #define HashSetIterator            type_hash_iterator_t
 369 #define ValueType                  type_t*
 370 #define NullValue                  NULL
 371 #define DeletedValue               ((type_t*)-1)
 372 #define Hash(this, key)            hash_type(key)
 373 #define KeysEqual(this,key1,key2)  types_equal(key1, key2)
 374 #define SetRangeEmpty(ptr,size)    memset(ptr, 0, (size) * sizeof(*(ptr)))
 375
 376 #define hashset_init             _typehash_init
 377 #define hashset_init_size        _typehash_init_size
 378 #define hashset_destroy          _typehash_destroy
 379 #define hashset_insert           _typehash_insert
 380 #define hashset_remove           typehash_remove
 381 #define hashset_find             typehash_find
 382 #define hashset_size             typehash_size
 383 #define hashset_iterator_init    typehash_iterator_init
 384 #define hashset_iterator_next    typehash_iterator_next
 385 #define hashset_remove_iterator  typehash_remove_iterator
 386 #define SCALAR_RETURN
 387
 388 #include "adt/hashset.c"
 389
 390 static type_hash_t typehash;
 391
 392 void init_typehash(void)
 393 {
 394         _typehash_init(&typehash);
 395 }
 396
 397 void exit_typehash(void)
 398 {
 399         _typehash_destroy(&typehash);
 400 }
 401
 402 type_t *typehash_insert(type_t *type)
 403 {
 404         return _typehash_insert(&typehash, type);
 405 }