X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Flist%2Fcds_list_add_rcu.c;h=3eb062a9f7c9f3a308c77aac1b73f9183bbbf79a;hb=HEAD;hp=ad1d909cb7135d928dda85218e3e5ca3e64e3336;hpb=f37f1d93b55ca5f03761a840a8736613eb04f90b;p=urcu.git

diff --git a/doc/examples/list/cds_list_add_rcu.c b/doc/examples/list/cds_list_add_rcu.c
index ad1d909..13da5b3 100644
--- a/doc/examples/list/cds_list_add_rcu.c
+++ b/doc/examples/list/cds_list_add_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 add into 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 */
 
@@ -28,7 +21,7 @@ struct mynode {
 	struct cds_list_head node;	/* Linked-list chaining */
 };
 
-int main(int argc, char **argv)
+int main(void)
 {
 	int values[] = { -5, 42, 36, 24, };
 	CDS_LIST_HEAD(mylist);		/* Defines an empty list head */