1603         const SkTSect* sect2, SkIntersections* intersections) {  in EndsEqual()  argument
1607         intersections->insert(0, 0, sect1->fCurve[0]);  in EndsEqual()
1611         intersections->insert(0, 1, sect1->fCurve[0]);  in EndsEqual()
1615         intersections->insert(1, 0, sect1->pointLast());  in EndsEqual()
1619             intersections->insert(1, 1, sect1->pointLast());  in EndsEqual()
1625         intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]);  in EndsEqual()
1630         intersections->insertNear(0, 1, sect1->fCurve[0], sect2->pointLast());  in EndsEqual()
1636         intersections->insertNear(1, 0, sect1->pointLast(), sect2->fCurve[0]);  in EndsEqual()
1641         intersections->insertNear(1, 1, sect1->pointLast(), sect2->pointLast());  in EndsEqual()
1651     void addIntersection(SkIntersections* intersections) const {  in addIntersection()
1654         intersections->insert(r1t, r2t, fC1Span->part()[fC1Index]);  in addIntersection()
1756     void finish(SkIntersections* intersections) const {  in finish()
1766             test->addIntersection(intersections);  in finish()
1778         SkTSect* sect2, SkIntersections* intersections) {  in BinarySearch()  argument
1784     intersections->reset();  in BinarySearch()
1785     intersections->setMax(sect1->fCurve.maxIntersections() + 4);  // give extra for slop  in BinarySearch()
1794         (void) EndsEqual(sect1, sect2, intersections);  in BinarySearch()
1831                 SkOPOBJASSERT(intersections, 0);  in BinarySearch()
1835                 SkOPOBJASSERT(intersections, 0);  in BinarySearch()
1851                 SkOPOBJASSERT(intersections, 0);  in BinarySearch()
1855                 SkOPOBJASSERT(intersections, 0);  in BinarySearch()
1862         intersections->debugBumpLoopCount(SkIntersections::kIterations_DebugLoop);  in BinarySearch()
1877             intersections->debugBumpLoopCount(SkIntersections::kCoinCheck_DebugLoop);  in BinarySearch()
1906             intersections->debugBumpLoopCount(SkIntersections::kComputePerp_DebugLoop);  in BinarySearch()
1941             int index = intersections->insertCoincident(coincident->fStartT,  in BinarySearch()
1943             if ((intersections->insertCoincident(coincident->fEndT,  in BinarySearch()
1946                 intersections->clearCoincidence(index);  in BinarySearch()
1950     int zeroOneSet = EndsEqual(sect1, sect2, intersections);  in BinarySearch()
1957                 intersections->insert(0, perp.perpT(), perp.perpPt());  in BinarySearch()
1964                 intersections->insert(1, perp.perpT(), perp.perpPt());  in BinarySearch()
1971                 intersections->insert(perp.perpT(), 0, perp.perpPt());  in BinarySearch()
1978                 intersections->insert(perp.perpT(), 1, perp.perpPt());  in BinarySearch()
1995                 intersections->insert(0, t, start1);  in BinarySearch()
2005                 intersections->insert(t, 0, start2);  in BinarySearch()
2019                     intersections->insert(1, t, end1);  in BinarySearch()
2034                     intersections->insert(t, 1, end2);  in BinarySearch()
2050             found |= closest.find(result1, result2  SkDEBUGPARAMS(intersections));  in BinarySearch()
2054     closest.finish(intersections);  in BinarySearch()
2056     int last = intersections->used() - 1;  in BinarySearch()
2058         if (intersections->isCoincident(index) && intersections->isCoincident(index + 1)) {  in BinarySearch()
2062         double midT = ((*intersections)[0][index] + (*intersections)[0][index + 1]) / 2;  in BinarySearch()
2071         if (intersections->isCoincident(index)) {  in BinarySearch()
2072             intersections->removeOne(index);  in BinarySearch()
2074         } else if (intersections->isCoincident(index + 1)) {  in BinarySearch()
2075             intersections->removeOne(index + 1);  in BinarySearch()
2078             intersections->setCoincident(index++);  in BinarySearch()
2080         intersections->setCoincident(index);  in BinarySearch()
2082     SkOPOBJASSERT(intersections, intersections->used() <= sect1->fCurve.maxIntersections());  in BinarySearch()