This is the mail archive of the
mailing list for the GCC project.
Re: Faster compilation speed
- From: "Timothy J. Wood" <tjw at omnigroup dot com>
- To: Jamie Lokier <egcs at tantalophile dot demon dot co dot uk>
- Cc: Dale Johannesen <dalej at apple dot com>, gcc at gcc dot gnu dot org
- Date: Wed, 14 Aug 2002 13:29:49 -0700
- Subject: Re: Faster compilation speed
On Wednesday, August 14, 2002, at 01:16 PM, Jamie Lokier wrote:
I'm not sure what you mean. The external RC table only gets modified
once every 2^N operations already (and never if the internal RC never
overflows the internal RC). Stated another way, the internal RC holds
the low order bits and the external RC holds the high order bits.
Timothy J. Wood wrote:
// This function adds an entry of 1 to the external hash table if
// was no entry, otherwise it increments the existing entry.
Nice idea, although you might be able to amortise the hash table
accesses some more by storing multiples of 64 in the external hash
table. When the internal count overflows, transfer 64 counts to the
hash table, and vice versa when it reaches zero.