diff options
author | Andrew Pinski <apinski@marvell.com> | 2023-04-01 05:13:31 +0000 |
---|---|---|
committer | Andrew Pinski <apinski@marvell.com> | 2023-04-28 07:25:40 -0700 |
commit | c43819a9b4cdaa7359e55f942f20d2ce6fd49da6 (patch) | |
tree | 5469098c409b476001bde1873f8687d21f22ab3a /gcc/tree-ssa-phiopt.cc | |
parent | b9b30dbaabc8076d9265cf685f45d3b0072a09df (diff) | |
download | gcc-c43819a9b4cdaa7359e55f942f20d2ce6fd49da6.zip gcc-c43819a9b4cdaa7359e55f942f20d2ce6fd49da6.tar.gz gcc-c43819a9b4cdaa7359e55f942f20d2ce6fd49da6.tar.bz2 |
MATCH: Add patterns from phiopt's minmax_replacement
This adds a few patterns from phiopt's minmax_replacement
for (A CMP B) ? MIN/MAX<A, C> : MIN/MAX <B, C> .
It is progress to remove minmax_replacement from phiopt.
There are still some more cases dealing with constants on the
edges (0/INT_MAX) to handle in match.
OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.
gcc/ChangeLog:
* match.pd: Add patterns for
"(A CMP B) ? MIN/MAX<A, C> : MIN/MAX <B, C>".
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/minmax-16.c: Update testcase slightly.
* gcc.dg/tree-ssa/split-path-1.c: Also disable tree-loop-if-convert
as that now does the combining.
Diffstat (limited to 'gcc/tree-ssa-phiopt.cc')
0 files changed, 0 insertions, 0 deletions