Lines Matching refs:BaseRegs
368 SmallVector<const SCEV *, 4> BaseRegs; member
468 BaseRegs.push_back(Sum); in initialMatch()
474 BaseRegs.push_back(Sum); in initialMatch()
491 return BaseRegs.size() <= 1; in isCanonical()
496 if (Scale == 1 && BaseRegs.empty()) in isCanonical()
505 return none_of(BaseRegs, [&L](const SCEV *S) { in isCanonical()
520 if (BaseRegs.empty()) { in canonicalize()
524 BaseRegs.push_back(ScaledReg); in canonicalize()
532 ScaledReg = BaseRegs.pop_back_val(); in canonicalize()
540 auto I = find_if(BaseRegs, [&L](const SCEV *S) { in canonicalize()
543 if (I != BaseRegs.end()) in canonicalize()
557 BaseRegs.push_back(ScaledReg); in unscale()
565 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
573 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
579 return !BaseRegs.empty() ? BaseRegs.front()->getType() : in getType()
587 if (&S != &BaseRegs.back()) in deleteBaseReg()
588 std::swap(S, BaseRegs.back()); in deleteBaseReg()
589 BaseRegs.pop_back(); in deleteBaseReg()
594 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
604 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
621 for (const SCEV *BaseReg : BaseRegs) { in print()
625 if (HasBaseReg && BaseRegs.empty()) { in print()
628 } else if (!HasBaseReg && !BaseRegs.empty()) { in print()
1374 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1548 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1572 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1584 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1592 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in InsertFormula()
1613 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in RecomputeRegs()
2671 if (F.BaseRegs == OrigF.BaseRegs && in FindUseWithSimilarFormula()
3419 F.BaseRegs.push_back(S); in InsertSupplementalFormula()
3429 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3662 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3719 F.BaseRegs.erase(F.BaseRegs.begin() + Idx); in GenerateReassociationsImpl()
3723 F.BaseRegs[Idx] = InnerSum; in GenerateReassociationsImpl()
3733 F.BaseRegs.push_back(*J); in GenerateReassociationsImpl()
3758 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateReassociations()
3771 if (Base.BaseRegs.size() + (Base.Scale == 1) + in GenerateCombinations()
3780 NewBase.BaseRegs.clear(); in GenerateCombinations()
3782 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3790 NewBase.BaseRegs.push_back(BaseReg); in GenerateCombinations()
3808 F.BaseRegs.push_back(Sum); in GenerateCombinations()
3834 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3845 F.BaseRegs[Idx] = G; in GenerateSymbolicOffsetsImpl()
3855 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateSymbolicOffsets()
3880 F.deleteBaseReg(F.BaseRegs[Idx]); in GenerateConstantOffsetsImpl()
3885 F.BaseRegs[Idx] = NewG; in GenerateConstantOffsetsImpl()
3891 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3929 F.BaseRegs[Idx] = G; in GenerateConstantOffsetsImpl()
3947 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateConstantOffsets()
3971 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
4018 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { in GenerateICmpZeroScales()
4019 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
4020 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) in GenerateICmpZeroScales()
4068 Base.HasBaseReg = Base.BaseRegs.size() > 1; in GenerateScales()
4088 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { in GenerateScales()
4089 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i]); in GenerateScales()
4101 F.deleteBaseReg(F.BaseRegs[i]); in GenerateScales()
4105 if (F.Scale == 1 && (F.BaseRegs.empty() || in GenerateScales()
4134 if (any_of(Base.BaseRegs, in GenerateTruncates()
4153 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4336 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { in GenerateCrossUseConstantOffsets()
4337 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4352 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); in GenerateCrossUseConstantOffsets()
4357 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4462 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4552 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) { in NarrowSearchSpaceByDetectingSupersets()
4558 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4559 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4574 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4575 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4719 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4724 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4920 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4958 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in NarrowSearchSpaceByDeletingCostlyFormulas()
5087 is_contained(F.BaseRegs, Reg)) { in SolveRecurse()
5111 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5316 for (const SCEV *Reg : F.BaseRegs) { in Expand()