Lines Matching defs:entry
78 * Frees each entry on the hash table and then the hash table structure itself.
121 * Lookup an entry in the hash table, without locking.
127 const struct hash_entry *entry;
135 entry = _mesa_hash_table_search_pre_hashed(table->ht,
138 if (!entry)
141 return entry->data;
146 * Lookup an entry in the hash table.
165 * Lookup an entry in the hash table without locking the mutex.
186 struct hash_entry *entry;
197 entry = _mesa_hash_table_search_pre_hashed(table->ht, hash, uint_key(key));
198 if (entry) {
199 entry->data = data;
209 * If an entry with this key already exists we'll replace the existing entry.
231 * If an entry with this key already exists we'll replace the existing entry.
251 * Remove an entry from the hash table.
254 * \param key key of entry to remove.
256 * While holding the hash table's lock, searches the entry with the matching
262 struct hash_entry *entry;
277 entry = _mesa_hash_table_search_pre_hashed(table->ht,
280 _mesa_hash_table_remove(table->ht, entry);
304 * Invoke the given callback function for each table entry.
321 hash_table_foreach(table->ht, entry) {
322 callback(entry->data, userData);
323 _mesa_hash_table_remove(table->ht, entry);
357 hash_table_foreach(table->ht, entry) {
358 callback(entry->data, userData);
397 hash_table_foreach(table->ht, entry) {
398 _mesa_debug(NULL, "%u %p\n", (unsigned)(uintptr_t) entry->key,
399 entry->data);