Lines Matching defs:key
125 * size = func(key, data).
134 * This function is called: func(key, userarg) */
140 /** mark a key as pending to be deleted (and not to be used by anyone).
141 * called: func(key) */
158 /** how to mark a key pending deletion */
200 * This structure is designed as part of key struct. And key pointer helps
207 * Even with a writelock, you cannot change hash and key.
208 * You need to delete it to change hash or key.
217 /** hash value of the key. It may not change, until entry deleted. */
219 /** key */
220 void* key;
231 * @param delkeyfunc: deletes key.
233 * Make it part of the key structure and delete it in delkeyfunc.
258 * If key is already present data pointer in that entry is updated.
259 * The space calculation function is called with the key, data.
266 * If key already present, this entry->key is deleted immediately.
280 * @param hash: hash of key.
281 * @param key: what to look for, compared against entries in overflow chain.
289 void* key, int wr);
311 * @param hash: hash of key.
312 * @param key: what to look for.
314 void lruhash_remove(struct lruhash* table, hashvalue_t hash, void* key);
327 * @param key: key to look for.
331 struct lruhash_bin* bin, hashvalue_t hash, void* key);