//===- TestSCFUtils.cpp --- Pass to test independent SCF dialect utils ----===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // This file implements a pass to test SCF dialect utils. // //===----------------------------------------------------------------------===// #include "mlir/Dialect/Arithmetic/IR/Arithmetic.h" #include "mlir/Dialect/Func/IR/FuncOps.h" #include "mlir/Dialect/SCF/IR/SCF.h" #include "mlir/Dialect/SCF/Transforms/Transforms.h" #include "mlir/Dialect/SCF/Utils/Utils.h" #include "mlir/IR/Builders.h" #include "mlir/IR/PatternMatch.h" #include "mlir/Pass/Pass.h" #include "mlir/Transforms/GreedyPatternRewriteDriver.h" #include "llvm/ADT/SetVector.h" using namespace mlir; namespace { struct TestSCFForUtilsPass : public PassWrapper> { MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestSCFForUtilsPass) StringRef getArgument() const final { return "test-scf-for-utils"; } StringRef getDescription() const final { return "test scf.for utils"; } explicit TestSCFForUtilsPass() = default; TestSCFForUtilsPass(const TestSCFForUtilsPass &pass) : PassWrapper(pass) {} Option testReplaceWithNewYields{ *this, "test-replace-with-new-yields", llvm::cl::desc("Test replacing a loop with a new loop that returns new " "additional yeild values"), llvm::cl::init(false)}; void runOnOperation() override { func::FuncOp func = getOperation(); SmallVector toErase; if (testReplaceWithNewYields) { func.walk([&](scf::ForOp forOp) { if (forOp.getNumResults() == 0) return; auto newInitValues = forOp.getInitArgs(); if (newInitValues.empty()) return; NewYieldValueFn fn = [&](OpBuilder &b, Location loc, ArrayRef newBBArgs) { Block *block = newBBArgs.front().getOwner(); SmallVector newYieldValues; for (auto yieldVal : cast(block->getTerminator()).getResults()) { newYieldValues.push_back( b.create(loc, yieldVal, yieldVal)); } return newYieldValues; }; OpBuilder b(forOp); replaceLoopWithNewYields(b, forOp, newInitValues, fn); }); } } }; struct TestSCFIfUtilsPass : public PassWrapper> { MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestSCFIfUtilsPass) StringRef getArgument() const final { return "test-scf-if-utils"; } StringRef getDescription() const final { return "test scf.if utils"; } explicit TestSCFIfUtilsPass() = default; void runOnOperation() override { int count = 0; getOperation().walk([&](scf::IfOp ifOp) { auto strCount = std::to_string(count++); func::FuncOp thenFn, elseFn; OpBuilder b(ifOp); IRRewriter rewriter(b); if (failed(outlineIfOp(rewriter, ifOp, &thenFn, std::string("outlined_then") + strCount, &elseFn, std::string("outlined_else") + strCount))) { this->signalPassFailure(); return WalkResult::interrupt(); } return WalkResult::advance(); }); } }; static const StringLiteral kTestPipeliningLoopMarker = "__test_pipelining_loop__"; static const StringLiteral kTestPipeliningStageMarker = "__test_pipelining_stage__"; /// Marker to express the order in which operations should be after /// pipelining. static const StringLiteral kTestPipeliningOpOrderMarker = "__test_pipelining_op_order__"; static const StringLiteral kTestPipeliningAnnotationPart = "__test_pipelining_part"; static const StringLiteral kTestPipeliningAnnotationIteration = "__test_pipelining_iteration"; struct TestSCFPipeliningPass : public PassWrapper> { MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestSCFPipeliningPass) TestSCFPipeliningPass() = default; TestSCFPipeliningPass(const TestSCFPipeliningPass &) {} StringRef getArgument() const final { return "test-scf-pipelining"; } StringRef getDescription() const final { return "test scf.forOp pipelining"; } Option annotatePipeline{ *this, "annotate", llvm::cl::desc("Annote operations during loop pipelining transformation"), llvm::cl::init(false)}; Option noEpiloguePeeling{ *this, "no-epilogue-peeling", llvm::cl::desc("Use predicates instead of peeling the epilogue."), llvm::cl::init(false)}; static void getSchedule(scf::ForOp forOp, std::vector> &schedule) { if (!forOp->hasAttr(kTestPipeliningLoopMarker)) return; schedule.resize(forOp.getBody()->getOperations().size() - 1); forOp.walk([&schedule](Operation *op) { auto attrStage = op->getAttrOfType(kTestPipeliningStageMarker); auto attrCycle = op->getAttrOfType(kTestPipeliningOpOrderMarker); if (attrCycle && attrStage) { schedule[attrCycle.getInt()] = std::make_pair(op, unsigned(attrStage.getInt())); } }); } /// Helper to generate "predicated" version of `op`. For simplicity we just /// wrap the operation in a scf.ifOp operation. static Operation *predicateOp(Operation *op, Value pred, PatternRewriter &rewriter) { Location loc = op->getLoc(); auto ifOp = rewriter.create(loc, op->getResultTypes(), pred, true); // True branch. op->moveBefore(&ifOp.getThenRegion().front(), ifOp.getThenRegion().front().end()); rewriter.setInsertionPointAfter(op); rewriter.create(loc, op->getResults()); // False branch. rewriter.setInsertionPointToStart(&ifOp.getElseRegion().front()); SmallVector zeros; for (Type type : op->getResultTypes()) { zeros.push_back( rewriter.create(loc, rewriter.getZeroAttr(type))); } rewriter.create(loc, zeros); return ifOp.getOperation(); } static void annotate(Operation *op, mlir::scf::PipeliningOption::PipelinerPart part, unsigned iteration) { OpBuilder b(op); switch (part) { case mlir::scf::PipeliningOption::PipelinerPart::Prologue: op->setAttr(kTestPipeliningAnnotationPart, b.getStringAttr("prologue")); break; case mlir::scf::PipeliningOption::PipelinerPart::Kernel: op->setAttr(kTestPipeliningAnnotationPart, b.getStringAttr("kernel")); break; case mlir::scf::PipeliningOption::PipelinerPart::Epilogue: op->setAttr(kTestPipeliningAnnotationPart, b.getStringAttr("epilogue")); break; } op->setAttr(kTestPipeliningAnnotationIteration, b.getI32IntegerAttr(iteration)); } void getDependentDialects(DialectRegistry ®istry) const override { registry.insert(); } void runOnOperation() override { RewritePatternSet patterns(&getContext()); mlir::scf::PipeliningOption options; options.getScheduleFn = getSchedule; if (annotatePipeline) options.annotateFn = annotate; if (noEpiloguePeeling) { options.peelEpilogue = false; options.predicateFn = predicateOp; } scf::populateSCFLoopPipeliningPatterns(patterns, options); (void)applyPatternsAndFoldGreedily(getOperation(), std::move(patterns)); getOperation().walk([](Operation *op) { // Clean up the markers. op->removeAttr(kTestPipeliningStageMarker); op->removeAttr(kTestPipeliningOpOrderMarker); }); } }; } // namespace namespace mlir { namespace test { void registerTestSCFUtilsPass() { PassRegistration(); PassRegistration(); PassRegistration(); } } // namespace test } // namespace mlir