https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97519
--- Comment #2 from Richard Biener <rguenth at gcc dot gnu.org> --- Implemented in match.pd it will cover both. SSA backprop would be the most natural classical pass candidate but that runs after IPA. The other candidate is of course forwprop where it would be "cheaper" (not so many new patterns to match in match.pd), "chewing" ops during re-processing of processed stmts.
