| /external/clang/include/clang/AST/ |
| StmtGraphTraits.h | 48 static nodes_iterator nodes_end(clang::Stmt* S) { function in struct:llvm::GraphTraits
75 static nodes_iterator nodes_end(const clang::Stmt* S) { function in struct:llvm::GraphTraits
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph.cc | 126 std::deque<DependencyNode*>::iterator nodes_end(nodes.end());
135 nodes_end = std::remove(nodes.begin(), nodes_end, it->second);
137 nodes.erase(nodes_end, nodes.end());
|
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_index.cc | 77 // Use nodes_begin() and nodes_end() to get an iterator over the set as
87 NodeSet::const_iterator nodes_end() const;
95 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { function in class:bookmarks::BookmarkIndex::Match
176 nodes.insert(i->nodes_begin(), i->nodes_end());
180 for (NodeSet::const_iterator n = i->nodes_begin(); n != i->nodes_end(); ++n)
299 std::set_intersection(match->nodes_begin(), match->nodes_end(),
318 std::set_intersection(match.nodes_begin(), match.nodes_end(),
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 191 static nodes_iterator nodes_end(::clang::DomTreeNode *N) { function in struct:llvm::GraphTraits
206 static nodes_iterator nodes_end(::clang::DominatorTree *N) { function in struct:llvm::GraphTraits
|
| /external/llvm/include/llvm/IR/ |
| Dominators.h | 137 static nodes_iterator nodes_end(DomTreeNode *N) { function in struct:llvm::GraphTraits
152 static nodes_iterator nodes_end(DominatorTree *N) { function in struct:llvm::GraphTraits
|
| CFG.h | 348 static nodes_iterator nodes_end (Function *F) { return F->end(); } function in struct:llvm::GraphTraits
358 static nodes_iterator nodes_end (const Function *F) { return F->end(); } function in struct:llvm::GraphTraits
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 338 node_iterator nodes_end() { return Nodes.end(); } function in class:clang::ento::ExplodedGraph
342 const_node_iterator nodes_end() const { return Nodes.end(); } function in class:clang::ento::ExplodedGraph
465 static inline nodes_iterator nodes_end(NodeType* N) { function in struct:llvm::GraphTraits
491 static inline nodes_iterator nodes_end(NodeType* N) { function in struct:llvm::GraphTraits
|
| /external/llvm/include/llvm/Analysis/ |
| PostDominators.h | 110 static nodes_iterator nodes_end(PostDominatorTree *N) { function in struct:llvm::GraphTraits
|
| RegionIterator.h | 299 static nodes_iterator nodes_end(RegionT* R) { \
313 static nodes_iterator nodes_end(RegionT* R) { \
335 static nodes_iterator nodes_end(RegionInfo *RI) { function in struct:llvm::GraphTraits
|
| CallGraph.h | 443 static nodes_iterator nodes_end(CallGraph *CG) { function in struct:GraphTraits
459 static nodes_iterator nodes_end(const CallGraph *CG) { return CG->end(); } function in struct:GraphTraits
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | 851 graph_iterator nodes_end() { return graph_iterator(Blocks.end()); } function in class:clang::CFGBlock::CFG
855 const_graph_iterator nodes_end() const { function in class:clang::CFGBlock::CFG
1067 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); } function in struct:clang::llvm::GraphTraits
1082 static nodes_iterator nodes_end( const ::clang::CFG* F) { function in struct:clang::llvm::GraphTraits
1097 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); } function in struct:clang::llvm::GraphTraits
1109 static nodes_iterator nodes_end(const ::clang::CFG* F) { function in struct:clang::llvm::GraphTraits
[all...] |
| CallGraph.h | 213 static nodes_iterator nodes_end (clang::CallGraph *CG) { function in struct:llvm::GraphTraits
239 static nodes_iterator nodes_end(const clang::CallGraph *CG) { function in struct:llvm::GraphTraits
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| AnalyzerStatsChecker.cpp | 56 I != G.nodes_end(); ++I) {
|
| UnreachableCodeChecker.cpp | 66 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end();
|
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfo.cpp | 69 static nodes_iterator nodes_end(const BlockFrequencyInfo *G) { function in struct:llvm::GraphTraits
|
| RegionInfo.cpp | 282 return GraphTraits<Region*>::nodes_end(this);
290 return GraphTraits<const Region*>::nodes_end(this);
|
| /external/llvm/lib/CodeGen/ |
| MachineBlockFrequencyInfo.cpp | 75 static nodes_iterator nodes_end(const MachineBlockFrequencyInfo *G) { function in struct:llvm::GraphTraits
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 492 static nodes_iterator nodes_end (MachineFunction *F) { return F->end(); } function in class:llvm::MachineFunction
506 static nodes_iterator nodes_end (const MachineFunction *F) { function in struct:llvm::GraphTraits
|
| ScheduleDAG.h | 680 static nodes_iterator nodes_end(ScheduleDAG *G) { function in struct:llvm::SUnit::GraphTraits
|
| SelectionDAG.h | 1231 static nodes_iterator nodes_end(SelectionDAG *G) { function in struct:llvm::GraphTraits
[all...] |
| /external/llvm/include/llvm/Support/ |
| GraphWriter.h | 142 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
| GenericDomTree.h | 694 E = TraitsTy::nodes_end(&F); I != E; ++I) {
|
| /external/clang/lib/Serialization/ |
| ModuleManager.cpp | 440 static nodes_iterator nodes_end(const ModuleManager &Manager) { function in struct:llvm::GraphTraits
|
| /external/llvm/lib/Target/R600/ |
| AMDILCFGStructurizer.cpp | 948 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF);
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 403 static ChildIteratorType nodes_end(ArgumentGraph *AG) { function in struct:llvm::GraphTraits
[all...] |
