diff options
| author | Andrew Pinski <apinski@marvell.com> | 2023-06-07 09:05:15 -0700 |
|---|---|---|
| committer | Andrew Pinski <apinski@marvell.com> | 2023-06-09 07:15:22 -0700 |
| commit | 55fcaa9a8bd9c8ce97ca929fc902c88cf92786a0 (patch) | |
| tree | c03f69535746514ac2d7149bebf6de015bfb0a01 /gcc/tree-vect-loop-manip.cc | |
| parent | 52c92fb3f4005051e86bb3e9c70a13fb34954cd1 (diff) | |
| download | gcc-55fcaa9a8bd9c8ce97ca929fc902c88cf92786a0.zip gcc-55fcaa9a8bd9c8ce97ca929fc902c88cf92786a0.tar.gz gcc-55fcaa9a8bd9c8ce97ca929fc902c88cf92786a0.tar.bz2 | |
Add Plus to the op list of `(zero_one == 0) ? y : z <op> y` pattern
This adds plus to the op list of `(zero_one == 0) ? y : z <op> y` patterns
which currently has bit_ior and bit_xor.
This shows up now in GCC after the boolization work that Uroš has been doing.
OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.
PR tree-optimization/97711
PR tree-optimization/110155
gcc/ChangeLog:
* match.pd ((zero_one == 0) ? y : z <op> y): Add plus to the op.
((zero_one != 0) ? z <op> y : y): Likewise.
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/branchless-cond-add-2.c: New test.
* gcc.dg/tree-ssa/branchless-cond-add.c: New test.
Diffstat (limited to 'gcc/tree-vect-loop-manip.cc')
0 files changed, 0 insertions, 0 deletions