5e50dd048e
This commit restructures how TypeID is implemented to ideally avoid the current problems related to shared libraries. This is done by changing the "implicit" fallback path to use the name of the type, instead of using a static template variable (which breaks shared libraries). The major downside to this is that it adds some additional initialization costs for the implicit path. Given the use of type names for uniqueness in the fallback, we also no longer allow types defined in anonymous namespaces to have an implicit TypeID. To simplify defining an ID for these classes, a new `MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID` macro was added to allow for explicitly defining a TypeID directly on an internal class. To help identify when types are using the fallback, `-debug-only=typeid` can be used to log which types are using implicit ids. This change generally only requires changes to the test passes, which are all defined in anonymous namespaces, and thus can't use the fallback any longer. Differential Revision: https://reviews.llvm.org/D122775
66 lines
2.2 KiB
C++
66 lines
2.2 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/Dialect/Affine/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, OperationPass<>> {
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestAffineLoopUnswitching)
|
|
|
|
StringRef getArgument() const final { return PASS_NAME; }
|
|
StringRef getDescription() const final {
|
|
return "Tests affine loop unswitching / if/else hoisting";
|
|
}
|
|
TestAffineLoopUnswitching() = default;
|
|
TestAffineLoopUnswitching(const TestAffineLoopUnswitching &pass) = default;
|
|
|
|
void runOnOperation() override;
|
|
|
|
/// The maximum number of iterations to run this for.
|
|
constexpr static unsigned kMaxIterations = 5;
|
|
};
|
|
|
|
} // namespace
|
|
|
|
void TestAffineLoopUnswitching::runOnOperation() {
|
|
// 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.
|
|
Operation *op = getOperation();
|
|
unsigned i = 0;
|
|
do {
|
|
auto walkFn = [](AffineIfOp op) {
|
|
return succeeded(hoistAffineIfOp(op)) ? WalkResult::interrupt()
|
|
: WalkResult::advance();
|
|
};
|
|
if (op->walk(walkFn).wasInterrupted())
|
|
break;
|
|
} while (++i < kMaxIterations);
|
|
}
|
|
|
|
namespace mlir {
|
|
void registerTestAffineLoopUnswitchingPass() {
|
|
PassRegistration<TestAffineLoopUnswitching>();
|
|
}
|
|
} // namespace mlir
|