151     , fFirstEdgeAbove(nullptr), fLastEdgeAbove(nullptr)  in Vertex()
164     Edge*   fFirstEdgeAbove;      // Linked list of edges above this vertex.  member
903     if (v->fFirstEdgeAbove && v->fLastEdgeAbove) {  in find_enclosing_edges()
904         *left = v->fFirstEdgeAbove->fLeft;  in find_enclosing_edges()
928     for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) {  in insert_edge_above()
935         edge, prev, next, &v->fFirstEdgeAbove, &v->fLastEdgeAbove);  in insert_edge_above()
961         edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);  in remove_edge_above()
992         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in rewind()
1180     while (Edge* edge = src->fFirstEdgeAbove) {  in merge_vertices()
1457         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in dump_mesh()
1524     return v->fFirstEdgeAbove || v->fFirstEdgeBelow;  in connected()
1569         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in simplify()
1600         if (v->fFirstEdgeAbove) {  in tessellate()
1601             leftPoly = v->fFirstEdgeAbove->fLeftPoly;  in tessellate()
1609         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in tessellate()
1619         if (v->fFirstEdgeAbove) {  in tessellate()
1621                 leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc);  in tessellate()
1626             for (Edge* e = v->fFirstEdgeAbove; e != v->fLastEdgeAbove; e = e->fNextEdgeAbove) {  in tessellate()
1646             if (!v->fFirstEdgeAbove) {  in tessellate()
1704         for (Edge* e = v->fFirstEdgeAbove; e;) {  in remove_non_boundary_edges()
2132             } else if ((next = e->fTop->fFirstEdgeAbove)) {  in extract_boundary()