X-Git-Url: http://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=rculfhash.c;h=2565099d2c12b633dce919e927363b10ff63912c;hp=003ab0bd0236d39ee4c591c2dccec6a3266bfca9;hb=bd4db1530ed788ea97c8a9e4c0d04ef757181ad6;hpb=b9e36678a644361b1043b2f20e023d6434377fb4

diff --git a/rculfhash.c b/rculfhash.c
index 003ab0b..2565099 100644
--- a/rculfhash.c
+++ b/rculfhash.c
@@ -672,6 +672,13 @@ void _cds_lfht_gc_bucket(struct cds_lfht_node *dummy, struct cds_lfht_node *node
 		/* We can always skip the dummy node initially */
 		iter = rcu_dereference(iter_prev->p.next);
 		assert(iter_prev->p.reverse_hash <= node->p.reverse_hash);
+		/*
+		 * We should never be called with dummy (start of chain)
+		 * and logically removed node (end of path compression
+		 * marker) being the actual same node. This would be a
+		 * bug in the algorithm implementation.
+		 */
+		assert(dummy != node);
 		for (;;) {
 			if (unlikely(!clear_flag(iter)))
 				return;