Home
last modified time | relevance | path

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

12345678

/external/skqp/tests/
DPolyUtilsTest.cpp12 SkTDArray<SkPoint> poly; in DEF_TEST() local
21 *poly.push() = SkPoint::Make(-100, 55); in DEF_TEST()
22 *poly.push() = SkPoint::Make(100, 55); in DEF_TEST()
23 *poly.push() = SkPoint::Make(102.5f, 54.330127f); in DEF_TEST()
24 REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0); in DEF_TEST()
25 REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count())); in DEF_TEST()
26 REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count())); in DEF_TEST()
27 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST()
31 poly[2].set(102.5f, 55.330127f); in DEF_TEST()
32 REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0); in DEF_TEST()
[all …]
/external/skia/tests/
DPolyUtilsTest.cpp12 SkTDArray<SkPoint> poly; in DEF_TEST() local
21 *poly.push() = SkPoint::Make(-100, 55); in DEF_TEST()
22 *poly.push() = SkPoint::Make(100, 55); in DEF_TEST()
23 *poly.push() = SkPoint::Make(102.5f, 54.330127f); in DEF_TEST()
24 REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0); in DEF_TEST()
25 REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count())); in DEF_TEST()
26 REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count())); in DEF_TEST()
27 REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(), in DEF_TEST()
31 poly[2].set(102.5f, 55.330127f); in DEF_TEST()
32 REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0); in DEF_TEST()
[all …]
/external/eigen/unsupported/Eigen/src/Polynomials/
DPolynomialUtils.h28 T poly_eval_horner( const Polynomials& poly, const T& x ) in poly_eval_horner() argument
30 T val=poly[poly.size()-1]; in poly_eval_horner()
31 for(DenseIndex i=poly.size()-2; i>=0; --i ){ in poly_eval_horner()
32 val = val*x + poly[i]; } in poly_eval_horner()
46 T poly_eval( const Polynomials& poly, const T& x ) in poly_eval() argument
51 return poly_eval_horner( poly, x ); } in poly_eval()
54 T val=poly[0]; in poly_eval()
56 for( DenseIndex i=1; i<poly.size(); ++i ){ in poly_eval()
57 val = val*inv_x + poly[i]; } in poly_eval()
59 return numext::pow(x,(T)(poly.size()-1)) * val; in poly_eval()
[all …]
DPolynomialSolver.h43 inline void setPolynomial( const OtherPolynomial& poly ){ in setPolynomial() argument
44 m_roots.resize(poly.size()-1); } in setPolynomial()
48 inline PolynomialSolverBase( const OtherPolynomial& poly ){ in PolynomialSolverBase() argument
49 setPolynomial( poly() ); } in PolynomialSolverBase()
345 void compute( const OtherPolynomial& poly ) in compute() argument
347 eigen_assert( Scalar(0) != poly[poly.size()-1] ); in compute()
348 eigen_assert( poly.size() > 1 ); in compute()
349 if(poly.size() > 2 ) in compute()
351 internal::companion<Scalar,_Deg> companion( poly ); in compute()
356 else if(poly.size () == 2) in compute()
[all …]
/external/skia/bench/
DPolyUtilsBench.cpp21 virtual void makePoly(SkTDArray<SkPoint>* poly) = 0;
49 SkTDArray<SkPoint> poly; in onDraw() local
50 this->makePoly(&poly); in onDraw()
54 (void)SkIsConvexPolygon(poly.begin(), poly.count()); in onDraw()
59 (void)SkIsSimplePolygon(poly.begin(), poly.count()); in onDraw()
63 if (SkIsConvexPolygon(poly.begin(), poly.count())) { in onDraw()
66 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 10, &result); in onDraw()
67 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 40, &result); in onDraw()
72 if (SkIsSimplePolygon(poly.begin(), poly.count())) { in onDraw()
75 bounds.setBounds(poly.begin(), poly.count()); in onDraw()
[all …]
/external/skqp/bench/
DPolyUtilsBench.cpp20 virtual void makePoly(SkTDArray<SkPoint>* poly) = 0;
48 SkTDArray<SkPoint> poly; in onDraw() local
49 this->makePoly(&poly); in onDraw()
53 (void)SkIsConvexPolygon(poly.begin(), poly.count()); in onDraw()
58 (void)SkIsSimplePolygon(poly.begin(), poly.count()); in onDraw()
62 if (SkIsConvexPolygon(poly.begin(), poly.count())) { in onDraw()
65 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 10, &result); in onDraw()
66 (void)SkInsetConvexPolygon(poly.begin(), poly.count(), 40, &result); in onDraw()
71 if (SkIsSimplePolygon(poly.begin(), poly.count())) { in onDraw()
74 (void)SkOffsetSimplePolygon(poly.begin(), poly.count(), 10, &result); in onDraw()
[all …]
/external/arm-neon-tests/
Dref_vreinterpret.c107 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 8, 8); in exec_vreinterpret()
108 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 16, 4); in exec_vreinterpret()
118 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 8, 8); in exec_vreinterpret()
119 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 16, 4); in exec_vreinterpret()
129 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 8, 8); in exec_vreinterpret()
130 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 16, 4); in exec_vreinterpret()
140 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 8, 8); in exec_vreinterpret()
141 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 16, 4); in exec_vreinterpret()
151 TEST_VREINTERPRET(, uint, u, 8, 8, poly, p, 8, 8); in exec_vreinterpret()
152 TEST_VREINTERPRET(, uint, u, 8, 8, poly, p, 16, 4); in exec_vreinterpret()
[all …]
Dcompute_ref_data.c134 VECT_VAR_DECL_INIT(buffer, poly, 8, 8);
135 PAD(buffer_pad, poly, 8, 8);
136 VECT_VAR_DECL_INIT(buffer, poly, 16, 4);
137 PAD(buffer_pad, poly, 16, 4);
174 VECT_VAR_DECL_INIT(buffer, poly, 8, 16);
175 PAD(buffer_pad, poly, 8, 16);
176 VECT_VAR_DECL_INIT(buffer, poly, 16, 8);
177 PAD(buffer_pad, poly, 16, 8);
211 VECT_VAR_DECL_INIT(buffer_dup, poly, 8, 8);
212 VECT_VAR_DECL(buffer_dup_pad, poly, 8, 8);
[all …]
Dref_vceq.c39 DECL_VARIABLE(vector, poly, 8, 8); in exec_vceq_p8()
40 DECL_VARIABLE(vector, poly, 8, 16); in exec_vceq_p8()
42 DECL_VARIABLE(vector2, poly, 8, 8); in exec_vceq_p8()
43 DECL_VARIABLE(vector2, poly, 8, 16); in exec_vceq_p8()
50 VLOAD(vector, buffer, , poly, p, 8, 8); in exec_vceq_p8()
51 VLOAD(vector, buffer, q, poly, p, 8, 16); in exec_vceq_p8()
53 VDUP(vector2, , poly, p, 8, 8, 0xF3); in exec_vceq_p8()
54 VDUP(vector2, q, poly, p, 8, 16, 0xF4); in exec_vceq_p8()
57 TEST_VCOMP(INSN_NAME, , poly, p, uint, 8, 8); in exec_vceq_p8()
58 TEST_VCOMP(INSN_NAME, q, poly, p, uint, 8, 16); in exec_vceq_p8()
Dref_vuzp.c82 DECL_VUZP(poly, 8, 8); \ in FNNAME()
83 DECL_VUZP(poly, 16, 4); \ in FNNAME()
91 DECL_VUZP(poly, 8, 16); \ in FNNAME()
92 DECL_VUZP(poly, 16, 8); \ in FNNAME()
109 VDUP(vector2, , poly, p, 8, 8, 0x55); in FNNAME()
110 VDUP(vector2, , poly, p, 16, 4, 0x66); in FNNAME()
119 VDUP(vector2, q, poly, p, 8, 16, 0x55); in FNNAME()
120 VDUP(vector2, q, poly, p, 16, 8, 0x66); in FNNAME()
130 TEST_VUZP(INSN, , poly, p, 8, 8); \ in FNNAME()
131 TEST_VUZP(INSN, , poly, p, 16, 4); \ in FNNAME()
[all …]
Dstm-arm-neon-ref.h226 extern ARRAY(buffer, poly, 8, 8);
227 extern ARRAY(buffer, poly, 16, 4);
240 extern ARRAY(buffer, poly, 8, 16);
241 extern ARRAY(buffer, poly, 16, 8);
258 extern ARRAY(buffer_dup, poly, 8, 8);
259 extern ARRAY(buffer_dup, poly, 16, 4);
272 extern ARRAY(buffer_dup, poly, 8, 16);
273 extern ARRAY(buffer_dup, poly, 16, 8);
288 extern VECT_ARRAY(buffer_vld2, poly, 8, 8, 2);
289 extern VECT_ARRAY(buffer_vld2, poly, 16, 4, 2);
[all …]
Dref_vrev.c61 TEST_VREV(, poly, p, 8, 8, 16); in exec_vrev()
64 TEST_VREV(q, poly, p, 8, 16, 16); in exec_vrev()
73 TEST_VREV(, poly, p, 8, 8, 32); in exec_vrev()
74 TEST_VREV(, poly, p, 16, 4, 32); in exec_vrev()
79 TEST_VREV(q, poly, p, 8, 16, 32); in exec_vrev()
80 TEST_VREV(q, poly, p, 16, 8, 32); in exec_vrev()
91 TEST_VREV(, poly, p, 8, 8, 64); in exec_vrev()
92 TEST_VREV(, poly, p, 16, 4, 64); in exec_vrev()
99 TEST_VREV(q, poly, p, 8, 16, 64); in exec_vrev()
100 TEST_VREV(q, poly, p, 16, 8, 64); in exec_vrev()
/external/u-boot/drivers/mtd/nand/raw/
Domap_elm.c32 static void elm_load_syndromes(u8 *syndrome, enum bch_level bch_type, u8 poly) in elm_load_syndromes() argument
38 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[0]; in elm_load_syndromes()
43 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[1]; in elm_load_syndromes()
50 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[2]; in elm_load_syndromes()
55 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[3]; in elm_load_syndromes()
63 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[4]; in elm_load_syndromes()
69 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[5]; in elm_load_syndromes()
75 ptr = &elm_cfg->syndrome_fragments[poly].syndrome_fragment_x[6]; in elm_load_syndromes()
96 u8 poly = ELM_DEFAULT_POLY; in elm_check_error() local
100 elm_load_syndromes(syndrome, bch_type, poly); in elm_check_error()
[all …]
/external/arm-optimized-routines/math/tools/
Dexp2.sollya7 deg = 3; // poly degree
13 //deg = 5; // poly degree
22 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
23 approx = proc(poly,d) {
24 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
26 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
27 approx_abs = proc(poly,d) {
28 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
32 poly = 1;
34 p = roundcoefficients(approx(poly,i), [|D ...|]);
[all …]
Dexp.sollya6 deg = 5; // 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 print("rel2 error:", accurateinfnorm(1-poly(x)/exp(x), [2*a;2*b], 30));
[all …]
Dv_exp.sollya6 deg = 4; // poly degree
13 // return p that minimizes |exp(x) - poly(x) - x^d*p(x)|
14 approx = proc(poly,d) {
15 return remez(exp(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
19 poly = 1 + x;
21 p = roundcoefficients(approx(poly,i), [|D ...|]);
22 poly = poly + x^i*coeff(p,0);
26 print("rel error:", accurateinfnorm(1-poly(x)/exp(x), [a;b], 30));
27 print("abs error:", accurateinfnorm(exp(x)-poly(x), [a;b], 30));
30 for i from 0 to deg do coeff(poly,i);
Dlog_abs.sollya6 deg = 6; // poly degree
14 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
15 approx = proc(poly,d) {
16 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
20 poly = x;
22 p = roundcoefficients(approx(poly,i), [|D ...|]);
23 poly = poly + x^i*coeff(p,0);
27 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
32 print("rel error:", accurateinfnorm(1-poly(x)/x/g(x), [a;b], 30));
35 for i from 0 to deg do coeff(poly,i);
Dcos.sollya14 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
15 approx = proc(poly,d) {
16 return remez(f(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
20 poly = 1;
22 p = roundcoefficients(approx(poly,2*i), [|D ...|]);
23 poly = poly + x^(2*i)*coeff(p,0);
27 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
28 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
31 for i from 0 to deg do coeff(poly,i);
Dlog2_abs.sollya6 deg = 7; // poly degree
18 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
19 approx = proc(poly,d) {
20 return remez(f(x) - poly(x), deg-d, [a;b], x^d, 1e-10);
24 poly = x*(invln2lo + invln2hi);
26 p = roundcoefficients(approx(poly,i), [|D ...|]);
27 poly = poly + x^i*coeff(p,0);
33 print("abs error:", accurateinfnorm(f(x)-poly(x), [a;b], 30));
38 //print("rel error:", accurateinfnorm(1-(poly(x)/x)/g(x), [a;b], 30));
41 for i from 0 to deg do coeff(poly,i);
Dsin.sollya20 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|
21 approx = proc(poly,d) {
22 return remez(f(x)-poly(x), deg-d, [a;b], x^d, 1e-10);
26 poly = 1;
28 p = roundcoefficients(approx(poly,2*i), [|D ...|]);
29 poly = poly + x^(2*i)*coeff(p,0);
33 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
34 print("abs error:", accurateinfnorm(sin(x)-x*poly(x), [a;b], 30));
37 for i from 0 to deg do coeff(poly,i);
Dv_log.sollya6 deg = 6; // poly degree
18 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
19 approx = proc(poly,d) {
20 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
24 poly = 1;
26 p = roundcoefficients(approx(poly,i), [|D ...|]);
27 poly = poly + x^i*coeff(p,0);
31 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
34 for i from 0 to deg do coeff(poly,i);
Dlog.sollya6 deg = 12; // 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);
Dlog2.sollya6 deg = 11; // poly degree
24 // return p that minimizes |f(x) - poly(x) - x^d*p(x)|/|f(x)|
25 approx = proc(poly,d) {
26 return remez(1 - poly(x)/f(x), deg-d, [a;b], x^d/f(x), 1e-10);
30 poly = invln2hi + invln2lo;
32 p = roundcoefficients(approx(poly,i), [|D ...|]);
33 poly = poly + x^i*coeff(p,0);
39 print("rel error:", accurateinfnorm(1-poly(x)/f(x), [a;b], 30));
42 for i from 0 to deg do coeff(poly,i);
/external/arm-optimized-routines/math/
Dv_exp2f_1u.c30 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn) in specialcase() argument
38 v_f32_t r0 = poly * s1 * s2; in specialcase()
46 v_f32_t n, r, scale, poly, absn; in V_NAME() local
65 poly = v_fma_f32 (C0, r, C1); in V_NAME()
66 poly = v_fma_f32 (poly, r, C2); in V_NAME()
67 poly = v_fma_f32 (poly, r, C3); in V_NAME()
68 poly = v_fma_f32 (poly, r, C4); in V_NAME()
69 poly = v_fma_f32 (poly, r, C5); in V_NAME()
70 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
72 return specialcase (poly, n, e, absn); in V_NAME()
[all …]
Dv_expf_1u.c33 specialcase (v_f32_t poly, v_f32_t n, v_u32_t e, v_f32_t absn) in specialcase() argument
41 v_f32_t r0 = poly * s1 * s2; in specialcase()
49 v_f32_t n, r, scale, poly, absn, z; in V_NAME() local
70 poly = v_fma_f32 (C0, r, C1); in V_NAME()
71 poly = v_fma_f32 (poly, r, C2); in V_NAME()
72 poly = v_fma_f32 (poly, r, C3); in V_NAME()
73 poly = v_fma_f32 (poly, r, C4); in V_NAME()
74 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
75 poly = v_fma_f32 (poly, r, v_f32 (1.0f)); in V_NAME()
77 return specialcase (poly, n, e, absn); in V_NAME()
[all …]

12345678