https://gcc.gnu.org/bugzilla/show_bug.cgi?id=87615
--- Comment #17 from Richard Biener <rguenth at gcc dot gnu.org> --- (In reply to Richard Biener from comment #16) > (In reply to Andrew Pinski from comment #15) > > Still: > > tree FRE : 43.43 ( 50%) 3299k ( 1%) > [...] > > I have a patch to add the limit imposed on the single-succ case also here. That's not the issue. Instead we have a very long predicated value chain, all from the lot of print_hash_value_40132 != 0 checks in the function. Limiting the number of predicates improves compile-time to tree FRE : 0.23 ( 1%) and we have the following as new winner: df reaching defs : 6.54 ( 26%)
