50     bounded->fNext = fBounded;  in addBounded()
59     SkTSpan* next = prior ? prior->fNext : fHead;  in addFollowing()
62     result->fNext = next;  in addFollowing()
64         prior->fNext = result;  in addFollowing()
118         testBounded = testBounded->fNext;  in closestBoundedT()
132     } while ((work = work->fNext));  in debugIsBefore()
143     } while ((work = work->fNext));  in contains()
159         bounded = bounded->fNext;  in findOppSpan()
214     fPrev = fNext = nullptr;  in init()
347         bounded = bounded->fNext;  in oppT()
358         bounded = bounded->fNext;  in removeAllBounded()
374             bounded = bounded->fNext;  in removeBounded()
385         SkTSpanBounded* boundedNext = bounded->fNext;  in removeBounded()
388                 prev->fNext = boundedNext;  in removeBounded()
415     fNext = work->fNext;  in splitAt()
419     work->fNext = this;  in splitAt()
420     if (fNext) {  in splitAt()
421         fNext->fPrev = this;  in splitAt()
428         bounded = bounded->fNext;  in splitAt()
433         bounded = bounded->fNext;  in splitAt()
441     SkASSERT(this != fNext);  in validate()
442     SkASSERT(fNext == nullptr || fNext != fPrev);  in validate()
443     SkASSERT(fNext == nullptr || this == fNext->fPrev);  in validate()
444     SkASSERT(fPrev == nullptr || this == fPrev->fNext);  in validate()
477         testBounded = testBounded->fNext;  in validateBounded()
489         testBounded = testBounded->fNext;  in validatePerpT()
522         fDeleted = result->fNext;  in addOne()
539     result->fPrev = result->fNext = nullptr;  in addOne()
620     while ((test = test->fNext)) {  in boundsMax()
643         next = last->fNext;  in coincidentCheck()
712         test = test->fNext;  in coincidentHasT()
767         work = work->fNext;  in computePerpendiculars()
777         SkTSpan* next = last->fNext;  in countConsecutiveSpans()
809         next = test->fNext;  in deleteEmptySpans()
922     last = first->fNext;  in extractCoincident()
971         work = work->fNext;  in findCoincidentRun()
989             if (!span->fBounded || !span->fBounded->fNext) {  in intersects()
999             if (!oppSpan->fBounded || !oppSpan->fBounded->fNext) {  in intersects()
1230     span->fNext = fDeleted;  in markSpanGone()
1271         } while ((test = test->fNext));  in mergeCoincidence()
1291         } while ((void) (prior = test), (test = test->fNext));  in mergeCoincidence()
1304                 largerPrior->fNext = larger->fNext;  in mergeCoincidence()
1307                 fCoincident = larger->fNext;  in mergeCoincidence()
1319         test = test->fNext;  in prev()
1328         SkTSpan* delNext = deleted->fNext;  in recoverCollapsed()
1332                 spanPtr = &(*spanPtr)->fNext;  in recoverCollapsed()
1334             deleted->fNext = *spanPtr;  in recoverCollapsed()
1346         const SkTSpanBounded* next = testBounded->fNext;  in removeAllBut()
1365         next = test->fNext;  in removeByPerpendicular()
1391         span->fNext = fCoincident;  in removeCoincident()
1423     SkTSpan* final = last->fNext;  in removeSpanRange()
1424     SkTSpan* next = span->fNext;  in removeSpanRange()
1426         next = span->fNext;  in removeSpanRange()
1432     first->fNext = final;  in removeSpanRange()
1442         SkTSpanBounded* next = bounded->fNext;  in removeSpans()
1463         test = test->fNext;  in spanAtT()
1473     while ((next = next->fNext)) {  in tail()
1493         const SkTSpanBounded* next = testBounded->fNext;  in trim()
1520     SkTSpan* next = span->fNext;  in unlinkSpan()
1522         prev->fNext = next;  in unlinkSpan()
1547     } while ((test = test->fNext) != final && test);  in updateBounded()
1567             next = span->fNext;  in validate()
1579         deleted = deleted->fNext;  in validate()
1584         coincident = coincident->fNext;  in validate()
1598     } 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()