//===-- VPlanTransforms.cpp - Utility VPlan to VPlan transforms -----------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// /// /// \file /// This file implements a set of utility VPlan to VPlan transformations. /// //===----------------------------------------------------------------------===// #include "VPlanTransforms.h" #include "llvm/ADT/PostOrderIterator.h" using namespace llvm; void VPlanTransforms::VPInstructionsToVPRecipes( Loop *OrigLoop, VPlanPtr &Plan, LoopVectorizationLegality::InductionList &Inductions, SmallPtrSetImpl &DeadInstructions, ScalarEvolution &SE) { auto *TopRegion = cast(Plan->getEntry()); ReversePostOrderTraversal RPOT(TopRegion->getEntry()); for (VPBlockBase *Base : RPOT) { // Do not widen instructions in pre-header and exit blocks. if (Base->getNumPredecessors() == 0 || Base->getNumSuccessors() == 0) continue; VPBasicBlock *VPBB = Base->getEntryBasicBlock(); // Introduce each ingredient into VPlan. for (auto I = VPBB->begin(), E = VPBB->end(); I != E;) { VPRecipeBase *Ingredient = &*I++; VPValue *VPV = Ingredient->getVPSingleValue(); Instruction *Inst = cast(VPV->getUnderlyingValue()); if (DeadInstructions.count(Inst)) { VPValue DummyValue; VPV->replaceAllUsesWith(&DummyValue); Ingredient->eraseFromParent(); continue; } VPRecipeBase *NewRecipe = nullptr; if (auto *VPPhi = dyn_cast(Ingredient)) { auto *Phi = cast(VPPhi->getUnderlyingValue()); InductionDescriptor II = Inductions.lookup(Phi); if (II.getKind() == InductionDescriptor::IK_IntInduction || II.getKind() == InductionDescriptor::IK_FpInduction) { VPValue *Start = Plan->getOrAddVPValue(II.getStartValue()); NewRecipe = new VPWidenIntOrFpInductionRecipe(Phi, Start, nullptr); } else { Plan->addVPValue(Phi, VPPhi); continue; } } else { assert(isa(Ingredient) && "only VPInstructions expected here"); assert(!isa(Inst) && "phis should be handled above"); // Create VPWidenMemoryInstructionRecipe for loads and stores. if (LoadInst *Load = dyn_cast(Inst)) { NewRecipe = new VPWidenMemoryInstructionRecipe( *Load, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), nullptr /*Mask*/); } else if (StoreInst *Store = dyn_cast(Inst)) { NewRecipe = new VPWidenMemoryInstructionRecipe( *Store, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), Plan->getOrAddVPValue(Store->getValueOperand()), nullptr /*Mask*/); } else if (GetElementPtrInst *GEP = dyn_cast(Inst)) { NewRecipe = new VPWidenGEPRecipe( GEP, Plan->mapToVPValues(GEP->operands()), OrigLoop); } else if (CallInst *CI = dyn_cast(Inst)) { NewRecipe = new VPWidenCallRecipe( *CI, Plan->mapToVPValues(CI->arg_operands())); } else if (SelectInst *SI = dyn_cast(Inst)) { bool InvariantCond = SE.isLoopInvariant(SE.getSCEV(SI->getOperand(0)), OrigLoop); NewRecipe = new VPWidenSelectRecipe( *SI, Plan->mapToVPValues(SI->operands()), InvariantCond); } else { NewRecipe = new VPWidenRecipe(*Inst, Plan->mapToVPValues(Inst->operands())); } } NewRecipe->insertBefore(Ingredient); if (NewRecipe->getNumDefinedValues() == 1) VPV->replaceAllUsesWith(NewRecipe->getVPSingleValue()); else assert(NewRecipe->getNumDefinedValues() == 0 && "Only recpies with zero or one defined values expected"); Ingredient->eraseFromParent(); Plan->removeVPValueFor(Inst); for (auto *Def : NewRecipe->definedValues()) { Plan->addVPValue(Inst, Def); } } } } bool VPlanTransforms::sinkScalarOperands(VPlan &Plan) { auto Iter = depth_first( VPBlockRecursiveTraversalWrapper(Plan.getEntry())); bool Changed = false; // First, collect the operands of all predicated replicate recipes as seeds // for sinking. SetVector WorkList; for (VPBasicBlock *VPBB : VPBlockUtils::blocksOnly(Iter)) { for (auto &Recipe : *VPBB) { auto *RepR = dyn_cast(&Recipe); if (!RepR || !RepR->isPredicated()) continue; WorkList.insert(RepR->op_begin(), RepR->op_end()); } } // Try to sink each replicate recipe in the worklist. while (!WorkList.empty()) { auto *C = WorkList.pop_back_val(); auto *SinkCandidate = dyn_cast_or_null(C->Def); if (!SinkCandidate || SinkCandidate->isUniform()) continue; // All users of SinkCandidate must be in the same block in order to perform // sinking. Therefore the destination block for sinking must match the block // containing the first user. auto *FirstUser = dyn_cast(*SinkCandidate->user_begin()); if (!FirstUser) continue; VPBasicBlock *SinkTo = FirstUser->getParent(); if (SinkCandidate->getParent() == SinkTo || SinkCandidate->mayHaveSideEffects() || SinkCandidate->mayReadOrWriteMemory()) continue; // All recipe users of the sink candidate must be in the same block SinkTo. if (any_of(SinkCandidate->users(), [SinkTo](VPUser *U) { auto *UI = dyn_cast(U); return !UI || UI->getParent() != SinkTo; })) continue; SinkCandidate->moveBefore(*SinkTo, SinkTo->getFirstNonPhi()); WorkList.insert(SinkCandidate->op_begin(), SinkCandidate->op_end()); Changed = true; } return Changed; }