Lines Matching refs:BaseRegs
342 SmallVector<const SCEV *, 4> BaseRegs; member
442 BaseRegs.push_back(Sum); in initialMatch()
448 BaseRegs.push_back(Sum); in initialMatch()
459 return BaseRegs.size() <= 1; in isCanonical()
464 if (Scale == 1 && BaseRegs.empty()) in isCanonical()
475 find_if(make_range(BaseRegs.begin(), BaseRegs.end()), [&](const SCEV *S) { in isCanonical()
479 return I == BaseRegs.end(); in isCanonical()
493 assert(!BaseRegs.empty() && "1*reg => reg, should not be needed."); in canonicalize()
497 ScaledReg = BaseRegs.back(); in canonicalize()
498 BaseRegs.pop_back(); in canonicalize()
507 auto I = find_if(make_range(BaseRegs.begin(), BaseRegs.end()), in canonicalize()
512 if (I != BaseRegs.end()) in canonicalize()
525 BaseRegs.push_back(ScaledReg); in unscale()
533 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
541 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
547 return !BaseRegs.empty() ? BaseRegs.front()->getType() : in getType()
555 if (&S != &BaseRegs.back()) in deleteBaseReg()
556 std::swap(S, BaseRegs.back()); in deleteBaseReg()
557 BaseRegs.pop_back(); in deleteBaseReg()
562 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
572 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
589 for (const SCEV *BaseReg : BaseRegs) { in print()
593 if (HasBaseReg && BaseRegs.empty()) { in print()
596 } else if (!HasBaseReg && !BaseRegs.empty()) { in print()
1321 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1492 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1516 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1528 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1536 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in InsertFormula()
1557 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in RecomputeRegs()
2604 if (F.BaseRegs == OrigF.BaseRegs && in FindUseWithSimilarFormula()
3319 F.BaseRegs.push_back(S); in InsertSupplementalFormula()
3329 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3537 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3594 F.BaseRegs.erase(F.BaseRegs.begin() + Idx); in GenerateReassociationsImpl()
3598 F.BaseRegs[Idx] = InnerSum; in GenerateReassociationsImpl()
3608 F.BaseRegs.push_back(*J); in GenerateReassociationsImpl()
3633 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateReassociations()
3646 if (Base.BaseRegs.size() + (Base.Scale == 1) + in GenerateCombinations()
3655 NewBase.BaseRegs.clear(); in GenerateCombinations()
3657 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3665 NewBase.BaseRegs.push_back(BaseReg); in GenerateCombinations()
3683 F.BaseRegs.push_back(Sum); in GenerateCombinations()
3709 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3720 F.BaseRegs[Idx] = G; in GenerateSymbolicOffsetsImpl()
3730 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateSymbolicOffsets()
3741 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3755 F.deleteBaseReg(F.BaseRegs[Idx]); in GenerateConstantOffsetsImpl()
3760 F.BaseRegs[Idx] = NewG; in GenerateConstantOffsetsImpl()
3776 F.BaseRegs[Idx] = G; in GenerateConstantOffsetsImpl()
3790 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateConstantOffsets()
3814 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
3857 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { in GenerateICmpZeroScales()
3858 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
3859 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) in GenerateICmpZeroScales()
3907 Base.HasBaseReg = Base.BaseRegs.size() > 1; in GenerateScales()
3927 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { in GenerateScales()
3928 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i]); in GenerateScales()
3939 F.deleteBaseReg(F.BaseRegs[i]); in GenerateScales()
3943 if (F.Scale == 1 && (F.BaseRegs.empty() || in GenerateScales()
3972 for (const SCEV *&BaseReg : F.BaseRegs) in GenerateTruncates()
4141 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { in GenerateCrossUseConstantOffsets()
4142 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4157 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); in GenerateCrossUseConstantOffsets()
4162 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4267 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4357 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) { in NarrowSearchSpaceByDetectingSupersets()
4361 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4362 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4377 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4378 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4522 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4527 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4674 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4712 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in NarrowSearchSpaceByDeletingCostlyFormulas()
4835 is_contained(F.BaseRegs, Reg)) { in SolveRecurse()
4858 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5067 for (const SCEV *Reg : F.BaseRegs) { in Expand()