dd5eca7fca357811d2fecf47a9f9d4ce5673df9e
1 /**************************************************************************
3 * Copyright 2008 Tungsten Graphics, Inc., Cedar Park, Texas.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
30 * General purpose hash table implementation.
32 * Just uses the cso_hash for now, but it might be better switch to a linear
33 * probing hash table implementation at some point -- as it is said they have
34 * better lookup and cache performance and it appears to be possible to write
35 * a lock-free implementation of such hash tables .
37 * @author José Fonseca <jrfonseca@tungstengraphics.com>
41 #include "pipe/p_compiler.h"
42 #include "pipe/p_debug.h"
43 #include "pipe/p_util.h"
45 #include "cso_cache/cso_hash.h"
46 #include "u_hash_table.h"
54 unsigned (*hash
)(void *key
);
56 /** Compare two keys */
57 int (*compare
)(void *key1
, void *key2
);
59 /* TODO: key, value destructors? */
63 struct hash_table_item
70 static INLINE
struct hash_table_item
*
71 hash_table_item(struct cso_hash_iter iter
)
73 return (struct hash_table_item
*)cso_hash_iter_data(iter
);
78 hash_table_create(unsigned (*hash
)(void *key
),
79 int (*compare
)(void *key1
, void *key2
))
81 struct hash_table
*ht
;
83 ht
= MALLOC_STRUCT(hash_table
);
87 ht
->cso
= cso_hash_create();
94 ht
->compare
= compare
;
100 static INLINE
struct cso_hash_iter
101 hash_table_find_iter(struct hash_table
*ht
,
105 struct cso_hash_iter iter
;
106 struct hash_table_item
*item
;
108 iter
= cso_hash_find(ht
->cso
, key_hash
);
109 while (!cso_hash_iter_is_null(iter
)) {
110 item
= (struct hash_table_item
*)cso_hash_iter_data(iter
);
111 if (!ht
->compare(item
->key
, key
))
113 iter
= cso_hash_iter_next(iter
);
120 static INLINE
struct hash_table_item
*
121 hash_table_find_item(struct hash_table
*ht
,
125 struct cso_hash_iter iter
;
126 struct hash_table_item
*item
;
128 iter
= cso_hash_find(ht
->cso
, key_hash
);
129 while (!cso_hash_iter_is_null(iter
)) {
130 item
= (struct hash_table_item
*)cso_hash_iter_data(iter
);
131 if (!ht
->compare(item
->key
, key
))
133 iter
= cso_hash_iter_next(iter
);
141 hash_table_set(struct hash_table
*ht
,
146 struct hash_table_item
*item
;
147 struct cso_hash_iter iter
;
151 key_hash
= ht
->hash(key
);
153 item
= hash_table_find_item(ht
, key
, key_hash
);
155 /* TODO: key/value destruction? */
160 item
= MALLOC_STRUCT(hash_table_item
);
162 return PIPE_ERROR_OUT_OF_MEMORY
;
167 iter
= cso_hash_insert(ht
->cso
, key_hash
, item
);
168 if(cso_hash_iter_is_null(iter
)) {
170 return PIPE_ERROR_OUT_OF_MEMORY
;
178 hash_table_get(struct hash_table
*ht
,
182 struct hash_table_item
*item
;
186 key_hash
= ht
->hash(key
);
188 item
= hash_table_find_item(ht
, key
, key_hash
);
197 hash_table_remove(struct hash_table
*ht
,
201 struct cso_hash_iter iter
;
202 struct hash_table_item
*item
;
206 key_hash
= ht
->hash(key
);
208 iter
= hash_table_find_iter(ht
, key
, key_hash
);
209 if(cso_hash_iter_is_null(iter
))
212 item
= hash_table_item(iter
);
216 cso_hash_erase(ht
->cso
, iter
);
221 hash_table_clear(struct hash_table
*ht
)
223 struct cso_hash_iter iter
;
224 struct hash_table_item
*item
;
228 iter
= cso_hash_first_node(ht
->cso
);
229 while (!cso_hash_iter_is_null(iter
)) {
230 item
= (struct hash_table_item
*)cso_hash_take(ht
->cso
, cso_hash_iter_key(iter
));
232 iter
= cso_hash_first_node(ht
->cso
);
238 hash_table_foreach(struct hash_table
*ht
,
239 enum pipe_error (*callback
)(void *key
, void *value
, void *data
),
242 struct cso_hash_iter iter
;
243 struct hash_table_item
*item
;
244 enum pipe_error result
;
248 iter
= cso_hash_first_node(ht
->cso
);
249 while (!cso_hash_iter_is_null(iter
)) {
250 item
= (struct hash_table_item
*)cso_hash_iter_data(iter
);
251 result
= callback(item
->key
, item
->value
, data
);
252 if(result
!= PIPE_OK
)
254 iter
= cso_hash_iter_next(iter
);
262 hash_table_destroy(struct hash_table
*ht
)
264 struct cso_hash_iter iter
;
265 struct hash_table_item
*item
;
269 iter
= cso_hash_first_node(ht
->cso
);
270 while (!cso_hash_iter_is_null(iter
)) {
271 item
= (struct hash_table_item
*)cso_hash_iter_data(iter
);
273 iter
= cso_hash_iter_next(iter
);
276 cso_hash_delete(ht
->cso
);