Lines Matching refs:Best
312 // register and hope for the best.
2541 /// Finding the best IV chain is potentially a scheduling problem. Since LSR
3589 /// by other uses, pick the best one and delete the others.
3598 // Collect the best formula for each unique set of shared registers. This
3654 Formula &Best = LU.Formulae[P.first->second];
3658 CostBest.RateFormula(Best, Regs, VisitedRegs, L, LU.Offsets, SE, DT);
3660 std::swap(F, Best);
3663 " in favor of formula "; Best.print(dbgs());
3893 const SCEV *Best = 0;
3900 if (!Best)
3901 Best = Reg;
3905 Best = Reg;
3911 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
3913 Taken.insert(Best);
3919 if (!LU.Regs.count(Best)) continue;
3924 if (!F.referencesReg(Best)) {
4009 // the current best, prune the search at that point.
4021 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
