496     void apply(VertexList* mesh, Comparator& c, EventList* events, SkArenaAlloc& alloc);
1172 void merge_vertices(Vertex* src, Vertex* dst, VertexList* mesh, Comparator& c,  in merge_vertices()  argument
1186     mesh->remove(src);  in merge_vertices()
1190 Vertex* create_sorted_vertex(const SkPoint& p, uint8_t alpha, VertexList* mesh,  in create_sorted_vertex()  argument
1196     Vertex* nextV = prevV ? prevV->fNext : mesh->fHead;  in create_sorted_vertex()
1210             v->fID = mesh->fHead->fID - 1.0f;  in create_sorted_vertex()
1212             v->fID = mesh->fTail->fID + 1.0f;  in create_sorted_vertex()
1217         mesh->insert(v, prevV, nextV);  in create_sorted_vertex()
1261                             VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in check_for_intersection()  argument
1291             v = create_sorted_vertex(p, alpha, mesh, top, c, alloc);  in check_for_intersection()
1336 bool merge_coincident_vertices(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in merge_coincident_vertices()  argument
1337     if (!mesh->fHead) {  in merge_coincident_vertices()
1341     for (Vertex* v = mesh->fHead->fNext; v;) {  in merge_coincident_vertices()
1347             merge_vertices(v, v->fPrev, mesh, c, alloc);  in merge_coincident_vertices()
1357 void build_edges(VertexList* contours, int contourCnt, VertexList* mesh, Comparator& c,  in build_edges()  argument
1364             mesh->append(v);  in build_edges()
1371 void connect_partners(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in connect_partners()  argument
1372     for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) {  in connect_partners()
1448 void dump_mesh(const VertexList& mesh) {  in dump_mesh()  argument
1450     for (Vertex* v = mesh.fHead; v; v = v->fNext) {  in dump_mesh()
1527 bool simplify(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in simplify()  argument
1531     for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) {  in simplify()
1546                     if (check_for_intersection(leftEnclosingEdge, edge, &activeEdges, &v, mesh, c,  in simplify()
1551                     if (check_for_intersection(edge, rightEnclosingEdge, &activeEdges, &v, mesh, c,  in simplify()
1559                                            &activeEdges, &v, mesh, c, alloc)) {  in simplify()
1691 void remove_non_boundary_edges(const VertexList& mesh, SkPath::FillType fillType,  in remove_non_boundary_edges()  argument
1695     for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) {  in remove_non_boundary_edges()
1796 void Event::apply(VertexList* mesh, Comparator& c, EventList* events, SkArenaAlloc& alloc) {  in apply()  argument
1807     Vertex* dest = create_sorted_vertex(fPoint, fAlpha, mesh, prev, c, alloc);  in apply()
1858 bool collapse_overlap_regions(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc,  in collapse_overlap_regions()  argument
1865     for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) {  in collapse_overlap_regions()
1927         event->apply(mesh, c, &events, alloc);  in collapse_overlap_regions()
2162                       VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) {  in contours_to_mesh()  argument
2174     build_edges(contours, contourCnt, mesh, c, alloc);  in contours_to_mesh()
2201     VertexList mesh;  in contours_to_polys()  local
2202     contours_to_mesh(contours, contourCnt, antialias, &mesh, c, alloc);  in contours_to_polys()
2203     sort_mesh(&mesh, c, alloc);  in contours_to_polys()
2204     merge_coincident_vertices(&mesh, c, alloc);  in contours_to_polys()
2205     simplify(&mesh, c, alloc);  in contours_to_polys()
2207     dump_mesh(mesh);  in contours_to_polys()
2210         extract_boundaries(mesh, &innerMesh, outerMesh, fillType, c, alloc);  in contours_to_polys()
2246         return tessellate(mesh, alloc);  in contours_to_polys()