LLVM  15.0.0git
LoopVectorizationPlanner.h
Go to the documentation of this file.
1 //===- LoopVectorizationPlanner.h - Planner for LoopVectorization ---------===//
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 provides a LoopVectorizationPlanner class.
11 /// InnerLoopVectorizer vectorizes loops which contain only one basic
12 /// LoopVectorizationPlanner - drives the vectorization process after having
13 /// passed Legality checks.
14 /// The planner builds and optimizes the Vectorization Plans which record the
15 /// decisions how to vectorize the given loop. In particular, represent the
16 /// control-flow of the vectorized version, the replication of instructions that
17 /// are to be scalarized, and interleave access groups.
18 ///
19 /// Also provides a VPlan-based builder utility analogous to IRBuilder.
20 /// It provides an instruction-level API for generating VPInstructions while
21 /// abstracting away the Recipe manipulation details.
22 //===----------------------------------------------------------------------===//
23 
24 #ifndef LLVM_TRANSFORMS_VECTORIZE_LOOPVECTORIZATIONPLANNER_H
25 #define LLVM_TRANSFORMS_VECTORIZE_LOOPVECTORIZATIONPLANNER_H
26 
27 #include "VPlan.h"
29 
30 namespace llvm {
31 
32 class LoopInfo;
33 class LoopVectorizationLegality;
34 class LoopVectorizationCostModel;
35 class PredicatedScalarEvolution;
36 class LoopVectorizationRequirements;
37 class LoopVectorizeHints;
38 class OptimizationRemarkEmitter;
39 class TargetTransformInfo;
40 class TargetLibraryInfo;
41 class VPRecipeBuilder;
42 
43 /// VPlan-based builder utility analogous to IRBuilder.
44 class VPBuilder {
45  VPBasicBlock *BB = nullptr;
47 
48  VPInstruction *createInstruction(unsigned Opcode,
50  VPInstruction *Instr = new VPInstruction(Opcode, Operands, DL);
51  if (BB)
52  BB->insert(Instr, InsertPt);
53  return Instr;
54  }
55 
56  VPInstruction *createInstruction(unsigned Opcode,
57  std::initializer_list<VPValue *> Operands,
58  DebugLoc DL) {
59  return createInstruction(Opcode, ArrayRef<VPValue *>(Operands), DL);
60  }
61 
62 public:
63  VPBuilder() = default;
64 
65  /// Clear the insertion point: created instructions will not be inserted into
66  /// a block.
68  BB = nullptr;
69  InsertPt = VPBasicBlock::iterator();
70  }
71 
72  VPBasicBlock *getInsertBlock() const { return BB; }
73  VPBasicBlock::iterator getInsertPoint() const { return InsertPt; }
74 
75  /// InsertPoint - A saved insertion point.
76  class VPInsertPoint {
77  VPBasicBlock *Block = nullptr;
79 
80  public:
81  /// Creates a new insertion point which doesn't point to anything.
82  VPInsertPoint() = default;
83 
84  /// Creates a new insertion point at the given location.
86  : Block(InsertBlock), Point(InsertPoint) {}
87 
88  /// Returns true if this insert point is set.
89  bool isSet() const { return Block != nullptr; }
90 
91  VPBasicBlock *getBlock() const { return Block; }
92  VPBasicBlock::iterator getPoint() const { return Point; }
93  };
94 
95  /// Sets the current insert point to a previously-saved location.
97  if (IP.isSet())
98  setInsertPoint(IP.getBlock(), IP.getPoint());
99  else
101  }
102 
103  /// This specifies that created VPInstructions should be appended to the end
104  /// of the specified block.
106  assert(TheBB && "Attempting to set a null insert point");
107  BB = TheBB;
108  InsertPt = BB->end();
109  }
110 
111  /// This specifies that created instructions should be inserted at the
112  /// specified point.
114  BB = TheBB;
115  InsertPt = IP;
116  }
117 
118  /// Insert and return the specified instruction.
120  BB->insert(I, InsertPt);
121  return I;
122  }
123 
124  /// Create an N-ary operation with \p Opcode, \p Operands and set \p Inst as
125  /// its underlying Instruction.
127  Instruction *Inst = nullptr) {
128  DebugLoc DL;
129  if (Inst)
130  DL = Inst->getDebugLoc();
131  VPInstruction *NewVPInst = createInstruction(Opcode, Operands, DL);
132  NewVPInst->setUnderlyingValue(Inst);
133  return NewVPInst;
134  }
136  DebugLoc DL) {
137  return createInstruction(Opcode, Operands, DL);
138  }
139 
141  return createInstruction(VPInstruction::Not, {Operand}, DL);
142  }
143 
145  return createInstruction(Instruction::BinaryOps::And, {LHS, RHS}, DL);
146  }
147 
149  return createInstruction(Instruction::BinaryOps::Or, {LHS, RHS}, DL);
150  }
151 
153  DebugLoc DL) {
155  }
156 
157  //===--------------------------------------------------------------------===//
158  // RAII helpers.
159  //===--------------------------------------------------------------------===//
160 
161  /// RAII object that stores the current insertion point and restores it when
162  /// the object is destroyed.
164  VPBuilder &Builder;
165  VPBasicBlock *Block;
167 
168  public:
170  : Builder(B), Block(B.getInsertBlock()), Point(B.getInsertPoint()) {}
171 
172  InsertPointGuard(const InsertPointGuard &) = delete;
173  InsertPointGuard &operator=(const InsertPointGuard &) = delete;
174 
175  ~InsertPointGuard() { Builder.restoreIP(VPInsertPoint(Block, Point)); }
176  };
177 };
178 
179 /// TODO: The following VectorizationFactor was pulled out of
180 /// LoopVectorizationCostModel class. LV also deals with
181 /// VectorizerParams::VectorizationFactor and VectorizationCostTy.
182 /// We need to streamline them.
183 
184 /// Information about vectorization costs.
186  /// Vector width with best cost.
188  /// Cost of the loop with that width.
190 
192  : Width(Width), Cost(Cost) {}
193 
194  /// Width 1 means no vectorization, cost 0 means uncomputed cost.
196  return {ElementCount::getFixed(1), 0};
197  }
198 
199  bool operator==(const VectorizationFactor &rhs) const {
200  return Width == rhs.Width && Cost == rhs.Cost;
201  }
202 
203  bool operator!=(const VectorizationFactor &rhs) const {
204  return !(*this == rhs);
205  }
206 };
207 
208 /// A class that represents two vectorization factors (initialized with 0 by
209 /// default). One for fixed-width vectorization and one for scalable
210 /// vectorization. This can be used by the vectorizer to choose from a range of
211 /// fixed and/or scalable VFs in order to find the most cost-effective VF to
212 /// vectorize with.
216 
218  : FixedVF(ElementCount::getFixed(0)),
219  ScalableVF(ElementCount::getScalable(0)) {}
221  *(Max.isScalable() ? &ScalableVF : &FixedVF) = Max;
222  }
224  const ElementCount &ScalableVF)
227  "Invalid scalable properties");
228  }
229 
231 
232  /// \return true if either fixed- or scalable VF is non-zero.
233  explicit operator bool() const { return FixedVF || ScalableVF; }
234 
235  /// \return true if either fixed- or scalable VF is a valid vector VF.
236  bool hasVector() const { return FixedVF.isVector() || ScalableVF.isVector(); }
237 };
238 
239 /// Planner drives the vectorization process after having passed
240 /// Legality checks.
242  /// The loop that we evaluate.
243  Loop *OrigLoop;
244 
245  /// Loop Info analysis.
246  LoopInfo *LI;
247 
248  /// Target Library Info.
249  const TargetLibraryInfo *TLI;
250 
251  /// Target Transform Info.
252  const TargetTransformInfo *TTI;
253 
254  /// The legality analysis.
256 
257  /// The profitability analysis.
259 
260  /// The interleaved access analysis.
262 
264 
265  const LoopVectorizeHints &Hints;
266 
267  LoopVectorizationRequirements &Requirements;
268 
270 
272 
273  /// A builder used to construct the current plan.
274  VPBuilder Builder;
275 
276 public:
278  const TargetTransformInfo *TTI,
283  const LoopVectorizeHints &Hints,
284  LoopVectorizationRequirements &Requirements,
286  : OrigLoop(L), LI(LI), TLI(TLI), TTI(TTI), Legal(Legal), CM(CM), IAI(IAI),
287  PSE(PSE), Hints(Hints), Requirements(Requirements), ORE(ORE) {}
288 
289  /// Plan how to best vectorize, return the best VF and its cost, or None if
290  /// vectorization and interleaving should be avoided up front.
291  Optional<VectorizationFactor> plan(ElementCount UserVF, unsigned UserIC);
292 
293  /// Use the VPlan-native path to plan how to best vectorize, return the best
294  /// VF and its cost.
296 
297  /// Return the best VPlan for \p VF.
298  VPlan &getBestPlanFor(ElementCount VF) const;
299 
300  /// Generate the IR code for the body of the vectorized loop according to the
301  /// best selected \p VF, \p UF and VPlan \p BestPlan.
302  void executePlan(ElementCount VF, unsigned UF, VPlan &BestPlan,
304 
305 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
306  void printPlans(raw_ostream &O);
307 #endif
308 
309  /// Look through the existing plans and return true if we have one with all
310  /// the vectorization factors in question.
311  bool hasPlanWithVF(ElementCount VF) const {
312  return any_of(VPlans,
313  [&](const VPlanPtr &Plan) { return Plan->hasVF(VF); });
314  }
315 
316  /// Test a \p Predicate on a \p Range of VF's. Return the value of applying
317  /// \p Predicate on Range.Start, possibly decreasing Range.End such that the
318  /// returned value holds for the entire \p Range.
319  static bool
321  VFRange &Range);
322 
323 protected:
324  /// Collect the instructions from the original loop that would be trivially
325  /// dead in the vectorized loop if generated.
327  SmallPtrSetImpl<Instruction *> &DeadInstructions);
328 
329  /// Build VPlans for power-of-2 VF's between \p MinVF and \p MaxVF inclusive,
330  /// according to the information gathered by Legal when it checked if it is
331  /// legal to vectorize the loop.
332  void buildVPlans(ElementCount MinVF, ElementCount MaxVF);
333 
334 private:
335  /// Build a VPlan according to the information gathered by Legal. \return a
336  /// VPlan for vectorization factors \p Range.Start and up to \p Range.End
337  /// exclusive, possibly decreasing \p Range.End.
338  VPlanPtr buildVPlan(VFRange &Range);
339 
340  /// Build a VPlan using VPRecipes according to the information gather by
341  /// Legal. This method is only used for the legacy inner loop vectorizer.
342  VPlanPtr buildVPlanWithVPRecipes(
343  VFRange &Range, SmallPtrSetImpl<Instruction *> &DeadInstructions,
344  const MapVector<Instruction *, Instruction *> &SinkAfter);
345 
346  /// Build VPlans for power-of-2 VF's between \p MinVF and \p MaxVF inclusive,
347  /// according to the information gathered by Legal when it checked if it is
348  /// legal to vectorize the loop. This method creates VPlans using VPRecipes.
349  void buildVPlansWithVPRecipes(ElementCount MinVF, ElementCount MaxVF);
350 
351  // Adjust the recipes for reductions. For in-loop reductions the chain of
352  // instructions leading from the loop exit instr to the phi need to be
353  // converted to reductions, with one operand being vector and the other being
354  // the scalar reduction chain. For other reductions, a select is introduced
355  // between the phi and live-out recipes when folding the tail.
356  void adjustRecipesForReductions(VPBasicBlock *LatchVPBB, VPlanPtr &Plan,
357  VPRecipeBuilder &RecipeBuilder,
358  ElementCount MinVF);
359 };
360 
361 } // namespace llvm
362 
363 #endif // LLVM_TRANSFORMS_VECTORIZE_LOOPVECTORIZATIONPLANNER_H
llvm::InstructionCost
Definition: InstructionCost.h:29
llvm::VPBuilder::getInsertBlock
VPBasicBlock * getInsertBlock() const
Definition: LoopVectorizationPlanner.h:72
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:17
llvm::FixedScalableVFPair
A class that represents two vectorization factors (initialized with 0 by default).
Definition: LoopVectorizationPlanner.h:213
llvm::FixedScalableVFPair::FixedScalableVFPair
FixedScalableVFPair(const ElementCount &Max)
Definition: LoopVectorizationPlanner.h:220
llvm::LoopVectorizationPlanner::collectTriviallyDeadInstructions
void collectTriviallyDeadInstructions(SmallPtrSetImpl< Instruction * > &DeadInstructions)
Collect the instructions from the original loop that would be trivially dead in the vectorized loop i...
Definition: LoopVectorize.cpp:7712
llvm::VPBuilder::createNaryOp
VPValue * createNaryOp(unsigned Opcode, ArrayRef< VPValue * > Operands, Instruction *Inst=nullptr)
Create an N-ary operation with Opcode, Operands and set Inst as its underlying Instruction.
Definition: LoopVectorizationPlanner.h:126
llvm::VPInstruction::Not
@ Not
Definition: VPlan.h:809
llvm::VPBuilder::VPInsertPoint::VPInsertPoint
VPInsertPoint()=default
Creates a new insertion point which doesn't point to anything.
llvm::ElementCount
Definition: TypeSize.h:390
llvm::VPBasicBlock
VPBasicBlock serves as the leaf of the Hierarchical Control-Flow Graph.
Definition: VPlan.h:1989
llvm::Loop
Represents a single loop in the control flow graph.
Definition: LoopInfo.h:530
llvm::FixedScalableVFPair::getNone
static FixedScalableVFPair getNone()
Definition: LoopVectorizationPlanner.h:230
llvm::VPBuilder::createNot
VPValue * createNot(VPValue *Operand, DebugLoc DL)
Definition: LoopVectorizationPlanner.h:140
llvm::VPBuilder::createOr
VPValue * createOr(VPValue *LHS, VPValue *RHS, DebugLoc DL)
Definition: LoopVectorizationPlanner.h:148
llvm::PredicatedScalarEvolution
An interface layer with SCEV used to manage how we see SCEV expressions for values in the context of ...
Definition: ScalarEvolution.h:2176
llvm::SmallVector< VPlanPtr, 4 >
llvm::TargetTransformInfo
This pass provides access to the codegen interfaces that are needed for IR-level transformations.
Definition: TargetTransformInfo.h:167
llvm::LoopVectorizationLegality
LoopVectorizationLegality checks if it is legal to vectorize a loop, and to what vectorization factor...
Definition: LoopVectorizationLegality.h:249
llvm::DominatorTree
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition: Dominators.h:166
llvm::VPBuilder::InsertPointGuard::operator=
InsertPointGuard & operator=(const InsertPointGuard &)=delete
llvm::VPlanPtr
std::unique_ptr< VPlan > VPlanPtr
Definition: VPlan.h:97
llvm::VPBuilder::getInsertPoint
VPBasicBlock::iterator getInsertPoint() const
Definition: LoopVectorizationPlanner.h:73
llvm::Optional
Definition: APInt.h:33
llvm::LoopVectorizationPlanner::plan
Optional< VectorizationFactor > plan(ElementCount UserVF, unsigned UserIC)
Plan how to best vectorize, return the best VF and its cost, or None if vectorization and interleavin...
Definition: LoopVectorize.cpp:7496
llvm::MapVector
This class implements a map that also provides access to all stored values in a deterministic order.
Definition: MapVector.h:37
llvm::tgtok::FalseVal
@ FalseVal
Definition: TGLexer.h:61
llvm::FixedScalableVFPair::FixedScalableVFPair
FixedScalableVFPair(const ElementCount &FixedVF, const ElementCount &ScalableVF)
Definition: LoopVectorizationPlanner.h:223
llvm::VPRecipeBuilder
Helper class to create VPRecipies from IR instructions.
Definition: VPRecipeBuilder.h:27
RHS
Value * RHS
Definition: X86PartialReduction.cpp:76
llvm::VectorizationFactor::operator==
bool operator==(const VectorizationFactor &rhs) const
Definition: LoopVectorizationPlanner.h:199
llvm::LinearPolySize::isScalable
bool isScalable() const
Returns whether the size is scaled by a runtime quantity (vscale).
Definition: TypeSize.h:298
llvm::VectorizationFactor::operator!=
bool operator!=(const VectorizationFactor &rhs) const
Definition: LoopVectorizationPlanner.h:203
llvm::VFRange
A range of powers-of-2 vectorization factors with fixed start and adjustable end.
Definition: VPlan.h:77
llvm::LoopVectorizationCostModel
LoopVectorizationCostModel - estimates the expected speedups due to vectorization.
Definition: LoopVectorize.cpp:1226
llvm::VectorizationFactor::VectorizationFactor
VectorizationFactor(ElementCount Width, InstructionCost Cost)
Definition: LoopVectorizationPlanner.h:191
llvm::LoopVectorizationRequirements
This holds vectorization requirements that must be verified late in the process.
Definition: LoopVectorizationLegality.h:214
llvm::VPBasicBlock::iterator
RecipeListTy::iterator iterator
Instruction iterators...
Definition: VPlan.h:2010
LHS
Value * LHS
Definition: X86PartialReduction.cpp:75
llvm::VPInstruction
This is a concrete Recipe that models a single VPlan-level instruction.
Definition: VPlan.h:800
llvm::VPBuilder
VPlan-based builder utility analogous to IRBuilder.
Definition: LoopVectorizationPlanner.h:44
llvm::FixedScalableVFPair::hasVector
bool hasVector() const
Definition: LoopVectorizationPlanner.h:236
llvm::LoopVectorizationPlanner::buildVPlans
void buildVPlans(ElementCount MinVF, ElementCount MaxVF)
Build VPlans for power-of-2 VF's between MinVF and MaxVF inclusive, according to the information gath...
Definition: LoopVectorize.cpp:8057
IP
Definition: NVPTXLowerArgs.cpp:167
llvm::FixedScalableVFPair::FixedVF
ElementCount FixedVF
Definition: LoopVectorizationPlanner.h:214
B
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
llvm::Instruction
Definition: Instruction.h:42
llvm::InterleavedAccessInfo
Drive the analysis of interleaved memory accesses in the loop.
Definition: VectorUtils.h:751
llvm::raw_ostream
This class implements an extremely fast bulk output stream that can only output to a stream.
Definition: raw_ostream.h:54
llvm::VPValue
Definition: VPlanValue.h:44
VPlan.h
llvm::InnerLoopVectorizer
InnerLoopVectorizer vectorizes loops which contain only one basic block to a specified vectorization ...
Definition: LoopVectorize.cpp:446
llvm::LinearPolySize< ElementCount >::getFixed
static ElementCount getFixed(ScalarTy MinVal)
Definition: TypeSize.h:283
llvm::LoopVectorizationPlanner
Planner drives the vectorization process after having passed Legality checks.
Definition: LoopVectorizationPlanner.h:241
llvm::VectorizationFactor::Cost
InstructionCost Cost
Cost of the loop with that width.
Definition: LoopVectorizationPlanner.h:189
llvm::VPBuilder::insert
VPInstruction * insert(VPInstruction *I) const
Insert and return the specified instruction.
Definition: LoopVectorizationPlanner.h:119
Operands
mir Rename Register Operands
Definition: MIRNamerPass.cpp:74
llvm::RISCVFenceField::O
@ O
Definition: RISCVBaseInfo.h:239
llvm::PPC::Predicate
Predicate
Predicate - These are "(BI << 5) | BO" for various predicates.
Definition: PPCPredicates.h:26
llvm::LoopVectorizeHints
Utility class for getting and setting loop vectorizer hints in the form of loop metadata.
Definition: LoopVectorizationLegality.h:61
llvm::IRSimilarity::Legal
@ Legal
Definition: IRSimilarityIdentifier.h:76
llvm::VPBuilder::VPInsertPoint::getBlock
VPBasicBlock * getBlock() const
Definition: LoopVectorizationPlanner.h:91
llvm::VPBuilder::InsertPointGuard::~InsertPointGuard
~InsertPointGuard()
Definition: LoopVectorizationPlanner.h:175
llvm::LoopVectorizationPlanner::LoopVectorizationPlanner
LoopVectorizationPlanner(Loop *L, LoopInfo *LI, const TargetLibraryInfo *TLI, const TargetTransformInfo *TTI, LoopVectorizationLegality *Legal, LoopVectorizationCostModel &CM, InterleavedAccessInfo &IAI, PredicatedScalarEvolution &PSE, const LoopVectorizeHints &Hints, LoopVectorizationRequirements &Requirements, OptimizationRemarkEmitter *ORE)
Definition: LoopVectorizationPlanner.h:277
I
#define I(x, y, z)
Definition: MD5.cpp:58
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
llvm::VPBuilder::InsertPointGuard
RAII object that stores the current insertion point and restores it when the object is destroyed.
Definition: LoopVectorizationPlanner.h:163
function
print Print MemDeps of function
Definition: MemDepPrinter.cpp:82
llvm::ElementCount::isVector
bool isVector() const
One or more elements.
Definition: TypeSize.h:402
Builder
assume Assume Builder
Definition: AssumeBundleBuilder.cpp:651
llvm::VPBuilder::setInsertPoint
void setInsertPoint(VPBasicBlock *TheBB, VPBasicBlock::iterator IP)
This specifies that created instructions should be inserted at the specified point.
Definition: LoopVectorizationPlanner.h:113
InstructionCost.h
llvm::ArrayRef
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
Definition: APInt.h:32
llvm::LoopInfo
Definition: LoopInfo.h:1086
llvm::OptimizationRemarkEmitter
The optimization diagnostic interface.
Definition: OptimizationRemarkEmitter.h:33
llvm::any_of
bool any_of(R &&range, UnaryPredicate P)
Provide wrappers to std::any_of which take ranges instead of having to pass begin/end explicitly.
Definition: STLExtras.h:1612
Cond
SmallVector< MachineOperand, 4 > Cond
Definition: BasicBlockSections.cpp:178
DL
MachineBasicBlock MachineBasicBlock::iterator DebugLoc DL
Definition: AArch64SLSHardening.cpp:76
llvm::VPBuilder::createSelect
VPValue * createSelect(VPValue *Cond, VPValue *TrueVal, VPValue *FalseVal, DebugLoc DL)
Definition: LoopVectorizationPlanner.h:152
llvm::VPValue::setUnderlyingValue
void setUnderlyingValue(Value *Val)
Definition: VPlanValue.h:77
llvm::VPBuilder::createAnd
VPValue * createAnd(VPValue *LHS, VPValue *RHS, DebugLoc DL)
Definition: LoopVectorizationPlanner.h:144
llvm::MCID::Select
@ Select
Definition: MCInstrDesc.h:164
llvm::LoopVectorizationPlanner::printPlans
void printPlans(raw_ostream &O)
Definition: LoopVectorize.cpp:7703
llvm::VPBuilder::clearInsertionPoint
void clearInsertionPoint()
Clear the insertion point: created instructions will not be inserted into a block.
Definition: LoopVectorizationPlanner.h:67
llvm::VectorizationFactor
TODO: The following VectorizationFactor was pulled out of LoopVectorizationCostModel class.
Definition: LoopVectorizationPlanner.h:185
llvm::FixedScalableVFPair::ScalableVF
ElementCount ScalableVF
Definition: LoopVectorizationPlanner.h:215
llvm::VPBuilder::VPInsertPoint
InsertPoint - A saved insertion point.
Definition: LoopVectorizationPlanner.h:76
llvm::VPBuilder::VPBuilder
VPBuilder()=default
llvm::VPBuilder::restoreIP
void restoreIP(VPInsertPoint IP)
Sets the current insert point to a previously-saved location.
Definition: LoopVectorizationPlanner.h:96
llvm::TargetLibraryInfo
Provides information about what library functions are available for the current target.
Definition: TargetLibraryInfo.h:222
llvm::VPBuilder::VPInsertPoint::VPInsertPoint
VPInsertPoint(VPBasicBlock *InsertBlock, VPBasicBlock::iterator InsertPoint)
Creates a new insertion point at the given location.
Definition: LoopVectorizationPlanner.h:85
llvm::VPBuilder::InsertPointGuard::InsertPointGuard
InsertPointGuard(VPBuilder &B)
Definition: LoopVectorizationPlanner.h:169
llvm::VectorizationFactor::Width
ElementCount Width
Vector width with best cost.
Definition: LoopVectorizationPlanner.h:187
llvm::LoopVectorizationPlanner::planInVPlanNativePath
VectorizationFactor planInVPlanNativePath(ElementCount UserVF)
Use the VPlan-native path to plan how to best vectorize, return the best VF and its cost.
Definition: LoopVectorize.cpp:7451
llvm::VPBuilder::setInsertPoint
void setInsertPoint(VPBasicBlock *TheBB)
This specifies that created VPInstructions should be appended to the end of the specified block.
Definition: LoopVectorizationPlanner.h:105
llvm::LoopVectorizationPlanner::executePlan
void executePlan(ElementCount VF, unsigned UF, VPlan &BestPlan, InnerLoopVectorizer &LB, DominatorTree *DT)
Generate the IR code for the body of the vectorized loop according to the best selected VF,...
Definition: LoopVectorize.cpp:7636
llvm::FixedScalableVFPair::FixedScalableVFPair
FixedScalableVFPair()
Definition: LoopVectorizationPlanner.h:217
llvm::VPBuilder::VPInsertPoint::getPoint
VPBasicBlock::iterator getPoint() const
Definition: LoopVectorizationPlanner.h:92
llvm::LoopVectorizationPlanner::hasPlanWithVF
bool hasPlanWithVF(ElementCount VF) const
Look through the existing plans and return true if we have one with all the vectorization factors in ...
Definition: LoopVectorizationPlanner.h:311
llvm::SmallPtrSetImpl< Instruction * >
llvm::VPBuilder::createNaryOp
VPValue * createNaryOp(unsigned Opcode, ArrayRef< VPValue * > Operands, DebugLoc DL)
Definition: LoopVectorizationPlanner.h:135
BB
Common register allocation spilling lr str ldr sxth r3 ldr mla r4 can lr mov lr str ldr sxth r3 mla r4 and then merge mul and lr str ldr sxth r3 mla r4 It also increase the likelihood the store may become dead bb27 Successors according to LLVM BB
Definition: README.txt:39
llvm::DebugLoc
A debug info location.
Definition: DebugLoc.h:33
llvm::tgtok::TrueVal
@ TrueVal
Definition: TGLexer.h:61
llvm::VPBuilder::VPInsertPoint::isSet
bool isSet() const
Returns true if this insert point is set.
Definition: LoopVectorizationPlanner.h:89
llvm::VPlan
VPlan models a candidate for vectorization, encoding various decisions take to produce efficient outp...
Definition: VPlan.h:2459
llvm::LoopVectorizationPlanner::getDecisionAndClampRange
static bool getDecisionAndClampRange(const std::function< bool(ElementCount)> &Predicate, VFRange &Range)
Test a Predicate on a Range of VF's.
Definition: LoopVectorize.cpp:8037
llvm::LoopVectorizationPlanner::getBestPlanFor
VPlan & getBestPlanFor(ElementCount VF) const
Return the best VPlan for VF.
Definition: LoopVectorize.cpp:7589
llvm::VectorizationFactor::Disabled
static VectorizationFactor Disabled()
Width 1 means no vectorization, cost 0 means uncomputed cost.
Definition: LoopVectorizationPlanner.h:195