| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | LoopDeletion.cpp | 115 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in isLoopDead() 211 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() 233 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() 241 blocks.insert(L->block_begin(), L->block_end()); in runOnLoop()
|
| HD | LoopUnswitch.cpp | 265 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); I != E; in countLoop() 467 E = currentLoop->block_end(); I != E; ++I) { in processCurrentLoop() 706 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in CloneLoop() 873 LoopBlocks.insert(LoopBlocks.end(), L->block_begin(), L->block_end()); in UnswitchNontrivialCondition()
|
| HD | LICM.cpp | 219 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in runOnLoop() 421 BBE = CurLoop->block_end(); (BB != BBE) && !SafetyInfo->MayThrow ; ++BB) in computeLICMSafetyInfo()
|
| HD | LoopInterchange.cpp | 86 for (Loop::block_iterator BB = L->block_begin(), BE = L->block_end(); in populateDependencyMatrix() 897 for (auto BI = InnerLoop->block_begin(), BE = InnerLoop->block_end(); in getInstrOrderCost()
|
| HD | LoopUnrollPass.cpp | 553 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in ApproximateLoopSize()
|
| HD | LoopIdiomRecognize.cpp | 849 for (Loop::block_iterator BI = L->block_begin(), E = L->block_end(); BI != E; in mayLoopAccessLocation()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | LoopInfo.cpp | 173 for (block_iterator BI = block_begin(), E = block_end(); BI != E; ++BI) { in isLCSSAForm() 210 for (Loop::block_iterator I = block_begin(), E = block_end(); I != E; ++I) { in isSafeToClone() 236 for (block_iterator I = block_begin(), IE = block_end(); I != IE; ++I) { in getLoopID() 273 for (block_iterator I = block_begin(), IE = block_end(); I != IE; ++I) { in setLoopID() 293 for (block_iterator BB = block_begin(), BE = block_end(); BB != BE; ++BB) { in isAnnotatedParallel() 353 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) { in getUniqueExitBlocks() 503 BE = Unloop->block_end(); BI != BE; ++BI) { in removeBlocksFromAncestors() 618 E = Unloop->block_end(); in updateUnloop()
|
| HD | LoopPass.cpp | 46 for (Loop::block_iterator b = L->block_begin(), be = L->block_end(); in runOnLoop()
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | RegionInfo.h | 599 block_iterator block_end() { return block_iterator(); } 604 const_block_iterator block_end() const { return const_block_iterator(); } 611 return block_range(block_begin(), block_end()); 618 return const_block_range(block_begin(), block_end());
|
| HD | LoopInfoImpl.h | 37 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitingBlocks() 66 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitBlocks() 91 for (block_iterator BI = block_begin(), BE = block_end(); BI != BE; ++BI) in getExitEdges() 291 for (block_iterator BI = (*I)->block_begin(), BE = (*I)->block_end(); in verifyLoop()
|
| HD | LoopInfo.h | 142 block_iterator block_end() const { return Blocks.end(); } in block_end() function
|
| /NextBSD/contrib/llvm/lib/Target/PowerPC/ |
| HD | PPCLoopDataPrefetch.cpp | 133 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); in runOnLoop() 156 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); in runOnLoop()
|
| HD | PPCLoopPreIncPrep.cpp | 174 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); in runOnLoop() 382 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); in runOnLoop()
|
| HD | PPCCTRLoops.cpp | 461 for (Loop::block_iterator I = L->block_begin(), IE = L->block_end(); in convertToCTRLoop()
|
| /NextBSD/contrib/subversion/subversion/libsvn_fs_fs/ |
| HD | index.c | 2651 apr_off_t block_end) in append_p2l_entries() argument 2669 if (entry->offset >= block_end) in append_p2l_entries() 2721 apr_off_t block_end, in p2l_index_lookup() argument 2733 block.end = block_end; in p2l_index_lookup() 2736 SVN_ERR_ASSERT(block_start < block_end); in p2l_index_lookup() 2807 append_p2l_entries(entries, page_entries, block_start, block_end); in p2l_index_lookup() 2846 if (entry_end < block_end) in p2l_index_lookup() 2851 entry->size = block_end - entry->offset; in p2l_index_lookup() 2858 entry->size = block_end - entry_end; in p2l_index_lookup() 2880 apr_off_t block_end = block_start + block_size; in svn_fs_fs__p2l_index_lookup() local [all …]
|
| /NextBSD/contrib/subversion/subversion/libsvn_fs_x/ |
| HD | index.c | 2927 apr_off_t block_end, in append_p2l_entries() argument 2947 if (entry->offset >= block_end) in append_p2l_entries() 3014 apr_off_t block_end, in p2l_index_lookup() argument 3026 block.end = block_end; in p2l_index_lookup() 3029 SVN_ERR_ASSERT(block_start < block_end); in p2l_index_lookup() 3095 append_p2l_entries(entries, page_entries, block_start, block_end, FALSE); in p2l_index_lookup() 3129 if (entry_end < block_end) in p2l_index_lookup() 3134 entry->size = block_end - entry->offset; in p2l_index_lookup() 3141 entry->size = block_end - entry_end; in p2l_index_lookup() 3163 apr_off_t block_end = block_start + block_size; in svn_fs_x__p2l_index_lookup() local [all …]
|
| /NextBSD/contrib/llvm/include/llvm/Support/ |
| HD | GCOV.h | 272 BlockIterator block_end() const { return Blocks.end(); } in block_end() function 274 return make_range(block_begin(), block_end()); in blocks()
|
| /NextBSD/contrib/binutils/binutils/ |
| HD | dwarf.c | 2974 unsigned char *block_end; in display_debug_frames() local 3009 block_end = saved_start + length + initial_length_size; in display_debug_frames() 3010 if (block_end > end) in display_debug_frames() 3014 block_end = end; in display_debug_frames() 3227 while (start < block_end) in display_debug_frames() 3344 while (start < block_end) in display_debug_frames() 3659 start = block_end; in display_debug_frames() 3666 start = block_end; in display_debug_frames()
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | LCSSA.cpp | 230 for (Loop::block_iterator BBI = L.block_begin(), BBE = L.block_end(); in formLCSSA()
|
| HD | LoopSimplify.cpp | 311 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); in separateNestedLoop() 489 for (Loop::block_iterator BB = L->block_begin(), E = L->block_end(); in simplifyOneLoop()
|
| HD | SSAUpdater.cpp | 250 Preds->append(SomePhi->block_begin(), SomePhi->block_end()); in FindPredecessorBlocks()
|
| /NextBSD/contrib/llvm/lib/IR/ |
| HD | Instruction.cpp | 345 return std::equal(thisPHI->block_begin(), thisPHI->block_end(), in isIdenticalToWhenDefined()
|
| /NextBSD/contrib/libarchive/libarchive/ |
| HD | archive_write_disk_posix.c | 795 int64_t block_end; in write_data_block() local 809 block_end in write_data_block() 815 if (a->offset + bytes_to_write > block_end) in write_data_block() 816 bytes_to_write = block_end - a->offset; in write_data_block()
|
| /NextBSD/contrib/llvm/lib/Transforms/Vectorize/ |
| HD | LoopVectorize.cpp | 3754 BE = TheLoop->block_end(); BI != BE; ++BI) { in canVectorizeWithIfConvert() 3771 BE = TheLoop->block_end(); BI != BE; ++BI) { in canVectorizeWithIfConvert() 3944 be = TheLoop->block_end(); bb != be; ++bb) { in canVectorizeInstrs() 4142 BE = TheLoop->block_end(); B != BE; ++B) in collectLoopUniforms() 4575 be = TheLoop->block_end(); bb != be; ++bb) { in getWidestType() 4893 be = TheLoop->block_end(); bb != be; ++bb) { in expectedCost()
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | BasicTTIImpl.h | 253 for (Loop::block_iterator I = L->block_begin(), E = L->block_end(); I != E; in getUnrollingPreferences()
|