mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-26 10:36:06 +00:00
76ead96c1d
Using `LoopLikeOpInterface` as the basis for the implementation unifies all the tiling logic for both `scf.for` and `scf.forall`. The only difference is the actual loop generation. This is a follow up to https://github.com/llvm/llvm-project/pull/72178 Instead of many entry points for each loop type, the loop type is now passed as part of the options passed to the tiling method. This is a breaking change with the following changes 1) The `scf::tileUsingSCFForOp` is renamed to `scf::tileUsingSCF` 2) The `scf::tileUsingSCFForallOp` is deprecated. The same functionality is obtained by using `scf::tileUsingSCF` and setting the loop type in `scf::SCFTilingOptions` passed into this method to `scf::SCFTilingOptions::LoopType::ForallOp` (using the `setLoopType` method). 3) The `scf::tileConsumerAndFusedProducerGreedilyUsingSCFForOp` is renamed to `scf::tileConsumerAndFuseProducerUsingSCF`. The use of the `controlFn` in `scf::SCFTileAndFuseOptions` allows implementing any strategy with the default callback implemeting the greedy fusion. 4) The `scf::SCFTilingResult` and `scf::SCFTileAndFuseResult` now use `SmallVector<LoopLikeOpInterface>`. 5) To make `scf::ForallOp` implement the parts of `LoopLikeOpInterface` needed, the `getOutputBlockArguments()` method is replaced with `getRegionIterArgs()` These changes now bring the tiling and fusion capabilities using `scf.forall` on par with what was already supported by `scf.for`
116 lines
4.5 KiB
C++
116 lines
4.5 KiB
C++
//===- LoopLikeInterface.cpp - Loop-like operations in MLIR ---------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Interfaces/LoopLikeInterface.h"
|
|
|
|
#include "mlir/Interfaces/FunctionInterfaces.h"
|
|
#include "llvm/ADT/DenseSet.h"
|
|
|
|
using namespace mlir;
|
|
|
|
/// Include the definitions of the loop-like interfaces.
|
|
#include "mlir/Interfaces/LoopLikeInterface.cpp.inc"
|
|
|
|
bool LoopLikeOpInterface::blockIsInLoop(Block *block) {
|
|
Operation *parent = block->getParentOp();
|
|
|
|
// The block could be inside a loop-like operation
|
|
if (isa<LoopLikeOpInterface>(parent) ||
|
|
parent->getParentOfType<LoopLikeOpInterface>())
|
|
return true;
|
|
|
|
// This block might be nested inside another block, which is in a loop
|
|
if (!isa<FunctionOpInterface>(parent))
|
|
if (mlir::Block *parentBlock = parent->getBlock())
|
|
if (blockIsInLoop(parentBlock))
|
|
return true;
|
|
|
|
// Or the block could be inside a control flow graph loop:
|
|
// A block is in a control flow graph loop if it can reach itself in a graph
|
|
// traversal
|
|
DenseSet<Block *> visited;
|
|
SmallVector<Block *> stack;
|
|
stack.push_back(block);
|
|
while (!stack.empty()) {
|
|
Block *current = stack.pop_back_val();
|
|
auto [it, inserted] = visited.insert(current);
|
|
if (!inserted) {
|
|
// loop detected
|
|
if (current == block)
|
|
return true;
|
|
continue;
|
|
}
|
|
|
|
stack.reserve(stack.size() + current->getNumSuccessors());
|
|
for (Block *successor : current->getSuccessors())
|
|
stack.push_back(successor);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
LogicalResult detail::verifyLoopLikeOpInterface(Operation *op) {
|
|
// Note: These invariants are also verified by the RegionBranchOpInterface,
|
|
// but the LoopLikeOpInterface provides better error messages.
|
|
auto loopLikeOp = cast<LoopLikeOpInterface>(op);
|
|
|
|
// Verify number of inits/iter_args/yielded values/loop results.
|
|
if (loopLikeOp.getInits().size() != loopLikeOp.getRegionIterArgs().size())
|
|
return op->emitOpError("different number of inits and region iter_args: ")
|
|
<< loopLikeOp.getInits().size()
|
|
<< " != " << loopLikeOp.getRegionIterArgs().size();
|
|
if (!loopLikeOp.getYieldedValues().empty() &&
|
|
loopLikeOp.getRegionIterArgs().size() !=
|
|
loopLikeOp.getYieldedValues().size())
|
|
return op->emitOpError(
|
|
"different number of region iter_args and yielded values: ")
|
|
<< loopLikeOp.getRegionIterArgs().size()
|
|
<< " != " << loopLikeOp.getYieldedValues().size();
|
|
if (loopLikeOp.getLoopResults() && loopLikeOp.getLoopResults()->size() !=
|
|
loopLikeOp.getRegionIterArgs().size())
|
|
return op->emitOpError(
|
|
"different number of loop results and region iter_args: ")
|
|
<< loopLikeOp.getLoopResults()->size()
|
|
<< " != " << loopLikeOp.getRegionIterArgs().size();
|
|
|
|
// Verify types of inits/iter_args/yielded values/loop results.
|
|
int64_t i = 0;
|
|
auto yieldedValues = loopLikeOp.getYieldedValues();
|
|
for (const auto [index, init, regionIterArg] :
|
|
llvm::enumerate(loopLikeOp.getInits(), loopLikeOp.getRegionIterArgs())) {
|
|
if (init.getType() != regionIterArg.getType())
|
|
return op->emitOpError(std::to_string(index))
|
|
<< "-th init and " << index
|
|
<< "-th region iter_arg have different type: " << init.getType()
|
|
<< " != " << regionIterArg.getType();
|
|
if (!yieldedValues.empty()) {
|
|
if (regionIterArg.getType() != yieldedValues[index].getType())
|
|
return op->emitOpError(std::to_string(index))
|
|
<< "-th region iter_arg and " << index
|
|
<< "-th yielded value have different type: "
|
|
<< regionIterArg.getType()
|
|
<< " != " << yieldedValues[index].getType();
|
|
}
|
|
++i;
|
|
}
|
|
i = 0;
|
|
if (loopLikeOp.getLoopResults()) {
|
|
for (const auto it : llvm::zip_equal(loopLikeOp.getRegionIterArgs(),
|
|
*loopLikeOp.getLoopResults())) {
|
|
if (std::get<0>(it).getType() != std::get<1>(it).getType())
|
|
return op->emitOpError(std::to_string(i))
|
|
<< "-th region iter_arg and " << i
|
|
<< "-th loop result have different type: "
|
|
<< std::get<0>(it).getType()
|
|
<< " != " << std::get<1>(it).getType();
|
|
}
|
|
++i;
|
|
}
|
|
|
|
return success();
|
|
}
|