97     int intersectRay(double roots[3]) {  in intersectRay()
106         int count = SkDCubic::RootsValidT(A, B, C, D, roots);  in intersectRay()
108             SkDPoint calcPt = c.ptAtT(roots[index]);  in intersectRay()
116                 count = c.searchRoots(extremeTs, extrema, 0, SkDCubic::kXAxis, roots);  in intersectRay()
129         int roots = intersectRay(rootVals);  in intersect()  local
130         for (int index = 0; index < roots; ++index) {  in intersect()
163     static int HorizontalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {  in HorizontalIntersect()
167         int count = SkDCubic::RootsValidT(A, B, C, D, roots);  in HorizontalIntersect()
169             SkDPoint calcPt = c.ptAtT(roots[index]);  in HorizontalIntersect()
173                 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kYAxis, roots);  in HorizontalIntersect()
185         double roots[3];  in horizontalIntersect()  local
186         int count = HorizontalIntersect(fCubic, axisIntercept, roots);  in horizontalIntersect()
188             double cubicT = roots[index];  in horizontalIntersect()
203     static int VerticalIntersect(const SkDCubic& c, double axisIntercept, double roots[3]) {  in VerticalIntersect()
207         int count = SkDCubic::RootsValidT(A, B, C, D, roots);  in VerticalIntersect()
209             SkDPoint calcPt = c.ptAtT(roots[index]);  in VerticalIntersect()
213                 count = c.searchRoots(extremeTs, extrema, axisIntercept, SkDCubic::kXAxis, roots);  in VerticalIntersect()
225         double roots[3];  in verticalIntersect()  local
226         int count = VerticalIntersect(fCubic, axisIntercept, roots);  in verticalIntersect()
228             double cubicT = roots[index];  in verticalIntersect()