141     , fFirstEdgeAbove(nullptr), fLastEdgeAbove(nullptr)  in Vertex()
151     Edge*   fFirstEdgeAbove;  // Linked list of edges above this vertex.  member
659     if (v->fFirstEdgeAbove) {  in find_enclosing_edges()
660         *left = v->fFirstEdgeAbove->fLeft;  in find_enclosing_edges()
717     for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) {  in insert_edge_above()
724         edge, prev, next, &v->fFirstEdgeAbove, &v->fLastEdgeAbove);  in insert_edge_above()
749         edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);  in remove_edge_above()
906     for (Edge* edge = src->fFirstEdgeAbove; edge;) {  in merge_vertices()
1125         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in simplify()
1159         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in simplify()
1178         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in tessellate()
1189         if (v->fFirstEdgeAbove) {  in tessellate()
1190             leftPoly = v->fFirstEdgeAbove->fLeftPoly;  in tessellate()
1198         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in tessellate()
1208         if (v->fFirstEdgeAbove) {  in tessellate()
1215             for (Edge* e = v->fFirstEdgeAbove; e != v->fLastEdgeAbove; e = e->fNextEdgeAbove) {  in tessellate()
1237             if (!v->fFirstEdgeAbove) {  in tessellate()