Lines Matching defs:next
31 // sets the span's end to the ptT referenced by the previous-next
38 const SkOpPtT* testPtT = prev ? prev->next()->ptT()
39 : origSpan->upCast()->next()->prev()->ptT();
78 SkOpSpanBase* next = end->final() ? nullptr : end->upCast()->next();
79 if (next && next->deleted()) {
83 if (!next || !(oppPtT = next->contains(oppSegment))) {
86 double midT = (end->t() + next->t()) / 2;
90 setEnds(next->ptT(), oppPtT);
114 void SkCoincidentSpans::set(SkCoincidentSpans* next, const SkOpPtT* coinPtTStart,
117 fNext = next;
158 const SkOpSpanBase* next = start->upCast()->next();
159 if (next == end) {
167 const SkOpPtT* opp = next->contains(oppSeg);
177 if (next == end) {
180 if (!next->upCastable()) {
184 next = next->upCast()->next();
230 } while ((test = test->next()));
243 check = check->next();
286 while ((testPtT = testPtT->next()) != stopPtT) {
368 if (!this->addEndMovedSpans(base, base->next())) {
380 next door) and see if the A matching point is close enough to form another
424 } while ((span = span->next()));
451 const SkOpSpanBase* test = start->upCast()->next();
453 const SkOpSpanBase* oTest = coin->flipped() ? oStart->prev() : oStart->upCast()->next();
475 walk = walk->upCast()->next();
508 test = test->upCast()->next();
516 oTest = oTest->upCast()->next();
522 } while ((coin = coin->next()));
557 } while ((work = work->upCast()->next()));
613 } while ((check = check->next()));
817 while ((inner = inner->next())) {
888 } while ((outer = outer->next()));
958 } while ((coin = coin->next()));
1002 } while ((test = test->next()));
1014 } while ((coin = coin->next()));
1051 SkOpSpanBase* oNext = oStart->next();
1134 SkOpSpanBase* next = start->next();
1135 SkOpSpanBase* oNext = flipped ? oStart->prev() : oStart->next();
1136 if (next == end) {
1139 FAIL_IF(!next->upCastable());
1140 start = next->upCast();
1147 } while ((coin = coin->next()));
1155 SkCoincidentSpans* next;
1157 next = coin->next();
1160 prev->setNext(next);
1162 fHead = next;
1164 fTop = next;
1169 } while ((coin = next));
1179 SkCoincidentSpans* next;
1181 next = coin->next();
1186 prev->setNext(next);
1188 fHead = next;
1190 fTop = next;
1197 } while ((coin = next));
1217 *headPtr = test->next();
1246 } while ((test = test->next()));
1249 } while ((coin = coin->next()));
1261 while ((inner = inner->next())) {
1284 outer = outer->next();
1330 } while ((coin = coin->next()));
1364 SkOpSpanBase* next = start;
1368 while ((next = next->upCast()->next()) != end) {
1369 FAIL_IF(!next->upCastable());
1370 FAIL_IF(!next->upCast()->insertCoincidence(oSegment, flipped, ordered));
1372 while ((oNext = oNext->upCast()->next()) != oEnd) {
1376 } while ((coin = coin->next()));
1393 coin = coin->next();
1447 } while ((coin = coin->next()));