/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() 235 blocks.insert(L->block_begin(), L->block_end()); in runOnLoop()
|
D | LoopUnrollPass.cpp | 106 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in ApproximateLoopSize()
|
D | LoopUnswitch.cpp | 239 E = currentLoop->block_end(); I != E; ++I) { in processCurrentLoop() 442 E = currentLoop->block_end(); in UnswitchIfProfitable() 471 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in CloneLoop() 594 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end()); in UnswitchNontrivialCondition()
|
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 | LICM.cpp | 218 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in runOnLoop()
|
/external/llvm/lib/Analysis/ |
D | LoopInfo.cpp | 261 SmallPtrSet<BasicBlock*, 16> LoopBBs(block_begin(), block_end()); in isLCSSAForm() 263 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) { in isLCSSAForm() 301 SmallPtrSet<BasicBlock *, 16> LoopBBs(block_begin(), block_end()); in hasDedicatedExits() 326 SmallVector<BasicBlock *, 128> LoopBBs(block_begin(), block_end()); in getUniqueExitBlocks() 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 | RegionPrinter.cpp | 125 BE = R->block_end(); BI != BE; ++BI) { in printRegionCluster()
|
D | RegionPass.cpp | 198 for (Region::block_iterator I = R->block_begin(), E = R->block_end(); in runOnRegion()
|
D | RegionInfo.cpp | 255 Region::block_iterator Region::block_end() { in block_end() function in Region 263 Region::const_block_iterator Region::block_end() const { in block_end() function in Region 430 for (const_block_iterator I = block_begin(), E = block_end(); I!=E; ++I) in print()
|
D | LoopDependenceAnalysis.cpp | 70 for (Loop::block_iterator b = L->block_begin(), be = L->block_end(); in GetMemRefInstrs()
|
/external/llvm/include/llvm/Analysis/ |
D | LoopInfo.h | 112 return std::find(block_begin(), block_end(), BB) != block_end(); in contains() 135 block_iterator block_end() const { return Blocks.end(); } in block_end() function 182 SmallVector<BlockT*, 128> LoopBBs(block_begin(), block_end()); in getExitingBlocks() 186 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitingBlocks() 213 SmallVector<BlockT*, 128> LoopBBs(block_begin(), block_end()); in getExitBlocks() 217 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitBlocks() 244 SmallVector<BlockT*, 128> LoopBBs(block_begin(), block_end()); in getExitEdges() 248 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitEdges() 415 SmallVector<BlockT*, 128> LoopBBs(block_begin(), block_end()); in verifyLoop() 419 for (block_iterator I = block_begin(), E = block_end(); I != E; ++I) { in verifyLoop() [all …]
|
D | RegionInfo.h | 491 block_iterator block_end(); 494 const_block_iterator block_end() const;
|
/external/llvm/lib/Transforms/Utils/ |
D | LCSSA.cpp | 130 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end()); in runOnLoop() 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/lib/CodeGen/ |
D | MachineLoopRanges.cpp | 63 E = Loop->block_end(); I != E; ++I) { in MachineLoopRange()
|
D | CodePlacementOpt.cpp | 279 for (MachineLoop::block_iterator BI = L->block_begin(), BE = L->block_end(); in MoveDiscontiguousLoopBlocks()
|
D | Splitter.cpp | 233 bbEnd = loop.block_end(); in copyRanges() 643 std::copy(loop.block_begin(), loop.block_end(), in getLoopRanges()
|
/external/v8/src/ |
D | jsregexp.cc | 4174 uc16 block_end; in AddCaseEquivalents() local 4176 block_end = pos; in AddCaseEquivalents() 4179 block_end = range[0]; in AddCaseEquivalents() 4181 int end = (block_end > top) ? top : block_end; in AddCaseEquivalents() 4182 length = isolate->jsregexp_uncanonicalize()->get(block_end, '\0', range); in AddCaseEquivalents() 4185 uc16 range_from = c - (block_end - pos); in AddCaseEquivalents() 4186 uc16 range_to = c - (block_end - end); in AddCaseEquivalents()
|
/external/llvm/bindings/ocaml/llvm/ |
D | llvm.ml | 649 external block_end : llvalue -> (llvalue, llbasicblock) llrev_pos 683 rev_iter_block_range f (block_end fn) (At_start fn) 692 fold_right_block_range f init (block_end fn) (At_start fn)
|
/external/v8/test/cctest/ |
D | test-regexp.cc | 1475 uc32 block_end = CanonRangeEnd(block_start); in TEST() local 1476 unsigned block_length = block_end - block_start + 1; in TEST()
|
/external/llvm/test/Bindings/Ocaml/ |
D | vmcore.ml | 733 insist (At_start f = block_end f); 742 insist (After b2 = block_end f);
|
/external/llvm/include/llvm/ |
D | Instructions.h | 1685 block_iterator block_end() { 1689 const_block_iterator block_end() const {
|
/external/llvm/lib/VMCore/ |
D | Instructions.cpp | 91 std::copy(PN.block_begin(), PN.block_end(), block_begin()); in PHINode() 122 std::copy(block_begin() + Idx + 1, block_end(), block_begin() + Idx); in removeIncomingValue()
|