Searched defs:spanBase (Results 1 - 2 of 2) sorted by relevance

/external/skia/src/pathops/
H A DSkOpSegment.cpp249 SkOpSpanBase* spanBase = &fHead; local
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(); local
287 while (spanBase != &fTail) {
291 priorAngle->set(spanBase, prior);
292 spanBase
468 const SkOpSpanBase* spanBase = &fHead; local
1113 SkOpSpanBase* spanBase = &fHead; local
1381 SkOpSpanBase* spanBase = &fHead; local
1600 testForCoincidence(const SkOpPtT* priorPtT, const SkOpPtT* ptT, const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const argument
[all...]
H A DSkPathOpsDebug.cpp867 const SkOpSpanBase* spanBase = &fHead; local
870 const SkOpPtT* ptT = spanBase->ptT(), * spanStopPtT = ptT;
871 SkASSERT(ptT->span() == spanBase);
884 if (spanBase == &fHead) {
890 const SkOpSpan* span = spanBase->upCastable();
896 if (spanBase->segment() != opp && spanBase->containsCoinEnd(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted
902 const SkOpSpan* priorTest = spanBase->prev();
925 const SkOpPtT* oppEnd = spanBase->ptT();
939 if (testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, op
1065 const SkOpSpanBase* spanBase = &fHead; local
[all...]

Completed in 82 milliseconds