[Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120

["rguenth at tat dot physik dot uni-tuebingen dot de" <gcc-bugzilla at gcc dot gnu dot org>]

------- Additional Comments From rguenth at tat dot physik dot uni-tuebingen dot de  2004-03-31 19:37 -------
Subject: Re:  [tree-ssa] Many C++ compile-time regression in
 3.5-tree-ssa 040120

steven at gcc dot gnu dot org wrote:
> ------- Additional Comments From steven at gcc dot gnu dot org  2004-03-31 19:32 -------
> C is also slower, here's the top of the oprofile on amd64 for 
> "-fno-tree-pre -O3" on a subset of Diego Novillo's cc1-i-files. 
>  
> vma      samples  %           symbol name 
> 00730fa0 117920   10.1391     htab_find_slot_with_hash 

We have a lot of pointer hashing in gcc now and I see the above, too. 
We can possibly micro-optimize the pointer hashing by introducing a 
"specialization" of the libiberty hashfn for pointers where we can 
inline both the hashing function and the comparison function.  It will 
introduce some code duplication, though (if this only was using C++ and 
templates...).

Richard.


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=13776