Lines Matching defs:pts
576 memcpy(&fDebugWorstPts[index * 2 * 4], wt.pts(),
578 memcpy(&fDebugWorstPts[(index * 2 + 1) * 4], wn.pts(),
602 static void dump_curve(SkPath::Verb verb, const SkPoint& pts, float weight) {
610 SkDPoint::Dump((&pts)[index]);
700 void SkDQuad::debugSet(const SkDPoint* pts) {
701 memcpy(fPts, pts, sizeof(fPts));
705 void SkDCubic::debugSet(const SkDPoint* pts) {
706 memcpy(fPts, pts, sizeof(fPts));
710 void SkDConic::debugSet(const SkDPoint* pts, SkScalar weight) {
711 fPts.debugSet(pts);
1040 // Move nearby t values and pts so they all hang off the same span. Alignment happens later.
1139 const SkDPoint* pts = curvePart.fCubic.fPts;
1140 str->appendf(" (%1.9g,%1.9g", pts[0].fX, pts[0].fY);
1142 str->appendf(" %1.9g,%1.9g", pts[vIndex].fX, pts[vIndex].fY);
1486 (*CurveIntersectRay[testSeg->verb()])(testSeg->pts(), testSeg->weight(), ray, &i);
2231 // look for pts inside coincident spans that are not inside the opposite spans
2256 // look for pts inside coincident spans that are not inside the opposite spans
2830 static void output_points(const SkPoint* pts, int count) {
2832 output_scalar(pts[index].fX);
2834 output_scalar(pts[index].fY);
2842 for (auto [verb, pts, w] : SkPathPriv::Iterate(path)) {
2846 output_points(&pts[0], 1);
2851 output_points(&pts[1], 1);
2856 output_points(&pts[1], 2);
2861 output_points(&pts[1], 2);
2866 output_points(&pts[1], 3);