libaitcrc/src/hash.c - diff

Return to hash.c CVS log

Up to [ELWIX - Embedded LightWeight unIX -] / libaitcrc / src

Diff for /libaitcrc/src/hash.c between versions 1.2 and 1.3

version 1.2, 2011/04/28 20:28:20	version 1.3, 2012/07/04 14:53:43
Line 12 terms:	Line 12 terms:
All of the documentation and software included in the ELWIX and AITNET	All of the documentation and software included in the ELWIX and AITNET
Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>	Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>

Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011	Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
by Michael Pounov <misho@elwix.org>. All rights reserved.	by Michael Pounov <misho@elwix.org>. All rights reserved.

Redistribution and use in source and binary forms, with or without	Redistribution and use in source and binary forms, with or without
Line 47 SUCH DAMAGE.	Line 47 SUCH DAMAGE.


/*	/*
* hash_varchar() Compute index hash by variable length string	* hash_varchar() - Compute index hash by variable length string
	*
* @csStr = Input data buffer	* @csStr = Input data buffer
* @nStrLen = Length of data buffer	* @nStrLen = Length of data buffer
* @nVer = Version of algorythm; 0 - original, 1 - AITNET variant	* @nVer = Version of algorythm; 0 - original, 1 - AITNET variant
Line 65 hash_varchar(const char *csStr, int nStrLen, int nVer)	Line 66 hash_varchar(const char *csStr, int nStrLen, int nVer)
n = 2 * hash + csStr[i];	n = 2 * hash + csStr[i];
if (!nVer) {	if (!nVer) {
if (hash & 0x80000000)	if (hash & 0x80000000)
n ^= 0xC0A0A0D5; // Polynom CRC-32 aviation	n ^= POLY_CRC32; /* Polynom CRC-32 aviation */
} else {	} else {
if (n & 1) // Misho ;) patch for better avalanche!!!	if (n & 1) /* Misho ;) patch for better avalanche!!! */
n ^= 0xC0A0A0D5; // Polynom CRC-32 aviation	n ^= POLY_CRC32; /* Polynom CRC-32 aviation */
}	}
hash = n;	hash = n;
}	}
Line 77 hash_varchar(const char *csStr, int nStrLen, int nVer)	Line 78 hash_varchar(const char *csStr, int nStrLen, int nVer)
}	}

/*	/*
* hash_bernstein() Compute index hash by Bernstein	* hash_bernstein() - Compute index hash by Bernstein
	*
* @csStr = Input data buffer	* @csStr = Input data buffer
* @nStrLen = Length of data buffer	* @nStrLen = Length of data buffer
* @nVer = Version of algorythm; 0 - Bernstein, 1 - DJBX33A variant	* @nVer = Version of algorythm; 0 - Bernstein, 1 - DJBX33A variant
Line 86 hash_varchar(const char *csStr, int nStrLen, int nVer)	Line 88 hash_varchar(const char *csStr, int nStrLen, int nVer)
inline u_int	inline u_int
hash_bernstein(const char *csStr, int nStrLen, int nVer)	hash_bernstein(const char *csStr, int nStrLen, int nVer)
{	{
register u_int hash = 5381;	register u_int hash = INIT_BERNSTEIN;
register int i;	register int i;

assert(csStr);	assert(csStr);
Line 95 hash_bernstein(const char *csStr, int nStrLen, int nVe	Line 97 hash_bernstein(const char *csStr, int nStrLen, int nVe
if (!nVer)	if (!nVer)
hash = ((hash << 5) + hash) + csStr[i];	hash = ((hash << 5) + hash) + csStr[i];
else	else
hash = hash * 33 + csStr[i]; // DJBX33A	hash = hash * 33 + csStr[i]; /* DJBX33A */

return hash;	return hash;
}	}

/*	/*
* hash_fnv1() Compute index hash by FNV-1	* hash_fnv1() - Compute index hash by FNV-1
	*
* @csStr = Input data buffer	* @csStr = Input data buffer
* @nStrLen = Length of data buffer	* @nStrLen = Length of data buffer
* @nVer = Version of algorythm; 0 - FNV-1, 1 - FNV-1a (best avalanche)	* @nVer = Version of algorythm; 0 - FNV-1, 1 - FNV-1a (best avalanche)
Line 110 hash_bernstein(const char *csStr, int nStrLen, int nVe	Line 113 hash_bernstein(const char *csStr, int nStrLen, int nVe
inline u_int	inline u_int
hash_fnv1(const char *csStr, int nStrLen, int nVer)	hash_fnv1(const char *csStr, int nStrLen, int nVer)
{	{
register u_int hash = 0x811c9dc5; // 2166136261	register u_int hash = INIT_FNV1;
register int i;	register int i;

assert(csStr);	assert(csStr);

for (i = 0; i < nStrLen; i++)	for (i = 0; i < nStrLen; i++)
if (!nVer) { // FNV-1	if (!nVer) { /* FNV-1 */
hash *= 16777619;	hash *= POLY_FNV1;
hash ^= csStr[i];	hash ^= csStr[i];
} else { // FNV-1a	} else { /* FNV-1a */
hash ^= csStr[i];	hash ^= csStr[i];
hash *= 16777619;	hash *= POLY_FNV1;
}	}

return hash;	return hash;
}	}

/*	/*
* hash_jenkins() Compute index hash by Jenkins (one-at-a-time)	* hash_jenkins() - Compute index hash by Jenkins (one-at-a-time)
	*
* @csStr = Input data buffer	* @csStr = Input data buffer
* @nStrLen = Length of data buffer	* @nStrLen = Length of data buffer
* return: Hash value	* return: Hash value
Line 154 hash_jenkins(const char *csStr, int nStrLen)	Line 158 hash_jenkins(const char *csStr, int nStrLen)
}	}

/*	/*
* hash_reddragon() Compute index hash by Red Dragon	* hash_reddragon() - Compute index hash by Red Dragon
	*
* @csStr = Input data buffer	* @csStr = Input data buffer
* @nStrLen = Length of data buffer	* @nStrLen = Length of data buffer
* return: Hash value	* return: Hash value

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>

Removed from v.1.2
changed lines
	Added in v.1.3