Searched defs:v0 (Results 1 - 25 of 180) sorted by relevance

12345678

/external/clang/test/Sema/
H A D2010-05-31-palignr.c16 vSInt16 v0; local
17 v0 = *vdtbl;
18 v0 = _mm_alignr_epi8(v0, v0, i); // expected-error {{argument to '__builtin_ia32_palignr128' must be a constant integer}}
/external/clang/test/CodeGen/
H A Dhexagon-inline-asm.c8 void foo(v64 v0, v64 v1, v64 *p) { argument
11 asm ("%0 = vgtw(%1.w,%2.w)" : "=q"(q0) : "v"(v0), "v"(v1));
H A Dvld_dup.c7 int32_t v0[3]; local
16 v1 = vld3_dup_s32(v0);
H A Ddebug-info.c5 struct { typeof(0) f0; } v0; local
/external/mdnsresponder/Clients/
H A DClientCommon.c57 int v0 = cstr[-1] - '0'; // then interpret as three-digit decimal local
60 int val = v0 * 100 + v1 * 10 + v2;
/external/deqp/framework/delibs/debase/
H A DdeMathTest.c63 } v0, v1; local
65 v0.f = deInt32ToFloatRoundToNegInf(x);
68 DE_TEST_ASSERT(v0.u + 1 == v1.u || v0.u == v1.u + 1);
/external/skia/tests/
H A DInsetConvexPolyTest.cpp15 SkVector v0 = poly[0] - poly[poly.count() - 1]; local
17 SkScalar winding = v0.cross(v1);
23 SkVector v0 = poly[j] - poly[i]; local
25 SkScalar perpDot = v0.cross(v1);
H A DVerticesTest.cpp11 static bool equal(const SkVertices* v0, const SkVertices* v1) { argument
12 if (v0->mode() != v1->mode()) {
15 if (v0->vertexCount() != v1->vertexCount()) {
18 if (v0->indexCount() != v1->indexCount()) {
22 if (!!v0->texCoords() != !!v1->texCoords()) {
25 if (!!v0->colors() != !!v1->colors()) {
29 for (int i = 0; i < v0->vertexCount(); ++i) {
30 if (v0->positions()[i] != v1->positions()[i]) {
33 if (v0->texCoords()) {
34 if (v0
78 sk_sp<SkVertices> v0 = builder.detach(); local
[all...]
/external/webrtc/webrtc/modules/desktop_capture/
H A Ddiffer_block_sse2.cc28 __m128i v0; local
34 v0 = _mm_loadu_si128(i1);
36 sad = _mm_sad_epu8(v0, v1);
38 v0 = _mm_loadu_si128(i1 + 1);
40 sad = _mm_sad_epu8(v0, v1);
42 v0 = _mm_loadu_si128(i1 + 2);
44 sad = _mm_sad_epu8(v0, v1);
46 v0 = _mm_loadu_si128(i1 + 3);
48 sad = _mm_sad_epu8(v0, v1);
68 __m128i v0; local
[all...]
/external/iptables/include/linux/netfilter/
H A Dxt_string.h23 } v0; member in union:xt_string_info::__anon8192
/external/kernel-headers/original/uapi/linux/netfilter/
H A Dxt_string.h23 } v0; member in union:xt_string_info::__anon8878
/external/libcxx/test/std/utilities/variant/variant.hash/
H A Dhash.pass.cpp57 const V v0; local
66 assert(h(v0) == h(v0));
67 assert(h(v0) == h(v0_other));
74 assert(h(v0) != h(v1));
75 assert(h(v0) != h(v2));
76 assert(h(v0) != h(v3));
/external/mesa3d/src/mesa/swrast/
H A Ds_feedback.c56 _swrast_feedback_triangle(struct gl_context *ctx, const SWvertex *v0, argument
59 if (!_swrast_culltriangle(ctx, v0, v1, v2)) {
64 feedback_vertex(ctx, v0, v0);
69 feedback_vertex(ctx, v0, v2);
78 _swrast_feedback_line(struct gl_context *ctx, const SWvertex *v0, argument
90 feedback_vertex(ctx, v0, v0);
94 feedback_vertex(ctx, v0, v1);
111 _swrast_select_triangle(struct gl_context *ctx, const SWvertex *v0, argument
125 _swrast_select_line(struct gl_context *ctx, const SWvertex *v0, const SWvertex *v1) argument
[all...]
/external/mesa3d/src/mesa/tnl_dd/
H A Dt_dd_triemit.h39 VERTEX *v0,
50 PRINT_VERTEX(v0);
56 COPY_DWORDS( j, vb, vertsize, v0 );
63 VERTEX *v0,
74 PRINT_VERTEX(v0);
80 COPY_DWORDS( j, vb, vertsize, v0 );
91 VERTEX *v0,
101 PRINT_VERTEX(v0);
106 COPY_DWORDS( j, vb, vertsize, v0 );
114 VERTEX *v0,
38 quad( CTX_ARG, VERTEX *v0, VERTEX *v1, VERTEX *v2, VERTEX *v3 ) argument
62 quad( CTX_ARG, VERTEX *v0, VERTEX *v1, VERTEX *v2, VERTEX *v3 ) argument
90 triangle( CTX_ARG, VERTEX *v0, VERTEX *v1, VERTEX *v2 ) argument
113 line( CTX_ARG, VERTEX *v0, VERTEX *v1 ) argument
[all...]
/external/pdfium/third_party/agg23/
H A Dagg_vcgen_stroke.cpp68 const vertex_dist& v0,
72 FX_FLOAT dx = (v1.y - v0.y) * width / len;
73 FX_FLOAT dy = (v1.x - v0.x) * width / len;
74 cap[0] = v0.x - dx;
75 cap[1] = v0.y + dy;
76 cap[2] = v0.x + dx;
77 cap[3] = v0.y - dy;
67 calc_butt_cap(FX_FLOAT* cap, const vertex_dist& v0, const vertex_dist& v1, FX_FLOAT len, FX_FLOAT width) argument
/external/boringssl/src/decrepit/des/
H A Dcfb64ede.c72 uint32_t v0, v1; local
82 c2l(iv, v0);
85 ti[0] = v0;
88 v0 = ti[0];
92 l2c(v0, iv);
104 c2l(iv, v0);
107 ti[0] = v0;
110 v0 = ti[0];
114 l2c(v0, iv);
125 v0
136 uint32_t d0, d1, v0, v1; local
[all...]
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_mutex_test.cc35 T v0 = data_[0]; local
37 CHECK_EQ(data_[i], v0);
45 T v0 = data_[0];
47 CHECK_EQ(data_[i], v0);
/external/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_mutex_test.cc33 T v0 = data_[0]; local
35 CHECK_EQ(data_[i], v0);
42 T v0 = data_[0]; local
44 CHECK_EQ(data_[i], v0);
/external/eigen/test/
H A Dgeo_homogeneous.cpp29 VectorType v0 = VectorType::Random(), local
38 hv0 << v0, 1; local
39 VERIFY_IS_APPROX(v0.homogeneous(), hv0);
40 VERIFY_IS_APPROX(v0, hv0.hnormalized());
42 VERIFY_IS_APPROX(v0.homogeneous().sum(), hv0.sum());
43 VERIFY_IS_APPROX(v0.homogeneous().minCoeff(), hv0.minCoeff());
44 VERIFY_IS_APPROX(v0.homogeneous().maxCoeff(), hv0.maxCoeff());
55 VERIFY_IS_APPROX(t1 * (v0.homogeneous().eval()), t1 * v0.homogeneous());
59 VERIFY_IS_APPROX(t2 * (v0
[all...]
H A Dgeo_orthomethods.cpp27 Vector3 v0 = Vector3::Random(), local
38 mat3 << v0.normalized(),
39 (v0.cross(v1)).normalized(),
40 (v0.cross(v1).cross(v0)).normalized();
44 VERIFY_IS_APPROX(v0.cross(mat3*v1), -(mat3*v1).cross(v0));
45 VERIFY_IS_APPROX(v0.cross(mat3.lazyProduct(v1)), -(mat3.lazyProduct(v1)).cross(v0));
88 VectorType v0 local
[all...]
/external/libvpx/libvpx/vpx_dsp/arm/
H A Dmem_neon.h25 const int32x4x2_t v0 = vld2q_s32(buf); local
27 const int16x4_t s0 = vmovn_s32(v0.val[0]);
28 const int16x4_t s1 = vmovn_s32(v0.val[1]);
42 const int32x4_t v0 = vld1q_s32(buf); local
44 const int16x4_t s0 = vmovn_s32(v0);
54 const int32x4_t v0 = vld1q_s32(buf); local
55 return vmovn_s32(v0);
63 const int32x4_t v0 = vmovl_s16(vget_low_s16(a)); local
65 vst1q_s32(buf, v0);
/external/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe.c112 * Build primitive to render a point with vertex at v0.
115 const char *v0 )
121 prim.v[0] = (struct vertex_header *)v0;
128 * Build primitive to render a line with vertices at v0, v1.
133 const char *v0,
140 prim.v[0] = (struct vertex_header *)v0;
148 * Build primitive to render a triangle with vertices at v0, v1, v2.
153 char *v0,
159 prim.v[0] = (struct vertex_header *)v0;
131 do_line( struct draw_context *draw, ushort flags, const char *v0, const char *v1 ) argument
151 do_triangle( struct draw_context *draw, ushort flags, char *v0, char *v1, char *v2 ) argument
H A Ddraw_pipe_cull.c60 const float *v0 = header->v[0]->data[pos]; local
64 /* edge vectors: e = v0 - v2, f = v1 - v2 */
65 const float ex = v0[0] - v2[0];
66 const float ey = v0[1] - v2[1];
H A Ddraw_pipe_unfilled.c61 struct vertex_header *v0 )
64 tmp.v[0] = v0;
69 struct vertex_header *v0,
73 tmp.v[0] = v0;
82 struct vertex_header *v0 = header->v[0]; local
86 if ((header->flags & DRAW_PIPE_EDGE_FLAG_0) && v0->edgeflag) point( stage, v0 );
95 struct vertex_header *v0 = header->v[0]; local
102 if ((header->flags & DRAW_PIPE_EDGE_FLAG_2) && v2->edgeflag) line( stage, v2, v0 );
103 if ((header->flags & DRAW_PIPE_EDGE_FLAG_0) && v0
68 line( struct draw_stage *stage, struct vertex_header *v0, struct vertex_header *v1 ) argument
[all...]
/external/skia/src/effects/gradients/
H A DSkClampRange.cpp89 void SkClampRange::init(SkGradFixed fx0, SkGradFixed dx0, int count, int v0, int v1) { argument
92 fV0 = v0;

Completed in 601 milliseconds

12345678