Lines Matching refs:spanBase
255 SkOpSpanBase* spanBase = &fHead;
257 SkOpPtT* result = spanBase->ptT();
259 spanBase->bumpSpanAdds();
276 FAIL_WITH_NULL_IF(spanBase == &fTail);
277 } while ((spanBase = spanBase->upCast()->next()));
292 SkOpSpanBase* spanBase = fHead.next();
293 while (spanBase != &fTail) {
296 priorAngle->set(spanBase, prior);
297 spanBase->setFromAngle(priorAngle);
299 SkOpSpan* span = spanBase->upCast();
309 spanBase = next;
485 const SkOpSpanBase* spanBase = &fHead;
487 if (spanBase->ptT()->contains(this, newT)) {
490 if (spanBase == &fTail) {
493 spanBase = spanBase->upCast()->next();
1160 SkOpSpanBase* spanBase = &fHead;
1164 SkOpPtT* ptT = spanBase->ptT(), * spanStopPtT = ptT;
1165 SkOPASSERT(ptT->span() == spanBase);
1181 if (spanBase == &fHead) {
1187 SkOpSpan* span = spanBase->upCastable();
1193 if (spanBase->containsCoinEnd(opp)) {
1199 SkOpSpan* priorTest = spanBase->prev();
1222 SkOpPtT* oppEnd = spanBase->ptT();
1237 if (this->testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, opp)) {
1258 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next()));
1438 SkOpSpanBase* spanBase = &fHead;
1441 SkOpPtT* ptT = spanBase->ptT();
1448 if (ptT->segment() == this && !ptT->deleted() && test != spanBase
1451 if (spanBase == &fHead) {
1455 spanBase->upCast()->release(ptT);
1462 spanBase = spanBase->upCast()->next();
1463 } while (!spanBase->final());
1465 spanBase = &fHead;
1467 SkOpSpanBase* test = spanBase->upCast()->next();
1469 if (!this->spansNearby(spanBase, test, &found)) {
1474 if (spanBase->prev()) {
1475 test->merge(spanBase->upCast());
1481 spanBase->merge(test->upCast());
1484 spanBase = test;
1485 } while (!spanBase->final());
1666 const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const {
1668 double midT = (prior->t() + spanBase->t()) / 2;
1680 this->subDivide(prior, spanBase, &curvePart);