| commit | a59795c9860a9a31e6ccf3555ef0e0ca04a0dd87 | |
| author | H. Peter Anvin <hpa@zytor.com> | |
| Wed, 3 Oct 2007 00:40:00 +0000 (2 17:40 -0700) | ||
| committer | H. Peter Anvin <hpa@zytor.com> | |
| Wed, 3 Oct 2007 00:40:00 +0000 (2 17:40 -0700) | ||
| tree | 608679c4a8021e3e2e28644d1e3059a5e0091e4c | treesnapshot (tar.gz zip) |
| parent | 17394a7d8e3240c6dafddab7725d953904208e5a | commitdiff |
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.
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.