142     : fPoint(point), fPrev(NULL), fNext(NULL)  in Vertex()
152     Vertex* fNext;            // "  member
317         , fNext(NULL)  in Poly()
334             , fNext(NULL) {}  in MonotonePoly()
339         MonotonePoly* fNext;  member
352                 fTail->fNext = newV;  in addVertex()
355                 newV->fNext = fHead;  in addVertex()
364             Vertex* v = first->fNext;  in emit()
366                 SkASSERT(v && v->fPrev && v->fNext);  in emit()
369                 Vertex* next = v->fNext;  in emit()
376                     v->fPrev->fNext = v->fNext;  in emit()
377                     v->fNext->fPrev = v->fPrev;  in emit()
379                         v = v->fNext;  in emit()
384                     v = v->fNext;  in emit()
404                 fTail->fNext = fActive;  in addVertex()
414                                fActive->fHead->fNext : fActive->fTail->fPrev;  in addVertex()
435         for (MonotonePoly* m = fHead; m != NULL; m = m->fNext) {  in emit()
444     Poly* fNext;  member
461     poly->fNext = *head;  in new_poly()
474         prev->fNext = v;  in append_point_to_contour()
557         prev->fNext = head;  in path_to_contours()
579                     prev->fNext = head;  in path_to_contours()
604                     prev->fNext = head;  in path_to_contours()
612                     prev->fNext = head;  in path_to_contours()
915     remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(src, head, NULL);  in merge_vertices()
945                 nextV = nextV->fNext;  in check_for_intersection()
961                 v->fNext = nextV;  in check_for_intersection()
962                 prevV->fNext = v;  in check_for_intersection()
983                 v->fPrev->fNext = v->fNext;  in sanitize_contours()
984                 v->fNext->fPrev = v->fPrev;  in sanitize_contours()
986                     contours[i] = v->fNext;  in sanitize_contours()
990                 v = v->fNext;  in sanitize_contours()
998     for (Vertex* v = (*vertices)->fNext; v != NULL; v = v->fNext) {  in merge_coincident_vertices()
1015             Vertex* vNext = v->fNext;  in build_edges()
1026                 prev->fNext = v;  in build_edges()
1037         prev->fNext = vertices->fPrev = NULL;  in build_edges()
1049     if (!v || !v->fNext) {  in front_back_split()
1054         fast = v->fNext;  in front_back_split()
1057             fast = fast->fNext;  in front_back_split()
1059                 slow = slow->fNext;  in front_back_split()
1060                 fast = fast->fNext;  in front_back_split()
1065         *pBack = slow->fNext;  in front_back_split()
1066         slow->fNext->fPrev = NULL;  in front_back_split()
1067         slow->fNext = NULL;  in front_back_split()
1072     if (!*head || !(*head)->fNext) {  in merge_sort()
1087     insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, *tail, NULL, head, tail);  in append_vertex()
1091     insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, *tail, v->fNext, head, tail);  in append_vertex_list()
1100             Vertex* next = a->fNext;  in sorted_merge()
1104             Vertex* next = b->fNext;  in sorted_merge()
1123     for (Vertex* v = vertices; v != NULL; v = v->fNext) {  in simplify()
1176     for (Vertex* v = vertices; v != NULL; v = v->fNext) {  in tessellate()
1296         for (v = v->fNext; v != contours[i]; v = v->fNext) {  in contours_to_polys()
1311     for (Vertex* v = vertices; v != NULL; v = v->fNext) {  in contours_to_polys()
1324     for (Poly* poly = polys; poly; poly = poly->fNext) {  in polys_to_triangles()
1430         for (Poly* poly = polys; poly; poly = poly->fNext) {  in generateGeometry()