[Bug tree-optimization/109722] ABSU == 0 is not optimized to just a == 0

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

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

--- Comment #4 from CVS Commits <cvs-commit at gcc dot gnu.org> ---
The trunk branch has been updated by Andrew Pinski <pins...@gcc.gnu.org>:

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

commit r14-488-g6fe385eac6ff8ecddb6cbdff2c706b27b5137006
Author: Andrew Pinski <apin...@marvell.com>
Date:   Thu May 4 23:37:51 2023 +0000

    MATCH: Add ABSU<a> == 0 to a == 0 simplification

    There is already an `ABS<a> == 0` to `a == 0` pattern,
    this just extends that to ABSU too.

    OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.

            PR tree-optimization/109722

    gcc/ChangeLog:

            * match.pd: Extend the `ABS<a> == 0` pattern
            to cover `ABSU<a> == 0` too.

    gcc/testsuite/ChangeLog:

            * gcc.dg/tree-ssa/abs-1.c: New test.