42 bool SkOpPtT::contains(const SkOpSegment* segment, const SkPoint& pt) const {  in contains()  argument
43     SkASSERT(this->segment() != segment);  in contains()
47         if (ptT->fPt == pt && ptT->segment() == segment) {  in contains()
54 bool SkOpPtT::contains(const SkOpSegment* segment, double t) const {  in contains()  argument
58         if (ptT->fT == t && ptT->segment() == segment) {  in contains()
66     SkASSERT(this->segment() != check);  in contains()
70         if (ptT->segment() == check && !ptT->deleted()) {  in contains()
78     return segment()->contour();  in contour()
81 const SkOpPtT* SkOpPtT::find(const SkOpSegment* segment) const {  in find()
85         if (ptT->segment() == segment && !ptT->deleted()) {  in find()
114     const SkOpSegment* segment = this->segment();  in onEnd()  local
115     return span == segment->head() || span == segment->tail();  in onEnd()
138 const SkOpSegment* SkOpPtT::segment() const {  in segment()  function in SkOpPtT
139     return span()->segment();  in segment()
142 SkOpSegment* SkOpPtT::segment() {  in segment()  function in SkOpPtT
143     return span()->segment();  in segment()
169     const SkOpSegment* segment = this->segment();  in collapsed()  local
178         if (walk->segment() != segment) {  in collapsed()
204 const SkOpPtT* SkOpSpanBase::contains(const SkOpSegment* segment) const {  in contains()
211         if (walk->segment() == segment && walk->span()->ptT() == walk) {  in contains()
218 bool SkOpSpanBase::containsCoinEnd(const SkOpSegment* segment) const {  in containsCoinEnd()
219     SkASSERT(this->segment() != segment);  in containsCoinEnd()
222         if (next->segment() == segment) {  in containsCoinEnd()
230     return segment()->contour();  in contour()
237 void SkOpSpanBase::initBase(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) {  in initBase()  argument
238     fSegment = segment;  in initBase()
302 // Look to see if pt-t linked list contains same segment more than once
303 // if so, and if each pt-t is directly pointed to by spans in that segment,
305 // keep the points, but remove spans so that the segment doesn't have 2 or more
322         SkOpSegment* segment = test->segment();  in mergeMatches()  local
323         if (segment->done()) {  in mergeMatches()
329             if (inner->segment() != segment) {  in mergeMatches()
346                     segment->markAllDone();  // mark segment as collapsed  in mergeMatches()
353 #ifdef SK_DEBUG   // assert if another undeleted entry points to segment  in mergeMatches()
356                 if (debugInner->segment() != segment) {  in mergeMatches()
381 bool SkOpSpan::containsCoincidence(const SkOpSegment* segment) const {  in containsCoincidence()
382     SkASSERT(this->segment() != segment);  in containsCoincidence()
385         if (next->segment() == segment) {  in containsCoincidence()
392 void SkOpSpan::init(SkOpSegment* segment, SkOpSpan* prev, double t, const SkPoint& pt) {  in init()  argument
394     initBase(segment, prev, t, pt);  in init()
402     segment->bumpCount();  in init()
407 bool SkOpSpan::insertCoincidence(const SkOpSegment* segment, bool flipped, bool ordered) {  in insertCoincidence()  argument
408     if (this->containsCoincidence(segment)) {  in insertCoincidence()
413         if (next->segment() == segment) {  in insertCoincidence()
417                 const SkOpPtT* spanEndPtT = fNext->contains(segment);  in insertCoincidence()
435     SkASSERT(0); // FIXME? if we get here, the span is missing its opposite segment...  in insertCoincidence()
450     this->segment()->release(this);  in release()