Searched defs:GraphTraits (Results 1 – 10 of 10) sorted by relevance
54 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct55 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()
3472 template<> struct GraphTraits< struct
62 struct GraphTraits<BlockFrequencyInfo *> { struct63 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()
622 template <> struct GraphTraits<IrreducibleGraph> { struct623 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()
436 struct GraphTraits<ModuleManager> { struct437 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()
27 struct GraphTraits { struct60 typedef typename GraphType::UnknownGraphTypeError NodeType;
27 struct GraphTraits { struct57 typedef typename GraphType::UnknownGraphTypeError NodeType;
233 struct GraphTraits<Graph<N> > { struct234 typedef typename Graph<N>::NodeType NodeType;235 typedef typename Graph<N>::ChildIterator ChildIteratorType;237 static inline NodeType *getEntryNode(const Graph<N> &G) { return G.AccessNode(0); } in getEntryNode()238 static inline ChildIteratorType child_begin(NodeType *Node) { in child_begin()241 static inline ChildIteratorType child_end(NodeType *Node) { in child_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()
333 template <> struct GraphTraits<ArgumentGraphNode *> { struct334 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 *> { struct347 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()