20 void SkDCubic::align(int endIndex, int ctrlIndex, SkDPoint* dstPt) const {  in align()
35     SkDPoint cubicAtT = ptAtT(t);  in binarySearch()
40         SkDPoint lessPt = ptAtT(priorT);  in binarySearch()
59             SkDPoint morePt = ptAtT(nextT);  in binarySearch()
70         SkDPoint testAtT = ptAtT(t);  in binarySearch()
149 bool SkDCubic::hullIntersects(const SkDPoint* pts, int ptCount, bool* isLinear) const {  in hullIntersects()
155     const SkDPoint* endPt[2];  in hullIntersects()
274                 SkDPoint pt = cubic.ptAtT(inflectionTs[index]);  in ComplexBreak()
281                 SkDPoint pt = cubic.ptAtT(maxCurvature[index]);  in ComplexBreak()
335 void SkDCubic::otherPts(int index, const SkDPoint* o1Pts[kPointCount - 1]) const {  in otherPts()
579 SkDPoint SkDCubic::ptAtT(double t) const {  in ptAtT()
593     SkDPoint result = {a * fPts[0].fX + b * fPts[1].fX + c * fPts[2].fX + d * fPts[3].fX,  in ptAtT()
684 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d,  in subDivide()
685                          double t1, double t2, SkDPoint dst[2]) const {  in subDivide()
723 double SkDCubic::top(const SkDCubic& dCurve, double startT, double endT, SkDPoint*topPt) const {  in top()
729         SkDPoint mid = dCurve.ptAtT(t);  in top()