| /openbsd-src/gnu/llvm/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 | 3899 template<> struct GraphTraits< struct
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfo.cpp | 100 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 D | CallPrinter.cpp | 116 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 D | BlockFrequencyInfoImpl.cpp | 696 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 D | MemorySSA.cpp | 2250 struct GraphTraits<DOTFuncMSSAInfo *> : public GraphTraits<const BasicBlock *> { struct
2251 static NodeRef getEntryNode(DOTFuncMSSAInfo *CFGInfo) { in getEntryNode()
2256 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2258 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2262 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2266 static size_t size(DOTFuncMSSAInfo *CFGInfo) { in size()
|
| /openbsd-src/gnu/llvm/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 475 struct GraphTraits<ModuleManager> { struct
476 using NodeRef = ModuleFile *;
477 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
478 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
480 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
484 static ChildIteratorType child_end(NodeRef Node) { in child_end()
488 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
492 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
|
| /openbsd-src/gnu/llvm/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
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/IPO/ |
| H A D | FunctionAttrs.cpp | 555 template <> struct GraphTraits<ArgumentGraphNode *> { struct
556 using NodeRef = ArgumentGraphNode *;
557 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
559 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
560 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
561 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
565 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
566 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
568 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
572 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| H A D | Attributor.cpp | 3694 template <> struct GraphTraits<AADepGraphNode *> { struct
3695 using NodeRef = AADepGraphNode *;
3696 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
3697 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
3699 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
3700 static NodeRef DepGetVal(DepTy &DT) { return DT.getPointer(); } in DepGetVal()
3702 using ChildIteratorType =
3704 using ChildEdgeIteratorType = TinyPtrVector<DepTy>::iterator;
3706 static ChildIteratorType child_begin(NodeRef N) { return N->child_begin(); } in child_begin()
3708 static ChildIteratorType child_end(NodeRef N) { return N->child_end(); } in child_end()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Passes/ |
| H A D | StandardInstrumentations.cpp | 1769 template <> struct GraphTraits<DotCfgDiffDisplayGraph *> { struct
1770 using NodeRef = const DisplayNode *;
1771 using ChildIteratorType = DisplayNode::ChildIterator;
1772 using nodes_iterator = DotCfgDiffDisplayGraph::NodeIterator;
1773 using EdgeRef = const DisplayEdge *;
1774 using ChildEdgeIterator = DisplayNode::EdgeIterator;
1776 static NodeRef getEntryNode(const DotCfgDiffDisplayGraph *G) { in getEntryNode()
1779 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
1782 static ChildIteratorType child_end(NodeRef N) { return N->children_end(); } in child_end()
1783 static nodes_iterator nodes_begin(const DotCfgDiffDisplayGraph *G) { in nodes_begin()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 2350 template <> struct GraphTraits<PGOUseFunc *> { struct
2351 using NodeRef = const BasicBlock *;
2352 using ChildIteratorType = const_succ_iterator;
2353 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2355 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2359 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2363 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2365 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2369 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 249 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; struct
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 189 struct GraphTraits<MachineGadgetGraph *> struct
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 3451 template <> struct GraphTraits<BoUpSLP *> { struct
3452 using TreeEntry = BoUpSLP::TreeEntry;
3455 using NodeRef = TreeEntry *;
3457 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;
3461 struct ChildIteratorType
3473 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()
3477 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
3481 static ChildIteratorType child_end(NodeRef N) { in child_end()
3487 class nodes_iterator {
3501 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
[all …]
|