X-Git-Url: http://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Frculfhash%2Fcds_lfht_add_replace.c;fp=doc%2Fexamples%2Frculfhash%2Fcds_lfht_add_replace.c;h=62de40c033f97feca95c25b456c4bb1caa16714d;hb=34b3f359c81e6400c9b451e49bf9dfaef7963509;hp=0000000000000000000000000000000000000000;hpb=650b434b12597af49cad28c5c4b5faa3c98c04b0;p=urcu.git

diff --git a/doc/examples/rculfhash/cds_lfht_add_replace.c b/doc/examples/rculfhash/cds_lfht_add_replace.c
new file mode 100644
index 0000000..62de40c
--- /dev/null
+++ b/doc/examples/rculfhash/cds_lfht_add_replace.c
@@ -0,0 +1,147 @@
+/*
+ * Copyright (C) 2013  Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+ *
+ * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
+ * OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.
+ *
+ * Permission is hereby granted to use or copy this program for any
+ * purpose,  provided the above notices are retained on all copies.
+ * Permission to modify the code and to distribute modified code is
+ * granted, provided the above notices are retained, and a notice that
+ * the code was modified is included with the above copyright notice.
+ *
+ * This example shows how to add nodes into a RCU lock-free hash table
+ * with cds_lfht_add_replace(), which replaces existing nodes with the
+ * same key if found.
+ * We use a "seqnum" field to show which node is staying in the hash
+ * table. This hash table requires using a RCU scheme.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+#include <urcu.h>		/* RCU flavor */
+#include <urcu/rculfhash.h>	/* RCU Lock-free hash table */
+#include <urcu/compiler.h>	/* For CAA_ARRAY_SIZE */
+#include "jhash.h"		/* Example hash function */
+
+/*
+ * Nodes populated into the hash table.
+ */
+struct mynode {
+	int value;			/* Node content */
+	int seqnum;			/* Our node sequence number */
+	struct cds_lfht_node node;	/* Chaining in hash table */
+	struct rcu_head rcu_head;	/* For call_rcu() */
+};
+
+static
+int match(struct cds_lfht_node *ht_node, const void *_key)
+{
+	struct mynode *node =
+		caa_container_of(ht_node, struct mynode, node);
+	const unsigned int *key = _key;
+
+	return *key == node->value;
+}
+
+static
+void free_node(struct rcu_head *head)
+{
+	struct mynode *node = caa_container_of(head, struct mynode, rcu_head);
+
+	free(node);
+}
+
+int main(int argc, char **argv)
+{
+	int values[] = { -5, 42, 42, 36, 24, };	/* 42 is duplicated */
+	struct cds_lfht *ht;	/* Hash table */
+	unsigned int i;
+	int ret = 0, seqnum = 0;
+	uint32_t seed;
+	struct cds_lfht_iter iter;	/* For iteration on hash table */
+	struct cds_lfht_node *ht_node;
+	struct mynode *node;
+
+	/*
+	 * Each thread need using RCU read-side need to be explicitly
+	 * registered.
+	 */
+	rcu_register_thread();
+
+	/* Use time as seed for hash table hashing. */
+	seed = (uint32_t) time(NULL);
+
+	/*
+	 * Allocate hash table.
+	 */
+	ht = cds_lfht_new(1, 1, 0,
+		CDS_LFHT_AUTO_RESIZE | CDS_LFHT_ACCOUNTING,
+		NULL);
+	if (!ht) {
+		printf("Error allocating hash table\n");
+		ret = -1;
+		goto end;
+	}
+
+	/*
+	 * Add nodes to hash table.
+	 */
+	for (i = 0; i < CAA_ARRAY_SIZE(values); i++) {
+		unsigned long hash;
+		int value;
+
+		node = malloc(sizeof(*node));
+		if (!node) {
+			ret = -1;
+			goto end;
+		}
+
+		cds_lfht_node_init(&node->node);
+		value = values[i];
+		node->value = value;
+		node->seqnum = seqnum++;
+		hash = jhash(&value, sizeof(value), seed);
+
+		/*
+		 * cds_lfht_add() needs to be called from RCU read-side
+		 * critical section.
+		 */
+		rcu_read_lock();
+		ht_node = cds_lfht_add_replace(ht, hash, match, &value,
+			&node->node);
+		if (ht_node) {
+			struct mynode *ret_node =
+				caa_container_of(ht_node, struct mynode, node);
+
+			printf("Replaced node (key: %d, seqnum: %d) by (key: %d, seqnum: %d)\n",
+				ret_node->value, ret_node->seqnum,
+				node->value, node->seqnum);
+			call_rcu(&ret_node->rcu_head, free_node);
+		} else {
+			printf("Add (key: %d, seqnum: %d)\n",
+				node->value, node->seqnum);
+		}
+		rcu_read_unlock();
+	}
+
+	/*
+	 * Iterate over each hash table node. Those will appear in
+	 * random order, depending on the hash seed. Iteration needs to
+	 * be performed within RCU read-side critical section.
+	 */
+	printf("hash table content (random order):");
+	rcu_read_lock();
+	cds_lfht_for_each_entry(ht, &iter, node, node) {
+		printf(" (key: %d, seqnum: %d)",
+			node->value, node->seqnum);
+	}
+	rcu_read_unlock();
+	printf("\n");
+
+end:
+	rcu_unregister_thread();
+	return ret;
+}