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
72 lines
2.3 KiB
C++
72 lines
2.3 KiB
C++
//===- TestLoopPermutation.cpp - Test affine loop permutation -------------===//
|
|
//
|
|
// 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 test the affine for op permutation utility.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Dialect/Affine/Analysis/Utils.h"
|
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
|
#include "mlir/Dialect/Affine/LoopUtils.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
|
|
#define PASS_NAME "test-loop-permutation"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
|
|
/// This pass applies the permutation on the first maximal perfect nest.
|
|
struct TestLoopPermutation
|
|
: public PassWrapper<TestLoopPermutation, OperationPass<>> {
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestLoopPermutation)
|
|
|
|
StringRef getArgument() const final { return PASS_NAME; }
|
|
StringRef getDescription() const final {
|
|
return "Tests affine loop permutation utility";
|
|
}
|
|
TestLoopPermutation() = default;
|
|
TestLoopPermutation(const TestLoopPermutation &pass) : PassWrapper(pass){};
|
|
|
|
void runOnOperation() override;
|
|
|
|
private:
|
|
/// Permutation specifying loop i is mapped to permList[i] in
|
|
/// transformed nest (with i going from outermost to innermost).
|
|
ListOption<unsigned> permList{*this, "permutation-map",
|
|
llvm::cl::desc("Specify the loop permutation"),
|
|
llvm::cl::OneOrMore};
|
|
};
|
|
|
|
} // namespace
|
|
|
|
void TestLoopPermutation::runOnOperation() {
|
|
|
|
SmallVector<unsigned, 4> permMap(permList.begin(), permList.end());
|
|
|
|
SmallVector<AffineForOp, 2> forOps;
|
|
getOperation()->walk([&](AffineForOp forOp) { forOps.push_back(forOp); });
|
|
|
|
for (auto forOp : forOps) {
|
|
SmallVector<AffineForOp, 6> nest;
|
|
// Get the maximal perfect nest.
|
|
getPerfectlyNestedLoops(nest, forOp);
|
|
// Permute if the nest's size is consistent with the specified
|
|
// permutation.
|
|
if (nest.size() >= 2 && nest.size() == permMap.size()) {
|
|
permuteLoops(nest, permMap);
|
|
}
|
|
}
|
|
}
|
|
|
|
namespace mlir {
|
|
void registerTestLoopPermutationPass() {
|
|
PassRegistration<TestLoopPermutation>();
|
|
}
|
|
} // namespace mlir
|