4528         Formula &Best = LU.Formulae[P.first->second];  in FilterOutUndesirableDedicatedRegisters()  local
4532         CostBest.RateFormula(Best, Regs, VisitedRegs, LU);  in FilterOutUndesirableDedicatedRegisters()
4534           std::swap(F, Best);  in FilterOutUndesirableDedicatedRegisters()
4538                    Best.print(dbgs()); dbgs() << '\n');  in FilterOutUndesirableDedicatedRegisters()
4802       Formula &Best = LU.Formulae[P.first->second];  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()  local
4803       if (IsBetterThan(F, Best))  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4804         std::swap(F, Best);  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4808                  Best.print(dbgs()); dbgs() << '\n');  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5019                                        ScalarEvolution &SE, const SCEV *Best,  in IsSimplerBaseSCEVForTarget()  argument
5022   if (Best->getType() != Reg->getType() ||  in IsSimplerBaseSCEVForTarget()
5023       (isa<SCEVAddRecExpr>(Best) && isa<SCEVAddRecExpr>(Reg) &&  in IsSimplerBaseSCEVForTarget()
5024        cast<SCEVAddRecExpr>(Best)->getLoop() !=  in IsSimplerBaseSCEVForTarget()
5027   const auto *Diff = dyn_cast<SCEVConstant>(SE.getMinusSCEV(Best, Reg));  in IsSimplerBaseSCEVForTarget()
5055     const SCEV *Best = nullptr;  in NarrowSearchSpaceByPickingWinnerRegs()  local
5060       if (!Best) {  in NarrowSearchSpaceByPickingWinnerRegs()
5061         Best = Reg;  in NarrowSearchSpaceByPickingWinnerRegs()
5066           Best = Reg;  in NarrowSearchSpaceByPickingWinnerRegs()
5076               IsSimplerBaseSCEVForTarget(TTI, SE, Best, Reg,  in NarrowSearchSpaceByPickingWinnerRegs()
5078             Best = Reg;  in NarrowSearchSpaceByPickingWinnerRegs()
5084     assert(Best && "Failed to find best LSRUse candidate");  in NarrowSearchSpaceByPickingWinnerRegs()
5086     LLVM_DEBUG(dbgs() << "Narrowing the search space by assuming " << *Best  in NarrowSearchSpaceByPickingWinnerRegs()
5088     Taken.insert(Best);  in NarrowSearchSpaceByPickingWinnerRegs()
5094       if (!LU.Regs.count(Best)) continue;  in NarrowSearchSpaceByPickingWinnerRegs()
5099         if (!F.referencesReg(Best)) {  in NarrowSearchSpaceByPickingWinnerRegs()