151     , fFirstEdgeAbove(nullptr), fLastEdgeAbove(nullptr)  in Vertex()
163     Edge*   fFirstEdgeAbove;      // Linked list of edges above this vertex.  member
846     if (v->fFirstEdgeAbove && v->fLastEdgeAbove) {  in find_enclosing_edges()
847         *left = v->fFirstEdgeAbove->fLeft;  in find_enclosing_edges()
871     for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) {  in insert_edge_above()
878         edge, prev, next, &v->fFirstEdgeAbove, &v->fLastEdgeAbove);  in insert_edge_above()
904         edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);  in remove_edge_above()
935         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in rewind()
1160     while (Edge* edge = src->fFirstEdgeAbove) {  in merge_vertices()
1426         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in dump_mesh()
1478         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in simplify()
1515         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in simplify()
1535         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in tessellate()
1546         if (v->fFirstEdgeAbove) {  in tessellate()
1547             leftPoly = v->fFirstEdgeAbove->fLeftPoly;  in tessellate()
1555         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in tessellate()
1565         if (v->fFirstEdgeAbove) {  in tessellate()
1567                 leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc);  in tessellate()
1572             for (Edge* e = v->fFirstEdgeAbove; e != v->fLastEdgeAbove; e = e->fNextEdgeAbove) {  in tessellate()
1592             if (!v->fFirstEdgeAbove) {  in tessellate()
1642         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in remove_non_boundary_edges()
1650         for (Edge* e = v->fFirstEdgeAbove; e;) {  in remove_non_boundary_edges()
1748     for (Edge* e = src->fFirstEdgeAbove; e; ) {  in reconnect_all_overlap_edges()
1790     top->fPartner = top->fFirstEdgeAbove || top->fFirstEdgeBelow ? dest : nullptr;  in apply()
1793     bottom->fPartner = bottom->fFirstEdgeAbove || bottom->fFirstEdgeBelow ? dest : nullptr;  in apply()
1813         if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) {  in collapse_overlap_regions()
2047             } else if ((next = e->fTop->fFirstEdgeAbove)) {  in extract_boundary()