71             lh.fSegment->t(lh.fStart), lh.fSegment->t(lh.fEnd),  in after()
73             fSegment->t(fEnd),  in after()
75             rh.fSegment->t(rh.fStart), rh.fSegment->t(rh.fEnd));  in after()
91             lh.fSegment->t(lh.fStart), lh.fSegment->t(lh.fEnd),  in after()
93             fSegment->t(fEnd),  in after()
95             rh.fSegment->t(rh.fStart), rh.fSegment->t(rh.fEnd));  in after()
183         int lineStart = fStart < fEnd ? 0 : 1;  in allOnOneSide()
296     int step = fStart < fEnd ? 1 : -1;  in computeSector()
298     int checkEnd = fEnd;  in computeSector()
320     if (checkEnd == fEnd || checkEnd - step == fEnd) {  in computeSector()
324     int saveEnd = fEnd;  in computeSector()
325     fComputedEnd = fEnd = checkEnd - step;  in computeSector()
328     fEnd = saveEnd;  in computeSector()
443             endPt.set(rh.fSegment->pts()[rh.fStart < rh.fEnd ? rPts : 0]);  in endsIntersect()
449             endPt.set(fSegment->pts()[fStart < fEnd ? lPts : 0]);  in endsIntersect()
720     double tEnd = tSegment->span(test.fEnd).fT;  in loopContains()
731         double lEnd = lSegment->span(loop->fEnd).fT;  in loopContains()
800     return (fSegment->t(fStart) + fSegment->t(fEnd)) / 2;  in midT()
852     int min = SkTMin(fStart, fEnd);  in overlap()
855     int oMin = SkTMin(other.fStart, other.fEnd);  in overlap()
864     return span.fSmall ? oSeg->containsPt(fSegment->span(fEnd).fPt, other.fEnd, other.fStart)  in overlap()
865             : fSegment->containsPt(oSeg->span(other.fEnd).fPt, fEnd, fStart);  in overlap()
884     fComputedEnd = fEnd = end;  in set()
982     fSegment->subDivide(fStart, fEnd, &fCurvePart);  in setSpans()
995         SkASSERT(fStart != fEnd);  in setSpans()
996         const SkPoint& cP1 = pts[fStart < fEnd];  in setSpans()
1018         double endT = fSegment->t(fEnd);  in setSpans()
1059     int min = SkMin32(fStart, fEnd);  in small()
1060     int max = SkMax32(fStart, fEnd);  in small()