Lines Matching refs:BaseRegs
366 SmallVector<const SCEV *, 4> BaseRegs; member
466 BaseRegs.push_back(Sum); in initialMatch()
472 BaseRegs.push_back(Sum); in initialMatch()
483 return BaseRegs.size() <= 1; in isCanonical()
488 if (Scale == 1 && BaseRegs.empty()) in isCanonical()
498 auto I = find_if(BaseRegs, [&](const SCEV *S) { in isCanonical()
502 return I == BaseRegs.end(); in isCanonical()
515 if (BaseRegs.empty()) { in canonicalize()
519 BaseRegs.push_back(ScaledReg); in canonicalize()
527 ScaledReg = BaseRegs.pop_back_val(); in canonicalize()
536 auto I = find_if(BaseRegs, [&](const SCEV *S) { in canonicalize()
540 if (I != BaseRegs.end()) in canonicalize()
554 BaseRegs.push_back(ScaledReg); in unscale()
562 if (BaseRegs.size() != 1 || ScaledReg) in hasZeroEnd()
570 return !!ScaledReg + BaseRegs.size(); in getNumRegs()
576 return !BaseRegs.empty() ? BaseRegs.front()->getType() : in getType()
584 if (&S != &BaseRegs.back()) in deleteBaseReg()
585 std::swap(S, BaseRegs.back()); in deleteBaseReg()
586 BaseRegs.pop_back(); in deleteBaseReg()
591 return S == ScaledReg || is_contained(BaseRegs, S); in referencesReg()
601 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
618 for (const SCEV *BaseReg : BaseRegs) { in print()
622 if (HasBaseReg && BaseRegs.empty()) { in print()
625 } else if (!HasBaseReg && !BaseRegs.empty()) { in print()
1369 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1543 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1567 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1579 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1587 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in InsertFormula()
1608 Regs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in RecomputeRegs()
2668 if (F.BaseRegs == OrigF.BaseRegs && in FindUseWithSimilarFormula()
3403 F.BaseRegs.push_back(S); in InsertSupplementalFormula()
3413 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3621 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3678 F.BaseRegs.erase(F.BaseRegs.begin() + Idx); in GenerateReassociationsImpl()
3682 F.BaseRegs[Idx] = InnerSum; in GenerateReassociationsImpl()
3692 F.BaseRegs.push_back(*J); in GenerateReassociationsImpl()
3717 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateReassociations()
3730 if (Base.BaseRegs.size() + (Base.Scale == 1) + in GenerateCombinations()
3739 NewBase.BaseRegs.clear(); in GenerateCombinations()
3741 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3749 NewBase.BaseRegs.push_back(BaseReg); in GenerateCombinations()
3767 F.BaseRegs.push_back(Sum); in GenerateCombinations()
3793 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3804 F.BaseRegs[Idx] = G; in GenerateSymbolicOffsetsImpl()
3814 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateSymbolicOffsets()
3839 F.deleteBaseReg(F.BaseRegs[Idx]); in GenerateConstantOffsetsImpl()
3844 F.BaseRegs[Idx] = NewG; in GenerateConstantOffsetsImpl()
3850 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3888 F.BaseRegs[Idx] = G; in GenerateConstantOffsetsImpl()
3906 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) in GenerateConstantOffsets()
3930 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
3974 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) { in GenerateICmpZeroScales()
3975 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
3976 if (getExactSDiv(F.BaseRegs[i], FactorS, SE) != Base.BaseRegs[i]) in GenerateICmpZeroScales()
4024 Base.HasBaseReg = Base.BaseRegs.size() > 1; in GenerateScales()
4044 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) { in GenerateScales()
4045 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Base.BaseRegs[i]); in GenerateScales()
4056 F.deleteBaseReg(F.BaseRegs[i]); in GenerateScales()
4060 if (F.Scale == 1 && (F.BaseRegs.empty() || in GenerateScales()
4100 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4283 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) { in GenerateCrossUseConstantOffsets()
4284 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4299 NewF.BaseRegs[N] = SE.getAddExpr(NegImmS, BaseReg); in GenerateCrossUseConstantOffsets()
4304 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4409 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4499 I = F.BaseRegs.begin(), E = F.BaseRegs.end(); I != E; ++I) { in NarrowSearchSpaceByDetectingSupersets()
4505 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4506 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4521 NewF.BaseRegs.erase(NewF.BaseRegs.begin() + in NarrowSearchSpaceByDetectingSupersets()
4522 (I - F.BaseRegs.begin())); in NarrowSearchSpaceByDetectingSupersets()
4666 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4671 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4867 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4905 UniqRegs.insert(F.BaseRegs.begin(), F.BaseRegs.end()); in NarrowSearchSpaceByDeletingCostlyFormulas()
5034 is_contained(F.BaseRegs, Reg)) { in SolveRecurse()
5058 VisitedRegs.insert(F.ScaledReg ? F.ScaledReg : F.BaseRegs[0]); in SolveRecurse()
5267 for (const SCEV *Reg : F.BaseRegs) { in Expand()