hashlittle() has to dance around fitting the key bytes into registers.
--------------------------------------------------------------------
*/
+#if 0 // libcitadel doesn't use this.
uint32_t hashword(
const uint32_t *k, /* the key, an array of uint32_t values */
size_t length, /* the length of the key, in uint32_ts */
/*------------------------------------------------------ report the result */
return c;
}
-
+#endif
/*
--------------------------------------------------------------------
(*pc) will be the same as the return value from hashword().
--------------------------------------------------------------------
*/
+#if 0 // libcitadel doesn't use this.
void hashword2 (
const uint32_t *k, /* the key, an array of uint32_t values */
size_t length, /* the length of the key, in uint32_ts */
/*------------------------------------------------------ report the result */
*pc=c; *pb=b;
}
-
+#endif
/*
-------------------------------------------------------------------------------
* the key. *pc is better mixed than *pb, so use *pc first. If you want
* a 64-bit value do something like "*pc + (((uint64_t)*pb)<<32)".
*/
+#if 0 // libcitadel doesn't use this.
void hashlittle2(
const void *key, /* the key to hash */
size_t length, /* length of the key */
final(a,b,c);
*pc=c; *pb=b;
}
-
+#endif
/*
* from hashlittle() on all machines. hashbig() takes advantage of
* big-endian byte ordering.
*/
+#if 0 // libcitadel doesn't use this.
uint32_t hashbig( const void *key, size_t length, uint32_t initval)
{
uint32_t a,b,c;
final(a,b,c);
return c;
}
-
+#endif
#ifdef SELF_TEST