09dfc5713d
The greedy rewriter is used in many different flows and it has a lot of
convenience (work list management, debugging actions, tracing, etc). But
it combines two kinds of greedy behavior 1) how ops are matched, 2)
folding wherever it can.
These are independent forms of greedy and leads to inefficiency. E.g.,
cases where one need to create different phases in lowering and is
required to applying patterns in specific order split across different
passes. Using the driver one ends up needlessly retrying folding/having
multiple rounds of folding attempts, where one final run would have
sufficed.
Of course folks can locally avoid this behavior by just building their
own, but this is also a common requested feature that folks keep on
working around locally in suboptimal ways.
For downstream users, there should be no behavioral change. Updating
from the deprecated should just be a find and replace (e.g., `find ./
-type f -exec sed -i
's|applyPatternsAndFoldGreedily|applyPatternsGreedily|g' {} \;` variety)
as the API arguments hasn't changed between the two.
72 lines
2.5 KiB
C++
72 lines
2.5 KiB
C++
//===- TestPolynomialApproximation.cpp - Test math ops approximations -----===//
|
|
//
|
|
// 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 contains test passes for expanding math operations into
|
|
// polynomial approximations.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
|
#include "mlir/Dialect/Math/IR/Math.h"
|
|
#include "mlir/Dialect/Math/Transforms/Passes.h"
|
|
#include "mlir/Dialect/Vector/IR/VectorOps.h"
|
|
#include "mlir/Dialect/X86Vector/X86VectorDialect.h"
|
|
#include "mlir/Pass/Pass.h"
|
|
#include "mlir/Transforms/GreedyPatternRewriteDriver.h"
|
|
|
|
using namespace mlir;
|
|
|
|
namespace {
|
|
struct TestMathPolynomialApproximationPass
|
|
: public PassWrapper<TestMathPolynomialApproximationPass, OperationPass<>> {
|
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(
|
|
TestMathPolynomialApproximationPass)
|
|
|
|
TestMathPolynomialApproximationPass() = default;
|
|
TestMathPolynomialApproximationPass(
|
|
const TestMathPolynomialApproximationPass &pass)
|
|
: PassWrapper(pass) {}
|
|
|
|
void runOnOperation() override;
|
|
void getDependentDialects(DialectRegistry ®istry) const override {
|
|
registry.insert<arith::ArithDialect, math::MathDialect,
|
|
vector::VectorDialect>();
|
|
if (enableAvx2)
|
|
registry.insert<x86vector::X86VectorDialect>();
|
|
}
|
|
StringRef getArgument() const final {
|
|
return "test-math-polynomial-approximation";
|
|
}
|
|
StringRef getDescription() const final {
|
|
return "Test math polynomial approximations";
|
|
}
|
|
|
|
Option<bool> enableAvx2{
|
|
*this, "enable-avx2",
|
|
llvm::cl::desc("Enable approximations that emit AVX2 intrinsics via the "
|
|
"X86Vector dialect"),
|
|
llvm::cl::init(false)};
|
|
};
|
|
} // namespace
|
|
|
|
void TestMathPolynomialApproximationPass::runOnOperation() {
|
|
RewritePatternSet patterns(&getContext());
|
|
MathPolynomialApproximationOptions approxOptions;
|
|
approxOptions.enableAvx2 = enableAvx2;
|
|
populateMathPolynomialApproximationPatterns(patterns, approxOptions);
|
|
(void)applyPatternsGreedily(getOperation(), std::move(patterns));
|
|
}
|
|
|
|
namespace mlir {
|
|
namespace test {
|
|
void registerTestMathPolynomialApproximationPass() {
|
|
PassRegistration<TestMathPolynomialApproximationPass>();
|
|
}
|
|
} // namespace test
|
|
} // namespace mlir
|