6 Commits

Author	SHA1	Message	Date
Arthur Eubanks	54e1bf1154	[LoopAccessAnalysis][NewPM] Fix tests to work under NPM ... Pin RUN lines with -analyze to legacy PM, add corresponding NPM RUN lines. Reviewed By: fhahn Differential Revision: https://reviews.llvm.org/D87662	2020-09-15 11:06:47 -07:00
Sean Silva	284b0324e2	[PM] Avoid getResult on a higher level in LoopAccessAnalysis ... Note that require<domtree> and require<loops> aren't needed because they come in implicitly via the loop pass manager. llvm-svn: 274712	2016-07-07 01:01:53 +00:00
Xinliang David Li	8a021317a2	[PM] Port LoopAccessInfo analysis to new PM ... It is implemented as a LoopAnalysis pass as discussed and agreed upon. llvm-svn: 274452	2016-07-02 21:18:40 +00:00
Adam Nemet	a2df750fb3	[LAA] LLE 3/6: Rename InterestingDependence to Dependences, NFC ... 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	2015-11-03 21:39:52 +00:00
Silviu Baranga	1b6b50a921	[LAA] Merge memchecks for accesses separated by a constant offset ... 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	2015-07-08 09:16:33 +00:00
Adam Nemet	df3dc5b9ca	[LoopAccesses] If shouldRetryWithRuntimeCheck, reset InterestingDependences ... 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	2015-05-18 15:37:03 +00:00