Lines Matching refs:inner
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
1886 const SkCoincidentSpans* inner = outer;
1887 while ((inner = inner->next())) {
1890 const SkOpPtT* ics = inner->coinPtTStart();
1894 const SkOpPtT* ios = inner->oppPtTStart();
1905 const SkOpPtT* ice = inner->coinPtTEnd();
1916 const SkOpPtT* ioe = inner->oppPtTEnd();
1927 const SkOpPtT* ice = inner->coinPtTEnd();
1939 const SkOpPtT* ioe = inner->oppPtTEnd();
2441 for (int inner = check + 1; inner < loop; ++inner) {
2490 const SkOpPtT* inner = opp->ptT();
2491 const SkOpPtT* innerStop = inner;
2493 if (inner->segment() != segment) {
2496 if (inner->deleted()) {
2499 const SkOpSpanBase* innerBase = inner->span();
2500 SkASSERT(innerBase->ptT() == inner);
2504 if (!zero_or_one(inner->fT)) {
2507 SkASSERT(inner->fT != test->fT);
2509 log->record(SkPathOpsDebug::kMergeMatches_Glitch, testBase, inner);
2515 // inner->setDeleted();
2519 const SkOpPtT* debugInner = inner;
2533 } while ((inner = inner->next()) != innerStop);
2612 for (int inner = check + 1; inner < loop; ++inner) {
2759 for (int inner = check + 1; inner < loop; ++inner) {