52         double origX = endPt[0]->fX;  in hullIntersects()
54         double adj = endPt[1]->fX - origX;  in hullIntersects()
56         double sign = (fPts[oddMan].fY - origY) * adj - (fPts[oddMan].fX - origX) * opp;  in hullIntersects()
63             double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;  in hullIntersects()
191     double tiniest = std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0].fY),  in isLinear()
192             fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);  in isLinear()
193     double largest = std::max(std::max(std::max(std::max(std::max(fPts[0].fX, fPts[0].fY),  in isLinear()
194             fPts[1].fX), fPts[1].fY), fPts[2].fX), fPts[2].fY);  in isLinear()
203     SkDVector result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,  in dxdyAtT()
205     if (result.fX == 0 && result.fY == 0) {  in dxdyAtT()
228     SkDPoint result = { a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX,  in ptAtT()
247     return between(fPts[0].fX, fPts[1].fX, fPts[2].fX);  in monotonicInX()
283     double ax = dst[0].fX = interp_quad_coords(&fPts[0].fX, t1);  in subDivide()
285     double dx = interp_quad_coords(&fPts[0].fX, (t1 + t2) / 2);  in subDivide()
287     double cx = dst[2].fX = interp_quad_coords(&fPts[0].fX, t2);  in subDivide()
289     /* bx = */ dst[1].fX = 2 * dx - (ax + cx) / 2;  in subDivide()
295     if (fPts[endIndex].fX == fPts[1].fX) {  in align()
296         dstPt->fX = fPts[endIndex].fX;  in align()
323     if (AlmostBequalUlps(b.fX, a.fX)) {  in subDivide()
324         b.fX = a.fX;  in subDivide()
325     } else if (AlmostBequalUlps(b.fX, c.fX)) {  in subDivide()
326         b.fX = c.fX;  in subDivide()
350     interp_quad_coords(&fPts[0].fX, &dst.pts[0].fX, t);  in chopAt()