d6044c244492e17bab204c6b43b863971198e862
2 * Copyright (C) 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
4 * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED
5 * OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
7 * Permission is hereby granted to use or copy this program for any
8 * purpose, provided the above notices are retained on all copies.
9 * Permission to modify the code and to distribute modified code is
10 * granted, provided the above notices are retained, and a notice that
11 * the code was modified is included with the above copyright notice.
13 * This example shows how to add unique nodes into a RCU lock-free hash
14 * table. We use a "seqnum" field to show which node is staying in the
15 * hash table. This hash table requires using a RCU scheme.
22 #include <urcu/urcu-memb.h> /* RCU flavor */
23 #include <urcu/rculfhash.h> /* RCU Lock-free hash table */
24 #include <urcu/compiler.h> /* For CAA_ARRAY_SIZE */
25 #include "jhash.h" /* Example hash function */
28 * Nodes populated into the hash table.
31 int value
; /* Node content */
32 int seqnum
; /* Our node sequence number */
33 struct cds_lfht_node node
; /* Chaining in hash table */
37 int match(struct cds_lfht_node
*ht_node
, const void *_key
)
40 caa_container_of(ht_node
, struct mynode
, node
);
41 const int *key
= _key
;
43 return *key
== node
->value
;
48 int values
[] = { -5, 42, 42, 36, 24, }; /* 42 is duplicated */
49 struct cds_lfht
*ht
; /* Hash table */
51 int ret
= 0, seqnum
= 0;
53 struct cds_lfht_iter iter
; /* For iteration on hash table */
54 struct cds_lfht_node
*ht_node
;
58 * Each thread need using RCU read-side need to be explicitly
61 urcu_memb_register_thread();
63 /* Use time as seed for hash table hashing. */
64 seed
= (uint32_t) time(NULL
);
67 * Allocate hash table.
69 ht
= cds_lfht_new_flavor(1, 1, 0,
70 CDS_LFHT_AUTO_RESIZE
| CDS_LFHT_ACCOUNTING
,
71 &urcu_memb_flavor
, NULL
);
73 printf("Error allocating hash table\n");
79 * Add nodes to hash table.
81 for (i
= 0; i
< CAA_ARRAY_SIZE(values
); i
++) {
85 node
= malloc(sizeof(*node
));
91 cds_lfht_node_init(&node
->node
);
94 node
->seqnum
= seqnum
++;
95 hash
= jhash(&value
, sizeof(value
), seed
);
98 * cds_lfht_add() needs to be called from RCU read-side
101 urcu_memb_read_lock();
102 ht_node
= cds_lfht_add_unique(ht
, hash
, match
, &value
,
105 * cds_lfht_add_unique() returns the added node if not
106 * already present, else returns the node matching the
109 if (ht_node
!= &node
->node
) {
111 * We found a match. Therefore, to ensure we
112 * don't add duplicates, cds_lfht_add_unique()
113 * acted as a RCU lookup, returning the found
114 * match. It did not add the new node to the
115 * hash table, so we can free it on the spot.
117 printf("Not adding duplicate (key: %d, seqnum: %d)\n",
118 node
->value
, node
->seqnum
);
121 printf("Add (key: %d, seqnum: %d)\n",
122 node
->value
, node
->seqnum
);
124 urcu_memb_read_unlock();
128 * Iterate over each hash table node. Those will appear in
129 * random order, depending on the hash seed. Iteration needs to
130 * be performed within RCU read-side critical section.
132 printf("hash table content (random order):");
133 urcu_memb_read_lock();
134 cds_lfht_for_each_entry(ht
, &iter
, node
, node
) {
135 printf(" (key: %d, seqnum: %d)",
136 node
->value
, node
->seqnum
);
138 urcu_memb_read_unlock();
142 urcu_memb_unregister_thread();
This page took 0.033287 seconds and 3 git commands to generate.