X-Git-Url: http://git.liburcu.org/?a=blobdiff_plain;f=doc%2Fexamples%2Frculfhash%2Fjhash.h;h=f50a0dac64216601a1c75a8bebc5ef411e085b01;hb=f99c6e92aaa1582e6cd19d93d44d91d968f39aa7;hp=5e8b288231389a0473d815f904d7ff1033745dc9;hpb=447c9339d4f21fe5bba1aa77eccc9f94745e6447;p=urcu.git

diff --git a/doc/examples/rculfhash/jhash.h b/doc/examples/rculfhash/jhash.h
index 5e8b288..f50a0da 100644
--- a/doc/examples/rculfhash/jhash.h
+++ b/doc/examples/rculfhash/jhash.h
@@ -1,6 +1,10 @@
 #ifndef _JHASH_H
 #define _JHASH_H
 
+#if defined(__FreeBSD__)
+#include <sys/endian.h>
+#endif
+
 /*
  * jhash.h
  *
@@ -112,7 +116,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