Searched refs:ptCount (Results 1 - 12 of 12) sorted by relevance
/third_party/skia/tests/ |
H A D | PathOpsThreeWayTest.cpp | 15 int ptCount; member 58 if (oTest.ptCount == 1 && iTest.ptCount == 1) { in testSetTest() 60 } else if (oTest.ptCount == 1 && iTest.ptCount == 4) { in testSetTest() 62 } else if (oTest.ptCount == 4 && iTest.ptCount == 1) { in testSetTest() 64 } else if (oTest.ptCount == 4 && iTest.ptCount == 4) { in testSetTest()
|
/third_party/skia/src/core/ |
H A D | SkScan_Hairline.cpp | 462 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) { 469 int controls = ptCount - 1; 476 controls = ptCount - 1; // If all points are equal, move all but one 484 } while (++controls < ptCount); 488 SkPoint* last = &pts[ptCount - 1]; 490 int controls = ptCount - 1; 497 controls = ptCount - 1; 505 } while (++controls < ptCount);
|
H A D | SkGlyph.cpp | 228 auto addPts = [&expandGap, &pts, topOffset, bottomOffset](int ptCount) { in calculate_path_gap() 229 for (int i = 0; i < ptCount; ++i) { in calculate_path_gap()
|
H A D | SkGeometry.cpp | 1499 const int ptCount = 2 * quadCount + 1; 1500 SkASSERT(endPts - pts == ptCount); 1501 if (!SkPointPriv::AreFinite(pts, ptCount)) { 1504 for (int i = 1; i < ptCount - 1; ++i) {
|
H A D | SkPath.cpp | 2408 int ptCount = 1; // moveTo in next() local 2416 ptCount += 1; in next() 2422 ptCount += 2; in next() 2425 ptCount += 3; in next() 2435 fCurrPtCount = ptCount; in next()
|
/third_party/skia/src/utils/ |
H A D | SkDashPath.cpp | 249 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength; 250 ptCount = std::min(ptCount, SkDashPath::kMaxDashCount); 251 if (SkScalarIsNaN(ptCount)) { 254 int n = SkScalarCeilToInt(ptCount) << 2;
|
/third_party/skia/src/gpu/geometry/ |
H A D | GrRect.h | 95 const SkPoint inPts[], SkPoint outPts[], int ptCount) { in GrMapRectPoints() 96 SkMatrix::RectToRect(inRect, outRect).mapPoints(outPts, inPts, ptCount); in GrMapRectPoints() 94 GrMapRectPoints(const SkRect& inRect, const SkRect& outRect, const SkPoint inPts[], SkPoint outPts[], int ptCount) GrMapRectPoints() argument
|
/third_party/skia/src/pathops/ |
H A D | SkOpEdgeBuilder.cpp | 149 int ptCount = SkPathOpsVerbToPoints(verb); in preFetch() local 150 fPathPts.append(ptCount, &curve[1]); in preFetch() 154 curve[0] = curve[ptCount]; in preFetch()
|
H A D | SkOpAngle.cpp | 487 int ptCount = SkPathOpsVerbToPoints(segment.verb()); in distEndRatio() local 489 for (int idx1 = 0; idx1 <= ptCount - 1; ++idx1) { in distEndRatio() 490 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio() 581 int ptCount = index ? rPts : lPts; in endsIntersect() local 582 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect()
|
H A D | SkPathOpsCubic.h | 82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
|
H A D | SkPathOpsCubic.cpp | 149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects() argument 181 for (int n = 0; n < ptCount; ++n) { in hullIntersects()
|
H A D | SkPathOpsDebug.cpp | 608 int ptCount = SkPathOpsVerbToPoints(verb); in dump_curve() local 609 for (int index = 0; index <= ptCount; ++index) { in dump_curve() 611 if (index < ptCount - 1) { in dump_curve()
|
Completed in 21 milliseconds