Lines Matching refs:pts
49 SkPoint pts[2] = { pt0, pt1 };
55 if (!SkLineClipper::IntersectLine(pts, r, pts)) {
60 SkFDot6 x0 = SkScalarToFDot6(pts[0].fX);
61 SkFDot6 y0 = SkScalarToFDot6(pts[0].fY);
62 SkFDot6 x1 = SkScalarToFDot6(pts[1].fX);
63 SkFDot6 y1 = SkScalarToFDot6(pts[1].fY);
174 static bool quad_too_curvy(const SkPoint pts[3])
179 static int compute_int_quad_dist(const SkPoint pts[3]) {
182 SkScalar dx = SkScalarHalf(pts[0].fX + pts[2].fX) - pts[1].fX;
183 SkScalar dy = SkScalarHalf(pts[0].fY + pts[2].fY) - pts[1].fY;
198 static void hairquad(const SkPoint pts[3], const SkRegion* clip, SkBlitter* blitter, int level,
202 if (level > 0 && quad_too_curvy(pts))
206 SkChopQuadAtHalf(pts, tmp);
211 lineproc(pts[0], pts[2], clip, blitter);
216 SkPoint prevPt = pts[0];
219 SkEvalQuadAt(pts, t, &nextPt);
225 lineproc(prevPt, pts[2], clip, blitter);
229 static bool cubic_too_curvy(const SkPoint pts[4])
234 static void haircubic(const SkPoint pts[4], const SkRegion* clip, SkBlitter* blitter, int level,
237 if (level > 0 && cubic_too_curvy(pts))
241 SkChopCubicAt(pts, tmp, SK_Scalar1/2);
246 lineproc(pts[0], pts[3], clip, blitter);
276 SkPoint pts[4];
279 while ((verb = iter.next(pts)) != SkPath::kDone_Verb)
283 lineproc(pts[0], pts[1], clip, blitter);
286 int d = compute_int_quad_dist(pts);
298 hairquad(pts, clip, blitter, level, lineproc);
302 haircubic(pts, clip, blitter, kMaxCubicSubdivideLevel, lineproc);
