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.

llvm-svn: 122529