Home
last modified time | relevance | path

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

/external/skqp/src/gpu/
DGrTessellator.cpp152 , fFirstEdgeBelow(nullptr), fLastEdgeBelow(nullptr) in Vertex()
165 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex. member
889 for (next = v->fFirstEdgeBelow; next; next = next->fNextEdgeBelow) { in insert_edge_below()
896 edge, prev, next, &v->fFirstEdgeBelow, &v->fLastEdgeBelow); in insert_edge_below()
912 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow); in remove_edge_below()
931 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in rewind()
1163 while (Edge* edge = src->fFirstEdgeBelow) { in merge_vertices()
1429 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in dump_mesh()
1478 if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) { in simplify()
1490 if (v->fFirstEdgeBelow) { in simplify()
[all …]
/external/skia/src/gpu/
DGrTriangulator.cpp587 for (next = v->fFirstEdgeBelow; next; next = next->fNextEdgeBelow) { in insertBelow()
594 this, prev, next, &v->fFirstEdgeBelow, &v->fLastEdgeBelow); in insertBelow()
610 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow); in remove_edge_below()
626 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in rewind()
876 while (Edge* edge = src->fFirstEdgeBelow) { in mergeVertices()
1154 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in dump()
1217 if (v->fFirstEdgeBelow) { in simplify()
1218 for (Edge* edge = v->fFirstEdgeBelow; edge; edge = edge->fNextEdgeBelow) { in simplify()
1244 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in simplify()
1287 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in tessellate()
[all …]
DGrAATriangulator.cpp164 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in removeNonBoundaryEdges()
370 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in collapseOverlapRegions()
610 while (v->fFirstEdgeBelow) { in extractBoundaries()
612 this->extractBoundary(&boundary, v->fFirstEdgeBelow); in extractBoundaries()
667 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in polysToAATriangles()
687 for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { in polysToAATriangles()
DGrTriangulator.h267 , fFirstEdgeBelow(nullptr), fLastEdgeBelow(nullptr) in Vertex()
281 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex. member
291 bool isConnected() const { return this->fFirstEdgeAbove || this->fFirstEdgeBelow; } in isConnected()