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