Lines Matching defs:constructStack
119 assert(constructStack.empty() && "must exit constructs after a run");
236 if (constructStack.empty()) {
241 builder.setInsertionPoint(constructStack[0]);
275 llvm::SmallVector<mlir::Operation *> constructStack;
352 if (!constructStack.empty())
353 builder.setInsertionPoint(constructStack[0]);
355 if (!constructStack.empty())
366 constructStack.push_back(doLoop);
370 assert(!constructStack.empty() && "must contain a loop");
371 builder.setInsertionPointAfter(constructStack.pop_back_val());
390 constructStack.push_back(ifOp);
394 assert(!constructStack.empty() && "must contain an ifop");
395 builder.setInsertionPointAfter(constructStack.pop_back_val());
506 constructStack.push_back(ifOp.getOperation());
520 constructStack.push_back(whereLoopNest->outerOp);
541 constructStack.push_back(whereLoopNest->outerOp);
556 assert(!constructStack.empty() && "must contain a fir.if");
557 builder.setInsertionPointAfter(constructStack.pop_back_val());
560 assert(!constructStack.empty() && "must contain a fir.do_loop or fir.if");
561 if (mlir::isa<fir::DoLoopOp>(constructStack.back())) {
562 builder.setInsertionPointAfter(constructStack.pop_back_val());
569 auto ifOp = mlir::dyn_cast<fir::IfOp>(constructStack.back());
594 assert(!constructStack.empty() && "must contain a fir.if");
595 builder.setInsertionPointAfter(constructStack.pop_back_val());
673 !constructStack.empty()) {
686 builder.setInsertionPoint(constructStack[0]);
1080 if (constructStack.empty())
1082 mlir::Operation *outerLoop = constructStack[0];
1083 mlir::Operation *currentConstruct = constructStack.back();
1152 if (constructStack.empty()) {
1208 if (constructStack.empty() &&
1240 constructStack.push_back(loweredLhs.vectorSubscriptLoopNest->outerOp);
1248 constructStack.empty() ||
1249 dominanceInfo.properlyDominates(shape, constructStack[0]);
1272 if (constructStack.empty() ||
1273 dominanceInfo.properlyDominates(loweredLhs.lhs, constructStack[0]))
1287 constructStack.pop_back();