Lines Matching +full:wr +full:- +full:hold

2  * util/storage/lruhash.h - hashtable, hash function, LRU keeping.
70  *	o unlock the entry if you hold the lock already.
165 	/** size bitmask - since size is a power of 2 */
200  * To change overflow_next you need to hold the bin lock.
201  * To change the lru items you need to hold the hashtable lock.
268  * 	If key already present, this entry->key is deleted immediately.
269  *	But entry->data is set to NULL before deletion, and put into
279  * At the end of the function you hold a (read/write)lock on the entry.
285  * @param wr: set to true if you desire a writelock on the entry.
291 	hashvalue_type hash, void* key, int wr);
295  * Caller must hold hash table lock. The entry must be inserted already.
312  * 	This is newsize - oldsize, a positive number uses more space.
332  * Caller must hold hash table lock. The entry must be inserted already.
400  * Caller must hold hash table lock.
414  * Caller must not hold bin locks.
423  * Caller must hold the hash table lock. Must not hold any bin locks.
431  * Caller must hold hash table lock.
439  * Caller must hold hash table lock.
463  * @param wr: if true writelock is obtained on element, otherwise readlock.
467 void lruhash_traverse(struct lruhash* h, int wr,