Searched defs:GraphTraits (Results 1 – 8 of 8) sorted by relevance
53 struct GraphTraits<MachineBlockFrequencyInfo *> { struct54 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()
3240 template<> struct GraphTraits< struct
52 struct GraphTraits<BlockFrequencyInfo *> { struct53 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()
586 template <> struct GraphTraits<IrreducibleGraph> { struct587 typedef bfi_detail::IrreducibleGraph GraphT;589 typedef const GraphT::IrrNode NodeType;590 typedef GraphT::IrrNode::iterator ChildIteratorType;592 static const NodeType *getEntryNode(const GraphT &G) { in getEntryNode()595 static ChildIteratorType child_begin(NodeType *N) { return N->succ_begin(); } in child_begin()596 static ChildIteratorType child_end(NodeType *N) { return N->succ_end(); } in child_end()
27 struct GraphTraits { struct60 typedef typename GraphType::UnknownGraphTypeError NodeType;
465 struct GraphTraits<ModuleManager> { struct466 typedef ModuleFile NodeType;467 typedef llvm::SetVector<ModuleFile *>::const_iterator ChildIteratorType;468 typedef ModuleManager::ModuleConstIterator nodes_iterator;470 static ChildIteratorType child_begin(NodeType *Node) { in child_begin()474 static ChildIteratorType child_end(NodeType *Node) { in child_end()478 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()482 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
231 struct GraphTraits<Graph<N> > { struct232 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()
386 template<> struct GraphTraits<ArgumentGraphNode*> { struct387 typedef ArgumentGraphNode NodeType;388 typedef SmallVectorImpl<ArgumentGraphNode*>::iterator ChildIteratorType;390 static inline NodeType *getEntryNode(NodeType *A) { return A; } in getEntryNode()391 static inline ChildIteratorType child_begin(NodeType *N) { in child_begin()394 static inline ChildIteratorType child_end(NodeType *N) { in child_end()398 template<> struct GraphTraits<ArgumentGraph*> struct400 static NodeType *getEntryNode(ArgumentGraph *AG) { in getEntryNode()403 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()406 static ChildIteratorType nodes_end(ArgumentGraph *AG) { in nodes_end()