1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
/* Copyright (C) 2001-2023 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
CA 94129, USA, for further information.
*/
/* Linear probe hash table.
*
* Simple hashtable with open adressing linear probe.
* Does not manage memory of key/value pointers.
* Does not support deleting entries.
*/
#include "ghostxps.h"
static const unsigned primes[] =
{
61, 127, 251, 509, 1021, 2039, 4093, 8191, 16381, 32749, 65521,
131071, 262139, 524287, 1048573, 2097143, 4194301, 8388593, 0
};
typedef struct xps_hash_entry_s xps_hash_entry_t;
struct xps_hash_entry_s
{
char *key;
void *value;
};
struct xps_hash_table_s
{
void *ctx;
unsigned int size;
unsigned int load;
xps_hash_entry_t *entries;
};
static inline int
xps_tolower(int c)
{
if (c >= 'A' && c <= 'Z')
return c + 32;
return c;
}
static unsigned int
xps_hash(char *s)
{
unsigned int h = 0;
while (*s)
h = xps_tolower(*s++) + (h << 6) + (h << 16) - h;
return h;
}
xps_hash_table_t *
xps_hash_new(xps_context_t *ctx)
{
xps_hash_table_t *table;
table = xps_alloc(ctx, sizeof(xps_hash_table_t));
if (!table)
{
gs_throw(gs_error_VMerror, "out of memory: hash table struct");
return NULL;
}
table->size = primes[0];
table->load = 0;
table->entries = xps_alloc(ctx, sizeof(xps_hash_entry_t) * table->size);
if (!table->entries)
{
xps_free(ctx, table);
gs_throw(gs_error_VMerror, "out of memory: hash table entries array");
return NULL;
}
memset(table->entries, 0, sizeof(xps_hash_entry_t) * table->size);
return table;
}
static int
xps_hash_double(xps_context_t *ctx, xps_hash_table_t *table)
{
xps_hash_entry_t *old_entries;
xps_hash_entry_t *new_entries;
unsigned int old_size = table->size;
unsigned int new_size = table->size * 2;
int i;
for (i = 0; primes[i] != 0; i++)
{
if (primes[i] > old_size)
{
new_size = primes[i];
break;
}
}
old_entries = table->entries;
new_entries = xps_alloc(ctx, sizeof(xps_hash_entry_t) * new_size);
if (!new_entries)
return gs_throw(gs_error_VMerror, "out of memory: hash table entries array");
table->size = new_size;
table->entries = new_entries;
table->load = 0;
memset(table->entries, 0, sizeof(xps_hash_entry_t) * table->size);
for (i = 0; i < old_size; i++)
if (old_entries[i].value)
xps_hash_insert(ctx, table, old_entries[i].key, old_entries[i].value);
xps_free(ctx, old_entries);
return 0;
}
void
xps_hash_free(xps_context_t *ctx, xps_hash_table_t *table,
void (*free_key)(xps_context_t *ctx, void *),
void (*free_value)(xps_context_t *ctx, void *))
{
int i;
for (i = 0; i < table->size; i++)
{
if (table->entries[i].key && free_key)
free_key(ctx, table->entries[i].key);
if (table->entries[i].value && free_value)
free_value(ctx, table->entries[i].value);
}
xps_free(ctx, table->entries);
xps_free(ctx, table);
}
void *
xps_hash_lookup(xps_hash_table_t *table, char *key)
{
xps_hash_entry_t *entries = table->entries;
unsigned int size = table->size;
unsigned int pos = xps_hash(key) % size;
while (1)
{
if (!entries[pos].value)
return NULL;
if (xps_strcasecmp(key, entries[pos].key) == 0)
return entries[pos].value;
pos = (pos + 1) % size;
}
}
int
xps_hash_insert(xps_context_t *ctx, xps_hash_table_t *table, char *key, void *value)
{
xps_hash_entry_t *entries;
unsigned int size, pos;
/* Grow the table at 80% load */
if (table->load > table->size * 8 / 10)
{
if (xps_hash_double(ctx, table) < 0)
return gs_rethrow(-1, "cannot grow hash table");
}
entries = table->entries;
size = table->size;
pos = xps_hash(key) % size;
while (1)
{
if (!entries[pos].value)
{
entries[pos].key = key;
entries[pos].value = value;
table->load ++;
return 0;
}
if (xps_strcasecmp(key, entries[pos].key) == 0)
{
return 0;
}
pos = (pos + 1) % size;
}
}
void
xps_hash_debug(xps_hash_table_t *table)
{
int i;
dlprintf2("hash table load %d / %d\n", table->load, table->size);
for (i = 0; i < table->size; i++)
{
if (!table->entries[i].value)
dlprintf1("table % 4d: empty\n", i);
else
dlprintf3("table % 4d: key=%s value="PRI_INTPTR"\n", i,
table->entries[i].key,
(intptr_t)table->entries[i].value);
}
}
|
