X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fhash-pjw.c;h=bd94036c4ce1de649b00cfdff0ecebc58f528050;hb=a74dcd0c2df4149148181beea2a8b5190619dbbe;hp=0a14b3e7af9b1f28008b253b3a44827fbf38fa77;hpb=ab352daed97372060cc038c30f2b6394d8ff1c54;p=gnulib.git diff --git a/lib/hash-pjw.c b/lib/hash-pjw.c index 0a14b3e7a..bd94036c4 100644 --- a/lib/hash-pjw.c +++ b/lib/hash-pjw.c @@ -1,5 +1,6 @@ /* hash-pjw.c -- compute a hash value from a NUL-terminated string. - Copyright 2001, 2003 Free Software Foundation, Inc. + + Copyright (C) 2001, 2003, 2006 Free Software Foundation, Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -13,33 +14,28 @@ You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, - Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ + Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ -#if HAVE_CONFIG_H -# include -#endif +#include #include "hash-pjw.h" +#include + +#define SIZE_BITS (sizeof (size_t) * CHAR_BIT) + /* A hash function for NUL-terminated char* strings using - the method described in Aho, Sethi, & Ullman, p 436. - Note that this hash function produces a lot of collisions when used - with short strings with very varied bit patterns. + the method described by Bruno Haible. See http://www.haible.de/bruno/hashfunc.html. */ -unsigned int -hash_pjw (const void *x, unsigned int tablesize) +size_t +hash_pjw (const void *x, size_t tablesize) { - const char *s = x; - unsigned int h = 0; - unsigned int g; - - while (*s != 0) - { - h = (h << 4) + *s++; - if ((g = h & (unsigned int) 0xf0000000) != 0) - h = (h ^ (g >> 24)) ^ g; - } - - return (h % tablesize); + const char *s; + size_t h = 0; + + for (s = x; *s; s++) + h = *s + ((h << 9) | (h >> (SIZE_BITS - 9))); + + return h % tablesize; }