diff options
| author | Andrew Pinski <apinski@marvell.com> | 2023-09-03 18:37:51 +0000 |
|---|---|---|
| committer | Andrew Pinski <apinski@marvell.com> | 2023-09-05 20:56:49 +0000 |
| commit | 244d1321340116b7780e78096356f69662fd0e18 (patch) | |
| tree | 484082f3c1518a654b2acc6758b350473d1a560e | |
| parent | b34f373635635fa331d2803d9232b3cfd4fd4fd1 (diff) | |
| download | gcc-244d1321340116b7780e78096356f69662fd0e18.zip gcc-244d1321340116b7780e78096356f69662fd0e18.tar.gz gcc-244d1321340116b7780e78096356f69662fd0e18.tar.bz2 | |
MATCH: Add `~MAX(~X, Y)` pattern: [PR96694]
This adds `~MAX(~X, Y)` and `~MIN(~X, Y)` patterns
that are like the `~(~a & b)` and `~(~a | b)` patterns
and allows to reduce the number of ~ by 1.
OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.
PR tree-optimization/96694
gcc/ChangeLog:
* match.pd (`~MAX(~X, Y)`, `~MIN(~X, Y)`): New patterns.
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/minmax-24.c: New test.
| -rw-r--r-- | gcc/match.pd | 7 | ||||
| -rw-r--r-- | gcc/testsuite/gcc.dg/tree-ssa/minmax-24.c | 31 |
2 files changed, 37 insertions, 1 deletions
diff --git a/gcc/match.pd b/gcc/match.pd index da68286..bccd227 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -3864,7 +3864,12 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) maxmin (max min) (simplify (minmax (bit_not:s@2 @0) (bit_not:s@3 @1)) - (bit_not (maxmin @0 @1)))) + (bit_not (maxmin @0 @1))) +/* ~MAX(~X, Y) --> MIN(X, ~Y) */ +/* ~MIN(~X, Y) --> MAX(X, ~Y) */ + (simplify + (bit_not (minmax:cs (bit_not @0) @1)) + (maxmin @0 (bit_not @1)))) /* MIN (X, Y) == X -> X <= Y */ (for minmax (min min max max) diff --git a/gcc/testsuite/gcc.dg/tree-ssa/minmax-24.c b/gcc/testsuite/gcc.dg/tree-ssa/minmax-24.c new file mode 100644 index 0000000..2b21f94 --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/minmax-24.c @@ -0,0 +1,31 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-optimized" } */ +/* PR tree-optimization/96694 */ + +static inline int min(int a, int b) +{ + return a < b ? a : b; +} + +static inline int max(int a, int b) +{ + return a > b ? a : b; +} + +int max_not(int x, int y) +{ + return ~max(~x, y); // min (x, ~y) +} +/* { dg-final { scan-tree-dump "~y_\[0-9\]+.D.;" "optimized" } } */ +/* { dg-final { scan-tree-dump-not "~x_\[0-9\]+.D.;" "optimized" } } */ +/* { dg-final { scan-tree-dump "MIN_EXPR <x_\[0-9\]+.D., _\[0-9\]+>|MIN_EXPR <_\[0-9\]+, x_\[0-9\]+.D.>" "optimized" } } */ + +int min_not(int c, int d) +{ + return ~min(~c, d); // max (c, ~d) +} +/* { dg-final { scan-tree-dump "~d_\[0-9\]+.D.;" "optimized" } } */ +/* { dg-final { scan-tree-dump-not "~c_\[0-9\]+.D.;" "optimized" } } */ +/* { dg-final { scan-tree-dump "MAX_EXPR <c_\[0-9\]+.D., _\[0-9\]+>|MIN_EXPR <_\[0-9\]+, c_\[0-9\]+.D.>" "optimized" } } */ + +/* { dg-final { scan-tree-dump-times "~" 2 "optimized" } } */ |