Re: [Committed] Use special-purpose hash table to speed up walk_tree

[Jakub Jelinek <jakub at redhat dot com>]

On Sat, Oct 16, 2004 at 06:37:12AM -0400, Jakub Jelinek wrote:
> On Sat, Oct 16, 2004 at 05:47:08AM -0400, Jakub Jelinek wrote:
> > But on x86-64-redhat-linux essentially makes even bootstrap impossible
> > (well, I have killed it after it spent more than 10 minutes compiling
> > insn-recog or insn-attrtab by stage1/cc1).
> > hash1's distribution is less than perfect.
> 
> For the hash function I'm trying these patches now:
> 
> (both do the same, not sure if the first one is ok regarding absolute
> portability).

With either of these patches the average chain length on the same
table (16384 pointers, 65536 slots) is 1.1, there is one occurence of 4 pointers
hashed into the same slot and 44 times 3 pointers hashed into the same
slot, but never more.

Ok to commit?  Is the #if ULONG_MAX > UINT_MAX ok, or should I commit the
one without #ifs?

	Jakub