/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/browser_context_keyed_service/ |
dependency_graph.cc | 134 std::deque<DependencyNode*>::iterator nodes_end(nodes.end()); 143 nodes_end = std::remove(nodes.begin(), nodes_end, it->second); 145 nodes.erase(nodes_end, nodes.end());
|
/external/chromium/chrome/browser/bookmarks/ |
bookmark_index.cc | 31 // Use nodes_begin() and nodes_end() to get an iterator over the set as 41 NodeSet::const_iterator nodes_end() const; 49 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { function in class:BookmarkIndex::Match 131 i != match.nodes_end(); ++i) { 208 std::set_intersection(match->nodes_begin(), match->nodes_end(), 227 std::set_intersection(match.nodes_begin(), match.nodes_end(),
|
/external/chromium_org/chrome/browser/bookmarks/ |
bookmark_index.cc | 32 // Use nodes_begin() and nodes_end() to get an iterator over the set as 42 NodeSet::const_iterator nodes_end() const; 50 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { function in class:BookmarkIndex::Match 139 i != match.nodes_end(); ++i) { 216 std::set_intersection(match->nodes_begin(), match->nodes_end(), 235 std::set_intersection(match.nodes_begin(), match.nodes_end(),
|
/external/clang/include/clang/Analysis/Analyses/ |
Dominators.h | 190 static nodes_iterator nodes_end(::clang::DomTreeNode *N) { function in struct:llvm::GraphTraits 205 static nodes_iterator nodes_end(::clang::DominatorTree *N) { 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 | 104 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 | 353 static nodes_iterator nodes_end (CallGraph *CG) { function in struct:GraphTraits 370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); } function in struct:GraphTraits
|
Dominators.h | 665 E = TraitsTy::nodes_end(&F); I != E; ++I) { 897 static nodes_iterator nodes_end(DomTreeNode *N) { function in struct:llvm::GraphTraits 912 static nodes_iterator nodes_end(DominatorTree *N) { function in struct:llvm::GraphTraits
|
/external/clang/include/clang/Analysis/ |
CFG.h | 715 graph_iterator nodes_end() { return graph_iterator(Blocks.end()); } function in class:clang::CFGBlock::CFG 719 const_graph_iterator nodes_end() const { function in class:clang::CFGBlock::CFG 930 static nodes_iterator nodes_end(::clang::CFG* F) { return F->nodes_end(); } function in struct:clang::llvm::GraphTraits 945 static nodes_iterator nodes_end( const ::clang::CFG* F) { function in struct:clang::llvm::GraphTraits 960 static nodes_iterator nodes_end( ::clang::CFG* F) { return F->nodes_end(); } function in struct:clang::llvm::GraphTraits 972 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/include/llvm/CodeGen/ |
MachineFunction.h | 481 static nodes_iterator nodes_end (MachineFunction *F) { return F->end(); } function in class:llvm::MachineFunction 495 static nodes_iterator nodes_end (const MachineFunction *F) { function in struct:llvm::GraphTraits
|
ScheduleDAG.h | 666 static nodes_iterator nodes_end(ScheduleDAG *G) { function in struct:llvm::GraphTraits
|
SelectionDAG.h | 1106 static nodes_iterator nodes_end(SelectionDAG *G) { function in struct:llvm::GraphTraits [all...] |
/external/llvm/include/llvm/Support/ |
CFG.h | 330 static nodes_iterator nodes_end (Function *F) { return F->end(); } function in struct:llvm::GraphTraits 340 static nodes_iterator nodes_end (const Function *F) { return F->end(); } function in struct:llvm::GraphTraits
|
GraphWriter.h | 142 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
/external/clang/lib/Serialization/ |
ModuleManager.cpp | 421 static nodes_iterator nodes_end(const ModuleManager &Manager) { function in struct:llvm::GraphTraits
|
/external/llvm/lib/Analysis/ |
RegionInfo.cpp | 286 return GraphTraits<Region*>::nodes_end(this); 294 return GraphTraits<const Region*>::nodes_end(this);
|
/external/llvm/lib/Target/R600/ |
AMDILCFGStructurizer.cpp | 947 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); [all...] |
/external/llvm/lib/Transforms/IPO/ |
FunctionAttrs.cpp | 400 static ChildIteratorType nodes_end(ArgumentGraph *AG) { function in struct:llvm::GraphTraits [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
AMDILCFGStructurizer.cpp | 742 blockEnd1 = FuncGTraits::nodes_end(funcRep); [all...] |
/external/mesa3d/src/gallium/drivers/radeon/ |
AMDILCFGStructurizer.cpp | 742 blockEnd1 = FuncGTraits::nodes_end(funcRep); [all...] |