Home
last modified time | relevance | path

Searched refs:nodes_begin (Results 1 – 25 of 26) sorted by relevance

12

/external/clang/include/clang/AST/
DStmtGraphTraits.h44 static nodes_iterator nodes_begin(clang::Stmt* S) {
71 static nodes_iterator nodes_begin(const clang::Stmt* S) {
/external/chromium_org/components/bookmarks/browser/
Dbookmark_index.cc83 NodeSet::const_iterator nodes_begin() const;
91 BookmarkIndex::Match::nodes_begin() const { in nodes_begin() function in bookmarks::BookmarkIndex::Match
182 nodes.insert(i->nodes_begin(), i->nodes_end()); in SortMatches()
186 for (NodeSet::const_iterator n = i->nodes_begin(); n != i->nodes_end(); ++n) in SortMatches()
309 std::set_intersection(match->nodes_begin(), match->nodes_end(), in CombineMatchesInPlace()
328 std::set_intersection(match.nodes_begin(), match.nodes_end(), in CombineMatches()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h336 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() function
340 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin() function
461 static inline nodes_iterator nodes_begin(NodeType* N) {
487 static inline nodes_iterator nodes_begin(NodeType* N) {
/external/clang/include/clang/Analysis/
DCFG.h850 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } in nodes_begin() function
852 const_graph_iterator nodes_begin() const { in nodes_begin() function
1066 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1079 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1080 return F->nodes_begin();
1096 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1106 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
1107 return F->nodes_begin();
DCallGraph.h210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
/external/llvm/include/llvm/IR/
DDominators.h133 static nodes_iterator nodes_begin(DomTreeNode *N) {
148 static nodes_iterator nodes_begin(DominatorTree *N) {
DCFG.h347 static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
357 static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
/external/clang/include/clang/Analysis/Analyses/
DDominators.h187 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
202 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
/external/llvm/include/llvm/Analysis/
DRegionIterator.h296 static nodes_iterator nodes_begin(RegionT* R) { \
310 static nodes_iterator nodes_begin(RegionT* R) { \
332 static nodes_iterator nodes_begin(RegionInfo* RI) {
DPostDominators.h103 static nodes_iterator nodes_begin(PostDominatorTree *N) {
DCallGraph.h440 static nodes_iterator nodes_begin(CallGraph *CG) {
458 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
/external/llvm/include/llvm/CodeGen/
DMachineFunction.h491 static nodes_iterator nodes_begin(MachineFunction *F) { return F->begin(); }
503 static nodes_iterator nodes_begin(const MachineFunction *F) {
DScheduleDAG.h677 static nodes_iterator nodes_begin(ScheduleDAG *G) {
/external/clang/lib/StaticAnalyzer/Checkers/
DAnalyzerStatsChecker.cpp55 for (ExplodedGraph::node_iterator I = G.nodes_begin(); in checkEndAnalysis()
DUnreachableCodeChecker.cpp66 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end(); in checkEndAnalysis()
/external/llvm/lib/Analysis/
DBlockFrequencyInfo.cpp66 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin() function
DRegionInfo.cpp278 return GraphTraits<Region*>::nodes_begin(this); in element_begin()
286 return GraphTraits<const Region*>::nodes_begin(this); in element_begin()
/external/llvm/lib/CodeGen/
DMachineBlockFrequencyInfo.cpp71 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin() function
/external/llvm/include/llvm/Support/
DGraphWriter.h142 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
DGenericDomTree.h693 for (typename TraitsTy::nodes_iterator I = TraitsTy::nodes_begin(&F), in recalculate()
/external/clang/lib/Serialization/
DModuleManager.cpp436 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin() function
/external/llvm/lib/Target/R600/
DAMDILCFGStructurizer.cpp881 GraphTraits<MachineFunction *>::nodes_begin(FuncRep); in run()
904 wrapup(GraphTraits<MachineFunction *>::nodes_begin(FuncRep)); in run()
948 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); in orderBlocks()
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
DAMDILCFGStructurizer.cpp646 BlockT *entryBlk = FuncGTraits::nodes_begin(&func); in run()
669 CFGTraits::wrapup(FuncGTraits::nodes_begin(&func)); in run()
741 for (BlockIterator blockIter1 = FuncGTraits::nodes_begin(funcRep), in orderBlocks()
/external/mesa3d/src/gallium/drivers/radeon/
DAMDILCFGStructurizer.cpp646 BlockT *entryBlk = FuncGTraits::nodes_begin(&func); in run()
669 CFGTraits::wrapup(FuncGTraits::nodes_begin(&func)); in run()
741 for (BlockIterator blockIter1 = FuncGTraits::nodes_begin(funcRep), in orderBlocks()
/external/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp400 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin() function

12