//===- TestLoopMapping.cpp --- Parametric loop mapping pass ---------------===// // // 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 parametrically map scf.for loops to virtual // processing element dimensions. // //===----------------------------------------------------------------------===// #include "mlir/Dialect/Affine/IR/AffineOps.h" #include "mlir/Dialect/Affine/LoopUtils.h" #include "mlir/Dialect/SCF/IR/SCF.h" #include "mlir/IR/Builders.h" #include "mlir/Pass/Pass.h" using namespace mlir; using namespace mlir::affine; namespace { struct TestLoopMappingPass : public PassWrapper> { MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestLoopMappingPass) StringRef getArgument() const final { return "test-mapping-to-processing-elements"; } StringRef getDescription() const final { return "test mapping a single loop on a virtual processor grid"; } explicit TestLoopMappingPass() = default; void getDependentDialects(DialectRegistry ®istry) const override { registry.insert(); } void runOnOperation() override { // SSA values for the transformation are created out of thin air by // unregistered "new_processor_id_and_range" operations. This is enough to // emulate mapping conditions. SmallVector processorIds, numProcessors; getOperation()->walk([&processorIds, &numProcessors](Operation *op) { if (op->getName().getStringRef() != "new_processor_id_and_range") return; processorIds.push_back(op->getResult(0)); numProcessors.push_back(op->getResult(1)); }); getOperation()->walk([&processorIds, &numProcessors](scf::ForOp op) { // Ignore nested loops. if (op->getParentRegion()->getParentOfType()) return; mapLoopToProcessorIds(op, processorIds, numProcessors); }); } }; } // namespace namespace mlir { namespace test { void registerTestLoopMappingPass() { PassRegistration(); } } // namespace test } // namespace mlir