X-Git-Url: http://git.liburcu.org/?a=blobdiff_plain;f=rculfhash.c;h=42501a1f030c6ee29fb0c40e5fdc02394da06992;hb=b7d619b0a4d1613664285e3986b930a05c131c70;hp=08d024c10996833462c94e1ea96162f609502195;hpb=f9c8034108dccf1434c99da6b5768aad0b8c10f1;p=urcu.git

diff --git a/rculfhash.c b/rculfhash.c
index 08d024c..42501a1 100644
--- a/rculfhash.c
+++ b/rculfhash.c
@@ -177,6 +177,11 @@
 #define MAX_TABLE_ORDER			64
 #endif
 
+/*
+ * Minimum number of dummy nodes to touch per thread to parallelize grow/shrink.
+ */
+#define MIN_PARTITION_PER_THREAD	4096
+
 #ifndef min
 #define min(a, b)	((a) < (b) ? (a) : (b))
 #endif
@@ -235,6 +240,9 @@ struct cds_lfht {
 	void (*cds_lfht_rcu_read_unlock)(void);
 	void (*cds_lfht_rcu_thread_offline)(void);
 	void (*cds_lfht_rcu_thread_online)(void);
+	void (*cds_lfht_rcu_register_thread)(void);
+	void (*cds_lfht_rcu_unregister_thread)(void);
+	pthread_attr_t *resize_attr;	/* Resize threads attributes */
 	unsigned long count;		/* global approximate item count */
 	struct ht_items_count *percpu_count;	/* per-cpu item count */
 };
@@ -244,6 +252,14 @@ struct rcu_resize_work {
 	struct cds_lfht *ht;
 };
 
+struct partition_resize_work {
+	struct rcu_head head;
+	struct cds_lfht *ht;
+	unsigned long i, start, len;
+	void (*fct)(struct cds_lfht *ht, unsigned long i,
+		    unsigned long start, unsigned long len);
+};
+
 static
 struct cds_lfht_node *_cds_lfht_add(struct cds_lfht *ht,
 				unsigned long size,
@@ -813,7 +829,6 @@ struct cds_lfht_node *_cds_lfht_add(struct cds_lfht *ht,
 			new_next = flag_dummy(clear_flag(next));
 		else
 			new_next = clear_flag(next);
-		assert(new_next != NULL);
 		(void) uatomic_cmpxchg(&iter_prev->p.next, iter, new_next);
 		/* retry */
 	}
@@ -849,7 +864,6 @@ int _cds_lfht_remove(struct cds_lfht *ht, unsigned long size,
 			assert(is_dummy(next));
 		else
 			assert(!is_dummy(next));
-		assert(next != NULL);
 		old = uatomic_cmpxchg(&node->p.next, next,
 				      flag_removed(next));
 	} while (old != next);
@@ -882,49 +896,96 @@ end:
 }
 
 static
