Lines Matching defs:winding
511 // if all angles have a computed winding,
513 // or if adjacent orderable angles have no computed winding,
516 // and one has winding computed, transfer to the other
677 // iterate through the angle, and compute everyone's winding
773 // iterate through the angle, and compute everyone's winding
861 // iterate through the angle, and compute everyone's winding
954 bool SkOpSegment::markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding,
958 bool success = markWinding(spanStart, winding);
963 SkASSERT(spanStart->windSum() == winding);
967 (void) other->markWinding(spanStart, winding);
976 int winding, int oppWinding, SkOpSpanBase** lastPtr) {
979 bool success = markWinding(spanStart, winding, oppWinding);
985 if (spanStart->windSum() != winding || spanStart->oppSum() != oppWinding) {
991 SkASSERT(spanStart->oppSum() == winding);
997 (void) other->markWinding(spanStart, winding, oppWinding);
999 (void) other->markWinding(spanStart, oppWinding, winding);
1068 bool SkOpSegment::markWinding(SkOpSpan* span, int winding) {
1070 SkASSERT(winding);
1075 debugShowNewWinding(__FUNCTION__, span, winding);
1077 span->setWindSum(winding);
1082 bool SkOpSegment::markWinding(SkOpSpan* span, int winding, int oppWinding) {
1084 SkASSERT(winding || oppWinding);
1089 debugShowNewWinding(__FUNCTION__, span, winding, oppWinding);
1091 span->setWindSum(winding);
1745 int winding = lesser->windSum();
1746 if (winding == SK_MinS32) {
1747 winding = lesser->computeWindSum();
1749 if (winding == SK_MinS32) {
1750 return winding;
1753 if (winding && UseInnerWinding(winding - spanWinding, winding)
1754 && winding != SK_MaxS32) {
1755 winding -= spanWinding;
1757 return winding;
