1
/* An expandable hash tables datatype.
2
Copyright (C) 1999, 2000, 2002 Free Software Foundation, Inc.
3
Contributed by Vladimir Makarov (vmakarov@cygnus.com).
5
This program is free software; you can redistribute it and/or modify
6
it under the terms of the GNU General Public License as published by
7
the Free Software Foundation; either version 2 of the License, or
8
(at your option) any later version.
10
This program is distributed in the hope that it will be useful,
11
but WITHOUT ANY WARRANTY; without even the implied warranty of
12
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13
GNU General Public License for more details.
15
You should have received a copy of the GNU General Public License
16
along with this program; if not, write to the Free Software
17
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
19
/* This package implements basic hash table functionality. It is possible
20
to search for an entry, create an entry and destroy an entry.
22
Elements in the table are generic pointers.
24
The size of the table is not fixed; if the occupancy of the table
25
grows too high the hash table will be expanded.
27
The abstract data implementation is based on generalized Algorithm D
28
from Knuth's book "The art of computer programming". Hash table is
29
expanded by creation of new hash table and transferring elements from
30
the old table to the new table. */
37
#endif /* __cplusplus */
45
/* The type for a hash code. */
46
typedef unsigned int hashval_t;
48
/* Callback function pointer types. */
50
/* Calculate hash of a table entry. */
51
typedef hashval_t (*htab_hash) PARAMS ((const void *));
53
/* Compare a table entry with a possible entry. The entry already in
54
the table always comes first, so the second element can be of a
55
different type (but in this case htab_find and htab_find_slot
56
cannot be used; instead the variants that accept a hash value
58
typedef int (*htab_eq) PARAMS ((const void *, const void *));
60
/* Cleanup function called whenever a live element is removed from
62
typedef void (*htab_del) PARAMS ((void *));
64
/* Function called by htab_traverse for each live element. The first
65
arg is the slot of the element (which can be passed to htab_clear_slot
66
if desired), the second arg is the auxiliary pointer handed to
67
htab_traverse. Return 1 to continue scan, 0 to stop. */
68
typedef int (*htab_trav) PARAMS ((void **, void *));
70
/* Memory-allocation function, with the same functionality as calloc().
71
Iff it returns NULL, the hash table implementation will pass an error
72
code back to the user, so if your code doesn't handle errors,
73
best if you use xcalloc instead. */
74
typedef PTR (*htab_alloc) PARAMS ((size_t, size_t));
76
/* We also need a free() routine. */
77
typedef void (*htab_free) PARAMS ((PTR));
79
/* Hash tables are of the following type. The structure
80
(implementation) of this type is not needed for using the hash
81
tables. All work with hash table should be executed only through
82
functions mentioned below. */
86
/* Pointer to hash function. */
89
/* Pointer to comparison function. */
92
/* Pointer to cleanup function. */
96
PTR * GTY ((use_param (""), length ("%h.size"))) entries;
98
/* Current size (in entries) of the hash table */
101
/* Current number of elements including also deleted elements */
104
/* Current number of deleted elements in the table */
107
/* The following member is used for debugging. Its value is number
108
of all calls of `htab_find_slot' for the hash table. */
109
unsigned int searches;
111
/* The following member is used for debugging. Its value is number
112
of collisions fixed for time of work with the hash table. */
113
unsigned int collisions;
115
/* Pointers to allocate/free functions. */
120
typedef struct htab *htab_t;
122
/* An enum saying whether we insert into the hash table or not. */
123
enum insert_option {NO_INSERT, INSERT};
125
/* The prototypes of the package functions. */
127
extern htab_t htab_create_alloc PARAMS ((size_t, htab_hash,
129
htab_alloc, htab_free));
131
/* Backward-compatibility functions. */
132
extern htab_t htab_create PARAMS ((size_t, htab_hash, htab_eq, htab_del));
133
extern htab_t htab_try_create PARAMS ((size_t, htab_hash, htab_eq, htab_del));
135
extern void htab_delete PARAMS ((htab_t));
136
extern void htab_empty PARAMS ((htab_t));
138
extern PTR htab_find PARAMS ((htab_t, const void *));
139
extern PTR *htab_find_slot PARAMS ((htab_t, const void *,
140
enum insert_option));
141
extern PTR htab_find_with_hash PARAMS ((htab_t, const void *,
143
extern PTR *htab_find_slot_with_hash PARAMS ((htab_t, const void *,
145
enum insert_option));
146
extern void htab_clear_slot PARAMS ((htab_t, void **));
147
extern void htab_remove_elt PARAMS ((htab_t, void *));
149
extern void htab_traverse PARAMS ((htab_t, htab_trav, void *));
151
extern size_t htab_size PARAMS ((htab_t));
152
extern size_t htab_elements PARAMS ((htab_t));
153
extern double htab_collisions PARAMS ((htab_t));
155
/* A hash function for pointers. */
156
extern htab_hash htab_hash_pointer;
158
/* An equality function for pointers. */
159
extern htab_eq htab_eq_pointer;
161
/* A hash function for null-terminated strings. */
162
extern hashval_t htab_hash_string PARAMS ((const PTR));
166
#endif /* __cplusplus */
168
#endif /* __HASHTAB_H */