Lines Matching refs:BaseRegs
510 SmallVector<const SCEV *, 4> BaseRegs; member
610 BaseRegs.push_back(Sum); in initialMatch()
616 BaseRegs.push_back(Sum); in initialMatch()
633 return BaseRegs.size() <= 1; in isCanonical()
638 if (Scale == 1 && BaseRegs.empty()) in isCanonical()
647 return none_of(BaseRegs, [&L](const SCEV *S) { in isCanonical()
662 if (BaseRegs.empty()) { in canonicalize()
666 BaseRegs.push_back(ScaledReg); in canonicalize()
674 ScaledReg = BaseRegs.pop_back_val(); in canonicalize()
682 auto I = find_if(BaseRegs, [&L](const SCEV *S) { in canonicalize()
685 if (I != BaseRegs.end()) in canonicalize()
699 BaseRegs.push_back(ScaledReg); in unscale()
707 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
715 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
721 return !BaseRegs.empty() ? BaseRegs.front()->getType() : in getType()
729 if (&S != &BaseRegs.back()) in deleteBaseReg()
730 std::swap(S, BaseRegs.back()); in deleteBaseReg()
731 BaseRegs.pop_back(); in deleteBaseReg()
736 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
746 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
763 for (const SCEV *BaseReg : BaseRegs) { in print()
767 if (HasBaseReg && BaseRegs.empty()) { in print()
770 } else if (!HasBaseReg && !BaseRegs.empty()) { in print()
1523 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1702 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1726 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1738 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1746 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in InsertFormula()
1767 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in RecomputeRegs()
2874 if (F.BaseRegs == OrigF.BaseRegs && in FindUseWithSimilarFormula()
3671 F.BaseRegs.push_back(S); in InsertSupplementalFormula()
3681 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3919 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3980 F.BaseRegs.erase(F.BaseRegs.begin() + Idx); in GenerateReassociationsImpl()
3984 F.BaseRegs[Idx] = InnerSum; in GenerateReassociationsImpl()
3995 F.BaseRegs.push_back(*J); in GenerateReassociationsImpl()
4020 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateReassociations()
4033 if (Base.BaseRegs.size() + (Base.Scale == 1) + in GenerateCombinations()
4043 NewBase.BaseRegs.clear(); in GenerateCombinations()
4045 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
4053 NewBase.BaseRegs.push_back(BaseReg); in GenerateCombinations()
4071 F.BaseRegs.push_back(Sum); in GenerateCombinations()
4097 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
4108 F.BaseRegs[Idx] = G; in GenerateSymbolicOffsetsImpl()
4118 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateSymbolicOffsets()
4146 F.deleteBaseReg(F.BaseRegs[Idx]); in GenerateConstantOffsetsImpl()
4151 F.BaseRegs[Idx] = NewG; in GenerateConstantOffsetsImpl()
4157 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
4198 F.BaseRegs[Idx] = G; in GenerateConstantOffsetsImpl()
4216 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateConstantOffsets()
4240 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
4291 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { in GenerateICmpZeroScales()
4292 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
4293 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) in GenerateICmpZeroScales()
4341 Base.HasBaseReg = Base.BaseRegs.size() > 1; in GenerateScales()
4361 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { in GenerateScales()
4362 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i]); in GenerateScales()
4374 F.deleteBaseReg(F.BaseRegs[i]); in GenerateScales()
4378 if (F.Scale == 1 && (F.BaseRegs.empty() || in GenerateScales()
4430 if (any_of(Base.BaseRegs, in GenerateTruncates()
4454 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4659 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { in GenerateCrossUseConstantOffsets()
4660 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4680 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); in GenerateCrossUseConstantOffsets()
4685 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4795 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4887 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) { in NarrowSearchSpaceByDetectingSupersets()
4895 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4896 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4911 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4912 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
5056 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5061 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5257 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
5295 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in NarrowSearchSpaceByDeletingCostlyFormulas()
5463 is_contained(F.BaseRegs, Reg)) { in SolveRecurse()
5487 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5716 for (const SCEV *Reg : F.BaseRegs) { in Expand()