Cleanup: remove trailing white spaces across project

[lttng-ust.git] / liblttng-ust / jhash.h

diff --git a/liblttng-ust/jhash.h b/liblttng-ust/jhash.h
index ace743bfa5438fe33937075e5d3c51e70d4a2482..fe785bd5a9560572c0442eb0bee2ae6b8100b580 100644 (file)
--- a/liblttng-ust/jhash.h
+++ b/liblttng-ust/jhash.h
@@ -65,19 +65,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.
  */
@@ -108,7 +108,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