///
/// We don't have a way to invalidate per-loop dispositions. Clear and
/// recompute is simpler.
- void forgetLoopDispositions(const Loop *L);
+ void forgetLoopDispositions();
/// Determine the minimum number of zero bits that S is guaranteed to end in
/// (at every loop iteration). It is, at the same time, the minimum number
forgetMemoizedResults(ToForget);
}
-void ScalarEvolution::forgetLoopDispositions(const Loop *L) {
- LoopDispositions.clear();
-}
+void ScalarEvolution::forgetLoopDispositions() { LoopDispositions.clear(); }
/// Get the exact loop backedge taken count considering all loop exits. A
/// computable result can only be returned for loops with all exiting blocks
MSSA->verifyMemorySSA();
if (Changed && SE)
- SE->forgetLoopDispositions(L);
+ SE->forgetLoopDispositions();
return Changed;
}
}
if (Changed)
- SE.forgetLoopDispositions(L);
+ SE.forgetLoopDispositions();
if (!AllEntriesInvariant || !AllOutgoingValuesSame)
return false;
}
if (Changed && SE)
- SE->forgetLoopDispositions(&L);
+ SE->forgetLoopDispositions();
return Changed;
}
// The loop disposition of all SCEV expressions that depend on any
// hoisted values have also changed.
if (SE)
- SE->forgetLoopDispositions(L);
+ SE->forgetLoopDispositions();
}
if (!AllInvariant) continue;