Lines Matching refs:Best
340 // register and hope for the best.
1464 // Strictly speaking it would best to just rely on canonical formulae.
2757 /// Finding the best IV chain is potentially a scheduling problem. Since LSR
3915 /// by other uses, pick the best one and delete the others.
3924 // Collect the best formula for each unique set of shared registers. This
3980 Formula &Best = LU.Formulae[P.first->second];
3984 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE,
3987 std::swap(F, Best);
3990 " in favor of formula "; Best.print(dbgs());
4219 const SCEV *Best = nullptr;
4226 if (!Best)
4227 Best = Reg;
4231 Best = Reg;
4237 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4239 Taken.insert(Best);
4245 if (!LU.Regs.count(Best)) continue;
4250 if (!F.referencesReg(Best)) {
4338 // the current best, prune the search at that point.
4351 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
