|
|
@ -290,7 +290,6 @@ uint32_t hashlittle( const void *key, size_t length, uint32_t initval)
|
|
|
|
u.ptr = key;
|
|
|
|
u.ptr = key;
|
|
|
|
if (HASH_LITTLE_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
if (HASH_LITTLE_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint8_t *k8;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
while (length > 12)
|
|
|
|
while (length > 12)
|
|
|
@ -334,7 +333,8 @@ uint32_t hashlittle( const void *key, size_t length, uint32_t initval)
|
|
|
|
|
|
|
|
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
|
|
|
|
|
|
|
|
k8 = (const uint8_t *)k;
|
|
|
|
const uint8_t *k8 = (const uint8_t *)k;
|
|
|
|
|
|
|
|
|
|
|
|
switch(length)
|
|
|
|
switch(length)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
@ -475,7 +475,6 @@ void hashlittle2(
|
|
|
|
u.ptr = key;
|
|
|
|
u.ptr = key;
|
|
|
|
if (HASH_LITTLE_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
if (HASH_LITTLE_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint8_t *k8;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
while (length > 12)
|
|
|
|
while (length > 12)
|
|
|
@ -519,7 +518,7 @@ void hashlittle2(
|
|
|
|
|
|
|
|
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
|
|
|
|
|
|
|
|
k8 = (const uint8_t *)k;
|
|
|
|
const uint8_t *k8 = (const uint8_t *)k;
|
|
|
|
switch(length)
|
|
|
|
switch(length)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
@ -652,7 +651,6 @@ uint32_t hashbig( const void *key, size_t length, uint32_t initval)
|
|
|
|
u.ptr = key;
|
|
|
|
u.ptr = key;
|
|
|
|
if (HASH_BIG_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
if (HASH_BIG_ENDIAN && ((u.i & 0x3) == 0)) {
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */
|
|
|
|
const uint8_t *k8;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
/*------ all but last block: aligned reads and affect 32 bits of (a,b,c) */
|
|
|
|
while (length > 12)
|
|
|
|
while (length > 12)
|
|
|
@ -696,7 +694,7 @@ uint32_t hashbig( const void *key, size_t length, uint32_t initval)
|
|
|
|
|
|
|
|
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
#else /* make valgrind happy */
|
|
|
|
|
|
|
|
|
|
|
|
k8 = (const uint8_t *)k;
|
|
|
|
const uint8_t *k8 = (const uint8_t *)k;
|
|
|
|
switch(length) /* all the case statements fall through */
|
|
|
|
switch(length) /* all the case statements fall through */
|
|
|
|
{
|
|
|
|
{
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
|
case 12: c+=k[2]; b+=k[1]; a+=k[0]; break;
|
|
|
|