| commit | f5b75932b8c23db5789ad19687c98070c551e896 | [log] [tgz] |
|---|---|---|
| author | Benjamin Kramer <benny.kra@googlemail.com> | Sat Apr 02 18:50:58 2011 +0000 |
| committer | Benjamin Kramer <benny.kra@googlemail.com> | Sat Apr 02 18:50:58 2011 +0000 |
| tree | 666688ebfc02511c84e8dee776c5b995421861e6 | |
| parent | 0b7bc77e305d8d4bd5615e54cf61f32cd0cac9c2 [diff] |
While SimplifyDemandedBits constant folds this, we can't rely on it here. It's possible to craft an input that hits the recursion limits in a way that SimplifyDemandedBits doesn't simplify the icmp but ComputeMaskedBits can infer which bits are zero. No test case as it depends on too many other things. Fixes PR9609. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128777 91177308-0d34-0410-b5e6-96231b3b80d8