expr.c (highest_pow2_factor): New case.

	* expr.c (highest_pow2_factor) <BIT_AND_EXPR>: New case.

From-SVN: r135820

1 files changed, 7 insertions, 0 deletions

diff --git a/gcc/expr.c b/gcc/expr.c
index 0a0f401..e2693d8 100644
--- a/gcc/expr.c
+++ b/gcc/expr.c
@@ -6599,6 +6599,13 @@ highest_pow2_factor (const_tree exp)
 	}
       break;
 
+    case BIT_AND_EXPR:
+      /* The highest power of two of a bit-and expression is the maximum of
+	 that of its operands.  We typically get here for a complex LHS and
+	 a constant negative power of two on the RHS to force an explicit
+	 alignment, so don't bother looking at the LHS.  */
+      return highest_pow2_factor (TREE_OPERAND (exp, 1));
+
     CASE_CONVERT:
     case SAVE_EXPR:
       return highest_pow2_factor (TREE_OPERAND (exp, 0));