51     bounded->fNext = fBounded;  in addBounded()
60     SkTSpan* next = prior ? prior->fNext : fHead;  in addFollowing()
63     result->fNext = next;  in addFollowing()
65         prior->fNext = result;  in addFollowing()
119         testBounded = testBounded->fNext;  in closestBoundedT()
133     } while ((work = work->fNext));  in debugIsBefore()
144     } while ((work = work->fNext));  in contains()
160         bounded = bounded->fNext;  in findOppSpan()
215     fPrev = fNext = nullptr;  in init()
348         bounded = bounded->fNext;  in oppT()
359         bounded = bounded->fNext;  in removeAllBounded()
375             bounded = bounded->fNext;  in removeBounded()
386         SkTSpanBounded* boundedNext = bounded->fNext;  in removeBounded()
389                 prev->fNext = boundedNext;  in removeBounded()
416     fNext = work->fNext;  in splitAt()
420     work->fNext = this;  in splitAt()
421     if (fNext) {  in splitAt()
422         fNext->fPrev = this;  in splitAt()
429         bounded = bounded->fNext;  in splitAt()
434         bounded = bounded->fNext;  in splitAt()
442     SkASSERT(this != fNext);  in validate()
443     SkASSERT(fNext == nullptr || fNext != fPrev);  in validate()
444     SkASSERT(fNext == nullptr || this == fNext->fPrev);  in validate()
445     SkASSERT(fPrev == nullptr || this == fPrev->fNext);  in validate()
478         testBounded = testBounded->fNext;  in validateBounded()
490         testBounded = testBounded->fNext;  in validatePerpT()
523         fDeleted = result->fNext;  in addOne()
540     result->fPrev = result->fNext = nullptr;  in addOne()
621     while ((test = test->fNext)) {  in boundsMax()
644         next = last->fNext;  in coincidentCheck()
713         test = test->fNext;  in coincidentHasT()
768         work = work->fNext;  in computePerpendiculars()
778         SkTSpan* next = last->fNext;  in countConsecutiveSpans()
810         next = test->fNext;  in deleteEmptySpans()
923     last = first->fNext;  in extractCoincident()
972         work = work->fNext;  in findCoincidentRun()
990             if (!span->fBounded || !span->fBounded->fNext) {  in intersects()
1000             if (!oppSpan->fBounded || !oppSpan->fBounded->fNext) {  in intersects()
1231     span->fNext = fDeleted;  in markSpanGone()
1272         } while ((test = test->fNext));  in mergeCoincidence()
1292         } while ((void) (prior = test), (test = test->fNext));  in mergeCoincidence()
1305                 largerPrior->fNext = larger->fNext;  in mergeCoincidence()
1308                 fCoincident = larger->fNext;  in mergeCoincidence()
1320         test = test->fNext;  in prev()
1329         SkTSpan* delNext = deleted->fNext;  in recoverCollapsed()
1333                 spanPtr = &(*spanPtr)->fNext;  in recoverCollapsed()
1335             deleted->fNext = *spanPtr;  in recoverCollapsed()
1347         const SkTSpanBounded* next = testBounded->fNext;  in removeAllBut()
1366         next = test->fNext;  in removeByPerpendicular()
1392         span->fNext = fCoincident;  in removeCoincident()
1424     SkTSpan* final = last->fNext;  in removeSpanRange()
1425     SkTSpan* next = span->fNext;  in removeSpanRange()
1427         next = span->fNext;  in removeSpanRange()
1433     first->fNext = final;  in removeSpanRange()
1443         SkTSpanBounded* next = bounded->fNext;  in removeSpans()
1464         test = test->fNext;  in spanAtT()
1474     while ((next = next->fNext)) {  in tail()
1494         const SkTSpanBounded* next = testBounded->fNext;  in trim()
1521     SkTSpan* next = span->fNext;  in unlinkSpan()
1523         prev->fNext = next;  in unlinkSpan()
1548     } while ((test = test->fNext) != final && test);  in updateBounded()
1568             next = span->fNext;  in validate()
1580         deleted = deleted->fNext;  in validate()
1585         coincident = coincident->fNext;  in validate()
1599     } while ((span = span->fNext) != nullptr);  in validateBounded()
1922         if (coincident->fNext) {  in BinarySearch()
1948         } while ((coincident = coincident->fNext));  in BinarySearch()
2042             result1 = result1->fNext;  in BinarySearch()
2051             result2 = result2->fNext;  in BinarySearch()
2053     } while ((result1 = result1->fNext));  in BinarySearch()