437         double endDist = test->fPart[OppCurve::kPointLast].distanceSquared(pt);  in closestBoundedT()
580     SkDVector len = fPart[TCurve::kPointLast] - fPart[0];  in linearT()
589     int start = 0, end = TCurve::kPointLast;  // the outside points are usually the extremes  in linearIntersects()
638     } else if (opp->fPart[0] == fPart[TCurve::kPointLast]) {  in onlyEndPointsInCommon()
641     } else if (opp->fPart[OppCurve::kPointLast] == fPart[0]) {  in onlyEndPointsInCommon()
644     } else if (opp->fPart[OppCurve::kPointLast] == fPart[TCurve::kPointLast]) {  in onlyEndPointsInCommon()
652     int baseIndex = *start ? 0 : TCurve::kPointLast;  in onlyEndPointsInCommon()
654     opp->fPart.otherPts(*oppStart ? 0 : OppCurve::kPointLast, oppOtherPts);  in onlyEndPointsInCommon()
919     } else if (last.approximatelyEqual(fCurve[TCurve::kPointLast])) {  in binarySearchCoin()
924     } else if (oppPt.approximatelyEqual(opp[OppCurve::kPointLast])) {  in binarySearchCoin()
988     first->fCoinEnd.setPerp(fCurve, start1e, fCurve[TCurve::kPointLast], sect2->fCurve);  in coincidentForce()
1052             work->fCoinEnd.setPerp(fCurve, work->fEndT, work->fPart[TCurve::kPointLast], opp);  in computePerpendiculars()
1187     first->fCoinEnd.setPerp(fCurve, first->fEndT, first->fPart[TCurve::kPointLast], sect2->fCurve);  in extractCoincident()
1338     SkDLine thisLine = {{ span->fPart[0], span->fPart[TCurve::kPointLast] }};  in linesIntersect()
1339     SkDLine oppLine = {{ oppSpan->fPart[0], oppSpan->fPart[OppCurve::kPointLast] }};  in linesIntersect()
1424     oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->fPart[OppCurve::kPointLast], fCurve);  in linesIntersect()
1442         perpS = oCoinE.perpPt() - oppSpan->fPart[OppCurve::kPointLast];  in linesIntersect()
1448         coinE.setPerp(fCurve, span->fEndT, span->fPart[TCurve::kPointLast], opp->fCurve);  in linesIntersect()
1449         perpE = span->fPart[TCurve::kPointLast] - coinE.perpPt();  in linesIntersect()
1453         perpE = oCoinE.perpPt() - oppSpan->fPart[OppCurve::kPointLast];  in linesIntersect()
1636         SkDVector endV = test->fCoinEnd.perpPt() - test->fPart[TCurve::kPointLast];  in removeByPerpendicular()
1848     if (sect1->fCurve[0] == sect2->fCurve[OppCurve::kPointLast]) {  in EndsEqual()
1852     if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[0]) {  in EndsEqual()
1854         intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]);  in EndsEqual()
1856     if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[OppCurve::kPointLast]) {  in EndsEqual()
1858             intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]);  in EndsEqual()
1867             && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[OppCurve::kPointLast])) {  in EndsEqual()
1869         intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]);  in EndsEqual()
1873             && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[0])) {  in EndsEqual()
1875         intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]);  in EndsEqual()
1878             && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[  in EndsEqual()
1879             OppCurve::kPointLast])) {  in EndsEqual()
1881         intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast],  in EndsEqual()
1882                 sect2->fCurve[OppCurve::kPointLast]);  in EndsEqual()
1976         record->findEnd(span1, span2, 0, OppCurve::kPointLast);  in find()
1977         record->findEnd(span1, span2, TCurve::kPointLast, 0);  in find()
1978         record->findEnd(span1, span2, TCurve::kPointLast, OppCurve::kPointLast);  in find()
2146                     coincident->fPart[TCurve::kPointLast]) < 0) && index >= 0) {  in BinarySearch()
2181         const SkDPoint& end1 = sect1->fCurve[TCurve::kPointLast];  in BinarySearch()
2191         const SkDPoint& end2 = sect2->fCurve[OppCurve::kPointLast];  in BinarySearch()