337         , fNextEdgeAbove(nullptr)  in Edge()
357     Edge*    fNextEdgeAbove;    // "  member
821     for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) {  in insert_edge_above()
827     list_insert<Edge, &Edge::fPrevEdgeAbove, &Edge::fNextEdgeAbove>(  in insert_edge_above()
852     list_remove<Edge, &Edge::fPrevEdgeAbove, &Edge::fNextEdgeAbove>(  in remove_edge_above()
883         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in rewind()
991         } else if (edge->fNextEdgeAbove && (edge->fTop == edge->fNextEdgeAbove->fTop ||  in merge_collinear_edges()
992                                             !edge->isLeftOf(edge->fNextEdgeAbove->fTop))) {  in merge_collinear_edges()
993             merge_edges_above(edge, edge->fNextEdgeAbove, activeEdges, current, c);  in merge_collinear_edges()
1006     SkASSERT(!edge->fNextEdgeAbove || edge->fNextEdgeAbove->isRightOf(edge->fTop));  in merge_collinear_edges()
1058         Edge* next = edge->fNextEdgeAbove;  in merge_vertices()
1316         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in simplify()
1356         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in is_complex()
1396         for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) {  in tessellate()
1413             for (Edge* e = v->fFirstEdgeAbove; e != v->fLastEdgeAbove; e = e->fNextEdgeAbove) {  in tessellate()
1414                 Edge* rightEdge = e->fNextEdgeAbove;  in tessellate()
1492             Edge* next = e->fNextEdgeAbove;  in remove_non_boundary_edges()
1647             if ((next = e->fNextEdgeAbove)) {  in extract_boundary()