This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: Faster compilation speed


On Wednesday, August 14, 2002, at 01:16  PM, Jamie Lokier wrote:

Timothy J. Wood wrote:
// This function adds an entry of 1 to the external hash table if there
// was no entry, otherwise it increments the existing entry.
IncrementExternalRC(this);
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.
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.

-tim


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]