af5e83f569
This revision introduces a utility to unswitch affine.for/parallel loops by hoisting affine.if operations past surrounding affine.for/parallel. The hoisting works for both perfect/imperfect nests and in the presence of else blocks. The hoisting is currently to as outermost a level as possible. Uses a test pass to test the utility. Add convenience method Operation::getParentWithTrait<Trait>. Depends on D77487. Differential Revision: https://reviews.llvm.org/D77870
61 lines
2.0 KiB
C++
61 lines
2.0 KiB
C++
//===- TestAffineLoopUnswitching.cpp - Test affine if/else hoisting -------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements a pass to hoist affine if/else structures.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Analysis/Utils.h"
|
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
|
#include "mlir/Dialect/Affine/Utils.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
#include "mlir/Transforms/Passes.h"
|
|
|
|
#define PASS_NAME "test-affine-loop-unswitch"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
|
|
/// This pass applies the permutation on the first maximal perfect nest.
|
|
struct TestAffineLoopUnswitching
|
|
: public PassWrapper<TestAffineLoopUnswitching, FunctionPass> {
|
|
TestAffineLoopUnswitching() = default;
|
|
TestAffineLoopUnswitching(const TestAffineLoopUnswitching &pass) {}
|
|
|
|
void runOnFunction() override;
|
|
|
|
/// The maximum number of iterations to run this for.
|
|
constexpr static unsigned kMaxIterations = 5;
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
void TestAffineLoopUnswitching::runOnFunction() {
|
|
// Each hoisting invalidates a lot of IR around. Just stop the walk after the
|
|
// first if/else hoisting, and repeat until no more hoisting can be done, or
|
|
// the maximum number of iterations have been run.
|
|
auto func = getFunction();
|
|
unsigned i = 0;
|
|
do {
|
|
auto walkFn = [](AffineIfOp op) {
|
|
return succeeded(hoistAffineIfOp(op)) ? WalkResult::interrupt()
|
|
: WalkResult::advance();
|
|
};
|
|
if (func.walk(walkFn).wasInterrupted())
|
|
break;
|
|
} while (++i < kMaxIterations);
|
|
}
|
|
|
|
namespace mlir {
|
|
void registerTestAffineLoopUnswitchingPass() {
|
|
PassRegistration<TestAffineLoopUnswitching>(
|
|
PASS_NAME, "Tests affine loop unswitching / if/else hoisting");
|
|
}
|
|
} // namespace mlir
|