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);
  78 }
  79
  80 static unsigned hash_array_type(const array_type_t *type)
  81 {
  82         return hash_ptr(type->element_type);
  83 }
  84
  85 static unsigned hash_compound_type(const compound_type_t *type)
  86 {
  87         return hash_ptr(type->compound);
  88 }
  89
  90 static unsigned hash_type(const type_t *type);
  91
  92 static unsigned hash_function_type(const function_type_t *type)
  93 {
  94         unsigned result = hash_ptr(type->return_type);
  95
  96         function_parameter_t *parameter = type->parameters;
  97         while (parameter != NULL) {
  98                 result   ^= hash_ptr(parameter->type);
  99                 parameter = parameter->next;
 100         }
 101         result ^= hash_ptr(type->linkage);
 102
 103         return result;
 104 }
 105
 106 static unsigned hash_enum_type(const enum_type_t *type)
 107 {
 108         return hash_ptr(type->enume);
 109 }
 110
 111 static unsigned hash_typeof_type(const typeof_type_t *type)
 112 {
 113         unsigned result = hash_ptr(type->expression);
 114         result         ^= hash_ptr(type->typeof_type);
 115
 116         return result;
 117 }
 118
 119 static unsigned hash_bitfield_type(const bitfield_type_t *type)
 120 {
 121         unsigned result  = hash_ptr(type->base_type);
 122         result          ^= 27172145;
 123
 124         return result;
 125 }
 126
 127 static unsigned hash_type(const type_t *type)
 128 {
 129         unsigned hash = 0;
 130
 131         switch (type->kind) {
 132         case TYPE_INVALID:
 133                 panic("internalizing void or invalid types not possible");
 134                 return 0;
 135         case TYPE_ERROR:
 136                 return 0;
 137         case TYPE_ATOMIC:
 138                 hash = hash_atomic_type(&type->atomic);
 139                 break;
 140         case TYPE_COMPLEX:
 141                 hash = hash_complex_type(&type->complex);
 142                 break;
 143         case TYPE_IMAGINARY:
 144                 hash = hash_imaginary_type(&type->imaginary);
 145                 break;
 146         case TYPE_ENUM:
 147                 hash = hash_enum_type(&type->enumt);
 148                 break;
 149         case TYPE_COMPOUND_STRUCT:
 150         case TYPE_COMPOUND_UNION:
 151                 hash = hash_compound_type(&type->compound);
 152                 break;
 153         case TYPE_FUNCTION:
 154                 hash = hash_function_type(&type->function);
 155                 break;
 156         case TYPE_POINTER:
 157                 hash = hash_pointer_type(&type->pointer);
 158                 break;
 159         case TYPE_ARRAY:
 160                 hash = hash_array_type(&type->array);
 161                 break;
 162         case TYPE_BUILTIN:
 163                 hash = hash_ptr(type->builtin.symbol);
 164                 break;
 165         case TYPE_TYPEDEF:
 166                 hash = hash_ptr(type->typedeft.typedefe);
 167                 break;
 168         case TYPE_TYPEOF:
 169                 hash = hash_typeof_type(&type->typeoft);
 170                 break;
 171         case TYPE_BITFIELD:
 172                 hash = hash_bitfield_type(&type->bitfield);
 173                 break;
 174         }
 175
 176         unsigned some_prime = 99991;
 177         hash ^= some_prime * type->base.qualifiers;
 178
 179         return hash;
 180 }
 181
 182 static bool atomic_types_equal(const atomic_type_t *type1,
 183                                                            const atomic_type_t *type2)
 184 {
 185         return type1->akind == type2->akind;
 186 }
 187
 188 static bool complex_types_equal(const complex_type_t *type1,
 189                                                             const complex_type_t *type2)
 190 {
 191         return type1->akind == type2->akind;
 192 }
 193
 194 static bool imaginary_types_equal(const imaginary_type_t *type1,
 195                                                               const imaginary_type_t *type2)
 196 {
 197         return type1->akind == type2->akind;
 198 }
 199
 200 static bool function_types_equal(const function_type_t *type1,
 201                                  const function_type_t *type2)
 202 {
 203         if (type1->return_type != type2->return_type)
 204                 return false;
 205         if (type1->variadic != type2->variadic)
 206                 return false;
 207         if (type1->unspecified_parameters != type2->unspecified_parameters)
 208                 return false;
 209         if (type1->kr_style_parameters != type2->kr_style_parameters)
 210                 return false;
 211         if (type1->linkage != type2->linkage)
 212                 return false;
 213
 214         function_parameter_t *param1 = type1->parameters;
 215         function_parameter_t *param2 = type2->parameters;
 216         while (param1 != NULL && param2 != NULL) {
 217                 if (param1->type != param2->type)
 218                         return false;
 219                 param1 = param1->next;
 220                 param2 = param2->next;
 221         }
 222         if (param1 != NULL || param2 != NULL)
 223                 return false;
 224
 225         return true;
 226 }
 227
 228 static bool pointer_types_equal(const pointer_type_t *type1,
 229                                 const pointer_type_t *type2)
 230 {
 231         return type1->points_to == type2->points_to;
 232 }
 233
 234 static bool array_types_equal(const array_type_t *type1,
 235                               const array_type_t *type2)
 236 {
 237         if (type1->element_type != type2->element_type)
 238                 return false;
 239         if (type1->is_variable != type2->is_variable)
 240                 return false;
 241         if (type1->is_static != type2->is_static)
 242                 return false;
 243         if (type1->size_constant != type2->size_constant)
 244                 return false;
 245
 246         /* never identify vla types, because we need them for caching calculated
 247          * sizes later in ast2firm */
 248         if (type1->is_vla || type2->is_vla)
 249                 return false;
 250
 251         /* TODO: compare size expressions for equality... */
 252
 253         return false;
 254 }
 255
 256 static bool builtin_types_equal(const builtin_type_t *type1,
 257                                 const builtin_type_t *type2)
 258 {
 259         return type1->symbol == type2->symbol;
 260 }
 261
 262 static bool compound_types_equal(const compound_type_t *type1,
 263                                  const compound_type_t *type2)
 264 {
 265         return type1->compound == type2->compound;
 266 }
 267
 268 static bool enum_types_equal(const enum_type_t *type1,
 269                              const enum_type_t *type2)
 270 {
 271         return type1->enume == type2->enume;
 272 }
 273
 274 static bool typedef_types_equal(const typedef_type_t *type1,
 275                                 const typedef_type_t *type2)
 276 {
 277         return type1->typedefe == type2->typedefe;
 278 }
 279
 280 static bool typeof_types_equal(const typeof_type_t *type1,
 281                                const typeof_type_t *type2)
 282 {
 283         if (type1->expression != type2->expression)
 284                 return false;
 285         if (type1->typeof_type != type2->typeof_type)
 286                 return false;
 287
 288         return true;
 289 }
 290
 291 static bool bitfield_types_equal(const bitfield_type_t *type1,
 292                                  const bitfield_type_t *type2)
 293 {
 294         if (type1->base_type != type2->base_type)
 295                 return false;
 296         /* TODO: compare size expression */
 297         return false;
 298 }
 299
 300 static bool types_equal(const type_t *type1, const type_t *type2)
 301 {
 302         if (type1 == type2)
 303                 return true;
 304         if (type1->kind != type2->kind)
 305                 return false;
 306         if (type1->base.qualifiers != type2->base.qualifiers)
 307                 return false;
 308         if (type1->base.modifiers != type2->base.modifiers)
 309                 return false;
 310
 311         switch (type1->kind) {
 312         case TYPE_ERROR:
 313                 /* Hmm, the error type is never equal */
 314                 return false;
 315         case TYPE_INVALID:
 316                 return false;
 317         case TYPE_ATOMIC:
 318                 return atomic_types_equal(&type1->atomic, &type2->atomic);
 319         case TYPE_COMPLEX:
 320                 return complex_types_equal(&type1->complex, &type2->complex);
 321         case TYPE_IMAGINARY:
 322                 return imaginary_types_equal(&type1->imaginary, &type2->imaginary);
 323         case TYPE_ENUM:
 324                 return enum_types_equal(&type1->enumt, &type2->enumt);
 325         case TYPE_COMPOUND_STRUCT:
 326         case TYPE_COMPOUND_UNION:
 327                 return compound_types_equal(&type1->compound, &type2->compound);
 328         case TYPE_FUNCTION:
 329                 return function_types_equal(&type1->function, &type2->function);
 330         case TYPE_POINTER:
 331                 return pointer_types_equal(&type1->pointer, &type2->pointer);
 332         case TYPE_ARRAY:
 333                 return array_types_equal(&type1->array, &type2->array);
 334         case TYPE_BUILTIN:
 335                 return builtin_types_equal(&type1->builtin, &type2->builtin);
 336         case TYPE_TYPEOF:
 337                 return typeof_types_equal(&type1->typeoft, &type2->typeoft);
 338         case TYPE_TYPEDEF:
 339                 return typedef_types_equal(&type1->typedeft, &type2->typedeft);
 340         case TYPE_BITFIELD:
 341                 return bitfield_types_equal(&type1->bitfield, &type2->bitfield);
 342         }
 343
 344         abort();
 345 }
 346
 347 #define HashSet                    type_hash_t
 348 #define HashSetIterator            type_hash_iterator_t
 349 #define ValueType                  type_t*
 350 #define NullValue                  NULL
 351 #define DeletedValue               ((type_t*)-1)
 352 #define Hash(this, key)            hash_type(key)
 353 #define KeysEqual(this,key1,key2)  types_equal(key1, key2)
 354 #define SetRangeEmpty(ptr,size)    memset(ptr, 0, (size) * sizeof(*(ptr)))
 355
 356 #define hashset_init             _typehash_init
 357 #define hashset_init_size        _typehash_init_size
 358 #define hashset_destroy          _typehash_destroy
 359 #define hashset_insert           _typehash_insert
 360 #define hashset_remove           typehash_remove
 361 #define hashset_find             typehash_find
 362 #define hashset_size             typehash_size
 363 #define hashset_iterator_init    typehash_iterator_init
 364 #define hashset_iterator_next    typehash_iterator_next
 365 #define hashset_remove_iterator  typehash_remove_iterator
 366 #define SCALAR_RETURN
 367
 368 #include "adt/hashset.c"
 369
 370 static type_hash_t typehash;
 371
 372 void init_typehash(void)
 373 {
 374         _typehash_init(&typehash);
 375 }
 376
 377 void exit_typehash(void)
 378 {
 379         _typehash_destroy(&typehash);
 380 }
 381
 382 type_t *typehash_insert(type_t *type)
 383 {
 384         return _typehash_insert(&typehash, type);
 385 }