[Bug tree-optimization/119917] [Optimization Opportunity] Inefficient code generation for multiplication overflow detection with explicit zero checks

[pinskia at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=119917

Andrew Pinski <pinskia at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
   Last reconfirmed|                            |2025-04-24
             Status|UNCONFIRMED                 |NEW
     Ever confirmed|0                           |1

--- Comment #2 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
Confirmed. The short/char cases are different from the int and long long cases.

The char case for an example:
  _1 = (int) a_6(D);
  _2 = (int) b_5(D);
  _3 = 255 / _2;
  _7 = _1 > _3;

We don't recognize this as an overflow multiply case.