Lines Matching defs:value
12 * Mbcache is a simple key-value store. Keys need not be unique, however
13 * key-value pairs are expected to be unique (we use this fact in
18 * They use hash of data as a key and provide a value that may represent a
20 * data may be the same). However user provided value always uniquely
24 * and a special "delete entry with given key-value pair" operation. Fixed
67 * @value - value of the entry
70 * Creates entry in @cache with key @key and value @value. The function returns
71 * -EBUSY if entry with the same key and value already exists in cache.
75 u64 value, bool reusable)
102 entry->e_value = value;
109 if (dup->e_key == key && dup->e_value == value) {
217 * mb_cache_entry_get - get a cache entry by value (and key)
220 * @value - value
223 u64 value)
232 if (entry->e_key == key && entry->e_value == value &&
246 * @value - value
248 * Remove entry from cache @cache with key @key and value @value.
250 void mb_cache_entry_delete(struct mb_cache *cache, u32 key, u64 value)
259 if (entry->e_key == key && entry->e_value == value) {
283 * @value - value
285 * Remove entry from cache @cache with key @key and value @value. The removal
292 u32 key, u64 value)
296 entry = mb_cache_entry_get(cache, key, value);