forked from OSchip/llvm-project
0e5804a6af
Summary: The checking pointer grouping algorithm assumes that the starts/ends of the pointers are well formed (start <= end). The runtime memory checking algorithm also assumes this by doing: start0 < end1 && start1 < end0 to detect conflicts. This check only works if start0 <= end0 and start1 <= end1. This change correctly orders the interval ends by either checking the stride (if it is constant) or by using min/max SCEV expressions. Reviewers: anemet, rengolin Subscribers: rengolin, llvm-commits Differential Revision: http://reviews.llvm.org/D11149 llvm-svn: 242400 |
||
|---|---|---|
| .. | ||
| backward-dep-different-types.ll | ||
| non-wrapping-pointer.ll | ||
| number-of-memchecks.ll | ||
| pointer-with-unknown-bounds.ll | ||
| resort-to-memchecks-only.ll | ||
| reverse-memcheck-bounds.ll | ||
| safe-no-checks.ll | ||
| store-to-invariant-check1.ll | ||
| store-to-invariant-check2.ll | ||
| store-to-invariant-check3.ll | ||
| stride-access-dependence.ll | ||
| underlying-objects-1.ll | ||
| underlying-objects-2.ll | ||
| unsafe-and-rt-checks.ll | ||