59     result->fStartT = prior ? prior->fEndT : 0;  in addFollowing()
61     result->fEndT = next ? next->fStartT : 1;  in addFollowing()
117             result = test->fEndT;  in closestBoundedT()
141         if (between(work->fStartT, t, work->fEndT)) {  in contains()
217     fEndT = 1;  in init()
223     if (SkDoubleIsNaN(fStartT) || SkDoubleIsNaN(fEndT)) {  in initBounds()
226     c.subDivide(fStartT, fEndT, fPart);  in initBounds()
345         if (between(test->fStartT, t, test->fEndT)) {  in oppT()
372                 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);  in removeBounded()
373                 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);  in removeBounded()
405     fEndT = work->fEndT;  in splitAt()
406     if (fStartT == fEndT) {  in splitAt()
410     work->fEndT = t;  in splitAt()
411     if (work->fStartT == work->fEndT) {  in splitAt()
452     SkASSERT(fEndT <= 1);  in validate()
453     SkASSERT(fStartT <= fEndT);  in validate()
487         if (precisely_between(overlap->fStartT, oppT, overlap->fEndT)) {  in validatePerpT()
542     result->fStartT = result->fEndT = result->fBoundsMax = SK_ScalarNaN;  in addOne()
551     double result = work.fStartT = work.fEndT = tStart;  in binarySearchCoin()
685     first->fEndT = start1e;  in coincidentForce()
697     oppFirst->fEndT = oppEndT;  in coincidentForce()
710         if (between(test->fStartT, t, test->fEndT)) {  in coincidentHasT()
753             work->fCoinEnd.setPerp(fCurve, work->fEndT, work->pointLast(), opp);  in computePerpendiculars()
782         if (next->fStartT > last->fEndT) {  in countConsecutiveSpans()
844     if (prev && prev->fEndT == startT  in extractCoincident()
853         if (oppFirst->fStartT < oppStartT && oppStartT < oppFirst->fEndT) {  in extractCoincident()
869         SkDEBUGCODE(oppStartT = oppMatched ? oppFirst->fStartT : oppFirst->fEndT);  in extractCoincident()
875     SkDEBUGCODE(coinEnd = last->fEndT);  in extractCoincident()
878         oppEndT = oppMatched ? oppLast->fEndT : oppLast->fStartT;  in extractCoincident()
888     SkASSERT(coinEnd == last->fEndT);  in extractCoincident()
898     SkOPASSERT(oppEndT == oppLast->fEndT);  in extractCoincident()
906     first->fEndT = last->fEndT;  in extractCoincident()
909     first->fCoinEnd.setPerp(fCurve, first->fEndT, first->pointLast(), sect2->fCurve);  in extractCoincident()
918         oppFirst->fEndT = oppEndT;  in extractCoincident()
993                     span->fEndT = span->fStartT;  in intersects()
995                     span->fStartT = span->fEndT;  in intersects()
1005                     oppSpan->fEndT = oppSpan->fStartT;  in intersects()
1007                     oppSpan->fStartT = oppSpan->fEndT;  in intersects()
1028         span->fStartT = span->fEndT = i[0][0];  in intersects()
1030         oppSpan->fStartT = oppSpan->fEndT = i[1][0];  in intersects()
1112             if (!roughly_between(span->fStartT, oppRayI[0][index], span->fEndT)) {  in linesIntersect()
1116                 if (!roughly_between(oppSpan->fStartT, thisRayI[0][oIndex], oppSpan->fEndT)) {  in linesIntersect()
1132         if (between(span->fStartT, oppRayI[0][closeIndex], span->fEndT)  in linesIntersect()
1133                 && between(oppSpan->fStartT, thisRayI[0][oppCloseIndex], oppSpan->fEndT)  in linesIntersect()
1159     oCoinE.setPerp(opp->fCurve, oppSpan->fEndT, oppSpan->pointLast(), fCurve);  in linesIntersect()
1168     tEnd = std::min(tEnd, span->fEndT);  in linesIntersect()
1182     if (tEnd == span->fEndT) {  in linesIntersect()
1184         coinE.setPerp(fCurve, span->fEndT, span->pointLast(), opp->fCurve);  in linesIntersect()
1207         if (coinW.isMatch() ? !between(oppSpan->fStartT, perpT, oppSpan->fEndT) : perpT < 0) {  in linesIntersect()
1268             if (smaller && smaller->fEndT < test->fStartT) {  in mergeCoincidence()
1276         smallLimit = smaller->fEndT;  in mergeCoincidence()
1283             if (test->fStartT < smaller->fEndT) {  in mergeCoincidence()
1286             SkOPASSERT(test->fStartT != smaller->fEndT);  in mergeCoincidence()
1297         double midT = (smaller->fEndT + larger->fStartT) / 2;  in mergeCoincidence()
1302             smaller->fEndT = larger->fEndT;  in mergeCoincidence()
1332             while (*spanPtr && (*spanPtr)->fEndT <= deleted->fStartT) {  in recoverCollapsed()
1404     if (1 == span->fEndT) {  in removedEndCheck()
1462     while (test && test->fEndT < t) {  in spanAtT()
1478         if (next->fEndT > result->fEndT) {  in tail()
1526             if (next->fStartT > next->fEndT) {  in unlinkSpan()
1566             last = span->fEndT;  in validate()
1869                 start1e = sect1->tail()->fEndT;  in BinarySearch()
1943             if ((intersections->insertCoincident(coincident->fEndT,  in BinarySearch()
2014         if (approximately_greater_than_one(tail1->fEndT)) {  in BinarySearch()
2029         if (approximately_greater_than_one(tail2->fEndT)) {  in BinarySearch()