46 static int contains_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight, const SkPoint& edge) {  in contains_edge()  argument
48     bounds.set(pts, kPtCount[verb] + 1);  in contains_edge()
62     int count = (*CurveIntercept[verb * 2])(pts, weight, edge.fY, tVals);  in contains_edge()
66         SkScalar intersectX = (*CurvePointAtT[verb])(pts, weight, tVals[index]).fX;  in contains_edge()
76         if (pts[0].fX < edge.fX && pts[kPtCount[verb]].fX < edge.fX) {  in contains_edge()
87         directions[index] = to_direction((*CurveSlopeAtT[verb])(pts, weight, tVals[index]).fY);  in contains_edge()
99 static SkScalar conic_weight(const SkPath::Iter& iter, SkPath::Verb verb) {  in conic_weight()  argument
100     return SkPath::kConic_Verb == verb ? iter.conicWeight() : 1;  in conic_weight()
103 static SkPoint left_edge(SkPoint pts[4], SkPath::Verb verb, SkScalar weight,  in left_edge()  argument
105     SkASSERT(SkPath::kLine_Verb <= verb && verb <= SkPath::kCubic_Verb);  in left_edge()
110     if (SkPath::kLine_Verb == verb) {  in left_edge()
113     } else if (SkPath::kQuad_Verb == verb) {  in left_edge()
126     } else if (SkPath::kConic_Verb == verb) {  in left_edge()
140         SkASSERT(SkPath::kCubic_Verb == verb);  in left_edge()
183         SkPath::Verb verb;  in contourBounds()  local
187             verb = iter.next(pts);  in contourBounds()
188             if (SkPath::kMove_Verb == verb) {  in contourBounds()
193                bounds.setBounds(&pts[kPtIndex[verb]], kPtCount[verb]);  in contourBounds()
195             if (SkPath::kLine_Verb <= verb && verb <= SkPath::kCubic_Verb) {  in contourBounds()
197                 verbBounds.setBounds(&pts[kPtIndex[verb]], kPtCount[verb]);  in contourBounds()
201         } while (SkPath::kDone_Verb != verb);  in contourBounds()
210         SkPath::Verb verb;  in nextEdge()  local
214             verb = iter.next(pts);  in nextEdge()
221             if (SkPath::kLine_Verb > verb || verb > SkPath::kCubic_Verb) {  in nextEdge()
225             for (int index = 1; index <= kPtCount[verb]; ++index) {  in nextEdge()
235                 winding += contains_edge(pts, verb, conic_weight(iter, verb), contour.fMinXY);  in nextEdge()
240             SkPoint minXY = left_edge(pts, verb, conic_weight(iter, verb), &direction);  in nextEdge()
259         } while (SkPath::kDone_Verb != verb);  in nextEdge()