aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorValeriy Savchenko <vsavchenko@apple.com>2020-05-05 19:42:33 +0300
committerValeriy Savchenko <vsavchenko@apple.com>2020-05-28 18:55:49 +0300
commit2a09daff0f902e70a08f2b30f3461fb8848f5ab1 (patch)
tree12106809cddc96604f122295912b7a08375bf0c0 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent47c4b8bd68698b1827f39c3056783ed042faf718 (diff)
downloadllvm-2a09daff0f902e70a08f2b30f3461fb8848f5ab1.zip
llvm-2a09daff0f902e70a08f2b30f3461fb8848f5ab1.tar.gz
llvm-2a09daff0f902e70a08f2b30f3461fb8848f5ab1.tar.bz2
[analyzer] Generalize bitwise AND rules for ranges
Summary: Previously the current solver started reasoning about bitwise AND expressions only when one of the operands is a constant. However, very similar logic could be applied to ranges. This commit addresses this shortcoming. Additionally, it refines how we deal with negative operands. rdar://problem/54359410 Differential Revision: https://reviews.llvm.org/D79434
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions