https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96702
--- Comment #2 from Andrew Pinski <pinskia at gcc dot gnu.org> --- The comment says: /* To detect overflow in unsigned A - B, A < B is simpler than A - B > A. However, the detection logic for SUB_OVERFLOW in tree-ssa-math-opts.cc expects the long form, so we restrict the transformation for now. */ (for cmp (gt le) (simplify (cmp:c (minus@2 @0 @1) @0) (if (single_use (@2) I am curious if that is still true ...
