diff options
| author | Eikansh Gupta <quic_eikagupt@quicinc.com> | 2024-11-11 17:25:45 +0530 |
|---|---|---|
| committer | Andrew Pinski <quic_apinski@quicinc.com> | 2024-11-16 11:10:49 -0800 |
| commit | 5eadc673366c68a62264c55a570cbdfca96bbbaa (patch) | |
| tree | fac8f699c2433fba894918ab52226a758f06da35 /libphobos/README.gcc | |
| parent | 94bea5dd6c9a06ddb6244be1e5196ff5fbe2b186 (diff) | |
| download | gcc-5eadc673366c68a62264c55a570cbdfca96bbbaa.zip gcc-5eadc673366c68a62264c55a570cbdfca96bbbaa.tar.gz gcc-5eadc673366c68a62264c55a570cbdfca96bbbaa.tar.bz2 | |
MATCH: Simplify `min(a, b) op max(a, b)` to `a op b` [PR109401]
This patch simplify `min(a,b) op max(a,b)` to `a op b`. This optimization
will work for all the binary commutative operations. So, the `op` here can
be one of {plus, mult, bit_and, bit_xor, bit_ior, eq, ne, min, max}.
PR tree-optimization/109401
gcc/ChangeLog:
* match.pd (min(a,b) op max(a,b) -> a op b): New pattern.
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/pr109401.c: New test.
* gcc.dg/tree-ssa/pr109401-1.c: New test.
Signed-off-by: Eikansh Gupta <quic_eikagupt@quicinc.com>
Diffstat (limited to 'libphobos/README.gcc')
0 files changed, 0 insertions, 0 deletions