* tree-ssa-reassoc.c (reassociate_bb): Clarify code slighly.

From-SVN: r253740

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index b593718fa6ff1ffa2ea2a87af15b2e16e082423b..56383ef72f0b4a0466247b24e5ca4b2945443e9c 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,7 @@
+2017-10-13  Jeff Law  <law@redhat.com>
+
+       * tree-ssa-reassoc.c (reassociate_bb): Clarify code slighly.
+
 2017-10-13  Jakub Jelinek  <jakub@redhat.com>
 
        PR target/82274

diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c
index cc57ae320a3f7852056e699b4ef7f29fd6f5c12c..e0e64e16eba8f2c0667ef452a329840294abc3f3 100644 (file)
--- a/gcc/tree-ssa-reassoc.c
+++ b/gcc/tree-ssa-reassoc.c
@@ -5910,7 +5910,7 @@ reassociate_bb (basic_block bb)
                     move it to the front.  This helps ensure that we generate
                     (X & Y) & C rather than (X & C) & Y.  The former will
                     often match a canonical bit test when we get to RTL.  */
-                 if (ops.length () != 2
+                 if (ops.length () > 2
                      && (rhs_code == BIT_AND_EXPR
                          || rhs_code == BIT_IOR_EXPR
                          || rhs_code == BIT_XOR_EXPR)