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

diff --git a/hashtbl.h b/hashtbl.h
index a5211414..c8f23bd4 100644
--- a/hashtbl.h
+++ b/hashtbl.h
@@ -30,8 +30,10 @@ struct hash_insert {
     struct hash_tbl_node *where;
 };
 
-uint64_t crc64(const char *string);
-uint64_t crc64i(const char *string);
+uint64_t crc64(uint64_t crc, const char *string);
+uint64_t crc64i(uint64_t crc, const char *string);
+#define CRC64_INIT UINT64_C(0xffffffffffffffff)
+
 struct hash_table *hash_init(void);
 void **hash_find(struct hash_table *head, const char *string,
 		struct hash_insert *insert);