Lines Matching defs:sliceState

1045                                     const ComputationSliceState *sliceState,
1085   if (sliceState != nullptr) {
1086     operands.reserve(operands.size() + sliceState->lbOperands[0].size());
1088     for (auto extraOperand : sliceState->lbOperands[0]) {
1125   // Add lower/upper bounds on loop IVs using bounds from 'sliceState'.
1126   if (sliceState != nullptr) {
1128     for (auto operand : sliceState->lbOperands[0]) {
1131     // Add upper/lower bounds from 'sliceState' to 'cst'.
1133         cst.addSliceBounds(sliceState->ivs, sliceState->lbs, sliceState->ubs,
1134                            sliceState->lbOperands[0]);
1272   if (failed(region.compute(op, /*loopDepth=*/0, /*sliceState=*/nullptr,
1651 // bounds in 'sliceState' which represent the one loop nest's IVs in terms of
1656     bool isBackwardSlice, ComputationSliceState *sliceState) {
1676   // Add slice loop IV values to 'sliceState'.
1680                                    &sliceState->ivs);
1683   sliceState->lbs.resize(numSliceLoopIVs, AffineMap());
1684   sliceState->ubs.resize(numSliceLoopIVs, AffineMap());
1689                                         &sliceState->lbs, &sliceState->ubs);
1702   sliceState->lbOperands.resize(numSliceLoopIVs, sliceBoundOperands);
1703   sliceState->ubOperands.resize(numSliceLoopIVs, sliceBoundOperands);
1706   sliceState->insertPoint =
1727     return (buildSliceTripCountMap(*sliceState, &sliceTripCountMap) &&
1743     std::optional<bool> isMaximal = sliceState->isMaximal();
1748       sliceState->lbs[j] = AffineMap();
1749       sliceState->ubs[j] = AffineMap();
1757 /// 'sliceState', and inserts this slice into the loop nest surrounding
1769     ComputationSliceState *sliceState) {
1813     if (AffineMap lbMap = sliceState->lbs[i])
1814       forOp.setLowerBound(sliceState->lbOperands[i], lbMap);
1815     if (AffineMap ubMap = sliceState->ubs[i])
1816       forOp.setUpperBound(sliceState->ubOperands[i], ubMap);