Lines Matching refs:points
52 * Path.bounds is defined to be the bounds of all the control points.
88 avoiding the need to revisit all of the points in getBounds().
128 Stores the verbs and points as they are given to us, with exceptions:
391 const SkPoint* pts = fPathRef->points();
421 The path contains fewer than four points.
430 Single points on the rectangle side.
454 const SkPoint* pts = fPathRef->points();
476 sk_careful_memcpy(dst, fPathRef->points(), count * sizeof(SkPoint));
867 // Return the unit vectors pointing at the start/stop points for the given start/sweep angles
941 // degenerate(rect) => radii points are collapsing
944 // degenerate(oval) => line points are collapsing
1015 const SkPoint* pts = fPathRef->points() + startPtIndex;
1328 Need to handle the case when the angle is sharp, and our computed end-points
1391 matrix.mapPoints(newPts, src->fPathRef->points(), src->countPoints());
1694 fPts = path.fPathRef->points();
1723 // verbs points one beyond the current verb, decrement first.
1738 // A special case: if both points are NaN, SkPoint::operation== returns
1954 SkPoint points[4];
1965 while ((verb = iter.next(points)) != kDone_Verb) {
1968 append_params(&descSk, "path.moveTo", &points[0], 1, kDec_SkScalarAsStringType);
1971 append_params(&descSk, "path.lineTo", &points[1], 1, kDec_SkScalarAsStringType);
1974 append_params(&descSk, "path.quadTo", &points[1], 2, kDec_SkScalarAsStringType);
1977 append_params(&descSk, "path.conicTo", &points[1], 2, kDec_SkScalarAsStringType, iter.conicWeight());
1980 append_params(&descSk, "path.cubicTo", &points[1], 3, kDec_SkScalarAsStringType);
2146 static SkPathConvexity BySign(const SkPoint points[], int count) {
2152 const SkPoint* last = points + count;
2153 SkPoint currPt = *points++;
2160 while (points != last) {
2161 SkVector vec = *points - currPt;
2177 currPt = *points++;
2182 points = &firstPt;
2293 const SkPoint* points = fPathRef->points();
2295 points += skipCount;
2300 SkPathConvexity convexity = Convexicator::BySign(points, pointCount);
2315 // Starting the actual contour, fall through to c=1 to add the points
2320 // Accumulating points into the Convexicator until we hit a close or another move
2388 fCurrPt = pathRef.points();
2493 * xmax of the contiguous points that have the same Y.
2596 // if we get a zero and the points are horizontal, then we look at the spread in
2693 if (x != pts[3].fX || y != pts[3].fY) { // don't test end points; they're start points
2771 if (x != pts[2].fX || y != pts[2].fY) { // don't test end points; they're start points
2795 // If the data points are very large, the conic may not be monotonic but may also
2852 if (x != pts[2].fX || y != pts[2].fY) { // don't test end points; they're start points
3074 // coincidence. Count coincidence as places where the on curve points have identical tangents.
3406 info.points += 1;
3411 info.points += 1;
3416 info.points += 2;
3421 info.points += 2;
3427 info.points += 3;
3451 if (!info.valid || info.points > pointCount || info.weights > wCount) {
3452 SkDEBUGFAIL("invalid verbs and number of points/weights");
3456 return SkPath(sk_sp<SkPathRef>(new SkPathRef(SkTDArray<SkPoint>(pts, info.points),
3645 const SkPoint* pts = path.fPathRef->points();
3859 // and just look at the raw points.
3861 const SkPoint* pts = path.fPathRef->points();