@@ -693,8 +693,7 @@ class AccessAnalysis {
693
693
// /
694
694
// / Returns true if we need no check or if we do and we can generate them
695
695
// / (i.e. the pointers have computable bounds).
696
- bool canCheckPtrAtRT (RuntimePointerChecking &RtCheck, ScalarEvolution *SE,
697
- Loop *TheLoop,
696
+ bool canCheckPtrAtRT (RuntimePointerChecking &RtCheck, Loop *TheLoop,
698
697
const DenseMap<Value *, const SCEV *> &Strides,
699
698
Value *&UncomputablePtr);
700
699
@@ -1188,7 +1187,7 @@ bool AccessAnalysis::createCheckForAccess(
1188
1187
}
1189
1188
1190
1189
bool AccessAnalysis::canCheckPtrAtRT (
1191
- RuntimePointerChecking &RtCheck, ScalarEvolution *SE, Loop *TheLoop,
1190
+ RuntimePointerChecking &RtCheck, Loop *TheLoop,
1192
1191
const DenseMap<Value *, const SCEV *> &StridesMap,
1193
1192
Value *&UncomputablePtr) {
1194
1193
// Find pointers with computable bounds. We are going to use this information
@@ -2651,7 +2650,7 @@ bool LoopAccessInfo::analyzeLoop(AAResults *AA, const LoopInfo *LI,
2651
2650
// to place a runtime bound check.
2652
2651
Value *UncomputablePtr = nullptr ;
2653
2652
bool CanDoRTIfNeeded = Accesses.canCheckPtrAtRT (
2654
- *PtrRtChecking, PSE-> getSE (), TheLoop, SymbolicStrides, UncomputablePtr);
2653
+ *PtrRtChecking, TheLoop, SymbolicStrides, UncomputablePtr);
2655
2654
if (!CanDoRTIfNeeded) {
2656
2655
const auto *I = dyn_cast_or_null<Instruction>(UncomputablePtr);
2657
2656
recordAnalysis (" CantIdentifyArrayBounds" , I)
@@ -2679,10 +2678,9 @@ bool LoopAccessInfo::analyzeLoop(AAResults *AA, const LoopInfo *LI,
2679
2678
PtrRtChecking->reset ();
2680
2679
PtrRtChecking->Need = true ;
2681
2680
2682
- auto *SE = PSE->getSE ();
2683
2681
UncomputablePtr = nullptr ;
2684
2682
CanDoRTIfNeeded = Accesses.canCheckPtrAtRT (
2685
- *PtrRtChecking, SE, TheLoop, SymbolicStrides, UncomputablePtr);
2683
+ *PtrRtChecking, TheLoop, SymbolicStrides, UncomputablePtr);
2686
2684
2687
2685
// Check that we found the bounds for the pointer.
2688
2686
if (!CanDoRTIfNeeded) {
0 commit comments