Lines Matching defs:BestSucc

1614   BlockAndTailDupResult BestSucc = {nullptr, false};
1669     if (BestSucc.BB && BestProb >= SuccProb) {
1675     BestSucc.BB = Succ;
1680   // profitable than BestSucc. Position is important because we preserve it and
1699       BestSucc.BB = Succ;
1700       BestSucc.ShouldTailDup = true;
1705   if (BestSucc.BB)
1706     LLVM_DEBUG(dbgs() << "    Selected: " << getBlockName(BestSucc.BB) << "\n");
1708   return BestSucc;
1884     MachineBasicBlock *BestSucc = Result.BB;
1887       ShouldTailDup |= (BestSucc && canTailDuplicateUnplacedPreds(
1888                                         BB, BestSucc, Chain, BlockFilter));
1893     if (!BestSucc)
1894       BestSucc = selectBestCandidateBlock(Chain, BlockWorkList);
1895     if (!BestSucc)
1896       BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList);
1898     if (!BestSucc) {
1900         BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockInFilterIt,
1903         BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt);
1904       if (!BestSucc)
1913     if (allowTailDupPlacement() && BestSucc && ShouldTailDup) {
1914       repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain,
1919       if (!BB->isSuccessor(BestSucc))
1924     BlockChain &SuccChain = *BlockToChain[BestSucc];
1929                       << getBlockName(BestSucc) << "\n");
1931     Chain.merge(BestSucc, &SuccChain);