Factor the (x & 2^n) ? 2^m : 0 instcombine into its own method and generalize it
authorBenjamin Kramer <benny.kra@googlemail.com>
Sat, 11 Dec 2010 09:42:59 +0000 (09:42 +0000)
committerBenjamin Kramer <benny.kra@googlemail.com>
Sat, 11 Dec 2010 09:42:59 +0000 (09:42 +0000)
commit20e3b4b380e949af32eeb4f184c51bfd62286f1a
tree7f97eebcd1c8322d1e0257e5c642042e2bd55c39
parenta9688c4b5769be7a6a89350888b3173c97fe87ed
Factor the (x & 2^n) ? 2^m : 0 instcombine into its own method and generalize it
to catch cases where n != m with a shift.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@121608 91177308-0d34-0410-b5e6-96231b3b80d8
lib/Target/X86/README.txt
lib/Transforms/InstCombine/InstCombineSelect.cpp
test/Transforms/InstCombine/select.ll