@@ -7785,16 +7785,16 @@ DenseMap<const SCEV *, Value *> LoopVectorizationPlanner::executePlan(
7785
7785
7786
7786
BestVPlan.execute (&State);
7787
7787
7788
- auto *ExitVPBB = BestVPlan.getMiddleBlock ();
7788
+ auto *MiddleVPBB = BestVPlan.getMiddleBlock ();
7789
7789
// 2.5 When vectorizing the epilogue, fix reduction and induction resume
7790
7790
// values from the additional bypass block.
7791
7791
if (VectorizingEpilogue) {
7792
7792
assert (!ILV.Legal ->hasUncountableEarlyExit () &&
7793
7793
" Epilogue vectorisation not yet supported with early exits" );
7794
7794
BasicBlock *BypassBlock = ILV.getAdditionalBypassBlock ();
7795
- for (VPRecipeBase &R : *ExitVPBB ) {
7795
+ for (VPRecipeBase &R : *MiddleVPBB ) {
7796
7796
fixReductionScalarResumeWhenVectorizingEpilog (
7797
- &R, State, State.CFG .VPBB2IRBB [ExitVPBB ], BypassBlock);
7797
+ &R, State, State.CFG .VPBB2IRBB [MiddleVPBB ], BypassBlock);
7798
7798
}
7799
7799
BasicBlock *PH = OrigLoop->getLoopPreheader ();
7800
7800
for (const auto &[IVPhi, _] : Legal->getInductionVars ()) {
@@ -7840,7 +7840,7 @@ DenseMap<const SCEV *, Value *> LoopVectorizationPlanner::executePlan(
7840
7840
7841
7841
// 4. Adjust branch weight of the branch in the middle block.
7842
7842
auto *MiddleTerm =
7843
- cast<BranchInst>(State.CFG .VPBB2IRBB [ExitVPBB ]->getTerminator ());
7843
+ cast<BranchInst>(State.CFG .VPBB2IRBB [MiddleVPBB ]->getTerminator ());
7844
7844
if (MiddleTerm->isConditional () &&
7845
7845
hasBranchWeightMD (*OrigLoop->getLoopLatch ()->getTerminator ())) {
7846
7846
// Assume that `Count % VectorTripCount` is equally distributed.
0 commit comments