Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp55 template <> struct GraphTraits<DGTestNode *> { struct
56 using NodeRef = DGTestNode *;
64 using ChildIteratorType =
66 using ChildEdgeIteratorType = DGTestNode::iterator;
68 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
69 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
72 static ChildIteratorType child_end(NodeRef N) { in child_end()
76 static ChildEdgeIteratorType child_edge_begin(NodeRef N) { in child_edge_begin()
83 struct GraphTraits<DGTestGraph *> : public GraphTraits<DGTestNode *> { struct
84 using nodes_iterator = DGTestGraph::iterator;
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp90 template <> struct GraphTraits<MachineBlockFrequencyInfo *> { struct
91 using NodeRef = const MachineBasicBlock *;
92 using ChildIteratorType = MachineBasicBlock::const_succ_iterator;
93 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
95 static NodeRef getEntryNode(const MachineBlockFrequencyInfo *G) { in getEntryNode()
99 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
103 static ChildIteratorType child_end(const NodeRef N) { return N->succ_end(); } in child_end()
105 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
109 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
H A DMachineScheduler.cpp3869 template<> struct GraphTraits< struct
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DBlockFrequencyInfo.cpp100 struct GraphTraits<BlockFrequencyInfo *> { struct
101 using NodeRef = const BasicBlock *;
102 using ChildIteratorType = const_succ_iterator;
103 using nodes_iterator = pointer_iterator<Function::const_iterator>;
105 static NodeRef getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
109 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
113 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
115 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
119 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
H A DCallPrinter.cpp116 struct GraphTraits<CallGraphDOTInfo *> struct
118 static NodeRef getEntryNode(CallGraphDOTInfo *CGInfo) { in getEntryNode()
124 PairTy;
125 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
131 nodes_iterator;
133 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
136 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
H A DBlockFrequencyInfoImpl.cpp696 template <> struct GraphTraits<IrreducibleGraph> { struct
697 using GraphT = bfi_detail::IrreducibleGraph;
698 using NodeRef = const GraphT::IrrNode *;
699 using ChildIteratorType = GraphT::IrrNode::iterator;
701 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
702 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
703 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
H A DMemorySSA.cpp2299 struct GraphTraits<DOTFuncMSSAInfo *> : public GraphTraits<const BasicBlock *> { struct
2300 static NodeRef getEntryNode(DOTFuncMSSAInfo *CFGInfo) { in getEntryNode()
2305 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2307 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2311 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2315 static size_t size(DOTFuncMSSAInfo *CFGInfo) { in size()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGraphTraits.h37 struct GraphTraits { struct
103 // Provide a partial specialization of GraphTraits so that the inverse of an argument
/llvm-project-15.0.7/clang/lib/Serialization/
H A DModuleManager.cpp484 struct GraphTraits<ModuleManager> { struct
485 using NodeRef = ModuleFile *;
486 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
487 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
489 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
493 static ChildIteratorType child_end(NodeRef Node) { in child_end()
497 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
501 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp642 template <> struct GraphTraits<ArgumentGraphNode *> { struct
643 using NodeRef = ArgumentGraphNode *;
644 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
646 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
647 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
648 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
652 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
653 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
655 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
659 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
H A DAttributor.cpp3435 template <> struct GraphTraits<AADepGraphNode *> { struct
3436 using NodeRef = AADepGraphNode *;
3437 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
3438 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
3440 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
3441 static NodeRef DepGetVal(DepTy &DT) { return DT.getPointer(); } in DepGetVal()
3443 using ChildIteratorType =
3445 using ChildEdgeIteratorType = TinyPtrVector<DepTy>::iterator;
3453 struct GraphTraits<AADepGraph *> : public GraphTraits<AADepGraphNode *> { struct
3456 using nodes_iterator =
[all …]
/llvm-project-15.0.7/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1746 template <> struct GraphTraits<DotCfgDiffDisplayGraph *> { struct
1747 using NodeRef = const DisplayNode *;
1748 using ChildIteratorType = DisplayNode::ChildIterator;
1749 using nodes_iterator = DotCfgDiffDisplayGraph::NodeIterator;
1750 using EdgeRef = const DisplayEdge *;
1751 using ChildEdgeIterator = DisplayNode::EdgeIterator;
1753 static NodeRef getEntryNode(const DotCfgDiffDisplayGraph *G) { in getEntryNode()
1756 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
1760 static nodes_iterator nodes_begin(const DotCfgDiffDisplayGraph *G) { in nodes_begin()
1763 static nodes_iterator nodes_end(const DotCfgDiffDisplayGraph *G) { in nodes_end()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp2017 template <> struct GraphTraits<PGOUseFunc *> { struct
2018 using NodeRef = const BasicBlock *;
2019 using ChildIteratorType = const_succ_iterator;
2020 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2022 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2026 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2030 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2032 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2036 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp249 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; struct
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp189 struct GraphTraits<MachineGadgetGraph *> struct
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp3253 template <> struct GraphTraits<BoUpSLP *> { struct
3254 using TreeEntry = BoUpSLP::TreeEntry;
3257 using NodeRef = TreeEntry *;
3259 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;
3263 struct ChildIteratorType
3275 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()
3279 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
3283 static ChildIteratorType child_end(NodeRef N) { in child_end()
3289 class nodes_iterator {
3303 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
[all …]