isl_hash.c

   1 /*
   2  * Copyright 2008-2009 Katholieke Universiteit Leuven
   3  *
   4  * Use of this software is governed by the MIT license
   5  *
   6  * Written by Sven Verdoolaege, K.U.Leuven, Departement
   7  * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
   8  */
   9
  10 #include <stdlib.h>
  11 #include <isl/hash.h>
  12 #include <isl/ctx.h>
  13 #include "isl_config.h"
  14
  15 uint32_t isl_hash_string(uint32_t hash, const char *s)
  16 {
  17         for (; *s; s++)
  18                 isl_hash_byte(hash, *s);
  19         return hash;
  20 }
  21
  22 uint32_t isl_hash_mem(uint32_t hash, const void *p, size_t len)
  23 {
  24         int i;
  25         const char *s = p;
  26         for (i = 0; i < len; ++i)
  27                 isl_hash_byte(hash, s[i]);
  28         return hash;
  29 }
  30
  31 static unsigned int round_up(unsigned int v)
  32 {
  33         int old_v = v;
  34
  35         while (v) {
  36                 old_v = v;
  37                 v ^= v & -v;
  38         }
  39         return old_v << 1;
  40 }
  41
  42 int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table,
  43                         int min_size)
  44 {
  45         size_t size;
  46
  47         if (!table)
  48                 return -1;
  49
  50         if (min_size < 2)
  51                 min_size = 2;
  52         table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1;
  53         table->n = 0;
  54
  55         size = 1 << table->bits;
  56         table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
  57                                           size);
  58         if (!table->entries)
  59                 return -1;
  60
  61         return 0;
  62 }
  63
  64 /* Dummy comparison function that always returns false.
  65  */
  66 static int no(const void *entry, const void *val)
  67 {
  68         return 0;
  69 }
  70
  71 /* Extend "table" to twice its size.
  72  * Return 0 on success and -1 on error.
  73  *
  74  * We reuse isl_hash_table_find to create entries in the extended table.
  75  * Since all entries in the original table are assumed to be different,
  76  * there is no need to compare them against each other.
  77  */
  78 static int grow_table(struct isl_ctx *ctx, struct isl_hash_table *table)
  79 {
  80         int n;
  81         size_t old_size, size;
  82         struct isl_hash_table_entry *entries;
  83         uint32_t h;
  84
  85         entries = table->entries;
  86         old_size = 1 << table->bits;
  87         size = 2 * old_size;
  88         table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
  89                                           size);
  90         if (!table->entries) {
  91                 table->entries = entries;
  92                 return -1;
  93         }
  94
  95         n = table->n;
  96         table->n = 0;
  97         table->bits++;
  98
  99         for (h = 0; h < old_size; ++h) {
 100                 struct isl_hash_table_entry *entry;
 101
 102                 if (!entries[h].data)
 103                         continue;
 104
 105                 entry = isl_hash_table_find(ctx, table, entries[h].hash,
 106                                             &no, NULL, 1);
 107                 if (!entry) {
 108                         table->bits--;
 109                         free(table->entries);
 110                         table->entries = entries;
 111                         table->n = n;
 112                         return -1;
 113                 }
 114
 115                 *entry = entries[h];
 116         }
 117
 118         free(entries);
 119
 120         return 0;
 121 }
 122
 123 struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size)
 124 {
 125         struct isl_hash_table *table = NULL;
 126
 127         table = isl_alloc_type(ctx, struct isl_hash_table);
 128         if (isl_hash_table_init(ctx, table, min_size))
 129                 goto error;
 130         return table;
 131 error:
 132         isl_hash_table_free(ctx, table);
 133         return NULL;
 134 }
 135
 136 void isl_hash_table_clear(struct isl_hash_table *table)
 137 {
 138         if (!table)
 139                 return;
 140         free(table->entries);
 141 }
 142
 143 void isl_hash_table_free(struct isl_ctx *ctx, struct isl_hash_table *table)
 144 {
 145         if (!table)
 146                 return;
 147         isl_hash_table_clear(table);
 148         free(table);
 149 }
 150
 151 struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx,
 152                                 struct isl_hash_table *table,
 153                                 uint32_t key_hash,
 154                                 int (*eq)(const void *entry, const void *val),
 155                                 const void *val, int reserve)
 156 {
 157         size_t size;
 158         uint32_t h, key_bits;
 159
 160         key_bits = isl_hash_bits(key_hash, table->bits);
 161         size = 1 << table->bits;
 162         for (h = key_bits; table->entries[h].data; h = (h+1) % size)
 163                 if (table->entries[h].hash == key_hash &&
 164                     eq(table->entries[h].data, val))
 165                         return &table->entries[h];
 166
 167         if (!reserve)
 168                 return NULL;
 169
 170         if (4 * table->n >= 3 * size) {
 171                 if (grow_table(ctx, table) < 0)
 172                         return NULL;
 173                 return isl_hash_table_find(ctx, table, key_hash, eq, val, 1);
 174         }
 175
 176         table->n++;
 177         table->entries[h].hash = key_hash;
 178
 179         return &table->entries[h];
 180 }
 181
 182 isl_stat isl_hash_table_foreach(isl_ctx *ctx, struct isl_hash_table *table,
 183         isl_stat (*fn)(void **entry, void *user), void *user)
 184 {
 185         size_t size;
 186         uint32_t h;
 187
 188         if (!table->entries)
 189                 return isl_stat_error;
 190
 191         size = 1 << table->bits;
 192         for (h = 0; h < size; ++ h)
 193                 if (table->entries[h].data &&
 194                     fn(&table->entries[h].data, user) < 0)
 195                         return isl_stat_error;
 196
 197         return isl_stat_ok;
 198 }
 199
 200 void isl_hash_table_remove(struct isl_ctx *ctx,
 201                                 struct isl_hash_table *table,
 202                                 struct isl_hash_table_entry *entry)
 203 {
 204         int h, h2;
 205         size_t size;
 206
 207         if (!table || !entry)
 208                 return;
 209
 210         size = 1 << table->bits;
 211         h = entry - table->entries;
 212         isl_assert(ctx, h >= 0 && h < size, return);
 213
 214         for (h2 = h+1; table->entries[h2 % size].data; h2++) {
 215                 uint32_t bits = isl_hash_bits(table->entries[h2 % size].hash,
 216                                                 table->bits);
 217                 uint32_t offset = (size + bits - (h+1)) % size;
 218                 if (offset <= h2 - (h+1))
 219                         continue;
 220                 *entry = table->entries[h2 % size];
 221                 h = h2;
 222                 entry = &table->entries[h % size];
 223         }
 224
 225         entry->hash = 0;
 226         entry->data = NULL;
 227         table->n--;
 228 }