343         : fWinding(winding)  in Edge()
365     int      fWinding;          // 1 == edge goes downward; -1 = edge goes upward.  member
506         , fWinding(winding)  in Poly()
647     int fWinding;  member
822     return poly && apply_fill_type(fillType, poly->fWinding);  in apply_fill_type()
1005         other->fWinding += edge->fWinding;  in merge_edges_above()
1010         other->fWinding += edge->fWinding;  in merge_edges_above()
1014         edge->fWinding += other->fWinding;  in merge_edges_above()
1026         other->fWinding += edge->fWinding;  in merge_edges_below()
1031         edge->fWinding += other->fWinding;  in merge_edges_below()
1035         other->fWinding += edge->fWinding;  in merge_edges_below()
1086     int winding = edge->fWinding;  in split_edge()
1147     edge->fWinding *= winding_scale;  in connect()
1256                 line1.fC += sqrt(left->fLine.magSq()) * (left->fWinding > 0 ? 1 : -1) * dir;  in check_for_intersection()
1257                 line2.fC += sqrt(right->fLine.magSq()) * (right->fWinding > 0 ? 1 : -1) * dir;  in check_for_intersection()
1427             LOG("  edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding);  in dump_mesh()
1430             LOG("  edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding);  in dump_mesh()
1597                                                  leftPoly->fWinding, alloc);  in tessellate()
1601                                                  rightPoly->fWinding, alloc);  in tessellate()
1616                 int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0;  in tessellate()
1617                 winding += leftEdge->fWinding;  in tessellate()
1649                           apply_fill_type(fillType, leftEnclosingEdge->fWinding);  in remove_non_boundary_edges()
1653             bool filled = apply_fill_type(fillType, e->fWinding);  in remove_non_boundary_edges()
1663                 e->fWinding += prev->fWinding;  in remove_non_boundary_edges()
1694         edge->fWinding *= -1;  in reconnect()
1711         Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom;  in simplify_boundary()
1712         Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop;  in simplify_boundary()
1723                 join->fLine = join->fLine * join->fWinding;  in simplify_boundary()
1786         fEdge->fWinding = fEdge->fWinding >= 0 ? 1 : -1;  in apply()
1798         return e->fWinding != 0 && e->fWinding != 1;  in is_overlap_edge()
1800         return e->fWinding != 0 && e->fWinding != -2;  in is_overlap_edge()
1823                 e->fWinding -= prev->fWinding;  in collapse_overlap_regions()
1829                 e->fWinding += prev->fWinding;  in collapse_overlap_regions()
1836                                        (!prev || prev->fWinding == 0 || e->fWinding == 0);  in collapse_overlap_regions()
1860     return winding != origEdge->fWinding;  in inversion()
1875     Vertex* prevV = prevEdge->fWinding > 0 ? prevEdge->fTop : prevEdge->fBottom;  in stroke_boundary()
1888         Vertex* v = e->fWinding > 0 ? e->fTop : e->fBottom;  in stroke_boundary()
1901                 Vertex* nextV = e->fWinding > 0 ? e->fBottom : e->fTop;  in stroke_boundary()
2027     bool down = apply_fill_type(fillType, e->fWinding);  in extract_boundary()
2029         e->fWinding = down ? 1 : -1;  in extract_boundary()
2032         e->fLine = e->fLine * e->fWinding;  in extract_boundary()
2300                 vertsEnd->fWinding = poly->fWinding;  in PathToVertices()