uatomic/x86: Remove redundant memory barriers

[urcu.git] / doc / examples / hlist / cds_hlist_for_each_entry_rcu.c

diff --git a/doc/examples/hlist/cds_hlist_for_each_entry_rcu.c b/doc/examples/hlist/cds_hlist_for_each_entry_rcu.c
index 5f8fa72fd3d01fb9227c0cdc8faec9d8fd51521f..bf675fd809233d8c86ea7414e1d8a6bf583f0ca0 100644 (file)
--- a/doc/examples/hlist/cds_hlist_for_each_entry_rcu.c
+++ b/doc/examples/hlist/cds_hlist_for_each_entry_rcu.c
@@ -1,15 +1,8 @@
+// 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 do a non-circular RCU linked list
  * traversal, safely against concurrent RCU updates.
  */
@@ -28,7 +21,7 @@ struct mynode {
        struct cds_hlist_node node;     /* Linked-list chaining */
 };
 
-int main(int argc, char **argv)
+int main(void)
 {
        int values[] = { -5, 42, 36, 24, };
        CDS_HLIST_HEAD(mylist);         /* Defines an empty hlist head */