Lines Matching refs:ptT
29 // sets the span's end to the ptT referenced by the previous-next
32 void (SkCoincidentSpans::*setEnd)(const SkOpPtT* ptT) ) {
36 const SkOpPtT* testPtT = prev ? prev->next()->ptT()
37 : origSpan->upCast()->next()->prev()->ptT();
71 setStarts(prev->ptT(), oppPtT);
88 setEnds(next->ptT(), oppPtT);
256 // choose the ptT at the front of the list to track
257 coinPtTStart = coinPtTStart->span()->ptT();
258 coinPtTEnd = coinPtTEnd->span()->ptT();
259 oppPtTStart = oppPtTStart->span()->ptT();
260 oppPtTEnd = oppPtTEnd->span()->ptT();
277 const SkOpPtT* testPtT = testSpan->ptT();
292 if (testPtT->span()->ptT() != testPtT) {
298 // intersect perp with base->ptT() with testPtT->segment()
352 bool SkOpCoincidence::addEndMovedSpans(const SkOpPtT* ptT) {
353 FAIL_IF(!ptT->span()->upCastable());
354 const SkOpSpan* base = ptT->span()->upCast();
374 ptT list on B-segment adjacent to the B-end/A ptT loop (not in the loop, but
376 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
377 and the adjacent ptT loop.
453 const SkOpPtT* containedOpp = test->ptT()->contains(oSeg);
454 const SkOpPtT* containedThis = oTest->ptT()->contains(seg);
471 } while (!(walkOpp = walk->ptT()->contains(oSeg))
544 foundStart = work->ptT();
548 foundEnd = work->ptT();
551 SkASSERT(work->ptT() != overE);
