06c1be4a639cee17a3de6024ca794b7f54a50a09
5 * Used for display lists, texture objects, vertex/fragment programs,
6 * buffer objects, etc. The hash functions are thread-safe.
8 * \note key=0 is illegal.
14 * Mesa 3-D graphics library
16 * Copyright (C) 1999-2006 Brian Paul All Rights Reserved.
18 * Permission is hereby granted, free of charge, to any person obtaining a
19 * copy of this software and associated documentation files (the "Software"),
20 * to deal in the Software without restriction, including without limitation
21 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
22 * and/or sell copies of the Software, and to permit persons to whom the
23 * Software is furnished to do so, subject to the following conditions:
25 * The above copyright notice and this permission notice shall be included
26 * in all copies or substantial portions of the Software.
28 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
29 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
30 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
31 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
32 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
33 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
34 * OTHER DEALINGS IN THE SOFTWARE.
39 #include "glapi/glthread.h"
41 #include "hash_table.h"
44 * Magic GLuint object name that gets stored outside of the struct hash_table.
46 * The hash table needs a particular pointer to be the marker for a key that
47 * was deleted from the table, along with NULL for the "never allocated in the
48 * table" marker. Legacy GL allows any GLuint to be used as a GL object name,
49 * and we use a 1:1 mapping from GLuints to key pointers, so we need to be
50 * able to track a GLuint that happens to match the deleted key outside of
51 * struct hash_table. We tell the hash table to use "1" as the deleted key
52 * value, so that we test the deleted-key-in-the-table path as best we can.
54 #define DELETED_KEY_VALUE 1
57 * The hash table data structure.
59 struct _mesa_HashTable
{
60 struct hash_table
*ht
;
61 GLuint MaxKey
; /**< highest key inserted so far */
62 mtx_t Mutex
; /**< mutual exclusion lock */
63 mtx_t WalkMutex
; /**< for _mesa_HashWalk() */
64 GLboolean InDeleteAll
; /**< Debug check */
65 /** Value that would be in the table for DELETED_KEY_VALUE. */
66 void *deleted_key_data
;
70 * Mapping from our use of GLuint as both the key and the hash value to the
73 * There exist many integer hash functions, designed to avoid collisions when
74 * the integers are spread across key space with some patterns. In GL, the
75 * pattern (in the case of glGen*()ed object IDs) is that the keys are unique
76 * contiguous integers starting from 1. Because of that, we just use the key
77 * as the hash value, to minimize the cost of the hash function. If objects
78 * are never deleted, we will never see a collision in the table, because the
79 * table resizes itself when it approaches full, and thus key % table_size ==
82 * The case where we could have collisions for genned objects would be
83 * something like: glGenBuffers(&a, 100); glDeleteBuffers(&a + 50, 50);
84 * glGenBuffers(&b, 100), because objects 1-50 and 101-200 are allocated at
85 * the end of that sequence, instead of 1-150. So far it doesn't appear to be
89 uint_key_compare(const void *a
, const void *b
)
103 return (void *)(uintptr_t) id
;
108 * Create a new hash table.
110 * \return pointer to a new, empty hash table.
112 struct _mesa_HashTable
*
113 _mesa_NewHashTable(void)
115 struct _mesa_HashTable
*table
= CALLOC_STRUCT(_mesa_HashTable
);
118 table
->ht
= _mesa_hash_table_create(NULL
, uint_key_compare
);
119 _mesa_hash_table_set_deleted_key(table
->ht
, uint_key(DELETED_KEY_VALUE
));
120 mtx_init(&table
->Mutex
, mtx_plain
);
121 mtx_init(&table
->WalkMutex
, mtx_plain
);
129 * Delete a hash table.
130 * Frees each entry on the hash table and then the hash table structure itself.
131 * Note that the caller should have already traversed the table and deleted
132 * the objects in the table (i.e. We don't free the entries' data pointer).
134 * \param table the hash table to delete.
137 _mesa_DeleteHashTable(struct _mesa_HashTable
*table
)
141 if (_mesa_hash_table_next_entry(table
->ht
, NULL
) != NULL
) {
142 _mesa_problem(NULL
, "In _mesa_DeleteHashTable, found non-freed data");
145 _mesa_hash_table_destroy(table
->ht
, NULL
);
147 mtx_destroy(&table
->Mutex
);
148 mtx_destroy(&table
->WalkMutex
);
155 * Lookup an entry in the hash table, without locking.
156 * \sa _mesa_HashLookup
159 _mesa_HashLookup_unlocked(struct _mesa_HashTable
*table
, GLuint key
)
161 const struct hash_entry
*entry
;
166 if (key
== DELETED_KEY_VALUE
)
167 return table
->deleted_key_data
;
169 entry
= _mesa_hash_table_search(table
->ht
, uint_hash(key
), uint_key(key
));
178 * Lookup an entry in the hash table.
180 * \param table the hash table.
181 * \param key the key.
183 * \return pointer to user's data or NULL if key not in table
186 _mesa_HashLookup(struct _mesa_HashTable
*table
, GLuint key
)
190 mtx_lock(&table
->Mutex
);
191 res
= _mesa_HashLookup_unlocked(table
, key
);
192 mtx_unlock(&table
->Mutex
);
198 * Insert a key/pointer pair into the hash table.
199 * If an entry with this key already exists we'll replace the existing entry.
201 * \param table the hash table.
202 * \param key the key (not zero).
203 * \param data pointer to user data.
206 _mesa_HashInsert(struct _mesa_HashTable
*table
, GLuint key
, void *data
)
208 uint32_t hash
= uint_hash(key
);
209 struct hash_entry
*entry
;
214 mtx_lock(&table
->Mutex
);
216 if (key
> table
->MaxKey
)
219 if (key
== DELETED_KEY_VALUE
) {
220 table
->deleted_key_data
= data
;
222 entry
= _mesa_hash_table_search(table
->ht
, hash
, uint_key(key
));
226 _mesa_hash_table_insert(table
->ht
, hash
, uint_key(key
), data
);
230 mtx_unlock(&table
->Mutex
);
236 * Remove an entry from the hash table.
238 * \param table the hash table.
239 * \param key key of entry to remove.
241 * While holding the hash table's lock, searches the entry with the matching
242 * key and unlinks it.
245 _mesa_HashRemove(struct _mesa_HashTable
*table
, GLuint key
)
247 struct hash_entry
*entry
;
252 /* have to check this outside of mutex lock */
253 if (table
->InDeleteAll
) {
254 _mesa_problem(NULL
, "_mesa_HashRemove illegally called from "
255 "_mesa_HashDeleteAll callback function");
259 mtx_lock(&table
->Mutex
);
260 if (key
== DELETED_KEY_VALUE
) {
261 table
->deleted_key_data
= NULL
;
263 entry
= _mesa_hash_table_search(table
->ht
, uint_hash(key
), uint_key(key
));
264 _mesa_hash_table_remove(table
->ht
, entry
);
266 mtx_unlock(&table
->Mutex
);
272 * Delete all entries in a hash table, but don't delete the table itself.
273 * Invoke the given callback function for each table entry.
275 * \param table the hash table to delete
276 * \param callback the callback function
277 * \param userData arbitrary pointer to pass along to the callback
278 * (this is typically a struct gl_context pointer)
281 _mesa_HashDeleteAll(struct _mesa_HashTable
*table
,
282 void (*callback
)(GLuint key
, void *data
, void *userData
),
285 struct hash_entry
*entry
;
289 mtx_lock(&table
->Mutex
);
290 table
->InDeleteAll
= GL_TRUE
;
291 hash_table_foreach(table
->ht
, entry
) {
292 callback((uintptr_t)entry
->key
, entry
->data
, userData
);
293 _mesa_hash_table_remove(table
->ht
, entry
);
295 if (table
->deleted_key_data
) {
296 callback(DELETED_KEY_VALUE
, table
->deleted_key_data
, userData
);
297 table
->deleted_key_data
= NULL
;
299 table
->InDeleteAll
= GL_FALSE
;
300 mtx_unlock(&table
->Mutex
);
305 * Clone all entries in a hash table, into a new table.
307 * \param table the hash table to clone
309 struct _mesa_HashTable
*
310 _mesa_HashClone(const struct _mesa_HashTable
*table
)
312 /* cast-away const */
313 struct _mesa_HashTable
*table2
= (struct _mesa_HashTable
*) table
;
314 struct hash_entry
*entry
;
315 struct _mesa_HashTable
*clonetable
;
318 mtx_lock(&table2
->Mutex
);
320 clonetable
= _mesa_NewHashTable();
322 hash_table_foreach(table
->ht
, entry
) {
323 _mesa_HashInsert(clonetable
, (GLint
)(uintptr_t)entry
->key
, entry
->data
);
326 mtx_unlock(&table2
->Mutex
);
333 * Walk over all entries in a hash table, calling callback function for each.
334 * Note: we use a separate mutex in this function to avoid a recursive
335 * locking deadlock (in case the callback calls _mesa_HashRemove()) and to
336 * prevent multiple threads/contexts from getting tangled up.
337 * A lock-less version of this function could be used when the table will
339 * \param table the hash table to walk
340 * \param callback the callback function
341 * \param userData arbitrary pointer to pass along to the callback
342 * (this is typically a struct gl_context pointer)
345 _mesa_HashWalk(const struct _mesa_HashTable
*table
,
346 void (*callback
)(GLuint key
, void *data
, void *userData
),
349 /* cast-away const */
350 struct _mesa_HashTable
*table2
= (struct _mesa_HashTable
*) table
;
351 struct hash_entry
*entry
;
355 mtx_lock(&table2
->WalkMutex
);
356 hash_table_foreach(table
->ht
, entry
) {
357 callback((uintptr_t)entry
->key
, entry
->data
, userData
);
359 if (table
->deleted_key_data
)
360 callback(DELETED_KEY_VALUE
, table
->deleted_key_data
, userData
);
361 mtx_unlock(&table2
->WalkMutex
);
365 debug_print_entry(GLuint key
, void *data
, void *userData
)
367 _mesa_debug(NULL
, "%u %p\n", key
, data
);
371 * Dump contents of hash table for debugging.
373 * \param table the hash table.
376 _mesa_HashPrint(const struct _mesa_HashTable
*table
)
378 if (table
->deleted_key_data
)
379 debug_print_entry(DELETED_KEY_VALUE
, table
->deleted_key_data
, NULL
);
380 _mesa_HashWalk(table
, debug_print_entry
, NULL
);
385 * Find a block of adjacent unused hash keys.
387 * \param table the hash table.
388 * \param numKeys number of keys needed.
390 * \return Starting key of free block or 0 if failure.
392 * If there are enough free keys between the maximum key existing in the table
393 * (_mesa_HashTable::MaxKey) and the maximum key possible, then simply return
394 * the adjacent key. Otherwise do a full search for a free key block in the
395 * allowable key range.
398 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable
*table
, GLuint numKeys
)
400 const GLuint maxKey
= ~((GLuint
) 0) - 1;
401 mtx_lock(&table
->Mutex
);
402 if (maxKey
- numKeys
> table
->MaxKey
) {
403 /* the quick solution */
404 mtx_unlock(&table
->Mutex
);
405 return table
->MaxKey
+ 1;
408 /* the slow solution */
409 GLuint freeCount
= 0;
410 GLuint freeStart
= 1;
412 for (key
= 1; key
!= maxKey
; key
++) {
413 if (_mesa_HashLookup_unlocked(table
, key
)) {
414 /* darn, this key is already in use */
419 /* this key not in use, check if we've found enough */
421 if (freeCount
== numKeys
) {
422 mtx_unlock(&table
->Mutex
);
427 /* cannot allocate a block of numKeys consecutive keys */
428 mtx_unlock(&table
->Mutex
);
435 * Return the number of entries in the hash table.
438 _mesa_HashNumEntries(const struct _mesa_HashTable
*table
)
440 struct hash_entry
*entry
;
443 if (table
->deleted_key_data
)
446 hash_table_foreach(table
->ht
, entry
)