| /external/chromium/chrome/browser/bookmarks/ |
| D | bookmark_index.cc | 37 NodeSet::const_iterator nodes_begin() const;
45 BookmarkIndex::Match::nodes_begin() const { in nodes_begin() function in BookmarkIndex::Match
130 for (NodeSet::const_iterator i = match.nodes_begin(); in ExtractBookmarkNodePairs()
208 std::set_intersection(match->nodes_begin(), match->nodes_end(), in CombineMatchesInPlace()
227 std::set_intersection(match.nodes_begin(), match.nodes_end(), in CombineMatches()
|
| /external/clang/include/clang/AST/ |
| D | StmtGraphTraits.h | 44 static nodes_iterator nodes_begin(clang::Stmt* S) {
71 static nodes_iterator nodes_begin(const clang::Stmt* S) {
|
| /external/clang/include/clang/Analysis/ |
| D | CFG.h | 712 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } in nodes_begin() function
714 const_graph_iterator nodes_begin() const { in nodes_begin() function
924 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
937 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
938 return F->nodes_begin();
954 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
964 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
965 return F->nodes_begin();
|
| D | CallGraph.h | 210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 332 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() function
336 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin() function
457 static inline nodes_iterator nodes_begin(NodeType* N) {
483 static inline nodes_iterator nodes_begin(NodeType* N) {
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 186 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
201 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
|
| /external/llvm/include/llvm/Analysis/ |
| D | RegionIterator.h | 296 static nodes_iterator nodes_begin(RegionT* R) { \
310 static nodes_iterator nodes_begin(RegionT* R) { \
332 static nodes_iterator nodes_begin(RegionInfo* RI) {
|
| D | CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) {
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
|
| D | PostDominators.h | 92 static nodes_iterator nodes_begin(PostDominatorTree *N) {
|
| D | Dominators.h | 664 for (typename TraitsTy::nodes_iterator I = TraitsTy::nodes_begin(&F), in recalculate()
893 static nodes_iterator nodes_begin(DomTreeNode *N) {
908 static nodes_iterator nodes_begin(DominatorTree *N) {
|
| /external/llvm/include/llvm/Support/ |
| D | CFG.h | 321 static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
331 static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
|
| D | GraphWriter.h | 141 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineFunction.h | 480 static nodes_iterator nodes_begin(MachineFunction *F) { return F->begin(); }
492 static nodes_iterator nodes_begin(const MachineFunction *F) {
|
| D | ScheduleDAG.h | 681 static nodes_iterator nodes_begin(ScheduleDAG *G) {
|
| D | SelectionDAG.h | 1098 static nodes_iterator nodes_begin(SelectionDAG *G) {
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | AnalyzerStatsChecker.cpp | 55 for (ExplodedGraph::node_iterator I = G.nodes_begin(); in checkEndAnalysis()
|
| D | UnreachableCodeChecker.cpp | 66 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end(); in checkEndAnalysis()
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 373 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin() function
|
| /external/llvm/lib/Analysis/ |
| D | RegionInfo.cpp | 249 return GraphTraits<Region*>::nodes_begin(this); in element_begin()
257 return GraphTraits<const Region*>::nodes_begin(this); in element_begin()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 334 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin() function
|
| /external/llvm/lib/Target/R600/ |
| D | AMDILCFGStructurizer.cpp | 509 BlockT *entryBlk = FuncGTraits::nodes_begin(&func); in run()
532 CFGTraits::wrapup(FuncGTraits::nodes_begin(&func)); in run()
603 for (BlockIterator blockIter1 = FuncGTraits::nodes_begin(funcRep), in orderBlocks()
|