113         double endDist = test->pointLast().distanceSquared(pt);  in closestBoundedT()
253     SkDVector len = this->pointLast() - this->pointFirst();  in linearT()
261     int start = 0, end = fPart->pointLast();  // the outside points are usually the extremes  in linearIntersects()
309     } else if (opp->pointFirst() == this->pointLast()) {  in onlyEndPointsInCommon()
312     } else if (opp->pointLast() == this->pointFirst()) {  in onlyEndPointsInCommon()
315     } else if (opp->pointLast() == this->pointLast()) {  in onlyEndPointsInCommon()
324     int baseIndex = *start ? 0 : fPart->pointLast();  in onlyEndPointsInCommon()
326     opp->fPart->otherPts(*oppStart ? 0 : opp->fPart->pointLast(), oppOtherPts);  in onlyEndPointsInCommon()
599     } else if (last.approximatelyEqual(this->pointLast())) {  in binarySearchCoin()
604     } else if (oppPt.approximatelyEqual(sect2->pointLast())) {  in binarySearchCoin()
687     first->fCoinEnd.setPerp(fCurve, start1e, this->pointLast(), sect2->fCurve);  in coincidentForce()
752             work->fCoinEnd.setPerp(fCurve, work->fEndT, work->pointLast(), opp);  in computePerpendiculars()
908     first->fCoinEnd.setPerp(fCurve, first->fEndT, first->pointLast(), sect2->fCurve);  in extractCoincident()
1072     SkDLine thisLine = {{ span->pointFirst(), span->pointLast() }};  in linesIntersect()
1073     SkDLine oppLine = {{ oppSpan->pointFirst(), oppSpan->pointLast() }};  in linesIntersect()
1158     oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->pointLast(), fCurve);  in linesIntersect()
1177         perpS = oCoinE.perpPt() - oppSpan->pointLast();  in linesIntersect()
1183         coinE.setPerp(fCurve, span->fEndT, span->pointLast(), opp->fCurve);  in linesIntersect()
1184         perpE = span->pointLast() - coinE.perpPt();  in linesIntersect()
1188         perpE = oCoinE.perpPt() - oppSpan->pointLast();  in linesIntersect()
1370         SkDVector endV = test->fCoinEnd.perpPt() - test->pointLast();  in removeByPerpendicular()
1609     if (sect1->fCurve[0] == sect2->pointLast()) {  in EndsEqual()
1613     if (sect1->pointLast() == sect2->fCurve[0]) {  in EndsEqual()
1615         intersections->insert(1, 0, sect1->pointLast());  in EndsEqual()
1617     if (sect1->pointLast() == sect2->pointLast()) {  in EndsEqual()
1619             intersections->insert(1, 1, sect1->pointLast());  in EndsEqual()
1628             && sect1->fCurve[0].approximatelyEqual(sect2->pointLast())) {  in EndsEqual()
1630         intersections->insertNear(0, 1, sect1->fCurve[0], sect2->pointLast());  in EndsEqual()
1634             && sect1->pointLast().approximatelyEqual(sect2->fCurve[0])) {  in EndsEqual()
1636         intersections->insertNear(1, 0, sect1->pointLast(), sect2->fCurve[0]);  in EndsEqual()
1639             && sect1->pointLast().approximatelyEqual(sect2->pointLast())) {  in EndsEqual()
1641         intersections->insertNear(1, 1, sect1->pointLast(), sect2->pointLast());  in EndsEqual()
1734         record->findEnd(span1, span2, 0, span2->part().pointLast());  in find()
1735         record->findEnd(span1, span2, span1->part().pointLast(), 0);  in find()
1736         record->findEnd(span1, span2, span1->part().pointLast(), span2->part().pointLast());  in find()
1945                     coincident->pointLast()) < 0) && index >= 0) {  in BinarySearch()
1962             perp.setPerp(sect1->fCurve, 1, sect1->pointLast(), sect2->fCurve);  in BinarySearch()
1976             perp.setPerp(sect2->fCurve, 1, sect2->pointLast(), sect1->fCurve);  in BinarySearch()
2015             const SkDPoint& end1 = sect1->pointLast();  in BinarySearch()
2030             const SkDPoint& end2 = sect2->pointLast();  in BinarySearch()