Home
last modified time | relevance | path

Searched refs:nodes_iterator (Results 1 – 25 of 29) sorted by relevance

12

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DRegionIterator.h292 using nodes_iterator = df_iterator<NodeRef>; \
296 static nodes_iterator nodes_begin(RegionT *R) { \
297 return nodes_iterator::begin(getEntryNode(R)); \
299 static nodes_iterator nodes_end(RegionT *R) { \
300 return nodes_iterator::end(getEntryNode(R)); \
306 using nodes_iterator = \
312 static nodes_iterator nodes_begin(RegionT *R) { \
313 return nodes_iterator::begin(getEntryNode(R)); \
315 static nodes_iterator nodes_end(RegionT *R) { \
316 return nodes_iterator::end(getEntryNode(R)); \
[all …]
H A DCallGraph.h481 using nodes_iterator =
484 static nodes_iterator nodes_begin(CallGraph *CG) {
485 return nodes_iterator(CG->begin(), &CGGetValuePtr);
488 static nodes_iterator nodes_end(CallGraph *CG) {
489 return nodes_iterator(CG->end(), &CGGetValuePtr);
508 using nodes_iterator =
511 static nodes_iterator nodes_begin(const CallGraph *CG) {
512 return nodes_iterator(CG->begin(), &CGGetValuePtr);
515 static nodes_iterator nodes_end(const CallGraph *CG) {
516 return nodes_iterator(CG->end(), &CGGetValuePtr);
H A DCFGPrinter.h107 using nodes_iterator = pointer_iterator<Function::const_iterator>;
109 static nodes_iterator nodes_begin(DOTFuncInfo *CFGInfo) {
110 return nodes_iterator(CFGInfo->getFunction()->begin());
113 static nodes_iterator nodes_end(DOTFuncInfo *CFGInfo) {
114 return nodes_iterator(CFGInfo->getFunction()->end());
H A DDDG.h526 using nodes_iterator = DataDependenceGraph::iterator;
530 static nodes_iterator nodes_begin(DataDependenceGraph *DG) {
533 static nodes_iterator nodes_end(DataDependenceGraph *DG) { return DG->end(); }
567 using nodes_iterator = DataDependenceGraph::const_iterator;
571 static nodes_iterator nodes_begin(const DataDependenceGraph *DG) {
574 static nodes_iterator nodes_end(const DataDependenceGraph *DG) {
H A DPostDominators.h104 static nodes_iterator nodes_begin(PostDominatorTree *N) {
111 static nodes_iterator nodes_end(PostDominatorTree *N) {
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DStmtGraphTraits.h26 using nodes_iterator = llvm::df_iterator<clang::Stmt *>;
40 static nodes_iterator nodes_begin(clang::Stmt* S) {
44 static nodes_iterator nodes_end(clang::Stmt* S) {
52 using nodes_iterator = llvm::df_iterator<const clang::Stmt *>;
66 static nodes_iterator nodes_begin(const clang::Stmt* S) {
70 static nodes_iterator nodes_end(const clang::Stmt* S) {
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/
H A DCallGraph.h101 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator; variable
275 using nodes_iterator =
278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
279 return nodes_iterator(CG->begin(), &CGGetValue);
282 static nodes_iterator nodes_end (clang::CallGraph *CG) {
283 return nodes_iterator(CG->end(), &CGGetValue);
301 using nodes_iterator =
304 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
305 return nodes_iterator(CG->begin(), &CGGetValue);
308 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
[all …]
H A DCFG.h1541 using nodes_iterator = ::clang::CFG::iterator;
1544 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1545 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); }
1551 using nodes_iterator = ::clang::CFG::const_iterator;
1555 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1559 static nodes_iterator nodes_end( const ::clang::CFG* F) {
1570 using nodes_iterator = ::clang::CFG::iterator;
1573 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1574 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); }
1579 using nodes_iterator = ::clang::CFG::const_iterator;
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h139 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
147 static nodes_iterator nodes_begin(MachineRegionInfo *RI) {
148 return nodes_iterator::begin(getEntryNode(RI));
151 static nodes_iterator nodes_end(MachineRegionInfo *RI) {
152 return nodes_iterator::end(getEntryNode(RI));
159 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
166 static nodes_iterator nodes_begin(MachineRegionInfoPass *RI) {
170 static nodes_iterator nodes_end(MachineRegionInfoPass *RI) {
H A DMachineFunction.h1152 using nodes_iterator = pointer_iterator<MachineFunction::iterator>;
1154 static nodes_iterator nodes_begin(MachineFunction *F) {
1155 return nodes_iterator(F->begin());
1158 static nodes_iterator nodes_end(MachineFunction *F) {
1159 return nodes_iterator(F->end());
1169 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
1171 static nodes_iterator nodes_begin(const MachineFunction *F) {
1172 return nodes_iterator(F->begin());
1175 static nodes_iterator nodes_end (const MachineFunction *F) {
1176 return nodes_iterator(F->end());
H A DScheduleDAG.h681 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
682 static nodes_iterator nodes_begin(ScheduleDAG *G) {
683 return nodes_iterator(G->SUnits.begin());
685 static nodes_iterator nodes_end(ScheduleDAG *G) {
686 return nodes_iterator(G->SUnits.end());
H A DSelectionDAG.h2031 using nodes_iterator = pointer_iterator<SelectionDAG::allnodes_iterator>;
2033 static nodes_iterator nodes_begin(SelectionDAG *G) {
2034 return nodes_iterator(G->allnodes_begin());
2037 static nodes_iterator nodes_end(SelectionDAG *G) {
2038 return nodes_iterator(G->allnodes_end());
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
H A DDominators.h288 using nodes_iterator =
291 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
292 return nodes_iterator(df_begin(getEntryNode(N)));
295 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
296 return nodes_iterator(df_end(getEntryNode(N)));
306 static nodes_iterator nodes_begin(clang::CFGDomTree *N) {
307 return nodes_iterator(df_begin(getEntryNode(N)));
310 static nodes_iterator nodes_end(clang::CFGDomTree *N) {
311 return nodes_iterator(df_end(getEntryNode(N)));
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DCFG.h355 using nodes_iterator = pointer_iterator<Function::iterator>;
357 static nodes_iterator nodes_begin(Function *F) {
358 return nodes_iterator(F->begin());
361 static nodes_iterator nodes_end(Function *F) {
362 return nodes_iterator(F->end());
372 using nodes_iterator = pointer_iterator<Function::const_iterator>;
374 static nodes_iterator nodes_begin(const Function *F) {
375 return nodes_iterator(F->begin());
378 static nodes_iterator nodes_end(const Function *F) {
379 return nodes_iterator(F->end());
H A DDominators.h215 using nodes_iterator = df_iterator<Node *, df_iterator_default_set<Node*>>;
221 static nodes_iterator nodes_begin(NodeRef N) {
225 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
242 static nodes_iterator nodes_begin(DominatorTree *N) {
246 static nodes_iterator nodes_end(DominatorTree *N) {
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DCallPrinter.cpp126 nodes_iterator; typedef
128 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
129 return nodes_iterator(CGInfo->getCallGraph()->begin(), &CGGetValuePtr); in nodes_begin()
131 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
132 return nodes_iterator(CGInfo->getCallGraph()->end(), &CGGetValuePtr); in nodes_end()
171 nodes_iterator; typedef
173 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
H A DBlockFrequencyInfo.cpp104 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
116 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
117 return nodes_iterator(G->getFunction()->begin()); in nodes_begin()
120 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
121 return nodes_iterator(G->getFunction()->end()); in nodes_end()
H A DMemorySSA.cpp2251 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
2253 static nodes_iterator nodes_begin(DOTFuncMSSAInfo *CFGInfo) { in nodes_begin()
2254 return nodes_iterator(CFGInfo->getFunction()->begin()); in nodes_begin()
2257 static nodes_iterator nodes_end(DOTFuncMSSAInfo *CFGInfo) { in nodes_end()
2258 return nodes_iterator(CFGInfo->getFunction()->end()); in nodes_end()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp93 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>; typedef
105 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
106 return nodes_iterator(G->getFunction()->begin()); in nodes_begin()
109 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
110 return nodes_iterator(G->getFunction()->end()); in nodes_end()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Serialization/
H A DModuleManager.cpp494 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>; typedef
504 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
505 return nodes_iterator(Manager.begin()); in nodes_begin()
508 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
509 return nodes_iterator(Manager.end()); in nodes_end()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DGraphTraits.h107 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
113 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1760 using nodes_iterator = df_iterator<NodeRef>;
1764 static nodes_iterator nodes_begin(GraphRef N) {
1765 return nodes_iterator::begin(N->getEntry());
1768 static nodes_iterator nodes_end(GraphRef N) {
1771 return nodes_iterator::end(N);
1779 using nodes_iterator = df_iterator<NodeRef>;
1783 static nodes_iterator nodes_begin(GraphRef N) {
1784 return nodes_iterator::begin(N->getEntry());
1787 static nodes_iterator nodes_end(GraphRef N) {
1790 return nodes_iterator::end(N);
[all …]
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h514 using nodes_iterator = llvm::df_iterator<GraphTy>;
536 static nodes_iterator nodes_begin(const GraphTy G) {
540 static nodes_iterator nodes_end(const GraphTy G) {
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/
H A DImmutableGraph.h423 using nodes_iterator =
425 static nodes_iterator nodes_begin(GraphT *G) {
428 static nodes_iterator nodes_end(GraphT *G) {
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp2085 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
2097 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
2098 return nodes_iterator(G->getFunc().begin()); in nodes_begin()
2101 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
2102 return nodes_iterator(G->getFunc().end()); in nodes_end()

12