Lines Matching defs:opp
136 const SkCoincidentSpans* opp = NULL) {
140 if (opp) {
141 glitch->fOppSpan = opp->coinPtTStart();
142 glitch->fOppEndSpan = opp->coinPtTEnd();
821 const SkOpSegment* opp = ptT->segment();
822 opp->resetDebugVisited();
853 const SkOpSegment* opp = ptT->span()->segment();
854 if (opp->done()) {
857 // when opp is encounted the 1st time, continue; on 2nd encounter, look for coincidence
858 if (!opp->debugVisited()) {
870 if (span && span->segment() != opp && span->containsCoincidence(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted
873 if (spanBase->segment() != opp && spanBase->containsCoinEnd(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted
877 // find prior span containing opp segment
887 if (segment == opp) {
889 priorOpp = opp;
917 if (testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, opp)) {
1329 int opp = 0;
1356 opp += next->debugSign() * (op ? minSpan->windValue() : minSpan->oppValue());
1358 opp &= 1;
1363 SkASSERT(opp == 0 || !SkPathOpsDebug::gRunFail);
2045 /* coin and opp spans may not match up. Mark the ends, and then let the interior
2401 void SkOpSpanBase::debugAddOpp(SkPathOpsDebug::GlitchLog* log, const SkOpSpanBase* opp) const {
2402 const SkOpPtT* oppPrev = this->ptT()->oppPrev(opp->ptT());
2406 this->debugMergeMatches(log, opp);
2407 this->ptT()->debugAddOpp(opp->ptT(), oppPrev);
2475 void SkOpSpanBase::debugMergeMatches(SkPathOpsDebug::GlitchLog* log, const SkOpSpanBase* opp) const {
2490 const SkOpPtT* inner = opp->ptT();
2700 void SkOpPtT::debugAddOpp(const SkOpPtT* opp, const SkOpPtT* oppPrev) const {
2702 SkASSERT(this != opp);
2703 // this->fNext = opp;
2780 const SkOpPtT* SkOpPtT::debugOppPrev(const SkOpPtT* opp) const {
2781 return this->oppPrev(const_cast<SkOpPtT*>(opp));