uatomic/x86: Remove redundant memory barriers

[urcu.git] / doc / examples / rculfhash / cds_lfht_add.c

diff --git a/doc/examples/rculfhash/cds_lfht_add.c b/doc/examples/rculfhash/cds_lfht_add.c
index acff676d81193fe2c739a0b36744b5c43d3825b5..927e38d99c24dba7ecf8ef667f549d0b3c631ca2 100644 (file)
--- a/doc/examples/rculfhash/cds_lfht_add.c
+++ b/doc/examples/rculfhash/cds_lfht_add.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 add nodes (allowing duplicate keys) into a
  * RCU lock-free hash table.
  * This hash table requires using a RCU scheme.
@@ -32,7 +25,7 @@ struct mynode {
        struct cds_lfht_node node;      /* Chaining in hash table */
 };
 
-int main(int argc, char **argv)
+int main(void)
 {
        int values[] = { -5, 42, 42, 36, 24, }; /* 42 is duplicated */
        struct cds_lfht *ht;    /* Hash table */