Home
last modified time | relevance | path

Searched refs:EdgeList (Results 1 – 11 of 11) sorted by relevance

/external/skia/src/gpu/
DGrTriangulator.h48 struct EdgeList;
141 void setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
143 void setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
145 void mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
147 void mergeEdgesBelow(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
152 static void FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right);
153 void mergeCollinearEdges(Edge* edge, EdgeList* activeEdges, Vertex** current,
155 bool splitEdge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
157 bool intersectEdgePair(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
162 bool checkForIntersection(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
[all …]
DGrAATriangulator.h55 void extractBoundary(EdgeList* boundary, Edge* e) const;
60 void simplifyBoundary(EdgeList* boundary, const Comparator&) const;
65 void strokeBoundary(EdgeList* boundary, VertexList* innerMesh, const Comparator&) const;
DGrTriangulator.cpp33 using EdgeList = GrTriangulator::EdgeList; typedef
197 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert()
201 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove()
536 void EdgeList::insert(Edge* edge, Edge* prev) { in insert()
543 void GrTriangulator::FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { in FindEnclosingEdges()
618 static void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, const Comparator& c) { in rewind()
644 static void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, in rewind_if_necessary()
682 void GrTriangulator::setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setTop()
696 void GrTriangulator::setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setBottom()
710 void GrTriangulator::mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, in mergeEdgesAbove()
[all …]
DGrAATriangulator.cpp30 using EdgeList = GrTriangulator::EdgeList; typedef
144 EdgeList activeEdges; in removeNonBoundaryEdges()
184 void GrAATriangulator::simplifyBoundary(EdgeList* boundary, const Comparator& c) const { in simplifyBoundary()
311 EdgeList activeEdges; in collapseOverlapRegions()
410 void GrAATriangulator::strokeBoundary(EdgeList* boundary, VertexList* innerMesh, in strokeBoundary()
570 void GrAATriangulator::extractBoundary(EdgeList* boundary, Edge* e) const { in extractBoundary()
611 EdgeList boundary; in extractBoundaries()
/external/skqp/src/gpu/
DGrTessellator.cpp439 struct EdgeList { struct
440 EdgeList() : fHead(nullptr), fTail(nullptr) {} in EdgeList() argument
832 void remove_edge(Edge* edge, EdgeList* edges) { in remove_edge()
838 void insert_edge(Edge* edge, Edge* prev, EdgeList* edges) { in insert_edge()
845 void find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { in find_enclosing_edges()
921 void merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c);
923 void rewind(EdgeList* activeEdges, Vertex** current, Vertex* dst, Comparator& c) { in rewind()
943 void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c) { in rewind_if_necessary()
980 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_top()
989 void set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_bottom()
[all …]
/external/llvm-project/llvm/lib/Target/X86/
DImmutableGraph.h308 using EdgeList = std::vector<BuilderEdge>; variable
309 using BuilderVertex = std::pair<node_value_type, EdgeList>;
316 auto I = AdjList.emplace(AdjList.end(), V, EdgeList{}); in addVertex()
/external/llvm/lib/Analysis/
DCFLGraph.h45 typedef std::vector<Edge> EdgeList; typedef
48 EdgeList Edges;
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DCFLGraph.h66 using EdgeList = std::vector<Edge>; variable
69 EdgeList Edges, ReverseEdges;
/external/llvm-project/llvm/lib/Analysis/
DCFLGraph.h66 using EdgeList = std::vector<Edge>; variable
69 EdgeList Edges, ReverseEdges;
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DPGOInstrumentation.cpp725 std::vector<Edge *> EdgeList; in getInstrumentBBs() local
726 EdgeList.reserve(MST.AllEdges.size()); in getInstrumentBBs()
728 EdgeList.push_back(E.get()); in getInstrumentBBs()
730 for (auto &E : EdgeList) { in getInstrumentBBs()
/external/llvm-project/llvm/lib/Transforms/Instrumentation/
DPGOInstrumentation.cpp754 std::vector<Edge *> EdgeList; in getInstrumentBBs() local
755 EdgeList.reserve(MST.AllEdges.size()); in getInstrumentBBs()
757 EdgeList.push_back(E.get()); in getInstrumentBBs()
759 for (auto &E : EdgeList) { in getInstrumentBBs()