c8457eb532
This patch adds a topological sort utility and pass. A topological sort reorders the operations in a block without SSA dominance such that, as much as possible, users of values come after their producers. The utility function sorts topologically the operation range in a given block with an optional user-provided callback that can be used to virtually break cycles. The toposort pass itself recursively sorts graph regions under the target op. Reviewed By: mehdi_amini Differential Revision: https://reviews.llvm.org/D125063
34 lines
1.1 KiB
C++
34 lines
1.1 KiB
C++
//===- TopologicalSort.cpp - Topological sort 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "PassDetail.h"
|
|
#include "mlir/IR/RegionKindInterface.h"
|
|
#include "mlir/Transforms/TopologicalSortUtils.h"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
struct TopologicalSortPass : public TopologicalSortBase<TopologicalSortPass> {
|
|
void runOnOperation() override {
|
|
// Topologically sort the regions of the operation without SSA dominance.
|
|
getOperation()->walk([](RegionKindInterface op) {
|
|
for (auto &it : llvm::enumerate(op->getRegions())) {
|
|
if (op.hasSSADominance(it.index()))
|
|
continue;
|
|
for (Block &block : it.value())
|
|
sortTopologically(&block);
|
|
}
|
|
});
|
|
}
|
|
};
|
|
} // end anonymous namespace
|
|
|
|
std::unique_ptr<Pass> mlir::createTopologicalSortPass() {
|
|
return std::make_unique<TopologicalSortPass>();
|
|
}
|