https://gcc.gnu.org/bugzilla/show_bug.cgi?id=124460
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Ever confirmed|0 |1
Last reconfirmed| |2026-03-12
Status|UNCONFIRMED |NEW
--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> ---
Confirmed. Could be also PHI-optimized?
<bb2>
...
goto bb3;
<bb3>
# f_10 = PHI <f_6(3), f_3(D)(2)>
f_6 = MIN_EXPR <f_10, 0>;
match.pd cannot represent recursive patterns like this.
(min:c@0 @0 @1)
or rather
(min:c@0 (cond^ @1 @0 @2) @3)
and optimized as
(min @2 @3)
? But as said, you cannot capture the outermost expression, but we could
open-code this in phiopt for a set of operators.