rstatus_t
hash_hsieh(const char *key, size_t key_length, struct dyn_token *token)
{
uint32_t hash = 0, tmp;
int rem;
if (key_length <= 0 || key == NULL) {
return 0;
}
rem = key_length & 3;
key_length >>= 2;
/* Main loop */
for (;key_length > 0; key_length--) {
hash += get16bits (key);
tmp = (get16bits (key+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
key += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3:
hash += get16bits (key);
hash ^= hash << 16;
hash ^= (uint32_t)key[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2:
hash += get16bits (key);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1:
hash += (unsigned char)(*key);
hash ^= hash << 10;
hash += hash >> 1;
default:
break;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
size_dyn_token(token, 1);
set_int_dyn_token(token, hash);
return DN_OK;
}
dword SuperFastHash(register unsigned char * data, int len, dword hash)
{
TRACEENTER();
register dword tmp, tmp2;
int rem;
if(len <= 0 || data == NULL)
{
TRACEEXIT();
return 0;
}
rem = len & 3;
len >>= 2;
/* Main loop */
while(len>0)
{
tmp = get16bits(data);
data += 2;
tmp2 = get16bits(data);
data += 2;
if(tmp || tmp2)
{
hash += tmp;
tmp2 <<= 11;
tmp2 ^= hash;
hash <<= 16;
hash ^= tmp2;
hash += hash >> 11;
}
len -= 4;
}
SC_FUNC uint32_t
NameHash(const char *str)
{
size_t len = strlen(str);
const uint8_t *data = (uint8_t *)str;
#undef get16bits
#if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \
|| defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)
#define get16bits(d) (*((const uint16_t *) (d)))
#endif
#if !defined (get16bits)
#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8)\
+(uint32_t)(((const uint8_t *)(d))[0]) )
#endif
uint32_t hash = len, tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += get16bits (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
#undef get16bits
}
unsigned int hash_hsieh(const char *key, int key_length)
{
unsigned int hash = 0, tmp;
int rem;
if (key_length <= 0 || key == NULL) {
return 0;
}
rem = key_length & 3;
key_length >>= 2;
/* Main loop */
for (;key_length > 0; key_length--) {
hash += get16bits (key);
tmp = (get16bits (key+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
key += 2*sizeof (unsigned char);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3:
hash += get16bits (key);
hash ^= hash << 16;
hash ^= (unsigned int)key[sizeof (unsigned short)] << 18;
hash += hash >> 11;
break;
case 2:
hash += get16bits (key);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1:
hash += (unsigned char)(*key);
hash ^= hash << 10;
hash += hash >> 1;
default:
break;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
uint32_t HashAlgorithm::SuperFastHash (const char *data) {
uint32_t hash, tmp, len;
int rem;
if (! data) {
systemLog->sysLog(ERROR, "data is NULL. Cannot hash a NULL char * pointer");
return 0;
}
len = strlen(data);
hash = len;
rem = len & 3;
len >>= 2;
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3:
hash += get16bits (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2:
hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1:
hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
break;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
static uint32_t
hsieh_hash(const char *data, int len)
{
uint32_t hash, tmp;
int rem;
hash = len;
if (len <= 0 || data == NULL)
return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (; len > 0; len--) {
hash += get16bits(data);
tmp = (get16bits(data + 2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2 * sizeof(uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3:
hash += get16bits(data);
hash ^= hash << 16;
hash ^= data[sizeof(uint16_t)] << 18;
hash += hash >> 11;
break;
case 2:
hash += get16bits(data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1:
hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
static uint32_t HacheHsieh16(uint8_t *data) {
uint32_t hash = 0, tmp;
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
hash += hash >> 11;
hash += get16bits (data+4);
tmp = (get16bits (data+6) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
hash += hash >> 11;
hash += get16bits (data+8);
tmp = (get16bits (data+10) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
hash += hash >> 11;
hash += get16bits (data+12);
tmp = (get16bits (data+14) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
hash += hash >> 11;
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
//http://www.azillionmonkeys.com/qed/hash.html
uint32_t hash(byte *data, int len){
//Makes it rather a lot faster...if you don't mind inaccuracies
//if(len > 64){
// return hash(data, 32) + hash(data, len-32);
//}
uint32_t hash = len, tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += get16bits (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
uint32_t hsieh_hash(const char *key, size_t key_length)
{
uint32_t hash = 0, tmp;
int rem;
if (key_length <= 0 || key == NULL)
return 0;
rem = key_length & 3;
key_length >>= 2;
/* Main loop */
for (;key_length > 0; key_length--)
{
hash += get16bits (key);
tmp = (get16bits (key+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
key += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem)
{
case 3: hash += get16bits (key);
hash ^= hash << 16;
hash ^= key[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (key);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *key;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
unsigned int SuperFastHashIncremental (const char * data, int len, unsigned int lastHash )
{
uint32_t hash = (uint32_t) lastHash;
uint32_t tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += get16bits (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return (unsigned int) hash;
}
std::size_t HMOA::hash( std::string const& s ) {
const char * data = s.c_str();
int len = s.length();
uint32_t hash = len, tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += get16bits (data);
hash ^= hash << 16;
hash ^= data[sizeof (uint16_t)] << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return std::size_t( hash );
}
/* *
* Calculates a hash value for a given string buffer
*/
uint32_t superfasthash(const unsigned char *data, uint32_t len)
{
uint32_t hash = len, tmp;
int32_t rem;
rem = len & 3;
len >>= 2;
/* Main loop */
for (; len > 0; len--) {
hash += get16bits(data);
tmp = (get16bits(data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof(uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3:
hash += get16bits(data);
hash ^= hash << 16;
hash ^= data[sizeof(uint16_t)] << 18;
hash += hash >> 11;
break;
case 2:
hash += get16bits(data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1:
hash += *data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
KCSTDLIB_API_FUNC(hash_t _cdecl SuperFastHash(const char * data, int len)) {
uint32_t hash = len, tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
/* Main loop */
for (; len > 0; len--) {
hash += get16bits(data);
tmp = (get16bits(data + 2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2 * sizeof (uint16_t);
hash += hash >> 11;
}
/* Handle end cases */
switch (rem) {
case 3: hash += get16bits(data);
hash ^= hash << 16;
hash ^= ((signed char)data[sizeof (uint16_t)]) << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits(data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += (signed char)*data;
hash ^= hash << 10;
hash += hash >> 1;
}
/* Force "avalanching" of final 127 bits */
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
UINT32 ossHash ( const CHAR *data, INT32 len )
{
UINT32 hash = len, tmp ;
INT32 rem ;
if ( len <= 0 || data == NULL ) return 0 ;
rem = len&3 ;
len >>= 2 ;
for (; len > 0 ; --len )
{
hash += get16bits (data) ;
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash<<16)^tmp ;
data += 2*sizeof(UINT16) ;
hash += hash>>11 ;
}
switch ( rem )
{
case 3:
hash += get16bits (data) ;
hash ^= hash<<16 ;
hash ^= ((SINT8)data[sizeof (UINT16)])<<18 ;
hash += hash>>11 ;
break ;
case 2:
hash += get16bits(data) ;
hash ^= hash <<11 ;
hash += hash >>17 ;
break ;
case 1:
hash += (SINT8)*data ;
hash ^= hash<<10 ;
hash += hash>>1 ;
}
hash ^= hash<<3 ;
hash += hash>>5 ;
hash ^= hash<<4 ;
hash += hash>>17 ;
hash ^= hash<<25 ;
hash += hash>>6 ;
return hash ;
}
uint32_t GenHash(const char * data, int len) {
uint32_t hash = len, tmp;
int rem;
if (len <= 0 || data == NULL) return 0;
rem = len & 3;
len >>= 2;
for (;len > 0; len--) {
hash += get16bits (data);
tmp = (get16bits (data+2) << 11) ^ hash;
hash = (hash << 16) ^ tmp;
data += 2*sizeof (uint16_t);
hash += hash >> 11;
}
switch (rem) {
case 3: hash += get16bits (data);
hash ^= hash << 16;
hash ^= ((signed char)data[sizeof (uint16_t)]) << 18;
hash += hash >> 11;
break;
case 2: hash += get16bits (data);
hash ^= hash << 11;
hash += hash >> 17;
break;
case 1: hash += (signed char)*data;
hash ^= hash << 10;
hash += hash >> 1;
}
hash ^= hash << 3;
hash += hash >> 5;
hash ^= hash << 4;
hash += hash >> 17;
hash ^= hash << 25;
hash += hash >> 6;
return hash;
}
