/external/skia/tests/ |
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()
|
/external/skqp/tests/ |
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()
|
/external/skqp/src/core/ |
D | SkScan_Hairline.cpp | 453 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) { in extend_pts() argument 460 int controls = ptCount - 1; in extend_pts() 467 controls = ptCount - 1; // If all points are equal, move all but one in extend_pts() 475 } while (++controls < ptCount); in extend_pts() 479 SkPoint* last = &pts[ptCount - 1]; in extend_pts() 481 int controls = ptCount - 1; in extend_pts() 488 controls = ptCount - 1; in extend_pts() 496 } while (++controls < ptCount); in extend_pts()
|
D | SkPathRef.cpp | 287 int ptCount = 0; in deduce_pts_conics() local 293 ptCount = safe.addInt(ptCount, 1); in deduce_pts_conics() 299 ptCount = safe.addInt(ptCount, 2); in deduce_pts_conics() 302 ptCount = safe.addInt(ptCount, 3); in deduce_pts_conics() 313 *ptCountPtr = ptCount; in deduce_pts_conics()
|
D | SkDraw.h | 69 const uint16_t indices[], int ptCount,
|
D | SkStrike.h | 192 static void AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2],
|
D | SkStrike.cpp | 275 void SkStrike::AddPoints(const SkPoint* pts, int ptCount, const SkScalar bounds[2], in AddPoints() argument 277 for (int i = 0; i < ptCount; ++i) { in AddPoints()
|
D | SkGeometry.cpp | 1300 const int ptCount = 2 * quadCount + 1; in chopIntoQuadsPOW2() local 1301 SkASSERT(endPts - pts == ptCount); in chopIntoQuadsPOW2() 1302 if (!SkPointPriv::AreFinite(pts, ptCount)) { in chopIntoQuadsPOW2() 1305 for (int i = 1; i < ptCount - 1; ++i) { in chopIntoQuadsPOW2()
|
D | SkPath.cpp | 2957 int ptCount = 1; // moveTo in next() local 2965 ptCount += 1; in next() 2971 ptCount += 2; in next() 2974 ptCount += 3; in next() 2984 fCurrPtCount = ptCount; in next()
|
/external/skia/src/core/ |
D | SkScan_Hairline.cpp | 462 void extend_pts(SkPath::Verb prevVerb, SkPath::Verb nextVerb, SkPoint* pts, int ptCount) { in extend_pts() argument 469 int controls = ptCount - 1; in extend_pts() 476 controls = ptCount - 1; // If all points are equal, move all but one in extend_pts() 484 } while (++controls < ptCount); in extend_pts() 488 SkPoint* last = &pts[ptCount - 1]; in extend_pts() 490 int controls = ptCount - 1; in extend_pts() 497 controls = ptCount - 1; in extend_pts() 505 } while (++controls < ptCount); in extend_pts()
|
D | SkGlyph.cpp | 230 auto addPts = [&expandGap, &pts, topOffset, bottomOffset](int ptCount) { in calculate_path_gap() argument 231 for (int i = 0; i < ptCount; ++i) { in calculate_path_gap()
|
D | SkGeometry.cpp | 1503 const int ptCount = 2 * quadCount + 1; in chopIntoQuadsPOW2() local 1504 SkASSERT(endPts - pts == ptCount); in chopIntoQuadsPOW2() 1505 if (!SkPointPriv::AreFinite(pts, ptCount)) { in chopIntoQuadsPOW2() 1508 for (int i = 1; i < ptCount - 1; ++i) { in chopIntoQuadsPOW2()
|
D | SkPath.cpp | 2342 int ptCount = 1; // moveTo in next() local 2350 ptCount += 1; in next() 2356 ptCount += 2; in next() 2359 ptCount += 3; in next() 2369 fCurrPtCount = ptCount; in next()
|
/external/skia/src/utils/ |
D | SkDashPath.cpp | 249 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength; in init() local 250 ptCount = std::min(ptCount, SkDashPath::kMaxDashCount); in init() 251 int n = SkScalarCeilToInt(ptCount) << 2; in init()
|
/external/skia/src/gpu/geometry/ |
D | GrRect.h | 95 const SkPoint inPts[], SkPoint outPts[], int ptCount) { in GrMapRectPoints() argument 96 SkMatrix::RectToRect(inRect, outRect).mapPoints(outPts, inPts, ptCount); in GrMapRectPoints()
|
/external/skqp/src/utils/ |
D | SkDashPath.cpp | 255 SkScalar ptCount = pathLength * intervalCount / (float)intervalLength; in init() local 256 ptCount = SkTMin(ptCount, SkDashPath::kMaxDashCount); in init() 257 int n = SkScalarCeilToInt(ptCount) << 2; in init()
|
/external/skqp/src/pathops/ |
D | SkOpEdgeBuilder.cpp | 155 int ptCount = SkPathOpsVerbToPoints(verb); in preFetch() local 156 fPathPts.append(ptCount, &pts[1]); in preFetch() 160 curve[0] = pts[ptCount]; in preFetch()
|
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()
|
D | SkPathOpsCubic.h | 82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
|
D | SkPathOpsCubic.cpp | 148 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const { in hullIntersects() argument 180 for (int n = 0; n < ptCount; ++n) { in hullIntersects()
|
/external/skia/src/pathops/ |
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()
|
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()
|
D | SkPathOpsCubic.h | 82 bool hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const;
|
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()
|
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()
|