26         double origX = endPt[0]->fX;  in hullIntersects()
28         double adj = endPt[1]->fX - origX;  in hullIntersects()
30         double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;  in hullIntersects()
37             double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;  in hullIntersects()
151     double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY),  in isLinear()
152             fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);  in isLinear()
153     double largest = SkTMax(SkTMax(SkTMax(SkTMax(SkTMax(fPts[0].fX, fPts[0].fY),  in isLinear()
154             fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);  in isLinear()
163     SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,  in dxdyAtT()
165     if (result.fX == 0 && result.fY == 0) {  in dxdyAtT()
188     SkDPoint result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,  in ptAtT()
201     return between(fPts[0].fX, fPts[1].fX, fPts[2].fX);  in monotonicInX()
234     double ax = dst[0].fX = interp_quad_coords(&fPts[0].fX, t1);  in subDivide()
236     double dx = interp_quad_coords(&fPts[0].fX, (t1 + t2) / 2);  in subDivide()
238     double cx = dst[2].fX = interp_quad_coords(&fPts[0].fX, t2);  in subDivide()
240     /* bx = */ dst[1].fX = 2 * dx - (ax + cx) / 2;  in subDivide()
246     if (fPts[endIndex].fX == fPts[1].fX) {  in align()
247         dstPt->fX = fPts[endIndex].fX;  in align()
274     if (AlmostBequalUlps(b.fX, a.fX)) {  in subDivide()
275         b.fX = a.fX;  in subDivide()
276     } else if (AlmostBequalUlps(b.fX, c.fX)) {  in subDivide()
277         b.fX = c.fX;  in subDivide()
301     interp_quad_coords(&fPts[0].fX, &dst.pts[0].fX, t);  in chopAt()