1 //===- LoopVectorize.cpp - A Loop Vectorizer ------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This is the LLVM loop vectorizer. This pass modifies 'vectorizable' loops
11 // and generates target-independent LLVM-IR.
12 // The vectorizer uses the TargetTransformInfo analysis to estimate the costs
13 // of instructions in order to estimate the profitability of vectorization.
15 // The loop vectorizer combines consecutive loop iterations into a single
16 // 'wide' iteration. After this transformation the index is incremented
17 // by the SIMD vector width, and not by one.
19 // This pass has three parts:
20 // 1. The main loop pass that drives the different parts.
21 // 2. LoopVectorizationLegality - A unit that checks for the legality
22 // of the vectorization.
23 // 3. InnerLoopVectorizer - A unit that performs the actual
24 // widening of instructions.
25 // 4. LoopVectorizationCostModel - A unit that checks for the profitability
26 // of vectorization. It decides on the optimal vector width, which
27 // can be one, if vectorization is not profitable.
29 //===----------------------------------------------------------------------===//
31 // The reduction-variable vectorization is based on the paper:
32 // D. Nuzman and R. Henderson. Multi-platform Auto-vectorization.
34 // Variable uniformity checks are inspired by:
35 // Karrenberg, R. and Hack, S. Whole Function Vectorization.
37 // Other ideas/concepts are from:
38 // A. Zaks and D. Nuzman. Autovectorization in GCC-two years later.
40 // S. Maleki, Y. Gao, M. Garzaran, T. Wong and D. Padua. An Evaluation of
41 // Vectorizing Compilers.
43 //===----------------------------------------------------------------------===//
45 #include "llvm/Transforms/Vectorize.h"
46 #include "llvm/ADT/DenseMap.h"
47 #include "llvm/ADT/EquivalenceClasses.h"
48 #include "llvm/ADT/Hashing.h"
49 #include "llvm/ADT/MapVector.h"
50 #include "llvm/ADT/SetVector.h"
51 #include "llvm/ADT/SmallPtrSet.h"
52 #include "llvm/ADT/SmallSet.h"
53 #include "llvm/ADT/SmallVector.h"
54 #include "llvm/ADT/Statistic.h"
55 #include "llvm/ADT/StringExtras.h"
56 #include "llvm/Analysis/AliasAnalysis.h"
57 #include "llvm/Analysis/AliasSetTracker.h"
58 #include "llvm/Analysis/AssumptionCache.h"
59 #include "llvm/Analysis/BlockFrequencyInfo.h"
60 #include "llvm/Analysis/CodeMetrics.h"
61 #include "llvm/Analysis/LoopAccessAnalysis.h"
62 #include "llvm/Analysis/LoopInfo.h"
63 #include "llvm/Analysis/LoopIterator.h"
64 #include "llvm/Analysis/LoopPass.h"
65 #include "llvm/Analysis/ScalarEvolution.h"
66 #include "llvm/Analysis/ScalarEvolutionExpander.h"
67 #include "llvm/Analysis/ScalarEvolutionExpressions.h"
68 #include "llvm/Analysis/TargetTransformInfo.h"
69 #include "llvm/Analysis/ValueTracking.h"
70 #include "llvm/IR/Constants.h"
71 #include "llvm/IR/DataLayout.h"
72 #include "llvm/IR/DebugInfo.h"
73 #include "llvm/IR/DerivedTypes.h"
74 #include "llvm/IR/DiagnosticInfo.h"
75 #include "llvm/IR/Dominators.h"
76 #include "llvm/IR/Function.h"
77 #include "llvm/IR/IRBuilder.h"
78 #include "llvm/IR/Instructions.h"
79 #include "llvm/IR/IntrinsicInst.h"
80 #include "llvm/IR/LLVMContext.h"
81 #include "llvm/IR/Module.h"
82 #include "llvm/IR/PatternMatch.h"
83 #include "llvm/IR/Type.h"
84 #include "llvm/IR/Value.h"
85 #include "llvm/IR/ValueHandle.h"
86 #include "llvm/IR/Verifier.h"
87 #include "llvm/Pass.h"
88 #include "llvm/Support/BranchProbability.h"
89 #include "llvm/Support/CommandLine.h"
90 #include "llvm/Support/Debug.h"
91 #include "llvm/Support/raw_ostream.h"
92 #include "llvm/Transforms/Scalar.h"
93 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
94 #include "llvm/Transforms/Utils/Local.h"
95 #include "llvm/Transforms/Utils/VectorUtils.h"
100 using namespace llvm;
101 using namespace llvm::PatternMatch;
103 #define LV_NAME "loop-vectorize"
104 #define DEBUG_TYPE LV_NAME
106 STATISTIC(LoopsVectorized, "Number of loops vectorized");
107 STATISTIC(LoopsAnalyzed, "Number of loops analyzed for vectorization");
110 EnableIfConversion("enable-if-conversion", cl::init(true), cl::Hidden,
111 cl::desc("Enable if-conversion during vectorization."));
113 /// We don't vectorize loops with a known constant trip count below this number.
114 static cl::opt<unsigned>
115 TinyTripCountVectorThreshold("vectorizer-min-trip-count", cl::init(16),
117 cl::desc("Don't vectorize loops with a constant "
118 "trip count that is smaller than this "
121 /// This enables versioning on the strides of symbolically striding memory
122 /// accesses in code like the following.
123 /// for (i = 0; i < N; ++i)
124 /// A[i * Stride1] += B[i * Stride2] ...
126 /// Will be roughly translated to
127 /// if (Stride1 == 1 && Stride2 == 1) {
128 /// for (i = 0; i < N; i+=4)
132 static cl::opt<bool> EnableMemAccessVersioning(
133 "enable-mem-access-versioning", cl::init(true), cl::Hidden,
134 cl::desc("Enable symblic stride memory access versioning"));
136 /// We don't unroll loops with a known constant trip count below this number.
137 static const unsigned TinyTripCountUnrollThreshold = 128;
139 static cl::opt<unsigned> ForceTargetNumScalarRegs(
140 "force-target-num-scalar-regs", cl::init(0), cl::Hidden,
141 cl::desc("A flag that overrides the target's number of scalar registers."));
143 static cl::opt<unsigned> ForceTargetNumVectorRegs(
144 "force-target-num-vector-regs", cl::init(0), cl::Hidden,
145 cl::desc("A flag that overrides the target's number of vector registers."));
147 /// Maximum vectorization interleave count.
148 static const unsigned MaxInterleaveFactor = 16;
150 static cl::opt<unsigned> ForceTargetMaxScalarInterleaveFactor(
151 "force-target-max-scalar-interleave", cl::init(0), cl::Hidden,
152 cl::desc("A flag that overrides the target's max interleave factor for "
155 static cl::opt<unsigned> ForceTargetMaxVectorInterleaveFactor(
156 "force-target-max-vector-interleave", cl::init(0), cl::Hidden,
157 cl::desc("A flag that overrides the target's max interleave factor for "
158 "vectorized loops."));
160 static cl::opt<unsigned> ForceTargetInstructionCost(
161 "force-target-instruction-cost", cl::init(0), cl::Hidden,
162 cl::desc("A flag that overrides the target's expected cost for "
163 "an instruction to a single constant value. Mostly "
164 "useful for getting consistent testing."));
166 static cl::opt<unsigned> SmallLoopCost(
167 "small-loop-cost", cl::init(20), cl::Hidden,
168 cl::desc("The cost of a loop that is considered 'small' by the unroller."));
170 static cl::opt<bool> LoopVectorizeWithBlockFrequency(
171 "loop-vectorize-with-block-frequency", cl::init(false), cl::Hidden,
172 cl::desc("Enable the use of the block frequency analysis to access PGO "
173 "heuristics minimizing code growth in cold regions and being more "
174 "aggressive in hot regions."));
176 // Runtime unroll loops for load/store throughput.
177 static cl::opt<bool> EnableLoadStoreRuntimeUnroll(
178 "enable-loadstore-runtime-unroll", cl::init(true), cl::Hidden,
179 cl::desc("Enable runtime unrolling until load/store ports are saturated"));
181 /// The number of stores in a loop that are allowed to need predication.
182 static cl::opt<unsigned> NumberOfStoresToPredicate(
183 "vectorize-num-stores-pred", cl::init(1), cl::Hidden,
184 cl::desc("Max number of stores to be predicated behind an if."));
186 static cl::opt<bool> EnableIndVarRegisterHeur(
187 "enable-ind-var-reg-heur", cl::init(true), cl::Hidden,
188 cl::desc("Count the induction variable only once when unrolling"));
190 static cl::opt<bool> EnableCondStoresVectorization(
191 "enable-cond-stores-vec", cl::init(false), cl::Hidden,
192 cl::desc("Enable if predication of stores during vectorization."));
194 static cl::opt<unsigned> MaxNestedScalarReductionUF(
195 "max-nested-scalar-reduction-unroll", cl::init(2), cl::Hidden,
196 cl::desc("The maximum unroll factor to use when unrolling a scalar "
197 "reduction in a nested loop."));
201 // Forward declarations.
202 class LoopVectorizationLegality;
203 class LoopVectorizationCostModel;
204 class LoopVectorizeHints;
206 /// \brief This modifies LoopAccessReport to initialize message with
207 /// loop-vectorizer-specific part.
208 class VectorizationReport : public LoopAccessReport {
210 VectorizationReport(Instruction *I = nullptr)
211 : LoopAccessReport("loop not vectorized: ", I) {}
213 /// \brief This allows promotion of the loop-access analysis report into the
214 /// loop-vectorizer report. It modifies the message to add the
215 /// loop-vectorizer-specific part of the message.
216 explicit VectorizationReport(const LoopAccessReport &R)
217 : LoopAccessReport(Twine("loop not vectorized: ") + R.str(),
221 /// A helper function for converting Scalar types to vector types.
222 /// If the incoming type is void, we return void. If the VF is 1, we return
224 static Type* ToVectorTy(Type *Scalar, unsigned VF) {
225 if (Scalar->isVoidTy() || VF == 1)
227 return VectorType::get(Scalar, VF);
230 /// InnerLoopVectorizer vectorizes loops which contain only one basic
231 /// block to a specified vectorization factor (VF).
232 /// This class performs the widening of scalars into vectors, or multiple
233 /// scalars. This class also implements the following features:
234 /// * It inserts an epilogue loop for handling loops that don't have iteration
235 /// counts that are known to be a multiple of the vectorization factor.
236 /// * It handles the code generation for reduction variables.
237 /// * Scalarization (implementation using scalars) of un-vectorizable
239 /// InnerLoopVectorizer does not perform any vectorization-legality
240 /// checks, and relies on the caller to check for the different legality
241 /// aspects. The InnerLoopVectorizer relies on the
242 /// LoopVectorizationLegality class to provide information about the induction
243 /// and reduction variables that were found to a given vectorization factor.
244 class InnerLoopVectorizer {
246 InnerLoopVectorizer(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI,
247 DominatorTree *DT, const TargetLibraryInfo *TLI,
248 const TargetTransformInfo *TTI, unsigned VecWidth,
249 unsigned UnrollFactor)
250 : OrigLoop(OrigLoop), SE(SE), LI(LI), DT(DT), TLI(TLI), TTI(TTI),
251 VF(VecWidth), UF(UnrollFactor), Builder(SE->getContext()),
252 Induction(nullptr), OldInduction(nullptr), WidenMap(UnrollFactor),
253 Legal(nullptr), AddedSafetyChecks(false) {}
255 // Perform the actual loop widening (vectorization).
256 void vectorize(LoopVectorizationLegality *L) {
258 // Create a new empty loop. Unlink the old loop and connect the new one.
260 // Widen each instruction in the old loop to a new one in the new loop.
261 // Use the Legality module to find the induction and reduction variables.
263 // Register the new loop and update the analysis passes.
267 // Return true if any runtime check is added.
268 bool IsSafetyChecksAdded() {
269 return AddedSafetyChecks;
272 virtual ~InnerLoopVectorizer() {}
275 /// A small list of PHINodes.
276 typedef SmallVector<PHINode*, 4> PhiVector;
277 /// When we unroll loops we have multiple vector values for each scalar.
278 /// This data structure holds the unrolled and vectorized values that
279 /// originated from one scalar instruction.
280 typedef SmallVector<Value*, 2> VectorParts;
282 // When we if-convert we need create edge masks. We have to cache values so
283 // that we don't end up with exponential recursion/IR.
284 typedef DenseMap<std::pair<BasicBlock*, BasicBlock*>,
285 VectorParts> EdgeMaskCache;
287 /// \brief Add checks for strides that where assumed to be 1.
289 /// Returns the last check instruction and the first check instruction in the
290 /// pair as (first, last).
291 std::pair<Instruction *, Instruction *> addStrideCheck(Instruction *Loc);
293 /// Create an empty loop, based on the loop ranges of the old loop.
294 void createEmptyLoop();
295 /// Copy and widen the instructions from the old loop.
296 virtual void vectorizeLoop();
298 /// \brief The Loop exit block may have single value PHI nodes where the
299 /// incoming value is 'Undef'. While vectorizing we only handled real values
300 /// that were defined inside the loop. Here we fix the 'undef case'.
304 /// A helper function that computes the predicate of the block BB, assuming
305 /// that the header block of the loop is set to True. It returns the *entry*
306 /// mask for the block BB.
307 VectorParts createBlockInMask(BasicBlock *BB);
308 /// A helper function that computes the predicate of the edge between SRC
310 VectorParts createEdgeMask(BasicBlock *Src, BasicBlock *Dst);
312 /// A helper function to vectorize a single BB within the innermost loop.
313 void vectorizeBlockInLoop(BasicBlock *BB, PhiVector *PV);
315 /// Vectorize a single PHINode in a block. This method handles the induction
316 /// variable canonicalization. It supports both VF = 1 for unrolled loops and
317 /// arbitrary length vectors.
318 void widenPHIInstruction(Instruction *PN, VectorParts &Entry,
319 unsigned UF, unsigned VF, PhiVector *PV);
321 /// Insert the new loop to the loop hierarchy and pass manager
322 /// and update the analysis passes.
323 void updateAnalysis();
325 /// This instruction is un-vectorizable. Implement it as a sequence
326 /// of scalars. If \p IfPredicateStore is true we need to 'hide' each
327 /// scalarized instruction behind an if block predicated on the control
328 /// dependence of the instruction.
329 virtual void scalarizeInstruction(Instruction *Instr,
330 bool IfPredicateStore=false);
332 /// Vectorize Load and Store instructions,
333 virtual void vectorizeMemoryInstruction(Instruction *Instr);
335 /// Create a broadcast instruction. This method generates a broadcast
336 /// instruction (shuffle) for loop invariant values and for the induction
337 /// value. If this is the induction variable then we extend it to N, N+1, ...
338 /// this is needed because each iteration in the loop corresponds to a SIMD
340 virtual Value *getBroadcastInstrs(Value *V);
342 /// This function adds (StartIdx, StartIdx + Step, StartIdx + 2*Step, ...)
343 /// to each vector element of Val. The sequence starts at StartIndex.
344 virtual Value *getStepVector(Value *Val, int StartIdx, Value *Step);
346 /// When we go over instructions in the basic block we rely on previous
347 /// values within the current basic block or on loop invariant values.
348 /// When we widen (vectorize) values we place them in the map. If the values
349 /// are not within the map, they have to be loop invariant, so we simply
350 /// broadcast them into a vector.
351 VectorParts &getVectorValue(Value *V);
353 /// Generate a shuffle sequence that will reverse the vector Vec.
354 virtual Value *reverseVector(Value *Vec);
356 /// This is a helper class that holds the vectorizer state. It maps scalar
357 /// instructions to vector instructions. When the code is 'unrolled' then
358 /// then a single scalar value is mapped to multiple vector parts. The parts
359 /// are stored in the VectorPart type.
361 /// C'tor. UnrollFactor controls the number of vectors ('parts') that
363 ValueMap(unsigned UnrollFactor) : UF(UnrollFactor) {}
365 /// \return True if 'Key' is saved in the Value Map.
366 bool has(Value *Key) const { return MapStorage.count(Key); }
368 /// Initializes a new entry in the map. Sets all of the vector parts to the
369 /// save value in 'Val'.
370 /// \return A reference to a vector with splat values.
371 VectorParts &splat(Value *Key, Value *Val) {
372 VectorParts &Entry = MapStorage[Key];
373 Entry.assign(UF, Val);
377 ///\return A reference to the value that is stored at 'Key'.
378 VectorParts &get(Value *Key) {
379 VectorParts &Entry = MapStorage[Key];
382 assert(Entry.size() == UF);
387 /// The unroll factor. Each entry in the map stores this number of vector
391 /// Map storage. We use std::map and not DenseMap because insertions to a
392 /// dense map invalidates its iterators.
393 std::map<Value *, VectorParts> MapStorage;
396 /// The original loop.
398 /// Scev analysis to use.
406 /// Target Library Info.
407 const TargetLibraryInfo *TLI;
408 /// Target Transform Info.
409 const TargetTransformInfo *TTI;
411 /// The vectorization SIMD factor to use. Each vector will have this many
416 /// The vectorization unroll factor to use. Each scalar is vectorized to this
417 /// many different vector instructions.
420 /// The builder that we use
423 // --- Vectorization state ---
425 /// The vector-loop preheader.
426 BasicBlock *LoopVectorPreHeader;
427 /// The scalar-loop preheader.
428 BasicBlock *LoopScalarPreHeader;
429 /// Middle Block between the vector and the scalar.
430 BasicBlock *LoopMiddleBlock;
431 ///The ExitBlock of the scalar loop.
432 BasicBlock *LoopExitBlock;
433 ///The vector loop body.
434 SmallVector<BasicBlock *, 4> LoopVectorBody;
435 ///The scalar loop body.
436 BasicBlock *LoopScalarBody;
437 /// A list of all bypass blocks. The first block is the entry of the loop.
438 SmallVector<BasicBlock *, 4> LoopBypassBlocks;
440 /// The new Induction variable which was added to the new block.
442 /// The induction variable of the old basic block.
443 PHINode *OldInduction;
444 /// Holds the extended (to the widest induction type) start index.
446 /// Maps scalars to widened vectors.
448 EdgeMaskCache MaskCache;
450 LoopVectorizationLegality *Legal;
452 // Record whether runtime check is added.
453 bool AddedSafetyChecks;
456 class InnerLoopUnroller : public InnerLoopVectorizer {
458 InnerLoopUnroller(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI,
459 DominatorTree *DT, const TargetLibraryInfo *TLI,
460 const TargetTransformInfo *TTI, unsigned UnrollFactor)
461 : InnerLoopVectorizer(OrigLoop, SE, LI, DT, TLI, TTI, 1, UnrollFactor) {}
464 void scalarizeInstruction(Instruction *Instr,
465 bool IfPredicateStore = false) override;
466 void vectorizeMemoryInstruction(Instruction *Instr) override;
467 Value *getBroadcastInstrs(Value *V) override;
468 Value *getStepVector(Value *Val, int StartIdx, Value *Step) override;
469 Value *reverseVector(Value *Vec) override;
472 /// \brief Look for a meaningful debug location on the instruction or it's
474 static Instruction *getDebugLocFromInstOrOperands(Instruction *I) {
479 if (I->getDebugLoc() != Empty)
482 for (User::op_iterator OI = I->op_begin(), OE = I->op_end(); OI != OE; ++OI) {
483 if (Instruction *OpInst = dyn_cast<Instruction>(*OI))
484 if (OpInst->getDebugLoc() != Empty)
491 /// \brief Set the debug location in the builder using the debug location in the
493 static void setDebugLocFromInst(IRBuilder<> &B, const Value *Ptr) {
494 if (const Instruction *Inst = dyn_cast_or_null<Instruction>(Ptr))
495 B.SetCurrentDebugLocation(Inst->getDebugLoc());
497 B.SetCurrentDebugLocation(DebugLoc());
501 /// \return string containing a file name and a line # for the given loop.
502 static std::string getDebugLocString(const Loop *L) {
505 raw_string_ostream OS(Result);
506 const DebugLoc LoopDbgLoc = L->getStartLoc();
507 if (!LoopDbgLoc.isUnknown())
508 LoopDbgLoc.print(OS);
510 // Just print the module name.
511 OS << L->getHeader()->getParent()->getParent()->getModuleIdentifier();
518 /// \brief Propagate known metadata from one instruction to another.
519 static void propagateMetadata(Instruction *To, const Instruction *From) {
520 SmallVector<std::pair<unsigned, MDNode *>, 4> Metadata;
521 From->getAllMetadataOtherThanDebugLoc(Metadata);
523 for (auto M : Metadata) {
524 unsigned Kind = M.first;
526 // These are safe to transfer (this is safe for TBAA, even when we
527 // if-convert, because should that metadata have had a control dependency
528 // on the condition, and thus actually aliased with some other
529 // non-speculated memory access when the condition was false, this would be
530 // caught by the runtime overlap checks).
531 if (Kind != LLVMContext::MD_tbaa &&
532 Kind != LLVMContext::MD_alias_scope &&
533 Kind != LLVMContext::MD_noalias &&
534 Kind != LLVMContext::MD_fpmath)
537 To->setMetadata(Kind, M.second);
541 /// \brief Propagate known metadata from one instruction to a vector of others.
542 static void propagateMetadata(SmallVectorImpl<Value *> &To, const Instruction *From) {
544 if (Instruction *I = dyn_cast<Instruction>(V))
545 propagateMetadata(I, From);
548 /// LoopVectorizationLegality checks if it is legal to vectorize a loop, and
549 /// to what vectorization factor.
550 /// This class does not look at the profitability of vectorization, only the
551 /// legality. This class has two main kinds of checks:
552 /// * Memory checks - The code in canVectorizeMemory checks if vectorization
553 /// will change the order of memory accesses in a way that will change the
554 /// correctness of the program.
555 /// * Scalars checks - The code in canVectorizeInstrs and canVectorizeMemory
556 /// checks for a number of different conditions, such as the availability of a
557 /// single induction variable, that all types are supported and vectorize-able,
558 /// etc. This code reflects the capabilities of InnerLoopVectorizer.
559 /// This class is also used by InnerLoopVectorizer for identifying
560 /// induction variable and the different reduction variables.
561 class LoopVectorizationLegality {
563 LoopVectorizationLegality(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
564 TargetLibraryInfo *TLI, AliasAnalysis *AA,
565 Function *F, const TargetTransformInfo *TTI,
566 LoopAccessAnalysis *LAA)
567 : NumPredStores(0), TheLoop(L), SE(SE), TLI(TLI), TheFunction(F),
568 TTI(TTI), DT(DT), LAA(LAA), LAI(nullptr), Induction(nullptr),
569 WidestIndTy(nullptr), HasFunNoNaNAttr(false) {}
571 /// This enum represents the kinds of reductions that we support.
573 RK_NoReduction, ///< Not a reduction.
574 RK_IntegerAdd, ///< Sum of integers.
575 RK_IntegerMult, ///< Product of integers.
576 RK_IntegerOr, ///< Bitwise or logical OR of numbers.
577 RK_IntegerAnd, ///< Bitwise or logical AND of numbers.
578 RK_IntegerXor, ///< Bitwise or logical XOR of numbers.
579 RK_IntegerMinMax, ///< Min/max implemented in terms of select(cmp()).
580 RK_FloatAdd, ///< Sum of floats.
581 RK_FloatMult, ///< Product of floats.
582 RK_FloatMinMax ///< Min/max implemented in terms of select(cmp()).
585 /// This enum represents the kinds of inductions that we support.
587 IK_NoInduction, ///< Not an induction variable.
588 IK_IntInduction, ///< Integer induction variable. Step = C.
589 IK_PtrInduction ///< Pointer induction var. Step = C / sizeof(elem).
592 // This enum represents the kind of minmax reduction.
593 enum MinMaxReductionKind {
603 /// This struct holds information about reduction variables.
604 struct ReductionDescriptor {
605 ReductionDescriptor() : StartValue(nullptr), LoopExitInstr(nullptr),
606 Kind(RK_NoReduction), MinMaxKind(MRK_Invalid) {}
608 ReductionDescriptor(Value *Start, Instruction *Exit, ReductionKind K,
609 MinMaxReductionKind MK)
610 : StartValue(Start), LoopExitInstr(Exit), Kind(K), MinMaxKind(MK) {}
612 // The starting value of the reduction.
613 // It does not have to be zero!
614 TrackingVH<Value> StartValue;
615 // The instruction who's value is used outside the loop.
616 Instruction *LoopExitInstr;
617 // The kind of the reduction.
619 // If this a min/max reduction the kind of reduction.
620 MinMaxReductionKind MinMaxKind;
623 /// This POD struct holds information about a potential reduction operation.
624 struct ReductionInstDesc {
625 ReductionInstDesc(bool IsRedux, Instruction *I) :
626 IsReduction(IsRedux), PatternLastInst(I), MinMaxKind(MRK_Invalid) {}
628 ReductionInstDesc(Instruction *I, MinMaxReductionKind K) :
629 IsReduction(true), PatternLastInst(I), MinMaxKind(K) {}
631 // Is this instruction a reduction candidate.
633 // The last instruction in a min/max pattern (select of the select(icmp())
634 // pattern), or the current reduction instruction otherwise.
635 Instruction *PatternLastInst;
636 // If this is a min/max pattern the comparison predicate.
637 MinMaxReductionKind MinMaxKind;
640 /// A struct for saving information about induction variables.
641 struct InductionInfo {
642 InductionInfo(Value *Start, InductionKind K, ConstantInt *Step)
643 : StartValue(Start), IK(K), StepValue(Step) {
644 assert(IK != IK_NoInduction && "Not an induction");
645 assert(StartValue && "StartValue is null");
646 assert(StepValue && !StepValue->isZero() && "StepValue is zero");
647 assert((IK != IK_PtrInduction || StartValue->getType()->isPointerTy()) &&
648 "StartValue is not a pointer for pointer induction");
649 assert((IK != IK_IntInduction || StartValue->getType()->isIntegerTy()) &&
650 "StartValue is not an integer for integer induction");
651 assert(StepValue->getType()->isIntegerTy() &&
652 "StepValue is not an integer");
655 : StartValue(nullptr), IK(IK_NoInduction), StepValue(nullptr) {}
657 /// Get the consecutive direction. Returns:
658 /// 0 - unknown or non-consecutive.
659 /// 1 - consecutive and increasing.
660 /// -1 - consecutive and decreasing.
661 int getConsecutiveDirection() const {
662 if (StepValue && (StepValue->isOne() || StepValue->isMinusOne()))
663 return StepValue->getSExtValue();
667 /// Compute the transformed value of Index at offset StartValue using step
669 /// For integer induction, returns StartValue + Index * StepValue.
670 /// For pointer induction, returns StartValue[Index * StepValue].
671 /// FIXME: The newly created binary instructions should contain nsw/nuw
672 /// flags, which can be found from the original scalar operations.
673 Value *transform(IRBuilder<> &B, Value *Index) const {
675 case IK_IntInduction:
676 assert(Index->getType() == StartValue->getType() &&
677 "Index type does not match StartValue type");
678 if (StepValue->isMinusOne())
679 return B.CreateSub(StartValue, Index);
680 if (!StepValue->isOne())
681 Index = B.CreateMul(Index, StepValue);
682 return B.CreateAdd(StartValue, Index);
684 case IK_PtrInduction:
685 if (StepValue->isMinusOne())
686 Index = B.CreateNeg(Index);
687 else if (!StepValue->isOne())
688 Index = B.CreateMul(Index, StepValue);
689 return B.CreateGEP(StartValue, Index);
694 llvm_unreachable("invalid enum");
698 TrackingVH<Value> StartValue;
702 ConstantInt *StepValue;
705 /// ReductionList contains the reduction descriptors for all
706 /// of the reductions that were found in the loop.
707 typedef DenseMap<PHINode*, ReductionDescriptor> ReductionList;
709 /// InductionList saves induction variables and maps them to the
710 /// induction descriptor.
711 typedef MapVector<PHINode*, InductionInfo> InductionList;
713 /// Returns true if it is legal to vectorize this loop.
714 /// This does not mean that it is profitable to vectorize this
715 /// loop, only that it is legal to do so.
718 /// Returns the Induction variable.
719 PHINode *getInduction() { return Induction; }
721 /// Returns the reduction variables found in the loop.
722 ReductionList *getReductionVars() { return &Reductions; }
724 /// Returns the induction variables found in the loop.
725 InductionList *getInductionVars() { return &Inductions; }
727 /// Returns the widest induction type.
728 Type *getWidestInductionType() { return WidestIndTy; }
730 /// Returns True if V is an induction variable in this loop.
731 bool isInductionVariable(const Value *V);
733 /// Return true if the block BB needs to be predicated in order for the loop
734 /// to be vectorized.
735 bool blockNeedsPredication(BasicBlock *BB);
737 /// Check if this pointer is consecutive when vectorizing. This happens
738 /// when the last index of the GEP is the induction variable, or that the
739 /// pointer itself is an induction variable.
740 /// This check allows us to vectorize A[idx] into a wide load/store.
742 /// 0 - Stride is unknown or non-consecutive.
743 /// 1 - Address is consecutive.
744 /// -1 - Address is consecutive, and decreasing.
745 int isConsecutivePtr(Value *Ptr);
747 /// Returns true if the value V is uniform within the loop.
748 bool isUniform(Value *V);
750 /// Returns true if this instruction will remain scalar after vectorization.
751 bool isUniformAfterVectorization(Instruction* I) { return Uniforms.count(I); }
753 /// Returns the information that we collected about runtime memory check.
754 const LoopAccessInfo::RuntimePointerCheck *getRuntimePointerCheck() const {
755 return LAI->getRuntimePointerCheck();
758 const LoopAccessInfo *getLAI() const {
762 /// This function returns the identity element (or neutral element) for
764 static Constant *getReductionIdentity(ReductionKind K, Type *Tp);
766 unsigned getMaxSafeDepDistBytes() { return LAI->getMaxSafeDepDistBytes(); }
768 bool hasStride(Value *V) { return StrideSet.count(V); }
769 bool mustCheckStrides() { return !StrideSet.empty(); }
770 SmallPtrSet<Value *, 8>::iterator strides_begin() {
771 return StrideSet.begin();
773 SmallPtrSet<Value *, 8>::iterator strides_end() { return StrideSet.end(); }
775 /// Returns true if the target machine supports masked store operation
776 /// for the given \p DataType and kind of access to \p Ptr.
777 bool isLegalMaskedStore(Type *DataType, Value *Ptr) {
778 return TTI->isLegalMaskedStore(DataType, isConsecutivePtr(Ptr));
780 /// Returns true if the target machine supports masked load operation
781 /// for the given \p DataType and kind of access to \p Ptr.
782 bool isLegalMaskedLoad(Type *DataType, Value *Ptr) {
783 return TTI->isLegalMaskedLoad(DataType, isConsecutivePtr(Ptr));
785 /// Returns true if vector representation of the instruction \p I
787 bool isMaskRequired(const Instruction* I) {
788 return (MaskedOp.count(I) != 0);
790 unsigned getNumStores() const {
791 return LAI->getNumStores();
793 unsigned getNumLoads() const {
794 return LAI->getNumLoads();
796 unsigned getNumPredStores() const {
797 return NumPredStores;
800 /// Check if a single basic block loop is vectorizable.
801 /// At this point we know that this is a loop with a constant trip count
802 /// and we only need to check individual instructions.
803 bool canVectorizeInstrs();
805 /// When we vectorize loops we may change the order in which
806 /// we read and write from memory. This method checks if it is
807 /// legal to vectorize the code, considering only memory constrains.
808 /// Returns true if the loop is vectorizable
809 bool canVectorizeMemory();
811 /// Return true if we can vectorize this loop using the IF-conversion
813 bool canVectorizeWithIfConvert();
815 /// Collect the variables that need to stay uniform after vectorization.
816 void collectLoopUniforms();
818 /// Return true if all of the instructions in the block can be speculatively
819 /// executed. \p SafePtrs is a list of addresses that are known to be legal
820 /// and we know that we can read from them without segfault.
821 bool blockCanBePredicated(BasicBlock *BB, SmallPtrSetImpl<Value *> &SafePtrs);
823 /// Returns True, if 'Phi' is the kind of reduction variable for type
824 /// 'Kind'. If this is a reduction variable, it adds it to ReductionList.
825 bool AddReductionVar(PHINode *Phi, ReductionKind Kind);
826 /// Returns a struct describing if the instruction 'I' can be a reduction
827 /// variable of type 'Kind'. If the reduction is a min/max pattern of
828 /// select(icmp()) this function advances the instruction pointer 'I' from the
829 /// compare instruction to the select instruction and stores this pointer in
830 /// 'PatternLastInst' member of the returned struct.
831 ReductionInstDesc isReductionInstr(Instruction *I, ReductionKind Kind,
832 ReductionInstDesc &Desc);
833 /// Returns true if the instruction is a Select(ICmp(X, Y), X, Y) instruction
834 /// pattern corresponding to a min(X, Y) or max(X, Y).
835 static ReductionInstDesc isMinMaxSelectCmpPattern(Instruction *I,
836 ReductionInstDesc &Prev);
837 /// Returns the induction kind of Phi and record the step. This function may
838 /// return NoInduction if the PHI is not an induction variable.
839 InductionKind isInductionVariable(PHINode *Phi, ConstantInt *&StepValue);
841 /// \brief Collect memory access with loop invariant strides.
843 /// Looks for accesses like "a[i * StrideA]" where "StrideA" is loop
845 void collectStridedAccess(Value *LoadOrStoreInst);
847 /// Report an analysis message to assist the user in diagnosing loops that are
848 /// not vectorized. These are handled as LoopAccessReport rather than
849 /// VectorizationReport because the << operator of VectorizationReport returns
850 /// LoopAccessReport.
851 void emitAnalysis(const LoopAccessReport &Message) {
852 LoopAccessReport::emitAnalysis(Message, TheFunction, TheLoop, LV_NAME);
855 unsigned NumPredStores;
857 /// The loop that we evaluate.
861 /// Target Library Info.
862 TargetLibraryInfo *TLI;
864 Function *TheFunction;
865 /// Target Transform Info
866 const TargetTransformInfo *TTI;
869 // LoopAccess analysis.
870 LoopAccessAnalysis *LAA;
871 // And the loop-accesses info corresponding to this loop. This pointer is
872 // null until canVectorizeMemory sets it up.
873 const LoopAccessInfo *LAI;
875 // --- vectorization state --- //
877 /// Holds the integer induction variable. This is the counter of the
880 /// Holds the reduction variables.
881 ReductionList Reductions;
882 /// Holds all of the induction variables that we found in the loop.
883 /// Notice that inductions don't need to start at zero and that induction
884 /// variables can be pointers.
885 InductionList Inductions;
886 /// Holds the widest induction type encountered.
889 /// Allowed outside users. This holds the reduction
890 /// vars which can be accessed from outside the loop.
891 SmallPtrSet<Value*, 4> AllowedExit;
892 /// This set holds the variables which are known to be uniform after
894 SmallPtrSet<Instruction*, 4> Uniforms;
896 /// Can we assume the absence of NaNs.
897 bool HasFunNoNaNAttr;
899 ValueToValueMap Strides;
900 SmallPtrSet<Value *, 8> StrideSet;
902 /// While vectorizing these instructions we have to generate a
903 /// call to the appropriate masked intrinsic
904 SmallPtrSet<const Instruction*, 8> MaskedOp;
907 /// LoopVectorizationCostModel - estimates the expected speedups due to
909 /// In many cases vectorization is not profitable. This can happen because of
910 /// a number of reasons. In this class we mainly attempt to predict the
911 /// expected speedup/slowdowns due to the supported instruction set. We use the
912 /// TargetTransformInfo to query the different backends for the cost of
913 /// different operations.
914 class LoopVectorizationCostModel {
916 LoopVectorizationCostModel(Loop *L, ScalarEvolution *SE, LoopInfo *LI,
917 LoopVectorizationLegality *Legal,
918 const TargetTransformInfo &TTI,
919 const TargetLibraryInfo *TLI, AssumptionCache *AC,
920 const Function *F, const LoopVectorizeHints *Hints)
921 : TheLoop(L), SE(SE), LI(LI), Legal(Legal), TTI(TTI), TLI(TLI),
922 TheFunction(F), Hints(Hints) {
923 CodeMetrics::collectEphemeralValues(L, AC, EphValues);
926 /// Information about vectorization costs
927 struct VectorizationFactor {
928 unsigned Width; // Vector width with best cost
929 unsigned Cost; // Cost of the loop with that width
931 /// \return The most profitable vectorization factor and the cost of that VF.
932 /// This method checks every power of two up to VF. If UserVF is not ZERO
933 /// then this vectorization factor will be selected if vectorization is
935 VectorizationFactor selectVectorizationFactor(bool OptForSize);
937 /// \return The size (in bits) of the widest type in the code that
938 /// needs to be vectorized. We ignore values that remain scalar such as
939 /// 64 bit loop indices.
940 unsigned getWidestType();
942 /// \return The most profitable unroll factor.
943 /// If UserUF is non-zero then this method finds the best unroll-factor
944 /// based on register pressure and other parameters.
945 /// VF and LoopCost are the selected vectorization factor and the cost of the
947 unsigned selectUnrollFactor(bool OptForSize, unsigned VF, unsigned LoopCost);
949 /// \brief A struct that represents some properties of the register usage
951 struct RegisterUsage {
952 /// Holds the number of loop invariant values that are used in the loop.
953 unsigned LoopInvariantRegs;
954 /// Holds the maximum number of concurrent live intervals in the loop.
955 unsigned MaxLocalUsers;
956 /// Holds the number of instructions in the loop.
957 unsigned NumInstructions;
960 /// \return information about the register usage of the loop.
961 RegisterUsage calculateRegisterUsage();
964 /// Returns the expected execution cost. The unit of the cost does
965 /// not matter because we use the 'cost' units to compare different
966 /// vector widths. The cost that is returned is *not* normalized by
967 /// the factor width.
968 unsigned expectedCost(unsigned VF);
970 /// Returns the execution time cost of an instruction for a given vector
971 /// width. Vector width of one means scalar.
972 unsigned getInstructionCost(Instruction *I, unsigned VF);
974 /// Returns whether the instruction is a load or store and will be a emitted
975 /// as a vector operation.
976 bool isConsecutiveLoadOrStore(Instruction *I);
978 /// Report an analysis message to assist the user in diagnosing loops that are
979 /// not vectorized. These are handled as LoopAccessReport rather than
980 /// VectorizationReport because the << operator of VectorizationReport returns
981 /// LoopAccessReport.
982 void emitAnalysis(const LoopAccessReport &Message) {
983 LoopAccessReport::emitAnalysis(Message, TheFunction, TheLoop, LV_NAME);
986 /// Values used only by @llvm.assume calls.
987 SmallPtrSet<const Value *, 32> EphValues;
989 /// The loop that we evaluate.
993 /// Loop Info analysis.
995 /// Vectorization legality.
996 LoopVectorizationLegality *Legal;
997 /// Vector target information.
998 const TargetTransformInfo &TTI;
999 /// Target Library Info.
1000 const TargetLibraryInfo *TLI;
1001 const Function *TheFunction;
1002 // Loop Vectorize Hint.
1003 const LoopVectorizeHints *Hints;
1006 /// Utility class for getting and setting loop vectorizer hints in the form
1007 /// of loop metadata.
1008 /// This class keeps a number of loop annotations locally (as member variables)
1009 /// and can, upon request, write them back as metadata on the loop. It will
1010 /// initially scan the loop for existing metadata, and will update the local
1011 /// values based on information in the loop.
1012 /// We cannot write all values to metadata, as the mere presence of some info,
1013 /// for example 'force', means a decision has been made. So, we need to be
1014 /// careful NOT to add them if the user hasn't specifically asked so.
1015 class LoopVectorizeHints {
1022 /// Hint - associates name and validation with the hint value.
1025 unsigned Value; // This may have to change for non-numeric values.
1028 Hint(const char * Name, unsigned Value, HintKind Kind)
1029 : Name(Name), Value(Value), Kind(Kind) { }
1031 bool validate(unsigned Val) {
1034 return isPowerOf2_32(Val) && Val <= VectorizerParams::MaxVectorWidth;
1036 return isPowerOf2_32(Val) && Val <= MaxInterleaveFactor;
1044 /// Vectorization width.
1046 /// Vectorization interleave factor.
1048 /// Vectorization forced
1051 /// Return the loop metadata prefix.
1052 static StringRef Prefix() { return "llvm.loop."; }
1056 FK_Undefined = -1, ///< Not selected.
1057 FK_Disabled = 0, ///< Forcing disabled.
1058 FK_Enabled = 1, ///< Forcing enabled.
1061 LoopVectorizeHints(const Loop *L, bool DisableInterleaving)
1062 : Width("vectorize.width", VectorizerParams::VectorizationFactor,
1064 Interleave("interleave.count", DisableInterleaving, HK_UNROLL),
1065 Force("vectorize.enable", FK_Undefined, HK_FORCE),
1067 // Populate values with existing loop metadata.
1068 getHintsFromMetadata();
1070 // force-vector-interleave overrides DisableInterleaving.
1071 if (VectorizerParams::isInterleaveForced())
1072 Interleave.Value = VectorizerParams::VectorizationInterleave;
1074 DEBUG(if (DisableInterleaving && Interleave.Value == 1) dbgs()
1075 << "LV: Interleaving disabled by the pass manager\n");
1078 /// Mark the loop L as already vectorized by setting the width to 1.
1079 void setAlreadyVectorized() {
1080 Width.Value = Interleave.Value = 1;
1081 Hint Hints[] = {Width, Interleave};
1082 writeHintsToMetadata(Hints);
1085 /// Dumps all the hint information.
1086 std::string emitRemark() const {
1087 VectorizationReport R;
1088 if (Force.Value == LoopVectorizeHints::FK_Disabled)
1089 R << "vectorization is explicitly disabled";
1091 R << "use -Rpass-analysis=loop-vectorize for more info";
1092 if (Force.Value == LoopVectorizeHints::FK_Enabled) {
1093 R << " (Force=true";
1094 if (Width.Value != 0)
1095 R << ", Vector Width=" << Width.Value;
1096 if (Interleave.Value != 0)
1097 R << ", Interleave Count=" << Interleave.Value;
1105 unsigned getWidth() const { return Width.Value; }
1106 unsigned getInterleave() const { return Interleave.Value; }
1107 enum ForceKind getForce() const { return (ForceKind)Force.Value; }
1110 /// Find hints specified in the loop metadata and update local values.
1111 void getHintsFromMetadata() {
1112 MDNode *LoopID = TheLoop->getLoopID();
1116 // First operand should refer to the loop id itself.
1117 assert(LoopID->getNumOperands() > 0 && "requires at least one operand");
1118 assert(LoopID->getOperand(0) == LoopID && "invalid loop id");
1120 for (unsigned i = 1, ie = LoopID->getNumOperands(); i < ie; ++i) {
1121 const MDString *S = nullptr;
1122 SmallVector<Metadata *, 4> Args;
1124 // The expected hint is either a MDString or a MDNode with the first
1125 // operand a MDString.
1126 if (const MDNode *MD = dyn_cast<MDNode>(LoopID->getOperand(i))) {
1127 if (!MD || MD->getNumOperands() == 0)
1129 S = dyn_cast<MDString>(MD->getOperand(0));
1130 for (unsigned i = 1, ie = MD->getNumOperands(); i < ie; ++i)
1131 Args.push_back(MD->getOperand(i));
1133 S = dyn_cast<MDString>(LoopID->getOperand(i));
1134 assert(Args.size() == 0 && "too many arguments for MDString");
1140 // Check if the hint starts with the loop metadata prefix.
1141 StringRef Name = S->getString();
1142 if (Args.size() == 1)
1143 setHint(Name, Args[0]);
1147 /// Checks string hint with one operand and set value if valid.
1148 void setHint(StringRef Name, Metadata *Arg) {
1149 if (!Name.startswith(Prefix()))
1151 Name = Name.substr(Prefix().size(), StringRef::npos);
1153 const ConstantInt *C = mdconst::dyn_extract<ConstantInt>(Arg);
1155 unsigned Val = C->getZExtValue();
1157 Hint *Hints[] = {&Width, &Interleave, &Force};
1158 for (auto H : Hints) {
1159 if (Name == H->Name) {
1160 if (H->validate(Val))
1163 DEBUG(dbgs() << "LV: ignoring invalid hint '" << Name << "'\n");
1169 /// Create a new hint from name / value pair.
1170 MDNode *createHintMetadata(StringRef Name, unsigned V) const {
1171 LLVMContext &Context = TheLoop->getHeader()->getContext();
1172 Metadata *MDs[] = {MDString::get(Context, Name),
1173 ConstantAsMetadata::get(
1174 ConstantInt::get(Type::getInt32Ty(Context), V))};
1175 return MDNode::get(Context, MDs);
1178 /// Matches metadata with hint name.
1179 bool matchesHintMetadataName(MDNode *Node, ArrayRef<Hint> HintTypes) {
1180 MDString* Name = dyn_cast<MDString>(Node->getOperand(0));
1184 for (auto H : HintTypes)
1185 if (Name->getString().endswith(H.Name))
1190 /// Sets current hints into loop metadata, keeping other values intact.
1191 void writeHintsToMetadata(ArrayRef<Hint> HintTypes) {
1192 if (HintTypes.size() == 0)
1195 // Reserve the first element to LoopID (see below).
1196 SmallVector<Metadata *, 4> MDs(1);
1197 // If the loop already has metadata, then ignore the existing operands.
1198 MDNode *LoopID = TheLoop->getLoopID();
1200 for (unsigned i = 1, ie = LoopID->getNumOperands(); i < ie; ++i) {
1201 MDNode *Node = cast<MDNode>(LoopID->getOperand(i));
1202 // If node in update list, ignore old value.
1203 if (!matchesHintMetadataName(Node, HintTypes))
1204 MDs.push_back(Node);
1208 // Now, add the missing hints.
1209 for (auto H : HintTypes)
1210 MDs.push_back(createHintMetadata(Twine(Prefix(), H.Name).str(), H.Value));
1212 // Replace current metadata node with new one.
1213 LLVMContext &Context = TheLoop->getHeader()->getContext();
1214 MDNode *NewLoopID = MDNode::get(Context, MDs);
1215 // Set operand 0 to refer to the loop id itself.
1216 NewLoopID->replaceOperandWith(0, NewLoopID);
1218 TheLoop->setLoopID(NewLoopID);
1221 /// The loop these hints belong to.
1222 const Loop *TheLoop;
1225 static void emitMissedWarning(Function *F, Loop *L,
1226 const LoopVectorizeHints &LH) {
1227 emitOptimizationRemarkMissed(F->getContext(), DEBUG_TYPE, *F,
1228 L->getStartLoc(), LH.emitRemark());
1230 if (LH.getForce() == LoopVectorizeHints::FK_Enabled) {
1231 if (LH.getWidth() != 1)
1232 emitLoopVectorizeWarning(
1233 F->getContext(), *F, L->getStartLoc(),
1234 "failed explicitly specified loop vectorization");
1235 else if (LH.getInterleave() != 1)
1236 emitLoopInterleaveWarning(
1237 F->getContext(), *F, L->getStartLoc(),
1238 "failed explicitly specified loop interleaving");
1242 static void addInnerLoop(Loop &L, SmallVectorImpl<Loop *> &V) {
1244 return V.push_back(&L);
1246 for (Loop *InnerL : L)
1247 addInnerLoop(*InnerL, V);
1250 /// The LoopVectorize Pass.
1251 struct LoopVectorize : public FunctionPass {
1252 /// Pass identification, replacement for typeid
1255 explicit LoopVectorize(bool NoUnrolling = false, bool AlwaysVectorize = true)
1257 DisableUnrolling(NoUnrolling),
1258 AlwaysVectorize(AlwaysVectorize) {
1259 initializeLoopVectorizePass(*PassRegistry::getPassRegistry());
1262 ScalarEvolution *SE;
1264 TargetTransformInfo *TTI;
1266 BlockFrequencyInfo *BFI;
1267 TargetLibraryInfo *TLI;
1269 AssumptionCache *AC;
1270 LoopAccessAnalysis *LAA;
1271 bool DisableUnrolling;
1272 bool AlwaysVectorize;
1274 BlockFrequency ColdEntryFreq;
1276 bool runOnFunction(Function &F) override {
1277 SE = &getAnalysis<ScalarEvolution>();
1278 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
1279 TTI = &getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
1280 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
1281 BFI = &getAnalysis<BlockFrequencyInfo>();
1282 auto *TLIP = getAnalysisIfAvailable<TargetLibraryInfoWrapperPass>();
1283 TLI = TLIP ? &TLIP->getTLI() : nullptr;
1284 AA = &getAnalysis<AliasAnalysis>();
1285 AC = &getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);
1286 LAA = &getAnalysis<LoopAccessAnalysis>();
1288 // Compute some weights outside of the loop over the loops. Compute this
1289 // using a BranchProbability to re-use its scaling math.
1290 const BranchProbability ColdProb(1, 5); // 20%
1291 ColdEntryFreq = BlockFrequency(BFI->getEntryFreq()) * ColdProb;
1293 // If the target claims to have no vector registers don't attempt
1295 if (!TTI->getNumberOfRegisters(true))
1298 // Build up a worklist of inner-loops to vectorize. This is necessary as
1299 // the act of vectorizing or partially unrolling a loop creates new loops
1300 // and can invalidate iterators across the loops.
1301 SmallVector<Loop *, 8> Worklist;
1304 addInnerLoop(*L, Worklist);
1306 LoopsAnalyzed += Worklist.size();
1308 // Now walk the identified inner loops.
1309 bool Changed = false;
1310 while (!Worklist.empty())
1311 Changed |= processLoop(Worklist.pop_back_val());
1313 // Process each loop nest in the function.
1317 static void AddRuntimeUnrollDisableMetaData(Loop *L) {
1318 SmallVector<Metadata *, 4> MDs;
1319 // Reserve first location for self reference to the LoopID metadata node.
1320 MDs.push_back(nullptr);
1321 bool IsUnrollMetadata = false;
1322 MDNode *LoopID = L->getLoopID();
1324 // First find existing loop unrolling disable metadata.
1325 for (unsigned i = 1, ie = LoopID->getNumOperands(); i < ie; ++i) {
1326 MDNode *MD = dyn_cast<MDNode>(LoopID->getOperand(i));
1328 const MDString *S = dyn_cast<MDString>(MD->getOperand(0));
1330 S && S->getString().startswith("llvm.loop.unroll.disable");
1332 MDs.push_back(LoopID->getOperand(i));
1336 if (!IsUnrollMetadata) {
1337 // Add runtime unroll disable metadata.
1338 LLVMContext &Context = L->getHeader()->getContext();
1339 SmallVector<Metadata *, 1> DisableOperands;
1340 DisableOperands.push_back(
1341 MDString::get(Context, "llvm.loop.unroll.runtime.disable"));
1342 MDNode *DisableNode = MDNode::get(Context, DisableOperands);
1343 MDs.push_back(DisableNode);
1344 MDNode *NewLoopID = MDNode::get(Context, MDs);
1345 // Set operand 0 to refer to the loop id itself.
1346 NewLoopID->replaceOperandWith(0, NewLoopID);
1347 L->setLoopID(NewLoopID);
1351 bool processLoop(Loop *L) {
1352 assert(L->empty() && "Only process inner loops.");
1355 const std::string DebugLocStr = getDebugLocString(L);
1358 DEBUG(dbgs() << "\nLV: Checking a loop in \""
1359 << L->getHeader()->getParent()->getName() << "\" from "
1360 << DebugLocStr << "\n");
1362 LoopVectorizeHints Hints(L, DisableUnrolling);
1364 DEBUG(dbgs() << "LV: Loop hints:"
1366 << (Hints.getForce() == LoopVectorizeHints::FK_Disabled
1368 : (Hints.getForce() == LoopVectorizeHints::FK_Enabled
1370 : "?")) << " width=" << Hints.getWidth()
1371 << " unroll=" << Hints.getInterleave() << "\n");
1373 // Function containing loop
1374 Function *F = L->getHeader()->getParent();
1376 // Looking at the diagnostic output is the only way to determine if a loop
1377 // was vectorized (other than looking at the IR or machine code), so it
1378 // is important to generate an optimization remark for each loop. Most of
1379 // these messages are generated by emitOptimizationRemarkAnalysis. Remarks
1380 // generated by emitOptimizationRemark and emitOptimizationRemarkMissed are
1381 // less verbose reporting vectorized loops and unvectorized loops that may
1382 // benefit from vectorization, respectively.
1384 if (Hints.getForce() == LoopVectorizeHints::FK_Disabled) {
1385 DEBUG(dbgs() << "LV: Not vectorizing: #pragma vectorize disable.\n");
1386 emitOptimizationRemarkAnalysis(F->getContext(), DEBUG_TYPE, *F,
1387 L->getStartLoc(), Hints.emitRemark());
1391 if (!AlwaysVectorize && Hints.getForce() != LoopVectorizeHints::FK_Enabled) {
1392 DEBUG(dbgs() << "LV: Not vectorizing: No #pragma vectorize enable.\n");
1393 emitOptimizationRemarkAnalysis(F->getContext(), DEBUG_TYPE, *F,
1394 L->getStartLoc(), Hints.emitRemark());
1398 if (Hints.getWidth() == 1 && Hints.getInterleave() == 1) {
1399 DEBUG(dbgs() << "LV: Not vectorizing: Disabled/already vectorized.\n");
1400 emitOptimizationRemarkAnalysis(
1401 F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1402 "loop not vectorized: vector width and interleave count are "
1403 "explicitly set to 1");
1407 // Check the loop for a trip count threshold:
1408 // do not vectorize loops with a tiny trip count.
1409 const unsigned TC = SE->getSmallConstantTripCount(L);
1410 if (TC > 0u && TC < TinyTripCountVectorThreshold) {
1411 DEBUG(dbgs() << "LV: Found a loop with a very small trip count. "
1412 << "This loop is not worth vectorizing.");
1413 if (Hints.getForce() == LoopVectorizeHints::FK_Enabled)
1414 DEBUG(dbgs() << " But vectorizing was explicitly forced.\n");
1416 DEBUG(dbgs() << "\n");
1417 emitOptimizationRemarkAnalysis(
1418 F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1419 "vectorization is not beneficial and is not explicitly forced");
1424 // Check if it is legal to vectorize the loop.
1425 LoopVectorizationLegality LVL(L, SE, DT, TLI, AA, F, TTI, LAA);
1426 if (!LVL.canVectorize()) {
1427 DEBUG(dbgs() << "LV: Not vectorizing: Cannot prove legality.\n");
1428 emitMissedWarning(F, L, Hints);
1432 // Use the cost model.
1433 LoopVectorizationCostModel CM(L, SE, LI, &LVL, *TTI, TLI, AC, F, &Hints);
1435 // Check the function attributes to find out if this function should be
1436 // optimized for size.
1437 bool OptForSize = Hints.getForce() != LoopVectorizeHints::FK_Enabled &&
1438 F->hasFnAttribute(Attribute::OptimizeForSize);
1440 // Compute the weighted frequency of this loop being executed and see if it
1441 // is less than 20% of the function entry baseline frequency. Note that we
1442 // always have a canonical loop here because we think we *can* vectoriez.
1443 // FIXME: This is hidden behind a flag due to pervasive problems with
1444 // exactly what block frequency models.
1445 if (LoopVectorizeWithBlockFrequency) {
1446 BlockFrequency LoopEntryFreq = BFI->getBlockFreq(L->getLoopPreheader());
1447 if (Hints.getForce() != LoopVectorizeHints::FK_Enabled &&
1448 LoopEntryFreq < ColdEntryFreq)
1452 // Check the function attributes to see if implicit floats are allowed.a
1453 // FIXME: This check doesn't seem possibly correct -- what if the loop is
1454 // an integer loop and the vector instructions selected are purely integer
1455 // vector instructions?
1456 if (F->hasFnAttribute(Attribute::NoImplicitFloat)) {
1457 DEBUG(dbgs() << "LV: Can't vectorize when the NoImplicitFloat"
1458 "attribute is used.\n");
1459 emitOptimizationRemarkAnalysis(
1460 F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1461 "loop not vectorized due to NoImplicitFloat attribute");
1462 emitMissedWarning(F, L, Hints);
1466 // Select the optimal vectorization factor.
1467 const LoopVectorizationCostModel::VectorizationFactor VF =
1468 CM.selectVectorizationFactor(OptForSize);
1470 // Select the unroll factor.
1472 CM.selectUnrollFactor(OptForSize, VF.Width, VF.Cost);
1474 DEBUG(dbgs() << "LV: Found a vectorizable loop (" << VF.Width << ") in "
1475 << DebugLocStr << '\n');
1476 DEBUG(dbgs() << "LV: Unroll Factor is " << UF << '\n');
1478 if (VF.Width == 1) {
1479 DEBUG(dbgs() << "LV: Vectorization is possible but not beneficial\n");
1482 emitOptimizationRemarkAnalysis(
1483 F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1484 "not beneficial to vectorize and user disabled interleaving");
1487 DEBUG(dbgs() << "LV: Trying to at least unroll the loops.\n");
1489 // Report the unrolling decision.
1490 emitOptimizationRemark(F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1491 Twine("unrolled with interleaving factor " +
1493 " (vectorization not beneficial)"));
1495 // We decided not to vectorize, but we may want to unroll.
1497 InnerLoopUnroller Unroller(L, SE, LI, DT, TLI, TTI, UF);
1498 Unroller.vectorize(&LVL);
1500 // If we decided that it is *legal* to vectorize the loop then do it.
1501 InnerLoopVectorizer LB(L, SE, LI, DT, TLI, TTI, VF.Width, UF);
1505 // Add metadata to disable runtime unrolling scalar loop when there's no
1506 // runtime check about strides and memory. Because at this situation,
1507 // scalar loop is rarely used not worthy to be unrolled.
1508 if (!LB.IsSafetyChecksAdded())
1509 AddRuntimeUnrollDisableMetaData(L);
1511 // Report the vectorization decision.
1512 emitOptimizationRemark(
1513 F->getContext(), DEBUG_TYPE, *F, L->getStartLoc(),
1514 Twine("vectorized loop (vectorization factor: ") + Twine(VF.Width) +
1515 ", unrolling interleave factor: " + Twine(UF) + ")");
1518 // Mark the loop as already vectorized to avoid vectorizing again.
1519 Hints.setAlreadyVectorized();
1521 DEBUG(verifyFunction(*L->getHeader()->getParent()));
1525 void getAnalysisUsage(AnalysisUsage &AU) const override {
1526 AU.addRequired<AssumptionCacheTracker>();
1527 AU.addRequiredID(LoopSimplifyID);
1528 AU.addRequiredID(LCSSAID);
1529 AU.addRequired<BlockFrequencyInfo>();
1530 AU.addRequired<DominatorTreeWrapperPass>();
1531 AU.addRequired<LoopInfoWrapperPass>();
1532 AU.addRequired<ScalarEvolution>();
1533 AU.addRequired<TargetTransformInfoWrapperPass>();
1534 AU.addRequired<AliasAnalysis>();
1535 AU.addRequired<LoopAccessAnalysis>();
1536 AU.addPreserved<LoopInfoWrapperPass>();
1537 AU.addPreserved<DominatorTreeWrapperPass>();
1538 AU.addPreserved<AliasAnalysis>();
1543 } // end anonymous namespace
1545 //===----------------------------------------------------------------------===//
1546 // Implementation of LoopVectorizationLegality, InnerLoopVectorizer and
1547 // LoopVectorizationCostModel.
1548 //===----------------------------------------------------------------------===//
1550 Value *InnerLoopVectorizer::getBroadcastInstrs(Value *V) {
1551 // We need to place the broadcast of invariant variables outside the loop.
1552 Instruction *Instr = dyn_cast<Instruction>(V);
1554 (Instr && std::find(LoopVectorBody.begin(), LoopVectorBody.end(),
1555 Instr->getParent()) != LoopVectorBody.end());
1556 bool Invariant = OrigLoop->isLoopInvariant(V) && !NewInstr;
1558 // Place the code for broadcasting invariant variables in the new preheader.
1559 IRBuilder<>::InsertPointGuard Guard(Builder);
1561 Builder.SetInsertPoint(LoopVectorPreHeader->getTerminator());
1563 // Broadcast the scalar into all locations in the vector.
1564 Value *Shuf = Builder.CreateVectorSplat(VF, V, "broadcast");
1569 Value *InnerLoopVectorizer::getStepVector(Value *Val, int StartIdx,
1571 assert(Val->getType()->isVectorTy() && "Must be a vector");
1572 assert(Val->getType()->getScalarType()->isIntegerTy() &&
1573 "Elem must be an integer");
1574 assert(Step->getType() == Val->getType()->getScalarType() &&
1575 "Step has wrong type");
1576 // Create the types.
1577 Type *ITy = Val->getType()->getScalarType();
1578 VectorType *Ty = cast<VectorType>(Val->getType());
1579 int VLen = Ty->getNumElements();
1580 SmallVector<Constant*, 8> Indices;
1582 // Create a vector of consecutive numbers from zero to VF.
1583 for (int i = 0; i < VLen; ++i)
1584 Indices.push_back(ConstantInt::get(ITy, StartIdx + i));
1586 // Add the consecutive indices to the vector value.
1587 Constant *Cv = ConstantVector::get(Indices);
1588 assert(Cv->getType() == Val->getType() && "Invalid consecutive vec");
1589 Step = Builder.CreateVectorSplat(VLen, Step);
1590 assert(Step->getType() == Val->getType() && "Invalid step vec");
1591 // FIXME: The newly created binary instructions should contain nsw/nuw flags,
1592 // which can be found from the original scalar operations.
1593 Step = Builder.CreateMul(Cv, Step);
1594 return Builder.CreateAdd(Val, Step, "induction");
1597 /// \brief Find the operand of the GEP that should be checked for consecutive
1598 /// stores. This ignores trailing indices that have no effect on the final
1600 static unsigned getGEPInductionOperand(const GetElementPtrInst *Gep) {
1601 const DataLayout &DL = Gep->getModule()->getDataLayout();
1602 unsigned LastOperand = Gep->getNumOperands() - 1;
1603 unsigned GEPAllocSize = DL.getTypeAllocSize(
1604 cast<PointerType>(Gep->getType()->getScalarType())->getElementType());
1606 // Walk backwards and try to peel off zeros.
1607 while (LastOperand > 1 && match(Gep->getOperand(LastOperand), m_Zero())) {
1608 // Find the type we're currently indexing into.
1609 gep_type_iterator GEPTI = gep_type_begin(Gep);
1610 std::advance(GEPTI, LastOperand - 1);
1612 // If it's a type with the same allocation size as the result of the GEP we
1613 // can peel off the zero index.
1614 if (DL.getTypeAllocSize(*GEPTI) != GEPAllocSize)
1622 int LoopVectorizationLegality::isConsecutivePtr(Value *Ptr) {
1623 assert(Ptr->getType()->isPointerTy() && "Unexpected non-ptr");
1624 // Make sure that the pointer does not point to structs.
1625 if (Ptr->getType()->getPointerElementType()->isAggregateType())
1628 // If this value is a pointer induction variable we know it is consecutive.
1629 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr);
1630 if (Phi && Inductions.count(Phi)) {
1631 InductionInfo II = Inductions[Phi];
1632 return II.getConsecutiveDirection();
1635 GetElementPtrInst *Gep = dyn_cast_or_null<GetElementPtrInst>(Ptr);
1639 unsigned NumOperands = Gep->getNumOperands();
1640 Value *GpPtr = Gep->getPointerOperand();
1641 // If this GEP value is a consecutive pointer induction variable and all of
1642 // the indices are constant then we know it is consecutive. We can
1643 Phi = dyn_cast<PHINode>(GpPtr);
1644 if (Phi && Inductions.count(Phi)) {
1646 // Make sure that the pointer does not point to structs.
1647 PointerType *GepPtrType = cast<PointerType>(GpPtr->getType());
1648 if (GepPtrType->getElementType()->isAggregateType())
1651 // Make sure that all of the index operands are loop invariant.
1652 for (unsigned i = 1; i < NumOperands; ++i)
1653 if (!SE->isLoopInvariant(SE->getSCEV(Gep->getOperand(i)), TheLoop))
1656 InductionInfo II = Inductions[Phi];
1657 return II.getConsecutiveDirection();
1660 unsigned InductionOperand = getGEPInductionOperand(Gep);
1662 // Check that all of the gep indices are uniform except for our induction
1664 for (unsigned i = 0; i != NumOperands; ++i)
1665 if (i != InductionOperand &&
1666 !SE->isLoopInvariant(SE->getSCEV(Gep->getOperand(i)), TheLoop))
1669 // We can emit wide load/stores only if the last non-zero index is the
1670 // induction variable.
1671 const SCEV *Last = nullptr;
1672 if (!Strides.count(Gep))
1673 Last = SE->getSCEV(Gep->getOperand(InductionOperand));
1675 // Because of the multiplication by a stride we can have a s/zext cast.
1676 // We are going to replace this stride by 1 so the cast is safe to ignore.
1678 // %indvars.iv = phi i64 [ 0, %entry ], [ %indvars.iv.next, %for.body ]
1679 // %0 = trunc i64 %indvars.iv to i32
1680 // %mul = mul i32 %0, %Stride1
1681 // %idxprom = zext i32 %mul to i64 << Safe cast.
1682 // %arrayidx = getelementptr inbounds i32* %B, i64 %idxprom
1684 Last = replaceSymbolicStrideSCEV(SE, Strides,
1685 Gep->getOperand(InductionOperand), Gep);
1686 if (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(Last))
1688 (C->getSCEVType() == scSignExtend || C->getSCEVType() == scZeroExtend)
1692 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Last)) {
1693 const SCEV *Step = AR->getStepRecurrence(*SE);
1695 // The memory is consecutive because the last index is consecutive
1696 // and all other indices are loop invariant.
1699 if (Step->isAllOnesValue())
1706 bool LoopVectorizationLegality::isUniform(Value *V) {
1707 return LAI->isUniform(V);
1710 InnerLoopVectorizer::VectorParts&
1711 InnerLoopVectorizer::getVectorValue(Value *V) {
1712 assert(V != Induction && "The new induction variable should not be used.");
1713 assert(!V->getType()->isVectorTy() && "Can't widen a vector");
1715 // If we have a stride that is replaced by one, do it here.
1716 if (Legal->hasStride(V))
1717 V = ConstantInt::get(V->getType(), 1);
1719 // If we have this scalar in the map, return it.
1720 if (WidenMap.has(V))
1721 return WidenMap.get(V);
1723 // If this scalar is unknown, assume that it is a constant or that it is
1724 // loop invariant. Broadcast V and save the value for future uses.
1725 Value *B = getBroadcastInstrs(V);
1726 return WidenMap.splat(V, B);
1729 Value *InnerLoopVectorizer::reverseVector(Value *Vec) {
1730 assert(Vec->getType()->isVectorTy() && "Invalid type");
1731 SmallVector<Constant*, 8> ShuffleMask;
1732 for (unsigned i = 0; i < VF; ++i)
1733 ShuffleMask.push_back(Builder.getInt32(VF - i - 1));
1735 return Builder.CreateShuffleVector(Vec, UndefValue::get(Vec->getType()),
1736 ConstantVector::get(ShuffleMask),
1740 void InnerLoopVectorizer::vectorizeMemoryInstruction(Instruction *Instr) {
1741 // Attempt to issue a wide load.
1742 LoadInst *LI = dyn_cast<LoadInst>(Instr);
1743 StoreInst *SI = dyn_cast<StoreInst>(Instr);
1745 assert((LI || SI) && "Invalid Load/Store instruction");
1747 Type *ScalarDataTy = LI ? LI->getType() : SI->getValueOperand()->getType();
1748 Type *DataTy = VectorType::get(ScalarDataTy, VF);
1749 Value *Ptr = LI ? LI->getPointerOperand() : SI->getPointerOperand();
1750 unsigned Alignment = LI ? LI->getAlignment() : SI->getAlignment();
1751 // An alignment of 0 means target abi alignment. We need to use the scalar's
1752 // target abi alignment in such a case.
1753 const DataLayout &DL = Instr->getModule()->getDataLayout();
1755 Alignment = DL.getABITypeAlignment(ScalarDataTy);
1756 unsigned AddressSpace = Ptr->getType()->getPointerAddressSpace();
1757 unsigned ScalarAllocatedSize = DL.getTypeAllocSize(ScalarDataTy);
1758 unsigned VectorElementSize = DL.getTypeStoreSize(DataTy) / VF;
1760 if (SI && Legal->blockNeedsPredication(SI->getParent()) &&
1761 !Legal->isMaskRequired(SI))
1762 return scalarizeInstruction(Instr, true);
1764 if (ScalarAllocatedSize != VectorElementSize)
1765 return scalarizeInstruction(Instr);
1767 // If the pointer is loop invariant or if it is non-consecutive,
1768 // scalarize the load.
1769 int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
1770 bool Reverse = ConsecutiveStride < 0;
1771 bool UniformLoad = LI && Legal->isUniform(Ptr);
1772 if (!ConsecutiveStride || UniformLoad)
1773 return scalarizeInstruction(Instr);
1775 Constant *Zero = Builder.getInt32(0);
1776 VectorParts &Entry = WidenMap.get(Instr);
1778 // Handle consecutive loads/stores.
1779 GetElementPtrInst *Gep = dyn_cast<GetElementPtrInst>(Ptr);
1780 if (Gep && Legal->isInductionVariable(Gep->getPointerOperand())) {
1781 setDebugLocFromInst(Builder, Gep);
1782 Value *PtrOperand = Gep->getPointerOperand();
1783 Value *FirstBasePtr = getVectorValue(PtrOperand)[0];
1784 FirstBasePtr = Builder.CreateExtractElement(FirstBasePtr, Zero);
1786 // Create the new GEP with the new induction variable.
1787 GetElementPtrInst *Gep2 = cast<GetElementPtrInst>(Gep->clone());
1788 Gep2->setOperand(0, FirstBasePtr);
1789 Gep2->setName("gep.indvar.base");
1790 Ptr = Builder.Insert(Gep2);
1792 setDebugLocFromInst(Builder, Gep);
1793 assert(SE->isLoopInvariant(SE->getSCEV(Gep->getPointerOperand()),
1794 OrigLoop) && "Base ptr must be invariant");
1796 // The last index does not have to be the induction. It can be
1797 // consecutive and be a function of the index. For example A[I+1];
1798 unsigned NumOperands = Gep->getNumOperands();
1799 unsigned InductionOperand = getGEPInductionOperand(Gep);
1800 // Create the new GEP with the new induction variable.
1801 GetElementPtrInst *Gep2 = cast<GetElementPtrInst>(Gep->clone());
1803 for (unsigned i = 0; i < NumOperands; ++i) {
1804 Value *GepOperand = Gep->getOperand(i);
1805 Instruction *GepOperandInst = dyn_cast<Instruction>(GepOperand);
1807 // Update last index or loop invariant instruction anchored in loop.
1808 if (i == InductionOperand ||
1809 (GepOperandInst && OrigLoop->contains(GepOperandInst))) {
1810 assert((i == InductionOperand ||
1811 SE->isLoopInvariant(SE->getSCEV(GepOperandInst), OrigLoop)) &&
1812 "Must be last index or loop invariant");
1814 VectorParts &GEPParts = getVectorValue(GepOperand);
1815 Value *Index = GEPParts[0];
1816 Index = Builder.CreateExtractElement(Index, Zero);
1817 Gep2->setOperand(i, Index);
1818 Gep2->setName("gep.indvar.idx");
1821 Ptr = Builder.Insert(Gep2);
1823 // Use the induction element ptr.
1824 assert(isa<PHINode>(Ptr) && "Invalid induction ptr");
1825 setDebugLocFromInst(Builder, Ptr);
1826 VectorParts &PtrVal = getVectorValue(Ptr);
1827 Ptr = Builder.CreateExtractElement(PtrVal[0], Zero);
1830 VectorParts Mask = createBlockInMask(Instr->getParent());
1833 assert(!Legal->isUniform(SI->getPointerOperand()) &&
1834 "We do not allow storing to uniform addresses");
1835 setDebugLocFromInst(Builder, SI);
1836 // We don't want to update the value in the map as it might be used in
1837 // another expression. So don't use a reference type for "StoredVal".
1838 VectorParts StoredVal = getVectorValue(SI->getValueOperand());
1840 for (unsigned Part = 0; Part < UF; ++Part) {
1841 // Calculate the pointer for the specific unroll-part.
1842 Value *PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(Part * VF));
1845 // If we store to reverse consecutive memory locations then we need
1846 // to reverse the order of elements in the stored value.
1847 StoredVal[Part] = reverseVector(StoredVal[Part]);
1848 // If the address is consecutive but reversed, then the
1849 // wide store needs to start at the last vector element.
1850 PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(-Part * VF));
1851 PartPtr = Builder.CreateGEP(PartPtr, Builder.getInt32(1 - VF));
1852 Mask[Part] = reverseVector(Mask[Part]);
1855 Value *VecPtr = Builder.CreateBitCast(PartPtr,
1856 DataTy->getPointerTo(AddressSpace));
1859 if (Legal->isMaskRequired(SI))
1860 NewSI = Builder.CreateMaskedStore(StoredVal[Part], VecPtr, Alignment,
1863 NewSI = Builder.CreateAlignedStore(StoredVal[Part], VecPtr, Alignment);
1864 propagateMetadata(NewSI, SI);
1870 assert(LI && "Must have a load instruction");
1871 setDebugLocFromInst(Builder, LI);
1872 for (unsigned Part = 0; Part < UF; ++Part) {
1873 // Calculate the pointer for the specific unroll-part.
1874 Value *PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(Part * VF));
1877 // If the address is consecutive but reversed, then the
1878 // wide load needs to start at the last vector element.
1879 PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(-Part * VF));
1880 PartPtr = Builder.CreateGEP(PartPtr, Builder.getInt32(1 - VF));
1881 Mask[Part] = reverseVector(Mask[Part]);
1885 Value *VecPtr = Builder.CreateBitCast(PartPtr,
1886 DataTy->getPointerTo(AddressSpace));
1887 if (Legal->isMaskRequired(LI))
1888 NewLI = Builder.CreateMaskedLoad(VecPtr, Alignment, Mask[Part],
1889 UndefValue::get(DataTy),
1890 "wide.masked.load");
1892 NewLI = Builder.CreateAlignedLoad(VecPtr, Alignment, "wide.load");
1893 propagateMetadata(NewLI, LI);
1894 Entry[Part] = Reverse ? reverseVector(NewLI) : NewLI;
1898 void InnerLoopVectorizer::scalarizeInstruction(Instruction *Instr, bool IfPredicateStore) {
1899 assert(!Instr->getType()->isAggregateType() && "Can't handle vectors");
1900 // Holds vector parameters or scalars, in case of uniform vals.
1901 SmallVector<VectorParts, 4> Params;
1903 setDebugLocFromInst(Builder, Instr);
1905 // Find all of the vectorized parameters.
1906 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
1907 Value *SrcOp = Instr->getOperand(op);
1909 // If we are accessing the old induction variable, use the new one.
1910 if (SrcOp == OldInduction) {
1911 Params.push_back(getVectorValue(SrcOp));
1915 // Try using previously calculated values.
1916 Instruction *SrcInst = dyn_cast<Instruction>(SrcOp);
1918 // If the src is an instruction that appeared earlier in the basic block
1919 // then it should already be vectorized.
1920 if (SrcInst && OrigLoop->contains(SrcInst)) {
1921 assert(WidenMap.has(SrcInst) && "Source operand is unavailable");
1922 // The parameter is a vector value from earlier.
1923 Params.push_back(WidenMap.get(SrcInst));
1925 // The parameter is a scalar from outside the loop. Maybe even a constant.
1926 VectorParts Scalars;
1927 Scalars.append(UF, SrcOp);
1928 Params.push_back(Scalars);
1932 assert(Params.size() == Instr->getNumOperands() &&
1933 "Invalid number of operands");
1935 // Does this instruction return a value ?
1936 bool IsVoidRetTy = Instr->getType()->isVoidTy();
1938 Value *UndefVec = IsVoidRetTy ? nullptr :
1939 UndefValue::get(VectorType::get(Instr->getType(), VF));
1940 // Create a new entry in the WidenMap and initialize it to Undef or Null.
1941 VectorParts &VecResults = WidenMap.splat(Instr, UndefVec);
1943 Instruction *InsertPt = Builder.GetInsertPoint();
1944 BasicBlock *IfBlock = Builder.GetInsertBlock();
1945 BasicBlock *CondBlock = nullptr;
1948 Loop *VectorLp = nullptr;
1949 if (IfPredicateStore) {
1950 assert(Instr->getParent()->getSinglePredecessor() &&
1951 "Only support single predecessor blocks");
1952 Cond = createEdgeMask(Instr->getParent()->getSinglePredecessor(),
1953 Instr->getParent());
1954 VectorLp = LI->getLoopFor(IfBlock);
1955 assert(VectorLp && "Must have a loop for this block");
1958 // For each vector unroll 'part':
1959 for (unsigned Part = 0; Part < UF; ++Part) {
1960 // For each scalar that we create:
1961 for (unsigned Width = 0; Width < VF; ++Width) {
1964 Value *Cmp = nullptr;
1965 if (IfPredicateStore) {
1966 Cmp = Builder.CreateExtractElement(Cond[Part], Builder.getInt32(Width));
1967 Cmp = Builder.CreateICmp(ICmpInst::ICMP_EQ, Cmp, ConstantInt::get(Cmp->getType(), 1));
1968 CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.store");
1969 LoopVectorBody.push_back(CondBlock);
1970 VectorLp->addBasicBlockToLoop(CondBlock, *LI);
1971 // Update Builder with newly created basic block.
1972 Builder.SetInsertPoint(InsertPt);
1975 Instruction *Cloned = Instr->clone();
1977 Cloned->setName(Instr->getName() + ".cloned");
1978 // Replace the operands of the cloned instructions with extracted scalars.
1979 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
1980 Value *Op = Params[op][Part];
1981 // Param is a vector. Need to extract the right lane.
1982 if (Op->getType()->isVectorTy())
1983 Op = Builder.CreateExtractElement(Op, Builder.getInt32(Width));
1984 Cloned->setOperand(op, Op);
1987 // Place the cloned scalar in the new loop.
1988 Builder.Insert(Cloned);
1990 // If the original scalar returns a value we need to place it in a vector
1991 // so that future users will be able to use it.
1993 VecResults[Part] = Builder.CreateInsertElement(VecResults[Part], Cloned,
1994 Builder.getInt32(Width));
1996 if (IfPredicateStore) {
1997 BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else");
1998 LoopVectorBody.push_back(NewIfBlock);
1999 VectorLp->addBasicBlockToLoop(NewIfBlock, *LI);
2000 Builder.SetInsertPoint(InsertPt);
2001 Instruction *OldBr = IfBlock->getTerminator();
2002 BranchInst::Create(CondBlock, NewIfBlock, Cmp, OldBr);
2003 OldBr->eraseFromParent();
2004 IfBlock = NewIfBlock;
2010 static Instruction *getFirstInst(Instruction *FirstInst, Value *V,
2014 if (Instruction *I = dyn_cast<Instruction>(V))
2015 return I->getParent() == Loc->getParent() ? I : nullptr;
2019 std::pair<Instruction *, Instruction *>
2020 InnerLoopVectorizer::addStrideCheck(Instruction *Loc) {
2021 Instruction *tnullptr = nullptr;
2022 if (!Legal->mustCheckStrides())
2023 return std::pair<Instruction *, Instruction *>(tnullptr, tnullptr);
2025 IRBuilder<> ChkBuilder(Loc);
2028 Value *Check = nullptr;
2029 Instruction *FirstInst = nullptr;
2030 for (SmallPtrSet<Value *, 8>::iterator SI = Legal->strides_begin(),
2031 SE = Legal->strides_end();
2033 Value *Ptr = stripIntegerCast(*SI);
2034 Value *C = ChkBuilder.CreateICmpNE(Ptr, ConstantInt::get(Ptr->getType(), 1),
2036 // Store the first instruction we create.
2037 FirstInst = getFirstInst(FirstInst, C, Loc);
2039 Check = ChkBuilder.CreateOr(Check, C);
2044 // We have to do this trickery because the IRBuilder might fold the check to a
2045 // constant expression in which case there is no Instruction anchored in a
2047 LLVMContext &Ctx = Loc->getContext();
2048 Instruction *TheCheck =
2049 BinaryOperator::CreateAnd(Check, ConstantInt::getTrue(Ctx));
2050 ChkBuilder.Insert(TheCheck, "stride.not.one");
2051 FirstInst = getFirstInst(FirstInst, TheCheck, Loc);
2053 return std::make_pair(FirstInst, TheCheck);
2056 void InnerLoopVectorizer::createEmptyLoop() {
2058 In this function we generate a new loop. The new loop will contain
2059 the vectorized instructions while the old loop will continue to run the
2062 [ ] <-- Back-edge taken count overflow check.
2065 | [ ] <-- vector loop bypass (may consist of multiple blocks).
2068 || [ ] <-- vector pre header.
2072 || [ ]_| <-- vector loop.
2075 | >[ ] <--- middle-block.
2078 -|- >[ ] <--- new preheader.
2082 | [ ]_| <-- old scalar loop to handle remainder.
2085 >[ ] <-- exit block.
2089 BasicBlock *OldBasicBlock = OrigLoop->getHeader();
2090 BasicBlock *BypassBlock = OrigLoop->getLoopPreheader();
2091 BasicBlock *ExitBlock = OrigLoop->getExitBlock();
2092 assert(BypassBlock && "Invalid loop structure");
2093 assert(ExitBlock && "Must have an exit block");
2095 // Some loops have a single integer induction variable, while other loops
2096 // don't. One example is c++ iterators that often have multiple pointer
2097 // induction variables. In the code below we also support a case where we
2098 // don't have a single induction variable.
2099 OldInduction = Legal->getInduction();
2100 Type *IdxTy = Legal->getWidestInductionType();
2102 // Find the loop boundaries.
2103 const SCEV *ExitCount = SE->getBackedgeTakenCount(OrigLoop);
2104 assert(ExitCount != SE->getCouldNotCompute() && "Invalid loop count");
2106 // The exit count might have the type of i64 while the phi is i32. This can
2107 // happen if we have an induction variable that is sign extended before the
2108 // compare. The only way that we get a backedge taken count is that the
2109 // induction variable was signed and as such will not overflow. In such a case
2110 // truncation is legal.
2111 if (ExitCount->getType()->getPrimitiveSizeInBits() >
2112 IdxTy->getPrimitiveSizeInBits())
2113 ExitCount = SE->getTruncateOrNoop(ExitCount, IdxTy);
2115 const SCEV *BackedgeTakeCount = SE->getNoopOrZeroExtend(ExitCount, IdxTy);
2116 // Get the total trip count from the count by adding 1.
2117 ExitCount = SE->getAddExpr(BackedgeTakeCount,
2118 SE->getConstant(BackedgeTakeCount->getType(), 1));
2120 const DataLayout &DL = OldBasicBlock->getModule()->getDataLayout();
2122 // Expand the trip count and place the new instructions in the preheader.
2123 // Notice that the pre-header does not change, only the loop body.
2124 SCEVExpander Exp(*SE, DL, "induction");
2126 // We need to test whether the backedge-taken count is uint##_max. Adding one
2127 // to it will cause overflow and an incorrect loop trip count in the vector
2128 // body. In case of overflow we want to directly jump to the scalar remainder
2130 Value *BackedgeCount =
2131 Exp.expandCodeFor(BackedgeTakeCount, BackedgeTakeCount->getType(),
2132 BypassBlock->getTerminator());
2133 if (BackedgeCount->getType()->isPointerTy())
2134 BackedgeCount = CastInst::CreatePointerCast(BackedgeCount, IdxTy,
2135 "backedge.ptrcnt.to.int",
2136 BypassBlock->getTerminator());
2137 Instruction *CheckBCOverflow =
2138 CmpInst::Create(Instruction::ICmp, CmpInst::ICMP_EQ, BackedgeCount,
2139 Constant::getAllOnesValue(BackedgeCount->getType()),
2140 "backedge.overflow", BypassBlock->getTerminator());
2142 // The loop index does not have to start at Zero. Find the original start
2143 // value from the induction PHI node. If we don't have an induction variable
2144 // then we know that it starts at zero.
2145 Builder.SetInsertPoint(BypassBlock->getTerminator());
2146 Value *StartIdx = ExtendedIdx = OldInduction ?
2147 Builder.CreateZExt(OldInduction->getIncomingValueForBlock(BypassBlock),
2149 ConstantInt::get(IdxTy, 0);
2151 // We need an instruction to anchor the overflow check on. StartIdx needs to
2152 // be defined before the overflow check branch. Because the scalar preheader
2153 // is going to merge the start index and so the overflow branch block needs to
2154 // contain a definition of the start index.
2155 Instruction *OverflowCheckAnchor = BinaryOperator::CreateAdd(
2156 StartIdx, ConstantInt::get(IdxTy, 0), "overflow.check.anchor",
2157 BypassBlock->getTerminator());
2159 // Count holds the overall loop count (N).
2160 Value *Count = Exp.expandCodeFor(ExitCount, ExitCount->getType(),
2161 BypassBlock->getTerminator());
2163 LoopBypassBlocks.push_back(BypassBlock);
2165 // Split the single block loop into the two loop structure described above.
2166 BasicBlock *VectorPH =
2167 BypassBlock->splitBasicBlock(BypassBlock->getTerminator(), "vector.ph");
2168 BasicBlock *VecBody =
2169 VectorPH->splitBasicBlock(VectorPH->getTerminator(), "vector.body");
2170 BasicBlock *MiddleBlock =
2171 VecBody->splitBasicBlock(VecBody->getTerminator(), "middle.block");
2172 BasicBlock *ScalarPH =
2173 MiddleBlock->splitBasicBlock(MiddleBlock->getTerminator(), "scalar.ph");
2175 // Create and register the new vector loop.
2176 Loop* Lp = new Loop();
2177 Loop *ParentLoop = OrigLoop->getParentLoop();
2179 // Insert the new loop into the loop nest and register the new basic blocks
2180 // before calling any utilities such as SCEV that require valid LoopInfo.
2182 ParentLoop->addChildLoop(Lp);
2183 ParentLoop->addBasicBlockToLoop(ScalarPH, *LI);
2184 ParentLoop->addBasicBlockToLoop(VectorPH, *LI);
2185 ParentLoop->addBasicBlockToLoop(MiddleBlock, *LI);
2187 LI->addTopLevelLoop(Lp);
2189 Lp->addBasicBlockToLoop(VecBody, *LI);
2191 // Use this IR builder to create the loop instructions (Phi, Br, Cmp)
2193 Builder.SetInsertPoint(VecBody->getFirstNonPHI());
2195 // Generate the induction variable.
2196 setDebugLocFromInst(Builder, getDebugLocFromInstOrOperands(OldInduction));
2197 Induction = Builder.CreatePHI(IdxTy, 2, "index");
2198 // The loop step is equal to the vectorization factor (num of SIMD elements)
2199 // times the unroll factor (num of SIMD instructions).
2200 Constant *Step = ConstantInt::get(IdxTy, VF * UF);
2202 // This is the IR builder that we use to add all of the logic for bypassing
2203 // the new vector loop.
2204 IRBuilder<> BypassBuilder(BypassBlock->getTerminator());
2205 setDebugLocFromInst(BypassBuilder,
2206 getDebugLocFromInstOrOperands(OldInduction));
2208 // We may need to extend the index in case there is a type mismatch.
2209 // We know that the count starts at zero and does not overflow.
2210 if (Count->getType() != IdxTy) {
2211 // The exit count can be of pointer type. Convert it to the correct
2213 if (ExitCount->getType()->isPointerTy())
2214 Count = BypassBuilder.CreatePointerCast(Count, IdxTy, "ptrcnt.to.int");
2216 Count = BypassBuilder.CreateZExtOrTrunc(Count, IdxTy, "cnt.cast");
2219 // Add the start index to the loop count to get the new end index.
2220 Value *IdxEnd = BypassBuilder.CreateAdd(Count, StartIdx, "end.idx");
2222 // Now we need to generate the expression for N - (N % VF), which is
2223 // the part that the vectorized body will execute.
2224 Value *R = BypassBuilder.CreateURem(Count, Step, "n.mod.vf");
2225 Value *CountRoundDown = BypassBuilder.CreateSub(Count, R, "n.vec");
2226 Value *IdxEndRoundDown = BypassBuilder.CreateAdd(CountRoundDown, StartIdx,
2227 "end.idx.rnd.down");
2229 // Now, compare the new count to zero. If it is zero skip the vector loop and
2230 // jump to the scalar loop.
2232 BypassBuilder.CreateICmpEQ(IdxEndRoundDown, StartIdx, "cmp.zero");
2234 BasicBlock *LastBypassBlock = BypassBlock;
2236 // Generate code to check that the loops trip count that we computed by adding
2237 // one to the backedge-taken count will not overflow.
2239 auto PastOverflowCheck =
2240 std::next(BasicBlock::iterator(OverflowCheckAnchor));
2241 BasicBlock *CheckBlock =
2242 LastBypassBlock->splitBasicBlock(PastOverflowCheck, "overflow.checked");
2244 ParentLoop->addBasicBlockToLoop(CheckBlock, *LI);
2245 LoopBypassBlocks.push_back(CheckBlock);
2246 Instruction *OldTerm = LastBypassBlock->getTerminator();
2247 BranchInst::Create(ScalarPH, CheckBlock, CheckBCOverflow, OldTerm);
2248 OldTerm->eraseFromParent();
2249 LastBypassBlock = CheckBlock;
2252 // Generate the code to check that the strides we assumed to be one are really
2253 // one. We want the new basic block to start at the first instruction in a
2254 // sequence of instructions that form a check.
2255 Instruction *StrideCheck;
2256 Instruction *FirstCheckInst;
2257 std::tie(FirstCheckInst, StrideCheck) =
2258 addStrideCheck(LastBypassBlock->getTerminator());
2260 AddedSafetyChecks = true;
2261 // Create a new block containing the stride check.
2262 BasicBlock *CheckBlock =
2263 LastBypassBlock->splitBasicBlock(FirstCheckInst, "vector.stridecheck");
2265 ParentLoop->addBasicBlockToLoop(CheckBlock, *LI);
2266 LoopBypassBlocks.push_back(CheckBlock);
2268 // Replace the branch into the memory check block with a conditional branch
2269 // for the "few elements case".
2270 Instruction *OldTerm = LastBypassBlock->getTerminator();
2271 BranchInst::Create(MiddleBlock, CheckBlock, Cmp, OldTerm);
2272 OldTerm->eraseFromParent();
2275 LastBypassBlock = CheckBlock;
2278 // Generate the code that checks in runtime if arrays overlap. We put the
2279 // checks into a separate block to make the more common case of few elements
2281 Instruction *MemRuntimeCheck;
2282 std::tie(FirstCheckInst, MemRuntimeCheck) =
2283 Legal->getLAI()->addRuntimeCheck(LastBypassBlock->getTerminator());
2284 if (MemRuntimeCheck) {
2285 AddedSafetyChecks = true;
2286 // Create a new block containing the memory check.
2287 BasicBlock *CheckBlock =
2288 LastBypassBlock->splitBasicBlock(FirstCheckInst, "vector.memcheck");
2290 ParentLoop->addBasicBlockToLoop(CheckBlock, *LI);
2291 LoopBypassBlocks.push_back(CheckBlock);
2293 // Replace the branch into the memory check block with a conditional branch
2294 // for the "few elements case".
2295 Instruction *OldTerm = LastBypassBlock->getTerminator();
2296 BranchInst::Create(MiddleBlock, CheckBlock, Cmp, OldTerm);
2297 OldTerm->eraseFromParent();
2299 Cmp = MemRuntimeCheck;
2300 LastBypassBlock = CheckBlock;
2303 LastBypassBlock->getTerminator()->eraseFromParent();
2304 BranchInst::Create(MiddleBlock, VectorPH, Cmp,
2307 // We are going to resume the execution of the scalar loop.
2308 // Go over all of the induction variables that we found and fix the
2309 // PHIs that are left in the scalar version of the loop.
2310 // The starting values of PHI nodes depend on the counter of the last
2311 // iteration in the vectorized loop.
2312 // If we come from a bypass edge then we need to start from the original
2315 // This variable saves the new starting index for the scalar loop.
2316 PHINode *ResumeIndex = nullptr;
2317 LoopVectorizationLegality::InductionList::iterator I, E;
2318 LoopVectorizationLegality::InductionList *List = Legal->getInductionVars();
2319 // Set builder to point to last bypass block.
2320 BypassBuilder.SetInsertPoint(LoopBypassBlocks.back()->getTerminator());
2321 for (I = List->begin(), E = List->end(); I != E; ++I) {
2322 PHINode *OrigPhi = I->first;
2323 LoopVectorizationLegality::InductionInfo II = I->second;
2325 Type *ResumeValTy = (OrigPhi == OldInduction) ? IdxTy : OrigPhi->getType();
2326 PHINode *ResumeVal = PHINode::Create(ResumeValTy, 2, "resume.val",
2327 MiddleBlock->getTerminator());
2328 // We might have extended the type of the induction variable but we need a
2329 // truncated version for the scalar loop.
2330 PHINode *TruncResumeVal = (OrigPhi == OldInduction) ?
2331 PHINode::Create(OrigPhi->getType(), 2, "trunc.resume.val",
2332 MiddleBlock->getTerminator()) : nullptr;
2334 // Create phi nodes to merge from the backedge-taken check block.
2335 PHINode *BCResumeVal = PHINode::Create(ResumeValTy, 3, "bc.resume.val",
2336 ScalarPH->getTerminator());
2337 BCResumeVal->addIncoming(ResumeVal, MiddleBlock);
2339 PHINode *BCTruncResumeVal = nullptr;
2340 if (OrigPhi == OldInduction) {
2342 PHINode::Create(OrigPhi->getType(), 2, "bc.trunc.resume.val",
2343 ScalarPH->getTerminator());
2344 BCTruncResumeVal->addIncoming(TruncResumeVal, MiddleBlock);
2347 Value *EndValue = nullptr;
2349 case LoopVectorizationLegality::IK_NoInduction:
2350 llvm_unreachable("Unknown induction");
2351 case LoopVectorizationLegality::IK_IntInduction: {
2352 // Handle the integer induction counter.
2353 assert(OrigPhi->getType()->isIntegerTy() && "Invalid type");
2355 // We have the canonical induction variable.
2356 if (OrigPhi == OldInduction) {
2357 // Create a truncated version of the resume value for the scalar loop,
2358 // we might have promoted the type to a larger width.
2360 BypassBuilder.CreateTrunc(IdxEndRoundDown, OrigPhi->getType());
2361 // The new PHI merges the original incoming value, in case of a bypass,
2362 // or the value at the end of the vectorized loop.
2363 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I)
2364 TruncResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[I]);
2365 TruncResumeVal->addIncoming(EndValue, VecBody);
2367 BCTruncResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[0]);
2369 // We know what the end value is.
2370 EndValue = IdxEndRoundDown;
2371 // We also know which PHI node holds it.
2372 ResumeIndex = ResumeVal;
2376 // Not the canonical induction variable - add the vector loop count to the
2378 Value *CRD = BypassBuilder.CreateSExtOrTrunc(CountRoundDown,
2379 II.StartValue->getType(),
2381 EndValue = II.transform(BypassBuilder, CRD);
2382 EndValue->setName("ind.end");
2385 case LoopVectorizationLegality::IK_PtrInduction: {
2386 EndValue = II.transform(BypassBuilder, CountRoundDown);
2387 EndValue->setName("ptr.ind.end");
2392 // The new PHI merges the original incoming value, in case of a bypass,
2393 // or the value at the end of the vectorized loop.
2394 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I) {
2395 if (OrigPhi == OldInduction)
2396 ResumeVal->addIncoming(StartIdx, LoopBypassBlocks[I]);
2398 ResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[I]);
2400 ResumeVal->addIncoming(EndValue, VecBody);
2402 // Fix the scalar body counter (PHI node).
2403 unsigned BlockIdx = OrigPhi->getBasicBlockIndex(ScalarPH);
2405 // The old induction's phi node in the scalar body needs the truncated
2407 if (OrigPhi == OldInduction) {
2408 BCResumeVal->addIncoming(StartIdx, LoopBypassBlocks[0]);
2409 OrigPhi->setIncomingValue(BlockIdx, BCTruncResumeVal);
2411 BCResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[0]);
2412 OrigPhi->setIncomingValue(BlockIdx, BCResumeVal);
2416 // If we are generating a new induction variable then we also need to
2417 // generate the code that calculates the exit value. This value is not
2418 // simply the end of the counter because we may skip the vectorized body
2419 // in case of a runtime check.
2421 assert(!ResumeIndex && "Unexpected resume value found");
2422 ResumeIndex = PHINode::Create(IdxTy, 2, "new.indc.resume.val",
2423 MiddleBlock->getTerminator());
2424 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I)
2425 ResumeIndex->addIncoming(StartIdx, LoopBypassBlocks[I]);
2426 ResumeIndex->addIncoming(IdxEndRoundDown, VecBody);
2429 // Make sure that we found the index where scalar loop needs to continue.
2430 assert(ResumeIndex && ResumeIndex->getType()->isIntegerTy() &&
2431 "Invalid resume Index");
2433 // Add a check in the middle block to see if we have completed
2434 // all of the iterations in the first vector loop.
2435 // If (N - N%VF) == N, then we *don't* need to run the remainder.
2436 Value *CmpN = CmpInst::Create(Instruction::ICmp, CmpInst::ICMP_EQ, IdxEnd,
2437 ResumeIndex, "cmp.n",
2438 MiddleBlock->getTerminator());
2440 BranchInst::Create(ExitBlock, ScalarPH, CmpN, MiddleBlock->getTerminator());
2441 // Remove the old terminator.
2442 MiddleBlock->getTerminator()->eraseFromParent();
2444 // Create i+1 and fill the PHINode.
2445 Value *NextIdx = Builder.CreateAdd(Induction, Step, "index.next");
2446 Induction->addIncoming(StartIdx, VectorPH);
2447 Induction->addIncoming(NextIdx, VecBody);
2448 // Create the compare.
2449 Value *ICmp = Builder.CreateICmpEQ(NextIdx, IdxEndRoundDown);
2450 Builder.CreateCondBr(ICmp, MiddleBlock, VecBody);
2452 // Now we have two terminators. Remove the old one from the block.
2453 VecBody->getTerminator()->eraseFromParent();
2455 // Get ready to start creating new instructions into the vectorized body.
2456 Builder.SetInsertPoint(VecBody->getFirstInsertionPt());
2459 LoopVectorPreHeader = VectorPH;
2460 LoopScalarPreHeader = ScalarPH;
2461 LoopMiddleBlock = MiddleBlock;
2462 LoopExitBlock = ExitBlock;
2463 LoopVectorBody.push_back(VecBody);
2464 LoopScalarBody = OldBasicBlock;
2466 LoopVectorizeHints Hints(Lp, true);
2467 Hints.setAlreadyVectorized();
2470 /// This function returns the identity element (or neutral element) for
2471 /// the operation K.
2473 LoopVectorizationLegality::getReductionIdentity(ReductionKind K, Type *Tp) {
2478 // Adding, Xoring, Oring zero to a number does not change it.
2479 return ConstantInt::get(Tp, 0);
2480 case RK_IntegerMult:
2481 // Multiplying a number by 1 does not change it.
2482 return ConstantInt::get(Tp, 1);
2484 // AND-ing a number with an all-1 value does not change it.
2485 return ConstantInt::get(Tp, -1, true);
2487 // Multiplying a number by 1 does not change it.
2488 return ConstantFP::get(Tp, 1.0L);
2490 // Adding zero to a number does not change it.
2491 return ConstantFP::get(Tp, 0.0L);
2493 llvm_unreachable("Unknown reduction kind");
2497 /// This function translates the reduction kind to an LLVM binary operator.
2499 getReductionBinOp(LoopVectorizationLegality::ReductionKind Kind) {
2501 case LoopVectorizationLegality::RK_IntegerAdd:
2502 return Instruction::Add;
2503 case LoopVectorizationLegality::RK_IntegerMult:
2504 return Instruction::Mul;
2505 case LoopVectorizationLegality::RK_IntegerOr:
2506 return Instruction::Or;
2507 case LoopVectorizationLegality::RK_IntegerAnd:
2508 return Instruction::And;
2509 case LoopVectorizationLegality::RK_IntegerXor:
2510 return Instruction::Xor;
2511 case LoopVectorizationLegality::RK_FloatMult:
2512 return Instruction::FMul;
2513 case LoopVectorizationLegality::RK_FloatAdd:
2514 return Instruction::FAdd;
2515 case LoopVectorizationLegality::RK_IntegerMinMax:
2516 return Instruction::ICmp;
2517 case LoopVectorizationLegality::RK_FloatMinMax:
2518 return Instruction::FCmp;
2520 llvm_unreachable("Unknown reduction operation");
2524 static Value *createMinMaxOp(IRBuilder<> &Builder,
2525 LoopVectorizationLegality::MinMaxReductionKind RK,
2526 Value *Left, Value *Right) {
2527 CmpInst::Predicate P = CmpInst::ICMP_NE;
2530 llvm_unreachable("Unknown min/max reduction kind");
2531 case LoopVectorizationLegality::MRK_UIntMin:
2532 P = CmpInst::ICMP_ULT;
2534 case LoopVectorizationLegality::MRK_UIntMax:
2535 P = CmpInst::ICMP_UGT;
2537 case LoopVectorizationLegality::MRK_SIntMin:
2538 P = CmpInst::ICMP_SLT;
2540 case LoopVectorizationLegality::MRK_SIntMax:
2541 P = CmpInst::ICMP_SGT;
2543 case LoopVectorizationLegality::MRK_FloatMin:
2544 P = CmpInst::FCMP_OLT;
2546 case LoopVectorizationLegality::MRK_FloatMax:
2547 P = CmpInst::FCMP_OGT;
2552 if (RK == LoopVectorizationLegality::MRK_FloatMin ||
2553 RK == LoopVectorizationLegality::MRK_FloatMax)
2554 Cmp = Builder.CreateFCmp(P, Left, Right, "rdx.minmax.cmp");
2556 Cmp = Builder.CreateICmp(P, Left, Right, "rdx.minmax.cmp");
2558 Value *Select = Builder.CreateSelect(Cmp, Left, Right, "rdx.minmax.select");
2563 struct CSEDenseMapInfo {
2564 static bool canHandle(Instruction *I) {
2565 return isa<InsertElementInst>(I) || isa<ExtractElementInst>(I) ||
2566 isa<ShuffleVectorInst>(I) || isa<GetElementPtrInst>(I);
2568 static inline Instruction *getEmptyKey() {
2569 return DenseMapInfo<Instruction *>::getEmptyKey();
2571 static inline Instruction *getTombstoneKey() {
2572 return DenseMapInfo<Instruction *>::getTombstoneKey();
2574 static unsigned getHashValue(Instruction *I) {
2575 assert(canHandle(I) && "Unknown instruction!");
2576 return hash_combine(I->getOpcode(), hash_combine_range(I->value_op_begin(),
2577 I->value_op_end()));
2579 static bool isEqual(Instruction *LHS, Instruction *RHS) {
2580 if (LHS == getEmptyKey() || RHS == getEmptyKey() ||
2581 LHS == getTombstoneKey() || RHS == getTombstoneKey())
2583 return LHS->isIdenticalTo(RHS);
2588 /// \brief Check whether this block is a predicated block.
2589 /// Due to if predication of stores we might create a sequence of "if(pred) a[i]
2590 /// = ...; " blocks. We start with one vectorized basic block. For every
2591 /// conditional block we split this vectorized block. Therefore, every second
2592 /// block will be a predicated one.
2593 static bool isPredicatedBlock(unsigned BlockNum) {
2594 return BlockNum % 2;
2597 ///\brief Perform cse of induction variable instructions.
2598 static void cse(SmallVector<BasicBlock *, 4> &BBs) {
2599 // Perform simple cse.
2600 SmallDenseMap<Instruction *, Instruction *, 4, CSEDenseMapInfo> CSEMap;
2601 for (unsigned i = 0, e = BBs.size(); i != e; ++i) {
2602 BasicBlock *BB = BBs[i];
2603 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;) {
2604 Instruction *In = I++;
2606 if (!CSEDenseMapInfo::canHandle(In))
2609 // Check if we can replace this instruction with any of the
2610 // visited instructions.
2611 if (Instruction *V = CSEMap.lookup(In)) {
2612 In->replaceAllUsesWith(V);
2613 In->eraseFromParent();
2616 // Ignore instructions in conditional blocks. We create "if (pred) a[i] =
2617 // ...;" blocks for predicated stores. Every second block is a predicated
2619 if (isPredicatedBlock(i))
2627 /// \brief Adds a 'fast' flag to floating point operations.
2628 static Value *addFastMathFlag(Value *V) {
2629 if (isa<FPMathOperator>(V)){
2630 FastMathFlags Flags;
2631 Flags.setUnsafeAlgebra();
2632 cast<Instruction>(V)->setFastMathFlags(Flags);
2637 /// Estimate the overhead of scalarizing a value. Insert and Extract are set if
2638 /// the result needs to be inserted and/or extracted from vectors.
2639 static unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract,
2640 const TargetTransformInfo &TTI) {
2641 assert(Ty->isVectorTy() && "Can only scalarize vectors");
2644 for (int i = 0, e = Ty->getVectorNumElements(); i < e; ++i) {
2646 Cost += TTI.getVectorInstrCost(Instruction::InsertElement, Ty, i);
2648 Cost += TTI.getVectorInstrCost(Instruction::ExtractElement, Ty, i);
2654 // Estimate cost of a call instruction CI if it were vectorized with factor VF.
2655 // Return the cost of the instruction, including scalarization overhead if it's
2656 // needed. The flag NeedToScalarize shows if the call needs to be scalarized -
2657 // i.e. either vector version isn't available, or is too expensive.
2658 static unsigned getVectorCallCost(CallInst *CI, unsigned VF,
2659 const TargetTransformInfo &TTI,
2660 const TargetLibraryInfo *TLI,
2661 bool &NeedToScalarize) {
2662 Function *F = CI->getCalledFunction();
2663 StringRef FnName = CI->getCalledFunction()->getName();
2664 Type *ScalarRetTy = CI->getType();
2665 SmallVector<Type *, 4> Tys, ScalarTys;
2666 for (auto &ArgOp : CI->arg_operands())
2667 ScalarTys.push_back(ArgOp->getType());
2669 // Estimate cost of scalarized vector call. The source operands are assumed
2670 // to be vectors, so we need to extract individual elements from there,
2671 // execute VF scalar calls, and then gather the result into the vector return
2673 unsigned ScalarCallCost = TTI.getCallInstrCost(F, ScalarRetTy, ScalarTys);
2675 return ScalarCallCost;
2677 // Compute corresponding vector type for return value and arguments.
2678 Type *RetTy = ToVectorTy(ScalarRetTy, VF);
2679 for (unsigned i = 0, ie = ScalarTys.size(); i != ie; ++i)
2680 Tys.push_back(ToVectorTy(ScalarTys[i], VF));
2682 // Compute costs of unpacking argument values for the scalar calls and
2683 // packing the return values to a vector.
2684 unsigned ScalarizationCost =
2685 getScalarizationOverhead(RetTy, true, false, TTI);
2686 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i)
2687 ScalarizationCost += getScalarizationOverhead(Tys[i], false, true, TTI);
2689 unsigned Cost = ScalarCallCost * VF + ScalarizationCost;
2691 // If we can't emit a vector call for this function, then the currently found
2692 // cost is the cost we need to return.
2693 NeedToScalarize = true;
2694 if (!TLI || !TLI->isFunctionVectorizable(FnName, VF) || CI->isNoBuiltin())
2697 // If the corresponding vector cost is cheaper, return its cost.
2698 unsigned VectorCallCost = TTI.getCallInstrCost(nullptr, RetTy, Tys);
2699 if (VectorCallCost < Cost) {
2700 NeedToScalarize = false;
2701 return VectorCallCost;
2706 // Estimate cost of an intrinsic call instruction CI if it were vectorized with
2707 // factor VF. Return the cost of the instruction, including scalarization
2708 // overhead if it's needed.
2709 static unsigned getVectorIntrinsicCost(CallInst *CI, unsigned VF,
2710 const TargetTransformInfo &TTI,
2711 const TargetLibraryInfo *TLI) {
2712 Intrinsic::ID ID = getIntrinsicIDForCall(CI, TLI);
2713 assert(ID && "Expected intrinsic call!");
2715 Type *RetTy = ToVectorTy(CI->getType(), VF);
2716 SmallVector<Type *, 4> Tys;
2717 for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i)
2718 Tys.push_back(ToVectorTy(CI->getArgOperand(i)->getType(), VF));
2720 return TTI.getIntrinsicInstrCost(ID, RetTy, Tys);
2723 void InnerLoopVectorizer::vectorizeLoop() {
2724 //===------------------------------------------------===//
2726 // Notice: any optimization or new instruction that go
2727 // into the code below should be also be implemented in
2730 //===------------------------------------------------===//
2731 Constant *Zero = Builder.getInt32(0);
2733 // In order to support reduction variables we need to be able to vectorize
2734 // Phi nodes. Phi nodes have cycles, so we need to vectorize them in two
2735 // stages. First, we create a new vector PHI node with no incoming edges.
2736 // We use this value when we vectorize all of the instructions that use the
2737 // PHI. Next, after all of the instructions in the block are complete we
2738 // add the new incoming edges to the PHI. At this point all of the
2739 // instructions in the basic block are vectorized, so we can use them to
2740 // construct the PHI.
2741 PhiVector RdxPHIsToFix;
2743 // Scan the loop in a topological order to ensure that defs are vectorized
2745 LoopBlocksDFS DFS(OrigLoop);
2748 // Vectorize all of the blocks in the original loop.
2749 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
2750 be = DFS.endRPO(); bb != be; ++bb)
2751 vectorizeBlockInLoop(*bb, &RdxPHIsToFix);
2753 // At this point every instruction in the original loop is widened to
2754 // a vector form. We are almost done. Now, we need to fix the PHI nodes
2755 // that we vectorized. The PHI nodes are currently empty because we did
2756 // not want to introduce cycles. Notice that the remaining PHI nodes
2757 // that we need to fix are reduction variables.
2759 // Create the 'reduced' values for each of the induction vars.
2760 // The reduced values are the vector values that we scalarize and combine
2761 // after the loop is finished.
2762 for (PhiVector::iterator it = RdxPHIsToFix.begin(), e = RdxPHIsToFix.end();
2764 PHINode *RdxPhi = *it;
2765 assert(RdxPhi && "Unable to recover vectorized PHI");
2767 // Find the reduction variable descriptor.
2768 assert(Legal->getReductionVars()->count(RdxPhi) &&
2769 "Unable to find the reduction variable");
2770 LoopVectorizationLegality::ReductionDescriptor RdxDesc =
2771 (*Legal->getReductionVars())[RdxPhi];
2773 setDebugLocFromInst(Builder, RdxDesc.StartValue);
2775 // We need to generate a reduction vector from the incoming scalar.
2776 // To do so, we need to generate the 'identity' vector and override
2777 // one of the elements with the incoming scalar reduction. We need
2778 // to do it in the vector-loop preheader.
2779 Builder.SetInsertPoint(LoopBypassBlocks[1]->getTerminator());
2781 // This is the vector-clone of the value that leaves the loop.
2782 VectorParts &VectorExit = getVectorValue(RdxDesc.LoopExitInstr);
2783 Type *VecTy = VectorExit[0]->getType();
2785 // Find the reduction identity variable. Zero for addition, or, xor,
2786 // one for multiplication, -1 for And.
2789 if (RdxDesc.Kind == LoopVectorizationLegality::RK_IntegerMinMax ||
2790 RdxDesc.Kind == LoopVectorizationLegality::RK_FloatMinMax) {
2791 // MinMax reduction have the start value as their identify.
2793 VectorStart = Identity = RdxDesc.StartValue;
2795 VectorStart = Identity = Builder.CreateVectorSplat(VF,
2800 // Handle other reduction kinds:
2802 LoopVectorizationLegality::getReductionIdentity(RdxDesc.Kind,
2803 VecTy->getScalarType());
2806 // This vector is the Identity vector where the first element is the
2807 // incoming scalar reduction.
2808 VectorStart = RdxDesc.StartValue;
2810 Identity = ConstantVector::getSplat(VF, Iden);
2812 // This vector is the Identity vector where the first element is the
2813 // incoming scalar reduction.
2814 VectorStart = Builder.CreateInsertElement(Identity,
2815 RdxDesc.StartValue, Zero);
2819 // Fix the vector-loop phi.
2821 // Reductions do not have to start at zero. They can start with
2822 // any loop invariant values.
2823 VectorParts &VecRdxPhi = WidenMap.get(RdxPhi);
2824 BasicBlock *Latch = OrigLoop->getLoopLatch();
2825 Value *LoopVal = RdxPhi->getIncomingValueForBlock(Latch);
2826 VectorParts &Val = getVectorValue(LoopVal);
2827 for (unsigned part = 0; part < UF; ++part) {
2828 // Make sure to add the reduction stat value only to the
2829 // first unroll part.
2830 Value *StartVal = (part == 0) ? VectorStart : Identity;
2831 cast<PHINode>(VecRdxPhi[part])->addIncoming(StartVal,
2832 LoopVectorPreHeader);
2833 cast<PHINode>(VecRdxPhi[part])->addIncoming(Val[part],
2834 LoopVectorBody.back());
2837 // Before each round, move the insertion point right between
2838 // the PHIs and the values we are going to write.
2839 // This allows us to write both PHINodes and the extractelement
2841 Builder.SetInsertPoint(LoopMiddleBlock->getFirstInsertionPt());
2843 VectorParts RdxParts;
2844 setDebugLocFromInst(Builder, RdxDesc.LoopExitInstr);
2845 for (unsigned part = 0; part < UF; ++part) {
2846 // This PHINode contains the vectorized reduction variable, or
2847 // the initial value vector, if we bypass the vector loop.
2848 VectorParts &RdxExitVal = getVectorValue(RdxDesc.LoopExitInstr);
2849 PHINode *NewPhi = Builder.CreatePHI(VecTy, 2, "rdx.vec.exit.phi");
2850 Value *StartVal = (part == 0) ? VectorStart : Identity;
2851 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I)
2852 NewPhi->addIncoming(StartVal, LoopBypassBlocks[I]);
2853 NewPhi->addIncoming(RdxExitVal[part],
2854 LoopVectorBody.back());
2855 RdxParts.push_back(NewPhi);
2858 // Reduce all of the unrolled parts into a single vector.
2859 Value *ReducedPartRdx = RdxParts[0];
2860 unsigned Op = getReductionBinOp(RdxDesc.Kind);
2861 setDebugLocFromInst(Builder, ReducedPartRdx);
2862 for (unsigned part = 1; part < UF; ++part) {
2863 if (Op != Instruction::ICmp && Op != Instruction::FCmp)
2864 // Floating point operations had to be 'fast' to enable the reduction.
2865 ReducedPartRdx = addFastMathFlag(
2866 Builder.CreateBinOp((Instruction::BinaryOps)Op, RdxParts[part],
2867 ReducedPartRdx, "bin.rdx"));
2869 ReducedPartRdx = createMinMaxOp(Builder, RdxDesc.MinMaxKind,
2870 ReducedPartRdx, RdxParts[part]);
2874 // VF is a power of 2 so we can emit the reduction using log2(VF) shuffles
2875 // and vector ops, reducing the set of values being computed by half each
2877 assert(isPowerOf2_32(VF) &&
2878 "Reduction emission only supported for pow2 vectors!");
2879 Value *TmpVec = ReducedPartRdx;
2880 SmallVector<Constant*, 32> ShuffleMask(VF, nullptr);
2881 for (unsigned i = VF; i != 1; i >>= 1) {
2882 // Move the upper half of the vector to the lower half.
2883 for (unsigned j = 0; j != i/2; ++j)
2884 ShuffleMask[j] = Builder.getInt32(i/2 + j);
2886 // Fill the rest of the mask with undef.
2887 std::fill(&ShuffleMask[i/2], ShuffleMask.end(),
2888 UndefValue::get(Builder.getInt32Ty()));
2891 Builder.CreateShuffleVector(TmpVec,
2892 UndefValue::get(TmpVec->getType()),
2893 ConstantVector::get(ShuffleMask),
2896 if (Op != Instruction::ICmp && Op != Instruction::FCmp)
2897 // Floating point operations had to be 'fast' to enable the reduction.
2898 TmpVec = addFastMathFlag(Builder.CreateBinOp(
2899 (Instruction::BinaryOps)Op, TmpVec, Shuf, "bin.rdx"));
2901 TmpVec = createMinMaxOp(Builder, RdxDesc.MinMaxKind, TmpVec, Shuf);
2904 // The result is in the first element of the vector.
2905 ReducedPartRdx = Builder.CreateExtractElement(TmpVec,
2906 Builder.getInt32(0));
2909 // Create a phi node that merges control-flow from the backedge-taken check
2910 // block and the middle block.
2911 PHINode *BCBlockPhi = PHINode::Create(RdxPhi->getType(), 2, "bc.merge.rdx",
2912 LoopScalarPreHeader->getTerminator());
2913 BCBlockPhi->addIncoming(RdxDesc.StartValue, LoopBypassBlocks[0]);
2914 BCBlockPhi->addIncoming(ReducedPartRdx, LoopMiddleBlock);
2916 // Now, we need to fix the users of the reduction variable
2917 // inside and outside of the scalar remainder loop.
2918 // We know that the loop is in LCSSA form. We need to update the
2919 // PHI nodes in the exit blocks.
2920 for (BasicBlock::iterator LEI = LoopExitBlock->begin(),
2921 LEE = LoopExitBlock->end(); LEI != LEE; ++LEI) {
2922 PHINode *LCSSAPhi = dyn_cast<PHINode>(LEI);
2923 if (!LCSSAPhi) break;
2925 // All PHINodes need to have a single entry edge, or two if
2926 // we already fixed them.
2927 assert(LCSSAPhi->getNumIncomingValues() < 3 && "Invalid LCSSA PHI");
2929 // We found our reduction value exit-PHI. Update it with the
2930 // incoming bypass edge.
2931 if (LCSSAPhi->getIncomingValue(0) == RdxDesc.LoopExitInstr) {
2932 // Add an edge coming from the bypass.
2933 LCSSAPhi->addIncoming(ReducedPartRdx, LoopMiddleBlock);
2936 }// end of the LCSSA phi scan.
2938 // Fix the scalar loop reduction variable with the incoming reduction sum
2939 // from the vector body and from the backedge value.
2940 int IncomingEdgeBlockIdx =
2941 (RdxPhi)->getBasicBlockIndex(OrigLoop->getLoopLatch());
2942 assert(IncomingEdgeBlockIdx >= 0 && "Invalid block index");
2943 // Pick the other block.
2944 int SelfEdgeBlockIdx = (IncomingEdgeBlockIdx ? 0 : 1);
2945 (RdxPhi)->setIncomingValue(SelfEdgeBlockIdx, BCBlockPhi);
2946 (RdxPhi)->setIncomingValue(IncomingEdgeBlockIdx, RdxDesc.LoopExitInstr);
2947 }// end of for each redux variable.
2951 // Remove redundant induction instructions.
2952 cse(LoopVectorBody);
2955 void InnerLoopVectorizer::fixLCSSAPHIs() {
2956 for (BasicBlock::iterator LEI = LoopExitBlock->begin(),
2957 LEE = LoopExitBlock->end(); LEI != LEE; ++LEI) {
2958 PHINode *LCSSAPhi = dyn_cast<PHINode>(LEI);
2959 if (!LCSSAPhi) break;
2960 if (LCSSAPhi->getNumIncomingValues() == 1)
2961 LCSSAPhi->addIncoming(UndefValue::get(LCSSAPhi->getType()),
2966 InnerLoopVectorizer::VectorParts
2967 InnerLoopVectorizer::createEdgeMask(BasicBlock *Src, BasicBlock *Dst) {
2968 assert(std::find(pred_begin(Dst), pred_end(Dst), Src) != pred_end(Dst) &&
2971 // Look for cached value.
2972 std::pair<BasicBlock*, BasicBlock*> Edge(Src, Dst);
2973 EdgeMaskCache::iterator ECEntryIt = MaskCache.find(Edge);
2974 if (ECEntryIt != MaskCache.end())
2975 return ECEntryIt->second;
2977 VectorParts SrcMask = createBlockInMask(Src);
2979 // The terminator has to be a branch inst!
2980 BranchInst *BI = dyn_cast<BranchInst>(Src->getTerminator());
2981 assert(BI && "Unexpected terminator found");
2983 if (BI->isConditional()) {
2984 VectorParts EdgeMask = getVectorValue(BI->getCondition());
2986 if (BI->getSuccessor(0) != Dst)
2987 for (unsigned part = 0; part < UF; ++part)
2988 EdgeMask[part] = Builder.CreateNot(EdgeMask[part]);
2990 for (unsigned part = 0; part < UF; ++part)
2991 EdgeMask[part] = Builder.CreateAnd(EdgeMask[part], SrcMask[part]);
2993 MaskCache[Edge] = EdgeMask;
2997 MaskCache[Edge] = SrcMask;
3001 InnerLoopVectorizer::VectorParts
3002 InnerLoopVectorizer::createBlockInMask(BasicBlock *BB) {
3003 assert(OrigLoop->contains(BB) && "Block is not a part of a loop");
3005 // Loop incoming mask is all-one.
3006 if (OrigLoop->getHeader() == BB) {
3007 Value *C = ConstantInt::get(IntegerType::getInt1Ty(BB->getContext()), 1);
3008 return getVectorValue(C);
3011 // This is the block mask. We OR all incoming edges, and with zero.
3012 Value *Zero = ConstantInt::get(IntegerType::getInt1Ty(BB->getContext()), 0);
3013 VectorParts BlockMask = getVectorValue(Zero);
3016 for (pred_iterator it = pred_begin(BB), e = pred_end(BB); it != e; ++it) {
3017 VectorParts EM = createEdgeMask(*it, BB);
3018 for (unsigned part = 0; part < UF; ++part)
3019 BlockMask[part] = Builder.CreateOr(BlockMask[part], EM[part]);
3025 void InnerLoopVectorizer::widenPHIInstruction(Instruction *PN,
3026 InnerLoopVectorizer::VectorParts &Entry,
3027 unsigned UF, unsigned VF, PhiVector *PV) {
3028 PHINode* P = cast<PHINode>(PN);
3029 // Handle reduction variables:
3030 if (Legal->getReductionVars()->count(P)) {
3031 for (unsigned part = 0; part < UF; ++part) {
3032 // This is phase one of vectorizing PHIs.
3033 Type *VecTy = (VF == 1) ? PN->getType() :
3034 VectorType::get(PN->getType(), VF);
3035 Entry[part] = PHINode::Create(VecTy, 2, "vec.phi",
3036 LoopVectorBody.back()-> getFirstInsertionPt());
3042 setDebugLocFromInst(Builder, P);
3043 // Check for PHI nodes that are lowered to vector selects.
3044 if (P->getParent() != OrigLoop->getHeader()) {
3045 // We know that all PHIs in non-header blocks are converted into
3046 // selects, so we don't have to worry about the insertion order and we
3047 // can just use the builder.
3048 // At this point we generate the predication tree. There may be
3049 // duplications since this is a simple recursive scan, but future
3050 // optimizations will clean it up.
3052 unsigned NumIncoming = P->getNumIncomingValues();
3054 // Generate a sequence of selects of the form:
3055 // SELECT(Mask3, In3,
3056 // SELECT(Mask2, In2,
3058 for (unsigned In = 0; In < NumIncoming; In++) {
3059 VectorParts Cond = createEdgeMask(P->getIncomingBlock(In),
3061 VectorParts &In0 = getVectorValue(P->getIncomingValue(In));
3063 for (unsigned part = 0; part < UF; ++part) {
3064 // We might have single edge PHIs (blocks) - use an identity
3065 // 'select' for the first PHI operand.
3067 Entry[part] = Builder.CreateSelect(Cond[part], In0[part],
3070 // Select between the current value and the previous incoming edge
3071 // based on the incoming mask.
3072 Entry[part] = Builder.CreateSelect(Cond[part], In0[part],
3073 Entry[part], "predphi");
3079 // This PHINode must be an induction variable.
3080 // Make sure that we know about it.
3081 assert(Legal->getInductionVars()->count(P) &&
3082 "Not an induction variable");
3084 LoopVectorizationLegality::InductionInfo II =
3085 Legal->getInductionVars()->lookup(P);
3087 // FIXME: The newly created binary instructions should contain nsw/nuw flags,
3088 // which can be found from the original scalar operations.
3090 case LoopVectorizationLegality::IK_NoInduction:
3091 llvm_unreachable("Unknown induction");
3092 case LoopVectorizationLegality::IK_IntInduction: {
3093 assert(P->getType() == II.StartValue->getType() && "Types must match");
3094 Type *PhiTy = P->getType();
3096 if (P == OldInduction) {
3097 // Handle the canonical induction variable. We might have had to
3099 Broadcasted = Builder.CreateTrunc(Induction, PhiTy);
3101 // Handle other induction variables that are now based on the
3103 Value *NormalizedIdx = Builder.CreateSub(Induction, ExtendedIdx,
3105 NormalizedIdx = Builder.CreateSExtOrTrunc(NormalizedIdx, PhiTy);
3106 Broadcasted = II.transform(Builder, NormalizedIdx);
3107 Broadcasted->setName("offset.idx");
3109 Broadcasted = getBroadcastInstrs(Broadcasted);
3110 // After broadcasting the induction variable we need to make the vector
3111 // consecutive by adding 0, 1, 2, etc.
3112 for (unsigned part = 0; part < UF; ++part)
3113 Entry[part] = getStepVector(Broadcasted, VF * part, II.StepValue);
3116 case LoopVectorizationLegality::IK_PtrInduction:
3117 // Handle the pointer induction variable case.
3118 assert(P->getType()->isPointerTy() && "Unexpected type.");
3119 // This is the normalized GEP that starts counting at zero.
3120 Value *NormalizedIdx =
3121 Builder.CreateSub(Induction, ExtendedIdx, "normalized.idx");
3122 // This is the vector of results. Notice that we don't generate
3123 // vector geps because scalar geps result in better code.
3124 for (unsigned part = 0; part < UF; ++part) {
3126 int EltIndex = part;
3127 Constant *Idx = ConstantInt::get(Induction->getType(), EltIndex);
3128 Value *GlobalIdx = Builder.CreateAdd(NormalizedIdx, Idx);
3129 Value *SclrGep = II.transform(Builder, GlobalIdx);
3130 SclrGep->setName("next.gep");
3131 Entry[part] = SclrGep;
3135 Value *VecVal = UndefValue::get(VectorType::get(P->getType(), VF));
3136 for (unsigned int i = 0; i < VF; ++i) {
3137 int EltIndex = i + part * VF;
3138 Constant *Idx = ConstantInt::get(Induction->getType(), EltIndex);
3139 Value *GlobalIdx = Builder.CreateAdd(NormalizedIdx, Idx);
3140 Value *SclrGep = II.transform(Builder, GlobalIdx);
3141 SclrGep->setName("next.gep");
3142 VecVal = Builder.CreateInsertElement(VecVal, SclrGep,
3143 Builder.getInt32(i),
3146 Entry[part] = VecVal;
3152 void InnerLoopVectorizer::vectorizeBlockInLoop(BasicBlock *BB, PhiVector *PV) {
3153 // For each instruction in the old loop.
3154 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
3155 VectorParts &Entry = WidenMap.get(it);
3156 switch (it->getOpcode()) {
3157 case Instruction::Br:
3158 // Nothing to do for PHIs and BR, since we already took care of the
3159 // loop control flow instructions.
3161 case Instruction::PHI: {
3162 // Vectorize PHINodes.
3163 widenPHIInstruction(it, Entry, UF, VF, PV);
3167 case Instruction::Add:
3168 case Instruction::FAdd:
3169 case Instruction::Sub:
3170 case Instruction::FSub:
3171 case Instruction::Mul:
3172 case Instruction::FMul:
3173 case Instruction::UDiv:
3174 case Instruction::SDiv:
3175 case Instruction::FDiv:
3176 case Instruction::URem:
3177 case Instruction::SRem:
3178 case Instruction::FRem:
3179 case Instruction::Shl:
3180 case Instruction::LShr:
3181 case Instruction::AShr:
3182 case Instruction::And:
3183 case Instruction::Or:
3184 case Instruction::Xor: {
3185 // Just widen binops.
3186 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(it);
3187 setDebugLocFromInst(Builder, BinOp);
3188 VectorParts &A = getVectorValue(it->getOperand(0));
3189 VectorParts &B = getVectorValue(it->getOperand(1));
3191 // Use this vector value for all users of the original instruction.
3192 for (unsigned Part = 0; Part < UF; ++Part) {
3193 Value *V = Builder.CreateBinOp(BinOp->getOpcode(), A[Part], B[Part]);
3195 if (BinaryOperator *VecOp = dyn_cast<BinaryOperator>(V))
3196 VecOp->copyIRFlags(BinOp);
3201 propagateMetadata(Entry, it);
3204 case Instruction::Select: {
3206 // If the selector is loop invariant we can create a select
3207 // instruction with a scalar condition. Otherwise, use vector-select.
3208 bool InvariantCond = SE->isLoopInvariant(SE->getSCEV(it->getOperand(0)),
3210 setDebugLocFromInst(Builder, it);
3212 // The condition can be loop invariant but still defined inside the
3213 // loop. This means that we can't just use the original 'cond' value.
3214 // We have to take the 'vectorized' value and pick the first lane.
3215 // Instcombine will make this a no-op.
3216 VectorParts &Cond = getVectorValue(it->getOperand(0));
3217 VectorParts &Op0 = getVectorValue(it->getOperand(1));
3218 VectorParts &Op1 = getVectorValue(it->getOperand(2));
3220 Value *ScalarCond = (VF == 1) ? Cond[0] :
3221 Builder.CreateExtractElement(Cond[0], Builder.getInt32(0));
3223 for (unsigned Part = 0; Part < UF; ++Part) {
3224 Entry[Part] = Builder.CreateSelect(
3225 InvariantCond ? ScalarCond : Cond[Part],
3230 propagateMetadata(Entry, it);
3234 case Instruction::ICmp:
3235 case Instruction::FCmp: {
3236 // Widen compares. Generate vector compares.
3237 bool FCmp = (it->getOpcode() == Instruction::FCmp);
3238 CmpInst *Cmp = dyn_cast<CmpInst>(it);
3239 setDebugLocFromInst(Builder, it);
3240 VectorParts &A = getVectorValue(it->getOperand(0));
3241 VectorParts &B = getVectorValue(it->getOperand(1));
3242 for (unsigned Part = 0; Part < UF; ++Part) {
3245 C = Builder.CreateFCmp(Cmp->getPredicate(), A[Part], B[Part]);
3247 C = Builder.CreateICmp(Cmp->getPredicate(), A[Part], B[Part]);
3251 propagateMetadata(Entry, it);
3255 case Instruction::Store:
3256 case Instruction::Load:
3257 vectorizeMemoryInstruction(it);
3259 case Instruction::ZExt:
3260 case Instruction::SExt:
3261 case Instruction::FPToUI:
3262 case Instruction::FPToSI:
3263 case Instruction::FPExt:
3264 case Instruction::PtrToInt:
3265 case Instruction::IntToPtr:
3266 case Instruction::SIToFP:
3267 case Instruction::UIToFP:
3268 case Instruction::Trunc:
3269 case Instruction::FPTrunc:
3270 case Instruction::BitCast: {
3271 CastInst *CI = dyn_cast<CastInst>(it);
3272 setDebugLocFromInst(Builder, it);
3273 /// Optimize the special case where the source is the induction
3274 /// variable. Notice that we can only optimize the 'trunc' case
3275 /// because: a. FP conversions lose precision, b. sext/zext may wrap,
3276 /// c. other casts depend on pointer size.
3277 if (CI->getOperand(0) == OldInduction &&
3278 it->getOpcode() == Instruction::Trunc) {
3279 Value *ScalarCast = Builder.CreateCast(CI->getOpcode(), Induction,
3281 Value *Broadcasted = getBroadcastInstrs(ScalarCast);
3282 LoopVectorizationLegality::InductionInfo II =
3283 Legal->getInductionVars()->lookup(OldInduction);
3285 ConstantInt::getSigned(CI->getType(), II.StepValue->getSExtValue());
3286 for (unsigned Part = 0; Part < UF; ++Part)
3287 Entry[Part] = getStepVector(Broadcasted, VF * Part, Step);
3288 propagateMetadata(Entry, it);
3291 /// Vectorize casts.
3292 Type *DestTy = (VF == 1) ? CI->getType() :
3293 VectorType::get(CI->getType(), VF);
3295 VectorParts &A = getVectorValue(it->getOperand(0));
3296 for (unsigned Part = 0; Part < UF; ++Part)
3297 Entry[Part] = Builder.CreateCast(CI->getOpcode(), A[Part], DestTy);
3298 propagateMetadata(Entry, it);
3302 case Instruction::Call: {
3303 // Ignore dbg intrinsics.
3304 if (isa<DbgInfoIntrinsic>(it))
3306 setDebugLocFromInst(Builder, it);
3308 Module *M = BB->getParent()->getParent();
3309 CallInst *CI = cast<CallInst>(it);
3311 StringRef FnName = CI->getCalledFunction()->getName();
3312 Function *F = CI->getCalledFunction();
3313 Type *RetTy = ToVectorTy(CI->getType(), VF);
3314 SmallVector<Type *, 4> Tys;
3315 for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i)
3316 Tys.push_back(ToVectorTy(CI->getArgOperand(i)->getType(), VF));
3318 Intrinsic::ID ID = getIntrinsicIDForCall(CI, TLI);
3320 (ID == Intrinsic::assume || ID == Intrinsic::lifetime_end ||
3321 ID == Intrinsic::lifetime_start)) {
3322 scalarizeInstruction(it);
3325 // The flag shows whether we use Intrinsic or a usual Call for vectorized
3326 // version of the instruction.
3327 // Is it beneficial to perform intrinsic call compared to lib call?
3328 bool NeedToScalarize;
3329 unsigned CallCost = getVectorCallCost(CI, VF, *TTI, TLI, NeedToScalarize);
3330 bool UseVectorIntrinsic =
3331 ID && getVectorIntrinsicCost(CI, VF, *TTI, TLI) <= CallCost;
3332 if (!UseVectorIntrinsic && NeedToScalarize) {
3333 scalarizeInstruction(it);
3337 for (unsigned Part = 0; Part < UF; ++Part) {
3338 SmallVector<Value *, 4> Args;
3339 for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) {
3340 Value *Arg = CI->getArgOperand(i);
3341 // Some intrinsics have a scalar argument - don't replace it with a
3343 if (!UseVectorIntrinsic || !hasVectorInstrinsicScalarOpd(ID, i)) {
3344 VectorParts &VectorArg = getVectorValue(CI->getArgOperand(i));
3345 Arg = VectorArg[Part];
3347 Args.push_back(Arg);
3351 if (UseVectorIntrinsic) {
3352 // Use vector version of the intrinsic.
3353 Type *TysForDecl[] = {CI->getType()};
3355 TysForDecl[0] = VectorType::get(CI->getType()->getScalarType(), VF);
3356 VectorF = Intrinsic::getDeclaration(M, ID, TysForDecl);
3358 // Use vector version of the library call.
3359 StringRef VFnName = TLI->getVectorizedFunction(FnName, VF);
3360 assert(!VFnName.empty() && "Vector function name is empty.");
3361 VectorF = M->getFunction(VFnName);
3363 // Generate a declaration
3364 FunctionType *FTy = FunctionType::get(RetTy, Tys, false);
3366 Function::Create(FTy, Function::ExternalLinkage, VFnName, M);
3367 VectorF->copyAttributesFrom(F);
3370 assert(VectorF && "Can't create vector function.");
3371 Entry[Part] = Builder.CreateCall(VectorF, Args);
3374 propagateMetadata(Entry, it);
3379 // All other instructions are unsupported. Scalarize them.
3380 scalarizeInstruction(it);
3383 }// end of for_each instr.
3386 void InnerLoopVectorizer::updateAnalysis() {
3387 // Forget the original basic block.
3388 SE->forgetLoop(OrigLoop);
3390 // Update the dominator tree information.
3391 assert(DT->properlyDominates(LoopBypassBlocks.front(), LoopExitBlock) &&
3392 "Entry does not dominate exit.");
3394 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I)
3395 DT->addNewBlock(LoopBypassBlocks[I], LoopBypassBlocks[I-1]);
3396 DT->addNewBlock(LoopVectorPreHeader, LoopBypassBlocks.back());
3398 // Due to if predication of stores we might create a sequence of "if(pred)
3399 // a[i] = ...; " blocks.
3400 for (unsigned i = 0, e = LoopVectorBody.size(); i != e; ++i) {
3402 DT->addNewBlock(LoopVectorBody[0], LoopVectorPreHeader);
3403 else if (isPredicatedBlock(i)) {
3404 DT->addNewBlock(LoopVectorBody[i], LoopVectorBody[i-1]);
3406 DT->addNewBlock(LoopVectorBody[i], LoopVectorBody[i-2]);
3410 DT->addNewBlock(LoopMiddleBlock, LoopBypassBlocks[1]);
3411 DT->addNewBlock(LoopScalarPreHeader, LoopBypassBlocks[0]);
3412 DT->changeImmediateDominator(LoopScalarBody, LoopScalarPreHeader);
3413 DT->changeImmediateDominator(LoopExitBlock, LoopBypassBlocks[0]);
3415 DEBUG(DT->verifyDomTree());
3418 /// \brief Check whether it is safe to if-convert this phi node.
3420 /// Phi nodes with constant expressions that can trap are not safe to if
3422 static bool canIfConvertPHINodes(BasicBlock *BB) {
3423 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
3424 PHINode *Phi = dyn_cast<PHINode>(I);
3427 for (unsigned p = 0, e = Phi->getNumIncomingValues(); p != e; ++p)
3428 if (Constant *C = dyn_cast<Constant>(Phi->getIncomingValue(p)))
3435 bool LoopVectorizationLegality::canVectorizeWithIfConvert() {
3436 if (!EnableIfConversion) {
3437 emitAnalysis(VectorizationReport() << "if-conversion is disabled");
3441 assert(TheLoop->getNumBlocks() > 1 && "Single block loops are vectorizable");
3443 // A list of pointers that we can safely read and write to.
3444 SmallPtrSet<Value *, 8> SafePointes;
3446 // Collect safe addresses.
3447 for (Loop::block_iterator BI = TheLoop->block_begin(),
3448 BE = TheLoop->block_end(); BI != BE; ++BI) {
3449 BasicBlock *BB = *BI;
3451 if (blockNeedsPredication(BB))
3454 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
3455 if (LoadInst *LI = dyn_cast<LoadInst>(I))
3456 SafePointes.insert(LI->getPointerOperand());
3457 else if (StoreInst *SI = dyn_cast<StoreInst>(I))
3458 SafePointes.insert(SI->getPointerOperand());
3462 // Collect the blocks that need predication.
3463 BasicBlock *Header = TheLoop->getHeader();
3464 for (Loop::block_iterator BI = TheLoop->block_begin(),
3465 BE = TheLoop->block_end(); BI != BE; ++BI) {
3466 BasicBlock *BB = *BI;
3468 // We don't support switch statements inside loops.
3469 if (!isa<BranchInst>(BB->getTerminator())) {
3470 emitAnalysis(VectorizationReport(BB->getTerminator())
3471 << "loop contains a switch statement");
3475 // We must be able to predicate all blocks that need to be predicated.
3476 if (blockNeedsPredication(BB)) {
3477 if (!blockCanBePredicated(BB, SafePointes)) {
3478 emitAnalysis(VectorizationReport(BB->getTerminator())
3479 << "control flow cannot be substituted for a select");
3482 } else if (BB != Header && !canIfConvertPHINodes(BB)) {
3483 emitAnalysis(VectorizationReport(BB->getTerminator())
3484 << "control flow cannot be substituted for a select");
3489 // We can if-convert this loop.
3493 bool LoopVectorizationLegality::canVectorize() {
3494 // We must have a loop in canonical form. Loops with indirectbr in them cannot
3495 // be canonicalized.
3496 if (!TheLoop->getLoopPreheader()) {
3498 VectorizationReport() <<
3499 "loop control flow is not understood by vectorizer");
3503 // We can only vectorize innermost loops.
3504 if (!TheLoop->getSubLoopsVector().empty()) {
3505 emitAnalysis(VectorizationReport() << "loop is not the innermost loop");
3509 // We must have a single backedge.
3510 if (TheLoop->getNumBackEdges() != 1) {
3512 VectorizationReport() <<
3513 "loop control flow is not understood by vectorizer");
3517 // We must have a single exiting block.
3518 if (!TheLoop->getExitingBlock()) {
3520 VectorizationReport() <<
3521 "loop control flow is not understood by vectorizer");
3525 // We only handle bottom-tested loops, i.e. loop in which the condition is
3526 // checked at the end of each iteration. With that we can assume that all
3527 // instructions in the loop are executed the same number of times.
3528 if (TheLoop->getExitingBlock() != TheLoop->getLoopLatch()) {
3530 VectorizationReport() <<
3531 "loop control flow is not understood by vectorizer");
3535 // We need to have a loop header.
3536 DEBUG(dbgs() << "LV: Found a loop: " <<
3537 TheLoop->getHeader()->getName() << '\n');
3539 // Check if we can if-convert non-single-bb loops.
3540 unsigned NumBlocks = TheLoop->getNumBlocks();
3541 if (NumBlocks != 1 && !canVectorizeWithIfConvert()) {
3542 DEBUG(dbgs() << "LV: Can't if-convert the loop.\n");
3546 // ScalarEvolution needs to be able to find the exit count.
3547 const SCEV *ExitCount = SE->getBackedgeTakenCount(TheLoop);
3548 if (ExitCount == SE->getCouldNotCompute()) {
3549 emitAnalysis(VectorizationReport() <<
3550 "could not determine number of loop iterations");
3551 DEBUG(dbgs() << "LV: SCEV could not compute the loop exit count.\n");
3555 // Check if we can vectorize the instructions and CFG in this loop.
3556 if (!canVectorizeInstrs()) {
3557 DEBUG(dbgs() << "LV: Can't vectorize the instructions or CFG\n");
3561 // Go over each instruction and look at memory deps.
3562 if (!canVectorizeMemory()) {
3563 DEBUG(dbgs() << "LV: Can't vectorize due to memory conflicts\n");
3567 // Collect all of the variables that remain uniform after vectorization.
3568 collectLoopUniforms();
3570 DEBUG(dbgs() << "LV: We can vectorize this loop" <<
3571 (LAI->getRuntimePointerCheck()->Need ? " (with a runtime bound check)" :
3575 // Okay! We can vectorize. At this point we don't have any other mem analysis
3576 // which may limit our maximum vectorization factor, so just return true with
3581 static Type *convertPointerToIntegerType(const DataLayout &DL, Type *Ty) {
3582 if (Ty->isPointerTy())
3583 return DL.getIntPtrType(Ty);
3585 // It is possible that char's or short's overflow when we ask for the loop's
3586 // trip count, work around this by changing the type size.
3587 if (Ty->getScalarSizeInBits() < 32)
3588 return Type::getInt32Ty(Ty->getContext());
3593 static Type* getWiderType(const DataLayout &DL, Type *Ty0, Type *Ty1) {
3594 Ty0 = convertPointerToIntegerType(DL, Ty0);
3595 Ty1 = convertPointerToIntegerType(DL, Ty1);
3596 if (Ty0->getScalarSizeInBits() > Ty1->getScalarSizeInBits())
3601 /// \brief Check that the instruction has outside loop users and is not an
3602 /// identified reduction variable.
3603 static bool hasOutsideLoopUser(const Loop *TheLoop, Instruction *Inst,
3604 SmallPtrSetImpl<Value *> &Reductions) {
3605 // Reduction instructions are allowed to have exit users. All other
3606 // instructions must not have external users.
3607 if (!Reductions.count(Inst))
3608 //Check that all of the users of the loop are inside the BB.
3609 for (User *U : Inst->users()) {
3610 Instruction *UI = cast<Instruction>(U);
3611 // This user may be a reduction exit value.
3612 if (!TheLoop->contains(UI)) {
3613 DEBUG(dbgs() << "LV: Found an outside user for : " << *UI << '\n');
3620 bool LoopVectorizationLegality::canVectorizeInstrs() {
3621 BasicBlock *PreHeader = TheLoop->getLoopPreheader();
3622 BasicBlock *Header = TheLoop->getHeader();
3624 // Look for the attribute signaling the absence of NaNs.
3625 Function &F = *Header->getParent();
3626 const DataLayout &DL = F.getParent()->getDataLayout();
3627 if (F.hasFnAttribute("no-nans-fp-math"))
3629 F.getFnAttribute("no-nans-fp-math").getValueAsString() == "true";
3631 // For each block in the loop.
3632 for (Loop::block_iterator bb = TheLoop->block_begin(),
3633 be = TheLoop->block_end(); bb != be; ++bb) {
3635 // Scan the instructions in the block and look for hazards.
3636 for (BasicBlock::iterator it = (*bb)->begin(), e = (*bb)->end(); it != e;
3639 if (PHINode *Phi = dyn_cast<PHINode>(it)) {
3640 Type *PhiTy = Phi->getType();
3641 // Check that this PHI type is allowed.
3642 if (!PhiTy->isIntegerTy() &&
3643 !PhiTy->isFloatingPointTy() &&
3644 !PhiTy->isPointerTy()) {
3645 emitAnalysis(VectorizationReport(it)
3646 << "loop control flow is not understood by vectorizer");
3647 DEBUG(dbgs() << "LV: Found an non-int non-pointer PHI.\n");
3651 // If this PHINode is not in the header block, then we know that we
3652 // can convert it to select during if-conversion. No need to check if
3653 // the PHIs in this block are induction or reduction variables.
3654 if (*bb != Header) {
3655 // Check that this instruction has no outside users or is an
3656 // identified reduction value with an outside user.
3657 if (!hasOutsideLoopUser(TheLoop, it, AllowedExit))
3659 emitAnalysis(VectorizationReport(it) <<
3660 "value could not be identified as "
3661 "an induction or reduction variable");
3665 // We only allow if-converted PHIs with exactly two incoming values.
3666 if (Phi->getNumIncomingValues() != 2) {
3667 emitAnalysis(VectorizationReport(it)
3668 << "control flow not understood by vectorizer");
3669 DEBUG(dbgs() << "LV: Found an invalid PHI.\n");
3673 // This is the value coming from the preheader.
3674 Value *StartValue = Phi->getIncomingValueForBlock(PreHeader);
3675 ConstantInt *StepValue = nullptr;
3676 // Check if this is an induction variable.
3677 InductionKind IK = isInductionVariable(Phi, StepValue);
3679 if (IK_NoInduction != IK) {
3680 // Get the widest type.
3682 WidestIndTy = convertPointerToIntegerType(DL, PhiTy);
3684 WidestIndTy = getWiderType(DL, PhiTy, WidestIndTy);
3686 // Int inductions are special because we only allow one IV.
3687 if (IK == IK_IntInduction && StepValue->isOne()) {
3688 // Use the phi node with the widest type as induction. Use the last
3689 // one if there are multiple (no good reason for doing this other
3690 // than it is expedient).
3691 if (!Induction || PhiTy == WidestIndTy)
3695 DEBUG(dbgs() << "LV: Found an induction variable.\n");
3696 Inductions[Phi] = InductionInfo(StartValue, IK, StepValue);
3698 // Until we explicitly handle the case of an induction variable with
3699 // an outside loop user we have to give up vectorizing this loop.
3700 if (hasOutsideLoopUser(TheLoop, it, AllowedExit)) {
3701 emitAnalysis(VectorizationReport(it) <<
3702 "use of induction value outside of the "
3703 "loop is not handled by vectorizer");
3710 if (AddReductionVar(Phi, RK_IntegerAdd)) {
3711 DEBUG(dbgs() << "LV: Found an ADD reduction PHI."<< *Phi <<"\n");
3714 if (AddReductionVar(Phi, RK_IntegerMult)) {
3715 DEBUG(dbgs() << "LV: Found a MUL reduction PHI."<< *Phi <<"\n");
3718 if (AddReductionVar(Phi, RK_IntegerOr)) {
3719 DEBUG(dbgs() << "LV: Found an OR reduction PHI."<< *Phi <<"\n");
3722 if (AddReductionVar(Phi, RK_IntegerAnd)) {
3723 DEBUG(dbgs() << "LV: Found an AND reduction PHI."<< *Phi <<"\n");
3726 if (AddReductionVar(Phi, RK_IntegerXor)) {
3727 DEBUG(dbgs() << "LV: Found a XOR reduction PHI."<< *Phi <<"\n");
3730 if (AddReductionVar(Phi, RK_IntegerMinMax)) {
3731 DEBUG(dbgs() << "LV: Found a MINMAX reduction PHI."<< *Phi <<"\n");
3734 if (AddReductionVar(Phi, RK_FloatMult)) {
3735 DEBUG(dbgs() << "LV: Found an FMult reduction PHI."<< *Phi <<"\n");
3738 if (AddReductionVar(Phi, RK_FloatAdd)) {
3739 DEBUG(dbgs() << "LV: Found an FAdd reduction PHI."<< *Phi <<"\n");
3742 if (AddReductionVar(Phi, RK_FloatMinMax)) {
3743 DEBUG(dbgs() << "LV: Found an float MINMAX reduction PHI."<< *Phi <<
3748 emitAnalysis(VectorizationReport(it) <<
3749 "value that could not be identified as "
3750 "reduction is used outside the loop");
3751 DEBUG(dbgs() << "LV: Found an unidentified PHI."<< *Phi <<"\n");
3753 }// end of PHI handling
3755 // We handle calls that:
3756 // * Are debug info intrinsics.
3757 // * Have a mapping to an IR intrinsic.
3758 // * Have a vector version available.
3759 CallInst *CI = dyn_cast<CallInst>(it);
3760 if (CI && !getIntrinsicIDForCall(CI, TLI) && !isa<DbgInfoIntrinsic>(CI) &&
3761 !(CI->getCalledFunction() && TLI &&
3762 TLI->isFunctionVectorizable(CI->getCalledFunction()->getName()))) {
3763 emitAnalysis(VectorizationReport(it) <<
3764 "call instruction cannot be vectorized");
3765 DEBUG(dbgs() << "LV: Found a non-intrinsic, non-libfunc callsite.\n");
3769 // Intrinsics such as powi,cttz and ctlz are legal to vectorize if the
3770 // second argument is the same (i.e. loop invariant)
3772 hasVectorInstrinsicScalarOpd(getIntrinsicIDForCall(CI, TLI), 1)) {
3773 if (!SE->isLoopInvariant(SE->getSCEV(CI->getOperand(1)), TheLoop)) {
3774 emitAnalysis(VectorizationReport(it)
3775 << "intrinsic instruction cannot be vectorized");
3776 DEBUG(dbgs() << "LV: Found unvectorizable intrinsic " << *CI << "\n");
3781 // Check that the instruction return type is vectorizable.
3782 // Also, we can't vectorize extractelement instructions.
3783 if ((!VectorType::isValidElementType(it->getType()) &&
3784 !it->getType()->isVoidTy()) || isa<ExtractElementInst>(it)) {
3785 emitAnalysis(VectorizationReport(it)
3786 << "instruction return type cannot be vectorized");
3787 DEBUG(dbgs() << "LV: Found unvectorizable type.\n");
3791 // Check that the stored type is vectorizable.
3792 if (StoreInst *ST = dyn_cast<StoreInst>(it)) {
3793 Type *T = ST->getValueOperand()->getType();
3794 if (!VectorType::isValidElementType(T)) {
3795 emitAnalysis(VectorizationReport(ST) <<
3796 "store instruction cannot be vectorized");
3799 if (EnableMemAccessVersioning)
3800 collectStridedAccess(ST);
3803 if (EnableMemAccessVersioning)
3804 if (LoadInst *LI = dyn_cast<LoadInst>(it))
3805 collectStridedAccess(LI);
3807 // Reduction instructions are allowed to have exit users.
3808 // All other instructions must not have external users.
3809 if (hasOutsideLoopUser(TheLoop, it, AllowedExit)) {
3810 emitAnalysis(VectorizationReport(it) <<
3811 "value cannot be used outside the loop");
3820 DEBUG(dbgs() << "LV: Did not find one integer induction var.\n");
3821 if (Inductions.empty()) {
3822 emitAnalysis(VectorizationReport()
3823 << "loop induction variable could not be identified");
3831 ///\brief Remove GEPs whose indices but the last one are loop invariant and
3832 /// return the induction operand of the gep pointer.
3833 static Value *stripGetElementPtr(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
3834 GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr);
3838 unsigned InductionOperand = getGEPInductionOperand(GEP);
3840 // Check that all of the gep indices are uniform except for our induction
3842 for (unsigned i = 0, e = GEP->getNumOperands(); i != e; ++i)
3843 if (i != InductionOperand &&
3844 !SE->isLoopInvariant(SE->getSCEV(GEP->getOperand(i)), Lp))
3846 return GEP->getOperand(InductionOperand);
3849 ///\brief Look for a cast use of the passed value.
3850 static Value *getUniqueCastUse(Value *Ptr, Loop *Lp, Type *Ty) {
3851 Value *UniqueCast = nullptr;
3852 for (User *U : Ptr->users()) {
3853 CastInst *CI = dyn_cast<CastInst>(U);
3854 if (CI && CI->getType() == Ty) {
3864 ///\brief Get the stride of a pointer access in a loop.
3865 /// Looks for symbolic strides "a[i*stride]". Returns the symbolic stride as a
3866 /// pointer to the Value, or null otherwise.
3867 static Value *getStrideFromPointer(Value *Ptr, ScalarEvolution *SE, Loop *Lp) {
3868 const PointerType *PtrTy = dyn_cast<PointerType>(Ptr->getType());
3869 if (!PtrTy || PtrTy->isAggregateType())
3872 // Try to remove a gep instruction to make the pointer (actually index at this
3873 // point) easier analyzable. If OrigPtr is equal to Ptr we are analzying the
3874 // pointer, otherwise, we are analyzing the index.
3875 Value *OrigPtr = Ptr;
3877 // The size of the pointer access.
3878 int64_t PtrAccessSize = 1;
3880 Ptr = stripGetElementPtr(Ptr, SE, Lp);
3881 const SCEV *V = SE->getSCEV(Ptr);
3885 while (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(V))
3886 V = C->getOperand();
3888 const SCEVAddRecExpr *S = dyn_cast<SCEVAddRecExpr>(V);
3892 V = S->getStepRecurrence(*SE);
3896 // Strip off the size of access multiplication if we are still analyzing the
3898 if (OrigPtr == Ptr) {
3899 const DataLayout &DL = Lp->getHeader()->getModule()->getDataLayout();
3900 DL.getTypeAllocSize(PtrTy->getElementType());
3901 if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(V)) {
3902 if (M->getOperand(0)->getSCEVType() != scConstant)
3905 const APInt &APStepVal =
3906 cast<SCEVConstant>(M->getOperand(0))->getValue()->getValue();
3908 // Huge step value - give up.
3909 if (APStepVal.getBitWidth() > 64)
3912 int64_t StepVal = APStepVal.getSExtValue();
3913 if (PtrAccessSize != StepVal)
3915 V = M->getOperand(1);
3920 Type *StripedOffRecurrenceCast = nullptr;
3921 if (const SCEVCastExpr *C = dyn_cast<SCEVCastExpr>(V)) {
3922 StripedOffRecurrenceCast = C->getType();
3923 V = C->getOperand();
3926 // Look for the loop invariant symbolic value.
3927 const SCEVUnknown *U = dyn_cast<SCEVUnknown>(V);
3931 Value *Stride = U->getValue();
3932 if (!Lp->isLoopInvariant(Stride))
3935 // If we have stripped off the recurrence cast we have to make sure that we
3936 // return the value that is used in this loop so that we can replace it later.
3937 if (StripedOffRecurrenceCast)
3938 Stride = getUniqueCastUse(Stride, Lp, StripedOffRecurrenceCast);
3943 void LoopVectorizationLegality::collectStridedAccess(Value *MemAccess) {
3944 Value *Ptr = nullptr;
3945 if (LoadInst *LI = dyn_cast<LoadInst>(MemAccess))
3946 Ptr = LI->getPointerOperand();
3947 else if (StoreInst *SI = dyn_cast<StoreInst>(MemAccess))
3948 Ptr = SI->getPointerOperand();
3952 Value *Stride = getStrideFromPointer(Ptr, SE, TheLoop);
3956 DEBUG(dbgs() << "LV: Found a strided access that we can version");
3957 DEBUG(dbgs() << " Ptr: " << *Ptr << " Stride: " << *Stride << "\n");
3958 Strides[Ptr] = Stride;
3959 StrideSet.insert(Stride);
3962 void LoopVectorizationLegality::collectLoopUniforms() {
3963 // We now know that the loop is vectorizable!
3964 // Collect variables that will remain uniform after vectorization.
3965 std::vector<Value*> Worklist;
3966 BasicBlock *Latch = TheLoop->getLoopLatch();
3968 // Start with the conditional branch and walk up the block.
3969 Worklist.push_back(Latch->getTerminator()->getOperand(0));
3971 // Also add all consecutive pointer values; these values will be uniform
3972 // after vectorization (and subsequent cleanup) and, until revectorization is
3973 // supported, all dependencies must also be uniform.
3974 for (Loop::block_iterator B = TheLoop->block_begin(),
3975 BE = TheLoop->block_end(); B != BE; ++B)
3976 for (BasicBlock::iterator I = (*B)->begin(), IE = (*B)->end();
3978 if (I->getType()->isPointerTy() && isConsecutivePtr(I))
3979 Worklist.insert(Worklist.end(), I->op_begin(), I->op_end());
3981 while (!Worklist.empty()) {
3982 Instruction *I = dyn_cast<Instruction>(Worklist.back());
3983 Worklist.pop_back();
3985 // Look at instructions inside this loop.
3986 // Stop when reaching PHI nodes.
3987 // TODO: we need to follow values all over the loop, not only in this block.
3988 if (!I || !TheLoop->contains(I) || isa<PHINode>(I))
3991 // This is a known uniform.
3994 // Insert all operands.
3995 Worklist.insert(Worklist.end(), I->op_begin(), I->op_end());
3999 bool LoopVectorizationLegality::canVectorizeMemory() {
4000 LAI = &LAA->getInfo(TheLoop, Strides);
4001 auto &OptionalReport = LAI->getReport();
4003 emitAnalysis(VectorizationReport(*OptionalReport));
4004 if (!LAI->canVectorizeMemory())
4007 if (LAI->getNumRuntimePointerChecks() >
4008 VectorizerParams::RuntimeMemoryCheckThreshold) {
4009 emitAnalysis(VectorizationReport()
4010 << LAI->getNumRuntimePointerChecks() << " exceeds limit of "
4011 << VectorizerParams::RuntimeMemoryCheckThreshold
4012 << " dependent memory operations checked at runtime");
4013 DEBUG(dbgs() << "LV: Too many memory checks needed.\n");
4019 static bool hasMultipleUsesOf(Instruction *I,
4020 SmallPtrSetImpl<Instruction *> &Insts) {
4021 unsigned NumUses = 0;
4022 for(User::op_iterator Use = I->op_begin(), E = I->op_end(); Use != E; ++Use) {
4023 if (Insts.count(dyn_cast<Instruction>(*Use)))
4032 static bool areAllUsesIn(Instruction *I, SmallPtrSetImpl<Instruction *> &Set) {
4033 for(User::op_iterator Use = I->op_begin(), E = I->op_end(); Use != E; ++Use)
4034 if (!Set.count(dyn_cast<Instruction>(*Use)))
4039 bool LoopVectorizationLegality::AddReductionVar(PHINode *Phi,
4040 ReductionKind Kind) {
4041 if (Phi->getNumIncomingValues() != 2)
4044 // Reduction variables are only found in the loop header block.
4045 if (Phi->getParent() != TheLoop->getHeader())
4048 // Obtain the reduction start value from the value that comes from the loop
4050 Value *RdxStart = Phi->getIncomingValueForBlock(TheLoop->getLoopPreheader());
4052 // ExitInstruction is the single value which is used outside the loop.
4053 // We only allow for a single reduction value to be used outside the loop.
4054 // This includes users of the reduction, variables (which form a cycle
4055 // which ends in the phi node).
4056 Instruction *ExitInstruction = nullptr;
4057 // Indicates that we found a reduction operation in our scan.
4058 bool FoundReduxOp = false;
4060 // We start with the PHI node and scan for all of the users of this
4061 // instruction. All users must be instructions that can be used as reduction
4062 // variables (such as ADD). We must have a single out-of-block user. The cycle
4063 // must include the original PHI.
4064 bool FoundStartPHI = false;
4066 // To recognize min/max patterns formed by a icmp select sequence, we store
4067 // the number of instruction we saw from the recognized min/max pattern,
4068 // to make sure we only see exactly the two instructions.
4069 unsigned NumCmpSelectPatternInst = 0;
4070 ReductionInstDesc ReduxDesc(false, nullptr);
4072 SmallPtrSet<Instruction *, 8> VisitedInsts;
4073 SmallVector<Instruction *, 8> Worklist;
4074 Worklist.push_back(Phi);
4075 VisitedInsts.insert(Phi);
4077 // A value in the reduction can be used:
4078 // - By the reduction:
4079 // - Reduction operation:
4080 // - One use of reduction value (safe).
4081 // - Multiple use of reduction value (not safe).
4083 // - All uses of the PHI must be the reduction (safe).
4084 // - Otherwise, not safe.
4085 // - By one instruction outside of the loop (safe).
4086 // - By further instructions outside of the loop (not safe).
4087 // - By an instruction that is not part of the reduction (not safe).
4089 // * An instruction type other than PHI or the reduction operation.
4090 // * A PHI in the header other than the initial PHI.
4091 while (!Worklist.empty()) {
4092 Instruction *Cur = Worklist.back();
4093 Worklist.pop_back();
4096 // If the instruction has no users then this is a broken chain and can't be
4097 // a reduction variable.
4098 if (Cur->use_empty())
4101 bool IsAPhi = isa<PHINode>(Cur);
4103 // A header PHI use other than the original PHI.
4104 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent())
4107 // Reductions of instructions such as Div, and Sub is only possible if the
4108 // LHS is the reduction variable.
4109 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) &&
4110 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) &&
4111 !VisitedInsts.count(dyn_cast<Instruction>(Cur->getOperand(0))))
4114 // Any reduction instruction must be of one of the allowed kinds.
4115 ReduxDesc = isReductionInstr(Cur, Kind, ReduxDesc);
4116 if (!ReduxDesc.IsReduction)
4119 // A reduction operation must only have one use of the reduction value.
4120 if (!IsAPhi && Kind != RK_IntegerMinMax && Kind != RK_FloatMinMax &&
4121 hasMultipleUsesOf(Cur, VisitedInsts))
4124 // All inputs to a PHI node must be a reduction value.
4125 if(IsAPhi && Cur != Phi && !areAllUsesIn(Cur, VisitedInsts))
4128 if (Kind == RK_IntegerMinMax && (isa<ICmpInst>(Cur) ||
4129 isa<SelectInst>(Cur)))
4130 ++NumCmpSelectPatternInst;
4131 if (Kind == RK_FloatMinMax && (isa<FCmpInst>(Cur) ||
4132 isa<SelectInst>(Cur)))
4133 ++NumCmpSelectPatternInst;
4135 // Check whether we found a reduction operator.
4136 FoundReduxOp |= !IsAPhi;
4138 // Process users of current instruction. Push non-PHI nodes after PHI nodes
4139 // onto the stack. This way we are going to have seen all inputs to PHI
4140 // nodes once we get to them.
4141 SmallVector<Instruction *, 8> NonPHIs;
4142 SmallVector<Instruction *, 8> PHIs;
4143 for (User *U : Cur->users()) {
4144 Instruction *UI = cast<Instruction>(U);
4146 // Check if we found the exit user.
4147 BasicBlock *Parent = UI->getParent();
4148 if (!TheLoop->contains(Parent)) {
4149 // Exit if you find multiple outside users or if the header phi node is
4150 // being used. In this case the user uses the value of the previous
4151 // iteration, in which case we would loose "VF-1" iterations of the
4152 // reduction operation if we vectorize.
4153 if (ExitInstruction != nullptr || Cur == Phi)
4156 // The instruction used by an outside user must be the last instruction
4157 // before we feed back to the reduction phi. Otherwise, we loose VF-1
4158 // operations on the value.
4159 if (std::find(Phi->op_begin(), Phi->op_end(), Cur) == Phi->op_end())
4162 ExitInstruction = Cur;
4166 // Process instructions only once (termination). Each reduction cycle
4167 // value must only be used once, except by phi nodes and min/max
4168 // reductions which are represented as a cmp followed by a select.
4169 ReductionInstDesc IgnoredVal(false, nullptr);
4170 if (VisitedInsts.insert(UI).second) {
4171 if (isa<PHINode>(UI))
4174 NonPHIs.push_back(UI);
4175 } else if (!isa<PHINode>(UI) &&
4176 ((!isa<FCmpInst>(UI) &&
4177 !isa<ICmpInst>(UI) &&
4178 !isa<SelectInst>(UI)) ||
4179 !isMinMaxSelectCmpPattern(UI, IgnoredVal).IsReduction))
4182 // Remember that we completed the cycle.
4184 FoundStartPHI = true;
4186 Worklist.append(PHIs.begin(), PHIs.end());
4187 Worklist.append(NonPHIs.begin(), NonPHIs.end());
4190 // This means we have seen one but not the other instruction of the
4191 // pattern or more than just a select and cmp.
4192 if ((Kind == RK_IntegerMinMax || Kind == RK_FloatMinMax) &&
4193 NumCmpSelectPatternInst != 2)
4196 if (!FoundStartPHI || !FoundReduxOp || !ExitInstruction)
4199 // We found a reduction var if we have reached the original phi node and we
4200 // only have a single instruction with out-of-loop users.
4202 // This instruction is allowed to have out-of-loop users.
4203 AllowedExit.insert(ExitInstruction);
4205 // Save the description of this reduction variable.
4206 ReductionDescriptor RD(RdxStart, ExitInstruction, Kind,
4207 ReduxDesc.MinMaxKind);
4208 Reductions[Phi] = RD;
4209 // We've ended the cycle. This is a reduction variable if we have an
4210 // outside user and it has a binary op.
4215 /// Returns true if the instruction is a Select(ICmp(X, Y), X, Y) instruction
4216 /// pattern corresponding to a min(X, Y) or max(X, Y).
4217 LoopVectorizationLegality::ReductionInstDesc
4218 LoopVectorizationLegality::isMinMaxSelectCmpPattern(Instruction *I,
4219 ReductionInstDesc &Prev) {
4221 assert((isa<ICmpInst>(I) || isa<FCmpInst>(I) || isa<SelectInst>(I)) &&
4222 "Expect a select instruction");
4223 Instruction *Cmp = nullptr;
4224 SelectInst *Select = nullptr;
4226 // We must handle the select(cmp()) as a single instruction. Advance to the
4228 if ((Cmp = dyn_cast<ICmpInst>(I)) || (Cmp = dyn_cast<FCmpInst>(I))) {
4229 if (!Cmp->hasOneUse() || !(Select = dyn_cast<SelectInst>(*I->user_begin())))
4230 return ReductionInstDesc(false, I);
4231 return ReductionInstDesc(Select, Prev.MinMaxKind);
4234 // Only handle single use cases for now.
4235 if (!(Select = dyn_cast<SelectInst>(I)))
4236 return ReductionInstDesc(false, I);
4237 if (!(Cmp = dyn_cast<ICmpInst>(I->getOperand(0))) &&
4238 !(Cmp = dyn_cast<FCmpInst>(I->getOperand(0))))
4239 return ReductionInstDesc(false, I);
4240 if (!Cmp->hasOneUse())
4241 return ReductionInstDesc(false, I);
4246 // Look for a min/max pattern.
4247 if (m_UMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4248 return ReductionInstDesc(Select, MRK_UIntMin);
4249 else if (m_UMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4250 return ReductionInstDesc(Select, MRK_UIntMax);
4251 else if (m_SMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4252 return ReductionInstDesc(Select, MRK_SIntMax);
4253 else if (m_SMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4254 return ReductionInstDesc(Select, MRK_SIntMin);
4255 else if (m_OrdFMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4256 return ReductionInstDesc(Select, MRK_FloatMin);
4257 else if (m_OrdFMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4258 return ReductionInstDesc(Select, MRK_FloatMax);
4259 else if (m_UnordFMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4260 return ReductionInstDesc(Select, MRK_FloatMin);
4261 else if (m_UnordFMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4262 return ReductionInstDesc(Select, MRK_FloatMax);
4264 return ReductionInstDesc(false, I);
4267 LoopVectorizationLegality::ReductionInstDesc
4268 LoopVectorizationLegality::isReductionInstr(Instruction *I,
4270 ReductionInstDesc &Prev) {
4271 bool FP = I->getType()->isFloatingPointTy();
4272 bool FastMath = FP && I->hasUnsafeAlgebra();
4273 switch (I->getOpcode()) {
4275 return ReductionInstDesc(false, I);
4276 case Instruction::PHI:
4277 if (FP && (Kind != RK_FloatMult && Kind != RK_FloatAdd &&
4278 Kind != RK_FloatMinMax))
4279 return ReductionInstDesc(false, I);
4280 return ReductionInstDesc(I, Prev.MinMaxKind);
4281 case Instruction::Sub:
4282 case Instruction::Add:
4283 return ReductionInstDesc(Kind == RK_IntegerAdd, I);
4284 case Instruction::Mul:
4285 return ReductionInstDesc(Kind == RK_IntegerMult, I);
4286 case Instruction::And:
4287 return ReductionInstDesc(Kind == RK_IntegerAnd, I);
4288 case Instruction::Or:
4289 return ReductionInstDesc(Kind == RK_IntegerOr, I);
4290 case Instruction::Xor:
4291 return ReductionInstDesc(Kind == RK_IntegerXor, I);
4292 case Instruction::FMul:
4293 return ReductionInstDesc(Kind == RK_FloatMult && FastMath, I);
4294 case Instruction::FSub:
4295 case Instruction::FAdd:
4296 return ReductionInstDesc(Kind == RK_FloatAdd && FastMath, I);
4297 case Instruction::FCmp:
4298 case Instruction::ICmp:
4299 case Instruction::Select:
4300 if (Kind != RK_IntegerMinMax &&
4301 (!HasFunNoNaNAttr || Kind != RK_FloatMinMax))
4302 return ReductionInstDesc(false, I);
4303 return isMinMaxSelectCmpPattern(I, Prev);
4307 LoopVectorizationLegality::InductionKind
4308 LoopVectorizationLegality::isInductionVariable(PHINode *Phi,
4309 ConstantInt *&StepValue) {
4310 Type *PhiTy = Phi->getType();
4311 // We only handle integer and pointer inductions variables.
4312 if (!PhiTy->isIntegerTy() && !PhiTy->isPointerTy())
4313 return IK_NoInduction;
4315 // Check that the PHI is consecutive.
4316 const SCEV *PhiScev = SE->getSCEV(Phi);
4317 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(PhiScev);
4319 DEBUG(dbgs() << "LV: PHI is not a poly recurrence.\n");
4320 return IK_NoInduction;
4323 const SCEV *Step = AR->getStepRecurrence(*SE);
4324 // Calculate the pointer stride and check if it is consecutive.
4325 const SCEVConstant *C = dyn_cast<SCEVConstant>(Step);
4327 return IK_NoInduction;
4329 ConstantInt *CV = C->getValue();
4330 if (PhiTy->isIntegerTy()) {
4332 return IK_IntInduction;
4335 assert(PhiTy->isPointerTy() && "The PHI must be a pointer");
4336 Type *PointerElementType = PhiTy->getPointerElementType();
4337 // The pointer stride cannot be determined if the pointer element type is not
4339 if (!PointerElementType->isSized())
4340 return IK_NoInduction;
4342 const DataLayout &DL = Phi->getModule()->getDataLayout();
4343 int64_t Size = static_cast<int64_t>(DL.getTypeAllocSize(PointerElementType));
4344 int64_t CVSize = CV->getSExtValue();
4346 return IK_NoInduction;
4347 StepValue = ConstantInt::getSigned(CV->getType(), CVSize / Size);
4348 return IK_PtrInduction;
4351 bool LoopVectorizationLegality::isInductionVariable(const Value *V) {
4352 Value *In0 = const_cast<Value*>(V);
4353 PHINode *PN = dyn_cast_or_null<PHINode>(In0);
4357 return Inductions.count(PN);
4360 bool LoopVectorizationLegality::blockNeedsPredication(BasicBlock *BB) {
4361 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT);
4364 bool LoopVectorizationLegality::blockCanBePredicated(BasicBlock *BB,
4365 SmallPtrSetImpl<Value *> &SafePtrs) {
4367 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4368 // Check that we don't have a constant expression that can trap as operand.
4369 for (Instruction::op_iterator OI = it->op_begin(), OE = it->op_end();
4371 if (Constant *C = dyn_cast<Constant>(*OI))
4375 // We might be able to hoist the load.
4376 if (it->mayReadFromMemory()) {
4377 LoadInst *LI = dyn_cast<LoadInst>(it);
4380 if (!SafePtrs.count(LI->getPointerOperand())) {
4381 if (isLegalMaskedLoad(LI->getType(), LI->getPointerOperand())) {
4382 MaskedOp.insert(LI);
4389 // We don't predicate stores at the moment.
4390 if (it->mayWriteToMemory()) {
4391 StoreInst *SI = dyn_cast<StoreInst>(it);
4392 // We only support predication of stores in basic blocks with one
4397 bool isSafePtr = (SafePtrs.count(SI->getPointerOperand()) != 0);
4398 bool isSinglePredecessor = SI->getParent()->getSinglePredecessor();
4400 if (++NumPredStores > NumberOfStoresToPredicate || !isSafePtr ||
4401 !isSinglePredecessor) {
4402 // Build a masked store if it is legal for the target, otherwise scalarize
4404 bool isLegalMaskedOp =
4405 isLegalMaskedStore(SI->getValueOperand()->getType(),
4406 SI->getPointerOperand());
4407 if (isLegalMaskedOp) {
4409 MaskedOp.insert(SI);
4418 // The instructions below can trap.
4419 switch (it->getOpcode()) {
4421 case Instruction::UDiv:
4422 case Instruction::SDiv:
4423 case Instruction::URem:
4424 case Instruction::SRem:
4432 LoopVectorizationCostModel::VectorizationFactor
4433 LoopVectorizationCostModel::selectVectorizationFactor(bool OptForSize) {
4434 // Width 1 means no vectorize
4435 VectorizationFactor Factor = { 1U, 0U };
4436 if (OptForSize && Legal->getRuntimePointerCheck()->Need) {
4437 emitAnalysis(VectorizationReport() <<
4438 "runtime pointer checks needed. Enable vectorization of this "
4439 "loop with '#pragma clang loop vectorize(enable)' when "
4440 "compiling with -Os");
4441 DEBUG(dbgs() << "LV: Aborting. Runtime ptr check is required in Os.\n");
4445 if (!EnableCondStoresVectorization && Legal->getNumPredStores()) {
4446 emitAnalysis(VectorizationReport() <<
4447 "store that is conditionally executed prevents vectorization");
4448 DEBUG(dbgs() << "LV: No vectorization. There are conditional stores.\n");
4452 // Find the trip count.
4453 unsigned TC = SE->getSmallConstantTripCount(TheLoop);
4454 DEBUG(dbgs() << "LV: Found trip count: " << TC << '\n');
4456 unsigned WidestType = getWidestType();
4457 unsigned WidestRegister = TTI.getRegisterBitWidth(true);
4458 unsigned MaxSafeDepDist = -1U;
4459 if (Legal->getMaxSafeDepDistBytes() != -1U)
4460 MaxSafeDepDist = Legal->getMaxSafeDepDistBytes() * 8;
4461 WidestRegister = ((WidestRegister < MaxSafeDepDist) ?
4462 WidestRegister : MaxSafeDepDist);
4463 unsigned MaxVectorSize = WidestRegister / WidestType;
4464 DEBUG(dbgs() << "LV: The Widest type: " << WidestType << " bits.\n");
4465 DEBUG(dbgs() << "LV: The Widest register is: "
4466 << WidestRegister << " bits.\n");
4468 if (MaxVectorSize == 0) {
4469 DEBUG(dbgs() << "LV: The target has no vector registers.\n");
4473 assert(MaxVectorSize <= 64 && "Did not expect to pack so many elements"
4474 " into one vector!");
4476 unsigned VF = MaxVectorSize;
4478 // If we optimize the program for size, avoid creating the tail loop.
4480 // If we are unable to calculate the trip count then don't try to vectorize.
4483 (VectorizationReport() <<
4484 "unable to calculate the loop count due to complex control flow");
4485 DEBUG(dbgs() << "LV: Aborting. A tail loop is required in Os.\n");
4489 // Find the maximum SIMD width that can fit within the trip count.
4490 VF = TC % MaxVectorSize;
4495 // If the trip count that we found modulo the vectorization factor is not
4496 // zero then we require a tail.
4498 emitAnalysis(VectorizationReport() <<
4499 "cannot optimize for size and vectorize at the "
4500 "same time. Enable vectorization of this loop "
4501 "with '#pragma clang loop vectorize(enable)' "
4502 "when compiling with -Os");
4503 DEBUG(dbgs() << "LV: Aborting. A tail loop is required in Os.\n");
4508 int UserVF = Hints->getWidth();
4510 assert(isPowerOf2_32(UserVF) && "VF needs to be a power of two");
4511 DEBUG(dbgs() << "LV: Using user VF " << UserVF << ".\n");
4513 Factor.Width = UserVF;
4517 float Cost = expectedCost(1);
4519 const float ScalarCost = Cost;
4522 DEBUG(dbgs() << "LV: Scalar loop costs: " << (int)ScalarCost << ".\n");
4524 bool ForceVectorization = Hints->getForce() == LoopVectorizeHints::FK_Enabled;
4525 // Ignore scalar width, because the user explicitly wants vectorization.
4526 if (ForceVectorization && VF > 1) {
4528 Cost = expectedCost(Width) / (float)Width;
4531 for (unsigned i=2; i <= VF; i*=2) {
4532 // Notice that the vector loop needs to be executed less times, so
4533 // we need to divide the cost of the vector loops by the width of
4534 // the vector elements.
4535 float VectorCost = expectedCost(i) / (float)i;
4536 DEBUG(dbgs() << "LV: Vector loop of width " << i << " costs: " <<
4537 (int)VectorCost << ".\n");
4538 if (VectorCost < Cost) {
4544 DEBUG(if (ForceVectorization && Width > 1 && Cost >= ScalarCost) dbgs()
4545 << "LV: Vectorization seems to be not beneficial, "
4546 << "but was forced by a user.\n");
4547 DEBUG(dbgs() << "LV: Selecting VF: "<< Width << ".\n");
4548 Factor.Width = Width;
4549 Factor.Cost = Width * Cost;
4553 unsigned LoopVectorizationCostModel::getWidestType() {
4554 unsigned MaxWidth = 8;
4555 const DataLayout &DL = TheFunction->getParent()->getDataLayout();
4558 for (Loop::block_iterator bb = TheLoop->block_begin(),
4559 be = TheLoop->block_end(); bb != be; ++bb) {
4560 BasicBlock *BB = *bb;
4562 // For each instruction in the loop.
4563 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4564 Type *T = it->getType();
4566 // Ignore ephemeral values.
4567 if (EphValues.count(it))
4570 // Only examine Loads, Stores and PHINodes.
4571 if (!isa<LoadInst>(it) && !isa<StoreInst>(it) && !isa<PHINode>(it))
4574 // Examine PHI nodes that are reduction variables.
4575 if (PHINode *PN = dyn_cast<PHINode>(it))
4576 if (!Legal->getReductionVars()->count(PN))
4579 // Examine the stored values.
4580 if (StoreInst *ST = dyn_cast<StoreInst>(it))
4581 T = ST->getValueOperand()->getType();
4583 // Ignore loaded pointer types and stored pointer types that are not
4584 // consecutive. However, we do want to take consecutive stores/loads of
4585 // pointer vectors into account.
4586 if (T->isPointerTy() && !isConsecutiveLoadOrStore(it))
4589 MaxWidth = std::max(MaxWidth,
4590 (unsigned)DL.getTypeSizeInBits(T->getScalarType()));
4598 LoopVectorizationCostModel::selectUnrollFactor(bool OptForSize,
4600 unsigned LoopCost) {
4602 // -- The unroll heuristics --
4603 // We unroll the loop in order to expose ILP and reduce the loop overhead.
4604 // There are many micro-architectural considerations that we can't predict
4605 // at this level. For example, frontend pressure (on decode or fetch) due to
4606 // code size, or the number and capabilities of the execution ports.
4608 // We use the following heuristics to select the unroll factor:
4609 // 1. If the code has reductions, then we unroll in order to break the cross
4610 // iteration dependency.
4611 // 2. If the loop is really small, then we unroll in order to reduce the loop
4613 // 3. We don't unroll if we think that we will spill registers to memory due
4614 // to the increased register pressure.
4616 // Use the user preference, unless 'auto' is selected.
4617 int UserUF = Hints->getInterleave();
4621 // When we optimize for size, we don't unroll.
4625 // We used the distance for the unroll factor.
4626 if (Legal->getMaxSafeDepDistBytes() != -1U)
4629 // Do not unroll loops with a relatively small trip count.
4630 unsigned TC = SE->getSmallConstantTripCount(TheLoop);
4631 if (TC > 1 && TC < TinyTripCountUnrollThreshold)
4634 unsigned TargetNumRegisters = TTI.getNumberOfRegisters(VF > 1);
4635 DEBUG(dbgs() << "LV: The target has " << TargetNumRegisters <<
4639 if (ForceTargetNumScalarRegs.getNumOccurrences() > 0)
4640 TargetNumRegisters = ForceTargetNumScalarRegs;
4642 if (ForceTargetNumVectorRegs.getNumOccurrences() > 0)
4643 TargetNumRegisters = ForceTargetNumVectorRegs;
4646 LoopVectorizationCostModel::RegisterUsage R = calculateRegisterUsage();
4647 // We divide by these constants so assume that we have at least one
4648 // instruction that uses at least one register.
4649 R.MaxLocalUsers = std::max(R.MaxLocalUsers, 1U);
4650 R.NumInstructions = std::max(R.NumInstructions, 1U);
4652 // We calculate the unroll factor using the following formula.
4653 // Subtract the number of loop invariants from the number of available
4654 // registers. These registers are used by all of the unrolled instances.
4655 // Next, divide the remaining registers by the number of registers that is
4656 // required by the loop, in order to estimate how many parallel instances
4657 // fit without causing spills. All of this is rounded down if necessary to be
4658 // a power of two. We want power of two unroll factors to simplify any
4659 // addressing operations or alignment considerations.
4660 unsigned UF = PowerOf2Floor((TargetNumRegisters - R.LoopInvariantRegs) /
4663 // Don't count the induction variable as unrolled.
4664 if (EnableIndVarRegisterHeur)
4665 UF = PowerOf2Floor((TargetNumRegisters - R.LoopInvariantRegs - 1) /
4666 std::max(1U, (R.MaxLocalUsers - 1)));
4668 // Clamp the unroll factor ranges to reasonable factors.
4669 unsigned MaxInterleaveSize = TTI.getMaxInterleaveFactor();
4671 // Check if the user has overridden the unroll max.
4673 if (ForceTargetMaxScalarInterleaveFactor.getNumOccurrences() > 0)
4674 MaxInterleaveSize = ForceTargetMaxScalarInterleaveFactor;
4676 if (ForceTargetMaxVectorInterleaveFactor.getNumOccurrences() > 0)
4677 MaxInterleaveSize = ForceTargetMaxVectorInterleaveFactor;
4680 // If we did not calculate the cost for VF (because the user selected the VF)
4681 // then we calculate the cost of VF here.
4683 LoopCost = expectedCost(VF);
4685 // Clamp the calculated UF to be between the 1 and the max unroll factor
4686 // that the target allows.
4687 if (UF > MaxInterleaveSize)
4688 UF = MaxInterleaveSize;
4692 // Unroll if we vectorized this loop and there is a reduction that could
4693 // benefit from unrolling.
4694 if (VF > 1 && Legal->getReductionVars()->size()) {
4695 DEBUG(dbgs() << "LV: Unrolling because of reductions.\n");
4699 // Note that if we've already vectorized the loop we will have done the
4700 // runtime check and so unrolling won't require further checks.
4701 bool UnrollingRequiresRuntimePointerCheck =
4702 (VF == 1 && Legal->getRuntimePointerCheck()->Need);
4704 // We want to unroll small loops in order to reduce the loop overhead and
4705 // potentially expose ILP opportunities.
4706 DEBUG(dbgs() << "LV: Loop cost is " << LoopCost << '\n');
4707 if (!UnrollingRequiresRuntimePointerCheck &&
4708 LoopCost < SmallLoopCost) {
4709 // We assume that the cost overhead is 1 and we use the cost model
4710 // to estimate the cost of the loop and unroll until the cost of the
4711 // loop overhead is about 5% of the cost of the loop.
4712 unsigned SmallUF = std::min(UF, (unsigned)PowerOf2Floor(SmallLoopCost / LoopCost));
4714 // Unroll until store/load ports (estimated by max unroll factor) are
4716 unsigned NumStores = Legal->getNumStores();
4717 unsigned NumLoads = Legal->getNumLoads();
4718 unsigned StoresUF = UF / (NumStores ? NumStores : 1);
4719 unsigned LoadsUF = UF / (NumLoads ? NumLoads : 1);
4721 // If we have a scalar reduction (vector reductions are already dealt with
4722 // by this point), we can increase the critical path length if the loop
4723 // we're unrolling is inside another loop. Limit, by default to 2, so the
4724 // critical path only gets increased by one reduction operation.
4725 if (Legal->getReductionVars()->size() &&
4726 TheLoop->getLoopDepth() > 1) {
4727 unsigned F = static_cast<unsigned>(MaxNestedScalarReductionUF);
4728 SmallUF = std::min(SmallUF, F);
4729 StoresUF = std::min(StoresUF, F);
4730 LoadsUF = std::min(LoadsUF, F);
4733 if (EnableLoadStoreRuntimeUnroll && std::max(StoresUF, LoadsUF) > SmallUF) {
4734 DEBUG(dbgs() << "LV: Unrolling to saturate store or load ports.\n");
4735 return std::max(StoresUF, LoadsUF);
4738 DEBUG(dbgs() << "LV: Unrolling to reduce branch cost.\n");
4742 // Unroll if this is a large loop (small loops are already dealt with by this
4743 // point) that could benefit from interleaved unrolling.
4744 bool HasReductions = (Legal->getReductionVars()->size() > 0);
4745 if (TTI.enableAggressiveInterleaving(HasReductions)) {
4746 DEBUG(dbgs() << "LV: Unrolling to expose ILP.\n");
4750 DEBUG(dbgs() << "LV: Not Unrolling.\n");
4754 LoopVectorizationCostModel::RegisterUsage
4755 LoopVectorizationCostModel::calculateRegisterUsage() {
4756 // This function calculates the register usage by measuring the highest number
4757 // of values that are alive at a single location. Obviously, this is a very
4758 // rough estimation. We scan the loop in a topological order in order and
4759 // assign a number to each instruction. We use RPO to ensure that defs are
4760 // met before their users. We assume that each instruction that has in-loop
4761 // users starts an interval. We record every time that an in-loop value is
4762 // used, so we have a list of the first and last occurrences of each
4763 // instruction. Next, we transpose this data structure into a multi map that
4764 // holds the list of intervals that *end* at a specific location. This multi
4765 // map allows us to perform a linear search. We scan the instructions linearly
4766 // and record each time that a new interval starts, by placing it in a set.
4767 // If we find this value in the multi-map then we remove it from the set.
4768 // The max register usage is the maximum size of the set.
4769 // We also search for instructions that are defined outside the loop, but are
4770 // used inside the loop. We need this number separately from the max-interval
4771 // usage number because when we unroll, loop-invariant values do not take
4773 LoopBlocksDFS DFS(TheLoop);
4777 R.NumInstructions = 0;
4779 // Each 'key' in the map opens a new interval. The values
4780 // of the map are the index of the 'last seen' usage of the
4781 // instruction that is the key.
4782 typedef DenseMap<Instruction*, unsigned> IntervalMap;
4783 // Maps instruction to its index.
4784 DenseMap<unsigned, Instruction*> IdxToInstr;
4785 // Marks the end of each interval.
4786 IntervalMap EndPoint;
4787 // Saves the list of instruction indices that are used in the loop.
4788 SmallSet<Instruction*, 8> Ends;
4789 // Saves the list of values that are used in the loop but are
4790 // defined outside the loop, such as arguments and constants.
4791 SmallPtrSet<Value*, 8> LoopInvariants;
4794 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
4795 be = DFS.endRPO(); bb != be; ++bb) {
4796 R.NumInstructions += (*bb)->size();
4797 for (BasicBlock::iterator it = (*bb)->begin(), e = (*bb)->end(); it != e;
4799 Instruction *I = it;
4800 IdxToInstr[Index++] = I;
4802 // Save the end location of each USE.
4803 for (unsigned i = 0; i < I->getNumOperands(); ++i) {
4804 Value *U = I->getOperand(i);
4805 Instruction *Instr = dyn_cast<Instruction>(U);
4807 // Ignore non-instruction values such as arguments, constants, etc.
4808 if (!Instr) continue;
4810 // If this instruction is outside the loop then record it and continue.
4811 if (!TheLoop->contains(Instr)) {
4812 LoopInvariants.insert(Instr);
4816 // Overwrite previous end points.
4817 EndPoint[Instr] = Index;
4823 // Saves the list of intervals that end with the index in 'key'.
4824 typedef SmallVector<Instruction*, 2> InstrList;
4825 DenseMap<unsigned, InstrList> TransposeEnds;
4827 // Transpose the EndPoints to a list of values that end at each index.
4828 for (IntervalMap::iterator it = EndPoint.begin(), e = EndPoint.end();
4830 TransposeEnds[it->second].push_back(it->first);
4832 SmallSet<Instruction*, 8> OpenIntervals;
4833 unsigned MaxUsage = 0;
4836 DEBUG(dbgs() << "LV(REG): Calculating max register usage:\n");
4837 for (unsigned int i = 0; i < Index; ++i) {
4838 Instruction *I = IdxToInstr[i];
4839 // Ignore instructions that are never used within the loop.
4840 if (!Ends.count(I)) continue;
4842 // Ignore ephemeral values.
4843 if (EphValues.count(I))
4846 // Remove all of the instructions that end at this location.
4847 InstrList &List = TransposeEnds[i];
4848 for (unsigned int j=0, e = List.size(); j < e; ++j)
4849 OpenIntervals.erase(List[j]);
4851 // Count the number of live interals.
4852 MaxUsage = std::max(MaxUsage, OpenIntervals.size());
4854 DEBUG(dbgs() << "LV(REG): At #" << i << " Interval # " <<
4855 OpenIntervals.size() << '\n');
4857 // Add the current instruction to the list of open intervals.
4858 OpenIntervals.insert(I);
4861 unsigned Invariant = LoopInvariants.size();
4862 DEBUG(dbgs() << "LV(REG): Found max usage: " << MaxUsage << '\n');
4863 DEBUG(dbgs() << "LV(REG): Found invariant usage: " << Invariant << '\n');
4864 DEBUG(dbgs() << "LV(REG): LoopSize: " << R.NumInstructions << '\n');
4866 R.LoopInvariantRegs = Invariant;
4867 R.MaxLocalUsers = MaxUsage;
4871 unsigned LoopVectorizationCostModel::expectedCost(unsigned VF) {
4875 for (Loop::block_iterator bb = TheLoop->block_begin(),
4876 be = TheLoop->block_end(); bb != be; ++bb) {
4877 unsigned BlockCost = 0;
4878 BasicBlock *BB = *bb;
4880 // For each instruction in the old loop.
4881 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4882 // Skip dbg intrinsics.
4883 if (isa<DbgInfoIntrinsic>(it))
4886 // Ignore ephemeral values.
4887 if (EphValues.count(it))
4890 unsigned C = getInstructionCost(it, VF);
4892 // Check if we should override the cost.
4893 if (ForceTargetInstructionCost.getNumOccurrences() > 0)
4894 C = ForceTargetInstructionCost;
4897 DEBUG(dbgs() << "LV: Found an estimated cost of " << C << " for VF " <<
4898 VF << " For instruction: " << *it << '\n');
4901 // We assume that if-converted blocks have a 50% chance of being executed.
4902 // When the code is scalar then some of the blocks are avoided due to CF.
4903 // When the code is vectorized we execute all code paths.
4904 if (VF == 1 && Legal->blockNeedsPredication(*bb))
4913 /// \brief Check whether the address computation for a non-consecutive memory
4914 /// access looks like an unlikely candidate for being merged into the indexing
4917 /// We look for a GEP which has one index that is an induction variable and all
4918 /// other indices are loop invariant. If the stride of this access is also
4919 /// within a small bound we decide that this address computation can likely be
4920 /// merged into the addressing mode.
4921 /// In all other cases, we identify the address computation as complex.
4922 static bool isLikelyComplexAddressComputation(Value *Ptr,
4923 LoopVectorizationLegality *Legal,
4924 ScalarEvolution *SE,
4925 const Loop *TheLoop) {
4926 GetElementPtrInst *Gep = dyn_cast<GetElementPtrInst>(Ptr);
4930 // We are looking for a gep with all loop invariant indices except for one
4931 // which should be an induction variable.
4932 unsigned NumOperands = Gep->getNumOperands();
4933 for (unsigned i = 1; i < NumOperands; ++i) {
4934 Value *Opd = Gep->getOperand(i);
4935 if (!SE->isLoopInvariant(SE->getSCEV(Opd), TheLoop) &&
4936 !Legal->isInductionVariable(Opd))
4940 // Now we know we have a GEP ptr, %inv, %ind, %inv. Make sure that the step
4941 // can likely be merged into the address computation.
4942 unsigned MaxMergeDistance = 64;
4944 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(Ptr));
4948 // Check the step is constant.
4949 const SCEV *Step = AddRec->getStepRecurrence(*SE);
4950 // Calculate the pointer stride and check if it is consecutive.
4951 const SCEVConstant *C = dyn_cast<SCEVConstant>(Step);
4955 const APInt &APStepVal = C->getValue()->getValue();
4957 // Huge step value - give up.
4958 if (APStepVal.getBitWidth() > 64)
4961 int64_t StepVal = APStepVal.getSExtValue();
4963 return StepVal > MaxMergeDistance;
4966 static bool isStrideMul(Instruction *I, LoopVectorizationLegality *Legal) {
4967 if (Legal->hasStride(I->getOperand(0)) || Legal->hasStride(I->getOperand(1)))
4973 LoopVectorizationCostModel::getInstructionCost(Instruction *I, unsigned VF) {
4974 // If we know that this instruction will remain uniform, check the cost of
4975 // the scalar version.
4976 if (Legal->isUniformAfterVectorization(I))
4979 Type *RetTy = I->getType();
4980 Type *VectorTy = ToVectorTy(RetTy, VF);
4982 // TODO: We need to estimate the cost of intrinsic calls.
4983 switch (I->getOpcode()) {
4984 case Instruction::GetElementPtr:
4985 // We mark this instruction as zero-cost because the cost of GEPs in
4986 // vectorized code depends on whether the corresponding memory instruction
4987 // is scalarized or not. Therefore, we handle GEPs with the memory
4988 // instruction cost.
4990 case Instruction::Br: {
4991 return TTI.getCFInstrCost(I->getOpcode());
4993 case Instruction::PHI:
4994 //TODO: IF-converted IFs become selects.
4996 case Instruction::Add:
4997 case Instruction::FAdd:
4998 case Instruction::Sub:
4999 case Instruction::FSub:
5000 case Instruction::Mul:
5001 case Instruction::FMul:
5002 case Instruction::UDiv:
5003 case Instruction::SDiv:
5004 case Instruction::FDiv:
5005 case Instruction::URem:
5006 case Instruction::SRem:
5007 case Instruction::FRem:
5008 case Instruction::Shl:
5009 case Instruction::LShr:
5010 case Instruction::AShr:
5011 case Instruction::And:
5012 case Instruction::Or:
5013 case Instruction::Xor: {
5014 // Since we will replace the stride by 1 the multiplication should go away.
5015 if (I->getOpcode() == Instruction::Mul && isStrideMul(I, Legal))
5017 // Certain instructions can be cheaper to vectorize if they have a constant
5018 // second vector operand. One example of this are shifts on x86.
5019 TargetTransformInfo::OperandValueKind Op1VK =
5020 TargetTransformInfo::OK_AnyValue;
5021 TargetTransformInfo::OperandValueKind Op2VK =
5022 TargetTransformInfo::OK_AnyValue;
5023 TargetTransformInfo::OperandValueProperties Op1VP =
5024 TargetTransformInfo::OP_None;
5025 TargetTransformInfo::OperandValueProperties Op2VP =
5026 TargetTransformInfo::OP_None;
5027 Value *Op2 = I->getOperand(1);
5029 // Check for a splat of a constant or for a non uniform vector of constants.
5030 if (isa<ConstantInt>(Op2)) {
5031 ConstantInt *CInt = cast<ConstantInt>(Op2);
5032 if (CInt && CInt->getValue().isPowerOf2())
5033 Op2VP = TargetTransformInfo::OP_PowerOf2;
5034 Op2VK = TargetTransformInfo::OK_UniformConstantValue;
5035 } else if (isa<ConstantVector>(Op2) || isa<ConstantDataVector>(Op2)) {
5036 Op2VK = TargetTransformInfo::OK_NonUniformConstantValue;
5037 Constant *SplatValue = cast<Constant>(Op2)->getSplatValue();
5039 ConstantInt *CInt = dyn_cast<ConstantInt>(SplatValue);
5040 if (CInt && CInt->getValue().isPowerOf2())
5041 Op2VP = TargetTransformInfo::OP_PowerOf2;
5042 Op2VK = TargetTransformInfo::OK_UniformConstantValue;
5046 return TTI.getArithmeticInstrCost(I->getOpcode(), VectorTy, Op1VK, Op2VK,
5049 case Instruction::Select: {
5050 SelectInst *SI = cast<SelectInst>(I);
5051 const SCEV *CondSCEV = SE->getSCEV(SI->getCondition());
5052 bool ScalarCond = (SE->isLoopInvariant(CondSCEV, TheLoop));
5053 Type *CondTy = SI->getCondition()->getType();
5055 CondTy = VectorType::get(CondTy, VF);
5057 return TTI.getCmpSelInstrCost(I->getOpcode(), VectorTy, CondTy);
5059 case Instruction::ICmp:
5060 case Instruction::FCmp: {
5061 Type *ValTy = I->getOperand(0)->getType();
5062 VectorTy = ToVectorTy(ValTy, VF);
5063 return TTI.getCmpSelInstrCost(I->getOpcode(), VectorTy);
5065 case Instruction::Store:
5066 case Instruction::Load: {
5067 StoreInst *SI = dyn_cast<StoreInst>(I);
5068 LoadInst *LI = dyn_cast<LoadInst>(I);
5069 Type *ValTy = (SI ? SI->getValueOperand()->getType() :
5071 VectorTy = ToVectorTy(ValTy, VF);
5073 unsigned Alignment = SI ? SI->getAlignment() : LI->getAlignment();
5074 unsigned AS = SI ? SI->getPointerAddressSpace() :
5075 LI->getPointerAddressSpace();
5076 Value *Ptr = SI ? SI->getPointerOperand() : LI->getPointerOperand();
5077 // We add the cost of address computation here instead of with the gep
5078 // instruction because only here we know whether the operation is
5081 return TTI.getAddressComputationCost(VectorTy) +
5082 TTI.getMemoryOpCost(I->getOpcode(), VectorTy, Alignment, AS);
5084 // Scalarized loads/stores.
5085 int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
5086 bool Reverse = ConsecutiveStride < 0;
5087 const DataLayout &DL = I->getModule()->getDataLayout();
5088 unsigned ScalarAllocatedSize = DL.getTypeAllocSize(ValTy);
5089 unsigned VectorElementSize = DL.getTypeStoreSize(VectorTy) / VF;
5090 if (!ConsecutiveStride || ScalarAllocatedSize != VectorElementSize) {
5091 bool IsComplexComputation =
5092 isLikelyComplexAddressComputation(Ptr, Legal, SE, TheLoop);
5094 // The cost of extracting from the value vector and pointer vector.
5095 Type *PtrTy = ToVectorTy(Ptr->getType(), VF);
5096 for (unsigned i = 0; i < VF; ++i) {
5097 // The cost of extracting the pointer operand.
5098 Cost += TTI.getVectorInstrCost(Instruction::ExtractElement, PtrTy, i);
5099 // In case of STORE, the cost of ExtractElement from the vector.
5100 // In case of LOAD, the cost of InsertElement into the returned
5102 Cost += TTI.getVectorInstrCost(SI ? Instruction::ExtractElement :
5103 Instruction::InsertElement,
5107 // The cost of the scalar loads/stores.
5108 Cost += VF * TTI.getAddressComputationCost(PtrTy, IsComplexComputation);
5109 Cost += VF * TTI.getMemoryOpCost(I->getOpcode(), ValTy->getScalarType(),
5114 // Wide load/stores.
5115 unsigned Cost = TTI.getAddressComputationCost(VectorTy);
5116 if (Legal->isMaskRequired(I))
5117 Cost += TTI.getMaskedMemoryOpCost(I->getOpcode(), VectorTy, Alignment,
5120 Cost += TTI.getMemoryOpCost(I->getOpcode(), VectorTy, Alignment, AS);
5123 Cost += TTI.getShuffleCost(TargetTransformInfo::SK_Reverse,
5127 case Instruction::ZExt:
5128 case Instruction::SExt:
5129 case Instruction::FPToUI:
5130 case Instruction::FPToSI:
5131 case Instruction::FPExt:
5132 case Instruction::PtrToInt:
5133 case Instruction::IntToPtr:
5134 case Instruction::SIToFP:
5135 case Instruction::UIToFP:
5136 case Instruction::Trunc:
5137 case Instruction::FPTrunc:
5138 case Instruction::BitCast: {
5139 // We optimize the truncation of induction variable.
5140 // The cost of these is the same as the scalar operation.
5141 if (I->getOpcode() == Instruction::Trunc &&
5142 Legal->isInductionVariable(I->getOperand(0)))
5143 return TTI.getCastInstrCost(I->getOpcode(), I->getType(),
5144 I->getOperand(0)->getType());
5146 Type *SrcVecTy = ToVectorTy(I->getOperand(0)->getType(), VF);
5147 return TTI.getCastInstrCost(I->getOpcode(), VectorTy, SrcVecTy);
5149 case Instruction::Call: {
5150 bool NeedToScalarize;
5151 CallInst *CI = cast<CallInst>(I);
5152 unsigned CallCost = getVectorCallCost(CI, VF, TTI, TLI, NeedToScalarize);
5153 if (getIntrinsicIDForCall(CI, TLI))
5154 return std::min(CallCost, getVectorIntrinsicCost(CI, VF, TTI, TLI));
5158 // We are scalarizing the instruction. Return the cost of the scalar
5159 // instruction, plus the cost of insert and extract into vector
5160 // elements, times the vector width.
5163 if (!RetTy->isVoidTy() && VF != 1) {
5164 unsigned InsCost = TTI.getVectorInstrCost(Instruction::InsertElement,
5166 unsigned ExtCost = TTI.getVectorInstrCost(Instruction::ExtractElement,
5169 // The cost of inserting the results plus extracting each one of the
5171 Cost += VF * (InsCost + ExtCost * I->getNumOperands());
5174 // The cost of executing VF copies of the scalar instruction. This opcode
5175 // is unknown. Assume that it is the same as 'mul'.
5176 Cost += VF * TTI.getArithmeticInstrCost(Instruction::Mul, VectorTy);
5182 char LoopVectorize::ID = 0;
5183 static const char lv_name[] = "Loop Vectorization";
5184 INITIALIZE_PASS_BEGIN(LoopVectorize, LV_NAME, lv_name, false, false)
5185 INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass)
5186 INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
5187 INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
5188 INITIALIZE_PASS_DEPENDENCY(BlockFrequencyInfo)
5189 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
5190 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
5191 INITIALIZE_PASS_DEPENDENCY(LCSSA)
5192 INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
5193 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
5194 INITIALIZE_PASS_DEPENDENCY(LoopAccessAnalysis)
5195 INITIALIZE_PASS_END(LoopVectorize, LV_NAME, lv_name, false, false)
5198 Pass *createLoopVectorizePass(bool NoUnrolling, bool AlwaysVectorize) {
5199 return new LoopVectorize(NoUnrolling, AlwaysVectorize);
5203 bool LoopVectorizationCostModel::isConsecutiveLoadOrStore(Instruction *Inst) {
5204 // Check for a store.
5205 if (StoreInst *ST = dyn_cast<StoreInst>(Inst))
5206 return Legal->isConsecutivePtr(ST->getPointerOperand()) != 0;
5208 // Check for a load.
5209 if (LoadInst *LI = dyn_cast<LoadInst>(Inst))
5210 return Legal->isConsecutivePtr(LI->getPointerOperand()) != 0;
5216 void InnerLoopUnroller::scalarizeInstruction(Instruction *Instr,
5217 bool IfPredicateStore) {
5218 assert(!Instr->getType()->isAggregateType() && "Can't handle vectors");
5219 // Holds vector parameters or scalars, in case of uniform vals.
5220 SmallVector<VectorParts, 4> Params;
5222 setDebugLocFromInst(Builder, Instr);
5224 // Find all of the vectorized parameters.
5225 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
5226 Value *SrcOp = Instr->getOperand(op);
5228 // If we are accessing the old induction variable, use the new one.
5229 if (SrcOp == OldInduction) {
5230 Params.push_back(getVectorValue(SrcOp));
5234 // Try using previously calculated values.
5235 Instruction *SrcInst = dyn_cast<Instruction>(SrcOp);
5237 // If the src is an instruction that appeared earlier in the basic block
5238 // then it should already be vectorized.
5239 if (SrcInst && OrigLoop->contains(SrcInst)) {
5240 assert(WidenMap.has(SrcInst) && "Source operand is unavailable");
5241 // The parameter is a vector value from earlier.
5242 Params.push_back(WidenMap.get(SrcInst));
5244 // The parameter is a scalar from outside the loop. Maybe even a constant.
5245 VectorParts Scalars;
5246 Scalars.append(UF, SrcOp);
5247 Params.push_back(Scalars);
5251 assert(Params.size() == Instr->getNumOperands() &&
5252 "Invalid number of operands");
5254 // Does this instruction return a value ?
5255 bool IsVoidRetTy = Instr->getType()->isVoidTy();
5257 Value *UndefVec = IsVoidRetTy ? nullptr :
5258 UndefValue::get(Instr->getType());
5259 // Create a new entry in the WidenMap and initialize it to Undef or Null.
5260 VectorParts &VecResults = WidenMap.splat(Instr, UndefVec);
5262 Instruction *InsertPt = Builder.GetInsertPoint();
5263 BasicBlock *IfBlock = Builder.GetInsertBlock();
5264 BasicBlock *CondBlock = nullptr;
5267 Loop *VectorLp = nullptr;
5268 if (IfPredicateStore) {
5269 assert(Instr->getParent()->getSinglePredecessor() &&
5270 "Only support single predecessor blocks");
5271 Cond = createEdgeMask(Instr->getParent()->getSinglePredecessor(),
5272 Instr->getParent());
5273 VectorLp = LI->getLoopFor(IfBlock);
5274 assert(VectorLp && "Must have a loop for this block");
5277 // For each vector unroll 'part':
5278 for (unsigned Part = 0; Part < UF; ++Part) {
5279 // For each scalar that we create:
5281 // Start an "if (pred) a[i] = ..." block.
5282 Value *Cmp = nullptr;
5283 if (IfPredicateStore) {
5284 if (Cond[Part]->getType()->isVectorTy())
5286 Builder.CreateExtractElement(Cond[Part], Builder.getInt32(0));
5287 Cmp = Builder.CreateICmp(ICmpInst::ICMP_EQ, Cond[Part],
5288 ConstantInt::get(Cond[Part]->getType(), 1));
5289 CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.store");
5290 LoopVectorBody.push_back(CondBlock);
5291 VectorLp->addBasicBlockToLoop(CondBlock, *LI);
5292 // Update Builder with newly created basic block.
5293 Builder.SetInsertPoint(InsertPt);
5296 Instruction *Cloned = Instr->clone();
5298 Cloned->setName(Instr->getName() + ".cloned");
5299 // Replace the operands of the cloned instructions with extracted scalars.
5300 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
5301 Value *Op = Params[op][Part];
5302 Cloned->setOperand(op, Op);
5305 // Place the cloned scalar in the new loop.
5306 Builder.Insert(Cloned);
5308 // If the original scalar returns a value we need to place it in a vector
5309 // so that future users will be able to use it.
5311 VecResults[Part] = Cloned;
5314 if (IfPredicateStore) {
5315 BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else");
5316 LoopVectorBody.push_back(NewIfBlock);
5317 VectorLp->addBasicBlockToLoop(NewIfBlock, *LI);
5318 Builder.SetInsertPoint(InsertPt);
5319 Instruction *OldBr = IfBlock->getTerminator();
5320 BranchInst::Create(CondBlock, NewIfBlock, Cmp, OldBr);
5321 OldBr->eraseFromParent();
5322 IfBlock = NewIfBlock;
5327 void InnerLoopUnroller::vectorizeMemoryInstruction(Instruction *Instr) {
5328 StoreInst *SI = dyn_cast<StoreInst>(Instr);
5329 bool IfPredicateStore = (SI && Legal->blockNeedsPredication(SI->getParent()));
5331 return scalarizeInstruction(Instr, IfPredicateStore);
5334 Value *InnerLoopUnroller::reverseVector(Value *Vec) {
5338 Value *InnerLoopUnroller::getBroadcastInstrs(Value *V) {
5342 Value *InnerLoopUnroller::getStepVector(Value *Val, int StartIdx, Value *Step) {
5343 // When unrolling and the VF is 1, we only need to add a simple scalar.
5344 Type *ITy = Val->getType();
5345 assert(!ITy->isVectorTy() && "Val must be a scalar");
5346 Constant *C = ConstantInt::get(ITy, StartIdx);
5347 return Builder.CreateAdd(Val, Builder.CreateMul(C, Step), "induction");