Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DRegionIterator.h286 using nodes_iterator = df_iterator<NodeRef>; \
290 static nodes_iterator nodes_begin(RegionT *R) { \
291 return nodes_iterator::begin(getEntryNode(R)); \
322 using nodes_iterator =
330 static nodes_iterator nodes_begin(RegionInfo* RI) {
331 return nodes_iterator::begin(getEntryNode(RI));
334 static nodes_iterator nodes_end(RegionInfo *RI) {
335 return nodes_iterator::end(getEntryNode(RI));
341 using nodes_iterator =
349 static nodes_iterator nodes_begin(RegionInfoPass* RI) {
[all …]
H A DCallGraph.h468 using nodes_iterator =
471 static nodes_iterator nodes_begin(CallGraph *CG) {
472 return nodes_iterator(CG->begin(), &CGGetValuePtr);
475 static nodes_iterator nodes_end(CallGraph *CG) {
476 return nodes_iterator(CG->end(), &CGGetValuePtr);
495 using nodes_iterator =
498 static nodes_iterator nodes_begin(const CallGraph *CG) {
499 return nodes_iterator(CG->begin(), &CGGetValuePtr);
502 static nodes_iterator nodes_end(const CallGraph *CG) {
503 return nodes_iterator(CG->end(), &CGGetValuePtr);
H A DPostDominators.h102 static nodes_iterator nodes_begin(PostDominatorTree *N) {
109 static nodes_iterator nodes_end(PostDominatorTree *N) {
H A DBlockFrequencyInfoImpl.h1370 using NodeIter = typename GTraits::nodes_iterator;
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCallGraph.h96 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator; variable
217 using nodes_iterator =
220 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
221 return nodes_iterator(CG->begin(), &CGGetValue);
224 static nodes_iterator nodes_end (clang::CallGraph *CG) {
225 return nodes_iterator(CG->end(), &CGGetValue);
243 using nodes_iterator =
246 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
247 return nodes_iterator(CG->begin(), &CGGetValue);
250 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
[all …]
H A DCFG.h1286 using nodes_iterator = ::clang::CFG::iterator;
1289 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1290 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); }
1296 using nodes_iterator = ::clang::CFG::const_iterator;
1300 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1304 static nodes_iterator nodes_end( const ::clang::CFG* F) {
1315 using nodes_iterator = ::clang::CFG::iterator;
1319 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); }
1324 using nodes_iterator = ::clang::CFG::const_iterator;
1328 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h173 using nodes_iterator =
176 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
177 return nodes_iterator(df_begin(getEntryNode(N)));
180 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
181 return nodes_iterator(df_end(getEntryNode(N)));
191 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
192 return nodes_iterator(df_begin(getEntryNode(N)));
195 static nodes_iterator nodes_end(::clang::DominatorTree *N) {
196 return nodes_iterator(df_end(getEntryNode(N)));
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/
H A DStmtGraphTraits.h27 using nodes_iterator = llvm::df_iterator<clang::Stmt *>;
41 static nodes_iterator nodes_begin(clang::Stmt* S) {
45 static nodes_iterator nodes_end(clang::Stmt* S) {
53 using nodes_iterator = llvm::df_iterator<const clang::Stmt *>;
67 static nodes_iterator nodes_begin(const clang::Stmt* S) {
71 static nodes_iterator nodes_end(const clang::Stmt* S) {
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h140 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
148 static nodes_iterator nodes_begin(MachineRegionInfo *RI) {
149 return nodes_iterator::begin(getEntryNode(RI));
152 static nodes_iterator nodes_end(MachineRegionInfo *RI) {
153 return nodes_iterator::end(getEntryNode(RI));
160 using nodes_iterator = df_iterator<NodeRef, df_iterator_default_set<NodeRef>,
167 static nodes_iterator nodes_begin(MachineRegionInfoPass *RI) {
171 static nodes_iterator nodes_end(MachineRegionInfoPass *RI) {
H A DMachineFunction.h959 using nodes_iterator = pointer_iterator<MachineFunction::iterator>;
961 static nodes_iterator nodes_begin(MachineFunction *F) {
962 return nodes_iterator(F->begin());
965 static nodes_iterator nodes_end(MachineFunction *F) {
966 return nodes_iterator(F->end());
976 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>;
978 static nodes_iterator nodes_begin(const MachineFunction *F) {
979 return nodes_iterator(F->begin());
982 static nodes_iterator nodes_end (const MachineFunction *F) {
983 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());
H A DSelectionDAG.h1643 using nodes_iterator = pointer_iterator<SelectionDAG::allnodes_iterator>;
1645 static nodes_iterator nodes_begin(SelectionDAG *G) {
1646 return nodes_iterator(G->allnodes_begin());
1649 static nodes_iterator nodes_end(SelectionDAG *G) {
1650 return nodes_iterator(G->allnodes_end());
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DCFG.h357 using nodes_iterator = pointer_iterator<Function::iterator>;
359 static nodes_iterator nodes_begin(Function *F) {
360 return nodes_iterator(F->begin());
363 static nodes_iterator nodes_end(Function *F) {
364 return nodes_iterator(F->end());
374 using nodes_iterator = pointer_iterator<Function::const_iterator>;
376 static nodes_iterator nodes_begin(const Function *F) {
377 return nodes_iterator(F->begin());
380 static nodes_iterator nodes_end(const Function *F) {
381 return nodes_iterator(F->end());
H A DDominators.h195 using nodes_iterator = df_iterator<Node *, df_iterator_default_set<Node*>>;
201 static nodes_iterator nodes_begin(NodeRef N) {
205 static nodes_iterator nodes_end(NodeRef N) { return df_end(getEntryNode(N)); }
221 static nodes_iterator nodes_begin(DominatorTree *N) {
225 static nodes_iterator nodes_end(DominatorTree *N) {
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp91 using nodes_iterator = pointer_iterator<MachineFunction::const_iterator>; typedef
103 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin()
104 return nodes_iterator(G->getFunction()->begin()); in nodes_begin()
107 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { in nodes_end()
108 return nodes_iterator(G->getFunction()->end()); in nodes_end()
/freebsd-12.1/contrib/llvm/lib/Analysis/
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-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlan.h1375 using nodes_iterator = df_iterator<NodeRef>;
1380 return nodes_iterator::begin(N->getEntry());
1383 static nodes_iterator nodes_end(GraphRef N) {
1386 return nodes_iterator::end(N);
1394 using nodes_iterator = df_iterator<NodeRef>;
1402 static nodes_iterator nodes_end(GraphRef N) {
1405 return nodes_iterator::end(N);
1413 using nodes_iterator = df_iterator<NodeRef>;
1420 return nodes_iterator::begin(N->getExit());
1423 static nodes_iterator nodes_end(GraphRef N) {
[all …]
H A DSLPVectorizer.cpp1275 using nodes_iterator = pointer_iterator<std::vector<TreeEntry>::iterator>; typedef
1277 static nodes_iterator nodes_begin(BoUpSLP *R) { in nodes_begin()
1278 return nodes_iterator(R->VectorizableTree.begin()); in nodes_begin()
1281 static nodes_iterator nodes_end(BoUpSLP *R) { in nodes_end()
1282 return nodes_iterator(R->VectorizableTree.end()); in nodes_end()
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DGraphTraits.h108 iterator_range<typename GraphTraits<GraphType>::nodes_iterator>
114 iterator_range<typename GraphTraits<Inverse<GraphType>>::nodes_iterator>
/freebsd-12.1/contrib/llvm/tools/clang/lib/Serialization/
H A DModuleManager.cpp474 using nodes_iterator = pointer_iterator<ModuleManager::ModuleConstIterator>; typedef
484 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin()
485 return nodes_iterator(Manager.begin()); in nodes_begin()
488 static nodes_iterator nodes_end(const ModuleManager &Manager) { in nodes_end()
489 return nodes_iterator(Manager.end()); in nodes_end()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h473 using nodes_iterator = llvm::df_iterator<GraphTy>;
495 static nodes_iterator nodes_begin(const GraphTy G) {
499 static nodes_iterator nodes_end(const GraphTy G) {
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp1654 using nodes_iterator = pointer_iterator<Function::const_iterator>; typedef
1666 static nodes_iterator nodes_begin(const PGOUseFunc *G) { in nodes_begin()
1667 return nodes_iterator(G->getFunc().begin()); in nodes_begin()
1670 static nodes_iterator nodes_end(const PGOUseFunc *G) { in nodes_end()
1671 return nodes_iterator(G->getFunc().end()); in nodes_end()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DGraphWriter.h74 using node_iterator = typename GTraits::nodes_iterator;