Lines Matching defs:Best

4811         Formula &Best = LU.Formulae[P.first->second];
4815         CostBest.RateFormula(Best, Regs, VisitedRegs, LU);
4817           std::swap(F, Best);
4821                    Best.print(dbgs()); dbgs() << '\n');
5089       Formula &Best = LU.Formulae[P.first->second];
5090       if (IsBetterThan(F, Best))
5091         std::swap(F, Best);
5095                  Best.print(dbgs()); dbgs() << '\n');
5302 // Check if Best and Reg are SCEVs separated by a constant amount C, and if so
5306                                        ScalarEvolution &SE, const SCEV *Best,
5309   if (Best->getType() != Reg->getType() ||
5310       (isa<SCEVAddRecExpr>(Best) && isa<SCEVAddRecExpr>(Reg) &&
5311        cast<SCEVAddRecExpr>(Best)->getLoop() !=
5314   const auto *Diff = dyn_cast<SCEVConstant>(SE.getMinusSCEV(Best, Reg));
5342     const SCEV *Best = nullptr;
5347       if (!Best) {
5348         Best = Reg;
5353           Best = Reg;
5363               IsSimplerBaseSCEVForTarget(TTI, SE, Best, Reg,
5365             Best = Reg;
5371     assert(Best && "Failed to find best LSRUse candidate");
5373     LLVM_DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best
5375     Taken.insert(Best);
5381       if (!LU.Regs.count(Best)) continue;
5386         if (!F.referencesReg(Best)) {