1 //===-- VPlanTransforms.cpp - Utility VPlan to VPlan transforms -----------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 /// 9 /// \file 10 /// This file implements a set of utility VPlan to VPlan transformations. 11 /// 12 //===----------------------------------------------------------------------===// 13 14 #include "VPlanTransforms.h" 15 #include "llvm/ADT/PostOrderIterator.h" 16 17 using namespace llvm; 18 19 void VPlanTransforms::VPInstructionsToVPRecipes( 20 Loop *OrigLoop, VPlanPtr &Plan, 21 LoopVectorizationLegality::InductionList &Inductions, 22 SmallPtrSetImpl<Instruction *> &DeadInstructions) { 23 24 auto *TopRegion = cast<VPRegionBlock>(Plan->getEntry()); 25 ReversePostOrderTraversal<VPBlockBase *> RPOT(TopRegion->getEntry()); 26 27 // Condition bit VPValues get deleted during transformation to VPRecipes. 28 // Create new VPValues and save away as condition bits. These will be deleted 29 // after finalizing the vector IR basic blocks. 30 for (VPBlockBase *Base : RPOT) { 31 VPBasicBlock *VPBB = Base->getEntryBasicBlock(); 32 if (auto *CondBit = VPBB->getCondBit()) { 33 auto *NCondBit = new VPValue(CondBit->getUnderlyingValue()); 34 VPBB->setCondBit(NCondBit); 35 Plan->addCBV(NCondBit); 36 } 37 } 38 for (VPBlockBase *Base : RPOT) { 39 // Do not widen instructions in pre-header and exit blocks. 40 if (Base->getNumPredecessors() == 0 || Base->getNumSuccessors() == 0) 41 continue; 42 43 VPBasicBlock *VPBB = Base->getEntryBasicBlock(); 44 // Introduce each ingredient into VPlan. 45 for (auto I = VPBB->begin(), E = VPBB->end(); I != E;) { 46 VPRecipeBase *Ingredient = &*I++; 47 // Can only handle VPInstructions. 48 VPInstruction *VPInst = cast<VPInstruction>(Ingredient); 49 Instruction *Inst = cast<Instruction>(VPInst->getUnderlyingValue()); 50 if (DeadInstructions.count(Inst)) { 51 Ingredient->eraseFromParent(); 52 continue; 53 } 54 55 VPRecipeBase *NewRecipe = nullptr; 56 // Create VPWidenMemoryInstructionRecipe for loads and stores. 57 if (LoadInst *Load = dyn_cast<LoadInst>(Inst)) 58 NewRecipe = new VPWidenMemoryInstructionRecipe( 59 *Load, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), 60 nullptr /*Mask*/); 61 else if (StoreInst *Store = dyn_cast<StoreInst>(Inst)) 62 NewRecipe = new VPWidenMemoryInstructionRecipe( 63 *Store, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)), 64 Plan->getOrAddVPValue(Store->getValueOperand()), nullptr /*Mask*/); 65 else if (PHINode *Phi = dyn_cast<PHINode>(Inst)) { 66 InductionDescriptor II = Inductions.lookup(Phi); 67 if (II.getKind() == InductionDescriptor::IK_IntInduction || 68 II.getKind() == InductionDescriptor::IK_FpInduction) { 69 NewRecipe = new VPWidenIntOrFpInductionRecipe(Phi); 70 } else 71 NewRecipe = new VPWidenPHIRecipe(Phi); 72 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) { 73 NewRecipe = new VPWidenGEPRecipe( 74 GEP, Plan->mapToVPValues(GEP->operands()), OrigLoop); 75 } else 76 NewRecipe = 77 new VPWidenRecipe(*Inst, Plan->mapToVPValues(Inst->operands())); 78 79 NewRecipe->insertBefore(Ingredient); 80 Ingredient->eraseFromParent(); 81 } 82 } 83 } 84