13 void SkTCoincident::setPerp(const SkTCurve& c1, double t,  in setPerp()
78 void SkTSect::addForPerp(SkTSpan* span, double t) {  in addForPerp()
108         const SkTSpan* test = testBounded->fBounded;  in closestBoundedT()  local
156         SkTSpan* test = bounded->fBounded;  in findOppSpan()  local
267                 double test = ((*fPart)[outer] - (*fPart)[inner]).lengthSquared();  in linearIntersects()  local
288         double test = (q2[n].fY - origY) * adj - (q2[n].fX - origX) * opp;  in linearIntersects()  local
344         SkTSpan* test = bounded->fBounded;  in oppT()  local
370             SkTSpan* test = bounded->fBounded;  in removeBounded()  local
403 bool SkTSpan::splitAt(SkTSpan* work, double t, SkArenaAlloc* heap) {  in splitAt()
495 void SkTSpan::validatePerpPt(double t, const SkDPoint& pt) const {  in validatePerpPt()
617     SkTSpan* test = fHead;  in boundsMax()  local
707 bool SkTSect::coincidentHasT(double t) {  in coincidentHasT()
708     SkTSpan* test = fCoincident;  in coincidentHasT()  local
720     const SkTSpan* test = fHead;  in collapsed()  local
793     const SkTSpan* test = fHead;  in hasBounded()  local
806     SkTSpan* test;  in deleteEmptySpans()  local
1238 bool SkTSect::matchedDirection(double t, const SkTSect* sect2,  in matchedDirection()
1245 void SkTSect::matchedDirCheck(double t, const SkTSect* sect2,  in matchedDirCheck()
1260         SkTSpan* test = fCoincident;  in mergeCoincidence()  local
1317     SkTSpan* test = fHead;  in prev()  local
1363     SkTSpan* test = fHead;  in removeByPerpendicular()  local
1458 SkTSpan* SkTSect::spanAtT(double t,  in spanAtT()
1460     SkTSpan* test = fHead;  in spanAtT()  local
1493         SkTSpan* test = testBounded->fBounded;  in trim()  local
1543     SkTSpan* test = first;  in updateBounded()  local
1742             SkClosestRecord* test = &fClosest[index];  in find()  local
1765             const SkClosestRecord* test = closestPtrs[index];  in finish()  local
1993             double t = head1->closestBoundedT(start1);  in BinarySearch()  local
2003             double t = head2->closestBoundedT(start2);  in BinarySearch()  local
2017                 double t = tail1->closestBoundedT(end1);  in BinarySearch()  local
2032                 double t = tail2->closestBoundedT(end2);  in BinarySearch()  local