+// 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 enqueue nodes into a RCU lock-free queue.
* This queue requires using a RCU scheme.
*/
#include <stdio.h>
#include <stdlib.h>
-#include <urcu.h> /* RCU flavor */
+#include <urcu/urcu-memb.h> /* RCU flavor */
#include <urcu/rculfqueue.h> /* RCU Lock-free queue */
#include <urcu/compiler.h> /* For CAA_ARRAY_SIZE */
struct cds_lfq_node_rcu node; /* Chaining in queue */
};
-int main(int argc, char **argv)
+int main(void)
{
int values[] = { -5, 42, 36, 24, };
struct cds_lfq_queue_rcu myqueue; /* Queue */
* Each thread need using RCU read-side need to be explicitly
* registered.
*/
- rcu_register_thread();
+ urcu_memb_register_thread();
- cds_lfq_init_rcu(&myqueue, call_rcu);
+ cds_lfq_init_rcu(&myqueue, urcu_memb_call_rcu);
/*
* Enqueue nodes.
* Both enqueue and dequeue need to be called within RCU
* read-side critical section.
*/
- rcu_read_lock();
+ urcu_memb_read_lock();
cds_lfq_enqueue_rcu(&myqueue, &node->node);
- rcu_read_unlock();
+ urcu_memb_read_unlock();
}
end:
- rcu_unregister_thread();
+ urcu_memb_unregister_thread();
return ret;
}