Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/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.cpp4179 template<> struct GraphTraits< struct
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DBlockFrequencyInfo.cpp99 struct GraphTraits<BlockFrequencyInfo *> { struct
100 using NodeRef = const BasicBlock *;
101 using ChildIteratorType = const_succ_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()
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.cpp688 template <> struct GraphTraits<IrreducibleGraph> { struct
689 using GraphT = bfi_detail::IrreducibleGraph;
690 using NodeRef = const GraphT::IrrNode *;
691 using ChildIteratorType = GraphT::IrrNode::iterator;
693 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
694 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
695 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
H A DMemorySSA.cpp2233 struct GraphTraits<DOTFuncMSSAInfo *> : public GraphTraits<const BasicBlock *> { struct
2234 static NodeRef getEntryNode(DOTFuncMSSAInfo *CFGInfo) { in getEntryNode()
2239 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2241 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2245 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2249 static size_t size(DOTFuncMSSAInfo *CFGInfo) { in size()
/freebsd-14.2/contrib/llvm-project/clang/lib/Serialization/
H A DModuleManager.cpp461 struct GraphTraits<ModuleManager> { struct
462 using NodeRef = ModuleFile *;
463 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
464 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
466 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
470 static ChildIteratorType child_end(NodeRef Node) { in child_end()
474 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
478 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
/freebsd-14.2/contrib/llvm-project/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
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp276 struct GraphTraits<DotFuncBCIInfo *> : public GraphTraits<const BasicBlock *> { struct
277 static NodeRef getEntryNode(DotFuncBCIInfo *Info) { in getEntryNode()
282 using nodes_iterator = pointer_iterator<Function::const_iterator>;
284 static nodes_iterator nodes_begin(DotFuncBCIInfo *Info) { in nodes_begin()
288 static nodes_iterator nodes_end(DotFuncBCIInfo *Info) { in nodes_end()
292 static size_t size(DotFuncBCIInfo *Info) { in size()
H A DPGOInstrumentation.cpp2243 template <> struct GraphTraits<PGOUseFunc *> { struct
2244 using NodeRef = const BasicBlock *;
2245 using ChildIteratorType = const_succ_iterator;
2246 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2248 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2252 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2256 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2258 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2262 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp587 template <> struct GraphTraits<ArgumentGraphNode *> { struct
588 using NodeRef = ArgumentGraphNode *;
589 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
591 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
592 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
593 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
597 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
598 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
600 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
604 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
H A DMemProfContextDisambiguation.cpp2202 struct GraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> { struct
2203 using GraphType = const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *;
2204 using NodeRef = const ContextNode<DerivedCCG, FuncTy, CallTy> *;
2206 using NodePtrTy = std::unique_ptr<ContextNode<DerivedCCG, FuncTy, CallTy>>;
2207 static NodeRef getNode(const NodePtrTy &P) { return P.get(); } in getNode()
2209 using nodes_iterator =
2213 static nodes_iterator nodes_begin(GraphType G) { in nodes_begin()
2217 static nodes_iterator nodes_end(GraphType G) { in nodes_end()
2221 static NodeRef getEntryNode(GraphType G) { in getEntryNode()
2246 struct DOTGraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> argument
[all …]
H A DAttributor.cpp4130 template <> struct GraphTraits<AADepGraphNode *> { struct
4131 using NodeRef = AADepGraphNode *;
4132 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
4133 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
4135 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
4136 static NodeRef DepGetVal(const DepTy &DT) { return DT.getPointer(); } in DepGetVal()
4138 using ChildIteratorType =
4140 using ChildEdgeIteratorType = AADepGraphNode::DepSetTy::iterator;
4148 struct GraphTraits<AADepGraph *> : public GraphTraits<AADepGraphNode *> { struct
4151 using nodes_iterator =
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp2023 template <> struct GraphTraits<DotCfgDiffDisplayGraph *> { struct
2024 using NodeRef = const DisplayNode *;
2025 using ChildIteratorType = DisplayNode::ChildIterator;
2026 using nodes_iterator = DotCfgDiffDisplayGraph::NodeIterator;
2027 using EdgeRef = const DisplayEdge *;
2028 using ChildEdgeIterator = DisplayNode::EdgeIterator;
2030 static NodeRef getEntryNode(const DotCfgDiffDisplayGraph *G) { in getEntryNode()
2033 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
2037 static nodes_iterator nodes_begin(const DotCfgDiffDisplayGraph *G) { in nodes_begin()
2040 static nodes_iterator nodes_end(const DotCfgDiffDisplayGraph *G) { in nodes_end()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp246 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; struct
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroFrame.cpp435 template <> struct GraphTraits<RematGraph *> { struct
436 using NodeRef = RematGraph::RematNode *;
437 using ChildIteratorType = RematGraph::RematNode **;
439 static NodeRef getEntryNode(RematGraph *G) { return G->EntryNode; } in getEntryNode()
440 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
443 static ChildIteratorType child_end(NodeRef N) { return N->Operands.end(); } in child_end()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp188 struct GraphTraits<MachineGadgetGraph *> struct
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp3595 template <> struct GraphTraits<BoUpSLP *> { struct
3596 using TreeEntry = BoUpSLP::TreeEntry;
3599 using NodeRef = TreeEntry *;
3601 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;
3605 struct ChildIteratorType
3617 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()
3621 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
3625 static ChildIteratorType child_end(NodeRef N) { in child_end()
3631 class nodes_iterator {
3645 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
[all …]