138     int intersectRay(double roots[2]) {  in intersectRay()
140         solve by rotating line+quad so line is horizontal, then finding the roots  in intersectRay()
165         return SkDQuad::RootsValidT(A, 2 * B, C, roots);  in intersectRay()
174         int roots = intersectRay(rootVals);  in intersect()  local
175         for (int index = 0; index < roots; ++index) {  in intersect()
187     int horizontalIntersect(double axisIntercept, double roots[2]) {  in horizontalIntersect()
194         return SkDQuad::RootsValidT(D, 2 * E, F, roots);  in horizontalIntersect()
203         int roots = horizontalIntersect(axisIntercept, rootVals);  in horizontalIntersect()  local
204         for (int index = 0; index < roots; ++index) {  in horizontalIntersect()
243     int verticalIntersect(double axisIntercept, double roots[2]) {  in verticalIntersect()
250         return SkDQuad::RootsValidT(D, 2 * E, F, roots);  in verticalIntersect()
259         int roots = verticalIntersect(axisIntercept, rootVals);  in verticalIntersect()  local
260         for (int index = 0; index < roots; ++index) {  in verticalIntersect()
436 int SkIntersections::HorizontalIntercept(const SkDQuad& quad, SkScalar y, double* roots) {  in HorizontalIntercept()  argument
438     return q.horizontalIntersect(y, roots);  in HorizontalIntercept()
441 int SkIntersections::VerticalIntercept(const SkDQuad& quad, SkScalar x, double* roots) {  in VerticalIntercept()  argument
443     return q.verticalIntersect(x, roots);  in VerticalIntercept()
448 int SkDQuad::horizontalIntersect(double yIntercept, double roots[2]) const {  in horizontalIntersect()
449     return SkIntersections::HorizontalIntercept(*this, yIntercept, roots);  in horizontalIntersect()
452 int SkDQuad::verticalIntersect(double xIntercept, double roots[2]) const {  in verticalIntersect()
453     return SkIntersections::VerticalIntercept(*this, xIntercept, roots);  in verticalIntersect()