Home
last modified time | relevance | path

Searched refs:poly (Results 1 - 25 of 133) sorted by relevance

123456

/third_party/skia/tests/
H A 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 in DEF_TEST()
[all...]
/third_party/skia/bench/
H A DPolyUtilsBench.cpp22 virtual void makePoly(SkTDArray<SkPoint>* poly) = 0;
50 SkTDArray<SkPoint> poly; variable
51 this->makePoly(&poly);
55 (void)SkIsConvexPolygon(poly.begin(), poly.count());
60 (void)SkIsSimplePolygon(poly.begin(), poly.count());
64 if (SkIsConvexPolygon(poly.begin(), poly.count())) {
67 (void)SkInsetConvexPolygon(poly
[all...]
/third_party/optimized-routines/math/
H A 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 exp2f_1u() local
49 /* exp2(x) = 2^n * poly(r), with poly(r) in [1/sqrt(2),sqrt(2)] in exp2f_1u()
65 poly = v_fma_f32 (C0, r, C1); in exp2f_1u()
66 poly = v_fma_f32 (poly, r, C2); in exp2f_1u()
67 poly = v_fma_f32 (poly, in exp2f_1u()
[all...]
H A 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 expf_1u() local
52 /* exp(x) = 2^n * poly(r), with poly(r) in [1/sqrt(2),sqrt(2)] in expf_1u()
70 poly = v_fma_f32 (C0, r, C1); in expf_1u()
71 poly = v_fma_f32 (poly, r, C2); in expf_1u()
72 poly = v_fma_f32 (poly, in expf_1u()
[all...]
H A Dv_expf.c33 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
41 v_u32_t r1 = v_as_u32_f32 (v_fma_f32 (poly, s2, s2) * s1); in specialcase()
43 v_u32_t r0 = v_as_u32_f32 (v_fma_f32 (poly, scale, scale)); in specialcase()
51 v_f32_t n, r, r2, scale, p, q, poly, absn, z; in expf() local
54 /* exp(x) = 2^n (1 + poly(r)), with 1 + poly(r) in [1/sqrt(2),sqrt(2)] in expf()
77 poly = v_fma_f32 (q, r2, p); in expf()
79 return specialcase (poly, n, e, absn, cmp, scale); in expf()
80 return v_fma_f32 (poly, scale, scale); in expf()
H A Dv_exp2f.c30 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
38 v_u32_t r1 = v_as_u32_f32 (v_fma_f32 (poly, s2, s2) * s1); in specialcase()
40 v_u32_t r0 = v_as_u32_f32 (v_fma_f32 (poly, scale, scale)); in specialcase()
48 v_f32_t n, r, r2, scale, p, q, poly, absn; in exp2f() local
51 /* exp2(x) = 2^n (1 + poly(r)), with 1 + poly(r) in [1/sqrt(2),sqrt(2)] in exp2f()
72 poly = v_fma_f32 (q, r2, p); in exp2f()
74 return specialcase (poly, n, e, absn, cmp, scale); in exp2f()
75 return v_fma_f32 (poly, scale, scale); in exp2f()
H A Dmath_config.h327 double poly[EXP2F_POLY_ORDER]; member
342 double poly[LOGF_POLY_ORDER - 1]; /* First order coefficient is 1. */ member
353 double poly[LOG2F_POLY_ORDER]; member
370 double poly[POWF_LOG2_POLY_ORDER]; member
390 double poly[4]; /* Last four coefficients. */ member
403 double poly[LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member
418 double poly[LOG2_POLY_ORDER - 1]; member
432 double poly[POW_LOG_POLY_ORDER - 1]; /* First coefficient is 1. */ member
H A Dexp.c19 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER]
20 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER]
21 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER]
22 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER]
23 #define C6 __exp_data.poly[9 - EXP_POLY_ORDER]
140 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
H A Dv_powf.c17 #define A v__powf_log2_data.poly
18 #define C v__exp2f_data.poly
36 double poly[V_EXP2F_POLY_ORDER]; member
48 double poly[V_POWF_LOG2_POLY_ORDER]; member
72 .poly = {
113 .poly = {
134 .poly = {
/third_party/node/deps/openssl/openssl/providers/implementations/ciphers/
H A Dcipher_chacha20_poly1305_hw.c123 POLY1305 *poly = &ctx->poly1305; in chacha20_poly1305_tls_cipher() local
138 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
163 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
195 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
198 Poly1305_Update(poly, ctx->tls_aad, POLY1305_BLOCK_SIZE); in chacha20_poly1305_tls_cipher()
206 Poly1305_Update(poly, out, plen); in chacha20_poly1305_tls_cipher()
208 Poly1305_Update(poly, in, plen); in chacha20_poly1305_tls_cipher()
215 Poly1305_Update(poly, zero, tail); in chacha20_poly1305_tls_cipher()
241 Poly1305_Update(poly, tohash, tohash_len); in chacha20_poly1305_tls_cipher()
243 Poly1305_Final(poly, bct in chacha20_poly1305_tls_cipher()
272 POLY1305 *poly = &ctx->poly1305; chacha20_poly1305_aead_cipher() local
[all...]
/third_party/openssl/providers/implementations/ciphers/
H A Dcipher_chacha20_poly1305_hw.c123 POLY1305 *poly = &ctx->poly1305; in chacha20_poly1305_tls_cipher() local
138 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
163 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
195 Poly1305_Init(poly, buf); in chacha20_poly1305_tls_cipher()
198 Poly1305_Update(poly, ctx->tls_aad, POLY1305_BLOCK_SIZE); in chacha20_poly1305_tls_cipher()
206 Poly1305_Update(poly, out, plen); in chacha20_poly1305_tls_cipher()
208 Poly1305_Update(poly, in, plen); in chacha20_poly1305_tls_cipher()
215 Poly1305_Update(poly, zero, tail); in chacha20_poly1305_tls_cipher()
241 Poly1305_Update(poly, tohash, tohash_len); in chacha20_poly1305_tls_cipher()
243 Poly1305_Final(poly, bct in chacha20_poly1305_tls_cipher()
272 POLY1305 *poly = &ctx->poly1305; chacha20_poly1305_aead_cipher() local
[all...]
/third_party/node/deps/openssl/openssl/crypto/ec/
H A Dec2_smpl.c63 group->poly[0] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
64 group->poly[1] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
65 group->poly[2] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
66 group->poly[3] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
67 group->poly[4] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
68 group->poly[5] = -1; in ossl_ec_GF2m_simple_group_clear_finish()
83 dest->poly[0] = src->poly[0]; in ossl_ec_GF2m_simple_group_copy()
84 dest->poly[1] = src->poly[ in ossl_ec_GF2m_simple_group_copy()
[all...]
/third_party/openssl/crypto/ec/
H A Dec2_smpl.c63 group->poly[0] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
64 group->poly[1] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
65 group->poly[2] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
66 group->poly[3] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
67 group->poly[4] = 0; in ossl_ec_GF2m_simple_group_clear_finish()
68 group->poly[5] = -1; in ossl_ec_GF2m_simple_group_clear_finish()
83 dest->poly[0] = src->poly[0]; in ossl_ec_GF2m_simple_group_copy()
84 dest->poly[1] = src->poly[ in ossl_ec_GF2m_simple_group_copy()
[all...]
/third_party/skia/modules/skottie/src/layers/shapelayer/
H A DPolystar.cpp54 SkPathBuilder poly; variable
57 poly.moveTo(pt_on_circle(fPosition, fOuterRadius, angle));
58 poly.incReserve(fType == Type::kStar ? count * 2 : count);
62 poly.lineTo(pt_on_circle(fPosition, fInnerRadius, angle + arc * 0.5f));
65 poly.lineTo(pt_on_circle(fPosition, fOuterRadius, angle));
68 poly.close();
69 this->node()->setPath(poly.detach());
/third_party/gptfdisk/
H A Dcrc32.cc52 unsigned long crc, poly; in chksum_crc32gentab() local
55 poly = 0xEDB88320L; in chksum_crc32gentab()
63 crc = (crc >> 1) ^ poly; in chksum_crc32gentab()
/third_party/skia/docs/examples/
H A DCanvas_clipPath_3.cpp10 SkPoint poly[] = {{20, 20}, { 80, 20}, { 80, 80}, {40, 80}, in REG_FIDDLE() local
12 path.addPoly(poly, SK_ARRAY_COUNT(poly), true); in REG_FIDDLE()
/third_party/musl/porting/liteos_a/kernel/src/math/
H A Dexp.c19 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER]
20 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER]
21 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER]
22 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER]
126 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp()
H A Dpow.c21 #define A __pow_log_data.poly
111 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER]
112 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER]
113 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER]
114 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER]
115 #define C6 __exp_data.poly[9 - EXP_POLY_ORDER]
223 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
/third_party/musl/src/math/
H A Dexp.c19 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER]
20 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER]
21 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER]
22 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER]
126 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp()
H A Dpow.c21 #define A __pow_log_data.poly
111 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER]
112 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER]
113 #define C4 __exp_data.poly[7 - EXP_POLY_ORDER]
114 #define C5 __exp_data.poly[8 - EXP_POLY_ORDER]
115 #define C6 __exp_data.poly[9 - EXP_POLY_ORDER]
223 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
/third_party/musl/porting/uniproton/kernel/src/math/
H A Dpow.c21 #define A __pow_log_data1.poly
111 #define C2 __exp_data1.poly[5 - EXP_POLY_ORDER]
112 #define C3 __exp_data1.poly[6 - EXP_POLY_ORDER]
113 #define C4 __exp_data1.poly[7 - EXP_POLY_ORDER]
114 #define C5 __exp_data1.poly[8 - EXP_POLY_ORDER]
115 #define C6 __exp_data1.poly[9 - EXP_POLY_ORDER]
223 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
/third_party/musl/porting/liteos_m/kernel/src/math/
H A Dpow.c21 #define A __pow_log_data1.poly
111 #define C2 __exp_data1.poly[5 - EXP_POLY_ORDER]
112 #define C3 __exp_data1.poly[6 - EXP_POLY_ORDER]
113 #define C4 __exp_data1.poly[7 - EXP_POLY_ORDER]
114 #define C5 __exp_data1.poly[8 - EXP_POLY_ORDER]
115 #define C6 __exp_data1.poly[9 - EXP_POLY_ORDER]
223 /* Worst case error is less than 0.5+1.11/N+(abs poly error * 2^53) ulp. */ in exp_inline()
/third_party/backends/backend/
H A Dsm3840_lib.c832 calculate_lut8 (double *poly, int skip, unsigned char *dest) in calculate_lut8() argument
836 if (!poly || !dest) in calculate_lut8()
840 sum = poly[0]; in calculate_lut8()
842 sum += poly[1] * x; in calculate_lut8()
844 sum += poly[2] * x; in calculate_lut8()
846 sum += poly[3] * x; in calculate_lut8()
848 sum += poly[4] * x; in calculate_lut8()
850 sum += poly[5] * x; in calculate_lut8()
852 sum += poly[6] * x; in calculate_lut8()
854 sum += poly[ in calculate_lut8()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrTriangulator.cpp393 TESS_LOG("addEdge (%g -> %g) to poly %d, %s side\n", in addEdge()
396 Poly* poly = this; in addEdge() local
413 return poly; in addEdge()
423 poly = partner; in addEdge()
431 return poly; in addEdge()
433 void* GrTriangulator::emitPoly(const Poly* poly, void *data) const { in emitPoly() argument
434 if (poly->fCount < 3) { in emitPoly()
437 TESS_LOG("emit() %d, size %d\n", poly->fID, poly->fCount); in emitPoly()
438 for (MonotonePoly* m = poly in emitPoly()
449 Poly* poly = fAlloc->make<Poly>(v, winding); makePoly() local
615 apply_fill_type(SkPathFillType fillType, Poly* poly) apply_fill_type() argument
1447 Poly* poly = this->makePoly(&polys, v, winding); tessellate() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dchi_square.cc35 inline T EvaluatePolynomial(T x, const T (&poly)[N]) { in EvaluatePolynomial() argument
39 T p = poly[N - 1]; in EvaluatePolynomial()
41 p = fma(p, x, poly[N - i]); in EvaluatePolynomial()

Completed in 14 milliseconds

123456