https://gcc.gnu.org/bugzilla/show_bug.cgi?id=124912
Drea Pinski <pinskia at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Ever confirmed|0 |1
Last reconfirmed| |2026-11-06
Keywords| |easyhack
Status|UNCONFIRMED |NEW
--- Comment #2 from Drea Pinski <pinskia at gcc dot gnu.org> ---
So the transformation is really simple:
_1 = -x_5(D);
_2 = _1 & x_5(D);
_3 = _2 + 4294967295;
_6 = __builtin_popcount (_3); [tail call]
->
_6 = __builtin_ctz(x_5(D));
if x_5(D) is known to be non-zero at this point.
