This is the mail archive of the
mailing list for the GCC project.
Re: Speed/profile of gcc3.4
- From: Jakub Jelinek <jakub at redhat dot com>
- To: Richard Guenther <rguenth at tat dot physik dot uni-tuebingen dot de>
- Cc: gcc at gcc dot gnu dot org
- Date: Tue, 20 Jan 2004 12:01:25 +0100
- Subject: Re: Speed/profile of gcc3.4
- References: <Pine.LNX.email@example.com>
- Reply-to: Jakub Jelinek <jakub at redhat dot com>
On Tue, Jan 20, 2004 at 01:42:35PM +0100, Richard Guenther wrote:
> The htab_find_slot_with_hash stuff should maybe splitted up because
> it seems heavily overloaded. Also, do we use power-of-two hashtab sizes
> only? In this case we could save the costly division/modulo calculations.
No, there are not enough primes which are power-of-two... ;)
All hash tables using libiberty/hashtable.c are using prime hashtab sizes,
ht_* in gcc/hashtable.c use power-of-two sizes.