102     SkOpPtT* oPtT = start->ptT()->next();  in activeAngleOther()
175     path->deferredMove(start->ptT());  in addCurveTo()
178             FAIL_IF(!path->deferredLine(end->ptT()));  in addCurveTo()
181             path->quadTo(curvePart.fCurve.fQuad[1].asSkPoint(), end->ptT());  in addCurveTo()
184             path->conicTo(curvePart.fCurve.fConic[1].asSkPoint(), end->ptT(),  in addCurveTo()
189                     curvePart.fCurve.fCubic[2].asSkPoint(), end->ptT());  in addCurveTo()
202         testPtT = test->ptT();  in existing()
241     SkOpPtT* oppPrev = test->ptT()->oppPrev(newPtT);  in addExpanded()
246         writableTest->ptT()->addOpp(newPtT, oppPrev);  in addExpanded()
257         SkOpPtT* result = spanBase->ptT();  in addT()
274             return span->ptT();  in addT()
487         if (spanBase->ptT()->contains(this, newT)) {  in contains()
1085         SkOpPtT* otherPtT = endSpan->ptT()->next();  in nextChase()
1137         SkOpPtT* ptT = span->ptT(), * stopPtT = ptT;  in ClearVisited()  local
1138         while ((ptT = ptT->next()) != stopPtT) {  in ClearVisited()
1139             SkOpSegment* opp = ptT->segment();  in ClearVisited()
1164         SkOpPtT* ptT = spanBase->ptT(), * spanStopPtT = ptT;  in missingCoincidence()  local
1165         SkOPASSERT(ptT->span() == spanBase);  in missingCoincidence()
1166         while ((ptT = ptT->next()) != spanStopPtT) {  in missingCoincidence()
1170             if (ptT->deleted()) {  in missingCoincidence()
1173             SkOpSegment* opp = ptT->span()->segment();  in missingCoincidence()
1184             if (ptT->segment() == this) {  in missingCoincidence()
1201                 priorStopPtT = priorPtT = priorTest->ptT();  in missingCoincidence()
1218             if (priorPtT == ptT) {  in missingCoincidence()
1221             SkOpPtT* oppStart = prior->ptT();  in missingCoincidence()
1222             SkOpPtT* oppEnd = spanBase->ptT();  in missingCoincidence()
1223             bool swapped = priorPtT->fT > ptT->fT;  in missingCoincidence()
1226                 swap(priorPtT, ptT);  in missingCoincidence()
1230             SkOpPtT* rootPriorPtT = priorPtT->span()->ptT();  in missingCoincidence()
1231             SkOpPtT* rootPtT = ptT->span()->ptT();  in missingCoincidence()
1232             SkOpPtT* rootOppStart = oppStart->span()->ptT();  in missingCoincidence()
1233             SkOpPtT* rootOppEnd = oppEnd->span()->ptT();  in missingCoincidence()
1255                 swap(priorPtT, ptT);  in missingCoincidence()
1274         SkOpPtT* startPtT = test->ptT();  in moveMultiples()
1331                 SkOpPtT* oppStartPtT = oppTest->ptT();  in moveMultiples()
1366     const SkOpPtT* refHead = refSpan->ptT();  in spansNearby()
1367     const SkOpPtT* checkHead = checkSpan->ptT();  in spansNearby()
1441         SkOpPtT* ptT = spanBase->ptT();  in moveNearby()  local
1442         const SkOpPtT* headPtT = ptT;  in moveNearby()
1443         while ((ptT = ptT->next()) != headPtT) {  in moveNearby()
1447             SkOpSpanBase* test = ptT->span();  in moveNearby()
1448             if (ptT->segment() == this && !ptT->deleted() && test != spanBase  in moveNearby()
1449                     && test->ptT() == ptT) {  in moveNearby()
1455                     spanBase->upCast()->release(ptT);  in moveNearby()
1565         SkOpPtT* ptT = span->ptT(), * stopPtT = ptT;  in sortAngles()  local
1571             SkOpSpanBase* oSpan = ptT->span();  in sortAngles()
1603         } while ((ptT = ptT->next()) != stopPtT);  in sortAngles()
1621     const SkOpPtT& startPtT = *start->ptT();  in subDivide()
1622     const SkOpPtT& endPtT = *end->ptT();  in subDivide()
1665 bool SkOpSegment::testForCoincidence(const SkOpPtT* priorPtT, const SkOpPtT* ptT,  in testForCoincidence()  argument
1673             && !SkDPoint::ApproximatelyEqual(ptT->fPt, midPt)) {  in testForCoincidence()
1674         if (priorPtT->span() == ptT->span()) {  in testForCoincidence()
1685         opp->subDivide(priorPtT->span(), ptT->span(), &oppPart);  in testForCoincidence()