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

1234

/external/arm-neon-tests/
H A Dref_vceq.c39 DECL_VARIABLE(vector, poly, 8, 8);
40 DECL_VARIABLE(vector, poly, 8, 16);
42 DECL_VARIABLE(vector2, poly, 8, 8);
43 DECL_VARIABLE(vector2, poly, 8, 16);
50 VLOAD(vector, buffer, , poly, p, 8, 8);
51 VLOAD(vector, buffer, q, poly, p, 8, 16);
53 VDUP(vector2, , poly, p, 8, 8, 0xF3);
54 VDUP(vector2, q, poly, p, 8, 16, 0xF4);
57 TEST_VCOMP(INSN_NAME, , poly, p, uint, 8, 8);
58 TEST_VCOMP(INSN_NAME, q, poly,
[all...]
H A Dref_vcnt.c57 DECL_VARIABLE(vector, poly, 8, 8);
60 DECL_VARIABLE(vector, poly, 8, 16);
64 DECL_VARIABLE(vector_res, poly, 8, 8);
67 DECL_VARIABLE(vector_res, poly, 8, 16);
74 VDUP(vector, , poly, p, 8, 8, 0x35);
77 VDUP(vector, q, poly, p, 8, 16, 0xBD);
82 TEST_UNARY_OP(INSN_NAME, , poly, p, 8, 8);
85 TEST_UNARY_OP(INSN_NAME, q, poly, p, 8, 16);
H A Dref_vrev.c61 TEST_VREV(, poly, p, 8, 8, 16);
64 TEST_VREV(q, poly, p, 8, 16, 16);
73 TEST_VREV(, poly, p, 8, 8, 32);
74 TEST_VREV(, poly, p, 16, 4, 32);
79 TEST_VREV(q, poly, p, 8, 16, 32);
80 TEST_VREV(q, poly, p, 16, 8, 32);
91 TEST_VREV(, poly, p, 8, 8, 64);
92 TEST_VREV(, poly, p, 16, 4, 64);
99 TEST_VREV(q, poly, p, 8, 16, 64);
100 TEST_VREV(q, poly,
[all...]
H A Dref_vcreate.c64 DECL_VAL(val, poly, 8, 8);
65 DECL_VAL(val, poly, 16, 4);
82 DECL_VARIABLE(vector_res, poly, 8, 8);
83 DECL_VARIABLE(vector_res, poly, 16, 4);
100 VECT_VAR(val, poly, 8, 8) = 0x123456789abcdef0ULL;
101 VECT_VAR(val, poly, 16, 4) = 0x123456789abcdef0ULL;
115 TEST_VCREATE(poly, p, 8, 8);
116 TEST_VCREATE(poly, p, 16, 4);
H A Dref_vsli_n.c60 VDUP(vector2, , poly, p, 8, 8, 20);
61 VDUP(vector2, , poly, p, 16, 4, 30);
70 VDUP(vector2, q, poly, p, 8, 16, 12);
71 VDUP(vector2, q, poly, p, 16, 8, 3);
82 TEST_VSXI_N(INSN_NAME, , poly, p, 8, 8, 7);
83 TEST_VSXI_N(INSN_NAME, , poly, p, 16, 4, 15);
92 TEST_VSXI_N(INSN_NAME, q, poly, p, 8, 16, 7);
93 TEST_VSXI_N(INSN_NAME, q, poly, p, 16, 8, 15);
H A Dref_vsri_n.c60 VDUP(vector2, , poly, p, 8, 8, 20);
61 VDUP(vector2, , poly, p, 16, 4, 30);
70 VDUP(vector2, q, poly, p, 8, 16, 12);
71 VDUP(vector2, q, poly, p, 16, 8, 3);
82 TEST_VSXI_N(INSN_NAME, , poly, p, 8, 8, 8);
83 TEST_VSXI_N(INSN_NAME, , poly, p, 16, 4, 16);
92 TEST_VSXI_N(INSN_NAME, q, poly, p, 8, 16, 8);
93 TEST_VSXI_N(INSN_NAME, q, poly, p, 16, 8, 16);
H A 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,
[all...]
H A Dref_vreinterpret.c107 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 8, 8);
108 TEST_VREINTERPRET(, int, s, 8, 8, poly, p, 16, 4);
118 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 8, 8);
119 TEST_VREINTERPRET(, int, s, 16, 4, poly, p, 16, 4);
129 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 8, 8);
130 TEST_VREINTERPRET(, int, s, 32, 2, poly, p, 16, 4);
140 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 8, 8);
141 TEST_VREINTERPRET(, int, s, 64, 1, poly, p, 16, 4);
151 TEST_VREINTERPRET(, uint, u, 8, 8, poly, p, 8, 8);
152 TEST_VREINTERPRET(, uint, u, 8, 8, poly,
[all...]
H A Dref_vdup_lane.c64 TEST_VDUP_LANE(, poly, p, 8, 8, 8, 7);
65 TEST_VDUP_LANE(, poly, p, 16, 4, 4, 3);
76 TEST_VDUP_LANE(q, poly, p, 8, 16, 8, 5);
77 TEST_VDUP_LANE(q, poly, p, 16, 8, 4, 1);
H A Dref_vuzp.c82 DECL_VUZP(poly, 8, 8); \
83 DECL_VUZP(poly, 16, 4); \
91 DECL_VUZP(poly, 8, 16); \
92 DECL_VUZP(poly, 16, 8); \
109 VDUP(vector2, , poly, p, 8, 8, 0x55);
110 VDUP(vector2, , poly, p, 16, 4, 0x66);
119 VDUP(vector2, q, poly, p, 8, 16, 0x55);
120 VDUP(vector2, q, poly, p, 16, 8, 0x66);
130 TEST_VUZP(INSN, , poly, p, 8, 8); \
131 TEST_VUZP(INSN, , poly,
[all...]
H A Dref_vtbX.c72 DECL_VARIABLE(vector, poly, 8, 8);
75 DECL_VARIABLE(vector_res, poly, 8, 8);
80 DECL_VARIABLE(table_vector, poly, 8, 8);
85 DECL_VARIABLE(default_vector, poly, 8, 8);
91 DECL_VTBX(poly, 8, 8, X)
96 TEST_VTBL1(poly, p, uint, 8, 8)
101 TEST_VTBLX(poly, p, uint, 8, 8, X)
116 VDUP(vector, , poly, p, 8, 8, 2);
126 TEST_VSET_LANE(vector, , poly, p, 8, 8, 0, 10);
127 TEST_VSET_LANE(vector, , poly,
[all...]
H A Dref_vbsl.c71 VDUP(vector2, , poly, p, 8, 8, 0xF3);
72 VDUP(vector2, , poly, p, 16, 4, 0xFFF2);
82 VDUP(vector2, q, poly, p, 8, 16, 0xF3);
83 VDUP(vector2, q, poly, p, 16, 8, 0xFFF2);
96 TEST_VBSL(uint, , poly, p, 8, 8);
97 TEST_VBSL(uint, , poly, p, 16, 4);
98 TEST_VBSL(uint, q, poly, p, 8, 16);
99 TEST_VBSL(uint, q, poly, p, 16, 8);
H A Dref_vdup.c66 TEST_VDUP(, poly, p, 8, 8);
67 TEST_VDUP(, poly, p, 16, 4);
78 TEST_VDUP(q, poly, p, 8, 16);
79 TEST_VDUP(q, poly, p, 16, 8);
98 TEST_VMOV(, poly, p, 8, 8);
99 TEST_VMOV(, poly, p, 16, 4);
110 TEST_VMOV(q, poly, p, 8, 16);
111 TEST_VMOV(q, poly, p, 16, 8);
H A Dref_vext.c66 VDUP(vector2, , poly, p, 8, 8, 0x55);
67 VDUP(vector2, , poly, p, 16, 4, 0x66);
78 VDUP(vector2, q, poly, p, 8, 16, 0x55);
79 VDUP(vector2, q, poly, p, 16, 8, 0x66);
91 TEST_VEXT(, poly, p, 8, 8, 6);
92 TEST_VEXT(, poly, p, 16, 4, 2);
103 TEST_VEXT(q, poly, p, 8, 16, 12);
104 TEST_VEXT(q, poly, p, 16, 8, 6);
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialUtils.h18 * \param[in] poly : the vector of coefficients of the polynomial ordered
19 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
28 T poly_eval_horner( const Polynomials& poly, const T& x ) argument
30 T val=poly[poly.size()-1];
31 for(DenseIndex i=poly.size()-2; i>=0; --i ){
32 val = val*x + poly[i]; }
39 * \param[in] poly : the vector of coefficients of the polynomial ordered
40 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
46 T poly_eval( const Polynomials& poly, cons argument
[all...]
H A DPolynomialSolver.h43 inline void setPolynomial( const OtherPolynomial& poly ){
44 m_roots.resize(poly.size()-1); }
48 inline PolynomialSolverBase( const OtherPolynomial& poly ){
49 setPolynomial( poly() ); }
345 void compute( const OtherPolynomial& poly )
347 eigen_assert( Scalar(0) != poly[poly.size()-1] );
348 eigen_assert( poly.size() > 1 );
349 if(poly.size() > 2 )
351 internal::companion<Scalar,_Deg> companion( poly );
[all...]
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dpolygon.c70 static void polygon_print(struct polygon *poly)
74 debug_printf("Polygon %p, size = %d\n", poly, poly->num_verts);
75 for (i = 0; i < poly->num_verts; ++i) {
76 vert = ptr_to_vertex(poly->data, i);
86 struct polygon *poly = (struct polygon*)malloc(sizeof(struct polygon)); local
88 poly->data = malloc(sizeof(float) * COMPONENTS * size);
89 poly->size = size;
90 poly->num_verts = 0;
91 poly
99 struct polygon *poly = polygon_create(size); local
109 polygon_destroy(struct polygon *poly) argument
115 polygon_resize(struct polygon *poly, int new_size) argument
127 polygon_size(struct polygon *poly) argument
132 polygon_vertex_count(struct polygon *poly) argument
137 polygon_data(struct polygon *poly) argument
244 polygon_prepare_buffer(struct vg_context *ctx, struct polygon *poly) argument
260 polygon_fill(struct polygon *poly, struct vg_context *ctx) argument
337 struct polygon *poly = (((struct polygon**)polys->data)[i]); local
[all...]
H A Dpolygon.h39 void polygon_destroy(struct polygon *poly);
41 void polygon_resize(struct polygon *poly, int new_size);
42 int polygon_size(struct polygon *poly);
44 int polygon_vertex_count(struct polygon *poly);
45 float * polygon_data(struct polygon *poly);
/external/gptfdisk/
H A Dcrc32.cc52 unsigned long crc, poly; local
55 poly = 0xEDB88320L;
63 crc = (crc >> 1) ^ poly;
/external/syslinux/core/fs/btrfs/
H A Dcrc32c.h17 * poly = 0x1EDC6F41
41 const u32 poly = 0x82F63B78; /* Bit-reflected CRC32C polynomial */ local
46 v = (v >> 1) ^ ((v & 1) ? poly : 0);
/external/ImageMagick/PerlMagick/demo/
H A Dtree.pl28 motionsub => sub{ push( @poly, @_[0..1] ); }
/external/clang/test/CodeGenCXX/
H A Dmicrosoft-abi-typeid.cpp58 void f(const Polymorphic &poly) { argument
63 typeid(poly);
/external/lzma/xz-embedded/
H A Dxz_crc32.c32 const uint32_t poly = 0xEDB88320; local
41 r = (r >> 1) ^ (poly & ~((r & 1) - 1));
H A Dxz_crc64.c23 const uint64_t poly = 0xC96C5795D7870F42; local
32 r = (r >> 1) ^ (poly & ~((r & 1) - 1));
/external/skia/tests/
H A DInsetConvexPolyTest.cpp10 static bool is_convex(const SkTDArray<SkPoint>& poly) { argument
11 if (poly.count() < 3) {
15 SkVector v0 = poly[0] - poly[poly.count() - 1];
16 SkVector v1 = poly[1] - poly[poly.count() - 1];
19 for (int i = 0; i < poly.count()-1; ++i) {
21 int k = (i + 2) % poly
[all...]

Completed in 378 milliseconds

1234