Home
last modified time | relevance | path

Searched refs:fFirstEdgeAbove (Results 1 – 4 of 4) sorted by relevance

/external/skqp/src/gpu/
DGrTessellator.cpp151 , 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()
[all …]
/external/skia/src/gpu/
DGrTriangulator.cpp544 if (v->fFirstEdgeAbove && v->fLastEdgeAbove) { in FindEnclosingEdges()
545 *left = v->fFirstEdgeAbove->fLeft; in FindEnclosingEdges()
569 for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) { in insertAbove()
576 this, prev, next, &v->fFirstEdgeAbove, &v->fLastEdgeAbove); in insertAbove()
602 edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove); in remove_edge_above()
630 for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { in rewind()
873 while (Edge* edge = src->fFirstEdgeAbove) { in mergeVertices()
1151 for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { in dump()
1240 for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { in simplify()
1271 if (v->fFirstEdgeAbove) { in tessellate()
[all …]
DGrTriangulator.h266 , fFirstEdgeAbove(nullptr), fLastEdgeAbove(nullptr) in Vertex()
279 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex. member
291 bool isConnected() const { return this->fFirstEdgeAbove || this->fFirstEdgeBelow; } in isConnected()
DGrAATriangulator.cpp153 for (Edge* e = v->fFirstEdgeAbove; e;) { in removeNonBoundaryEdges()
593 } else if ((next = e->fTop->fFirstEdgeAbove)) { in extractBoundary()