2 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
3 * Copyright (c) 1988, 1989 by Adam de Boor
4 * Copyright (c) 1989 by Berkeley Softworks
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * $NetBSD: hash.c,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $
41 #include <sys/types.h>
50 * This module contains routines to manipulate a hash table.
51 * See hash.h for a definition of the structure of the hash
52 * table. Hash tables grow automatically as the amount of
53 * information increases.
62 * Forward references to local procedures that are used before they're
66 static void RebuildTable(Hash_Table *);
69 * The following defines the ratio of # entries to # buckets
70 * at which we rebuild the table to make it larger.
73 #define rebuildLimit 8
76 *---------------------------------------------------------
80 * This routine just sets up the hash table.
84 * Structure to use to hold table.
86 * How many buckets to create for starters. This number is
87 * rounded up to a power of 2. If <= 0, a reasonable default
88 * is chosen. The table will grow in size later as needed.
94 * Memory is allocated for the initial bucket area.
96 *---------------------------------------------------------
100 Hash_InitTable(Hash_Table *t, int numBuckets)
103 struct Hash_Entry **hp;
106 * Round up the size to a power of two.
111 for (i = 2; i < numBuckets; i <<= 1)
117 t->bucketPtr = hp = (struct Hash_Entry **)emalloc(sizeof(*hp) * i);
123 *---------------------------------------------------------
125 * Hash_DeleteTable --
127 * This routine removes everything from a hash table
128 * and frees up the memory space it occupied (except for
129 * the space in the Hash_Table structure).
135 * Lots of memory is freed up.
137 *---------------------------------------------------------
141 Hash_DeleteTable(Hash_Table *t)
143 struct Hash_Entry **hp, *h, *nexth = NULL;
146 for (hp = t->bucketPtr, i = t->size; --i >= 0;) {
147 for (h = *hp++; h != NULL; h = nexth) {
152 free((char *)t->bucketPtr);
155 * Set up the hash table to cause memory faults on any future access
156 * attempts until re-initialization.
162 *---------------------------------------------------------
166 * Searches a hash table for an entry corresponding to key.
170 * Hash table to be searched.
175 * The return value is a pointer to the entry for key,
176 * if key was present in the table. If key was not
177 * present, NULL is returned.
182 *---------------------------------------------------------
186 Hash_FindEntry(Hash_Table *t, char *key)
192 for (h = 0, p = key; *p;)
193 h = (h << 5) - h + *p++;
195 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next)
196 if (e->namehash == h && strcmp(e->name, p) == 0)
202 *---------------------------------------------------------
204 * Hash_CreateEntry --
206 * Searches a hash table for an entry corresponding to
207 * key. If no entry is found, then one is created.
211 * Hash table to be searched.
215 * Filled in with TRUE if new entry created, FALSE otherwise.
218 * The return value is a pointer to the entry. If *newPtr
219 * isn't NULL, then *newPtr is filled in with TRUE if a
220 * new entry was created, and FALSE if an entry already existed
221 * with the given key.
224 * Memory may be allocated, and the hash buckets may be modified.
225 *---------------------------------------------------------
229 Hash_CreateEntry(Hash_Table *t, char *key, Boolean *newPtr)
235 struct Hash_Entry **hp;
238 * Hash the key. As a side effect, save the length (strlen) of the
239 * key in case we need to create the entry.
241 for (h = 0, p = key; *p;)
242 h = (h << 5) - h + *p++;
245 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) {
246 if (e->namehash == h && strcmp(e->name, p) == 0) {
254 * The desired entry isn't there. Before allocating a new entry,
255 * expand the table if necessary (and this changes the resulting
258 if (t->numEntries >= rebuildLimit * t->size)
260 e = (Hash_Entry *) emalloc(sizeof(*e) + keylen);
261 hp = &t->bucketPtr[h & t->mask];
264 e->clientData = NULL;
275 *---------------------------------------------------------
277 * Hash_DeleteEntry --
279 * Delete the given hash table entry and free memory associated with it.
285 * Hash chain that entry lives in is modified and memory is freed.
287 *---------------------------------------------------------
291 Hash_DeleteEntry(Hash_Table *t, Hash_Entry *e)
297 for (hp = &t->bucketPtr[e->namehash & t->mask];
298 (p = *hp) != NULL; hp = &p->next) {
306 write(2, "bad call to Hash_DeleteEntry\n", 29);
311 *---------------------------------------------------------
314 * This procedure sets things up for a complete search
315 * of all entries recorded in the hash table.
319 * Hash table to be searched.
320 * Hash_Search *searchPtr
321 * Area in which to keep state about search.
324 * The return value is the address of the first entry in
325 * the hash table, or NULL if the table is empty.
328 * The information in searchPtr is initialized so that successive
329 * calls to Hash_Next will return successive HashEntry's
332 *---------------------------------------------------------
336 Hash_EnumFirst(Hash_Table *t, Hash_Search *searchPtr)
338 searchPtr->tablePtr = t;
339 searchPtr->nextIndex = 0;
340 searchPtr->hashEntryPtr = NULL;
341 return Hash_EnumNext(searchPtr);
345 *---------------------------------------------------------
348 * This procedure returns successive entries in the hash table.
351 * Hash_Search *searchPtr
352 * Area in which to keep state about search.
355 * The return value is a pointer to the next HashEntry
356 * in the table, or NULL when the end of the table is
360 * The information in searchPtr is modified to advance to the
363 *---------------------------------------------------------
367 Hash_EnumNext(Hash_Search *searchPtr)
370 Hash_Table *t = searchPtr->tablePtr;
373 * The hashEntryPtr field points to the most recently returned
374 * entry, or is nil if we are starting up. If not nil, we have
375 * to start at the next one in the chain.
377 e = searchPtr->hashEntryPtr;
381 * If the chain ran out, or if we are starting up, we need to
382 * find the next nonempty chain.
385 if (searchPtr->nextIndex >= t->size)
387 e = t->bucketPtr[searchPtr->nextIndex++];
389 searchPtr->hashEntryPtr = e;
394 *---------------------------------------------------------
397 * This local routine makes a new hash table that
398 * is larger than the old one.
404 * The entire hash table is moved, so any bucket numbers
405 * from the old table are invalid.
407 *---------------------------------------------------------
411 RebuildTable(Hash_Table *t)
413 Hash_Entry *e, *next = NULL, **hp, **xp;
418 oldhp = t->bucketPtr;
419 oldsize = i = t->size;
422 t->mask = mask = i - 1;
423 t->bucketPtr = hp = (struct Hash_Entry **) emalloc(sizeof(*hp) * i);
426 for (hp = oldhp, i = oldsize; --i >= 0;) {
427 for (e = *hp++; e != NULL; e = next) {
429 xp = &t->bucketPtr[e->namehash & mask];