2 * Copyright © 2009,2012 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 * Eric Anholt <eric@anholt.net>
34 #include "c99_compat.h"
48 struct hash_entry
*table
;
49 uint32_t (*key_hash_function
)(const void *key
);
50 bool (*key_equals_function
)(const void *a
, const void *b
);
51 const void *deleted_key
;
57 uint32_t deleted_entries
;
61 _mesa_hash_table_create(void *mem_ctx
,
62 uint32_t (*key_hash_function
)(const void *key
),
63 bool (*key_equals_function
)(const void *a
,
66 _mesa_hash_table_clone(struct hash_table
*src
, void *dst_mem_ctx
);
67 void _mesa_hash_table_destroy(struct hash_table
*ht
,
68 void (*delete_function
)(struct hash_entry
*entry
));
69 void _mesa_hash_table_clear(struct hash_table
*ht
,
70 void (*delete_function
)(struct hash_entry
*entry
));
71 void _mesa_hash_table_set_deleted_key(struct hash_table
*ht
,
72 const void *deleted_key
);
74 static inline uint32_t _mesa_hash_table_num_entries(struct hash_table
*ht
)
80 _mesa_hash_table_insert(struct hash_table
*ht
, const void *key
, void *data
);
82 _mesa_hash_table_insert_pre_hashed(struct hash_table
*ht
, uint32_t hash
,
83 const void *key
, void *data
);
85 _mesa_hash_table_search(struct hash_table
*ht
, const void *key
);
87 _mesa_hash_table_search_pre_hashed(struct hash_table
*ht
, uint32_t hash
,
89 void _mesa_hash_table_remove(struct hash_table
*ht
,
90 struct hash_entry
*entry
);
91 void _mesa_hash_table_remove_key(struct hash_table
*ht
,
94 struct hash_entry
*_mesa_hash_table_next_entry(struct hash_table
*ht
,
95 struct hash_entry
*entry
);
97 _mesa_hash_table_random_entry(struct hash_table
*ht
,
98 bool (*predicate
)(struct hash_entry
*entry
));
100 uint32_t _mesa_hash_data(const void *data
, size_t size
);
101 uint32_t _mesa_hash_string(const void *key
);
102 bool _mesa_key_string_equal(const void *a
, const void *b
);
103 bool _mesa_key_pointer_equal(const void *a
, const void *b
);
105 static inline uint32_t _mesa_key_hash_string(const void *key
)
107 return _mesa_hash_string((const char *)key
);
110 static inline uint32_t _mesa_hash_pointer(const void *pointer
)
112 uintptr_t num
= (uintptr_t) pointer
;
113 return (uint32_t) ((num
>> 2) ^ (num
>> 6) ^ (num
>> 10) ^ (num
>> 14));
117 _mesa_fnv32_1a_offset_bias
= 2166136261u,
120 static inline uint32_t
121 _mesa_fnv32_1a_accumulate_block(uint32_t hash
, const void *data
, size_t size
)
123 const uint8_t *bytes
= (const uint8_t *)data
;
125 while (size
-- != 0) {
127 hash
= hash
* 0x01000193;
134 #define _mesa_fnv32_1a_accumulate(hash, expr) \
135 _mesa_fnv32_1a_accumulate_block(hash, &(expr), sizeof(expr))
138 * This foreach function is safe against deletion (which just replaces
139 * an entry's data with the deleted marker), but not against insertion
140 * (which may rehash the table, making entry a dangling pointer).
142 #define hash_table_foreach(ht, entry) \
143 for (entry = _mesa_hash_table_next_entry(ht, NULL); \
145 entry = _mesa_hash_table_next_entry(ht, entry))
148 hash_table_call_foreach(struct hash_table
*ht
,
149 void (*callback
)(const void *key
,
154 struct hash_entry
*entry
;
156 hash_table_foreach(ht
, entry
)
157 callback(entry
->key
, entry
->data
, closure
);
161 * Hash table wrapper which supports 64-bit keys.
163 struct hash_table_u64
{
164 struct hash_table
*table
;
165 void *deleted_key_data
;
168 struct hash_table_u64
*
169 _mesa_hash_table_u64_create(void *mem_ctx
);
172 _mesa_hash_table_u64_destroy(struct hash_table_u64
*ht
,
173 void (*delete_function
)(struct hash_entry
*entry
));
176 _mesa_hash_table_u64_insert(struct hash_table_u64
*ht
, uint64_t key
,
180 _mesa_hash_table_u64_search(struct hash_table_u64
*ht
, uint64_t key
);
183 _mesa_hash_table_u64_remove(struct hash_table_u64
*ht
, uint64_t key
);
189 #endif /* _HASH_TABLE_H */