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
68 lines
2.3 KiB
C++
68 lines
2.3 KiB
C++
//===- TestLoopMapping.cpp --- Parametric loop mapping 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements a pass to parametrically map scf.for loops to virtual
|
|
// processing element dimensions.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
|
#include "mlir/Dialect/Affine/LoopUtils.h"
|
|
#include "mlir/Dialect/SCF/SCF.h"
|
|
#include "mlir/IR/Builders.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
|
|
#include "llvm/ADT/SetVector.h"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
struct TestLoopMappingPass
|
|
: public PassWrapper<TestLoopMappingPass, OperationPass<>> {
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(TestLoopMappingPass)
|
|
|
|
StringRef getArgument() const final {
|
|
return "test-mapping-to-processing-elements";
|
|
}
|
|
StringRef getDescription() const final {
|
|
return "test mapping a single loop on a virtual processor grid";
|
|
}
|
|
explicit TestLoopMappingPass() = default;
|
|
|
|
void getDependentDialects(DialectRegistry ®istry) const override {
|
|
registry.insert<AffineDialect, scf::SCFDialect>();
|
|
}
|
|
|
|
void runOnOperation() override {
|
|
// SSA values for the transformation are created out of thin air by
|
|
// unregistered "new_processor_id_and_range" operations. This is enough to
|
|
// emulate mapping conditions.
|
|
SmallVector<Value, 8> processorIds, numProcessors;
|
|
getOperation()->walk([&processorIds, &numProcessors](Operation *op) {
|
|
if (op->getName().getStringRef() != "new_processor_id_and_range")
|
|
return;
|
|
processorIds.push_back(op->getResult(0));
|
|
numProcessors.push_back(op->getResult(1));
|
|
});
|
|
|
|
getOperation()->walk([&processorIds, &numProcessors](scf::ForOp op) {
|
|
// Ignore nested loops.
|
|
if (op->getParentRegion()->getParentOfType<scf::ForOp>())
|
|
return;
|
|
mapLoopToProcessorIds(op, processorIds, numProcessors);
|
|
});
|
|
}
|
|
};
|
|
} // namespace
|
|
|
|
namespace mlir {
|
|
namespace test {
|
|
void registerTestLoopMappingPass() { PassRegistration<TestLoopMappingPass>(); }
|
|
} // namespace test
|
|
} // namespace mlir
|