Lines Matching refs:entry
130 /* Probe until we find either a matching FILLED entry or an EMPTY
160 struct util_cache_entry *entry)
162 void *key = entry->key;
163 void *value = entry->value;
165 entry->key = NULL;
166 entry->value = NULL;
168 if (entry->state == FILLED) {
169 remove_from_list(entry);
175 entry->state = DELETED;
185 struct util_cache_entry *entry;
192 entry = util_cache_entry_get(cache, hash, key);
193 if (!entry)
194 entry = cache->lru.prev;
199 util_cache_entry_destroy(cache, entry);
202 ++entry->count;
205 entry->key = key;
206 entry->hash = hash;
207 entry->value = value;
208 entry->state = FILLED;
209 insert_at_head(&cache->lru, entry);
220 struct util_cache_entry *entry;
227 entry = util_cache_entry_get(cache, hash, key);
228 if (!entry)
231 if (entry->state == FILLED)
232 move_to_head(&cache->lru, entry);
234 return entry->value;
291 struct util_cache_entry *entry;
300 entry = util_cache_entry_get(cache, hash, key);
301 if (!entry)
304 if (entry->state == FILLED)
305 util_cache_entry_destroy(cache, entry);
