Lines Matching defs:pts
45 // line uses one pt, quad uses 2 pts
253 inline void add_quad_segment(const SkPoint pts[3], SegmentArray* segments) {
254 if (SkPointPriv::DistanceToLineSegmentBetweenSqd(pts[1], pts[0], pts[2]) < kCloseSqd) {
255 if (pts[0] != pts[2]) {
256 add_line_to_segment(pts[2], segments);
261 segments->back().fPts[0] = pts[1];
262 segments->back().fPts[1] = pts[2];
266 inline void add_cubic_segments(const SkPoint pts[4],
270 GrPathUtils::convertCubicToQuadsConstrainToTangents(pts, SK_Scalar1, dir, &quads);
298 SkPoint pts[4];
299 SkPath::Verb verb = iter.next(pts);
302 m.mapPoints(pts, 1);
303 update_degenerate_test(°enerateData, pts[0]);
306 if (!SkPathPriv::AllPointsEq(pts, 2)) {
307 m.mapPoints(&pts[1], 1);
308 update_degenerate_test(°enerateData, pts[1]);
309 add_line_to_segment(pts[1], segments);
314 if (!SkPathPriv::AllPointsEq(pts, 3)) {
315 m.mapPoints(pts, 3);
316 update_degenerate_test(°enerateData, pts[1]);
317 update_degenerate_test(°enerateData, pts[2]);
318 add_quad_segment(pts, segments);
322 if (!SkPathPriv::AllPointsEq(pts, 3)) {
323 m.mapPoints(pts, 3);
326 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.25f);
336 if (!SkPathPriv::AllPointsEq(pts, 4)) {
337 m.mapPoints(pts, 4);
338 update_degenerate_test(°enerateData, pts[1]);
339 update_degenerate_test(°enerateData, pts[2]);
340 update_degenerate_test(°enerateData, pts[3]);
341 add_cubic_segments(pts, dir, segments);