Lines Matching defs:spanBase

249     SkOpSpanBase* spanBase = &fHead;
251 SkOpPtT* result = spanBase->ptT();
253 spanBase->bumpSpanAdds();
270 FAIL_WITH_NULL_IF(spanBase == &fTail);
271 } while ((spanBase = spanBase->upCast()->next()));
286 SkOpSpanBase* spanBase = fHead.next();
287 while (spanBase != &fTail) {
291 priorAngle->set(spanBase, prior);
292 spanBase->setFromAngle(priorAngle);
294 SkOpSpan* span = spanBase->upCast();
305 spanBase = next;
468 const SkOpSpanBase* spanBase = &fHead;
470 if (spanBase->ptT()->contains(this, newT)) {
473 if (spanBase == &fTail) {
476 spanBase = spanBase->upCast()->next();
1113 SkOpSpanBase* spanBase = &fHead;
1116 SkOpPtT* ptT = spanBase->ptT(), * spanStopPtT = ptT;
1117 SkOPASSERT(ptT->span() == spanBase);
1130 if (spanBase == &fHead) {
1136 SkOpSpan* span = spanBase->upCastable();
1142 if (spanBase->containsCoinEnd(opp)) {
1148 SkOpSpan* priorTest = spanBase->prev();
1171 SkOpPtT* oppEnd = spanBase->ptT();
1185 if (this->testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, opp)) {
1205 } while ((spanBase = spanBase->final() ? nullptr : spanBase->upCast()->next()));
1381 SkOpSpanBase* spanBase = &fHead;
1383 SkOpPtT* ptT = spanBase->ptT();
1387 if (ptT->segment() == this && !ptT->deleted() && test != spanBase
1390 if (spanBase == &fHead) {
1394 spanBase->upCast()->release(ptT);
1401 spanBase = spanBase->upCast()->next();
1402 } while (!spanBase->final());
1405 spanBase = &fHead;
1407 SkOpSpanBase* test = spanBase->upCast()->next();
1409 if (!this->spansNearby(spanBase, test, &found)) {
1414 if (spanBase->prev()) {
1415 test->merge(spanBase->upCast());
1421 spanBase->merge(test->upCast());
1424 spanBase = test;
1425 } while (!spanBase->final());
1601 const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const {
1603 double midT = (prior->t() + spanBase->t()) / 2;
1615 this->subDivide(prior, spanBase, &curvePart);