This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120
- From: "steven at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 31 Mar 2004 20:44:03 -0000
- Subject: [Bug c++/13776] [tree-ssa] Many C++ compile-time regression in 3.5-tree-ssa 040120
- References: <20040120183908.13776.kgardas@objectsecurity.com>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From steven at gcc dot gnu dot org 2004-03-31 20:44 -------
I agree that a special pointer hasher would be nice. Should be easy,
just duplicate the code of iterative_hash in hashtab.c and specialize
it for void *.
But that doesn't reduce the number of find_slot calls. It's not like
the tables are sparse and we're getting tons of collisions. We just
use the hash table that much, and we should be looking into ways for
speeding it up.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=13776