aboutsummaryrefslogtreecommitdiff
path: root/clang/lib/Serialization/Module.cpp
diff options
context:
space:
mode:
authorSanjoy Das <sanjoy@playingwithpointers.com>2015-08-21 22:22:37 +0000
committerSanjoy Das <sanjoy@playingwithpointers.com>2015-08-21 22:22:37 +0000
commitc86c162a583261007d70724a2b5a42f35e37d8a3 (patch)
tree05159e48799a50dd188909790d20688c3877a91f /clang/lib/Serialization/Module.cpp
parent47bf5c019d1fbbb65fe63dd7ca6a3e345763b770 (diff)
downloadllvm-c86c162a583261007d70724a2b5a42f35e37d8a3.zip
llvm-c86c162a583261007d70724a2b5a42f35e37d8a3.tar.gz
llvm-c86c162a583261007d70724a2b5a42f35e37d8a3.tar.bz2
Re-apply r245635, "[InstCombine] Transform A & (L - 1) u< L --> L != 0"
The original checkin was buggy, this change has a fix. Original commit message: [InstCombine] Transform A & (L - 1) u< L --> L != 0 Summary: This transform is never a pessimization at the IR level (since it replaces an `icmp` with another), and has potentiall payoffs: 1. It may make the `icmp` fold away or become loop invariant. 2. It may make the `A & (L - 1)` computation dead. This shows up in Java, in range checks generated by array accesses of the form `a[i & (a.length - 1)]`. Reviewers: reames, majnemer Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D12210 llvm-svn: 245753
Diffstat (limited to 'clang/lib/Serialization/Module.cpp')
0 files changed, 0 insertions, 0 deletions