llvm/test/Transforms
Owen Anderson ec3953ff95 When determining if we can fold (x >> C1) << C2, the bits that we need to verify are zero
are not the low bits of x, but the bits that WILL be the low bits after the operation completes.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122529 91177308-0d34-0410-b5e6-96231b3b80d8
2010-12-23 23:56:24 +00:00
..
2010-09-02 22:38:56 +00:00
2010-08-03 16:19:16 +00:00
2010-08-31 18:44:03 +00:00