Searched refs:block_iterator (Results 1 – 19 of 19) sorted by relevance
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopDeletion.cpp | 112 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in IsLoopDead()
205 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop()
227 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop()
|
| D | LoopUnrollPass.cpp | 106 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in ApproximateLoopSize()
|
| D | LoopIdiomRecognize.cpp | 211 for (Loop::block_iterator BI = L->block_begin(), E = L->block_end(); BI != E; in runOnLoop()
388 for (Loop::block_iterator BI = L->block_begin(), E = L->block_end(); BI != E; in mayLoopAccessLocation()
|
| D | LoopUnswitch.cpp | 238 for (Loop::block_iterator I = currentLoop->block_begin(), in processCurrentLoop()
441 for (Loop::block_iterator I = currentLoop->block_begin(), in UnswitchIfProfitable()
471 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in CloneLoop()
|
| D | LICM.cpp | 218 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in runOnLoop()
|
| /external/llvm/include/llvm/Analysis/ |
| D | RegionInfo.h | 484 GraphTraits<FlatIt<RegionNode*> > > block_iterator; typedef
490 block_iterator block_begin();
491 block_iterator block_end();
|
| D | LoopInfo.h | 133 typedef typename std::vector<BlockT*>::const_iterator block_iterator; typedef
134 block_iterator block_begin() const { return Blocks.begin(); } in block_begin()
135 block_iterator block_end() const { return Blocks.end(); } in block_end()
186 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitingBlocks()
217 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitBlocks()
248 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitEdges()
419 for (block_iterator I = block_begin(), E = block_end(); I != E; ++I) { in verifyLoop()
466 for (block_iterator BI = (*I)->block_begin(), BE = (*I)->block_end(); in verifyLoop()
|
| /external/llvm/lib/Analysis/ |
| D | LoopInfo.cpp | 263 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) { in isLCSSAForm()
331 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) { in getUniqueExitBlocks()
|
| D | LoopPass.cpp | 44 for (Loop::block_iterator b = L->block_begin(), be = L->block_end(); in runOnLoop()
90 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in deleteLoopFromQueue()
|
| D | RegionPass.cpp | 198 for (Region::block_iterator I = R->block_begin(), E = R->block_end(); in runOnRegion()
|
| D | LoopDependenceAnalysis.cpp | 70 for (Loop::block_iterator b = L->block_begin(), be = L->block_end(); in GetMemRefInstrs()
|
| D | RegionInfo.cpp | 251 Region::block_iterator Region::block_begin() { in block_begin()
255 Region::block_iterator Region::block_end() { in block_end()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineLoopRanges.cpp | 62 for (MachineLoop::block_iterator I = Loop->block_begin(), in MachineLoopRange()
|
| D | CodePlacementOpt.cpp | 279 for (MachineLoop::block_iterator BI = L->block_begin(), BE = L->block_end(); in MoveDiscontiguousLoopBlocks()
|
| D | Splitter.cpp | 232 for (MachineLoop::block_iterator bbItr = loop.block_begin(), in copyRanges()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 137 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end(); in runOnLoop()
|
| D | LoopSimplify.cpp | 149 for (Loop::block_iterator BB = L->block_begin(), E = L->block_end(); in ProcessLoop()
563 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in SeparateNestedLoop()
|
| D | Local.cpp | 671 for (PHINode::block_iterator I = PN->block_begin(), E = PN->block_end(); in EliminateDuplicatePHINodes()
|
| /external/llvm/include/llvm/ |
| D | Instructions.h | 1670 typedef BasicBlock **block_iterator;
1673 block_iterator block_begin() {
1676 return reinterpret_cast<block_iterator>(ref + 1);
1685 block_iterator block_end() {
|