Lines Matching defs:loops

200         SmallVector<AffineForOp, 4> loops;
201         getAffineForIVs(*user, &loops);
204         auto *it = llvm::find_if(loops, [&](AffineForOp loop) {
207         if (it == loops.end())
634                                    SmallVectorImpl<AffineForOp> *loops) {
641       loops->push_back(currAffineForOp);
644   std::reverse(loops->begin(), loops->end());
747 /// and the dst loops for those dimensions have the same bounds. Returns false
748 /// if both the src and the dst loops don't have the same bounds. Returns
789     // Limited support: we expect simple src and dst loops with a single
907   // retrieve existing dst loops from the lbOperands.
913   // Add empty IV Values for those new loops that are not equalities and,
1028 /// represented as constraints symbolic/parametric in 'loopDepth' loops
1106       // bounds expressions involve outer loops or other symbols.
1390   std::vector<SmallVector<AffineForOp, 4>> loops(numOps);
1393     getAffineForIVs(*ops[i], &loops[i]);
1395         std::min(loopDepthLimit, static_cast<unsigned>(loops[i].size()));
1402       if (loops[i - 1][d] != loops[i][d])
1406       surroundingLoops->push_back(loops[i - 1][d]);
1519   // Gather loops surrounding ops from loop nest where slice will be inserted.
1600 // TODO: Make this work with non-unit step loops.
1713     // For read-read access pairs, clear any slice bounds on sequential loops.
1714     // Get sequential loops in loop nest rooted at 'srcLoopIVs[0]'.
1810   // Update loop bounds for loops in 'sliceLoopNest'.
1846 /// Returns the nesting depth of this statement, i.e., the number of loops
1891 /// Returns the number of surrounding loops common to 'loopsA' and 'loopsB',
1892 /// where each lists loops from outer-most to inner-most in loop nest.
1969 /// Returns in 'sequentialLoops' all sequential loops in loop nest rooted