152     , fFirstEdgeBelow(nullptr), fLastEdgeBelow(nullptr)  in Vertex()
166     Edge*   fFirstEdgeBelow;      // Linked list of edges below this vertex.  member
946     for (next = v->fFirstEdgeBelow; next; next = next->fNextEdgeBelow) {  in insert_edge_below()
953         edge, prev, next, &v->fFirstEdgeBelow, &v->fLastEdgeBelow);  in insert_edge_below()
969         edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow);  in remove_edge_below()
988         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in rewind()
1183     while (Edge* edge = src->fFirstEdgeBelow) {  in merge_vertices()
1460         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in dump_mesh()
1524     return v->fFirstEdgeAbove || v->fFirstEdgeBelow;  in connected()
1544             if (v->fFirstEdgeBelow) {  in simplify()
1545                 for (Edge* edge = v->fFirstEdgeBelow; edge; edge = edge->fNextEdgeBelow) {  in simplify()
1573         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in simplify()
1614         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in tessellate()
1637             if (!v->fFirstEdgeBelow) {  in tessellate()
1645         if (v->fFirstEdgeBelow) {  in tessellate()
1664             Edge* leftEdge = v->fFirstEdgeBelow;  in tessellate()
1715         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in remove_non_boundary_edges()
1911         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in collapse_overlap_regions()
2150         while (v->fFirstEdgeBelow) {  in extract_boundaries()
2152             extract_boundary(&boundary, v->fFirstEdgeBelow, fillType, alloc);  in extract_boundaries()
2296         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in count_outer_mesh_points()
2305         for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) {  in outer_mesh_to_triangles()