| /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()
|
| D | MachineScheduler.cpp | 3472 template<> struct GraphTraits< struct
|
| /external/swiftshader/third_party/llvm-7.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()
|
| D | MachineScheduler.cpp | 3562 template<> struct GraphTraits< struct
|
| /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/swiftshader/third_party/llvm-7.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 | 662 template <> struct GraphTraits<IrreducibleGraph> { struct
663 using GraphT = bfi_detail::IrreducibleGraph;
664 using NodeRef = const GraphT::IrrNode *;
665 using ChildIteratorType = GraphT::IrrNode::iterator;
667 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
668 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
669 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
|
| /external/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 27 struct GraphTraits { struct
60 typedef typename GraphType::UnknownGraphTypeError NodeType;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 29 struct GraphTraits { struct
95 // Provide a partial specialization of GraphTraits so that the inverse of an argument
|
| /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/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/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 381 template <> struct GraphTraits<ArgumentGraphNode *> { struct
382 using NodeRef = ArgumentGraphNode *;
383 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
385 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
386 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
387 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
391 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
392 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
394 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
398 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| D | PGOInstrumentation.cpp | 1631 template <> struct GraphTraits<PGOUseFunc *> { struct
1632 using NodeRef = const BasicBlock *;
1633 using ChildIteratorType = succ_const_iterator;
1634 using nodes_iterator = pointer_iterator<Function::const_iterator>;
1636 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
1640 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
1644 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
1646 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
1650 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 1243 template <> struct GraphTraits<BoUpSLP *> { struct
1244 using TreeEntry = BoUpSLP::TreeEntry;
1247 using NodeRef = TreeEntry *;
1251 struct ChildIteratorType
1263 static NodeRef getEntryNode(BoUpSLP &R) { return &R.VectorizableTree[0]; } in getEntryNode()
1265 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
1269 static ChildIteratorType child_end(NodeRef N) { in child_end()
1275 using nodes_iterator = pointer_iterator<std::vector<TreeEntry>::iterator>;
1277 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
1281 static nodes_iterator nodes_end(BoUpSLP *R) { in nodes_end()
[all …]
|