3 * $Id: hash.h,v 1.3 2000/06/17 10:37:39 mdw Exp $
5 * General hashtable infrastructure
7 * (c) 1999 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of the mLib utilities library.
14 * mLib is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * mLib is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with mLib; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Revision history --------------------------------------------------*
33 * Revision 1.3 2000/06/17 10:37:39 mdw
34 * Add support for arena management.
36 * Revision 1.2 1999/12/10 23:42:04 mdw
37 * Change header file guard names.
39 * Revision 1.1 1999/08/02 14:45:48 mdw
40 * Break low-level hashtable code out from sym.
51 /*----- Notes -------------------------------------------------------------*
53 * This isn't a complete implementation of anything. It's a collection of
54 * useful types and functions which will help when building hashtables of
55 * things. The general-purpose hashtable is provided by the @sym@ functions.
58 /*----- Header files ------------------------------------------------------*/
70 /*----- Data structures ---------------------------------------------------*/
72 /* --- Hashtable basics --- *
74 * This contains the bare minimum to actually get anything useful done. In
75 * particular it doesn't maintain any weighting information: when to extend
76 * the table is left up to the particular implementation.
79 typedef struct hash_table
{
80 uint32 mask
; /* Bit mask of hash bits */
81 struct hash_base
**v
; /* Vector of hash bins */
82 arena
*a
; /* Allocation arena */
85 /* --- A hashtable entry --- *
87 * This is the bare minimum of what needs to be remembered in each hashtable
88 * entry. Comparison of elements is left to the implementation, so I don't
89 * need to know anything about how to represent hash keys here.
92 typedef struct hash_base
{
93 struct hash_base
*next
; /* Next entry in hash bin */
94 uint32 hash
; /* Hash value for this entry */
97 /* --- A hashtable iterator --- */
99 typedef struct hash_iter
{
100 hash_table
*t
; /* Hashtable being iterated */
101 hash_base
*p
; /* Address of next item to return */
102 size_t i
; /* Index of next hash bin to use */
105 /*----- Functions provided ------------------------------------------------*/
107 /* --- @hash_create@ --- *
109 * Arguments: @hash_table *t@ = pointer to hashtable to initialize
110 * @size_t n@ = number of bins to allocate (zero initially)
114 * Use: Initializes a hashtable with a given number of bins. The
115 * bins are initially empty. The number of bins must be a power
116 * of two. This is not checked.
119 extern void hash_create(hash_table */
*t*/
, size_t /*n*/);
121 /* --- @hash_destroy@ --- *
123 * Arguments: @hash_table *t@ = pointer to hashtable to destroy
127 * Use: Frees a hashtable. The items are not freed: they are the
128 * responsibility of the implementation.
131 extern void hash_destroy(hash_table */
*t*/
);
133 /* --- @hash_bin@ --- *
135 * Arguments: @hash_table *t@ = pointer to hashtable
136 * @uint32 hash@ = hash value to look up
138 * Returns: Pointer to the bin's list head.
140 * Use: Given a hash value return the address of the appropriate list
141 * head. It is safe to remove the current entry from the table.
144 #define HASH_BIN(t, hash) ((t)->v + ((hash) & (t)->mask))
146 extern hash_base
**hash_bin(hash_table */
*t*/
, uint32
/*hash*/);
148 /* --- @hash_extend@ --- *
150 * Arguments: @hash_table *t@ = pointer to hashtable to extend
152 * Returns: Nonzero if extension was successful.
154 * Use: Extends a hashtable. The number of bins is doubled and the
155 * entries are redistributed.
158 extern int hash_extend(hash_table */
*t*/
);
160 /* --- @hash_remove@ --- *
162 * Arguments: @hash_table *t@ = pointer to hashtable
163 * @hash_base *p@ = pointer to item to remove
167 * Use: Removes an item from a hashtable. The item itself is not
168 * freed, although it is removed from the data structure and is
172 extern void hash_remove(hash_table */
*t*/
, hash_base */
*p*/
);
174 /* --- @hash_mkiter@ --- *
176 * Arguments: @hash_iter *i@ = pointer to iterator to create
177 * @hash_table *t@ = pointer to hashtable to iterate
181 * Use: Initializes a hashtable iterator.
184 #define HASH_MKITER(i_, t_) ((i_)->t = (t_), (i_)->p = 0, (i_)->i = 0)
186 extern void hash_mkiter(hash_iter */
*i*/
, hash_table */
*t*/
);
188 /* --- @hash_next@ --- *
190 * Arguments: @hash_iter *i@ = pointer to iterator
192 * Returns: Pointer to the next hashtable entry found, or null.
194 * Use: Returns the next entry from the hashtable.
197 #define HASH_NEXT(i_, b_) do { \
198 hash_iter *_i = (i_); \
200 hash_table *_t = _i->t; \
201 uint32 _m = _t->mask; \
208 } else if (_i->i > _m) { \
212 _i->p = _t->v[_i->i++]; \
217 extern hash_base
*hash_next(hash_iter */
*i*/
);
219 /*----- That's all, folks -------------------------------------------------*/