140     : fPoint(point), fPrev(nullptr), fNext(nullptr)  in Vertex()
150     Vertex* fNext;            // "  member
315         , fNext(nullptr)  in Poly()
332             , fNext(nullptr) {}  in MonotonePoly()
337         MonotonePoly* fNext;  member
350                 fTail->fNext = newV;  in addVertex()
353                 newV->fNext = fHead;  in addVertex()
362             Vertex* v = first->fNext;  in emit()
364                 SkASSERT(v && v->fPrev && v->fNext);  in emit()
367                 Vertex* next = v->fNext;  in emit()
374                     v->fPrev->fNext = v->fNext;  in emit()
375                     v->fNext->fPrev = v->fPrev;  in emit()
377                         v = v->fNext;  in emit()
382                     v = v->fNext;  in emit()
402                 fTail->fNext = fActive;  in addVertex()
412                                fActive->fHead->fNext : fActive->fTail->fPrev;  in addVertex()
433         for (MonotonePoly* m = fHead; m != nullptr; m = m->fNext) {  in emit()
442     Poly* fNext;  member
459     poly->fNext = *head;  in new_poly()
472         prev->fNext = v;  in append_point_to_contour()
555         prev->fNext = head;  in path_to_contours()
578                     prev->fNext = head;  in path_to_contours()
605                     prev->fNext = head;  in path_to_contours()
613                     prev->fNext = head;  in path_to_contours()
916     remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(src, head, nullptr);  in merge_vertices()
946                 nextV = nextV->fNext;  in check_for_intersection()
962                 v->fNext = nextV;  in check_for_intersection()
963                 prevV->fNext = v;  in check_for_intersection()
984                 v->fPrev->fNext = v->fNext;  in sanitize_contours()
985                 v->fNext->fPrev = v->fPrev;  in sanitize_contours()
987                     contours[i] = v->fNext;  in sanitize_contours()
991                 v = v->fNext;  in sanitize_contours()
999     for (Vertex* v = (*vertices)->fNext; v != nullptr; v = v->fNext) {  in merge_coincident_vertices()
1016             Vertex* vNext = v->fNext;  in build_edges()
1027                 prev->fNext = v;  in build_edges()
1038         prev->fNext = vertices->fPrev = nullptr;  in build_edges()
1050     if (!v || !v->fNext) {  in front_back_split()
1055         fast = v->fNext;  in front_back_split()
1058             fast = fast->fNext;  in front_back_split()
1060                 slow = slow->fNext;  in front_back_split()
1061                 fast = fast->fNext;  in front_back_split()
1066         *pBack = slow->fNext;  in front_back_split()
1067         slow->fNext->fPrev = nullptr;  in front_back_split()
1068         slow->fNext = nullptr;  in front_back_split()
1073     if (!*head || !(*head)->fNext) {  in merge_sort()
1088     insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, *tail, nullptr, head, tail);  in append_vertex()
1092     insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, *tail, v->fNext, head, tail);  in append_vertex_list()
1101             Vertex* next = a->fNext;  in sorted_merge()
1105             Vertex* next = b->fNext;  in sorted_merge()
1124     for (Vertex* v = vertices; v != nullptr; v = v->fNext) {  in simplify()
1177     for (Vertex* v = vertices; v != nullptr; v = v->fNext) {  in tessellate()
1306         for (v = v->fNext; v != contours[i]; v = v->fNext) {  in contours_to_polys()
1321     for (Vertex* v = vertices; v != nullptr; v = v->fNext) {  in contours_to_polys()
1363     for (Poly* poly = polys; poly; poly = poly->fNext) {  in count_points()
1411     for (Poly* poly = polys; poly; poly = poly->fNext) {  in PathToTriangles()
1451     for (Poly* poly = polys; poly; poly = poly->fNext) {  in PathToVertices()