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,
65 void _mesa_hash_table_destroy(struct hash_table *ht,
66 void (*delete_function)(struct hash_entry *entry));
67 void _mesa_hash_table_clear(struct hash_table *ht,
68 void (*delete_function)(struct hash_entry *entry));
69 void _mesa_hash_table_set_deleted_key(struct hash_table *ht,
70 const void *deleted_key);
72 static inline uint32_t _mesa_hash_table_num_entries(struct hash_table *ht)
78 _mesa_hash_table_insert(struct hash_table *ht, const void *key, void *data);
80 _mesa_hash_table_insert_pre_hashed(struct hash_table *ht, uint32_t hash,
81 const void *key, void *data);
83 _mesa_hash_table_search(struct hash_table *ht, const void *key);
85 _mesa_hash_table_search_pre_hashed(struct hash_table *ht, uint32_t hash,
87 void _mesa_hash_table_remove(struct hash_table *ht,
88 struct hash_entry *entry);
90 struct hash_entry *_mesa_hash_table_next_entry(struct hash_table *ht,
91 struct hash_entry *entry);
93 _mesa_hash_table_random_entry(struct hash_table *ht,
94 bool (*predicate)(struct hash_entry *entry));
96 uint32_t _mesa_hash_data(const void *data, size_t size);
97 uint32_t _mesa_hash_string(const char *key);
98 bool _mesa_key_string_equal(const void *a, const void *b);
99 bool _mesa_key_pointer_equal(const void *a, const void *b);
101 static inline uint32_t _mesa_key_hash_string(const void *key)
103 return _mesa_hash_string((const char *)key);
106 static inline uint32_t _mesa_hash_pointer(const void *pointer)
108 return _mesa_hash_data(&pointer, sizeof(pointer));
112 _mesa_fnv32_1a_offset_bias = 2166136261u,
115 static inline uint32_t
116 _mesa_fnv32_1a_accumulate_block(uint32_t hash, const void *data, size_t size)
118 const uint8_t *bytes = (const uint8_t *)data;
120 while (size-- != 0) {
122 hash = hash * 0x01000193;
129 #define _mesa_fnv32_1a_accumulate(hash, expr) \
130 _mesa_fnv32_1a_accumulate_block(hash, &(expr), sizeof(expr))
133 * This foreach function is safe against deletion (which just replaces
134 * an entry's data with the deleted marker), but not against insertion
135 * (which may rehash the table, making entry a dangling pointer).
137 #define hash_table_foreach(ht, entry) \
138 for (entry = _mesa_hash_table_next_entry(ht, NULL); \
140 entry = _mesa_hash_table_next_entry(ht, entry))
143 hash_table_call_foreach(struct hash_table *ht,
144 void (*callback)(const void *key,
149 struct hash_entry *entry;
151 hash_table_foreach(ht, entry)
152 callback(entry->key, entry->data, closure);
159 #endif /* _HASH_TABLE_H */