Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_range.c44 poly = isl_qpolynomial_copy(poly); in has_sign()
48 poly = isl_qpolynomial_move_dims(poly, isl_dim_in, 0, in has_sign()
236 data->poly = isl_qpolynomial_add(data->poly, t); in collect_fixed_sign_terms()
277 poly = isl_qpolynomial_project_domain_on_params(poly); in add_guarded_poly()
311 return poly; in plug_in_at_pos()
330 return poly; in plug_in_at_pos()
381 poly = isl_qpolynomial_copy(data->poly); in propagate_on_bound_pair()
382 poly = plug_in_at_pos(poly, nvar, sub, data); in propagate_on_bound_pair()
442 poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, 0, d); in propagate_on_domain()
453 data->poly = poly; in propagate_on_domain()
[all …]
H A Disl_polynomial.c933 poly = isl_poly_cow(poly); in isl_poly_cst_add_isl_int()
955 poly = isl_poly_cow(poly); in isl_poly_add_isl_int()
982 poly = isl_poly_cow(poly); in isl_poly_cst_mul_isl_int()
1005 poly = isl_poly_cow(poly); in isl_poly_mul_isl_int()
1036 poly = isl_poly_cow(poly); in isl_poly_cst_scale_val()
1064 poly = isl_poly_cow(poly); in isl_poly_scale_val()
1278 poly = isl_poly_mul(poly, isl_poly_copy(poly)); in isl_poly_pow()
1311 qp->poly = poly; in isl_qpolynomial_alloc()
1603 poly = isl_poly_cow(poly); in expand()
3877 poly->poly = isl_poly_homogenize(poly->poly, 0, deg, ovar, ovar + nvar); in isl_qpolynomial_homogenize()
[all …]
H A Disl_bernstein.c30 isl_qpolynomial *poly; member
273 isl_qpolynomial *poly = data->poly; in bernstein_coefficients_cell() local
324 poly = isl_qpolynomial_copy(poly); in bernstein_coefficients_cell()
326 poly = isl_qpolynomial_add_dims(poly, isl_dim_in, n_vertices); in bernstein_coefficients_cell()
327 poly = isl_qpolynomial_substitute(poly, isl_dim_in, 0, 1 + nvar, subs); in bernstein_coefficients_cell()
328 poly = isl_qpolynomial_drop_dims(poly, isl_dim_in, 0, 1 + nvar); in bernstein_coefficients_cell()
346 isl_qpolynomial_free(poly); in bernstein_coefficients_cell()
398 data->poly = isl_qpolynomial_homogenize(isl_qpolynomial_copy(poly)); in bernstein_coefficients_base()
407 isl_qpolynomial_free(poly); in bernstein_coefficients_base()
515 if (nvar < 0 || !poly) in bernstein_coefficients_full_recursive()
[all …]
H A Disl_bound.c32 fold = isl_qpolynomial_fold_alloc(type, poly); in isl_qpolynomial_cst_bound()
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()
115 isl_qpolynomial_free(poly); in compressed_guarded_poly_bound()
120 __isl_take isl_qpolynomial *poly, void *user) in unwrapped_guarded_poly_bound() argument
140 poly = isl_qpolynomial_morph_domain(poly, isl_morph_copy(morph)); in unwrapped_guarded_poly_bound()
171 isl_qpolynomial_free(poly); in unwrapped_guarded_poly_bound()
217 poly = isl_qpolynomial_move_dims(poly, isl_dim_param, nparam, in 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
129 __isl_give isl_poly *isl_poly_cow(__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);
138 isl_bool isl_poly_is_negone(__isl_keep isl_poly *poly);
145 __isl_take isl_poly *poly, isl_int v);
148 unsigned n_div, __isl_take isl_poly *poly);
[all …]
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DIntegerPolyhedronTest.cpp482 IntegerPolyhedron poly = in TEST() local
580 EXPECT_EQ(poly.atIneq(0, 1), 0); in TEST()
581 EXPECT_EQ(poly.atIneq(0, 2), 1); in TEST()
609 IntegerPolyhedron &poly, in checkDivisionRepresentation() argument
708 IntegerPolyhedron poly = in TEST() local
756 IntegerPolyhedron poly = in TEST() local
771 IntegerPolyhedron poly = in TEST() local
784 IntegerPolyhedron poly = in TEST() local
800 poly.addEquality({2, 1, -1}); in TEST()
801 poly.addEquality({0, 1, -2}); in TEST()
[all …]
H A DPresburgerSetTest.cpp94 for (const IntegerPolyhedron &poly : polys) in makeSetFromPoly() local
95 set.unionInPlace(poly); in makeSetFromPoly()
469 poly.convertVarKind(VarKind::SetDim, poly.getNumDimVars() - numLocals, in convertSuffixDimsToLocals()
470 poly.getNumDimVars(), VarKind::Local); in convertSuffixDimsToLocals()
475 IntegerPolyhedron poly = parsePoly(str); in parsePolyAndMakeLocals() local
476 convertSuffixDimsToLocals(poly, numLocals); in parsePolyAndMakeLocals()
477 return poly; in parsePolyAndMakeLocals()
838 void testComputeReprAtPoints(IntegerPolyhedron poly, in testComputeReprAtPoints() argument
841 poly.convertVarKind(VarKind::SetDim, poly.getNumDimVars() - numToProject, in testComputeReprAtPoints()
847 EXPECT_EQ(poly.containsPointNoLocal(point).has_value(), in testComputeReprAtPoints()
[all …]
/llvm-project-15.0.7/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()
H A Dmath_config.h310 double poly[EXP2F_POLY_ORDER]; member
325 double poly[LOGF_POLY_ORDER - 1]; /* First order coefficient is 1. */ member
336 double poly[LOG2F_POLY_ORDER]; member
353 double poly[POWF_LOG2_POLY_ORDER]; member
373 double poly[4]; /* Last four coefficients. */ member
386 double poly[LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member
401 double poly[LOG2_POLY_ORDER - 1]; member
415 double poly[POW_LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member
/llvm-project-15.0.7/libc/AOR_v20.02/math/tools/
H A Dexp2.sollya8 deg = 3; // poly degree
14 //deg = 5; // poly degree
24 approx = proc(poly,d) {
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 ...|]);
36 // p = roundcoefficients(approx_abs(poly,i), [|D ...|]);
37 poly = poly + x^i*coeff(p,0);
[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));
33 print("abs2 error:", accurateinfnorm(exp(x)-poly(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 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 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 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 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 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 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 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);
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);
/llvm-project-15.0.7/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-15.0.7/libclc/generic/lib/math/
H A Dclc_pown.cl41 // poly = poly + ((rh-r) + rt)
44 // ltt = ((xexp * log2_t) - poly) + logT
64 // ((((expT * poly) + expT) + expH*poly) + expH)
85 float poly = mad(r,
93 poly *= r2*r;
96 float ltt_near1 = -poly;
122 poly += (rh - r) + rt;
169 float expylogx = mad(tv.s0, poly, mad(tv.s1, poly, tv.s1)) + tv.s0;
257 double poly = fma(r,
264 poly = poly * r * r * r;
[all …]

123