| /external/llvm-project/llvm/unittests/ADT/ |
| D | DirectedGraphTest.cpp | 55 template <> struct GraphTraits<DGTestNode *> { struct
56 using NodeRef = DGTestNode *;
58 static DGTestNode *DGTestGetTargetNode(DGEdge<DGTestNode, DGTestEdge> *P) { in DGTestGetTargetNode()
64 using ChildIteratorType =
66 using ChildEdgeIteratorType = DGTestNode::iterator;
68 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
69 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
72 static ChildIteratorType child_end(NodeRef N) { in child_end()
76 static ChildEdgeIteratorType child_edge_begin(NodeRef N) { in child_edge_begin()
79 static ChildEdgeIteratorType child_edge_end(NodeRef N) { return N->end(); } in child_edge_end()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineBlockFrequencyInfo.cpp | 54 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct
55 typedef const MachineBasicBlock NodeType;
56 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
57 typedef MachineFunction::const_iterator nodes_iterator;
60 getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
64 static ChildIteratorType child_begin(const NodeType *N) { in child_begin()
68 static ChildIteratorType child_end(const NodeType *N) { in child_end()
72 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
76 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
|
| /external/llvm-project/mlir/lib/Transforms/ |
| D | ViewOpGraph.cpp | 30 template <> struct GraphTraits<Block *> { struct
31 using GraphType = Block *;
32 using NodeRef = Operation *;
34 using ChildIteratorType = Operation::user_iterator;
35 static ChildIteratorType child_begin(NodeRef n) { return n->user_begin(); } in child_begin()
36 static ChildIteratorType child_end(NodeRef n) { return n->user_end(); } in child_end()
40 static Operation *AddressOf(Operation &op) { return &op; } in AddressOf()
41 using nodes_iterator = mapped_iterator<Block::iterator, decltype(&AddressOf)>;
42 static nodes_iterator nodes_begin(Block *b) { in nodes_begin()
45 static nodes_iterator nodes_end(Block *b) { in nodes_end()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | MachineBlockFrequencyInfo.cpp | 88 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct
89 using NodeRef = const MachineBasicBlock *;
90 using ChildIteratorType = MachineBasicBlock::const_succ_iterator;
91 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
93 static NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
97 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
101 static ChildIteratorType child_end(const NodeRef N) { return N->succ_end(); } in child_end()
103 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
107 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | MachineBlockFrequencyInfo.cpp | 88 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct
89 using NodeRef = const MachineBasicBlock *;
90 using ChildIteratorType = MachineBasicBlock::const_succ_iterator;
91 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
93 static NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
97 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
101 static ChildIteratorType child_end(const NodeRef N) { return N->succ_end(); } in child_end()
103 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
107 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
|
| /external/llvm/lib/Analysis/ |
| D | BlockFrequencyInfo.cpp | 62 struct GraphTraits<BlockFrequencyInfo *> { struct
63 typedef const BasicBlock NodeType;
64 typedef succ_const_iterator ChildIteratorType;
65 typedef Function::const_iterator nodes_iterator;
67 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
70 static ChildIteratorType child_begin(const NodeType *N) { in child_begin()
73 static ChildIteratorType child_end(const NodeType *N) { in child_end()
76 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
79 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
|
| D | BlockFrequencyInfoImpl.cpp | 622 template <> struct GraphTraits<IrreducibleGraph> { struct
623 typedef bfi_detail::IrreducibleGraph GraphT;
625 typedef const GraphT::IrrNode NodeType;
626 typedef GraphT::IrrNode::iterator ChildIteratorType;
628 static const NodeType *getEntryNode(const GraphT &G) { in getEntryNode()
631 static ChildIteratorType child_begin(NodeType *N) { return N->succ_begin(); } in child_begin()
632 static ChildIteratorType child_end(NodeType *N) { return N->succ_end(); } in child_end()
|
| /external/llvm-project/polly/lib/Analysis/ |
| D | ScopGraphPrinter.cpp | 37 struct GraphTraits<ScopDetection *> : public GraphTraits<RegionInfo *> { struct
38 static NodeRef getEntryNode(ScopDetection *SD) { in getEntryNode()
41 static nodes_iterator nodes_begin(ScopDetection *SD) { in nodes_begin()
44 static nodes_iterator nodes_end(ScopDetection *SD) { in nodes_end()
50 struct GraphTraits<ScopDetectionWrapperPass *> struct
52 static NodeRef getEntryNode(ScopDetectionWrapperPass *P) { in getEntryNode()
55 static nodes_iterator nodes_begin(ScopDetectionWrapperPass *P) { in nodes_begin()
58 static nodes_iterator nodes_end(ScopDetectionWrapperPass *P) { in nodes_end()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | BlockFrequencyInfo.cpp | 99 struct GraphTraits<BlockFrequencyInfo *> { struct
100 using NodeRef = const BasicBlock *;
101 using ChildIteratorType = succ_const_iterator;
102 using nodes_iterator = pointer_iterator<Function::const_iterator>;
104 static NodeRef getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
108 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
112 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
114 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
118 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
|
| D | BlockFrequencyInfoImpl.cpp | 666 template <> struct GraphTraits<IrreducibleGraph> { struct
667 using GraphT = bfi_detail::IrreducibleGraph;
668 using NodeRef = const GraphT::IrrNode *;
669 using ChildIteratorType = GraphT::IrrNode::iterator;
671 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
672 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
673 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | BlockFrequencyInfo.cpp | 99 struct GraphTraits<BlockFrequencyInfo *> { struct
100 using NodeRef = const BasicBlock *;
101 using ChildIteratorType = const_succ_iterator;
102 using nodes_iterator = pointer_iterator<Function::const_iterator>;
104 static NodeRef getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
108 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
112 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
114 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
118 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
|
| D | CallPrinter.cpp | 111 struct GraphTraits<CallGraphDOTInfo *> struct
113 static NodeRef getEntryNode(CallGraphDOTInfo *CGInfo) { in getEntryNode()
119 PairTy;
120 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
126 nodes_iterator;
128 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
131 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
|
| D | BlockFrequencyInfoImpl.cpp | 681 template <> struct GraphTraits<IrreducibleGraph> { struct
682 using GraphT = bfi_detail::IrreducibleGraph;
683 using NodeRef = const GraphT::IrrNode *;
684 using ChildIteratorType = GraphT::IrrNode::iterator;
686 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
687 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
688 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 436 struct GraphTraits<ModuleManager> { struct
437 typedef ModuleFile NodeType;
438 typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;
439 typedef ModuleManager::ModuleConstIterator nodes_iterator;
441 static ChildIteratorType child_begin(NodeType *Node) { in child_begin()
445 static ChildIteratorType child_end(NodeType *Node) { in child_end()
449 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
453 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
|
| /external/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 27 struct GraphTraits { struct
60 typedef typename GraphType::UnknownGraphTypeError NodeType;
|
| /external/llvm-project/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 35 struct GraphTraits { struct
101 // Provide a partial specialization of GraphTraits so that the inverse of an argument
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 35 struct GraphTraits { struct
101 // Provide a partial specialization of GraphTraits so that the inverse of an argument
|
| /external/llvm-project/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 491 struct GraphTraits<ModuleManager> { struct
492 using NodeRef = ModuleFile *;
493 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
494 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
496 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
500 static ChildIteratorType child_end(NodeRef Node) { in child_end()
504 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
508 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 231 struct GraphTraits<Graph<N> > { struct
232 typedef typename Graph<N>::NodeType NodeType;
233 typedef typename Graph<N>::ChildIterator ChildIteratorType;
235 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } in getEntryNode()
236 static inline ChildIteratorType child_begin(NodeType *Node) { in child_begin()
239 static inline ChildIteratorType child_end(NodeType *Node) { in child_end()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 333 template <> struct GraphTraits<ArgumentGraphNode *> { struct
334 typedef ArgumentGraphNode NodeType;
335 typedef SmallVectorImpl<ArgumentGraphNode *>::iterator ChildIteratorType;
337 static inline NodeType *getEntryNode(NodeType *A) { return A; } in getEntryNode()
338 static inline ChildIteratorType child_begin(NodeType *N) { in child_begin()
341 static inline ChildIteratorType child_end(NodeType *N) { in child_end()
346 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
347 static NodeType *getEntryNode(ArgumentGraph *AG) { in getEntryNode()
350 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
353 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| /external/llvm-project/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 423 template <> struct GraphTraits<ArgumentGraphNode *> { struct
424 using NodeRef = ArgumentGraphNode *;
425 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
427 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
428 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
429 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
433 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
434 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
436 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
440 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| D | Attributor.cpp | 2428 template <> struct GraphTraits<AADepGraphNode *> { struct
2429 using NodeRef = AADepGraphNode *;
2430 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
2431 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
2433 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
2434 static NodeRef DepGetVal(DepTy &DT) { return DT.getPointer(); } in DepGetVal()
2436 using ChildIteratorType =
2438 using ChildEdgeIteratorType = TinyPtrVector<DepTy>::iterator;
2440 static ChildIteratorType child_begin(NodeRef N) { return N->child_begin(); } in child_begin()
2442 static ChildIteratorType child_end(NodeRef N) { return N->child_end(); } in child_end()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 422 template <> struct GraphTraits<ArgumentGraphNode *> { struct
423 using NodeRef = ArgumentGraphNode *;
424 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
426 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
427 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
428 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
432 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
433 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
435 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
439 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | PGOInstrumentation.cpp | 1751 template <> struct GraphTraits<PGOUseFunc *> { struct
1752 using NodeRef = const BasicBlock *;
1753 using ChildIteratorType = succ_const_iterator;
1754 using nodes_iterator = pointer_iterator<Function::const_iterator>;
1756 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
1760 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
1764 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
1766 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
1770 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|
| /external/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| D | PGOInstrumentation.cpp | 1878 template <> struct GraphTraits<PGOUseFunc *> { struct
1879 using NodeRef = const BasicBlock *;
1880 using ChildIteratorType = const_succ_iterator;
1881 using nodes_iterator = pointer_iterator<Function::const_iterator>;
1883 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
1887 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
1891 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
1893 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
1897 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|