@@ -693,8 +693,7 @@ class AccessAnalysis {
693693 // /
694694 // / Returns true if we need no check or if we do and we can generate them
695695 // / (i.e. the pointers have computable bounds).
696- bool canCheckPtrAtRT (RuntimePointerChecking &RtCheck, ScalarEvolution *SE,
697- Loop *TheLoop,
696+ bool canCheckPtrAtRT (RuntimePointerChecking &RtCheck, Loop *TheLoop,
698697 const DenseMap<Value *, const SCEV *> &Strides,
699698 Value *&UncomputablePtr);
700699
@@ -1188,7 +1187,7 @@ bool AccessAnalysis::createCheckForAccess(
11881187}
11891188
11901189bool AccessAnalysis::canCheckPtrAtRT (
1191- RuntimePointerChecking &RtCheck, ScalarEvolution *SE, Loop *TheLoop,
1190+ RuntimePointerChecking &RtCheck, Loop *TheLoop,
11921191 const DenseMap<Value *, const SCEV *> &StridesMap,
11931192 Value *&UncomputablePtr) {
11941193 // Find pointers with computable bounds. We are going to use this information
@@ -2651,7 +2650,7 @@ bool LoopAccessInfo::analyzeLoop(AAResults *AA, const LoopInfo *LI,
26512650 // to place a runtime bound check.
26522651 Value *UncomputablePtr = nullptr ;
26532652 bool CanDoRTIfNeeded = Accesses.canCheckPtrAtRT (
2654- *PtrRtChecking, PSE-> getSE (), TheLoop, SymbolicStrides, UncomputablePtr);
2653+ *PtrRtChecking, TheLoop, SymbolicStrides, UncomputablePtr);
26552654 if (!CanDoRTIfNeeded) {
26562655 const auto *I = dyn_cast_or_null<Instruction>(UncomputablePtr);
26572656 recordAnalysis (" CantIdentifyArrayBounds" , I)
@@ -2679,10 +2678,9 @@ bool LoopAccessInfo::analyzeLoop(AAResults *AA, const LoopInfo *LI,
26792678 PtrRtChecking->reset ();
26802679 PtrRtChecking->Need = true ;
26812680
2682- auto *SE = PSE->getSE ();
26832681 UncomputablePtr = nullptr ;
26842682 CanDoRTIfNeeded = Accesses.canCheckPtrAtRT (
2685- *PtrRtChecking, SE, TheLoop, SymbolicStrides, UncomputablePtr);
2683+ *PtrRtChecking, TheLoop, SymbolicStrides, UncomputablePtr);
26862684
26872685 // Check that we found the bounds for the pointer.
26882686 if (!CanDoRTIfNeeded) {
0 commit comments