Searched refs:nodes_iterator (Results 1 - 17 of 17) sorted by relevance

/external/clang/include/clang/AST/
H A DStmtGraphTraits.h30 typedef llvm::df_iterator<clang::Stmt*> nodes_iterator; typedef in struct:llvm::GraphTraits
44 static nodes_iterator nodes_begin(clang::Stmt* S) {
48 static nodes_iterator nodes_end(clang::Stmt* S) {
57 typedef llvm::df_iterator<const clang::Stmt*> nodes_iterator; typedef in struct:llvm::GraphTraits
71 static nodes_iterator nodes_begin(const clang::Stmt* S) {
75 static nodes_iterator nodes_end(const clang::Stmt* S) {
/external/llvm/include/llvm/Analysis/
H A DRegionIterator.h292 typedef df_iterator<NodeType*> nodes_iterator; \
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 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; \
310 static nodes_iterator nodes_begin(RegionT* R) { \
311 return nodes_iterator::begin(getEntryNode(R)); \
313 static nodes_iterator nodes_end(RegionT* R) { \
314 return nodes_iterator
327 GraphTraits<FlatIt<NodeType*> > > nodes_iterator; typedef in struct:llvm::GraphTraits
[all...]
H A DPostDominators.h92 static nodes_iterator nodes_begin(PostDominatorTree *N) {
99 static nodes_iterator nodes_end(PostDominatorTree *N) {
H A DCallGraph.h348 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
349 typedef mapped_iterator<CallGraph::iterator, DerefFun> nodes_iterator; typedef in struct:GraphTraits
350 static nodes_iterator nodes_begin(CallGraph *CG) {
353 static nodes_iterator nodes_end (CallGraph *CG) {
367 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
368 typedef CallGraph::const_iterator nodes_iterator; typedef in struct:GraphTraits
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); }
H A DDominators.h664 for (typename TraitsTy::nodes_iterator I = TraitsTy::nodes_begin(&F),
875 typedef df_iterator<DomTreeNode*> nodes_iterator; typedef in struct:llvm::GraphTraits
877 static nodes_iterator nodes_begin(DomTreeNode *N) {
881 static nodes_iterator nodes_end(DomTreeNode *N) {
892 static nodes_iterator nodes_begin(DominatorTree *N) {
896 static nodes_iterator nodes_end(DominatorTree *N) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h92 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator; typedef in class:clang::CallGraph
94 nodes_iterator parentless_begin() { return ParentlessNodes.begin(); }
95 nodes_iterator parentless_end() { return ParentlessNodes.end(); }
211 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
212 typedef mapped_iterator<clang::CallGraph::iterator, DerefFun> nodes_iterator; typedef in struct:llvm::GraphTraits
214 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
217 static nodes_iterator nodes_end (clang::CallGraph *CG) {
236 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
238 DerefFun> nodes_iterator; typedef in struct:llvm::GraphTraits
240 static nodes_iterator nodes_begi
[all...]
H A DCFG.h887 typedef ::clang::CFG::graph_iterator nodes_iterator; typedef in struct:clang::llvm::GraphTraits
890 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
891 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); }
898 typedef ::clang::CFG::const_graph_iterator nodes_iterator; typedef in struct:clang::llvm::GraphTraits
903 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
906 static nodes_iterator nodes_end( const ::clang::CFG* F) {
917 typedef ::clang::CFG::graph_iterator nodes_iterator; typedef in struct:clang::llvm::GraphTraits
920 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
921 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); }
927 typedef ::clang::CFG::const_graph_iterator nodes_iterator; typedef in struct:clang::llvm::GraphTraits
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h185 typedef df_iterator< ::clang::DomTreeNode* > nodes_iterator; typedef in struct:llvm::GraphTraits
187 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
191 static nodes_iterator nodes_end(::clang::DomTreeNode *N) {
202 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
206 static nodes_iterator nodes_end(::clang::DominatorTree *N) {
/external/llvm/include/llvm/CodeGen/
H A DMachineFunction.h441 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
442 typedef MachineFunction::iterator nodes_iterator;
443 static nodes_iterator nodes_begin(MachineFunction *F) { return F->begin(); }
444 static nodes_iterator nodes_end (MachineFunction *F) { return F->end(); }
453 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
454 typedef MachineFunction::const_iterator nodes_iterator; typedef in struct:llvm::GraphTraits
455 static nodes_iterator nodes_begin(const MachineFunction *F) {
458 static nodes_iterator nodes_end (const MachineFunction *F) {
H A DScheduleDAG.h634 typedef std::vector<SUnit>::iterator nodes_iterator; typedef in struct:llvm::GraphTraits
635 static nodes_iterator nodes_begin(ScheduleDAG *G) {
638 static nodes_iterator nodes_end(ScheduleDAG *G) {
H A DSelectionDAG.h1063 typedef SelectionDAG::allnodes_iterator nodes_iterator; typedef in struct:llvm::GraphTraits
1064 static nodes_iterator nodes_begin(SelectionDAG *G) {
1067 static nodes_iterator nodes_end(SelectionDAG *G) {
/external/llvm/include/llvm/Support/
H A DCFG.h319 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
320 typedef Function::iterator nodes_iterator; typedef in struct:llvm::GraphTraits
321 static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
322 static nodes_iterator nodes_end (Function *F) { return F->end(); }
329 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
330 typedef Function::const_iterator nodes_iterator; typedef in struct:llvm::GraphTraits
331 static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
332 static nodes_iterator nodes_end (const Function *F) { return F->end(); }
H A DGraphWriter.h59 typedef typename GTraits::nodes_iterator node_iterator;
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h429 typedef llvm::df_iterator<NodeType*> nodes_iterator; typedef in struct:llvm::GraphTraits
443 static inline nodes_iterator nodes_begin(NodeType* N) {
447 static inline nodes_iterator nodes_end(NodeType* N) {
455 typedef llvm::df_iterator<NodeType*> nodes_iterator; typedef in struct:llvm::GraphTraits
469 static inline nodes_iterator nodes_begin(NodeType* N) {
473 static inline nodes_iterator nodes_end(NodeType* N) {
/external/clang/lib/Serialization/
H A DModuleManager.cpp217 typedef ModuleManager::ModuleConstIterator nodes_iterator; typedef in struct:llvm::GraphTraits
227 static nodes_iterator nodes_begin(const ModuleManager &Manager) {
231 static nodes_iterator nodes_end(const ModuleManager &Manager) {
/external/llvm/include/llvm/ADT/
H A DTrie.h290 typedef typename std::vector<NodeType*>::const_iterator nodes_iterator; typedef in struct:llvm::GraphTraits
292 static inline nodes_iterator nodes_begin(const TrieType& G) {
295 static inline nodes_iterator nodes_end(const TrieType& G) {
/external/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp325 for (CallGraph::nodes_iterator TI = CG.parentless_begin(),

Completed in 118 milliseconds