1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
/*
* Copyright (c) 1999 The University of Utah and the Flux Group.
* All rights reserved.
*
* Contributed by the Computer Security Research division,
* INFOSEC Research and Technology Office, NSA.
*
* This file is part of the Flux OSKit. The OSKit is free software, also known
* as "open source;" you can redistribute it and/or modify it under the terms
* of the GNU General Public License (GPL), version 2, as published by the Free
* Software Foundation (FSF). To explore alternate licensing terms, contact
* the University of Utah at csl-dist@cs.utah.edu or +1-801-585-3271.
*
* The OSKit is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GPL for more details. You should have
* received a copy of the GPL along with the OSKit; see the file COPYING. If
* not, write to the FSF, 59 Temple Place #330, Boston, MA 02111-1307, USA.
*/
/*
hashtab.h
Definition of a generic hash table type.
A hash table establishes an association between a set
of key values and a set of datum values. Each entry in
the hash table is a (key,datum) pair. Keys must uniquely
identify an entry in the hash table.
Keys and datums are pointers to objects of any type.
The datum types may vary for different objects within
the same hash table.
Collision resolution is performed using chaining.
*/
#ifndef _HASHTAB_H_
#define _HASHTAB_H_
typedef char* hashtab_key_t; /* generic key type */
typedef void* hashtab_datum_t; /* generic datum type */
/*
A node in a hash table is a (key,datum) pair.
*/
typedef struct hashtab_node_t* hashtab_ptr_t;
struct hashtab_node_t
{
hashtab_key_t key;
hashtab_datum_t datum;
hashtab_ptr_t next; /* link to next node in chain */
};
/*
A hash table is implemented as a record containing:
an array of pointers to chains of nodes (htable)
the number of slots in the array (size)
the hash function to be used (hash_value)
the comparison function for keys (keycmp)
The two functions, hash_value and keycmp, are defined when
a new hash table is created so that the hash table code need
not depend upon the types of the keys.
keycmp is expected to have the same semantics as strcmp,
although the implementation only requires the ability to
distinguish between equal keys and nonequal keys.
*/
typedef struct
{
hashtab_ptr_t *htable;
unsigned int size;
unsigned int (*hash_value)(hashtab_key_t key);
int (*keycmp)(hashtab_key_t key1, hashtab_key_t key2);
} hashtab_val_t;
typedef hashtab_val_t* hashtab_t;
/* Define status codes for hash table functions */
#define HASHTAB_SUCCESS 0
#define HASHTAB_OVERFLOW -ENOMEM
#define HASHTAB_PRESENT -EEXIST
#define HASHTAB_MISSING -ENOENT
/*
Creates a new hash table with the specified characteristics.
Returns NULL if insufficent space is available or
the new hash table otherwise.
*/
hashtab_t hashtab_create(unsigned int (*hash_value)(hashtab_key_t key),
int (*keycmp)(hashtab_key_t key1,
hashtab_key_t key2),
unsigned int size);
/*
Inserts the specified (key, datum) pair into the specified hash table.
Returns HASHTAB_OVERFLOW if insufficient space is available or
HASHTAB_PRESENT if there is already an entry with the same key or
HASHTAB_SUCCESS otherwise.
*/
int hashtab_insert(hashtab_t h, hashtab_key_t k, hashtab_datum_t d);
/*
Removes the entry with the specified key from the hash table.
Applies the specified destroy function to (key,datum,args) for
the entry.
Returns HASHTAB_MISSING if no entry has the specified key or
HASHTAB_SUCCESS otherwise.
*/
int hashtab_remove(hashtab_t h, hashtab_key_t k,
void (*destroy)(hashtab_key_t k,
hashtab_datum_t d,
void *args),
void *args);
/*
Insert or replace the specified (key, datum) pair in the specified
hash table. If an entry for the specified key already exists,
then the specified destroy function is applied to (key,datum,args)
for the entry prior to replacing the entry's contents.
Returns HASHTAB_OVERFLOW if insufficient space is available or
HASHTAB_SUCCESS otherwise.
*/
int hashtab_replace(hashtab_t h, hashtab_key_t k, hashtab_datum_t d,
void (*destroy)(hashtab_key_t k,
hashtab_datum_t d,
void *args),
void *args);
/*
Searches for the entry with the specified key in the hash table.
Returns NULL if no entry has the specified key or
the datum of the entry otherwise.
*/
hashtab_datum_t hashtab_search(hashtab_t h, hashtab_key_t k);
/*
Destroys the specified hash table.
Note that this function does not destroy the keys and datums
stored in the specified hash table, since keys and datums were
allocated by the caller before insertion.
*/
void hashtab_destroy(hashtab_t h);
/*
Applies the specified apply function to (key,datum,args)
for each entry in the specified hash table.
The order in which the function is applied to the entries
is dependent upon the internal structure of the hash table.
If apply returns a non-zero status, then hashtab_map will cease
iterating through the hash table and will propagate the error
return to its caller.
*/
int hashtab_map(hashtab_t h,
int (*apply)(hashtab_key_t k,
hashtab_datum_t d,
void *args),
void *args);
/*
Same as hashtab_map, except that if apply returns a non-zero status,
then the (key,datum) pair will be removed from the hashtab and the
destroy function will be applied to (key,datum,args).
*/
void hashtab_map_remove_on_error(hashtab_t h,
int (*apply)(hashtab_key_t k,
hashtab_datum_t d,
void *args),
void (*destroy)(hashtab_key_t k,
hashtab_datum_t d,
void *args),
void *args);
#endif
|
