------- 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
