Lines Matching refs:BaseRegs
382 SmallVector<const SCEV *, 4> BaseRegs; member
482 BaseRegs.push_back(Sum); in initialMatch()
488 BaseRegs.push_back(Sum); in initialMatch()
505 return BaseRegs.size() <= 1; in isCanonical()
510 if (Scale == 1 && BaseRegs.empty()) in isCanonical()
519 return none_of(BaseRegs, [&L](const SCEV *S) { in isCanonical()
534 if (BaseRegs.empty()) { in canonicalize()
538 BaseRegs.push_back(ScaledReg); in canonicalize()
546 ScaledReg = BaseRegs.pop_back_val(); in canonicalize()
554 auto I = find_if(BaseRegs, [&L](const SCEV *S) { in canonicalize()
557 if (I != BaseRegs.end()) in canonicalize()
571 BaseRegs.push_back(ScaledReg); in unscale()
579 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
587 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
593 return !BaseRegs.empty() ? BaseRegs.front()->getType() : in getType()
601 if (&S != &BaseRegs.back()) in deleteBaseReg()
602 std::swap(S, BaseRegs.back()); in deleteBaseReg()
603 BaseRegs.pop_back(); in deleteBaseReg()
608 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
618 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
635 for (const SCEV *BaseReg : BaseRegs) { in print()
639 if (HasBaseReg && BaseRegs.empty()) { in print()
642 } else if (!HasBaseReg && !BaseRegs.empty()) { in print()
1387 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1561 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1585 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1597 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1605 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in InsertFormula()
1626 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in RecomputeRegs()
2678 if (F.BaseRegs == OrigF.BaseRegs && in FindUseWithSimilarFormula()
3436 F.BaseRegs.push_back(S); in InsertSupplementalFormula()
3446 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3684 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3741 F.BaseRegs.erase(F.BaseRegs.begin() + Idx); in GenerateReassociationsImpl()
3745 F.BaseRegs[Idx] = InnerSum; in GenerateReassociationsImpl()
3755 F.BaseRegs.push_back(*J); in GenerateReassociationsImpl()
3780 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateReassociations()
3793 if (Base.BaseRegs.size() + (Base.Scale == 1) + in GenerateCombinations()
3802 NewBase.BaseRegs.clear(); in GenerateCombinations()
3804 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3812 NewBase.BaseRegs.push_back(BaseReg); in GenerateCombinations()
3830 F.BaseRegs.push_back(Sum); in GenerateCombinations()
3856 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3867 F.BaseRegs[Idx] = G; in GenerateSymbolicOffsetsImpl()
3877 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateSymbolicOffsets()
3902 F.deleteBaseReg(F.BaseRegs[Idx]); in GenerateConstantOffsetsImpl()
3907 F.BaseRegs[Idx] = NewG; in GenerateConstantOffsetsImpl()
3913 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3951 F.BaseRegs[Idx] = G; in GenerateConstantOffsetsImpl()
3969 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateConstantOffsets()
3993 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
4040 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { in GenerateICmpZeroScales()
4041 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
4042 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) in GenerateICmpZeroScales()
4090 Base.HasBaseReg = Base.BaseRegs.size() > 1; in GenerateScales()
4110 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { in GenerateScales()
4111 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i]); in GenerateScales()
4123 F.deleteBaseReg(F.BaseRegs[i]); in GenerateScales()
4127 if (F.Scale == 1 && (F.BaseRegs.empty() || in GenerateScales()
4179 if (any_of(Base.BaseRegs, in GenerateTruncates()
4203 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4386 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { in GenerateCrossUseConstantOffsets()
4387 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4402 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); in GenerateCrossUseConstantOffsets()
4407 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4512 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4602 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) { in NarrowSearchSpaceByDetectingSupersets()
4608 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4609 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4624 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4625 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4769 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4774 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4970 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
5008 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in NarrowSearchSpaceByDeletingCostlyFormulas()
5176 is_contained(F.BaseRegs, Reg)) { in SolveRecurse()
5200 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5419 for (const SCEV *Reg : F.BaseRegs) { in Expand()