Lines Matching +full:unlock +full:- +full:keys
2 * util/storage/lruhash.h - hashtable, hash function, LRU keeping.
55 * o find entry (if failed, unlock hash, unl bin, exit).
57 * o unlock hashtable.
59 * o unlock hash bin.
61 * o unlock entry.
66 * be deleted, it would cause race conditions. So instead, unlock and
70 * o unlock the entry if you hold the lock already.
74 * o find entry (if failed, unlock hash, unl bin, exit).
76 * o unlock hashtable.
78 * o unlock hash bin.
79 * o unlock entry (nobody else should be waiting for this lock,
124 * Keys that are identical must also calculate to the same size.
129 /** type of function that compares two keys. return 0 if equal. */
132 /** old keys are deleted.
154 /** how to delete keys. */
165 /** size bitmask - since size is a power of 2 */
268 * If key already present, this entry->key is deleted immediately.
269 * But entry->data is set to NULL before deletion, and put into
288 * The user must unlock the entry when done.
312 * This is newsize - oldsize, a positive number uses more space.
454 * @param func: function for every element. Do not lock or unlock elements.