| /netbsd-src/external/apache2/llvm/dist/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 | 3862 template<> struct GraphTraits< struct
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfo.cpp | 101 struct GraphTraits<BlockFrequencyInfo *> { struct
102 using NodeRef = const BasicBlock *;
103 using ChildIteratorType = const_succ_iterator;
104 using nodes_iterator = pointer_iterator<Function::const_iterator>;
106 static NodeRef getEntryNode(const BlockFrequencyInfo *G) { in getEntryNode()
110 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
114 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
116 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
120 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
|
| H A D | CallPrinter.cpp | 111 struct GraphTraits<CallGraphDOTInfo *> struct
113 static NodeRef getEntryNode(CallGraphDOTInfo *CGInfo) { in getEntryNode()
119 PairTy;
120 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
126 nodes_iterator;
128 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
131 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
|
| H A D | BlockFrequencyInfoImpl.cpp | 683 template <> struct GraphTraits<IrreducibleGraph> { struct
684 using GraphT = bfi_detail::IrreducibleGraph;
685 using NodeRef = const GraphT::IrrNode *;
686 using ChildIteratorType = GraphT::IrrNode::iterator;
688 static NodeRef getEntryNode(const GraphT &G) { return G.StartIrr; } in getEntryNode()
689 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); } in child_begin()
690 static ChildIteratorType child_end(NodeRef N) { return N->succ_end(); } in child_end()
|
| H A D | MemorySSA.cpp | 2245 struct GraphTraits<DOTFuncMSSAInfo *> : public GraphTraits<const BasicBlock *> { struct
2246 static NodeRef getEntryNode(DOTFuncMSSAInfo *CFGInfo) { in getEntryNode()
2251 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2253 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2257 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2261 static size_t size(DOTFuncMSSAInfo *CFGInfo) { in size()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 491 struct GraphTraits<ModuleManager> { struct
492 using NodeRef = ModuleFile *;
493 using ChildIteratorType = llvm::SetVector<ModuleFile *>::const_iterator;
494 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>;
496 static ChildIteratorType child_begin(NodeRef Node) { in child_begin()
500 static ChildIteratorType child_end(NodeRef Node) { in child_end()
504 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
508 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | GraphTraits.h | 35 struct GraphTraits { struct
101 // Provide a partial specialization of GraphTraits so that the inverse of an argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | FunctionAttrs.cpp | 433 template <> struct GraphTraits<ArgumentGraphNode *> { struct
434 using NodeRef = ArgumentGraphNode *;
435 using ChildIteratorType = SmallVectorImpl<ArgumentGraphNode *>::iterator;
437 static NodeRef getEntryNode(NodeRef A) { return A; } in getEntryNode()
438 static ChildIteratorType child_begin(NodeRef N) { return N->Uses.begin(); } in child_begin()
439 static ChildIteratorType child_end(NodeRef N) { return N->Uses.end(); } in child_end()
443 struct GraphTraits<ArgumentGraph *> : public GraphTraits<ArgumentGraphNode *> { struct
444 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
446 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
450 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
|
| H A D | Attributor.cpp | 2482 template <> struct GraphTraits<AADepGraphNode *> { struct
2483 using NodeRef = AADepGraphNode *;
2484 using DepTy = PointerIntPair<AADepGraphNode *, 1>;
2485 using EdgeRef = PointerIntPair<AADepGraphNode *, 1>;
2487 static NodeRef getEntryNode(AADepGraphNode *DGN) { return DGN; } in getEntryNode()
2488 static NodeRef DepGetVal(DepTy &DT) { return DT.getPointer(); } in DepGetVal()
2490 using ChildIteratorType =
2492 using ChildEdgeIteratorType = TinyPtrVector<DepTy>::iterator;
2494 static ChildIteratorType child_begin(NodeRef N) { return N->child_begin(); } in child_begin()
2496 static ChildIteratorType child_end(NodeRef N) { return N->child_end(); } in child_end()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | PGOInstrumentation.cpp | 2082 template <> struct GraphTraits<PGOUseFunc *> { struct
2083 using NodeRef = const BasicBlock *;
2084 using ChildIteratorType = const_succ_iterator;
2085 using nodes_iterator = pointer_iterator<Function::const_iterator>;
2087 static NodeRef getEntryNode(const PGOUseFunc *G) { in getEntryNode()
2091 static ChildIteratorType child_begin(const NodeRef N) { in child_begin()
2095 static ChildIteratorType child_end(const NodeRef N) { return succ_end(N); } in child_end()
2097 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2101 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 240 template <> struct GraphTraits<Loop> : LoopBodyTraits {}; struct
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 2458 template <> struct GraphTraits<BoUpSLP *> { struct
2459 using TreeEntry = BoUpSLP::TreeEntry;
2462 using NodeRef = TreeEntry *;
2464 using ContainerTy = BoUpSLP::TreeEntry::VecTreeTy;
2468 struct ChildIteratorType
2480 static NodeRef getEntryNode(BoUpSLP &R) { in getEntryNode()
2484 static ChildIteratorType child_begin(NodeRef N) { in child_begin()
2488 static ChildIteratorType child_end(NodeRef N) { in child_end()
2494 class nodes_iterator {
2508 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86LoadValueInjectionLoadHardening.cpp | 189 struct GraphTraits<MachineGadgetGraph *> struct
|