![]() Function exploreDirections() in DependenceAnalysis implements a recursive algorithm for refining direction vectors. This algorithm has worst-case complexity of O(3^(n+1)) where n is the number of common loop levels. In this patch I'm adding a threshold to control the amount of time we spend in doing MIV tests (which most of the time end up resulting in over pessimistic direction vectors anyway). Reviewed By: Meinersbur Differential Revision: https://reviews.llvm.org/D107159 |
||
---|---|---|
.. | ||
AA.ll | ||
Banerjee.ll | ||
BasePtrBug.ll | ||
Constraints.ll | ||
Coupled.ll | ||
DADelin.ll | ||
Dump.ll | ||
ExactRDIV.ll | ||
ExactSIV.ll | ||
GCD.ll | ||
Invariant.ll | ||
MIVCheckConst.ll | ||
MIVMaxLevelThreshold.ll | ||
NonAffineExpr.ll | ||
NonCanonicalizedSubscript.ll | ||
PR21585.ll | ||
Preliminary.ll | ||
PreliminaryNoValidityCheckFixedSize.ll | ||
Propagating.ll | ||
Separability.ll | ||
SimpleSIVNoValidityCheck.ll | ||
SimpleSIVNoValidityCheckFixedSize.ll | ||
StrongSIV.ll | ||
SymbolicRDIV.ll | ||
SymbolicSIV.ll | ||
UsefulGEP.ll | ||
WeakCrossingSIV.ll | ||
WeakZeroDstSIV.ll | ||
WeakZeroSrcSIV.ll | ||
ZIV.ll | ||
lcssa.ll | ||
new-pm-invalidation.ll |