[llvm] 9830738 - [SCEV][NFC] Rename constructor parameter to match its field name
Max Kazantsev via llvm-commits
llvm-commits at lists.llvm.org
Thu Nov 24 21:59:18 PST 2022
Author: Max Kazantsev
Date: 2022-11-25T12:59:05+07:00
New Revision: 98307381d4dfafbb6b6f517a9db3cfbb722e03ec
URL: https://github.com/llvm/llvm-project/commit/98307381d4dfafbb6b6f517a9db3cfbb722e03ec
DIFF: https://github.com/llvm/llvm-project/commit/98307381d4dfafbb6b6f517a9db3cfbb722e03ec.diff
LOG: [SCEV][NFC] Rename constructor parameter to match its field name
Added:
Modified:
llvm/include/llvm/Analysis/ScalarEvolution.h
llvm/lib/Analysis/ScalarEvolution.cpp
Removed:
################################################################################
diff --git a/llvm/include/llvm/Analysis/ScalarEvolution.h b/llvm/include/llvm/Analysis/ScalarEvolution.h
index fd6bf27bbd34..af61d7ff2f23 100644
--- a/llvm/include/llvm/Analysis/ScalarEvolution.h
+++ b/llvm/include/llvm/Analysis/ScalarEvolution.h
@@ -1334,11 +1334,11 @@ class ScalarEvolution {
/*implicit*/ ExitLimit(const SCEV *E);
ExitLimit(
- const SCEV *E, const SCEV *M, bool MaxOrZero,
+ const SCEV *E, const SCEV *ConstantMaxNotTaken, bool MaxOrZero,
ArrayRef<const SmallPtrSetImpl<const SCEVPredicate *> *> PredSetList =
None);
- ExitLimit(const SCEV *E, const SCEV *M, bool MaxOrZero,
+ ExitLimit(const SCEV *E, const SCEV *ConstantMaxNotTaken, bool MaxOrZero,
const SmallPtrSetImpl<const SCEVPredicate *> &PredSet);
/// Test whether this ExitLimit contains any computed information, or
diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp
index bffed1883d22..6b20f08ad44e 100644
--- a/llvm/lib/Analysis/ScalarEvolution.cpp
+++ b/llvm/lib/Analysis/ScalarEvolution.cpp
@@ -8600,9 +8600,10 @@ ScalarEvolution::ExitLimit::ExitLimit(const SCEV *E)
}
ScalarEvolution::ExitLimit::ExitLimit(
- const SCEV *E, const SCEV *M, bool MaxOrZero,
+ const SCEV *E, const SCEV *ConstantMaxNotTaken, bool MaxOrZero,
ArrayRef<const SmallPtrSetImpl<const SCEVPredicate *> *> PredSetList)
- : ExactNotTaken(E), ConstantMaxNotTaken(M), MaxOrZero(MaxOrZero) {
+ : ExactNotTaken(E), ConstantMaxNotTaken(ConstantMaxNotTaken),
+ MaxOrZero(MaxOrZero) {
// If we prove the max count is zero, so is the symbolic bound. This happens
// in practice due to
diff erences in a) how context sensitive we've chosen
// to be and b) how we reason about bounds implied by UB.
@@ -8620,15 +8621,15 @@ ScalarEvolution::ExitLimit::ExitLimit(
addPredicate(P);
assert((isa<SCEVCouldNotCompute>(E) || !E->getType()->isPointerTy()) &&
"Backedge count should be int");
- assert((isa<SCEVCouldNotCompute>(M) || !M->getType()->isPointerTy()) &&
+ assert((isa<SCEVCouldNotCompute>(ConstantMaxNotTaken) ||
+ !ConstantMaxNotTaken->getType()->isPointerTy()) &&
"Max backedge count should be int");
}
ScalarEvolution::ExitLimit::ExitLimit(
- const SCEV *E, const SCEV *M, bool MaxOrZero,
+ const SCEV *E, const SCEV *ConstantMaxNotTaken, bool MaxOrZero,
const SmallPtrSetImpl<const SCEVPredicate *> &PredSet)
- : ExitLimit(E, M, MaxOrZero, {&PredSet}) {
-}
+ : ExitLimit(E, ConstantMaxNotTaken, MaxOrZero, { &PredSet }) {}
/// Allocate memory for BackedgeTakenInfo and copy the not-taken count of each
/// computable exit into a persistent ExitNotTakenInfo array.
More information about the llvm-commits
mailing list