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, 2 deletions

diff --git a/hashtbl.c b/hashtbl.c
index cefd37f..cbe2a1b 100644
--- a/hashtbl.c
+++ b/hashtbl.c
@@ -48,7 +48,7 @@ void **hash_find(struct hash_table *head, const char *key,
 		struct hash_insert *insert)
 {
     struct hash_tbl_node *np;
-    uint64_t hash = crc64(key);
+    uint64_t hash = crc64(CRC64_INIT, key);
     struct hash_tbl_node *tbl = head->table;
     size_t mask = head->size-1;
     size_t pos  = hash & mask;
@@ -76,7 +76,7 @@ void **hash_findi(struct hash_table *head, const char *key,
 		  struct hash_insert *insert)
 {
     struct hash_tbl_node *np;
-    uint64_t hash = crc64i(key);
+    uint64_t hash = crc64i(CRC64_INIT, key);
     struct hash_tbl_node *tbl = head->table;
     size_t mask = head->size-1;
     size_t pos  = hash & mask;