• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 
VPInstructionsToVPRecipes(Loop * OrigLoop,VPlanPtr & Plan,LoopVectorizationLegality::InductionList & Inductions,SmallPtrSetImpl<Instruction * > & DeadInstructions)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   VPValue DummyValue;
39   for (VPBlockBase *Base : RPOT) {
40     // Do not widen instructions in pre-header and exit blocks.
41     if (Base->getNumPredecessors() == 0 || Base->getNumSuccessors() == 0)
42       continue;
43 
44     VPBasicBlock *VPBB = Base->getEntryBasicBlock();
45     // Introduce each ingredient into VPlan.
46     for (auto I = VPBB->begin(), E = VPBB->end(); I != E;) {
47       VPRecipeBase *Ingredient = &*I++;
48       // Can only handle VPInstructions.
49       VPInstruction *VPInst = cast<VPInstruction>(Ingredient);
50       Instruction *Inst = cast<Instruction>(VPInst->getUnderlyingValue());
51       if (DeadInstructions.count(Inst)) {
52         VPInst->replaceAllUsesWith(&DummyValue);
53         Ingredient->eraseFromParent();
54         continue;
55       }
56 
57       VPRecipeBase *NewRecipe = nullptr;
58       // Create VPWidenMemoryInstructionRecipe for loads and stores.
59       if (LoadInst *Load = dyn_cast<LoadInst>(Inst))
60         NewRecipe = new VPWidenMemoryInstructionRecipe(
61             *Load, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)),
62             nullptr /*Mask*/);
63       else if (StoreInst *Store = dyn_cast<StoreInst>(Inst))
64         NewRecipe = new VPWidenMemoryInstructionRecipe(
65             *Store, Plan->getOrAddVPValue(getLoadStorePointerOperand(Inst)),
66             Plan->getOrAddVPValue(Store->getValueOperand()), nullptr /*Mask*/);
67       else if (PHINode *Phi = dyn_cast<PHINode>(Inst)) {
68         InductionDescriptor II = Inductions.lookup(Phi);
69         if (II.getKind() == InductionDescriptor::IK_IntInduction ||
70             II.getKind() == InductionDescriptor::IK_FpInduction) {
71           NewRecipe = new VPWidenIntOrFpInductionRecipe(Phi);
72         } else
73           NewRecipe = new VPWidenPHIRecipe(Phi);
74       } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) {
75         NewRecipe = new VPWidenGEPRecipe(
76             GEP, Plan->mapToVPValues(GEP->operands()), OrigLoop);
77       } else
78         NewRecipe =
79             new VPWidenRecipe(*Inst, Plan->mapToVPValues(Inst->operands()));
80 
81       NewRecipe->insertBefore(Ingredient);
82       VPInst->replaceAllUsesWith(&DummyValue);
83       Ingredient->eraseFromParent();
84     }
85   }
86 }
87