5aa6038a40
When doing topological sort we need to make sure an op is scheduled before any of the ops within its regions. Also change the algorithm to not be recursive in order to prevent potential stack overflow. Differential Revision: https://reviews.llvm.org/D113423
51 lines
1.5 KiB
C++
51 lines
1.5 KiB
C++
//===------------- TestSlice.cpp - Test slice related analisis ------------===//
|
|
//
|
|
// 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/Analysis/SliceAnalysis.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
|
|
using namespace mlir;
|
|
|
|
static const StringLiteral kOrderMarker = "__test_sort_original_idx__";
|
|
|
|
namespace {
|
|
|
|
struct TestTopologicalSortPass
|
|
: public PassWrapper<TestTopologicalSortPass, FunctionPass> {
|
|
StringRef getArgument() const final { return "test-print-topological-sort"; }
|
|
StringRef getDescription() const final {
|
|
return "Print operations in topological order";
|
|
}
|
|
void runOnFunction() override {
|
|
std::map<int, Operation *> ops;
|
|
getFunction().walk([&ops](Operation *op) {
|
|
if (auto originalOrderAttr = op->getAttrOfType<IntegerAttr>(kOrderMarker))
|
|
ops[originalOrderAttr.getInt()] = op;
|
|
});
|
|
SetVector<Operation *> sortedOp;
|
|
for (auto op : ops)
|
|
sortedOp.insert(op.second);
|
|
sortedOp = topologicalSort(sortedOp);
|
|
llvm::errs() << "Testing : " << getFunction().getName() << "\n";
|
|
for (Operation *op : sortedOp) {
|
|
op->print(llvm::errs());
|
|
llvm::errs() << "\n";
|
|
}
|
|
}
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
namespace mlir {
|
|
namespace test {
|
|
void registerTestSliceAnalysisPass() {
|
|
PassRegistration<TestTopologicalSortPass>();
|
|
}
|
|
} // namespace test
|
|
} // namespace mlir
|