Lines Matching refs:points
66 uint32_t GrPathUtils::quadraticPointCount(const SkPoint points[], SkScalar tol) {
68 tolerance_to_wangs_precision(tol), points));
75 SkPoint** points,
79 (*points)[0] = p2;
80 *points += 1;
91 uint32_t a = generateQuadraticPoints(p0, q[0], r, tolSqd, points, pointsLeft);
92 uint32_t b = generateQuadraticPoints(r, q[1], p2, tolSqd, points, pointsLeft);
96 uint32_t GrPathUtils::cubicPointCount(const SkPoint points[], SkScalar tol) {
98 tolerance_to_wangs_precision(tol), points));
106 SkPoint** points,
111 (*points)[0] = p3;
112 *points += 1;
126 uint32_t a = generateCubicPoints(p0, q[0], r[0], s, tolSqd, points, pointsLeft);
127 uint32_t b = generateCubicPoints(s, r[1], q[2], p3, tolSqd, points, pointsLeft);
411 // control points are very close to the baseline vector. If so then we just pick quadratic
412 // points on the control polygon.
438 // Insert two quadratics to cover the case when ab points away from d and/or dc
439 // points away from a.
622 // convex-180 if any points are colocated, and T[0] will equal NaN which returns 0 chops.
648 // lines. Find cusps by searching instead for points where the tangent is perpendicular to