//===- LoopUnroll.cpp - Code to perform loop unrolling --------------------===// // // 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 loop unrolling. // //===----------------------------------------------------------------------===// #include "mlir/Analysis/LoopAnalysis.h" #include "mlir/Dialect/Affine/IR/AffineOps.h" #include "mlir/Dialect/Affine/Passes.h" #include "mlir/IR/AffineExpr.h" #include "mlir/IR/AffineMap.h" #include "mlir/IR/Builders.h" #include "mlir/Pass/Pass.h" #include "mlir/Transforms/LoopUtils.h" #include "llvm/ADT/DenseMap.h" #include "llvm/Support/CommandLine.h" #include "llvm/Support/Debug.h" using namespace mlir; #define DEBUG_TYPE "affine-loop-unroll" static llvm::cl::OptionCategory clOptionsCategory(DEBUG_TYPE " options"); // Loop unrolling factor. static llvm::cl::opt clUnrollFactor( "unroll-factor", llvm::cl::desc("Use this unroll factor for all loops being unrolled"), llvm::cl::cat(clOptionsCategory)); static llvm::cl::opt clUnrollFull("unroll-full", llvm::cl::desc("Fully unroll loops"), llvm::cl::cat(clOptionsCategory)); static llvm::cl::opt clUnrollNumRepetitions( "unroll-num-reps", llvm::cl::desc("Unroll innermost loops repeatedly this many times"), llvm::cl::cat(clOptionsCategory)); static llvm::cl::opt clUnrollFullThreshold( "unroll-full-threshold", llvm::cl::Hidden, llvm::cl::desc( "Unroll all loops with trip count less than or equal to this"), llvm::cl::cat(clOptionsCategory)); namespace { // TODO: this is really a test pass and should be moved out of dialect // transforms. /// Loop unrolling pass. Unrolls all innermost loops unless full unrolling and a /// full unroll threshold was specified, in which case, fully unrolls all loops /// with trip count less than the specified threshold. The latter is for testing /// purposes, especially for testing outer loop unrolling. struct LoopUnroll : public FunctionPass { const Optional unrollFactor; const Optional unrollFull; // Callback to obtain unroll factors; if this has a callable target, takes // precedence over command-line argument or passed argument. const std::function getUnrollFactor; explicit LoopUnroll( Optional unrollFactor = None, Optional unrollFull = None, const std::function &getUnrollFactor = nullptr) : unrollFactor(unrollFactor), unrollFull(unrollFull), getUnrollFactor(getUnrollFactor) {} void runOnFunction() override; /// Unroll this for op. Returns failure if nothing was done. LogicalResult runOnAffineForOp(AffineForOp forOp); static const unsigned kDefaultUnrollFactor = 4; }; } // end anonymous namespace /// Returns true if no other affine.for ops are nested within. static bool isInnermostAffineForOp(AffineForOp forOp) { // Only for the innermost affine.for op's. bool isInnermost = true; forOp.walk([&](AffineForOp thisForOp) { // Since this is a post order walk, we are able to conclude here. isInnermost = (thisForOp == forOp); return WalkResult::interrupt(); }); return isInnermost; } /// Gathers loops that have no affine.for's nested within. static void gatherInnermostLoops(FuncOp f, SmallVectorImpl &loops) { f.walk([&](AffineForOp forOp) { if (isInnermostAffineForOp(forOp)) loops.push_back(forOp); }); } void LoopUnroll::runOnFunction() { if (clUnrollFull.getNumOccurrences() > 0 && clUnrollFullThreshold.getNumOccurrences() > 0) { // Store short loops as we walk. SmallVector loops; // Gathers all loops with trip count <= minTripCount. Do a post order walk // so that loops are gathered from innermost to outermost (or else unrolling // an outer one may delete gathered inner ones). getFunction().walk([&](AffineForOp forOp) { Optional tripCount = getConstantTripCount(forOp); if (tripCount.hasValue() && tripCount.getValue() <= clUnrollFullThreshold) loops.push_back(forOp); }); for (auto forOp : loops) loopUnrollFull(forOp); return; } unsigned numRepetitions = clUnrollNumRepetitions.getNumOccurrences() > 0 ? clUnrollNumRepetitions : 1; // If the call back is provided, we will recurse until no loops are found. FuncOp func = getFunction(); SmallVector loops; for (unsigned i = 0; i < numRepetitions || getUnrollFactor; i++) { loops.clear(); gatherInnermostLoops(func, loops); if (loops.empty()) break; bool unrolled = false; for (auto forOp : loops) unrolled |= succeeded(runOnAffineForOp(forOp)); if (!unrolled) // Break out if nothing was unrolled. break; } } /// Unrolls a 'affine.for' op. Returns success if the loop was unrolled, /// failure otherwise. The default unroll factor is 4. LogicalResult LoopUnroll::runOnAffineForOp(AffineForOp forOp) { // Use the function callback if one was provided. if (getUnrollFactor) { return loopUnrollByFactor(forOp, getUnrollFactor(forOp)); } // Unroll by the factor passed, if any. if (unrollFactor.hasValue()) return loopUnrollByFactor(forOp, unrollFactor.getValue()); // Unroll by the command line factor if one was specified. if (clUnrollFactor.getNumOccurrences() > 0) return loopUnrollByFactor(forOp, clUnrollFactor); // Unroll completely if full loop unroll was specified. if (clUnrollFull.getNumOccurrences() > 0 || (unrollFull.hasValue() && unrollFull.getValue())) return loopUnrollFull(forOp); // Unroll by four otherwise. return loopUnrollByFactor(forOp, kDefaultUnrollFactor); } std::unique_ptr> mlir::createLoopUnrollPass( int unrollFactor, int unrollFull, const std::function &getUnrollFactor) { return std::make_unique( unrollFactor == -1 ? None : Optional(unrollFactor), unrollFull == -1 ? None : Optional(unrollFull), getUnrollFactor); } static PassRegistration pass("affine-loop-unroll", "Unroll loops");