Lines Matching defs:next
64 SkOpSpanBase* next = upSpan->next();
67 *endPtr = next;
71 return spanToAngle(start, next);
102 SkOpPtT* oPtT = start->ptT()->next();
215 const SkOpPtT* loop = testPtT->next();
220 loop = loop->next();
223 } while ((test = test->upCast()->next()));
277 } while ((spanBase = spanBase->upCast()->next()));
292 SkOpSpanBase* spanBase = fHead.next();
301 SkOpSpanBase* next = span->next();
304 angle->set(span, next);
309 spanBase = next;
321 } while ((span = span->next()->upCastable()));
339 } while (span->upCastable() && (span = span->upCast()->next()));
418 if (nullptr == firstAngle || nullptr == firstAngle->next()) {
425 // if two orderable angles are adjacent, and both are next to orderable angles,
431 SkOpAngle* next = angle->next();
432 firstAngle = next;
435 angle = next;
436 next = angle->next();
437 SkASSERT(prior->next() == angle);
438 SkASSERT(angle->next() == next);
439 if (prior->unorderable() || angle->unorderable() || next->unorderable()) {
453 } while (next != firstAngle);
464 SkASSERT(prior->next() == angle);
465 next = angle->next();
466 if (prior->unorderable() || angle->unorderable() || next->unorderable()) {
493 spanBase = spanBase->upCast()->next();
557 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
560 SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
594 SkOpAngle* nextAngle = angle->next();
630 } while ((nextAngle = nextAngle->next()) != angle);
663 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
666 SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
690 SkOpAngle* nextAngle = angle->next();
726 } while ((nextAngle = nextAngle->next()) != angle);
759 *nextEnd = step > 0 ? (*nextStart)->upCast()->next() : (*nextStart)->prev();
762 SkDEBUGCODE(SkOpSpanBase* endNear = step > 0 ? (*nextStart)->upCast()->next() \
778 SkOpAngle* nextAngle = angle->next();
796 nextAngle = nextAngle->next();
856 } while ((span = span->next()->upCastable()));
1075 SkOpSpanBase* endSpan = step > 0 ? origStart->upCast()->next() : origStart->prev();
1085 SkOpPtT* otherPtT = endSpan->ptT()->next();
1089 ? foundSpan->upCastable() ? foundSpan->upCast()->next() : nullptr
1096 const SkOpAngle* next = angle->next();
1097 if (nullptr == next) {
1101 if (angle->debugSign() != next->debugSign() && !angle->segment()->contour()->isXor()
1102 && !next->segment()->contour()->isXor()) {
1106 other = next->segment();
1107 foundSpan = endSpan = next->start();
1108 otherEnd = next->end();
1138 while ((ptT = ptT->next()) != stopPtT) {
1142 } while (!span->final() && (span = span->upCast()->next()));
1166 while ((ptT = ptT->next()) != spanStopPtT) {
1202 while ((priorPtT = priorPtT->next()) != priorStopPtT) {
1258 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next()));
1309 while ((oppNext = oppNext->final() ? nullptr : oppNext->upCast()->next())) {
1333 while ((oppPtT = oppPtT->next()) != oppStartPtT) {
1343 } while ((matchPtT = matchPtT->next()) != startPtT);
1354 } while (oppTest != oppLast && (oppTest = oppTest->upCast()->next()));
1355 } while ((testPtT = testPtT->next()) != startPtT);
1358 } while ((test = test->final() ? nullptr : test->upCast()->next()));
1377 dBugCheck = dBugCheck->next();
1379 dBugRef = dBugRef->next();
1395 ref = ref->next();
1408 check = check->next();
1423 } while ((check = check->next()) != checkHead);
1426 } while ((ref = ref->next()) != refHead);
1443 while ((ptT = ptT->next()) != headPtT) {
1462 spanBase = spanBase->upCast()->next();
1467 SkOpSpanBase* test = spanBase->upCast()->next();
1603 } while ((ptT = ptT->next()) != stopPtT);
1614 } while (!span->final() && (span = span->upCast()->next()));
1704 SkOpSpanBase* next;
1706 next = span->next();
1710 } while (!next->final() && (span = next->upCast()));