X-Git-Url: https://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=rculfhash.c;h=6c648f17da8a939d22894067eb1cc8c24620a8e0;hp=61dc09c3e2fe9408cd3edd3dde44e593e7d1966c;hb=c0b8a8653e108be201ae8d1ca9918461c97d45ed;hpb=4c299dcbef9ad69c2dfbb9b4537b77252fc76d0d

diff --git a/rculfhash.c b/rculfhash.c
index 61dc09c..6c648f1 100644
--- a/rculfhash.c
+++ b/rculfhash.c
@@ -242,15 +242,6 @@ struct partition_resize_work {
 		    unsigned long start, unsigned long len);
 };
 
-static
-void _cds_lfht_add(struct cds_lfht *ht,
-		cds_lfht_match_fct match,
-		const void *key,
-		unsigned long size,
-		struct cds_lfht_node *node,
-		struct cds_lfht_iter *unique_ret,
-		int bucket);
-
 /*
  * Algorithm to reverse bits in a word by lookup table, extended to
  * 64-bit words.
@@ -1158,6 +1149,11 @@ void remove_table(struct cds_lfht *ht, unsigned long i, unsigned long len)
 	partition_resize_helper(ht, i, len, remove_table_partition);
 }
 
+/*
+ * fini_table() is never called for first_order == 0, which is why
+ * free_by_rcu_order == 0 can be used as criterion to know if free must
+ * be called.
+ */
 static
 void fini_table(struct cds_lfht *ht,
 		unsigned long first_order, unsigned long last_order)