-void init_table_hash(struct cds_lfht *ht, unsigned long i,
-		unsigned long len)
+void *partition_resize_thread(void *arg)
 {
-	unsigned long j;
+	struct partition_resize_work *work = arg;
 
-	for (j = 0; j < len; j++) {
-		struct cds_lfht_node *new_node =
-			(struct cds_lfht_node *) &ht->t.tbl[i]->nodes[j];
+	work->ht->cds_lfht_rcu_register_thread();
+	work->fct(work->ht, work->i, work->start, work->len);
+	work->ht->cds_lfht_rcu_unregister_thread();
+	return NULL;
+}
 
-		dbg_printf("init hash entry: i %lu j %lu hash %lu\n",
-			   i, j, !i ? 0 : (1UL << (i - 1)) + j);
-		new_node->p.reverse_hash =
-			bit_reverse_ulong(!i ? 0 : (1UL << (i - 1)) + j);
-		if (CMM_LOAD_SHARED(ht->in_progress_destroy))
-			break;
+static
+void partition_resize_helper(struct cds_lfht *ht, unsigned long i,
+		unsigned long len,
+		void (*fct)(struct cds_lfht *ht, unsigned long i,
+			unsigned long start, unsigned long len))
+{
+	unsigned long partition_len;
+	struct partition_resize_work *work;
+	int cpu, ret;
+	pthread_t *thread_id;
+
+	/* Note: nr_cpus_mask + 1 is always power of 2 */
+	partition_len = len >> get_count_order_ulong(nr_cpus_mask + 1);
+	work = calloc(nr_cpus_mask + 1, sizeof(*work));
+	thread_id = calloc(nr_cpus_mask + 1, sizeof(*thread_id));
+	assert(work);
+	for (cpu = 0; cpu < nr_cpus_mask + 1; cpu++) {
+		work[cpu].ht = ht;
+		work[cpu].i = i;
+		work[cpu].len = partition_len;
+		work[cpu].start = cpu * partition_len;
+		work[cpu].fct = fct;
+		ret = pthread_create(&thread_id[cpu], ht->resize_attr,
+			partition_resize_thread, &work[cpu]);
+		assert(!ret);
+	}
+	for (cpu = 0; cpu < nr_cpus_mask + 1; cpu++) {
+		ret = pthread_join(thread_id[cpu], NULL);
+		assert(!ret);
 	}
+	free(work);
+	free(thread_id);
 }
 
 /*
  * Holding RCU read lock to protect _cds_lfht_add against memory
  * reclaim that could be performed by other call_rcu worker threads (ABA
  * problem).
+ *
+ * When we reach a certain length, we can split this population phase over
+ * many worker threads, based on the number of CPUs available in the system.
+ * This should therefore take care of not having the expand lagging behind too
+ * many concurrent insertion threads by using the scheduler's ability to
+ * schedule dummy node population fairly with insertions.
  */
 static
-void init_table_link(struct cds_lfht *ht, unsigned long i, unsigned long len)
+void init_table_populate_partition(struct cds_lfht *ht, unsigned long i,
+				   unsigned long start, unsigned long len)
 {
 	unsigned long j;
 
-	ht->cds_lfht_rcu_thread_online();
 	ht->cds_lfht_rcu_read_lock();
-	for (j = 0; j < len; j++) {
+	for (j = start; j < start + len; j++) {
 		struct cds_lfht_node *new_node =
 			(struct cds_lfht_node *) &ht->t.tbl[i]->nodes[j];
 
-		dbg_printf("init link: i %lu j %lu hash %lu\n",
+		dbg_printf("init populate: i %lu j %lu hash %lu\n",
 			   i, j, !i ? 0 : (1UL << (i - 1)) + j);
+		new_node->p.reverse_hash =
+			bit_reverse_ulong(!i ? 0 : (1UL << (i - 1)) + j);
 		(void) _cds_lfht_add(ht, !i ? 0 : (1UL << (i - 1)),
 				new_node, 0, 1);
 		if (CMM_LOAD_SHARED(ht->in_progress_destroy))
 			break;
 	}
 	ht->cds_lfht_rcu_read_unlock();
-	ht->cds_lfht_rcu_thread_offline();
+}
+
+static
+void init_table_populate(struct cds_lfht *ht, unsigned long i,
+			 unsigned long len)
+{
+	assert(nr_cpus_mask != -1);
+	if (nr_cpus_mask < 0 || len < (nr_cpus_mask + 1) * MIN_PARTITION_PER_THREAD) {
+		ht->cds_lfht_rcu_thread_online();
+		init_table_populate_partition(ht, i, 0, len);
+		ht->cds_lfht_rcu_thread_offline();
+		return;
+	}
+	partition_resize_helper(ht, i, len, init_table_populate_partition);
 }
 
 static
@@ -948,15 +1009,13 @@ void init_table(struct cds_lfht *ht,
 
 		ht->t.tbl[i] = calloc(1, sizeof(struct rcu_level)
 				+ (len * sizeof(struct _cds_lfht_node)));
-
-		/* Set all dummy nodes reverse hash values for a level */
-		init_table_hash(ht, i, len);
+		assert(ht->t.tbl[i]);
 
 		/*
-		 * Link all dummy nodes into the table. Concurrent
-		 * add/remove are helping us.
+		 * Set all dummy nodes reverse hash values for a level and
+		 * link all dummy nodes into the table.
 		 */
-		init_table_link(ht, i, len);
+		init_table_populate(ht, i, len);
 
 		/*
 		 * Update table size.
@@ -989,15 +1048,20 @@ void init_table(struct cds_lfht *ht,
  *
  * Logical removal and garbage collection can therefore be done in batch or on a
  * node-per-node basis, as long as the guarantee above holds.
+ *
+ * When we reach a certain length, we can split this removal over many worker
+ * threads, based on the number of CPUs available in the system. This should
+ * take care of not letting resize process lag behind too many concurrent
+ * updater threads actively inserting into the hash table.
  */
 static
-void remove_table(struct cds_lfht *ht, unsigned long i, unsigned long len)
+void remove_table_partition(struct cds_lfht *ht, unsigned long i,
+			    unsigned long start, unsigned long len)
 {
 	unsigned long j;
 
-	ht->cds_lfht_rcu_thread_online();
 	ht->cds_lfht_rcu_read_lock();
-	for (j = 0; j < len; j++) {
+	for (j = start; j < start + len; j++) {
 		struct cds_lfht_node *fini_node =
 			(struct cds_lfht_node *) &ht->t.tbl[i]->nodes[j];
 
@@ -1011,7 +1075,20 @@ void remove_table(struct cds_lfht *ht, unsigned long i, unsigned long len)
 			break;
 	}
 	ht->cds_lfht_rcu_read_unlock();
-	ht->cds_lfht_rcu_thread_offline();
+}
+
+static
+void remove_table(struct cds_lfht *ht, unsigned long i, unsigned long len)
+{
+
+	assert(nr_cpus_mask != -1);
+	if (nr_cpus_mask < 0 || len < (nr_cpus_mask + 1) * MIN_PARTITION_PER_THREAD) {
+		ht->cds_lfht_rcu_thread_online();
+		remove_table_partition(ht, i, 0, len);
+		ht->cds_lfht_rcu_thread_offline();
+		return;
+	}
+	partition_resize_helper(ht, i, len, remove_table_partition);
 }
 
 static
@@ -1061,7 +1138,7 @@ void fini_table(struct cds_lfht *ht,
 	}
 }
 
-struct cds_lfht *cds_lfht_new(cds_lfht_hash_fct hash_fct,
+struct cds_lfht *_cds_lfht_new(cds_lfht_hash_fct hash_fct,
 			cds_lfht_compare_fct compare_fct,
 			unsigned long hash_seed,
 			unsigned long init_size,
@@ -1072,7 +1149,10 @@ struct cds_lfht *cds_lfht_new(cds_lfht_hash_fct hash_fct,
 			void (*cds_lfht_rcu_read_lock)(void),
 			void (*cds_lfht_rcu_read_unlock)(void),
 			void (*cds_lfht_rcu_thread_offline)(void),
-			void (*cds_lfht_rcu_thread_online)(void))
+			void (*cds_lfht_rcu_thread_online)(void),
+			void (*cds_lfht_rcu_register_thread)(void),
+			void (*cds_lfht_rcu_unregister_thread)(void),
+			pthread_attr_t *attr)
 {
 	struct cds_lfht *ht;
 	unsigned long order;
@@ -1081,6 +1161,7 @@ struct cds_lfht *cds_lfht_new(cds_lfht_hash_fct hash_fct,
 	if (init_size && (init_size & (init_size - 1)))
 		return NULL;
 	ht = calloc(1, sizeof(struct cds_lfht));
+	assert(ht);
 	ht->hash_fct = hash_fct;
 	ht->compare_fct = compare_fct;
 	ht->hash_seed = hash_seed;
@@ -1090,6 +1171,9 @@ struct cds_lfht *cds_lfht_new(cds_lfht_hash_fct hash_fct,
 	ht->cds_lfht_rcu_read_unlock = cds_lfht_rcu_read_unlock;
 	ht->cds_lfht_rcu_thread_offline = cds_lfht_rcu_thread_offline;
 	ht->cds_lfht_rcu_thread_online = cds_lfht_rcu_thread_online;
+	ht->cds_lfht_rcu_register_thread = cds_lfht_rcu_register_thread;
+	ht->cds_lfht_rcu_unregister_thread = cds_lfht_rcu_unregister_thread;
+	ht->resize_attr = attr;
 	ht->percpu_count = alloc_per_cpu_items_count();
 	/* this mutex should not nest in read-side C.S. */
 	pthread_mutex_init(&ht->resize_mutex, NULL);
@@ -1260,7 +1344,7 @@ int cds_lfht_delete_dummy(struct cds_lfht *ht)
  * Should only be called when no more concurrent readers nor writers can
  * possibly access the table.
  */
-int cds_lfht_destroy(struct cds_lfht *ht)
+int cds_lfht_destroy(struct cds_lfht *ht, pthread_attr_t **attr)
 {
 	int ret;
 
@@ -1272,6 +1356,8 @@ int cds_lfht_destroy(struct cds_lfht *ht)
 	if (ret)
 		return ret;
 	free_per_cpu_items_count(ht->percpu_count);
+	if (attr)
+		*attr = ht->resize_attr;
 	poison_free(ht);
 	return ret;
 }