diff options
| author | Roger Sayle <roger@eyesopen.com> | 2006-02-26 15:36:52 +0000 |
|---|---|---|
| committer | Roger Sayle <sayle@gcc.gnu.org> | 2006-02-26 15:36:52 +0000 |
| commit | a861485caf6698fe171b1d80a78f3f73091615eb (patch) | |
| tree | 54fbe907a418470a9df428739064819f26fcfdfd /gcc/tree-ssa-alias.c | |
| parent | cd683f6da56b08d6cde14e25cd453ea0cc88521f (diff) | |
| download | gcc-a861485caf6698fe171b1d80a78f3f73091615eb.zip gcc-a861485caf6698fe171b1d80a78f3f73091615eb.tar.gz gcc-a861485caf6698fe171b1d80a78f3f73091615eb.tar.bz2 | |
re PR tree-optimization/21137 (Convert (a >> 2) & 1 != 0 into a & 4 != 0)
2006-02-26 Roger Sayle <roger@eyesopen.com>
James A. Morrison <phython@gcc.gnu.org>
PR middle-end/21137
* fold-const.c (fold_binary) <EQ_EXPR>: Fold ((X>>C1)&C2) eq/ne 0,
when C2 is a power of two, as either (X&(C2<<C1)) eq/ne 0 if the
new constant C2<<C1, or as (X<0) or (X,false) depending upon the
signedness of the shift operation.
* gcc.dg/fold-eqandshift-1.c: New test case.
Co-Authored-By: James A. Morrison <phython@gcc.gnu.org>
From-SVN: r111453
Diffstat (limited to 'gcc/tree-ssa-alias.c')
0 files changed, 0 insertions, 0 deletions