Lines Matching refs:Best
355 // register and hope for the best.
1452 // Strictly speaking it would best to just rely on canonical formulae.
2730 /// Finding the best IV chain is potentially a scheduling problem. Since LSR
3861 /// by other uses, pick the best one and delete the others.
3870 // Collect the best formula for each unique set of shared registers. This
3924 Formula &Best = LU.Formulae[P.first->second];
3928 CostBest.RateFormula(TTI, Best, Regs, VisitedRegs, L, LU.Offsets, SE,
3931 std::swap(F, Best);
3934 " in favor of formula "; Best.print(dbgs());
4154 const SCEV *Best = nullptr;
4159 if (!Best)
4160 Best = Reg;
4164 Best = Reg;
4170 DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
4172 Taken.insert(Best);
4178 if (!LU.Regs.count(Best)) continue;
4183 if (!F.referencesReg(Best)) {
4265 // the current best, prune the search at that point.
4278 DEBUG(dbgs() << "New best at "; NewCost.print(dbgs());
