Lines Matching defs:next
261 } while ((contour = contour->next()));
271 } while ((contour = contour->next()));
279 } while ((contour = contour->next()));
291 // see if next coincident operation makes a change; if so, record it
335 } while ((contour = contour->next()));
361 } while ((contour = contour->next()));
749 } while ((span = span->upCast()->next()));
772 } while ((base = span->next()));
789 } while ((span = span->next()->upCastable()));
809 } while ((span = span->next()->upCastable()));
820 while ((ptT = ptT->next()) != stopPtT) {
824 } while (!span->final() && (span = span->upCast()->next()));
849 while ((ptT = ptT->next()) != spanStopPtT) {
882 while ((priorPtT = priorPtT->next()) != priorStopPtT) {
938 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next()));
985 while ((oppNext = oppNext->final() ? nullptr : oppNext->upCast()->next())) {
1009 while ((oppPtT = oppPtT->next()) != oppStartPtT) {
1019 } while ((matchPtT = matchPtT->next()) != startPtT);
1030 } while (oppTest != oppLast && (oppTest = oppTest->upCast()->next()));
1031 } while ((testPtT = testPtT->next()) != startPtT);
1034 } while ((test = test->final() ? nullptr : test->upCast()->next()));
1048 while ((ptT = ptT->next()) != headPtT) {
1064 spanBase = spanBase->upCast()->next();
1070 const SkOpSpanBase* test = spanBase->upCast()->next();
1138 this->subDivide(span, span->next(), &curvePart);
1147 str->appendf(") t=%1.9g tEnd=%1.9g", span->t(), span->next()->t());
1163 } while ((span = span->next()->upCastable()));
1176 span->t(), span->debugID(), pt.fX, pt.fY, span->next()->t());
1200 span->t(), span->debugID(), pt.fX, pt.fY, span->next()->t(), winding, oppWinding);
1246 const SkOpAngle* next = test;
1247 while ((next = next->fNext) != this) {
1248 SkOpSegment* nextSegment = next->segment();
1249 double testMidDistSq = testSegment->distSq(testMidT, next);
1250 double testEndDistSq = testSegment->distSq(testEndT, next);
1251 double nextStartT = next->start()->t();
1254 double nextEndT = next->end()->t();
1305 const SkOpAngle* next = this;
1307 next->dumpOne(true);
1309 next = next->fNext;
1310 } while (next && next != first);
1311 next = first;
1313 next->debugValidate();
1314 next = next->fNext;
1315 } while (next && next != first);
1327 const SkOpAngle* next = this;
1333 if (next->unorderable()) {
1336 const SkOpSpan* minSpan = next->start()->starter(next->end());
1340 bool op = next->segment()->operand();
1341 bool isXor = next->segment()->isXor();
1342 bool oppXor = next->segment()->oppXor();
1349 wind += next->debugSign() * (op ? minSpan->oppValue() : minSpan->windValue());
1356 opp += next->debugSign() * (op ? minSpan->windValue() : minSpan->oppValue());
1360 next = next->fNext;
1361 } while (next && next != first);
1370 const SkOpAngle* next = first;
1373 // SkASSERT_RELEASE(next->fSegment->debugContains(next));
1374 angles.push_back(next);
1375 next = next->next();
1376 if (next == first) {
1379 SkASSERT_RELEASE(!angles.contains(next));
1380 if (!next) {
1396 // sets the span's end to the ptT referenced by the previous-next
1403 const SkOpPtT* testPtT = prev ? prev->next()->ptT()
1404 : origSpan->upCast()->next()->prev()->ptT();
1444 SkOpSpanBase* next = end->final() ? nullptr : end->upCast()->next();
1445 if (next && next->deleted()) {
1449 if (!next || !(oppPtT = next->contains(oppSegment))) {
1452 double midT = (end->t() + next->t()) / 2;
1456 if (log) log->record(SkPathOpsDebug::kExpandCoin_Glitch, this, next->ptT(), oppPtT);
1467 while ((testPtT = testPtT->next()) != stopPtT) {
1548 if (this->debugAddEndMovedSpans(log, base, base->next()), false) {
1560 next door) and see if the A matching point is close enough to form another
1603 } while ((span = span->next()));
1630 const SkOpSpanBase* test = start->upCast()->next();
1632 const SkOpSpanBase* oTest = coin->flipped() ? oStart->prev() : oStart->upCast()->next();
1654 walk = walk->upCast()->next();
1687 test = test->upCast()->next();
1691 oTest = coin->flipped() ? oTest->prev() : oTest->upCast()->next();
1695 } while ((coin = coin->next()));
1887 while ((inner = inner->next())) {
1953 } while ((outer = outer->next()));
1962 const SkCoincidentSpans* next;
1964 next = coin->next();
1967 // prev->setNext(next);
1969 // fHead = next;
1971 // fTop = next;
1976 } while ((coin = next));
1992 } while ((coin = coin->next()));
2016 } while ((test = test->next()));
2019 } while ((coin = coin->next()));
2051 const SkOpSpanBase* next = start;
2055 while ((next = next->upCast()->next()) != end) {
2056 FAIL_IF(!next->upCastable(), coin);
2057 if (next->upCast()->debugInsertCoincidence(log, oSegment, flipped, ordered), false) {
2061 while ((oNext = oNext->upCast()->next()) != oEnd) {
2067 } while ((coin = coin->next()));
2086 coin = coin->next();
2109 span = span->next();
2115 static void DebugCheckBetween(const SkOpSpanBase* next, const SkOpSpanBase* end,
2118 SkASSERT(next != end);
2119 SkASSERT(!next->contains(end) || log);
2120 if (next->t() > end->t()) {
2122 swap(next, end);
2125 const SkOpPtT* ptT = next->ptT();
2130 ptT = ptT->next();
2131 const SkOpPtT* checkPtT = next->ptT();
2140 checkPtT = checkPtT->next();
2155 } while (next != end && (next = next->upCast()->next()));
2213 } while ((list = list->next()));
2222 const SkCoincidentSpans* next = test->next();
2223 DebugCheckOverlap(test, next, log);
2225 test = next;
2240 coin = coin->next();
2265 coin = coin->next();
2286 } while ((segment = segment->next()));
2303 } while ((coin = coin->next()));
2315 segment = segment->next();
2327 } while ((segment = segment->next()));
2336 } while ((segment = segment->next()));
2357 } while (!span->final() && (span = span->upCast()->next()));
2362 } while (!span->final() && (span = span->upCast()->next()));
2382 SkASSERT(!prev || prev->upCast()->next() == span);
2389 } while (!span->final() && (span = span->upCast()->next()));
2427 } while ((test = test->next()) != head);
2433 const SkOpSpanBase* next = this;
2436 nextCoin = next->fCoinEnd;
2450 } while ((next = nextCoin) && next != this);
2480 testNext = test->next();
2520 while ((debugInner = debugInner->next()) != innerStop) {
2533 } while ((inner = inner->next()) != innerStop);
2545 ptT = ptT->next();
2557 ptT = ptT->next();
2587 ptT = ptT->next();
2604 const SkOpSpan* next = this;
2607 nextCoin = next->fCoincident;
2621 } while ((next = nextCoin) && next != this);
2645 const SkOpPtT* next = &fPtT;
2646 while ((next = next->next()) != &fPtT) {
2647 if (next->segment() == segment) {
2649 const SkOpSpanBase* base = next->span();
2713 ptT = ptT->next();
2723 test = test->next();
2733 ptT = ptT->next();
2743 test = test->next();
2754 const SkOpPtT* next = this;
2776 } while ((next = next->fNext) && next != this);