Searched defs:p3 (Results 126 - 150 of 192) sorted by relevance

12345678

/external/skia/experimental/StrokePathRenderer/
H A DGrStrokePathRenderer.cpp25 const SkPoint& p3, const SkPoint& p4,
29 SkScalar x1 = p1.x(), x2 = p2.x(), x3 = p3.x(), x4 = p4.x();
30 SkScalar y1 = p1.y(), y2 = p2.y(), y3 = p3.y(), y4 = p4.y();
24 intersection(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, const SkPoint& p4, SkPoint& res) argument
/external/chromium_org/third_party/libvpx/source/libvpx/test/
H A Dconvolve_test.cc579 const int p3 = filters[i][6] + filters[i][7]; local
583 EXPECT_LE(p3, 128);
584 EXPECT_LE(p0 + p3, 128);
585 EXPECT_LE(p0 + p3 + p1, 128);
586 EXPECT_LE(p0 + p3 + p1 + p2, 128);
587 EXPECT_EQ(p0 + p1 + p2 + p3, 128);
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/
H A Dloopfilter_filters_dspr2.c49 uint32_t p3,
66 /* mask |= (abs(p3 - p2) > limit) */
67 "subu_s.qb %[c], %[p3], %[p2] \n\t"
68 "subu_s.qb %[r_k], %[p2], %[p3] \n\t"
119 : [limit] "r" (limit), [p3] "r" (p3), [p2] "r" (p2),
355 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
362 p3 = 0;
386 p3 = *((uint32_t *)(s3));
389 /* if (p1 - p4 == 0) and (p2 - p3
43 vp8_filter_mask_vec_mips( uint32_t limit, uint32_t flimit, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t thresh, uint32_t *hev, uint32_t *mask ) argument
565 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
682 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1032 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1643 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1788 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1915 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
2125 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/
H A Dvp9_loopfilter_intrin_avx2.c402 __m128i p4, p3, p2, p1, p0, q0, q1, q2, q3, q4; local
413 p3 = _mm_loadu_si128((__m128i *) (s - 4 * p));
449 _mm_or_si128(_mm_subs_epu8(p3, p2), _mm_subs_epu8(p2, p3)));
527 _mm_or_si128(_mm_subs_epu8(p3, p0), _mm_subs_epu8(p0, p3)),
580 p256_3 = _mm256_cvtepu8_epi16(p3);
879 p3 = _mm_andnot_si128(flat2, p3);
881 p3
[all...]
H A Dvp9_loopfilter_intrin_sse2.c396 __m128i p4, p3, p2, p1, p0, q0, q1, q2, q3, q4; local
407 p3 = _mm_loadu_si128((__m128i *)(s - 4 * p));
438 work = _mm_max_epu8(abs_diff(p2, p1), abs_diff(p3, p2));
450 work = _mm_max_epu8(abs_diff(p3, p0), abs_diff(q3, q0));
533 const __m128i p3_lo = _mm_unpacklo_epi8(p3, zero);
542 const __m128i p3_hi = _mm_unpackhi_epi8(p3, zero);
595 const __m128i p3_lo = _mm_unpacklo_epi8(p3, zero);
612 const __m128i p3_hi = _mm_unpackhi_epi8(p3, zero);
659 p3 = filter16_mask(&flat2, &p3,
743 __m128i p3, p2, p1, p0, q0, q1, q2, q3; local
969 __m128i p3, p2, p1, p0, q0, q1, q2, q3; local
1208 __m128i p3, p2, p1, p0, q0, q1, q2, q3; local
[all...]
/external/chromium_org/third_party/libwebp/dsp/
H A Ddec.c528 const int p3 = p[-4 * step], p2 = p[-3 * step], p1 = p[-2 * step]; local
532 return VP8kabs0[p3 - p2] <= it && VP8kabs0[p2 - p1] <= it &&
/external/chromium_org/third_party/skia/include/core/
H A DSkPath.h201 const SkPoint& p3) {
203 p2.equalsWithinTolerance(p3);
211 const SkPoint& p3, const SkPoint& p4) {
213 p2.equalsWithinTolerance(p3) &&
214 p3.equalsWithinTolerance(p4);
422 and p2, and ending at p3. If no moveTo() call has been made for this
427 @param p3 The end point on a cubic curve
429 void cubicTo(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) { argument
430 this->cubicTo(p1.fX, p1.fY, p2.fX, p2.fY, p3.fX, p3
200 IsQuadDegenerate(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) argument
210 IsCubicDegenerate(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, const SkPoint& p4) argument
[all...]
/external/chromium_org/third_party/skia/src/gpu/
H A DGrPathUtils.cpp120 const SkPoint& p3,
125 (p1.distanceToLineSegmentBetweenSqd(p0, p3) < tolSqd &&
126 p2.distanceToLineSegmentBetweenSqd(p0, p3) < tolSqd)) {
127 (*points)[0] = p3;
134 { SkScalarAve(p2.fX, p3.fX), SkScalarAve(p2.fY, p3.fY) }
143 uint32_t b = generateCubicPoints(s, r[1], q[2], p3, tolSqd, points, pointsLeft);
566 // p0 = p1 = p2 = p3 Point
743 // a1 = p0 . (p3 x p2)
744 // a2 = p1 . (p0 x p3)
117 generateCubicPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-scheduler.cc655 Node* p3 = graph.NewNode(builder.Parameter(2), graph.start()); local
658 Node* cmp = graph.NewNode(js_builder.LessThanOrEqual(), p1, p2, p3,
/external/chromium_org/v8/test/cctest/
H A Dtest-cpu-profiler.cc373 v8::CpuProfile* p3 = cpu_profiler->StopProfiling(name3); local
374 CHECK_NE(NULL, p3);
376 CHECK_NE(p2, p3);
377 CHECK(FindCpuProfile(cpu_profiler, p3));
382 CHECK(FindCpuProfile(cpu_profiler, p3));
383 p3->Delete();
/external/clang/include/clang/StaticAnalyzer/Core/
H A DCheckerManager.h58 RET operator()(P1 p1, P2 p2, P3 p3, P4 p4, P5 p5) const { argument
59 return Fn(Checker, p1, p2, p3, p4, p5);
70 RET operator()(P1 p1, P2 p2, P3 p3, P4 p4) const { argument
71 return Fn(Checker, p1, p2, p3, p4);
82 RET operator()(P1 p1, P2 p2, P3 p3) const { return Fn(Checker, p1, p2, p3); }
/external/clang/test/SemaCXX/
H A Dfunctional-cast.cpp233 // Test conversion between pointer and integral types, as in p3 and p4.
252 structure *p3 = structurep(p2); local
255 ppint *deep = pppint(p3);
/external/deqp/modules/gles2/accuracy/
H A Des2aTextureMipmapTests.cpp236 Vec2 p3 = transform * Vec2(dst[6], dst[7]); local
241 dst[6] = p3.x(); dst[7] = p3.y();
/external/deqp/modules/gles2/functional/
H A Des2fTextureMipmapTests.cpp240 Vec2 p3 = transform * Vec2(dst[6], dst[7]); local
245 dst[6] = p3.x(); dst[7] = p3.y();
/external/deqp/modules/gles3/accuracy/
H A Des3aTextureMipmapTests.cpp228 Vec2 p3 = transform * Vec2(dst[6], dst[7]); local
233 dst[6] = p3.x(); dst[7] = p3.y();
/external/deqp/modules/gles31/functional/
H A Des31fMultisampleTests.cpp176 void renderQuad (const Vec2& p0, const Vec2& p1, const Vec2& p2, const Vec2& p3, const Vec4& c0, const Vec4& c1, const Vec4& c2, const Vec4& c3) const;
177 void renderQuad (const Vec2& p0, const Vec2& p1, const Vec2& p2, const Vec2& p3, const Vec4& color) const;
355 void DefaultFBOMultisampleCase::renderQuad (const Vec2& p0, const Vec2& p1, const Vec2& p2, const Vec2& p3, const Vec4& c0, const Vec4& c1, const Vec4& c2, const Vec4& c3) const argument
358 renderTriangle(p2, p1, p3, c2, c1, c3);
361 void DefaultFBOMultisampleCase::renderQuad (const Vec2& p0, const Vec2& p1, const Vec2& p2, const Vec2& p3, const Vec4& color) const argument
363 renderQuad(p0, p1, p2, p3, color, color, color, color);
H A Des31fTextureMultisampleTests.cpp145 tcu::Vec4 p3; member in struct:deqp::gles31::Functional::__anon20359::SamplePosRasterizationTest::Triangle
232 tri.p3 = tcu::Vec4(((float)i + 1.0f / (float)(i + 1)) / 20.0f, -1.0f, 0.0f, 1.0f);
241 tri.p3 = tcu::Vec4( 0.0f, ((float)i + 1.0f / (float)(i + 1)) / 20.0f, 0.0f, 1.0f);
254 tri.p3 = tcu::Vec4(p.x() + d.x(), p.y() + d.y(), 0.0f, 1.0f);
261 tri.p3 = tcu::Vec4(-0.802f, -0.802f, 0.0f, 1.0f);
521 triangle.positions[2] = m_testTriangles[triangleNdx].p3 - offset;
/external/libvpx/libvpx/vp8/common/mips/dspr2/
H A Dloopfilter_filters_dspr2.c49 uint32_t p3,
66 /* mask |= (abs(p3 - p2) > limit) */
67 "subu_s.qb %[c], %[p3], %[p2] \n\t"
68 "subu_s.qb %[r_k], %[p2], %[p3] \n\t"
119 : [limit] "r" (limit), [p3] "r" (p3), [p2] "r" (p2),
355 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
362 p3 = 0;
386 p3 = *((uint32_t *)(s3));
389 /* if (p1 - p4 == 0) and (p2 - p3
43 vp8_filter_mask_vec_mips( uint32_t limit, uint32_t flimit, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t thresh, uint32_t *hev, uint32_t *mask ) argument
565 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
682 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1032 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1643 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1788 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
1915 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
2125 uint32_t pm1, p0, p1, p2, p3, p4, p5, p6; local
[all...]
/external/libvpx/libvpx/vp9/common/x86/
H A Dvp9_loopfilter_intrin_avx2.c402 __m128i p4, p3, p2, p1, p0, q0, q1, q2, q3, q4; local
413 p3 = _mm_loadu_si128((__m128i *) (s - 4 * p));
449 _mm_or_si128(_mm_subs_epu8(p3, p2), _mm_subs_epu8(p2, p3)));
527 _mm_or_si128(_mm_subs_epu8(p3, p0), _mm_subs_epu8(p0, p3)),
580 p256_3 = _mm256_cvtepu8_epi16(p3);
879 p3 = _mm_andnot_si128(flat2, p3);
881 p3
[all...]
/external/llvm/test/Bindings/Ocaml/
H A Dvmcore.ml565 let p3 = build_load a3 "user_load" b in var
572 set_operand i 1 p3;
574 insist ((operand i 1) = p3);
/external/opencv/cv/src/
H A Dcvsurf.cpp68 int p0, p1, p2, p3; member in struct:CvSurfHF
77 d += (origin[f[k].p0] + origin[f[k].p3] - origin[f[k].p1] - origin[f[k].p2])*f[k].w;
93 dst[k].p3 = dy2*widthStep + dx2;
167 dx = (s[Dx[0].p0] + s[Dx[0].p3] - s[Dx[0].p1] - s[Dx[0].p2])*Dx[0].w +
168 (s[Dx[1].p0] + s[Dx[1].p3] - s[Dx[1].p1] - s[Dx[1].p2])*Dx[1].w +
169 (s[Dx[2].p0] + s[Dx[2].p3] - s[Dx[2].p1] - s[Dx[2].p2])*Dx[2].w;
170 dy = (s[Dy[0].p0] + s[Dy[0].p3] - s[Dy[0].p1] - s[Dy[0].p2])*Dy[0].w +
171 (s[Dy[1].p0] + s[Dy[1].p3] - s[Dy[1].p1] - s[Dy[1].p2])*Dy[1].w +
172 (s[Dy[2].p0] + s[Dy[2].p3] - s[Dy[2].p1] - s[Dy[2].p2])*Dy[2].w;
173 dxy = (s[Dxy[0].p0] + s[Dxy[0].p3]
[all...]
/external/skia/include/core/
H A DSkPath.h200 const SkPoint& p3) {
202 p2.equalsWithinTolerance(p3);
210 const SkPoint& p3, const SkPoint& p4) {
212 p2.equalsWithinTolerance(p3) &&
213 p3.equalsWithinTolerance(p4);
421 and p2, and ending at p3. If no moveTo() call has been made for this
426 @param p3 The end point on a cubic curve
428 void cubicTo(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) { argument
429 this->cubicTo(p1.fX, p1.fY, p2.fX, p2.fY, p3.fX, p3
199 IsQuadDegenerate(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) argument
209 IsCubicDegenerate(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, const SkPoint& p4) argument
[all...]
/external/skia/src/gpu/
H A DGrPathUtils.cpp120 const SkPoint& p3,
125 (p1.distanceToLineSegmentBetweenSqd(p0, p3) < tolSqd &&
126 p2.distanceToLineSegmentBetweenSqd(p0, p3) < tolSqd)) {
127 (*points)[0] = p3;
134 { SkScalarAve(p2.fX, p3.fX), SkScalarAve(p2.fY, p3.fY) }
143 uint32_t b = generateCubicPoints(s, r[1], q[2], p3, tolSqd, points, pointsLeft);
566 // p0 = p1 = p2 = p3 Point
743 // a1 = p0 . (p3 x p2)
744 // a2 = p1 . (p0 x p3)
117 generateCubicPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument
[all...]
/external/svox/pico/lib/
H A Dpicokpr.c435 picoos_uint32 p0, p1, p2, p3; local
440 p3 = *p;
442 c = p0 + (p1<<8) + (p2<<16) + (p3<<24);
472 picoos_uint32 p0, p1, p2, p3; local
477 p3 = *p;
479 c = p0 + (p1<<8) + (p2<<16) + (p3<<24);
/external/webp/src/dsp/
H A Ddec.c528 const int p3 = p[-4 * step], p2 = p[-3 * step], p1 = p[-2 * step]; local
532 return VP8kabs0[p3 - p2] <= it && VP8kabs0[p2 - p1] <= it &&

Completed in 8264 milliseconds

12345678