Lines Matching refs:fNext
51 bounded->fNext = fBounded;
60 SkTSpan* next = prior ? prior->fNext : fHead;
63 result->fNext = next;
65 prior->fNext = result;
119 testBounded = testBounded->fNext;
133 } while ((work = work->fNext));
144 } while ((work = work->fNext));
160 bounded = bounded->fNext;
215 fPrev = fNext = nullptr;
348 bounded = bounded->fNext;
359 bounded = bounded->fNext;
375 bounded = bounded->fNext;
386 SkTSpanBounded* boundedNext = bounded->fNext;
389 prev->fNext = boundedNext;
416 fNext = work->fNext;
420 work->fNext = this;
421 if (fNext) {
422 fNext->fPrev = this;
429 bounded = bounded->fNext;
434 bounded = bounded->fNext;
442 SkASSERT(this != fNext);
443 SkASSERT(fNext == nullptr || fNext != fPrev);
444 SkASSERT(fNext == nullptr || this == fNext->fPrev);
445 SkASSERT(fPrev == nullptr || this == fPrev->fNext);
478 testBounded = testBounded->fNext;
490 testBounded = testBounded->fNext;
523 fDeleted = result->fNext;
540 result->fPrev = result->fNext = nullptr;
621 while ((test = test->fNext)) {
644 next = last->fNext;
713 test = test->fNext;
768 work = work->fNext;
778 SkTSpan* next = last->fNext;
810 next = test->fNext;
923 last = first->fNext;
972 work = work->fNext;
990 if (!span->fBounded || !span->fBounded->fNext) {
1000 if (!oppSpan->fBounded || !oppSpan->fBounded->fNext) {
1231 span->fNext = fDeleted;
1272 } while ((test = test->fNext));
1292 } while ((void) (prior = test), (test = test->fNext));
1305 largerPrior->fNext = larger->fNext;
1308 fCoincident = larger->fNext;
1320 test = test->fNext;
1329 SkTSpan* delNext = deleted->fNext;
1333 spanPtr = &(*spanPtr)->fNext;
1335 deleted->fNext = *spanPtr;
1347 const SkTSpanBounded* next = testBounded->fNext;
1366 next = test->fNext;
1392 span->fNext = fCoincident;
1424 SkTSpan* final = last->fNext;
1425 SkTSpan* next = span->fNext;
1427 next = span->fNext;
1433 first->fNext = final;
1443 SkTSpanBounded* next = bounded->fNext;
1464 test = test->fNext;
1474 while ((next = next->fNext)) {
1494 const SkTSpanBounded* next = testBounded->fNext;
1521 SkTSpan* next = span->fNext;
1523 prev->fNext = next;
1548 } while ((test = test->fNext) != final && test);
1568 next = span->fNext;
1580 deleted = deleted->fNext;
1585 coincident = coincident->fNext;
1599 } while ((span = span->fNext) != nullptr);
1922 if (coincident->fNext) {
1948 } while ((coincident = coincident->fNext));
2042 result1 = result1->fNext;
2050 result2 = result2->fNext;
2052 } while ((result1 = result1->fNext));