Home
last modified time | relevance | path

Searched refs:fPrevEdgeBelow (Results 1 – 2 of 2) sorted by relevance

/external/skia/src/gpu/
DGrTessellator.cpp351 , fPrevEdgeBelow(nullptr) in Edge()
373 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". member
895 list_insert<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( in insert_edge_below()
911 list_remove<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( in remove_edge_below()
1062 } else if (bottom_collinear(edge->fPrevEdgeBelow, edge)) { in merge_collinear_edges()
1063 merge_edges_below(edge->fPrevEdgeBelow, edge, activeEdges, current, c); in merge_collinear_edges()
1072 SkASSERT(!bottom_collinear(edge->fPrevEdgeBelow, edge)); in merge_collinear_edges()
2045 if ((next = e->fPrevEdgeBelow)) { in extract_boundary()
/external/skqp/src/gpu/
DGrTessellator.cpp351 , fPrevEdgeBelow(nullptr) in Edge()
373 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". member
895 list_insert<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( in insert_edge_below()
911 list_remove<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( in remove_edge_below()
1062 } else if (bottom_collinear(edge->fPrevEdgeBelow, edge)) { in merge_collinear_edges()
1063 merge_edges_below(edge->fPrevEdgeBelow, edge, activeEdges, current, c); in merge_collinear_edges()
1072 SkASSERT(!bottom_collinear(edge->fPrevEdgeBelow, edge)); in merge_collinear_edges()
2045 if ((next = e->fPrevEdgeBelow)) { in extract_boundary()