diff options
author | Nikita Popov <npopov@redhat.com> | 2025-02-10 10:07:21 +0100 |
---|---|---|
committer | GitHub <noreply@github.com> | 2025-02-10 10:07:21 +0100 |
commit | 7aed53eb1982113e825534f0f66d0a0e46e7a5ed (patch) | |
tree | d4b399ac568ca31b79ebd5dfae8895d9f1ebdb8f /llvm/lib/Analysis/ScalarEvolution.cpp | |
parent | 52a02b6d1e0c6b492495ff79a3a06ce93e6180b8 (diff) | |
download | llvm-7aed53eb1982113e825534f0f66d0a0e46e7a5ed.zip llvm-7aed53eb1982113e825534f0f66d0a0e46e7a5ed.tar.gz llvm-7aed53eb1982113e825534f0f66d0a0e46e7a5ed.tar.bz2 |
[ScalarEvolution] Handle addrec incoming value in isImpliedViaMerge() (#126236)
The code already guards against values coming from a previous iteration
using properlyDominates(). However, addrecs are considered to properly
dominate the loop they are defined in.
Handle this special case separately, by checking for expressions that
have computable loop evolution (this should cover cases like a zext of
an addrec as well).
I considered changing the definition of properlyDominates() instead, but
decided against it. The current definition is useful in other context,
e.g. when deciding whether an expression is safe to expand in a given
block.
Fixes https://github.com/llvm/llvm-project/issues/126012.
Diffstat (limited to 'llvm/lib/Analysis/ScalarEvolution.cpp')
-rw-r--r-- | llvm/lib/Analysis/ScalarEvolution.cpp | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp index f898871..46a5c44 100644 --- a/llvm/lib/Analysis/ScalarEvolution.cpp +++ b/llvm/lib/Analysis/ScalarEvolution.cpp @@ -12400,6 +12400,12 @@ bool ScalarEvolution::isImpliedViaMerge(CmpPredicate Pred, const SCEV *LHS, // iteration of a loop. if (!properlyDominates(L, LBB)) return false; + // Addrecs are considered to properly dominate their loop, so are missed + // by the previous check. Discard any values that have computable + // evolution in this loop. + if (auto *Loop = LI.getLoopFor(LBB)) + if (hasComputableLoopEvolution(L, Loop)) + return false; if (!ProvedEasily(L, RHS)) return false; } |