taken much faster implementation of Adler32 and put into a separate source-code

[libucw.git] / lib / hashfunc.c

diff --git a/lib/hashfunc.c b/lib/hashfunc.c
index 2f951c6977ab5725e49281fa5135bfcb4d9d4592..ad6a6bdf9d0637acbfc76770308581e2f4a37ea0 100644 (file)
--- a/lib/hashfunc.c
+++ b/lib/hashfunc.c
@@ -6,6 +6,9 @@
  *     strings longer than 100 characters, it is substantially faster.
  *
  *     (c) 2002, Robert Spalek <robert@ucw.cz>
+ *
+ *     This software may be freely distributed and used according to the terms
+ *     of the GNU Lesser General Public License.
  */
 
 #include "lib/lib.h"
@@ -14,7 +17,7 @@
 
 /* The number of bits the hash in the function hash_*() is rotated by after
  * every pass.  It should be prime with the word size.  */
-#define        SHIFT_BITS      5
+#define        SHIFT_BITS      7
 
 /* A bit-mask which clears higher bytes than a given threshold.  */
 static uns mask_higher_bits[sizeof(uns)];