Searched defs:srcPts (Results 1 - 10 of 10) sorted by relevance
/external/skia/src/core/ |
H A D | SkCubicClipper.cpp | 107 bool SkCubicClipper::clipCubic(const SkPoint srcPts[4], SkPoint dst[4]) { argument 111 if (srcPts[0].fY > srcPts[3].fY) { 112 dst[0] = srcPts[3]; 113 dst[1] = srcPts[2]; 114 dst[2] = srcPts[1]; 115 dst[3] = srcPts[0]; 118 memcpy(dst, srcPts, 4 * sizeof(SkPoint));
|
H A D | SkQuadClipper.cpp | 51 bool SkQuadClipper::clipQuad(const SkPoint srcPts[3], SkPoint dst[3]) { argument 55 if (srcPts[0].fY > srcPts[2].fY) { 56 dst[0] = srcPts[2]; 57 dst[1] = srcPts[1]; 58 dst[2] = srcPts[0]; 61 memcpy(dst, srcPts, 3 * sizeof(SkPoint));
|
H A D | SkEdgeClipper.cpp | 141 // srcPts[] must be monotonic in X and Y 142 void SkEdgeClipper::clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip) { argument 144 bool reverse = sort_increasing_Y(pts, srcPts, 3); 216 bool SkEdgeClipper::clipQuad(const SkPoint srcPts[3], const SkRect& clip) { argument 221 bounds.set(srcPts, 3); 225 int countY = SkChopQuadAtYExtrema(srcPts, monoY); 331 // srcPts[] must be monotonic in X and Y 411 bool SkEdgeClipper::clipCubic(const SkPoint srcPts[4], const SkRect& clip) { argument 415 const SkRect bounds = compute_cubic_bounds(srcPts); 425 return this->clipLine(srcPts[ [all...] |
H A D | SkPath.cpp | 1373 SkPoint srcPts[2]; local 1374 this->getLastPt(&srcPts[0]); 1384 srcPts[1].set(x, y); 1385 if (srcPts[0] == srcPts[1]) { 1391 SkVector midPointDistance = srcPts[0] - srcPts[1]; 1417 pointTransform.mapPoints(unitPts, srcPts, (int) SK_ARRAY_COUNT(unitPts)); 2034 const SkPoint* SK_RESTRICT srcPts = fPts; local 2050 fMoveTo = *srcPts; [all...] |
/external/skqp/src/core/ |
H A D | SkCubicClipper.cpp | 107 bool SkCubicClipper::clipCubic(const SkPoint srcPts[4], SkPoint dst[4]) { argument 111 if (srcPts[0].fY > srcPts[3].fY) { 112 dst[0] = srcPts[3]; 113 dst[1] = srcPts[2]; 114 dst[2] = srcPts[1]; 115 dst[3] = srcPts[0]; 118 memcpy(dst, srcPts, 4 * sizeof(SkPoint));
|
H A D | SkQuadClipper.cpp | 51 bool SkQuadClipper::clipQuad(const SkPoint srcPts[3], SkPoint dst[3]) { argument 55 if (srcPts[0].fY > srcPts[2].fY) { 56 dst[0] = srcPts[2]; 57 dst[1] = srcPts[1]; 58 dst[2] = srcPts[0]; 61 memcpy(dst, srcPts, 3 * sizeof(SkPoint));
|
H A D | SkEdgeClipper.cpp | 141 // srcPts[] must be monotonic in X and Y 142 void SkEdgeClipper::clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip) { argument 144 bool reverse = sort_increasing_Y(pts, srcPts, 3); 216 bool SkEdgeClipper::clipQuad(const SkPoint srcPts[3], const SkRect& clip) { argument 221 bounds.set(srcPts, 3); 225 int countY = SkChopQuadAtYExtrema(srcPts, monoY); 331 // srcPts[] must be monotonic in X and Y 411 bool SkEdgeClipper::clipCubic(const SkPoint srcPts[4], const SkRect& clip) { argument 415 const SkRect bounds = compute_cubic_bounds(srcPts); 425 return this->clipLine(srcPts[ [all...] |
H A D | SkPath.cpp | 1345 SkPoint srcPts[2]; local 1346 this->getLastPt(&srcPts[0]); 1356 srcPts[1].set(x, y); 1357 if (srcPts[0] == srcPts[1]) { 1363 SkVector midPointDistance = srcPts[0] - srcPts[1]; 1389 pointTransform.mapPoints(unitPts, srcPts, (int) SK_ARRAY_COUNT(unitPts)); 2006 const SkPoint* SK_RESTRICT srcPts = fPts; local 2022 fMoveTo = *srcPts; [all...] |
/external/skia/tests/ |
H A D | PathTest.cpp | 970 const SkPoint srcPts[], bool expectClose) { 980 REPORTER_ASSERT(reporter, pts[0] == srcPts[0]); 981 srcPts++; 986 REPORTER_ASSERT(reporter, pts[1] == srcPts[0]); 987 srcPts++; 969 test_poly(skiatest::Reporter* reporter, const SkPath& path, const SkPoint srcPts[], bool expectClose) argument
|
/external/skqp/tests/ |
H A D | PathTest.cpp | 970 const SkPoint srcPts[], bool expectClose) { 980 REPORTER_ASSERT(reporter, pts[0] == srcPts[0]); 981 srcPts++; 986 REPORTER_ASSERT(reporter, pts[1] == srcPts[0]); 987 srcPts++; 969 test_poly(skiatest::Reporter* reporter, const SkPath& path, const SkPoint srcPts[], bool expectClose) argument
|
Completed in 1351 milliseconds