[Bug tree-optimization/112104] loop of ^1 should just be reduced to ^(n&1)

[cvs-commit at gcc dot gnu.org]

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

--- Comment #10 from GCC Commits <cvs-commit at gcc dot gnu.org> ---
The master branch has been updated by Georg-Johann Lay <gjl@gcc.gnu.org>:

https://gcc.gnu.org/g:6e08ab7fbbcc776ca326c10578d931761c765e02

commit r17-3750-g6e08ab7fbbcc776ca326c10578d931761c765e02
Author: Georg-Johann Lay <avr@gjlay.de>
Date:   Sat Aug 29 16:35:07 2026 +0200

    Skip sloppy gcc.dg/tree-ssa/pr112104-2.c

    This test case failed with

    .../gcc.dg/tree-ssa/pr112104-2.c:11:22: warning: unsigned conversion from
'long int' to 'unsigned int' changes value from '1118465' to '4353'
[-Woverflow]
    FAIL: gcc.dg/tree-ssa/pr112104-2.c (test for excess errors)
    Excess errors:
    .../gcc.dg/tree-ssa/pr112104-2.c:11:22: warning: unsigned conversion from
'long int' to 'unsigned int' changes value from '1118465' to '4353'
[-Woverflow]

    FAIL: gcc.dg/tree-ssa/pr112104-2.c execution test

    due to the implied assumption of int32plus.
    The test case includes pr112104-1.c so that it's not obvious how to
    re-engineer the test case without spoiling it, hence require int32plus.

    gcc/testsuite/
            PR testsuite/112104
            * gcc.dg/tree-ssa/pr112104-2.c: Require int32plus.