1582     const SkTSpan* coincident = fCoincident;  in validate()  local
1583     while (coincident) {  in validate()
1585         coincident = coincident->fNext;  in validate()
1919     SkTSpan* coincident = sect1->fCoincident;  in BinarySearch()  local
1920     if (coincident) {  in BinarySearch()
1922         if (coincident->fNext) {  in BinarySearch()
1924             coincident = sect1->fCoincident;  in BinarySearch()
1928             if (!coincident) {  in BinarySearch()
1931             if (!coincident->fCoinStart.isMatch()) {  in BinarySearch()
1934             if (!coincident->fCoinEnd.isMatch()) {  in BinarySearch()
1937             double perpT = coincident->fCoinStart.perpT();  in BinarySearch()
1941             int index = intersections->insertCoincident(coincident->fStartT,  in BinarySearch()
1942                     perpT, coincident->pointFirst());  in BinarySearch()
1943             if ((intersections->insertCoincident(coincident->fEndT,  in BinarySearch()
1944                     coincident->fCoinEnd.perpT(),  in BinarySearch()
1945                     coincident->pointLast()) < 0) && index >= 0) {  in BinarySearch()
1948         } while ((coincident = coincident->fNext));  in BinarySearch()