This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/18687] [4.3/4.4/4.5 Regression] >200% compile time regression compared to gcc-3.4
- From: "rguenth at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 4 Jan 2010 23:11:29 -0000
- Subject: [Bug tree-optimization/18687] [4.3/4.4/4.5 Regression] >200% compile time regression compared to gcc-3.4
- References: <bug-18687-7958@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #50 from rguenth at gcc dot gnu dot org 2010-01-04 23:11 -------
ira_traverse_loop_tree and its callee process_bb_node_for_cost accounts for
nearly as much time as reload takes on hashes.c.
Btw, I find valgrind --tool=callgrind together with kcachegrind a better tool
for benchmarking this kind of stuff - obviously on the smaller testcases. It
has
deterministic timing at least.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18687