Commit a93952d2 by Jakub Jelinek Committed by Jakub Jelinek

re PR middle-end/35691 (Missed (a == 0) && (b == 0) into (a|(typeof(a)(b)) == 0…

re PR middle-end/35691 (Missed (a == 0) && (b == 0) into (a|(typeof(a)(b)) == 0 when the types don't match)

	PR middle-end/35691
	* match.pd: Simplify x == -1 & y == -1 into (x & y) == -1
	and x != -1 | y != -1 into (x & y) != -1.

	* gcc.dg/pr35691-1.c: Use -fdump-tree-forwprop1-details
	instead of -fdump-tree-forwprop-details in dg-options.
	* gcc.dg/pr35691-2.c: Likewise.
	* gcc.dg/pr35691-3.c: New test.
	* gcc.dg/pr35691-4.c: New test.

From-SVN: r253107
parent 2dc589be
2017-09-22 Jakub Jelinek <jakub@redhat.com>
PR middle-end/35691
* match.pd: Simplify x == -1 & y == -1 into (x & y) == -1
and x != -1 | y != -1 into (x & y) != -1.
2017-09-22 Steve Ellcey <sellcey@cavium.com> 2017-09-22 Steve Ellcey <sellcey@cavium.com>
* config.gcc: Add new case statement to set * config.gcc: Add new case statement to set
...@@ -630,17 +630,26 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) ...@@ -630,17 +630,26 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
(if (TYPE_UNSIGNED (type)) (if (TYPE_UNSIGNED (type))
(bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1))))) (bit_and @0 (bit_not (lshift { build_all_ones_cst (type); } @1)))))
/* PR35691: Transform
(x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
(x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
(for bitop (bit_and bit_ior) (for bitop (bit_and bit_ior)
cmp (eq ne) cmp (eq ne)
/* PR35691: Transform
(x == 0 & y == 0) -> (x | typeof(x)(y)) == 0.
(x != 0 | y != 0) -> (x | typeof(x)(y)) != 0. */
(simplify (simplify
(bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop)) (bitop (cmp @0 integer_zerop@2) (cmp @1 integer_zerop))
(if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) (if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
&& INTEGRAL_TYPE_P (TREE_TYPE (@1)) && INTEGRAL_TYPE_P (TREE_TYPE (@1))
&& TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1))) && TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
(cmp (bit_ior @0 (convert @1)) @2)))) (cmp (bit_ior @0 (convert @1)) @2)))
/* Transform:
(x == -1 & y == -1) -> (x & typeof(x)(y)) == -1.
(x != -1 | y != -1) -> (x & typeof(x)(y)) != -1. */
(simplify
(bitop (cmp @0 integer_all_onesp@2) (cmp @1 integer_all_onesp))
(if (INTEGRAL_TYPE_P (TREE_TYPE (@0))
&& INTEGRAL_TYPE_P (TREE_TYPE (@1))
&& TYPE_PRECISION (TREE_TYPE (@0)) == TYPE_PRECISION (TREE_TYPE (@1)))
(cmp (bit_and @0 (convert @1)) @2))))
/* Fold (A & ~B) - (A & B) into (A ^ B) - B. */ /* Fold (A & ~B) - (A & B) into (A ^ B) - B. */
(simplify (simplify
......
2017-09-22 Jakub Jelinek <jakub@redhat.com> 2017-09-22 Jakub Jelinek <jakub@redhat.com>
PR middle-end/35691
* gcc.dg/pr35691-1.c: Use -fdump-tree-forwprop1-details
instead of -fdump-tree-forwprop-details in dg-options.
* gcc.dg/pr35691-2.c: Likewise.
* gcc.dg/pr35691-3.c: New test.
* gcc.dg/pr35691-4.c: New test.
PR sanitizer/81929 PR sanitizer/81929
* g++.dg/ubsan/pr81929.C: New test. * g++.dg/ubsan/pr81929.C: New test.
......
/* { dg-do compile } */ /* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop-details" } */ /* { dg-options "-O2 -fdump-tree-forwprop1-details" } */
int foo(int z0, unsigned z1) int foo(int z0, unsigned z1)
{ {
......
/* { dg-do compile } */ /* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop-details" } */ /* { dg-options "-O2 -fdump-tree-forwprop1-details" } */
int foo(int z0, unsigned z1) int foo(int z0, unsigned z1)
{ {
......
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop1-details" } */
int foo(int z0, unsigned z1)
{
int t0 = (z0 == -1);
int t1 = (z1 == -1U);
int t2 = (t0 & t1);
return t2;
}
/* { dg-final { scan-tree-dump "gimple_simplified to _\[0-9\]* = \\(int\\) z1_\[0-9\]*\\(D\\);" "forwprop1" } } */
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop1-details" } */
int foo(int z0, unsigned z1)
{
int t0 = (z0 != -1);
int t1 = (z1 != -1U);
int t2 = (t0 | t1);
return t2;
}
/* { dg-final { scan-tree-dump "gimple_simplified to _\[0-9\]* = \\(int\\) z1_\[0-9\]*\\(D\\);" "forwprop1" } } */
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