Home
last modified time | relevance | path

Searched defs:GraphTraits (Results 1 – 8 of 8) sorted by relevance

/external/llvm/lib/CodeGen/
DMachineBlockFrequencyInfo.cpp53 struct GraphTraits<MachineBlockFrequencyInfo *> { struct
54 typedef const MachineBasicBlock NodeType;
55 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
56 typedef MachineFunction::const_iterator nodes_iterator;
59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
63 static ChildIteratorType child_begin(const NodeType *N) { in child_begin()
67 static ChildIteratorType child_end(const NodeType *N) { in child_end()
71 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
75 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
DMachineScheduler.cpp3332 template<> struct GraphTraits< struct
/external/llvm/lib/Analysis/
DBlockFrequencyInfo.cpp52 struct GraphTraits<BlockFrequencyInfo *> { struct
53 typedef const BasicBlock NodeType;
54 typedef succ_const_iterator ChildIteratorType;
55 typedef Function::const_iterator nodes_iterator;
57 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
60 static ChildIteratorType child_begin(const NodeType *N) { in child_begin()
63 static ChildIteratorType child_end(const NodeType *N) { in child_end()
66 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
69 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
DBlockFrequencyInfoImpl.cpp596 template <> struct GraphTraits<IrreducibleGraph> { struct
597 typedef bfi_detail::IrreducibleGraph GraphT;
599 typedef const GraphT::IrrNode NodeType;
600 typedef GraphT::IrrNode::iterator ChildIteratorType;
602 static const NodeType *getEntryNode(const GraphT &G) { in getEntryNode()
605 static ChildIteratorType child_begin(NodeType *N) { return N->succ_begin(); } in child_begin()
606 static ChildIteratorType child_end(NodeType *N) { return N->succ_end(); } in child_end()
/external/clang/lib/Serialization/
DModuleManager.cpp436 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/
DGraphTraits.h27 struct GraphTraits { struct
60 typedef typename GraphType::UnknownGraphTypeError NodeType;
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp231 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/
DFunctionAttrs.cpp379 template <> struct GraphTraits<ArgumentGraphNode *> { struct
380 typedef ArgumentGraphNode NodeType;
381 typedef SmallVectorImpl<ArgumentGraphNode *>::iterator ChildIteratorType;
383 static inline NodeType *getEntryNode(NodeType *A) { return A; } in getEntryNode()
384 static inline ChildIteratorType child_begin(NodeType *N) { in child_begin()
387 static inline ChildIteratorType child_end(NodeType *N) { in child_end()
392 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
393 static NodeType *getEntryNode(ArgumentGraph *AG) { in getEntryNode()
396 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
399 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()