[llvm] [LV] Vectorize early exit loops with multiple exits. (PR #174864)
David Sherwood via llvm-commits
llvm-commits at lists.llvm.org
Mon Feb 9 05:37:33 PST 2026
================
@@ -4029,75 +4029,214 @@ void VPlanTransforms::convertToConcreteRecipes(VPlan &Plan) {
R->eraseFromParent();
}
-void VPlanTransforms::handleUncountableEarlyExit(VPBasicBlock *EarlyExitingVPBB,
- VPBasicBlock *EarlyExitVPBB,
- VPlan &Plan,
- VPBasicBlock *HeaderVPBB,
- VPBasicBlock *LatchVPBB) {
- auto *MiddleVPBB = cast<VPBasicBlock>(LatchVPBB->getSuccessors()[0]);
- if (!EarlyExitVPBB->getSinglePredecessor() &&
- EarlyExitVPBB->getPredecessors()[1] == MiddleVPBB) {
- assert(EarlyExitVPBB->getNumPredecessors() == 2 &&
- EarlyExitVPBB->getPredecessors()[0] == EarlyExitingVPBB &&
- "unsupported early exit VPBB");
- // Early exit operand should always be last phi operand. If EarlyExitVPBB
- // has two predecessors and EarlyExitingVPBB is the first, swap the operands
- // of the phis.
- for (VPRecipeBase &R : EarlyExitVPBB->phis())
- cast<VPIRPhi>(&R)->swapOperands();
- }
+void VPlanTransforms::handleUncountableEarlyExits(VPlan &Plan,
+ VPBasicBlock *HeaderVPBB,
+ VPBasicBlock *LatchVPBB,
+ VPBasicBlock *MiddleVPBB) {
+ struct EarlyExitInfo {
+ VPBasicBlock *EarlyExitingVPBB;
+ VPIRBasicBlock *EarlyExitVPBB;
+ VPValue *CondToExit;
+ };
VPBuilder Builder(LatchVPBB->getTerminator());
- VPBlockBase *TrueSucc = EarlyExitingVPBB->getSuccessors()[0];
- assert(match(EarlyExitingVPBB->getTerminator(), m_BranchOnCond()) &&
- "Terminator must be be BranchOnCond");
- VPValue *CondOfEarlyExitingVPBB =
- EarlyExitingVPBB->getTerminator()->getOperand(0);
- auto *CondToEarlyExit = TrueSucc == EarlyExitVPBB
- ? CondOfEarlyExitingVPBB
- : Builder.createNot(CondOfEarlyExitingVPBB);
-
- // Create a BranchOnTwoConds in the latch that branches to:
- // [0] vector.early.exit, [1] middle block, [2] header (continue looping).
- VPValue *IsEarlyExitTaken =
- Builder.createNaryOp(VPInstruction::AnyOf, {CondToEarlyExit});
- VPBasicBlock *VectorEarlyExitVPBB =
- Plan.createVPBasicBlock("vector.early.exit");
- VectorEarlyExitVPBB->setParent(EarlyExitVPBB->getParent());
-
- VPBlockUtils::connectBlocks(VectorEarlyExitVPBB, EarlyExitVPBB);
-
- // Update the exit phis in the early exit block.
+ SmallVector<EarlyExitInfo> Exits;
+ for (VPIRBasicBlock *ExitBlock : Plan.getExitBlocks()) {
+ for (VPBlockBase *Pred : to_vector(ExitBlock->getPredecessors())) {
+ if (Pred == MiddleVPBB)
+ continue;
+ // Collect condition for this early exit.
+ auto *EarlyExitingVPBB = cast<VPBasicBlock>(Pred);
+ VPBlockBase *TrueSucc = EarlyExitingVPBB->getSuccessors()[0];
+ VPValue *CondOfEarlyExitingVPBB;
+ [[maybe_unused]] bool Matched =
+ match(EarlyExitingVPBB->getTerminator(),
+ m_BranchOnCond(m_VPValue(CondOfEarlyExitingVPBB)));
+ assert(Matched && "Terminator must be BranchOnCond");
+ auto *CondToEarlyExit = TrueSucc == ExitBlock
+ ? CondOfEarlyExitingVPBB
+ : Builder.createNot(CondOfEarlyExitingVPBB);
+ Exits.push_back({
+ EarlyExitingVPBB,
+ ExitBlock,
+ CondToEarlyExit,
+ });
+ }
+ }
+
+ // Sort exits by dominance to get the correct program order.
+ VPDominatorTree VPDT(Plan);
+ llvm::sort(Exits, [&VPDT](const EarlyExitInfo &A, const EarlyExitInfo &B) {
+ return VPDT.dominates(A.EarlyExitingVPBB, B.EarlyExitingVPBB);
+ });
+
+ // Helper to check if a VPValue's definition dominates the latch.
+ // Live-in values (with no defining recipe) dominate everything.
+ auto DominatesLatch = [&VPDT, LatchVPBB](VPValue *V) {
+ VPRecipeBase *DefRecipe = V->getDefiningRecipe();
+ if (!DefRecipe)
+ return true;
+ return VPDT.dominates(DefRecipe->getParent(), LatchVPBB);
+ };
+
+ // Build the AnyOf condition for the latch terminator.
+ VPValue *Combined = Exits[0].CondToExit;
+ assert(DominatesLatch(Combined) && "All conditions must dominate the latch");
+ for (const auto &[_, _1, CondToExit] : drop_begin(Exits)) {
+ assert(DominatesLatch(CondToExit) &&
+ "All conditions must dominate the latch");
+ Combined = Builder.createOr(Combined, CondToExit);
+ }
+ VPValue *IsAnyExitTaken =
+ Builder.createNaryOp(VPInstruction::AnyOf, {Combined});
+
+ // Create the vector.early.exit blocks.
+ SmallVector<VPBasicBlock *> VectorEarlyExitVPBBs(Exits.size());
+ for (unsigned Idx = 0; Idx != Exits.size(); ++Idx) {
+ Twine BlockSuffix = Exits.size() == 1 ? "" : Twine(".") + Twine(Idx);
+ VPBasicBlock *VectorEarlyExitVPBB =
+ Plan.createVPBasicBlock("vector.early.exit" + BlockSuffix);
+ VectorEarlyExitVPBBs[Idx] = VectorEarlyExitVPBB;
+ }
+
+ // Create the dispatch block (or reuse the single exit block if only one
+ // exit). The dispatch block computes the first active lane of the combined
+ // condition and, for multiple exits, chains through conditions to determine
+ // which exit to take.
+ VPBasicBlock *DispatchVPBB =
+ Exits.size() == 1 ? VectorEarlyExitVPBBs[0]
+ : Plan.createVPBasicBlock("vector.early.exit.check");
+ VPBuilder DispatchBuilder(DispatchVPBB, DispatchVPBB->begin());
+ VPValue *FirstActiveLane =
+ DispatchBuilder.createNaryOp(VPInstruction::FirstActiveLane, {Combined},
+ DebugLoc::getUnknown(), "first.active.lane");
+
+ // For each early exit, disconnect the original exiting block
----------------
david-arm wrote:
This is much clearer, thanks for taking the time to write this up! Really nice. :)
https://github.com/llvm/llvm-project/pull/174864
More information about the llvm-commits
mailing list