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 #define LV_NAME "loop-vectorize"
46 #define DEBUG_TYPE LV_NAME
48 #include "llvm/Transforms/Vectorize.h"
49 #include "llvm/ADT/DenseMap.h"
50 #include "llvm/ADT/EquivalenceClasses.h"
51 #include "llvm/ADT/MapVector.h"
52 #include "llvm/ADT/SetVector.h"
53 #include "llvm/ADT/SmallPtrSet.h"
54 #include "llvm/ADT/SmallSet.h"
55 #include "llvm/ADT/SmallVector.h"
56 #include "llvm/ADT/StringExtras.h"
57 #include "llvm/Analysis/AliasAnalysis.h"
58 #include "llvm/Analysis/Dominators.h"
59 #include "llvm/Analysis/LoopInfo.h"
60 #include "llvm/Analysis/LoopIterator.h"
61 #include "llvm/Analysis/LoopPass.h"
62 #include "llvm/Analysis/ScalarEvolution.h"
63 #include "llvm/Analysis/ScalarEvolutionExpander.h"
64 #include "llvm/Analysis/ScalarEvolutionExpressions.h"
65 #include "llvm/Analysis/TargetTransformInfo.h"
66 #include "llvm/Analysis/ValueTracking.h"
67 #include "llvm/Analysis/Verifier.h"
68 #include "llvm/IR/Constants.h"
69 #include "llvm/IR/DataLayout.h"
70 #include "llvm/IR/DerivedTypes.h"
71 #include "llvm/IR/Function.h"
72 #include "llvm/IR/IRBuilder.h"
73 #include "llvm/IR/Instructions.h"
74 #include "llvm/IR/IntrinsicInst.h"
75 #include "llvm/IR/LLVMContext.h"
76 #include "llvm/IR/Module.h"
77 #include "llvm/IR/Type.h"
78 #include "llvm/IR/Value.h"
79 #include "llvm/Pass.h"
80 #include "llvm/Support/CommandLine.h"
81 #include "llvm/Support/Debug.h"
82 #include "llvm/Support/PatternMatch.h"
83 #include "llvm/Support/raw_ostream.h"
84 #include "llvm/Support/ValueHandle.h"
85 #include "llvm/Target/TargetLibraryInfo.h"
86 #include "llvm/Transforms/Scalar.h"
87 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
88 #include "llvm/Transforms/Utils/Local.h"
93 using namespace llvm::PatternMatch;
95 static cl::opt<unsigned>
96 VectorizationFactor("force-vector-width", cl::init(0), cl::Hidden,
97 cl::desc("Sets the SIMD width. Zero is autoselect."));
99 static cl::opt<unsigned>
100 VectorizationUnroll("force-vector-unroll", cl::init(0), cl::Hidden,
101 cl::desc("Sets the vectorization unroll count. "
102 "Zero is autoselect."));
105 EnableIfConversion("enable-if-conversion", cl::init(true), cl::Hidden,
106 cl::desc("Enable if-conversion during vectorization."));
108 /// We don't vectorize loops with a known constant trip count below this number.
109 static cl::opt<unsigned>
110 TinyTripCountVectorThreshold("vectorizer-min-trip-count", cl::init(16),
112 cl::desc("Don't vectorize loops with a constant "
113 "trip count that is smaller than this "
116 /// We don't unroll loops with a known constant trip count below this number.
117 static const unsigned TinyTripCountUnrollThreshold = 128;
119 /// When performing memory disambiguation checks at runtime do not make more
120 /// than this number of comparisons.
121 static const unsigned RuntimeMemoryCheckThreshold = 8;
123 /// Maximum simd width.
124 static const unsigned MaxVectorWidth = 64;
126 /// Maximum vectorization unroll count.
127 static const unsigned MaxUnrollFactor = 16;
129 /// The cost of a loop that is considered 'small' by the unroller.
130 static const unsigned SmallLoopCost = 20;
134 // Forward declarations.
135 class LoopVectorizationLegality;
136 class LoopVectorizationCostModel;
138 /// InnerLoopVectorizer vectorizes loops which contain only one basic
139 /// block to a specified vectorization factor (VF).
140 /// This class performs the widening of scalars into vectors, or multiple
141 /// scalars. This class also implements the following features:
142 /// * It inserts an epilogue loop for handling loops that don't have iteration
143 /// counts that are known to be a multiple of the vectorization factor.
144 /// * It handles the code generation for reduction variables.
145 /// * Scalarization (implementation using scalars) of un-vectorizable
147 /// InnerLoopVectorizer does not perform any vectorization-legality
148 /// checks, and relies on the caller to check for the different legality
149 /// aspects. The InnerLoopVectorizer relies on the
150 /// LoopVectorizationLegality class to provide information about the induction
151 /// and reduction variables that were found to a given vectorization factor.
152 class InnerLoopVectorizer {
154 InnerLoopVectorizer(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI,
155 DominatorTree *DT, DataLayout *DL,
156 const TargetLibraryInfo *TLI, unsigned VecWidth,
157 unsigned UnrollFactor)
158 : OrigLoop(OrigLoop), SE(SE), LI(LI), DT(DT), DL(DL), TLI(TLI),
159 VF(VecWidth), UF(UnrollFactor), Builder(SE->getContext()), Induction(0),
160 OldInduction(0), WidenMap(UnrollFactor) {}
162 // Perform the actual loop widening (vectorization).
163 void vectorize(LoopVectorizationLegality *Legal) {
164 // Create a new empty loop. Unlink the old loop and connect the new one.
165 createEmptyLoop(Legal);
166 // Widen each instruction in the old loop to a new one in the new loop.
167 // Use the Legality module to find the induction and reduction variables.
168 vectorizeLoop(Legal);
169 // Register the new loop and update the analysis passes.
173 virtual ~InnerLoopVectorizer() {}
176 /// A small list of PHINodes.
177 typedef SmallVector<PHINode*, 4> PhiVector;
178 /// When we unroll loops we have multiple vector values for each scalar.
179 /// This data structure holds the unrolled and vectorized values that
180 /// originated from one scalar instruction.
181 typedef SmallVector<Value*, 2> VectorParts;
183 // When we if-convert we need create edge masks. We have to cache values so
184 // that we don't end up with exponential recursion/IR.
185 typedef DenseMap<std::pair<BasicBlock*, BasicBlock*>,
186 VectorParts> EdgeMaskCache;
188 /// Add code that checks at runtime if the accessed arrays overlap.
189 /// Returns the comparator value or NULL if no check is needed.
190 Instruction *addRuntimeCheck(LoopVectorizationLegality *Legal,
192 /// Create an empty loop, based on the loop ranges of the old loop.
193 void createEmptyLoop(LoopVectorizationLegality *Legal);
194 /// Copy and widen the instructions from the old loop.
195 virtual void vectorizeLoop(LoopVectorizationLegality *Legal);
197 /// \brief The Loop exit block may have single value PHI nodes where the
198 /// incoming value is 'Undef'. While vectorizing we only handled real values
199 /// that were defined inside the loop. Here we fix the 'undef case'.
203 /// A helper function that computes the predicate of the block BB, assuming
204 /// that the header block of the loop is set to True. It returns the *entry*
205 /// mask for the block BB.
206 VectorParts createBlockInMask(BasicBlock *BB);
207 /// A helper function that computes the predicate of the edge between SRC
209 VectorParts createEdgeMask(BasicBlock *Src, BasicBlock *Dst);
211 /// A helper function to vectorize a single BB within the innermost loop.
212 void vectorizeBlockInLoop(LoopVectorizationLegality *Legal, BasicBlock *BB,
215 /// Vectorize a single PHINode in a block. This method handles the induction
216 /// variable canonicalization. It supports both VF = 1 for unrolled loops and
217 /// arbitrary length vectors.
218 void widenPHIInstruction(Instruction *PN, VectorParts &Entry,
219 LoopVectorizationLegality *Legal,
220 unsigned UF, unsigned VF, PhiVector *PV);
222 /// Insert the new loop to the loop hierarchy and pass manager
223 /// and update the analysis passes.
224 void updateAnalysis();
226 /// This instruction is un-vectorizable. Implement it as a sequence
228 virtual void scalarizeInstruction(Instruction *Instr);
230 /// Vectorize Load and Store instructions,
231 virtual void vectorizeMemoryInstruction(Instruction *Instr,
232 LoopVectorizationLegality *Legal);
234 /// Create a broadcast instruction. This method generates a broadcast
235 /// instruction (shuffle) for loop invariant values and for the induction
236 /// value. If this is the induction variable then we extend it to N, N+1, ...
237 /// this is needed because each iteration in the loop corresponds to a SIMD
239 virtual Value *getBroadcastInstrs(Value *V);
241 /// This function adds 0, 1, 2 ... to each vector element, starting at zero.
242 /// If Negate is set then negative numbers are added e.g. (0, -1, -2, ...).
243 /// The sequence starts at StartIndex.
244 virtual Value *getConsecutiveVector(Value* Val, int StartIdx, bool Negate);
246 /// When we go over instructions in the basic block we rely on previous
247 /// values within the current basic block or on loop invariant values.
248 /// When we widen (vectorize) values we place them in the map. If the values
249 /// are not within the map, they have to be loop invariant, so we simply
250 /// broadcast them into a vector.
251 VectorParts &getVectorValue(Value *V);
253 /// Generate a shuffle sequence that will reverse the vector Vec.
254 virtual Value *reverseVector(Value *Vec);
256 /// This is a helper class that holds the vectorizer state. It maps scalar
257 /// instructions to vector instructions. When the code is 'unrolled' then
258 /// then a single scalar value is mapped to multiple vector parts. The parts
259 /// are stored in the VectorPart type.
261 /// C'tor. UnrollFactor controls the number of vectors ('parts') that
263 ValueMap(unsigned UnrollFactor) : UF(UnrollFactor) {}
265 /// \return True if 'Key' is saved in the Value Map.
266 bool has(Value *Key) const { return MapStorage.count(Key); }
268 /// Initializes a new entry in the map. Sets all of the vector parts to the
269 /// save value in 'Val'.
270 /// \return A reference to a vector with splat values.
271 VectorParts &splat(Value *Key, Value *Val) {
272 VectorParts &Entry = MapStorage[Key];
273 Entry.assign(UF, Val);
277 ///\return A reference to the value that is stored at 'Key'.
278 VectorParts &get(Value *Key) {
279 VectorParts &Entry = MapStorage[Key];
282 assert(Entry.size() == UF);
287 /// The unroll factor. Each entry in the map stores this number of vector
291 /// Map storage. We use std::map and not DenseMap because insertions to a
292 /// dense map invalidates its iterators.
293 std::map<Value *, VectorParts> MapStorage;
296 /// The original loop.
298 /// Scev analysis to use.
306 /// Target Library Info.
307 const TargetLibraryInfo *TLI;
309 /// The vectorization SIMD factor to use. Each vector will have this many
314 /// The vectorization unroll factor to use. Each scalar is vectorized to this
315 /// many different vector instructions.
318 /// The builder that we use
321 // --- Vectorization state ---
323 /// The vector-loop preheader.
324 BasicBlock *LoopVectorPreHeader;
325 /// The scalar-loop preheader.
326 BasicBlock *LoopScalarPreHeader;
327 /// Middle Block between the vector and the scalar.
328 BasicBlock *LoopMiddleBlock;
329 ///The ExitBlock of the scalar loop.
330 BasicBlock *LoopExitBlock;
331 ///The vector loop body.
332 BasicBlock *LoopVectorBody;
333 ///The scalar loop body.
334 BasicBlock *LoopScalarBody;
335 /// A list of all bypass blocks. The first block is the entry of the loop.
336 SmallVector<BasicBlock *, 4> LoopBypassBlocks;
338 /// The new Induction variable which was added to the new block.
340 /// The induction variable of the old basic block.
341 PHINode *OldInduction;
342 /// Holds the extended (to the widest induction type) start index.
344 /// Maps scalars to widened vectors.
346 EdgeMaskCache MaskCache;
349 class InnerLoopUnroller : public InnerLoopVectorizer {
351 InnerLoopUnroller(Loop *OrigLoop, ScalarEvolution *SE, LoopInfo *LI,
352 DominatorTree *DT, DataLayout *DL,
353 const TargetLibraryInfo *TLI, unsigned UnrollFactor) :
354 InnerLoopVectorizer(OrigLoop, SE, LI, DT, DL, TLI, 1, UnrollFactor) { }
357 virtual void scalarizeInstruction(Instruction *Instr);
358 virtual void vectorizeMemoryInstruction(Instruction *Instr,
359 LoopVectorizationLegality *Legal);
360 virtual Value *getBroadcastInstrs(Value *V);
361 virtual Value *getConsecutiveVector(Value* Val, int StartIdx, bool Negate);
362 virtual Value *reverseVector(Value *Vec);
365 /// \brief Look for a meaningful debug location on the instruction or it's
367 static Instruction *getDebugLocFromInstOrOperands(Instruction *I) {
372 if (I->getDebugLoc() != Empty)
375 for (User::op_iterator OI = I->op_begin(), OE = I->op_end(); OI != OE; ++OI) {
376 if (Instruction *OpInst = dyn_cast<Instruction>(*OI))
377 if (OpInst->getDebugLoc() != Empty)
384 /// \brief Set the debug location in the builder using the debug location in the
386 static void setDebugLocFromInst(IRBuilder<> &B, const Value *Ptr) {
387 if (const Instruction *Inst = dyn_cast_or_null<Instruction>(Ptr))
388 B.SetCurrentDebugLocation(Inst->getDebugLoc());
390 B.SetCurrentDebugLocation(DebugLoc());
393 /// LoopVectorizationLegality checks if it is legal to vectorize a loop, and
394 /// to what vectorization factor.
395 /// This class does not look at the profitability of vectorization, only the
396 /// legality. This class has two main kinds of checks:
397 /// * Memory checks - The code in canVectorizeMemory checks if vectorization
398 /// will change the order of memory accesses in a way that will change the
399 /// correctness of the program.
400 /// * Scalars checks - The code in canVectorizeInstrs and canVectorizeMemory
401 /// checks for a number of different conditions, such as the availability of a
402 /// single induction variable, that all types are supported and vectorize-able,
403 /// etc. This code reflects the capabilities of InnerLoopVectorizer.
404 /// This class is also used by InnerLoopVectorizer for identifying
405 /// induction variable and the different reduction variables.
406 class LoopVectorizationLegality {
408 LoopVectorizationLegality(Loop *L, ScalarEvolution *SE, DataLayout *DL,
409 DominatorTree *DT, TargetLibraryInfo *TLI)
410 : TheLoop(L), SE(SE), DL(DL), DT(DT), TLI(TLI),
411 Induction(0), WidestIndTy(0), HasFunNoNaNAttr(false),
412 MaxSafeDepDistBytes(-1U) {}
414 /// This enum represents the kinds of reductions that we support.
416 RK_NoReduction, ///< Not a reduction.
417 RK_IntegerAdd, ///< Sum of integers.
418 RK_IntegerMult, ///< Product of integers.
419 RK_IntegerOr, ///< Bitwise or logical OR of numbers.
420 RK_IntegerAnd, ///< Bitwise or logical AND of numbers.
421 RK_IntegerXor, ///< Bitwise or logical XOR of numbers.
422 RK_IntegerMinMax, ///< Min/max implemented in terms of select(cmp()).
423 RK_FloatAdd, ///< Sum of floats.
424 RK_FloatMult, ///< Product of floats.
425 RK_FloatMinMax ///< Min/max implemented in terms of select(cmp()).
428 /// This enum represents the kinds of inductions that we support.
430 IK_NoInduction, ///< Not an induction variable.
431 IK_IntInduction, ///< Integer induction variable. Step = 1.
432 IK_ReverseIntInduction, ///< Reverse int induction variable. Step = -1.
433 IK_PtrInduction, ///< Pointer induction var. Step = sizeof(elem).
434 IK_ReversePtrInduction ///< Reverse ptr indvar. Step = - sizeof(elem).
437 // This enum represents the kind of minmax reduction.
438 enum MinMaxReductionKind {
448 /// This POD struct holds information about reduction variables.
449 struct ReductionDescriptor {
450 ReductionDescriptor() : StartValue(0), LoopExitInstr(0),
451 Kind(RK_NoReduction), MinMaxKind(MRK_Invalid) {}
453 ReductionDescriptor(Value *Start, Instruction *Exit, ReductionKind K,
454 MinMaxReductionKind MK)
455 : StartValue(Start), LoopExitInstr(Exit), Kind(K), MinMaxKind(MK) {}
457 // The starting value of the reduction.
458 // It does not have to be zero!
459 TrackingVH<Value> StartValue;
460 // The instruction who's value is used outside the loop.
461 Instruction *LoopExitInstr;
462 // The kind of the reduction.
464 // If this a min/max reduction the kind of reduction.
465 MinMaxReductionKind MinMaxKind;
468 /// This POD struct holds information about a potential reduction operation.
469 struct ReductionInstDesc {
470 ReductionInstDesc(bool IsRedux, Instruction *I) :
471 IsReduction(IsRedux), PatternLastInst(I), MinMaxKind(MRK_Invalid) {}
473 ReductionInstDesc(Instruction *I, MinMaxReductionKind K) :
474 IsReduction(true), PatternLastInst(I), MinMaxKind(K) {}
476 // Is this instruction a reduction candidate.
478 // The last instruction in a min/max pattern (select of the select(icmp())
479 // pattern), or the current reduction instruction otherwise.
480 Instruction *PatternLastInst;
481 // If this is a min/max pattern the comparison predicate.
482 MinMaxReductionKind MinMaxKind;
485 // This POD struct holds information about the memory runtime legality
486 // check that a group of pointers do not overlap.
487 struct RuntimePointerCheck {
488 RuntimePointerCheck() : Need(false) {}
490 /// Reset the state of the pointer runtime information.
498 /// Insert a pointer and calculate the start and end SCEVs.
499 void insert(ScalarEvolution *SE, Loop *Lp, Value *Ptr, bool WritePtr,
502 /// This flag indicates if we need to add the runtime check.
504 /// Holds the pointers that we need to check.
505 SmallVector<TrackingVH<Value>, 2> Pointers;
506 /// Holds the pointer value at the beginning of the loop.
507 SmallVector<const SCEV*, 2> Starts;
508 /// Holds the pointer value at the end of the loop.
509 SmallVector<const SCEV*, 2> Ends;
510 /// Holds the information if this pointer is used for writing to memory.
511 SmallVector<bool, 2> IsWritePtr;
512 /// Holds the id of the set of pointers that could be dependent because of a
513 /// shared underlying object.
514 SmallVector<unsigned, 2> DependencySetId;
517 /// A POD for saving information about induction variables.
518 struct InductionInfo {
519 InductionInfo(Value *Start, InductionKind K) : StartValue(Start), IK(K) {}
520 InductionInfo() : StartValue(0), IK(IK_NoInduction) {}
522 TrackingVH<Value> StartValue;
527 /// ReductionList contains the reduction descriptors for all
528 /// of the reductions that were found in the loop.
529 typedef DenseMap<PHINode*, ReductionDescriptor> ReductionList;
531 /// InductionList saves induction variables and maps them to the
532 /// induction descriptor.
533 typedef MapVector<PHINode*, InductionInfo> InductionList;
535 /// Returns true if it is legal to vectorize this loop.
536 /// This does not mean that it is profitable to vectorize this
537 /// loop, only that it is legal to do so.
540 /// Returns the Induction variable.
541 PHINode *getInduction() { return Induction; }
543 /// Returns the reduction variables found in the loop.
544 ReductionList *getReductionVars() { return &Reductions; }
546 /// Returns the induction variables found in the loop.
547 InductionList *getInductionVars() { return &Inductions; }
549 /// Returns the widest induction type.
550 Type *getWidestInductionType() { return WidestIndTy; }
552 /// Returns True if V is an induction variable in this loop.
553 bool isInductionVariable(const Value *V);
555 /// Return true if the block BB needs to be predicated in order for the loop
556 /// to be vectorized.
557 bool blockNeedsPredication(BasicBlock *BB);
559 /// Check if this pointer is consecutive when vectorizing. This happens
560 /// when the last index of the GEP is the induction variable, or that the
561 /// pointer itself is an induction variable.
562 /// This check allows us to vectorize A[idx] into a wide load/store.
564 /// 0 - Stride is unknown or non consecutive.
565 /// 1 - Address is consecutive.
566 /// -1 - Address is consecutive, and decreasing.
567 int isConsecutivePtr(Value *Ptr);
569 /// Returns true if the value V is uniform within the loop.
570 bool isUniform(Value *V);
572 /// Returns true if this instruction will remain scalar after vectorization.
573 bool isUniformAfterVectorization(Instruction* I) { return Uniforms.count(I); }
575 /// Returns the information that we collected about runtime memory check.
576 RuntimePointerCheck *getRuntimePointerCheck() { return &PtrRtCheck; }
578 /// This function returns the identity element (or neutral element) for
580 static Constant *getReductionIdentity(ReductionKind K, Type *Tp);
582 unsigned getMaxSafeDepDistBytes() { return MaxSafeDepDistBytes; }
585 /// Check if a single basic block loop is vectorizable.
586 /// At this point we know that this is a loop with a constant trip count
587 /// and we only need to check individual instructions.
588 bool canVectorizeInstrs();
590 /// When we vectorize loops we may change the order in which
591 /// we read and write from memory. This method checks if it is
592 /// legal to vectorize the code, considering only memory constrains.
593 /// Returns true if the loop is vectorizable
594 bool canVectorizeMemory();
596 /// Return true if we can vectorize this loop using the IF-conversion
598 bool canVectorizeWithIfConvert();
600 /// Collect the variables that need to stay uniform after vectorization.
601 void collectLoopUniforms();
603 /// Return true if all of the instructions in the block can be speculatively
604 /// executed. \p SafePtrs is a list of addresses that are known to be legal
605 /// and we know that we can read from them without segfault.
606 bool blockCanBePredicated(BasicBlock *BB, SmallPtrSet<Value *, 8>& SafePtrs);
608 /// Returns True, if 'Phi' is the kind of reduction variable for type
609 /// 'Kind'. If this is a reduction variable, it adds it to ReductionList.
610 bool AddReductionVar(PHINode *Phi, ReductionKind Kind);
611 /// Returns a struct describing if the instruction 'I' can be a reduction
612 /// variable of type 'Kind'. If the reduction is a min/max pattern of
613 /// select(icmp()) this function advances the instruction pointer 'I' from the
614 /// compare instruction to the select instruction and stores this pointer in
615 /// 'PatternLastInst' member of the returned struct.
616 ReductionInstDesc isReductionInstr(Instruction *I, ReductionKind Kind,
617 ReductionInstDesc &Desc);
618 /// Returns true if the instruction is a Select(ICmp(X, Y), X, Y) instruction
619 /// pattern corresponding to a min(X, Y) or max(X, Y).
620 static ReductionInstDesc isMinMaxSelectCmpPattern(Instruction *I,
621 ReductionInstDesc &Prev);
622 /// Returns the induction kind of Phi. This function may return NoInduction
623 /// if the PHI is not an induction variable.
624 InductionKind isInductionVariable(PHINode *Phi);
626 /// The loop that we evaluate.
630 /// DataLayout analysis.
634 /// Target Library Info.
635 TargetLibraryInfo *TLI;
637 // --- vectorization state --- //
639 /// Holds the integer induction variable. This is the counter of the
642 /// Holds the reduction variables.
643 ReductionList Reductions;
644 /// Holds all of the induction variables that we found in the loop.
645 /// Notice that inductions don't need to start at zero and that induction
646 /// variables can be pointers.
647 InductionList Inductions;
648 /// Holds the widest induction type encountered.
651 /// Allowed outside users. This holds the reduction
652 /// vars which can be accessed from outside the loop.
653 SmallPtrSet<Value*, 4> AllowedExit;
654 /// This set holds the variables which are known to be uniform after
656 SmallPtrSet<Instruction*, 4> Uniforms;
657 /// We need to check that all of the pointers in this list are disjoint
659 RuntimePointerCheck PtrRtCheck;
660 /// Can we assume the absence of NaNs.
661 bool HasFunNoNaNAttr;
663 unsigned MaxSafeDepDistBytes;
666 /// LoopVectorizationCostModel - estimates the expected speedups due to
668 /// In many cases vectorization is not profitable. This can happen because of
669 /// a number of reasons. In this class we mainly attempt to predict the
670 /// expected speedup/slowdowns due to the supported instruction set. We use the
671 /// TargetTransformInfo to query the different backends for the cost of
672 /// different operations.
673 class LoopVectorizationCostModel {
675 LoopVectorizationCostModel(Loop *L, ScalarEvolution *SE, LoopInfo *LI,
676 LoopVectorizationLegality *Legal,
677 const TargetTransformInfo &TTI,
678 DataLayout *DL, const TargetLibraryInfo *TLI)
679 : TheLoop(L), SE(SE), LI(LI), Legal(Legal), TTI(TTI), DL(DL), TLI(TLI) {}
681 /// Information about vectorization costs
682 struct VectorizationFactor {
683 unsigned Width; // Vector width with best cost
684 unsigned Cost; // Cost of the loop with that width
686 /// \return The most profitable vectorization factor and the cost of that VF.
687 /// This method checks every power of two up to VF. If UserVF is not ZERO
688 /// then this vectorization factor will be selected if vectorization is
690 VectorizationFactor selectVectorizationFactor(bool OptForSize,
693 /// \return The size (in bits) of the widest type in the code that
694 /// needs to be vectorized. We ignore values that remain scalar such as
695 /// 64 bit loop indices.
696 unsigned getWidestType();
698 /// \return The most profitable unroll factor.
699 /// If UserUF is non-zero then this method finds the best unroll-factor
700 /// based on register pressure and other parameters.
701 /// VF and LoopCost are the selected vectorization factor and the cost of the
703 unsigned selectUnrollFactor(bool OptForSize, unsigned UserUF, unsigned VF,
706 /// \brief A struct that represents some properties of the register usage
708 struct RegisterUsage {
709 /// Holds the number of loop invariant values that are used in the loop.
710 unsigned LoopInvariantRegs;
711 /// Holds the maximum number of concurrent live intervals in the loop.
712 unsigned MaxLocalUsers;
713 /// Holds the number of instructions in the loop.
714 unsigned NumInstructions;
717 /// \return information about the register usage of the loop.
718 RegisterUsage calculateRegisterUsage();
721 /// Returns the expected execution cost. The unit of the cost does
722 /// not matter because we use the 'cost' units to compare different
723 /// vector widths. The cost that is returned is *not* normalized by
724 /// the factor width.
725 unsigned expectedCost(unsigned VF);
727 /// Returns the execution time cost of an instruction for a given vector
728 /// width. Vector width of one means scalar.
729 unsigned getInstructionCost(Instruction *I, unsigned VF);
731 /// A helper function for converting Scalar types to vector types.
732 /// If the incoming type is void, we return void. If the VF is 1, we return
734 static Type* ToVectorTy(Type *Scalar, unsigned VF);
736 /// Returns whether the instruction is a load or store and will be a emitted
737 /// as a vector operation.
738 bool isConsecutiveLoadOrStore(Instruction *I);
740 /// The loop that we evaluate.
744 /// Loop Info analysis.
746 /// Vectorization legality.
747 LoopVectorizationLegality *Legal;
748 /// Vector target information.
749 const TargetTransformInfo &TTI;
750 /// Target data layout information.
752 /// Target Library Info.
753 const TargetLibraryInfo *TLI;
756 /// Utility class for getting and setting loop vectorizer hints in the form
757 /// of loop metadata.
758 struct LoopVectorizeHints {
759 /// Vectorization width.
761 /// Vectorization unroll factor.
764 LoopVectorizeHints(const Loop *L, bool DisableUnrolling)
765 : Width(VectorizationFactor)
766 , Unroll(DisableUnrolling ? 1 : VectorizationUnroll)
767 , LoopID(L->getLoopID()) {
769 // The command line options override any loop metadata except for when
770 // width == 1 which is used to indicate the loop is already vectorized.
771 if (VectorizationFactor.getNumOccurrences() > 0 && Width != 1)
772 Width = VectorizationFactor;
773 if (VectorizationUnroll.getNumOccurrences() > 0)
774 Unroll = VectorizationUnroll;
776 DEBUG(if (DisableUnrolling && Unroll == 1)
777 dbgs() << "LV: Unrolling disabled by the pass manager\n");
780 /// Return the loop vectorizer metadata prefix.
781 static StringRef Prefix() { return "llvm.vectorizer."; }
783 MDNode *createHint(LLVMContext &Context, StringRef Name, unsigned V) {
784 SmallVector<Value*, 2> Vals;
785 Vals.push_back(MDString::get(Context, Name));
786 Vals.push_back(ConstantInt::get(Type::getInt32Ty(Context), V));
787 return MDNode::get(Context, Vals);
790 /// Mark the loop L as already vectorized by setting the width to 1.
791 void setAlreadyVectorized(Loop *L) {
792 LLVMContext &Context = L->getHeader()->getContext();
796 // Create a new loop id with one more operand for the already_vectorized
797 // hint. If the loop already has a loop id then copy the existing operands.
798 SmallVector<Value*, 4> Vals(1);
800 for (unsigned i = 1, ie = LoopID->getNumOperands(); i < ie; ++i)
801 Vals.push_back(LoopID->getOperand(i));
803 Vals.push_back(createHint(Context, Twine(Prefix(), "width").str(), Width));
805 MDNode *NewLoopID = MDNode::get(Context, Vals);
806 // Set operand 0 to refer to the loop id itself.
807 NewLoopID->replaceOperandWith(0, NewLoopID);
809 L->setLoopID(NewLoopID);
811 LoopID->replaceAllUsesWith(NewLoopID);
819 /// Find hints specified in the loop metadata.
820 void getHints(const Loop *L) {
824 // First operand should refer to the loop id itself.
825 assert(LoopID->getNumOperands() > 0 && "requires at least one operand");
826 assert(LoopID->getOperand(0) == LoopID && "invalid loop id");
828 for (unsigned i = 1, ie = LoopID->getNumOperands(); i < ie; ++i) {
829 const MDString *S = 0;
830 SmallVector<Value*, 4> Args;
832 // The expected hint is either a MDString or a MDNode with the first
833 // operand a MDString.
834 if (const MDNode *MD = dyn_cast<MDNode>(LoopID->getOperand(i))) {
835 if (!MD || MD->getNumOperands() == 0)
837 S = dyn_cast<MDString>(MD->getOperand(0));
838 for (unsigned i = 1, ie = MD->getNumOperands(); i < ie; ++i)
839 Args.push_back(MD->getOperand(i));
841 S = dyn_cast<MDString>(LoopID->getOperand(i));
842 assert(Args.size() == 0 && "too many arguments for MDString");
848 // Check if the hint starts with the vectorizer prefix.
849 StringRef Hint = S->getString();
850 if (!Hint.startswith(Prefix()))
852 // Remove the prefix.
853 Hint = Hint.substr(Prefix().size(), StringRef::npos);
855 if (Args.size() == 1)
856 getHint(Hint, Args[0]);
860 // Check string hint with one operand.
861 void getHint(StringRef Hint, Value *Arg) {
862 const ConstantInt *C = dyn_cast<ConstantInt>(Arg);
864 unsigned Val = C->getZExtValue();
866 if (Hint == "width") {
867 if (isPowerOf2_32(Val) && Val <= MaxVectorWidth)
870 DEBUG(dbgs() << "LV: ignoring invalid width hint metadata");
871 } else if (Hint == "unroll") {
872 if (isPowerOf2_32(Val) && Val <= MaxUnrollFactor)
875 DEBUG(dbgs() << "LV: ignoring invalid unroll hint metadata");
877 DEBUG(dbgs() << "LV: ignoring unknown hint " << Hint);
882 /// The LoopVectorize Pass.
883 struct LoopVectorize : public LoopPass {
884 /// Pass identification, replacement for typeid
887 explicit LoopVectorize(bool NoUnrolling = false)
888 : LoopPass(ID), DisableUnrolling(NoUnrolling) {
889 initializeLoopVectorizePass(*PassRegistry::getPassRegistry());
895 TargetTransformInfo *TTI;
897 TargetLibraryInfo *TLI;
898 bool DisableUnrolling;
900 virtual bool runOnLoop(Loop *L, LPPassManager &LPM) {
901 // We only vectorize innermost loops.
905 SE = &getAnalysis<ScalarEvolution>();
906 DL = getAnalysisIfAvailable<DataLayout>();
907 LI = &getAnalysis<LoopInfo>();
908 TTI = &getAnalysis<TargetTransformInfo>();
909 DT = &getAnalysis<DominatorTree>();
910 TLI = getAnalysisIfAvailable<TargetLibraryInfo>();
913 DEBUG(dbgs() << "LV: Not vectorizing because of missing data layout");
917 DEBUG(dbgs() << "LV: Checking a loop in \"" <<
918 L->getHeader()->getParent()->getName() << "\"\n");
920 LoopVectorizeHints Hints(L, DisableUnrolling);
922 if (Hints.Width == 1 && Hints.Unroll == 1) {
923 DEBUG(dbgs() << "LV: Not vectorizing.\n");
927 // Check if it is legal to vectorize the loop.
928 LoopVectorizationLegality LVL(L, SE, DL, DT, TLI);
929 if (!LVL.canVectorize()) {
930 DEBUG(dbgs() << "LV: Not vectorizing.\n");
934 // Use the cost model.
935 LoopVectorizationCostModel CM(L, SE, LI, &LVL, *TTI, DL, TLI);
937 // Check the function attributes to find out if this function should be
938 // optimized for size.
939 Function *F = L->getHeader()->getParent();
940 Attribute::AttrKind SzAttr = Attribute::OptimizeForSize;
941 Attribute::AttrKind FlAttr = Attribute::NoImplicitFloat;
942 unsigned FnIndex = AttributeSet::FunctionIndex;
943 bool OptForSize = F->getAttributes().hasAttribute(FnIndex, SzAttr);
944 bool NoFloat = F->getAttributes().hasAttribute(FnIndex, FlAttr);
947 DEBUG(dbgs() << "LV: Can't vectorize when the NoImplicitFloat"
948 "attribute is used.\n");
952 // Select the optimal vectorization factor.
953 LoopVectorizationCostModel::VectorizationFactor VF;
954 VF = CM.selectVectorizationFactor(OptForSize, Hints.Width);
955 // Select the unroll factor.
956 unsigned UF = CM.selectUnrollFactor(OptForSize, Hints.Unroll, VF.Width,
960 DEBUG(dbgs() << "LV: Vectorization is possible but not beneficial.\n");
963 DEBUG(dbgs() << "LV: Found a vectorizable loop ("<< VF.Width << ") in "<<
964 F->getParent()->getModuleIdentifier()<<"\n");
965 DEBUG(dbgs() << "LV: Unroll Factor is " << UF << "\n");
970 // We decided not to vectorize, but we may want to unroll.
971 InnerLoopUnroller Unroller(L, SE, LI, DT, DL, TLI, UF);
972 Unroller.vectorize(&LVL);
974 // If we decided that it is *legal* to vectorize the loop then do it.
975 InnerLoopVectorizer LB(L, SE, LI, DT, DL, TLI, VF.Width, UF);
979 // Mark the loop as already vectorized to avoid vectorizing again.
980 Hints.setAlreadyVectorized(L);
982 DEBUG(verifyFunction(*L->getHeader()->getParent()));
986 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
987 LoopPass::getAnalysisUsage(AU);
988 AU.addRequiredID(LoopSimplifyID);
989 AU.addRequiredID(LCSSAID);
990 AU.addRequired<DominatorTree>();
991 AU.addRequired<LoopInfo>();
992 AU.addRequired<ScalarEvolution>();
993 AU.addRequired<TargetTransformInfo>();
994 AU.addPreserved<LoopInfo>();
995 AU.addPreserved<DominatorTree>();
1000 } // end anonymous namespace
1002 //===----------------------------------------------------------------------===//
1003 // Implementation of LoopVectorizationLegality, InnerLoopVectorizer and
1004 // LoopVectorizationCostModel.
1005 //===----------------------------------------------------------------------===//
1008 LoopVectorizationLegality::RuntimePointerCheck::insert(ScalarEvolution *SE,
1009 Loop *Lp, Value *Ptr,
1011 unsigned DepSetId) {
1012 const SCEV *Sc = SE->getSCEV(Ptr);
1013 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Sc);
1014 assert(AR && "Invalid addrec expression");
1015 const SCEV *Ex = SE->getBackedgeTakenCount(Lp);
1016 const SCEV *ScEnd = AR->evaluateAtIteration(Ex, *SE);
1017 Pointers.push_back(Ptr);
1018 Starts.push_back(AR->getStart());
1019 Ends.push_back(ScEnd);
1020 IsWritePtr.push_back(WritePtr);
1021 DependencySetId.push_back(DepSetId);
1024 Value *InnerLoopVectorizer::getBroadcastInstrs(Value *V) {
1025 // Save the current insertion location.
1026 Instruction *Loc = Builder.GetInsertPoint();
1028 // We need to place the broadcast of invariant variables outside the loop.
1029 Instruction *Instr = dyn_cast<Instruction>(V);
1030 bool NewInstr = (Instr && Instr->getParent() == LoopVectorBody);
1031 bool Invariant = OrigLoop->isLoopInvariant(V) && !NewInstr;
1033 // Place the code for broadcasting invariant variables in the new preheader.
1035 Builder.SetInsertPoint(LoopVectorPreHeader->getTerminator());
1037 // Broadcast the scalar into all locations in the vector.
1038 Value *Shuf = Builder.CreateVectorSplat(VF, V, "broadcast");
1040 // Restore the builder insertion point.
1042 Builder.SetInsertPoint(Loc);
1047 Value *InnerLoopVectorizer::getConsecutiveVector(Value* Val, int StartIdx,
1049 assert(Val->getType()->isVectorTy() && "Must be a vector");
1050 assert(Val->getType()->getScalarType()->isIntegerTy() &&
1051 "Elem must be an integer");
1052 // Create the types.
1053 Type *ITy = Val->getType()->getScalarType();
1054 VectorType *Ty = cast<VectorType>(Val->getType());
1055 int VLen = Ty->getNumElements();
1056 SmallVector<Constant*, 8> Indices;
1058 // Create a vector of consecutive numbers from zero to VF.
1059 for (int i = 0; i < VLen; ++i) {
1060 int64_t Idx = Negate ? (-i) : i;
1061 Indices.push_back(ConstantInt::get(ITy, StartIdx + Idx, Negate));
1064 // Add the consecutive indices to the vector value.
1065 Constant *Cv = ConstantVector::get(Indices);
1066 assert(Cv->getType() == Val->getType() && "Invalid consecutive vec");
1067 return Builder.CreateAdd(Val, Cv, "induction");
1070 int LoopVectorizationLegality::isConsecutivePtr(Value *Ptr) {
1071 assert(Ptr->getType()->isPointerTy() && "Unexpected non ptr");
1072 // Make sure that the pointer does not point to structs.
1073 if (cast<PointerType>(Ptr->getType())->getElementType()->isAggregateType())
1076 // If this value is a pointer induction variable we know it is consecutive.
1077 PHINode *Phi = dyn_cast_or_null<PHINode>(Ptr);
1078 if (Phi && Inductions.count(Phi)) {
1079 InductionInfo II = Inductions[Phi];
1080 if (IK_PtrInduction == II.IK)
1082 else if (IK_ReversePtrInduction == II.IK)
1086 GetElementPtrInst *Gep = dyn_cast_or_null<GetElementPtrInst>(Ptr);
1090 unsigned NumOperands = Gep->getNumOperands();
1091 Value *LastIndex = Gep->getOperand(NumOperands - 1);
1093 Value *GpPtr = Gep->getPointerOperand();
1094 // If this GEP value is a consecutive pointer induction variable and all of
1095 // the indices are constant then we know it is consecutive. We can
1096 Phi = dyn_cast<PHINode>(GpPtr);
1097 if (Phi && Inductions.count(Phi)) {
1099 // Make sure that the pointer does not point to structs.
1100 PointerType *GepPtrType = cast<PointerType>(GpPtr->getType());
1101 if (GepPtrType->getElementType()->isAggregateType())
1104 // Make sure that all of the index operands are loop invariant.
1105 for (unsigned i = 1; i < NumOperands; ++i)
1106 if (!SE->isLoopInvariant(SE->getSCEV(Gep->getOperand(i)), TheLoop))
1109 InductionInfo II = Inductions[Phi];
1110 if (IK_PtrInduction == II.IK)
1112 else if (IK_ReversePtrInduction == II.IK)
1116 // Check that all of the gep indices are uniform except for the last.
1117 for (unsigned i = 0; i < NumOperands - 1; ++i)
1118 if (!SE->isLoopInvariant(SE->getSCEV(Gep->getOperand(i)), TheLoop))
1121 // We can emit wide load/stores only if the last index is the induction
1123 const SCEV *Last = SE->getSCEV(LastIndex);
1124 if (const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(Last)) {
1125 const SCEV *Step = AR->getStepRecurrence(*SE);
1127 // The memory is consecutive because the last index is consecutive
1128 // and all other indices are loop invariant.
1131 if (Step->isAllOnesValue())
1138 bool LoopVectorizationLegality::isUniform(Value *V) {
1139 return (SE->isLoopInvariant(SE->getSCEV(V), TheLoop));
1142 InnerLoopVectorizer::VectorParts&
1143 InnerLoopVectorizer::getVectorValue(Value *V) {
1144 assert(V != Induction && "The new induction variable should not be used.");
1145 assert(!V->getType()->isVectorTy() && "Can't widen a vector");
1147 // If we have this scalar in the map, return it.
1148 if (WidenMap.has(V))
1149 return WidenMap.get(V);
1151 // If this scalar is unknown, assume that it is a constant or that it is
1152 // loop invariant. Broadcast V and save the value for future uses.
1153 Value *B = getBroadcastInstrs(V);
1154 return WidenMap.splat(V, B);
1157 Value *InnerLoopVectorizer::reverseVector(Value *Vec) {
1158 assert(Vec->getType()->isVectorTy() && "Invalid type");
1159 SmallVector<Constant*, 8> ShuffleMask;
1160 for (unsigned i = 0; i < VF; ++i)
1161 ShuffleMask.push_back(Builder.getInt32(VF - i - 1));
1163 return Builder.CreateShuffleVector(Vec, UndefValue::get(Vec->getType()),
1164 ConstantVector::get(ShuffleMask),
1169 void InnerLoopVectorizer::vectorizeMemoryInstruction(Instruction *Instr,
1170 LoopVectorizationLegality *Legal) {
1171 // Attempt to issue a wide load.
1172 LoadInst *LI = dyn_cast<LoadInst>(Instr);
1173 StoreInst *SI = dyn_cast<StoreInst>(Instr);
1175 assert((LI || SI) && "Invalid Load/Store instruction");
1177 Type *ScalarDataTy = LI ? LI->getType() : SI->getValueOperand()->getType();
1178 Type *DataTy = VectorType::get(ScalarDataTy, VF);
1179 Value *Ptr = LI ? LI->getPointerOperand() : SI->getPointerOperand();
1180 unsigned Alignment = LI ? LI->getAlignment() : SI->getAlignment();
1181 unsigned AddressSpace = Ptr->getType()->getPointerAddressSpace();
1182 unsigned ScalarAllocatedSize = DL->getTypeAllocSize(ScalarDataTy);
1183 unsigned VectorElementSize = DL->getTypeStoreSize(DataTy)/VF;
1185 if (ScalarAllocatedSize != VectorElementSize)
1186 return scalarizeInstruction(Instr);
1188 // If the pointer is loop invariant or if it is non consecutive,
1189 // scalarize the load.
1190 int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
1191 bool Reverse = ConsecutiveStride < 0;
1192 bool UniformLoad = LI && Legal->isUniform(Ptr);
1193 if (!ConsecutiveStride || UniformLoad)
1194 return scalarizeInstruction(Instr);
1196 Constant *Zero = Builder.getInt32(0);
1197 VectorParts &Entry = WidenMap.get(Instr);
1199 // Handle consecutive loads/stores.
1200 GetElementPtrInst *Gep = dyn_cast<GetElementPtrInst>(Ptr);
1201 if (Gep && Legal->isInductionVariable(Gep->getPointerOperand())) {
1202 setDebugLocFromInst(Builder, Gep);
1203 Value *PtrOperand = Gep->getPointerOperand();
1204 Value *FirstBasePtr = getVectorValue(PtrOperand)[0];
1205 FirstBasePtr = Builder.CreateExtractElement(FirstBasePtr, Zero);
1207 // Create the new GEP with the new induction variable.
1208 GetElementPtrInst *Gep2 = cast<GetElementPtrInst>(Gep->clone());
1209 Gep2->setOperand(0, FirstBasePtr);
1210 Gep2->setName("gep.indvar.base");
1211 Ptr = Builder.Insert(Gep2);
1213 setDebugLocFromInst(Builder, Gep);
1214 assert(SE->isLoopInvariant(SE->getSCEV(Gep->getPointerOperand()),
1215 OrigLoop) && "Base ptr must be invariant");
1217 // The last index does not have to be the induction. It can be
1218 // consecutive and be a function of the index. For example A[I+1];
1219 unsigned NumOperands = Gep->getNumOperands();
1220 unsigned LastOperand = NumOperands - 1;
1221 // Create the new GEP with the new induction variable.
1222 GetElementPtrInst *Gep2 = cast<GetElementPtrInst>(Gep->clone());
1224 for (unsigned i = 0; i < NumOperands; ++i) {
1225 Value *GepOperand = Gep->getOperand(i);
1226 Instruction *GepOperandInst = dyn_cast<Instruction>(GepOperand);
1228 // Update last index or loop invariant instruction anchored in loop.
1229 if (i == LastOperand ||
1230 (GepOperandInst && OrigLoop->contains(GepOperandInst))) {
1231 assert((i == LastOperand ||
1232 SE->isLoopInvariant(SE->getSCEV(GepOperandInst), OrigLoop)) &&
1233 "Must be last index or loop invariant");
1235 VectorParts &GEPParts = getVectorValue(GepOperand);
1236 Value *Index = GEPParts[0];
1237 Index = Builder.CreateExtractElement(Index, Zero);
1238 Gep2->setOperand(i, Index);
1239 Gep2->setName("gep.indvar.idx");
1242 Ptr = Builder.Insert(Gep2);
1244 // Use the induction element ptr.
1245 assert(isa<PHINode>(Ptr) && "Invalid induction ptr");
1246 setDebugLocFromInst(Builder, Ptr);
1247 VectorParts &PtrVal = getVectorValue(Ptr);
1248 Ptr = Builder.CreateExtractElement(PtrVal[0], Zero);
1253 assert(!Legal->isUniform(SI->getPointerOperand()) &&
1254 "We do not allow storing to uniform addresses");
1255 setDebugLocFromInst(Builder, SI);
1256 // We don't want to update the value in the map as it might be used in
1257 // another expression. So don't use a reference type for "StoredVal".
1258 VectorParts StoredVal = getVectorValue(SI->getValueOperand());
1260 for (unsigned Part = 0; Part < UF; ++Part) {
1261 // Calculate the pointer for the specific unroll-part.
1262 Value *PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(Part * VF));
1265 // If we store to reverse consecutive memory locations then we need
1266 // to reverse the order of elements in the stored value.
1267 StoredVal[Part] = reverseVector(StoredVal[Part]);
1268 // If the address is consecutive but reversed, then the
1269 // wide store needs to start at the last vector element.
1270 PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(-Part * VF));
1271 PartPtr = Builder.CreateGEP(PartPtr, Builder.getInt32(1 - VF));
1274 Value *VecPtr = Builder.CreateBitCast(PartPtr,
1275 DataTy->getPointerTo(AddressSpace));
1276 Builder.CreateStore(StoredVal[Part], VecPtr)->setAlignment(Alignment);
1282 assert(LI && "Must have a load instruction");
1283 setDebugLocFromInst(Builder, LI);
1284 for (unsigned Part = 0; Part < UF; ++Part) {
1285 // Calculate the pointer for the specific unroll-part.
1286 Value *PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(Part * VF));
1289 // If the address is consecutive but reversed, then the
1290 // wide store needs to start at the last vector element.
1291 PartPtr = Builder.CreateGEP(Ptr, Builder.getInt32(-Part * VF));
1292 PartPtr = Builder.CreateGEP(PartPtr, Builder.getInt32(1 - VF));
1295 Value *VecPtr = Builder.CreateBitCast(PartPtr,
1296 DataTy->getPointerTo(AddressSpace));
1297 Value *LI = Builder.CreateLoad(VecPtr, "wide.load");
1298 cast<LoadInst>(LI)->setAlignment(Alignment);
1299 Entry[Part] = Reverse ? reverseVector(LI) : LI;
1303 void InnerLoopVectorizer::scalarizeInstruction(Instruction *Instr) {
1304 assert(!Instr->getType()->isAggregateType() && "Can't handle vectors");
1305 // Holds vector parameters or scalars, in case of uniform vals.
1306 SmallVector<VectorParts, 4> Params;
1308 setDebugLocFromInst(Builder, Instr);
1310 // Find all of the vectorized parameters.
1311 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
1312 Value *SrcOp = Instr->getOperand(op);
1314 // If we are accessing the old induction variable, use the new one.
1315 if (SrcOp == OldInduction) {
1316 Params.push_back(getVectorValue(SrcOp));
1320 // Try using previously calculated values.
1321 Instruction *SrcInst = dyn_cast<Instruction>(SrcOp);
1323 // If the src is an instruction that appeared earlier in the basic block
1324 // then it should already be vectorized.
1325 if (SrcInst && OrigLoop->contains(SrcInst)) {
1326 assert(WidenMap.has(SrcInst) && "Source operand is unavailable");
1327 // The parameter is a vector value from earlier.
1328 Params.push_back(WidenMap.get(SrcInst));
1330 // The parameter is a scalar from outside the loop. Maybe even a constant.
1331 VectorParts Scalars;
1332 Scalars.append(UF, SrcOp);
1333 Params.push_back(Scalars);
1337 assert(Params.size() == Instr->getNumOperands() &&
1338 "Invalid number of operands");
1340 // Does this instruction return a value ?
1341 bool IsVoidRetTy = Instr->getType()->isVoidTy();
1343 Value *UndefVec = IsVoidRetTy ? 0 :
1344 UndefValue::get(VectorType::get(Instr->getType(), VF));
1345 // Create a new entry in the WidenMap and initialize it to Undef or Null.
1346 VectorParts &VecResults = WidenMap.splat(Instr, UndefVec);
1348 // For each vector unroll 'part':
1349 for (unsigned Part = 0; Part < UF; ++Part) {
1350 // For each scalar that we create:
1351 for (unsigned Width = 0; Width < VF; ++Width) {
1352 Instruction *Cloned = Instr->clone();
1354 Cloned->setName(Instr->getName() + ".cloned");
1355 // Replace the operands of the cloned instrucions with extracted scalars.
1356 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
1357 Value *Op = Params[op][Part];
1358 // Param is a vector. Need to extract the right lane.
1359 if (Op->getType()->isVectorTy())
1360 Op = Builder.CreateExtractElement(Op, Builder.getInt32(Width));
1361 Cloned->setOperand(op, Op);
1364 // Place the cloned scalar in the new loop.
1365 Builder.Insert(Cloned);
1367 // If the original scalar returns a value we need to place it in a vector
1368 // so that future users will be able to use it.
1370 VecResults[Part] = Builder.CreateInsertElement(VecResults[Part], Cloned,
1371 Builder.getInt32(Width));
1377 InnerLoopVectorizer::addRuntimeCheck(LoopVectorizationLegality *Legal,
1379 LoopVectorizationLegality::RuntimePointerCheck *PtrRtCheck =
1380 Legal->getRuntimePointerCheck();
1382 if (!PtrRtCheck->Need)
1385 unsigned NumPointers = PtrRtCheck->Pointers.size();
1386 SmallVector<TrackingVH<Value> , 2> Starts;
1387 SmallVector<TrackingVH<Value> , 2> Ends;
1389 SCEVExpander Exp(*SE, "induction");
1391 // Use this type for pointer arithmetic.
1392 Type* PtrArithTy = Type::getInt8PtrTy(Loc->getContext(), 0);
1394 for (unsigned i = 0; i < NumPointers; ++i) {
1395 Value *Ptr = PtrRtCheck->Pointers[i];
1396 const SCEV *Sc = SE->getSCEV(Ptr);
1398 if (SE->isLoopInvariant(Sc, OrigLoop)) {
1399 DEBUG(dbgs() << "LV: Adding RT check for a loop invariant ptr:" <<
1401 Starts.push_back(Ptr);
1402 Ends.push_back(Ptr);
1404 DEBUG(dbgs() << "LV: Adding RT check for range:" << *Ptr <<"\n");
1406 Value *Start = Exp.expandCodeFor(PtrRtCheck->Starts[i], PtrArithTy, Loc);
1407 Value *End = Exp.expandCodeFor(PtrRtCheck->Ends[i], PtrArithTy, Loc);
1408 Starts.push_back(Start);
1409 Ends.push_back(End);
1413 IRBuilder<> ChkBuilder(Loc);
1414 // Our instructions might fold to a constant.
1415 Value *MemoryRuntimeCheck = 0;
1416 for (unsigned i = 0; i < NumPointers; ++i) {
1417 for (unsigned j = i+1; j < NumPointers; ++j) {
1418 // No need to check if two readonly pointers intersect.
1419 if (!PtrRtCheck->IsWritePtr[i] && !PtrRtCheck->IsWritePtr[j])
1422 // Only need to check pointers between two different dependency sets.
1423 if (PtrRtCheck->DependencySetId[i] == PtrRtCheck->DependencySetId[j])
1426 Value *Start0 = ChkBuilder.CreateBitCast(Starts[i], PtrArithTy, "bc");
1427 Value *Start1 = ChkBuilder.CreateBitCast(Starts[j], PtrArithTy, "bc");
1428 Value *End0 = ChkBuilder.CreateBitCast(Ends[i], PtrArithTy, "bc");
1429 Value *End1 = ChkBuilder.CreateBitCast(Ends[j], PtrArithTy, "bc");
1431 Value *Cmp0 = ChkBuilder.CreateICmpULE(Start0, End1, "bound0");
1432 Value *Cmp1 = ChkBuilder.CreateICmpULE(Start1, End0, "bound1");
1433 Value *IsConflict = ChkBuilder.CreateAnd(Cmp0, Cmp1, "found.conflict");
1434 if (MemoryRuntimeCheck)
1435 IsConflict = ChkBuilder.CreateOr(MemoryRuntimeCheck, IsConflict,
1437 MemoryRuntimeCheck = IsConflict;
1441 // We have to do this trickery because the IRBuilder might fold the check to a
1442 // constant expression in which case there is no Instruction anchored in a
1444 LLVMContext &Ctx = Loc->getContext();
1445 Instruction * Check = BinaryOperator::CreateAnd(MemoryRuntimeCheck,
1446 ConstantInt::getTrue(Ctx));
1447 ChkBuilder.Insert(Check, "memcheck.conflict");
1452 InnerLoopVectorizer::createEmptyLoop(LoopVectorizationLegality *Legal) {
1454 In this function we generate a new loop. The new loop will contain
1455 the vectorized instructions while the old loop will continue to run the
1458 [ ] <-- vector loop bypass (may consist of multiple blocks).
1461 | [ ] <-- vector pre header.
1465 | [ ]_| <-- vector loop.
1468 >[ ] <--- middle-block.
1471 | [ ] <--- new preheader.
1475 | [ ]_| <-- old scalar loop to handle remainder.
1478 >[ ] <-- exit block.
1482 BasicBlock *OldBasicBlock = OrigLoop->getHeader();
1483 BasicBlock *BypassBlock = OrigLoop->getLoopPreheader();
1484 BasicBlock *ExitBlock = OrigLoop->getExitBlock();
1485 assert(ExitBlock && "Must have an exit block");
1487 // Some loops have a single integer induction variable, while other loops
1488 // don't. One example is c++ iterators that often have multiple pointer
1489 // induction variables. In the code below we also support a case where we
1490 // don't have a single induction variable.
1491 OldInduction = Legal->getInduction();
1492 Type *IdxTy = Legal->getWidestInductionType();
1494 // Find the loop boundaries.
1495 const SCEV *ExitCount = SE->getBackedgeTakenCount(OrigLoop);
1496 assert(ExitCount != SE->getCouldNotCompute() && "Invalid loop count");
1498 // Get the total trip count from the count by adding 1.
1499 ExitCount = SE->getAddExpr(ExitCount,
1500 SE->getConstant(ExitCount->getType(), 1));
1502 // Expand the trip count and place the new instructions in the preheader.
1503 // Notice that the pre-header does not change, only the loop body.
1504 SCEVExpander Exp(*SE, "induction");
1506 // Count holds the overall loop count (N).
1507 Value *Count = Exp.expandCodeFor(ExitCount, ExitCount->getType(),
1508 BypassBlock->getTerminator());
1510 // The loop index does not have to start at Zero. Find the original start
1511 // value from the induction PHI node. If we don't have an induction variable
1512 // then we know that it starts at zero.
1513 Builder.SetInsertPoint(BypassBlock->getTerminator());
1514 Value *StartIdx = ExtendedIdx = OldInduction ?
1515 Builder.CreateZExt(OldInduction->getIncomingValueForBlock(BypassBlock),
1517 ConstantInt::get(IdxTy, 0);
1519 assert(BypassBlock && "Invalid loop structure");
1520 LoopBypassBlocks.push_back(BypassBlock);
1522 // Split the single block loop into the two loop structure described above.
1523 BasicBlock *VectorPH =
1524 BypassBlock->splitBasicBlock(BypassBlock->getTerminator(), "vector.ph");
1525 BasicBlock *VecBody =
1526 VectorPH->splitBasicBlock(VectorPH->getTerminator(), "vector.body");
1527 BasicBlock *MiddleBlock =
1528 VecBody->splitBasicBlock(VecBody->getTerminator(), "middle.block");
1529 BasicBlock *ScalarPH =
1530 MiddleBlock->splitBasicBlock(MiddleBlock->getTerminator(), "scalar.ph");
1532 // Create and register the new vector loop.
1533 Loop* Lp = new Loop();
1534 Loop *ParentLoop = OrigLoop->getParentLoop();
1536 // Insert the new loop into the loop nest and register the new basic blocks
1537 // before calling any utilities such as SCEV that require valid LoopInfo.
1539 ParentLoop->addChildLoop(Lp);
1540 ParentLoop->addBasicBlockToLoop(ScalarPH, LI->getBase());
1541 ParentLoop->addBasicBlockToLoop(VectorPH, LI->getBase());
1542 ParentLoop->addBasicBlockToLoop(MiddleBlock, LI->getBase());
1544 LI->addTopLevelLoop(Lp);
1546 Lp->addBasicBlockToLoop(VecBody, LI->getBase());
1548 // Use this IR builder to create the loop instructions (Phi, Br, Cmp)
1550 Builder.SetInsertPoint(VecBody->getFirstInsertionPt());
1552 // Generate the induction variable.
1553 setDebugLocFromInst(Builder, getDebugLocFromInstOrOperands(OldInduction));
1554 Induction = Builder.CreatePHI(IdxTy, 2, "index");
1555 // The loop step is equal to the vectorization factor (num of SIMD elements)
1556 // times the unroll factor (num of SIMD instructions).
1557 Constant *Step = ConstantInt::get(IdxTy, VF * UF);
1559 // This is the IR builder that we use to add all of the logic for bypassing
1560 // the new vector loop.
1561 IRBuilder<> BypassBuilder(BypassBlock->getTerminator());
1562 setDebugLocFromInst(BypassBuilder,
1563 getDebugLocFromInstOrOperands(OldInduction));
1565 // We may need to extend the index in case there is a type mismatch.
1566 // We know that the count starts at zero and does not overflow.
1567 if (Count->getType() != IdxTy) {
1568 // The exit count can be of pointer type. Convert it to the correct
1570 if (ExitCount->getType()->isPointerTy())
1571 Count = BypassBuilder.CreatePointerCast(Count, IdxTy, "ptrcnt.to.int");
1573 Count = BypassBuilder.CreateZExtOrTrunc(Count, IdxTy, "cnt.cast");
1576 // Add the start index to the loop count to get the new end index.
1577 Value *IdxEnd = BypassBuilder.CreateAdd(Count, StartIdx, "end.idx");
1579 // Now we need to generate the expression for N - (N % VF), which is
1580 // the part that the vectorized body will execute.
1581 Value *R = BypassBuilder.CreateURem(Count, Step, "n.mod.vf");
1582 Value *CountRoundDown = BypassBuilder.CreateSub(Count, R, "n.vec");
1583 Value *IdxEndRoundDown = BypassBuilder.CreateAdd(CountRoundDown, StartIdx,
1584 "end.idx.rnd.down");
1586 // Now, compare the new count to zero. If it is zero skip the vector loop and
1587 // jump to the scalar loop.
1588 Value *Cmp = BypassBuilder.CreateICmpEQ(IdxEndRoundDown, StartIdx,
1591 BasicBlock *LastBypassBlock = BypassBlock;
1593 // Generate the code that checks in runtime if arrays overlap. We put the
1594 // checks into a separate block to make the more common case of few elements
1596 Instruction *MemRuntimeCheck = addRuntimeCheck(Legal,
1597 BypassBlock->getTerminator());
1598 if (MemRuntimeCheck) {
1599 // Create a new block containing the memory check.
1600 BasicBlock *CheckBlock = BypassBlock->splitBasicBlock(MemRuntimeCheck,
1603 ParentLoop->addBasicBlockToLoop(CheckBlock, LI->getBase());
1604 LoopBypassBlocks.push_back(CheckBlock);
1606 // Replace the branch into the memory check block with a conditional branch
1607 // for the "few elements case".
1608 Instruction *OldTerm = BypassBlock->getTerminator();
1609 BranchInst::Create(MiddleBlock, CheckBlock, Cmp, OldTerm);
1610 OldTerm->eraseFromParent();
1612 Cmp = MemRuntimeCheck;
1613 LastBypassBlock = CheckBlock;
1616 LastBypassBlock->getTerminator()->eraseFromParent();
1617 BranchInst::Create(MiddleBlock, VectorPH, Cmp,
1620 // We are going to resume the execution of the scalar loop.
1621 // Go over all of the induction variables that we found and fix the
1622 // PHIs that are left in the scalar version of the loop.
1623 // The starting values of PHI nodes depend on the counter of the last
1624 // iteration in the vectorized loop.
1625 // If we come from a bypass edge then we need to start from the original
1628 // This variable saves the new starting index for the scalar loop.
1629 PHINode *ResumeIndex = 0;
1630 LoopVectorizationLegality::InductionList::iterator I, E;
1631 LoopVectorizationLegality::InductionList *List = Legal->getInductionVars();
1632 // Set builder to point to last bypass block.
1633 BypassBuilder.SetInsertPoint(LoopBypassBlocks.back()->getTerminator());
1634 for (I = List->begin(), E = List->end(); I != E; ++I) {
1635 PHINode *OrigPhi = I->first;
1636 LoopVectorizationLegality::InductionInfo II = I->second;
1638 Type *ResumeValTy = (OrigPhi == OldInduction) ? IdxTy : OrigPhi->getType();
1639 PHINode *ResumeVal = PHINode::Create(ResumeValTy, 2, "resume.val",
1640 MiddleBlock->getTerminator());
1641 // We might have extended the type of the induction variable but we need a
1642 // truncated version for the scalar loop.
1643 PHINode *TruncResumeVal = (OrigPhi == OldInduction) ?
1644 PHINode::Create(OrigPhi->getType(), 2, "trunc.resume.val",
1645 MiddleBlock->getTerminator()) : 0;
1647 Value *EndValue = 0;
1649 case LoopVectorizationLegality::IK_NoInduction:
1650 llvm_unreachable("Unknown induction");
1651 case LoopVectorizationLegality::IK_IntInduction: {
1652 // Handle the integer induction counter.
1653 assert(OrigPhi->getType()->isIntegerTy() && "Invalid type");
1655 // We have the canonical induction variable.
1656 if (OrigPhi == OldInduction) {
1657 // Create a truncated version of the resume value for the scalar loop,
1658 // we might have promoted the type to a larger width.
1660 BypassBuilder.CreateTrunc(IdxEndRoundDown, OrigPhi->getType());
1661 // The new PHI merges the original incoming value, in case of a bypass,
1662 // or the value at the end of the vectorized loop.
1663 for (unsigned I = 0, E = LoopBypassBlocks.size(); I != E; ++I)
1664 TruncResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[I]);
1665 TruncResumeVal->addIncoming(EndValue, VecBody);
1667 // We know what the end value is.
1668 EndValue = IdxEndRoundDown;
1669 // We also know which PHI node holds it.
1670 ResumeIndex = ResumeVal;
1674 // Not the canonical induction variable - add the vector loop count to the
1676 Value *CRD = BypassBuilder.CreateSExtOrTrunc(CountRoundDown,
1677 II.StartValue->getType(),
1679 EndValue = BypassBuilder.CreateAdd(CRD, II.StartValue , "ind.end");
1682 case LoopVectorizationLegality::IK_ReverseIntInduction: {
1683 // Convert the CountRoundDown variable to the PHI size.
1684 Value *CRD = BypassBuilder.CreateSExtOrTrunc(CountRoundDown,
1685 II.StartValue->getType(),
1687 // Handle reverse integer induction counter.
1688 EndValue = BypassBuilder.CreateSub(II.StartValue, CRD, "rev.ind.end");
1691 case LoopVectorizationLegality::IK_PtrInduction: {
1692 // For pointer induction variables, calculate the offset using
1694 EndValue = BypassBuilder.CreateGEP(II.StartValue, CountRoundDown,
1698 case LoopVectorizationLegality::IK_ReversePtrInduction: {
1699 // The value at the end of the loop for the reverse pointer is calculated
1700 // by creating a GEP with a negative index starting from the start value.
1701 Value *Zero = ConstantInt::get(CountRoundDown->getType(), 0);
1702 Value *NegIdx = BypassBuilder.CreateSub(Zero, CountRoundDown,
1704 EndValue = BypassBuilder.CreateGEP(II.StartValue, NegIdx,
1710 // The new PHI merges the original incoming value, in case of a bypass,
1711 // or the value at the end of the vectorized loop.
1712 for (unsigned I = 0, E = LoopBypassBlocks.size(); I != E; ++I) {
1713 if (OrigPhi == OldInduction)
1714 ResumeVal->addIncoming(StartIdx, LoopBypassBlocks[I]);
1716 ResumeVal->addIncoming(II.StartValue, LoopBypassBlocks[I]);
1718 ResumeVal->addIncoming(EndValue, VecBody);
1720 // Fix the scalar body counter (PHI node).
1721 unsigned BlockIdx = OrigPhi->getBasicBlockIndex(ScalarPH);
1722 // The old inductions phi node in the scalar body needs the truncated value.
1723 if (OrigPhi == OldInduction)
1724 OrigPhi->setIncomingValue(BlockIdx, TruncResumeVal);
1726 OrigPhi->setIncomingValue(BlockIdx, ResumeVal);
1729 // If we are generating a new induction variable then we also need to
1730 // generate the code that calculates the exit value. This value is not
1731 // simply the end of the counter because we may skip the vectorized body
1732 // in case of a runtime check.
1734 assert(!ResumeIndex && "Unexpected resume value found");
1735 ResumeIndex = PHINode::Create(IdxTy, 2, "new.indc.resume.val",
1736 MiddleBlock->getTerminator());
1737 for (unsigned I = 0, E = LoopBypassBlocks.size(); I != E; ++I)
1738 ResumeIndex->addIncoming(StartIdx, LoopBypassBlocks[I]);
1739 ResumeIndex->addIncoming(IdxEndRoundDown, VecBody);
1742 // Make sure that we found the index where scalar loop needs to continue.
1743 assert(ResumeIndex && ResumeIndex->getType()->isIntegerTy() &&
1744 "Invalid resume Index");
1746 // Add a check in the middle block to see if we have completed
1747 // all of the iterations in the first vector loop.
1748 // If (N - N%VF) == N, then we *don't* need to run the remainder.
1749 Value *CmpN = CmpInst::Create(Instruction::ICmp, CmpInst::ICMP_EQ, IdxEnd,
1750 ResumeIndex, "cmp.n",
1751 MiddleBlock->getTerminator());
1753 BranchInst::Create(ExitBlock, ScalarPH, CmpN, MiddleBlock->getTerminator());
1754 // Remove the old terminator.
1755 MiddleBlock->getTerminator()->eraseFromParent();
1757 // Create i+1 and fill the PHINode.
1758 Value *NextIdx = Builder.CreateAdd(Induction, Step, "index.next");
1759 Induction->addIncoming(StartIdx, VectorPH);
1760 Induction->addIncoming(NextIdx, VecBody);
1761 // Create the compare.
1762 Value *ICmp = Builder.CreateICmpEQ(NextIdx, IdxEndRoundDown);
1763 Builder.CreateCondBr(ICmp, MiddleBlock, VecBody);
1765 // Now we have two terminators. Remove the old one from the block.
1766 VecBody->getTerminator()->eraseFromParent();
1768 // Get ready to start creating new instructions into the vectorized body.
1769 Builder.SetInsertPoint(VecBody->getFirstInsertionPt());
1772 LoopVectorPreHeader = VectorPH;
1773 LoopScalarPreHeader = ScalarPH;
1774 LoopMiddleBlock = MiddleBlock;
1775 LoopExitBlock = ExitBlock;
1776 LoopVectorBody = VecBody;
1777 LoopScalarBody = OldBasicBlock;
1780 /// This function returns the identity element (or neutral element) for
1781 /// the operation K.
1783 LoopVectorizationLegality::getReductionIdentity(ReductionKind K, Type *Tp) {
1788 // Adding, Xoring, Oring zero to a number does not change it.
1789 return ConstantInt::get(Tp, 0);
1790 case RK_IntegerMult:
1791 // Multiplying a number by 1 does not change it.
1792 return ConstantInt::get(Tp, 1);
1794 // AND-ing a number with an all-1 value does not change it.
1795 return ConstantInt::get(Tp, -1, true);
1797 // Multiplying a number by 1 does not change it.
1798 return ConstantFP::get(Tp, 1.0L);
1800 // Adding zero to a number does not change it.
1801 return ConstantFP::get(Tp, 0.0L);
1803 llvm_unreachable("Unknown reduction kind");
1807 static Intrinsic::ID
1808 getIntrinsicIDForCall(CallInst *CI, const TargetLibraryInfo *TLI) {
1809 // If we have an intrinsic call, check if it is trivially vectorizable.
1810 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI)) {
1811 switch (II->getIntrinsicID()) {
1812 case Intrinsic::sqrt:
1813 case Intrinsic::sin:
1814 case Intrinsic::cos:
1815 case Intrinsic::exp:
1816 case Intrinsic::exp2:
1817 case Intrinsic::log:
1818 case Intrinsic::log10:
1819 case Intrinsic::log2:
1820 case Intrinsic::fabs:
1821 case Intrinsic::copysign:
1822 case Intrinsic::floor:
1823 case Intrinsic::ceil:
1824 case Intrinsic::trunc:
1825 case Intrinsic::rint:
1826 case Intrinsic::nearbyint:
1827 case Intrinsic::round:
1828 case Intrinsic::pow:
1829 case Intrinsic::fma:
1830 case Intrinsic::fmuladd:
1831 case Intrinsic::lifetime_start:
1832 case Intrinsic::lifetime_end:
1833 return II->getIntrinsicID();
1835 return Intrinsic::not_intrinsic;
1840 return Intrinsic::not_intrinsic;
1843 Function *F = CI->getCalledFunction();
1844 // We're going to make assumptions on the semantics of the functions, check
1845 // that the target knows that it's available in this environment.
1846 if (!F || !TLI->getLibFunc(F->getName(), Func))
1847 return Intrinsic::not_intrinsic;
1849 // Otherwise check if we have a call to a function that can be turned into a
1850 // vector intrinsic.
1857 return Intrinsic::sin;
1861 return Intrinsic::cos;
1865 return Intrinsic::exp;
1867 case LibFunc::exp2f:
1868 case LibFunc::exp2l:
1869 return Intrinsic::exp2;
1873 return Intrinsic::log;
1874 case LibFunc::log10:
1875 case LibFunc::log10f:
1876 case LibFunc::log10l:
1877 return Intrinsic::log10;
1879 case LibFunc::log2f:
1880 case LibFunc::log2l:
1881 return Intrinsic::log2;
1883 case LibFunc::fabsf:
1884 case LibFunc::fabsl:
1885 return Intrinsic::fabs;
1886 case LibFunc::copysign:
1887 case LibFunc::copysignf:
1888 case LibFunc::copysignl:
1889 return Intrinsic::copysign;
1890 case LibFunc::floor:
1891 case LibFunc::floorf:
1892 case LibFunc::floorl:
1893 return Intrinsic::floor;
1895 case LibFunc::ceilf:
1896 case LibFunc::ceill:
1897 return Intrinsic::ceil;
1898 case LibFunc::trunc:
1899 case LibFunc::truncf:
1900 case LibFunc::truncl:
1901 return Intrinsic::trunc;
1903 case LibFunc::rintf:
1904 case LibFunc::rintl:
1905 return Intrinsic::rint;
1906 case LibFunc::nearbyint:
1907 case LibFunc::nearbyintf:
1908 case LibFunc::nearbyintl:
1909 return Intrinsic::nearbyint;
1910 case LibFunc::round:
1911 case LibFunc::roundf:
1912 case LibFunc::roundl:
1913 return Intrinsic::round;
1917 return Intrinsic::pow;
1920 return Intrinsic::not_intrinsic;
1923 /// This function translates the reduction kind to an LLVM binary operator.
1925 getReductionBinOp(LoopVectorizationLegality::ReductionKind Kind) {
1927 case LoopVectorizationLegality::RK_IntegerAdd:
1928 return Instruction::Add;
1929 case LoopVectorizationLegality::RK_IntegerMult:
1930 return Instruction::Mul;
1931 case LoopVectorizationLegality::RK_IntegerOr:
1932 return Instruction::Or;
1933 case LoopVectorizationLegality::RK_IntegerAnd:
1934 return Instruction::And;
1935 case LoopVectorizationLegality::RK_IntegerXor:
1936 return Instruction::Xor;
1937 case LoopVectorizationLegality::RK_FloatMult:
1938 return Instruction::FMul;
1939 case LoopVectorizationLegality::RK_FloatAdd:
1940 return Instruction::FAdd;
1941 case LoopVectorizationLegality::RK_IntegerMinMax:
1942 return Instruction::ICmp;
1943 case LoopVectorizationLegality::RK_FloatMinMax:
1944 return Instruction::FCmp;
1946 llvm_unreachable("Unknown reduction operation");
1950 Value *createMinMaxOp(IRBuilder<> &Builder,
1951 LoopVectorizationLegality::MinMaxReductionKind RK,
1954 CmpInst::Predicate P = CmpInst::ICMP_NE;
1957 llvm_unreachable("Unknown min/max reduction kind");
1958 case LoopVectorizationLegality::MRK_UIntMin:
1959 P = CmpInst::ICMP_ULT;
1961 case LoopVectorizationLegality::MRK_UIntMax:
1962 P = CmpInst::ICMP_UGT;
1964 case LoopVectorizationLegality::MRK_SIntMin:
1965 P = CmpInst::ICMP_SLT;
1967 case LoopVectorizationLegality::MRK_SIntMax:
1968 P = CmpInst::ICMP_SGT;
1970 case LoopVectorizationLegality::MRK_FloatMin:
1971 P = CmpInst::FCMP_OLT;
1973 case LoopVectorizationLegality::MRK_FloatMax:
1974 P = CmpInst::FCMP_OGT;
1979 if (RK == LoopVectorizationLegality::MRK_FloatMin ||
1980 RK == LoopVectorizationLegality::MRK_FloatMax)
1981 Cmp = Builder.CreateFCmp(P, Left, Right, "rdx.minmax.cmp");
1983 Cmp = Builder.CreateICmp(P, Left, Right, "rdx.minmax.cmp");
1985 Value *Select = Builder.CreateSelect(Cmp, Left, Right, "rdx.minmax.select");
1990 InnerLoopVectorizer::vectorizeLoop(LoopVectorizationLegality *Legal) {
1991 //===------------------------------------------------===//
1993 // Notice: any optimization or new instruction that go
1994 // into the code below should be also be implemented in
1997 //===------------------------------------------------===//
1998 Constant *Zero = Builder.getInt32(0);
2000 // In order to support reduction variables we need to be able to vectorize
2001 // Phi nodes. Phi nodes have cycles, so we need to vectorize them in two
2002 // stages. First, we create a new vector PHI node with no incoming edges.
2003 // We use this value when we vectorize all of the instructions that use the
2004 // PHI. Next, after all of the instructions in the block are complete we
2005 // add the new incoming edges to the PHI. At this point all of the
2006 // instructions in the basic block are vectorized, so we can use them to
2007 // construct the PHI.
2008 PhiVector RdxPHIsToFix;
2010 // Scan the loop in a topological order to ensure that defs are vectorized
2012 LoopBlocksDFS DFS(OrigLoop);
2015 // Vectorize all of the blocks in the original loop.
2016 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
2017 be = DFS.endRPO(); bb != be; ++bb)
2018 vectorizeBlockInLoop(Legal, *bb, &RdxPHIsToFix);
2020 // At this point every instruction in the original loop is widened to
2021 // a vector form. We are almost done. Now, we need to fix the PHI nodes
2022 // that we vectorized. The PHI nodes are currently empty because we did
2023 // not want to introduce cycles. Notice that the remaining PHI nodes
2024 // that we need to fix are reduction variables.
2026 // Create the 'reduced' values for each of the induction vars.
2027 // The reduced values are the vector values that we scalarize and combine
2028 // after the loop is finished.
2029 for (PhiVector::iterator it = RdxPHIsToFix.begin(), e = RdxPHIsToFix.end();
2031 PHINode *RdxPhi = *it;
2032 assert(RdxPhi && "Unable to recover vectorized PHI");
2034 // Find the reduction variable descriptor.
2035 assert(Legal->getReductionVars()->count(RdxPhi) &&
2036 "Unable to find the reduction variable");
2037 LoopVectorizationLegality::ReductionDescriptor RdxDesc =
2038 (*Legal->getReductionVars())[RdxPhi];
2040 setDebugLocFromInst(Builder, RdxDesc.StartValue);
2042 // We need to generate a reduction vector from the incoming scalar.
2043 // To do so, we need to generate the 'identity' vector and overide
2044 // one of the elements with the incoming scalar reduction. We need
2045 // to do it in the vector-loop preheader.
2046 Builder.SetInsertPoint(LoopBypassBlocks.front()->getTerminator());
2048 // This is the vector-clone of the value that leaves the loop.
2049 VectorParts &VectorExit = getVectorValue(RdxDesc.LoopExitInstr);
2050 Type *VecTy = VectorExit[0]->getType();
2052 // Find the reduction identity variable. Zero for addition, or, xor,
2053 // one for multiplication, -1 for And.
2056 if (RdxDesc.Kind == LoopVectorizationLegality::RK_IntegerMinMax ||
2057 RdxDesc.Kind == LoopVectorizationLegality::RK_FloatMinMax) {
2058 // MinMax reduction have the start value as their identify.
2060 VectorStart = Identity = RdxDesc.StartValue;
2062 VectorStart = Identity = Builder.CreateVectorSplat(VF,
2067 // Handle other reduction kinds:
2069 LoopVectorizationLegality::getReductionIdentity(RdxDesc.Kind,
2070 VecTy->getScalarType());
2073 // This vector is the Identity vector where the first element is the
2074 // incoming scalar reduction.
2075 VectorStart = RdxDesc.StartValue;
2077 Identity = ConstantVector::getSplat(VF, Iden);
2079 // This vector is the Identity vector where the first element is the
2080 // incoming scalar reduction.
2081 VectorStart = Builder.CreateInsertElement(Identity,
2082 RdxDesc.StartValue, Zero);
2086 // Fix the vector-loop phi.
2087 // We created the induction variable so we know that the
2088 // preheader is the first entry.
2089 BasicBlock *VecPreheader = Induction->getIncomingBlock(0);
2091 // Reductions do not have to start at zero. They can start with
2092 // any loop invariant values.
2093 VectorParts &VecRdxPhi = WidenMap.get(RdxPhi);
2094 BasicBlock *Latch = OrigLoop->getLoopLatch();
2095 Value *LoopVal = RdxPhi->getIncomingValueForBlock(Latch);
2096 VectorParts &Val = getVectorValue(LoopVal);
2097 for (unsigned part = 0; part < UF; ++part) {
2098 // Make sure to add the reduction stat value only to the
2099 // first unroll part.
2100 Value *StartVal = (part == 0) ? VectorStart : Identity;
2101 cast<PHINode>(VecRdxPhi[part])->addIncoming(StartVal, VecPreheader);
2102 cast<PHINode>(VecRdxPhi[part])->addIncoming(Val[part], LoopVectorBody);
2105 // Before each round, move the insertion point right between
2106 // the PHIs and the values we are going to write.
2107 // This allows us to write both PHINodes and the extractelement
2109 Builder.SetInsertPoint(LoopMiddleBlock->getFirstInsertionPt());
2111 VectorParts RdxParts;
2112 setDebugLocFromInst(Builder, RdxDesc.LoopExitInstr);
2113 for (unsigned part = 0; part < UF; ++part) {
2114 // This PHINode contains the vectorized reduction variable, or
2115 // the initial value vector, if we bypass the vector loop.
2116 VectorParts &RdxExitVal = getVectorValue(RdxDesc.LoopExitInstr);
2117 PHINode *NewPhi = Builder.CreatePHI(VecTy, 2, "rdx.vec.exit.phi");
2118 Value *StartVal = (part == 0) ? VectorStart : Identity;
2119 for (unsigned I = 0, E = LoopBypassBlocks.size(); I != E; ++I)
2120 NewPhi->addIncoming(StartVal, LoopBypassBlocks[I]);
2121 NewPhi->addIncoming(RdxExitVal[part], LoopVectorBody);
2122 RdxParts.push_back(NewPhi);
2125 // Reduce all of the unrolled parts into a single vector.
2126 Value *ReducedPartRdx = RdxParts[0];
2127 unsigned Op = getReductionBinOp(RdxDesc.Kind);
2128 setDebugLocFromInst(Builder, ReducedPartRdx);
2129 for (unsigned part = 1; part < UF; ++part) {
2130 if (Op != Instruction::ICmp && Op != Instruction::FCmp)
2131 ReducedPartRdx = Builder.CreateBinOp((Instruction::BinaryOps)Op,
2132 RdxParts[part], ReducedPartRdx,
2135 ReducedPartRdx = createMinMaxOp(Builder, RdxDesc.MinMaxKind,
2136 ReducedPartRdx, RdxParts[part]);
2140 // VF is a power of 2 so we can emit the reduction using log2(VF) shuffles
2141 // and vector ops, reducing the set of values being computed by half each
2143 assert(isPowerOf2_32(VF) &&
2144 "Reduction emission only supported for pow2 vectors!");
2145 Value *TmpVec = ReducedPartRdx;
2146 SmallVector<Constant*, 32> ShuffleMask(VF, 0);
2147 for (unsigned i = VF; i != 1; i >>= 1) {
2148 // Move the upper half of the vector to the lower half.
2149 for (unsigned j = 0; j != i/2; ++j)
2150 ShuffleMask[j] = Builder.getInt32(i/2 + j);
2152 // Fill the rest of the mask with undef.
2153 std::fill(&ShuffleMask[i/2], ShuffleMask.end(),
2154 UndefValue::get(Builder.getInt32Ty()));
2157 Builder.CreateShuffleVector(TmpVec,
2158 UndefValue::get(TmpVec->getType()),
2159 ConstantVector::get(ShuffleMask),
2162 if (Op != Instruction::ICmp && Op != Instruction::FCmp)
2163 TmpVec = Builder.CreateBinOp((Instruction::BinaryOps)Op, TmpVec, Shuf,
2166 TmpVec = createMinMaxOp(Builder, RdxDesc.MinMaxKind, TmpVec, Shuf);
2169 // The result is in the first element of the vector.
2170 ReducedPartRdx = Builder.CreateExtractElement(TmpVec,
2171 Builder.getInt32(0));
2174 // Now, we need to fix the users of the reduction variable
2175 // inside and outside of the scalar remainder loop.
2176 // We know that the loop is in LCSSA form. We need to update the
2177 // PHI nodes in the exit blocks.
2178 for (BasicBlock::iterator LEI = LoopExitBlock->begin(),
2179 LEE = LoopExitBlock->end(); LEI != LEE; ++LEI) {
2180 PHINode *LCSSAPhi = dyn_cast<PHINode>(LEI);
2181 if (!LCSSAPhi) break;
2183 // All PHINodes need to have a single entry edge, or two if
2184 // we already fixed them.
2185 assert(LCSSAPhi->getNumIncomingValues() < 3 && "Invalid LCSSA PHI");
2187 // We found our reduction value exit-PHI. Update it with the
2188 // incoming bypass edge.
2189 if (LCSSAPhi->getIncomingValue(0) == RdxDesc.LoopExitInstr) {
2190 // Add an edge coming from the bypass.
2191 LCSSAPhi->addIncoming(ReducedPartRdx, LoopMiddleBlock);
2194 }// end of the LCSSA phi scan.
2196 // Fix the scalar loop reduction variable with the incoming reduction sum
2197 // from the vector body and from the backedge value.
2198 int IncomingEdgeBlockIdx =
2199 (RdxPhi)->getBasicBlockIndex(OrigLoop->getLoopLatch());
2200 assert(IncomingEdgeBlockIdx >= 0 && "Invalid block index");
2201 // Pick the other block.
2202 int SelfEdgeBlockIdx = (IncomingEdgeBlockIdx ? 0 : 1);
2203 (RdxPhi)->setIncomingValue(SelfEdgeBlockIdx, ReducedPartRdx);
2204 (RdxPhi)->setIncomingValue(IncomingEdgeBlockIdx, RdxDesc.LoopExitInstr);
2205 }// end of for each redux variable.
2210 void InnerLoopVectorizer::fixLCSSAPHIs() {
2211 for (BasicBlock::iterator LEI = LoopExitBlock->begin(),
2212 LEE = LoopExitBlock->end(); LEI != LEE; ++LEI) {
2213 PHINode *LCSSAPhi = dyn_cast<PHINode>(LEI);
2214 if (!LCSSAPhi) break;
2215 if (LCSSAPhi->getNumIncomingValues() == 1)
2216 LCSSAPhi->addIncoming(UndefValue::get(LCSSAPhi->getType()),
2221 InnerLoopVectorizer::VectorParts
2222 InnerLoopVectorizer::createEdgeMask(BasicBlock *Src, BasicBlock *Dst) {
2223 assert(std::find(pred_begin(Dst), pred_end(Dst), Src) != pred_end(Dst) &&
2226 // Look for cached value.
2227 std::pair<BasicBlock*, BasicBlock*> Edge(Src, Dst);
2228 EdgeMaskCache::iterator ECEntryIt = MaskCache.find(Edge);
2229 if (ECEntryIt != MaskCache.end())
2230 return ECEntryIt->second;
2232 VectorParts SrcMask = createBlockInMask(Src);
2234 // The terminator has to be a branch inst!
2235 BranchInst *BI = dyn_cast<BranchInst>(Src->getTerminator());
2236 assert(BI && "Unexpected terminator found");
2238 if (BI->isConditional()) {
2239 VectorParts EdgeMask = getVectorValue(BI->getCondition());
2241 if (BI->getSuccessor(0) != Dst)
2242 for (unsigned part = 0; part < UF; ++part)
2243 EdgeMask[part] = Builder.CreateNot(EdgeMask[part]);
2245 for (unsigned part = 0; part < UF; ++part)
2246 EdgeMask[part] = Builder.CreateAnd(EdgeMask[part], SrcMask[part]);
2248 MaskCache[Edge] = EdgeMask;
2252 MaskCache[Edge] = SrcMask;
2256 InnerLoopVectorizer::VectorParts
2257 InnerLoopVectorizer::createBlockInMask(BasicBlock *BB) {
2258 assert(OrigLoop->contains(BB) && "Block is not a part of a loop");
2260 // Loop incoming mask is all-one.
2261 if (OrigLoop->getHeader() == BB) {
2262 Value *C = ConstantInt::get(IntegerType::getInt1Ty(BB->getContext()), 1);
2263 return getVectorValue(C);
2266 // This is the block mask. We OR all incoming edges, and with zero.
2267 Value *Zero = ConstantInt::get(IntegerType::getInt1Ty(BB->getContext()), 0);
2268 VectorParts BlockMask = getVectorValue(Zero);
2271 for (pred_iterator it = pred_begin(BB), e = pred_end(BB); it != e; ++it) {
2272 VectorParts EM = createEdgeMask(*it, BB);
2273 for (unsigned part = 0; part < UF; ++part)
2274 BlockMask[part] = Builder.CreateOr(BlockMask[part], EM[part]);
2280 void InnerLoopVectorizer::widenPHIInstruction(Instruction *PN,
2281 InnerLoopVectorizer::VectorParts &Entry,
2282 LoopVectorizationLegality *Legal,
2283 unsigned UF, unsigned VF, PhiVector *PV) {
2284 PHINode* P = cast<PHINode>(PN);
2285 // Handle reduction variables:
2286 if (Legal->getReductionVars()->count(P)) {
2287 for (unsigned part = 0; part < UF; ++part) {
2288 // This is phase one of vectorizing PHIs.
2289 Type *VecTy = (VF == 1) ? PN->getType() :
2290 VectorType::get(PN->getType(), VF);
2291 Entry[part] = PHINode::Create(VecTy, 2, "vec.phi",
2292 LoopVectorBody-> getFirstInsertionPt());
2298 setDebugLocFromInst(Builder, P);
2299 // Check for PHI nodes that are lowered to vector selects.
2300 if (P->getParent() != OrigLoop->getHeader()) {
2301 // We know that all PHIs in non header blocks are converted into
2302 // selects, so we don't have to worry about the insertion order and we
2303 // can just use the builder.
2304 // At this point we generate the predication tree. There may be
2305 // duplications since this is a simple recursive scan, but future
2306 // optimizations will clean it up.
2308 unsigned NumIncoming = P->getNumIncomingValues();
2310 // Generate a sequence of selects of the form:
2311 // SELECT(Mask3, In3,
2312 // SELECT(Mask2, In2,
2314 for (unsigned In = 0; In < NumIncoming; In++) {
2315 VectorParts Cond = createEdgeMask(P->getIncomingBlock(In),
2317 VectorParts &In0 = getVectorValue(P->getIncomingValue(In));
2319 for (unsigned part = 0; part < UF; ++part) {
2320 // We might have single edge PHIs (blocks) - use an identity
2321 // 'select' for the first PHI operand.
2323 Entry[part] = Builder.CreateSelect(Cond[part], In0[part],
2326 // Select between the current value and the previous incoming edge
2327 // based on the incoming mask.
2328 Entry[part] = Builder.CreateSelect(Cond[part], In0[part],
2329 Entry[part], "predphi");
2335 // This PHINode must be an induction variable.
2336 // Make sure that we know about it.
2337 assert(Legal->getInductionVars()->count(P) &&
2338 "Not an induction variable");
2340 LoopVectorizationLegality::InductionInfo II =
2341 Legal->getInductionVars()->lookup(P);
2344 case LoopVectorizationLegality::IK_NoInduction:
2345 llvm_unreachable("Unknown induction");
2346 case LoopVectorizationLegality::IK_IntInduction: {
2347 assert(P->getType() == II.StartValue->getType() && "Types must match");
2348 Type *PhiTy = P->getType();
2350 if (P == OldInduction) {
2351 // Handle the canonical induction variable. We might have had to
2353 Broadcasted = Builder.CreateTrunc(Induction, PhiTy);
2355 // Handle other induction variables that are now based on the
2357 Value *NormalizedIdx = Builder.CreateSub(Induction, ExtendedIdx,
2359 NormalizedIdx = Builder.CreateSExtOrTrunc(NormalizedIdx, PhiTy);
2360 Broadcasted = Builder.CreateAdd(II.StartValue, NormalizedIdx,
2363 Broadcasted = getBroadcastInstrs(Broadcasted);
2364 // After broadcasting the induction variable we need to make the vector
2365 // consecutive by adding 0, 1, 2, etc.
2366 for (unsigned part = 0; part < UF; ++part)
2367 Entry[part] = getConsecutiveVector(Broadcasted, VF * part, false);
2370 case LoopVectorizationLegality::IK_ReverseIntInduction:
2371 case LoopVectorizationLegality::IK_PtrInduction:
2372 case LoopVectorizationLegality::IK_ReversePtrInduction:
2373 // Handle reverse integer and pointer inductions.
2374 Value *StartIdx = ExtendedIdx;
2375 // This is the normalized GEP that starts counting at zero.
2376 Value *NormalizedIdx = Builder.CreateSub(Induction, StartIdx,
2379 // Handle the reverse integer induction variable case.
2380 if (LoopVectorizationLegality::IK_ReverseIntInduction == II.IK) {
2381 IntegerType *DstTy = cast<IntegerType>(II.StartValue->getType());
2382 Value *CNI = Builder.CreateSExtOrTrunc(NormalizedIdx, DstTy,
2384 Value *ReverseInd = Builder.CreateSub(II.StartValue, CNI,
2387 // This is a new value so do not hoist it out.
2388 Value *Broadcasted = getBroadcastInstrs(ReverseInd);
2389 // After broadcasting the induction variable we need to make the
2390 // vector consecutive by adding ... -3, -2, -1, 0.
2391 for (unsigned part = 0; part < UF; ++part)
2392 Entry[part] = getConsecutiveVector(Broadcasted, -(int)VF * part,
2397 // Handle the pointer induction variable case.
2398 assert(P->getType()->isPointerTy() && "Unexpected type.");
2400 // Is this a reverse induction ptr or a consecutive induction ptr.
2401 bool Reverse = (LoopVectorizationLegality::IK_ReversePtrInduction ==
2404 // This is the vector of results. Notice that we don't generate
2405 // vector geps because scalar geps result in better code.
2406 for (unsigned part = 0; part < UF; ++part) {
2408 int EltIndex = (part) * (Reverse ? -1 : 1);
2409 Constant *Idx = ConstantInt::get(Induction->getType(), EltIndex);
2412 GlobalIdx = Builder.CreateSub(Idx, NormalizedIdx, "gep.ridx");
2414 GlobalIdx = Builder.CreateAdd(NormalizedIdx, Idx, "gep.idx");
2416 Value *SclrGep = Builder.CreateGEP(II.StartValue, GlobalIdx,
2418 Entry[part] = SclrGep;
2422 Value *VecVal = UndefValue::get(VectorType::get(P->getType(), VF));
2423 for (unsigned int i = 0; i < VF; ++i) {
2424 int EltIndex = (i + part * VF) * (Reverse ? -1 : 1);
2425 Constant *Idx = ConstantInt::get(Induction->getType(), EltIndex);
2428 GlobalIdx = Builder.CreateAdd(NormalizedIdx, Idx, "gep.idx");
2430 GlobalIdx = Builder.CreateSub(Idx, NormalizedIdx, "gep.ridx");
2432 Value *SclrGep = Builder.CreateGEP(II.StartValue, GlobalIdx,
2434 VecVal = Builder.CreateInsertElement(VecVal, SclrGep,
2435 Builder.getInt32(i),
2438 Entry[part] = VecVal;
2445 InnerLoopVectorizer::vectorizeBlockInLoop(LoopVectorizationLegality *Legal,
2446 BasicBlock *BB, PhiVector *PV) {
2447 // For each instruction in the old loop.
2448 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
2449 VectorParts &Entry = WidenMap.get(it);
2450 switch (it->getOpcode()) {
2451 case Instruction::Br:
2452 // Nothing to do for PHIs and BR, since we already took care of the
2453 // loop control flow instructions.
2455 case Instruction::PHI:{
2456 // Vectorize PHINodes.
2457 widenPHIInstruction(it, Entry, Legal, UF, VF, PV);
2461 case Instruction::Add:
2462 case Instruction::FAdd:
2463 case Instruction::Sub:
2464 case Instruction::FSub:
2465 case Instruction::Mul:
2466 case Instruction::FMul:
2467 case Instruction::UDiv:
2468 case Instruction::SDiv:
2469 case Instruction::FDiv:
2470 case Instruction::URem:
2471 case Instruction::SRem:
2472 case Instruction::FRem:
2473 case Instruction::Shl:
2474 case Instruction::LShr:
2475 case Instruction::AShr:
2476 case Instruction::And:
2477 case Instruction::Or:
2478 case Instruction::Xor: {
2479 // Just widen binops.
2480 BinaryOperator *BinOp = dyn_cast<BinaryOperator>(it);
2481 setDebugLocFromInst(Builder, BinOp);
2482 VectorParts &A = getVectorValue(it->getOperand(0));
2483 VectorParts &B = getVectorValue(it->getOperand(1));
2485 // Use this vector value for all users of the original instruction.
2486 for (unsigned Part = 0; Part < UF; ++Part) {
2487 Value *V = Builder.CreateBinOp(BinOp->getOpcode(), A[Part], B[Part]);
2489 // Update the NSW, NUW and Exact flags. Notice: V can be an Undef.
2490 BinaryOperator *VecOp = dyn_cast<BinaryOperator>(V);
2491 if (VecOp && isa<OverflowingBinaryOperator>(BinOp)) {
2492 VecOp->setHasNoSignedWrap(BinOp->hasNoSignedWrap());
2493 VecOp->setHasNoUnsignedWrap(BinOp->hasNoUnsignedWrap());
2495 if (VecOp && isa<PossiblyExactOperator>(VecOp))
2496 VecOp->setIsExact(BinOp->isExact());
2502 case Instruction::Select: {
2504 // If the selector is loop invariant we can create a select
2505 // instruction with a scalar condition. Otherwise, use vector-select.
2506 bool InvariantCond = SE->isLoopInvariant(SE->getSCEV(it->getOperand(0)),
2508 setDebugLocFromInst(Builder, it);
2510 // The condition can be loop invariant but still defined inside the
2511 // loop. This means that we can't just use the original 'cond' value.
2512 // We have to take the 'vectorized' value and pick the first lane.
2513 // Instcombine will make this a no-op.
2514 VectorParts &Cond = getVectorValue(it->getOperand(0));
2515 VectorParts &Op0 = getVectorValue(it->getOperand(1));
2516 VectorParts &Op1 = getVectorValue(it->getOperand(2));
2518 Value *ScalarCond = (VF == 1) ? Cond[0] :
2519 Builder.CreateExtractElement(Cond[0], Builder.getInt32(0));
2521 for (unsigned Part = 0; Part < UF; ++Part) {
2522 Entry[Part] = Builder.CreateSelect(
2523 InvariantCond ? ScalarCond : Cond[Part],
2530 case Instruction::ICmp:
2531 case Instruction::FCmp: {
2532 // Widen compares. Generate vector compares.
2533 bool FCmp = (it->getOpcode() == Instruction::FCmp);
2534 CmpInst *Cmp = dyn_cast<CmpInst>(it);
2535 setDebugLocFromInst(Builder, it);
2536 VectorParts &A = getVectorValue(it->getOperand(0));
2537 VectorParts &B = getVectorValue(it->getOperand(1));
2538 for (unsigned Part = 0; Part < UF; ++Part) {
2541 C = Builder.CreateFCmp(Cmp->getPredicate(), A[Part], B[Part]);
2543 C = Builder.CreateICmp(Cmp->getPredicate(), A[Part], B[Part]);
2549 case Instruction::Store:
2550 case Instruction::Load:
2551 vectorizeMemoryInstruction(it, Legal);
2553 case Instruction::ZExt:
2554 case Instruction::SExt:
2555 case Instruction::FPToUI:
2556 case Instruction::FPToSI:
2557 case Instruction::FPExt:
2558 case Instruction::PtrToInt:
2559 case Instruction::IntToPtr:
2560 case Instruction::SIToFP:
2561 case Instruction::UIToFP:
2562 case Instruction::Trunc:
2563 case Instruction::FPTrunc:
2564 case Instruction::BitCast: {
2565 CastInst *CI = dyn_cast<CastInst>(it);
2566 setDebugLocFromInst(Builder, it);
2567 /// Optimize the special case where the source is the induction
2568 /// variable. Notice that we can only optimize the 'trunc' case
2569 /// because: a. FP conversions lose precision, b. sext/zext may wrap,
2570 /// c. other casts depend on pointer size.
2571 if (CI->getOperand(0) == OldInduction &&
2572 it->getOpcode() == Instruction::Trunc) {
2573 Value *ScalarCast = Builder.CreateCast(CI->getOpcode(), Induction,
2575 Value *Broadcasted = getBroadcastInstrs(ScalarCast);
2576 for (unsigned Part = 0; Part < UF; ++Part)
2577 Entry[Part] = getConsecutiveVector(Broadcasted, VF * Part, false);
2580 /// Vectorize casts.
2581 Type *DestTy = (VF == 1) ? CI->getType() :
2582 VectorType::get(CI->getType(), VF);
2584 VectorParts &A = getVectorValue(it->getOperand(0));
2585 for (unsigned Part = 0; Part < UF; ++Part)
2586 Entry[Part] = Builder.CreateCast(CI->getOpcode(), A[Part], DestTy);
2590 case Instruction::Call: {
2591 // Ignore dbg intrinsics.
2592 if (isa<DbgInfoIntrinsic>(it))
2594 setDebugLocFromInst(Builder, it);
2596 Module *M = BB->getParent()->getParent();
2597 CallInst *CI = cast<CallInst>(it);
2598 Intrinsic::ID ID = getIntrinsicIDForCall(CI, TLI);
2599 assert(ID && "Not an intrinsic call!");
2601 case Intrinsic::lifetime_end:
2602 case Intrinsic::lifetime_start:
2603 scalarizeInstruction(it);
2606 for (unsigned Part = 0; Part < UF; ++Part) {
2607 SmallVector<Value *, 4> Args;
2608 for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) {
2609 VectorParts &Arg = getVectorValue(CI->getArgOperand(i));
2610 Args.push_back(Arg[Part]);
2612 Type *Tys[] = {CI->getType()};
2614 Tys[0] = VectorType::get(CI->getType()->getScalarType(), VF);
2616 Function *F = Intrinsic::getDeclaration(M, ID, Tys);
2617 Entry[Part] = Builder.CreateCall(F, Args);
2625 // All other instructions are unsupported. Scalarize them.
2626 scalarizeInstruction(it);
2629 }// end of for_each instr.
2632 void InnerLoopVectorizer::updateAnalysis() {
2633 // Forget the original basic block.
2634 SE->forgetLoop(OrigLoop);
2636 // Update the dominator tree information.
2637 assert(DT->properlyDominates(LoopBypassBlocks.front(), LoopExitBlock) &&
2638 "Entry does not dominate exit.");
2640 for (unsigned I = 1, E = LoopBypassBlocks.size(); I != E; ++I)
2641 DT->addNewBlock(LoopBypassBlocks[I], LoopBypassBlocks[I-1]);
2642 DT->addNewBlock(LoopVectorPreHeader, LoopBypassBlocks.back());
2643 DT->addNewBlock(LoopVectorBody, LoopVectorPreHeader);
2644 DT->addNewBlock(LoopMiddleBlock, LoopBypassBlocks.front());
2645 DT->addNewBlock(LoopScalarPreHeader, LoopMiddleBlock);
2646 DT->changeImmediateDominator(LoopScalarBody, LoopScalarPreHeader);
2647 DT->changeImmediateDominator(LoopExitBlock, LoopMiddleBlock);
2649 DEBUG(DT->verifyAnalysis());
2652 bool LoopVectorizationLegality::canVectorizeWithIfConvert() {
2653 if (!EnableIfConversion)
2656 assert(TheLoop->getNumBlocks() > 1 && "Single block loops are vectorizable");
2657 std::vector<BasicBlock*> &LoopBlocks = TheLoop->getBlocksVector();
2659 // A list of pointers that we can safely read and write to.
2660 SmallPtrSet<Value *, 8> SafePointes;
2662 // Collect safe addresses.
2663 for (unsigned i = 0, e = LoopBlocks.size(); i < e; ++i) {
2664 BasicBlock *BB = LoopBlocks[i];
2666 if (blockNeedsPredication(BB))
2669 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
2670 if (LoadInst *LI = dyn_cast<LoadInst>(I))
2671 SafePointes.insert(LI->getPointerOperand());
2672 else if (StoreInst *SI = dyn_cast<StoreInst>(I))
2673 SafePointes.insert(SI->getPointerOperand());
2677 // Collect the blocks that need predication.
2678 for (unsigned i = 0, e = LoopBlocks.size(); i < e; ++i) {
2679 BasicBlock *BB = LoopBlocks[i];
2681 // We don't support switch statements inside loops.
2682 if (!isa<BranchInst>(BB->getTerminator()))
2685 // We must be able to predicate all blocks that need to be predicated.
2686 if (blockNeedsPredication(BB) && !blockCanBePredicated(BB, SafePointes))
2690 // We can if-convert this loop.
2694 bool LoopVectorizationLegality::canVectorize() {
2695 // We must have a loop in canonical form. Loops with indirectbr in them cannot
2696 // be canonicalized.
2697 if (!TheLoop->getLoopPreheader())
2700 // We can only vectorize innermost loops.
2701 if (TheLoop->getSubLoopsVector().size())
2704 // We must have a single backedge.
2705 if (TheLoop->getNumBackEdges() != 1)
2708 // We must have a single exiting block.
2709 if (!TheLoop->getExitingBlock())
2712 unsigned NumBlocks = TheLoop->getNumBlocks();
2714 // Check if we can if-convert non single-bb loops.
2715 if (NumBlocks != 1 && !canVectorizeWithIfConvert()) {
2716 DEBUG(dbgs() << "LV: Can't if-convert the loop.\n");
2720 // We need to have a loop header.
2721 BasicBlock *Latch = TheLoop->getLoopLatch();
2722 DEBUG(dbgs() << "LV: Found a loop: " <<
2723 TheLoop->getHeader()->getName() << "\n");
2725 // ScalarEvolution needs to be able to find the exit count.
2726 const SCEV *ExitCount = SE->getBackedgeTakenCount(TheLoop);
2727 if (ExitCount == SE->getCouldNotCompute()) {
2728 DEBUG(dbgs() << "LV: SCEV could not compute the loop exit count.\n");
2732 // Do not loop-vectorize loops with a tiny trip count.
2733 unsigned TC = SE->getSmallConstantTripCount(TheLoop, Latch);
2734 if (TC > 0u && TC < TinyTripCountVectorThreshold) {
2735 DEBUG(dbgs() << "LV: Found a loop with a very small trip count. " <<
2736 "This loop is not worth vectorizing.\n");
2740 // Check if we can vectorize the instructions and CFG in this loop.
2741 if (!canVectorizeInstrs()) {
2742 DEBUG(dbgs() << "LV: Can't vectorize the instructions or CFG\n");
2746 // Go over each instruction and look at memory deps.
2747 if (!canVectorizeMemory()) {
2748 DEBUG(dbgs() << "LV: Can't vectorize due to memory conflicts\n");
2752 // Collect all of the variables that remain uniform after vectorization.
2753 collectLoopUniforms();
2755 DEBUG(dbgs() << "LV: We can vectorize this loop" <<
2756 (PtrRtCheck.Need ? " (with a runtime bound check)" : "")
2759 // Okay! We can vectorize. At this point we don't have any other mem analysis
2760 // which may limit our maximum vectorization factor, so just return true with
2765 static Type *convertPointerToIntegerType(DataLayout &DL, Type *Ty) {
2766 if (Ty->isPointerTy())
2767 return DL.getIntPtrType(Ty);
2772 static Type* getWiderType(DataLayout &DL, Type *Ty0, Type *Ty1) {
2773 Ty0 = convertPointerToIntegerType(DL, Ty0);
2774 Ty1 = convertPointerToIntegerType(DL, Ty1);
2775 if (Ty0->getScalarSizeInBits() > Ty1->getScalarSizeInBits())
2780 /// \brief Check that the instruction has outside loop users and is not an
2781 /// identified reduction variable.
2782 static bool hasOutsideLoopUser(const Loop *TheLoop, Instruction *Inst,
2783 SmallPtrSet<Value *, 4> &Reductions) {
2784 // Reduction instructions are allowed to have exit users. All other
2785 // instructions must not have external users.
2786 if (!Reductions.count(Inst))
2787 //Check that all of the users of the loop are inside the BB.
2788 for (Value::use_iterator I = Inst->use_begin(), E = Inst->use_end();
2790 Instruction *U = cast<Instruction>(*I);
2791 // This user may be a reduction exit value.
2792 if (!TheLoop->contains(U)) {
2793 DEBUG(dbgs() << "LV: Found an outside user for : "<< *U << "\n");
2800 bool LoopVectorizationLegality::canVectorizeInstrs() {
2801 BasicBlock *PreHeader = TheLoop->getLoopPreheader();
2802 BasicBlock *Header = TheLoop->getHeader();
2804 // Look for the attribute signaling the absence of NaNs.
2805 Function &F = *Header->getParent();
2806 if (F.hasFnAttribute("no-nans-fp-math"))
2807 HasFunNoNaNAttr = F.getAttributes().getAttribute(
2808 AttributeSet::FunctionIndex,
2809 "no-nans-fp-math").getValueAsString() == "true";
2811 // For each block in the loop.
2812 for (Loop::block_iterator bb = TheLoop->block_begin(),
2813 be = TheLoop->block_end(); bb != be; ++bb) {
2815 // Scan the instructions in the block and look for hazards.
2816 for (BasicBlock::iterator it = (*bb)->begin(), e = (*bb)->end(); it != e;
2819 if (PHINode *Phi = dyn_cast<PHINode>(it)) {
2820 Type *PhiTy = Phi->getType();
2821 // Check that this PHI type is allowed.
2822 if (!PhiTy->isIntegerTy() &&
2823 !PhiTy->isFloatingPointTy() &&
2824 !PhiTy->isPointerTy()) {
2825 DEBUG(dbgs() << "LV: Found an non-int non-pointer PHI.\n");
2829 // If this PHINode is not in the header block, then we know that we
2830 // can convert it to select during if-conversion. No need to check if
2831 // the PHIs in this block are induction or reduction variables.
2832 if (*bb != Header) {
2833 // Check that this instruction has no outside users or is an
2834 // identified reduction value with an outside user.
2835 if(!hasOutsideLoopUser(TheLoop, it, AllowedExit))
2840 // We only allow if-converted PHIs with more than two incoming values.
2841 if (Phi->getNumIncomingValues() != 2) {
2842 DEBUG(dbgs() << "LV: Found an invalid PHI.\n");
2846 // This is the value coming from the preheader.
2847 Value *StartValue = Phi->getIncomingValueForBlock(PreHeader);
2848 // Check if this is an induction variable.
2849 InductionKind IK = isInductionVariable(Phi);
2851 if (IK_NoInduction != IK) {
2852 // Get the widest type.
2854 WidestIndTy = convertPointerToIntegerType(*DL, PhiTy);
2856 WidestIndTy = getWiderType(*DL, PhiTy, WidestIndTy);
2858 // Int inductions are special because we only allow one IV.
2859 if (IK == IK_IntInduction) {
2860 // Use the phi node with the widest type as induction. Use the last
2861 // one if there are multiple (no good reason for doing this other
2862 // than it is expedient).
2863 if (!Induction || PhiTy == WidestIndTy)
2867 DEBUG(dbgs() << "LV: Found an induction variable.\n");
2868 Inductions[Phi] = InductionInfo(StartValue, IK);
2870 // Until we explicitly handle the case of an induction variable with
2871 // an outside loop user we have to give up vectorizing this loop.
2872 if (hasOutsideLoopUser(TheLoop, it, AllowedExit))
2878 if (AddReductionVar(Phi, RK_IntegerAdd)) {
2879 DEBUG(dbgs() << "LV: Found an ADD reduction PHI."<< *Phi <<"\n");
2882 if (AddReductionVar(Phi, RK_IntegerMult)) {
2883 DEBUG(dbgs() << "LV: Found a MUL reduction PHI."<< *Phi <<"\n");
2886 if (AddReductionVar(Phi, RK_IntegerOr)) {
2887 DEBUG(dbgs() << "LV: Found an OR reduction PHI."<< *Phi <<"\n");
2890 if (AddReductionVar(Phi, RK_IntegerAnd)) {
2891 DEBUG(dbgs() << "LV: Found an AND reduction PHI."<< *Phi <<"\n");
2894 if (AddReductionVar(Phi, RK_IntegerXor)) {
2895 DEBUG(dbgs() << "LV: Found a XOR reduction PHI."<< *Phi <<"\n");
2898 if (AddReductionVar(Phi, RK_IntegerMinMax)) {
2899 DEBUG(dbgs() << "LV: Found a MINMAX reduction PHI."<< *Phi <<"\n");
2902 if (AddReductionVar(Phi, RK_FloatMult)) {
2903 DEBUG(dbgs() << "LV: Found an FMult reduction PHI."<< *Phi <<"\n");
2906 if (AddReductionVar(Phi, RK_FloatAdd)) {
2907 DEBUG(dbgs() << "LV: Found an FAdd reduction PHI."<< *Phi <<"\n");
2910 if (AddReductionVar(Phi, RK_FloatMinMax)) {
2911 DEBUG(dbgs() << "LV: Found an float MINMAX reduction PHI."<< *Phi <<
2916 DEBUG(dbgs() << "LV: Found an unidentified PHI."<< *Phi <<"\n");
2918 }// end of PHI handling
2920 // We still don't handle functions. However, we can ignore dbg intrinsic
2921 // calls and we do handle certain intrinsic and libm functions.
2922 CallInst *CI = dyn_cast<CallInst>(it);
2923 if (CI && !getIntrinsicIDForCall(CI, TLI) && !isa<DbgInfoIntrinsic>(CI)) {
2924 DEBUG(dbgs() << "LV: Found a call site.\n");
2928 // Check that the instruction return type is vectorizable.
2929 if (!VectorType::isValidElementType(it->getType()) &&
2930 !it->getType()->isVoidTy()) {
2931 DEBUG(dbgs() << "LV: Found unvectorizable type." << "\n");
2935 // Check that the stored type is vectorizable.
2936 if (StoreInst *ST = dyn_cast<StoreInst>(it)) {
2937 Type *T = ST->getValueOperand()->getType();
2938 if (!VectorType::isValidElementType(T))
2942 // Reduction instructions are allowed to have exit users.
2943 // All other instructions must not have external users.
2944 if (hasOutsideLoopUser(TheLoop, it, AllowedExit))
2952 DEBUG(dbgs() << "LV: Did not find one integer induction var.\n");
2953 if (Inductions.empty())
2960 void LoopVectorizationLegality::collectLoopUniforms() {
2961 // We now know that the loop is vectorizable!
2962 // Collect variables that will remain uniform after vectorization.
2963 std::vector<Value*> Worklist;
2964 BasicBlock *Latch = TheLoop->getLoopLatch();
2966 // Start with the conditional branch and walk up the block.
2967 Worklist.push_back(Latch->getTerminator()->getOperand(0));
2969 while (Worklist.size()) {
2970 Instruction *I = dyn_cast<Instruction>(Worklist.back());
2971 Worklist.pop_back();
2973 // Look at instructions inside this loop.
2974 // Stop when reaching PHI nodes.
2975 // TODO: we need to follow values all over the loop, not only in this block.
2976 if (!I || !TheLoop->contains(I) || isa<PHINode>(I))
2979 // This is a known uniform.
2982 // Insert all operands.
2983 Worklist.insert(Worklist.end(), I->op_begin(), I->op_end());
2988 /// \brief Analyses memory accesses in a loop.
2990 /// Checks whether run time pointer checks are needed and builds sets for data
2991 /// dependence checking.
2992 class AccessAnalysis {
2994 /// \brief Read or write access location.
2995 typedef PointerIntPair<Value *, 1, bool> MemAccessInfo;
2996 typedef SmallPtrSet<MemAccessInfo, 8> MemAccessInfoSet;
2998 /// \brief Set of potential dependent memory accesses.
2999 typedef EquivalenceClasses<MemAccessInfo> DepCandidates;
3001 AccessAnalysis(DataLayout *Dl, DepCandidates &DA) :
3002 DL(Dl), DepCands(DA), AreAllWritesIdentified(true),
3003 AreAllReadsIdentified(true), IsRTCheckNeeded(false) {}
3005 /// \brief Register a load and whether it is only read from.
3006 void addLoad(Value *Ptr, bool IsReadOnly) {
3007 Accesses.insert(MemAccessInfo(Ptr, false));
3009 ReadOnlyPtr.insert(Ptr);
3012 /// \brief Register a store.
3013 void addStore(Value *Ptr) {
3014 Accesses.insert(MemAccessInfo(Ptr, true));
3017 /// \brief Check whether we can check the pointers at runtime for
3018 /// non-intersection.
3019 bool canCheckPtrAtRT(LoopVectorizationLegality::RuntimePointerCheck &RtCheck,
3020 unsigned &NumComparisons, ScalarEvolution *SE,
3023 /// \brief Goes over all memory accesses, checks whether a RT check is needed
3024 /// and builds sets of dependent accesses.
3025 void buildDependenceSets() {
3026 // Process read-write pointers first.
3027 processMemAccesses(false);
3028 // Next, process read pointers.
3029 processMemAccesses(true);
3032 bool isRTCheckNeeded() { return IsRTCheckNeeded; }
3034 bool isDependencyCheckNeeded() { return !CheckDeps.empty(); }
3036 MemAccessInfoSet &getDependenciesToCheck() { return CheckDeps; }
3039 typedef SetVector<MemAccessInfo> PtrAccessSet;
3040 typedef DenseMap<Value*, MemAccessInfo> UnderlyingObjToAccessMap;
3042 /// \brief Go over all memory access or only the deferred ones if
3043 /// \p UseDeferred is true and check whether runtime pointer checks are needed
3044 /// and build sets of dependency check candidates.
3045 void processMemAccesses(bool UseDeferred);
3047 /// Set of all accesses.
3048 PtrAccessSet Accesses;
3050 /// Set of access to check after all writes have been processed.
3051 PtrAccessSet DeferredAccesses;
3053 /// Map of pointers to last access encountered.
3054 UnderlyingObjToAccessMap ObjToLastAccess;
3056 /// Set of accesses that need a further dependence check.
3057 MemAccessInfoSet CheckDeps;
3059 /// Set of pointers that are read only.
3060 SmallPtrSet<Value*, 16> ReadOnlyPtr;
3062 /// Set of underlying objects already written to.
3063 SmallPtrSet<Value*, 16> WriteObjects;
3067 /// Sets of potentially dependent accesses - members of one set share an
3068 /// underlying pointer. The set "CheckDeps" identfies which sets really need a
3069 /// dependence check.
3070 DepCandidates &DepCands;
3072 bool AreAllWritesIdentified;
3073 bool AreAllReadsIdentified;
3074 bool IsRTCheckNeeded;
3077 } // end anonymous namespace
3079 /// \brief Check whether a pointer can participate in a runtime bounds check.
3080 static bool hasComputableBounds(ScalarEvolution *SE, Value *Ptr) {
3081 const SCEV *PtrScev = SE->getSCEV(Ptr);
3082 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(PtrScev);
3086 return AR->isAffine();
3089 bool AccessAnalysis::canCheckPtrAtRT(
3090 LoopVectorizationLegality::RuntimePointerCheck &RtCheck,
3091 unsigned &NumComparisons, ScalarEvolution *SE,
3093 // Find pointers with computable bounds. We are going to use this information
3094 // to place a runtime bound check.
3095 unsigned NumReadPtrChecks = 0;
3096 unsigned NumWritePtrChecks = 0;
3097 bool CanDoRT = true;
3099 bool IsDepCheckNeeded = isDependencyCheckNeeded();
3100 // We assign consecutive id to access from different dependence sets.
3101 // Accesses within the same set don't need a runtime check.
3102 unsigned RunningDepId = 1;
3103 DenseMap<Value *, unsigned> DepSetId;
3105 for (PtrAccessSet::iterator AI = Accesses.begin(), AE = Accesses.end();
3107 const MemAccessInfo &Access = *AI;
3108 Value *Ptr = Access.getPointer();
3109 bool IsWrite = Access.getInt();
3111 // Just add write checks if we have both.
3112 if (!IsWrite && Accesses.count(MemAccessInfo(Ptr, true)))
3116 ++NumWritePtrChecks;
3120 if (hasComputableBounds(SE, Ptr)) {
3121 // The id of the dependence set.
3124 if (IsDepCheckNeeded) {
3125 Value *Leader = DepCands.getLeaderValue(Access).getPointer();
3126 unsigned &LeaderId = DepSetId[Leader];
3128 LeaderId = RunningDepId++;
3131 // Each access has its own dependence set.
3132 DepId = RunningDepId++;
3134 RtCheck.insert(SE, TheLoop, Ptr, IsWrite, DepId);
3136 DEBUG(dbgs() << "LV: Found a runtime check ptr:" << *Ptr <<"\n");
3142 if (IsDepCheckNeeded && CanDoRT && RunningDepId == 2)
3143 NumComparisons = 0; // Only one dependence set.
3145 NumComparisons = (NumWritePtrChecks * (NumReadPtrChecks +
3146 NumWritePtrChecks - 1));
3150 static bool isFunctionScopeIdentifiedObject(Value *Ptr) {
3151 return isNoAliasArgument(Ptr) || isNoAliasCall(Ptr) || isa<AllocaInst>(Ptr);
3154 void AccessAnalysis::processMemAccesses(bool UseDeferred) {
3155 // We process the set twice: first we process read-write pointers, last we
3156 // process read-only pointers. This allows us to skip dependence tests for
3157 // read-only pointers.
3159 PtrAccessSet &S = UseDeferred ? DeferredAccesses : Accesses;
3160 for (PtrAccessSet::iterator AI = S.begin(), AE = S.end(); AI != AE; ++AI) {
3161 const MemAccessInfo &Access = *AI;
3162 Value *Ptr = Access.getPointer();
3163 bool IsWrite = Access.getInt();
3165 DepCands.insert(Access);
3167 // Memorize read-only pointers for later processing and skip them in the
3168 // first round (they need to be checked after we have seen all write
3169 // pointers). Note: we also mark pointer that are not consecutive as
3170 // "read-only" pointers (so that we check "a[b[i]] +="). Hence, we need the
3171 // second check for "!IsWrite".
3172 bool IsReadOnlyPtr = ReadOnlyPtr.count(Ptr) && !IsWrite;
3173 if (!UseDeferred && IsReadOnlyPtr) {
3174 DeferredAccesses.insert(Access);
3178 bool NeedDepCheck = false;
3179 // Check whether there is the possiblity of dependency because of underlying
3180 // objects being the same.
3181 typedef SmallVector<Value*, 16> ValueVector;
3182 ValueVector TempObjects;
3183 GetUnderlyingObjects(Ptr, TempObjects, DL);
3184 for (ValueVector::iterator UI = TempObjects.begin(), UE = TempObjects.end();
3186 Value *UnderlyingObj = *UI;
3188 // If this is a write then it needs to be an identified object. If this a
3189 // read and all writes (so far) are identified function scope objects we
3190 // don't need an identified underlying object but only an Argument (the
3191 // next write is going to invalidate this assumption if it is
3193 // This is a micro-optimization for the case where all writes are
3194 // identified and we have one argument pointer.
3195 // Otherwise, we do need a runtime check.
3196 if ((IsWrite && !isFunctionScopeIdentifiedObject(UnderlyingObj)) ||
3197 (!IsWrite && (!AreAllWritesIdentified ||
3198 !isa<Argument>(UnderlyingObj)) &&
3199 !isIdentifiedObject(UnderlyingObj))) {
3200 DEBUG(dbgs() << "LV: Found an unidentified " <<
3201 (IsWrite ? "write" : "read" ) << " ptr:" << *UnderlyingObj <<
3203 IsRTCheckNeeded = (IsRTCheckNeeded ||
3204 !isIdentifiedObject(UnderlyingObj) ||
3205 !AreAllReadsIdentified);
3208 AreAllWritesIdentified = false;
3210 AreAllReadsIdentified = false;
3213 // If this is a write - check other reads and writes for conflicts. If
3214 // this is a read only check other writes for conflicts (but only if there
3215 // is no other write to the ptr - this is an optimization to catch "a[i] =
3216 // a[i] + " without having to do a dependence check).
3217 if ((IsWrite || IsReadOnlyPtr) && WriteObjects.count(UnderlyingObj))
3218 NeedDepCheck = true;
3221 WriteObjects.insert(UnderlyingObj);
3223 // Create sets of pointers connected by shared underlying objects.
3224 UnderlyingObjToAccessMap::iterator Prev =
3225 ObjToLastAccess.find(UnderlyingObj);
3226 if (Prev != ObjToLastAccess.end())
3227 DepCands.unionSets(Access, Prev->second);
3229 ObjToLastAccess[UnderlyingObj] = Access;
3233 CheckDeps.insert(Access);
3238 /// \brief Checks memory dependences among accesses to the same underlying
3239 /// object to determine whether there vectorization is legal or not (and at
3240 /// which vectorization factor).
3242 /// This class works under the assumption that we already checked that memory
3243 /// locations with different underlying pointers are "must-not alias".
3244 /// We use the ScalarEvolution framework to symbolically evalutate access
3245 /// functions pairs. Since we currently don't restructure the loop we can rely
3246 /// on the program order of memory accesses to determine their safety.
3247 /// At the moment we will only deem accesses as safe for:
3248 /// * A negative constant distance assuming program order.
3250 /// Safe: tmp = a[i + 1]; OR a[i + 1] = x;
3251 /// a[i] = tmp; y = a[i];
3253 /// The latter case is safe because later checks guarantuee that there can't
3254 /// be a cycle through a phi node (that is, we check that "x" and "y" is not
3255 /// the same variable: a header phi can only be an induction or a reduction, a
3256 /// reduction can't have a memory sink, an induction can't have a memory
3257 /// source). This is important and must not be violated (or we have to
3258 /// resort to checking for cycles through memory).
3260 /// * A positive constant distance assuming program order that is bigger
3261 /// than the biggest memory access.
3263 /// tmp = a[i] OR b[i] = x
3264 /// a[i+2] = tmp y = b[i+2];
3266 /// Safe distance: 2 x sizeof(a[0]), and 2 x sizeof(b[0]), respectively.
3268 /// * Zero distances and all accesses have the same size.
3270 class MemoryDepChecker {
3272 typedef PointerIntPair<Value *, 1, bool> MemAccessInfo;
3273 typedef SmallPtrSet<MemAccessInfo, 8> MemAccessInfoSet;
3275 MemoryDepChecker(ScalarEvolution *Se, DataLayout *Dl, const Loop *L) :
3276 SE(Se), DL(Dl), InnermostLoop(L), AccessIdx(0) {}
3278 /// \brief Register the location (instructions are given increasing numbers)
3279 /// of a write access.
3280 void addAccess(StoreInst *SI) {
3281 Value *Ptr = SI->getPointerOperand();
3282 Accesses[MemAccessInfo(Ptr, true)].push_back(AccessIdx);
3283 InstMap.push_back(SI);
3287 /// \brief Register the location (instructions are given increasing numbers)
3288 /// of a write access.
3289 void addAccess(LoadInst *LI) {
3290 Value *Ptr = LI->getPointerOperand();
3291 Accesses[MemAccessInfo(Ptr, false)].push_back(AccessIdx);
3292 InstMap.push_back(LI);
3296 /// \brief Check whether the dependencies between the accesses are safe.
3298 /// Only checks sets with elements in \p CheckDeps.
3299 bool areDepsSafe(AccessAnalysis::DepCandidates &AccessSets,
3300 MemAccessInfoSet &CheckDeps);
3302 /// \brief The maximum number of bytes of a vector register we can vectorize
3303 /// the accesses safely with.
3304 unsigned getMaxSafeDepDistBytes() { return MaxSafeDepDistBytes; }
3307 ScalarEvolution *SE;
3309 const Loop *InnermostLoop;
3311 /// \brief Maps access locations (ptr, read/write) to program order.
3312 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses;
3314 /// \brief Memory access instructions in program order.
3315 SmallVector<Instruction *, 16> InstMap;
3317 /// \brief The program order index to be used for the next instruction.
3320 // We can access this many bytes in parallel safely.
3321 unsigned MaxSafeDepDistBytes;
3323 /// \brief Check whether there is a plausible dependence between the two
3326 /// Access \p A must happen before \p B in program order. The two indices
3327 /// identify the index into the program order map.
3329 /// This function checks whether there is a plausible dependence (or the
3330 /// absence of such can't be proved) between the two accesses. If there is a
3331 /// plausible dependence but the dependence distance is bigger than one
3332 /// element access it records this distance in \p MaxSafeDepDistBytes (if this
3333 /// distance is smaller than any other distance encountered so far).
3334 /// Otherwise, this function returns true signaling a possible dependence.
3335 bool isDependent(const MemAccessInfo &A, unsigned AIdx,
3336 const MemAccessInfo &B, unsigned BIdx);
3338 /// \brief Check whether the data dependence could prevent store-load
3340 bool couldPreventStoreLoadForward(unsigned Distance, unsigned TypeByteSize);
3343 } // end anonymous namespace
3345 static bool isInBoundsGep(Value *Ptr) {
3346 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Ptr))
3347 return GEP->isInBounds();
3351 /// \brief Check whether the access through \p Ptr has a constant stride.
3352 static int isStridedPtr(ScalarEvolution *SE, DataLayout *DL, Value *Ptr,
3354 const Type *Ty = Ptr->getType();
3355 assert(Ty->isPointerTy() && "Unexpected non ptr");
3357 // Make sure that the pointer does not point to aggregate types.
3358 const PointerType *PtrTy = cast<PointerType>(Ty);
3359 if (PtrTy->getElementType()->isAggregateType()) {
3360 DEBUG(dbgs() << "LV: Bad stride - Not a pointer to a scalar type" << *Ptr <<
3365 const SCEV *PtrScev = SE->getSCEV(Ptr);
3366 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(PtrScev);
3368 DEBUG(dbgs() << "LV: Bad stride - Not an AddRecExpr pointer "
3369 << *Ptr << " SCEV: " << *PtrScev << "\n");
3373 // The accesss function must stride over the innermost loop.
3374 if (Lp != AR->getLoop()) {
3375 DEBUG(dbgs() << "LV: Bad stride - Not striding over innermost loop " <<
3376 *Ptr << " SCEV: " << *PtrScev << "\n");
3379 // The address calculation must not wrap. Otherwise, a dependence could be
3381 // An inbounds getelementptr that is a AddRec with a unit stride
3382 // cannot wrap per definition. The unit stride requirement is checked later.
3383 // An getelementptr without an inbounds attribute and unit stride would have
3384 // to access the pointer value "0" which is undefined behavior in address
3385 // space 0, therefore we can also vectorize this case.
3386 bool IsInBoundsGEP = isInBoundsGep(Ptr);
3387 bool IsNoWrapAddRec = AR->getNoWrapFlags(SCEV::NoWrapMask);
3388 bool IsInAddressSpaceZero = PtrTy->getAddressSpace() == 0;
3389 if (!IsNoWrapAddRec && !IsInBoundsGEP && !IsInAddressSpaceZero) {
3390 DEBUG(dbgs() << "LV: Bad stride - Pointer may wrap in the address space "
3391 << *Ptr << " SCEV: " << *PtrScev << "\n");
3395 // Check the step is constant.
3396 const SCEV *Step = AR->getStepRecurrence(*SE);
3398 // Calculate the pointer stride and check if it is consecutive.
3399 const SCEVConstant *C = dyn_cast<SCEVConstant>(Step);
3401 DEBUG(dbgs() << "LV: Bad stride - Not a constant strided " << *Ptr <<
3402 " SCEV: " << *PtrScev << "\n");
3406 int64_t Size = DL->getTypeAllocSize(PtrTy->getElementType());
3407 const APInt &APStepVal = C->getValue()->getValue();
3409 // Huge step value - give up.
3410 if (APStepVal.getBitWidth() > 64)
3413 int64_t StepVal = APStepVal.getSExtValue();
3416 int64_t Stride = StepVal / Size;
3417 int64_t Rem = StepVal % Size;
3421 // If the SCEV could wrap but we have an inbounds gep with a unit stride we
3422 // know we can't "wrap around the address space". In case of address space
3423 // zero we know that this won't happen without triggering undefined behavior.
3424 if (!IsNoWrapAddRec && (IsInBoundsGEP || IsInAddressSpaceZero) &&
3425 Stride != 1 && Stride != -1)
3431 bool MemoryDepChecker::couldPreventStoreLoadForward(unsigned Distance,
3432 unsigned TypeByteSize) {
3433 // If loads occur at a distance that is not a multiple of a feasible vector
3434 // factor store-load forwarding does not take place.
3435 // Positive dependences might cause troubles because vectorizing them might
3436 // prevent store-load forwarding making vectorized code run a lot slower.
3437 // a[i] = a[i-3] ^ a[i-8];
3438 // The stores to a[i:i+1] don't align with the stores to a[i-3:i-2] and
3439 // hence on your typical architecture store-load forwarding does not take
3440 // place. Vectorizing in such cases does not make sense.
3441 // Store-load forwarding distance.
3442 const unsigned NumCyclesForStoreLoadThroughMemory = 8*TypeByteSize;
3443 // Maximum vector factor.
3444 unsigned MaxVFWithoutSLForwardIssues = MaxVectorWidth*TypeByteSize;
3445 if(MaxSafeDepDistBytes < MaxVFWithoutSLForwardIssues)
3446 MaxVFWithoutSLForwardIssues = MaxSafeDepDistBytes;
3448 for (unsigned vf = 2*TypeByteSize; vf <= MaxVFWithoutSLForwardIssues;
3450 if (Distance % vf && Distance / vf < NumCyclesForStoreLoadThroughMemory) {
3451 MaxVFWithoutSLForwardIssues = (vf >>=1);
3456 if (MaxVFWithoutSLForwardIssues< 2*TypeByteSize) {
3457 DEBUG(dbgs() << "LV: Distance " << Distance <<
3458 " that could cause a store-load forwarding conflict\n");
3462 if (MaxVFWithoutSLForwardIssues < MaxSafeDepDistBytes &&
3463 MaxVFWithoutSLForwardIssues != MaxVectorWidth*TypeByteSize)
3464 MaxSafeDepDistBytes = MaxVFWithoutSLForwardIssues;
3468 bool MemoryDepChecker::isDependent(const MemAccessInfo &A, unsigned AIdx,
3469 const MemAccessInfo &B, unsigned BIdx) {
3470 assert (AIdx < BIdx && "Must pass arguments in program order");
3472 Value *APtr = A.getPointer();
3473 Value *BPtr = B.getPointer();
3474 bool AIsWrite = A.getInt();
3475 bool BIsWrite = B.getInt();
3477 // Two reads are independent.
3478 if (!AIsWrite && !BIsWrite)
3481 const SCEV *AScev = SE->getSCEV(APtr);
3482 const SCEV *BScev = SE->getSCEV(BPtr);
3484 int StrideAPtr = isStridedPtr(SE, DL, APtr, InnermostLoop);
3485 int StrideBPtr = isStridedPtr(SE, DL, BPtr, InnermostLoop);
3487 const SCEV *Src = AScev;
3488 const SCEV *Sink = BScev;
3490 // If the induction step is negative we have to invert source and sink of the
3492 if (StrideAPtr < 0) {
3495 std::swap(APtr, BPtr);
3496 std::swap(Src, Sink);
3497 std::swap(AIsWrite, BIsWrite);
3498 std::swap(AIdx, BIdx);
3499 std::swap(StrideAPtr, StrideBPtr);
3502 const SCEV *Dist = SE->getMinusSCEV(Sink, Src);
3504 DEBUG(dbgs() << "LV: Src Scev: " << *Src << "Sink Scev: " << *Sink
3505 << "(Induction step: " << StrideAPtr << ")\n");
3506 DEBUG(dbgs() << "LV: Distance for " << *InstMap[AIdx] << " to "
3507 << *InstMap[BIdx] << ": " << *Dist << "\n");
3509 // Need consecutive accesses. We don't want to vectorize
3510 // "A[B[i]] += ..." and similar code or pointer arithmetic that could wrap in
3511 // the address space.
3512 if (!StrideAPtr || !StrideBPtr || StrideAPtr != StrideBPtr){
3513 DEBUG(dbgs() << "Non-consecutive pointer access\n");
3517 const SCEVConstant *C = dyn_cast<SCEVConstant>(Dist);
3519 DEBUG(dbgs() << "LV: Dependence because of non constant distance\n");
3523 Type *ATy = APtr->getType()->getPointerElementType();
3524 Type *BTy = BPtr->getType()->getPointerElementType();
3525 unsigned TypeByteSize = DL->getTypeAllocSize(ATy);
3527 // Negative distances are not plausible dependencies.
3528 const APInt &Val = C->getValue()->getValue();
3529 if (Val.isNegative()) {
3530 bool IsTrueDataDependence = (AIsWrite && !BIsWrite);
3531 if (IsTrueDataDependence &&
3532 (couldPreventStoreLoadForward(Val.abs().getZExtValue(), TypeByteSize) ||
3536 DEBUG(dbgs() << "LV: Dependence is negative: NoDep\n");
3540 // Write to the same location with the same size.
3541 // Could be improved to assert type sizes are the same (i32 == float, etc).
3545 DEBUG(dbgs() << "LV: Zero dependence difference but different types");
3549 assert(Val.isStrictlyPositive() && "Expect a positive value");
3551 // Positive distance bigger than max vectorization factor.
3554 "LV: ReadWrite-Write positive dependency with different types");
3558 unsigned Distance = (unsigned) Val.getZExtValue();
3560 // Bail out early if passed-in parameters make vectorization not feasible.
3561 unsigned ForcedFactor = VectorizationFactor ? VectorizationFactor : 1;
3562 unsigned ForcedUnroll = VectorizationUnroll ? VectorizationUnroll : 1;
3564 // The distance must be bigger than the size needed for a vectorized version
3565 // of the operation and the size of the vectorized operation must not be
3566 // bigger than the currrent maximum size.
3567 if (Distance < 2*TypeByteSize ||
3568 2*TypeByteSize > MaxSafeDepDistBytes ||
3569 Distance < TypeByteSize * ForcedUnroll * ForcedFactor) {
3570 DEBUG(dbgs() << "LV: Failure because of Positive distance "
3571 << Val.getSExtValue() << "\n");
3575 MaxSafeDepDistBytes = Distance < MaxSafeDepDistBytes ?
3576 Distance : MaxSafeDepDistBytes;
3578 bool IsTrueDataDependence = (!AIsWrite && BIsWrite);
3579 if (IsTrueDataDependence &&
3580 couldPreventStoreLoadForward(Distance, TypeByteSize))
3583 DEBUG(dbgs() << "LV: Positive distance " << Val.getSExtValue() <<
3584 " with max VF=" << MaxSafeDepDistBytes/TypeByteSize << "\n");
3590 MemoryDepChecker::areDepsSafe(AccessAnalysis::DepCandidates &AccessSets,
3591 MemAccessInfoSet &CheckDeps) {
3593 MaxSafeDepDistBytes = -1U;
3594 while (!CheckDeps.empty()) {
3595 MemAccessInfo CurAccess = *CheckDeps.begin();
3597 // Get the relevant memory access set.
3598 EquivalenceClasses<MemAccessInfo>::iterator I =
3599 AccessSets.findValue(AccessSets.getLeaderValue(CurAccess));
3601 // Check accesses within this set.
3602 EquivalenceClasses<MemAccessInfo>::member_iterator AI, AE;
3603 AI = AccessSets.member_begin(I), AE = AccessSets.member_end();
3605 // Check every access pair.
3607 CheckDeps.erase(*AI);
3608 EquivalenceClasses<MemAccessInfo>::member_iterator OI = llvm::next(AI);
3610 // Check every accessing instruction pair in program order.
3611 for (std::vector<unsigned>::iterator I1 = Accesses[*AI].begin(),
3612 I1E = Accesses[*AI].end(); I1 != I1E; ++I1)
3613 for (std::vector<unsigned>::iterator I2 = Accesses[*OI].begin(),
3614 I2E = Accesses[*OI].end(); I2 != I2E; ++I2) {
3615 if (*I1 < *I2 && isDependent(*AI, *I1, *OI, *I2))
3617 if (*I2 < *I1 && isDependent(*OI, *I2, *AI, *I1))
3628 bool LoopVectorizationLegality::canVectorizeMemory() {
3630 typedef SmallVector<Value*, 16> ValueVector;
3631 typedef SmallPtrSet<Value*, 16> ValueSet;
3633 // Holds the Load and Store *instructions*.
3637 // Holds all the different accesses in the loop.
3638 unsigned NumReads = 0;
3639 unsigned NumReadWrites = 0;
3641 PtrRtCheck.Pointers.clear();
3642 PtrRtCheck.Need = false;
3644 const bool IsAnnotatedParallel = TheLoop->isAnnotatedParallel();
3645 MemoryDepChecker DepChecker(SE, DL, TheLoop);
3648 for (Loop::block_iterator bb = TheLoop->block_begin(),
3649 be = TheLoop->block_end(); bb != be; ++bb) {
3651 // Scan the BB and collect legal loads and stores.
3652 for (BasicBlock::iterator it = (*bb)->begin(), e = (*bb)->end(); it != e;
3655 // If this is a load, save it. If this instruction can read from memory
3656 // but is not a load, then we quit. Notice that we don't handle function
3657 // calls that read or write.
3658 if (it->mayReadFromMemory()) {
3659 // Many math library functions read the rounding mode. We will only
3660 // vectorize a loop if it contains known function calls that don't set
3661 // the flag. Therefore, it is safe to ignore this read from memory.
3662 CallInst *Call = dyn_cast<CallInst>(it);
3663 if (Call && getIntrinsicIDForCall(Call, TLI))
3666 LoadInst *Ld = dyn_cast<LoadInst>(it);
3667 if (!Ld) return false;
3668 if (!Ld->isSimple() && !IsAnnotatedParallel) {
3669 DEBUG(dbgs() << "LV: Found a non-simple load.\n");
3672 Loads.push_back(Ld);
3673 DepChecker.addAccess(Ld);
3677 // Save 'store' instructions. Abort if other instructions write to memory.
3678 if (it->mayWriteToMemory()) {
3679 StoreInst *St = dyn_cast<StoreInst>(it);
3680 if (!St) return false;
3681 if (!St->isSimple() && !IsAnnotatedParallel) {
3682 DEBUG(dbgs() << "LV: Found a non-simple store.\n");
3685 Stores.push_back(St);
3686 DepChecker.addAccess(St);
3691 // Now we have two lists that hold the loads and the stores.
3692 // Next, we find the pointers that they use.
3694 // Check if we see any stores. If there are no stores, then we don't
3695 // care if the pointers are *restrict*.
3696 if (!Stores.size()) {
3697 DEBUG(dbgs() << "LV: Found a read-only loop!\n");
3701 AccessAnalysis::DepCandidates DependentAccesses;
3702 AccessAnalysis Accesses(DL, DependentAccesses);
3704 // Holds the analyzed pointers. We don't want to call GetUnderlyingObjects
3705 // multiple times on the same object. If the ptr is accessed twice, once
3706 // for read and once for write, it will only appear once (on the write
3707 // list). This is okay, since we are going to check for conflicts between
3708 // writes and between reads and writes, but not between reads and reads.
3711 ValueVector::iterator I, IE;
3712 for (I = Stores.begin(), IE = Stores.end(); I != IE; ++I) {
3713 StoreInst *ST = cast<StoreInst>(*I);
3714 Value* Ptr = ST->getPointerOperand();
3716 if (isUniform(Ptr)) {
3717 DEBUG(dbgs() << "LV: We don't allow storing to uniform addresses\n");
3721 // If we did *not* see this pointer before, insert it to the read-write
3722 // list. At this phase it is only a 'write' list.
3723 if (Seen.insert(Ptr)) {
3725 Accesses.addStore(Ptr);
3729 if (IsAnnotatedParallel) {
3731 << "LV: A loop annotated parallel, ignore memory dependency "
3736 SmallPtrSet<Value *, 16> ReadOnlyPtr;
3737 for (I = Loads.begin(), IE = Loads.end(); I != IE; ++I) {
3738 LoadInst *LD = cast<LoadInst>(*I);
3739 Value* Ptr = LD->getPointerOperand();
3740 // If we did *not* see this pointer before, insert it to the
3741 // read list. If we *did* see it before, then it is already in
3742 // the read-write list. This allows us to vectorize expressions
3743 // such as A[i] += x; Because the address of A[i] is a read-write
3744 // pointer. This only works if the index of A[i] is consecutive.
3745 // If the address of i is unknown (for example A[B[i]]) then we may
3746 // read a few words, modify, and write a few words, and some of the
3747 // words may be written to the same address.
3748 bool IsReadOnlyPtr = false;
3749 if (Seen.insert(Ptr) || !isStridedPtr(SE, DL, Ptr, TheLoop)) {
3751 IsReadOnlyPtr = true;
3753 Accesses.addLoad(Ptr, IsReadOnlyPtr);
3756 // If we write (or read-write) to a single destination and there are no
3757 // other reads in this loop then is it safe to vectorize.
3758 if (NumReadWrites == 1 && NumReads == 0) {
3759 DEBUG(dbgs() << "LV: Found a write-only loop!\n");
3763 // Build dependence sets and check whether we need a runtime pointer bounds
3765 Accesses.buildDependenceSets();
3766 bool NeedRTCheck = Accesses.isRTCheckNeeded();
3768 // Find pointers with computable bounds. We are going to use this information
3769 // to place a runtime bound check.
3770 unsigned NumComparisons = 0;
3771 bool CanDoRT = false;
3773 CanDoRT = Accesses.canCheckPtrAtRT(PtrRtCheck, NumComparisons, SE, TheLoop);
3776 DEBUG(dbgs() << "LV: We need to do " << NumComparisons <<
3777 " pointer comparisons.\n");
3779 // If we only have one set of dependences to check pointers among we don't
3780 // need a runtime check.
3781 if (NumComparisons == 0 && NeedRTCheck)
3782 NeedRTCheck = false;
3784 // Check that we did not collect too many pointers or found a unsizeable
3786 if (!CanDoRT || NumComparisons > RuntimeMemoryCheckThreshold) {
3792 DEBUG(dbgs() << "LV: We can perform a memory runtime check if needed.\n");
3795 if (NeedRTCheck && !CanDoRT) {
3796 DEBUG(dbgs() << "LV: We can't vectorize because we can't find " <<
3797 "the array bounds.\n");
3802 PtrRtCheck.Need = NeedRTCheck;
3804 bool CanVecMem = true;
3805 if (Accesses.isDependencyCheckNeeded()) {
3806 DEBUG(dbgs() << "LV: Checking memory dependencies\n");
3807 CanVecMem = DepChecker.areDepsSafe(DependentAccesses,
3808 Accesses.getDependenciesToCheck());
3809 MaxSafeDepDistBytes = DepChecker.getMaxSafeDepDistBytes();
3812 DEBUG(dbgs() << "LV: We "<< (NeedRTCheck ? "" : "don't") <<
3813 " need a runtime memory check.\n");
3818 static bool hasMultipleUsesOf(Instruction *I,
3819 SmallPtrSet<Instruction *, 8> &Insts) {
3820 unsigned NumUses = 0;
3821 for(User::op_iterator Use = I->op_begin(), E = I->op_end(); Use != E; ++Use) {
3822 if (Insts.count(dyn_cast<Instruction>(*Use)))
3831 static bool areAllUsesIn(Instruction *I, SmallPtrSet<Instruction *, 8> &Set) {
3832 for(User::op_iterator Use = I->op_begin(), E = I->op_end(); Use != E; ++Use)
3833 if (!Set.count(dyn_cast<Instruction>(*Use)))
3838 bool LoopVectorizationLegality::AddReductionVar(PHINode *Phi,
3839 ReductionKind Kind) {
3840 if (Phi->getNumIncomingValues() != 2)
3843 // Reduction variables are only found in the loop header block.
3844 if (Phi->getParent() != TheLoop->getHeader())
3847 // Obtain the reduction start value from the value that comes from the loop
3849 Value *RdxStart = Phi->getIncomingValueForBlock(TheLoop->getLoopPreheader());
3851 // ExitInstruction is the single value which is used outside the loop.
3852 // We only allow for a single reduction value to be used outside the loop.
3853 // This includes users of the reduction, variables (which form a cycle
3854 // which ends in the phi node).
3855 Instruction *ExitInstruction = 0;
3856 // Indicates that we found a reduction operation in our scan.
3857 bool FoundReduxOp = false;
3859 // We start with the PHI node and scan for all of the users of this
3860 // instruction. All users must be instructions that can be used as reduction
3861 // variables (such as ADD). We must have a single out-of-block user. The cycle
3862 // must include the original PHI.
3863 bool FoundStartPHI = false;
3865 // To recognize min/max patterns formed by a icmp select sequence, we store
3866 // the number of instruction we saw from the recognized min/max pattern,
3867 // to make sure we only see exactly the two instructions.
3868 unsigned NumCmpSelectPatternInst = 0;
3869 ReductionInstDesc ReduxDesc(false, 0);
3871 SmallPtrSet<Instruction *, 8> VisitedInsts;
3872 SmallVector<Instruction *, 8> Worklist;
3873 Worklist.push_back(Phi);
3874 VisitedInsts.insert(Phi);
3876 // A value in the reduction can be used:
3877 // - By the reduction:
3878 // - Reduction operation:
3879 // - One use of reduction value (safe).
3880 // - Multiple use of reduction value (not safe).
3882 // - All uses of the PHI must be the reduction (safe).
3883 // - Otherwise, not safe.
3884 // - By one instruction outside of the loop (safe).
3885 // - By further instructions outside of the loop (not safe).
3886 // - By an instruction that is not part of the reduction (not safe).
3888 // * An instruction type other than PHI or the reduction operation.
3889 // * A PHI in the header other than the initial PHI.
3890 while (!Worklist.empty()) {
3891 Instruction *Cur = Worklist.back();
3892 Worklist.pop_back();
3895 // If the instruction has no users then this is a broken chain and can't be
3896 // a reduction variable.
3897 if (Cur->use_empty())
3900 bool IsAPhi = isa<PHINode>(Cur);
3902 // A header PHI use other than the original PHI.
3903 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent())
3906 // Reductions of instructions such as Div, and Sub is only possible if the
3907 // LHS is the reduction variable.
3908 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) &&
3909 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) &&
3910 !VisitedInsts.count(dyn_cast<Instruction>(Cur->getOperand(0))))
3913 // Any reduction instruction must be of one of the allowed kinds.
3914 ReduxDesc = isReductionInstr(Cur, Kind, ReduxDesc);
3915 if (!ReduxDesc.IsReduction)
3918 // A reduction operation must only have one use of the reduction value.
3919 if (!IsAPhi && Kind != RK_IntegerMinMax && Kind != RK_FloatMinMax &&
3920 hasMultipleUsesOf(Cur, VisitedInsts))
3923 // All inputs to a PHI node must be a reduction value.
3924 if(IsAPhi && Cur != Phi && !areAllUsesIn(Cur, VisitedInsts))
3927 if (Kind == RK_IntegerMinMax && (isa<ICmpInst>(Cur) ||
3928 isa<SelectInst>(Cur)))
3929 ++NumCmpSelectPatternInst;
3930 if (Kind == RK_FloatMinMax && (isa<FCmpInst>(Cur) ||
3931 isa<SelectInst>(Cur)))
3932 ++NumCmpSelectPatternInst;
3934 // Check whether we found a reduction operator.
3935 FoundReduxOp |= !IsAPhi;
3937 // Process users of current instruction. Push non PHI nodes after PHI nodes
3938 // onto the stack. This way we are going to have seen all inputs to PHI
3939 // nodes once we get to them.
3940 SmallVector<Instruction *, 8> NonPHIs;
3941 SmallVector<Instruction *, 8> PHIs;
3942 for (Value::use_iterator UI = Cur->use_begin(), E = Cur->use_end(); UI != E;
3944 Instruction *Usr = cast<Instruction>(*UI);
3946 // Check if we found the exit user.
3947 BasicBlock *Parent = Usr->getParent();
3948 if (!TheLoop->contains(Parent)) {
3949 // Exit if you find multiple outside users or if the header phi node is
3950 // being used. In this case the user uses the value of the previous
3951 // iteration, in which case we would loose "VF-1" iterations of the
3952 // reduction operation if we vectorize.
3953 if (ExitInstruction != 0 || Cur == Phi)
3956 ExitInstruction = Cur;
3960 // Process instructions only once (termination).
3961 if (VisitedInsts.insert(Usr)) {
3962 if (isa<PHINode>(Usr))
3963 PHIs.push_back(Usr);
3965 NonPHIs.push_back(Usr);
3967 // Remember that we completed the cycle.
3969 FoundStartPHI = true;
3971 Worklist.append(PHIs.begin(), PHIs.end());
3972 Worklist.append(NonPHIs.begin(), NonPHIs.end());
3975 // This means we have seen one but not the other instruction of the
3976 // pattern or more than just a select and cmp.
3977 if ((Kind == RK_IntegerMinMax || Kind == RK_FloatMinMax) &&
3978 NumCmpSelectPatternInst != 2)
3981 if (!FoundStartPHI || !FoundReduxOp || !ExitInstruction)
3984 // We found a reduction var if we have reached the original phi node and we
3985 // only have a single instruction with out-of-loop users.
3987 // This instruction is allowed to have out-of-loop users.
3988 AllowedExit.insert(ExitInstruction);
3990 // Save the description of this reduction variable.
3991 ReductionDescriptor RD(RdxStart, ExitInstruction, Kind,
3992 ReduxDesc.MinMaxKind);
3993 Reductions[Phi] = RD;
3994 // We've ended the cycle. This is a reduction variable if we have an
3995 // outside user and it has a binary op.
4000 /// Returns true if the instruction is a Select(ICmp(X, Y), X, Y) instruction
4001 /// pattern corresponding to a min(X, Y) or max(X, Y).
4002 LoopVectorizationLegality::ReductionInstDesc
4003 LoopVectorizationLegality::isMinMaxSelectCmpPattern(Instruction *I,
4004 ReductionInstDesc &Prev) {
4006 assert((isa<ICmpInst>(I) || isa<FCmpInst>(I) || isa<SelectInst>(I)) &&
4007 "Expect a select instruction");
4008 Instruction *Cmp = 0;
4009 SelectInst *Select = 0;
4011 // We must handle the select(cmp()) as a single instruction. Advance to the
4013 if ((Cmp = dyn_cast<ICmpInst>(I)) || (Cmp = dyn_cast<FCmpInst>(I))) {
4014 if (!Cmp->hasOneUse() || !(Select = dyn_cast<SelectInst>(*I->use_begin())))
4015 return ReductionInstDesc(false, I);
4016 return ReductionInstDesc(Select, Prev.MinMaxKind);
4019 // Only handle single use cases for now.
4020 if (!(Select = dyn_cast<SelectInst>(I)))
4021 return ReductionInstDesc(false, I);
4022 if (!(Cmp = dyn_cast<ICmpInst>(I->getOperand(0))) &&
4023 !(Cmp = dyn_cast<FCmpInst>(I->getOperand(0))))
4024 return ReductionInstDesc(false, I);
4025 if (!Cmp->hasOneUse())
4026 return ReductionInstDesc(false, I);
4031 // Look for a min/max pattern.
4032 if (m_UMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4033 return ReductionInstDesc(Select, MRK_UIntMin);
4034 else if (m_UMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4035 return ReductionInstDesc(Select, MRK_UIntMax);
4036 else if (m_SMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4037 return ReductionInstDesc(Select, MRK_SIntMax);
4038 else if (m_SMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4039 return ReductionInstDesc(Select, MRK_SIntMin);
4040 else if (m_OrdFMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4041 return ReductionInstDesc(Select, MRK_FloatMin);
4042 else if (m_OrdFMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4043 return ReductionInstDesc(Select, MRK_FloatMax);
4044 else if (m_UnordFMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4045 return ReductionInstDesc(Select, MRK_FloatMin);
4046 else if (m_UnordFMax(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))
4047 return ReductionInstDesc(Select, MRK_FloatMax);
4049 return ReductionInstDesc(false, I);
4052 LoopVectorizationLegality::ReductionInstDesc
4053 LoopVectorizationLegality::isReductionInstr(Instruction *I,
4055 ReductionInstDesc &Prev) {
4056 bool FP = I->getType()->isFloatingPointTy();
4057 bool FastMath = (FP && I->isCommutative() && I->isAssociative());
4058 switch (I->getOpcode()) {
4060 return ReductionInstDesc(false, I);
4061 case Instruction::PHI:
4062 if (FP && (Kind != RK_FloatMult && Kind != RK_FloatAdd &&
4063 Kind != RK_FloatMinMax))
4064 return ReductionInstDesc(false, I);
4065 return ReductionInstDesc(I, Prev.MinMaxKind);
4066 case Instruction::Sub:
4067 case Instruction::Add:
4068 return ReductionInstDesc(Kind == RK_IntegerAdd, I);
4069 case Instruction::Mul:
4070 return ReductionInstDesc(Kind == RK_IntegerMult, I);
4071 case Instruction::And:
4072 return ReductionInstDesc(Kind == RK_IntegerAnd, I);
4073 case Instruction::Or:
4074 return ReductionInstDesc(Kind == RK_IntegerOr, I);
4075 case Instruction::Xor:
4076 return ReductionInstDesc(Kind == RK_IntegerXor, I);
4077 case Instruction::FMul:
4078 return ReductionInstDesc(Kind == RK_FloatMult && FastMath, I);
4079 case Instruction::FAdd:
4080 return ReductionInstDesc(Kind == RK_FloatAdd && FastMath, I);
4081 case Instruction::FCmp:
4082 case Instruction::ICmp:
4083 case Instruction::Select:
4084 if (Kind != RK_IntegerMinMax &&
4085 (!HasFunNoNaNAttr || Kind != RK_FloatMinMax))
4086 return ReductionInstDesc(false, I);
4087 return isMinMaxSelectCmpPattern(I, Prev);
4091 LoopVectorizationLegality::InductionKind
4092 LoopVectorizationLegality::isInductionVariable(PHINode *Phi) {
4093 Type *PhiTy = Phi->getType();
4094 // We only handle integer and pointer inductions variables.
4095 if (!PhiTy->isIntegerTy() && !PhiTy->isPointerTy())
4096 return IK_NoInduction;
4098 // Check that the PHI is consecutive.
4099 const SCEV *PhiScev = SE->getSCEV(Phi);
4100 const SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(PhiScev);
4102 DEBUG(dbgs() << "LV: PHI is not a poly recurrence.\n");
4103 return IK_NoInduction;
4105 const SCEV *Step = AR->getStepRecurrence(*SE);
4107 // Integer inductions need to have a stride of one.
4108 if (PhiTy->isIntegerTy()) {
4110 return IK_IntInduction;
4111 if (Step->isAllOnesValue())
4112 return IK_ReverseIntInduction;
4113 return IK_NoInduction;
4116 // Calculate the pointer stride and check if it is consecutive.
4117 const SCEVConstant *C = dyn_cast<SCEVConstant>(Step);
4119 return IK_NoInduction;
4121 assert(PhiTy->isPointerTy() && "The PHI must be a pointer");
4122 uint64_t Size = DL->getTypeAllocSize(PhiTy->getPointerElementType());
4123 if (C->getValue()->equalsInt(Size))
4124 return IK_PtrInduction;
4125 else if (C->getValue()->equalsInt(0 - Size))
4126 return IK_ReversePtrInduction;
4128 return IK_NoInduction;
4131 bool LoopVectorizationLegality::isInductionVariable(const Value *V) {
4132 Value *In0 = const_cast<Value*>(V);
4133 PHINode *PN = dyn_cast_or_null<PHINode>(In0);
4137 return Inductions.count(PN);
4140 bool LoopVectorizationLegality::blockNeedsPredication(BasicBlock *BB) {
4141 assert(TheLoop->contains(BB) && "Unknown block used");
4143 // Blocks that do not dominate the latch need predication.
4144 BasicBlock* Latch = TheLoop->getLoopLatch();
4145 return !DT->dominates(BB, Latch);
4148 bool LoopVectorizationLegality::blockCanBePredicated(BasicBlock *BB,
4149 SmallPtrSet<Value *, 8>& SafePtrs) {
4150 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4151 // We might be able to hoist the load.
4152 if (it->mayReadFromMemory()) {
4153 LoadInst *LI = dyn_cast<LoadInst>(it);
4154 if (!LI || !SafePtrs.count(LI->getPointerOperand()))
4158 // We don't predicate stores at the moment.
4159 if (it->mayWriteToMemory() || it->mayThrow())
4162 // The instructions below can trap.
4163 switch (it->getOpcode()) {
4165 case Instruction::UDiv:
4166 case Instruction::SDiv:
4167 case Instruction::URem:
4168 case Instruction::SRem:
4176 LoopVectorizationCostModel::VectorizationFactor
4177 LoopVectorizationCostModel::selectVectorizationFactor(bool OptForSize,
4179 // Width 1 means no vectorize
4180 VectorizationFactor Factor = { 1U, 0U };
4181 if (OptForSize && Legal->getRuntimePointerCheck()->Need) {
4182 DEBUG(dbgs() << "LV: Aborting. Runtime ptr check is required in Os.\n");
4186 // Find the trip count.
4187 unsigned TC = SE->getSmallConstantTripCount(TheLoop, TheLoop->getLoopLatch());
4188 DEBUG(dbgs() << "LV: Found trip count:"<<TC<<"\n");
4190 unsigned WidestType = getWidestType();
4191 unsigned WidestRegister = TTI.getRegisterBitWidth(true);
4192 unsigned MaxSafeDepDist = -1U;
4193 if (Legal->getMaxSafeDepDistBytes() != -1U)
4194 MaxSafeDepDist = Legal->getMaxSafeDepDistBytes() * 8;
4195 WidestRegister = ((WidestRegister < MaxSafeDepDist) ?
4196 WidestRegister : MaxSafeDepDist);
4197 unsigned MaxVectorSize = WidestRegister / WidestType;
4198 DEBUG(dbgs() << "LV: The Widest type: " << WidestType << " bits.\n");
4199 DEBUG(dbgs() << "LV: The Widest register is:" << WidestRegister << "bits.\n");
4201 if (MaxVectorSize == 0) {
4202 DEBUG(dbgs() << "LV: The target has no vector registers.\n");
4206 assert(MaxVectorSize <= 32 && "Did not expect to pack so many elements"
4207 " into one vector!");
4209 unsigned VF = MaxVectorSize;
4211 // If we optimize the program for size, avoid creating the tail loop.
4213 // If we are unable to calculate the trip count then don't try to vectorize.
4215 DEBUG(dbgs() << "LV: Aborting. A tail loop is required in Os.\n");
4219 // Find the maximum SIMD width that can fit within the trip count.
4220 VF = TC % MaxVectorSize;
4225 // If the trip count that we found modulo the vectorization factor is not
4226 // zero then we require a tail.
4228 DEBUG(dbgs() << "LV: Aborting. A tail loop is required in Os.\n");
4234 assert(isPowerOf2_32(UserVF) && "VF needs to be a power of two");
4235 DEBUG(dbgs() << "LV: Using user VF "<<UserVF<<".\n");
4237 Factor.Width = UserVF;
4241 float Cost = expectedCost(1);
4243 DEBUG(dbgs() << "LV: Scalar loop costs: "<< (int)Cost << ".\n");
4244 for (unsigned i=2; i <= VF; i*=2) {
4245 // Notice that the vector loop needs to be executed less times, so
4246 // we need to divide the cost of the vector loops by the width of
4247 // the vector elements.
4248 float VectorCost = expectedCost(i) / (float)i;
4249 DEBUG(dbgs() << "LV: Vector loop of width "<< i << " costs: " <<
4250 (int)VectorCost << ".\n");
4251 if (VectorCost < Cost) {
4257 DEBUG(dbgs() << "LV: Selecting VF = : "<< Width << ".\n");
4258 Factor.Width = Width;
4259 Factor.Cost = Width * Cost;
4263 unsigned LoopVectorizationCostModel::getWidestType() {
4264 unsigned MaxWidth = 8;
4267 for (Loop::block_iterator bb = TheLoop->block_begin(),
4268 be = TheLoop->block_end(); bb != be; ++bb) {
4269 BasicBlock *BB = *bb;
4271 // For each instruction in the loop.
4272 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4273 Type *T = it->getType();
4275 // Only examine Loads, Stores and PHINodes.
4276 if (!isa<LoadInst>(it) && !isa<StoreInst>(it) && !isa<PHINode>(it))
4279 // Examine PHI nodes that are reduction variables.
4280 if (PHINode *PN = dyn_cast<PHINode>(it))
4281 if (!Legal->getReductionVars()->count(PN))
4284 // Examine the stored values.
4285 if (StoreInst *ST = dyn_cast<StoreInst>(it))
4286 T = ST->getValueOperand()->getType();
4288 // Ignore loaded pointer types and stored pointer types that are not
4289 // consecutive. However, we do want to take consecutive stores/loads of
4290 // pointer vectors into account.
4291 if (T->isPointerTy() && !isConsecutiveLoadOrStore(it))
4294 MaxWidth = std::max(MaxWidth,
4295 (unsigned)DL->getTypeSizeInBits(T->getScalarType()));
4303 LoopVectorizationCostModel::selectUnrollFactor(bool OptForSize,
4306 unsigned LoopCost) {
4308 // -- The unroll heuristics --
4309 // We unroll the loop in order to expose ILP and reduce the loop overhead.
4310 // There are many micro-architectural considerations that we can't predict
4311 // at this level. For example frontend pressure (on decode or fetch) due to
4312 // code size, or the number and capabilities of the execution ports.
4314 // We use the following heuristics to select the unroll factor:
4315 // 1. If the code has reductions the we unroll in order to break the cross
4316 // iteration dependency.
4317 // 2. If the loop is really small then we unroll in order to reduce the loop
4319 // 3. We don't unroll if we think that we will spill registers to memory due
4320 // to the increased register pressure.
4322 // Use the user preference, unless 'auto' is selected.
4326 // When we optimize for size we don't unroll.
4330 // We used the distance for the unroll factor.
4331 if (Legal->getMaxSafeDepDistBytes() != -1U)
4334 // Do not unroll loops with a relatively small trip count.
4335 unsigned TC = SE->getSmallConstantTripCount(TheLoop,
4336 TheLoop->getLoopLatch());
4337 if (TC > 1 && TC < TinyTripCountUnrollThreshold)
4340 unsigned TargetVectorRegisters = TTI.getNumberOfRegisters(true);
4341 DEBUG(dbgs() << "LV: The target has " << TargetVectorRegisters <<
4342 " vector registers\n");
4344 LoopVectorizationCostModel::RegisterUsage R = calculateRegisterUsage();
4345 // We divide by these constants so assume that we have at least one
4346 // instruction that uses at least one register.
4347 R.MaxLocalUsers = std::max(R.MaxLocalUsers, 1U);
4348 R.NumInstructions = std::max(R.NumInstructions, 1U);
4350 // We calculate the unroll factor using the following formula.
4351 // Subtract the number of loop invariants from the number of available
4352 // registers. These registers are used by all of the unrolled instances.
4353 // Next, divide the remaining registers by the number of registers that is
4354 // required by the loop, in order to estimate how many parallel instances
4355 // fit without causing spills.
4356 unsigned UF = (TargetVectorRegisters - R.LoopInvariantRegs) / R.MaxLocalUsers;
4358 // Clamp the unroll factor ranges to reasonable factors.
4359 unsigned MaxUnrollSize = TTI.getMaximumUnrollFactor();
4361 // If we did not calculate the cost for VF (because the user selected the VF)
4362 // then we calculate the cost of VF here.
4364 LoopCost = expectedCost(VF);
4366 // Clamp the calculated UF to be between the 1 and the max unroll factor
4367 // that the target allows.
4368 if (UF > MaxUnrollSize)
4373 bool HasReductions = Legal->getReductionVars()->size();
4375 // Decide if we want to unroll if we decided that it is legal to vectorize
4376 // but not profitable.
4378 if (TheLoop->getNumBlocks() > 1 || !HasReductions ||
4379 LoopCost > SmallLoopCost)
4385 if (HasReductions) {
4386 DEBUG(dbgs() << "LV: Unrolling because of reductions. \n");
4390 // We want to unroll tiny loops in order to reduce the loop overhead.
4391 // We assume that the cost overhead is 1 and we use the cost model
4392 // to estimate the cost of the loop and unroll until the cost of the
4393 // loop overhead is about 5% of the cost of the loop.
4394 DEBUG(dbgs() << "LV: Loop cost is "<< LoopCost <<" \n");
4395 if (LoopCost < SmallLoopCost) {
4396 DEBUG(dbgs() << "LV: Unrolling to reduce branch cost. \n");
4397 unsigned NewUF = SmallLoopCost / (LoopCost + 1);
4398 return std::min(NewUF, UF);
4401 DEBUG(dbgs() << "LV: Not Unrolling. \n");
4405 LoopVectorizationCostModel::RegisterUsage
4406 LoopVectorizationCostModel::calculateRegisterUsage() {
4407 // This function calculates the register usage by measuring the highest number
4408 // of values that are alive at a single location. Obviously, this is a very
4409 // rough estimation. We scan the loop in a topological order in order and
4410 // assign a number to each instruction. We use RPO to ensure that defs are
4411 // met before their users. We assume that each instruction that has in-loop
4412 // users starts an interval. We record every time that an in-loop value is
4413 // used, so we have a list of the first and last occurrences of each
4414 // instruction. Next, we transpose this data structure into a multi map that
4415 // holds the list of intervals that *end* at a specific location. This multi
4416 // map allows us to perform a linear search. We scan the instructions linearly
4417 // and record each time that a new interval starts, by placing it in a set.
4418 // If we find this value in the multi-map then we remove it from the set.
4419 // The max register usage is the maximum size of the set.
4420 // We also search for instructions that are defined outside the loop, but are
4421 // used inside the loop. We need this number separately from the max-interval
4422 // usage number because when we unroll, loop-invariant values do not take
4424 LoopBlocksDFS DFS(TheLoop);
4428 R.NumInstructions = 0;
4430 // Each 'key' in the map opens a new interval. The values
4431 // of the map are the index of the 'last seen' usage of the
4432 // instruction that is the key.
4433 typedef DenseMap<Instruction*, unsigned> IntervalMap;
4434 // Maps instruction to its index.
4435 DenseMap<unsigned, Instruction*> IdxToInstr;
4436 // Marks the end of each interval.
4437 IntervalMap EndPoint;
4438 // Saves the list of instruction indices that are used in the loop.
4439 SmallSet<Instruction*, 8> Ends;
4440 // Saves the list of values that are used in the loop but are
4441 // defined outside the loop, such as arguments and constants.
4442 SmallPtrSet<Value*, 8> LoopInvariants;
4445 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
4446 be = DFS.endRPO(); bb != be; ++bb) {
4447 R.NumInstructions += (*bb)->size();
4448 for (BasicBlock::iterator it = (*bb)->begin(), e = (*bb)->end(); it != e;
4450 Instruction *I = it;
4451 IdxToInstr[Index++] = I;
4453 // Save the end location of each USE.
4454 for (unsigned i = 0; i < I->getNumOperands(); ++i) {
4455 Value *U = I->getOperand(i);
4456 Instruction *Instr = dyn_cast<Instruction>(U);
4458 // Ignore non-instruction values such as arguments, constants, etc.
4459 if (!Instr) continue;
4461 // If this instruction is outside the loop then record it and continue.
4462 if (!TheLoop->contains(Instr)) {
4463 LoopInvariants.insert(Instr);
4467 // Overwrite previous end points.
4468 EndPoint[Instr] = Index;
4474 // Saves the list of intervals that end with the index in 'key'.
4475 typedef SmallVector<Instruction*, 2> InstrList;
4476 DenseMap<unsigned, InstrList> TransposeEnds;
4478 // Transpose the EndPoints to a list of values that end at each index.
4479 for (IntervalMap::iterator it = EndPoint.begin(), e = EndPoint.end();
4481 TransposeEnds[it->second].push_back(it->first);
4483 SmallSet<Instruction*, 8> OpenIntervals;
4484 unsigned MaxUsage = 0;
4487 DEBUG(dbgs() << "LV(REG): Calculating max register usage:\n");
4488 for (unsigned int i = 0; i < Index; ++i) {
4489 Instruction *I = IdxToInstr[i];
4490 // Ignore instructions that are never used within the loop.
4491 if (!Ends.count(I)) continue;
4493 // Remove all of the instructions that end at this location.
4494 InstrList &List = TransposeEnds[i];
4495 for (unsigned int j=0, e = List.size(); j < e; ++j)
4496 OpenIntervals.erase(List[j]);
4498 // Count the number of live interals.
4499 MaxUsage = std::max(MaxUsage, OpenIntervals.size());
4501 DEBUG(dbgs() << "LV(REG): At #" << i << " Interval # " <<
4502 OpenIntervals.size() <<"\n");
4504 // Add the current instruction to the list of open intervals.
4505 OpenIntervals.insert(I);
4508 unsigned Invariant = LoopInvariants.size();
4509 DEBUG(dbgs() << "LV(REG): Found max usage: " << MaxUsage << " \n");
4510 DEBUG(dbgs() << "LV(REG): Found invariant usage: " << Invariant << " \n");
4511 DEBUG(dbgs() << "LV(REG): LoopSize: " << R.NumInstructions << " \n");
4513 R.LoopInvariantRegs = Invariant;
4514 R.MaxLocalUsers = MaxUsage;
4518 unsigned LoopVectorizationCostModel::expectedCost(unsigned VF) {
4522 for (Loop::block_iterator bb = TheLoop->block_begin(),
4523 be = TheLoop->block_end(); bb != be; ++bb) {
4524 unsigned BlockCost = 0;
4525 BasicBlock *BB = *bb;
4527 // For each instruction in the old loop.
4528 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; ++it) {
4529 // Skip dbg intrinsics.
4530 if (isa<DbgInfoIntrinsic>(it))
4533 unsigned C = getInstructionCost(it, VF);
4535 DEBUG(dbgs() << "LV: Found an estimated cost of "<< C <<" for VF " <<
4536 VF << " For instruction: "<< *it << "\n");
4539 // We assume that if-converted blocks have a 50% chance of being executed.
4540 // When the code is scalar then some of the blocks are avoided due to CF.
4541 // When the code is vectorized we execute all code paths.
4542 if (VF == 1 && Legal->blockNeedsPredication(*bb))
4551 /// \brief Check whether the address computation for a non-consecutive memory
4552 /// access looks like an unlikely candidate for being merged into the indexing
4555 /// We look for a GEP which has one index that is an induction variable and all
4556 /// other indices are loop invariant. If the stride of this access is also
4557 /// within a small bound we decide that this address computation can likely be
4558 /// merged into the addressing mode.
4559 /// In all other cases, we identify the address computation as complex.
4560 static bool isLikelyComplexAddressComputation(Value *Ptr,
4561 LoopVectorizationLegality *Legal,
4562 ScalarEvolution *SE,
4563 const Loop *TheLoop) {
4564 GetElementPtrInst *Gep = dyn_cast<GetElementPtrInst>(Ptr);
4568 // We are looking for a gep with all loop invariant indices except for one
4569 // which should be an induction variable.
4570 unsigned NumOperands = Gep->getNumOperands();
4571 for (unsigned i = 1; i < NumOperands; ++i) {
4572 Value *Opd = Gep->getOperand(i);
4573 if (!SE->isLoopInvariant(SE->getSCEV(Opd), TheLoop) &&
4574 !Legal->isInductionVariable(Opd))
4578 // Now we know we have a GEP ptr, %inv, %ind, %inv. Make sure that the step
4579 // can likely be merged into the address computation.
4580 unsigned MaxMergeDistance = 64;
4582 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(SE->getSCEV(Ptr));
4586 // Check the step is constant.
4587 const SCEV *Step = AddRec->getStepRecurrence(*SE);
4588 // Calculate the pointer stride and check if it is consecutive.
4589 const SCEVConstant *C = dyn_cast<SCEVConstant>(Step);
4593 const APInt &APStepVal = C->getValue()->getValue();
4595 // Huge step value - give up.
4596 if (APStepVal.getBitWidth() > 64)
4599 int64_t StepVal = APStepVal.getSExtValue();
4601 return StepVal > MaxMergeDistance;
4605 LoopVectorizationCostModel::getInstructionCost(Instruction *I, unsigned VF) {
4606 // If we know that this instruction will remain uniform, check the cost of
4607 // the scalar version.
4608 if (Legal->isUniformAfterVectorization(I))
4611 Type *RetTy = I->getType();
4612 Type *VectorTy = ToVectorTy(RetTy, VF);
4614 // TODO: We need to estimate the cost of intrinsic calls.
4615 switch (I->getOpcode()) {
4616 case Instruction::GetElementPtr:
4617 // We mark this instruction as zero-cost because the cost of GEPs in
4618 // vectorized code depends on whether the corresponding memory instruction
4619 // is scalarized or not. Therefore, we handle GEPs with the memory
4620 // instruction cost.
4622 case Instruction::Br: {
4623 return TTI.getCFInstrCost(I->getOpcode());
4625 case Instruction::PHI:
4626 //TODO: IF-converted IFs become selects.
4628 case Instruction::Add:
4629 case Instruction::FAdd:
4630 case Instruction::Sub:
4631 case Instruction::FSub:
4632 case Instruction::Mul:
4633 case Instruction::FMul:
4634 case Instruction::UDiv:
4635 case Instruction::SDiv:
4636 case Instruction::FDiv:
4637 case Instruction::URem:
4638 case Instruction::SRem:
4639 case Instruction::FRem:
4640 case Instruction::Shl:
4641 case Instruction::LShr:
4642 case Instruction::AShr:
4643 case Instruction::And:
4644 case Instruction::Or:
4645 case Instruction::Xor: {
4646 // Certain instructions can be cheaper to vectorize if they have a constant
4647 // second vector operand. One example of this are shifts on x86.
4648 TargetTransformInfo::OperandValueKind Op1VK =
4649 TargetTransformInfo::OK_AnyValue;
4650 TargetTransformInfo::OperandValueKind Op2VK =
4651 TargetTransformInfo::OK_AnyValue;
4653 if (isa<ConstantInt>(I->getOperand(1)))
4654 Op2VK = TargetTransformInfo::OK_UniformConstantValue;
4656 return TTI.getArithmeticInstrCost(I->getOpcode(), VectorTy, Op1VK, Op2VK);
4658 case Instruction::Select: {
4659 SelectInst *SI = cast<SelectInst>(I);
4660 const SCEV *CondSCEV = SE->getSCEV(SI->getCondition());
4661 bool ScalarCond = (SE->isLoopInvariant(CondSCEV, TheLoop));
4662 Type *CondTy = SI->getCondition()->getType();
4664 CondTy = VectorType::get(CondTy, VF);
4666 return TTI.getCmpSelInstrCost(I->getOpcode(), VectorTy, CondTy);
4668 case Instruction::ICmp:
4669 case Instruction::FCmp: {
4670 Type *ValTy = I->getOperand(0)->getType();
4671 VectorTy = ToVectorTy(ValTy, VF);
4672 return TTI.getCmpSelInstrCost(I->getOpcode(), VectorTy);
4674 case Instruction::Store:
4675 case Instruction::Load: {
4676 StoreInst *SI = dyn_cast<StoreInst>(I);
4677 LoadInst *LI = dyn_cast<LoadInst>(I);
4678 Type *ValTy = (SI ? SI->getValueOperand()->getType() :
4680 VectorTy = ToVectorTy(ValTy, VF);
4682 unsigned Alignment = SI ? SI->getAlignment() : LI->getAlignment();
4683 unsigned AS = SI ? SI->getPointerAddressSpace() :
4684 LI->getPointerAddressSpace();
4685 Value *Ptr = SI ? SI->getPointerOperand() : LI->getPointerOperand();
4686 // We add the cost of address computation here instead of with the gep
4687 // instruction because only here we know whether the operation is
4690 return TTI.getAddressComputationCost(VectorTy) +
4691 TTI.getMemoryOpCost(I->getOpcode(), VectorTy, Alignment, AS);
4693 // Scalarized loads/stores.
4694 int ConsecutiveStride = Legal->isConsecutivePtr(Ptr);
4695 bool Reverse = ConsecutiveStride < 0;
4696 unsigned ScalarAllocatedSize = DL->getTypeAllocSize(ValTy);
4697 unsigned VectorElementSize = DL->getTypeStoreSize(VectorTy)/VF;
4698 if (!ConsecutiveStride || ScalarAllocatedSize != VectorElementSize) {
4699 bool IsComplexComputation =
4700 isLikelyComplexAddressComputation(Ptr, Legal, SE, TheLoop);
4702 // The cost of extracting from the value vector and pointer vector.
4703 Type *PtrTy = ToVectorTy(Ptr->getType(), VF);
4704 for (unsigned i = 0; i < VF; ++i) {
4705 // The cost of extracting the pointer operand.
4706 Cost += TTI.getVectorInstrCost(Instruction::ExtractElement, PtrTy, i);
4707 // In case of STORE, the cost of ExtractElement from the vector.
4708 // In case of LOAD, the cost of InsertElement into the returned
4710 Cost += TTI.getVectorInstrCost(SI ? Instruction::ExtractElement :
4711 Instruction::InsertElement,
4715 // The cost of the scalar loads/stores.
4716 Cost += VF * TTI.getAddressComputationCost(PtrTy, IsComplexComputation);
4717 Cost += VF * TTI.getMemoryOpCost(I->getOpcode(), ValTy->getScalarType(),
4722 // Wide load/stores.
4723 unsigned Cost = TTI.getAddressComputationCost(VectorTy);
4724 Cost += TTI.getMemoryOpCost(I->getOpcode(), VectorTy, Alignment, AS);
4727 Cost += TTI.getShuffleCost(TargetTransformInfo::SK_Reverse,
4731 case Instruction::ZExt:
4732 case Instruction::SExt:
4733 case Instruction::FPToUI:
4734 case Instruction::FPToSI:
4735 case Instruction::FPExt:
4736 case Instruction::PtrToInt:
4737 case Instruction::IntToPtr:
4738 case Instruction::SIToFP:
4739 case Instruction::UIToFP:
4740 case Instruction::Trunc:
4741 case Instruction::FPTrunc:
4742 case Instruction::BitCast: {
4743 // We optimize the truncation of induction variable.
4744 // The cost of these is the same as the scalar operation.
4745 if (I->getOpcode() == Instruction::Trunc &&
4746 Legal->isInductionVariable(I->getOperand(0)))
4747 return TTI.getCastInstrCost(I->getOpcode(), I->getType(),
4748 I->getOperand(0)->getType());
4750 Type *SrcVecTy = ToVectorTy(I->getOperand(0)->getType(), VF);
4751 return TTI.getCastInstrCost(I->getOpcode(), VectorTy, SrcVecTy);
4753 case Instruction::Call: {
4754 CallInst *CI = cast<CallInst>(I);
4755 Intrinsic::ID ID = getIntrinsicIDForCall(CI, TLI);
4756 assert(ID && "Not an intrinsic call!");
4757 Type *RetTy = ToVectorTy(CI->getType(), VF);
4758 SmallVector<Type*, 4> Tys;
4759 for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i)
4760 Tys.push_back(ToVectorTy(CI->getArgOperand(i)->getType(), VF));
4761 return TTI.getIntrinsicInstrCost(ID, RetTy, Tys);
4764 // We are scalarizing the instruction. Return the cost of the scalar
4765 // instruction, plus the cost of insert and extract into vector
4766 // elements, times the vector width.
4769 if (!RetTy->isVoidTy() && VF != 1) {
4770 unsigned InsCost = TTI.getVectorInstrCost(Instruction::InsertElement,
4772 unsigned ExtCost = TTI.getVectorInstrCost(Instruction::ExtractElement,
4775 // The cost of inserting the results plus extracting each one of the
4777 Cost += VF * (InsCost + ExtCost * I->getNumOperands());
4780 // The cost of executing VF copies of the scalar instruction. This opcode
4781 // is unknown. Assume that it is the same as 'mul'.
4782 Cost += VF * TTI.getArithmeticInstrCost(Instruction::Mul, VectorTy);
4788 Type* LoopVectorizationCostModel::ToVectorTy(Type *Scalar, unsigned VF) {
4789 if (Scalar->isVoidTy() || VF == 1)
4791 return VectorType::get(Scalar, VF);
4794 char LoopVectorize::ID = 0;
4795 static const char lv_name[] = "Loop Vectorization";
4796 INITIALIZE_PASS_BEGIN(LoopVectorize, LV_NAME, lv_name, false, false)
4797 INITIALIZE_AG_DEPENDENCY(TargetTransformInfo)
4798 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution)
4799 INITIALIZE_PASS_DEPENDENCY(LoopSimplify)
4800 INITIALIZE_PASS_END(LoopVectorize, LV_NAME, lv_name, false, false)
4803 Pass *createLoopVectorizePass(bool NoUnrolling) {
4804 return new LoopVectorize(NoUnrolling);
4808 bool LoopVectorizationCostModel::isConsecutiveLoadOrStore(Instruction *Inst) {
4809 // Check for a store.
4810 if (StoreInst *ST = dyn_cast<StoreInst>(Inst))
4811 return Legal->isConsecutivePtr(ST->getPointerOperand()) != 0;
4813 // Check for a load.
4814 if (LoadInst *LI = dyn_cast<LoadInst>(Inst))
4815 return Legal->isConsecutivePtr(LI->getPointerOperand()) != 0;
4821 void InnerLoopUnroller::scalarizeInstruction(Instruction *Instr) {
4822 assert(!Instr->getType()->isAggregateType() && "Can't handle vectors");
4823 // Holds vector parameters or scalars, in case of uniform vals.
4824 SmallVector<VectorParts, 4> Params;
4826 setDebugLocFromInst(Builder, Instr);
4828 // Find all of the vectorized parameters.
4829 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
4830 Value *SrcOp = Instr->getOperand(op);
4832 // If we are accessing the old induction variable, use the new one.
4833 if (SrcOp == OldInduction) {
4834 Params.push_back(getVectorValue(SrcOp));
4838 // Try using previously calculated values.
4839 Instruction *SrcInst = dyn_cast<Instruction>(SrcOp);
4841 // If the src is an instruction that appeared earlier in the basic block
4842 // then it should already be vectorized.
4843 if (SrcInst && OrigLoop->contains(SrcInst)) {
4844 assert(WidenMap.has(SrcInst) && "Source operand is unavailable");
4845 // The parameter is a vector value from earlier.
4846 Params.push_back(WidenMap.get(SrcInst));
4848 // The parameter is a scalar from outside the loop. Maybe even a constant.
4849 VectorParts Scalars;
4850 Scalars.append(UF, SrcOp);
4851 Params.push_back(Scalars);
4855 assert(Params.size() == Instr->getNumOperands() &&
4856 "Invalid number of operands");
4858 // Does this instruction return a value ?
4859 bool IsVoidRetTy = Instr->getType()->isVoidTy();
4861 Value *UndefVec = IsVoidRetTy ? 0 :
4862 UndefValue::get(Instr->getType());
4863 // Create a new entry in the WidenMap and initialize it to Undef or Null.
4864 VectorParts &VecResults = WidenMap.splat(Instr, UndefVec);
4866 // For each vector unroll 'part':
4867 for (unsigned Part = 0; Part < UF; ++Part) {
4868 // For each scalar that we create:
4870 Instruction *Cloned = Instr->clone();
4872 Cloned->setName(Instr->getName() + ".cloned");
4873 // Replace the operands of the cloned instrucions with extracted scalars.
4874 for (unsigned op = 0, e = Instr->getNumOperands(); op != e; ++op) {
4875 Value *Op = Params[op][Part];
4876 Cloned->setOperand(op, Op);
4879 // Place the cloned scalar in the new loop.
4880 Builder.Insert(Cloned);
4882 // If the original scalar returns a value we need to place it in a vector
4883 // so that future users will be able to use it.
4885 VecResults[Part] = Cloned;
4890 InnerLoopUnroller::vectorizeMemoryInstruction(Instruction *Instr,
4891 LoopVectorizationLegality*) {
4892 return scalarizeInstruction(Instr);
4895 Value *InnerLoopUnroller::reverseVector(Value *Vec) {
4899 Value *InnerLoopUnroller::getBroadcastInstrs(Value *V) {
4903 Value *InnerLoopUnroller::getConsecutiveVector(Value* Val, int StartIdx,
4905 // When unrolling and the VF is 1, we only need to add a simple scalar.
4906 Type *ITy = Val->getType();
4907 assert(!ITy->isVectorTy() && "Val must be a scalar");
4908 Constant *C = ConstantInt::get(ITy, StartIdx, Negate);
4909 return Builder.CreateAdd(Val, C, "induction");