--- Additional Comments From pinskia at gcc dot gnu dot org 2004-11-18
12:59 ---
*** This bug has been marked as a duplicate of 15524 ***
--
What|Removed |Added
--- Additional Comments From steven at gcc dot gnu dot org 2004-10-28 15:24
---
I am tempted to call this critical. This is *the* major quadratic
bottleneck in GCC at the moment, for reasonably normal code.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=17895
--- Additional Comments From kazu at cs dot umass dot edu 2004-10-13 03:20 ---
tree_redirect_edge_and_branch needs O(n) time to redirect an edge of
a SWITCH_EXPR in the worst case, where n is the number of case labels
in a SWITHC_EXPR.
Therefore, redirecting O(n) edges costs O(n^2) in ti
