237     VertexList() : fHead(nullptr), fTail(nullptr) {}  in VertexList()
238     VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {}  in VertexList()
239     Vertex* fHead;  member
242         list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);  in insert()
248         if (!list.fHead) {  in append()
252             fTail->fNext = list.fHead;  in append()
253             list.fHead->fPrev = fTail;  in append()
255             fHead = list.fHead;  in append()
260         insert(v, nullptr, fHead);  in prepend()
263         list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail);  in remove()
266         if (fHead && fTail) {  in close()
267             fTail->fNext = fHead;  in close()
268             fHead->fPrev = fTail;  in close()
424     EdgeList() : fHead(nullptr), fTail(nullptr) {}  in EdgeList()
425     Edge* fHead;  member
428         list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail);  in insert()
434         list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail);  in remove()
437         while (fHead) {  in removeAll()
438             this->remove(fHead);  in removeAll()
442         if (fHead && fTail) {  in close()
443             fTail->fRight = fHead;  in close()
444             fHead->fLeft = fTail;  in close()
448         return edge->fLeft || edge->fRight || fHead == edge;  in contains()
458         , fHead(nullptr)  in Poly()
514             Vertex* first = vertices.fHead;  in emit()
563             fHead = fTail = alloc.make<MonotonePoly>(e, side);  in addEdge()
591         for (MonotonePoly* m = fHead; m != nullptr; m = m->fNext) {  in emit()
599     MonotonePoly* fHead;  member
720                 if (contour->fHead) {  in path_to_contours()
786     Edge* next = prev ? prev->fRight : edges->fHead;  in insert_edge()
811     for (next = edges->fHead; next != nullptr; next = next->fRight) {  in find_enclosing_edges()
1131         SkASSERT(contour->fHead);  in sanitize_contours()
1136         for (Vertex* v = contour->fHead; v;) {  in sanitize_contours()
1152     if (!mesh->fHead) {  in merge_coincident_vertices()
1155     for (Vertex* v = mesh->fHead->fNext; v != nullptr; v = v->fNext) {  in merge_coincident_vertices()
1171         for (Vertex* v = contour->fHead; v;) {  in build_edges()
1182     for (Vertex* outer = outerVertices->fHead; outer; outer = outer->fNext) {  in connect_partners()
1194     Vertex* a = front->fHead;  in sorted_merge()
1195     Vertex* b = back->fHead;  in sorted_merge()
1200             a = front->fHead;  in sorted_merge()
1204             b = back->fHead;  in sorted_merge()
1223     Vertex* slow = vertices->fHead;  in merge_sort()
1238     VertexList front(vertices->fHead, slow);  in merge_sort()
1240     front.fTail->fNext = back.fHead->fPrev = nullptr;  in merge_sort()
1245     vertices->fHead = vertices->fTail = nullptr;  in merge_sort()
1254     for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) {  in simplify()
1312     for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) {  in is_complex()
1355     for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) {  in tessellate()
1450         for (Edge* e = activeEdges.fHead; e != nullptr; e = e->fRight) {  in tessellate()
1463     for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) {  in remove_non_boundary_edges()
1507     for (Edge* e = boundary->fHead; e != nullptr;) {  in simplify_boundary()
1524                 e = boundary->fHead; // join->fLeft ? join->fLeft : join;  in simplify_boundary()
1556     if (!boundary->fHead || !boundary->fHead->fRight || !boundary->fHead->fRight->fRight) {  in stroke_boundary()
1569     for (Edge* e = boundary->fHead; e != nullptr; e = e->fRight) {  in stroke_boundary()
1594     Vertex* innerVertex = innerVertices.fHead;  in stroke_boundary()
1595     Vertex* outerVertex = outerVertices.fHead;  in stroke_boundary()
1599     Edge* bisector = new_edge(outerVertices.fHead, innerVertices.fHead, Edge::Type::kConnector, c,  in stroke_boundary()
1601     fix_inversions(innerVertices.fTail, innerVertices.fHead, prevBisector, bisector, prevEdge, c);  in stroke_boundary()
1602     fix_inversions(outerVertices.fTail, outerVertices.fHead, prevBisector, bisector, prevEdge, c);  in stroke_boundary()
1656     for (Vertex* v = inMesh.fHead; v; v = v->fNext) {  in extract_boundaries()
1672         Vertex* v = contours[i].fHead;  in contours_to_mesh()
1685     if (!vertices || !vertices->fHead) {  in sort_mesh()
1696     for (Vertex* v = vertices->fHead; v != nullptr; v = v->fNext) {  in sort_mesh()
1725             outerMesh->fHead = outerMesh->fTail = nullptr;  in contours_to_polys()
1787     for (Vertex* v = outerMesh.fHead; v; v = v->fNext) {  in count_outer_mesh_points()
1796     for (Vertex* v = outerMesh.fHead; v; v = v->fNext) {  in outer_mesh_to_triangles()