Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionGraphTraits.h59 using nodes_iterator = pointer_iterator<mlir::Region::iterator>;
60 static nodes_iterator nodes_begin(GraphType fn) {
61 return nodes_iterator(fn->begin());
63 static nodes_iterator nodes_end(GraphType fn) {
64 return nodes_iterator(fn->end());
76 using nodes_iterator = pointer_iterator<mlir::Region::iterator>;
77 static nodes_iterator nodes_begin(GraphType fn) {
78 return nodes_iterator(fn.Graph->begin());
80 static nodes_iterator nodes_end(GraphType fn) {
81 return nodes_iterator(fn.Graph->end());
/llvm-project-15.0.7/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)); \
328 using nodes_iterator =
336 static nodes_iterator nodes_begin(RegionInfo* RI) {
337 return nodes_iterator::begin(getEntryNode(RI));
340 static nodes_iterator nodes_end(RegionInfo *RI) {
341 return nodes_iterator::end(getEntryNode(RI));
347 using nodes_iterator =
355 static nodes_iterator nodes_begin(RegionInfoPass* RI) {
[all …]
H A DCallGraph.h480 using nodes_iterator =
483 static nodes_iterator nodes_begin(CallGraph *CG) {
484 return nodes_iterator(CG->begin(), &CGGetValuePtr);
487 static nodes_iterator nodes_end(CallGraph *CG) {
488 return nodes_iterator(CG->end(), &CGGetValuePtr);
507 using nodes_iterator =
510 static nodes_iterator nodes_begin(const CallGraph *CG) {
511 return nodes_iterator(CG->begin(), &CGGetValuePtr);
514 static nodes_iterator nodes_end(const CallGraph *CG) {
515 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 DPostDominators.h104 static nodes_iterator nodes_begin(PostDominatorTree *N) {
108 static nodes_iterator nodes_end(PostDominatorTree *N) {
H A DDDG.h515 using nodes_iterator = DataDependenceGraph::iterator;
519 static nodes_iterator nodes_begin(DataDependenceGraph *DG) {
522 static nodes_iterator nodes_end(DataDependenceGraph *DG) { return DG->end(); }
556 using nodes_iterator = DataDependenceGraph::const_iterator;
560 static nodes_iterator nodes_begin(const DataDependenceGraph *DG) {
563 static nodes_iterator nodes_end(const DataDependenceGraph *DG) {
/llvm-project-15.0.7/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) {
/llvm-project-15.0.7/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.h1535 using nodes_iterator = ::clang::CFG::iterator;
1538 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1539 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); }
1545 using nodes_iterator = ::clang::CFG::const_iterator;
1549 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1553 static nodes_iterator nodes_end( const ::clang::CFG* F) {
1564 using nodes_iterator = ::clang::CFG::iterator;
1568 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); }
1573 using nodes_iterator = ::clang::CFG::const_iterator;
1577 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
[all …]
/llvm-project-15.0.7/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.h1285 using nodes_iterator = pointer_iterator<MachineFunction::iterator>;
1287 static nodes_iterator nodes_begin(MachineFunction *F) {
1288 return nodes_iterator(F->begin());
1291 static nodes_iterator nodes_end(MachineFunction *F) {
1292 return nodes_iterator(F->end());
1302 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
1304 static nodes_iterator nodes_begin(const MachineFunction *F) {
1305 return nodes_iterator(F->begin());
1308 static nodes_iterator nodes_end (const MachineFunction *F) {
1309 return nodes_iterator(F->end());
H A DScheduleDAG.h680 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
681 static nodes_iterator nodes_begin(ScheduleDAG *G) {
682 return nodes_iterator(G->SUnits.begin());
684 static nodes_iterator nodes_end(ScheduleDAG *G) {
685 return nodes_iterator(G->SUnits.end());
/llvm-project-15.0.7/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)));
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DCFG.h354 using nodes_iterator = pointer_iterator<Function::iterator>;
356 static nodes_iterator nodes_begin(Function *F) {
357 return nodes_iterator(F->begin());
360 static nodes_iterator nodes_end(Function *F) {
361 return nodes_iterator(F->end());
371 using nodes_iterator = pointer_iterator<Function::const_iterator>;
373 static nodes_iterator nodes_begin(const Function *F) {
374 return nodes_iterator(F->begin());
377 static nodes_iterator nodes_end(const Function *F) {
378 return nodes_iterator(F->end());
H A DDominators.h230 using nodes_iterator = df_iterator<Node *, df_iterator_default_set<Node*>>;
236 static nodes_iterator nodes_begin(NodeRef N) {
240 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
257 static nodes_iterator nodes_begin(DominatorTree *N) {
261 static nodes_iterator nodes_end(DominatorTree *N) {
/llvm-project-15.0.7/polly/include/polly/
H A DScopGraphPrinter.h34 static nodes_iterator nodes_begin(polly::ScopDetection *SD) {
35 return nodes_iterator::begin(getEntryNode(SD));
37 static nodes_iterator nodes_end(polly::ScopDetection *SD) {
38 return nodes_iterator::end(getEntryNode(SD));
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallPrinter.cpp131 nodes_iterator; typedef
133 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
134 return nodes_iterator(CGInfo->getCallGraph()->begin(), &CGGetValuePtr); in nodes_begin()
136 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
137 return nodes_iterator(CGInfo->getCallGraph()->end(), &CGGetValuePtr); in nodes_end()
176 nodes_iterator; typedef
178 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
H A DBlockFrequencyInfo.cpp103 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
115 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
116 return nodes_iterator(G->getFunction()->begin()); in nodes_begin()
119 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
120 return nodes_iterator(G->getFunction()->end()); in nodes_end()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryDomTree.h46 static nodes_iterator nodes_begin(bolt::BinaryDominatorTree *N) {
50 static nodes_iterator nodes_end(bolt::BinaryDominatorTree *N) {
/llvm-project-15.0.7/mlir/include/mlir/Analysis/
H A DCallGraph.h253 using nodes_iterator = mlir::CallGraph::iterator;
254 static nodes_iterator nodes_begin(mlir::CallGraph *cg) { return cg->begin(); }
255 static nodes_iterator nodes_end(mlir::CallGraph *cg) { return cg->end(); }
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGraphTraits.h109 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
115 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
/llvm-project-15.0.7/clang/lib/Serialization/
H A DModuleManager.cpp487 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>; typedef
497 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
498 return nodes_iterator(Manager.begin()); in nodes_begin()
501 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
502 return nodes_iterator(Manager.end()); in nodes_end()
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp84 using nodes_iterator = DGTestGraph::iterator; typedef
86 static nodes_iterator nodes_begin(DGTestGraph *DG) { return DG->begin(); } in nodes_begin()
87 static nodes_iterator nodes_end(DGTestGraph *DG) { return DG->end(); } in nodes_end()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlan.h2308 using nodes_iterator = df_iterator<NodeRef>;
2313 return nodes_iterator::begin(N->getEntry());
2316 static nodes_iterator nodes_end(GraphRef N) {
2319 return nodes_iterator::end(N);
2327 using nodes_iterator = df_iterator<NodeRef>;
2332 return nodes_iterator::begin(N->getEntry());
2335 static nodes_iterator nodes_end(GraphRef N) {
2338 return nodes_iterator::end(N);
2346 using nodes_iterator = df_iterator<NodeRef>;
2356 static nodes_iterator nodes_end(GraphRef N) {
[all …]

12