197 const SkOpPtT* SkOpSegment::existing(double t, const SkOpSegment* opp) const {  in existing()
212         if (!opp) {  in existing()
225     return opp && !test->contains(opp) ? nullptr : testPtT;  in existing()
833 bool SkOpSegment::isClose(double t, const SkOpSegment* opp) const {  in isClose()
838     (*CurveIntersectRay[opp->verb()])(opp->pts(), opp->weight(), perp, &i);  in isClose()
1139             SkOpSegment* opp = ptT->segment();  in ClearVisited()  local
1140             opp->resetVisited();  in ClearVisited()
1173             SkOpSegment* opp = ptT->span()->segment();  in missingCoincidence()  local
1174             if (opp->done()) {  in missingCoincidence()
1178             if (!opp->visited()) {  in missingCoincidence()
1190             if (span && span->containsCoincidence(opp)) {  in missingCoincidence()
1193             if (spanBase->containsCoinEnd(opp)) {  in missingCoincidence()
1207                     if (segment == opp) {  in missingCoincidence()
1209                         priorOpp = opp;  in missingCoincidence()
1237             if (this->testForCoincidence(rootPriorPtT, rootPtT, prior, spanBase, opp)) {  in missingCoincidence()
1666         const SkOpSpanBase* prior, const SkOpSpanBase* spanBase, const SkOpSegment* opp) const {  in testForCoincidence()
1685         opp->subDivide(priorPtT->span(), ptT->span(), &oppPart);  in testForCoincidence()
1686         (*CurveDIntersectRay[opp->verb()])(oppPart, ray, &i);  in testForCoincidence()