Searched defs:GraphTraits (Results 1 – 12 of 12) sorted by relevance
88 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct89 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()
3679 template<> struct GraphTraits< struct
99 struct GraphTraits<BlockFrequencyInfo *> { struct100 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()
666 template <> struct GraphTraits<IrreducibleGraph> { struct667 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()
35 struct GraphTraits { struct101 // Provide a partial specialization of GraphTraits so that the inverse of an argument
40 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering() typedef63 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering() typedef
46 typedef graph_traits< VertexListGraph > GraphTraits; in sequential_vertex_coloring() typedef
137 typedef graph_traits< Graph > GraphTraits; in rec_two_graphs_common_spanning_trees() typedef583 typedef graph_traits< Graph > GraphTraits; in two_graphs_common_spanning_trees() typedef831 typedef graph_traits< Graph > GraphTraits; in two_graphs_common_spanning_trees() typedef
422 template <> struct GraphTraits<ArgumentGraphNode *> { struct423 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 *> { struct433 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()
1751 template <> struct GraphTraits<PGOUseFunc *> { struct1752 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()
43 typedef graph_traits< MutableGraph > GraphTraits; in modify_demo() typedef
2232 template <> struct GraphTraits<BoUpSLP *> { struct2233 using TreeEntry = BoUpSLP::TreeEntry;2236 using NodeRef = TreeEntry *;2238 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;2242 struct ChildIteratorType2254 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()2258 static ChildIteratorType child_begin(NodeRef N) { in child_begin()2262 static ChildIteratorType child_end(NodeRef N) { in child_end()2268 class nodes_iterator {2282 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()[all …]