Lines Matching defs:key
47 * The hash table needs a particular pointer to be the marker for a key that
50 * and we use a 1:1 mapping from GLuints to key pointers, so we need to be
51 * able to track a GLuint that happens to match the deleted key outside of
52 * struct hash_table. We tell the hash table to use "1" as the deleted key
53 * value, so that we test the deleted-key-in-the-table path as best we can.
58 * Mapping from our use of GLuint as both the key and the hash value to the
62 * the integers are spread across key space with some patterns. In GL, the
64 * contiguous integers starting from 1. Because of that, we just use the key
67 * table resizes itself when it approaches full, and thus key % table_size ==
68 * key.
89 uint_key_hash(const void *key)
91 return uint_hash((uintptr_t)key);
106 GLuint MaxKey; /**< highest key inserted so far */
122 extern void *_mesa_HashLookup(struct _mesa_HashTable *table, GLuint key);
124 extern void _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data,
127 extern void _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key);
158 extern void *_mesa_HashLookupLocked(struct _mesa_HashTable *table, GLuint key);
161 GLuint key, void *data, GLboolean isGenName);
163 extern void _mesa_HashRemoveLocked(struct _mesa_HashTable *table, GLuint key);
206 _mesa_HashLookupMaybeLocked(struct _mesa_HashTable *table, GLuint key,
210 return _mesa_HashLookupLocked(table, key);
212 return _mesa_HashLookup(table, key);
217 GLuint key, void *data, GLboolean isGenName,
221 _mesa_HashInsertLocked(table, key, data, isGenName);
223 _mesa_HashInsert(table, key, data, isGenName);