Lines Matching refs:ScaledReg

372   const SCEV *ScaledReg = nullptr;  member
490 if (!ScaledReg) in isCanonical()
499 if (containsAddRecDependentOnLoop(ScaledReg, L)) in isCanonical()
522 assert(ScaledReg && "Expected 1*reg => reg"); in canonicalize()
524 BaseRegs.push_back(ScaledReg); in canonicalize()
526 ScaledReg = nullptr; in canonicalize()
531 if (!ScaledReg) { in canonicalize()
532 ScaledReg = BaseRegs.pop_back_val(); in canonicalize()
539 if (!containsAddRecDependentOnLoop(ScaledReg, L)) { in canonicalize()
544 std::swap(ScaledReg, *I); in canonicalize()
557 BaseRegs.push_back(ScaledReg); in unscale()
558 ScaledReg = nullptr; in unscale()
565 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
573 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
580 ScaledReg ? ScaledReg->getType() : in getType()
594 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
601 if (ScaledReg) in hasRegsUsedByUsesOtherThan()
602 if (RegUses.isRegUsedByUsesOtherThan(ScaledReg, LUIdx)) in hasRegsUsedByUsesOtherThan()
635 if (ScaledReg) in print()
636 OS << *ScaledReg; in print()
1365 if (const SCEV *ScaledReg = F.ScaledReg) { in RateFormula() local
1366 if (VisitedRegs.count(ScaledReg)) { in RateFormula()
1370 RatePrimaryRegister(F, ScaledReg, Regs, LoserRegs); in RateFormula()
1549 if (F.ScaledReg) Key.push_back(F.ScaledReg); in HasFormulaWithSameRegs()
1573 if (F.ScaledReg) Key.push_back(F.ScaledReg); in InsertFormula()
1581 assert((!F.ScaledReg || !F.ScaledReg->isZero()) && in InsertFormula()
1593 if (F.ScaledReg) in InsertFormula()
1594 Regs.insert(F.ScaledReg); in InsertFormula()
1612 if (F.ScaledReg) Regs.insert(F.ScaledReg); in RecomputeRegs()
2672 F.ScaledReg == OrigF.ScaledReg && in FindUseWithSimilarFormula()
3427 if (F.ScaledReg) in CountRegisters()
3428 RegUses.countRegister(F.ScaledReg, LUIdx); in CountRegisters()
3662 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3717 F.ScaledReg = nullptr; in GenerateReassociationsImpl()
3721 F.ScaledReg = InnerSum; in GenerateReassociationsImpl()
3834 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3843 F.ScaledReg = G; in GenerateSymbolicOffsetsImpl()
3878 F.ScaledReg = nullptr; in GenerateConstantOffsetsImpl()
3883 F.ScaledReg = NewG; in GenerateConstantOffsetsImpl()
3891 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3927 F.ScaledReg = G; in GenerateConstantOffsetsImpl()
3969 if (Base.ScaledReg && Base.ScaledReg->getType()->isPointerTy()) in GenerateICmpZeroScales()
4025 if (F.ScaledReg) { in GenerateICmpZeroScales()
4026 F.ScaledReg = SE.getMulExpr(F.ScaledReg, FactorS); in GenerateICmpZeroScales()
4027 if (getExactSDiv(F.ScaledReg, FactorS, SE) != Base.ScaledReg) in GenerateICmpZeroScales()
4100 F.ScaledReg = Quotient; in GenerateScales()
4132 if (Base.ScaledReg && Base.ScaledReg->getType()->isPointerTy()) in GenerateTruncates()
4146 if (F.ScaledReg) { in GenerateTruncates()
4147 const SCEV *NewScaledReg = SE.getAnyExtendExpr(F.ScaledReg, SrcTy); in GenerateTruncates()
4150 F.ScaledReg = NewScaledReg; in GenerateTruncates()
4309 if (F.ScaledReg == OrigReg) { in GenerateCrossUseConstantOffsets()
4320 NewF.ScaledReg = SE.getAddExpr(NegImmS, NewF.ScaledReg); in GenerateCrossUseConstantOffsets()
4325 if (const SCEVConstant *C = dyn_cast<SCEVConstant>(NewF.ScaledReg)) in GenerateCrossUseConstantOffsets()
4466 if (F.ScaledReg && in FilterOutUndesirableDedicatedRegisters()
4467 RegUses.isRegUsedByUsesOtherThan(F.ScaledReg, LUIdx)) in FilterOutUndesirableDedicatedRegisters()
4468 Key.push_back(F.ScaledReg); in FilterOutUndesirableDedicatedRegisters()
4746 if (!F.ScaledReg) in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4748 auto P = BestFormulae.insert({{F.ScaledReg, F.Scale}, FIdx}); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4928 if (const SCEV *ScaledReg = F.ScaledReg) { in NarrowSearchSpaceByDeletingCostlyFormulas() local
4929 if (!UniqRegs.count(ScaledReg)) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4931 RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4932 if (isa<SCEVAddRecExpr>(ScaledReg)) in NarrowSearchSpaceByDeletingCostlyFormulas()
4934 RegNumMap[ScaledReg] / LU.getNotSelectedProbability(ScaledReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
4959 if (F.ScaledReg) in NarrowSearchSpaceByDeletingCostlyFormulas()
4960 UniqRegs.insert(F.ScaledReg); in NarrowSearchSpaceByDeletingCostlyFormulas()
5086 if ((F.ScaledReg && F.ScaledReg == Reg) || in SolveRecurse()
5111 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5327 const SCEV *ScaledS = F.ScaledReg; in Expand()