Use the crc64 we already use as the perfect hash function prehash

Use the same crc64 that we already use for the symbol table hash as
the perfect hash function prehash.  We appear to get radically faster
convergence this way, and the crc64 is probably *faster*, since the
table likely to be resident in memory.

1 files changed, 2 insertions, 4 deletions

diff --git a/crc64.c b/crc64.c
index be9a15bc..da41e7db 100644
--- a/crc64.c
+++ b/crc64.c
@@ -132,9 +132,8 @@ static const uint64_t crc64_tab[256] = {
     UINT64_C(0x536fa08fdfd90e51), UINT64_C(0x29b7d047efec8728),
 };
 
-uint64_t crc64(const char *str)
+uint64_t crc64(uint64_t crc, const char *str)
 {
-    uint64_t crc = UINT64_C(0xffffffffffffffff);
     uint8_t c;
 
     while ((c = *str++) != 0) {
@@ -144,9 +143,8 @@ uint64_t crc64(const char *str)
     return crc;
 }
 
-uint64_t crc64i(const char *str)
+uint64_t crc64i(uint64_t crc, const char *str)
 {
-    uint64_t crc = UINT64_C(0xffffffffffffffff);
     uint8_t c;
 
     while ((c = *str++) != 0) {