* Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
* Copyright (c) 1988, 1989 by Adam de Boor
* Copyright (c) 1989 by Berkeley Softworks
* This code is derived from software contributed to Berkeley by
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
static char sccsid
[] = "@(#)hash.c 5.5 (Berkeley) 12/28/90";
* This module contains routines to manipulate a hash table.
* See hash.h for a definition of the structure of the hash
* table. Hash tables grow automatically as the amount of
* Forward references to local procedures that are used before they're
static void RebuildTable();
* The following defines the ratio of # entries to # buckets
* at which we rebuild the table to make it larger.
*---------------------------------------------------------
* This routine just sets up the hash table.
* Memory is allocated for the initial bucket area.
*---------------------------------------------------------
Hash_InitTable(t
, numBuckets
)
register Hash_Table
*t
; /* Structure to use to hold table. */
int numBuckets
; /* How many buckets to create for starters.
* This number is rounded up to a power of
* two. If <= 0, a reasonable default is
* chosen. The table will grow in size later
register struct Hash_Entry
**hp
;
* Round up the size to a power of two.
for (i
= 2; i
< numBuckets
; i
<<= 1)
t
->bucketPtr
= hp
= (struct Hash_Entry
**)emalloc(sizeof(*hp
) * i
);
*---------------------------------------------------------
* This routine removes everything from a hash table
* and frees up the memory space it occupied (except for
* the space in the Hash_Table structure).
* Lots of memory is freed up.
*---------------------------------------------------------
register struct Hash_Entry
**hp
, *h
, *nexth
;
for (hp
= t
->bucketPtr
, i
= t
->size
; --i
>= 0;) {
for (h
= *hp
++; h
!= NULL
; h
= nexth
) {
free((char *)t
->bucketPtr
);
* Set up the hash table to cause memory faults on any future access
* attempts until re-initialization.
*---------------------------------------------------------
* Searches a hash table for an entry corresponding to key.
* The return value is a pointer to the entry for key,
* if key was present in the table. If key was not
* present, NULL is returned.
*---------------------------------------------------------
Hash_Table
*t
; /* Hash table to search. */
char *key
; /* A hash key. */
for (h
= 0, p
= key
; *p
;)
for (e
= t
->bucketPtr
[h
& t
->mask
]; e
!= NULL
; e
= e
->next
)
if (e
->namehash
== h
&& strcmp(e
->name
, p
) == 0)
*---------------------------------------------------------
* Searches a hash table for an entry corresponding to
* key. If no entry is found, then one is created.
* The return value is a pointer to the entry. If *newPtr
* isn't NULL, then *newPtr is filled in with TRUE if a
* new entry was created, and FALSE if an entry already existed
* Memory may be allocated, and the hash buckets may be modified.
*---------------------------------------------------------
Hash_CreateEntry(t
, key
, newPtr
)
register Hash_Table
*t
; /* Hash table to search. */
char *key
; /* A hash key. */
Boolean
*newPtr
; /* Filled in with TRUE if new entry created,
* Hash the key. As a side effect, save the length (strlen) of the
* key in case we need to create the entry.
for (h
= 0, p
= key
; *p
;)
for (e
= t
->bucketPtr
[h
& t
->mask
]; e
!= NULL
; e
= e
->next
) {
if (e
->namehash
== h
&& strcmp(e
->name
, p
) == 0) {
* The desired entry isn't there. Before allocating a new entry,
* expand the table if necessary (and this changes the resulting
if (t
->numEntries
>= rebuildLimit
* t
->size
)
e
= (Hash_Entry
*) emalloc(sizeof(*e
) + keylen
);
hp
= &t
->bucketPtr
[h
& t
->mask
];
(void) strcpy(e
->name
, p
);
*---------------------------------------------------------
* Delete the given hash table entry and free memory associated with
* Hash chain that entry lives in is modified and memory is freed.
*---------------------------------------------------------
register Hash_Entry
**hp
, *p
;
for (hp
= &t
->bucketPtr
[e
->namehash
& t
->mask
];
(p
= *hp
) != NULL
; hp
= &p
->next
) {
(void) write(2, "bad call to Hash_DeleteEntry\n", 29);
*---------------------------------------------------------
* This procedure sets things up for a complete search
* of all entries recorded in the hash table.
* The return value is the address of the first entry in
* the hash table, or NULL if the table is empty.
* The information in searchPtr is initialized so that successive
* calls to Hash_Next will return successive HashEntry's
*---------------------------------------------------------
Hash_EnumFirst(t
, searchPtr
)
Hash_Table
*t
; /* Table to be searched. */
register Hash_Search
*searchPtr
;/* Area in which to keep state
searchPtr
->nextIndex
= 0;
searchPtr
->hashEntryPtr
= NULL
;
return Hash_EnumNext(searchPtr
);
*---------------------------------------------------------
* This procedure returns successive entries in the hash table.
* The return value is a pointer to the next HashEntry
* in the table, or NULL when the end of the table is
* The information in searchPtr is modified to advance to the
*---------------------------------------------------------
register Hash_Search
*searchPtr
; /* Area used to keep state about
Hash_Table
*t
= searchPtr
->tablePtr
;
* The hashEntryPtr field points to the most recently returned
* entry, or is nil if we are starting up. If not nil, we have
* to start at the next one in the chain.
e
= searchPtr
->hashEntryPtr
;
* If the chain ran out, or if we are starting up, we need to
* find the next nonempty chain.
if (searchPtr
->nextIndex
>= t
->size
)
e
= t
->bucketPtr
[searchPtr
->nextIndex
++];
searchPtr
->hashEntryPtr
= e
;
*---------------------------------------------------------
* This local routine makes a new hash table that
* is larger than the old one.
* The entire hash table is moved, so any bucket numbers
* from the old table are invalid.
*---------------------------------------------------------
register Hash_Entry
*e
, *next
, **hp
, **xp
;
register Hash_Entry
**oldhp
;
t
->bucketPtr
= hp
= (struct Hash_Entry
**) emalloc(sizeof(*hp
) * i
);
for (hp
= oldhp
, i
= oldsize
; --i
>= 0;) {
for (e
= *hp
++; e
!= NULL
; e
= next
) {
xp
= &t
->bucketPtr
[e
->namehash
& mask
];