Lines Matching defs:ptT
13 return this->span()->ptT() != this;
20 const SkOpPtT* ptT = this;
21 const SkOpPtT* stopPtT = ptT;
22 while ((ptT = ptT->next()) != stopPtT) {
23 if (ptT->fSpan == fSpan && !ptT->fDeleted) {
24 return ptT;
32 const SkOpPtT* ptT = this;
33 const SkOpPtT* stopPtT = ptT;
34 while ((ptT = ptT->next()) != stopPtT) {
35 if (ptT == check) {
44 const SkOpPtT* ptT = this;
45 const SkOpPtT* stopPtT = ptT;
46 while ((ptT = ptT->next()) != stopPtT) {
47 if (ptT->fPt == pt && ptT->segment() == segment) {
55 const SkOpPtT* ptT = this;
56 const SkOpPtT* stopPtT = ptT;
57 while ((ptT = ptT->next()) != stopPtT) {
58 if (ptT->fT == t && ptT->segment() == segment) {
67 const SkOpPtT* ptT = this;
68 const SkOpPtT* stopPtT = ptT;
69 while ((ptT = ptT->next()) != stopPtT) {
70 if (ptT->segment() == check && !ptT->deleted()) {
71 return ptT;
82 const SkOpPtT* ptT = this;
83 const SkOpPtT* stopPtT = ptT;
85 if (ptT->segment() == segment && !ptT->deleted()) {
86 return ptT;
88 ptT = ptT->fNext;
89 } while (stopPtT != ptT);
111 if (span->ptT() != this) {
147 SkASSERT(this->span()->debugDeleted() || this->span()->ptT() != this);
153 SkOpPtT* oppPrev = this->ptT()->oppPrev(opp->ptT());
158 this->ptT()->addOpp(opp->ptT(), oppPrev);
211 if (walk->segment() == segment && walk->span()->ptT() == walk) {
254 SkOpPtT* spanPtT = span->ptT();
257 span->release(this->ptT());
260 return; // merge is already in the ptT loop
263 this->ptT()->insert(spanPtT);
288 // for each coincident ptT in loop; see if its opposite in is also in the loop
289 // this implementation is the motivation for marking that a ptT is referenced by a coincident span
290 SkOpPtT* head = this->ptT();
321 SkASSERT(testBase->ptT() == test);
326 SkOpPtT* inner = opp->ptT();
336 SkASSERT(innerBase->ptT() == inner);
420 const SkOpPtT* start = base->ptT()->starter(spanEnd->ptT());
453 coincidence->fixUp(this->ptT(), kept);
455 this->ptT()->setDeleted();
456 SkOpPtT* stopPtT = this->ptT();