41f65666f6
This is still somehow a WIP, we have some issues with this interface that are not trivial to solve. This patch tries to make the concepts of RegionBranchPoint and RegionSuccessor more robust and aligned with their definition: - A `RegionBranchPoint` is either the parent (`RegionBranchOpInterface`) op or a `RegionBranchTerminatorOpInterface` operation in a nested region. - A `RegionSuccessor` is either one of the nested region or the parent `RegionBranchOpInterface` Some new methods with reasonnable default implementation are added to help resolving the flow of values across the RegionBranchOpInterface. It is still not trivial in the current state to walk the def-use chain backward with this interface. For example when you have the 3rd block argument in the entry block of a for-loop, finding the matching operands requires to know about the hidden loop iterator block argument and where the iterargs start. The API is designed around forward-tracking of the chain unfortunately. Try to reland #161575 ; I suspect a buildbot incremental build issue.
74 lines
2.4 KiB
C++
74 lines
2.4 KiB
C++
//===- ForallToFor.cpp - scf.forall to scf.for loop conversion ------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Transforms SCF.ForallOp's into SCF.ForOp's.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Dialect/SCF/Transforms/Passes.h"
|
|
|
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
|
#include "mlir/Dialect/SCF/Transforms/Transforms.h"
|
|
#include "mlir/IR/PatternMatch.h"
|
|
|
|
namespace mlir {
|
|
#define GEN_PASS_DEF_SCFFORALLTOFORLOOP
|
|
#include "mlir/Dialect/SCF/Transforms/Passes.h.inc"
|
|
} // namespace mlir
|
|
|
|
using namespace mlir;
|
|
using scf::LoopNest;
|
|
|
|
LogicalResult
|
|
mlir::scf::forallToForLoop(RewriterBase &rewriter, scf::ForallOp forallOp,
|
|
SmallVectorImpl<Operation *> *results) {
|
|
OpBuilder::InsertionGuard guard(rewriter);
|
|
rewriter.setInsertionPoint(forallOp);
|
|
|
|
Location loc = forallOp.getLoc();
|
|
SmallVector<Value> lbs = forallOp.getLowerBound(rewriter);
|
|
SmallVector<Value> ubs = forallOp.getUpperBound(rewriter);
|
|
SmallVector<Value> steps = forallOp.getStep(rewriter);
|
|
LoopNest loopNest = scf::buildLoopNest(rewriter, loc, lbs, ubs, steps);
|
|
|
|
SmallVector<Value> ivs = llvm::map_to_vector(
|
|
loopNest.loops, [](scf::ForOp loop) { return loop.getInductionVar(); });
|
|
|
|
Block *innermostBlock = loopNest.loops.back().getBody();
|
|
rewriter.eraseOp(forallOp.getBody()->getTerminator());
|
|
rewriter.inlineBlockBefore(forallOp.getBody(), innermostBlock,
|
|
innermostBlock->getTerminator()->getIterator(),
|
|
ivs);
|
|
rewriter.eraseOp(forallOp);
|
|
|
|
if (results) {
|
|
llvm::move(loopNest.loops, std::back_inserter(*results));
|
|
}
|
|
|
|
return success();
|
|
}
|
|
|
|
namespace {
|
|
struct ForallToForLoop : public impl::SCFForallToForLoopBase<ForallToForLoop> {
|
|
void runOnOperation() override {
|
|
Operation *parentOp = getOperation();
|
|
IRRewriter rewriter(parentOp->getContext());
|
|
|
|
parentOp->walk([&](scf::ForallOp forallOp) {
|
|
if (failed(scf::forallToForLoop(rewriter, forallOp))) {
|
|
return signalPassFailure();
|
|
}
|
|
});
|
|
}
|
|
};
|
|
} // namespace
|
|
|
|
std::unique_ptr<Pass> mlir::createForallToForLoopPass() {
|
|
return std::make_unique<ForallToForLoop>();
|
|
}
|