Home
last modified time | relevance | path

Searched refs:coeffs (Results 1 – 19 of 19) sorted by relevance

/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h169 virtual void addInequality(ArrayRef<int64_t> coeffs) = 0;
180 void addEquality(ArrayRef<int64_t> coeffs);
187 void addDivisionVariable(ArrayRef<int64_t> coeffs, int64_t denom);
424 void addInequality(ArrayRef<int64_t> coeffs) final;
503 bool isSeparateInequality(ArrayRef<int64_t> coeffs);
504 bool isRedundantInequality(ArrayRef<int64_t> coeffs);
711 void addInequality(ArrayRef<int64_t> coeffs) final;
770 computeIntegerBounds(ArrayRef<int64_t> coeffs);
792 IneqType findIneqType(ArrayRef<int64_t> coeffs);
795 bool isRedundantInequality(ArrayRef<int64_t> coeffs);
[all …]
H A DUtils.h249 SmallVector<int64_t, 8> getNegatedCoeffs(ArrayRef<int64_t> coeffs);
/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DSimplex.cpp110 tableau(newRow, 1) = coeffs.back(); in addRow()
129 bigMCoeff -= coeffs[i]; in addRow()
137 if (coeffs[i] == 0) in addRow()
320 addInequality(coeffs); in isSeparateInequality()
1093 addInequality(coeffs); in addEquality()
1095 for (int64_t coeff : coeffs) in addEquality()
1275 SmallVector<int64_t, 8> ineq(coeffs.begin(), coeffs.end()); in addDivisionVariable()
1336 unsigned conIndex = addRow(coeffs); in computeOptimum()
1720 coeffs.reserve(2 * dir.size()); in getCoeffsForDirection()
1722 coeffs.push_back(-coeff); in getCoeffsForDirection()
[all …]
H A DUtils.cpp343 SmallVector<int64_t, 8> presburger::getNegatedCoeffs(ArrayRef<int64_t> coeffs) { in getNegatedCoeffs() argument
345 negatedCoeffs.reserve(coeffs.size()); in getNegatedCoeffs()
346 for (int64_t coeff : coeffs) in getNegatedCoeffs()
352 SmallVector<int64_t, 8> coeffs; in getComplementIneq() local
353 coeffs.reserve(ineq.size()); in getComplementIneq()
355 coeffs.emplace_back(-coeff); in getComplementIneq()
356 --coeffs.back(); in getComplementIneq()
357 return coeffs; in getComplementIneq()
/llvm-project-15.0.7/libc/AOR_v20.02/math/tools/
H A Dv_exp.sollya19 // first 2 coeffs are fixed, iteratively find optimal double prec coeffs
30 print("coeffs:");
H A Dremez.jl92 function poly_eval(coeffs::Array{BigFloat}, x::BigFloat)
93 n = length(coeffs)
97 return coeffs[1]
99 return coeffs[1] + x * poly_eval(coeffs[2:n], x)
135 function poly_to_string(coeffs::Array{BigFloat})
136 n = length(coeffs)
140 return float_to_str(coeffs[1])
143 poly_to_string(coeffs[2:n]), ")")
901 function wellcond(coeffs, lo, hi) argument
905 for i = length(coeffs):-1:1
[all …]
H A Dexp.sollya20 // first 2 coeffs are fixed, iteratively find optimal double prec coeffs
35 print("coeffs:");
H A Dcos.sollya20 // first coeff is fixed, iteratively find optimal double prec coeffs
31 print("coeffs:");
H A Dv_sin.sollya26 // first coeff is fixed, iteratively find optimal double prec coeffs
36 print("coeffs:");
H A Dlog.sollya25 // first coeff is fixed, iteratively find optimal double prec coeffs
35 print("coeffs:");
H A Dsin.sollya26 // first coeff is fixed, iteratively find optimal double prec coeffs
37 print("coeffs:");
H A Dv_log.sollya24 // first coeff is fixed, iteratively find optimal double prec coeffs
34 print("coeffs:");
H A Dlog_abs.sollya20 // first coeff is fixed, iteratively find optimal double prec coeffs
35 print("coeffs:");
H A Dlog2_abs.sollya24 // first coeff is fixed, iteratively find optimal double prec coeffs
41 print("coeffs:");
H A Dlog2.sollya30 // first coeff is fixed, iteratively find optimal double prec coeffs
42 print("coeffs:");
H A Dexp2.sollya32 // first coeff is fixed, iteratively find optimal double prec coeffs
48 print("coeffs:");
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DSimplexTest.cpp58 void expectInequalityMakesSetEmpty(Simplex &simplex, ArrayRef<int64_t> coeffs, in expectInequalityMakesSetEmpty() argument
62 simplex.addInequality(coeffs); in expectInequalityMakesSetEmpty()
69 SmallVector<int64_t, 4> coeffs[]{{1, 0, 0, 0}, // u >= 0. in TEST() local
85 simplex.addInequality(coeffs[(run + i) % 4]); in TEST()
H A DIntegerPolyhedronTest.cpp111 auto permute = [&perm](ArrayRef<int64_t> coeffs) { in checkPermutationsSample() argument
114 permuted.push_back(coeffs[id]); in checkPermutationsSample()
115 permuted.push_back(coeffs.back()); in checkPermutationsSample()
/llvm-project-15.0.7/mlir/lib/Dialect/Math/Transforms/
H A DPolynomialApproximation.cpp272 llvm::ArrayRef<Value> coeffs, Value x) { in makePolynomialCalculation() argument
276 if (coeffs.empty()) in makePolynomialCalculation()
279 if (coeffs.size() == 1) in makePolynomialCalculation()
280 return coeffs[0]; in makePolynomialCalculation()
282 Value res = builder.create<math::FmaOp>(x, coeffs[coeffs.size() - 1], in makePolynomialCalculation()
283 coeffs[coeffs.size() - 2]); in makePolynomialCalculation()
284 for (auto i = ptrdiff_t(coeffs.size()) - 3; i >= 0; --i) { in makePolynomialCalculation()
285 res = builder.create<math::FmaOp>(x, res, coeffs[i]); in makePolynomialCalculation()