140     : fPoint(point), fPrev(nullptr), fNext(nullptr)  in Vertex()
149     Vertex* fPrev;            // Linked list of contours, then Y-sorted vertices.  member
331             , fPrev(nullptr)  in MonotonePoly()
336         MonotonePoly* fPrev;  member
349                 newV->fPrev = fTail;  in addVertex()
354                 fHead->fPrev = newV;  in addVertex()
364                 SkASSERT(v && v->fPrev && v->fNext);  in emit()
365                 Vertex* prev = v->fPrev;  in emit()
374                     v->fPrev->fNext = v->fNext;  in emit()
375                     v->fNext->fPrev = v->fPrev;  in emit()
376                     if (v->fPrev == first) {  in emit()
379                         v = v->fPrev;  in emit()
401                 fActive->fPrev = fTail;  in addVertex()
412                                fActive->fHead->fNext : fActive->fTail->fPrev;  in addVertex()
473         v->fPrev = prev;  in append_point_to_contour()
554         head->fPrev = prev;  in path_to_contours()
577                     head->fPrev = prev;  in path_to_contours()
604                     head->fPrev = prev;  in path_to_contours()
612                     head->fPrev = prev;  in path_to_contours()
916     remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(src, head, nullptr);  in merge_vertices()
943                 nextV = nextV->fPrev;  in check_for_intersection()
948             Vertex* prevV = nextV->fPrev;  in check_for_intersection()
961                 v->fPrev = prevV;  in check_for_intersection()
964                 nextV->fPrev = v;  in check_for_intersection()
978             if (coincident(v->fPrev->fPoint, v->fPoint)) {  in sanitize_contours()
980                 if (v->fPrev == v) {  in sanitize_contours()
984                 v->fPrev->fNext = v->fNext;  in sanitize_contours()
985                 v->fNext->fPrev = v->fPrev;  in sanitize_contours()
989                 v = v->fPrev;  in sanitize_contours()
1000         if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) {  in merge_coincident_vertices()
1001             v->fPoint = v->fPrev->fPoint;  in merge_coincident_vertices()
1003         if (coincident(v->fPrev->fPoint, v->fPoint)) {  in merge_coincident_vertices()
1004             merge_vertices(v->fPrev, v, vertices, c, alloc);  in merge_coincident_vertices()
1017             Edge* edge = new_edge(v->fPrev, v, alloc, c);  in build_edges()
1019                 insert_edge_below(edge, v->fPrev, c);  in build_edges()
1023                 insert_edge_above(edge, v->fPrev, c);  in build_edges()
1028                 v->fPrev = prev;  in build_edges()
1038         prev->fNext = vertices->fPrev = nullptr;  in build_edges()
1067         slow->fNext->fPrev = nullptr;  in front_back_split()
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()