268 void* GrTriangulator::emitTriangle(Vertex* prev, Vertex* curr, Vertex* next, int winding,  in emitTriangle()  argument
270     if (winding > 0) {  in emitTriangle()
275     if (fCollectBreadcrumbTriangles && abs(winding) > 1 &&  in emitTriangle()
279         fBreadcrumbList.append(fAlloc, prev->fPoint, curr->fPoint, next->fPoint, abs(winding) - 1);  in emitTriangle()
284 GrTriangulator::Poly::Poly(Vertex* v, int winding)  in Poly()  argument
286         , fWinding(winding)  in Poly()
356 Poly* GrTriangulator::makePoly(Poly** head, Vertex* v, int winding) const {  in makePoly()
357     Poly* poly = fAlloc->make<Poly>(v, winding);  in makePoly()
503 static inline bool apply_fill_type(SkPathFillType fillType, int winding) {  in apply_fill_type()  argument
506             return winding != 0;  in apply_fill_type()
508             return (winding & 1) != 0;  in apply_fill_type()
510             return winding == 1;  in apply_fill_type()
512             return (winding & 1) == 1;  in apply_fill_type()
519 bool GrTriangulator::applyFillType(int winding) const {  in applyFillType()
520     return apply_fill_type(fPath.getFillType(), winding);  in applyFillType()
530     int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1;  in makeEdge()  local
531     Vertex* top = winding < 0 ? next : prev;  in makeEdge()
532     Vertex* bottom = winding < 0 ? prev : next;  in makeEdge()
533     return fAlloc->make<Edge>(top, bottom, winding, type);  in makeEdge()
798     int winding = edge->fWinding;  in splitEdge()  local
812     Edge* newEdge = fAlloc->make<Edge>(top, bottom, winding, edge->fType);  in splitEdge()
1346                 int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0;  in tessellate()  local
1347                 winding += leftEdge->fWinding;  in tessellate()
1348                 if (winding != 0) {  in tessellate()
1349                     Poly* poly = this->makePoly(&polys, v, winding);  in tessellate()