4c92005e049ae4462f5d2c6231e5c9e4517ea1ca
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.
40 #include "hash_table.h"
43 * Magic GLuint object name that gets stored outside of the struct hash_table.
45 * The hash table needs a particular pointer to be the marker for a key that
46 * was deleted from the table, along with NULL for the "never allocated in the
47 * table" marker. Legacy GL allows any GLuint to be used as a GL object name,
48 * and we use a 1:1 mapping from GLuints to key pointers, so we need to be
49 * able to track a GLuint that happens to match the deleted key outside of
50 * struct hash_table. We tell the hash table to use "1" as the deleted key
51 * value, so that we test the deleted-key-in-the-table path as best we can.
53 #define DELETED_KEY_VALUE 1
56 * The hash table data structure.
58 struct _mesa_HashTable
{
59 struct hash_table
*ht
;
60 GLuint MaxKey
; /**< highest key inserted so far */
61 mtx_t Mutex
; /**< mutual exclusion lock */
62 mtx_t WalkMutex
; /**< for _mesa_HashWalk() */
63 GLboolean InDeleteAll
; /**< Debug check */
64 /** Value that would be in the table for DELETED_KEY_VALUE. */
65 void *deleted_key_data
;
69 * Mapping from our use of GLuint as both the key and the hash value to the
72 * There exist many integer hash functions, designed to avoid collisions when
73 * the integers are spread across key space with some patterns. In GL, the
74 * pattern (in the case of glGen*()ed object IDs) is that the keys are unique
75 * contiguous integers starting from 1. Because of that, we just use the key
76 * as the hash value, to minimize the cost of the hash function. If objects
77 * are never deleted, we will never see a collision in the table, because the
78 * table resizes itself when it approaches full, and thus key % table_size ==
81 * The case where we could have collisions for genned objects would be
82 * something like: glGenBuffers(&a, 100); glDeleteBuffers(&a + 50, 50);
83 * glGenBuffers(&b, 100), because objects 1-50 and 101-200 are allocated at
84 * the end of that sequence, instead of 1-150. So far it doesn't appear to be
88 uint_key_compare(const void *a
, const void *b
)
102 return (void *)(uintptr_t) id
;
107 * Create a new hash table.
109 * \return pointer to a new, empty hash table.
111 struct _mesa_HashTable
*
112 _mesa_NewHashTable(void)
114 struct _mesa_HashTable
*table
= CALLOC_STRUCT(_mesa_HashTable
);
117 table
->ht
= _mesa_hash_table_create(NULL
, uint_key_compare
);
118 _mesa_hash_table_set_deleted_key(table
->ht
, uint_key(DELETED_KEY_VALUE
));
119 mtx_init(&table
->Mutex
, mtx_plain
);
120 mtx_init(&table
->WalkMutex
, mtx_plain
);
128 * Delete a hash table.
129 * Frees each entry on the hash table and then the hash table structure itself.
130 * Note that the caller should have already traversed the table and deleted
131 * the objects in the table (i.e. We don't free the entries' data pointer).
133 * \param table the hash table to delete.
136 _mesa_DeleteHashTable(struct _mesa_HashTable
*table
)
140 if (_mesa_hash_table_next_entry(table
->ht
, NULL
) != NULL
) {
141 _mesa_problem(NULL
, "In _mesa_DeleteHashTable, found non-freed data");
144 _mesa_hash_table_destroy(table
->ht
, NULL
);
146 mtx_destroy(&table
->Mutex
);
147 mtx_destroy(&table
->WalkMutex
);
154 * Lookup an entry in the hash table, without locking.
155 * \sa _mesa_HashLookup
158 _mesa_HashLookup_unlocked(struct _mesa_HashTable
*table
, GLuint key
)
160 const struct hash_entry
*entry
;
165 if (key
== DELETED_KEY_VALUE
)
166 return table
->deleted_key_data
;
168 entry
= _mesa_hash_table_search(table
->ht
, uint_hash(key
), uint_key(key
));
177 * Lookup an entry in the hash table.
179 * \param table the hash table.
180 * \param key the key.
182 * \return pointer to user's data or NULL if key not in table
185 _mesa_HashLookup(struct _mesa_HashTable
*table
, GLuint key
)
189 mtx_lock(&table
->Mutex
);
190 res
= _mesa_HashLookup_unlocked(table
, key
);
191 mtx_unlock(&table
->Mutex
);
197 * Insert a key/pointer pair into the hash table.
198 * If an entry with this key already exists we'll replace the existing entry.
200 * \param table the hash table.
201 * \param key the key (not zero).
202 * \param data pointer to user data.
205 _mesa_HashInsert(struct _mesa_HashTable
*table
, GLuint key
, void *data
)
207 uint32_t hash
= uint_hash(key
);
208 struct hash_entry
*entry
;
213 mtx_lock(&table
->Mutex
);
215 if (key
> table
->MaxKey
)
218 if (key
== DELETED_KEY_VALUE
) {
219 table
->deleted_key_data
= data
;
221 entry
= _mesa_hash_table_search(table
->ht
, hash
, uint_key(key
));
225 _mesa_hash_table_insert(table
->ht
, hash
, uint_key(key
), data
);
229 mtx_unlock(&table
->Mutex
);
235 * Remove an entry from the hash table.
237 * \param table the hash table.
238 * \param key key of entry to remove.
240 * While holding the hash table's lock, searches the entry with the matching
241 * key and unlinks it.
244 _mesa_HashRemove(struct _mesa_HashTable
*table
, GLuint key
)
246 struct hash_entry
*entry
;
251 /* have to check this outside of mutex lock */
252 if (table
->InDeleteAll
) {
253 _mesa_problem(NULL
, "_mesa_HashRemove illegally called from "
254 "_mesa_HashDeleteAll callback function");
258 mtx_lock(&table
->Mutex
);
259 if (key
== DELETED_KEY_VALUE
) {
260 table
->deleted_key_data
= NULL
;
262 entry
= _mesa_hash_table_search(table
->ht
, uint_hash(key
), uint_key(key
));
263 _mesa_hash_table_remove(table
->ht
, entry
);
265 mtx_unlock(&table
->Mutex
);
271 * Delete all entries in a hash table, but don't delete the table itself.
272 * Invoke the given callback function for each table entry.
274 * \param table the hash table to delete
275 * \param callback the callback function
276 * \param userData arbitrary pointer to pass along to the callback
277 * (this is typically a struct gl_context pointer)
280 _mesa_HashDeleteAll(struct _mesa_HashTable
*table
,
281 void (*callback
)(GLuint key
, void *data
, void *userData
),
284 struct hash_entry
*entry
;
288 mtx_lock(&table
->Mutex
);
289 table
->InDeleteAll
= GL_TRUE
;
290 hash_table_foreach(table
->ht
, entry
) {
291 callback((uintptr_t)entry
->key
, entry
->data
, userData
);
292 _mesa_hash_table_remove(table
->ht
, entry
);
294 if (table
->deleted_key_data
) {
295 callback(DELETED_KEY_VALUE
, table
->deleted_key_data
, userData
);
296 table
->deleted_key_data
= NULL
;
298 table
->InDeleteAll
= GL_FALSE
;
299 mtx_unlock(&table
->Mutex
);
304 * Clone all entries in a hash table, into a new table.
306 * \param table the hash table to clone
308 struct _mesa_HashTable
*
309 _mesa_HashClone(const struct _mesa_HashTable
*table
)
311 /* cast-away const */
312 struct _mesa_HashTable
*table2
= (struct _mesa_HashTable
*) table
;
313 struct hash_entry
*entry
;
314 struct _mesa_HashTable
*clonetable
;
317 mtx_lock(&table2
->Mutex
);
319 clonetable
= _mesa_NewHashTable();
321 hash_table_foreach(table
->ht
, entry
) {
322 _mesa_HashInsert(clonetable
, (GLint
)(uintptr_t)entry
->key
, entry
->data
);
325 mtx_unlock(&table2
->Mutex
);
332 * Walk over all entries in a hash table, calling callback function for each.
333 * Note: we use a separate mutex in this function to avoid a recursive
334 * locking deadlock (in case the callback calls _mesa_HashRemove()) and to
335 * prevent multiple threads/contexts from getting tangled up.
336 * A lock-less version of this function could be used when the table will
338 * \param table the hash table to walk
339 * \param callback the callback function
340 * \param userData arbitrary pointer to pass along to the callback
341 * (this is typically a struct gl_context pointer)
344 _mesa_HashWalk(const struct _mesa_HashTable
*table
,
345 void (*callback
)(GLuint key
, void *data
, void *userData
),
348 /* cast-away const */
349 struct _mesa_HashTable
*table2
= (struct _mesa_HashTable
*) table
;
350 struct hash_entry
*entry
;
354 mtx_lock(&table2
->WalkMutex
);
355 hash_table_foreach(table
->ht
, entry
) {
356 callback((uintptr_t)entry
->key
, entry
->data
, userData
);
358 if (table
->deleted_key_data
)
359 callback(DELETED_KEY_VALUE
, table
->deleted_key_data
, userData
);
360 mtx_unlock(&table2
->WalkMutex
);
364 debug_print_entry(GLuint key
, void *data
, void *userData
)
366 _mesa_debug(NULL
, "%u %p\n", key
, data
);
370 * Dump contents of hash table for debugging.
372 * \param table the hash table.
375 _mesa_HashPrint(const struct _mesa_HashTable
*table
)
377 if (table
->deleted_key_data
)
378 debug_print_entry(DELETED_KEY_VALUE
, table
->deleted_key_data
, NULL
);
379 _mesa_HashWalk(table
, debug_print_entry
, NULL
);
384 * Find a block of adjacent unused hash keys.
386 * \param table the hash table.
387 * \param numKeys number of keys needed.
389 * \return Starting key of free block or 0 if failure.
391 * If there are enough free keys between the maximum key existing in the table
392 * (_mesa_HashTable::MaxKey) and the maximum key possible, then simply return
393 * the adjacent key. Otherwise do a full search for a free key block in the
394 * allowable key range.
397 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable
*table
, GLuint numKeys
)
399 const GLuint maxKey
= ~((GLuint
) 0) - 1;
400 mtx_lock(&table
->Mutex
);
401 if (maxKey
- numKeys
> table
->MaxKey
) {
402 /* the quick solution */
403 mtx_unlock(&table
->Mutex
);
404 return table
->MaxKey
+ 1;
407 /* the slow solution */
408 GLuint freeCount
= 0;
409 GLuint freeStart
= 1;
411 for (key
= 1; key
!= maxKey
; key
++) {
412 if (_mesa_HashLookup_unlocked(table
, key
)) {
413 /* darn, this key is already in use */
418 /* this key not in use, check if we've found enough */
420 if (freeCount
== numKeys
) {
421 mtx_unlock(&table
->Mutex
);
426 /* cannot allocate a block of numKeys consecutive keys */
427 mtx_unlock(&table
->Mutex
);
434 * Return the number of entries in the hash table.
437 _mesa_HashNumEntries(const struct _mesa_HashTable
*table
)
439 struct hash_entry
*entry
;
442 if (table
->deleted_key_data
)
445 hash_table_foreach(table
->ht
, entry
)