/* We can always skip the dummy node initially */
iter = rcu_dereference(iter_prev->next);
assert(iter_prev->reverse_hash <= node->reverse_hash);
/* We can always skip the dummy node initially */
iter = rcu_dereference(iter_prev->next);
assert(iter_prev->reverse_hash <= node->reverse_hash);
if (clear_flag(iter)->reverse_hash > node->reverse_hash)
return;
next = rcu_dereference(clear_flag(iter)->next);
if (is_removed(next))
break;
if (clear_flag(iter)->reverse_hash > node->reverse_hash)
return;
next = rcu_dereference(clear_flag(iter)->next);
if (is_removed(next))
break;
/* Only account for identical reverse hash once */
if (iter_prev->reverse_hash != clear_flag(iter)->reverse_hash)
check_resize(ht, t, ++chain_len);
/* Only account for identical reverse hash once */
if (iter_prev->reverse_hash != clear_flag(iter)->reverse_hash)
check_resize(ht, t, ++chain_len);
- gc:
- /* Garbage collect logically removed nodes in the bucket */
- dummy = rcu_dereference(t->tbl[node->hash & (t->size - 1)]);
- _ht_gc_bucket(dummy, node);
+ gc_node:
+ assert(!is_removed(iter));
+ (void) uatomic_cmpxchg(&iter_prev->next, iter, clear_flag(next));