Lines Matching full:steps
87 /// bounds and steps and put them into the corresponding vectors.
90 SmallVectorImpl<Value> &steps) { in unpackRanges() argument
94 steps.emplace_back(range.stride); in unpackRanges()
138 SmallVector<Value, 4> lbs, ubs, steps; in doit() local
139 unpackRanges(loopRanges, lbs, ubs, steps); in doit()
141 edsc::loopNestBuilder(lbs, ubs, steps, iterArgInitValues, bodyBuilderFn); in doit()
162 SmallVector<Value, 4> lbs, ubs, steps; in doit() local
163 unpackRanges(loopRanges, lbs, ubs, steps); in doit()
165 // Affine loops require constant steps. in doit()
167 constantSteps.reserve(steps.size()); in doit()
168 for (Value v : steps) { in doit()
170 assert(op && "Affine loops require constant steps"); in doit()
203 generateParallelLoopNest(ValueRange lbs, ValueRange ubs, ValueRange steps, in generateParallelLoopNest() argument
209 assert(lbs.size() == steps.size());
226 edsc::loopNestBuilder(lbs[0], ubs[0], steps[0], [&](Value iv) { in __anon7ecdf6bc0202()
229 steps.drop_front(), iteratorTypes.drop_front(), in __anon7ecdf6bc0202()
239 steps.take_front(nOuterPar),
245 steps.drop_front(nOuterPar), iteratorTypes.drop_front(nOuterPar), in __anon7ecdf6bc0302()
269 steps.take_front(numProcessed),
275 steps.drop_front(numProcessed), in __anon7ecdf6bc0402()
294 steps.drop_front(numProcessed), in __anon7ecdf6bc0502()
306 steps.drop_front(numProcessed), iteratorTypes.drop_front(numProcessed),
364 ValueRange lbs(lbsStorage), ubs(ubsStorage), steps(stepsStorage); in doit() local
368 generateParallelLoopNest(lbs, ubs, steps, iteratorTypes, in doit()