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