Home
last modified time | relevance | path

Searched refs:SkFindUnitQuadRoots (Results 1 – 14 of 14) sorted by relevance

/external/skia/src/core/
DSkQuadClipper.cpp35 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
DSkGeometry.cpp77 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots() function
441 return SkFindUnitQuadRoots(A, B, C, tValues); in SkFindCubicExtrema()
739 return SkFindUnitQuadRoots(Bx*Cy - By*Cx, in SkFindCubicInflections()
953 return SkFindUnitQuadRoots(coeff[1], coeff[2], coeff[3], tValues); in solve_cubic_poly()
1216 int roots = SkFindUnitQuadRoots(coeff[0], coeff[1], coeff[2], tValues); in conic_find_extrema()
DSkGeometry.h31 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
DSkEdgeClipper.cpp78 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
DSkPath.cpp2692 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in winding_mono_conic()
2767 int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, in winding_mono_quad()
2892 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in tangent_conic()
2913 int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, in tangent_quad()
DSkStroke.cpp980 return SkFindUnitQuadRoots(A, 2 * B, C, roots); in intersect_quad_ray()
/external/skqp/src/core/
DSkQuadClipper.cpp35 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
DSkGeometry.cpp74 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]) { in SkFindUnitQuadRoots() function
375 return SkFindUnitQuadRoots(A, B, C, tValues); in SkFindCubicExtrema()
536 return SkFindUnitQuadRoots(Bx*Cy - By*Cx, in SkFindCubicInflections()
750 return SkFindUnitQuadRoots(coeff[1], coeff[2], coeff[3], tValues); in solve_cubic_poly()
1013 int roots = SkFindUnitQuadRoots(coeff[0], coeff[1], coeff[2], tValues); in conic_find_extrema()
DSkGeometry.h31 int SkFindUnitQuadRoots(SkScalar A, SkScalar B, SkScalar C, SkScalar roots[2]);
DSkEdgeClipper.cpp78 int count = SkFindUnitQuadRoots(A, B, C, roots); in chopMonoQuadAt()
DSkPath.cpp3311 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in winding_mono_conic()
3386 int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, in winding_mono_quad()
3511 int n = SkFindUnitQuadRoots(A, 2 * B, C, roots); in tangent_conic()
3532 int n = SkFindUnitQuadRoots(pts[0].fY - 2 * pts[1].fY + pts[2].fY, in tangent_quad()
DSkStroke.cpp951 return SkFindUnitQuadRoots(A, 2 * B, C, roots); in intersect_quad_ray()
/external/skqp/samplecode/
DSamplePath.cpp466 int n = SkFindUnitQuadRoots(a, b, c, t);
593 return SkFindUnitQuadRoots(3 * A.cross(Z), 2 * B.cross(Z), C.cross(Z), ts); in find_max_deviation_cubic()
/external/skia/samplecode/
DSamplePath.cpp440 int n = SkFindUnitQuadRoots(a, b, c, t);
552 return SkFindUnitQuadRoots(3 * A.cross(Z), 2 * B.cross(Z), C.cross(Z), ts); in find_max_deviation_cubic()