| /llvm-project/mlir/lib/Dialect/Polynomial/IR/ |
| H A D | Polynomial.cpp | 45 PolyT fromCoefficientsImpl(ArrayRef<CoeffT> coeffs) { in fromCoefficientsImpl()
59 IntPolynomial IntPolynomial::fromCoefficients(ArrayRef<int64_t> coeffs) { in fromCoefficients()
63 FloatPolynomial FloatPolynomial::fromCoefficients(ArrayRef<double> coeffs) { in fromCoefficients()
|
| /llvm-project/mlir/unittests/Analysis/Presburger/ |
| H A D | SimplexTest.cpp | 23 void addInequality(SimplexBase &simplex, ArrayRef<int64_t> coeffs) { in addInequality()
26 void addEquality(SimplexBase &simplex, ArrayRef<int64_t> coeffs) { in addEquality()
29 bool isRedundantInequality(Simplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantInequality()
32 bool isRedundantInequality(LexSimplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantInequality()
35 bool isRedundantEquality(Simplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantEquality()
38 bool isSeparateInequality(LexSimplex &simplex, ArrayRef<int64_t> coeffs) { in isSeparateInequality()
42 Simplex::IneqType findIneqType(Simplex &simplex, ArrayRef<int64_t> coeffs) { in findIneqType()
84 void expectInequalityMakesSetEmpty(Simplex &simplex, ArrayRef<int64_t> coeffs, in expectInequalityMakesSetEmpty()
95 SmallVector<int64_t, 4> coeffs[]{{1, 0, 0, 0}, // u >= 0. in TEST() local
|
| H A D | IntegerPolyhedronTest.cpp | 113 auto permute = [&perm](ArrayRef<int64_t> coeffs) { in checkPermutationsSample()
|
| /llvm-project/mlir/lib/Analysis/Presburger/ |
| H A D | Simplex.cpp | 118 addRow(ArrayRef<DynamicAPInt> coeffs,bool makeRestricted) addRow() argument
334 isSeparateInequality(ArrayRef<DynamicAPInt> coeffs) isSeparateInequality() argument
340 isRedundantInequality(ArrayRef<DynamicAPInt> coeffs) isRedundantInequality() argument
1107 addInequality(ArrayRef<DynamicAPInt> coeffs) addInequality() argument
1120 addEquality(ArrayRef<DynamicAPInt> coeffs) addEquality() argument
1299 addDivisionVariable(ArrayRef<DynamicAPInt> coeffs,const DynamicAPInt & denom) addDivisionVariable() argument
1360 computeOptimum(Direction direction,ArrayRef<DynamicAPInt> coeffs) computeOptimum() argument
1587 addInequality(ArrayRef<DynamicAPInt> coeffs) addInequality() argument
1751 SmallVector<DynamicAPInt, 8> coeffs(dir.begin(), dir.end()); getCoeffsForDirection() local
2102 computeIntegerBounds(ArrayRef<DynamicAPInt> coeffs) computeIntegerBounds() argument
2110 isFlatAlong(ArrayRef<DynamicAPInt> coeffs) isFlatAlong() argument
2189 findIneqType(ArrayRef<DynamicAPInt> coeffs) findIneqType() argument
2204 isRedundantInequality(ArrayRef<DynamicAPInt> coeffs) isRedundantInequality() argument
2214 isRedundantEquality(ArrayRef<DynamicAPInt> coeffs) isRedundantEquality() argument
[all...] |
| H A D | QuasiPolynomial.cpp | 17 unsigned numVars, ArrayRef<Fraction> coeffs, in QuasiPolynomial() argument
70 SmallVector<Fraction> coeffs; in operator *() local
|
| H A D | Utils.cpp | 373 presburger::getNegatedCoeffs(ArrayRef<DynamicAPInt> coeffs) { in getNegatedCoeffs() argument
383 SmallVector<DynamicAPInt, 8> coeffs; in getComplementIneq() local
|
| /llvm-project/libc/AOR_v20.02/math/tools/ |
| H A D | remez.jl | 901 function wellcond(coeffs, lo, hi) argument
|
| /llvm-project/mlir/lib/Dialect/Math/Transforms/ |
| H A D | PolynomialApproximation.cpp | 292 makePolynomialCalculation(ImplicitLocOpBuilder & builder,llvm::ArrayRef<Value> coeffs,Value x) makePolynomialCalculation() argument
[all...] |