Home
last modified time | relevance | path

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

12

/freebsd-src/contrib/llvm-project/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.h493 using nodes_iterator =
496 static nodes_iterator nodes_begin(CallGraph *CG) {
497 return nodes_iterator(CG->begin(), &CGGetValuePtr);
500 static nodes_iterator nodes_end(CallGraph *CG) {
501 return nodes_iterator(CG->end(), &CGGetValuePtr);
520 using nodes_iterator =
523 static nodes_iterator nodes_begin(const CallGraph *CG) {
524 return nodes_iterator(CG->begin(), &CGGetValuePtr);
527 static nodes_iterator nodes_end(const CallGraph *CG) {
528 return nodes_iterator(CG->end(), &CGGetValuePtr);
H A DCFGPrinter.h111 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
112 using nodes_iterator = pointer_iterator<Function::const_iterator>;
114 static nodes_iterator nodes_begin(DOTFuncInfo *CFGInfo) {
115 return nodes_iterator(CFGInfo->getFunction()->begin());
118 static nodes_iterator nodes_end(DOTFuncInfo *CFGInfo) {
119 return nodes_iterator(CFGInfo->getFunction()->end());
H A DPostDominators.h106 static nodes_iterator nodes_begin(PostDominatorTree *N) {
110 static nodes_iterator nodes_end(PostDominatorTree *N) {
H A DDDG.h516 using nodes_iterator = DataDependenceGraph::iterator;
520 static nodes_iterator nodes_begin(DataDependenceGraph *DG) {
523 static nodes_iterator nodes_end(DataDependenceGraph *DG) { return DG->end(); }
557 using nodes_iterator = DataDependenceGraph::const_iterator;
561 static nodes_iterator nodes_begin(const DataDependenceGraph *DG) {
564 static nodes_iterator nodes_end(const DataDependenceGraph *DG) {
/freebsd-src/contrib/llvm-project/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) {
/freebsd-src/contrib/llvm-project/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.h1527 using nodes_iterator = ::clang::CFG::iterator;
1530 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1531 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); }
1537 using nodes_iterator = ::clang::CFG::const_iterator;
1541 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1545 static nodes_iterator nodes_end( const ::clang::CFG* F) {
1556 using nodes_iterator = ::clang::CFG::iterator;
1559 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1560 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); }
1565 using nodes_iterator
[all...]
/freebsd-src/contrib/llvm-project/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 DMachineCFGPrinter.h38 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
40 static nodes_iterator nodes_begin(DOTMachineFuncInfo *CFGInfo) {
41 return nodes_iterator(CFGInfo->getFunction()->begin());
44 static nodes_iterator nodes_end(DOTMachineFuncInfo *CFGInfo) {
45 return nodes_iterator(CFGInfo->getFunction()->end());
H A DMachineFunction.h1398 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
1399 using nodes_iterator = pointer_iterator<MachineFunction::iterator>;
1401 static nodes_iterator nodes_begin(MachineFunction *F) {
1402 return nodes_iterator(F->begin());
1405 static nodes_iterator nodes_end(MachineFunction *F) {
1406 return nodes_iterator(F->end());
1415 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
1416 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
1418 static nodes_iterator nodes_begin(const MachineFunction *F) {
1419 return nodes_iterator(
[all...]
H A DScheduleDAG.h707 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
708 static nodes_iterator nodes_begin(ScheduleDAG *G) {
709 return nodes_iterator(G->SUnits.begin());
711 static nodes_iterator nodes_end(ScheduleDAG *G) {
712 return nodes_iterator(G->SUnits.end());
/freebsd-src/contrib/llvm-project/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)));
/freebsd-src/contrib/llvm-project/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.h242 using nodes_iterator = df_iterator<Node *, df_iterator_default_set<Node*>>;
248 static nodes_iterator nodes_begin(NodeRef N) {
252 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
269 static nodes_iterator nodes_begin(DominatorTree *N) {
273 static nodes_iterator nodes_end(DominatorTree *N) {
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DCallPrinter.cpp130 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
132 nodes_iterator;
134 static nodes_iterator nodes_begin(CallGraphDOTInfo *CGInfo) { in nodes_begin()
135 return nodes_iterator(CGInfo->getCallGraph()->begin(), &CGGetValuePtr); in nodes_begin()
137 static nodes_iterator nodes_end(CallGraphDOTInfo *CGInfo) { in nodes_end()
138 return nodes_iterator(CGInfo->getCallGraph()->end(), &CGGetValuePtr); in nodes_end()
174 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
177 nodes_iterator;
179 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
131 nodes_iterator; global() typedef
176 nodes_iterator; global() typedef
H A DBlockFrequencyInfo.cpp102 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
114 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin()
115 return nodes_iterator(G->getFunction()->begin()); in nodes_begin()
118 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { in nodes_end()
119 return nodes_iterator(G->getFunction()->end()); in nodes_end()
/freebsd-src/contrib/llvm-project/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()
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h294 using nodes_iterator = df_iterator<NodeRef>;
298 static nodes_iterator nodes_begin(GraphRef N) {
299 return nodes_iterator::begin(N->getEntry());
302 static nodes_iterator nodes_end(GraphRef N) {
305 return nodes_iterator::end(N->getEntry());
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp282 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
284 static nodes_iterator nodes_begin(DotFuncBCIInfo *Info) { in nodes_begin()
285 return nodes_iterator(Info->getFunction().begin()); in nodes_begin()
288 static nodes_iterator nodes_end(DotFuncBCIInfo *Info) { in nodes_end()
289 return nodes_iterator(Info->getFunction().end()); in nodes_end()
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h109 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
115 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
H A DGenericCycleInfo.h324 using nodes_iterator = ChildIteratorT;
325 using ChildIteratorType = nodes_iterator; in child_begin()
335 // static nodes_iterator nodes_begin(GraphType *G)
336 // static nodes_iterator nodes_end (GraphType *G)
337 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
320 using nodes_iterator = ChildIteratorT; global() member
/freebsd-src/contrib/llvm-project/clang/lib/Serialization/
H A DModuleManager.cpp464 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>; typedef
474 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
475 return nodes_iterator(Manager.begin()); in nodes_begin()
478 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
479 return nodes_iterator(Manager.end()); in nodes_end()
/freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h509 using nodes_iterator = llvm::df_iterator<GraphTy>;
531 static nodes_iterator nodes_begin(const GraphTy G) {
535 static nodes_iterator nodes_end(const GraphTy G) {
/freebsd-src/contrib/llvm-project/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) {

12