Home
last modified time | relevance | path

Searched refs:GraphTraits (Results 1 – 25 of 59) sorted by relevance

123

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DGraphTraits.h35 struct GraphTraits { struct
103 template <class T> struct GraphTraits<Inverse<Inverse<T>>> : GraphTraits<T> {};
107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
109 return make_range(GraphTraits<GraphType>::nodes_begin(G),
110 GraphTraits<GraphType>::nodes_end(G));
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
115 return make_range(GraphTraits<Inverse<GraphType>>::nodes_begin(G),
116 GraphTraits<Inverse<GraphType>>::nodes_end(G));
120 iterator_range<typename GraphTraits<GraphType>::ChildIteratorType>
121 children(const typename GraphTraits<GraphType>::NodeRef &G) {
[all …]
DPostOrderIterator.h93 SmallPtrSet<typename GraphTraits<GraphT>::NodeRef, 8>,
94 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
190 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
212 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>,
235 template <class T, class SetType = std::set<typename GraphTraits<T>::NodeRef>>
286 template<class GraphT, class GT = GraphTraits<GraphT>>
DDepthFirstIterator.h83 df_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
232 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
257 df_iterator_default_set<typename GraphTraits<T>::NodeRef>,
281 template <class T, class SetTy = std::set<typename GraphTraits<T>::NodeRef>>
DBreadthFirstIterator.h45 bf_iterator_default_set<typename GraphTraits<GraphT>::NodeRef>,
46 class GT = GraphTraits<GraphT>>
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionIterator.h42 using BlockTraits = GraphTraits<BlockT *>;
169 using BlockTraits = GraphTraits<BlockT *>;
259 template <> struct GraphTraits<NodeT *> { \
270 template <> struct GraphTraits<FlatIt<NodeT *>> { \
284 template <> struct GraphTraits<RegionT *> : public GraphTraits<NodeT *> { \
297 struct GraphTraits<FlatIt<RegionT *>> \
298 : public GraphTraits<FlatIt<NodeT *>> { \
301 GraphTraits<FlatIt<NodeRef>>>; \
319 template <> struct GraphTraits<RegionInfo*>
320 : public GraphTraits<FlatIt<RegionNode*>> {
[all …]
DCallGraph.h407 template <> struct GraphTraits<CallGraphNode *> {
426 template <> struct GraphTraits<const CallGraphNode *> {
455 struct GraphTraits<CallGraph *> : public GraphTraits<CallGraphNode *> {
481 struct GraphTraits<const CallGraph *> : public GraphTraits<
DLoopInfoImpl.h172 typedef GraphTraits<BlockT *> BlockTraits; in getLoopPreheader()
300 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB), in verifyLoop()
301 GraphTraits<BlockT *>::child_end(BB), in verifyLoop()
305 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
306 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
311 std::for_each(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
312 GraphTraits<Inverse<BlockT *>>::child_end(BB), in verifyLoop()
421 typedef GraphTraits<Inverse<BlockT *>> InvBlockTraits; in discoverAndMapSubloop()
476 typedef GraphTraits<BlockT *> BlockTraits;
DPostDominators.h100 template <> struct GraphTraits<PostDominatorTree*>
101 : public GraphTraits<DomTreeNode*> {
DDDG.h431 template <> struct GraphTraits<DDGNode *> {
459 struct GraphTraits<DataDependenceGraph *> : public GraphTraits<DDGNode *> {
471 template <> struct GraphTraits<const DDGNode *> {
499 struct GraphTraits<const DataDependenceGraph *>
500 : public GraphTraits<const DDGNode *> {
DInterval.h119 template <> struct GraphTraits<Interval*> {
130 template <> struct GraphTraits<Inverse<Interval*>> {
DRegionInfo.h268 using BlockTraits = GraphTraits<BlockT *>;
269 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
644 GraphTraits<RegionNodeT *>>;
649 GraphTraits<const RegionNodeT *>>;
688 using BlockTraits = GraphTraits<BlockT *>;
689 using InvBlockTraits = GraphTraits<Inverse<BlockT *>>;
DDominanceFrontier.h47 using BlockTraits = GraphTraits<BlockT *>;
125 using BlockTraits = GraphTraits<BlockT *>;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h137 struct GraphTraits<MachineRegionInfo *>
138 : public GraphTraits<FlatIt<MachineRegionNode *>> {
140 false, GraphTraits<FlatIt<NodeRef>>>;
143 return GraphTraits<FlatIt<MachineRegion *>>::getEntryNode(
157 struct GraphTraits<MachineRegionInfoPass *>
158 : public GraphTraits<MachineRegionInfo *> {
160 false, GraphTraits<FlatIt<NodeRef>>>;
163 return GraphTraits<MachineRegionInfo *>::getEntryNode(&RI->getRegionInfo());
167 return GraphTraits<MachineRegionInfo *>::nodes_begin(&RI->getRegionInfo());
171 return GraphTraits<MachineRegionInfo *>::nodes_end(&RI->getRegionInfo());
DMachineDominators.h268 template <class T> struct GraphTraits;
271 struct GraphTraits<MachineDomTreeNode *>
276 struct GraphTraits<const MachineDomTreeNode *>
281 template <> struct GraphTraits<MachineDominatorTree*>
282 : public GraphTraits<MachineDomTreeNode *> {
DMachineFunction.h1025 template <> struct GraphTraits<MachineFunction*> :
1026 public GraphTraits<MachineBasicBlock*> {
1042 template <> struct GraphTraits<const MachineFunction*> :
1043 public GraphTraits<const MachineBasicBlock*> {
1067 template <> struct GraphTraits<Inverse<MachineFunction*>> :
1068 public GraphTraits<Inverse<MachineBasicBlock*>> {
1073 template <> struct GraphTraits<Inverse<const MachineFunction*>> :
1074 public GraphTraits<Inverse<const MachineBasicBlock*>> {
DMachineLoopInfo.h176 template <> struct GraphTraits<const MachineLoop*> {
185 template <> struct GraphTraits<MachineLoop*> {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DCFG.h298 template <> struct GraphTraits<BasicBlock*> {
307 template <> struct GraphTraits<const BasicBlock*> {
322 template <> struct GraphTraits<Inverse<BasicBlock*>> {
331 template <> struct GraphTraits<Inverse<const BasicBlock*>> {
348 template <> struct GraphTraits<Function*> : public GraphTraits<BasicBlock*> {
364 template <> struct GraphTraits<const Function*> :
365 public GraphTraits<const BasicBlock*> {
387 template <> struct GraphTraits<Inverse<Function*>> :
388 public GraphTraits<Inverse<BasicBlock*>> {
393 template <> struct GraphTraits<Inverse<const Function*>> :
[all …]
DDominators.h208 struct GraphTraits<DomTreeNode *>
212 struct GraphTraits<const DomTreeNode *>
216 template <> struct GraphTraits<DominatorTree*>
217 : public GraphTraits<DomTreeNode*> {
DCFGDiff.h267 struct GraphTraits<
271 struct GraphTraits<
275 struct GraphTraits<
279 struct GraphTraits<
/third_party/boost/boost/graph/
Dsmallest_last_ordering.hpp40 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering() typedef
41 typedef typename GraphTraits::vertex_descriptor Vertex; in smallest_last_vertex_ordering()
63 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering() typedef
64 typedef typename GraphTraits::vertex_descriptor Vertex; in smallest_last_vertex_ordering()
70 typename GraphTraits::vertex_iterator v, vend; in smallest_last_vertex_ordering()
97 typename GraphTraits::adjacency_iterator v, vend; in smallest_last_vertex_ordering()
Dsequential_vertex_coloring.hpp46 typedef graph_traits< VertexListGraph > GraphTraits; in sequential_vertex_coloring() typedef
47 typedef typename GraphTraits::vertex_descriptor Vertex; in sequential_vertex_coloring()
64 typename GraphTraits::vertex_iterator v, vend; in sequential_vertex_coloring()
72 typename GraphTraits::adjacency_iterator v, vend; in sequential_vertex_coloring()
Dtwo_graphs_common_spanning_trees.hpp137 typedef graph_traits< Graph > GraphTraits; in rec_two_graphs_common_spanning_trees() typedef
139 typedef typename GraphTraits::vertex_descriptor vertex_descriptor; in rec_two_graphs_common_spanning_trees()
140 typedef typename GraphTraits::edge_descriptor edge_descriptor; in rec_two_graphs_common_spanning_trees()
583 typedef graph_traits< Graph > GraphTraits; in two_graphs_common_spanning_trees() typedef
585 typedef typename GraphTraits::directed_category directed_category; in two_graphs_common_spanning_trees()
586 typedef typename GraphTraits::vertex_descriptor vertex_descriptor; in two_graphs_common_spanning_trees()
587 typedef typename GraphTraits::edge_descriptor edge_descriptor; in two_graphs_common_spanning_trees()
589 typedef typename GraphTraits::edges_size_type edges_size_type; in two_graphs_common_spanning_trees()
590 typedef typename GraphTraits::edge_iterator edge_iterator; in two_graphs_common_spanning_trees()
831 typedef graph_traits< Graph > GraphTraits; in two_graphs_common_spanning_trees() typedef
[all …]
/third_party/boost/libs/graph/example/
Dmodify_graph.cpp43 typedef graph_traits< MutableGraph > GraphTraits; in modify_demo() typedef
44 typedef typename GraphTraits::vertices_size_type size_type; in modify_demo()
45 typedef typename GraphTraits::edge_descriptor edge_descriptor; in modify_demo()
47 typename GraphTraits::edges_size_type m = 0; in modify_demo()
48 typename GraphTraits::vertex_descriptor u, v, w; in modify_demo()
53 typename GraphTraits::vertex_iterator vi, vi_end; in modify_demo()
127 typename GraphTraits::out_edge_iterator iter, iter_end; in modify_demo()
143 typename GraphTraits::out_edge_iterator iter, iter_end; in modify_demo()
192 typename GraphTraits::adjacency_iterator ai, ai_end; in modify_demo()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
DVPlanDominatorTree.h32 struct GraphTraits<VPDomTreeNode *>
36 struct GraphTraits<const VPDomTreeNode *>
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/
DType.h35 template<class GraphType> struct GraphTraits;
442 template <> struct GraphTraits<Type *> {
451 template <> struct GraphTraits<const Type*> {

123