Lines Matching refs:winding
421 // if all angles have a computed winding,
423 // or if adjacent orderable angles have no computed winding,
426 // and one has winding computed, transfer to the other
597 // iterate through the angle, and compute everyone's winding
693 // iterate through the angle, and compute everyone's winding
781 // iterate through the angle, and compute everyone's winding
892 bool SkOpSegment::markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding,
896 bool success = markWinding(spanStart, winding);
905 // SkASSERT(spanStart->windSum() == winding); // FIXME: is this assert too aggressive?
909 (void) other->markWinding(spanStart, winding);
918 int winding, int oppWinding, SkOpSpanBase** lastPtr) {
921 bool success = markWinding(spanStart, winding, oppWinding);
931 if (spanStart->windSum() != winding || spanStart->oppSum() != oppWinding) {
937 FAIL_IF(spanStart->oppSum() != winding);
943 (void) other->markWinding(spanStart, winding, oppWinding);
945 (void) other->markWinding(spanStart, oppWinding, winding);
1021 bool SkOpSegment::markWinding(SkOpSpan* span, int winding) {
1023 SkASSERT(winding);
1028 debugShowNewWinding(__FUNCTION__, span, winding);
1030 span->setWindSum(winding);
1035 bool SkOpSegment::markWinding(SkOpSpan* span, int winding, int oppWinding) {
1037 SkASSERT(winding || oppWinding);
1042 debugShowNewWinding(__FUNCTION__, span, winding, oppWinding);
1044 span->setWindSum(winding);
1739 int winding = lesser->windSum();
1740 if (winding == SK_MinS32) {
1741 winding = lesser->computeWindSum();
1743 if (winding == SK_MinS32) {
1744 return winding;
1747 if (winding && UseInnerWinding(winding - spanWinding, winding)
1748 && winding != SK_MaxS32) {
1749 winding -= spanWinding;
1751 return winding;