Lines Matching refs:SCEV
252 using RegUsesTy = DenseMap<const SCEV *, RegSortData>;
255 SmallVector<const SCEV *, 16> RegSequence;
258 void countRegister(const SCEV *Reg, size_t LUIdx);
259 void dropRegister(const SCEV *Reg, size_t LUIdx);
262 bool isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const;
264 const SmallBitVector &getUsedByIndices(const SCEV *Reg) const;
268 using iterator = SmallVectorImpl<const SCEV *>::iterator;
269 using const_iterator = SmallVectorImpl<const SCEV *>::const_iterator;
280 RegUseTracker::countRegister(const SCEV *Reg, size_t LUIdx) { in countRegister()
291 RegUseTracker::dropRegister(const SCEV *Reg, size_t LUIdx) { in dropRegister()
315 RegUseTracker::isRegUsedByUsesOtherThan(const SCEV *Reg, size_t LUIdx) const { in isRegUsedByUsesOtherThan()
326 const SmallBitVector &RegUseTracker::getUsedByIndices(const SCEV *Reg) const { in getUsedByIndices()
368 SmallVector<const SCEV *, 4> BaseRegs;
372 const SCEV *ScaledReg = nullptr;
381 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
394 void deleteBaseReg(const SCEV *&S);
396 bool referencesReg(const SCEV *S) const;
407 static void DoInitialMatch(const SCEV *S, Loop *L, in DoInitialMatch()
408 SmallVectorImpl<const SCEV *> &Good, in DoInitialMatch()
409 SmallVectorImpl<const SCEV *> &Bad, in DoInitialMatch()
419 for (const SCEV *S : Add->operands()) in DoInitialMatch()
431 AR->getLoop(), SCEV::FlagAnyWrap), in DoInitialMatch()
439 SmallVector<const SCEV *, 4> Ops(drop_begin(Mul->operands())); in DoInitialMatch()
440 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch()
442 SmallVector<const SCEV *, 4> MyGood; in DoInitialMatch()
443 SmallVector<const SCEV *, 4> MyBad; in DoInitialMatch()
445 const SCEV *NegOne = SE.getSCEV(ConstantInt::getAllOnesValue( in DoInitialMatch()
447 for (const SCEV *S : MyGood) in DoInitialMatch()
449 for (const SCEV *S : MyBad) in DoInitialMatch()
461 void Formula::initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { in initialMatch()
462 SmallVector<const SCEV *, 4> Good; in initialMatch()
463 SmallVector<const SCEV *, 4> Bad; in initialMatch()
466 const SCEV *Sum = SE.getAddExpr(Good); in initialMatch()
472 const SCEV *Sum = SE.getAddExpr(Bad); in initialMatch()
480 static bool containsAddRecDependentOnLoop(const SCEV *S, const Loop &L) { in containsAddRecDependentOnLoop()
481 return SCEVExprContains(S, [&L](const SCEV *S) { in containsAddRecDependentOnLoop()
505 return none_of(BaseRegs, [&L](const SCEV *S) { in isCanonical()
540 auto I = find_if(BaseRegs, [&L](const SCEV *S) { in canonicalize()
586 void Formula::deleteBaseReg(const SCEV *&S) { in deleteBaseReg()
593 bool Formula::referencesReg(const SCEV *S) const { in referencesReg()
604 for (const SCEV *BaseReg : BaseRegs) in hasRegsUsedByUsesOtherThan()
621 for (const SCEV *BaseReg : BaseRegs) { in print()
682 static const SCEV *getExactSDiv(const SCEV *LHS, const SCEV *RHS, in getExactSDiv()
719 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, in getExactSDiv()
722 const SCEV *Start = getExactSDiv(AR->getStart(), RHS, SE, in getExactSDiv()
728 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap); in getExactSDiv()
736 SmallVector<const SCEV *, 8> Ops; in getExactSDiv()
737 for (const SCEV *S : Add->operands()) { in getExactSDiv()
738 const SCEV *Op = getExactSDiv(S, RHS, SE, IgnoreSignificantBits); in getExactSDiv()
757 SmallVector<const SCEV *, 4> LOps(drop_begin(Mul->operands())); in getExactSDiv()
758 SmallVector<const SCEV *, 4> ROps(drop_begin(MulRHS->operands())); in getExactSDiv()
765 SmallVector<const SCEV *, 4> Ops; in getExactSDiv()
767 for (const SCEV *S : Mul->operands()) { in getExactSDiv()
769 if (const SCEV *Q = getExactSDiv(S, RHS, SE, in getExactSDiv()
787 static int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) { in ExtractImmediate()
794 SmallVector<const SCEV *, 8> NewOps(Add->operands()); in ExtractImmediate()
800 SmallVector<const SCEV *, 8> NewOps(AR->operands()); in ExtractImmediate()
805 SCEV::FlagAnyWrap); in ExtractImmediate()
813 static GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) { in ExtractSymbol()
820 SmallVector<const SCEV *, 8> NewOps(Add->operands()); in ExtractSymbol()
826 SmallVector<const SCEV *, 8> NewOps(AR->operands()); in ExtractSymbol()
831 SCEV::FlagAnyWrap); in ExtractSymbol()
959 static bool isHighCostExpansion(const SCEV *S, in isHighCostExpansion()
960 SmallPtrSetImpl<const SCEV*> &Processed, in isHighCostExpansion()
984 for (const SCEV *S : Add->operands()) { in isHighCostExpansion()
1090 SmallPtrSetImpl<const SCEV *> &Regs,
1091 const DenseSet<const SCEV *> &VisitedRegs,
1093 SmallPtrSetImpl<const SCEV *> *LoserRegs = nullptr);
1099 void RateRegister(const Formula &F, const SCEV *Reg,
1100 SmallPtrSetImpl<const SCEV *> &Regs);
1101 void RatePrimaryRegister(const Formula &F, const SCEV *Reg,
1102 SmallPtrSetImpl<const SCEV *> &Regs,
1103 SmallPtrSetImpl<const SCEV *> *LoserRegs);
1137 static SmallVector<const SCEV *, 4> getEmptyKey() { in getEmptyKey()
1138 SmallVector<const SCEV *, 4> V; in getEmptyKey()
1139 V.push_back(reinterpret_cast<const SCEV *>(-1)); in getEmptyKey()
1143 static SmallVector<const SCEV *, 4> getTombstoneKey() { in getTombstoneKey()
1144 SmallVector<const SCEV *, 4> V; in getTombstoneKey()
1145 V.push_back(reinterpret_cast<const SCEV *>(-2)); in getTombstoneKey()
1149 static unsigned getHashValue(const SmallVector<const SCEV *, 4> &V) { in getHashValue()
1153 static bool isEqual(const SmallVector<const SCEV *, 4> &LHS, in isEqual()
1154 const SmallVector<const SCEV *, 4> &RHS) { in isEqual()
1165 DenseSet<SmallVector<const SCEV *, 4>, UniquifierDenseMapInfo> Uniquifier;
1178 using SCEVUseKindPair = PointerIntPair<const SCEV *, 2, KindType>;
1213 SmallPtrSet<const SCEV *, 4> Regs;
1231 float getNotSelectedProbability(const SCEV *Reg) const;
1248 static unsigned getSetupCost(const SCEV *Reg, unsigned Depth) { in getSetupCost()
1259 [&](unsigned i, const SCEV *Reg) { in getSetupCost()
1269 void Cost::RateRegister(const Formula &F, const SCEV *Reg, in RateRegister()
1270 SmallPtrSetImpl<const SCEV *> &Regs) { in RateRegister()
1303 const SCEV *LoopStep = AR->getStepRecurrence(*SE); in RateRegister()
1305 const SCEV *LoopStart = AR->getStart(); in RateRegister()
1339 void Cost::RatePrimaryRegister(const Formula &F, const SCEV *Reg, in RatePrimaryRegister()
1340 SmallPtrSetImpl<const SCEV *> &Regs, in RatePrimaryRegister()
1341 SmallPtrSetImpl<const SCEV *> *LoserRegs) { in RatePrimaryRegister()
1354 SmallPtrSetImpl<const SCEV *> &Regs, in RateFormula()
1355 const DenseSet<const SCEV *> &VisitedRegs, in RateFormula()
1357 SmallPtrSetImpl<const SCEV *> *LoserRegs) { in RateFormula()
1365 if (const SCEV *ScaledReg = F.ScaledReg) { in RateFormula()
1374 for (const SCEV *BaseReg : F.BaseRegs) { in RateFormula()
1548 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in HasFormulaWithSameRegs()
1556 float LSRUse::getNotSelectedProbability(const SCEV *Reg) const { in getNotSelectedProbability()
1572 SmallVector<const SCEV *, 4> Key = F.BaseRegs; in InsertFormula()
1584 for (const SCEV *BaseReg : F.BaseRegs) in InsertFormula()
1609 SmallPtrSet<const SCEV *, 4> OldRegs = std::move(Regs); in RecomputeRegs()
1617 for (const SCEV *S : OldRegs) in RecomputeRegs()
1853 MemAccessTy AccessTy, const SCEV *S, in isAlwaysFoldable()
1891 const SCEV *IncExpr;
1893 IVInc(Instruction *U, Value *O, const SCEV *E) in IVInc()
1901 const SCEV *ExprBase = nullptr;
1904 IVChain(const IVInc &Head, const SCEV *Base) in IVChain()
1928 bool isProfitableIncrement(const SCEV *OperExpr,
1929 const SCEV *IncExpr,
2015 std::pair<size_t, int64_t> getUse(const SCEV *&Expr, LSRUse::KindType Kind,
2022 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2023 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
2067 const SmallPtrSet<const SCEV *, 16> &CurRegs,
2068 DenseSet<const SCEV *> &VisitedRegs) const;
2110 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); in OptimizeShadowIV()
2295 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); in OptimizeMax()
2298 const SCEV *One = SE.getConstant(BackedgeTakenCount->getType(), 1); in OptimizeMax()
2301 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount); in OptimizeMax()
2328 const SCEV *MaxLHS = Max->getOperand(0); in OptimizeMax()
2329 const SCEV *MaxRHS = Max->getOperand(1); in OptimizeMax()
2339 const SCEV *IV = SE.getSCEV(Cond->getOperand(0)); in OptimizeMax()
2468 const SCEV *A = IU.getStride(*CondUse, L); in OptimizeLoopTermCond()
2469 const SCEV *B = IU.getStride(*UI, L); in OptimizeLoopTermCond()
2604 std::pair<size_t, int64_t> LSRInstance::getUse(const SCEV *&Expr, in getUse()
2607 const SCEV *Copy = Expr; in getUse()
2692 SmallSetVector<const SCEV *, 4> Strides; in CollectInterestingTypesAndFactors()
2695 SmallVector<const SCEV *, 4> Worklist; in CollectInterestingTypesAndFactors()
2697 const SCEV *Expr = IU.getExpr(U); in CollectInterestingTypesAndFactors()
2705 const SCEV *S = Worklist.pop_back_val(); in CollectInterestingTypesAndFactors()
2717 for (SmallSetVector<const SCEV *, 4>::const_iterator in CollectInterestingTypesAndFactors()
2719 for (SmallSetVector<const SCEV *, 4>::const_iterator NewStrideIter = in CollectInterestingTypesAndFactors()
2721 const SCEV *OldStride = *I; in CollectInterestingTypesAndFactors()
2722 const SCEV *NewStride = *NewStrideIter; in CollectInterestingTypesAndFactors()
2805 static const SCEV *getExprBase(const SCEV *S) { in getExprBase()
2822 for (const SCEV *SubExpr : reverse(Add->operands())) { in getExprBase()
2842 bool IVChain::isProfitableIncrement(const SCEV *OperExpr, in isProfitableIncrement()
2843 const SCEV *IncExpr, in isProfitableIncrement()
2852 const SCEV *HeadExpr = SE.getSCEV(getWideOperand(Incs[0].IVOperand)); in isProfitableIncrement()
2857 SmallPtrSet<const SCEV*, 8> Processed; in isProfitableIncrement()
2899 const SCEV *LastIncExpr = nullptr; in isProfitableChain()
2955 const SCEV *const OperExpr = SE.getSCEV(NextIV); in ChainInstruction()
2956 const SCEV *const OperExprBase = getExprBase(OperExpr); in ChainInstruction()
2961 const SCEV *LastIncExpr = nullptr; in ChainInstruction()
2981 const SCEV *PrevExpr = SE.getSCEV(PrevIV); in ChainInstruction()
2982 const SCEV *IncExpr = SE.getMinusSCEV(OperExpr, PrevExpr); in ChainInstruction()
3164 static bool canFoldIVIncExpr(const SCEV *IncExpr, Instruction *UserInst, in canFoldIVIncExpr()
3221 const SCEV *LeftOverExpr = nullptr; in GenerateIVChain()
3233 const SCEV *IncExpr = SE.getNoopOrSignExtend(Inc.IncExpr, IntTy); in GenerateIVChain()
3241 const SCEV *IVOperExpr = SE.getAddExpr(SE.getUnknown(IVSrc), in GenerateIVChain()
3309 const SCEV *S = IU.getExpr(U); in CollectFixupsAndInitialFormulae()
3335 const SCEV *N = SE.getSCEV(NV); in CollectFixupsAndInitialFormulae()
3401 void LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, in InsertInitialFormula()
3416 LSRInstance::InsertSupplementalFormula(const SCEV *S, in InsertSupplementalFormula()
3429 for (const SCEV *BaseReg : F.BaseRegs) in CountRegisters()
3454 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); in CollectLoopInvariantFixupsAndFormulae()
3455 SmallPtrSet<const SCEV *, 32> Visited; in CollectLoopInvariantFixupsAndFormulae()
3458 const SCEV *S = Worklist.pop_back_val(); in CollectLoopInvariantFixupsAndFormulae()
3532 const SCEV *UserS = SE.getSCEV(const_cast<Instruction *>(UserInst)); in CollectLoopInvariantFixupsAndFormulae()
3577 static const SCEV *CollectSubexprs(const SCEV *S, const SCEVConstant *C, in CollectSubexprs()
3578 SmallVectorImpl<const SCEV *> &Ops, in CollectSubexprs()
3588 for (const SCEV *S : Add->operands()) { in CollectSubexprs()
3589 const SCEV *Remainder = CollectSubexprs(S, C, Ops, L, SE, Depth+1); in CollectSubexprs()
3599 const SCEV *Remainder = CollectSubexprs(AR->getStart(), in CollectSubexprs()
3614 SCEV::FlagAnyWrap); in CollectSubexprs()
3623 const SCEV *Remainder = in CollectSubexprs()
3636 LSRUse &LU, const SCEV *S, const Loop *L, in mayUsePostIncMode()
3644 const SCEV *LoopStep = AR->getStepRecurrence(SE); in mayUsePostIncMode()
3650 const SCEV *LoopStart = AR->getStart(); in mayUsePostIncMode()
3662 const SCEV *BaseReg = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateReassociationsImpl()
3669 SmallVector<const SCEV *, 8> AddOps; in GenerateReassociationsImpl()
3670 const SCEV *Remainder = CollectSubexprs(BaseReg, nullptr, AddOps, L, SE); in GenerateReassociationsImpl()
3677 for (SmallVectorImpl<const SCEV *>::const_iterator J = AddOps.begin(), in GenerateReassociationsImpl()
3692 SmallVector<const SCEV *, 8> InnerAddOps( in GenerateReassociationsImpl()
3693 ((const SmallVector<const SCEV *, 8> &)AddOps).begin(), J); in GenerateReassociationsImpl()
3695 ((const SmallVector<const SCEV *, 8> &)AddOps).end()); in GenerateReassociationsImpl()
3704 const SCEV *InnerSum = SE.getAddExpr(InnerAddOps); in GenerateReassociationsImpl()
3778 SmallVector<const SCEV *, 4> Ops; in GenerateCombinations()
3782 for (const SCEV *BaseReg : Base.BaseRegs) { in GenerateCombinations()
3799 auto GenerateFormula = [&](const SCEV *Sum) { in GenerateCombinations()
3815 SmallVector<const SCEV *, 4> OpsCopy(Ops); // Don't let SE modify Ops. in GenerateCombinations()
3834 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateSymbolicOffsetsImpl()
3867 auto GenerateOffset = [&](const SCEV *G, int64_t Offset) { in GenerateConstantOffsetsImpl()
3873 const SCEV *NewG = SE.getAddExpr(SE.getConstant(G->getType(), Offset), G); in GenerateConstantOffsetsImpl()
3891 const SCEV *G = IsScaledReg ? Base.ScaledReg : Base.BaseRegs[Idx]; in GenerateConstantOffsetsImpl()
3971 for (const SCEV *BaseReg : Base.BaseRegs) in GenerateICmpZeroScales()
4015 const SCEV *FactorS = SE.getConstant(IntTy, Factor); in GenerateICmpZeroScales()
4091 const SCEV *FactorS = SE.getConstant(IntTy, Factor); in GenerateScales()
4096 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) in GenerateScales()
4135 [](const SCEV *S) { return S->getType()->isPointerTy(); })) in GenerateTruncates()
4147 const SCEV *NewScaledReg = SE.getAnyExtendExpr(F.ScaledReg, SrcTy); in GenerateTruncates()
4153 for (const SCEV *&BaseReg : F.BaseRegs) { in GenerateTruncates()
4154 const SCEV *NewBaseReg = SE.getAnyExtendExpr(BaseReg, SrcTy); in GenerateTruncates()
4183 const SCEV *OrigReg;
4185 WorkItem(size_t LI, int64_t I, const SCEV *R) in WorkItem()
4209 using ImmMapTy = std::map<int64_t, const SCEV *>; in GenerateCrossUseConstantOffsets()
4211 DenseMap<const SCEV *, ImmMapTy> Map; in GenerateCrossUseConstantOffsets()
4212 DenseMap<const SCEV *, SmallBitVector> UsedByIndicesMap; in GenerateCrossUseConstantOffsets()
4213 SmallVector<const SCEV *, 8> Sequence; in GenerateCrossUseConstantOffsets()
4214 for (const SCEV *Use : RegUses) { in GenerateCrossUseConstantOffsets()
4215 const SCEV *Reg = Use; // Make a copy for ExtractImmediate to modify. in GenerateCrossUseConstantOffsets()
4229 for (const SCEV *Reg : Sequence) { in GenerateCrossUseConstantOffsets()
4245 const SCEV *OrigReg = J->second; in GenerateCrossUseConstantOffsets()
4294 const SCEV *OrigReg = WI.OrigReg; in GenerateCrossUseConstantOffsets()
4297 const SCEV *NegImmS = SE.getSCEV(ConstantInt::get(IntTy, -(uint64_t)Imm)); in GenerateCrossUseConstantOffsets()
4337 const SCEV *BaseReg = F.BaseRegs[N]; in GenerateCrossUseConstantOffsets()
4357 for (const SCEV *NewReg : NewF.BaseRegs) in GenerateCrossUseConstantOffsets()
4416 DenseSet<const SCEV *> VisitedRegs; in FilterOutUndesirableDedicatedRegisters()
4417 SmallPtrSet<const SCEV *, 16> Regs; in FilterOutUndesirableDedicatedRegisters()
4418 SmallPtrSet<const SCEV *, 16> LoserRegs; in FilterOutUndesirableDedicatedRegisters()
4426 DenseMap<SmallVector<const SCEV *, 4>, size_t, UniquifierDenseMapInfo>; in FilterOutUndesirableDedicatedRegisters()
4461 SmallVector<const SCEV *, 4> Key; in FilterOutUndesirableDedicatedRegisters()
4462 for (const SCEV *Reg : F.BaseRegs) { in FilterOutUndesirableDedicatedRegisters()
4551 for (SmallVectorImpl<const SCEV *>::const_iterator in NarrowSearchSpaceByDetectingSupersets()
4698 using BestFormulaeTy = DenseMap<std::pair<const SCEV *, int64_t>, size_t>; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4704 DenseSet<const SCEV *> VisitedRegs; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4705 SmallPtrSet<const SCEV *, 16> Regs; in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4719 for (const SCEV *Reg : FA.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4724 for (const SCEV *Reg : FB.BaseRegs) { in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4880 SmallPtrSet<const SCEV *, 4> UniqRegs; in NarrowSearchSpaceByDeletingCostlyFormulas()
4884 DenseMap <const SCEV *, float> RegNumMap; in NarrowSearchSpaceByDeletingCostlyFormulas()
4885 for (const SCEV *Reg : RegUses) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4920 for (const SCEV *BaseReg : F.BaseRegs) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4928 if (const SCEV *ScaledReg = F.ScaledReg) { in NarrowSearchSpaceByDeletingCostlyFormulas()
4971 SmallPtrSet<const SCEV *, 4> Taken; in NarrowSearchSpaceByPickingWinnerRegs()
4979 const SCEV *Best = nullptr; in NarrowSearchSpaceByPickingWinnerRegs()
4981 for (const SCEV *Reg : RegUses) { in NarrowSearchSpaceByPickingWinnerRegs()
5051 const SmallPtrSet<const SCEV *, 16> &CurRegs, in SolveRecurse() argument
5052 DenseSet<const SCEV *> &VisitedRegs) const { in SolveRecurse()
5069 SmallSetVector<const SCEV *, 4> ReqRegs; in SolveRecurse()
5070 for (const SCEV *S : CurRegs) in SolveRecurse()
5074 SmallPtrSet<const SCEV *, 16> NewRegs; in SolveRecurse()
5085 for (const SCEV *Reg : ReqRegs) { in SolveRecurse()
5115 for (const SCEV *S : NewRegs) dbgs() in SolveRecurse()
5134 SmallPtrSet<const SCEV *, 16> CurRegs; in Solve()
5135 DenseSet<const SCEV *> VisitedRegs; in Solve()
5313 SmallVector<const SCEV *, 8> Ops; in Expand()
5316 for (const SCEV *Reg : F.BaseRegs) { in Expand()
5327 const SCEV *ScaledS = F.ScaledReg; in Expand()
5413 const SCEV *FullS = Ops.empty() ? in Expand()
5995 const llvm::SCEV *Inner = C->getOperand(0); in pushCast()
6008 bool pushSCEV(const llvm::SCEV *S) { in pushSCEV()
6049 bool isIdentityFunction(uint64_t Op, const SCEV *S) { in isIdentityFunction()
6078 const SCEV *Start = SAR.getStart(); in SCEVToValueExpr()
6079 const SCEV *Stride = SAR.getStepRecurrence(SE); in SCEVToValueExpr()
6107 bool createIterCountExpr(const SCEV *S, in createIterCountExpr()
6150 const SCEV *Start = SAR.getStart(); in SCEVToIterCountExpr()
6151 const SCEV *Stride = SAR.getStepRecurrence(SE); in SCEVToIterCountExpr()
6220 SmallVector<const llvm::SCEV *, 2> SCEVs;
6348 const SCEV *SCEVInductionVar, in SalvageDVI()
6457 const llvm::SCEV *SCEVInductionVar = SE.getSCEV(LSRInductionVar); in DbgRewriteSalvageableDVIs()
6514 const SCEV *S = SE.getSCEV(LocOp); in DbgGatherSalvagableDVI()