forked from OSchip/llvm-project
8e8b70aa84
Simplify affine.min ops, enabling various other canonicalizations inside the peeled loop body. affine.min ops such as: ``` map = affine_map<(d0)[s0, s1] -> (s0, -d0 + s1)> %r = affine.min #affine.min #map(%iv)[%step, %ub] ``` are rewritten them into (in the case the peeled loop): ``` %r = %step ``` To determine how an affine.min op should be rewritten and to prove its correctness, FlatAffineConstraints is utilized. Differential Revision: https://reviews.llvm.org/D107222 |
||
|---|---|---|
| .. | ||
| AliasAnalysis | ||
| Presburger | ||
| AffineAnalysis.cpp | ||
| AffineStructures.cpp | ||
| AliasAnalysis.cpp | ||
| BufferViewFlowAnalysis.cpp | ||
| CMakeLists.txt | ||
| CallGraph.cpp | ||
| DataFlowAnalysis.cpp | ||
| DataLayoutAnalysis.cpp | ||
| LinearTransform.cpp | ||
| Liveness.cpp | ||
| LoopAnalysis.cpp | ||
| NestedMatcher.cpp | ||
| NumberOfExecutions.cpp | ||
| PresburgerSet.cpp | ||
| SliceAnalysis.cpp | ||
| Utils.cpp | ||