ab737a8699
Add a new interface method that returns the yielded values.
Also add a verifier that checks the number of inits/iter_args/yielded
values. Most of the checked invariants (but not all of them) are already
covered by the `RegionBranchOpInterface`, but the `LoopLikeOpInterface`
now provides (additional) error messages that are easier to read.
92 lines
3.4 KiB
C++
92 lines
3.4 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.
|
|
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.getRegionIterArgs().size() !=
|
|
loopLikeOp.getYieldedValues().size())
|
|
return op->emitOpError(
|
|
"different number of region iter_args and yielded values: ")
|
|
<< loopLikeOp.getRegionIterArgs().size()
|
|
<< " != " << loopLikeOp.getYieldedValues().size();
|
|
|
|
// Verify types of inits/iter_args/yielded values.
|
|
int64_t i = 0;
|
|
for (const auto it :
|
|
llvm::zip_equal(loopLikeOp.getInits(), loopLikeOp.getRegionIterArgs(),
|
|
loopLikeOp.getYieldedValues())) {
|
|
if (std::get<0>(it).getType() != std::get<1>(it).getType())
|
|
op->emitOpError(std::to_string(i))
|
|
<< "-th init and " << i << "-th region iter_arg have different type: "
|
|
<< std::get<0>(it).getType() << " != " << std::get<1>(it).getType();
|
|
if (std::get<1>(it).getType() != std::get<2>(it).getType())
|
|
op->emitOpError(std::to_string(i))
|
|
<< "-th region iter_arg and " << i
|
|
<< "-th yielded value have different type: "
|
|
<< std::get<1>(it).getType() << " != " << std::get<2>(it).getType();
|
|
++i;
|
|
}
|
|
|
|
return success();
|
|
}
|