util/storage/lruhash.h

2  * util/storage/lruhash.h - hashtable, hash function, LRU keeping.
147 struct lruhash {
238 struct lruhash* lruhash_create(size_t start_size, size_t maxmem,
247 void lruhash_delete(struct lruhash* table);
254 void lruhash_clear(struct lruhash* table);
272 void lruhash_insert(struct lruhash* table, hashvalue_t hash,
288 struct lruhash_entry* lruhash_lookup(struct lruhash* table, hashvalue_t hash,
297 void lru_touch(struct lruhash* table, struct lruhash_entry* entry);
302 void lruhash_setmarkdel(struct lruhash* table, lruhash_markdelfunc_t md);
314 void lruhash_remove(struct lruhash* table, hashvalue_t hash, void* key);
320 void bin_delete(struct lruhash* table, struct lruhash_bin* bin);
330 struct lruhash_entry* bin_find_entry(struct lruhash* table,
352 void bin_split(struct lruhash* table, struct lruhash_bin* newa,
363 void reclaim_space(struct lruhash* table, struct lruhash_entry** list);
371 void table_grow(struct lruhash* table);
379 void lru_front(struct lruhash* table, struct lruhash_entry* entry);
387 void lru_remove(struct lruhash* table, struct lruhash_entry* entry);
395 void lruhash_status(struct lruhash* table, const char* id, int extended);
398  * Get memory in use now by the lruhash table.
402 size_t lruhash_get_mem(struct lruhash* table);
405  * Traverse a lruhash. Call back for every element in the table.
411 void lruhash_traverse(struct lruhash* h, int wr,