Searched refs:spanBase (Results 1 - 6 of 6) sorted by relevance
/external/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 250 SkOpSpanBase* spanBase = &fHead; local 252 SkOpPtT* result = spanBase->ptT(); 254 spanBase->bumpSpanAdds(); 271 FAIL_WITH_NULL_IF(spanBase == &fTail); 272 } while ((spanBase = spanBase->upCast()->next())); 287 SkOpSpanBase* spanBase = fHead.next(); local 288 while (spanBase != &fTail) { 291 priorAngle->set(spanBase, prior); 292 spanBase 467 const SkOpSpanBase* spanBase = &fHead; local 1112 SkOpSpanBase* spanBase = &fHead; local 1380 SkOpSpanBase* spanBase = &fHead; local 1603 testForCoincidence(const SkOpPtT* priorPtT, const SkOpPtT* ptT, const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const argument [all...] |
H A D | SkPathOpsDebug.cpp | 867 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...] |
H A D | SkOpSegment.h | 396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
|
/external/skqp/src/pathops/ |
H A D | SkOpSegment.cpp | 250 SkOpSpanBase* spanBase = &fHead; local 252 SkOpPtT* result = spanBase->ptT(); 254 spanBase->bumpSpanAdds(); 271 FAIL_WITH_NULL_IF(spanBase == &fTail); 272 } while ((spanBase = spanBase->upCast()->next())); 287 SkOpSpanBase* spanBase = fHead.next(); local 288 while (spanBase != &fTail) { 291 priorAngle->set(spanBase, prior); 292 spanBase 467 const SkOpSpanBase* spanBase = &fHead; local 1112 SkOpSpanBase* spanBase = &fHead; local 1380 SkOpSpanBase* spanBase = &fHead; local 1603 testForCoincidence(const SkOpPtT* priorPtT, const SkOpPtT* ptT, const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const argument [all...] |
H A D | SkPathOpsDebug.cpp | 867 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...] |
H A D | SkOpSegment.h | 396 const SkOpSpanBase* spanBase, const SkOpSegment* opp) const;
|
Completed in 186 milliseconds