Lines Matching refs:SCEV
266 using RegUsesTy = DenseMap<const SCEV *, RegSortData>;
269 SmallVector<const SCEV *, 16> RegSequence;
272 void countRegister(const SCEV *Reg, size_t LUIdx);
273 void dropRegister(const SCEV *Reg, size_t LUIdx);
276 bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const;
278 const SmallBitVector &getUsedByIndices(const SCEV *Reg) const;
282 using iterator = SmallVectorImpl<const SCEV *>::iterator;
283 using const_iterator = SmallVectorImpl<const SCEV *>::const_iterator;
294 RegUseTracker::countRegister(const SCEV *Reg, size_t LUIdx) { in countRegister()
305 RegUseTracker::dropRegister(const SCEV *Reg, size_t LUIdx) { in dropRegister()
329 RegUseTracker::isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const { in isRegUsedByUsesOtherThan()
340 const SmallBitVector &RegUseTracker::getUsedByIndices(const SCEV *Reg) const { in getUsedByIndices()
382 SmallVector<const SCEV *, 4> BaseRegs;
386 const SCEV *ScaledReg = nullptr;
395 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
408 void deleteBaseReg(const SCEV *&S);
410 bool referencesReg(const SCEV *S) const;
421 static void DoInitialMatch(const SCEV *S, Loop *L, in DoInitialMatch()
422 SmallVectorImpl<const SCEV *> &Good, in DoInitialMatch()
423 SmallVectorImpl<const SCEV *> &Bad, in DoInitialMatch()
433 for (const SCEV *S : Add->operands()) in DoInitialMatch()
445 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch()
453 SmallVector<const SCEV *, 4> Ops(drop_begin(Mul->operands())); in DoInitialMatch()
454 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch()
456 SmallVector<const SCEV *, 4> MyGood; in DoInitialMatch()
457 SmallVector<const SCEV *, 4> MyBad; in DoInitialMatch()
459 const SCEV *NegOne = SE.getSCEV(ConstantInt::getAllOnesValue( in DoInitialMatch()
461 for (const SCEV *S : MyGood) in DoInitialMatch()
463 for (const SCEV *S : MyBad) in DoInitialMatch()
475 void Formula::initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { in initialMatch()
476 SmallVector<const SCEV *, 4> Good; in initialMatch()
477 SmallVector<const SCEV *, 4> Bad; in initialMatch()
480 const SCEV *Sum = SE.getAddExpr(Good); in initialMatch()
486 const SCEV *Sum = SE.getAddExpr(Bad); in initialMatch()
494 static bool containsAddRecDependentOnLoop(const SCEV *S, const Loop &L) { in containsAddRecDependentOnLoop()
495 return SCEVExprContains(S, [&L](const SCEV *S) { in containsAddRecDependentOnLoop()
519 return none_of(BaseRegs, [&L](const SCEV *S) { in isCanonical()
554 auto I = find_if(BaseRegs, [&L](const SCEV *S) { in canonicalize()
600 void Formula::deleteBaseReg(const SCEV *&S) { in deleteBaseReg()
607 bool Formula::referencesReg(const SCEV *S) const { in referencesReg()
618 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
635 for (const SCEV *BaseReg : BaseRegs) { in print()
696 static const SCEV *getExactSDiv(const SCEV *LHS, const SCEV *RHS, in getExactSDiv()
733 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, in getExactSDiv()
736 const SCEV *Start = getExactSDiv(AR->getStart(), RHS, SE, in getExactSDiv()
742 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv()
750 SmallVector<const SCEV *, 8> Ops; in getExactSDiv()
751 for (const SCEV *S : Add->operands()) { in getExactSDiv()
752 const SCEV *Op = getExactSDiv(S, RHS, SE, IgnoreSignificantBits); in getExactSDiv()
771 SmallVector<const SCEV *, 4> LOps(drop_begin(Mul->operands())); in getExactSDiv()
772 SmallVector<const SCEV *, 4> ROps(drop_begin(MulRHS->operands())); in getExactSDiv()
779 SmallVector<const SCEV *, 4> Ops; in getExactSDiv()
781 for (const SCEV *S : Mul->operands()) { in getExactSDiv()
783 if (const SCEV *Q = getExactSDiv(S, RHS, SE, in getExactSDiv()
801 static int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) { in ExtractImmediate()
808 SmallVector<const SCEV *, 8> NewOps(Add->operands()); in ExtractImmediate()
814 SmallVector<const SCEV *, 8> NewOps(AR->operands()); in ExtractImmediate()
819 SCEV::FlagAnyWrap); in ExtractImmediate()
827 static GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) { in ExtractSymbol()
834 SmallVector<const SCEV *, 8> NewOps(Add->operands()); in ExtractSymbol()
840 SmallVector<const SCEV *, 8> NewOps(AR->operands()); in ExtractSymbol()
845 SCEV::FlagAnyWrap); in ExtractSymbol()
971 static bool isHighCostExpansion(const SCEV *S, in isHighCostExpansion()
972 SmallPtrSetImpl<const SCEV*> &Processed, in isHighCostExpansion()
997 for (const SCEV *S : Add->operands()) { in isHighCostExpansion()
1103 SmallPtrSetImpl<const SCEV *> &Regs,
1104 const DenseSet<const SCEV *> &VisitedRegs,
1106 SmallPtrSetImpl<const SCEV *> *LoserRegs = nullptr);
1112 void RateRegister(const Formula &F, const SCEV *Reg,
1113 SmallPtrSetImpl<const SCEV *> &Regs);
1114 void RatePrimaryRegister(const Formula &F, const SCEV *Reg,
1115 SmallPtrSetImpl<const SCEV *> &Regs,
1116 SmallPtrSetImpl<const SCEV *> *LoserRegs);
1150 static SmallVector<const SCEV *, 4> getEmptyKey() { in getEmptyKey()
1151 SmallVector<const SCEV *, 4> V; in getEmptyKey()
1152 V.push_back(reinterpret_cast<const SCEV *>(-1)); in getEmptyKey()
1156 static SmallVector<const SCEV *, 4> getTombstoneKey() { in getTombstoneKey()
1157 SmallVector<const SCEV *, 4> V; in getTombstoneKey()
1158 V.push_back(reinterpret_cast<const SCEV *>(-2)); in getTombstoneKey()
1162 static unsigned getHashValue(const SmallVector<const SCEV *, 4> &V) { in getHashValue()
1166 static bool isEqual(const SmallVector<const SCEV *, 4> &LHS, in isEqual()
1167 const SmallVector<const SCEV *, 4> &RHS) { in isEqual()
1178 DenseSet<SmallVector<const SCEV *, 4>, UniquifierDenseMapInfo> Uniquifier;
1191 using SCEVUseKindPair = PointerIntPair<const SCEV *, 2, KindType>;
1226 SmallPtrSet<const SCEV *, 4> Regs;
1244 float getNotSelectedProbability(const SCEV *Reg) const;
1261 static unsigned getSetupCost(const SCEV *Reg, unsigned Depth) { in getSetupCost()
1272 [&](unsigned i, const SCEV *Reg) { in getSetupCost()
1282 void Cost::RateRegister(const Formula &F, const SCEV *Reg, in RateRegister()
1283 SmallPtrSetImpl<const SCEV *> &Regs) { in RateRegister()
1316 const SCEV *LoopStep = AR->getStepRecurrence(*SE); in RateRegister()
1318 const SCEV *LoopStart = AR->getStart(); in RateRegister()
1352 void Cost::RatePrimaryRegister(const Formula &F, const SCEV *Reg, in RatePrimaryRegister()
1353 SmallPtrSetImpl<const SCEV *> &Regs, in RatePrimaryRegister()
1354 SmallPtrSetImpl<const SCEV *> *LoserRegs) { in RatePrimaryRegister()
1367 SmallPtrSetImpl<const SCEV *> &Regs, in RateFormula()
1368 const DenseSet<const SCEV *> &VisitedRegs, in RateFormula()
1370 SmallPtrSetImpl<const SCEV *> *LoserRegs) { in RateFormula()
1378 if (const SCEV *ScaledReg = F.ScaledReg) { in RateFormula()
1387 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1561 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1569 float LSRUse::getNotSelectedProbability(const SCEV *Reg) const { in getNotSelectedProbability()
1585 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1597 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1622 SmallPtrSet<const SCEV *, 4> OldRegs = std::move(Regs); in RecomputeRegs()
1630 for (const SCEV *S : OldRegs) in RecomputeRegs()
1866 MemAccessTy AccessTy, const SCEV *S, in isAlwaysFoldable()
1904 const SCEV *IncExpr;
1906 IVInc(Instruction *U, Value *O, const SCEV *E) in IVInc()
1914 const SCEV *ExprBase = nullptr;
1917 IVChain(const IVInc &Head, const SCEV *Base) in IVChain()
1941 bool isProfitableIncrement(const SCEV *OperExpr,
1942 const SCEV *IncExpr,
2032 std::pair<size_t, int64_t> getUse(const SCEV *&Expr, LSRUse::KindType Kind,
2039 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2040 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2084 const SmallPtrSet<const SCEV *, 16> &CurRegs,
2085 DenseSet<const SCEV *> &VisitedRegs) const;
2127 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); in OptimizeShadowIV()
2312 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); in OptimizeMax()
2315 const SCEV *One = SE.getConstant(BackedgeTakenCount->getType(), 1); in OptimizeMax()
2318 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount); in OptimizeMax()
2345 const SCEV *MaxLHS = Max->getOperand(0); in OptimizeMax()
2346 const SCEV *MaxRHS = Max->getOperand(1); in OptimizeMax()
2356 const SCEV *IV = SE.getSCEV(Cond->getOperand(0)); in OptimizeMax()
2483 const SCEV *A = IU.getStride(*CondUse, L); in OptimizeLoopTermCond()
2484 const SCEV *B = IU.getStride(*UI, L); in OptimizeLoopTermCond()
2612 std::pair<size_t, int64_t> LSRInstance::getUse(const SCEV *&Expr, in getUse()
2615 const SCEV *Copy = Expr; in getUse()
2699 SmallSetVector<const SCEV *, 4> Strides; in CollectInterestingTypesAndFactors()
2702 SmallVector<const SCEV *, 4> Worklist; in CollectInterestingTypesAndFactors()
2704 const SCEV *Expr = IU.getExpr(U); in CollectInterestingTypesAndFactors()
2714 const SCEV *S = Worklist.pop_back_val(); in CollectInterestingTypesAndFactors()
2726 for (SmallSetVector<const SCEV *, 4>::const_iterator in CollectInterestingTypesAndFactors()
2728 for (SmallSetVector<const SCEV *, 4>::const_iterator NewStrideIter = in CollectInterestingTypesAndFactors()
2730 const SCEV *OldStride = *I; in CollectInterestingTypesAndFactors()
2731 const SCEV *NewStride = *NewStrideIter; in CollectInterestingTypesAndFactors()
2802 static const SCEV *getExprBase(const SCEV *S) { in getExprBase()
2820 for (const SCEV *SubExpr : reverse(Add->operands())) { in getExprBase()
2840 bool IVChain::isProfitableIncrement(const SCEV *OperExpr, in isProfitableIncrement()
2841 const SCEV *IncExpr, in isProfitableIncrement()
2850 const SCEV *HeadExpr = SE.getSCEV(getWideOperand(Incs[0].IVOperand)); in isProfitableIncrement()
2855 SmallPtrSet<const SCEV*, 8> Processed; in isProfitableIncrement()
2897 const SCEV *LastIncExpr = nullptr; in isProfitableChain()
2953 const SCEV *const OperExpr = SE.getSCEV(NextIV); in ChainInstruction()
2954 const SCEV *const OperExprBase = getExprBase(OperExpr); in ChainInstruction()
2959 const SCEV *LastIncExpr = nullptr; in ChainInstruction()
2979 const SCEV *PrevExpr = SE.getSCEV(PrevIV); in ChainInstruction()
2980 const SCEV *IncExpr = SE.getMinusSCEV(OperExpr, PrevExpr); in ChainInstruction()
3162 static bool canFoldIVIncExpr(const SCEV *IncExpr, Instruction *UserInst, in canFoldIVIncExpr()
3219 const SCEV *LeftOverExpr = nullptr; in GenerateIVChain()
3231 const SCEV *IncExpr = SE.getNoopOrSignExtend(Inc.IncExpr, IntTy); in GenerateIVChain()
3239 const SCEV *IVOperExpr = SE.getAddExpr(SE.getUnknown(IVSrc), in GenerateIVChain()
3290 SmallPtrSet<const SCEV *, 16> Regs; in CollectFixupsAndInitialFormulae()
3291 DenseSet<const SCEV *> VisitedRegs; in CollectFixupsAndInitialFormulae()
3312 const SCEV *S = IU.getExpr(U); in CollectFixupsAndInitialFormulae()
3340 const SCEV *N = SE.getSCEV(NV); in CollectFixupsAndInitialFormulae()
3418 void LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, in InsertInitialFormula()
3433 LSRInstance::InsertSupplementalFormula(const SCEV *S, in InsertSupplementalFormula()
3446 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3471 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); in CollectLoopInvariantFixupsAndFormulae()
3472 SmallPtrSet<const SCEV *, 32> Visited; in CollectLoopInvariantFixupsAndFormulae()
3480 const SCEV *S = Worklist.pop_back_val(); in CollectLoopInvariantFixupsAndFormulae()
3554 const SCEV *UserS = SE.getSCEV(const_cast<Instruction *>(UserInst)); in CollectLoopInvariantFixupsAndFormulae()
3599 static const SCEV *CollectSubexprs(const SCEV *S, const SCEVConstant *C, in CollectSubexprs()
3600 SmallVectorImpl<const SCEV *> &Ops, in CollectSubexprs()
3610 for (const SCEV *S : Add->operands()) { in CollectSubexprs()
3611 const SCEV *Remainder = CollectSubexprs(S, C, Ops, L, SE, Depth+1); in CollectSubexprs()
3621 const SCEV *Remainder = CollectSubexprs(AR->getStart(), in CollectSubexprs()
3636 SCEV::FlagAnyWrap); in CollectSubexprs()
3645 const SCEV *Remainder = in CollectSubexprs()
3658 LSRUse &LU, const SCEV *S, const Loop *L, in mayUsePostIncMode()
3666 const SCEV *LoopStep = AR->getStepRecurrence(SE); in mayUsePostIncMode()
3672 const SCEV *LoopStart = AR->getStart(); in mayUsePostIncMode()
3684 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3691 SmallVector<const SCEV *, 8> AddOps; in GenerateReassociationsImpl()
3692 const SCEV *Remainder = CollectSubexprs(BaseReg, nullptr, AddOps, L, SE); in GenerateReassociationsImpl()
3699 for (SmallVectorImpl<const SCEV *>::const_iterator J = AddOps.begin(), in GenerateReassociationsImpl()
3714 SmallVector<const SCEV *, 8> InnerAddOps( in GenerateReassociationsImpl()
3715 ((const SmallVector<const SCEV *, 8> &)AddOps).begin(), J); in GenerateReassociationsImpl()
3717 ((const SmallVector<const SCEV *, 8> &)AddOps).end()); in GenerateReassociationsImpl()
3726 const SCEV *InnerSum = SE.getAddExpr(InnerAddOps); in GenerateReassociationsImpl()
3800 SmallVector<const SCEV *, 4> Ops; in GenerateCombinations()
3804 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3821 auto GenerateFormula = [&](const SCEV *Sum) { in GenerateCombinations()
3837 SmallVector<const SCEV *, 4> OpsCopy(Ops); // Don't let SE modify Ops. in GenerateCombinations()
3856 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3889 auto GenerateOffset = [&](const SCEV *G, int64_t Offset) { in GenerateConstantOffsetsImpl()
3895 const SCEV *NewG = SE.getAddExpr(SE.getConstant(G->getType(), Offset), G); in GenerateConstantOffsetsImpl()
3913 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3993 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
4037 const SCEV *FactorS = SE.getConstant(IntTy, Factor); in GenerateICmpZeroScales()
4113 const SCEV *FactorS = SE.getConstant(IntTy, Factor); in GenerateScales()
4118 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) in GenerateScales()
4146 static const SCEV *
4148 const SCEV *Expr, Type *ToTy, in getAnyExtendConsideringPostIncUses()
4150 const SCEV *Result = nullptr; in getAnyExtendConsideringPostIncUses()
4153 const SCEV *NewDenormExpr = SE.getAnyExtendExpr(DenormExpr, ToTy); in getAnyExtendConsideringPostIncUses()
4154 const SCEV *New = normalizeForPostIncUse(NewDenormExpr, L, SE); in getAnyExtendConsideringPostIncUses()
4180 [](const SCEV *S) { return S->getType()->isPointerTy(); })) in GenerateTruncates()
4196 const SCEV *NewScaledReg = in GenerateTruncates()
4203 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4204 const SCEV *NewBaseReg = in GenerateTruncates()
4234 const SCEV *OrigReg;
4236 WorkItem(size_t LI, int64_t I, const SCEV *R) in WorkItem()
4260 using ImmMapTy = std::map<int64_t, const SCEV *>; in GenerateCrossUseConstantOffsets()
4262 DenseMap<const SCEV *, ImmMapTy> Map; in GenerateCrossUseConstantOffsets()
4263 DenseMap<const SCEV *, SmallBitVector> UsedByIndicesMap; in GenerateCrossUseConstantOffsets()
4264 SmallVector<const SCEV *, 8> Sequence; in GenerateCrossUseConstantOffsets()
4265 for (const SCEV *Use : RegUses) { in GenerateCrossUseConstantOffsets()
4266 const SCEV *Reg = Use; // Make a copy for ExtractImmediate to modify. in GenerateCrossUseConstantOffsets()
4280 for (const SCEV *Reg : Sequence) { in GenerateCrossUseConstantOffsets()
4296 const SCEV *OrigReg = J->second; in GenerateCrossUseConstantOffsets()
4344 const SCEV *OrigReg = WI.OrigReg; in GenerateCrossUseConstantOffsets()
4347 const SCEV *NegImmS = SE.getSCEV(ConstantInt::get(IntTy, -(uint64_t)Imm)); in GenerateCrossUseConstantOffsets()
4387 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4407 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4466 DenseSet<const SCEV *> VisitedRegs; in FilterOutUndesirableDedicatedRegisters()
4467 SmallPtrSet<const SCEV *, 16> Regs; in FilterOutUndesirableDedicatedRegisters()
4468 SmallPtrSet<const SCEV *, 16> LoserRegs; in FilterOutUndesirableDedicatedRegisters()
4476 DenseMap<SmallVector<const SCEV *, 4>, size_t, UniquifierDenseMapInfo>; in FilterOutUndesirableDedicatedRegisters()
4511 SmallVector<const SCEV *, 4> Key; in FilterOutUndesirableDedicatedRegisters()
4512 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4601 for (SmallVectorImpl<const SCEV *>::const_iterator in NarrowSearchSpaceByDetectingSupersets()
4748 using BestFormulaeTy = DenseMap<std::pair<const SCEV *, int64_t>, size_t>; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4754 DenseSet<const SCEV *> VisitedRegs; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4755 SmallPtrSet<const SCEV *, 16> Regs; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4769 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4774 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4930 SmallPtrSet<const SCEV *, 4> UniqRegs; in NarrowSearchSpaceByDeletingCostlyFormulas()
4934 DenseMap <const SCEV *, float> RegNumMap; in NarrowSearchSpaceByDeletingCostlyFormulas()
4935 for (const SCEV *Reg : RegUses) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4970 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4978 if (const SCEV *ScaledReg = F.ScaledReg) { in NarrowSearchSpaceByDeletingCostlyFormulas()
5019 ScalarEvolution &SE, const SCEV *Best, in IsSimplerBaseSCEVForTarget()
5020 const SCEV *Reg, in IsSimplerBaseSCEVForTarget()
5047 SmallPtrSet<const SCEV *, 4> Taken; in NarrowSearchSpaceByPickingWinnerRegs()
5055 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs()
5057 for (const SCEV *Reg : RegUses) { in NarrowSearchSpaceByPickingWinnerRegs()
5140 const SmallPtrSet<const SCEV *, 16> &CurRegs, in SolveRecurse() argument
5141 DenseSet<const SCEV *> &VisitedRegs) const { in SolveRecurse()
5158 SmallSetVector<const SCEV *, 4> ReqRegs; in SolveRecurse()
5159 for (const SCEV *S : CurRegs) in SolveRecurse()
5163 SmallPtrSet<const SCEV *, 16> NewRegs; in SolveRecurse()
5174 for (const SCEV *Reg : ReqRegs) { in SolveRecurse()
5204 for (const SCEV *S : NewRegs) dbgs() in SolveRecurse()
5223 SmallPtrSet<const SCEV *, 16> CurRegs; in Solve()
5224 DenseSet<const SCEV *> VisitedRegs; in Solve()
5416 SmallVector<const SCEV *, 8> Ops; in Expand()
5419 for (const SCEV *Reg : F.BaseRegs) { in Expand()
5430 const SCEV *ScaledS = F.ScaledReg; in Expand()
5516 const SCEV *FullS = Ops.empty() ? in Expand()
6151 const llvm::SCEV *Inner = C->getOperand(0); in pushCast()
6164 bool pushSCEV(const llvm::SCEV *S) { in pushSCEV()
6205 bool isIdentityFunction(uint64_t Op, const SCEV *S) { in isIdentityFunction()
6234 const SCEV *Start = SAR.getStart(); in SCEVToValueExpr()
6235 const SCEV *Stride = SAR.getStepRecurrence(SE); in SCEVToValueExpr()
6263 bool createIterCountExpr(const SCEV *S, in createIterCountExpr()
6306 const SCEV *Start = SAR.getStart(); in SCEVToIterCountExpr()
6307 const SCEV *Stride = SAR.getStepRecurrence(SE); in SCEVToIterCountExpr()
6378 SmallVector<const llvm::SCEV *, 2> SCEVs;
6521 const SCEV *SCEVInductionVar, in SalvageDVI()
6636 const llvm::SCEV *SCEVInductionVar = SE.getSCEV(LSRInductionVar); in DbgRewriteSalvageableDVIs()
6691 const SCEV *S = SE.getSCEV(LocOp); in DbgGatherSalvagableDVI()
6763 static std::optional<std::tuple<PHINode *, PHINode *, const SCEV *, bool>>
6816 const SCEV *BECount = SE.getBackedgeTakenCount(L); in canFoldTermCondOfLoop()
6821 const SCEV *TermValueS = nullptr; in canFoldTermCondOfLoop()
6856 const SCEV *TermValueSLocal = PostInc->evaluateAtIteration(BECount, SE); in canFoldTermCondOfLoop()