X-Git-Url: http://git.liburcu.org/?p=urcu.git;a=blobdiff_plain;f=doc%2Fexamples%2Flist%2Fcds_list_del_rcu.c;h=b4e4c137246238cbef1e1b43ac0862d26cf40d3d;hp=c35510136f07a8b2ed6469a52fb1386b8992b365;hb=HEAD;hpb=06ced8d6ec9084d8ebbbd9425f0ad2ba5e249e53

diff --git a/doc/examples/list/cds_list_del_rcu.c b/doc/examples/list/cds_list_del_rcu.c
index c355101..b4e4c13 100644
--- a/doc/examples/list/cds_list_del_rcu.c
+++ b/doc/examples/list/cds_list_del_rcu.c
@@ -1,22 +1,15 @@
+// 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 from a linked-list safely against
  * concurrent RCU traversals.
  */
 
 #include <stdio.h>
 
-#include <urcu.h>		/* Userspace RCU flavor */
+#include <urcu/urcu-memb.h>	/* Userspace RCU flavor */
 #include <urcu/rculist.h>	/* RCU list */
 #include <urcu/compiler.h>	/* For CAA_ARRAY_SIZE */
 
@@ -37,7 +30,7 @@ void free_node_rcu(struct rcu_head *head)
 	free(node);
 }
 
-int main(int argc, char **argv)
+int main(void)
 {
 	int values[] = { -5, 42, 36, 24, };
 	CDS_LIST_HEAD(mylist);		/* Defines an empty list head */
@@ -72,7 +65,7 @@ int main(int argc, char **argv)
 			 * We can only reclaim memory after a grace
 			 * period has passed after cds_list_del_rcu().
 			 */
-			call_rcu(&node->rcu_head, free_node_rcu);
+			urcu_memb_call_rcu(&node->rcu_head, free_node_rcu);
 		}
 	}