| /external/llvm/include/llvm/Analysis/ |
| D | RegionIterator.h | 283 static nodes_iterator nodes_begin(RegionT* R) { \
297 static nodes_iterator nodes_begin(RegionT* R) { \
319 static nodes_iterator nodes_begin(RegionInfo* RI) {
335 static nodes_iterator nodes_begin(RegionInfoPass* RI) {
336 return GraphTraits<RegionInfo*>::nodes_begin(&RI->getRegionInfo());
|
| D | PostDominators.h | 103 static nodes_iterator nodes_begin(PostDominatorTree *N) {
|
| D | CallGraph.h | 458 static nodes_iterator nodes_begin(CallGraph *CG) {
481 static nodes_iterator nodes_begin(const CallGraph *CG) {
|
| D | RegionInfoImpl.h | 301 return GraphTraits<RegionT *>::nodes_begin(static_cast<RegionT *>(this)); in element_begin()
312 return GraphTraits<const RegionT *>::nodes_begin( in element_begin()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineRegionInfo.h | 151 static nodes_iterator nodes_begin(MachineRegionInfo* RI) {
167 static nodes_iterator nodes_begin(MachineRegionInfoPass* RI) {
168 return GraphTraits<MachineRegionInfo*>::nodes_begin(&RI->getRegionInfo());
|
| D | MachineFunction.h | 541 static nodes_iterator nodes_begin(MachineFunction *F) { return F->begin(); }
553 static nodes_iterator nodes_begin(const MachineFunction *F) {
|
| D | ScheduleDAG.h | 677 static nodes_iterator nodes_begin(ScheduleDAG *G) {
|
| /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 | 848 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } in nodes_begin() function
850 const_graph_iterator nodes_begin() const { in nodes_begin() function
1064 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
1077 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
1078 return F->nodes_begin();
1094 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1104 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
1105 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 | 334 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() function
338 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin() function
460 static inline nodes_iterator nodes_begin(NodeType* N) {
486 static inline nodes_iterator nodes_begin(NodeType* N) {
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 185 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
200 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
|
| /external/llvm/include/llvm/IR/ |
| D | Dominators.h | 155 static nodes_iterator nodes_begin(NodeType *N) { in nodes_begin() function
179 static nodes_iterator nodes_begin(DominatorTree *N) {
|
| D | CFG.h | 229 static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
239 static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
|
| /external/llvm/unittests/Analysis/ |
| D | CallGraphTest.cpp | 22 auto I = GraphTraits<Ty *>::nodes_begin(G); in canSpecializeGraphTraitsIterators()
|
| /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/llvm/lib/CodeGen/ |
| D | MachineBlockFrequencyInfo.cpp | 71 static nodes_iterator nodes_begin(const MachineBlockFrequencyInfo *G) { in nodes_begin() function
|
| /external/llvm/lib/Analysis/ |
| D | BlockFrequencyInfo.cpp | 66 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin() function
|
| /external/llvm/include/llvm/Support/ |
| D | GraphWriter.h | 141 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
|
| D | GenericDomTree.h | 734 for (typename TraitsTy::nodes_iterator I = TraitsTy::nodes_begin(&F), in recalculate()
|
| /external/clang/lib/Serialization/ |
| D | ModuleManager.cpp | 449 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin() function
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | NaryReassociate.cpp | 245 for (auto Node = GraphTraits<DominatorTree *>::nodes_begin(DT); in doOneIteration()
|
| D | StraightLineStrengthReduce.cpp | 696 for (auto node = GraphTraits<DominatorTree *>::nodes_begin(DT); in runOnFunction()
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | AMDILCFGStructurizer.cpp | 884 &*GraphTraits<MachineFunction *>::nodes_begin(FuncRep); in run()
907 wrapup(&*GraphTraits<MachineFunction *>::nodes_begin(FuncRep)); in run()
951 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); in orderBlocks()
|