[PATCH] D128272: [LoopVectorize] Change PredicatedBBsAfterVectorization to be per VF
David Sherwood via Phabricator via llvm-commits
llvm-commits at lists.llvm.org
Wed Jun 29 06:27:07 PDT 2022
david-arm updated this revision to Diff 440986.
david-arm added a comment.
- Simplified test case.
CHANGES SINCE LAST ACTION
https://reviews.llvm.org/D128272/new/
https://reviews.llvm.org/D128272
Files:
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
llvm/test/Transforms/LoopVectorize/AArch64/sve-tail-folding-cost.ll
Index: llvm/test/Transforms/LoopVectorize/AArch64/sve-tail-folding-cost.ll
===================================================================
--- /dev/null
+++ llvm/test/Transforms/LoopVectorize/AArch64/sve-tail-folding-cost.ll
@@ -0,0 +1,32 @@
+; REQUIRES: asserts
+; RUN: opt -S -loop-vectorize -prefer-predicate-over-epilogue=predicate-dont-vectorize -debug -disable-output <%s 2>%t
+; RUN: cat %t | FileCheck %s
+
+target triple = "aarch64-unknown-linux-gnu"
+
+; The uniform load of %d in the following loop leads to the block being
+; treated as scalar with predication for fixed-width VFs. However, this should
+; only affect the fixed-width cost of the final 'br' branch instruction. For
+; scalable VFs the cost of 'br' should be cheap.
+define i32 @uniform_load(i64 %n, ptr readnone %c, ptr %d) #0 {
+; CHECK: LAA: Found a loop in uniform_load: for.body
+; CHECK-NOT: LV: Vector loop of width vscale x 2 costs: Invalid
+; CHECK-NOT: LV: Vector loop of width vscale x 4 costs: Invalid
+; CHECK: LV: Selecting VF: vscale x 4
+entry:
+ br label %for.body
+
+for.body: ; preds = %entry, %for.body
+ %indvars.iv = phi i64 [ 1, %entry ], [ %indvars.iv.next, %for.body ]
+ %load2 = load float, ptr %d, align 4
+ %arrayidx2 = getelementptr inbounds float, ptr %c, i64 %indvars.iv
+ store float %load2, ptr %arrayidx2, align 4
+ %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
+ %exitcond.not = icmp eq i64 %indvars.iv.next, %n
+ br i1 %exitcond.not, label %for.end, label %for.body
+
+for.end: ; preds = %for.body
+ ret i32 0
+}
+
+attributes #0 = { vscale_range(1,16) "target-features"="+sve" }
Index: llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
===================================================================
--- llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -1736,7 +1736,8 @@
/// A set containing all BasicBlocks that are known to present after
/// vectorization as a predicated block.
- SmallPtrSet<BasicBlock *, 4> PredicatedBBsAfterVectorization;
+ DenseMap<ElementCount, SmallPtrSet<BasicBlock *, 4>>
+ PredicatedBBsAfterVectorization;
/// Records whether it is allowed to have the original scalar loop execute at
/// least once. This may be needed as a fallback loop in case runtime
@@ -6100,6 +6101,8 @@
// map will indicate that we've analyzed it already.
ScalarCostsTy &ScalarCostsVF = InstsToScalarize[VF];
+ PredicatedBBsAfterVectorization[VF].clear();
+
// Find all the instructions that are scalar with predication in the loop and
// determine if it would be better to not if-convert the blocks they are in.
// If so, we also record the instructions to scalarize.
@@ -6117,7 +6120,7 @@
computePredInstDiscount(&I, ScalarCosts, VF) >= 0)
ScalarCostsVF.insert(ScalarCosts.begin(), ScalarCosts.end());
// Remember that BB will remain after vectorization.
- PredicatedBBsAfterVectorization.insert(BB);
+ PredicatedBBsAfterVectorization[VF].insert(BB);
}
}
}
@@ -6982,8 +6985,8 @@
bool ScalarPredicatedBB = false;
BranchInst *BI = cast<BranchInst>(I);
if (VF.isVector() && BI->isConditional() &&
- (PredicatedBBsAfterVectorization.count(BI->getSuccessor(0)) ||
- PredicatedBBsAfterVectorization.count(BI->getSuccessor(1))))
+ (PredicatedBBsAfterVectorization[VF].count(BI->getSuccessor(0)) ||
+ PredicatedBBsAfterVectorization[VF].count(BI->getSuccessor(1))))
ScalarPredicatedBB = true;
if (ScalarPredicatedBB) {
-------------- next part --------------
A non-text attachment was scrubbed...
Name: D128272.440986.patch
Type: text/x-patch
Size: 3642 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20220629/bd460caa/attachment.bin>
More information about the llvm-commits
mailing list