X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Furcu-flavors%2Fmb.c;h=7069c248fef60a538d6f3623ccc87771e8d34d1a;hb=HEAD;hp=62ad54bb7ff00309f7de7572116de1222bd8b7ee;hpb=d7818a6fd0c57b576f3bacc67ddd62bc8a78fb05;p=urcu.git

diff --git a/doc/examples/urcu-flavors/mb.c b/doc/examples/urcu-flavors/mb.c
index 62ad54b..7069c24 100644
--- a/doc/examples/urcu-flavors/mb.c
+++ b/doc/examples/urcu-flavors/mb.c
@@ -1,20 +1,6 @@
-/*
- * Copyright (C) 2013  Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
+// SPDX-FileCopyrightText: 2013 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+//
+// SPDX-License-Identifier: LGPL-2.1-or-later
 
 #include <unistd.h>
 #include <stdlib.h>
@@ -22,8 +8,7 @@
 #include <stdint.h>
 #include <inttypes.h>
 
-#define RCU_MB			/* Memory barrier RCU flavor */
-#include <urcu.h>
+#include <urcu/urcu-mb.h>	/* Memory barrier RCU flavor */
 #include <urcu/rculist.h>	/* List example */
 #include <urcu/compiler.h>	/* For CAA_ARRAY_SIZE */
 
@@ -48,7 +33,7 @@ int add_node(uint64_t v)
 {
 	struct mynode *node;
 
-	node = calloc(sizeof(*node), 1);
+	node = calloc(1, sizeof(*node));
 	if (!node)
 		return -1;
 	node->value = v;
@@ -64,7 +49,7 @@ void rcu_free_node(struct rcu_head *rh)
 	free(node);
 }
 
-int main(int argc, char **argv)
+int main(void)
 {
 	uint64_t values[] = { 42, 36, 24, };
 	unsigned int i;
@@ -75,7 +60,7 @@ int main(int argc, char **argv)
 	 * Each thread need using RCU read-side need to be explicitly
 	 * registered.
 	 */
-	rcu_register_thread();
+	urcu_mb_register_thread();
 
 	/*
 	 * Adding nodes to the linked-list. Safe against concurrent
@@ -92,7 +77,7 @@ int main(int argc, char **argv)
 	 * with rcu_read_lock() and rcu_read_unlock(). They can be
 	 * nested. Those are no-ops for the QSBR flavor.
 	 */
-	rcu_read_lock();
+	urcu_mb_read_lock();
 
 	/*
 	 * RCU traversal of the linked list.
@@ -100,7 +85,7 @@ int main(int argc, char **argv)
 	cds_list_for_each_entry_rcu(node, &mylist, node) {
 		printf("Value: %" PRIu64 "\n", node->value);
 	}
-	rcu_read_unlock();
+	urcu_mb_read_unlock();
 
 	/*
 	 * Removing nodes from linked list. Safe against concurrent RCU
@@ -114,7 +99,7 @@ int main(int argc, char **argv)
 		 * call_rcu() can be called from RCU read-side critical
 		 * sections.
 		 */
-		call_rcu(&node->rcu_head, rcu_free_node);
+		urcu_mb_call_rcu(&node->rcu_head, rcu_free_node);
 	}
 
 	/*
@@ -124,7 +109,7 @@ int main(int argc, char **argv)
 	 * batch work. Moreover, call_rcu() can be called from a RCU
 	 * read-side critical section, but synchronize_rcu() should not.
 	 */
-	synchronize_rcu();
+	urcu_mb_synchronize_rcu();
 
 	sleep(1);
 
@@ -133,9 +118,9 @@ int main(int argc, char **argv)
 	 * before program exits, or in library destructors, is a good
 	 * practice.
 	 */
-	rcu_barrier();
+	urcu_mb_barrier();
 
 end:
-	rcu_unregister_thread();
+	urcu_mb_unregister_thread();
 	return ret;
 }