Lines Matching defs:BestSucc

1601   BlockAndTailDupResult BestSucc = { nullptr, false };
1656     if (BestSucc.BB && BestProb >= SuccProb) {
1662     BestSucc.BB = Succ;
1667   // profitable than BestSucc. Position is important because we preserve it and
1686       BestSucc.BB = Succ;
1687       BestSucc.ShouldTailDup = true;
1692   if (BestSucc.BB)
1693     LLVM_DEBUG(dbgs() << "    Selected: " << getBlockName(BestSucc.BB) << "\n");
1695   return BestSucc;
1873     MachineBasicBlock* BestSucc = Result.BB;
1876       ShouldTailDup |= (BestSucc && canTailDuplicateUnplacedPreds(BB, BestSucc,
1883     if (!BestSucc)
1884       BestSucc = selectBestCandidateBlock(Chain, BlockWorkList);
1885     if (!BestSucc)
1886       BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList);
1888     if (!BestSucc) {
1890         BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockInFilterIt,
1893         BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt);
1894       if (!BestSucc)
1903     if (allowTailDupPlacement() && BestSucc && ShouldTailDup) {
1904       repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain,
1909       if (!BB->isSuccessor(BestSucc))
1914     BlockChain &SuccChain = *BlockToChain[BestSucc];
1919                       << getBlockName(BestSucc) << "\n");
1921     Chain.merge(BestSucc, &SuccChain);