479     void apply(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc);
1152 void merge_vertices(Vertex* src, Vertex* dst, VertexList* mesh, Comparator& c,  in merge_vertices()  argument
1166     mesh->remove(src);  in merge_vertices()
1169 Vertex* create_sorted_vertex(const SkPoint& p, uint8_t alpha, VertexList* mesh,  in create_sorted_vertex()  argument
1175     Vertex* nextV = prevV ? prevV->fNext : mesh->fHead;  in create_sorted_vertex()
1189             v->fID = mesh->fHead->fID - 1.0f;  in create_sorted_vertex()
1191             v->fID = mesh->fTail->fID + 1.0f;  in create_sorted_vertex()
1196         mesh->insert(v, prevV, nextV);  in create_sorted_vertex()
1221                             VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in check_for_intersection()  argument
1251             v = create_sorted_vertex(p, alpha, mesh, top, c, alloc);  in check_for_intersection()
1305 bool merge_coincident_vertices(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in merge_coincident_vertices()  argument
1306     if (!mesh->fHead) {  in merge_coincident_vertices()
1310     for (Vertex* v = mesh->fHead->fNext; v;) {  in merge_coincident_vertices()
1316             merge_vertices(v, v->fPrev, mesh, c, alloc);  in merge_coincident_vertices()
1326 void build_edges(VertexList* contours, int contourCnt, VertexList* mesh, Comparator& c,  in build_edges()  argument
1333             mesh->append(v);  in build_edges()
1340 void connect_partners(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in connect_partners()  argument
1341     for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) {  in connect_partners()
1417 void dump_mesh(const VertexList& mesh) {  in dump_mesh()  argument
1419     for (Vertex* v = mesh.fHead; v; v = v->fNext) {  in dump_mesh()
1473 bool simplify(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in simplify()  argument
1477     for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) {  in simplify()
1492                     if (check_for_intersection(leftEnclosingEdge, edge, &activeEdges, &v, mesh, c,  in simplify()
1497                     if (check_for_intersection(edge, rightEnclosingEdge, &activeEdges, &v, mesh, c,  in simplify()
1505                                            &activeEdges, &v, mesh, c, alloc)) {  in simplify()
1637 void remove_non_boundary_edges(const VertexList& mesh, SkPath::FillType fillType,  in remove_non_boundary_edges()  argument
1641     for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) {  in remove_non_boundary_edges()
1764 void Event::apply(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in apply()  argument
1770     Vertex* dest = create_sorted_vertex(fPoint, fAlpha, mesh, fEdge->fTop, c, alloc);  in apply()
1808 bool collapse_overlap_regions(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in collapse_overlap_regions()  argument
1812     for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) {  in collapse_overlap_regions()
1850         event->apply(mesh, c, alloc);  in collapse_overlap_regions()
2077                       VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in contours_to_mesh()  argument
2089     build_edges(contours, contourCnt, mesh, c, alloc);  in contours_to_mesh()
2116     VertexList mesh;  in contours_to_polys()  local
2117     contours_to_mesh(contours, contourCnt, antialias, &mesh, c, alloc);  in contours_to_polys()
2118     sort_mesh(&mesh, c, alloc);  in contours_to_polys()
2119     merge_coincident_vertices(&mesh, c, alloc);  in contours_to_polys()
2120     simplify(&mesh, c, alloc);  in contours_to_polys()
2123         extract_boundaries(mesh, &innerMesh, outerMesh, fillType, c, alloc);  in contours_to_polys()
2156         return tessellate(mesh, alloc);  in contours_to_polys()