Lines Matching defs:next
60 SkTSpan* next = prior ? prior->fNext : fHead;
61 result->fEndT = next ? next->fStartT : 1;
63 result->fNext = next;
69 if (next) {
70 next->fPrev = result;
641 SkTSpan* last, * next;
644 next = last->fNext;
664 if (!next || next->fDeleted) {
667 } while ((first = next));
725 test = test->next();
778 SkTSpan* next = last->fNext;
779 if (!next) {
782 if (next->fStartT > last->fEndT) {
786 last = next;
801 } while ((test = test->next()));
807 SkTSpan* next = fHead;
809 while ((test = next)) {
810 next = test->fNext;
832 // march outwards to find limit of coincidence from here to previous and next spans
1277 // find next larger span
1347 const SkTSpanBounded* next = testBounded->fNext;
1355 testBounded = next;
1364 SkTSpan* next;
1366 next = test->fNext;
1382 } while ((test = next));
1425 SkTSpan* next = span->fNext;
1426 while ((span = next) && span != final) {
1427 next = span->fNext;
1443 SkTSpanBounded* next = bounded->fNext;
1453 bounded = next;
1472 SkTSpan* next = fHead;
1474 while ((next = next->fNext)) {
1478 if (next->fEndT > result->fEndT) {
1479 result = next;
1494 const SkTSpanBounded* next = testBounded->fNext;
1514 testBounded = next;
1521 SkTSpan* next = span->fNext;
1523 prev->fNext = next;
1524 if (next) {
1525 next->fPrev = prev;
1526 if (next->fStartT > next->fEndT) {
1530 next->validate();
1533 fHead = next;
1534 if (next) {
1535 next->fPrev = nullptr;
1544 const SkTSpan* final = last->next();
1562 const SkTSpan* next;
1568 next = span->fNext;
1569 SkASSERT(next != span);
1570 } while ((span = next) != nullptr);
1884 so the extension is discarded, only to be added again the next time around. */