197     const SkOpSegment* coinSeg = coinPtTStart->segment();  in extend()  local
201         swap(coinSeg, oppSeg);  in extend()
212         if (coinSeg != test->coinPtTStart()->segment()) {  in extend()
328             SkOpSegment* coinSeg = base->segment();  in addEndMovedSpans()  local
331             if (Ordered(coinSeg, oppSeg)) {  in addEndMovedSpans()
338                 swap(coinSeg, oppSeg);  in addEndMovedSpans()
350             FAIL_IF(!this->addOrOverlap(coinSeg, oppSeg, coinTs, coinTe, oppTs, oppTe, &added));  in addEndMovedSpans()
533        const SkOpSegment* coinSeg  SkDEBUGPARAMS(const SkOpPtT* overE)) {  in TRange()
540         const SkOpPtT* contained = work->contains(coinSeg);  in TRange()
569         const SkOpSegment* coinSeg, const SkOpSegment* oppSeg,  in checkOverlap()  argument
572     if (!Ordered(coinSeg, oppSeg)) {  in checkOverlap()
574             return this->checkOverlap(check, oppSeg, coinSeg, oppTs, oppTe, coinTs, coinTe,  in checkOverlap()
577         return this->checkOverlap(check, oppSeg, coinSeg, oppTe, oppTs, coinTe, coinTs, overlaps);  in checkOverlap()
585         if (check->coinPtTStart()->segment() != coinSeg) {  in checkOverlap()
620         double tStart, double tEnd, SkOpSegment* coinSeg, SkOpSegment* oppSeg, bool* added  in addIfMissing()  argument
632     SkASSERT(over1s->segment() != coinSeg);  in addIfMissing()
634     SkASSERT(coinSeg != oppSeg);  in addIfMissing()
636     coinTs = TRange(over1s, tStart, coinSeg  SkDEBUGPARAMS(over1e));  in addIfMissing()
637     coinTe = TRange(over1s, tEnd, coinSeg  SkDEBUGPARAMS(over1e));  in addIfMissing()
638     SkOpSpanBase::Collapsed result = coinSeg->collapsed(coinTs, coinTe);  in addIfMissing()
653     (void) this->addOrOverlap(coinSeg, oppSeg, coinTs, coinTe, oppTs, oppTe, added);  in addIfMissing()
660 bool SkOpCoincidence::addOrOverlap(SkOpSegment* coinSeg, SkOpSegment* oppSeg,  in addOrOverlap()  argument
664     if (!this->checkOverlap(fTop, coinSeg, oppSeg, coinTs, coinTe, oppTs, oppTe, &overlaps)) {  in addOrOverlap()
667     if (fHead && !this->checkOverlap(fHead, coinSeg, oppSeg, coinTs,  in addOrOverlap()
694     const SkOpPtT* cs = coinSeg->existing(coinTs, oppSeg);  in addOrOverlap()
695     const SkOpPtT* ce = coinSeg->existing(coinTe, oppSeg);  in addOrOverlap()
700     const SkOpPtT* os = oppSeg->existing(oppTs, coinSeg);  in addOrOverlap()
701     const SkOpPtT* oe = oppSeg->existing(oppTe, coinSeg);  in addOrOverlap()
709     const SkOpPtT* csExisting = !cs ? coinSeg->existing(coinTs, nullptr) : nullptr;  in addOrOverlap()
710     const SkOpPtT* ceExisting = !ce ? coinSeg->existing(coinTe, nullptr) : nullptr;  in addOrOverlap()
727             : coinSeg->addT(coinTs);  in addOrOverlap()
742             : coinSeg->addT(coinTe);  in addOrOverlap()
757         if (overlap->coinPtTStart()->segment() == coinSeg) {  in addOrOverlap()
968     const SkOpSegment* coinSeg = coinPtTStart->segment();  in contains()  local
972         swap(coinSeg, oppSeg);  in contains()
983         if (coinSeg != test->coinPtTStart()->segment()) {  in contains()
1403 bool SkOpCoincidence::Ordered(const SkOpSegment* coinSeg, const SkOpSegment* oppSeg) {  in Ordered()  argument
1404     if (coinSeg->verb() < oppSeg->verb()) {  in Ordered()
1407     if (coinSeg->verb() > oppSeg->verb()) {  in Ordered()
1410     int count = (SkPathOpsVerbToPoints(coinSeg->verb()) + 1) * 2;  in Ordered()
1411     const SkScalar* cPt = &coinSeg->pts()[0].fX;  in Ordered()