Coverage Report

Created: 2017-10-03 07:32

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_hash.c
Line
Count
Source (jump to first uncovered line)
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_private.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
150k
{
17
1.46M
  for (; 
*s1.46M
;
s++1.31M
)
18
1.31M
    isl_hash_byte(hash, *s);
19
150k
  return hash;
20
150k
}
21
22
uint32_t isl_hash_mem(uint32_t hash, const void *p, size_t len)
23
14.0k
{
24
14.0k
  int i;
25
14.0k
  const char *s = p;
26
126k
  for (i = 0; 
i < len126k
;
++i112k
)
27
112k
    isl_hash_byte(hash, s[i]);
28
14.0k
  return hash;
29
14.0k
}
30
31
static unsigned int round_up(unsigned int v)
32
348k
{
33
348k
  int old_v = v;
34
348k
35
1.19M
  while (
v1.19M
) {
36
845k
    old_v = v;
37
845k
    v ^= v & -v;
38
845k
  }
39
348k
  return old_v << 1;
40
348k
}
41
42
int isl_hash_table_init(struct isl_ctx *ctx, struct isl_hash_table *table,
43
      int min_size)
44
348k
{
45
348k
  size_t size;
46
348k
47
348k
  if (!table)
48
0
    return -1;
49
348k
50
348k
  
if (348k
min_size < 2348k
)
51
151k
    min_size = 2;
52
348k
  table->bits = ffs(round_up(4 * (min_size + 1) / 3 - 1)) - 1;
53
348k
  table->n = 0;
54
348k
55
348k
  size = 1 << table->bits;
56
348k
  table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
57
348k
            size);
58
348k
  if (!table->entries)
59
7
    return -1;
60
348k
61
348k
  return 0;
62
348k
}
63
64
/* Dummy comparison function that always returns false.
65
 */
66
static int no(const void *entry, const void *val)
67
96.0k
{
68
96.0k
  return 0;
69
96.0k
}
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
4.40k
{
80
4.40k
  int n;
81
4.40k
  size_t old_size, size;
82
4.40k
  struct isl_hash_table_entry *entries;
83
4.40k
  uint32_t h;
84
4.40k
85
4.40k
  entries = table->entries;
86
4.40k
  old_size = 1 << table->bits;
87
4.40k
  size = 2 * old_size;
88
4.40k
  table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
89
4.40k
            size);
90
4.40k
  if (
!table->entries4.40k
) {
91
0
    table->entries = entries;
92
0
    return -1;
93
0
  }
94
4.40k
95
4.40k
  n = table->n;
96
4.40k
  table->n = 0;
97
4.40k
  table->bits++;
98
4.40k
99
46.7k
  for (h = 0; 
h < old_size46.7k
;
++h42.3k
) {
100
42.3k
    struct isl_hash_table_entry *entry;
101
42.3k
102
42.3k
    if (!entries[h].data)
103
10.5k
      continue;
104
31.7k
105
31.7k
    entry = isl_hash_table_find(ctx, table, entries[h].hash,
106
31.7k
              &no, NULL, 1);
107
31.7k
    if (
!entry31.7k
) {
108
0
      table->bits--;
109
0
      free(table->entries);
110
0
      table->entries = entries;
111
0
      table->n = n;
112
0
      return -1;
113
0
    }
114
31.7k
115
31.7k
    *entry = entries[h];
116
31.7k
  }
117
4.40k
118
4.40k
  free(entries);
119
4.40k
120
4.40k
  return 0;
121
4.40k
}
122
123
struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size)
124
24.6k
{
125
24.6k
  struct isl_hash_table *table = NULL;
126
24.6k
127
24.6k
  table = isl_alloc_type(ctx, struct isl_hash_table);
128
24.6k
  if (isl_hash_table_init(ctx, table, min_size))
129
0
    goto error;
130
24.6k
  return table;
131
0
error:
132
0
  isl_hash_table_free(ctx, table);
133
0
  return NULL;
134
24.6k
}
135
136
void isl_hash_table_clear(struct isl_hash_table *table)
137
347k
{
138
347k
  if (!table)
139
0
    return;
140
347k
  free(table->entries);
141
347k
}
142
143
void isl_hash_table_free(struct isl_ctx *ctx, struct isl_hash_table *table)
144
24.7k
{
145
24.7k
  if (!table)
146
108
    return;
147
24.6k
  isl_hash_table_clear(table);
148
24.6k
  free(table);
149
24.6k
}
150
151
/* A dummy entry that can be used to make a distinction between
152
 * a missing entry and an error condition.
153
 * It is used by isl_union_*_find_part_entry.
154
 */
