In the previous state, we were relying on forcing the linker to include all libraries in the final binary and the global initializer to self-register every piece of the system. This change help moving away from this model, and allow users to compose pieces more freely. The current change is only "fixing" the dialect registration and avoiding relying on "whole link" for the passes. The translation is still relying on the global registry, and some refactoring is needed to make this all more convenient. Differential Revision: https://reviews.llvm.org/D74461
39 lines
1.2 KiB
C++
39 lines
1.2 KiB
C++
//===- TestVectorToLoopsConversion.cpp - Test VectorTransfers lowering ----===//
|
|
//
|
|
// 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 <type_traits>
|
|
|
|
#include "mlir/Conversion/VectorToLoops/ConvertVectorToLoops.h"
|
|
#include "mlir/IR/PatternMatch.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
#include "mlir/Transforms/Passes.h"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
|
|
struct TestVectorToLoopsPass
|
|
: public FunctionPass<TestVectorToLoopsPass> {
|
|
void runOnFunction() override {
|
|
OwningRewritePatternList patterns;
|
|
auto *context = &getContext();
|
|
populateVectorToAffineLoopsConversionPatterns(context, patterns);
|
|
applyPatternsGreedily(getFunction(), patterns);
|
|
}
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
namespace mlir {
|
|
void registerTestVectorToLoopsPass() {
|
|
PassRegistration<TestVectorToLoopsPass> pass(
|
|
"test-convert-vector-to-loops",
|
|
"Converts vector transfer ops to loops over scalars and vector casts");
|
|
}
|
|
} // namespace mlir
|