2 Copyright (C) 2000, 2001 Free Software Foundation, Inc.
4 This file is part of GNU Wget.
6 GNU Wget is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or (at
9 your option) any later version.
11 GNU Wget is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with Wget; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 In addition, as a special exception, the Free Software Foundation
21 gives permission to link the code of its release of Wget with the
22 OpenSSL project's "OpenSSL" library (or with modified versions of it
23 that use the same license as the "OpenSSL" library), and distribute
24 the linked executables. You must obey the GNU General Public License
25 in all respects for all of the code used other than "OpenSSL". If you
26 modify this file, you may extend this exception to your version of the
27 file, but you are not obligated to do so. If you do not wish to do
28 so, delete this exception statement from your version. */
38 #endif /* HAVE_STRING_H */
52 # define xmalloc malloc
53 # define xrealloc realloc
57 # define TOLOWER(x) ('A' <= (x) && (x) <= 'Z' ? (x) - 32 : (x))
62 Hash tables are a technique used to implement mapping between
63 objects with near-constant-time access and storage. The table
64 associates keys to values, and a value can be very quickly
65 retrieved by providing the key. Fast lookup tables are typically
66 implemented as hash tables.
69 hash_table_new -- creates the table.
70 hash_table_destroy -- destroys the table.
71 hash_table_put -- establishes or updates key->value mapping.
72 hash_table_get -- retrieves value of key.
73 hash_table_get_pair -- get key/value pair for key.
74 hash_table_contains -- test whether the table contains key.
75 hash_table_remove -- remove the key->value mapping for key.
76 hash_table_map -- iterate through table mappings.
77 hash_table_clear -- clear hash table contents.
78 hash_table_count -- return the number of entries in the table.
80 The hash table grows internally as new entries are added and is not
81 limited in size, except by available memory. The table doubles
82 with each resize, which ensures that the amortized time per
83 operation remains constant.
85 By default, tables created by hash_table_new consider the keys to
86 be equal if their pointer values are the same. You can use
87 make_string_hash_table to create tables whose keys are considered
88 equal if their string contents are the same. In the general case,
89 the criterion of equality used to compare keys is specified at
90 table creation time with two callback functions, "hash" and "test".
91 The hash function transforms the key into an arbitrary number that
92 must be the same for two equal keys. The test function accepts two
93 keys and returns non-zero if they are to be considered equal.
95 Note that neither keys nor values are copied when inserted into the
96 hash table, so they must exist for the lifetime of the table. This
97 means that e.g. the use of static strings is OK, but objects with a
98 shorter life-time need to be copied (with strdup() or the like in
99 the case of strings) before being inserted. */
103 The hash table is implemented as an open-addressed table with
104 linear probing collision resolution.
106 In regular language, it means that all the hash entries (pairs of
107 pointers key and value) are stored in a contiguous array. The
108 position of each mapping is determined by the hash value of its key
109 and the size of the table: location := hash(key) % size. If two
110 different keys end up on the same position (collide), the one that
111 came second is placed at the next empty position following the
112 occupied place. This collision resolution technique is called
115 There are more advanced collision resolution methods (quadratic
116 probing, double hashing), but we don't use them because they incur
117 more non-sequential access to the array, which results in worse CPU
118 cache behavior. Linear probing works well as long as the
119 count/size ratio (fullness) is kept below 75%. We make sure to
120 grow and rehash the table whenever this threshold is exceeded.
122 Collisions make deletion tricky because clearing a position
123 followed by a colliding entry would make the position seem empty
124 and the colliding entry not found. One solution is to leave a
125 "tombstone" instead of clearing the entry, and another is to
126 carefully rehash the entries immediately following the deleted one.
127 We use the latter method because it results in less bookkeeping and
128 faster retrieval at the (slight) expense of deletion. */
130 /* Maximum allowed fullness: when hash table's fullness exceeds this
131 value, the table is resized. */
132 #define HASH_MAX_FULLNESS 0.75
134 /* The hash table size is multiplied by this factor (and then rounded
135 to the next prime) with each resize. This guarantees infrequent
137 #define HASH_RESIZE_FACTOR 2
144 typedef unsigned long (*hashfun_t) PARAMS ((const void *));
145 typedef int (*testfun_t) PARAMS ((const void *, const void *));
148 hashfun_t hash_function;
149 testfun_t test_function;
151 struct mapping *mappings; /* pointer to the table entries. */
152 int size; /* size of the array. */
154 int count; /* number of non-empty entries. */
155 int resize_threshold; /* after size exceeds this number of
156 entries, resize the table. */
157 int prime_offset; /* the offset of the current prime in
161 /* We use all-bit-set marker to mean that a mapping is empty. It is
162 (hopefully) illegal as a pointer, and it allows the users to use
163 NULL (as well as any non-negative integer) as key. */
165 #define NON_EMPTY(mp) (mp->key != (void *)~(unsigned long)0)
166 #define MARK_AS_EMPTY(mp) (mp->key = (void *)~(unsigned long)0)
168 /* "Next" mapping is the mapping after MP, but wrapping back to
169 MAPPINGS when MP would reach MAPPINGS+SIZE. */
170 #define NEXT_MAPPING(mp, mappings, size) (mp != mappings + (size - 1) \
173 /* Loop over non-empty mappings starting at MP. */
174 #define LOOP_NON_EMPTY(mp, mappings, size) \
175 for (; NON_EMPTY (mp); mp = NEXT_MAPPING (mp, mappings, size))
177 /* Return the position of KEY in hash table SIZE large, hash function
179 #define HASH_POSITION(key, hashfun, size) ((hashfun) (key) % size)
181 /* Find a prime near, but greather than or equal to SIZE. Of course,
182 the primes are not calculated, but looked up from a table. The
183 table does not contain all primes in range, just a selection useful
186 PRIME_OFFSET is a minor optimization: it specifies start position
187 for the search for the large enough prime. The final offset is
188 stored in the same variable. That way the list of primes does not
189 have to be scanned from the beginning each time around. */
192 prime_size (int size, int *prime_offset)
194 static const unsigned long primes [] = {
195 13, 19, 29, 41, 59, 79, 107, 149, 197, 263, 347, 457, 599, 787, 1031,
196 1361, 1777, 2333, 3037, 3967, 5167, 6719, 8737, 11369, 14783,
197 19219, 24989, 32491, 42257, 54941, 71429, 92861, 120721, 156941,
198 204047, 265271, 344857, 448321, 582821, 757693, 985003, 1280519,
199 1664681, 2164111, 2813353, 3657361, 4754591, 6180989, 8035301,
200 10445899, 13579681, 17653589, 22949669, 29834603, 38784989,
201 50420551, 65546729, 85210757, 110774011, 144006217, 187208107,
202 243370577, 316381771, 411296309, 534685237, 695090819, 903618083,
203 1174703521, 1527114613, 1985248999,
204 (unsigned long)0x99d43ea5, (unsigned long)0xc7fa5177
208 for (i = *prime_offset; i < countof (primes); i++)
209 if (primes[i] >= size)
211 /* Set the offset to the next prime. That is safe because,
212 next time we are called, it will be with a larger SIZE,
213 which means we could never return the same prime anyway.
214 (If that is not the case, the caller can simply reset
216 *prime_offset = i + 1;
224 static unsigned long ptrhash PARAMS ((const void *));
225 static int ptrcmp PARAMS ((const void *, const void *));
227 /* Create a hash table with hash function HASH_FUNCTION and test
228 function TEST_FUNCTION. The table is empty (its count is 0), but
229 pre-allocated to store at least ITEMS items.
231 ITEMS is the number of items that the table can accept without
232 needing to resize. It is useful when creating a table that is to
233 be immediately filled with a known number of items. In that case,
234 the regrows are a waste of time, and specifying ITEMS correctly
235 will avoid them altogether.
237 Note that hash tables grow dynamically regardless of ITEMS. The
238 only use of ITEMS is to preallocate the table and avoid unnecessary
239 dynamic regrows. Don't bother making ITEMS prime because it's not
240 used as size unchanged. To start with a small table that grows as
241 needed, simply specify zero ITEMS.
243 If hash and test callbacks are not specified, identity mapping is
244 assumed, i.e. pointer values are used for key comparison. (Common
245 Lisp calls such tables EQ hash tables, and Java calls them
246 IdentityHashMaps.) If your keys require different comparison,
247 specify hash and test functions. For easy use of C strings as hash
248 keys, you can use the convenience functions make_string_hash_table
249 and make_nocase_string_hash_table. */
252 hash_table_new (int items,
253 unsigned long (*hash_function) (const void *),
254 int (*test_function) (const void *, const void *))
257 struct hash_table *ht = xnew (struct hash_table);
259 ht->hash_function = hash_function ? hash_function : ptrhash;
260 ht->test_function = test_function ? test_function : ptrcmp;
262 /* If the size of struct hash_table ever becomes a concern, this
263 field can go. (Wget doesn't create many hashes.) */
264 ht->prime_offset = 0;
266 /* Calculate the size that ensures that the table will store at
267 least ITEMS keys without the need to resize. */
268 size = 1 + items / HASH_MAX_FULLNESS;
269 size = prime_size (size, &ht->prime_offset);
271 ht->resize_threshold = size * HASH_MAX_FULLNESS;
272 /*assert (ht->resize_threshold >= items);*/
274 ht->mappings = xnew_array (struct mapping, ht->size);
275 /* Mark mappings as empty. We use 0xff rather than 0 to mark empty
276 keys because it allows us to store NULL keys to the table. */
277 memset (ht->mappings, 0xff, size * sizeof (struct mapping));
284 /* Free the data associated with hash table HT. */
287 hash_table_destroy (struct hash_table *ht)
289 xfree (ht->mappings);
293 /* The heart of most functions in this file -- find the mapping whose
294 KEY is equal to key, using linear probing. Returns the mapping
295 that matches KEY, or the first empty mapping if none matches. */
297 static inline struct mapping *
298 find_mapping (const struct hash_table *ht, const void *key)
300 struct mapping *mappings = ht->mappings;
302 struct mapping *mp = mappings + HASH_POSITION (key, ht->hash_function, size);
303 testfun_t equals = ht->test_function;
305 LOOP_NON_EMPTY (mp, mappings, size)
306 if (equals (key, mp->key))
311 /* Get the value that corresponds to the key KEY in the hash table HT.
312 If no value is found, return NULL. Note that NULL is a legal value
313 for value; if you are storing NULLs in your hash table, you can use
314 hash_table_contains to be sure that a (possibly NULL) value exists
315 in the table. Or, you can use hash_table_get_pair instead of this
319 hash_table_get (const struct hash_table *ht, const void *key)
321 struct mapping *mp = find_mapping (ht, key);
328 /* Like hash_table_get, but writes out the pointers to both key and
329 value. Returns non-zero on success. */
332 hash_table_get_pair (const struct hash_table *ht, const void *lookup_key,
333 void *orig_key, void *value)
335 struct mapping *mp = find_mapping (ht, lookup_key);
339 *(void **)orig_key = mp->key;
341 *(void **)value = mp->value;
348 /* Return 1 if HT contains KEY, 0 otherwise. */
351 hash_table_contains (const struct hash_table *ht, const void *key)
353 struct mapping *mp = find_mapping (ht, key);
354 return NON_EMPTY (mp);
357 /* Grow hash table HT as necessary, and rehash all the key-value
361 grow_hash_table (struct hash_table *ht)
363 hashfun_t hasher = ht->hash_function;
364 struct mapping *old_mappings = ht->mappings;
365 struct mapping *old_end = ht->mappings + ht->size;
366 struct mapping *mp, *mappings;
369 newsize = prime_size (ht->size * HASH_RESIZE_FACTOR, &ht->prime_offset);
371 printf ("growing from %d to %d; fullness %.2f%% to %.2f%%\n",
373 100.0 * ht->count / ht->size,
374 100.0 * ht->count / newsize);
378 ht->resize_threshold = newsize * HASH_MAX_FULLNESS;
380 mappings = xnew_array (struct mapping, newsize);
381 memset (mappings, 0xff, newsize * sizeof (struct mapping));
382 ht->mappings = mappings;
384 for (mp = old_mappings; mp < old_end; mp++)
387 struct mapping *new_mp;
388 /* We don't need to test for uniqueness of keys because they
389 come from the hash table and are therefore known to be
391 new_mp = mappings + HASH_POSITION (mp->key, hasher, newsize);
392 LOOP_NON_EMPTY (new_mp, mappings, newsize)
397 xfree (old_mappings);
400 /* Put VALUE in the hash table HT under the key KEY. This regrows the
401 table if necessary. */
404 hash_table_put (struct hash_table *ht, const void *key, void *value)
406 struct mapping *mp = find_mapping (ht, key);
409 /* update existing item */
410 mp->key = (void *)key; /* const? */
415 /* If adding the item would make the table exceed max. fullness,
416 grow the table first. */
417 if (ht->count >= ht->resize_threshold)
419 grow_hash_table (ht);
420 mp = find_mapping (ht, key);
425 mp->key = (void *)key; /* const? */
429 /* Remove a mapping that matches KEY from HT. Return 0 if there was
430 no such entry; return 1 if an entry was removed. */
433 hash_table_remove (struct hash_table *ht, const void *key)
435 struct mapping *mp = find_mapping (ht, key);
441 struct mapping *mappings = ht->mappings;
442 hashfun_t hasher = ht->hash_function;
447 /* Rehash all the entries following MP. The alternative
448 approach is to mark the entry as deleted, i.e. create a
449 "tombstone". That speeds up removal, but leaves a lot of
450 garbage and slows down hash_table_get and hash_table_put. */
452 mp = NEXT_MAPPING (mp, mappings, size);
453 LOOP_NON_EMPTY (mp, mappings, size)
455 const void *key2 = mp->key;
456 struct mapping *mp_new;
458 /* Find the new location for the key. */
459 mp_new = mappings + HASH_POSITION (key2, hasher, size);
460 LOOP_NON_EMPTY (mp_new, mappings, size)
461 if (key2 == mp_new->key)
462 /* The mapping MP (key2) is already where we want it (in
463 MP_NEW's "chain" of keys.) */
476 /* Clear HT of all entries. After calling this function, the count
477 and the fullness of the hash table will be zero. The size will
481 hash_table_clear (struct hash_table *ht)
483 memset (ht->mappings, 0xff, ht->size * sizeof (struct mapping));
487 /* Map MAPFUN over all the mappings in hash table HT. MAPFUN is
488 called with three arguments: the key, the value, and MAPARG.
490 It is undefined what happens if you add or remove entries in the
491 hash table while hash_table_map is running. The exception is the
492 entry you're currently mapping over; you may remove or change that
496 hash_table_map (struct hash_table *ht,
497 int (*mapfun) (void *, void *, void *),
500 struct mapping *mp = ht->mappings;
501 struct mapping *end = ht->mappings + ht->size;
503 for (; mp < end; mp++)
509 if (mapfun (key, mp->value, maparg))
511 /* hash_table_remove might have moved the adjacent
513 if (mp->key != key && NON_EMPTY (mp))
518 /* Return the number of elements in the hash table. This is not the
519 same as the physical size of the hash table, which is always
520 greater than the number of elements. */
523 hash_table_count (const struct hash_table *ht)
528 /* Functions from this point onward are meant for convenience and
529 don't strictly belong to this file. However, this is as good a
530 place for them as any. */
532 /* Rules for creating custom hash and test functions:
534 - The test function returns non-zero for keys that are considered
535 "equal", zero otherwise.
537 - The hash function returns a number that represents the
538 "distinctness" of the object. In more precise terms, it means
539 that for any two objects that test "equal" under the test
540 function, the hash function MUST produce the same result.
542 This does not mean that all different objects must produce
543 different values (that would be "perfect" hashing), only that
544 non-distinct objects must produce the same values! For instance,
545 a hash function that returns 0 for any given object is a
546 perfectly valid (albeit extremely bad) hash function. A hash
547 function that hashes a string by adding up all its characters is
548 another example of a valid (but quite bad) hash function.
550 It is not hard to make hash and test functions agree about
551 equality. For example, if the test function compares strings
552 case-insensitively, the hash function can lower-case the
553 characters when calculating the hash value. That ensures that
554 two strings differing only in case will hash the same.
556 - If you care about performance, choose a hash function with as
557 good "spreading" as possible. A good hash function will use all
558 the bits of the input when calculating the hash, and will react
559 to even small changes in input with a completely different
560 output. Finally, don't make the hash function itself overly
561 slow, because you'll be incurring a non-negligible overhead to
562 all hash table operations. */
565 * Support for hash tables whose keys are strings.
569 /* 31 bit hash function. Taken from Gnome's glib, modified to use
572 We used to use the popular hash function from the Dragon Book, but
573 this one seems to perform much better. */
576 string_hash (const void *key)
582 for (p += 1; *p != '\0'; p++)
583 h = (h << 5) - h + *p;
588 /* Frontend for strcmp usable for hash tables. */
591 string_cmp (const void *s1, const void *s2)
593 return !strcmp ((const char *)s1, (const char *)s2);
596 /* Return a hash table of preallocated to store at least ITEMS items
597 suitable to use strings as keys. */
600 make_string_hash_table (int items)
602 return hash_table_new (items, string_hash, string_cmp);
606 * Support for hash tables whose keys are strings, but which are
607 * compared case-insensitively.
611 /* Like string_hash, but produce the same hash regardless of the case. */
614 string_hash_nocase (const void *key)
617 unsigned int h = TOLOWER (*p);
620 for (p += 1; *p != '\0'; p++)
621 h = (h << 5) - h + TOLOWER (*p);
626 /* Like string_cmp, but doing case-insensitive compareison. */
629 string_cmp_nocase (const void *s1, const void *s2)
631 return !strcasecmp ((const char *)s1, (const char *)s2);
634 /* Like make_string_hash_table, but uses string_hash_nocase and
635 string_cmp_nocase. */
638 make_nocase_string_hash_table (int items)
640 return hash_table_new (items, string_hash_nocase, string_cmp_nocase);
643 /* Hashing of numeric values, such as pointers and integers.
645 This implementation is the Robert Jenkins' 32 bit Mix Function,
646 with a simple adaptation for 64-bit values. It offers excellent
647 spreading of values and doesn't need to know the hash table size to
648 work (unlike the very popular Knuth's multiplication hash). */
651 ptrhash (const void *ptr)
653 unsigned long key = (unsigned long)ptr;
676 ptrcmp (const void *ptr1, const void *ptr2)
687 print_hash_table_mapper (void *key, void *value, void *count)
690 printf ("%s: %s\n", (const char *)key, (char *)value);
695 print_hash (struct hash_table *sht)
698 hash_table_map (sht, print_hash_table_mapper, &debug_count);
699 assert (debug_count == sht->count);
705 struct hash_table *ht = make_string_hash_table (0);
707 while ((fgets (line, sizeof (line), stdin)))
709 int len = strlen (line);
713 if (!hash_table_contains (ht, line))
714 hash_table_put (ht, strdup (line), "here I am!");
719 if (hash_table_get_pair (ht, line, &line_copy, NULL))
721 hash_table_remove (ht, line);
731 printf ("%d %d\n", ht->count, ht->size);