155
static struct isl_hash_table_entry none = { 0, NULL };
156
struct isl_hash_table_entry *isl_hash_table_entry_none = &none;
157
158
struct isl_hash_table_entry *isl_hash_table_find(struct isl_ctx *ctx,
159
        struct isl_hash_table *table,
160
        uint32_t key_hash,
161
        int (*eq)(const void *entry, const void *val),
162
        const void *val, int reserve)
163
1.06M
{
164
1.06M
  size_t size;
165
1.06M
  uint32_t h, key_bits;
166
1.06M
167
1.06M
  key_bits = isl_hash_bits(key_hash, table->bits);
168
1.06M
  size = 1 << table->bits;
169
1.80M
  for (h = key_bits; 
table->entries[h].data1.80M
;
h = (h+1) % size746k
)
170
1.05M
    
if (1.05M
table->entries[h].hash == key_hash &&
171
679k
        eq(table->entries[h].data, val))
172
311k
      return &table->entries[h];
173
1.06M
174
750k
  
if (750k
!reserve750k
)
175
104k
    return NULL;
176
645k
177
645k
  
if (645k
4 * table->n >= 3 * size645k
) {
178
4.40k
    if (grow_table(ctx, table) < 0)
179
0
      return NULL;
180
4.40k
    return isl_hash_table_find(ctx, table, key_hash, eq, val, 1);
181
4.40k
  }
182
640k
183
640k
  table->n++;
184
640k
  table->entries[h].hash = key_hash;
185
640k
186
640k
  return &table->entries[h];
187
640k
}
188
189
isl_stat isl_hash_table_foreach(isl_ctx *ctx, struct isl_hash_table *table,
190
  isl_stat (*fn)(void **entry, void *user), void *user)
191
851k
{
192
851k
  size_t size;
193
851k
  uint32_t h;
194
851k
195
851k
  if (!table->entries)
196
7
    return isl_stat_error;
197
851k
198
851k
  size = 1 << table->bits;
199
15.4M
  for (h = 0; 
h < size15.4M
;
++ h14.5M
)
200
14.6M
    
if (14.6M
table->entries[h].data &&
201
1.08M
        fn(&table->entries[h].data, user) < 0)
202
89.8k
      return isl_stat_error;
203
851k
  
204
761k
  return isl_stat_ok;
205
851k
}
206
207
void isl_hash_table_remove(struct isl_ctx *ctx,
208
        struct isl_hash_table *table,
209
        struct isl_hash_table_entry *entry)
210
73.1k
{
211
73.1k
  int h, h2;
212
73.1k
  size_t size;
213
73.1k
214
73.1k
  if (
!table || 73.1k
!entry73.1k
)
215
0
    return;
216
73.1k
217
73.1k
  size = 1 << table->bits;
218
73.1k
  h = entry - table->entries;
219
73.1k
  isl_assert(ctx, h >= 0 && h < size, return);
220
73.1k
221
353k
  
for (h2 = h+1; 73.1k
table->entries[h2 % size].data353k
;
h2++280k
) {
222
280k
    uint32_t bits = isl_hash_bits(table->entries[h2 % size].hash,
223
280k
            table->bits);
224
280k
    uint32_t offset = (size + bits - (h+1)) % size;
225
280k
    if (offset <= h2 - (h+1))
226
55.4k
      continue;
227
225k
    *entry = table->entries[h2 % size];
228
225k
    h = h2;
229
225k
    entry = &table->entries[h % size];
230
225k
  }
231
73.1k
232
73.1k
  entry->hash = 0;
233
73.1k
  entry->data = NULL;
234
73.1k
  table->n--;
235
73.1k
}