Lines Matching refs:BasicBlocks

299   for (BinaryBasicBlock *BB : BasicBlocks) {  in markUnreachableBlocks()
336 for (BinaryBasicBlock *const BB : BasicBlocks) { in eraseInvalidBBs()
348 for (auto I = BasicBlocks.begin(), E = BasicBlocks.end(); I != E; ++I) { in eraseInvalidBBs()
358 BasicBlocks = std::move(NewBasicBlocks); in eraseInvalidBBs()
360 assert(BasicBlocks.size() == Layout.block_size()); in eraseInvalidBBs()
487 if (BasicBlocks.empty() && !Instructions.empty()) { in print()
1762 if (BasicBlocks.size() == 1) { in postProcessIndirectBranches()
1873 for (BinaryBasicBlock *BB : BasicBlocks) { in recomputeLandingPads()
1878 for (BinaryBasicBlock *BB : BasicBlocks) { in recomputeLandingPads()
1910 assert(BasicBlocks.empty() && "basic block list should be empty"); in buildCFG()
2048 if (BasicBlocks.empty()) { in buildCFG()
2081 for (BinaryBasicBlock *BB : BasicBlocks) { in buildCFG()
2124 for (BinaryBasicBlock *BB : BasicBlocks) { in buildCFG()
2165 if (isSimple() && !BasicBlocks.empty()) { in postProcessCFG()
2218 for (BinaryBasicBlock *BB : BasicBlocks) { in removeTagsFromProfile()
2325 assert(!BasicBlocks.empty() && "basic block list should not be empty"); in annotateCFIState()
2343 for (BinaryBasicBlock *BB : BasicBlocks) { in annotateCFIState()
2893 for (BinaryBasicBlock *BB : BasicBlocks) in setIgnored()
2895 clearList(BasicBlocks); in setIgnored()
3007 for (BinaryBasicBlock *BB : BasicBlocks) { in dumpGraph()
3140 for (BinaryBasicBlock *BB : BasicBlocks) in validateCFG()
3156 for (const BinaryBasicBlock *BB : BasicBlocks) { in validateCFG()
3173 for (const BinaryBasicBlock *BB : BasicBlocks) { in validateCFG()
3219 for (BinaryBasicBlock *BB : BasicBlocks) { in fixBranches()
3304 for (BinaryBasicBlock *BB : BasicBlocks) { in propagateGnuArgsSizeInfo()
3396 if (&BB == BasicBlocks.front()) in addEntryPoint()
3422 for (BinaryBasicBlock *BB : BasicBlocks) { in getSymbolForEntryID()
3454 for (const BinaryBasicBlock *BB : BasicBlocks) { in getEntryIDForSymbol()
3503 llvm::copy_if(BasicBlocks, std::back_inserter(EntryPoints), in dfs()
3609 BasicBlocks.insert(BasicBlocks.begin() + (StartIndex + 1), NumNewBlocks, in insertBasicBlocks()
3614 assert(!BasicBlocks[I]); in insertBasicBlocks()
3615 BasicBlocks[I++] = BB.release(); in insertBasicBlocks()
3638 BasicBlocks.insert(BasicBlocks.begin() + StartIndex + 1, NumNewBlocks, in insertBasicBlocks()
3640 auto RetIter = BasicBlocks.begin() + StartIndex + 1; in insertBasicBlocks()
3644 assert(!BasicBlocks[I]); in insertBasicBlocks()
3645 BasicBlocks[I++] = BB.release(); in insertBasicBlocks()
3663 for (unsigned I = StartIndex; I < BasicBlocks.size(); ++I) in updateBBIndices()
3664 BasicBlocks[I]->Index = I; in updateBBIndices()
3672 BasicBlocks[StartIndex + I]->setCFIState(CFIState); in updateCFIState()
3682 Begin = BasicBlocks.begin(); in updateLayout()
3683 End = BasicBlocks.begin() + NumNewBlocks; in updateLayout()
3686 Begin = std::next(BasicBlocks.begin(), StartIndex + 1); in updateLayout()
3687 End = std::next(BasicBlocks.begin(), StartIndex + NumNewBlocks + 1); in updateLayout()
3697 for (BinaryBasicBlock *&BB : BasicBlocks) { in checkForAmbiguousJumpTables()
3721 for (BinaryBasicBlock *&BB : BasicBlocks) { in disambiguateJumpTables()
3882 for (auto I = BasicBlocks.begin(), E = BasicBlocks.end(); I != E; ++I) { in deleteConservativeEdges()
3961 for (BinaryBasicBlock *BB : BasicBlocks) in ~BinaryFunction()
4440 BinaryBasicBlock &BB = **BasicBlocks.begin(); in isAArch64Veneer()
4445 for (auto I = BasicBlocks.begin() + 1, E = BasicBlocks.end(); I != E; ++I) { in isAArch64Veneer()