[llvm] 9f5034d - [VPlan] Fix replaceWithFinalIfReductionStore assert with multiple reductions (#217316)
via llvm-commits
llvm-commits at lists.llvm.org
Thu Aug 20 18:09:42 PDT 2026
Author: Luke Lau
Date: 2026-08-21T09:09:36+08:00
New Revision: 9f5034d6a651702eedb1790dfed32fdd60ed12cf
URL: https://github.com/llvm/llvm-project/commit/9f5034d6a651702eedb1790dfed32fdd60ed12cf
DIFF: https://github.com/llvm/llvm-project/commit/9f5034d6a651702eedb1790dfed32fdd60ed12cf.diff
LOG: [VPlan] Fix replaceWithFinalIfReductionStore assert with multiple reductions (#217316)
A reductions final value can be simplified away to a constant, which
https://github.com/llvm/llvm-project/pull/201023 handled in
replaceWithFinalIfReductionStore.
However constant live ins can have other users, e.g. a different
reductions start value, in which case the assertion will fail because
we're comparing the backedge value of a different reduction entirely.
Relax the assertion to allow any VPIRValue instead
This an alternative to https://github.com/llvm/llvm-project/pull/217306
that fixes #215071
Added:
Modified:
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
llvm/test/Transforms/LoopVectorize/reduction-with-invariant-store.ll
Removed:
################################################################################
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index bf0bb98eb75b8..24083eb7e8e6e 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -6384,7 +6384,7 @@ bool VPRecipeBuilder::replaceWithFinalIfReductionStore(
Val = Blend;
[[maybe_unused]] auto *Rdx =
VPlanPatternMatch::findUserOf<VPReductionPHIRecipe>(Val);
- assert((!Rdx || Rdx->getBackedgeValue() == Val) &&
+ assert((isa<VPIRValue>(Val) || !Rdx || Rdx->getBackedgeValue() == Val) &&
"Store of reduction thats not the backedge value?");
auto *Recipe = new VPReplicateRecipe(
SI, {Val, Addr}, true /* IsUniform */, nullptr /*Mask*/, *VPI, *VPI,
diff --git a/llvm/test/Transforms/LoopVectorize/reduction-with-invariant-store.ll b/llvm/test/Transforms/LoopVectorize/reduction-with-invariant-store.ll
index 88bd76ec53912..ccfb11b0c4fb6 100644
--- a/llvm/test/Transforms/LoopVectorize/reduction-with-invariant-store.ll
+++ b/llvm/test/Transforms/LoopVectorize/reduction-with-invariant-store.ll
@@ -1332,3 +1332,42 @@ loop:
exit:
ret void
}
+
+; Don't crash if reduction is simplifable to a constant and the constant is also
+; used by another reduction's start value.
+define i32 @multiple_simplifiable_reductions(ptr %p) {
+; CHECK-LABEL: define i32 @multiple_simplifiable_reductions(
+; CHECK-SAME: ptr [[P:%.*]]) {
+; CHECK-NEXT: [[ENTRY:.*:]]
+; CHECK-NEXT: br label %[[VECTOR_PH:.*]]
+; CHECK: [[VECTOR_PH]]:
+; CHECK-NEXT: br label %[[VECTOR_BODY:.*]]
+; CHECK: [[VECTOR_BODY]]:
+; CHECK-NEXT: [[INDEX:%.*]] = phi i32 [ 0, %[[VECTOR_PH]] ], [ [[INDEX_NEXT:%.*]], %[[VECTOR_BODY]] ]
+; CHECK-NEXT: [[VEC_PHI:%.*]] = phi <4 x i32> [ zeroinitializer, %[[VECTOR_PH]] ], [ [[VEC_PHI]], %[[VECTOR_BODY]] ]
+; CHECK-NEXT: [[INDEX_NEXT]] = add nuw i32 [[INDEX]], 4
+; CHECK-NEXT: [[TMP0:%.*]] = icmp eq i32 [[INDEX_NEXT]], 1020
+; CHECK-NEXT: br i1 [[TMP0]], label %[[MIDDLE_BLOCK:.*]], label %[[VECTOR_BODY]], !llvm.loop [[LOOP88:![0-9]+]]
+; CHECK: [[MIDDLE_BLOCK]]:
+; CHECK-NEXT: [[TMP1:%.*]] = call i32 @llvm.vector.reduce.or.v4i32(<4 x i32> [[VEC_PHI]])
+; CHECK-NEXT: store i32 0, ptr [[P]], align 4
+; CHECK-NEXT: br label %[[SCALAR_PH:.*]]
+; CHECK: [[SCALAR_PH]]:
+;
+entry:
+ br label %loop
+
+loop:
+ %iv = phi i32 [ 1, %entry ], [ %iv.next, %loop ]
+ %rdx.and = phi i32 [ 0, %entry ], [ %rdx.and.next, %loop ]
+ %rdx.or = phi i32 [ 0, %entry ], [ %rdx.or.next, %loop ]
+ %rdx.and.next = and i32 0, %rdx.and
+ store i32 %rdx.and.next, ptr %p
+ %rdx.or.next = or i32 0, %rdx.or
+ %iv.next = add i32 %iv, 1
+ %ec = icmp eq i32 %iv.next, 1024
+ br i1 %ec, label %exit, label %loop
+
+exit:
+ ret i32 %rdx.or.next
+}
More information about the llvm-commits
mailing list