346   const SCEV *ScaledReg = nullptr;  member
458   if (!ScaledReg)  in isCanonical()
467   const SCEVAddRecExpr *SAR = dyn_cast<const SCEVAddRecExpr>(ScaledReg);  in isCanonical()
496   if (!ScaledReg) {  in canonicalize()
497     ScaledReg = BaseRegs.back();  in canonicalize()
505   const SCEVAddRecExpr *SAR = dyn_cast<const SCEVAddRecExpr>(ScaledReg);  in canonicalize()
513       std::swap(ScaledReg, *I);  in canonicalize()
525   BaseRegs.push_back(ScaledReg);  in unscale()
526   ScaledReg = nullptr;  in unscale()
533   if (BaseRegs.size() != 1 || ScaledReg)  in hasZeroEnd()
541   return !!ScaledReg + BaseRegs.size();  in getNumRegs()
548          ScaledReg ? ScaledReg->getType() :  in getType()
562   return S == ScaledReg || is_contained(BaseRegs, S);  in referencesReg()
569   if (ScaledReg)  in hasRegsUsedByUsesOtherThan()
570     if (RegUses.isRegUsedByUsesOtherThan(ScaledReg, LUIdx))  in hasRegsUsedByUsesOtherThan()
603     if (ScaledReg)  in print()
604       OS << *ScaledReg;  in print()
1312   if (const SCEV *ScaledReg = F.ScaledReg) {  in RateFormula()  local
1313     if (VisitedRegs.count(ScaledReg)) {  in RateFormula()
1317     RatePrimaryRegister(ScaledReg, Regs, L, SE, DT, LoserRegs, TTI);  in RateFormula()
1493   if (F.ScaledReg) Key.push_back(F.ScaledReg);  in HasFormulaWithSameRegs()
1517   if (F.ScaledReg) Key.push_back(F.ScaledReg);  in InsertFormula()
1525   assert((!F.ScaledReg || !F.ScaledReg->isZero()) &&  in InsertFormula()
1537   if (F.ScaledReg)  in InsertFormula()
1538     Regs.insert(F.ScaledReg);  in InsertFormula()
1556     if (F.ScaledReg) Regs.insert(F.ScaledReg);  in RecomputeRegs()
2605             F.ScaledReg == OrigF.ScaledReg &&  in FindUseWithSimilarFormula()
3327   if (F.ScaledReg)  in CountRegisters()
3328     RegUses.countRegister(F.ScaledReg, LUIdx);  in CountRegisters()
3537   const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx];  in GenerateReassociationsImpl()
3592         F.ScaledReg = nullptr;  in GenerateReassociationsImpl()
3596       F.ScaledReg = InnerSum;  in GenerateReassociationsImpl()
3709   const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx];  in GenerateSymbolicOffsetsImpl()
3718     F.ScaledReg = G;  in GenerateSymbolicOffsetsImpl()
3741   const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx];  in GenerateConstantOffsetsImpl()
3753           F.ScaledReg = nullptr;  in GenerateConstantOffsetsImpl()
3758         F.ScaledReg = NewG;  in GenerateConstantOffsetsImpl()
3774     F.ScaledReg = G;  in GenerateConstantOffsetsImpl()
3812   if (Base.ScaledReg && Base.ScaledReg->getType()->isPointerTy())  in GenerateICmpZeroScales()
3864     if (F.ScaledReg) {  in GenerateICmpZeroScales()
3865       F.ScaledReg = SE.getMulExpr(F.ScaledReg, FactorS);  in GenerateICmpZeroScales()
3866       if (getExactSDiv(F.ScaledReg, FactorS, SE) != Base.ScaledReg)  in GenerateICmpZeroScales()
3938           F.ScaledReg = Quotient;  in GenerateScales()
3971       if (F.ScaledReg) F.ScaledReg = SE.getAnyExtendExpr(F.ScaledReg, SrcTy);  in GenerateTruncates()
4114       if (F.ScaledReg == OrigReg) {  in GenerateCrossUseConstantOffsets()
4125         NewF.ScaledReg = SE.getAddExpr(NegImmS, NewF.ScaledReg);  in GenerateCrossUseConstantOffsets()
4130         if (const SCEVConstant *C = dyn_cast<SCEVConstant>(NewF.ScaledReg))  in GenerateCrossUseConstantOffsets()
4271         if (F.ScaledReg &&  in FilterOutUndesirableDedicatedRegisters()
4272             RegUses.isRegUsedByUsesOtherThan(F.ScaledReg, LUIdx))  in FilterOutUndesirableDedicatedRegisters()
4273           Key.push_back(F.ScaledReg);  in FilterOutUndesirableDedicatedRegisters()
4548       if (!F.ScaledReg)  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4550       auto P = BestFormulae.insert({{F.ScaledReg, F.Scale}, FIdx});  in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4682       if (const SCEV *ScaledReg = F.ScaledReg) {  in NarrowSearchSpaceByDeletingCostlyFormulas()  local
4683         if (!UniqRegs.count(ScaledReg)) {  in NarrowSearchSpaceByDeletingCostlyFormulas()
4685               RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4686           if (isa<SCEVAddRecExpr>(ScaledReg))  in NarrowSearchSpaceByDeletingCostlyFormulas()
4688                 RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4713     if (F.ScaledReg)  in NarrowSearchSpaceByDeletingCostlyFormulas()
4714       UniqRegs.insert(F.ScaledReg);  in NarrowSearchSpaceByDeletingCostlyFormulas()
4834       if ((F.ScaledReg && F.ScaledReg == Reg) ||  in SolveRecurse()
4858           VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]);  in SolveRecurse()
5078     const SCEV *ScaledS = F.ScaledReg;  in Expand()