[llvm] 0859df4 - [VPlan] Use operands from initial VPInstructions directly (NFC).
Florian Hahn via llvm-commits
llvm-commits at lists.llvm.org
Sat Feb 22 14:34:52 PST 2025
Author: Florian Hahn
Date: 2025-02-22T22:34:35Z
New Revision: 0859df4e42ba742b41827ae1a653a8eb2f2674d3
URL: https://github.com/llvm/llvm-project/commit/0859df4e42ba742b41827ae1a653a8eb2f2674d3
DIFF: https://github.com/llvm/llvm-project/commit/0859df4e42ba742b41827ae1a653a8eb2f2674d3.diff
LOG: [VPlan] Use operands from initial VPInstructions directly (NFC).
Use operands from VPInstructions directly during recipe creation.
Follow-up as discussed and planned after
https://github.com/llvm/llvm-project/pull/124432.
Added:
Modified:
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h
Removed:
################################################################################
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index ffccfbf30e46a..7b346bfd67c0d 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -8115,14 +8115,6 @@ void EpilogueVectorizerEpilogueLoop::printDebugTracesAtEnd() {
});
}
-iterator_range<mapped_iterator<Use *, std::function<VPValue *(Value *)>>>
-VPRecipeBuilder::mapToVPValues(User::op_range Operands) {
- std::function<VPValue *(Value *)> Fn = [this](Value *Op) {
- return getVPValueOrAddLiveIn(Op);
- };
- return map_range(Operands, Fn);
-}
-
void VPRecipeBuilder::createSwitchEdgeMasks(SwitchInst *SI) {
BasicBlock *Src = SI->getParent();
assert(!OrigLoop->isLoopExiting(Src) &&
@@ -8454,12 +8446,18 @@ VPBlendRecipe *VPRecipeBuilder::tryToBlend(PHINode *Phi,
// builder. At this point we generate the predication tree. There may be
// duplications since this is a simple recursive scan, but future
// optimizations will clean it up.
- SmallVector<VPValue *, 2> OperandsWithMask;
+ // Map incoming IR BasicBlocks to incoming VPValues, for lookup below.
+ // TODO: Add operands and masks in order from the VPlan predecessors.
+ DenseMap<BasicBlock *, VPValue *> VPIncomingValues;
+ for (const auto &[Idx, Pred] : enumerate(predecessors(Phi->getParent())))
+ VPIncomingValues[Pred] = Operands[Idx];
+
+ SmallVector<VPValue *, 2> OperandsWithMask;
for (unsigned In = 0; In < NumIncoming; In++) {
- OperandsWithMask.push_back(Operands[In]);
- VPValue *EdgeMask =
- getEdgeMask(Phi->getIncomingBlock(In), Phi->getParent());
+ BasicBlock *Pred = Phi->getIncomingBlock(In);
+ OperandsWithMask.push_back(VPIncomingValues.lookup(Pred));
+ VPValue *EdgeMask = getEdgeMask(Pred, Phi->getParent());
if (!EdgeMask) {
assert(In == 0 && "Both null and non-null edge masks found");
assert(all_equal(Operands) &&
@@ -9449,16 +9447,6 @@ LoopVectorizationPlanner::tryToBuildVPlanWithVPRecipes(VFRange &Range) {
// VPlan.
Instruction *Instr = cast<Instruction>(UnderlyingValue);
Builder.setInsertPoint(SingleDef);
- SmallVector<VPValue *, 4> Operands;
- auto *Phi = dyn_cast<PHINode>(Instr);
- if (Phi && Phi->getParent() == HeaderBB) {
- // The backedge value will be added in fixHeaderPhis later.
- Operands.push_back(Plan->getOrAddLiveIn(
- Phi->getIncomingValueForBlock(OrigLoop->getLoopPreheader())));
- } else {
- auto OpRange = RecipeBuilder.mapToVPValues(Instr->operands());
- Operands = {OpRange.begin(), OpRange.end()};
- }
// The stores with invariant address inside the loop will be deleted, and
// in the exit block, a uniform store recipe will be created for the final
@@ -9468,15 +9456,15 @@ LoopVectorizationPlanner::tryToBuildVPlanWithVPRecipes(VFRange &Range) {
Legal->isInvariantAddressOfReduction(SI->getPointerOperand())) {
// Only create recipe for the final invariant store of the reduction.
if (Legal->isInvariantStoreOfReduction(SI)) {
- auto *Recipe = new VPReplicateRecipe(
- SI, make_range(Operands.begin(), Operands.end()),
- true /* IsUniform */);
+ auto *Recipe =
+ new VPReplicateRecipe(SI, R.operands(), true /* IsUniform */);
Recipe->insertBefore(*MiddleVPBB, MBIP);
}
R.eraseFromParent();
continue;
}
+ SmallVector<VPValue *, 4> Operands(R.operands());
VPRecipeBase *Recipe =
RecipeBuilder.tryToCreateWidenRecipe(Instr, Operands, Range);
if (!Recipe)
diff --git a/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h b/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h
index e8d3ad89e14cf..756cbf4d36d7d 100644
--- a/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h
+++ b/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h
@@ -229,11 +229,6 @@ class VPRecipeBuilder {
/// recurrence cross-iteration phis.
void fixHeaderPhis();
- /// Returns a range mapping the values of the range \p Operands to their
- /// corresponding VPValues.
- iterator_range<mapped_iterator<Use *, std::function<VPValue *(Value *)>>>
- mapToVPValues(User::op_range Operands);
-
VPValue *getVPValueOrAddLiveIn(Value *V) {
if (auto *I = dyn_cast<Instruction>(V)) {
if (auto *R = Ingredient2Recipe.lookup(I))
More information about the llvm-commits
mailing list