/external/libxaac/decoder/ |
H A D | ixheaacd_qmf_dec.c | 696 WORD32 p1; local 765 p1 = 0; 851 sbr_qmf_syn_winadd(fp1, fp2, filter_coeff, &time_out[ch_fac * p1], 2, 868 p1 += no_synthesis_channels; 936 &time_out[ch_fac * p1], temp, ch_fac); 953 &time_out[ch_fac * p1], temp, ch_fac); 968 p1 += no_synthesis_channels;
|
H A D | ixheaacd_sbr_dec.c | 452 WORD32 i, k, p1; local 502 p1 = 0; 543 p1 += no_synthesis_channels;
|
/external/llvm/test/Bindings/OCaml/ |
H A D | core.ml | 580 let p1 = param fn 0 in var 582 let v1 = build_add p1 p2 "v1" b in 583 let v2 = build_add p1 v1 "v2" b in 607 let p1 = param fn 0 in var 611 let i = build_add p1 p2 "sum" b in 614 insist ((operand i 0) = p1); 746 let p1 = param f 0 in var 748 set_value_name "One" p1; 750 add_param_attr p1 Attribute.Sext; 757 insist (Before p1 953 let p1 = param fn 0 ++ set_value_name "P1" in var 1053 let p1 = build_load g1 "X1" atentry in var [all...] |
/external/llvm/unittests/Support/ |
H A D | Path.cpp | 665 fs::create_directories(Twine(TestDirectory) + "/recursive/pop/p1")); 671 if (path::filename(i->path()) == "p1") { 689 v_t::const_iterator p1 = std::find(visited.begin(), visited.end(), "p1"); local 700 ASSERT_EQ(p1, visited.end()); // Not visited. 714 ASSERT_NO_ERROR(fs::remove(Twine(TestDirectory) + "/recursive/pop/p1"));
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_setup_tri.c | 408 __m128i eo, p0, p1, p2; local 481 &p0, &p1, &p2, &unused); 484 _mm_storeu_si128((__m128i *)&plane[1], p1); 510 __m128i eo, p0, p1, p2; 573 &p0, &p1, &p2, &unused); 584 STORE_PLANE(plane[1], p1); 649 debug_printf("p1: %"PRIx64"/%08x/%08x/%08x\n",
|
/external/oj-libjdwp/src/share/back/ |
H A D | SDE.c | 198 * Return 1 if p1 is a SourceName for stratum sti, 202 searchOneSourceName(int sti, char *p1) { argument 208 if (patternMatch(fileTable[ii].sourceName, p1)) { 216 * Return 1 if p1 is a SourceName for any stratum 221 char *p1) { 229 if (searchOneSourceName(ii, p1) == 1) { 219 searchAllSourceNames(JNIEnv *env, jclass clazz, char *p1) argument
|
/external/opencv/cv/src/ |
H A D | cvpyrsegmentation.cpp | 368 _CvPyramid *p1 = p_base[j].p; local 371 p1->c += p_base[j].c; 383 _CvPyramid *p1 = p_cur[j].p; local 389 p1->c += t0;
|
H A D | cvsurf.cpp | 68 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; 91 dst[k].p1 = dy2*widthStep + dx1; 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] - s[Dxy[0].p1] [all...] |
/external/pdfium/core/fxcrt/ |
H A D | fx_coordinates.h | 386 CFX_RTemplate(const PointType& p1, const SizeType& s2) argument 387 : left(p1.x), top(p1.y), width(s2.width), height(s2.height) {} 388 CFX_RTemplate(const PointType& p1, const PointType& p2) argument 389 : left(p1.x), 390 top(p1.y), 391 width(p2.width - p1.width), 392 height(p2.height - p1.height) {
|
/external/pdfium/third_party/lcms/src/ |
H A D | cmsintrp.c | 1024 cmsInterpParams p1; local 1033 p1 = *p; 1034 memmove(&p1.Domain[0], &p ->Domain[1], 3*sizeof(cmsUInt32Number)); 1037 p1.Table = T; 1039 TetrahedralInterpFloat(Input + 1, Tmp1, &p1); 1042 p1.Table = T; 1043 TetrahedralInterpFloat(Input + 1, Tmp2, &p1); 1068 cmsInterpParams p1; local 1078 p1 = *p16; 1079 memmove(&p1 1111 cmsInterpParams p1; local 1156 cmsInterpParams p1; local 1198 cmsInterpParams p1; local 1242 cmsInterpParams p1; local 1283 cmsInterpParams p1; local 1328 cmsInterpParams p1; local 1368 cmsInterpParams p1; local [all...] |
/external/pdfium/third_party/libtiff/ |
H A D | tif_getimage.c | 779 unsigned char* p1 = NULL; local 857 p2 = p1 = p0; 862 p1 = p0 + tilesize; 863 p2 = p1 + tilesize; 874 && TIFFReadTile(tif, p1, col, 910 p0 + pos, p1 + pos, p2 + pos, (alpha?(pa+pos):NULL)); 1045 unsigned char *p0 = NULL, *p1 = NULL, *p2 = NULL, *pa = NULL; local 1110 p2 = p1 = p0; 1115 p1 = p0 + stripsize; 1116 p2 = p1 [all...] |
/external/skia/include/core/ |
H A D | SkCanvas.h | 1183 /** Draws line segment from p0 to p1 using clip, SkMatrix, and SkPaint paint. 1189 @param p1 end of line segment 1192 void drawLine(SkPoint p0, SkPoint p1, const SkPaint& paint) { argument 1193 this->drawLine(p0.x(), p0.y(), p1.x(), p1.y(), paint);
|
/external/skia/src/core/ |
H A D | SkGeometry.cpp | 148 Sk2s p1 = from_point(src[1]); local 152 Sk2s p01 = interp(p0, p1, tt); 153 Sk2s p12 = interp(p1, p2, tt); 362 Sk2s p1 = from_point(src[1]); 367 Sk2s ab = interp(p0, p1, tt); 368 Sk2s bc = interp(p1, p2, tt); 537 // Calcs p0 . (p1 x p2) 538 static double calc_dot_cross_cubic(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2) { 539 const double xComp = (double) p0.fX * ((double) p1.fY - (double) p2.fY); 540 const double yComp = (double) p0.fY * ((double) p2.fX - (double) p1 1088 Sk2s p1 = from_point(fPts[1]); local 1122 Sk2s p1 = from_point(fPts[1]); local [all...] |
/external/skia/src/gpu/ |
H A D | GrPathUtils.cpp | 73 const SkPoint& p1, 79 (SkPointPriv::DistanceToLineSegmentBetweenSqd(p1, p0, p2)) < tolSqd) { 86 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, 87 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, 129 const SkPoint& p1, 136 (SkPointPriv::DistanceToLineSegmentBetweenSqd(p1, p0, p3) < tolSqd && 143 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1 72 generateQuadraticPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument 128 generateCubicPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument [all...] |
/external/skia/src/gpu/ccpr/ |
H A D | GrCCGeometry.cpp | 60 static inline bool are_collinear(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2) { argument 64 Sk2f a = (p0 - p1) * SkNx_shuffle<1,0>(p1 - p2); 68 Sk2f bbox0 = Sk2f::Min(Sk2f::Min(p0, p1), p2); 69 Sk2f bbox1 = Sk2f::Max(Sk2f::Max(p0, p1), p2); 98 Sk2f p1 = Sk2f::Load(&devP0); local 102 this->appendMonotonicQuadratics(p0, p1, p2); 105 inline void GrCCGeometry::appendMonotonicQuadratics(const Sk2f& p0, const Sk2f& p1, argument 107 Sk2f tan0 = p1 - p0; 108 Sk2f tan1 = p2 - p1; 144 appendSingleMonotonicQuadratic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2) argument 276 is_cubic_nearly_quadratic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, Sk2f& tan0, Sk2f& tan3, Sk2f& c) argument 295 Sk2f p1 = Sk2f::Load(&devP1); local 461 chopCubicAtMidTangent(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, const Sk2f& tan0, const Sk2f& tan3, int maxFutureSubdivisions) argument 486 chopCubic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, float T, int maxFutureSubdivisions) argument 509 appendMonotonicCubics(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, int maxSubdivisions) argument 545 appendCubicApproximation(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, int maxSubdivisions) argument [all...] |
/external/skia/src/pdf/ |
H A D | SkPDFGradientShader.cpp | 341 // p0 p1 p2 344 const SkScalar p1 = inversePerspectiveMatrix[SkMatrix::kMPersp1]; local 347 // y = y / (p2 + p0 x + p1 y) 348 // x = x / (p2 + p0 x + p1 y) 352 SkPDFUtils::AppendScalar(p1, code); // x y y p1 353 code->writeText(" mul " // x y y*p1 354 " 2 index "); // x y y*p1 x 355 SkPDFUtils::AppendScalar(p0, code); // x y y p1 x p0 356 code->writeText(" mul "); // x y y*p1 529 FixUpRadius(const SkPoint& p1, SkScalar& r1, const SkPoint& p2, SkScalar& r2) argument 562 const SkScalar p1 = in[SkMatrix::kMPersp1]; local [all...] |
/external/skia/tests/ |
H A D | Matrix44Test.cpp | 604 static bool is_rectilinear (SkVector4& p1, SkVector4& p2, SkVector4& p3, SkVector4& p4) { argument 605 return (SkScalarNearlyEqual(p1.fData[0], p2.fData[0]) && 608 SkScalarNearlyEqual(p4.fData[1], p1.fData[1])) || 609 (SkScalarNearlyEqual(p1.fData[1], p2.fData[1]) && 612 SkScalarNearlyEqual(p4.fData[0], p1.fData[0])); 629 SkVector4 p1(5.0f, 5.0f, 0.0f); 634 REPORTER_ASSERT(reporter, is_rectilinear(p1, p2, p3, p4)); 636 p1 = mul_with_persp_divide(transform, p1); 641 return is_rectilinear(p1, p [all...] |
/external/skqp/include/core/ |
H A D | SkCanvas.h | 1192 /** Draws line segment from p0 to p1 using clip, SkMatrix, and SkPaint paint. 1198 @param p1 end of line segment 1201 void drawLine(SkPoint p0, SkPoint p1, const SkPaint& paint) { argument 1202 this->drawLine(p0.x(), p0.y(), p1.x(), p1.y(), paint);
|
H A D | SkPath.h | 415 exact changes the equality test. If true, returns true only if p1 equals p2. 416 If false, returns true if p1 equals or nearly equals p2. 418 @param p1 line start point 423 static bool IsLineDegenerate(const SkPoint& p1, const SkPoint& p2, bool exact); 429 @param p1 quad start point 432 @param exact if true, returns true only if p1, p2, and p3 are equal; 433 if false, returns true if p1, p2, and p3 are equal or nearly equal 436 static bool IsQuadDegenerate(const SkPoint& p1, const SkPoint& p2, 443 @param p1 cubic start point 447 @param exact if true, returns true only if p1, p 670 quadTo(const SkPoint& p1, const SkPoint& p2) argument 735 conicTo(const SkPoint& p1, const SkPoint& p2, SkScalar w) argument 796 cubicTo(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) argument 869 arcTo(const SkPoint p1, const SkPoint p2, SkScalar radius) argument [all...] |
/external/skqp/src/core/ |
H A D | SkGeometry.cpp | 148 Sk2s p1 = from_point(src[1]); local 152 Sk2s p01 = interp(p0, p1, tt); 153 Sk2s p12 = interp(p1, p2, tt); 362 Sk2s p1 = from_point(src[1]); 367 Sk2s ab = interp(p0, p1, tt); 368 Sk2s bc = interp(p1, p2, tt); 537 // Calcs p0 . (p1 x p2) 538 static double calc_dot_cross_cubic(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2) { 539 const double xComp = (double) p0.fX * ((double) p1.fY - (double) p2.fY); 540 const double yComp = (double) p0.fY * ((double) p2.fX - (double) p1 1088 Sk2s p1 = from_point(fPts[1]); local 1122 Sk2s p1 = from_point(fPts[1]); local [all...] |
/external/skqp/src/gpu/ |
H A D | GrPathUtils.cpp | 73 const SkPoint& p1, 79 (SkPointPriv::DistanceToLineSegmentBetweenSqd(p1, p0, p2)) < tolSqd) { 86 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, 87 { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, 129 const SkPoint& p1, 136 (SkPointPriv::DistanceToLineSegmentBetweenSqd(p1, p0, p3) < tolSqd && 143 { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1 72 generateQuadraticPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument 128 generateCubicPoints(const SkPoint& p0, const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, SkScalar tolSqd, SkPoint** points, uint32_t pointsLeft) argument [all...] |
/external/skqp/src/gpu/ccpr/ |
H A D | GrCCGeometry.cpp | 60 static inline bool are_collinear(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2) { argument 64 Sk2f a = (p0 - p1) * SkNx_shuffle<1,0>(p1 - p2); 68 Sk2f bbox0 = Sk2f::Min(Sk2f::Min(p0, p1), p2); 69 Sk2f bbox1 = Sk2f::Max(Sk2f::Max(p0, p1), p2); 98 Sk2f p1 = Sk2f::Load(&devP0); local 102 this->appendMonotonicQuadratics(p0, p1, p2); 105 inline void GrCCGeometry::appendMonotonicQuadratics(const Sk2f& p0, const Sk2f& p1, argument 107 Sk2f tan0 = p1 - p0; 108 Sk2f tan1 = p2 - p1; 144 appendSingleMonotonicQuadratic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2) argument 276 is_cubic_nearly_quadratic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, Sk2f& tan0, Sk2f& tan3, Sk2f& c) argument 295 Sk2f p1 = Sk2f::Load(&devP1); local 461 chopCubicAtMidTangent(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, const Sk2f& tan0, const Sk2f& tan3, int maxFutureSubdivisions) argument 486 chopCubic(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, float T, int maxFutureSubdivisions) argument 509 appendMonotonicCubics(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, int maxSubdivisions) argument 545 appendCubicApproximation(const Sk2f& p0, const Sk2f& p1, const Sk2f& p2, const Sk2f& p3, int maxSubdivisions) argument [all...] |
/external/skqp/src/pdf/ |
H A D | SkPDFGradientShader.cpp | 341 // p0 p1 p2 344 const SkScalar p1 = inversePerspectiveMatrix[SkMatrix::kMPersp1]; local 347 // y = y / (p2 + p0 x + p1 y) 348 // x = x / (p2 + p0 x + p1 y) 352 SkPDFUtils::AppendScalar(p1, code); // x y y p1 353 code->writeText(" mul " // x y y*p1 354 " 2 index "); // x y y*p1 x 355 SkPDFUtils::AppendScalar(p0, code); // x y y p1 x p0 356 code->writeText(" mul "); // x y y*p1 529 FixUpRadius(const SkPoint& p1, SkScalar& r1, const SkPoint& p2, SkScalar& r2) argument 562 const SkScalar p1 = in[SkMatrix::kMPersp1]; local [all...] |
/external/skqp/tests/ |
H A D | Matrix44Test.cpp | 604 static bool is_rectilinear (SkVector4& p1, SkVector4& p2, SkVector4& p3, SkVector4& p4) { argument 605 return (SkScalarNearlyEqual(p1.fData[0], p2.fData[0]) && 608 SkScalarNearlyEqual(p4.fData[1], p1.fData[1])) || 609 (SkScalarNearlyEqual(p1.fData[1], p2.fData[1]) && 612 SkScalarNearlyEqual(p4.fData[0], p1.fData[0])); 629 SkVector4 p1(5.0f, 5.0f, 0.0f); 634 REPORTER_ASSERT(reporter, is_rectilinear(p1, p2, p3, p4)); 636 p1 = mul_with_persp_divide(transform, p1); 641 return is_rectilinear(p1, p [all...] |
/external/swiftshader/third_party/LLVM/test/Bindings/Ocaml/ |
H A D | vmcore.ml | 498 let p1 = param fn 0 in var 500 let v1 = build_add p1 p2 "v1" b in 501 let v2 = build_add p1 v1 "v2" b in 525 let p1 = param fn 0 in var 529 let i = build_add p1 p2 "sum" b in 532 insist ((operand i 0) = p1); 663 let p1 = param f 0 in var 665 set_value_name "One" p1; 667 add_param_attr p1 Attribute.Sext; 674 insist (Before p1 852 let p1 = param fn 0 ++ set_value_name "P1" in var 1161 let p1 = build_load g1 "X1" atentry in var [all...] |