Skip to content

R
riscv-gcc-1
Commit 9ea65ca6 by Marek Polacek Committed by Marek Polacek
Options

match.pd ((x ^ y) ^ (x | y) -> x & y, (x & y) + (x ^ y) -> x | y, (x & y) | (x ^… 

match.pd ((x ^ y) ^ (x | y) -> x & y, (x & y) + (x ^ y) -> x | y, (x & y) | (x ^ y) -> x | y, (x & y) ^ (x ^ y) -> x | y, (x & y) + (x | y) -> x + y, (x | y) - (x ^ y) -> x & y, (x | y) - (x & y) -> x ^ y): New patterns.

	* match.pd ((x ^ y) ^ (x | y) -> x & y,
	(x & y) + (x ^ y) -> x | y, (x & y) | (x ^ y) -> x | y,
	(x & y) ^ (x ^ y) -> x | y, (x & y) + (x | y) -> x + y,
	(x | y) - (x ^ y) -> x & y, (x | y) - (x & y) -> x ^ y): New patterns.

	* gcc.dg/fold-ior-1.c: New test.
	* gcc.dg/fold-minus-2.c: New test.
	* gcc.dg/fold-minus-3.c: New test.
	* gcc.dg/fold-plus-1.c: New test.
	* gcc.dg/fold-plus-2.c: New test.
	* gcc.dg/fold-xor-4.c: New test.
	* gcc.dg/fold-xor-5.c: New test.

From-SVN: r224734
parent f4f9641b
Showing with 465 additions and 0 deletions
gcc/ChangeLog
2015-06-22 Marek Polacek <polacek@redhat.com>
* match.pd ((x ^ y) ^ (x | y) -> x & y,
(x & y) + (x ^ y) -> x | y, (x & y) | (x ^ y) -> x | y,
(x & y) ^ (x ^ y) -> x | y, (x & y) + (x | y) -> x + y,
(x | y) - (x ^ y) -> x & y, (x | y) - (x & y) -> x ^ y): New patterns.
2015-06-22 Uros Bizjak <ubizjak@gmail.com> 2015-06-22 Uros Bizjak <ubizjak@gmail.com>
PR target/65871 PR target/65871
......
gcc/match.pd
...@@ -325,6 +325,34 @@ along with GCC; see the file COPYING3. If not see ...@@ -325,6 +325,34 @@ along with GCC; see the file COPYING3. If not see
(bit_xor:c (bit_and @0 @1) (bit_ior @0 @1)) (bit_xor:c (bit_and @0 @1) (bit_ior @0 @1))
(bit_xor @0 @1)) (bit_xor @0 @1))
/* (x ^ y) ^ (x | y) -> x & y */
(simplify
(bit_xor:c (bit_xor @0 @1) (bit_ior @0 @1))
(bit_and @0 @1))
/* (x & y) + (x ^ y) -> x | y */
/* (x & y) | (x ^ y) -> x | y */
/* (x & y) ^ (x ^ y) -> x | y */
(for op (plus bit_ior bit_xor)
(simplify
(op:c (bit_and @0 @1) (bit_xor @0 @1))
(bit_ior @0 @1)))
/* (x & y) + (x | y) -> x + y */
(simplify
(plus:c (bit_and @0 @1) (bit_ior @0 @1))
(plus @0 @1))
/* (x | y) - (x ^ y) -> x & y */
(simplify
(minus (bit_ior @0 @1) (bit_xor @0 @1))
(bit_and @0 @1))
/* (x | y) - (x & y) -> x ^ y */
(simplify
(minus (bit_ior @0 @1) (bit_and @0 @1))
(bit_xor @0 @1))
(simplify (simplify
(abs (negate @0)) (abs (negate @0))
(abs @0)) (abs @0))
......
gcc/testsuite/ChangeLog
2015-06-22 Marek Polacek <polacek@redhat.com>
* gcc.dg/fold-ior-1.c: New test.
* gcc.dg/fold-minus-2.c: New test.
* gcc.dg/fold-minus-3.c: New test.
* gcc.dg/fold-plus-1.c: New test.
* gcc.dg/fold-plus-2.c: New test.
* gcc.dg/fold-xor-4.c: New test.
* gcc.dg/fold-xor-5.c: New test.
2015-06-22 Bill Schmidt <wschmidt@linux.vnet.ibm.com> 2015-06-22 Bill Schmidt <wschmidt@linux.vnet.ibm.com>
PR target/65914 PR target/65914
......
gcc/testsuite/gcc.dg/fold-ior-1.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a & b;
int tem2 = a ^ b;
return tem1 | tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b & a;
int tem2 = a ^ b;
return tem1 | tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a & b;
int tem2 = b ^ a;
return tem1 | tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b & a;
int tem2 = b ^ a;
return tem1 | tem2;
}
int
fn5 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = a & b;
return tem1 | tem2;
}
int
fn6 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = a & b;
return tem1 | tem2;
}
int
fn7 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = b & a;
return tem1 | tem2;
}
int
fn8 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = b & a;
return tem1 | tem2;
}
/* { dg-final { scan-tree-dump-not " & " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\^ " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-minus-2.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a | b;
int tem2 = a ^ b;
return tem1 - tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b | a;
int tem2 = a ^ b;
return tem1 - tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a | b;
int tem2 = b ^ a;
return tem1 - tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b | a;
int tem2 = b ^ a;
return tem1 - tem2;
}
/* { dg-final { scan-tree-dump-not " \\^ " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\| " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-minus-3.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a | b;
int tem2 = a & b;
return tem1 - tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b | a;
int tem2 = a & b;
return tem1 - tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a | b;
int tem2 = b & a;
return tem1 - tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b | a;
int tem2 = b & a;
return tem1 - tem2;
}
/* { dg-final { scan-tree-dump-not " \\| " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " & " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-plus-1.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a & b;
int tem2 = a ^ b;
return tem1 + tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b & a;
int tem2 = a ^ b;
return tem1 + tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a & b;
int tem2 = b ^ a;
return tem1 + tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b & a;
int tem2 = b ^ a;
return tem1 + tem2;
}
int
fn5 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = a & b;
return tem1 + tem2;
}
int
fn6 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = a & b;
return tem1 + tem2;
}
int
fn7 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = b & a;
return tem1 + tem2;
}
int
fn8 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = b & a;
return tem1 + tem2;
}
/* { dg-final { scan-tree-dump-not " & " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\^ " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\+ " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-plus-2.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a & b;
int tem2 = a | b;
return tem1 + tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b & a;
int tem2 = a | b;
return tem1 + tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a & b;
int tem2 = b | a;
return tem1 + tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b & a;
int tem2 = b | a;
return tem1 + tem2;
}
int
fn5 (int a, int b)
{
int tem1 = a | b;
int tem2 = a & b;
return tem1 + tem2;
}
int
fn6 (int a, int b)
{
int tem1 = b | a;
int tem2 = a & b;
return tem1 + tem2;
}
int
fn7 (int a, int b)
{
int tem1 = a | b;
int tem2 = b & a;
return tem1 + tem2;
}
int
fn8 (int a, int b)
{
int tem1 = b | a;
int tem2 = b & a;
return tem1 + tem2;
}
/* { dg-final { scan-tree-dump-not " & " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\| " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-xor-4.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a & b;
int tem2 = a ^ b;
return tem1 ^ tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b & a;
int tem2 = a ^ b;
return tem1 ^ tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a & b;
int tem2 = b ^ a;
return tem1 ^ tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b & a;
int tem2 = b ^ a;
return tem1 ^ tem2;
}
int
fn5 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = a & b;
return tem1 ^ tem2;
}
int
fn6 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = a & b;
return tem1 ^ tem2;
}
int
fn7 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = b & a;
return tem1 ^ tem2;
}
int
fn8 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = b & a;
return tem1 ^ tem2;
}
/* { dg-final { scan-tree-dump-not " & " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\^ " "cddce1" } } */
gcc/testsuite/gcc.dg/fold-xor-5.c 0 → 100644
/* { dg-do compile } */
/* { dg-options "-O -fdump-tree-cddce1" } */
int
fn1 (int a, int b)
{
int tem1 = a | b;
int tem2 = a ^ b;
return tem1 ^ tem2;
}
int
fn2 (int a, int b)
{
int tem1 = b | a;
int tem2 = a ^ b;
return tem1 ^ tem2;
}
int
fn3 (int a, int b)
{
int tem1 = a | b;
int tem2 = b ^ a;
return tem1 ^ tem2;
}
int
fn4 (int a, int b)
{
int tem1 = b | a;
int tem2 = b ^ a;
return tem1 ^ tem2;
}
int
fn5 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = a | b;
return tem1 ^ tem2;
}
int
fn6 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = a | b;
return tem1 ^ tem2;
}
int
fn7 (int a, int b)
{
int tem1 = a ^ b;
int tem2 = b | a;
return tem1 ^ tem2;
}
int
fn8 (int a, int b)
{
int tem1 = b ^ a;
int tem2 = b | a;
return tem1 ^ tem2;
}
/* { dg-final { scan-tree-dump-not " \\| " "cddce1" } } */
/* { dg-final { scan-tree-dump-not " \\^ " "cddce1" } } */
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment