| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineBlockFrequencyInfo.cpp | 90 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 D | MachineScheduler.cpp | 4373 template<> struct GraphTraits< struct
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfo.cpp | 99 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 D | CallPrinter.cpp | 117 struct GraphTraits<CallGraphDOTInfo *> struct
119 static NodeRef getEntryNode(CallGraphDOTInfo *CGInfo) { in getEntryNode()
125 PairTy;
126 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
132 nodes_iterator;
134 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
137 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
|
| H A D | BlockFrequencyInfoImpl.cpp | 673 template <> struct GraphTraits<IrreducibleGraph> { struct
674 using GraphT = bfi_detail::IrreducibleGraph;
675 using NodeRef = const GraphT::IrrNode *;
676 using ChildIteratorType = GraphT::IrrNode::iterator;
678 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
679 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
680 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
|
| H A D | MemorySSA.cpp | 2296 struct GraphTraits<DOTFuncMSSAInfo *> : public GraphTraits<const BasicBlock *> { struct
2297 static NodeRef getEntryNode(DOTFuncMSSAInfo *CFGInfo) { in getEntryNode()
2302 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2304 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2308 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2312 static size_t size(DOTFuncMSSAInfo *CFGInfo) { in size()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | GraphTraits.h | 37 struct GraphTraits { struct
103 // Provide a partial specialization of GraphTraits so that the inverse of an argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | BlockCoverageInference.cpp | 276 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 D | PGOInstrumentation.cpp | 2347 template <> struct GraphTraits<PGOUseFunc *> { struct
2348 using NodeRef = const BasicBlock *;
2349 using ChildIteratorType = const_succ_iterator;
2350 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2352 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2356 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2360 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2362 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2366 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | FunctionAttrs.cpp | 587 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 D | MemProfContextDisambiguation.cpp | 2326 struct GraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> { struct
2327 using GraphType = const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *;
2328 using NodeRef = const ContextNode<DerivedCCG, FuncTy, CallTy> *;
2330 using NodePtrTy = std::unique_ptr<ContextNode<DerivedCCG, FuncTy, CallTy>>;
2331 static NodeRef getNode(const NodePtrTy &P) { return P.get(); } in getNode()
2333 using nodes_iterator =
2337 static nodes_iterator nodes_begin(GraphType G) { in nodes_begin()
2341 static nodes_iterator nodes_end(GraphType G) { in nodes_end()
2345 static NodeRef getEntryNode(GraphType G) { in getEntryNode()
2370 struct DOTGraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> argument
[all …]
|
| H A D | Attributor.cpp | 4135 template <> struct GraphTraits<AADepGraphNode *> { struct
4136 using NodeRef = AADepGraphNode *;
4137 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
4138 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
4140 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
4141 static NodeRef DepGetVal(const DepTy &DT) { return DT.getPointer(); } in DepGetVal()
4143 using ChildIteratorType =
4145 using ChildEdgeIteratorType = AADepGraphNode::DepSetTy::iterator;
4147 static ChildIteratorType child_begin(NodeRef N) { return N->child_begin(); } in child_begin()
4149 static ChildIteratorType child_end(NodeRef N) { return N->child_end(); } in child_end()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Passes/ |
| H A D | StandardInstrumentations.cpp | 2115 template <> struct GraphTraits<DotCfgDiffDisplayGraph *> { struct
2116 using NodeRef = const DisplayNode *;
2117 using ChildIteratorType = DisplayNode::ChildIterator;
2118 using nodes_iterator = DotCfgDiffDisplayGraph::NodeIterator;
2119 using EdgeRef = const DisplayEdge *;
2120 using ChildEdgeIterator = DisplayNode::EdgeIterator;
2122 static NodeRef getEntryNode(const DotCfgDiffDisplayGraph *G) { in getEntryNode()
2125 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
2128 static ChildIteratorType child_end(NodeRef N) { return N->children_end(); } in child_end()
2129 static nodes_iterator nodes_begin(const DotCfgDiffDisplayGraph *G) { in nodes_begin()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 249 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; global() struct
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroFrame.cpp | 438 template <> struct GraphTraits<RematGraph *> { struct
439 using NodeRef = RematGraph::RematNode *;
440 using ChildIteratorType = RematGraph::RematNode **;
442 static NodeRef getEntryNode(RematGraph *G) { return G->EntryNode; } in getEntryNode()
443 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
446 static ChildIteratorType child_end(NodeRef N) { return N->Operands.end(); } in child_end()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 188 struct GraphTraits<MachineGadgetGraph *> struct
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 4026 template <> struct GraphTraits<BoUpSLP *> { struct
4027 TreeEntryllvm::GraphTraits global() argument
4030 NodeRefllvm::GraphTraits global() argument
4032 ContainerTyllvm::GraphTraits global() argument
4036 ChildIteratorTypellvm::GraphTraits global() argument
4048 getEntryNodellvm::GraphTraits getEntryNode() argument
4052 child_beginllvm::GraphTraits child_begin() argument
4056 child_endllvm::GraphTraits child_end() argument
4062 nodes_iteratorllvm::GraphTraits global() argument
4076 nodes_beginllvm::GraphTraits nodes_begin() argument
4080 nodes_endllvm::GraphTraits nodes_end() argument
4084 sizellvm::GraphTraits size() argument
|