Function HashTableTwoPhaseUnlinkFind

src/util/dict.c:634–656

Find an element from the table, also get the plink of the entry. The entry * is returned if the element is found, and the user should later call * `HashTableTwoPhaseUnlinkFree` with it in order to unlink and release it. Otherwise if * the key is not found, NULL is returned. These two functions should be used in pair. * `HashTableTwoPhaseUnlinkFind` pauses rehash and `HashTableTwoPhaseUnlinkFre

 * to the second one to avoid repeating the lookup
 */
dictEntry *HashTableTwoPhaseUnlinkFind(dict *d, const void *key, dictEntry ***plink, int *table_index) {
    uint64_t h, idx, table;

    if (dictSize(d) == 0) return NULL; /* dict is empty */
    if (dictIsRehashing(d)) _dictRehashStep(d);
    h = dictHashKey(d, key);

    for (table = 0; table <= 1; table++) {
        idx = h & DICTHT_SIZE_MASK(d->ht_size_exp[table]);
        dictEntry **ref = &d->ht_table[table][idx];
        while(*ref) {
            if (key==(*ref)->key || dictCompareKeys(d, key, (*ref)->key)) {
                *table_index = table;
                *plink = ref;
                dictPauseRehashing(d);
                return *ref;
            }
            ref = &(*ref)->next;
        }
        if (!dictIsRehashing(d)) return NULL;
    }
    return NULL;
}

void HashTableTwoPhaseUnlinkFree(dict *d, dictEntry *he, dictEntry **plink, int table_index) {
    if (he == NULL) return;