Home
last modified time | relevance | path

Searched refs:poly (Results 1 – 25 of 96) sorted by relevance

1234

/llvm-project/polly/lib/External/isl/
H A Disl_range.c16 isl_qpolynomial *poly; member
22 __isl_take isl_qpolynomial *poly, struct range_data *data);
30 __isl_keep isl_qpolynomial *poly, int sign, int *signs) in has_sign() argument
44 poly = isl_qpolynomial_copy(poly); in has_sign()
48 poly = isl_qpolynomial_move_dims(poly, isl_dim_in, 0, in has_sign()
51 space = isl_qpolynomial_get_space(poly); in has_sign()
64 if (propagate_on_domain(bset, poly, &data_m) < 0) in has_sign()
97 __isl_keep isl_qpolynomial *poly, struct range_data *data) in monotonicity() argument
111 ctx = isl_qpolynomial_get_ctx(poly); in monotonicity()
112 space = isl_qpolynomial_get_domain_space(poly); in monotonicity()
[all …]
H A Disl_polynomial.c51 isl_bool isl_poly_is_cst(__isl_keep isl_poly *poly) in isl_poly_is_cst() argument
53 if (!poly) in isl_poly_is_cst()
56 return isl_bool_ok(poly->var < 0); in isl_poly_is_cst()
59 __isl_keep isl_poly_cst *isl_poly_as_cst(__isl_keep isl_poly *poly) in isl_poly_as_cst() argument
61 if (!poly) in isl_poly_as_cst()
64 isl_assert(poly->ctx, poly->var < 0, return NULL); in isl_poly_as_cst()
66 return (isl_poly_cst *) poly; in isl_poly_as_cst()
69 __isl_keep isl_poly_rec *isl_poly_as_rec(__isl_keep isl_poly *poly) in isl_poly_as_rec() argument
71 if (!poly) in isl_poly_as_rec()
74 isl_assert(poly->ctx, poly->var >= 0, return NULL); in isl_poly_as_rec()
[all …]
H A Disl_bernstein.c30 isl_qpolynomial *poly; member
159 static isl_stat extract_coefficients(isl_qpolynomial *poly, in extract_coefficients() argument
171 n = isl_qpolynomial_dim(poly, isl_dim_in); in extract_coefficients()
175 ctx = isl_qpolynomial_get_ctx(poly); in extract_coefficients()
176 d = isl_qpolynomial_degree(poly); in extract_coefficients()
190 c[0] = isl_qpolynomial_coeff(poly, isl_dim_in, n - 1, k[0]); in extract_coefficients()
273 isl_qpolynomial *poly = data->poly; in bernstein_coefficients_cell() local
282 n_in = isl_qpolynomial_dim(poly, isl_dim_in); in bernstein_coefficients_cell()
289 ctx = isl_qpolynomial_get_ctx(poly); in bernstein_coefficients_cell()
299 space_dst = isl_qpolynomial_get_domain_space(poly); in bernstein_coefficients_cell()
[all …]
H A Disl_bound.c25 __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, in isl_qpolynomial_cst_bound() argument
32 fold = isl_qpolynomial_fold_alloc(type, poly); in isl_qpolynomial_cst_bound()
66 __isl_take isl_qpolynomial *poly, struct isl_bound *bound) in add_constant_poly() argument
70 pwf = isl_qpolynomial_cst_bound(bset, poly, bound->type, NULL); in add_constant_poly()
86 __isl_take isl_qpolynomial *poly, void *user) in compressed_guarded_poly_bound() argument
93 if (!bset || !poly) in compressed_guarded_poly_bound()
96 degree = isl_qpolynomial_degree(poly); in compressed_guarded_poly_bound()
100 return add_constant_poly(bset, poly, bound); in compressed_guarded_poly_bound()
104 return isl_qpolynomial_bound_on_domain_range(bset, poly, bound); in compressed_guarded_poly_bound()
110 return isl_qpolynomial_bound_on_domain_bernstein(bset, poly, bound); in compressed_guarded_poly_bound()
[all …]
H A Disl_polynomial_private.h19 struct isl_poly poly; member
26 struct isl_poly poly; member
41 isl_poly *poly; member
128 __isl_give isl_poly *isl_poly_copy(__isl_keep isl_poly *poly);
129 __isl_give isl_poly *isl_poly_cow(__isl_take isl_poly *poly);
130 __isl_give isl_poly *isl_poly_dup(__isl_keep isl_poly *poly);
131 __isl_null isl_poly *isl_poly_free(__isl_take isl_poly *poly);
135 isl_bool isl_poly_is_cst(__isl_keep isl_poly *poly);
136 isl_bool isl_poly_is_zero(__isl_keep isl_poly *poly);
137 isl_bool isl_poly_is_one(__isl_keep isl_poly *poly);
[all …]
/llvm-project/mlir/unittests/Analysis/Presburger/
H A DIntegerPolyhedronTest.cpp61 static void checkSample(bool hasSample, const IntegerPolyhedron &poly, in checkSample() argument
67 maybeSample = poly.findIntegerSample(); in checkSample()
68 maybeLexMin = poly.findIntegerLexMin(); in checkSample()
84 EXPECT_TRUE(poly.containsPoint(*maybeSample)); in checkSample()
88 EXPECT_TRUE(Simplex(poly).isUnbounded()); in checkSample()
91 EXPECT_TRUE(poly.containsPointNoLocal(*maybeLexMin)); in checkSample()
96 EXPECT_EQ(!hasSample, poly.isIntegerEmpty()); in checkSample()
501 IntegerPolyhedron poly = in TEST() local
503 poly.removeRedundantConstraints(); in TEST()
506 EXPECT_EQ(poly.getNumInequalities(), 0u); in TEST()
[all …]
H A DPresburgerSetTest.cpp96 for (const IntegerPolyhedron &poly : polys) in makeSetFromPoly() local
97 set.unionInPlace(poly); in makeSetFromPoly()
456 void convertSuffixDimsToLocals(IntegerPolyhedron &poly, unsigned numLocals) { in convertSuffixDimsToLocals() argument
457 poly.convertVarKind(VarKind::SetDim, poly.getNumDimVars() - numLocals, in convertSuffixDimsToLocals()
458 poly.getNumDimVars(), VarKind::Local); in convertSuffixDimsToLocals()
463 IntegerPolyhedron poly = parseIntegerPolyhedron(str); in parseIntegerPolyhedronAndMakeLocals() local
464 convertSuffixDimsToLocals(poly, numLocals); in parseIntegerPolyhedronAndMakeLocals()
465 return poly; in parseIntegerPolyhedronAndMakeLocals()
814 void testComputeReprAtPoints(IntegerPolyhedron poly, in testComputeReprAtPoints() argument
817 poly.convertVarKind(VarKind::SetDim, poly.getNumDimVars() - numToProject, in testComputeReprAtPoints()
[all …]
/llvm-project/libc/AOR_v20.02/math/
H A Dv_exp2f_1u.c31 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn) in specialcase() argument
39 v_f32_t r0 = poly * s1 * s2; in specialcase()
47 v_f32_t n, r, scale, poly, absn; in V_NAME() local
66 poly = v_fma_f32 (C0, r, C1); in V_NAME()
67 poly = v_fma_f32 (poly, r, C2); in V_NAME()
68 poly = v_fma_f32 (poly, r, C3); in V_NAME()
69 poly = v_fma_f32 (poly, r, C4); in V_NAME()
70 poly = v_fma_f32 (poly, r, C5); in V_NAME()
71 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
73 return specialcase (poly, n, e, absn); in V_NAME()
[all …]
H A Dv_expf_1u.c34 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn) in specialcase() argument
42 v_f32_t r0 = poly * s1 * s2; in specialcase()
50 v_f32_t n, r, scale, poly, absn, z; in V_NAME() local
71 poly = v_fma_f32 (C0, r, C1); in V_NAME()
72 poly = v_fma_f32 (poly, r, C2); in V_NAME()
73 poly = v_fma_f32 (poly, r, C3); in V_NAME()
74 poly = v_fma_f32 (poly, r, C4); in V_NAME()
75 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
76 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
78 return specialcase (poly, n, e, absn); in V_NAME()
[all …]
H A Dv_exp2f.c31 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn, v_u32_t cmp1, v_f32_t scale) in specialcase() argument
39 v_u32_t r1 = v_as_u32_f32 (v_fma_f32 (poly, s2, s2) * s1); in specialcase()
41 v_u32_t r0 = v_as_u32_f32 (v_fma_f32 (poly, scale, scale)); in specialcase()
49 v_f32_t n, r, r2, scale, p, q, poly, absn; in V_NAME() local
73 poly = v_fma_f32 (q, r2, p); in V_NAME()
75 return specialcase (poly, n, e, absn, cmp, scale); in V_NAME()
76 return v_fma_f32 (poly, scale, scale); in V_NAME()
H A Dv_expf.c34 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn, v_u32_t cmp1, v_f32_t scale) in specialcase() argument
42 v_u32_t r1 = v_as_u32_f32 (v_fma_f32 (poly, s2, s2) * s1); in specialcase()
44 v_u32_t r0 = v_as_u32_f32 (v_fma_f32 (poly, scale, scale)); in specialcase()
52 v_f32_t n, r, r2, scale, p, q, poly, absn, z; in V_NAME() local
78 poly = v_fma_f32 (q, r2, p); in V_NAME()
80 return specialcase (poly, n, e, absn, cmp, scale); in V_NAME()
81 return v_fma_f32 (poly, scale, scale); in V_NAME()
/llvm-project/libc/AOR_v20.02/math/tools/
H A Dexp2.sollya8 deg = 3; // poly degree
14 //deg = 5; // poly degree
23 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
24 approx = proc(poly,d) {
25 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
27 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
28 approx_abs = proc(poly,d) {
29 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
33 poly = 1;
35 p = roundcoefficients(approx(poly,i), [|D ...|]);
[all …]
H A Dexp.sollya7 deg = 5; // poly degree
15 // return p that minimizes |exp(x) - poly(x) - x^d*p(x)|
16 approx = proc(poly,d) {
17 return remez(exp(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
21 poly = 1 + x;
23 p = roundcoefficients(approx(poly,i), [|D ...|]);
24 poly = poly + x^i*coeff(p,0);
28 print("rel error:", accurateinfnorm(1-poly(x)/exp(x), [a;b], 30));
29 print("abs error:", accurateinfnorm(exp(x)-poly(x), [a;b], 30));
32 print("rel2 error:", accurateinfnorm(1-poly(x)/exp(x), [2*a;2*b], 30));
[all …]
H A Dv_exp.sollya7 deg = 4; // poly degree
14 // return p that minimizes |exp(x) - poly(x) - x^d*p(x)|
15 approx = proc(poly,d) {
16 return remez(exp(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
20 poly = 1 + x;
22 p = roundcoefficients(approx(poly,i), [|D ...|]);
23 poly = poly + x^i*coeff(p,0);
27 print("rel error:", accurateinfnorm(1-poly(x)/exp(x), [a;b], 30));
28 print("abs error:", accurateinfnorm(exp(x)-poly(x), [a;b], 30));
31 for i from 0 to deg do coeff(poly,i);
H A Dlog_abs.sollya7 deg = 6; // poly degree
15 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
16 approx = proc(poly,d) {
17 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
21 poly = x;
23 p = roundcoefficients(approx(poly,i), [|D ...|]);
24 poly = poly + x^i*coeff(p,0);
28 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
33 print("rel error:", accurateinfnorm(1-poly(x)/x/g(x), [a;b], 30));
36 for i from 0 to deg do coeff(poly,i);
H A Dcos.sollya15 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
16 approx = proc(poly,d) {
17 return remez(f(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
21 poly = 1;
23 p = roundcoefficients(approx(poly,2*i), [|D ...|]);
24 poly = poly + x^(2*i)*coeff(p,0);
28 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
29 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
32 for i from 0 to deg do coeff(poly,i);
H A Dlog2_abs.sollya7 deg = 7; // poly degree
19 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
20 approx = proc(poly,d) {
21 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
25 poly = x*(invln2lo + invln2hi);
27 p = roundcoefficients(approx(poly,i), [|D ...|]);
28 poly = poly + x^i*coeff(p,0);
34 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
39 //print("rel error:", accurateinfnorm(1-(poly(x)/x)/g(x), [a;b], 30));
42 for i from 0 to deg do coeff(poly,i);
H A Dsin.sollya21 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
22 approx = proc(poly,d) {
23 return remez(f(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
27 poly = 1;
29 p = roundcoefficients(approx(poly,2*i), [|D ...|]);
30 poly = poly + x^(2*i)*coeff(p,0);
34 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
35 print("abs error:", accurateinfnorm(sin(x)-x*poly(x), [a;b], 30));
38 for i from 0 to deg do coeff(poly,i);
H A Dlog.sollya7 deg = 12; // poly degree
20 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
21 approx = proc(poly,d) {
22 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
26 poly = 1;
28 p = roundcoefficients(approx(poly,i), [|D ...|]);
29 poly = poly + x^i*coeff(p,0);
33 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
36 for i from 0 to deg do coeff(poly,i);
H A Dv_log.sollya7 deg = 6; // poly degree
19 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
20 approx = proc(poly,d) {
21 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
25 poly = 1;
27 p = roundcoefficients(approx(poly,i), [|D ...|]);
28 poly = poly + x^i*coeff(p,0);
32 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
35 for i from 0 to deg do coeff(poly,i);
H A Dlog2.sollya7 deg = 11; // poly degree
25 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
26 approx = proc(poly,d) {
27 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
31 poly = invln2hi + invln2lo;
33 p = roundcoefficients(approx(poly,i), [|D ...|]);
34 poly = poly + x^i*coeff(p,0);
40 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
43 for i from 0 to deg do coeff(poly,i);
H A Dv_sin.sollya21 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
22 approx = proc(poly,d) {
23 return remez(f(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
27 poly = 1;
29 p = roundcoefficients(approx(poly,2*i), [|D ...|]);
30 poly = poly + x^(2*i)*coeff(p,0);
34 print("abs error:", accurateinfnorm(sin(x)-x*poly(x), [a;b], 30));
37 for i from 0 to deg do coeff(poly,i);
/llvm-project/flang/test/Semantics/
H A Dstructconst01.f9072 type :: poly type
74 end type poly
75 type(poly) :: x
83 x = poly(1)
84 x = poly('hello')
85 x = poly(type1(1)(123))
88 x = poly(z'feedface')
/llvm-project/libclc/generic/lib/math/
H A Dclc_powr.cl42 // poly = poly + ((rh-r) + rt)
45 // ltt = ((xexp * log2_t) - poly) + logT
63 // In calculation of exp, add vt to r that is used for poly
65 // ((((expT * poly) + expT) + expH*poly) + expH)
83 float poly = __clc_mad(
91 poly *= r2 * r;
94 float ltt_near1 = -poly;
120 poly
[all...]
H A Dclc_rootn.cl42 // poly = poly + ((rh-r) + rt)
45 // ltt = ((xexp * log2_t) - poly) + logT
63 // In calculation of exp, add vt to r that is used for poly
65 // ((((expT * poly) + expT) + expH*poly) + expH)
85 float poly = __clc_mad(
93 poly *= r2 * r;
96 float ltt_near1 = -poly;
122 poly
[all...]

1234