uatomic/x86: Remove redundant memory barriers

[urcu.git] / doc / examples / rculfhash / jhash.h

diff --git a/doc/examples/rculfhash/jhash.h b/doc/examples/rculfhash/jhash.h
index 5e8b288231389a0473d815f904d7ff1033745dc9..23812ce246d6c0fb4c8c77bc384d46dfcf44bfd9 100644 (file)
--- a/doc/examples/rculfhash/jhash.h
+++ b/doc/examples/rculfhash/jhash.h
@@ -1,21 +1,16 @@
+// SPDX-FileCopyrightText: 2009-2012 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+//
+// SPDX-License-Identifier: MIT
+
 #ifndef _JHASH_H
 #define _JHASH_H
 
+#if defined(__FreeBSD__)
+#include <sys/endian.h>
+#endif
+
 /*
- * jhash.h
- *
  * Example hash function.
- *
- * Copyright 2009-2012 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca>
- *
- * 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.
  */
 
 /*
@@ -112,7 +107,7 @@ uint32_t hashlittle(const void *key, size_t length, uint32_t initval)
                 * rest of the string.  Every machine with memory protection I've seen
                 * does it on word boundaries, so is OK with this.      But VALGRIND will
                 * still catch it and complain. The masking trick does make the hash
-                * noticably faster for short strings (like English words).
+                * noticeably faster for short strings (like English words).
                 */
 #ifndef VALGRIND