From: sayle Date: Sun, 12 Nov 2006 18:41:31 +0000 (+0000) Subject: PR tree-optimization/13827 X-Git-Url: http://git.sourceforge.jp/view?a=commitdiff_plain;h=32484276f69da1dec8600428f6c9eb387aa06a2d;p=pf3gnuchains%2Fgcc-fork.git PR tree-optimization/13827 * fold-const.c (fold_binary) : Fold (X&C) op (Y&C) as ((X^Y)&C) op 0. * gcc.dg/fold-eqand-1.c: New test case. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@118727 138bc75d-0d04-0410-961f-82ee72b054a4 --- diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 081c6cfde3a..e1a2a6553ca 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2006-11-12 Roger Sayle + + PR tree-optimization/13827 + * fold-const.c (fold_binary) : Fold (X&C) op (Y&C) + as ((X^Y)&C) op 0. + 2006-11-12 Zdenek Dvorak * cfgloopmanip.c (update_single_exit_for_duplicated_loop, diff --git a/gcc/fold-const.c b/gcc/fold-const.c index 08e74a292f9..cf1df69c468 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -10818,6 +10818,49 @@ fold_binary (enum tree_code code, tree type, tree op0, tree op1) TREE_OPERAND (arg0, 0), TREE_OPERAND (arg1, 0)); + /* Fold (X & C) op (Y & C) as (X ^ Y) & C op 0", and symmetries. */ + if (TREE_CODE (arg0) == BIT_AND_EXPR + && TREE_CODE (arg1) == BIT_AND_EXPR) + { + tree arg00 = TREE_OPERAND (arg0, 0); + tree arg01 = TREE_OPERAND (arg0, 1); + tree arg10 = TREE_OPERAND (arg1, 0); + tree arg11 = TREE_OPERAND (arg1, 1); + tree itype = TREE_TYPE (arg0); + + if (operand_equal_p (arg01, arg11, 0)) + return fold_build2 (code, type, + fold_build2 (BIT_AND_EXPR, itype, + fold_build2 (BIT_XOR_EXPR, itype, + arg00, arg10), + arg01), + build_int_cst (itype, 0)); + + if (operand_equal_p (arg01, arg10, 0)) + return fold_build2 (code, type, + fold_build2 (BIT_AND_EXPR, itype, + fold_build2 (BIT_XOR_EXPR, itype, + arg00, arg11), + arg01), + build_int_cst (itype, 0)); + + if (operand_equal_p (arg00, arg11, 0)) + return fold_build2 (code, type, + fold_build2 (BIT_AND_EXPR, itype, + fold_build2 (BIT_XOR_EXPR, itype, + arg01, arg10), + arg00), + build_int_cst (itype, 0)); + + if (operand_equal_p (arg00, arg10, 0)) + return fold_build2 (code, type, + fold_build2 (BIT_AND_EXPR, itype, + fold_build2 (BIT_XOR_EXPR, itype, + arg01, arg11), + arg00), + build_int_cst (itype, 0)); + } + return NULL_TREE; case LT_EXPR: diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index c8bd6d4ef9b..5a2b502b967 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2006-11-12 Roger Sayle + + PR tree-optimization/13827 + * gcc.dg/fold-eqand-1.c: New test case. + 2006-11-11 Andrew Pinski PR rtl-opt/28812 diff --git a/gcc/testsuite/gcc.dg/fold-eqand-1.c b/gcc/testsuite/gcc.dg/fold-eqand-1.c new file mode 100644 index 00000000000..6ed5b6db0e2 --- /dev/null +++ b/gcc/testsuite/gcc.dg/fold-eqand-1.c @@ -0,0 +1,17 @@ +/* PR tree-optimization/13827 */ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-original" } */ + +unsigned foo (unsigned a, unsigned b) +{ + return (a & 0xff00) != (b & 0xff00); +} + +unsigned bar (unsigned c, unsigned d) +{ + return (c & 0xff00) == (d & 0xff00); +} + +/* { dg-final { scan-tree-dump-times "a \\^ b" 1 "original" } } */ +/* { dg-final { scan-tree-dump-times "c \\^ d" 1 "original" } } */ +/* { dg-final { cleanup-tree-dump "original" } } */