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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
|
/* hash.c: hash table operations.
Copyright 1994, 95, 96, 97, 98, 99, 2000, 02, 05 Karl Berry & Olaf Weber.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <kpathsea/config.h>
#include <kpathsea/c-ctype.h>
#include <kpathsea/hash.h>
#include <kpathsea/str-list.h>
/* The hash function. We go for simplicity here. */
/* All our hash tables are related to filenames. */
#ifdef MONOCASE_FILENAMES
#if defined(WIN32) && !defined(__i386_pc_gnu__)
/* This is way faster under Win32. */
#define TRANSFORM(x) ((unsigned)CharLower((LPTSTR)(BYTE)(x)))
#else
#define TRANSFORM(x) (tolower(x))
#endif
#else
#define TRANSFORM(x) (x)
#endif
static unsigned
hash P2C(hash_table_type, table, const_string, key)
{
unsigned n = 0;
/* Our keys aren't often anagrams of each other, so no point in
weighting the characters. */
while (*key != 0)
n = (n + n + TRANSFORM (*key++)) % table.size;
return n;
}
/* Identical has function as above, but does not normalize keys. */
static unsigned
hash_normalized P2C(hash_table_type, table, const_string, key)
{
unsigned n = 0;
/* Our keys aren't often anagrams of each other, so no point in
weighting the characters. */
while (*key != 0)
n = (n + n + (*key++)) % table.size;
return n;
}
hash_table_type
hash_create P1C(unsigned, size)
{
/* hash_table_type ret; changed into "static ..." to work around gcc
optimizer bug for Alpha. */
static hash_table_type ret;
unsigned b;
ret.buckets = XTALLOC (size, hash_element_type *);
ret.size = size;
/* calloc's zeroes aren't necessarily NULL, so be safe. */
for (b = 0; b <ret.size; b++)
ret.buckets[b] = NULL;
return ret;
}
/* Whether or not KEY is already in MAP, insert it and VALUE. Do not
duplicate the strings, in case they're being purposefully shared. */
void
hash_insert P3C(hash_table_type *, table,
const_string, key,
const_string, value)
{
unsigned n = hash (*table, key);
hash_element_type *new_elt = XTALLOC1 (hash_element_type);
new_elt->key = key;
new_elt->value = value;
new_elt->next = NULL;
/* Insert the new element at the end of the list. */
if (!table->buckets[n])
/* first element in bucket is a special case. */
table->buckets[n] = new_elt;
else
{
hash_element_type *loc = table->buckets[n];
while (loc->next) /* Find the last element. */
loc = loc->next;
loc->next = new_elt; /* Insert the new one after. */
}
}
/* Same as above, for normalized keys. */
void
hash_insert_normalized P3C(hash_table_type *, table,
const_string, key,
const_string, value)
{
unsigned n = hash_normalized (*table, key);
hash_element_type *new_elt = XTALLOC1 (hash_element_type);
new_elt->key = key;
new_elt->value = value;
new_elt->next = NULL;
/* Insert the new element at the end of the list. */
if (!table->buckets[n])
/* first element in bucket is a special case. */
table->buckets[n] = new_elt;
else
{
hash_element_type *loc = table->buckets[n];
while (loc->next) /* Find the last element. */
loc = loc->next;
loc->next = new_elt; /* Insert the new one after. */
}
}
/* Remove a (KEY, VALUE) pair. */
void
hash_remove P3C(hash_table_type *, table, const_string, key,
const_string, value)
{
hash_element_type *p;
hash_element_type *q;
unsigned n = hash (*table, key);
/* Find pair. */
for (q = NULL, p = table->buckets[n]; p != NULL; q = p, p = p->next)
if (FILESTRCASEEQ (key, p->key) && STREQ (value, p->value))
break;
if (p) {
/* We found something, remove it from the chain. */
if (q) q->next = p->next; else table->buckets[n] = p->next;
/* We cannot dispose of the contents. */
free (p);
}
}
/* Look up STR in MAP. Return a (dynamically-allocated) list of the
corresponding strings or NULL if no match. */
#ifdef KPSE_DEBUG
/* Print the hash values as integers if this is nonzero. */
boolean kpse_debug_hash_lookup_int = false;
#endif
string *
hash_lookup P2C(hash_table_type, table, const_string, key)
{
hash_element_type *p;
str_list_type ret;
unsigned n = hash (table, key);
ret = str_list_init ();
/* Look at everything in this bucket. */
for (p = table.buckets[n]; p != NULL; p = p->next)
if (FILESTRCASEEQ (key, p->key))
/* Cast because the general str_list_type shouldn't force const data. */
str_list_add (&ret, (string) p->value);
/* If we found anything, mark end of list with null. */
if (STR_LIST (ret))
str_list_add (&ret, NULL);
#ifdef KPSE_DEBUG
if (KPSE_DEBUG_P (KPSE_DEBUG_HASH))
{
DEBUGF1 ("hash_lookup(%s) =>", key);
if (!STR_LIST (ret))
fputs (" (nil)\n", stderr);
else
{
string *r;
for (r = STR_LIST (ret); *r; r++)
{
putc (' ', stderr);
if (kpse_debug_hash_lookup_int)
fprintf (stderr, "%ld", (long) *r);
else
fputs (*r, stderr);
}
putc ('\n', stderr);
}
fflush (stderr);
}
#endif
return STR_LIST (ret);
}
/* We only print nonempty buckets, to decrease output volume. */
void
hash_print P2C(hash_table_type, table, boolean, summary_only)
{
unsigned b;
unsigned total_elements = 0, total_buckets = 0;
for (b = 0; b < table.size; b++) {
hash_element_type *bucket = table.buckets[b];
if (bucket) {
unsigned len = 1;
hash_element_type *tb;
total_buckets++;
if (!summary_only) fprintf (stderr, "%4d ", b);
for (tb = bucket->next; tb != NULL; tb = tb->next)
len++;
if (!summary_only) fprintf (stderr, ":%-5d", len);
total_elements += len;
if (!summary_only) {
for (tb = bucket; tb != NULL; tb = tb->next)
fprintf (stderr, " %s=>%s", tb->key, tb->value);
putc ('\n', stderr);
}
}
}
fprintf (stderr,
"%u buckets, %u nonempty (%u%%); %u entries, average chain %.1f.\n",
table.size,
total_buckets,
100 * total_buckets / table.size,
total_elements,
total_buckets ? total_elements / (double) total_buckets : 0.0);
}
|
