X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Fhlist%2Fcds_hlist_del_rcu.c;h=28b6c42e62c552e2df00bf007d00eff775794fd1;hb=HEAD;hp=1995b215cf24e505daa262d935561aa042f545b0;hpb=474190bf1a9025850c14aa67eb88ba9815bb74f4;p=urcu.git

diff --git a/doc/examples/hlist/cds_hlist_del_rcu.c b/doc/examples/hlist/cds_hlist_del_rcu.c
index 1995b21..1ef229f 100644
--- a/doc/examples/hlist/cds_hlist_del_rcu.c
+++ b/doc/examples/hlist/cds_hlist_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 non-circular 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/rcuhlist.h>	/* RCU hlist */
 #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_HLIST_HEAD(mylist);		/* Defines an empty hlist head */
@@ -72,7 +65,7 @@ int main(int argc, char **argv)
 			 * We can only reclaim memory after a grace
 			 * period has passed after cds_hlist_del_rcu().
 			 */
-			call_rcu(&node->rcu_head, free_node_rcu);
+			urcu_memb_call_rcu(&node->rcu_head, free_node_rcu);
 		}
 	}