| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | [PM] Avoid getResult on a higher level in LoopAccessAnalysis | Sean Silva | 2016-07-07 | 1 | -1/+1 |
| | | | | | | | | Note that require<domtree> and require<loops> aren't needed because they come in implicitly via the loop pass manager. llvm-svn: 274712 | ||||
| * | [PM] Port LoopAccessInfo analysis to new PM | Xinliang David Li | 2016-07-02 | 1 | -0/+1 |
| | | | | | | | | It is implemented as a LoopAnalysis pass as discussed and agreed upon. llvm-svn: 274452 | ||||
| * | [LAA] LLE 3/6: Rename InterestingDependence to Dependences, NFC | Adam Nemet | 2015-11-03 | 1 | -2/+2 |
| | | | | | | | | | | | | | | | Summary: We now collect all types of dependences including lexically forward deps not just "interesting" ones. Reviewers: hfinkel Subscribers: rengolin, llvm-commits Differential Revision: http://reviews.llvm.org/D13256 llvm-svn: 251985 | ||||
| * | [LAA] Merge memchecks for accesses separated by a constant offset | Silviu Baranga | 2015-07-08 | 1 | -0/+2 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Summary: Often filter-like loops will do memory accesses that are separated by constant offsets. In these cases it is common that we will exceed the threshold for the allowable number of checks. However, it should be possible to merge such checks, sice a check of any interval againt two other intervals separated by a constant offset (a,b), (a+c, b+c) will be equivalent with a check againt (a, b+c), as long as (a,b) and (a+c, b+c) overlap. Assuming the loop will be executed for a sufficient number of iterations, this will be true. If not true, checking against (a, b+c) is still safe (although not equivalent). As long as there are no dependencies between two accesses, we can merge their checks into a single one. We use this technique to construct groups of accesses, and then check the intervals associated with the groups instead of checking the accesses directly. Reviewers: anemet Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D10386 llvm-svn: 241673 | ||||
| * | [LoopAccesses] If shouldRetryWithRuntimeCheck, reset InterestingDependences | Adam Nemet | 2015-05-18 | 1 | -0/+57 |
| When dependence analysis encounters a non-constant distance between memory accesses it aborts the analysis and falls back to run-time checks only. In this case we weren't resetting the array of dependences. llvm-svn: 237574 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|