| commit | 12aa70b7e981fd7f648065b94a2a9e7aaa1d66e8 | [log] [tgz] |
|---|---|---|
| author | Sanjoy Das <sanjoy@playingwithpointers.com> | Wed Mar 04 22:24:17 2015 +0000 |
| committer | Sanjoy Das <sanjoy@playingwithpointers.com> | Wed Mar 04 22:24:17 2015 +0000 |
| tree | d8fe293bd52d718e5e575a67c42824605cd89862 | |
| parent | 274eae84d81bd441a2911b3b38d57663c7caf578 [diff] |
[SCEV] make SCEV smarter about proving no-wrap. Summary: Teach SCEV to prove no overflow for an add recurrence by proving something about the range of another add recurrence a loop-invariant distance away from it. Reviewers: atrick, hfinkel Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D7980 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@231305 91177308-0d34-0410-b5e6-96231b3b80d8