203     static void BinarySearch(SkTSect* sect1, SkTSect<OppCurve, TCurve>* sect2,
261     static int EndsEqual(const SkTSect* sect1, const SkTSect<OppCurve, TCurve>* sect2,
1724 int SkTSect<TCurve, OppCurve>::EndsEqual(const SkTSect<TCurve, OppCurve>* sect1,  in EndsEqual()  argument
1727     if (sect1->fCurve[0] == sect2->fCurve[0]) {  in EndsEqual()
1729         intersections->insert(0, 0, sect1->fCurve[0]);  in EndsEqual()
1731     if (sect1->fCurve[0] == sect2->fCurve[OppCurve::kPointLast]) {  in EndsEqual()
1733         intersections->insert(0, 1, sect1->fCurve[0]);  in EndsEqual()
1735     if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[0]) {  in EndsEqual()
1737         intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]);  in EndsEqual()
1739     if (sect1->fCurve[TCurve::kPointLast] == sect2->fCurve[OppCurve::kPointLast]) {  in EndsEqual()
1741             intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]);  in EndsEqual()
1745             && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[0])) {  in EndsEqual()
1747         intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]);  in EndsEqual()
1750             && sect1->fCurve[0].approximatelyEqual(sect2->fCurve[OppCurve::kPointLast])) {  in EndsEqual()
1752         intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]);  in EndsEqual()
1756             && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[0])) {  in EndsEqual()
1758         intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]);  in EndsEqual()
1761             && sect1->fCurve[TCurve::kPointLast].approximatelyEqual(sect2->fCurve[  in EndsEqual()
1764         intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast],  in EndsEqual()
1902 void SkTSect<TCurve, OppCurve>::BinarySearch(SkTSect<TCurve, OppCurve>* sect1,  in BinarySearch()  argument
1907     SkDEBUGCODE(sect1->fOppSect = sect2);  in BinarySearch()
1908     SkDEBUGCODE(sect2->fOppSect = sect1);  in BinarySearch()
1911     SkTSpan<TCurve, OppCurve>* span1 = sect1->fHead;  in BinarySearch()
1913     int oppSect, sect = sect1->intersects(span1, sect2, span2, &oppSect);  in BinarySearch()
1919         (void) EndsEqual(sect1, sect2, intersections);  in BinarySearch()
1922     span1->addBounded(span2, &sect1->fHeap);  in BinarySearch()
1926         SkTSpan<TCurve, OppCurve>* largest1 = sect1->boundsMax();  in BinarySearch()
1938             SkTSpan<TCurve, OppCurve>* half1 = sect1->addOne();  in BinarySearch()
1939             if (!half1->split(largest1, &sect1->fHeap)) {  in BinarySearch()
1942             sect1->trim(largest1, sect2);  in BinarySearch()
1943             sect1->trim(half1, sect2);  in BinarySearch()
1953             sect2->trim(largest2, sect1);  in BinarySearch()
1954             sect2->trim(half2, sect1);  in BinarySearch()
1956         sect1->validate();  in BinarySearch()
1959         if (sect1->fActiveCount >= COINCIDENT_SPAN_COUNT  in BinarySearch()
1961             sect1->coincidentCheck(sect2);  in BinarySearch()
1962             sect1->validate();  in BinarySearch()
1965         if (sect1->fActiveCount >= COINCIDENT_SPAN_COUNT  in BinarySearch()
1967             sect1->computePerpendiculars(sect2, sect1->fHead, sect1->tail());  in BinarySearch()
1968             sect2->computePerpendiculars(sect1, sect2->fHead, sect2->tail());  in BinarySearch()
1969             sect1->removeByPerpendicular(sect2);  in BinarySearch()
1970             sect1->validate();  in BinarySearch()
1972             if (sect1->collapsed() > TCurve::kMaxIntersections) {  in BinarySearch()
1977         sect1->dumpBoth(sect2);  in BinarySearch()
1979         if (!sect1->fHead || !sect2->fHead) {  in BinarySearch()
1983     SkTSpan<TCurve, OppCurve>* coincident = sect1->fCoincident;  in BinarySearch()
1987             sect1->mergeCoincidence(sect2);  in BinarySearch()
1988             coincident = sect1->fCoincident;  in BinarySearch()
2003     int zeroOneSet = EndsEqual(sect1, sect2, intersections);  in BinarySearch()
2004     if (!sect1->fHead || !sect2->fHead) {  in BinarySearch()
2007     sect1->recoverCollapsed();  in BinarySearch()
2009     SkTSpan<TCurve, OppCurve>* result1 = sect1->fHead;  in BinarySearch()
2013         const SkDPoint& start1 = sect1->fCurve[0];  in BinarySearch()
2026             if (sect1->fCurve.ptAtT(t).approximatelyEqual(start2)) {  in BinarySearch()
2031     const SkTSpan<TCurve, OppCurve>* tail1 = sect1->tail();  in BinarySearch()
2033         const SkDPoint& end1 = sect1->fCurve[TCurve::kPointLast];  in BinarySearch()
2046             if (sect1->fCurve.ptAtT(t).approximatelyEqual(end2)) {  in BinarySearch()
2075         SkDPoint midPt = sect1->fCurve.ptAtT(midT);  in BinarySearch()
2078         perp.setPerp(sect1->fCurve, midT, midPt, sect2->fCurve);  in BinarySearch()