Lines Matching full:roots
67 int horizontalIntersect(double axisIntercept, double roots[2]) { in horizontalIntersect()
69 return this->validT(conicVals, axisIntercept, roots); in horizontalIntersect()
77 double roots[2]; in horizontalIntersect() local
78 int count = this->horizontalIntersect(axisIntercept, roots); in horizontalIntersect()
80 double conicT = roots[index]; in horizontalIntersect()
103 int roots = this->intersectRay(rootVals); in intersect() local
104 for (int index = 0; index < roots; ++index) { in intersect()
125 int intersectRay(double roots[2]) { in intersectRay()
132 return this->validT(r, 0, roots); in intersectRay()
135 int validT(double r[3], double axisIntercept, double roots[2]) { in validT()
142 return SkDQuad::RootsValidT(A, 2 * B, C, roots); in validT()
145 int verticalIntersect(double axisIntercept, double roots[2]) { in verticalIntersect()
147 return this->validT(conicVals, axisIntercept, roots); in verticalIntersect()
155 double roots[2]; in verticalIntersect() local
156 int count = this->verticalIntersect(axisIntercept, roots); in verticalIntersect()
158 double conicT = roots[index]; in verticalIntersect()
376 int SkIntersections::HorizontalIntercept(const SkDConic& conic, SkScalar y, double* roots) { in HorizontalIntercept() argument
378 return c.horizontalIntersect(y, roots); in HorizontalIntercept()
381 int SkIntersections::VerticalIntercept(const SkDConic& conic, SkScalar x, double* roots) { in VerticalIntercept() argument
383 return c.verticalIntersect(x, roots); in VerticalIntercept()