Home
last modified time | relevance | path

Searched refs:ptCount (Results 1 – 14 of 14) sorted by relevance

/external/skia/tests/
DPathOpsThreeWayTest.cpp15 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()
/external/skia/src/utils/
DSkDashPath.cpp176 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength; in init() local
177 ptCount = SkTMin(ptCount, SkDashPath::kMaxDashCount); in init()
178 int n = SkScalarCeilToInt(ptCount) << 2; in init()
/external/skia/src/core/
DSkScan_Hairline.cpp426 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) { in extend_pts() argument
433 int controls = ptCount - 1; in extend_pts()
440 controls = ptCount - 1; // If all points are equal, move all but one in extend_pts()
448 } while (++controls < ptCount); in extend_pts()
451 SkPoint* last = &pts[ptCount - 1]; in extend_pts()
453 int controls = ptCount - 1; in extend_pts()
460 controls = ptCount - 1; in extend_pts()
468 } while (++controls < ptCount); in extend_pts()
DSkPathRef.cpp193 int ptCount = 0; in deduce_pts_conics() local
199 ptCount += 1; in deduce_pts_conics()
205 ptCount += 2; in deduce_pts_conics()
208 ptCount += 3; in deduce_pts_conics()
216 *ptCountPtr = ptCount; in deduce_pts_conics()
DSkDraw.h74 const uint16_t indices[], int ptCount,
DSkGlyphCache.h218 static void AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2],
DSkGeometry.cpp1193 const int ptCount = 2 * quadCount + 1; in chopIntoQuadsPOW2() local
1194 SkASSERT(endPts - pts == ptCount); in chopIntoQuadsPOW2()
1195 if (!SkPointsAreFinite(pts, ptCount)) { in chopIntoQuadsPOW2()
1198 for (int i = 1; i < ptCount - 1; ++i) { in chopIntoQuadsPOW2()
DSkGlyphCache.cpp252 void SkGlyphCache::AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2], in AddPoints() argument
254 for (int i = 0; i < ptCount; ++i) { in AddPoints()
DSkPath.cpp2551 int ptCount = 1; // moveTo in next() local
2559 ptCount += 1; in next()
2565 ptCount += 2; in next()
2568 ptCount += 3; in next()
2578 fCurrPtCount = ptCount; in next()
/external/skia/src/pathops/
DSkOpEdgeBuilder.cpp155 int ptCount = SkPathOpsVerbToPoints(verb); in preFetch() local
156 fPathPts.append(ptCount, &pts[1]); in preFetch()
160 curve[0] = pts[ptCount]; in preFetch()
DSkOpAngle.cpp410 int ptCount = SkPathOpsVerbToPoints(segment.verb()); in distEndRatio() local
412 for (int idx1 = 0; idx1 <= ptCount - 1; ++idx1) { in distEndRatio()
413 for (int idx2 = idx1 + 1; idx2 <= ptCount; ++idx2) { in distEndRatio()
504 int ptCount = index ? rPts : lPts; in endsIntersect() local
505 for (int idx2 = 0; idx2 <= ptCount; ++idx2) { in endsIntersect()
DSkPathOpsCubic.h81 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
DSkPathOpsCubic.cpp149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects() argument
181 for (int n = 0; n < ptCount; ++n) { in hullIntersects()
DSkPathOpsDebug.cpp631 int ptCount = SkPathOpsVerbToPoints(verb); in dump_curve() local
632 for (int index = 0; index <= ptCount; ++index) { in dump_curve()
634 if (index < ptCount - 1) { in dump_curve()