OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

expr.c (highest_pow2_factor): New case. 

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

From-SVN: r135820
This commit is contained in:
Eric Botcazou 2008-05-23 16:38:27 +00:00 committed by Eric Botcazou
parent 4c8125f4de
commit a2acd8bf55
2 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/ChangeLog
View File

@ -1,3 +1,7 @@
2008-05-23 Eric Botcazou <ebotcazou@adacore.com>
* expr.c (highest_pow2_factor) <BIT_AND_EXPR>: New case.
2008-05-23 Steven Munroe <sjmunroe@us.ibm.com>
* config/rs6000/darwin-ldouble.c (fmsub): Eliminate the full

7
gcc/expr.c
View File

@ -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));