This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/38785] huge performance regression on EEMBC bitmnp01
- From: "amylaar at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 15 Jan 2009 11:36:32 -0000
- Subject: [Bug tree-optimization/38785] huge performance regression on EEMBC bitmnp01
- References: <bug-38785-5394@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #12 from amylaar at gcc dot gnu dot org 2009-01-15 11:36 -------
(In reply to comment #11)
P.S.:
Another feature that we could look at is the number of times an input
ssa name is used. If it is used more than once, we cannot rely on the
original ssa name to go away, and hence the odds of exponential execution
time explosion are higher for doing partial-partial redundancy elimination
on an expression using such an ssa name as input.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38785