Skip to content

Add constant propagation for polynomial ops #91655

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
wants to merge 3 commits into
base: main
Choose a base branch
from
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
83 changes: 65 additions & 18 deletions mlir/include/mlir/Dialect/Polynomial/IR/Polynomial.h
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ namespace polynomial {
/// would want to specify 128-bit polynomials statically in the source code.
constexpr unsigned apintBitWidth = 64;

template <typename CoefficientType>
template <class Derived, typename CoefficientType>
class MonomialBase {
public:
MonomialBase(const CoefficientType &coeff, const APInt &expo)
Expand All @@ -55,12 +55,21 @@ class MonomialBase {
return (exponent.ult(other.exponent));
}

Derived add(const Derived &other) {
assert(exponent == other.exponent);
CoefficientType newCoeff = coefficient + other.coefficient;
Derived result;
result.setCoefficient(newCoeff);
result.setExponent(exponent);
return result;
}

virtual bool isMonic() const = 0;
virtual void
coefficientToString(llvm::SmallString<16> &coeffString) const = 0;

template <typename T>
friend ::llvm::hash_code hash_value(const MonomialBase<T> &arg);
template <class D, typename T>
friend ::llvm::hash_code hash_value(const MonomialBase<D, T> &arg);

protected:
CoefficientType coefficient;
Expand All @@ -69,15 +78,15 @@ class MonomialBase {

/// A class representing a monomial of a single-variable polynomial with integer
/// coefficients.
class IntMonomial : public MonomialBase<APInt> {
class IntMonomial : public MonomialBase<IntMonomial, APInt> {
public:
IntMonomial(int64_t coeff, uint64_t expo)
: MonomialBase(APInt(apintBitWidth, coeff), APInt(apintBitWidth, expo)) {}

IntMonomial()
: MonomialBase(APInt(apintBitWidth, 0), APInt(apintBitWidth, 0)) {}

~IntMonomial() = default;
~IntMonomial() override = default;

bool isMonic() const override { return coefficient == 1; }

Expand All @@ -88,14 +97,14 @@ class IntMonomial : public MonomialBase<APInt> {

/// A class representing a monomial of a single-variable polynomial with integer
/// coefficients.
class FloatMonomial : public MonomialBase<APFloat> {
class FloatMonomial : public MonomialBase<FloatMonomial, APFloat> {
public:
FloatMonomial(double coeff, uint64_t expo)
: MonomialBase(APFloat(coeff), APInt(apintBitWidth, expo)) {}

FloatMonomial() : MonomialBase(APFloat((double)0), APInt(apintBitWidth, 0)) {}

~FloatMonomial() = default;
~FloatMonomial() override = default;

bool isMonic() const override { return coefficient == APFloat(1.0); }

Expand All @@ -104,7 +113,7 @@ class FloatMonomial : public MonomialBase<APFloat> {
}
};

template <typename Monomial>
template <class Derived, typename Monomial>
class PolynomialBase {
public:
PolynomialBase() = delete;
Expand Down Expand Up @@ -149,6 +158,44 @@ class PolynomialBase {
}
}

Derived add(const Derived &other) {
SmallVector<Monomial> newTerms;
auto it1 = terms.begin();
auto it2 = other.terms.begin();
while (it1 != terms.end() || it2 != other.terms.end()) {
if (it1 == terms.end()) {
newTerms.emplace_back(*it2);
it2++;
continue;
}

if (it2 == other.terms.end()) {
newTerms.emplace_back(*it1);
it1++;
continue;
}

while (it1->getExponent().ult(it2->getExponent())) {
newTerms.emplace_back(*it1);
it1++;
if (it1 == terms.end())
break;
}

while (it2->getExponent().ult(it1->getExponent())) {
newTerms.emplace_back(*it2);
it2++;
if (it2 == terms.end())
break;
}

newTerms.emplace_back(it1->add(*it2));
it1++;
it2++;
}
return Derived(newTerms);
}

// Prints polynomial to 'os'.
void print(raw_ostream &os) const { print(os, " + ", "**"); }

Expand All @@ -168,8 +215,8 @@ class PolynomialBase {

ArrayRef<Monomial> getTerms() const { return terms; }

template <typename T>
friend ::llvm::hash_code hash_value(const PolynomialBase<T> &arg);
template <class D, typename T>
friend ::llvm::hash_code hash_value(const PolynomialBase<D, T> &arg);

private:
// The monomial terms for this polynomial.
Expand All @@ -179,7 +226,7 @@ class PolynomialBase {
/// A single-variable polynomial with integer coefficients.
///
/// Eg: x^1024 + x + 1
class IntPolynomial : public PolynomialBase<IntMonomial> {
class IntPolynomial : public PolynomialBase<IntPolynomial, IntMonomial> {
public:
explicit IntPolynomial(ArrayRef<IntMonomial> terms) : PolynomialBase(terms) {}

Expand All @@ -196,7 +243,7 @@ class IntPolynomial : public PolynomialBase<IntMonomial> {
/// A single-variable polynomial with double coefficients.
///
/// Eg: 1.0 x^1024 + 3.5 x + 1e-05
class FloatPolynomial : public PolynomialBase<FloatMonomial> {
class FloatPolynomial : public PolynomialBase<FloatPolynomial, FloatMonomial> {
public:
explicit FloatPolynomial(ArrayRef<FloatMonomial> terms)
: PolynomialBase(terms) {}
Expand All @@ -212,20 +259,20 @@ class FloatPolynomial : public PolynomialBase<FloatMonomial> {
};

// Make Polynomials hashable.
template <typename T>
inline ::llvm::hash_code hash_value(const PolynomialBase<T> &arg) {
template <class D, typename T>
inline ::llvm::hash_code hash_value(const PolynomialBase<D, T> &arg) {
return ::llvm::hash_combine_range(arg.terms.begin(), arg.terms.end());
}

template <typename T>
inline ::llvm::hash_code hash_value(const MonomialBase<T> &arg) {
template <class D, typename T>
inline ::llvm::hash_code hash_value(const MonomialBase<D, T> &arg) {
return llvm::hash_combine(::llvm::hash_value(arg.coefficient),
::llvm::hash_value(arg.exponent));
}

template <typename T>
template <class D, typename T>
inline raw_ostream &operator<<(raw_ostream &os,
const PolynomialBase<T> &polynomial) {
const PolynomialBase<D, T> &polynomial) {
polynomial.print(os);
return os;
}
Expand Down
80 changes: 75 additions & 5 deletions mlir/include/mlir/Dialect/Polynomial/IR/Polynomial.td
Original file line number Diff line number Diff line change
Expand Up @@ -53,6 +53,7 @@ def Polynomial_Dialect : Dialect {

let useDefaultTypePrinterParser = 1;
let useDefaultAttributePrinterParser = 1;
let hasConstantMaterializer = 1;
}

class Polynomial_Attr<string name, string attrMnemonic, list<Trait> traits = []>
Expand All @@ -61,7 +62,7 @@ class Polynomial_Attr<string name, string attrMnemonic, list<Trait> traits = []>
}

def Polynomial_IntPolynomialAttr : Polynomial_Attr<"IntPolynomial", "int_polynomial"> {
let summary = "An attribute containing a single-variable polynomial with integer coefficients.";
let summary = "an attribute containing a single-variable polynomial with integer coefficients";
let description = [{
A polynomial attribute represents a single-variable polynomial with integer
coefficients, which is used to define the modulus of a `RingAttr`, as well
Expand All @@ -83,8 +84,32 @@ def Polynomial_IntPolynomialAttr : Polynomial_Attr<"IntPolynomial", "int_polynom
let hasCustomAssemblyFormat = 1;
}

def Polynomial_TypedIntPolynomialAttr : Polynomial_Attr<
"TypedIntPolynomial", "typed_int_polynomial", [TypedAttrInterface]> {
let summary = "A typed variant of int_polynomial for constant folding.";
let parameters = (ins "::mlir::Type":$type, "::mlir::polynomial::IntPolynomialAttr":$value);
let assemblyFormat = "`<` struct(params) `>`";
let builders = [
AttrBuilderWithInferredContext<(ins "Type":$type,
"const IntPolynomial &":$value), [{
return $_get(
type.getContext(),
type,
IntPolynomialAttr::get(type.getContext(), value));
}]>,
AttrBuilderWithInferredContext<(ins "Type":$type,
"const Attribute &":$value), [{
return $_get(type.getContext(), type, ::llvm::cast<IntPolynomialAttr>(value));
}]>
];
let extraClassDeclaration = [{
// used for constFoldBinaryOp
using ValueType = ::mlir::Attribute;
}];
}

def Polynomial_FloatPolynomialAttr : Polynomial_Attr<"FloatPolynomial", "float_polynomial"> {
let summary = "An attribute containing a single-variable polynomial with double precision floating point coefficients.";
let summary = "an attribute containing a single-variable polynomial with double precision floating point coefficients";
let description = [{
A polynomial attribute represents a single-variable polynomial with double
precision floating point coefficients.
Expand All @@ -105,6 +130,30 @@ def Polynomial_FloatPolynomialAttr : Polynomial_Attr<"FloatPolynomial", "float_p
let hasCustomAssemblyFormat = 1;
}

def Polynomial_TypedFloatPolynomialAttr : Polynomial_Attr<
"TypedFloatPolynomial", "typed_float_polynomial", [TypedAttrInterface]> {
let summary = "A typed variant of float_polynomial for constant folding.";
let parameters = (ins "::mlir::Type":$type, "::mlir::polynomial::FloatPolynomialAttr":$value);
let assemblyFormat = "`<` struct(params) `>`";
let builders = [
AttrBuilderWithInferredContext<(ins "Type":$type,
"const FloatPolynomial &":$value), [{
return $_get(
type.getContext(),
type,
FloatPolynomialAttr::get(type.getContext(), value));
}]>,
AttrBuilderWithInferredContext<(ins "Type":$type,
"const Attribute &":$value), [{
return $_get(type.getContext(), type, ::llvm::cast<FloatPolynomialAttr>(value));
}]>
];
let extraClassDeclaration = [{
// used for constFoldBinaryOp
using ValueType = ::mlir::Attribute;
}];
}

def Polynomial_RingAttr : Polynomial_Attr<"Ring", "ring"> {
let summary = "An attribute specifying a polynomial ring.";
let description = [{
Expand Down Expand Up @@ -221,6 +270,7 @@ def Polynomial_AddOp : Polynomial_BinaryOp<"add", [Commutative]> {
%2 = polynomial.add %0, %1 : !polynomial.polynomial<#ring>
```
}];
let hasFolder = 1;
}

def Polynomial_SubOp : Polynomial_BinaryOp<"sub"> {
Expand Down Expand Up @@ -439,9 +489,28 @@ def Polynomial_AnyPolynomialAttr : AnyAttrOf<[
Polynomial_FloatPolynomialAttr,
Polynomial_IntPolynomialAttr
]>;
def Polynomial_PolynomialElementsAttr :
ElementsAttrBase<And<[//CPred<"::llvm::isa<::mlir::ElementsAttr>($_self)">,
CPred<[{
isa<::mlir::polynomial::PolynomialType>(
::llvm::cast<::mlir::ElementsAttr>($_self)
.getShapedType()
.getElementType())
}]>]>,
"an elements attribute containing polynomial attributes"> {
let storageType = [{ ::mlir::ElementsAttr }];
let returnType = [{ ::mlir::ElementsAttr }];
let convertFromStorage = "$_self";
}

def Polynomial_PolynomialOrElementsAttr : AnyAttrOf<[
Polynomial_FloatPolynomialAttr,
Polynomial_IntPolynomialAttr,
Polynomial_PolynomialElementsAttr,
]>;

// Not deriving from Polynomial_Op due to need for custom assembly format
def Polynomial_ConstantOp : Op<Polynomial_Dialect, "constant", [Pure]> {
def Polynomial_ConstantOp : Op<Polynomial_Dialect, "constant", [Pure, ConstantLike]> {
let summary = "Define a constant polynomial via an attribute.";
let description = [{
Example:
Expand All @@ -455,9 +524,10 @@ def Polynomial_ConstantOp : Op<Polynomial_Dialect, "constant", [Pure]> {
%0 = polynomial.constant #polynomial.float_polynomial<0.5 + 1.3e06 x**2> : !polynomial.polynomial<#float_ring>
```
}];
let arguments = (ins Polynomial_AnyPolynomialAttr:$value);
let results = (outs Polynomial_PolynomialType:$output);
let arguments = (ins Polynomial_PolynomialOrElementsAttr:$value);
let results = (outs PolynomialLike:$output);
let assemblyFormat = "attr-dict `:` type($output)";
let hasFolder = 1;
}

def Polynomial_NTTOp : Polynomial_Op<"ntt", [Pure]> {
Expand Down
14 changes: 14 additions & 0 deletions mlir/lib/Dialect/Polynomial/IR/PolynomialDialect.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -48,3 +48,17 @@ void PolynomialDialect::initialize() {
#include "mlir/Dialect/Polynomial/IR/Polynomial.cpp.inc"
>();
}

Operation *PolynomialDialect::materializeConstant(OpBuilder &builder,
Attribute value, Type type,
Location loc) {
auto intPoly = dyn_cast<TypedIntPolynomialAttr>(value);
auto floatPoly = dyn_cast<TypedFloatPolynomialAttr>(value);
if (!intPoly && !floatPoly)
return nullptr;

Type ty = intPoly ? intPoly.getType() : floatPoly.getType();
Attribute valueAttr =
intPoly ? (Attribute)intPoly.getValue() : (Attribute)floatPoly.getValue();
return builder.create<ConstantOp>(loc, ty, valueAttr);
}
37 changes: 37 additions & 0 deletions mlir/lib/Dialect/Polynomial/IR/PolynomialOps.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -7,10 +7,12 @@
//===----------------------------------------------------------------------===//

#include "mlir/Dialect/Polynomial/IR/PolynomialOps.h"
#include "mlir/Dialect/CommonFolders.h"
#include "mlir/Dialect/Polynomial/IR/Polynomial.h"
#include "mlir/Dialect/Polynomial/IR/PolynomialAttributes.h"
#include "mlir/Dialect/Polynomial/IR/PolynomialTypes.h"
#include "mlir/IR/Builders.h"
#include "mlir/IR/BuiltinAttributes.h"
#include "mlir/IR/BuiltinTypes.h"
#include "mlir/IR/Dialect.h"
#include "mlir/Support/LogicalResult.h"
Expand All @@ -19,6 +21,41 @@
using namespace mlir;
using namespace mlir::polynomial;

OpFoldResult ConstantOp::fold(ConstantOp::FoldAdaptor adaptor) {
PolynomialType ty = dyn_cast<PolynomialType>(getOutput().getType());

if (isa<FloatPolynomialAttr>(ty.getRing().getPolynomialModulus()))
return TypedFloatPolynomialAttr::get(
ty, cast<FloatPolynomialAttr>(getValue()).getPolynomial());

assert(isa<IntPolynomialAttr>(ty.getRing().getPolynomialModulus()) &&
"expected float or integer polynomial");
return TypedIntPolynomialAttr::get(
ty, cast<IntPolynomialAttr>(getValue()).getPolynomial());
}

OpFoldResult AddOp::fold(AddOp::FoldAdaptor adaptor) {
auto lhsElements = dyn_cast<ShapedType>(getLhs().getType());
PolynomialType elementType = cast<PolynomialType>(
lhsElements ? lhsElements.getElementType() : getLhs().getType());
MLIRContext *context = getContext();

if (isa<FloatType>(elementType.getRing().getCoefficientType()))
return constFoldBinaryOp<TypedFloatPolynomialAttr>(
adaptor.getOperands(), elementType, [&](Attribute a, const Attribute &b) {
return FloatPolynomialAttr::get(
context, cast<FloatPolynomialAttr>(a).getPolynomial().add(
cast<FloatPolynomialAttr>(b).getPolynomial()));
});

return constFoldBinaryOp<TypedIntPolynomialAttr>(
adaptor.getOperands(), elementType, [&](Attribute a, const Attribute &b) {
return IntPolynomialAttr::get(
context, cast<IntPolynomialAttr>(a).getPolynomial().add(
cast<IntPolynomialAttr>(b).getPolynomial()));
});
}

void FromTensorOp::build(OpBuilder &builder, OperationState &result,
Value input, RingAttr ring) {
TensorType tensorType = dyn_cast<TensorType>(input.getType());
Expand Down
Loading
Loading