[llvm] Revert "[VPlan] Add hidden `-vplan-print-after-all` option (#175839)" (PR #178544)
Florian Hahn via llvm-commits
llvm-commits at lists.llvm.org
Wed Jan 28 15:47:43 PST 2026
https://github.com/fhahn created https://github.com/llvm/llvm-project/pull/178544
This reverts commit 97e1df149de213b760aae4060ee9e25dc9908125.
>From 6d814fd8a06623aee51c816b995b6e561c731802 Mon Sep 17 00:00:00 2001
From: Florian Hahn <flo at fhahn.com>
Date: Wed, 28 Jan 2026 23:26:40 +0000
Subject: [PATCH] Revert "[VPlan] Add hidden `-vplan-print-after-all` option
(#175839)"
This reverts commit 97e1df149de213b760aae4060ee9e25dc9908125.
---
.../Transforms/Vectorize/LoopVectorize.cpp | 68 ++++++++++---------
llvm/lib/Transforms/Vectorize/VPlan.cpp | 7 --
.../Vectorize/VPlanConstruction.cpp | 5 --
.../Transforms/Vectorize/VPlanTransforms.cpp | 34 +++++-----
.../Transforms/Vectorize/VPlanTransforms.h | 42 +++++-------
.../LoopVectorize/vplan-print-after-all.ll | 67 ------------------
.../Vectorize/VPlanUncountableExitTest.cpp | 4 +-
7 files changed, 72 insertions(+), 155 deletions(-)
delete mode 100644 llvm/test/Transforms/LoopVectorize/vplan-print-after-all.ll
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index 4e056ab30e2a6..b88779a7828fb 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -366,10 +366,6 @@ cl::opt<bool>
cl::Hidden,
cl::desc("Verfiy VPlans after VPlan transforms."));
-cl::opt<bool> llvm::PrintAfterEachVPlanPass(
- "vplan-print-after-all", cl::init(false), cl::Hidden,
- cl::desc("Print after each VPlanTransforms::runPass."));
-
// This flag enables the stress testing of the VPlan H-CFG construction in the
// VPlan-native vectorization path. It must be used in conjuction with
// -enable-vplan-native-path. -vplan-verify-hcfg can also be used to enable the
@@ -7392,16 +7388,17 @@ DenseMap<const SCEV *, Value *> LoopVectorizationPlanner::executePlan(
++LoopsEarlyExitVectorized;
// TODO: Move to VPlan transform stage once the transition to the VPlan-based
// cost model is complete for better cost estimates.
- RUN_VPLAN_PASS(VPlanTransforms::unrollByUF, BestVPlan, BestUF);
- RUN_VPLAN_PASS(VPlanTransforms::materializePacksAndUnpacks, BestVPlan);
- RUN_VPLAN_PASS(VPlanTransforms::materializeBroadcasts, BestVPlan);
- RUN_VPLAN_PASS(VPlanTransforms::replicateByVF, BestVPlan, BestVF);
+ VPlanTransforms::runPass(VPlanTransforms::unrollByUF, BestVPlan, BestUF);
+ VPlanTransforms::runPass(VPlanTransforms::materializePacksAndUnpacks,
+ BestVPlan);
+ VPlanTransforms::runPass(VPlanTransforms::materializeBroadcasts, BestVPlan);
+ VPlanTransforms::runPass(VPlanTransforms::replicateByVF, BestVPlan, BestVF);
bool HasBranchWeights =
hasBranchWeightMD(*OrigLoop->getLoopLatch()->getTerminator());
if (HasBranchWeights) {
std::optional<unsigned> VScale = CM.getVScaleForTuning();
- RUN_VPLAN_PASS(VPlanTransforms::addBranchWeightToMiddleTerminator,
- BestVPlan, BestVF, VScale);
+ VPlanTransforms::runPass(VPlanTransforms::addBranchWeightToMiddleTerminator,
+ BestVPlan, BestVF, VScale);
}
// Checks are the same for all VPlans, added to BestVPlan only for
@@ -8373,14 +8370,14 @@ void LoopVectorizationPlanner::buildVPlansWithVPRecipes(ElementCount MinVF,
// Now optimize the initial VPlan.
VPlanTransforms::hoistPredicatedLoads(*Plan, PSE, OrigLoop);
VPlanTransforms::sinkPredicatedStores(*Plan, PSE, OrigLoop);
- RUN_VPLAN_PASS(VPlanTransforms::truncateToMinimalBitwidths, *Plan,
- CM.getMinimalBitwidths());
- RUN_VPLAN_PASS(VPlanTransforms::optimize, *Plan);
+ VPlanTransforms::runPass(VPlanTransforms::truncateToMinimalBitwidths,
+ *Plan, CM.getMinimalBitwidths());
+ VPlanTransforms::runPass(VPlanTransforms::optimize, *Plan);
// TODO: try to put addExplicitVectorLength close to addActiveLaneMask
if (CM.foldTailWithEVL()) {
- RUN_VPLAN_PASS(VPlanTransforms::addExplicitVectorLength, *Plan,
- CM.getMaxSafeElements());
- RUN_VPLAN_PASS(VPlanTransforms::optimizeEVLMasks, *Plan);
+ VPlanTransforms::runPass(VPlanTransforms::addExplicitVectorLength,
+ *Plan, CM.getMaxSafeElements());
+ VPlanTransforms::runPass(VPlanTransforms::optimizeEVLMasks, *Plan);
}
assert(verifyVPlanIsValid(*Plan) && "VPlan is invalid");
VPlans.push_back(std::move(Plan));
@@ -8587,15 +8584,18 @@ VPlanPtr LoopVectorizationPlanner::tryToBuildVPlanWithVPRecipes(
// Apply mandatory transformation to handle reductions with multiple in-loop
// uses if possible, bail out otherwise.
- if (!RUN_VPLAN_PASS(VPlanTransforms::handleMultiUseReductions, *Plan))
+ if (!VPlanTransforms::runPass(VPlanTransforms::handleMultiUseReductions,
+ *Plan))
return nullptr;
// Apply mandatory transformation to handle FP maxnum/minnum reduction with
// NaNs if possible, bail out otherwise.
- if (!RUN_VPLAN_PASS(VPlanTransforms::handleMaxMinNumReductions, *Plan))
+ if (!VPlanTransforms::runPass(VPlanTransforms::handleMaxMinNumReductions,
+ *Plan))
return nullptr;
// Create whole-vector selects for find-last recurrences.
- if (!RUN_VPLAN_PASS(VPlanTransforms::handleFindLastReductions, *Plan))
+ if (!VPlanTransforms::runPass(VPlanTransforms::handleFindLastReductions,
+ *Plan))
return nullptr;
// Transform recipes to abstract recipes if it is legal and beneficial and
@@ -8605,8 +8605,8 @@ VPlanPtr LoopVectorizationPlanner::tryToBuildVPlanWithVPRecipes(
if (!CM.foldTailWithEVL()) {
VPCostContext CostCtx(CM.TTI, *CM.TLI, *Plan, CM, CM.CostKind, CM.PSE,
OrigLoop);
- RUN_VPLAN_PASS(VPlanTransforms::convertToAbstractRecipes, *Plan, CostCtx,
- Range);
+ VPlanTransforms::runPass(VPlanTransforms::convertToAbstractRecipes, *Plan,
+ CostCtx, Range);
}
for (ElementCount VF : Range)
@@ -8616,23 +8616,24 @@ VPlanPtr LoopVectorizationPlanner::tryToBuildVPlanWithVPRecipes(
// Interleave memory: for each Interleave Group we marked earlier as relevant
// for this VPlan, replace the Recipes widening its memory instructions with a
// single VPInterleaveRecipe at its insertion point.
- RUN_VPLAN_PASS(VPlanTransforms::createInterleaveGroups, *Plan,
- InterleaveGroups, RecipeBuilder, CM.isScalarEpilogueAllowed());
+ VPlanTransforms::runPass(VPlanTransforms::createInterleaveGroups, *Plan,
+ InterleaveGroups, RecipeBuilder,
+ CM.isScalarEpilogueAllowed());
// Replace VPValues for known constant strides.
- RUN_VPLAN_PASS(VPlanTransforms::replaceSymbolicStrides, *Plan, PSE,
- Legal->getLAI()->getSymbolicStrides());
+ VPlanTransforms::runPass(VPlanTransforms::replaceSymbolicStrides, *Plan, PSE,
+ Legal->getLAI()->getSymbolicStrides());
auto BlockNeedsPredication = [this](BasicBlock *BB) {
return Legal->blockNeedsPredication(BB);
};
- RUN_VPLAN_PASS(VPlanTransforms::dropPoisonGeneratingRecipes, *Plan,
- BlockNeedsPredication);
+ VPlanTransforms::runPass(VPlanTransforms::dropPoisonGeneratingRecipes, *Plan,
+ BlockNeedsPredication);
// Sink users of fixed-order recurrence past the recipe defining the previous
// value and introduce FirstOrderRecurrenceSplice VPInstructions.
- if (!RUN_VPLAN_PASS(VPlanTransforms::adjustFixedOrderRecurrences, *Plan,
- Builder))
+ if (!VPlanTransforms::runPass(VPlanTransforms::adjustFixedOrderRecurrences,
+ *Plan, Builder))
return nullptr;
if (useActiveLaneMask(Style)) {
@@ -8915,7 +8916,7 @@ void LoopVectorizationPlanner::addReductionResultComputation(
for (VPRecipeBase *R : ToDelete)
R->eraseFromParent();
- RUN_VPLAN_PASS(VPlanTransforms::clearReductionWrapFlags, *Plan);
+ VPlanTransforms::runPass(VPlanTransforms::clearReductionWrapFlags, *Plan);
}
void LoopVectorizationPlanner::attachRuntimeChecks(
@@ -9303,7 +9304,7 @@ static void preparePlanForMainVectorLoop(VPlan &MainPlan, VPlan &EpiPlan) {
VPIRInst->eraseFromParent();
ResumePhi->eraseFromParent();
}
- RUN_VPLAN_PASS(VPlanTransforms::removeDeadRecipes, MainPlan);
+ VPlanTransforms::runPass(VPlanTransforms::removeDeadRecipes, MainPlan);
using namespace VPlanPatternMatch;
// When vectorizing the epilogue, FindFirstIV & FindLastIV reductions can
@@ -10140,8 +10141,9 @@ bool LoopVectorizePass::processLoop(Loop *L) {
BestPlan);
// TODO: Move to general VPlan pipeline once epilogue loops are also
// supported.
- RUN_VPLAN_PASS(VPlanTransforms::materializeConstantVectorTripCount,
- BestPlan, VF.Width, IC, PSE);
+ VPlanTransforms::runPass(
+ VPlanTransforms::materializeConstantVectorTripCount, BestPlan, VF.Width,
+ IC, PSE);
LVP.addMinimumIterationCheck(BestPlan, VF.Width, IC,
VF.MinProfitableTripCount);
diff --git a/llvm/lib/Transforms/Vectorize/VPlan.cpp b/llvm/lib/Transforms/Vectorize/VPlan.cpp
index 9b22c399d7acf..bc51af00bedd1 100644
--- a/llvm/lib/Transforms/Vectorize/VPlan.cpp
+++ b/llvm/lib/Transforms/Vectorize/VPlan.cpp
@@ -912,9 +912,6 @@ bool VPlan::isExitBlock(VPBlockBase *VPBB) {
return is_contained(ExitBlocks, VPBB);
}
-/// To make RUN_VPLAN_PASS print final VPlan.
-static void printFinalVPlan(VPlan &) {}
-
/// Generate the code inside the preheader and body of the vectorized loop.
/// Assumes a single pre-header basic-block was created for this. Introduce
/// additional basic-blocks as needed, and fill them all.
@@ -936,11 +933,7 @@ void VPlan::execute(VPTransformState *State) {
LLVM_DEBUG(dbgs() << "Executing best plan with VF=" << State->VF
<< ", UF=" << getUF() << '\n');
setName("Final VPlan");
- // TODO: RUN_VPLAN_PASS/VPlanTransforms::runPass should automatically dump
- // VPlans after some specific stages when "-debug" is specified, but that
- // hasn't been implemented yet. For now, just do both:
LLVM_DEBUG(dump());
- RUN_VPLAN_PASS(printFinalVPlan, *this);
BasicBlock *ScalarPh = State->CFG.ExitBB;
VPBasicBlock *ScalarPhVPBB = getScalarPreheader();
diff --git a/llvm/lib/Transforms/Vectorize/VPlanConstruction.cpp b/llvm/lib/Transforms/Vectorize/VPlanConstruction.cpp
index bf02c548723de..4846abdab3c55 100644
--- a/llvm/lib/Transforms/Vectorize/VPlanConstruction.cpp
+++ b/llvm/lib/Transforms/Vectorize/VPlanConstruction.cpp
@@ -586,9 +586,6 @@ static void simplifyLiveInsWithSCEV(VPlan &Plan,
}
}
-/// To make RUN_VPLAN_PASS print initial VPlan.
-static void printAfterInitialConstruction(VPlan &) {}
-
std::unique_ptr<VPlan>
VPlanTransforms::buildVPlan0(Loop *TheLoop, LoopInfo &LI, Type *InductionTy,
DebugLoc IVDL, PredicatedScalarEvolution &PSE,
@@ -597,8 +594,6 @@ VPlanTransforms::buildVPlan0(Loop *TheLoop, LoopInfo &LI, Type *InductionTy,
std::unique_ptr<VPlan> VPlan0 = Builder.buildPlainCFG();
addInitialSkeleton(*VPlan0, InductionTy, IVDL, PSE, TheLoop);
simplifyLiveInsWithSCEV(*VPlan0, PSE);
-
- RUN_VPLAN_PASS_NO_VERIFY(printAfterInitialConstruction, *VPlan0);
return VPlan0;
}
diff --git a/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp b/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp
index 89b60d4a8e3de..27924ae1b6a36 100644
--- a/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp
+++ b/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp
@@ -2680,23 +2680,23 @@ void VPlanTransforms::removeBranchOnConst(VPlan &Plan) {
}
void VPlanTransforms::optimize(VPlan &Plan) {
- RUN_VPLAN_PASS(removeRedundantCanonicalIVs, Plan);
- RUN_VPLAN_PASS(removeRedundantInductionCasts, Plan);
-
- RUN_VPLAN_PASS(simplifyRecipes, Plan);
- RUN_VPLAN_PASS(removeDeadRecipes, Plan);
- RUN_VPLAN_PASS(simplifyBlends, Plan);
- RUN_VPLAN_PASS(legalizeAndOptimizeInductions, Plan);
- RUN_VPLAN_PASS(narrowToSingleScalarRecipes, Plan);
- RUN_VPLAN_PASS(removeRedundantExpandSCEVRecipes, Plan);
- RUN_VPLAN_PASS(simplifyRecipes, Plan);
- RUN_VPLAN_PASS(removeBranchOnConst, Plan);
- RUN_VPLAN_PASS(removeDeadRecipes, Plan);
-
- RUN_VPLAN_PASS(createAndOptimizeReplicateRegions, Plan);
- RUN_VPLAN_PASS(hoistInvariantLoads, Plan);
- RUN_VPLAN_PASS(mergeBlocksIntoPredecessors, Plan);
- RUN_VPLAN_PASS(licm, Plan);
+ runPass(removeRedundantCanonicalIVs, Plan);
+ runPass(removeRedundantInductionCasts, Plan);
+
+ runPass(simplifyRecipes, Plan);
+ runPass(removeDeadRecipes, Plan);
+ runPass(simplifyBlends, Plan);
+ runPass(legalizeAndOptimizeInductions, Plan);
+ runPass(narrowToSingleScalarRecipes, Plan);
+ runPass(removeRedundantExpandSCEVRecipes, Plan);
+ runPass(simplifyRecipes, Plan);
+ runPass(removeBranchOnConst, Plan);
+ runPass(removeDeadRecipes, Plan);
+
+ runPass(createAndOptimizeReplicateRegions, Plan);
+ runPass(hoistInvariantLoads, Plan);
+ runPass(mergeBlocksIntoPredecessors, Plan);
+ runPass(licm, Plan);
}
// Add a VPActiveLaneMaskPHIRecipe and related recipes to \p Plan and replace
diff --git a/llvm/lib/Transforms/Vectorize/VPlanTransforms.h b/llvm/lib/Transforms/Vectorize/VPlanTransforms.h
index 451597afa73da..e0d09a099647a 100644
--- a/llvm/lib/Transforms/Vectorize/VPlanTransforms.h
+++ b/llvm/lib/Transforms/Vectorize/VPlanTransforms.h
@@ -16,7 +16,6 @@
#include "VPlan.h"
#include "VPlanVerifier.h"
#include "llvm/ADT/STLFunctionalExtras.h"
-#include "llvm/ADT/ScopeExit.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Compiler.h"
@@ -34,33 +33,28 @@ class VPRecipeBuilder;
struct VFRange;
LLVM_ABI_FOR_TEST extern cl::opt<bool> VerifyEachVPlan;
-LLVM_ABI_FOR_TEST extern cl::opt<bool> PrintAfterEachVPlanPass;
LLVM_ABI_FOR_TEST extern cl::opt<bool> EnableWideActiveLaneMask;
struct VPlanTransforms {
- /// Helper to run a VPlan pass \p Pass on \p VPlan, forwarding extra arguments
- /// to the pass. Performs verification/printing after each VPlan pass if
- /// requested via command line options.
- template <bool EnableVerify = true, typename PassTy, typename... ArgsTy>
- static decltype(auto) runPass(StringRef PassName, PassTy &&Pass, VPlan &Plan,
- ArgsTy &&...Args) {
- scope_exit PostTransformActions{[&]() {
- // Make sure to print before verification, so that output is more useful
- // in case of failures:
- if (PrintAfterEachVPlanPass) {
- dbgs() << "VPlan after " << PassName << '\n';
- dbgs() << Plan << '\n';
- }
- if (VerifyEachVPlan && EnableVerify)
- verifyVPlanIsValid(Plan);
- }};
-
- return std::forward<PassTy>(Pass)(Plan, std::forward<ArgsTy>(Args)...);
+ /// Helper to run a VPlan transform \p Transform on \p VPlan, forwarding extra
+ /// arguments to the transform. Returns the boolean returned by the transform.
+ template <typename... ArgsTy>
+ static bool runPass(bool (*Transform)(VPlan &, ArgsTy...), VPlan &Plan,
+ typename std::remove_reference<ArgsTy>::type &...Args) {
+ bool Res = Transform(Plan, Args...);
+ if (VerifyEachVPlan)
+ verifyVPlanIsValid(Plan);
+ return Res;
+ }
+ /// Helper to run a VPlan transform \p Transform on \p VPlan, forwarding extra
+ /// arguments to the transform.
+ template <typename... ArgsTy>
+ static void runPass(void (*Fn)(VPlan &, ArgsTy...), VPlan &Plan,
+ typename std::remove_reference<ArgsTy>::type &...Args) {
+ Fn(Plan, Args...);
+ if (VerifyEachVPlan)
+ verifyVPlanIsValid(Plan);
}
-#define RUN_VPLAN_PASS(PASS, ...) \
- llvm::VPlanTransforms::runPass(#PASS, PASS, __VA_ARGS__)
-#define RUN_VPLAN_PASS_NO_VERIFY(PASS, ...) \
- llvm::VPlanTransforms::runPass<false>(#PASS, PASS, __VA_ARGS__)
/// Create a base VPlan0, serving as the common starting point for all later
/// candidates. It consists of an initial plain CFG loop with loop blocks from
diff --git a/llvm/test/Transforms/LoopVectorize/vplan-print-after-all.ll b/llvm/test/Transforms/LoopVectorize/vplan-print-after-all.ll
deleted file mode 100644
index 96e15740cd413..0000000000000
--- a/llvm/test/Transforms/LoopVectorize/vplan-print-after-all.ll
+++ /dev/null
@@ -1,67 +0,0 @@
-; RUN: opt -passes=loop-vectorize -disable-output -vplan-print-after-all -force-vector-width=4 -vplan-verify-each < %s 2>&1 | FileCheck %s --implicit-check-not "VPlan after"
-; RUN: opt -passes=loop-vectorize -disable-output -vplan-print-after-all -force-vector-width=4 -vplan-verify-each < %s 2>&1 | FileCheck %s --check-prefix CHECK-DUMP
-; REQUIRES: asserts
-
-; Verify that `-vplan-print-after-all` option works.
-
-; CHECK: VPlan after printAfterInitialConstruction
-; CHECK: VPlan after VPlanTransforms::clearReductionWrapFlags
-; CHECK: VPlan after VPlanTransforms::handleMultiUseReductions
-; CHECK: VPlan after VPlanTransforms::handleMaxMinNumReductions
-; CHECK: VPlan after VPlanTransforms::handleFindLastReductions
-; CHECK: VPlan after VPlanTransforms::convertToAbstractRecipes
-; CHECK: VPlan after VPlanTransforms::createInterleaveGroups
-; CHECK: VPlan after VPlanTransforms::replaceSymbolicStrides
-; CHECK: VPlan after VPlanTransforms::dropPoisonGeneratingRecipes
-; CHECK: VPlan after VPlanTransforms::adjustFixedOrderRecurrences
-; CHECK: VPlan after VPlanTransforms::truncateToMinimalBitwidths
-; CHECK: VPlan after removeRedundantCanonicalIVs
-; CHECK: VPlan after removeRedundantInductionCasts
-; CHECK: VPlan after simplifyRecipes
-; CHECK: VPlan after removeDeadRecipes
-; CHECK: VPlan after simplifyBlends
-; CHECK: VPlan after legalizeAndOptimizeInductions
-; CHECK: VPlan after narrowToSingleScalarRecipes
-; CHECK: VPlan after removeRedundantExpandSCEVRecipes
-; CHECK: VPlan after simplifyRecipes
-; CHECK: VPlan after removeBranchOnConst
-; CHECK: VPlan after removeDeadRecipes
-; CHECK: VPlan after createAndOptimizeReplicateRegions
-; CHECK: VPlan after hoistInvariantLoads
-; CHECK: VPlan after mergeBlocksIntoPredecessors
-; CHECK: VPlan after licm
-; CHECK: VPlan after VPlanTransforms::optimize
-; CHECK: VPlan after VPlanTransforms::materializeConstantVectorTripCount
-; CHECK: VPlan after VPlanTransforms::unrollByUF
-; CHECK: VPlan after VPlanTransforms::materializePacksAndUnpacks
-; CHECK: VPlan after VPlanTransforms::materializeBroadcasts
-; CHECK: VPlan after VPlanTransforms::replicateByVF
-; CHECK: VPlan after printFinalVPlan
-
-; Also verify that VPlans are actually printed (we aren't interested in the
-; exact dump content, just that it's performed):
-
-; CHECK-DUMP: VPlan after printAfterInitialConstruction
-; CHECK-DUMP-NEXT: VPlan ' for UF>=1' {
-;
-; CHECK-DUMP: VPlan after VPlanTransforms::optimize
-; CHECK-DUMP-NEXT: VPlan 'Initial VPlan for VF={4},UF>=1' {
-;
-; CHECK-DUMP: VPlan after printFinalVPlan
-; CHECK-DUMP-NEXT: VPlan 'Final VPlan for VF={4},UF={1}' {
-
-define void @foo(ptr %ptr, i64 %n) {
-entry:
- br label %header
-
-header:
- %iv = phi i64 [ 0, %entry ], [ %iv.next, %header ]
- %gep = getelementptr i64, ptr %ptr, i64 %iv
- store i64 %iv, ptr %gep
- %iv.next = add nsw i64 %iv, 1
- %exitcond = icmp slt i64 %iv.next, %n
- br i1 %exitcond, label %header, label %exit
-
-exit:
- ret void
-}
diff --git a/llvm/unittests/Transforms/Vectorize/VPlanUncountableExitTest.cpp b/llvm/unittests/Transforms/Vectorize/VPlanUncountableExitTest.cpp
index c701382c54e6b..270537a333b8e 100644
--- a/llvm/unittests/Transforms/Vectorize/VPlanUncountableExitTest.cpp
+++ b/llvm/unittests/Transforms/Vectorize/VPlanUncountableExitTest.cpp
@@ -48,7 +48,7 @@ TEST_F(VPUncountableExitTest, FindUncountableExitRecipes) {
BasicBlock *LoopHeader = F->getEntryBlock().getSingleSuccessor();
auto Plan = buildVPlan(LoopHeader, /*HasUncountableExit=*/true);
VPlanTransforms::tryToConvertVPInstructionsToVPRecipes(*Plan, *TLI);
- VPlanTransforms::optimize(*Plan);
+ VPlanTransforms::runPass(VPlanTransforms::optimize, *Plan);
SmallVector<VPRecipeBase *> Recipes;
SmallVector<VPRecipeBase *> GEPs;
@@ -84,7 +84,7 @@ TEST_F(VPUncountableExitTest, NoUncountableExit) {
BasicBlock *LoopHeader = F->getEntryBlock().getSingleSuccessor();
auto Plan = buildVPlan(LoopHeader);
VPlanTransforms::tryToConvertVPInstructionsToVPRecipes(*Plan, *TLI);
- VPlanTransforms::optimize(*Plan);
+ VPlanTransforms::runPass(VPlanTransforms::optimize, *Plan);
SmallVector<VPRecipeBase *> Recipes;
SmallVector<VPRecipeBase *> GEPs;
More information about the llvm-commits
mailing list