X-Git-Url: http://git.liburcu.org/?p=lttng-ust.git;a=blobdiff_plain;f=liblttng-ust%2Fjhash.h;fp=liblttng-ust%2Fjhash.h;h=49a93c226f0ba77183a805fa9e875591c3cc1242;hp=da1e7dd02c7b994bbdda9e5f8f7ce6eae27d4f5b;hb=1981f33816acb08345673096cf53d176243aac06;hpb=f0fc1799a9cbf402300b4469d4ada64e45aa8d89

diff --git a/liblttng-ust/jhash.h b/liblttng-ust/jhash.h
index da1e7dd0..49a93c22 100644
--- a/liblttng-ust/jhash.h
+++ b/liblttng-ust/jhash.h
@@ -63,19 +63,19 @@ do { \
  * Returns a 32-bit value.  Every bit of the key affects every bit of
  * the return value.  Two keys differing by one or two bits will have
  * totally different hash values.
- * 
+ *
  * The best hash table sizes are powers of 2.  There is no need to do
  * mod a prime (mod is sooo slow!).  If you need less than 32 bits,
  * use a bitmask.  For example, if you need only 10 bits, do
  *   h = (h & hashmask(10));
  * In which case, the hash table should have hashsize(10) elements.
- * 
+ *
  * If you are hashing n strings (uint8_t **)k, do it like this:
  *   for (i = 0, h = 0; i < n; ++i) h = hashlittle(k[i], len[i], h);
- * 
+ *
  * By Bob Jenkins, 2006.  bob_jenkins@burtleburtle.net.  You may use this
  * code any way you wish, private, educational, or commercial.  It's free.
- * 
+ *
  * Use for hash table lookup, or anything where one collision in 2^^32 is
  * acceptable.  Do NOT use for cryptographic purposes.
  */
@@ -106,7 +106,7 @@ uint32_t hashlittle(const void *key, size_t length, uint32_t initval)
 		}
 
 		/*----------------------------- handle the last (probably partial) block */
-		/* 
+		/*
 		 * "k[2]&0xffffff" actually reads beyond the end of the string, but
 		 * then masks off the part it's not allowed to read.	Because the
 		 * string is aligned, the masked-off tail is in the same word as the