Home
last modified time | relevance | path

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

/freebsd/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.cpp4821 template<> struct GraphTraits< struct
/freebsd/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.cpp117 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 DBlockFrequencyInfoImpl.cpp673 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 DMemorySSA.cpp2296 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/clang/lib/Serialization/
H A DModuleManager.cpp464 struct GraphTraits<ModuleManager> { struct
465 using NodeRef = ModuleFile *;
466 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
467 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
469 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
473 static ChildIteratorType child_end(NodeRef Node) { in child_end()
477 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
481 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DMaterializationUtils.cpp141 template <> struct GraphTraits<RematGraph *> { struct
142 using NodeRef = RematGraph::RematNode *;
143 using ChildIteratorType = RematGraph::RematNode **;
145 static NodeRef getEntryNode(RematGraph *G) { return G->EntryNode; } in getEntryNode()
146 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
149 static ChildIteratorType child_end(NodeRef N) { return N->Operands.end(); } in child_end()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h38 struct GraphTraits { struct
100 using has_number_t = decltype(GraphTraits<T>::getNumber( argument
/freebsd/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.cpp2461 template <> struct GraphTraits<PGOUseFunc *> { struct
2462 using NodeRef = const BasicBlock *;
2463 using ChildIteratorType = const_succ_iterator;
2464 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2466 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2470 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2474 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2476 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2480 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSplitModule.cpp1212 template <> struct GraphTraits<SplitGraph> { struct
1213 using NodeRef = const SplitGraph::Node *;
1214 using nodes_iterator = SplitGraph::nodes_iterator;
1215 using ChildIteratorType = SplitGraphEdgeDstIterator;
1217 using EdgeRef = const SplitGraph::Edge *;
1218 using ChildEdgeIteratorType = SplitGraph::edges_iterator;
1220 static NodeRef getEntryNode(NodeRef N) { return N; } in getEntryNode()
1222 static ChildIteratorType child_begin(NodeRef Ref) { in child_begin()
1225 static ChildIteratorType child_end(NodeRef Ref) { in child_end()
1229 static nodes_iterator nodes_begin(const SplitGraph &G) { in nodes_begin()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.cpp1644 template <> struct llvm::GraphTraits<SubRegIndexCompositionGraph> { struct in llvm
1645 using NodeRef =
1650 using CompMapIt = CodeGenSubRegIndex::CompMap::const_reverse_iterator;
1651 struct ChildIteratorType
1662 static NodeRef getEntryNode(const SubRegIndexCompositionGraph &G) { in getEntryNode()
1666 static const CodeGenSubRegIndex::CompMap *children(NodeRef N) { in children()
1672 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
1675 static ChildIteratorType child_end(NodeRef N) { in child_end()
1679 static auto nodes_begin(SubRegIndexCompositionGraph *G) { in nodes_begin()
1682 static auto nodes_end(SubRegIndexCompositionGraph *G) { in nodes_end()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionAttrs.cpp838 template <> struct GraphTraits<ArgumentGraphNode *> { struct
839 using NodeRef = ArgumentGraphNode *;
840 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
842 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
843 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
844 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
848 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
849 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
851 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
855 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
H A DAttributor.cpp4125 template <> struct GraphTraits<AADepGraphNode *> { struct
4126 using NodeRef = AADepGraphNode *;
4127 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
4128 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
4130 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
4131 static NodeRef DepGetVal(const DepTy &DT) { return DT.getPointer(); } in DepGetVal()
4133 using ChildIteratorType =
4135 using ChildEdgeIteratorType = AADepGraphNode::DepSetTy::iterator;
4137 static ChildIteratorType child_begin(NodeRef N) { return N->child_begin(); } in child_begin()
4139 static ChildIteratorType child_end(NodeRef N) { return N->child_end(); } in child_end()
[all …]
H A DMemProfContextDisambiguation.cpp3063 struct GraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> { struct
3064 using GraphType = const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *;
3065 using NodeRef = const ContextNode<DerivedCCG, FuncTy, CallTy> *;
3067 using NodePtrTy = std::unique_ptr<ContextNode<DerivedCCG, FuncTy, CallTy>>;
3068 static NodeRef getNode(const NodePtrTy &P) { return P.get(); } in getNode()
3070 using nodes_iterator =
3074 static nodes_iterator nodes_begin(GraphType G) { in nodes_begin()
3078 static nodes_iterator nodes_end(GraphType G) { in nodes_end()
3082 static NodeRef getEntryNode(GraphType G) { in getEntryNode()
3107 struct DOTGraphTraits<const CallsiteContextGraph<DerivedCCG, FuncTy, CallTy> *> argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp2108 template <> struct GraphTraits<DotCfgDiffDisplayGraph *> { struct
2109 using NodeRef = const DisplayNode *;
2110 using ChildIteratorType = DisplayNode::ChildIterator;
2111 using nodes_iterator = DotCfgDiffDisplayGraph::NodeIterator;
2112 using EdgeRef = const DisplayEdge *;
2113 using ChildEdgeIterator = DisplayNode::EdgeIterator;
2115 static NodeRef getEntryNode(const DotCfgDiffDisplayGraph *G) { in getEntryNode()
2118 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
2121 static ChildIteratorType child_end(NodeRef N) { return N->children_end(); } in child_end()
2122 static nodes_iterator nodes_begin(const DotCfgDiffDisplayGraph *G) { in nodes_begin()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp187 struct GraphTraits<MachineGadgetGraph *> struct
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp5167 template <> struct GraphTraits<BoUpSLP *> { struct
5168 using TreeEntry = BoUpSLP::TreeEntry;
5171 using NodeRef = TreeEntry *;
5173 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;
5177 struct ChildIteratorType
5189 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()
5193 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
5197 static ChildIteratorType child_end(NodeRef N) { in child_end()
5203 class nodes_iterator {
5217 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
[all …]