+// SPDX-FileCopyrightText: 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+//
+// SPDX-License-Identifier: MIT
+
/*
- * 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 remove nodes from a RCU lock-free hash table.
* This hash table requires using a RCU scheme.
*/
#include <stdlib.h>
#include <time.h>
-#include <urcu.h> /* RCU flavor */
+#include <urcu/urcu-memb.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 */
{
struct mynode *node =
caa_container_of(ht_node, struct mynode, node);
- const unsigned int *key = _key;
+ const int *key = _key;
return *key == node->value;
}
free(node);
}
-int main(int argc, char **argv)
+int main(void)
{
int values[] = { -5, 42, 42, 36, 24, }; /* 42 is duplicated */
int remove_values[] = { 42, 36, 24, 123, };
* Each thread need using RCU read-side need to be explicitly
* registered.
*/
- rcu_register_thread();
+ urcu_memb_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,
+ ht = cds_lfht_new_flavor(1, 1, 0,
CDS_LFHT_AUTO_RESIZE | CDS_LFHT_ACCOUNTING,
- NULL);
+ &urcu_memb_flavor, NULL);
if (!ht) {
printf("Error allocating hash table\n");
ret = -1;
* cds_lfht_add() needs to be called from RCU read-side
* critical section.
*/
- rcu_read_lock();
+ urcu_memb_read_lock();
cds_lfht_add(ht, hash, &node->node);
- rcu_read_unlock();
+ urcu_memb_read_unlock();
}
/*
* be performed within RCU read-side critical section.
*/
printf("hash table content (random order):");
- rcu_read_lock();
+ urcu_memb_read_lock();
cds_lfht_for_each_entry(ht, &iter, node, node) {
printf(" %d", node->value);
}
- rcu_read_unlock();
+ urcu_memb_read_unlock();
printf("\n");
/*
value = remove_values[i];
hash = jhash(&value, sizeof(value), seed);
printf(" %d", value);
- rcu_read_lock();
+ urcu_memb_read_lock();
cds_lfht_lookup(ht, hash, match, &value, &iter);
ht_node = cds_lfht_iter_get_node(&iter);
if (ht_node) {
struct mynode *del_node =
caa_container_of(ht_node,
struct mynode, node);
- call_rcu(&del_node->rcu_head, free_node);
+ urcu_memb_call_rcu(&del_node->rcu_head, free_node);
}
} else {
printf(" (not found)");
}
- rcu_read_unlock();
+ urcu_memb_read_unlock();
}
printf("\n");
printf("hash table content (random order):");
- rcu_read_lock();
+ urcu_memb_read_lock();
cds_lfht_for_each_entry(ht, &iter, node, node) {
printf(" %d", node->value);
}
- rcu_read_unlock();
+ urcu_memb_read_unlock();
printf("\n");
end:
- rcu_unregister_thread();
+ urcu_memb_unregister_thread();
return ret;
}