Bug Summary

File:lib/Transforms/Vectorize/SLPVectorizer.cpp
Warning:line 2237, column 32
Called C++ object pointer is null

Annotated Source Code

1//===- SLPVectorizer.cpp - A bottom up SLP Vectorizer ---------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9// This pass implements the Bottom Up SLP vectorizer. It detects consecutive
10// stores that can be put together into vector-stores. Next, it attempts to
11// construct vectorizable tree using the use-def chains. If a profitable tree
12// was found, the SLP vectorizer performs vectorization on the tree.
13//
14// The pass is inspired by the work described in the paper:
15// "Loop-Aware SLP in GCC" by Ira Rosen, Dorit Nuzman, Ayal Zaks.
16//
17//===----------------------------------------------------------------------===//
18#include "llvm/Transforms/Vectorize/SLPVectorizer.h"
19#include "llvm/ADT/Optional.h"
20#include "llvm/ADT/PostOrderIterator.h"
21#include "llvm/ADT/SetVector.h"
22#include "llvm/ADT/Statistic.h"
23#include "llvm/Analysis/CodeMetrics.h"
24#include "llvm/Analysis/GlobalsModRef.h"
25#include "llvm/Analysis/LoopAccessAnalysis.h"
26#include "llvm/Analysis/ScalarEvolutionExpressions.h"
27#include "llvm/Analysis/ValueTracking.h"
28#include "llvm/Analysis/VectorUtils.h"
29#include "llvm/IR/DataLayout.h"
30#include "llvm/IR/Dominators.h"
31#include "llvm/IR/IRBuilder.h"
32#include "llvm/IR/Instructions.h"
33#include "llvm/IR/IntrinsicInst.h"
34#include "llvm/IR/Module.h"
35#include "llvm/IR/NoFolder.h"
36#include "llvm/IR/Type.h"
37#include "llvm/IR/Value.h"
38#include "llvm/IR/Verifier.h"
39#include "llvm/Pass.h"
40#include "llvm/Support/CommandLine.h"
41#include "llvm/Support/Debug.h"
42#include "llvm/Support/raw_ostream.h"
43#include "llvm/Transforms/Vectorize.h"
44#include <algorithm>
45#include <memory>
46
47using namespace llvm;
48using namespace slpvectorizer;
49
50#define SV_NAME"slp-vectorizer" "slp-vectorizer"
51#define DEBUG_TYPE"SLP" "SLP"
52
53STATISTIC(NumVectorInstructions, "Number of vector instructions generated")static llvm::Statistic NumVectorInstructions = {"SLP", "NumVectorInstructions"
, "Number of vector instructions generated", {0}, false}
;
54
55static cl::opt<int>
56 SLPCostThreshold("slp-threshold", cl::init(0), cl::Hidden,
57 cl::desc("Only vectorize if you gain more than this "
58 "number "));
59
60static cl::opt<bool>
61ShouldVectorizeHor("slp-vectorize-hor", cl::init(true), cl::Hidden,
62 cl::desc("Attempt to vectorize horizontal reductions"));
63
64static cl::opt<bool> ShouldStartVectorizeHorAtStore(
65 "slp-vectorize-hor-store", cl::init(false), cl::Hidden,
66 cl::desc(
67 "Attempt to vectorize horizontal reductions feeding into a store"));
68
69static cl::opt<int>
70MaxVectorRegSizeOption("slp-max-reg-size", cl::init(128), cl::Hidden,
71 cl::desc("Attempt to vectorize for this register size in bits"));
72
73/// Limits the size of scheduling regions in a block.
74/// It avoid long compile times for _very_ large blocks where vector
75/// instructions are spread over a wide range.
76/// This limit is way higher than needed by real-world functions.
77static cl::opt<int>
78ScheduleRegionSizeBudget("slp-schedule-budget", cl::init(100000), cl::Hidden,
79 cl::desc("Limit the size of the SLP scheduling region per block"));
80
81static cl::opt<int> MinVectorRegSizeOption(
82 "slp-min-reg-size", cl::init(128), cl::Hidden,
83 cl::desc("Attempt to vectorize for this register size in bits"));
84
85static cl::opt<unsigned> RecursionMaxDepth(
86 "slp-recursion-max-depth", cl::init(12), cl::Hidden,
87 cl::desc("Limit the recursion depth when building a vectorizable tree"));
88
89static cl::opt<unsigned> MinTreeSize(
90 "slp-min-tree-size", cl::init(3), cl::Hidden,
91 cl::desc("Only vectorize small trees if they are fully vectorizable"));
92
93// Limit the number of alias checks. The limit is chosen so that
94// it has no negative effect on the llvm benchmarks.
95static const unsigned AliasedCheckLimit = 10;
96
97// Another limit for the alias checks: The maximum distance between load/store
98// instructions where alias checks are done.
99// This limit is useful for very large basic blocks.
100static const unsigned MaxMemDepDistance = 160;
101
102/// If the ScheduleRegionSizeBudget is exhausted, we allow small scheduling
103/// regions to be handled.
104static const int MinScheduleRegionSize = 16;
105
106/// \brief Predicate for the element types that the SLP vectorizer supports.
107///
108/// The most important thing to filter here are types which are invalid in LLVM
109/// vectors. We also filter target specific types which have absolutely no
110/// meaningful vectorization path such as x86_fp80 and ppc_f128. This just
111/// avoids spending time checking the cost model and realizing that they will
112/// be inevitably scalarized.
113static bool isValidElementType(Type *Ty) {
114 return VectorType::isValidElementType(Ty) && !Ty->isX86_FP80Ty() &&
115 !Ty->isPPC_FP128Ty();
116}
117
118/// \returns true if all of the instructions in \p VL are in the same block or
119/// false otherwise.
120static bool allSameBlock(ArrayRef<Value *> VL) {
121 Instruction *I0 = dyn_cast<Instruction>(VL[0]);
122 if (!I0)
123 return false;
124 BasicBlock *BB = I0->getParent();
125 for (int i = 1, e = VL.size(); i < e; i++) {
126 Instruction *I = dyn_cast<Instruction>(VL[i]);
127 if (!I)
128 return false;
129
130 if (BB != I->getParent())
131 return false;
132 }
133 return true;
134}
135
136/// \returns True if all of the values in \p VL are constants.
137static bool allConstant(ArrayRef<Value *> VL) {
138 for (Value *i : VL)
139 if (!isa<Constant>(i))
140 return false;
141 return true;
142}
143
144/// \returns True if all of the values in \p VL are identical.
145static bool isSplat(ArrayRef<Value *> VL) {
146 for (unsigned i = 1, e = VL.size(); i < e; ++i)
147 if (VL[i] != VL[0])
148 return false;
149 return true;
150}
151
152///\returns Opcode that can be clubbed with \p Op to create an alternate
153/// sequence which can later be merged as a ShuffleVector instruction.
154static unsigned getAltOpcode(unsigned Op) {
155 switch (Op) {
156 case Instruction::FAdd:
157 return Instruction::FSub;
158 case Instruction::FSub:
159 return Instruction::FAdd;
160 case Instruction::Add:
161 return Instruction::Sub;
162 case Instruction::Sub:
163 return Instruction::Add;
164 default:
165 return 0;
166 }
167}
168
169///\returns bool representing if Opcode \p Op can be part
170/// of an alternate sequence which can later be merged as
171/// a ShuffleVector instruction.
172static bool canCombineAsAltInst(unsigned Op) {
173 return Op == Instruction::FAdd || Op == Instruction::FSub ||
174 Op == Instruction::Sub || Op == Instruction::Add;
175}
176
177/// \returns ShuffleVector instruction if instructions in \p VL have
178/// alternate fadd,fsub / fsub,fadd/add,sub/sub,add sequence.
179/// (i.e. e.g. opcodes of fadd,fsub,fadd,fsub...)
180static unsigned isAltInst(ArrayRef<Value *> VL) {
181 Instruction *I0 = dyn_cast<Instruction>(VL[0]);
182 unsigned Opcode = I0->getOpcode();
183 unsigned AltOpcode = getAltOpcode(Opcode);
184 for (int i = 1, e = VL.size(); i < e; i++) {
185 Instruction *I = dyn_cast<Instruction>(VL[i]);
186 if (!I || I->getOpcode() != ((i & 1) ? AltOpcode : Opcode))
187 return 0;
188 }
189 return Instruction::ShuffleVector;
190}
191
192/// \returns The opcode if all of the Instructions in \p VL have the same
193/// opcode, or zero.
194static unsigned getSameOpcode(ArrayRef<Value *> VL) {
195 Instruction *I0 = dyn_cast<Instruction>(VL[0]);
196 if (!I0)
197 return 0;
198 unsigned Opcode = I0->getOpcode();
199 for (int i = 1, e = VL.size(); i < e; i++) {
200 Instruction *I = dyn_cast<Instruction>(VL[i]);
201 if (!I || Opcode != I->getOpcode()) {
202 if (canCombineAsAltInst(Opcode) && i == 1)
203 return isAltInst(VL);
204 return 0;
205 }
206 }
207 return Opcode;
208}
209
210/// Get the intersection (logical and) of all of the potential IR flags
211/// of each scalar operation (VL) that will be converted into a vector (I).
212/// Flag set: NSW, NUW, exact, and all of fast-math.
213static void propagateIRFlags(Value *I, ArrayRef<Value *> VL) {
214 if (auto *VecOp = dyn_cast<Instruction>(I)) {
215 if (auto *Intersection = dyn_cast<Instruction>(VL[0])) {
216 // Intersection is initialized to the 0th scalar,
217 // so start counting from index '1'.
218 for (int i = 1, e = VL.size(); i < e; ++i) {
219 if (auto *Scalar = dyn_cast<Instruction>(VL[i]))
220 Intersection->andIRFlags(Scalar);
221 }
222 VecOp->copyIRFlags(Intersection);
223 }
224 }
225}
226
227/// \returns true if all of the values in \p VL have the same type or false
228/// otherwise.
229static bool allSameType(ArrayRef<Value *> VL) {
230 Type *Ty = VL[0]->getType();
231 for (int i = 1, e = VL.size(); i < e; i++)
232 if (VL[i]->getType() != Ty)
233 return false;
234
235 return true;
236}
237
238/// \returns True if Extract{Value,Element} instruction extracts element Idx.
239static bool matchExtractIndex(Instruction *E, unsigned Idx, unsigned Opcode) {
240 assert(Opcode == Instruction::ExtractElement ||((Opcode == Instruction::ExtractElement || Opcode == Instruction
::ExtractValue) ? static_cast<void> (0) : __assert_fail
("Opcode == Instruction::ExtractElement || Opcode == Instruction::ExtractValue"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 241, __PRETTY_FUNCTION__))
241 Opcode == Instruction::ExtractValue)((Opcode == Instruction::ExtractElement || Opcode == Instruction
::ExtractValue) ? static_cast<void> (0) : __assert_fail
("Opcode == Instruction::ExtractElement || Opcode == Instruction::ExtractValue"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 241, __PRETTY_FUNCTION__))
;
242 if (Opcode == Instruction::ExtractElement) {
243 ConstantInt *CI = dyn_cast<ConstantInt>(E->getOperand(1));
244 return CI && CI->getZExtValue() == Idx;
245 } else {
246 ExtractValueInst *EI = cast<ExtractValueInst>(E);
247 return EI->getNumIndices() == 1 && *EI->idx_begin() == Idx;
248 }
249}
250
251/// \returns True if in-tree use also needs extract. This refers to
252/// possible scalar operand in vectorized instruction.
253static bool InTreeUserNeedToExtract(Value *Scalar, Instruction *UserInst,
254 TargetLibraryInfo *TLI) {
255
256 unsigned Opcode = UserInst->getOpcode();
257 switch (Opcode) {
258 case Instruction::Load: {
259 LoadInst *LI = cast<LoadInst>(UserInst);
260 return (LI->getPointerOperand() == Scalar);
261 }
262 case Instruction::Store: {
263 StoreInst *SI = cast<StoreInst>(UserInst);
264 return (SI->getPointerOperand() == Scalar);
265 }
266 case Instruction::Call: {
267 CallInst *CI = cast<CallInst>(UserInst);
268 Intrinsic::ID ID = getVectorIntrinsicIDForCall(CI, TLI);
269 if (hasVectorInstrinsicScalarOpd(ID, 1)) {
270 return (CI->getArgOperand(1) == Scalar);
271 }
272 }
273 default:
274 return false;
275 }
276}
277
278/// \returns the AA location that is being access by the instruction.
279static MemoryLocation getLocation(Instruction *I, AliasAnalysis *AA) {
280 if (StoreInst *SI = dyn_cast<StoreInst>(I))
281 return MemoryLocation::get(SI);
282 if (LoadInst *LI = dyn_cast<LoadInst>(I))
283 return MemoryLocation::get(LI);
284 return MemoryLocation();
285}
286
287/// \returns True if the instruction is not a volatile or atomic load/store.
288static bool isSimple(Instruction *I) {
289 if (LoadInst *LI = dyn_cast<LoadInst>(I))
290 return LI->isSimple();
291 if (StoreInst *SI = dyn_cast<StoreInst>(I))
292 return SI->isSimple();
293 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(I))
294 return !MI->isVolatile();
295 return true;
296}
297
298namespace llvm {
299namespace slpvectorizer {
300/// Bottom Up SLP Vectorizer.
301class BoUpSLP {
302public:
303 typedef SmallVector<Value *, 8> ValueList;
304 typedef SmallVector<Instruction *, 16> InstrList;
305 typedef SmallPtrSet<Value *, 16> ValueSet;
306 typedef SmallVector<StoreInst *, 8> StoreList;
307
308 BoUpSLP(Function *Func, ScalarEvolution *Se, TargetTransformInfo *Tti,
309 TargetLibraryInfo *TLi, AliasAnalysis *Aa, LoopInfo *Li,
310 DominatorTree *Dt, AssumptionCache *AC, DemandedBits *DB,
311 const DataLayout *DL)
312 : NumLoadsWantToKeepOrder(0), NumLoadsWantToChangeOrder(0), F(Func),
313 SE(Se), TTI(Tti), TLI(TLi), AA(Aa), LI(Li), DT(Dt), AC(AC), DB(DB),
314 DL(DL), Builder(Se->getContext()) {
315 CodeMetrics::collectEphemeralValues(F, AC, EphValues);
316 // Use the vector register size specified by the target unless overridden
317 // by a command-line option.
318 // TODO: It would be better to limit the vectorization factor based on
319 // data type rather than just register size. For example, x86 AVX has
320 // 256-bit registers, but it does not support integer operations
321 // at that width (that requires AVX2).
322 if (MaxVectorRegSizeOption.getNumOccurrences())
323 MaxVecRegSize = MaxVectorRegSizeOption;
324 else
325 MaxVecRegSize = TTI->getRegisterBitWidth(true);
326
327 MinVecRegSize = MinVectorRegSizeOption;
328 }
329
330 /// \brief Vectorize the tree that starts with the elements in \p VL.
331 /// Returns the vectorized root.
332 Value *vectorizeTree();
333
334 /// \returns the cost incurred by unwanted spills and fills, caused by
335 /// holding live values over call sites.
336 int getSpillCost();
337
338 /// \returns the vectorization cost of the subtree that starts at \p VL.
339 /// A negative number means that this is profitable.
340 int getTreeCost();
341
342 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
343 /// the purpose of scheduling and extraction in the \p UserIgnoreLst.
344 void buildTree(ArrayRef<Value *> Roots,
345 ArrayRef<Value *> UserIgnoreLst = None);
346
347 /// Clear the internal data structures that are created by 'buildTree'.
348 void deleteTree() {
349 VectorizableTree.clear();
350 ScalarToTreeEntry.clear();
351 MustGather.clear();
352 ExternalUses.clear();
353 NumLoadsWantToKeepOrder = 0;
354 NumLoadsWantToChangeOrder = 0;
355 for (auto &Iter : BlocksSchedules) {
356 BlockScheduling *BS = Iter.second.get();
357 BS->clear();
358 }
359 MinBWs.clear();
360 }
361
362 /// \brief Perform LICM and CSE on the newly generated gather sequences.
363 void optimizeGatherSequence();
364
365 /// \returns true if it is beneficial to reverse the vector order.
366 bool shouldReorder() const {
367 return NumLoadsWantToChangeOrder > NumLoadsWantToKeepOrder;
368 }
369
370 /// \return The vector element size in bits to use when vectorizing the
371 /// expression tree ending at \p V. If V is a store, the size is the width of
372 /// the stored value. Otherwise, the size is the width of the largest loaded
373 /// value reaching V. This method is used by the vectorizer to calculate
374 /// vectorization factors.
375 unsigned getVectorElementSize(Value *V);
376
377 /// Compute the minimum type sizes required to represent the entries in a
378 /// vectorizable tree.
379 void computeMinimumValueSizes();
380
381 // \returns maximum vector register size as set by TTI or overridden by cl::opt.
382 unsigned getMaxVecRegSize() const {
383 return MaxVecRegSize;
384 }
385
386 // \returns minimum vector register size as set by cl::opt.
387 unsigned getMinVecRegSize() const {
388 return MinVecRegSize;
389 }
390
391 /// \brief Check if ArrayType or StructType is isomorphic to some VectorType.
392 ///
393 /// \returns number of elements in vector if isomorphism exists, 0 otherwise.
394 unsigned canMapToVector(Type *T, const DataLayout &DL) const;
395
396 /// \returns True if the VectorizableTree is both tiny and not fully
397 /// vectorizable. We do not vectorize such trees.
398 bool isTreeTinyAndNotFullyVectorizable();
399
400private:
401 struct TreeEntry;
402
403 /// \returns the cost of the vectorizable entry.
404 int getEntryCost(TreeEntry *E);
405
406 /// This is the recursive part of buildTree.
407 void buildTree_rec(ArrayRef<Value *> Roots, unsigned Depth);
408
409 /// \returns True if the ExtractElement/ExtractValue instructions in VL can
410 /// be vectorized to use the original vector (or aggregate "bitcast" to a vector).
411 bool canReuseExtract(ArrayRef<Value *> VL, unsigned Opcode) const;
412
413 /// Vectorize a single entry in the tree.
414 Value *vectorizeTree(TreeEntry *E);
415
416 /// Vectorize a single entry in the tree, starting in \p VL.
417 Value *vectorizeTree(ArrayRef<Value *> VL);
418
419 /// \returns the pointer to the vectorized value if \p VL is already
420 /// vectorized, or NULL. They may happen in cycles.
421 Value *alreadyVectorized(ArrayRef<Value *> VL) const;
422
423 /// \returns the scalarization cost for this type. Scalarization in this
424 /// context means the creation of vectors from a group of scalars.
425 int getGatherCost(Type *Ty);
426
427 /// \returns the scalarization cost for this list of values. Assuming that
428 /// this subtree gets vectorized, we may need to extract the values from the
429 /// roots. This method calculates the cost of extracting the values.
430 int getGatherCost(ArrayRef<Value *> VL);
431
432 /// \brief Set the Builder insert point to one after the last instruction in
433 /// the bundle
434 void setInsertPointAfterBundle(ArrayRef<Value *> VL);
435
436 /// \returns a vector from a collection of scalars in \p VL.
437 Value *Gather(ArrayRef<Value *> VL, VectorType *Ty);
438
439 /// \returns whether the VectorizableTree is fully vectorizable and will
440 /// be beneficial even the tree height is tiny.
441 bool isFullyVectorizableTinyTree();
442
443 /// \reorder commutative operands in alt shuffle if they result in
444 /// vectorized code.
445 void reorderAltShuffleOperands(ArrayRef<Value *> VL,
446 SmallVectorImpl<Value *> &Left,
447 SmallVectorImpl<Value *> &Right);
448 /// \reorder commutative operands to get better probability of
449 /// generating vectorized code.
450 void reorderInputsAccordingToOpcode(ArrayRef<Value *> VL,
451 SmallVectorImpl<Value *> &Left,
452 SmallVectorImpl<Value *> &Right);
453 struct TreeEntry {
454 TreeEntry() : Scalars(), VectorizedValue(nullptr),
455 NeedToGather(0) {}
456
457 /// \returns true if the scalars in VL are equal to this entry.
458 bool isSame(ArrayRef<Value *> VL) const {
459 assert(VL.size() == Scalars.size() && "Invalid size")((VL.size() == Scalars.size() && "Invalid size") ? static_cast
<void> (0) : __assert_fail ("VL.size() == Scalars.size() && \"Invalid size\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 459, __PRETTY_FUNCTION__))
;
460 return std::equal(VL.begin(), VL.end(), Scalars.begin());
461 }
462
463 /// A vector of scalars.
464 ValueList Scalars;
465
466 /// The Scalars are vectorized into this value. It is initialized to Null.
467 Value *VectorizedValue;
468
469 /// Do we need to gather this sequence ?
470 bool NeedToGather;
471 };
472
473 /// Create a new VectorizableTree entry.
474 TreeEntry *newTreeEntry(ArrayRef<Value *> VL, bool Vectorized) {
475 VectorizableTree.emplace_back();
476 int idx = VectorizableTree.size() - 1;
477 TreeEntry *Last = &VectorizableTree[idx];
478 Last->Scalars.insert(Last->Scalars.begin(), VL.begin(), VL.end());
479 Last->NeedToGather = !Vectorized;
480 if (Vectorized) {
481 for (int i = 0, e = VL.size(); i != e; ++i) {
482 assert(!ScalarToTreeEntry.count(VL[i]) && "Scalar already in tree!")((!ScalarToTreeEntry.count(VL[i]) && "Scalar already in tree!"
) ? static_cast<void> (0) : __assert_fail ("!ScalarToTreeEntry.count(VL[i]) && \"Scalar already in tree!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 482, __PRETTY_FUNCTION__))
;
483 ScalarToTreeEntry[VL[i]] = idx;
484 }
485 } else {
486 MustGather.insert(VL.begin(), VL.end());
487 }
488 return Last;
489 }
490
491 /// -- Vectorization State --
492 /// Holds all of the tree entries.
493 std::vector<TreeEntry> VectorizableTree;
494
495 /// Maps a specific scalar to its tree entry.
496 SmallDenseMap<Value*, int> ScalarToTreeEntry;
497
498 /// A list of scalars that we found that we need to keep as scalars.
499 ValueSet MustGather;
500
501 /// This POD struct describes one external user in the vectorized tree.
502 struct ExternalUser {
503 ExternalUser (Value *S, llvm::User *U, int L) :
504 Scalar(S), User(U), Lane(L){}
505 // Which scalar in our function.
506 Value *Scalar;
507 // Which user that uses the scalar.
508 llvm::User *User;
509 // Which lane does the scalar belong to.
510 int Lane;
511 };
512 typedef SmallVector<ExternalUser, 16> UserList;
513
514 /// Checks if two instructions may access the same memory.
515 ///
516 /// \p Loc1 is the location of \p Inst1. It is passed explicitly because it
517 /// is invariant in the calling loop.
518 bool isAliased(const MemoryLocation &Loc1, Instruction *Inst1,
519 Instruction *Inst2) {
520
521 // First check if the result is already in the cache.
522 AliasCacheKey key = std::make_pair(Inst1, Inst2);
523 Optional<bool> &result = AliasCache[key];
524 if (result.hasValue()) {
525 return result.getValue();
526 }
527 MemoryLocation Loc2 = getLocation(Inst2, AA);
528 bool aliased = true;
529 if (Loc1.Ptr && Loc2.Ptr && isSimple(Inst1) && isSimple(Inst2)) {
530 // Do the alias check.
531 aliased = AA->alias(Loc1, Loc2);
532 }
533 // Store the result in the cache.
534 result = aliased;
535 return aliased;
536 }
537
538 typedef std::pair<Instruction *, Instruction *> AliasCacheKey;
539
540 /// Cache for alias results.
541 /// TODO: consider moving this to the AliasAnalysis itself.
542 DenseMap<AliasCacheKey, Optional<bool>> AliasCache;
543
544 /// Removes an instruction from its block and eventually deletes it.
545 /// It's like Instruction::eraseFromParent() except that the actual deletion
546 /// is delayed until BoUpSLP is destructed.
547 /// This is required to ensure that there are no incorrect collisions in the
548 /// AliasCache, which can happen if a new instruction is allocated at the
549 /// same address as a previously deleted instruction.
550 void eraseInstruction(Instruction *I) {
551 I->removeFromParent();
552 I->dropAllReferences();
553 DeletedInstructions.push_back(std::unique_ptr<Instruction>(I));
554 }
555
556 /// Temporary store for deleted instructions. Instructions will be deleted
557 /// eventually when the BoUpSLP is destructed.
558 SmallVector<std::unique_ptr<Instruction>, 8> DeletedInstructions;
559
560 /// A list of values that need to extracted out of the tree.
561 /// This list holds pairs of (Internal Scalar : External User).
562 UserList ExternalUses;
563
564 /// Values used only by @llvm.assume calls.
565 SmallPtrSet<const Value *, 32> EphValues;
566
567 /// Holds all of the instructions that we gathered.
568 SetVector<Instruction *> GatherSeq;
569 /// A list of blocks that we are going to CSE.
570 SetVector<BasicBlock *> CSEBlocks;
571
572 /// Contains all scheduling relevant data for an instruction.
573 /// A ScheduleData either represents a single instruction or a member of an
574 /// instruction bundle (= a group of instructions which is combined into a
575 /// vector instruction).
576 struct ScheduleData {
577
578 // The initial value for the dependency counters. It means that the
579 // dependencies are not calculated yet.
580 enum { InvalidDeps = -1 };
581
582 ScheduleData()
583 : Inst(nullptr), FirstInBundle(nullptr), NextInBundle(nullptr),
584 NextLoadStore(nullptr), SchedulingRegionID(0), SchedulingPriority(0),
585 Dependencies(InvalidDeps), UnscheduledDeps(InvalidDeps),
586 UnscheduledDepsInBundle(InvalidDeps), IsScheduled(false) {}
587
588 void init(int BlockSchedulingRegionID) {
589 FirstInBundle = this;
590 NextInBundle = nullptr;
591 NextLoadStore = nullptr;
592 IsScheduled = false;
593 SchedulingRegionID = BlockSchedulingRegionID;
594 UnscheduledDepsInBundle = UnscheduledDeps;
595 clearDependencies();
596 }
597
598 /// Returns true if the dependency information has been calculated.
599 bool hasValidDependencies() const { return Dependencies != InvalidDeps; }
600
601 /// Returns true for single instructions and for bundle representatives
602 /// (= the head of a bundle).
603 bool isSchedulingEntity() const { return FirstInBundle == this; }
604
605 /// Returns true if it represents an instruction bundle and not only a
606 /// single instruction.
607 bool isPartOfBundle() const {
608 return NextInBundle != nullptr || FirstInBundle != this;
609 }
610
611 /// Returns true if it is ready for scheduling, i.e. it has no more
612 /// unscheduled depending instructions/bundles.
613 bool isReady() const {
614 assert(isSchedulingEntity() &&((isSchedulingEntity() && "can't consider non-scheduling entity for ready list"
) ? static_cast<void> (0) : __assert_fail ("isSchedulingEntity() && \"can't consider non-scheduling entity for ready list\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 615, __PRETTY_FUNCTION__))
615 "can't consider non-scheduling entity for ready list")((isSchedulingEntity() && "can't consider non-scheduling entity for ready list"
) ? static_cast<void> (0) : __assert_fail ("isSchedulingEntity() && \"can't consider non-scheduling entity for ready list\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 615, __PRETTY_FUNCTION__))
;
616 return UnscheduledDepsInBundle == 0 && !IsScheduled;
617 }
618
619 /// Modifies the number of unscheduled dependencies, also updating it for
620 /// the whole bundle.
621 int incrementUnscheduledDeps(int Incr) {
622 UnscheduledDeps += Incr;
623 return FirstInBundle->UnscheduledDepsInBundle += Incr;
624 }
625
626 /// Sets the number of unscheduled dependencies to the number of
627 /// dependencies.
628 void resetUnscheduledDeps() {
629 incrementUnscheduledDeps(Dependencies - UnscheduledDeps);
630 }
631
632 /// Clears all dependency information.
633 void clearDependencies() {
634 Dependencies = InvalidDeps;
635 resetUnscheduledDeps();
636 MemoryDependencies.clear();
637 }
638
639 void dump(raw_ostream &os) const {
640 if (!isSchedulingEntity()) {
641 os << "/ " << *Inst;
642 } else if (NextInBundle) {
643 os << '[' << *Inst;
644 ScheduleData *SD = NextInBundle;
645 while (SD) {
646 os << ';' << *SD->Inst;
647 SD = SD->NextInBundle;
648 }
649 os << ']';
650 } else {
651 os << *Inst;
652 }
653 }
654
655 Instruction *Inst;
656
657 /// Points to the head in an instruction bundle (and always to this for
658 /// single instructions).
659 ScheduleData *FirstInBundle;
660
661 /// Single linked list of all instructions in a bundle. Null if it is a
662 /// single instruction.
663 ScheduleData *NextInBundle;
664
665 /// Single linked list of all memory instructions (e.g. load, store, call)
666 /// in the block - until the end of the scheduling region.
667 ScheduleData *NextLoadStore;
668
669 /// The dependent memory instructions.
670 /// This list is derived on demand in calculateDependencies().
671 SmallVector<ScheduleData *, 4> MemoryDependencies;
672
673 /// This ScheduleData is in the current scheduling region if this matches
674 /// the current SchedulingRegionID of BlockScheduling.
675 int SchedulingRegionID;
676
677 /// Used for getting a "good" final ordering of instructions.
678 int SchedulingPriority;
679
680 /// The number of dependencies. Constitutes of the number of users of the
681 /// instruction plus the number of dependent memory instructions (if any).
682 /// This value is calculated on demand.
683 /// If InvalidDeps, the number of dependencies is not calculated yet.
684 ///
685 int Dependencies;
686
687 /// The number of dependencies minus the number of dependencies of scheduled
688 /// instructions. As soon as this is zero, the instruction/bundle gets ready
689 /// for scheduling.
690 /// Note that this is negative as long as Dependencies is not calculated.
691 int UnscheduledDeps;
692
693 /// The sum of UnscheduledDeps in a bundle. Equals to UnscheduledDeps for
694 /// single instructions.
695 int UnscheduledDepsInBundle;
696
697 /// True if this instruction is scheduled (or considered as scheduled in the
698 /// dry-run).
699 bool IsScheduled;
700 };
701
702#ifndef NDEBUG
703 friend inline raw_ostream &operator<<(raw_ostream &os,
704 const BoUpSLP::ScheduleData &SD) {
705 SD.dump(os);
706 return os;
707 }
708#endif
709
710 /// Contains all scheduling data for a basic block.
711 ///
712 struct BlockScheduling {
713
714 BlockScheduling(BasicBlock *BB)
715 : BB(BB), ChunkSize(BB->size()), ChunkPos(ChunkSize),
716 ScheduleStart(nullptr), ScheduleEnd(nullptr),
717 FirstLoadStoreInRegion(nullptr), LastLoadStoreInRegion(nullptr),
718 ScheduleRegionSize(0),
719 ScheduleRegionSizeLimit(ScheduleRegionSizeBudget),
720 // Make sure that the initial SchedulingRegionID is greater than the
721 // initial SchedulingRegionID in ScheduleData (which is 0).
722 SchedulingRegionID(1) {}
723
724 void clear() {
725 ReadyInsts.clear();
726 ScheduleStart = nullptr;
727 ScheduleEnd = nullptr;
728 FirstLoadStoreInRegion = nullptr;
729 LastLoadStoreInRegion = nullptr;
730
731 // Reduce the maximum schedule region size by the size of the
732 // previous scheduling run.
733 ScheduleRegionSizeLimit -= ScheduleRegionSize;
734 if (ScheduleRegionSizeLimit < MinScheduleRegionSize)
735 ScheduleRegionSizeLimit = MinScheduleRegionSize;
736 ScheduleRegionSize = 0;
737
738 // Make a new scheduling region, i.e. all existing ScheduleData is not
739 // in the new region yet.
740 ++SchedulingRegionID;
741 }
742
743 ScheduleData *getScheduleData(Value *V) {
744 ScheduleData *SD = ScheduleDataMap[V];
745 if (SD && SD->SchedulingRegionID == SchedulingRegionID)
746 return SD;
747 return nullptr;
748 }
749
750 bool isInSchedulingRegion(ScheduleData *SD) {
751 return SD->SchedulingRegionID == SchedulingRegionID;
752 }
753
754 /// Marks an instruction as scheduled and puts all dependent ready
755 /// instructions into the ready-list.
756 template <typename ReadyListType>
757 void schedule(ScheduleData *SD, ReadyListType &ReadyList) {
758 SD->IsScheduled = true;
759 DEBUG(dbgs() << "SLP: schedule " << *SD << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: schedule " << *SD <<
"\n"; } } while (false)
;
760
761 ScheduleData *BundleMember = SD;
762 while (BundleMember) {
763 // Handle the def-use chain dependencies.
764 for (Use &U : BundleMember->Inst->operands()) {
765 ScheduleData *OpDef = getScheduleData(U.get());
766 if (OpDef && OpDef->hasValidDependencies() &&
767 OpDef->incrementUnscheduledDeps(-1) == 0) {
768 // There are no more unscheduled dependencies after decrementing,
769 // so we can put the dependent instruction into the ready list.
770 ScheduleData *DepBundle = OpDef->FirstInBundle;
771 assert(!DepBundle->IsScheduled &&((!DepBundle->IsScheduled && "already scheduled bundle gets ready"
) ? static_cast<void> (0) : __assert_fail ("!DepBundle->IsScheduled && \"already scheduled bundle gets ready\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 772, __PRETTY_FUNCTION__))
772 "already scheduled bundle gets ready")((!DepBundle->IsScheduled && "already scheduled bundle gets ready"
) ? static_cast<void> (0) : __assert_fail ("!DepBundle->IsScheduled && \"already scheduled bundle gets ready\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 772, __PRETTY_FUNCTION__))
;
773 ReadyList.insert(DepBundle);
774 DEBUG(dbgs() << "SLP: gets ready (def): " << *DepBundle << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: gets ready (def): " <<
*DepBundle << "\n"; } } while (false)
;
775 }
776 }
777 // Handle the memory dependencies.
778 for (ScheduleData *MemoryDepSD : BundleMember->MemoryDependencies) {
779 if (MemoryDepSD->incrementUnscheduledDeps(-1) == 0) {
780 // There are no more unscheduled dependencies after decrementing,
781 // so we can put the dependent instruction into the ready list.
782 ScheduleData *DepBundle = MemoryDepSD->FirstInBundle;
783 assert(!DepBundle->IsScheduled &&((!DepBundle->IsScheduled && "already scheduled bundle gets ready"
) ? static_cast<void> (0) : __assert_fail ("!DepBundle->IsScheduled && \"already scheduled bundle gets ready\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 784, __PRETTY_FUNCTION__))
784 "already scheduled bundle gets ready")((!DepBundle->IsScheduled && "already scheduled bundle gets ready"
) ? static_cast<void> (0) : __assert_fail ("!DepBundle->IsScheduled && \"already scheduled bundle gets ready\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 784, __PRETTY_FUNCTION__))
;
785 ReadyList.insert(DepBundle);
786 DEBUG(dbgs() << "SLP: gets ready (mem): " << *DepBundle << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: gets ready (mem): " <<
*DepBundle << "\n"; } } while (false)
;
787 }
788 }
789 BundleMember = BundleMember->NextInBundle;
790 }
791 }
792
793 /// Put all instructions into the ReadyList which are ready for scheduling.
794 template <typename ReadyListType>
795 void initialFillReadyList(ReadyListType &ReadyList) {
796 for (auto *I = ScheduleStart; I != ScheduleEnd; I = I->getNextNode()) {
797 ScheduleData *SD = getScheduleData(I);
798 if (SD->isSchedulingEntity() && SD->isReady()) {
799 ReadyList.insert(SD);
800 DEBUG(dbgs() << "SLP: initially in ready list: " << *I << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: initially in ready list: "
<< *I << "\n"; } } while (false)
;
801 }
802 }
803 }
804
805 /// Checks if a bundle of instructions can be scheduled, i.e. has no
806 /// cyclic dependencies. This is only a dry-run, no instructions are
807 /// actually moved at this stage.
808 bool tryScheduleBundle(ArrayRef<Value *> VL, BoUpSLP *SLP);
809
810 /// Un-bundles a group of instructions.
811 void cancelScheduling(ArrayRef<Value *> VL);
812
813 /// Extends the scheduling region so that V is inside the region.
814 /// \returns true if the region size is within the limit.
815 bool extendSchedulingRegion(Value *V);
816
817 /// Initialize the ScheduleData structures for new instructions in the
818 /// scheduling region.
819 void initScheduleData(Instruction *FromI, Instruction *ToI,
820 ScheduleData *PrevLoadStore,
821 ScheduleData *NextLoadStore);
822
823 /// Updates the dependency information of a bundle and of all instructions/
824 /// bundles which depend on the original bundle.
825 void calculateDependencies(ScheduleData *SD, bool InsertInReadyList,
826 BoUpSLP *SLP);
827
828 /// Sets all instruction in the scheduling region to un-scheduled.
829 void resetSchedule();
830
831 BasicBlock *BB;
832
833 /// Simple memory allocation for ScheduleData.
834 std::vector<std::unique_ptr<ScheduleData[]>> ScheduleDataChunks;
835
836 /// The size of a ScheduleData array in ScheduleDataChunks.
837 int ChunkSize;
838
839 /// The allocator position in the current chunk, which is the last entry
840 /// of ScheduleDataChunks.
841 int ChunkPos;
842
843 /// Attaches ScheduleData to Instruction.
844 /// Note that the mapping survives during all vectorization iterations, i.e.
845 /// ScheduleData structures are recycled.
846 DenseMap<Value *, ScheduleData *> ScheduleDataMap;
847
848 struct ReadyList : SmallVector<ScheduleData *, 8> {
849 void insert(ScheduleData *SD) { push_back(SD); }
850 };
851
852 /// The ready-list for scheduling (only used for the dry-run).
853 ReadyList ReadyInsts;
854
855 /// The first instruction of the scheduling region.
856 Instruction *ScheduleStart;
857
858 /// The first instruction _after_ the scheduling region.
859 Instruction *ScheduleEnd;
860
861 /// The first memory accessing instruction in the scheduling region
862 /// (can be null).
863 ScheduleData *FirstLoadStoreInRegion;
864
865 /// The last memory accessing instruction in the scheduling region
866 /// (can be null).
867 ScheduleData *LastLoadStoreInRegion;
868
869 /// The current size of the scheduling region.
870 int ScheduleRegionSize;
871
872 /// The maximum size allowed for the scheduling region.
873 int ScheduleRegionSizeLimit;
874
875 /// The ID of the scheduling region. For a new vectorization iteration this
876 /// is incremented which "removes" all ScheduleData from the region.
877 int SchedulingRegionID;
878 };
879
880 /// Attaches the BlockScheduling structures to basic blocks.
881 MapVector<BasicBlock *, std::unique_ptr<BlockScheduling>> BlocksSchedules;
882
883 /// Performs the "real" scheduling. Done before vectorization is actually
884 /// performed in a basic block.
885 void scheduleBlock(BlockScheduling *BS);
886
887 /// List of users to ignore during scheduling and that don't need extracting.
888 ArrayRef<Value *> UserIgnoreList;
889
890 // Number of load bundles that contain consecutive loads.
891 int NumLoadsWantToKeepOrder;
892
893 // Number of load bundles that contain consecutive loads in reversed order.
894 int NumLoadsWantToChangeOrder;
895
896 // Analysis and block reference.
897 Function *F;
898 ScalarEvolution *SE;
899 TargetTransformInfo *TTI;
900 TargetLibraryInfo *TLI;
901 AliasAnalysis *AA;
902 LoopInfo *LI;
903 DominatorTree *DT;
904 AssumptionCache *AC;
905 DemandedBits *DB;
906 const DataLayout *DL;
907 unsigned MaxVecRegSize; // This is set by TTI or overridden by cl::opt.
908 unsigned MinVecRegSize; // Set by cl::opt (default: 128).
909 /// Instruction builder to construct the vectorized tree.
910 IRBuilder<> Builder;
911
912 /// A map of scalar integer values to the smallest bit width with which they
913 /// can legally be represented. The values map to (width, signed) pairs,
914 /// where "width" indicates the minimum bit width and "signed" is True if the
915 /// value must be signed-extended, rather than zero-extended, back to its
916 /// original width.
917 MapVector<Value *, std::pair<uint64_t, bool>> MinBWs;
918};
919
920} // end namespace llvm
921} // end namespace slpvectorizer
922
923void BoUpSLP::buildTree(ArrayRef<Value *> Roots,
924 ArrayRef<Value *> UserIgnoreLst) {
925 deleteTree();
926 UserIgnoreList = UserIgnoreLst;
927 if (!allSameType(Roots))
928 return;
929 buildTree_rec(Roots, 0);
930
931 // Collect the values that we need to extract from the tree.
932 for (TreeEntry &EIdx : VectorizableTree) {
933 TreeEntry *Entry = &EIdx;
934
935 // For each lane:
936 for (int Lane = 0, LE = Entry->Scalars.size(); Lane != LE; ++Lane) {
937 Value *Scalar = Entry->Scalars[Lane];
938
939 // No need to handle users of gathered values.
940 if (Entry->NeedToGather)
941 continue;
942
943 for (User *U : Scalar->users()) {
944 DEBUG(dbgs() << "SLP: Checking user:" << *U << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Checking user:" << *U <<
".\n"; } } while (false)
;
945
946 Instruction *UserInst = dyn_cast<Instruction>(U);
947 if (!UserInst)
948 continue;
949
950 // Skip in-tree scalars that become vectors
951 if (ScalarToTreeEntry.count(U)) {
952 int Idx = ScalarToTreeEntry[U];
953 TreeEntry *UseEntry = &VectorizableTree[Idx];
954 Value *UseScalar = UseEntry->Scalars[0];
955 // Some in-tree scalars will remain as scalar in vectorized
956 // instructions. If that is the case, the one in Lane 0 will
957 // be used.
958 if (UseScalar != U ||
959 !InTreeUserNeedToExtract(Scalar, UserInst, TLI)) {
960 DEBUG(dbgs() << "SLP: \tInternal user will be removed:" << *Udo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: \tInternal user will be removed:"
<< *U << ".\n"; } } while (false)
961 << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: \tInternal user will be removed:"
<< *U << ".\n"; } } while (false)
;
962 assert(!VectorizableTree[Idx].NeedToGather && "Bad state")((!VectorizableTree[Idx].NeedToGather && "Bad state")
? static_cast<void> (0) : __assert_fail ("!VectorizableTree[Idx].NeedToGather && \"Bad state\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 962, __PRETTY_FUNCTION__))
;
963 continue;
964 }
965 }
966
967 // Ignore users in the user ignore list.
968 if (is_contained(UserIgnoreList, UserInst))
969 continue;
970
971 DEBUG(dbgs() << "SLP: Need to extract:" << *U << " from lane " <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Need to extract:" << *
U << " from lane " << Lane << " from " <<
*Scalar << ".\n"; } } while (false)
972 Lane << " from " << *Scalar << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Need to extract:" << *
U << " from lane " << Lane << " from " <<
*Scalar << ".\n"; } } while (false)
;
973 ExternalUses.push_back(ExternalUser(Scalar, U, Lane));
974 }
975 }
976 }
977}
978
979
980void BoUpSLP::buildTree_rec(ArrayRef<Value *> VL, unsigned Depth) {
981 bool isAltShuffle = false;
982 assert((allConstant(VL) || allSameType(VL)) && "Invalid types!")(((allConstant(VL) || allSameType(VL)) && "Invalid types!"
) ? static_cast<void> (0) : __assert_fail ("(allConstant(VL) || allSameType(VL)) && \"Invalid types!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 982, __PRETTY_FUNCTION__))
;
983
984 if (Depth == RecursionMaxDepth) {
985 DEBUG(dbgs() << "SLP: Gathering due to max recursion depth.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to max recursion depth.\n"
; } } while (false)
;
986 newTreeEntry(VL, false);
987 return;
988 }
989
990 // Don't handle vectors.
991 if (VL[0]->getType()->isVectorTy()) {
992 DEBUG(dbgs() << "SLP: Gathering due to vector type.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to vector type.\n"
; } } while (false)
;
993 newTreeEntry(VL, false);
994 return;
995 }
996
997 if (StoreInst *SI = dyn_cast<StoreInst>(VL[0]))
998 if (SI->getValueOperand()->getType()->isVectorTy()) {
999 DEBUG(dbgs() << "SLP: Gathering due to store vector type.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to store vector type.\n"
; } } while (false)
;
1000 newTreeEntry(VL, false);
1001 return;
1002 }
1003 unsigned Opcode = getSameOpcode(VL);
1004
1005 // Check that this shuffle vector refers to the alternate
1006 // sequence of opcodes.
1007 if (Opcode == Instruction::ShuffleVector) {
1008 Instruction *I0 = dyn_cast<Instruction>(VL[0]);
1009 unsigned Op = I0->getOpcode();
1010 if (Op != Instruction::ShuffleVector)
1011 isAltShuffle = true;
1012 }
1013
1014 // If all of the operands are identical or constant we have a simple solution.
1015 if (allConstant(VL) || isSplat(VL) || !allSameBlock(VL) || !Opcode) {
1016 DEBUG(dbgs() << "SLP: Gathering due to C,S,B,O. \n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to C,S,B,O. \n"
; } } while (false)
;
1017 newTreeEntry(VL, false);
1018 return;
1019 }
1020
1021 // We now know that this is a vector of instructions of the same type from
1022 // the same block.
1023
1024 // Don't vectorize ephemeral values.
1025 for (unsigned i = 0, e = VL.size(); i != e; ++i) {
1026 if (EphValues.count(VL[i])) {
1027 DEBUG(dbgs() << "SLP: The instruction (" << *VL[i] <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: The instruction (" << *
VL[i] << ") is ephemeral.\n"; } } while (false)
1028 ") is ephemeral.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: The instruction (" << *
VL[i] << ") is ephemeral.\n"; } } while (false)
;
1029 newTreeEntry(VL, false);
1030 return;
1031 }
1032 }
1033
1034 // Check if this is a duplicate of another entry.
1035 if (ScalarToTreeEntry.count(VL[0])) {
1036 int Idx = ScalarToTreeEntry[VL[0]];
1037 TreeEntry *E = &VectorizableTree[Idx];
1038 for (unsigned i = 0, e = VL.size(); i != e; ++i) {
1039 DEBUG(dbgs() << "SLP: \tChecking bundle: " << *VL[i] << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: \tChecking bundle: " <<
*VL[i] << ".\n"; } } while (false)
;
1040 if (E->Scalars[i] != VL[i]) {
1041 DEBUG(dbgs() << "SLP: Gathering due to partial overlap.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to partial overlap.\n"
; } } while (false)
;
1042 newTreeEntry(VL, false);
1043 return;
1044 }
1045 }
1046 DEBUG(dbgs() << "SLP: Perfect diamond merge at " << *VL[0] << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Perfect diamond merge at " <<
*VL[0] << ".\n"; } } while (false)
;
1047 return;
1048 }
1049
1050 // Check that none of the instructions in the bundle are already in the tree.
1051 for (unsigned i = 0, e = VL.size(); i != e; ++i) {
1052 if (ScalarToTreeEntry.count(VL[i])) {
1053 DEBUG(dbgs() << "SLP: The instruction (" << *VL[i] <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: The instruction (" << *
VL[i] << ") is already in tree.\n"; } } while (false)
1054 ") is already in tree.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: The instruction (" << *
VL[i] << ") is already in tree.\n"; } } while (false)
;
1055 newTreeEntry(VL, false);
1056 return;
1057 }
1058 }
1059
1060 // If any of the scalars is marked as a value that needs to stay scalar then
1061 // we need to gather the scalars.
1062 for (unsigned i = 0, e = VL.size(); i != e; ++i) {
1063 if (MustGather.count(VL[i])) {
1064 DEBUG(dbgs() << "SLP: Gathering due to gathered scalar.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering due to gathered scalar.\n"
; } } while (false)
;
1065 newTreeEntry(VL, false);
1066 return;
1067 }
1068 }
1069
1070 // Check that all of the users of the scalars that we want to vectorize are
1071 // schedulable.
1072 Instruction *VL0 = cast<Instruction>(VL[0]);
1073 BasicBlock *BB = cast<Instruction>(VL0)->getParent();
1074
1075 if (!DT->isReachableFromEntry(BB)) {
1076 // Don't go into unreachable blocks. They may contain instructions with
1077 // dependency cycles which confuse the final scheduling.
1078 DEBUG(dbgs() << "SLP: bundle in unreachable block.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: bundle in unreachable block.\n"
; } } while (false)
;
1079 newTreeEntry(VL, false);
1080 return;
1081 }
1082
1083 // Check that every instructions appears once in this bundle.
1084 for (unsigned i = 0, e = VL.size(); i < e; ++i)
1085 for (unsigned j = i+1; j < e; ++j)
1086 if (VL[i] == VL[j]) {
1087 DEBUG(dbgs() << "SLP: Scalar used twice in bundle.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Scalar used twice in bundle.\n"
; } } while (false)
;
1088 newTreeEntry(VL, false);
1089 return;
1090 }
1091
1092 auto &BSRef = BlocksSchedules[BB];
1093 if (!BSRef) {
1094 BSRef = llvm::make_unique<BlockScheduling>(BB);
1095 }
1096 BlockScheduling &BS = *BSRef.get();
1097
1098 if (!BS.tryScheduleBundle(VL, this)) {
1099 DEBUG(dbgs() << "SLP: We are not able to schedule this bundle!\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: We are not able to schedule this bundle!\n"
; } } while (false)
;
1100 assert((!BS.getScheduleData(VL[0]) ||(((!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->
isPartOfBundle()) && "tryScheduleBundle should cancelScheduling on failure"
) ? static_cast<void> (0) : __assert_fail ("(!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->isPartOfBundle()) && \"tryScheduleBundle should cancelScheduling on failure\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1102, __PRETTY_FUNCTION__))
1101 !BS.getScheduleData(VL[0])->isPartOfBundle()) &&(((!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->
isPartOfBundle()) && "tryScheduleBundle should cancelScheduling on failure"
) ? static_cast<void> (0) : __assert_fail ("(!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->isPartOfBundle()) && \"tryScheduleBundle should cancelScheduling on failure\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1102, __PRETTY_FUNCTION__))
1102 "tryScheduleBundle should cancelScheduling on failure")(((!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->
isPartOfBundle()) && "tryScheduleBundle should cancelScheduling on failure"
) ? static_cast<void> (0) : __assert_fail ("(!BS.getScheduleData(VL[0]) || !BS.getScheduleData(VL[0])->isPartOfBundle()) && \"tryScheduleBundle should cancelScheduling on failure\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1102, __PRETTY_FUNCTION__))
;
1103 newTreeEntry(VL, false);
1104 return;
1105 }
1106 DEBUG(dbgs() << "SLP: We are able to schedule this bundle.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: We are able to schedule this bundle.\n"
; } } while (false)
;
1107
1108 switch (Opcode) {
1109 case Instruction::PHI: {
1110 PHINode *PH = dyn_cast<PHINode>(VL0);
1111
1112 // Check for terminator values (e.g. invoke).
1113 for (unsigned j = 0; j < VL.size(); ++j)
1114 for (unsigned i = 0, e = PH->getNumIncomingValues(); i < e; ++i) {
1115 TerminatorInst *Term = dyn_cast<TerminatorInst>(
1116 cast<PHINode>(VL[j])->getIncomingValueForBlock(PH->getIncomingBlock(i)));
1117 if (Term) {
1118 DEBUG(dbgs() << "SLP: Need to swizzle PHINodes (TerminatorInst use).\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Need to swizzle PHINodes (TerminatorInst use).\n"
; } } while (false)
;
1119 BS.cancelScheduling(VL);
1120 newTreeEntry(VL, false);
1121 return;
1122 }
1123 }
1124
1125 newTreeEntry(VL, true);
1126 DEBUG(dbgs() << "SLP: added a vector of PHINodes.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of PHINodes.\n"
; } } while (false)
;
1127
1128 for (unsigned i = 0, e = PH->getNumIncomingValues(); i < e; ++i) {
1129 ValueList Operands;
1130 // Prepare the operand vector.
1131 for (Value *j : VL)
1132 Operands.push_back(cast<PHINode>(j)->getIncomingValueForBlock(
1133 PH->getIncomingBlock(i)));
1134
1135 buildTree_rec(Operands, Depth + 1);
1136 }
1137 return;
1138 }
1139 case Instruction::ExtractValue:
1140 case Instruction::ExtractElement: {
1141 bool Reuse = canReuseExtract(VL, Opcode);
1142 if (Reuse) {
1143 DEBUG(dbgs() << "SLP: Reusing extract sequence.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Reusing extract sequence.\n"
; } } while (false)
;
1144 } else {
1145 BS.cancelScheduling(VL);
1146 }
1147 newTreeEntry(VL, Reuse);
1148 return;
1149 }
1150 case Instruction::Load: {
1151 // Check that a vectorized load would load the same memory as a scalar
1152 // load.
1153 // For example we don't want vectorize loads that are smaller than 8 bit.
1154 // Even though we have a packed struct {<i2, i2, i2, i2>} LLVM treats
1155 // loading/storing it as an i8 struct. If we vectorize loads/stores from
1156 // such a struct we read/write packed bits disagreeing with the
1157 // unvectorized version.
1158 Type *ScalarTy = VL[0]->getType();
1159
1160 if (DL->getTypeSizeInBits(ScalarTy) !=
1161 DL->getTypeAllocSizeInBits(ScalarTy)) {
1162 BS.cancelScheduling(VL);
1163 newTreeEntry(VL, false);
1164 DEBUG(dbgs() << "SLP: Gathering loads of non-packed type.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering loads of non-packed type.\n"
; } } while (false)
;
1165 return;
1166 }
1167
1168 // Make sure all loads in the bundle are simple - we can't vectorize
1169 // atomic or volatile loads.
1170 for (unsigned i = 0, e = VL.size() - 1; i < e; ++i) {
1171 LoadInst *L = cast<LoadInst>(VL[i]);
1172 if (!L->isSimple()) {
1173 BS.cancelScheduling(VL);
1174 newTreeEntry(VL, false);
1175 DEBUG(dbgs() << "SLP: Gathering non-simple loads.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering non-simple loads.\n"
; } } while (false)
;
1176 return;
1177 }
1178 }
1179
1180 // Check if the loads are consecutive, reversed, or neither.
1181 // TODO: What we really want is to sort the loads, but for now, check
1182 // the two likely directions.
1183 bool Consecutive = true;
1184 bool ReverseConsecutive = true;
1185 for (unsigned i = 0, e = VL.size() - 1; i < e; ++i) {
1186 if (!isConsecutiveAccess(VL[i], VL[i + 1], *DL, *SE)) {
1187 Consecutive = false;
1188 break;
1189 } else {
1190 ReverseConsecutive = false;
1191 }
1192 }
1193
1194 if (Consecutive) {
1195 ++NumLoadsWantToKeepOrder;
1196 newTreeEntry(VL, true);
1197 DEBUG(dbgs() << "SLP: added a vector of loads.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of loads.\n";
} } while (false)
;
1198 return;
1199 }
1200
1201 // If none of the load pairs were consecutive when checked in order,
1202 // check the reverse order.
1203 if (ReverseConsecutive)
1204 for (unsigned i = VL.size() - 1; i > 0; --i)
1205 if (!isConsecutiveAccess(VL[i], VL[i - 1], *DL, *SE)) {
1206 ReverseConsecutive = false;
1207 break;
1208 }
1209
1210 BS.cancelScheduling(VL);
1211 newTreeEntry(VL, false);
1212
1213 if (ReverseConsecutive) {
1214 ++NumLoadsWantToChangeOrder;
1215 DEBUG(dbgs() << "SLP: Gathering reversed loads.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering reversed loads.\n"
; } } while (false)
;
1216 } else {
1217 DEBUG(dbgs() << "SLP: Gathering non-consecutive loads.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering non-consecutive loads.\n"
; } } while (false)
;
1218 }
1219 return;
1220 }
1221 case Instruction::ZExt:
1222 case Instruction::SExt:
1223 case Instruction::FPToUI:
1224 case Instruction::FPToSI:
1225 case Instruction::FPExt:
1226 case Instruction::PtrToInt:
1227 case Instruction::IntToPtr:
1228 case Instruction::SIToFP:
1229 case Instruction::UIToFP:
1230 case Instruction::Trunc:
1231 case Instruction::FPTrunc:
1232 case Instruction::BitCast: {
1233 Type *SrcTy = VL0->getOperand(0)->getType();
1234 for (unsigned i = 0; i < VL.size(); ++i) {
1235 Type *Ty = cast<Instruction>(VL[i])->getOperand(0)->getType();
1236 if (Ty != SrcTy || !isValidElementType(Ty)) {
1237 BS.cancelScheduling(VL);
1238 newTreeEntry(VL, false);
1239 DEBUG(dbgs() << "SLP: Gathering casts with different src types.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering casts with different src types.\n"
; } } while (false)
;
1240 return;
1241 }
1242 }
1243 newTreeEntry(VL, true);
1244 DEBUG(dbgs() << "SLP: added a vector of casts.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of casts.\n";
} } while (false)
;
1245
1246 for (unsigned i = 0, e = VL0->getNumOperands(); i < e; ++i) {
1247 ValueList Operands;
1248 // Prepare the operand vector.
1249 for (Value *j : VL)
1250 Operands.push_back(cast<Instruction>(j)->getOperand(i));
1251
1252 buildTree_rec(Operands, Depth+1);
1253 }
1254 return;
1255 }
1256 case Instruction::ICmp:
1257 case Instruction::FCmp: {
1258 // Check that all of the compares have the same predicate.
1259 CmpInst::Predicate P0 = cast<CmpInst>(VL0)->getPredicate();
1260 Type *ComparedTy = cast<Instruction>(VL[0])->getOperand(0)->getType();
1261 for (unsigned i = 1, e = VL.size(); i < e; ++i) {
1262 CmpInst *Cmp = cast<CmpInst>(VL[i]);
1263 if (Cmp->getPredicate() != P0 ||
1264 Cmp->getOperand(0)->getType() != ComparedTy) {
1265 BS.cancelScheduling(VL);
1266 newTreeEntry(VL, false);
1267 DEBUG(dbgs() << "SLP: Gathering cmp with different predicate.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering cmp with different predicate.\n"
; } } while (false)
;
1268 return;
1269 }
1270 }
1271
1272 newTreeEntry(VL, true);
1273 DEBUG(dbgs() << "SLP: added a vector of compares.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of compares.\n"
; } } while (false)
;
1274
1275 for (unsigned i = 0, e = VL0->getNumOperands(); i < e; ++i) {
1276 ValueList Operands;
1277 // Prepare the operand vector.
1278 for (Value *j : VL)
1279 Operands.push_back(cast<Instruction>(j)->getOperand(i));
1280
1281 buildTree_rec(Operands, Depth+1);
1282 }
1283 return;
1284 }
1285 case Instruction::Select:
1286 case Instruction::Add:
1287 case Instruction::FAdd:
1288 case Instruction::Sub:
1289 case Instruction::FSub:
1290 case Instruction::Mul:
1291 case Instruction::FMul:
1292 case Instruction::UDiv:
1293 case Instruction::SDiv:
1294 case Instruction::FDiv:
1295 case Instruction::URem:
1296 case Instruction::SRem:
1297 case Instruction::FRem:
1298 case Instruction::Shl:
1299 case Instruction::LShr:
1300 case Instruction::AShr:
1301 case Instruction::And:
1302 case Instruction::Or:
1303 case Instruction::Xor: {
1304 newTreeEntry(VL, true);
1305 DEBUG(dbgs() << "SLP: added a vector of bin op.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of bin op.\n"
; } } while (false)
;
1306
1307 // Sort operands of the instructions so that each side is more likely to
1308 // have the same opcode.
1309 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) {
1310 ValueList Left, Right;
1311 reorderInputsAccordingToOpcode(VL, Left, Right);
1312 buildTree_rec(Left, Depth + 1);
1313 buildTree_rec(Right, Depth + 1);
1314 return;
1315 }
1316
1317 for (unsigned i = 0, e = VL0->getNumOperands(); i < e; ++i) {
1318 ValueList Operands;
1319 // Prepare the operand vector.
1320 for (Value *j : VL)
1321 Operands.push_back(cast<Instruction>(j)->getOperand(i));
1322
1323 buildTree_rec(Operands, Depth+1);
1324 }
1325 return;
1326 }
1327 case Instruction::GetElementPtr: {
1328 // We don't combine GEPs with complicated (nested) indexing.
1329 for (unsigned j = 0; j < VL.size(); ++j) {
1330 if (cast<Instruction>(VL[j])->getNumOperands() != 2) {
1331 DEBUG(dbgs() << "SLP: not-vectorizable GEP (nested indexes).\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: not-vectorizable GEP (nested indexes).\n"
; } } while (false)
;
1332 BS.cancelScheduling(VL);
1333 newTreeEntry(VL, false);
1334 return;
1335 }
1336 }
1337
1338 // We can't combine several GEPs into one vector if they operate on
1339 // different types.
1340 Type *Ty0 = cast<Instruction>(VL0)->getOperand(0)->getType();
1341 for (unsigned j = 0; j < VL.size(); ++j) {
1342 Type *CurTy = cast<Instruction>(VL[j])->getOperand(0)->getType();
1343 if (Ty0 != CurTy) {
1344 DEBUG(dbgs() << "SLP: not-vectorizable GEP (different types).\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: not-vectorizable GEP (different types).\n"
; } } while (false)
;
1345 BS.cancelScheduling(VL);
1346 newTreeEntry(VL, false);
1347 return;
1348 }
1349 }
1350
1351 // We don't combine GEPs with non-constant indexes.
1352 for (unsigned j = 0; j < VL.size(); ++j) {
1353 auto Op = cast<Instruction>(VL[j])->getOperand(1);
1354 if (!isa<ConstantInt>(Op)) {
1355 DEBUG(do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: not-vectorizable GEP (non-constant indexes).\n"
; } } while (false)
1356 dbgs() << "SLP: not-vectorizable GEP (non-constant indexes).\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: not-vectorizable GEP (non-constant indexes).\n"
; } } while (false)
;
1357 BS.cancelScheduling(VL);
1358 newTreeEntry(VL, false);
1359 return;
1360 }
1361 }
1362
1363 newTreeEntry(VL, true);
1364 DEBUG(dbgs() << "SLP: added a vector of GEPs.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of GEPs.\n"; }
} while (false)
;
1365 for (unsigned i = 0, e = 2; i < e; ++i) {
1366 ValueList Operands;
1367 // Prepare the operand vector.
1368 for (Value *j : VL)
1369 Operands.push_back(cast<Instruction>(j)->getOperand(i));
1370
1371 buildTree_rec(Operands, Depth + 1);
1372 }
1373 return;
1374 }
1375 case Instruction::Store: {
1376 // Check if the stores are consecutive or of we need to swizzle them.
1377 for (unsigned i = 0, e = VL.size() - 1; i < e; ++i)
1378 if (!isConsecutiveAccess(VL[i], VL[i + 1], *DL, *SE)) {
1379 BS.cancelScheduling(VL);
1380 newTreeEntry(VL, false);
1381 DEBUG(dbgs() << "SLP: Non-consecutive store.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Non-consecutive store.\n"; }
} while (false)
;
1382 return;
1383 }
1384
1385 newTreeEntry(VL, true);
1386 DEBUG(dbgs() << "SLP: added a vector of stores.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a vector of stores.\n"
; } } while (false)
;
1387
1388 ValueList Operands;
1389 for (Value *j : VL)
1390 Operands.push_back(cast<Instruction>(j)->getOperand(0));
1391
1392 buildTree_rec(Operands, Depth + 1);
1393 return;
1394 }
1395 case Instruction::Call: {
1396 // Check if the calls are all to the same vectorizable intrinsic.
1397 CallInst *CI = cast<CallInst>(VL[0]);
1398 // Check if this is an Intrinsic call or something that can be
1399 // represented by an intrinsic call
1400 Intrinsic::ID ID = getVectorIntrinsicIDForCall(CI, TLI);
1401 if (!isTriviallyVectorizable(ID)) {
1402 BS.cancelScheduling(VL);
1403 newTreeEntry(VL, false);
1404 DEBUG(dbgs() << "SLP: Non-vectorizable call.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Non-vectorizable call.\n"; }
} while (false)
;
1405 return;
1406 }
1407 Function *Int = CI->getCalledFunction();
1408 Value *A1I = nullptr;
1409 if (hasVectorInstrinsicScalarOpd(ID, 1))
1410 A1I = CI->getArgOperand(1);
1411 for (unsigned i = 1, e = VL.size(); i != e; ++i) {
1412 CallInst *CI2 = dyn_cast<CallInst>(VL[i]);
1413 if (!CI2 || CI2->getCalledFunction() != Int ||
1414 getVectorIntrinsicIDForCall(CI2, TLI) != ID ||
1415 !CI->hasIdenticalOperandBundleSchema(*CI2)) {
1416 BS.cancelScheduling(VL);
1417 newTreeEntry(VL, false);
1418 DEBUG(dbgs() << "SLP: mismatched calls:" << *CI << "!=" << *VL[i]do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched calls:" << *
CI << "!=" << *VL[i] << "\n"; } } while (false
)
1419 << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched calls:" << *
CI << "!=" << *VL[i] << "\n"; } } while (false
)
;
1420 return;
1421 }
1422 // ctlz,cttz and powi are special intrinsics whose second argument
1423 // should be same in order for them to be vectorized.
1424 if (hasVectorInstrinsicScalarOpd(ID, 1)) {
1425 Value *A1J = CI2->getArgOperand(1);
1426 if (A1I != A1J) {
1427 BS.cancelScheduling(VL);
1428 newTreeEntry(VL, false);
1429 DEBUG(dbgs() << "SLP: mismatched arguments in call:" << *CIdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched arguments in call:"
<< *CI << " argument "<< A1I<<"!=" <<
A1J << "\n"; } } while (false)
1430 << " argument "<< A1I<<"!=" << A1Jdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched arguments in call:"
<< *CI << " argument "<< A1I<<"!=" <<
A1J << "\n"; } } while (false)
1431 << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched arguments in call:"
<< *CI << " argument "<< A1I<<"!=" <<
A1J << "\n"; } } while (false)
;
1432 return;
1433 }
1434 }
1435 // Verify that the bundle operands are identical between the two calls.
1436 if (CI->hasOperandBundles() &&
1437 !std::equal(CI->op_begin() + CI->getBundleOperandsStartIndex(),
1438 CI->op_begin() + CI->getBundleOperandsEndIndex(),
1439 CI2->op_begin() + CI2->getBundleOperandsStartIndex())) {
1440 BS.cancelScheduling(VL);
1441 newTreeEntry(VL, false);
1442 DEBUG(dbgs() << "SLP: mismatched bundle operands in calls:" << *CI << "!="do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched bundle operands in calls:"
<< *CI << "!=" << *VL[i] << '\n'; } }
while (false)
1443 << *VL[i] << '\n')do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: mismatched bundle operands in calls:"
<< *CI << "!=" << *VL[i] << '\n'; } }
while (false)
;
1444 return;
1445 }
1446 }
1447
1448 newTreeEntry(VL, true);
1449 for (unsigned i = 0, e = CI->getNumArgOperands(); i != e; ++i) {
1450 ValueList Operands;
1451 // Prepare the operand vector.
1452 for (Value *j : VL) {
1453 CallInst *CI2 = dyn_cast<CallInst>(j);
1454 Operands.push_back(CI2->getArgOperand(i));
1455 }
1456 buildTree_rec(Operands, Depth + 1);
1457 }
1458 return;
1459 }
1460 case Instruction::ShuffleVector: {
1461 // If this is not an alternate sequence of opcode like add-sub
1462 // then do not vectorize this instruction.
1463 if (!isAltShuffle) {
1464 BS.cancelScheduling(VL);
1465 newTreeEntry(VL, false);
1466 DEBUG(dbgs() << "SLP: ShuffleVector are not vectorized.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: ShuffleVector are not vectorized.\n"
; } } while (false)
;
1467 return;
1468 }
1469 newTreeEntry(VL, true);
1470 DEBUG(dbgs() << "SLP: added a ShuffleVector op.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: added a ShuffleVector op.\n"
; } } while (false)
;
1471
1472 // Reorder operands if reordering would enable vectorization.
1473 if (isa<BinaryOperator>(VL0)) {
1474 ValueList Left, Right;
1475 reorderAltShuffleOperands(VL, Left, Right);
1476 buildTree_rec(Left, Depth + 1);
1477 buildTree_rec(Right, Depth + 1);
1478 return;
1479 }
1480
1481 for (unsigned i = 0, e = VL0->getNumOperands(); i < e; ++i) {
1482 ValueList Operands;
1483 // Prepare the operand vector.
1484 for (Value *j : VL)
1485 Operands.push_back(cast<Instruction>(j)->getOperand(i));
1486
1487 buildTree_rec(Operands, Depth + 1);
1488 }
1489 return;
1490 }
1491 default:
1492 BS.cancelScheduling(VL);
1493 newTreeEntry(VL, false);
1494 DEBUG(dbgs() << "SLP: Gathering unknown instruction.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Gathering unknown instruction.\n"
; } } while (false)
;
1495 return;
1496 }
1497}
1498
1499unsigned BoUpSLP::canMapToVector(Type *T, const DataLayout &DL) const {
1500 unsigned N;
1501 Type *EltTy;
1502 auto *ST = dyn_cast<StructType>(T);
1503 if (ST) {
1504 N = ST->getNumElements();
1505 EltTy = *ST->element_begin();
1506 } else {
1507 N = cast<ArrayType>(T)->getNumElements();
1508 EltTy = cast<ArrayType>(T)->getElementType();
1509 }
1510 if (!isValidElementType(EltTy))
1511 return 0;
1512 uint64_t VTSize = DL.getTypeStoreSizeInBits(VectorType::get(EltTy, N));
1513 if (VTSize < MinVecRegSize || VTSize > MaxVecRegSize || VTSize != DL.getTypeStoreSizeInBits(T))
1514 return 0;
1515 if (ST) {
1516 // Check that struct is homogeneous.
1517 for (const auto *Ty : ST->elements())
1518 if (Ty != EltTy)
1519 return 0;
1520 }
1521 return N;
1522}
1523
1524bool BoUpSLP::canReuseExtract(ArrayRef<Value *> VL, unsigned Opcode) const {
1525 assert(Opcode == Instruction::ExtractElement ||((Opcode == Instruction::ExtractElement || Opcode == Instruction
::ExtractValue) ? static_cast<void> (0) : __assert_fail
("Opcode == Instruction::ExtractElement || Opcode == Instruction::ExtractValue"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1526, __PRETTY_FUNCTION__))
1526 Opcode == Instruction::ExtractValue)((Opcode == Instruction::ExtractElement || Opcode == Instruction
::ExtractValue) ? static_cast<void> (0) : __assert_fail
("Opcode == Instruction::ExtractElement || Opcode == Instruction::ExtractValue"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1526, __PRETTY_FUNCTION__))
;
1527 assert(Opcode == getSameOpcode(VL) && "Invalid opcode")((Opcode == getSameOpcode(VL) && "Invalid opcode") ? static_cast
<void> (0) : __assert_fail ("Opcode == getSameOpcode(VL) && \"Invalid opcode\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1527, __PRETTY_FUNCTION__))
;
1528 // Check if all of the extracts come from the same vector and from the
1529 // correct offset.
1530 Value *VL0 = VL[0];
1531 Instruction *E0 = cast<Instruction>(VL0);
1532 Value *Vec = E0->getOperand(0);
1533
1534 // We have to extract from a vector/aggregate with the same number of elements.
1535 unsigned NElts;
1536 if (Opcode == Instruction::ExtractValue) {
1537 const DataLayout &DL = E0->getModule()->getDataLayout();
1538 NElts = canMapToVector(Vec->getType(), DL);
1539 if (!NElts)
1540 return false;
1541 // Check if load can be rewritten as load of vector.
1542 LoadInst *LI = dyn_cast<LoadInst>(Vec);
1543 if (!LI || !LI->isSimple() || !LI->hasNUses(VL.size()))
1544 return false;
1545 } else {
1546 NElts = Vec->getType()->getVectorNumElements();
1547 }
1548
1549 if (NElts != VL.size())
1550 return false;
1551
1552 // Check that all of the indices extract from the correct offset.
1553 if (!matchExtractIndex(E0, 0, Opcode))
1554 return false;
1555
1556 for (unsigned i = 1, e = VL.size(); i < e; ++i) {
1557 Instruction *E = cast<Instruction>(VL[i]);
1558 if (!matchExtractIndex(E, i, Opcode))
1559 return false;
1560 if (E->getOperand(0) != Vec)
1561 return false;
1562 }
1563
1564 return true;
1565}
1566
1567int BoUpSLP::getEntryCost(TreeEntry *E) {
1568 ArrayRef<Value*> VL = E->Scalars;
1569
1570 Type *ScalarTy = VL[0]->getType();
1571 if (StoreInst *SI = dyn_cast<StoreInst>(VL[0]))
1572 ScalarTy = SI->getValueOperand()->getType();
1573 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
1574
1575 // If we have computed a smaller type for the expression, update VecTy so
1576 // that the costs will be accurate.
1577 if (MinBWs.count(VL[0]))
1578 VecTy = VectorType::get(
1579 IntegerType::get(F->getContext(), MinBWs[VL[0]].first), VL.size());
1580
1581 if (E->NeedToGather) {
1582 if (allConstant(VL))
1583 return 0;
1584 if (isSplat(VL)) {
1585 return TTI->getShuffleCost(TargetTransformInfo::SK_Broadcast, VecTy, 0);
1586 }
1587 return getGatherCost(E->Scalars);
1588 }
1589 unsigned Opcode = getSameOpcode(VL);
1590 assert(Opcode && allSameType(VL) && allSameBlock(VL) && "Invalid VL")((Opcode && allSameType(VL) && allSameBlock(VL
) && "Invalid VL") ? static_cast<void> (0) : __assert_fail
("Opcode && allSameType(VL) && allSameBlock(VL) && \"Invalid VL\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1590, __PRETTY_FUNCTION__))
;
1591 Instruction *VL0 = cast<Instruction>(VL[0]);
1592 switch (Opcode) {
1593 case Instruction::PHI: {
1594 return 0;
1595 }
1596 case Instruction::ExtractValue:
1597 case Instruction::ExtractElement: {
1598 if (canReuseExtract(VL, Opcode)) {
1599 int DeadCost = 0;
1600 for (unsigned i = 0, e = VL.size(); i < e; ++i) {
1601 Instruction *E = cast<Instruction>(VL[i]);
1602 if (E->hasOneUse())
1603 // Take credit for instruction that will become dead.
1604 DeadCost +=
1605 TTI->getVectorInstrCost(Instruction::ExtractElement, VecTy, i);
1606 }
1607 return -DeadCost;
1608 }
1609 return getGatherCost(VecTy);
1610 }
1611 case Instruction::ZExt:
1612 case Instruction::SExt:
1613 case Instruction::FPToUI:
1614 case Instruction::FPToSI:
1615 case Instruction::FPExt:
1616 case Instruction::PtrToInt:
1617 case Instruction::IntToPtr:
1618 case Instruction::SIToFP:
1619 case Instruction::UIToFP:
1620 case Instruction::Trunc:
1621 case Instruction::FPTrunc:
1622 case Instruction::BitCast: {
1623 Type *SrcTy = VL0->getOperand(0)->getType();
1624
1625 // Calculate the cost of this instruction.
1626 int ScalarCost = VL.size() * TTI->getCastInstrCost(VL0->getOpcode(),
1627 VL0->getType(), SrcTy);
1628
1629 VectorType *SrcVecTy = VectorType::get(SrcTy, VL.size());
1630 int VecCost = TTI->getCastInstrCost(VL0->getOpcode(), VecTy, SrcVecTy);
1631 return VecCost - ScalarCost;
1632 }
1633 case Instruction::FCmp:
1634 case Instruction::ICmp:
1635 case Instruction::Select: {
1636 // Calculate the cost of this instruction.
1637 VectorType *MaskTy = VectorType::get(Builder.getInt1Ty(), VL.size());
1638 int ScalarCost = VecTy->getNumElements() *
1639 TTI->getCmpSelInstrCost(Opcode, ScalarTy, Builder.getInt1Ty());
1640 int VecCost = TTI->getCmpSelInstrCost(Opcode, VecTy, MaskTy);
1641 return VecCost - ScalarCost;
1642 }
1643 case Instruction::Add:
1644 case Instruction::FAdd:
1645 case Instruction::Sub:
1646 case Instruction::FSub:
1647 case Instruction::Mul:
1648 case Instruction::FMul:
1649 case Instruction::UDiv:
1650 case Instruction::SDiv:
1651 case Instruction::FDiv:
1652 case Instruction::URem:
1653 case Instruction::SRem:
1654 case Instruction::FRem:
1655 case Instruction::Shl:
1656 case Instruction::LShr:
1657 case Instruction::AShr:
1658 case Instruction::And:
1659 case Instruction::Or:
1660 case Instruction::Xor: {
1661 // Certain instructions can be cheaper to vectorize if they have a
1662 // constant second vector operand.
1663 TargetTransformInfo::OperandValueKind Op1VK =
1664 TargetTransformInfo::OK_AnyValue;
1665 TargetTransformInfo::OperandValueKind Op2VK =
1666 TargetTransformInfo::OK_UniformConstantValue;
1667 TargetTransformInfo::OperandValueProperties Op1VP =
1668 TargetTransformInfo::OP_None;
1669 TargetTransformInfo::OperandValueProperties Op2VP =
1670 TargetTransformInfo::OP_None;
1671
1672 // If all operands are exactly the same ConstantInt then set the
1673 // operand kind to OK_UniformConstantValue.
1674 // If instead not all operands are constants, then set the operand kind
1675 // to OK_AnyValue. If all operands are constants but not the same,
1676 // then set the operand kind to OK_NonUniformConstantValue.
1677 ConstantInt *CInt = nullptr;
1678 for (unsigned i = 0; i < VL.size(); ++i) {
1679 const Instruction *I = cast<Instruction>(VL[i]);
1680 if (!isa<ConstantInt>(I->getOperand(1))) {
1681 Op2VK = TargetTransformInfo::OK_AnyValue;
1682 break;
1683 }
1684 if (i == 0) {
1685 CInt = cast<ConstantInt>(I->getOperand(1));
1686 continue;
1687 }
1688 if (Op2VK == TargetTransformInfo::OK_UniformConstantValue &&
1689 CInt != cast<ConstantInt>(I->getOperand(1)))
1690 Op2VK = TargetTransformInfo::OK_NonUniformConstantValue;
1691 }
1692 // FIXME: Currently cost of model modification for division by power of
1693 // 2 is handled for X86 and AArch64. Add support for other targets.
1694 if (Op2VK == TargetTransformInfo::OK_UniformConstantValue && CInt &&
1695 CInt->getValue().isPowerOf2())
1696 Op2VP = TargetTransformInfo::OP_PowerOf2;
1697
1698 int ScalarCost = VecTy->getNumElements() *
1699 TTI->getArithmeticInstrCost(Opcode, ScalarTy, Op1VK,
1700 Op2VK, Op1VP, Op2VP);
1701 int VecCost = TTI->getArithmeticInstrCost(Opcode, VecTy, Op1VK, Op2VK,
1702 Op1VP, Op2VP);
1703 return VecCost - ScalarCost;
1704 }
1705 case Instruction::GetElementPtr: {
1706 TargetTransformInfo::OperandValueKind Op1VK =
1707 TargetTransformInfo::OK_AnyValue;
1708 TargetTransformInfo::OperandValueKind Op2VK =
1709 TargetTransformInfo::OK_UniformConstantValue;
1710
1711 int ScalarCost =
1712 VecTy->getNumElements() *
1713 TTI->getArithmeticInstrCost(Instruction::Add, ScalarTy, Op1VK, Op2VK);
1714 int VecCost =
1715 TTI->getArithmeticInstrCost(Instruction::Add, VecTy, Op1VK, Op2VK);
1716
1717 return VecCost - ScalarCost;
1718 }
1719 case Instruction::Load: {
1720 // Cost of wide load - cost of scalar loads.
1721 unsigned alignment = dyn_cast<LoadInst>(VL0)->getAlignment();
1722 int ScalarLdCost = VecTy->getNumElements() *
1723 TTI->getMemoryOpCost(Instruction::Load, ScalarTy, alignment, 0);
1724 int VecLdCost = TTI->getMemoryOpCost(Instruction::Load,
1725 VecTy, alignment, 0);
1726 return VecLdCost - ScalarLdCost;
1727 }
1728 case Instruction::Store: {
1729 // We know that we can merge the stores. Calculate the cost.
1730 unsigned alignment = dyn_cast<StoreInst>(VL0)->getAlignment();
1731 int ScalarStCost = VecTy->getNumElements() *
1732 TTI->getMemoryOpCost(Instruction::Store, ScalarTy, alignment, 0);
1733 int VecStCost = TTI->getMemoryOpCost(Instruction::Store,
1734 VecTy, alignment, 0);
1735 return VecStCost - ScalarStCost;
1736 }
1737 case Instruction::Call: {
1738 CallInst *CI = cast<CallInst>(VL0);
1739 Intrinsic::ID ID = getVectorIntrinsicIDForCall(CI, TLI);
1740
1741 // Calculate the cost of the scalar and vector calls.
1742 SmallVector<Type*, 4> ScalarTys, VecTys;
1743 for (unsigned op = 0, opc = CI->getNumArgOperands(); op!= opc; ++op) {
1744 ScalarTys.push_back(CI->getArgOperand(op)->getType());
1745 VecTys.push_back(VectorType::get(CI->getArgOperand(op)->getType(),
1746 VecTy->getNumElements()));
1747 }
1748
1749 FastMathFlags FMF;
1750 if (auto *FPMO = dyn_cast<FPMathOperator>(CI))
1751 FMF = FPMO->getFastMathFlags();
1752
1753 int ScalarCallCost = VecTy->getNumElements() *
1754 TTI->getIntrinsicInstrCost(ID, ScalarTy, ScalarTys, FMF);
1755
1756 int VecCallCost = TTI->getIntrinsicInstrCost(ID, VecTy, VecTys, FMF);
1757
1758 DEBUG(dbgs() << "SLP: Call cost "<< VecCallCost - ScalarCallCostdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Call cost "<< VecCallCost
- ScalarCallCost << " (" << VecCallCost <<
"-" << ScalarCallCost << ")" << " for " <<
*CI << "\n"; } } while (false)
1759 << " (" << VecCallCost << "-" << ScalarCallCost << ")"do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Call cost "<< VecCallCost
- ScalarCallCost << " (" << VecCallCost <<
"-" << ScalarCallCost << ")" << " for " <<
*CI << "\n"; } } while (false)
1760 << " for " << *CI << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Call cost "<< VecCallCost
- ScalarCallCost << " (" << VecCallCost <<
"-" << ScalarCallCost << ")" << " for " <<
*CI << "\n"; } } while (false)
;
1761
1762 return VecCallCost - ScalarCallCost;
1763 }
1764 case Instruction::ShuffleVector: {
1765 TargetTransformInfo::OperandValueKind Op1VK =
1766 TargetTransformInfo::OK_AnyValue;
1767 TargetTransformInfo::OperandValueKind Op2VK =
1768 TargetTransformInfo::OK_AnyValue;
1769 int ScalarCost = 0;
1770 int VecCost = 0;
1771 for (Value *i : VL) {
1772 Instruction *I = cast<Instruction>(i);
1773 if (!I)
1774 break;
1775 ScalarCost +=
1776 TTI->getArithmeticInstrCost(I->getOpcode(), ScalarTy, Op1VK, Op2VK);
1777 }
1778 // VecCost is equal to sum of the cost of creating 2 vectors
1779 // and the cost of creating shuffle.
1780 Instruction *I0 = cast<Instruction>(VL[0]);
1781 VecCost =
1782 TTI->getArithmeticInstrCost(I0->getOpcode(), VecTy, Op1VK, Op2VK);
1783 Instruction *I1 = cast<Instruction>(VL[1]);
1784 VecCost +=
1785 TTI->getArithmeticInstrCost(I1->getOpcode(), VecTy, Op1VK, Op2VK);
1786 VecCost +=
1787 TTI->getShuffleCost(TargetTransformInfo::SK_Alternate, VecTy, 0);
1788 return VecCost - ScalarCost;
1789 }
1790 default:
1791 llvm_unreachable("Unknown instruction")::llvm::llvm_unreachable_internal("Unknown instruction", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1791)
;
1792 }
1793}
1794
1795bool BoUpSLP::isFullyVectorizableTinyTree() {
1796 DEBUG(dbgs() << "SLP: Check whether the tree with height " <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Check whether the tree with height "
<< VectorizableTree.size() << " is fully vectorizable .\n"
; } } while (false)
1797 VectorizableTree.size() << " is fully vectorizable .\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Check whether the tree with height "
<< VectorizableTree.size() << " is fully vectorizable .\n"
; } } while (false)
;
1798
1799 // We only handle trees of heights 1 and 2.
1800 if (VectorizableTree.size() == 1 && !VectorizableTree[0].NeedToGather)
1801 return true;
1802
1803 if (VectorizableTree.size() != 2)
1804 return false;
1805
1806 // Handle splat and all-constants stores.
1807 if (!VectorizableTree[0].NeedToGather &&
1808 (allConstant(VectorizableTree[1].Scalars) ||
1809 isSplat(VectorizableTree[1].Scalars)))
1810 return true;
1811
1812 // Gathering cost would be too much for tiny trees.
1813 if (VectorizableTree[0].NeedToGather || VectorizableTree[1].NeedToGather)
1814 return false;
1815
1816 return true;
1817}
1818
1819bool BoUpSLP::isTreeTinyAndNotFullyVectorizable() {
1820
1821 // We can vectorize the tree if its size is greater than or equal to the
1822 // minimum size specified by the MinTreeSize command line option.
1823 if (VectorizableTree.size() >= MinTreeSize)
1824 return false;
1825
1826 // If we have a tiny tree (a tree whose size is less than MinTreeSize), we
1827 // can vectorize it if we can prove it fully vectorizable.
1828 if (isFullyVectorizableTinyTree())
1829 return false;
1830
1831 assert(VectorizableTree.empty()((VectorizableTree.empty() ? ExternalUses.empty() : true &&
"We shouldn't have any external users") ? static_cast<void
> (0) : __assert_fail ("VectorizableTree.empty() ? ExternalUses.empty() : true && \"We shouldn't have any external users\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1833, __PRETTY_FUNCTION__))
1832 ? ExternalUses.empty()((VectorizableTree.empty() ? ExternalUses.empty() : true &&
"We shouldn't have any external users") ? static_cast<void
> (0) : __assert_fail ("VectorizableTree.empty() ? ExternalUses.empty() : true && \"We shouldn't have any external users\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1833, __PRETTY_FUNCTION__))
1833 : true && "We shouldn't have any external users")((VectorizableTree.empty() ? ExternalUses.empty() : true &&
"We shouldn't have any external users") ? static_cast<void
> (0) : __assert_fail ("VectorizableTree.empty() ? ExternalUses.empty() : true && \"We shouldn't have any external users\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 1833, __PRETTY_FUNCTION__))
;
1834
1835 // Otherwise, we can't vectorize the tree. It is both tiny and not fully
1836 // vectorizable.
1837 return true;
1838}
1839
1840int BoUpSLP::getSpillCost() {
1841 // Walk from the bottom of the tree to the top, tracking which values are
1842 // live. When we see a call instruction that is not part of our tree,
1843 // query TTI to see if there is a cost to keeping values live over it
1844 // (for example, if spills and fills are required).
1845 unsigned BundleWidth = VectorizableTree.front().Scalars.size();
1846 int Cost = 0;
1847
1848 SmallPtrSet<Instruction*, 4> LiveValues;
1849 Instruction *PrevInst = nullptr;
1850
1851 for (const auto &N : VectorizableTree) {
1852 Instruction *Inst = dyn_cast<Instruction>(N.Scalars[0]);
1853 if (!Inst)
1854 continue;
1855
1856 if (!PrevInst) {
1857 PrevInst = Inst;
1858 continue;
1859 }
1860
1861 // Update LiveValues.
1862 LiveValues.erase(PrevInst);
1863 for (auto &J : PrevInst->operands()) {
1864 if (isa<Instruction>(&*J) && ScalarToTreeEntry.count(&*J))
1865 LiveValues.insert(cast<Instruction>(&*J));
1866 }
1867
1868 DEBUG(do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1869 dbgs() << "SLP: #LV: " << LiveValues.size();do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1870 for (auto *X : LiveValues)do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1871 dbgs() << " " << X->getName();do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1872 dbgs() << ", Looking at ";do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1873 Inst->dump();do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
1874 )do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: #LV: " << LiveValues.size
(); for (auto *X : LiveValues) dbgs() << " " << X
->getName(); dbgs() << ", Looking at "; Inst->dump
();; } } while (false)
;
1875
1876 // Now find the sequence of instructions between PrevInst and Inst.
1877 BasicBlock::reverse_iterator InstIt = ++Inst->getIterator().getReverse(),
1878 PrevInstIt =
1879 PrevInst->getIterator().getReverse();
1880 while (InstIt != PrevInstIt) {
1881 if (PrevInstIt == PrevInst->getParent()->rend()) {
1882 PrevInstIt = Inst->getParent()->rbegin();
1883 continue;
1884 }
1885
1886 if (isa<CallInst>(&*PrevInstIt) && &*PrevInstIt != PrevInst) {
1887 SmallVector<Type*, 4> V;
1888 for (auto *II : LiveValues)
1889 V.push_back(VectorType::get(II->getType(), BundleWidth));
1890 Cost += TTI->getCostOfKeepingLiveOverCall(V);
1891 }
1892
1893 ++PrevInstIt;
1894 }
1895
1896 PrevInst = Inst;
1897 }
1898
1899 return Cost;
1900}
1901
1902int BoUpSLP::getTreeCost() {
1903 int Cost = 0;
1904 DEBUG(dbgs() << "SLP: Calculating cost for tree of size " <<do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Calculating cost for tree of size "
<< VectorizableTree.size() << ".\n"; } } while (
false)
1905 VectorizableTree.size() << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Calculating cost for tree of size "
<< VectorizableTree.size() << ".\n"; } } while (
false)
;
1906
1907 unsigned BundleWidth = VectorizableTree[0].Scalars.size();
1908
1909 for (TreeEntry &TE : VectorizableTree) {
1910 int C = getEntryCost(&TE);
1911 DEBUG(dbgs() << "SLP: Adding cost " << C << " for bundle that starts with "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << C <<
" for bundle that starts with " << *TE.Scalars[0] <<
".\n"; } } while (false)
1912 << *TE.Scalars[0] << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << C <<
" for bundle that starts with " << *TE.Scalars[0] <<
".\n"; } } while (false)
;
1913 Cost += C;
1914 }
1915
1916 SmallSet<Value *, 16> ExtractCostCalculated;
1917 int ExtractCost = 0;
1918 for (ExternalUser &EU : ExternalUses) {
1919 // We only add extract cost once for the same scalar.
1920 if (!ExtractCostCalculated.insert(EU.Scalar).second)
1921 continue;
1922
1923 // Uses by ephemeral values are free (because the ephemeral value will be
1924 // removed prior to code generation, and so the extraction will be
1925 // removed as well).
1926 if (EphValues.count(EU.User))
1927 continue;
1928
1929 // If we plan to rewrite the tree in a smaller type, we will need to sign
1930 // extend the extracted value back to the original type. Here, we account
1931 // for the extract and the added cost of the sign extend if needed.
1932 auto *VecTy = VectorType::get(EU.Scalar->getType(), BundleWidth);
1933 auto *ScalarRoot = VectorizableTree[0].Scalars[0];
1934 if (MinBWs.count(ScalarRoot)) {
1935 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first);
1936 auto Extend =
1937 MinBWs[ScalarRoot].second ? Instruction::SExt : Instruction::ZExt;
1938 VecTy = VectorType::get(MinTy, BundleWidth);
1939 ExtractCost += TTI->getExtractWithExtendCost(Extend, EU.Scalar->getType(),
1940 VecTy, EU.Lane);
1941 } else {
1942 ExtractCost +=
1943 TTI->getVectorInstrCost(Instruction::ExtractElement, VecTy, EU.Lane);
1944 }
1945 }
1946
1947 int SpillCost = getSpillCost();
1948 Cost += SpillCost + ExtractCost;
1949
1950 DEBUG(dbgs() << "SLP: Spill Cost = " << SpillCost << ".\n"do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Spill Cost = " << SpillCost
<< ".\n" << "SLP: Extract Cost = " << ExtractCost
<< ".\n" << "SLP: Total Cost = " << Cost <<
".\n"; } } while (false)
1951 << "SLP: Extract Cost = " << ExtractCost << ".\n"do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Spill Cost = " << SpillCost
<< ".\n" << "SLP: Extract Cost = " << ExtractCost
<< ".\n" << "SLP: Total Cost = " << Cost <<
".\n"; } } while (false)
1952 << "SLP: Total Cost = " << Cost << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Spill Cost = " << SpillCost
<< ".\n" << "SLP: Extract Cost = " << ExtractCost
<< ".\n" << "SLP: Total Cost = " << Cost <<
".\n"; } } while (false)
;
1953 return Cost;
1954}
1955
1956int BoUpSLP::getGatherCost(Type *Ty) {
1957 int Cost = 0;
1958 for (unsigned i = 0, e = cast<VectorType>(Ty)->getNumElements(); i < e; ++i)
1959 Cost += TTI->getVectorInstrCost(Instruction::InsertElement, Ty, i);
1960 return Cost;
1961}
1962
1963int BoUpSLP::getGatherCost(ArrayRef<Value *> VL) {
1964 // Find the type of the operands in VL.
1965 Type *ScalarTy = VL[0]->getType();
1966 if (StoreInst *SI = dyn_cast<StoreInst>(VL[0]))
1967 ScalarTy = SI->getValueOperand()->getType();
1968 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
1969 // Find the cost of inserting/extracting values from the vector.
1970 return getGatherCost(VecTy);
1971}
1972
1973// Reorder commutative operations in alternate shuffle if the resulting vectors
1974// are consecutive loads. This would allow us to vectorize the tree.
1975// If we have something like-
1976// load a[0] - load b[0]
1977// load b[1] + load a[1]
1978// load a[2] - load b[2]
1979// load a[3] + load b[3]
1980// Reordering the second load b[1] load a[1] would allow us to vectorize this
1981// code.
1982void BoUpSLP::reorderAltShuffleOperands(ArrayRef<Value *> VL,
1983 SmallVectorImpl<Value *> &Left,
1984 SmallVectorImpl<Value *> &Right) {
1985 // Push left and right operands of binary operation into Left and Right
1986 for (Value *i : VL) {
1987 Left.push_back(cast<Instruction>(i)->getOperand(0));
1988 Right.push_back(cast<Instruction>(i)->getOperand(1));
1989 }
1990
1991 // Reorder if we have a commutative operation and consecutive access
1992 // are on either side of the alternate instructions.
1993 for (unsigned j = 0; j < VL.size() - 1; ++j) {
1994 if (LoadInst *L = dyn_cast<LoadInst>(Left[j])) {
1995 if (LoadInst *L1 = dyn_cast<LoadInst>(Right[j + 1])) {
1996 Instruction *VL1 = cast<Instruction>(VL[j]);
1997 Instruction *VL2 = cast<Instruction>(VL[j + 1]);
1998 if (VL1->isCommutative() && isConsecutiveAccess(L, L1, *DL, *SE)) {
1999 std::swap(Left[j], Right[j]);
2000 continue;
2001 } else if (VL2->isCommutative() &&
2002 isConsecutiveAccess(L, L1, *DL, *SE)) {
2003 std::swap(Left[j + 1], Right[j + 1]);
2004 continue;
2005 }
2006 // else unchanged
2007 }
2008 }
2009 if (LoadInst *L = dyn_cast<LoadInst>(Right[j])) {
2010 if (LoadInst *L1 = dyn_cast<LoadInst>(Left[j + 1])) {
2011 Instruction *VL1 = cast<Instruction>(VL[j]);
2012 Instruction *VL2 = cast<Instruction>(VL[j + 1]);
2013 if (VL1->isCommutative() && isConsecutiveAccess(L, L1, *DL, *SE)) {
2014 std::swap(Left[j], Right[j]);
2015 continue;
2016 } else if (VL2->isCommutative() &&
2017 isConsecutiveAccess(L, L1, *DL, *SE)) {
2018 std::swap(Left[j + 1], Right[j + 1]);
2019 continue;
2020 }
2021 // else unchanged
2022 }
2023 }
2024 }
2025}
2026
2027// Return true if I should be commuted before adding it's left and right
2028// operands to the arrays Left and Right.
2029//
2030// The vectorizer is trying to either have all elements one side being
2031// instruction with the same opcode to enable further vectorization, or having
2032// a splat to lower the vectorizing cost.
2033static bool shouldReorderOperands(int i, Instruction &I,
2034 SmallVectorImpl<Value *> &Left,
2035 SmallVectorImpl<Value *> &Right,
2036 bool AllSameOpcodeLeft,
2037 bool AllSameOpcodeRight, bool SplatLeft,
2038 bool SplatRight) {
2039 Value *VLeft = I.getOperand(0);
2040 Value *VRight = I.getOperand(1);
2041 // If we have "SplatRight", try to see if commuting is needed to preserve it.
2042 if (SplatRight) {
2043 if (VRight == Right[i - 1])
2044 // Preserve SplatRight
2045 return false;
2046 if (VLeft == Right[i - 1]) {
2047 // Commuting would preserve SplatRight, but we don't want to break
2048 // SplatLeft either, i.e. preserve the original order if possible.
2049 // (FIXME: why do we care?)
2050 if (SplatLeft && VLeft == Left[i - 1])
2051 return false;
2052 return true;
2053 }
2054 }
2055 // Symmetrically handle Right side.
2056 if (SplatLeft) {
2057 if (VLeft == Left[i - 1])
2058 // Preserve SplatLeft
2059 return false;
2060 if (VRight == Left[i - 1])
2061 return true;
2062 }
2063
2064 Instruction *ILeft = dyn_cast<Instruction>(VLeft);
2065 Instruction *IRight = dyn_cast<Instruction>(VRight);
2066
2067 // If we have "AllSameOpcodeRight", try to see if the left operands preserves
2068 // it and not the right, in this case we want to commute.
2069 if (AllSameOpcodeRight) {
2070 unsigned RightPrevOpcode = cast<Instruction>(Right[i - 1])->getOpcode();
2071 if (IRight && RightPrevOpcode == IRight->getOpcode())
2072 // Do not commute, a match on the right preserves AllSameOpcodeRight
2073 return false;
2074 if (ILeft && RightPrevOpcode == ILeft->getOpcode()) {
2075 // We have a match and may want to commute, but first check if there is
2076 // not also a match on the existing operands on the Left to preserve
2077 // AllSameOpcodeLeft, i.e. preserve the original order if possible.
2078 // (FIXME: why do we care?)
2079 if (AllSameOpcodeLeft && ILeft &&
2080 cast<Instruction>(Left[i - 1])->getOpcode() == ILeft->getOpcode())
2081 return false;
2082 return true;
2083 }
2084 }
2085 // Symmetrically handle Left side.
2086 if (AllSameOpcodeLeft) {
2087 unsigned LeftPrevOpcode = cast<Instruction>(Left[i - 1])->getOpcode();
2088 if (ILeft && LeftPrevOpcode == ILeft->getOpcode())
2089 return false;
2090 if (IRight && LeftPrevOpcode == IRight->getOpcode())
2091 return true;
2092 }
2093 return false;
2094}
2095
2096void BoUpSLP::reorderInputsAccordingToOpcode(ArrayRef<Value *> VL,
2097 SmallVectorImpl<Value *> &Left,
2098 SmallVectorImpl<Value *> &Right) {
2099
2100 if (VL.size()) {
2101 // Peel the first iteration out of the loop since there's nothing
2102 // interesting to do anyway and it simplifies the checks in the loop.
2103 auto VLeft = cast<Instruction>(VL[0])->getOperand(0);
2104 auto VRight = cast<Instruction>(VL[0])->getOperand(1);
2105 if (!isa<Instruction>(VRight) && isa<Instruction>(VLeft))
2106 // Favor having instruction to the right. FIXME: why?
2107 std::swap(VLeft, VRight);
2108 Left.push_back(VLeft);
2109 Right.push_back(VRight);
2110 }
2111
2112 // Keep track if we have instructions with all the same opcode on one side.
2113 bool AllSameOpcodeLeft = isa<Instruction>(Left[0]);
2114 bool AllSameOpcodeRight = isa<Instruction>(Right[0]);
2115 // Keep track if we have one side with all the same value (broadcast).
2116 bool SplatLeft = true;
2117 bool SplatRight = true;
2118
2119 for (unsigned i = 1, e = VL.size(); i != e; ++i) {
2120 Instruction *I = cast<Instruction>(VL[i]);
2121 assert(I->isCommutative() && "Can only process commutative instruction")((I->isCommutative() && "Can only process commutative instruction"
) ? static_cast<void> (0) : __assert_fail ("I->isCommutative() && \"Can only process commutative instruction\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2121, __PRETTY_FUNCTION__))
;
2122 // Commute to favor either a splat or maximizing having the same opcodes on
2123 // one side.
2124 if (shouldReorderOperands(i, *I, Left, Right, AllSameOpcodeLeft,
2125 AllSameOpcodeRight, SplatLeft, SplatRight)) {
2126 Left.push_back(I->getOperand(1));
2127 Right.push_back(I->getOperand(0));
2128 } else {
2129 Left.push_back(I->getOperand(0));
2130 Right.push_back(I->getOperand(1));
2131 }
2132 // Update Splat* and AllSameOpcode* after the insertion.
2133 SplatRight = SplatRight && (Right[i - 1] == Right[i]);
2134 SplatLeft = SplatLeft && (Left[i - 1] == Left[i]);
2135 AllSameOpcodeLeft = AllSameOpcodeLeft && isa<Instruction>(Left[i]) &&
2136 (cast<Instruction>(Left[i - 1])->getOpcode() ==
2137 cast<Instruction>(Left[i])->getOpcode());
2138 AllSameOpcodeRight = AllSameOpcodeRight && isa<Instruction>(Right[i]) &&
2139 (cast<Instruction>(Right[i - 1])->getOpcode() ==
2140 cast<Instruction>(Right[i])->getOpcode());
2141 }
2142
2143 // If one operand end up being broadcast, return this operand order.
2144 if (SplatRight || SplatLeft)
2145 return;
2146
2147 // Finally check if we can get longer vectorizable chain by reordering
2148 // without breaking the good operand order detected above.
2149 // E.g. If we have something like-
2150 // load a[0] load b[0]
2151 // load b[1] load a[1]
2152 // load a[2] load b[2]
2153 // load a[3] load b[3]
2154 // Reordering the second load b[1] load a[1] would allow us to vectorize
2155 // this code and we still retain AllSameOpcode property.
2156 // FIXME: This load reordering might break AllSameOpcode in some rare cases
2157 // such as-
2158 // add a[0],c[0] load b[0]
2159 // add a[1],c[2] load b[1]
2160 // b[2] load b[2]
2161 // add a[3],c[3] load b[3]
2162 for (unsigned j = 0; j < VL.size() - 1; ++j) {
2163 if (LoadInst *L = dyn_cast<LoadInst>(Left[j])) {
2164 if (LoadInst *L1 = dyn_cast<LoadInst>(Right[j + 1])) {
2165 if (isConsecutiveAccess(L, L1, *DL, *SE)) {
2166 std::swap(Left[j + 1], Right[j + 1]);
2167 continue;
2168 }
2169 }
2170 }
2171 if (LoadInst *L = dyn_cast<LoadInst>(Right[j])) {
2172 if (LoadInst *L1 = dyn_cast<LoadInst>(Left[j + 1])) {
2173 if (isConsecutiveAccess(L, L1, *DL, *SE)) {
2174 std::swap(Left[j + 1], Right[j + 1]);
2175 continue;
2176 }
2177 }
2178 }
2179 // else unchanged
2180 }
2181}
2182
2183void BoUpSLP::setInsertPointAfterBundle(ArrayRef<Value *> VL) {
2184
2185 // Get the basic block this bundle is in. All instructions in the bundle
2186 // should be in this block.
2187 auto *Front = cast<Instruction>(VL.front());
2188 auto *BB = Front->getParent();
2189 assert(all_of(make_range(VL.begin(), VL.end()), [&](Value *V) -> bool {((all_of(make_range(VL.begin(), VL.end()), [&](Value *V) ->
bool { return cast<Instruction>(V)->getParent() == BB
; })) ? static_cast<void> (0) : __assert_fail ("all_of(make_range(VL.begin(), VL.end()), [&](Value *V) -> bool { return cast<Instruction>(V)->getParent() == BB; })"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2191, __PRETTY_FUNCTION__))
2190 return cast<Instruction>(V)->getParent() == BB;((all_of(make_range(VL.begin(), VL.end()), [&](Value *V) ->
bool { return cast<Instruction>(V)->getParent() == BB
; })) ? static_cast<void> (0) : __assert_fail ("all_of(make_range(VL.begin(), VL.end()), [&](Value *V) -> bool { return cast<Instruction>(V)->getParent() == BB; })"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2191, __PRETTY_FUNCTION__))
2191 }))((all_of(make_range(VL.begin(), VL.end()), [&](Value *V) ->
bool { return cast<Instruction>(V)->getParent() == BB
; })) ? static_cast<void> (0) : __assert_fail ("all_of(make_range(VL.begin(), VL.end()), [&](Value *V) -> bool { return cast<Instruction>(V)->getParent() == BB; })"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2191, __PRETTY_FUNCTION__))
;
2192
2193 // The last instruction in the bundle in program order.
2194 Instruction *LastInst = nullptr;
8
'LastInst' initialized to a null pointer value
2195
2196 // Find the last instruction. The common case should be that BB has been
2197 // scheduled, and the last instruction is VL.back(). So we start with
2198 // VL.back() and iterate over schedule data until we reach the end of the
2199 // bundle. The end of the bundle is marked by null ScheduleData.
2200 if (BlocksSchedules.count(BB)) {
9
Assuming the condition is false
10
Taking false branch
2201 auto *Bundle = BlocksSchedules[BB]->getScheduleData(VL.back());
2202 if (Bundle && Bundle->isPartOfBundle())
2203 for (; Bundle; Bundle = Bundle->NextInBundle)
2204 LastInst = Bundle->Inst;
2205 }
2206
2207 // LastInst can still be null at this point if there's either not an entry
2208 // for BB in BlocksSchedules or there's no ScheduleData available for
2209 // VL.back(). This can be the case if buildTree_rec aborts for various
2210 // reasons (e.g., the maximum recursion depth is reached, the maximum region
2211 // size is reached, etc.). ScheduleData is initialized in the scheduling
2212 // "dry-run".
2213 //
2214 // If this happens, we can still find the last instruction by brute force. We
2215 // iterate forwards from Front (inclusive) until we either see all
2216 // instructions in the bundle or reach the end of the block. If Front is the
2217 // last instruction in program order, LastInst will be set to Front, and we
2218 // will visit all the remaining instructions in the block.
2219 //
2220 // One of the reasons we exit early from buildTree_rec is to place an upper
2221 // bound on compile-time. Thus, taking an additional compile-time hit here is
2222 // not ideal. However, this should be exceedingly rare since it requires that
2223 // we both exit early from buildTree_rec and that the bundle be out-of-order
2224 // (causing us to iterate all the way to the end of the block).
2225 if (!LastInst) {
11
Taking true branch
2226 SmallPtrSet<Value *, 16> Bundle(VL.begin(), VL.end());
2227 for (auto &I : make_range(BasicBlock::iterator(Front), BB->end())) {
2228 if (Bundle.erase(&I))
2229 LastInst = &I;
2230 if (Bundle.empty())
2231 break;
2232 }
2233 }
2234
2235 // Set the insertion point after the last instruction in the bundle. Set the
2236 // debug location to Front.
2237 Builder.SetInsertPoint(BB, ++LastInst->getIterator());
12
Called C++ object pointer is null
2238 Builder.SetCurrentDebugLocation(Front->getDebugLoc());
2239}
2240
2241Value *BoUpSLP::Gather(ArrayRef<Value *> VL, VectorType *Ty) {
2242 Value *Vec = UndefValue::get(Ty);
2243 // Generate the 'InsertElement' instruction.
2244 for (unsigned i = 0; i < Ty->getNumElements(); ++i) {
2245 Vec = Builder.CreateInsertElement(Vec, VL[i], Builder.getInt32(i));
2246 if (Instruction *Insrt = dyn_cast<Instruction>(Vec)) {
2247 GatherSeq.insert(Insrt);
2248 CSEBlocks.insert(Insrt->getParent());
2249
2250 // Add to our 'need-to-extract' list.
2251 if (ScalarToTreeEntry.count(VL[i])) {
2252 int Idx = ScalarToTreeEntry[VL[i]];
2253 TreeEntry *E = &VectorizableTree[Idx];
2254 // Find which lane we need to extract.
2255 int FoundLane = -1;
2256 for (unsigned Lane = 0, LE = VL.size(); Lane != LE; ++Lane) {
2257 // Is this the lane of the scalar that we are looking for ?
2258 if (E->Scalars[Lane] == VL[i]) {
2259 FoundLane = Lane;
2260 break;
2261 }
2262 }
2263 assert(FoundLane >= 0 && "Could not find the correct lane")((FoundLane >= 0 && "Could not find the correct lane"
) ? static_cast<void> (0) : __assert_fail ("FoundLane >= 0 && \"Could not find the correct lane\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2263, __PRETTY_FUNCTION__))
;
2264 ExternalUses.push_back(ExternalUser(VL[i], Insrt, FoundLane));
2265 }
2266 }
2267 }
2268
2269 return Vec;
2270}
2271
2272Value *BoUpSLP::alreadyVectorized(ArrayRef<Value *> VL) const {
2273 SmallDenseMap<Value*, int>::const_iterator Entry
2274 = ScalarToTreeEntry.find(VL[0]);
2275 if (Entry != ScalarToTreeEntry.end()) {
2276 int Idx = Entry->second;
2277 const TreeEntry *En = &VectorizableTree[Idx];
2278 if (En->isSame(VL) && En->VectorizedValue)
2279 return En->VectorizedValue;
2280 }
2281 return nullptr;
2282}
2283
2284Value *BoUpSLP::vectorizeTree(ArrayRef<Value *> VL) {
2285 if (ScalarToTreeEntry.count(VL[0])) {
2286 int Idx = ScalarToTreeEntry[VL[0]];
2287 TreeEntry *E = &VectorizableTree[Idx];
2288 if (E->isSame(VL))
2289 return vectorizeTree(E);
2290 }
2291
2292 Type *ScalarTy = VL[0]->getType();
2293 if (StoreInst *SI = dyn_cast<StoreInst>(VL[0]))
2294 ScalarTy = SI->getValueOperand()->getType();
2295 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
2296
2297 return Gather(VL, VecTy);
2298}
2299
2300Value *BoUpSLP::vectorizeTree(TreeEntry *E) {
2301 IRBuilder<>::InsertPointGuard Guard(Builder);
2302
2303 if (E->VectorizedValue) {
1
Assuming the condition is false
2
Taking false branch
2304 DEBUG(dbgs() << "SLP: Diamond merged for " << *E->Scalars[0] << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Diamond merged for " <<
*E->Scalars[0] << ".\n"; } } while (false)
;
2305 return E->VectorizedValue;
2306 }
2307
2308 Instruction *VL0 = cast<Instruction>(E->Scalars[0]);
2309 Type *ScalarTy = VL0->getType();
2310 if (StoreInst *SI = dyn_cast<StoreInst>(VL0))
3
Taking false branch
2311 ScalarTy = SI->getValueOperand()->getType();
2312 VectorType *VecTy = VectorType::get(ScalarTy, E->Scalars.size());
2313
2314 if (E->NeedToGather) {
4
Assuming the condition is false
5
Taking false branch
2315 setInsertPointAfterBundle(E->Scalars);
2316 auto *V = Gather(E->Scalars, VecTy);
2317 E->VectorizedValue = V;
2318 return V;
2319 }
2320
2321 unsigned Opcode = getSameOpcode(E->Scalars);
2322
2323 switch (Opcode) {
6
Control jumps to 'case ShuffleVector:' at line 2649
2324 case Instruction::PHI: {
2325 PHINode *PH = dyn_cast<PHINode>(VL0);
2326 Builder.SetInsertPoint(PH->getParent()->getFirstNonPHI());
2327 Builder.SetCurrentDebugLocation(PH->getDebugLoc());
2328 PHINode *NewPhi = Builder.CreatePHI(VecTy, PH->getNumIncomingValues());
2329 E->VectorizedValue = NewPhi;
2330
2331 // PHINodes may have multiple entries from the same block. We want to
2332 // visit every block once.
2333 SmallSet<BasicBlock*, 4> VisitedBBs;
2334
2335 for (unsigned i = 0, e = PH->getNumIncomingValues(); i < e; ++i) {
2336 ValueList Operands;
2337 BasicBlock *IBB = PH->getIncomingBlock(i);
2338
2339 if (!VisitedBBs.insert(IBB).second) {
2340 NewPhi->addIncoming(NewPhi->getIncomingValueForBlock(IBB), IBB);
2341 continue;
2342 }
2343
2344 // Prepare the operand vector.
2345 for (Value *V : E->Scalars)
2346 Operands.push_back(cast<PHINode>(V)->getIncomingValueForBlock(IBB));
2347
2348 Builder.SetInsertPoint(IBB->getTerminator());
2349 Builder.SetCurrentDebugLocation(PH->getDebugLoc());
2350 Value *Vec = vectorizeTree(Operands);
2351 NewPhi->addIncoming(Vec, IBB);
2352 }
2353
2354 assert(NewPhi->getNumIncomingValues() == PH->getNumIncomingValues() &&((NewPhi->getNumIncomingValues() == PH->getNumIncomingValues
() && "Invalid number of incoming values") ? static_cast
<void> (0) : __assert_fail ("NewPhi->getNumIncomingValues() == PH->getNumIncomingValues() && \"Invalid number of incoming values\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2355, __PRETTY_FUNCTION__))
2355 "Invalid number of incoming values")((NewPhi->getNumIncomingValues() == PH->getNumIncomingValues
() && "Invalid number of incoming values") ? static_cast
<void> (0) : __assert_fail ("NewPhi->getNumIncomingValues() == PH->getNumIncomingValues() && \"Invalid number of incoming values\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2355, __PRETTY_FUNCTION__))
;
2356 return NewPhi;
2357 }
2358
2359 case Instruction::ExtractElement: {
2360 if (canReuseExtract(E->Scalars, Instruction::ExtractElement)) {
2361 Value *V = VL0->getOperand(0);
2362 E->VectorizedValue = V;
2363 return V;
2364 }
2365 setInsertPointAfterBundle(E->Scalars);
2366 auto *V = Gather(E->Scalars, VecTy);
2367 E->VectorizedValue = V;
2368 return V;
2369 }
2370 case Instruction::ExtractValue: {
2371 if (canReuseExtract(E->Scalars, Instruction::ExtractValue)) {
2372 LoadInst *LI = cast<LoadInst>(VL0->getOperand(0));
2373 Builder.SetInsertPoint(LI);
2374 PointerType *PtrTy = PointerType::get(VecTy, LI->getPointerAddressSpace());
2375 Value *Ptr = Builder.CreateBitCast(LI->getOperand(0), PtrTy);
2376 LoadInst *V = Builder.CreateAlignedLoad(Ptr, LI->getAlignment());
2377 E->VectorizedValue = V;
2378 return propagateMetadata(V, E->Scalars);
2379 }
2380 setInsertPointAfterBundle(E->Scalars);
2381 auto *V = Gather(E->Scalars, VecTy);
2382 E->VectorizedValue = V;
2383 return V;
2384 }
2385 case Instruction::ZExt:
2386 case Instruction::SExt:
2387 case Instruction::FPToUI:
2388 case Instruction::FPToSI:
2389 case Instruction::FPExt:
2390 case Instruction::PtrToInt:
2391 case Instruction::IntToPtr:
2392 case Instruction::SIToFP:
2393 case Instruction::UIToFP:
2394 case Instruction::Trunc:
2395 case Instruction::FPTrunc:
2396 case Instruction::BitCast: {
2397 ValueList INVL;
2398 for (Value *V : E->Scalars)
2399 INVL.push_back(cast<Instruction>(V)->getOperand(0));
2400
2401 setInsertPointAfterBundle(E->Scalars);
2402
2403 Value *InVec = vectorizeTree(INVL);
2404
2405 if (Value *V = alreadyVectorized(E->Scalars))
2406 return V;
2407
2408 CastInst *CI = dyn_cast<CastInst>(VL0);
2409 Value *V = Builder.CreateCast(CI->getOpcode(), InVec, VecTy);
2410 E->VectorizedValue = V;
2411 ++NumVectorInstructions;
2412 return V;
2413 }
2414 case Instruction::FCmp:
2415 case Instruction::ICmp: {
2416 ValueList LHSV, RHSV;
2417 for (Value *V : E->Scalars) {
2418 LHSV.push_back(cast<Instruction>(V)->getOperand(0));
2419 RHSV.push_back(cast<Instruction>(V)->getOperand(1));
2420 }
2421
2422 setInsertPointAfterBundle(E->Scalars);
2423
2424 Value *L = vectorizeTree(LHSV);
2425 Value *R = vectorizeTree(RHSV);
2426
2427 if (Value *V = alreadyVectorized(E->Scalars))
2428 return V;
2429
2430 CmpInst::Predicate P0 = cast<CmpInst>(VL0)->getPredicate();
2431 Value *V;
2432 if (Opcode == Instruction::FCmp)
2433 V = Builder.CreateFCmp(P0, L, R);
2434 else
2435 V = Builder.CreateICmp(P0, L, R);
2436
2437 E->VectorizedValue = V;
2438 propagateIRFlags(E->VectorizedValue, E->Scalars);
2439 ++NumVectorInstructions;
2440 return V;
2441 }
2442 case Instruction::Select: {
2443 ValueList TrueVec, FalseVec, CondVec;
2444 for (Value *V : E->Scalars) {
2445 CondVec.push_back(cast<Instruction>(V)->getOperand(0));
2446 TrueVec.push_back(cast<Instruction>(V)->getOperand(1));
2447 FalseVec.push_back(cast<Instruction>(V)->getOperand(2));
2448 }
2449
2450 setInsertPointAfterBundle(E->Scalars);
2451
2452 Value *Cond = vectorizeTree(CondVec);
2453 Value *True = vectorizeTree(TrueVec);
2454 Value *False = vectorizeTree(FalseVec);
2455
2456 if (Value *V = alreadyVectorized(E->Scalars))
2457 return V;
2458
2459 Value *V = Builder.CreateSelect(Cond, True, False);
2460 E->VectorizedValue = V;
2461 ++NumVectorInstructions;
2462 return V;
2463 }
2464 case Instruction::Add:
2465 case Instruction::FAdd:
2466 case Instruction::Sub:
2467 case Instruction::FSub:
2468 case Instruction::Mul:
2469 case Instruction::FMul:
2470 case Instruction::UDiv:
2471 case Instruction::SDiv:
2472 case Instruction::FDiv:
2473 case Instruction::URem:
2474 case Instruction::SRem:
2475 case Instruction::FRem:
2476 case Instruction::Shl:
2477 case Instruction::LShr:
2478 case Instruction::AShr:
2479 case Instruction::And:
2480 case Instruction::Or:
2481 case Instruction::Xor: {
2482 ValueList LHSVL, RHSVL;
2483 if (isa<BinaryOperator>(VL0) && VL0->isCommutative())
2484 reorderInputsAccordingToOpcode(E->Scalars, LHSVL, RHSVL);
2485 else
2486 for (Value *V : E->Scalars) {
2487 LHSVL.push_back(cast<Instruction>(V)->getOperand(0));
2488 RHSVL.push_back(cast<Instruction>(V)->getOperand(1));
2489 }
2490
2491 setInsertPointAfterBundle(E->Scalars);
2492
2493 Value *LHS = vectorizeTree(LHSVL);
2494 Value *RHS = vectorizeTree(RHSVL);
2495
2496 if (Value *V = alreadyVectorized(E->Scalars))
2497 return V;
2498
2499 BinaryOperator *BinOp = cast<BinaryOperator>(VL0);
2500 Value *V = Builder.CreateBinOp(BinOp->getOpcode(), LHS, RHS);
2501 E->VectorizedValue = V;
2502 propagateIRFlags(E->VectorizedValue, E->Scalars);
2503 ++NumVectorInstructions;
2504
2505 if (Instruction *I = dyn_cast<Instruction>(V))
2506 return propagateMetadata(I, E->Scalars);
2507
2508 return V;
2509 }
2510 case Instruction::Load: {
2511 // Loads are inserted at the head of the tree because we don't want to
2512 // sink them all the way down past store instructions.
2513 setInsertPointAfterBundle(E->Scalars);
2514
2515 LoadInst *LI = cast<LoadInst>(VL0);
2516 Type *ScalarLoadTy = LI->getType();
2517 unsigned AS = LI->getPointerAddressSpace();
2518
2519 Value *VecPtr = Builder.CreateBitCast(LI->getPointerOperand(),
2520 VecTy->getPointerTo(AS));
2521
2522 // The pointer operand uses an in-tree scalar so we add the new BitCast to
2523 // ExternalUses list to make sure that an extract will be generated in the
2524 // future.
2525 if (ScalarToTreeEntry.count(LI->getPointerOperand()))
2526 ExternalUses.push_back(
2527 ExternalUser(LI->getPointerOperand(), cast<User>(VecPtr), 0));
2528
2529 unsigned Alignment = LI->getAlignment();
2530 LI = Builder.CreateLoad(VecPtr);
2531 if (!Alignment) {
2532 Alignment = DL->getABITypeAlignment(ScalarLoadTy);
2533 }
2534 LI->setAlignment(Alignment);
2535 E->VectorizedValue = LI;
2536 ++NumVectorInstructions;
2537 return propagateMetadata(LI, E->Scalars);
2538 }
2539 case Instruction::Store: {
2540 StoreInst *SI = cast<StoreInst>(VL0);
2541 unsigned Alignment = SI->getAlignment();
2542 unsigned AS = SI->getPointerAddressSpace();
2543
2544 ValueList ValueOp;
2545 for (Value *V : E->Scalars)
2546 ValueOp.push_back(cast<StoreInst>(V)->getValueOperand());
2547
2548 setInsertPointAfterBundle(E->Scalars);
2549
2550 Value *VecValue = vectorizeTree(ValueOp);
2551 Value *VecPtr = Builder.CreateBitCast(SI->getPointerOperand(),
2552 VecTy->getPointerTo(AS));
2553 StoreInst *S = Builder.CreateStore(VecValue, VecPtr);
2554
2555 // The pointer operand uses an in-tree scalar so we add the new BitCast to
2556 // ExternalUses list to make sure that an extract will be generated in the
2557 // future.
2558 if (ScalarToTreeEntry.count(SI->getPointerOperand()))
2559 ExternalUses.push_back(
2560 ExternalUser(SI->getPointerOperand(), cast<User>(VecPtr), 0));
2561
2562 if (!Alignment) {
2563 Alignment = DL->getABITypeAlignment(SI->getValueOperand()->getType());
2564 }
2565 S->setAlignment(Alignment);
2566 E->VectorizedValue = S;
2567 ++NumVectorInstructions;
2568 return propagateMetadata(S, E->Scalars);
2569 }
2570 case Instruction::GetElementPtr: {
2571 setInsertPointAfterBundle(E->Scalars);
2572
2573 ValueList Op0VL;
2574 for (Value *V : E->Scalars)
2575 Op0VL.push_back(cast<GetElementPtrInst>(V)->getOperand(0));
2576
2577 Value *Op0 = vectorizeTree(Op0VL);
2578
2579 std::vector<Value *> OpVecs;
2580 for (int j = 1, e = cast<GetElementPtrInst>(VL0)->getNumOperands(); j < e;
2581 ++j) {
2582 ValueList OpVL;
2583 for (Value *V : E->Scalars)
2584 OpVL.push_back(cast<GetElementPtrInst>(V)->getOperand(j));
2585
2586 Value *OpVec = vectorizeTree(OpVL);
2587 OpVecs.push_back(OpVec);
2588 }
2589
2590 Value *V = Builder.CreateGEP(
2591 cast<GetElementPtrInst>(VL0)->getSourceElementType(), Op0, OpVecs);
2592 E->VectorizedValue = V;
2593 ++NumVectorInstructions;
2594
2595 if (Instruction *I = dyn_cast<Instruction>(V))
2596 return propagateMetadata(I, E->Scalars);
2597
2598 return V;
2599 }
2600 case Instruction::Call: {
2601 CallInst *CI = cast<CallInst>(VL0);
2602 setInsertPointAfterBundle(E->Scalars);
2603 Function *FI;
2604 Intrinsic::ID IID = Intrinsic::not_intrinsic;
2605 Value *ScalarArg = nullptr;
2606 if (CI && (FI = CI->getCalledFunction())) {
2607 IID = FI->getIntrinsicID();
2608 }
2609 std::vector<Value *> OpVecs;
2610 for (int j = 0, e = CI->getNumArgOperands(); j < e; ++j) {
2611 ValueList OpVL;
2612 // ctlz,cttz and powi are special intrinsics whose second argument is
2613 // a scalar. This argument should not be vectorized.
2614 if (hasVectorInstrinsicScalarOpd(IID, 1) && j == 1) {
2615 CallInst *CEI = cast<CallInst>(E->Scalars[0]);
2616 ScalarArg = CEI->getArgOperand(j);
2617 OpVecs.push_back(CEI->getArgOperand(j));
2618 continue;
2619 }
2620 for (Value *V : E->Scalars) {
2621 CallInst *CEI = cast<CallInst>(V);
2622 OpVL.push_back(CEI->getArgOperand(j));
2623 }
2624
2625 Value *OpVec = vectorizeTree(OpVL);
2626 DEBUG(dbgs() << "SLP: OpVec[" << j << "]: " << *OpVec << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: OpVec[" << j << "]: "
<< *OpVec << "\n"; } } while (false)
;
2627 OpVecs.push_back(OpVec);
2628 }
2629
2630 Module *M = F->getParent();
2631 Intrinsic::ID ID = getVectorIntrinsicIDForCall(CI, TLI);
2632 Type *Tys[] = { VectorType::get(CI->getType(), E->Scalars.size()) };
2633 Function *CF = Intrinsic::getDeclaration(M, ID, Tys);
2634 SmallVector<OperandBundleDef, 1> OpBundles;
2635 CI->getOperandBundlesAsDefs(OpBundles);
2636 Value *V = Builder.CreateCall(CF, OpVecs, OpBundles);
2637
2638 // The scalar argument uses an in-tree scalar so we add the new vectorized
2639 // call to ExternalUses list to make sure that an extract will be
2640 // generated in the future.
2641 if (ScalarArg && ScalarToTreeEntry.count(ScalarArg))
2642 ExternalUses.push_back(ExternalUser(ScalarArg, cast<User>(V), 0));
2643
2644 E->VectorizedValue = V;
2645 propagateIRFlags(E->VectorizedValue, E->Scalars);
2646 ++NumVectorInstructions;
2647 return V;
2648 }
2649 case Instruction::ShuffleVector: {
2650 ValueList LHSVL, RHSVL;
2651 assert(isa<BinaryOperator>(VL0) && "Invalid Shuffle Vector Operand")((isa<BinaryOperator>(VL0) && "Invalid Shuffle Vector Operand"
) ? static_cast<void> (0) : __assert_fail ("isa<BinaryOperator>(VL0) && \"Invalid Shuffle Vector Operand\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2651, __PRETTY_FUNCTION__))
;
2652 reorderAltShuffleOperands(E->Scalars, LHSVL, RHSVL);
2653 setInsertPointAfterBundle(E->Scalars);
7
Calling 'BoUpSLP::setInsertPointAfterBundle'
2654
2655 Value *LHS = vectorizeTree(LHSVL);
2656 Value *RHS = vectorizeTree(RHSVL);
2657
2658 if (Value *V = alreadyVectorized(E->Scalars))
2659 return V;
2660
2661 // Create a vector of LHS op1 RHS
2662 BinaryOperator *BinOp0 = cast<BinaryOperator>(VL0);
2663 Value *V0 = Builder.CreateBinOp(BinOp0->getOpcode(), LHS, RHS);
2664
2665 // Create a vector of LHS op2 RHS
2666 Instruction *VL1 = cast<Instruction>(E->Scalars[1]);
2667 BinaryOperator *BinOp1 = cast<BinaryOperator>(VL1);
2668 Value *V1 = Builder.CreateBinOp(BinOp1->getOpcode(), LHS, RHS);
2669
2670 // Create shuffle to take alternate operations from the vector.
2671 // Also, gather up odd and even scalar ops to propagate IR flags to
2672 // each vector operation.
2673 ValueList OddScalars, EvenScalars;
2674 unsigned e = E->Scalars.size();
2675 SmallVector<Constant *, 8> Mask(e);
2676 for (unsigned i = 0; i < e; ++i) {
2677 if (i & 1) {
2678 Mask[i] = Builder.getInt32(e + i);
2679 OddScalars.push_back(E->Scalars[i]);
2680 } else {
2681 Mask[i] = Builder.getInt32(i);
2682 EvenScalars.push_back(E->Scalars[i]);
2683 }
2684 }
2685
2686 Value *ShuffleMask = ConstantVector::get(Mask);
2687 propagateIRFlags(V0, EvenScalars);
2688 propagateIRFlags(V1, OddScalars);
2689
2690 Value *V = Builder.CreateShuffleVector(V0, V1, ShuffleMask);
2691 E->VectorizedValue = V;
2692 ++NumVectorInstructions;
2693 if (Instruction *I = dyn_cast<Instruction>(V))
2694 return propagateMetadata(I, E->Scalars);
2695
2696 return V;
2697 }
2698 default:
2699 llvm_unreachable("unknown inst")::llvm::llvm_unreachable_internal("unknown inst", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2699)
;
2700 }
2701 return nullptr;
2702}
2703
2704Value *BoUpSLP::vectorizeTree() {
2705
2706 // All blocks must be scheduled before any instructions are inserted.
2707 for (auto &BSIter : BlocksSchedules) {
2708 scheduleBlock(BSIter.second.get());
2709 }
2710
2711 Builder.SetInsertPoint(&F->getEntryBlock().front());
2712 auto *VectorRoot = vectorizeTree(&VectorizableTree[0]);
2713
2714 // If the vectorized tree can be rewritten in a smaller type, we truncate the
2715 // vectorized root. InstCombine will then rewrite the entire expression. We
2716 // sign extend the extracted values below.
2717 auto *ScalarRoot = VectorizableTree[0].Scalars[0];
2718 if (MinBWs.count(ScalarRoot)) {
2719 if (auto *I = dyn_cast<Instruction>(VectorRoot))
2720 Builder.SetInsertPoint(&*++BasicBlock::iterator(I));
2721 auto BundleWidth = VectorizableTree[0].Scalars.size();
2722 auto *MinTy = IntegerType::get(F->getContext(), MinBWs[ScalarRoot].first);
2723 auto *VecTy = VectorType::get(MinTy, BundleWidth);
2724 auto *Trunc = Builder.CreateTrunc(VectorRoot, VecTy);
2725 VectorizableTree[0].VectorizedValue = Trunc;
2726 }
2727
2728 DEBUG(dbgs() << "SLP: Extracting " << ExternalUses.size() << " values .\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Extracting " << ExternalUses
.size() << " values .\n"; } } while (false)
;
2729
2730 // If necessary, sign-extend or zero-extend ScalarRoot to the larger type
2731 // specified by ScalarType.
2732 auto extend = [&](Value *ScalarRoot, Value *Ex, Type *ScalarType) {
2733 if (!MinBWs.count(ScalarRoot))
2734 return Ex;
2735 if (MinBWs[ScalarRoot].second)
2736 return Builder.CreateSExt(Ex, ScalarType);
2737 return Builder.CreateZExt(Ex, ScalarType);
2738 };
2739
2740 // Extract all of the elements with the external uses.
2741 for (const auto &ExternalUse : ExternalUses) {
2742 Value *Scalar = ExternalUse.Scalar;
2743 llvm::User *User = ExternalUse.User;
2744
2745 // Skip users that we already RAUW. This happens when one instruction
2746 // has multiple uses of the same value.
2747 if (!is_contained(Scalar->users(), User))
2748 continue;
2749 assert(ScalarToTreeEntry.count(Scalar) && "Invalid scalar")((ScalarToTreeEntry.count(Scalar) && "Invalid scalar"
) ? static_cast<void> (0) : __assert_fail ("ScalarToTreeEntry.count(Scalar) && \"Invalid scalar\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2749, __PRETTY_FUNCTION__))
;
2750
2751 int Idx = ScalarToTreeEntry[Scalar];
2752 TreeEntry *E = &VectorizableTree[Idx];
2753 assert(!E->NeedToGather && "Extracting from a gather list")((!E->NeedToGather && "Extracting from a gather list"
) ? static_cast<void> (0) : __assert_fail ("!E->NeedToGather && \"Extracting from a gather list\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2753, __PRETTY_FUNCTION__))
;
2754
2755 Value *Vec = E->VectorizedValue;
2756 assert(Vec && "Can't find vectorizable value")((Vec && "Can't find vectorizable value") ? static_cast
<void> (0) : __assert_fail ("Vec && \"Can't find vectorizable value\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2756, __PRETTY_FUNCTION__))
;
2757
2758 Value *Lane = Builder.getInt32(ExternalUse.Lane);
2759 // Generate extracts for out-of-tree users.
2760 // Find the insertion point for the extractelement lane.
2761 if (auto *VecI = dyn_cast<Instruction>(Vec)) {
2762 if (PHINode *PH = dyn_cast<PHINode>(User)) {
2763 for (int i = 0, e = PH->getNumIncomingValues(); i != e; ++i) {
2764 if (PH->getIncomingValue(i) == Scalar) {
2765 TerminatorInst *IncomingTerminator =
2766 PH->getIncomingBlock(i)->getTerminator();
2767 if (isa<CatchSwitchInst>(IncomingTerminator)) {
2768 Builder.SetInsertPoint(VecI->getParent(),
2769 std::next(VecI->getIterator()));
2770 } else {
2771 Builder.SetInsertPoint(PH->getIncomingBlock(i)->getTerminator());
2772 }
2773 Value *Ex = Builder.CreateExtractElement(Vec, Lane);
2774 Ex = extend(ScalarRoot, Ex, Scalar->getType());
2775 CSEBlocks.insert(PH->getIncomingBlock(i));
2776 PH->setOperand(i, Ex);
2777 }
2778 }
2779 } else {
2780 Builder.SetInsertPoint(cast<Instruction>(User));
2781 Value *Ex = Builder.CreateExtractElement(Vec, Lane);
2782 Ex = extend(ScalarRoot, Ex, Scalar->getType());
2783 CSEBlocks.insert(cast<Instruction>(User)->getParent());
2784 User->replaceUsesOfWith(Scalar, Ex);
2785 }
2786 } else {
2787 Builder.SetInsertPoint(&F->getEntryBlock().front());
2788 Value *Ex = Builder.CreateExtractElement(Vec, Lane);
2789 Ex = extend(ScalarRoot, Ex, Scalar->getType());
2790 CSEBlocks.insert(&F->getEntryBlock());
2791 User->replaceUsesOfWith(Scalar, Ex);
2792 }
2793
2794 DEBUG(dbgs() << "SLP: Replaced:" << *User << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Replaced:" << *User <<
".\n"; } } while (false)
;
2795 }
2796
2797 // For each vectorized value:
2798 for (TreeEntry &EIdx : VectorizableTree) {
2799 TreeEntry *Entry = &EIdx;
2800
2801 // For each lane:
2802 for (int Lane = 0, LE = Entry->Scalars.size(); Lane != LE; ++Lane) {
2803 Value *Scalar = Entry->Scalars[Lane];
2804 // No need to handle users of gathered values.
2805 if (Entry->NeedToGather)
2806 continue;
2807
2808 assert(Entry->VectorizedValue && "Can't find vectorizable value")((Entry->VectorizedValue && "Can't find vectorizable value"
) ? static_cast<void> (0) : __assert_fail ("Entry->VectorizedValue && \"Can't find vectorizable value\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2808, __PRETTY_FUNCTION__))
;
2809
2810 Type *Ty = Scalar->getType();
2811 if (!Ty->isVoidTy()) {
2812#ifndef NDEBUG
2813 for (User *U : Scalar->users()) {
2814 DEBUG(dbgs() << "SLP: \tvalidating user:" << *U << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: \tvalidating user:" <<
*U << ".\n"; } } while (false)
;
2815
2816 assert((ScalarToTreeEntry.count(U) ||(((ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList,
U)) && "Replacing out-of-tree value with undef") ? static_cast
<void> (0) : __assert_fail ("(ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList, U)) && \"Replacing out-of-tree value with undef\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2819, __PRETTY_FUNCTION__))
2817 // It is legal to replace users in the ignorelist by undef.(((ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList,
U)) && "Replacing out-of-tree value with undef") ? static_cast
<void> (0) : __assert_fail ("(ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList, U)) && \"Replacing out-of-tree value with undef\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2819, __PRETTY_FUNCTION__))
2818 is_contained(UserIgnoreList, U)) &&(((ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList,
U)) && "Replacing out-of-tree value with undef") ? static_cast
<void> (0) : __assert_fail ("(ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList, U)) && \"Replacing out-of-tree value with undef\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2819, __PRETTY_FUNCTION__))
2819 "Replacing out-of-tree value with undef")(((ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList,
U)) && "Replacing out-of-tree value with undef") ? static_cast
<void> (0) : __assert_fail ("(ScalarToTreeEntry.count(U) || is_contained(UserIgnoreList, U)) && \"Replacing out-of-tree value with undef\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2819, __PRETTY_FUNCTION__))
;
2820 }
2821#endif
2822 Value *Undef = UndefValue::get(Ty);
2823 Scalar->replaceAllUsesWith(Undef);
2824 }
2825 DEBUG(dbgs() << "SLP: \tErasing scalar:" << *Scalar << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: \tErasing scalar:" << *
Scalar << ".\n"; } } while (false)
;
2826 eraseInstruction(cast<Instruction>(Scalar));
2827 }
2828 }
2829
2830 Builder.ClearInsertionPoint();
2831
2832 return VectorizableTree[0].VectorizedValue;
2833}
2834
2835void BoUpSLP::optimizeGatherSequence() {
2836 DEBUG(dbgs() << "SLP: Optimizing " << GatherSeq.size()do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Optimizing " << GatherSeq
.size() << " gather sequences instructions.\n"; } } while
(false)
2837 << " gather sequences instructions.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Optimizing " << GatherSeq
.size() << " gather sequences instructions.\n"; } } while
(false)
;
2838 // LICM InsertElementInst sequences.
2839 for (Instruction *it : GatherSeq) {
2840 InsertElementInst *Insert = dyn_cast<InsertElementInst>(it);
2841
2842 if (!Insert)
2843 continue;
2844
2845 // Check if this block is inside a loop.
2846 Loop *L = LI->getLoopFor(Insert->getParent());
2847 if (!L)
2848 continue;
2849
2850 // Check if it has a preheader.
2851 BasicBlock *PreHeader = L->getLoopPreheader();
2852 if (!PreHeader)
2853 continue;
2854
2855 // If the vector or the element that we insert into it are
2856 // instructions that are defined in this basic block then we can't
2857 // hoist this instruction.
2858 Instruction *CurrVec = dyn_cast<Instruction>(Insert->getOperand(0));
2859 Instruction *NewElem = dyn_cast<Instruction>(Insert->getOperand(1));
2860 if (CurrVec && L->contains(CurrVec))
2861 continue;
2862 if (NewElem && L->contains(NewElem))
2863 continue;
2864
2865 // We can hoist this instruction. Move it to the pre-header.
2866 Insert->moveBefore(PreHeader->getTerminator());
2867 }
2868
2869 // Make a list of all reachable blocks in our CSE queue.
2870 SmallVector<const DomTreeNode *, 8> CSEWorkList;
2871 CSEWorkList.reserve(CSEBlocks.size());
2872 for (BasicBlock *BB : CSEBlocks)
2873 if (DomTreeNode *N = DT->getNode(BB)) {
2874 assert(DT->isReachableFromEntry(N))((DT->isReachableFromEntry(N)) ? static_cast<void> (
0) : __assert_fail ("DT->isReachableFromEntry(N)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2874, __PRETTY_FUNCTION__))
;
2875 CSEWorkList.push_back(N);
2876 }
2877
2878 // Sort blocks by domination. This ensures we visit a block after all blocks
2879 // dominating it are visited.
2880 std::stable_sort(CSEWorkList.begin(), CSEWorkList.end(),
2881 [this](const DomTreeNode *A, const DomTreeNode *B) {
2882 return DT->properlyDominates(A, B);
2883 });
2884
2885 // Perform O(N^2) search over the gather sequences and merge identical
2886 // instructions. TODO: We can further optimize this scan if we split the
2887 // instructions into different buckets based on the insert lane.
2888 SmallVector<Instruction *, 16> Visited;
2889 for (auto I = CSEWorkList.begin(), E = CSEWorkList.end(); I != E; ++I) {
2890 assert((I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev(I))) &&(((I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev
(I))) && "Worklist not sorted properly!") ? static_cast
<void> (0) : __assert_fail ("(I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev(I))) && \"Worklist not sorted properly!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2891, __PRETTY_FUNCTION__))
2891 "Worklist not sorted properly!")(((I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev
(I))) && "Worklist not sorted properly!") ? static_cast
<void> (0) : __assert_fail ("(I == CSEWorkList.begin() || !DT->dominates(*I, *std::prev(I))) && \"Worklist not sorted properly!\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2891, __PRETTY_FUNCTION__))
;
2892 BasicBlock *BB = (*I)->getBlock();
2893 // For all instructions in blocks containing gather sequences:
2894 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e;) {
2895 Instruction *In = &*it++;
2896 if (!isa<InsertElementInst>(In) && !isa<ExtractElementInst>(In))
2897 continue;
2898
2899 // Check if we can replace this instruction with any of the
2900 // visited instructions.
2901 for (Instruction *v : Visited) {
2902 if (In->isIdenticalTo(v) &&
2903 DT->dominates(v->getParent(), In->getParent())) {
2904 In->replaceAllUsesWith(v);
2905 eraseInstruction(In);
2906 In = nullptr;
2907 break;
2908 }
2909 }
2910 if (In) {
2911 assert(!is_contained(Visited, In))((!is_contained(Visited, In)) ? static_cast<void> (0) :
__assert_fail ("!is_contained(Visited, In)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2911, __PRETTY_FUNCTION__))
;
2912 Visited.push_back(In);
2913 }
2914 }
2915 }
2916 CSEBlocks.clear();
2917 GatherSeq.clear();
2918}
2919
2920// Groups the instructions to a bundle (which is then a single scheduling entity)
2921// and schedules instructions until the bundle gets ready.
2922bool BoUpSLP::BlockScheduling::tryScheduleBundle(ArrayRef<Value *> VL,
2923 BoUpSLP *SLP) {
2924 if (isa<PHINode>(VL[0]))
2925 return true;
2926
2927 // Initialize the instruction bundle.
2928 Instruction *OldScheduleEnd = ScheduleEnd;
2929 ScheduleData *PrevInBundle = nullptr;
2930 ScheduleData *Bundle = nullptr;
2931 bool ReSchedule = false;
2932 DEBUG(dbgs() << "SLP: bundle: " << *VL[0] << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: bundle: " << *VL[0] <<
"\n"; } } while (false)
;
2933
2934 // Make sure that the scheduling region contains all
2935 // instructions of the bundle.
2936 for (Value *V : VL) {
2937 if (!extendSchedulingRegion(V))
2938 return false;
2939 }
2940
2941 for (Value *V : VL) {
2942 ScheduleData *BundleMember = getScheduleData(V);
2943 assert(BundleMember &&((BundleMember && "no ScheduleData for bundle member (maybe not in same basic block)"
) ? static_cast<void> (0) : __assert_fail ("BundleMember && \"no ScheduleData for bundle member (maybe not in same basic block)\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2944, __PRETTY_FUNCTION__))
2944 "no ScheduleData for bundle member (maybe not in same basic block)")((BundleMember && "no ScheduleData for bundle member (maybe not in same basic block)"
) ? static_cast<void> (0) : __assert_fail ("BundleMember && \"no ScheduleData for bundle member (maybe not in same basic block)\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2944, __PRETTY_FUNCTION__))
;
2945 if (BundleMember->IsScheduled) {
2946 // A bundle member was scheduled as single instruction before and now
2947 // needs to be scheduled as part of the bundle. We just get rid of the
2948 // existing schedule.
2949 DEBUG(dbgs() << "SLP: reset schedule because " << *BundleMemberdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: reset schedule because " <<
*BundleMember << " was already scheduled\n"; } } while
(false)
2950 << " was already scheduled\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: reset schedule because " <<
*BundleMember << " was already scheduled\n"; } } while
(false)
;
2951 ReSchedule = true;
2952 }
2953 assert(BundleMember->isSchedulingEntity() &&((BundleMember->isSchedulingEntity() && "bundle member already part of other bundle"
) ? static_cast<void> (0) : __assert_fail ("BundleMember->isSchedulingEntity() && \"bundle member already part of other bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2954, __PRETTY_FUNCTION__))
2954 "bundle member already part of other bundle")((BundleMember->isSchedulingEntity() && "bundle member already part of other bundle"
) ? static_cast<void> (0) : __assert_fail ("BundleMember->isSchedulingEntity() && \"bundle member already part of other bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 2954, __PRETTY_FUNCTION__))
;
2955 if (PrevInBundle) {
2956 PrevInBundle->NextInBundle = BundleMember;
2957 } else {
2958 Bundle = BundleMember;
2959 }
2960 BundleMember->UnscheduledDepsInBundle = 0;
2961 Bundle->UnscheduledDepsInBundle += BundleMember->UnscheduledDeps;
2962
2963 // Group the instructions to a bundle.
2964 BundleMember->FirstInBundle = Bundle;
2965 PrevInBundle = BundleMember;
2966 }
2967 if (ScheduleEnd != OldScheduleEnd) {
2968 // The scheduling region got new instructions at the lower end (or it is a
2969 // new region for the first bundle). This makes it necessary to
2970 // recalculate all dependencies.
2971 // It is seldom that this needs to be done a second time after adding the
2972 // initial bundle to the region.
2973 for (auto *I = ScheduleStart; I != ScheduleEnd; I = I->getNextNode()) {
2974 ScheduleData *SD = getScheduleData(I);
2975 SD->clearDependencies();
2976 }
2977 ReSchedule = true;
2978 }
2979 if (ReSchedule) {
2980 resetSchedule();
2981 initialFillReadyList(ReadyInsts);
2982 }
2983
2984 DEBUG(dbgs() << "SLP: try schedule bundle " << *Bundle << " in block "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: try schedule bundle " <<
*Bundle << " in block " << BB->getName() <<
"\n"; } } while (false)
2985 << BB->getName() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: try schedule bundle " <<
*Bundle << " in block " << BB->getName() <<
"\n"; } } while (false)
;
2986
2987 calculateDependencies(Bundle, true, SLP);
2988
2989 // Now try to schedule the new bundle. As soon as the bundle is "ready" it
2990 // means that there are no cyclic dependencies and we can schedule it.
2991 // Note that's important that we don't "schedule" the bundle yet (see
2992 // cancelScheduling).
2993 while (!Bundle->isReady() && !ReadyInsts.empty()) {
2994
2995 ScheduleData *pickedSD = ReadyInsts.back();
2996 ReadyInsts.pop_back();
2997
2998 if (pickedSD->isSchedulingEntity() && pickedSD->isReady()) {
2999 schedule(pickedSD, ReadyInsts);
3000 }
3001 }
3002 if (!Bundle->isReady()) {
3003 cancelScheduling(VL);
3004 return false;
3005 }
3006 return true;
3007}
3008
3009void BoUpSLP::BlockScheduling::cancelScheduling(ArrayRef<Value *> VL) {
3010 if (isa<PHINode>(VL[0]))
3011 return;
3012
3013 ScheduleData *Bundle = getScheduleData(VL[0]);
3014 DEBUG(dbgs() << "SLP: cancel scheduling of " << *Bundle << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: cancel scheduling of " <<
*Bundle << "\n"; } } while (false)
;
3015 assert(!Bundle->IsScheduled &&((!Bundle->IsScheduled && "Can't cancel bundle which is already scheduled"
) ? static_cast<void> (0) : __assert_fail ("!Bundle->IsScheduled && \"Can't cancel bundle which is already scheduled\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3016, __PRETTY_FUNCTION__))
3016 "Can't cancel bundle which is already scheduled")((!Bundle->IsScheduled && "Can't cancel bundle which is already scheduled"
) ? static_cast<void> (0) : __assert_fail ("!Bundle->IsScheduled && \"Can't cancel bundle which is already scheduled\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3016, __PRETTY_FUNCTION__))
;
3017 assert(Bundle->isSchedulingEntity() && Bundle->isPartOfBundle() &&((Bundle->isSchedulingEntity() && Bundle->isPartOfBundle
() && "tried to unbundle something which is not a bundle"
) ? static_cast<void> (0) : __assert_fail ("Bundle->isSchedulingEntity() && Bundle->isPartOfBundle() && \"tried to unbundle something which is not a bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3018, __PRETTY_FUNCTION__))
3018 "tried to unbundle something which is not a bundle")((Bundle->isSchedulingEntity() && Bundle->isPartOfBundle
() && "tried to unbundle something which is not a bundle"
) ? static_cast<void> (0) : __assert_fail ("Bundle->isSchedulingEntity() && Bundle->isPartOfBundle() && \"tried to unbundle something which is not a bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3018, __PRETTY_FUNCTION__))
;
3019
3020 // Un-bundle: make single instructions out of the bundle.
3021 ScheduleData *BundleMember = Bundle;
3022 while (BundleMember) {
3023 assert(BundleMember->FirstInBundle == Bundle && "corrupt bundle links")((BundleMember->FirstInBundle == Bundle && "corrupt bundle links"
) ? static_cast<void> (0) : __assert_fail ("BundleMember->FirstInBundle == Bundle && \"corrupt bundle links\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3023, __PRETTY_FUNCTION__))
;
3024 BundleMember->FirstInBundle = BundleMember;
3025 ScheduleData *Next = BundleMember->NextInBundle;
3026 BundleMember->NextInBundle = nullptr;
3027 BundleMember->UnscheduledDepsInBundle = BundleMember->UnscheduledDeps;
3028 if (BundleMember->UnscheduledDepsInBundle == 0) {
3029 ReadyInsts.insert(BundleMember);
3030 }
3031 BundleMember = Next;
3032 }
3033}
3034
3035bool BoUpSLP::BlockScheduling::extendSchedulingRegion(Value *V) {
3036 if (getScheduleData(V))
3037 return true;
3038 Instruction *I = dyn_cast<Instruction>(V);
3039 assert(I && "bundle member must be an instruction")((I && "bundle member must be an instruction") ? static_cast
<void> (0) : __assert_fail ("I && \"bundle member must be an instruction\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3039, __PRETTY_FUNCTION__))
;
3040 assert(!isa<PHINode>(I) && "phi nodes don't need to be scheduled")((!isa<PHINode>(I) && "phi nodes don't need to be scheduled"
) ? static_cast<void> (0) : __assert_fail ("!isa<PHINode>(I) && \"phi nodes don't need to be scheduled\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3040, __PRETTY_FUNCTION__))
;
3041 if (!ScheduleStart) {
3042 // It's the first instruction in the new region.
3043 initScheduleData(I, I->getNextNode(), nullptr, nullptr);
3044 ScheduleStart = I;
3045 ScheduleEnd = I->getNextNode();
3046 assert(ScheduleEnd && "tried to vectorize a TerminatorInst?")((ScheduleEnd && "tried to vectorize a TerminatorInst?"
) ? static_cast<void> (0) : __assert_fail ("ScheduleEnd && \"tried to vectorize a TerminatorInst?\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3046, __PRETTY_FUNCTION__))
;
3047 DEBUG(dbgs() << "SLP: initialize schedule region to " << *I << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: initialize schedule region to "
<< *I << "\n"; } } while (false)
;
3048 return true;
3049 }
3050 // Search up and down at the same time, because we don't know if the new
3051 // instruction is above or below the existing scheduling region.
3052 BasicBlock::reverse_iterator UpIter =
3053 ++ScheduleStart->getIterator().getReverse();
3054 BasicBlock::reverse_iterator UpperEnd = BB->rend();
3055 BasicBlock::iterator DownIter = ScheduleEnd->getIterator();
3056 BasicBlock::iterator LowerEnd = BB->end();
3057 for (;;) {
3058 if (++ScheduleRegionSize > ScheduleRegionSizeLimit) {
3059 DEBUG(dbgs() << "SLP: exceeded schedule region size limit\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: exceeded schedule region size limit\n"
; } } while (false)
;
3060 return false;
3061 }
3062
3063 if (UpIter != UpperEnd) {
3064 if (&*UpIter == I) {
3065 initScheduleData(I, ScheduleStart, nullptr, FirstLoadStoreInRegion);
3066 ScheduleStart = I;
3067 DEBUG(dbgs() << "SLP: extend schedule region start to " << *I << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: extend schedule region start to "
<< *I << "\n"; } } while (false)
;
3068 return true;
3069 }
3070 UpIter++;
3071 }
3072 if (DownIter != LowerEnd) {
3073 if (&*DownIter == I) {
3074 initScheduleData(ScheduleEnd, I->getNextNode(), LastLoadStoreInRegion,
3075 nullptr);
3076 ScheduleEnd = I->getNextNode();
3077 assert(ScheduleEnd && "tried to vectorize a TerminatorInst?")((ScheduleEnd && "tried to vectorize a TerminatorInst?"
) ? static_cast<void> (0) : __assert_fail ("ScheduleEnd && \"tried to vectorize a TerminatorInst?\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3077, __PRETTY_FUNCTION__))
;
3078 DEBUG(dbgs() << "SLP: extend schedule region end to " << *I << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: extend schedule region end to "
<< *I << "\n"; } } while (false)
;
3079 return true;
3080 }
3081 DownIter++;
3082 }
3083 assert((UpIter != UpperEnd || DownIter != LowerEnd) &&(((UpIter != UpperEnd || DownIter != LowerEnd) && "instruction not found in block"
) ? static_cast<void> (0) : __assert_fail ("(UpIter != UpperEnd || DownIter != LowerEnd) && \"instruction not found in block\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3084, __PRETTY_FUNCTION__))
3084 "instruction not found in block")(((UpIter != UpperEnd || DownIter != LowerEnd) && "instruction not found in block"
) ? static_cast<void> (0) : __assert_fail ("(UpIter != UpperEnd || DownIter != LowerEnd) && \"instruction not found in block\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3084, __PRETTY_FUNCTION__))
;
3085 }
3086 return true;
3087}
3088
3089void BoUpSLP::BlockScheduling::initScheduleData(Instruction *FromI,
3090 Instruction *ToI,
3091 ScheduleData *PrevLoadStore,
3092 ScheduleData *NextLoadStore) {
3093 ScheduleData *CurrentLoadStore = PrevLoadStore;
3094 for (Instruction *I = FromI; I != ToI; I = I->getNextNode()) {
3095 ScheduleData *SD = ScheduleDataMap[I];
3096 if (!SD) {
3097 // Allocate a new ScheduleData for the instruction.
3098 if (ChunkPos >= ChunkSize) {
3099 ScheduleDataChunks.push_back(
3100 llvm::make_unique<ScheduleData[]>(ChunkSize));
3101 ChunkPos = 0;
3102 }
3103 SD = &(ScheduleDataChunks.back()[ChunkPos++]);
3104 ScheduleDataMap[I] = SD;
3105 SD->Inst = I;
3106 }
3107 assert(!isInSchedulingRegion(SD) &&((!isInSchedulingRegion(SD) && "new ScheduleData already in scheduling region"
) ? static_cast<void> (0) : __assert_fail ("!isInSchedulingRegion(SD) && \"new ScheduleData already in scheduling region\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3108, __PRETTY_FUNCTION__))
3108 "new ScheduleData already in scheduling region")((!isInSchedulingRegion(SD) && "new ScheduleData already in scheduling region"
) ? static_cast<void> (0) : __assert_fail ("!isInSchedulingRegion(SD) && \"new ScheduleData already in scheduling region\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3108, __PRETTY_FUNCTION__))
;
3109 SD->init(SchedulingRegionID);
3110
3111 if (I->mayReadOrWriteMemory()) {
3112 // Update the linked list of memory accessing instructions.
3113 if (CurrentLoadStore) {
3114 CurrentLoadStore->NextLoadStore = SD;
3115 } else {
3116 FirstLoadStoreInRegion = SD;
3117 }
3118 CurrentLoadStore = SD;
3119 }
3120 }
3121 if (NextLoadStore) {
3122 if (CurrentLoadStore)
3123 CurrentLoadStore->NextLoadStore = NextLoadStore;
3124 } else {
3125 LastLoadStoreInRegion = CurrentLoadStore;
3126 }
3127}
3128
3129void BoUpSLP::BlockScheduling::calculateDependencies(ScheduleData *SD,
3130 bool InsertInReadyList,
3131 BoUpSLP *SLP) {
3132 assert(SD->isSchedulingEntity())((SD->isSchedulingEntity()) ? static_cast<void> (0) :
__assert_fail ("SD->isSchedulingEntity()", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3132, __PRETTY_FUNCTION__))
;
3133
3134 SmallVector<ScheduleData *, 10> WorkList;
3135 WorkList.push_back(SD);
3136
3137 while (!WorkList.empty()) {
3138 ScheduleData *SD = WorkList.back();
3139 WorkList.pop_back();
3140
3141 ScheduleData *BundleMember = SD;
3142 while (BundleMember) {
3143 assert(isInSchedulingRegion(BundleMember))((isInSchedulingRegion(BundleMember)) ? static_cast<void>
(0) : __assert_fail ("isInSchedulingRegion(BundleMember)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3143, __PRETTY_FUNCTION__))
;
3144 if (!BundleMember->hasValidDependencies()) {
3145
3146 DEBUG(dbgs() << "SLP: update deps of " << *BundleMember << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: update deps of " <<
*BundleMember << "\n"; } } while (false)
;
3147 BundleMember->Dependencies = 0;
3148 BundleMember->resetUnscheduledDeps();
3149
3150 // Handle def-use chain dependencies.
3151 for (User *U : BundleMember->Inst->users()) {
3152 if (isa<Instruction>(U)) {
3153 ScheduleData *UseSD = getScheduleData(U);
3154 if (UseSD && isInSchedulingRegion(UseSD->FirstInBundle)) {
3155 BundleMember->Dependencies++;
3156 ScheduleData *DestBundle = UseSD->FirstInBundle;
3157 if (!DestBundle->IsScheduled) {
3158 BundleMember->incrementUnscheduledDeps(1);
3159 }
3160 if (!DestBundle->hasValidDependencies()) {
3161 WorkList.push_back(DestBundle);
3162 }
3163 }
3164 } else {
3165 // I'm not sure if this can ever happen. But we need to be safe.
3166 // This lets the instruction/bundle never be scheduled and
3167 // eventually disable vectorization.
3168 BundleMember->Dependencies++;
3169 BundleMember->incrementUnscheduledDeps(1);
3170 }
3171 }
3172
3173 // Handle the memory dependencies.
3174 ScheduleData *DepDest = BundleMember->NextLoadStore;
3175 if (DepDest) {
3176 Instruction *SrcInst = BundleMember->Inst;
3177 MemoryLocation SrcLoc = getLocation(SrcInst, SLP->AA);
3178 bool SrcMayWrite = BundleMember->Inst->mayWriteToMemory();
3179 unsigned numAliased = 0;
3180 unsigned DistToSrc = 1;
3181
3182 while (DepDest) {
3183 assert(isInSchedulingRegion(DepDest))((isInSchedulingRegion(DepDest)) ? static_cast<void> (0
) : __assert_fail ("isInSchedulingRegion(DepDest)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3183, __PRETTY_FUNCTION__))
;
3184
3185 // We have two limits to reduce the complexity:
3186 // 1) AliasedCheckLimit: It's a small limit to reduce calls to
3187 // SLP->isAliased (which is the expensive part in this loop).
3188 // 2) MaxMemDepDistance: It's for very large blocks and it aborts
3189 // the whole loop (even if the loop is fast, it's quadratic).
3190 // It's important for the loop break condition (see below) to
3191 // check this limit even between two read-only instructions.
3192 if (DistToSrc >= MaxMemDepDistance ||
3193 ((SrcMayWrite || DepDest->Inst->mayWriteToMemory()) &&
3194 (numAliased >= AliasedCheckLimit ||
3195 SLP->isAliased(SrcLoc, SrcInst, DepDest->Inst)))) {
3196
3197 // We increment the counter only if the locations are aliased
3198 // (instead of counting all alias checks). This gives a better
3199 // balance between reduced runtime and accurate dependencies.
3200 numAliased++;
3201
3202 DepDest->MemoryDependencies.push_back(BundleMember);
3203 BundleMember->Dependencies++;
3204 ScheduleData *DestBundle = DepDest->FirstInBundle;
3205 if (!DestBundle->IsScheduled) {
3206 BundleMember->incrementUnscheduledDeps(1);
3207 }
3208 if (!DestBundle->hasValidDependencies()) {
3209 WorkList.push_back(DestBundle);
3210 }
3211 }
3212 DepDest = DepDest->NextLoadStore;
3213
3214 // Example, explaining the loop break condition: Let's assume our
3215 // starting instruction is i0 and MaxMemDepDistance = 3.
3216 //
3217 // +--------v--v--v
3218 // i0,i1,i2,i3,i4,i5,i6,i7,i8
3219 // +--------^--^--^
3220 //
3221 // MaxMemDepDistance let us stop alias-checking at i3 and we add
3222 // dependencies from i0 to i3,i4,.. (even if they are not aliased).
3223 // Previously we already added dependencies from i3 to i6,i7,i8
3224 // (because of MaxMemDepDistance). As we added a dependency from
3225 // i0 to i3, we have transitive dependencies from i0 to i6,i7,i8
3226 // and we can abort this loop at i6.
3227 if (DistToSrc >= 2 * MaxMemDepDistance)
3228 break;
3229 DistToSrc++;
3230 }
3231 }
3232 }
3233 BundleMember = BundleMember->NextInBundle;
3234 }
3235 if (InsertInReadyList && SD->isReady()) {
3236 ReadyInsts.push_back(SD);
3237 DEBUG(dbgs() << "SLP: gets ready on update: " << *SD->Inst << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: gets ready on update: " <<
*SD->Inst << "\n"; } } while (false)
;
3238 }
3239 }
3240}
3241
3242void BoUpSLP::BlockScheduling::resetSchedule() {
3243 assert(ScheduleStart &&((ScheduleStart && "tried to reset schedule on block which has not been scheduled"
) ? static_cast<void> (0) : __assert_fail ("ScheduleStart && \"tried to reset schedule on block which has not been scheduled\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3244, __PRETTY_FUNCTION__))
3244 "tried to reset schedule on block which has not been scheduled")((ScheduleStart && "tried to reset schedule on block which has not been scheduled"
) ? static_cast<void> (0) : __assert_fail ("ScheduleStart && \"tried to reset schedule on block which has not been scheduled\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3244, __PRETTY_FUNCTION__))
;
3245 for (Instruction *I = ScheduleStart; I != ScheduleEnd; I = I->getNextNode()) {
3246 ScheduleData *SD = getScheduleData(I);
3247 assert(isInSchedulingRegion(SD))((isInSchedulingRegion(SD)) ? static_cast<void> (0) : __assert_fail
("isInSchedulingRegion(SD)", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3247, __PRETTY_FUNCTION__))
;
3248 SD->IsScheduled = false;
3249 SD->resetUnscheduledDeps();
3250 }
3251 ReadyInsts.clear();
3252}
3253
3254void BoUpSLP::scheduleBlock(BlockScheduling *BS) {
3255
3256 if (!BS->ScheduleStart)
3257 return;
3258
3259 DEBUG(dbgs() << "SLP: schedule block " << BS->BB->getName() << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: schedule block " << BS
->BB->getName() << "\n"; } } while (false)
;
3260
3261 BS->resetSchedule();
3262
3263 // For the real scheduling we use a more sophisticated ready-list: it is
3264 // sorted by the original instruction location. This lets the final schedule
3265 // be as close as possible to the original instruction order.
3266 struct ScheduleDataCompare {
3267 bool operator()(ScheduleData *SD1, ScheduleData *SD2) const {
3268 return SD2->SchedulingPriority < SD1->SchedulingPriority;
3269 }
3270 };
3271 std::set<ScheduleData *, ScheduleDataCompare> ReadyInsts;
3272
3273 // Ensure that all dependency data is updated and fill the ready-list with
3274 // initial instructions.
3275 int Idx = 0;
3276 int NumToSchedule = 0;
3277 for (auto *I = BS->ScheduleStart; I != BS->ScheduleEnd;
3278 I = I->getNextNode()) {
3279 ScheduleData *SD = BS->getScheduleData(I);
3280 assert(((SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->
Inst) != 0) && "scheduler and vectorizer have different opinion on what is a bundle"
) ? static_cast<void> (0) : __assert_fail ("SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->Inst) != 0) && \"scheduler and vectorizer have different opinion on what is a bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3282, __PRETTY_FUNCTION__))
3281 SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->Inst) != 0) &&((SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->
Inst) != 0) && "scheduler and vectorizer have different opinion on what is a bundle"
) ? static_cast<void> (0) : __assert_fail ("SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->Inst) != 0) && \"scheduler and vectorizer have different opinion on what is a bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3282, __PRETTY_FUNCTION__))
3282 "scheduler and vectorizer have different opinion on what is a bundle")((SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->
Inst) != 0) && "scheduler and vectorizer have different opinion on what is a bundle"
) ? static_cast<void> (0) : __assert_fail ("SD->isPartOfBundle() == (ScalarToTreeEntry.count(SD->Inst) != 0) && \"scheduler and vectorizer have different opinion on what is a bundle\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3282, __PRETTY_FUNCTION__))
;
3283 SD->FirstInBundle->SchedulingPriority = Idx++;
3284 if (SD->isSchedulingEntity()) {
3285 BS->calculateDependencies(SD, false, this);
3286 NumToSchedule++;
3287 }
3288 }
3289 BS->initialFillReadyList(ReadyInsts);
3290
3291 Instruction *LastScheduledInst = BS->ScheduleEnd;
3292
3293 // Do the "real" scheduling.
3294 while (!ReadyInsts.empty()) {
3295 ScheduleData *picked = *ReadyInsts.begin();
3296 ReadyInsts.erase(ReadyInsts.begin());
3297
3298 // Move the scheduled instruction(s) to their dedicated places, if not
3299 // there yet.
3300 ScheduleData *BundleMember = picked;
3301 while (BundleMember) {
3302 Instruction *pickedInst = BundleMember->Inst;
3303 if (LastScheduledInst->getNextNode() != pickedInst) {
3304 BS->BB->getInstList().remove(pickedInst);
3305 BS->BB->getInstList().insert(LastScheduledInst->getIterator(),
3306 pickedInst);
3307 }
3308 LastScheduledInst = pickedInst;
3309 BundleMember = BundleMember->NextInBundle;
3310 }
3311
3312 BS->schedule(picked, ReadyInsts);
3313 NumToSchedule--;
3314 }
3315 assert(NumToSchedule == 0 && "could not schedule all instructions")((NumToSchedule == 0 && "could not schedule all instructions"
) ? static_cast<void> (0) : __assert_fail ("NumToSchedule == 0 && \"could not schedule all instructions\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3315, __PRETTY_FUNCTION__))
;
3316
3317 // Avoid duplicate scheduling of the block.
3318 BS->ScheduleStart = nullptr;
3319}
3320
3321unsigned BoUpSLP::getVectorElementSize(Value *V) {
3322 // If V is a store, just return the width of the stored value without
3323 // traversing the expression tree. This is the common case.
3324 if (auto *Store = dyn_cast<StoreInst>(V))
3325 return DL->getTypeSizeInBits(Store->getValueOperand()->getType());
3326
3327 // If V is not a store, we can traverse the expression tree to find loads
3328 // that feed it. The type of the loaded value may indicate a more suitable
3329 // width than V's type. We want to base the vector element size on the width
3330 // of memory operations where possible.
3331 SmallVector<Instruction *, 16> Worklist;
3332 SmallPtrSet<Instruction *, 16> Visited;
3333 if (auto *I = dyn_cast<Instruction>(V))
3334 Worklist.push_back(I);
3335
3336 // Traverse the expression tree in bottom-up order looking for loads. If we
3337 // encounter an instruciton we don't yet handle, we give up.
3338 auto MaxWidth = 0u;
3339 auto FoundUnknownInst = false;
3340 while (!Worklist.empty() && !FoundUnknownInst) {
3341 auto *I = Worklist.pop_back_val();
3342 Visited.insert(I);
3343
3344 // We should only be looking at scalar instructions here. If the current
3345 // instruction has a vector type, give up.
3346 auto *Ty = I->getType();
3347 if (isa<VectorType>(Ty))
3348 FoundUnknownInst = true;
3349
3350 // If the current instruction is a load, update MaxWidth to reflect the
3351 // width of the loaded value.
3352 else if (isa<LoadInst>(I))
3353 MaxWidth = std::max<unsigned>(MaxWidth, DL->getTypeSizeInBits(Ty));
3354
3355 // Otherwise, we need to visit the operands of the instruction. We only
3356 // handle the interesting cases from buildTree here. If an operand is an
3357 // instruction we haven't yet visited, we add it to the worklist.
3358 else if (isa<PHINode>(I) || isa<CastInst>(I) || isa<GetElementPtrInst>(I) ||
3359 isa<CmpInst>(I) || isa<SelectInst>(I) || isa<BinaryOperator>(I)) {
3360 for (Use &U : I->operands())
3361 if (auto *J = dyn_cast<Instruction>(U.get()))
3362 if (!Visited.count(J))
3363 Worklist.push_back(J);
3364 }
3365
3366 // If we don't yet handle the instruction, give up.
3367 else
3368 FoundUnknownInst = true;
3369 }
3370
3371 // If we didn't encounter a memory access in the expression tree, or if we
3372 // gave up for some reason, just return the width of V.
3373 if (!MaxWidth || FoundUnknownInst)
3374 return DL->getTypeSizeInBits(V->getType());
3375
3376 // Otherwise, return the maximum width we found.
3377 return MaxWidth;
3378}
3379
3380// Determine if a value V in a vectorizable expression Expr can be demoted to a
3381// smaller type with a truncation. We collect the values that will be demoted
3382// in ToDemote and additional roots that require investigating in Roots.
3383static bool collectValuesToDemote(Value *V, SmallPtrSetImpl<Value *> &Expr,
3384 SmallVectorImpl<Value *> &ToDemote,
3385 SmallVectorImpl<Value *> &Roots) {
3386
3387 // We can always demote constants.
3388 if (isa<Constant>(V)) {
3389 ToDemote.push_back(V);
3390 return true;
3391 }
3392
3393 // If the value is not an instruction in the expression with only one use, it
3394 // cannot be demoted.
3395 auto *I = dyn_cast<Instruction>(V);
3396 if (!I || !I->hasOneUse() || !Expr.count(I))
3397 return false;
3398
3399 switch (I->getOpcode()) {
3400
3401 // We can always demote truncations and extensions. Since truncations can
3402 // seed additional demotion, we save the truncated value.
3403 case Instruction::Trunc:
3404 Roots.push_back(I->getOperand(0));
3405 case Instruction::ZExt:
3406 case Instruction::SExt:
3407 break;
3408
3409 // We can demote certain binary operations if we can demote both of their
3410 // operands.
3411 case Instruction::Add:
3412 case Instruction::Sub:
3413 case Instruction::Mul:
3414 case Instruction::And:
3415 case Instruction::Or:
3416 case Instruction::Xor:
3417 if (!collectValuesToDemote(I->getOperand(0), Expr, ToDemote, Roots) ||
3418 !collectValuesToDemote(I->getOperand(1), Expr, ToDemote, Roots))
3419 return false;
3420 break;
3421
3422 // We can demote selects if we can demote their true and false values.
3423 case Instruction::Select: {
3424 SelectInst *SI = cast<SelectInst>(I);
3425 if (!collectValuesToDemote(SI->getTrueValue(), Expr, ToDemote, Roots) ||
3426 !collectValuesToDemote(SI->getFalseValue(), Expr, ToDemote, Roots))
3427 return false;
3428 break;
3429 }
3430
3431 // We can demote phis if we can demote all their incoming operands. Note that
3432 // we don't need to worry about cycles since we ensure single use above.
3433 case Instruction::PHI: {
3434 PHINode *PN = cast<PHINode>(I);
3435 for (Value *IncValue : PN->incoming_values())
3436 if (!collectValuesToDemote(IncValue, Expr, ToDemote, Roots))
3437 return false;
3438 break;
3439 }
3440
3441 // Otherwise, conservatively give up.
3442 default:
3443 return false;
3444 }
3445
3446 // Record the value that we can demote.
3447 ToDemote.push_back(V);
3448 return true;
3449}
3450
3451void BoUpSLP::computeMinimumValueSizes() {
3452 // If there are no external uses, the expression tree must be rooted by a
3453 // store. We can't demote in-memory values, so there is nothing to do here.
3454 if (ExternalUses.empty())
3455 return;
3456
3457 // We only attempt to truncate integer expressions.
3458 auto &TreeRoot = VectorizableTree[0].Scalars;
3459 auto *TreeRootIT = dyn_cast<IntegerType>(TreeRoot[0]->getType());
3460 if (!TreeRootIT)
3461 return;
3462
3463 // If the expression is not rooted by a store, these roots should have
3464 // external uses. We will rely on InstCombine to rewrite the expression in
3465 // the narrower type. However, InstCombine only rewrites single-use values.
3466 // This means that if a tree entry other than a root is used externally, it
3467 // must have multiple uses and InstCombine will not rewrite it. The code
3468 // below ensures that only the roots are used externally.
3469 SmallPtrSet<Value *, 32> Expr(TreeRoot.begin(), TreeRoot.end());
3470 for (auto &EU : ExternalUses)
3471 if (!Expr.erase(EU.Scalar))
3472 return;
3473 if (!Expr.empty())
3474 return;
3475
3476 // Collect the scalar values of the vectorizable expression. We will use this
3477 // context to determine which values can be demoted. If we see a truncation,
3478 // we mark it as seeding another demotion.
3479 for (auto &Entry : VectorizableTree)
3480 Expr.insert(Entry.Scalars.begin(), Entry.Scalars.end());
3481
3482 // Ensure the roots of the vectorizable tree don't form a cycle. They must
3483 // have a single external user that is not in the vectorizable tree.
3484 for (auto *Root : TreeRoot)
3485 if (!Root->hasOneUse() || Expr.count(*Root->user_begin()))
3486 return;
3487
3488 // Conservatively determine if we can actually truncate the roots of the
3489 // expression. Collect the values that can be demoted in ToDemote and
3490 // additional roots that require investigating in Roots.
3491 SmallVector<Value *, 32> ToDemote;
3492 SmallVector<Value *, 4> Roots;
3493 for (auto *Root : TreeRoot)
3494 if (!collectValuesToDemote(Root, Expr, ToDemote, Roots))
3495 return;
3496
3497 // The maximum bit width required to represent all the values that can be
3498 // demoted without loss of precision. It would be safe to truncate the roots
3499 // of the expression to this width.
3500 auto MaxBitWidth = 8u;
3501
3502 // We first check if all the bits of the roots are demanded. If they're not,
3503 // we can truncate the roots to this narrower type.
3504 for (auto *Root : TreeRoot) {
3505 auto Mask = DB->getDemandedBits(cast<Instruction>(Root));
3506 MaxBitWidth = std::max<unsigned>(
3507 Mask.getBitWidth() - Mask.countLeadingZeros(), MaxBitWidth);
3508 }
3509
3510 // True if the roots can be zero-extended back to their original type, rather
3511 // than sign-extended. We know that if the leading bits are not demanded, we
3512 // can safely zero-extend. So we initialize IsKnownPositive to True.
3513 bool IsKnownPositive = true;
3514
3515 // If all the bits of the roots are demanded, we can try a little harder to
3516 // compute a narrower type. This can happen, for example, if the roots are
3517 // getelementptr indices. InstCombine promotes these indices to the pointer
3518 // width. Thus, all their bits are technically demanded even though the
3519 // address computation might be vectorized in a smaller type.
3520 //
3521 // We start by looking at each entry that can be demoted. We compute the
3522 // maximum bit width required to store the scalar by using ValueTracking to
3523 // compute the number of high-order bits we can truncate.
3524 if (MaxBitWidth == DL->getTypeSizeInBits(TreeRoot[0]->getType())) {
3525 MaxBitWidth = 8u;
3526
3527 // Determine if the sign bit of all the roots is known to be zero. If not,
3528 // IsKnownPositive is set to False.
3529 IsKnownPositive = all_of(TreeRoot, [&](Value *R) {
3530 bool KnownZero = false;
3531 bool KnownOne = false;
3532 ComputeSignBit(R, KnownZero, KnownOne, *DL);
3533 return KnownZero;
3534 });
3535
3536 // Determine the maximum number of bits required to store the scalar
3537 // values.
3538 for (auto *Scalar : ToDemote) {
3539 auto NumSignBits = ComputeNumSignBits(Scalar, *DL, 0, AC, 0, DT);
3540 auto NumTypeBits = DL->getTypeSizeInBits(Scalar->getType());
3541 MaxBitWidth = std::max<unsigned>(NumTypeBits - NumSignBits, MaxBitWidth);
3542 }
3543
3544 // If we can't prove that the sign bit is zero, we must add one to the
3545 // maximum bit width to account for the unknown sign bit. This preserves
3546 // the existing sign bit so we can safely sign-extend the root back to the
3547 // original type. Otherwise, if we know the sign bit is zero, we will
3548 // zero-extend the root instead.
3549 //
3550 // FIXME: This is somewhat suboptimal, as there will be cases where adding
3551 // one to the maximum bit width will yield a larger-than-necessary
3552 // type. In general, we need to add an extra bit only if we can't
3553 // prove that the upper bit of the original type is equal to the
3554 // upper bit of the proposed smaller type. If these two bits are the
3555 // same (either zero or one) we know that sign-extending from the
3556 // smaller type will result in the same value. Here, since we can't
3557 // yet prove this, we are just making the proposed smaller type
3558 // larger to ensure correctness.
3559 if (!IsKnownPositive)
3560 ++MaxBitWidth;
3561 }
3562
3563 // Round MaxBitWidth up to the next power-of-two.
3564 if (!isPowerOf2_64(MaxBitWidth))
3565 MaxBitWidth = NextPowerOf2(MaxBitWidth);
3566
3567 // If the maximum bit width we compute is less than the with of the roots'
3568 // type, we can proceed with the narrowing. Otherwise, do nothing.
3569 if (MaxBitWidth >= TreeRootIT->getBitWidth())
3570 return;
3571
3572 // If we can truncate the root, we must collect additional values that might
3573 // be demoted as a result. That is, those seeded by truncations we will
3574 // modify.
3575 while (!Roots.empty())
3576 collectValuesToDemote(Roots.pop_back_val(), Expr, ToDemote, Roots);
3577
3578 // Finally, map the values we can demote to the maximum bit with we computed.
3579 for (auto *Scalar : ToDemote)
3580 MinBWs[Scalar] = std::make_pair(MaxBitWidth, !IsKnownPositive);
3581}
3582
3583namespace {
3584/// The SLPVectorizer Pass.
3585struct SLPVectorizer : public FunctionPass {
3586 SLPVectorizerPass Impl;
3587
3588 /// Pass identification, replacement for typeid
3589 static char ID;
3590
3591 explicit SLPVectorizer() : FunctionPass(ID) {
3592 initializeSLPVectorizerPass(*PassRegistry::getPassRegistry());
3593 }
3594
3595
3596 bool doInitialization(Module &M) override {
3597 return false;
3598 }
3599
3600 bool runOnFunction(Function &F) override {
3601 if (skipFunction(F))
3602 return false;
3603
3604 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE();
3605 auto *TTI = &getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
3606 auto *TLIP = getAnalysisIfAvailable<TargetLibraryInfoWrapperPass>();
3607 auto *TLI = TLIP ? &TLIP->getTLI() : nullptr;
3608 auto *AA = &getAnalysis<AAResultsWrapperPass>().getAAResults();
3609 auto *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
3610 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
3611 auto *AC = &getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);
3612 auto *DB = &getAnalysis<DemandedBitsWrapperPass>().getDemandedBits();
3613
3614 return Impl.runImpl(F, SE, TTI, TLI, AA, LI, DT, AC, DB);
3615 }
3616
3617 void getAnalysisUsage(AnalysisUsage &AU) const override {
3618 FunctionPass::getAnalysisUsage(AU);
3619 AU.addRequired<AssumptionCacheTracker>();
3620 AU.addRequired<ScalarEvolutionWrapperPass>();
3621 AU.addRequired<AAResultsWrapperPass>();
3622 AU.addRequired<TargetTransformInfoWrapperPass>();
3623 AU.addRequired<LoopInfoWrapperPass>();
3624 AU.addRequired<DominatorTreeWrapperPass>();
3625 AU.addRequired<DemandedBitsWrapperPass>();
3626 AU.addPreserved<LoopInfoWrapperPass>();
3627 AU.addPreserved<DominatorTreeWrapperPass>();
3628 AU.addPreserved<AAResultsWrapperPass>();
3629 AU.addPreserved<GlobalsAAWrapperPass>();
3630 AU.setPreservesCFG();
3631 }
3632};
3633} // end anonymous namespace
3634
3635PreservedAnalyses SLPVectorizerPass::run(Function &F, FunctionAnalysisManager &AM) {
3636 auto *SE = &AM.getResult<ScalarEvolutionAnalysis>(F);
3637 auto *TTI = &AM.getResult<TargetIRAnalysis>(F);
3638 auto *TLI = AM.getCachedResult<TargetLibraryAnalysis>(F);
3639 auto *AA = &AM.getResult<AAManager>(F);
3640 auto *LI = &AM.getResult<LoopAnalysis>(F);
3641 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F);
3642 auto *AC = &AM.getResult<AssumptionAnalysis>(F);
3643 auto *DB = &AM.getResult<DemandedBitsAnalysis>(F);
3644
3645 bool Changed = runImpl(F, SE, TTI, TLI, AA, LI, DT, AC, DB);
3646 if (!Changed)
3647 return PreservedAnalyses::all();
3648
3649 PreservedAnalyses PA;
3650 PA.preserveSet<CFGAnalyses>();
3651 PA.preserve<AAManager>();
3652 PA.preserve<GlobalsAA>();
3653 return PA;
3654}
3655
3656bool SLPVectorizerPass::runImpl(Function &F, ScalarEvolution *SE_,
3657 TargetTransformInfo *TTI_,
3658 TargetLibraryInfo *TLI_, AliasAnalysis *AA_,
3659 LoopInfo *LI_, DominatorTree *DT_,
3660 AssumptionCache *AC_, DemandedBits *DB_) {
3661 SE = SE_;
3662 TTI = TTI_;
3663 TLI = TLI_;
3664 AA = AA_;
3665 LI = LI_;
3666 DT = DT_;
3667 AC = AC_;
3668 DB = DB_;
3669 DL = &F.getParent()->getDataLayout();
3670
3671 Stores.clear();
3672 GEPs.clear();
3673 bool Changed = false;
3674
3675 // If the target claims to have no vector registers don't attempt
3676 // vectorization.
3677 if (!TTI->getNumberOfRegisters(true))
3678 return false;
3679
3680 // Don't vectorize when the attribute NoImplicitFloat is used.
3681 if (F.hasFnAttribute(Attribute::NoImplicitFloat))
3682 return false;
3683
3684 DEBUG(dbgs() << "SLP: Analyzing blocks in " << F.getName() << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing blocks in " <<
F.getName() << ".\n"; } } while (false)
;
3685
3686 // Use the bottom up slp vectorizer to construct chains that start with
3687 // store instructions.
3688 BoUpSLP R(&F, SE, TTI, TLI, AA, LI, DT, AC, DB, DL);
3689
3690 // A general note: the vectorizer must use BoUpSLP::eraseInstruction() to
3691 // delete instructions.
3692
3693 // Scan the blocks in the function in post order.
3694 for (auto BB : post_order(&F.getEntryBlock())) {
3695 collectSeedInstructions(BB);
3696
3697 // Vectorize trees that end at stores.
3698 if (!Stores.empty()) {
3699 DEBUG(dbgs() << "SLP: Found stores for " << Stores.size()do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Found stores for " << Stores
.size() << " underlying objects.\n"; } } while (false)
3700 << " underlying objects.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Found stores for " << Stores
.size() << " underlying objects.\n"; } } while (false)
;
3701 Changed |= vectorizeStoreChains(R);
3702 }
3703
3704 // Vectorize trees that end at reductions.
3705 Changed |= vectorizeChainsInBlock(BB, R);
3706
3707 // Vectorize the index computations of getelementptr instructions. This
3708 // is primarily intended to catch gather-like idioms ending at
3709 // non-consecutive loads.
3710 if (!GEPs.empty()) {
3711 DEBUG(dbgs() << "SLP: Found GEPs for " << GEPs.size()do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Found GEPs for " << GEPs
.size() << " underlying objects.\n"; } } while (false)
3712 << " underlying objects.\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Found GEPs for " << GEPs
.size() << " underlying objects.\n"; } } while (false)
;
3713 Changed |= vectorizeGEPIndices(BB, R);
3714 }
3715 }
3716
3717 if (Changed) {
3718 R.optimizeGatherSequence();
3719 DEBUG(dbgs() << "SLP: vectorized \"" << F.getName() << "\"\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: vectorized \"" << F.getName
() << "\"\n"; } } while (false)
;
3720 DEBUG(verifyFunction(F))do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { verifyFunction(F); } } while (false)
;
3721 }
3722 return Changed;
3723}
3724
3725/// \brief Check that the Values in the slice in VL array are still existent in
3726/// the WeakVH array.
3727/// Vectorization of part of the VL array may cause later values in the VL array
3728/// to become invalid. We track when this has happened in the WeakVH array.
3729static bool hasValueBeenRAUWed(ArrayRef<Value *> VL, ArrayRef<WeakVH> VH,
3730 unsigned SliceBegin, unsigned SliceSize) {
3731 VL = VL.slice(SliceBegin, SliceSize);
3732 VH = VH.slice(SliceBegin, SliceSize);
3733 return !std::equal(VL.begin(), VL.end(), VH.begin());
3734}
3735
3736bool SLPVectorizerPass::vectorizeStoreChain(ArrayRef<Value *> Chain, BoUpSLP &R,
3737 unsigned VecRegSize) {
3738 unsigned ChainLen = Chain.size();
3739 DEBUG(dbgs() << "SLP: Analyzing a store chain of length " << ChainLendo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a store chain of length "
<< ChainLen << "\n"; } } while (false)
3740 << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a store chain of length "
<< ChainLen << "\n"; } } while (false)
;
3741 unsigned Sz = R.getVectorElementSize(Chain[0]);
3742 unsigned VF = VecRegSize / Sz;
3743
3744 if (!isPowerOf2_32(Sz) || VF < 2)
3745 return false;
3746
3747 // Keep track of values that were deleted by vectorizing in the loop below.
3748 SmallVector<WeakVH, 8> TrackValues(Chain.begin(), Chain.end());
3749
3750 bool Changed = false;
3751 // Look for profitable vectorizable trees at all offsets, starting at zero.
3752 for (unsigned i = 0, e = ChainLen; i < e; ++i) {
3753 if (i + VF > e)
3754 break;
3755
3756 // Check that a previous iteration of this loop did not delete the Value.
3757 if (hasValueBeenRAUWed(Chain, TrackValues, i, VF))
3758 continue;
3759
3760 DEBUG(dbgs() << "SLP: Analyzing " << VF << " stores at offset " << ido { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing " << VF <<
" stores at offset " << i << "\n"; } } while (false
)
3761 << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing " << VF <<
" stores at offset " << i << "\n"; } } while (false
)
;
3762 ArrayRef<Value *> Operands = Chain.slice(i, VF);
3763
3764 R.buildTree(Operands);
3765 if (R.isTreeTinyAndNotFullyVectorizable())
3766 continue;
3767
3768 R.computeMinimumValueSizes();
3769
3770 int Cost = R.getTreeCost();
3771
3772 DEBUG(dbgs() << "SLP: Found cost=" << Cost << " for VF=" << VF << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Found cost=" << Cost <<
" for VF=" << VF << "\n"; } } while (false)
;
3773 if (Cost < -SLPCostThreshold) {
3774 DEBUG(dbgs() << "SLP: Decided to vectorize cost=" << Cost << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Decided to vectorize cost=" <<
Cost << "\n"; } } while (false)
;
3775 R.vectorizeTree();
3776
3777 // Move to the next bundle.
3778 i += VF - 1;
3779 Changed = true;
3780 }
3781 }
3782
3783 return Changed;
3784}
3785
3786bool SLPVectorizerPass::vectorizeStores(ArrayRef<StoreInst *> Stores,
3787 BoUpSLP &R) {
3788 SetVector<StoreInst *> Heads, Tails;
3789 SmallDenseMap<StoreInst *, StoreInst *> ConsecutiveChain;
3790
3791 // We may run into multiple chains that merge into a single chain. We mark the
3792 // stores that we vectorized so that we don't visit the same store twice.
3793 BoUpSLP::ValueSet VectorizedStores;
3794 bool Changed = false;
3795
3796 // Do a quadratic search on all of the given stores and find
3797 // all of the pairs of stores that follow each other.
3798 SmallVector<unsigned, 16> IndexQueue;
3799 for (unsigned i = 0, e = Stores.size(); i < e; ++i) {
3800 IndexQueue.clear();
3801 // If a store has multiple consecutive store candidates, search Stores
3802 // array according to the sequence: from i+1 to e, then from i-1 to 0.
3803 // This is because usually pairing with immediate succeeding or preceding
3804 // candidate create the best chance to find slp vectorization opportunity.
3805 unsigned j = 0;
3806 for (j = i + 1; j < e; ++j)
3807 IndexQueue.push_back(j);
3808 for (j = i; j > 0; --j)
3809 IndexQueue.push_back(j - 1);
3810
3811 for (auto &k : IndexQueue) {
3812 if (isConsecutiveAccess(Stores[i], Stores[k], *DL, *SE)) {
3813 Tails.insert(Stores[k]);
3814 Heads.insert(Stores[i]);
3815 ConsecutiveChain[Stores[i]] = Stores[k];
3816 break;
3817 }
3818 }
3819 }
3820
3821 // For stores that start but don't end a link in the chain:
3822 for (SetVector<StoreInst *>::iterator it = Heads.begin(), e = Heads.end();
3823 it != e; ++it) {
3824 if (Tails.count(*it))
3825 continue;
3826
3827 // We found a store instr that starts a chain. Now follow the chain and try
3828 // to vectorize it.
3829 BoUpSLP::ValueList Operands;
3830 StoreInst *I = *it;
3831 // Collect the chain into a list.
3832 while (Tails.count(I) || Heads.count(I)) {
3833 if (VectorizedStores.count(I))
3834 break;
3835 Operands.push_back(I);
3836 // Move to the next value in the chain.
3837 I = ConsecutiveChain[I];
3838 }
3839
3840 // FIXME: Is division-by-2 the correct step? Should we assert that the
3841 // register size is a power-of-2?
3842 for (unsigned Size = R.getMaxVecRegSize(); Size >= R.getMinVecRegSize();
3843 Size /= 2) {
3844 if (vectorizeStoreChain(Operands, R, Size)) {
3845 // Mark the vectorized stores so that we don't vectorize them again.
3846 VectorizedStores.insert(Operands.begin(), Operands.end());
3847 Changed = true;
3848 break;
3849 }
3850 }
3851 }
3852
3853 return Changed;
3854}
3855
3856void SLPVectorizerPass::collectSeedInstructions(BasicBlock *BB) {
3857
3858 // Initialize the collections. We will make a single pass over the block.
3859 Stores.clear();
3860 GEPs.clear();
3861
3862 // Visit the store and getelementptr instructions in BB and organize them in
3863 // Stores and GEPs according to the underlying objects of their pointer
3864 // operands.
3865 for (Instruction &I : *BB) {
3866
3867 // Ignore store instructions that are volatile or have a pointer operand
3868 // that doesn't point to a scalar type.
3869 if (auto *SI = dyn_cast<StoreInst>(&I)) {
3870 if (!SI->isSimple())
3871 continue;
3872 if (!isValidElementType(SI->getValueOperand()->getType()))
3873 continue;
3874 Stores[GetUnderlyingObject(SI->getPointerOperand(), *DL)].push_back(SI);
3875 }
3876
3877 // Ignore getelementptr instructions that have more than one index, a
3878 // constant index, or a pointer operand that doesn't point to a scalar
3879 // type.
3880 else if (auto *GEP = dyn_cast<GetElementPtrInst>(&I)) {
3881 auto Idx = GEP->idx_begin()->get();
3882 if (GEP->getNumIndices() > 1 || isa<Constant>(Idx))
3883 continue;
3884 if (!isValidElementType(Idx->getType()))
3885 continue;
3886 if (GEP->getType()->isVectorTy())
3887 continue;
3888 GEPs[GetUnderlyingObject(GEP->getPointerOperand(), *DL)].push_back(GEP);
3889 }
3890 }
3891}
3892
3893bool SLPVectorizerPass::tryToVectorizePair(Value *A, Value *B, BoUpSLP &R) {
3894 if (!A || !B)
3895 return false;
3896 Value *VL[] = { A, B };
3897 return tryToVectorizeList(VL, R, None, true);
3898}
3899
3900bool SLPVectorizerPass::tryToVectorizeList(ArrayRef<Value *> VL, BoUpSLP &R,
3901 ArrayRef<Value *> BuildVector,
3902 bool AllowReorder) {
3903 if (VL.size() < 2)
3904 return false;
3905
3906 DEBUG(dbgs() << "SLP: Trying to vectorize a list of length = " << VL.size()do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Trying to vectorize a list of length = "
<< VL.size() << ".\n"; } } while (false)
3907 << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Trying to vectorize a list of length = "
<< VL.size() << ".\n"; } } while (false)
;
3908
3909 // Check that all of the parts are scalar instructions of the same type.
3910 Instruction *I0 = dyn_cast<Instruction>(VL[0]);
3911 if (!I0)
3912 return false;
3913
3914 unsigned Opcode0 = I0->getOpcode();
3915
3916 unsigned Sz = R.getVectorElementSize(I0);
3917 unsigned MinVF = std::max(2U, R.getMinVecRegSize() / Sz);
3918 unsigned MaxVF = std::max<unsigned>(PowerOf2Floor(VL.size()), MinVF);
3919 if (MaxVF < 2)
3920 return false;
3921
3922 for (Value *V : VL) {
3923 Type *Ty = V->getType();
3924 if (!isValidElementType(Ty))
3925 return false;
3926 Instruction *Inst = dyn_cast<Instruction>(V);
3927 if (!Inst || Inst->getOpcode() != Opcode0)
3928 return false;
3929 }
3930
3931 bool Changed = false;
3932
3933 // Keep track of values that were deleted by vectorizing in the loop below.
3934 SmallVector<WeakVH, 8> TrackValues(VL.begin(), VL.end());
3935
3936 unsigned NextInst = 0, MaxInst = VL.size();
3937 for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF;
3938 VF /= 2) {
3939 // No actual vectorization should happen, if number of parts is the same as
3940 // provided vectorization factor (i.e. the scalar type is used for vector
3941 // code during codegen).
3942 auto *VecTy = VectorType::get(VL[0]->getType(), VF);
3943 if (TTI->getNumberOfParts(VecTy) == VF)
3944 continue;
3945 for (unsigned I = NextInst; I < MaxInst; ++I) {
3946 unsigned OpsWidth = 0;
3947
3948 if (I + VF > MaxInst)
3949 OpsWidth = MaxInst - I;
3950 else
3951 OpsWidth = VF;
3952
3953 if (!isPowerOf2_32(OpsWidth) || OpsWidth < 2)
3954 break;
3955
3956 // Check that a previous iteration of this loop did not delete the Value.
3957 if (hasValueBeenRAUWed(VL, TrackValues, I, OpsWidth))
3958 continue;
3959
3960 DEBUG(dbgs() << "SLP: Analyzing " << OpsWidth << " operations "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing " << OpsWidth
<< " operations " << "\n"; } } while (false)
3961 << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing " << OpsWidth
<< " operations " << "\n"; } } while (false)
;
3962 ArrayRef<Value *> Ops = VL.slice(I, OpsWidth);
3963
3964 ArrayRef<Value *> BuildVectorSlice;
3965 if (!BuildVector.empty())
3966 BuildVectorSlice = BuildVector.slice(I, OpsWidth);
3967
3968 R.buildTree(Ops, BuildVectorSlice);
3969 // TODO: check if we can allow reordering for more cases.
3970 if (AllowReorder && R.shouldReorder()) {
3971 // Conceptually, there is nothing actually preventing us from trying to
3972 // reorder a larger list. In fact, we do exactly this when vectorizing
3973 // reductions. However, at this point, we only expect to get here from
3974 // tryToVectorizePair().
3975 assert(Ops.size() == 2)((Ops.size() == 2) ? static_cast<void> (0) : __assert_fail
("Ops.size() == 2", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3975, __PRETTY_FUNCTION__))
;
3976 assert(BuildVectorSlice.empty())((BuildVectorSlice.empty()) ? static_cast<void> (0) : __assert_fail
("BuildVectorSlice.empty()", "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 3976, __PRETTY_FUNCTION__))
;
3977 Value *ReorderedOps[] = {Ops[1], Ops[0]};
3978 R.buildTree(ReorderedOps, None);
3979 }
3980 if (R.isTreeTinyAndNotFullyVectorizable())
3981 continue;
3982
3983 R.computeMinimumValueSizes();
3984 int Cost = R.getTreeCost();
3985
3986 if (Cost < -SLPCostThreshold) {
3987 DEBUG(dbgs() << "SLP: Vectorizing list at cost:" << Cost << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Vectorizing list at cost:" <<
Cost << ".\n"; } } while (false)
;
3988 Value *VectorizedRoot = R.vectorizeTree();
3989
3990 // Reconstruct the build vector by extracting the vectorized root. This
3991 // way we handle the case where some elements of the vector are
3992 // undefined.
3993 // (return (inserelt <4 xi32> (insertelt undef (opd0) 0) (opd1) 2))
3994 if (!BuildVectorSlice.empty()) {
3995 // The insert point is the last build vector instruction. The
3996 // vectorized root will precede it. This guarantees that we get an
3997 // instruction. The vectorized tree could have been constant folded.
3998 Instruction *InsertAfter = cast<Instruction>(BuildVectorSlice.back());
3999 unsigned VecIdx = 0;
4000 for (auto &V : BuildVectorSlice) {
4001 IRBuilder<NoFolder> Builder(InsertAfter->getParent(),
4002 ++BasicBlock::iterator(InsertAfter));
4003 Instruction *I = cast<Instruction>(V);
4004 assert(isa<InsertElementInst>(I) || isa<InsertValueInst>(I))((isa<InsertElementInst>(I) || isa<InsertValueInst>
(I)) ? static_cast<void> (0) : __assert_fail ("isa<InsertElementInst>(I) || isa<InsertValueInst>(I)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4004, __PRETTY_FUNCTION__))
;
4005 Instruction *Extract =
4006 cast<Instruction>(Builder.CreateExtractElement(
4007 VectorizedRoot, Builder.getInt32(VecIdx++)));
4008 I->setOperand(1, Extract);
4009 I->removeFromParent();
4010 I->insertAfter(Extract);
4011 InsertAfter = I;
4012 }
4013 }
4014 // Move to the next bundle.
4015 I += VF - 1;
4016 NextInst = I + 1;
4017 Changed = true;
4018 }
4019 }
4020 }
4021
4022 return Changed;
4023}
4024
4025bool SLPVectorizerPass::tryToVectorize(BinaryOperator *V, BoUpSLP &R) {
4026 if (!V)
4027 return false;
4028
4029 Value *P = V->getParent();
4030
4031 // Vectorize in current basic block only.
4032 auto *Op0 = dyn_cast<Instruction>(V->getOperand(0));
4033 auto *Op1 = dyn_cast<Instruction>(V->getOperand(1));
4034 if (!Op0 || !Op1 || Op0->getParent() != P || Op1->getParent() != P)
4035 return false;
4036
4037 // Try to vectorize V.
4038 if (tryToVectorizePair(Op0, Op1, R))
4039 return true;
4040
4041 auto *A = dyn_cast<BinaryOperator>(Op0);
4042 auto *B = dyn_cast<BinaryOperator>(Op1);
4043 // Try to skip B.
4044 if (B && B->hasOneUse()) {
4045 auto *B0 = dyn_cast<BinaryOperator>(B->getOperand(0));
4046 auto *B1 = dyn_cast<BinaryOperator>(B->getOperand(1));
4047 if (B0 && B0->getParent() == P && tryToVectorizePair(A, B0, R))
4048 return true;
4049 if (B1 && B1->getParent() == P && tryToVectorizePair(A, B1, R))
4050 return true;
4051 }
4052
4053 // Try to skip A.
4054 if (A && A->hasOneUse()) {
4055 auto *A0 = dyn_cast<BinaryOperator>(A->getOperand(0));
4056 auto *A1 = dyn_cast<BinaryOperator>(A->getOperand(1));
4057 if (A0 && A0->getParent() == P && tryToVectorizePair(A0, B, R))
4058 return true;
4059 if (A1 && A1->getParent() == P && tryToVectorizePair(A1, B, R))
4060 return true;
4061 }
4062 return false;
4063}
4064
4065/// \brief Generate a shuffle mask to be used in a reduction tree.
4066///
4067/// \param VecLen The length of the vector to be reduced.
4068/// \param NumEltsToRdx The number of elements that should be reduced in the
4069/// vector.
4070/// \param IsPairwise Whether the reduction is a pairwise or splitting
4071/// reduction. A pairwise reduction will generate a mask of
4072/// <0,2,...> or <1,3,..> while a splitting reduction will generate
4073/// <2,3, undef,undef> for a vector of 4 and NumElts = 2.
4074/// \param IsLeft True will generate a mask of even elements, odd otherwise.
4075static Value *createRdxShuffleMask(unsigned VecLen, unsigned NumEltsToRdx,
4076 bool IsPairwise, bool IsLeft,
4077 IRBuilder<> &Builder) {
4078 assert((IsPairwise || !IsLeft) && "Don't support a <0,1,undef,...> mask")(((IsPairwise || !IsLeft) && "Don't support a <0,1,undef,...> mask"
) ? static_cast<void> (0) : __assert_fail ("(IsPairwise || !IsLeft) && \"Don't support a <0,1,undef,...> mask\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4078, __PRETTY_FUNCTION__))
;
4079
4080 SmallVector<Constant *, 32> ShuffleMask(
4081 VecLen, UndefValue::get(Builder.getInt32Ty()));
4082
4083 if (IsPairwise)
4084 // Build a mask of 0, 2, ... (left) or 1, 3, ... (right).
4085 for (unsigned i = 0; i != NumEltsToRdx; ++i)
4086 ShuffleMask[i] = Builder.getInt32(2 * i + !IsLeft);
4087 else
4088 // Move the upper half of the vector to the lower half.
4089 for (unsigned i = 0; i != NumEltsToRdx; ++i)
4090 ShuffleMask[i] = Builder.getInt32(NumEltsToRdx + i);
4091
4092 return ConstantVector::get(ShuffleMask);
4093}
4094
4095namespace {
4096/// Model horizontal reductions.
4097///
4098/// A horizontal reduction is a tree of reduction operations (currently add and
4099/// fadd) that has operations that can be put into a vector as its leaf.
4100/// For example, this tree:
4101///
4102/// mul mul mul mul
4103/// \ / \ /
4104/// + +
4105/// \ /
4106/// +
4107/// This tree has "mul" as its reduced values and "+" as its reduction
4108/// operations. A reduction might be feeding into a store or a binary operation
4109/// feeding a phi.
4110/// ...
4111/// \ /
4112/// +
4113/// |
4114/// phi +=
4115///
4116/// Or:
4117/// ...
4118/// \ /
4119/// +
4120/// |
4121/// *p =
4122///
4123class HorizontalReduction {
4124 SmallVector<Value *, 16> ReductionOps;
4125 SmallVector<Value *, 32> ReducedVals;
4126
4127 BinaryOperator *ReductionRoot;
4128 // After successfull horizontal reduction vectorization attempt for PHI node
4129 // vectorizer tries to update root binary op by combining vectorized tree and
4130 // the ReductionPHI node. But during vectorization this ReductionPHI can be
4131 // vectorized itself and replaced by the undef value, while the instruction
4132 // itself is marked for deletion. This 'marked for deletion' PHI node then can
4133 // be used in new binary operation, causing "Use still stuck around after Def
4134 // is destroyed" crash upon PHI node deletion.
4135 WeakVH ReductionPHI;
4136
4137 /// The opcode of the reduction.
4138 Instruction::BinaryOps ReductionOpcode;
4139 /// The opcode of the values we perform a reduction on.
4140 unsigned ReducedValueOpcode;
4141 /// Should we model this reduction as a pairwise reduction tree or a tree that
4142 /// splits the vector in halves and adds those halves.
4143 bool IsPairwiseReduction;
4144
4145public:
4146 /// The width of one full horizontal reduction operation.
4147 unsigned ReduxWidth;
4148
4149 /// Minimal width of available vector registers. It's used to determine
4150 /// ReduxWidth.
4151 unsigned MinVecRegSize;
4152
4153 HorizontalReduction(unsigned MinVecRegSize)
4154 : ReductionRoot(nullptr), ReductionOpcode(Instruction::BinaryOpsEnd),
4155 ReducedValueOpcode(0), IsPairwiseReduction(false), ReduxWidth(0),
4156 MinVecRegSize(MinVecRegSize) {}
4157
4158 /// \brief Try to find a reduction tree.
4159 bool matchAssociativeReduction(PHINode *Phi, BinaryOperator *B) {
4160 assert((!Phi || is_contained(Phi->operands(), B)) &&(((!Phi || is_contained(Phi->operands(), B)) && "Thi phi needs to use the binary operator"
) ? static_cast<void> (0) : __assert_fail ("(!Phi || is_contained(Phi->operands(), B)) && \"Thi phi needs to use the binary operator\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4161, __PRETTY_FUNCTION__))
4161 "Thi phi needs to use the binary operator")(((!Phi || is_contained(Phi->operands(), B)) && "Thi phi needs to use the binary operator"
) ? static_cast<void> (0) : __assert_fail ("(!Phi || is_contained(Phi->operands(), B)) && \"Thi phi needs to use the binary operator\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4161, __PRETTY_FUNCTION__))
;
4162
4163 // We could have a initial reductions that is not an add.
4164 // r *= v1 + v2 + v3 + v4
4165 // In such a case start looking for a tree rooted in the first '+'.
4166 if (Phi) {
4167 if (B->getOperand(0) == Phi) {
4168 Phi = nullptr;
4169 B = dyn_cast<BinaryOperator>(B->getOperand(1));
4170 } else if (B->getOperand(1) == Phi) {
4171 Phi = nullptr;
4172 B = dyn_cast<BinaryOperator>(B->getOperand(0));
4173 }
4174 }
4175
4176 if (!B)
4177 return false;
4178
4179 Type *Ty = B->getType();
4180 if (!isValidElementType(Ty))
4181 return false;
4182
4183 const DataLayout &DL = B->getModule()->getDataLayout();
4184 ReductionOpcode = B->getOpcode();
4185 ReducedValueOpcode = 0;
4186 // FIXME: Register size should be a parameter to this function, so we can
4187 // try different vectorization factors.
4188 ReduxWidth = MinVecRegSize / DL.getTypeSizeInBits(Ty);
4189 ReductionRoot = B;
4190 ReductionPHI = Phi;
4191
4192 if (ReduxWidth < 4)
4193 return false;
4194
4195 // We currently only support adds.
4196 if (ReductionOpcode != Instruction::Add &&
4197 ReductionOpcode != Instruction::FAdd)
4198 return false;
4199
4200 // Post order traverse the reduction tree starting at B. We only handle true
4201 // trees containing only binary operators or selects.
4202 SmallVector<std::pair<Instruction *, unsigned>, 32> Stack;
4203 Stack.push_back(std::make_pair(B, 0));
4204 while (!Stack.empty()) {
4205 Instruction *TreeN = Stack.back().first;
4206 unsigned EdgeToVist = Stack.back().second++;
4207 bool IsReducedValue = TreeN->getOpcode() != ReductionOpcode;
4208
4209 // Only handle trees in the current basic block.
4210 if (TreeN->getParent() != B->getParent())
4211 return false;
4212
4213 // Each tree node needs to have one user except for the ultimate
4214 // reduction.
4215 if (!TreeN->hasOneUse() && TreeN != B)
4216 return false;
4217
4218 // Postorder vist.
4219 if (EdgeToVist == 2 || IsReducedValue) {
4220 if (IsReducedValue) {
4221 // Make sure that the opcodes of the operations that we are going to
4222 // reduce match.
4223 if (!ReducedValueOpcode)
4224 ReducedValueOpcode = TreeN->getOpcode();
4225 else if (ReducedValueOpcode != TreeN->getOpcode())
4226 return false;
4227 ReducedVals.push_back(TreeN);
4228 } else {
4229 // We need to be able to reassociate the adds.
4230 if (!TreeN->isAssociative())
4231 return false;
4232 ReductionOps.push_back(TreeN);
4233 }
4234 // Retract.
4235 Stack.pop_back();
4236 continue;
4237 }
4238
4239 // Visit left or right.
4240 Value *NextV = TreeN->getOperand(EdgeToVist);
4241 if (NextV != Phi) {
4242 auto *I = dyn_cast<Instruction>(NextV);
4243 // Continue analysis if the next operand is a reduction operation or
4244 // (possibly) a reduced value. If the reduced value opcode is not set,
4245 // the first met operation != reduction operation is considered as the
4246 // reduced value class.
4247 if (I && (!ReducedValueOpcode || I->getOpcode() == ReducedValueOpcode ||
4248 I->getOpcode() == ReductionOpcode)) {
4249 if (!ReducedValueOpcode && I->getOpcode() != ReductionOpcode)
4250 ReducedValueOpcode = I->getOpcode();
4251 Stack.push_back(std::make_pair(I, 0));
4252 continue;
4253 }
4254 return false;
4255 }
4256 }
4257 return true;
4258 }
4259
4260 /// \brief Attempt to vectorize the tree found by
4261 /// matchAssociativeReduction.
4262 bool tryToReduce(BoUpSLP &V, TargetTransformInfo *TTI) {
4263 if (ReducedVals.empty())
4264 return false;
4265
4266 unsigned NumReducedVals = ReducedVals.size();
4267 if (NumReducedVals < ReduxWidth)
4268 return false;
4269
4270 Value *VectorizedTree = nullptr;
4271 IRBuilder<> Builder(ReductionRoot);
4272 FastMathFlags Unsafe;
4273 Unsafe.setUnsafeAlgebra();
4274 Builder.setFastMathFlags(Unsafe);
4275 unsigned i = 0;
4276
4277 for (; i < NumReducedVals - ReduxWidth + 1; i += ReduxWidth) {
4278 auto VL = makeArrayRef(&ReducedVals[i], ReduxWidth);
4279 V.buildTree(VL, ReductionOps);
4280 if (V.shouldReorder()) {
4281 SmallVector<Value *, 8> Reversed(VL.rbegin(), VL.rend());
4282 V.buildTree(Reversed, ReductionOps);
4283 }
4284 if (V.isTreeTinyAndNotFullyVectorizable())
4285 continue;
4286
4287 V.computeMinimumValueSizes();
4288
4289 // Estimate cost.
4290 int Cost = V.getTreeCost() + getReductionCost(TTI, ReducedVals[i]);
4291 if (Cost >= -SLPCostThreshold)
4292 break;
4293
4294 DEBUG(dbgs() << "SLP: Vectorizing horizontal reduction at cost:" << Costdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Vectorizing horizontal reduction at cost:"
<< Cost << ". (HorRdx)\n"; } } while (false)
4295 << ". (HorRdx)\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Vectorizing horizontal reduction at cost:"
<< Cost << ". (HorRdx)\n"; } } while (false)
;
4296
4297 // Vectorize a tree.
4298 DebugLoc Loc = cast<Instruction>(ReducedVals[i])->getDebugLoc();
4299 Value *VectorizedRoot = V.vectorizeTree();
4300
4301 // Emit a reduction.
4302 Value *ReducedSubTree = emitReduction(VectorizedRoot, Builder);
4303 if (VectorizedTree) {
4304 Builder.SetCurrentDebugLocation(Loc);
4305 VectorizedTree = Builder.CreateBinOp(ReductionOpcode, VectorizedTree,
4306 ReducedSubTree, "bin.rdx");
4307 } else
4308 VectorizedTree = ReducedSubTree;
4309 }
4310
4311 if (VectorizedTree) {
4312 // Finish the reduction.
4313 for (; i < NumReducedVals; ++i) {
4314 Builder.SetCurrentDebugLocation(
4315 cast<Instruction>(ReducedVals[i])->getDebugLoc());
4316 VectorizedTree = Builder.CreateBinOp(ReductionOpcode, VectorizedTree,
4317 ReducedVals[i]);
4318 }
4319 // Update users.
4320 if (ReductionPHI && !isa<UndefValue>(ReductionPHI)) {
4321 assert(ReductionRoot && "Need a reduction operation")((ReductionRoot && "Need a reduction operation") ? static_cast
<void> (0) : __assert_fail ("ReductionRoot && \"Need a reduction operation\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4321, __PRETTY_FUNCTION__))
;
4322 ReductionRoot->setOperand(0, VectorizedTree);
4323 ReductionRoot->setOperand(1, ReductionPHI);
4324 } else
4325 ReductionRoot->replaceAllUsesWith(VectorizedTree);
4326 }
4327 return VectorizedTree != nullptr;
4328 }
4329
4330 unsigned numReductionValues() const {
4331 return ReducedVals.size();
4332 }
4333
4334private:
4335 /// \brief Calculate the cost of a reduction.
4336 int getReductionCost(TargetTransformInfo *TTI, Value *FirstReducedVal) {
4337 Type *ScalarTy = FirstReducedVal->getType();
4338 Type *VecTy = VectorType::get(ScalarTy, ReduxWidth);
4339
4340 int PairwiseRdxCost = TTI->getReductionCost(ReductionOpcode, VecTy, true);
4341 int SplittingRdxCost = TTI->getReductionCost(ReductionOpcode, VecTy, false);
4342
4343 IsPairwiseReduction = PairwiseRdxCost < SplittingRdxCost;
4344 int VecReduxCost = IsPairwiseReduction ? PairwiseRdxCost : SplittingRdxCost;
4345
4346 int ScalarReduxCost =
4347 (ReduxWidth - 1) *
4348 TTI->getArithmeticInstrCost(ReductionOpcode, ScalarTy);
4349
4350 DEBUG(dbgs() << "SLP: Adding cost " << VecReduxCost - ScalarReduxCostdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << VecReduxCost
- ScalarReduxCost << " for reduction that starts with "
<< *FirstReducedVal << " (It is a " << (IsPairwiseReduction
? "pairwise" : "splitting") << " reduction)\n"; } } while
(false)
4351 << " for reduction that starts with " << *FirstReducedValdo { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << VecReduxCost
- ScalarReduxCost << " for reduction that starts with "
<< *FirstReducedVal << " (It is a " << (IsPairwiseReduction
? "pairwise" : "splitting") << " reduction)\n"; } } while
(false)
4352 << " (It is a "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << VecReduxCost
- ScalarReduxCost << " for reduction that starts with "
<< *FirstReducedVal << " (It is a " << (IsPairwiseReduction
? "pairwise" : "splitting") << " reduction)\n"; } } while
(false)
4353 << (IsPairwiseReduction ? "pairwise" : "splitting")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << VecReduxCost
- ScalarReduxCost << " for reduction that starts with "
<< *FirstReducedVal << " (It is a " << (IsPairwiseReduction
? "pairwise" : "splitting") << " reduction)\n"; } } while
(false)
4354 << " reduction)\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Adding cost " << VecReduxCost
- ScalarReduxCost << " for reduction that starts with "
<< *FirstReducedVal << " (It is a " << (IsPairwiseReduction
? "pairwise" : "splitting") << " reduction)\n"; } } while
(false)
;
4355
4356 return VecReduxCost - ScalarReduxCost;
4357 }
4358
4359 /// \brief Emit a horizontal reduction of the vectorized value.
4360 Value *emitReduction(Value *VectorizedValue, IRBuilder<> &Builder) {
4361 assert(VectorizedValue && "Need to have a vectorized tree node")((VectorizedValue && "Need to have a vectorized tree node"
) ? static_cast<void> (0) : __assert_fail ("VectorizedValue && \"Need to have a vectorized tree node\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4361, __PRETTY_FUNCTION__))
;
4362 assert(isPowerOf2_32(ReduxWidth) &&((isPowerOf2_32(ReduxWidth) && "We only handle power-of-two reductions for now"
) ? static_cast<void> (0) : __assert_fail ("isPowerOf2_32(ReduxWidth) && \"We only handle power-of-two reductions for now\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4363, __PRETTY_FUNCTION__))
4363 "We only handle power-of-two reductions for now")((isPowerOf2_32(ReduxWidth) && "We only handle power-of-two reductions for now"
) ? static_cast<void> (0) : __assert_fail ("isPowerOf2_32(ReduxWidth) && \"We only handle power-of-two reductions for now\""
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4363, __PRETTY_FUNCTION__))
;
4364
4365 Value *TmpVec = VectorizedValue;
4366 for (unsigned i = ReduxWidth / 2; i != 0; i >>= 1) {
4367 if (IsPairwiseReduction) {
4368 Value *LeftMask =
4369 createRdxShuffleMask(ReduxWidth, i, true, true, Builder);
4370 Value *RightMask =
4371 createRdxShuffleMask(ReduxWidth, i, true, false, Builder);
4372
4373 Value *LeftShuf = Builder.CreateShuffleVector(
4374 TmpVec, UndefValue::get(TmpVec->getType()), LeftMask, "rdx.shuf.l");
4375 Value *RightShuf = Builder.CreateShuffleVector(
4376 TmpVec, UndefValue::get(TmpVec->getType()), (RightMask),
4377 "rdx.shuf.r");
4378 TmpVec = Builder.CreateBinOp(ReductionOpcode, LeftShuf, RightShuf,
4379 "bin.rdx");
4380 } else {
4381 Value *UpperHalf =
4382 createRdxShuffleMask(ReduxWidth, i, false, false, Builder);
4383 Value *Shuf = Builder.CreateShuffleVector(
4384 TmpVec, UndefValue::get(TmpVec->getType()), UpperHalf, "rdx.shuf");
4385 TmpVec = Builder.CreateBinOp(ReductionOpcode, TmpVec, Shuf, "bin.rdx");
4386 }
4387 }
4388
4389 // The result is in the first element of the vector.
4390 return Builder.CreateExtractElement(TmpVec, Builder.getInt32(0));
4391 }
4392};
4393} // end anonymous namespace
4394
4395/// \brief Recognize construction of vectors like
4396/// %ra = insertelement <4 x float> undef, float %s0, i32 0
4397/// %rb = insertelement <4 x float> %ra, float %s1, i32 1
4398/// %rc = insertelement <4 x float> %rb, float %s2, i32 2
4399/// %rd = insertelement <4 x float> %rc, float %s3, i32 3
4400///
4401/// Returns true if it matches
4402///
4403static bool findBuildVector(InsertElementInst *FirstInsertElem,
4404 SmallVectorImpl<Value *> &BuildVector,
4405 SmallVectorImpl<Value *> &BuildVectorOpds) {
4406 if (!isa<UndefValue>(FirstInsertElem->getOperand(0)))
4407 return false;
4408
4409 InsertElementInst *IE = FirstInsertElem;
4410 while (true) {
4411 BuildVector.push_back(IE);
4412 BuildVectorOpds.push_back(IE->getOperand(1));
4413
4414 if (IE->use_empty())
4415 return false;
4416
4417 InsertElementInst *NextUse = dyn_cast<InsertElementInst>(IE->user_back());
4418 if (!NextUse)
4419 return true;
4420
4421 // If this isn't the final use, make sure the next insertelement is the only
4422 // use. It's OK if the final constructed vector is used multiple times
4423 if (!IE->hasOneUse())
4424 return false;
4425
4426 IE = NextUse;
4427 }
4428
4429 return false;
4430}
4431
4432/// \brief Like findBuildVector, but looks backwards for construction of aggregate.
4433///
4434/// \return true if it matches.
4435static bool findBuildAggregate(InsertValueInst *IV,
4436 SmallVectorImpl<Value *> &BuildVector,
4437 SmallVectorImpl<Value *> &BuildVectorOpds) {
4438 if (!IV->hasOneUse())
4439 return false;
4440 Value *V = IV->getAggregateOperand();
4441 if (!isa<UndefValue>(V)) {
4442 InsertValueInst *I = dyn_cast<InsertValueInst>(V);
4443 if (!I || !findBuildAggregate(I, BuildVector, BuildVectorOpds))
4444 return false;
4445 }
4446 BuildVector.push_back(IV);
4447 BuildVectorOpds.push_back(IV->getInsertedValueOperand());
4448 return true;
4449}
4450
4451static bool PhiTypeSorterFunc(Value *V, Value *V2) {
4452 return V->getType() < V2->getType();
4453}
4454
4455/// \brief Try and get a reduction value from a phi node.
4456///
4457/// Given a phi node \p P in a block \p ParentBB, consider possible reductions
4458/// if they come from either \p ParentBB or a containing loop latch.
4459///
4460/// \returns A candidate reduction value if possible, or \code nullptr \endcode
4461/// if not possible.
4462static Value *getReductionValue(const DominatorTree *DT, PHINode *P,
4463 BasicBlock *ParentBB, LoopInfo *LI) {
4464 // There are situations where the reduction value is not dominated by the
4465 // reduction phi. Vectorizing such cases has been reported to cause
4466 // miscompiles. See PR25787.
4467 auto DominatedReduxValue = [&](Value *R) {
4468 return (
4469 dyn_cast<Instruction>(R) &&
4470 DT->dominates(P->getParent(), dyn_cast<Instruction>(R)->getParent()));
4471 };
4472
4473 Value *Rdx = nullptr;
4474
4475 // Return the incoming value if it comes from the same BB as the phi node.
4476 if (P->getIncomingBlock(0) == ParentBB) {
4477 Rdx = P->getIncomingValue(0);
4478 } else if (P->getIncomingBlock(1) == ParentBB) {
4479 Rdx = P->getIncomingValue(1);
4480 }
4481
4482 if (Rdx && DominatedReduxValue(Rdx))
4483 return Rdx;
4484
4485 // Otherwise, check whether we have a loop latch to look at.
4486 Loop *BBL = LI->getLoopFor(ParentBB);
4487 if (!BBL)
4488 return nullptr;
4489 BasicBlock *BBLatch = BBL->getLoopLatch();
4490 if (!BBLatch)
4491 return nullptr;
4492
4493 // There is a loop latch, return the incoming value if it comes from
4494 // that. This reduction pattern occasionally turns up.
4495 if (P->getIncomingBlock(0) == BBLatch) {
4496 Rdx = P->getIncomingValue(0);
4497 } else if (P->getIncomingBlock(1) == BBLatch) {
4498 Rdx = P->getIncomingValue(1);
4499 }
4500
4501 if (Rdx && DominatedReduxValue(Rdx))
4502 return Rdx;
4503
4504 return nullptr;
4505}
4506
4507namespace {
4508/// Tracks instructons and its children.
4509class WeakVHWithLevel final : public CallbackVH {
4510 /// Operand index of the instruction currently beeing analized.
4511 unsigned Level = 0;
4512 /// Is this the instruction that should be vectorized, or are we now
4513 /// processing children (i.e. operands of this instruction) for potential
4514 /// vectorization?
4515 bool IsInitial = true;
4516
4517public:
4518 explicit WeakVHWithLevel() = default;
4519 WeakVHWithLevel(Value *V) : CallbackVH(V){};
4520 /// Restart children analysis each time it is repaced by the new instruction.
4521 void allUsesReplacedWith(Value *New) override {
4522 setValPtr(New);
4523 Level = 0;
4524 IsInitial = true;
4525 }
4526 /// Check if the instruction was not deleted during vectorization.
4527 bool isValid() const { return !getValPtr(); }
4528 /// Is the istruction itself must be vectorized?
4529 bool isInitial() const { return IsInitial; }
4530 /// Try to vectorize children.
4531 void clearInitial() { IsInitial = false; }
4532 /// Are all children processed already?
4533 bool isFinal() const {
4534 assert(getValPtr() &&((getValPtr() && (isa<Instruction>(getValPtr())
&& cast<Instruction>(getValPtr())->getNumOperands
() >= Level)) ? static_cast<void> (0) : __assert_fail
("getValPtr() && (isa<Instruction>(getValPtr()) && cast<Instruction>(getValPtr())->getNumOperands() >= Level)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4536, __PRETTY_FUNCTION__))
4535 (isa<Instruction>(getValPtr()) &&((getValPtr() && (isa<Instruction>(getValPtr())
&& cast<Instruction>(getValPtr())->getNumOperands
() >= Level)) ? static_cast<void> (0) : __assert_fail
("getValPtr() && (isa<Instruction>(getValPtr()) && cast<Instruction>(getValPtr())->getNumOperands() >= Level)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4536, __PRETTY_FUNCTION__))
4536 cast<Instruction>(getValPtr())->getNumOperands() >= Level))((getValPtr() && (isa<Instruction>(getValPtr())
&& cast<Instruction>(getValPtr())->getNumOperands
() >= Level)) ? static_cast<void> (0) : __assert_fail
("getValPtr() && (isa<Instruction>(getValPtr()) && cast<Instruction>(getValPtr())->getNumOperands() >= Level)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4536, __PRETTY_FUNCTION__))
;
4537 return getValPtr() &&
4538 cast<Instruction>(getValPtr())->getNumOperands() == Level;
4539 }
4540 /// Get next child operation.
4541 Value *nextOperand() {
4542 assert(getValPtr() && isa<Instruction>(getValPtr()) &&((getValPtr() && isa<Instruction>(getValPtr()) &&
cast<Instruction>(getValPtr())->getNumOperands() >
Level) ? static_cast<void> (0) : __assert_fail ("getValPtr() && isa<Instruction>(getValPtr()) && cast<Instruction>(getValPtr())->getNumOperands() > Level"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4543, __PRETTY_FUNCTION__))
4543 cast<Instruction>(getValPtr())->getNumOperands() > Level)((getValPtr() && isa<Instruction>(getValPtr()) &&
cast<Instruction>(getValPtr())->getNumOperands() >
Level) ? static_cast<void> (0) : __assert_fail ("getValPtr() && isa<Instruction>(getValPtr()) && cast<Instruction>(getValPtr())->getNumOperands() > Level"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4543, __PRETTY_FUNCTION__))
;
4544 return cast<Instruction>(getValPtr())->getOperand(Level++);
4545 }
4546 virtual ~WeakVHWithLevel() = default;
4547};
4548} // namespace
4549
4550/// \brief Attempt to reduce a horizontal reduction.
4551/// If it is legal to match a horizontal reduction feeding
4552/// the phi node P with reduction operators Root in a basic block BB, then check
4553/// if it can be done.
4554/// \returns true if a horizontal reduction was matched and reduced.
4555/// \returns false if a horizontal reduction was not matched.
4556static bool canBeVectorized(
4557 PHINode *P, Instruction *Root, BasicBlock *BB, BoUpSLP &R,
4558 TargetTransformInfo *TTI,
4559 const function_ref<bool(BinaryOperator *, BoUpSLP &)> Vectorize) {
4560 if (!ShouldVectorizeHor)
4561 return false;
4562
4563 if (!Root)
4564 return false;
4565
4566 if (Root->getParent() != BB)
4567 return false;
4568 SmallVector<WeakVHWithLevel, 8> Stack(1, Root);
4569 SmallSet<Value *, 8> VisitedInstrs;
4570 bool Res = false;
4571 while (!Stack.empty()) {
4572 Value *V = Stack.back();
4573 if (!V) {
4574 Stack.pop_back();
4575 continue;
4576 }
4577 auto *Inst = dyn_cast<Instruction>(V);
4578 if (!Inst || isa<PHINode>(Inst)) {
4579 Stack.pop_back();
4580 continue;
4581 }
4582 if (Stack.back().isInitial()) {
4583 Stack.back().clearInitial();
4584 if (auto *BI = dyn_cast<BinaryOperator>(Inst)) {
4585 HorizontalReduction HorRdx(R.getMinVecRegSize());
4586 if (HorRdx.matchAssociativeReduction(P, BI)) {
4587 // If there is a sufficient number of reduction values, reduce
4588 // to a nearby power-of-2. Can safely generate oversized
4589 // vectors and rely on the backend to split them to legal sizes.
4590 HorRdx.ReduxWidth =
4591 std::max((uint64_t)4, PowerOf2Floor(HorRdx.numReductionValues()));
4592
4593 if (HorRdx.tryToReduce(R, TTI)) {
4594 Res = true;
4595 P = nullptr;
4596 continue;
4597 }
4598 }
4599 if (P) {
4600 Inst = dyn_cast<Instruction>(BI->getOperand(0));
4601 if (Inst == P)
4602 Inst = dyn_cast<Instruction>(BI->getOperand(1));
4603 if (!Inst) {
4604 P = nullptr;
4605 continue;
4606 }
4607 }
4608 }
4609 P = nullptr;
4610 if (Vectorize(dyn_cast<BinaryOperator>(Inst), R)) {
4611 Res = true;
4612 continue;
4613 }
4614 }
4615 if (Stack.back().isFinal()) {
4616 Stack.pop_back();
4617 continue;
4618 }
4619
4620 if (auto *NextV = dyn_cast<Instruction>(Stack.back().nextOperand()))
4621 if (NextV->getParent() == BB && VisitedInstrs.insert(NextV).second &&
4622 Stack.size() < RecursionMaxDepth)
4623 Stack.push_back(NextV);
4624 }
4625 return Res;
4626}
4627
4628bool SLPVectorizerPass::vectorizeRootInstruction(PHINode *P, Value *V,
4629 BasicBlock *BB, BoUpSLP &R,
4630 TargetTransformInfo *TTI) {
4631 if (!V)
4632 return false;
4633 auto *I = dyn_cast<Instruction>(V);
4634 if (!I)
4635 return false;
4636
4637 if (!isa<BinaryOperator>(I))
4638 P = nullptr;
4639 // Try to match and vectorize a horizontal reduction.
4640 return canBeVectorized(P, I, BB, R, TTI,
4641 [this](BinaryOperator *BI, BoUpSLP &R) -> bool {
4642 return tryToVectorize(BI, R);
4643 });
4644}
4645
4646bool SLPVectorizerPass::vectorizeChainsInBlock(BasicBlock *BB, BoUpSLP &R) {
4647 bool Changed = false;
4648 SmallVector<Value *, 4> Incoming;
4649 SmallSet<Value *, 16> VisitedInstrs;
4650
4651 bool HaveVectorizedPhiNodes = true;
4652 while (HaveVectorizedPhiNodes) {
4653 HaveVectorizedPhiNodes = false;
4654
4655 // Collect the incoming values from the PHIs.
4656 Incoming.clear();
4657 for (Instruction &I : *BB) {
4658 PHINode *P = dyn_cast<PHINode>(&I);
4659 if (!P)
4660 break;
4661
4662 if (!VisitedInstrs.count(P))
4663 Incoming.push_back(P);
4664 }
4665
4666 // Sort by type.
4667 std::stable_sort(Incoming.begin(), Incoming.end(), PhiTypeSorterFunc);
4668
4669 // Try to vectorize elements base on their type.
4670 for (SmallVector<Value *, 4>::iterator IncIt = Incoming.begin(),
4671 E = Incoming.end();
4672 IncIt != E;) {
4673
4674 // Look for the next elements with the same type.
4675 SmallVector<Value *, 4>::iterator SameTypeIt = IncIt;
4676 while (SameTypeIt != E &&
4677 (*SameTypeIt)->getType() == (*IncIt)->getType()) {
4678 VisitedInstrs.insert(*SameTypeIt);
4679 ++SameTypeIt;
4680 }
4681
4682 // Try to vectorize them.
4683 unsigned NumElts = (SameTypeIt - IncIt);
4684 DEBUG(errs() << "SLP: Trying to vectorize starting at PHIs (" << NumElts << ")\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { errs() << "SLP: Trying to vectorize starting at PHIs ("
<< NumElts << ")\n"; } } while (false)
;
4685 if (NumElts > 1 && tryToVectorizeList(makeArrayRef(IncIt, NumElts), R)) {
4686 // Success start over because instructions might have been changed.
4687 HaveVectorizedPhiNodes = true;
4688 Changed = true;
4689 break;
4690 }
4691
4692 // Start over at the next instruction of a different type (or the end).
4693 IncIt = SameTypeIt;
4694 }
4695 }
4696
4697 VisitedInstrs.clear();
4698
4699 for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; it++) {
4700 // We may go through BB multiple times so skip the one we have checked.
4701 if (!VisitedInstrs.insert(&*it).second)
4702 continue;
4703
4704 if (isa<DbgInfoIntrinsic>(it))
4705 continue;
4706
4707 // Try to vectorize reductions that use PHINodes.
4708 if (PHINode *P = dyn_cast<PHINode>(it)) {
4709 // Check that the PHI is a reduction PHI.
4710 if (P->getNumIncomingValues() != 2)
4711 return Changed;
4712
4713 // Try to match and vectorize a horizontal reduction.
4714 if (vectorizeRootInstruction(P, getReductionValue(DT, P, BB, LI), BB, R,
4715 TTI)) {
4716 Changed = true;
4717 it = BB->begin();
4718 e = BB->end();
4719 continue;
4720 }
4721 continue;
4722 }
4723
4724 if (ShouldStartVectorizeHorAtStore) {
4725 if (StoreInst *SI = dyn_cast<StoreInst>(it)) {
4726 // Try to match and vectorize a horizontal reduction.
4727 if (vectorizeRootInstruction(nullptr, SI->getValueOperand(), BB, R,
4728 TTI)) {
4729 Changed = true;
4730 it = BB->begin();
4731 e = BB->end();
4732 continue;
4733 }
4734 }
4735 }
4736
4737 // Try to vectorize horizontal reductions feeding into a return.
4738 if (ReturnInst *RI = dyn_cast<ReturnInst>(it)) {
4739 if (RI->getNumOperands() != 0) {
4740 // Try to match and vectorize a horizontal reduction.
4741 if (vectorizeRootInstruction(nullptr, RI->getOperand(0), BB, R, TTI)) {
4742 Changed = true;
4743 it = BB->begin();
4744 e = BB->end();
4745 continue;
4746 }
4747 }
4748 }
4749
4750 // Try to vectorize trees that start at compare instructions.
4751 if (CmpInst *CI = dyn_cast<CmpInst>(it)) {
4752 if (tryToVectorizePair(CI->getOperand(0), CI->getOperand(1), R)) {
4753 Changed = true;
4754 // We would like to start over since some instructions are deleted
4755 // and the iterator may become invalid value.
4756 it = BB->begin();
4757 e = BB->end();
4758 continue;
4759 }
4760
4761 for (int I = 0; I < 2; ++I) {
4762 if (vectorizeRootInstruction(nullptr, CI->getOperand(I), BB, R, TTI)) {
4763 Changed = true;
4764 // We would like to start over since some instructions are deleted
4765 // and the iterator may become invalid value.
4766 it = BB->begin();
4767 e = BB->end();
4768 break;
4769 }
4770 }
4771 continue;
4772 }
4773
4774 // Try to vectorize trees that start at insertelement instructions.
4775 if (InsertElementInst *FirstInsertElem = dyn_cast<InsertElementInst>(it)) {
4776 SmallVector<Value *, 16> BuildVector;
4777 SmallVector<Value *, 16> BuildVectorOpds;
4778 if (!findBuildVector(FirstInsertElem, BuildVector, BuildVectorOpds))
4779 continue;
4780
4781 // Vectorize starting with the build vector operands ignoring the
4782 // BuildVector instructions for the purpose of scheduling and user
4783 // extraction.
4784 if (tryToVectorizeList(BuildVectorOpds, R, BuildVector)) {
4785 Changed = true;
4786 it = BB->begin();
4787 e = BB->end();
4788 }
4789
4790 continue;
4791 }
4792
4793 // Try to vectorize trees that start at insertvalue instructions feeding into
4794 // a store.
4795 if (StoreInst *SI = dyn_cast<StoreInst>(it)) {
4796 if (InsertValueInst *LastInsertValue = dyn_cast<InsertValueInst>(SI->getValueOperand())) {
4797 const DataLayout &DL = BB->getModule()->getDataLayout();
4798 if (R.canMapToVector(SI->getValueOperand()->getType(), DL)) {
4799 SmallVector<Value *, 16> BuildVector;
4800 SmallVector<Value *, 16> BuildVectorOpds;
4801 if (!findBuildAggregate(LastInsertValue, BuildVector, BuildVectorOpds))
4802 continue;
4803
4804 DEBUG(dbgs() << "SLP: store of array mappable to vector: " << *SI << "\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: store of array mappable to vector: "
<< *SI << "\n"; } } while (false)
;
4805 if (tryToVectorizeList(BuildVectorOpds, R, BuildVector, false)) {
4806 Changed = true;
4807 it = BB->begin();
4808 e = BB->end();
4809 }
4810 continue;
4811 }
4812 }
4813 }
4814 }
4815
4816 return Changed;
4817}
4818
4819bool SLPVectorizerPass::vectorizeGEPIndices(BasicBlock *BB, BoUpSLP &R) {
4820 auto Changed = false;
4821 for (auto &Entry : GEPs) {
4822
4823 // If the getelementptr list has fewer than two elements, there's nothing
4824 // to do.
4825 if (Entry.second.size() < 2)
4826 continue;
4827
4828 DEBUG(dbgs() << "SLP: Analyzing a getelementptr list of length "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a getelementptr list of length "
<< Entry.second.size() << ".\n"; } } while (false
)
4829 << Entry.second.size() << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a getelementptr list of length "
<< Entry.second.size() << ".\n"; } } while (false
)
;
4830
4831 // We process the getelementptr list in chunks of 16 (like we do for
4832 // stores) to minimize compile-time.
4833 for (unsigned BI = 0, BE = Entry.second.size(); BI < BE; BI += 16) {
4834 auto Len = std::min<unsigned>(BE - BI, 16);
4835 auto GEPList = makeArrayRef(&Entry.second[BI], Len);
4836
4837 // Initialize a set a candidate getelementptrs. Note that we use a
4838 // SetVector here to preserve program order. If the index computations
4839 // are vectorizable and begin with loads, we want to minimize the chance
4840 // of having to reorder them later.
4841 SetVector<Value *> Candidates(GEPList.begin(), GEPList.end());
4842
4843 // Some of the candidates may have already been vectorized after we
4844 // initially collected them. If so, the WeakVHs will have nullified the
4845 // values, so remove them from the set of candidates.
4846 Candidates.remove(nullptr);
4847
4848 // Remove from the set of candidates all pairs of getelementptrs with
4849 // constant differences. Such getelementptrs are likely not good
4850 // candidates for vectorization in a bottom-up phase since one can be
4851 // computed from the other. We also ensure all candidate getelementptr
4852 // indices are unique.
4853 for (int I = 0, E = GEPList.size(); I < E && Candidates.size() > 1; ++I) {
4854 auto *GEPI = cast<GetElementPtrInst>(GEPList[I]);
4855 if (!Candidates.count(GEPI))
4856 continue;
4857 auto *SCEVI = SE->getSCEV(GEPList[I]);
4858 for (int J = I + 1; J < E && Candidates.size() > 1; ++J) {
4859 auto *GEPJ = cast<GetElementPtrInst>(GEPList[J]);
4860 auto *SCEVJ = SE->getSCEV(GEPList[J]);
4861 if (isa<SCEVConstant>(SE->getMinusSCEV(SCEVI, SCEVJ))) {
4862 Candidates.remove(GEPList[I]);
4863 Candidates.remove(GEPList[J]);
4864 } else if (GEPI->idx_begin()->get() == GEPJ->idx_begin()->get()) {
4865 Candidates.remove(GEPList[J]);
4866 }
4867 }
4868 }
4869
4870 // We break out of the above computation as soon as we know there are
4871 // fewer than two candidates remaining.
4872 if (Candidates.size() < 2)
4873 continue;
4874
4875 // Add the single, non-constant index of each candidate to the bundle. We
4876 // ensured the indices met these constraints when we originally collected
4877 // the getelementptrs.
4878 SmallVector<Value *, 16> Bundle(Candidates.size());
4879 auto BundleIndex = 0u;
4880 for (auto *V : Candidates) {
4881 auto *GEP = cast<GetElementPtrInst>(V);
4882 auto *GEPIdx = GEP->idx_begin()->get();
4883 assert(GEP->getNumIndices() == 1 || !isa<Constant>(GEPIdx))((GEP->getNumIndices() == 1 || !isa<Constant>(GEPIdx
)) ? static_cast<void> (0) : __assert_fail ("GEP->getNumIndices() == 1 || !isa<Constant>(GEPIdx)"
, "/tmp/buildd/llvm-toolchain-snapshot-5.0~svn292767/lib/Transforms/Vectorize/SLPVectorizer.cpp"
, 4883, __PRETTY_FUNCTION__))
;
4884 Bundle[BundleIndex++] = GEPIdx;
4885 }
4886
4887 // Try and vectorize the indices. We are currently only interested in
4888 // gather-like cases of the form:
4889 //
4890 // ... = g[a[0] - b[0]] + g[a[1] - b[1]] + ...
4891 //
4892 // where the loads of "a", the loads of "b", and the subtractions can be
4893 // performed in parallel. It's likely that detecting this pattern in a
4894 // bottom-up phase will be simpler and less costly than building a
4895 // full-blown top-down phase beginning at the consecutive loads.
4896 Changed |= tryToVectorizeList(Bundle, R);
4897 }
4898 }
4899 return Changed;
4900}
4901
4902bool SLPVectorizerPass::vectorizeStoreChains(BoUpSLP &R) {
4903 bool Changed = false;
4904 // Attempt to sort and vectorize each of the store-groups.
4905 for (StoreListMap::iterator it = Stores.begin(), e = Stores.end(); it != e;
4906 ++it) {
4907 if (it->second.size() < 2)
4908 continue;
4909
4910 DEBUG(dbgs() << "SLP: Analyzing a store chain of length "do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a store chain of length "
<< it->second.size() << ".\n"; } } while (false
)
4911 << it->second.size() << ".\n")do { if (::llvm::DebugFlag && ::llvm::isCurrentDebugType
("SLP")) { dbgs() << "SLP: Analyzing a store chain of length "
<< it->second.size() << ".\n"; } } while (false
)
;
4912
4913 // Process the stores in chunks of 16.
4914 // TODO: The limit of 16 inhibits greater vectorization factors.
4915 // For example, AVX2 supports v32i8. Increasing this limit, however,
4916 // may cause a significant compile-time increase.
4917 for (unsigned CI = 0, CE = it->second.size(); CI < CE; CI+=16) {
4918 unsigned Len = std::min<unsigned>(CE - CI, 16);
4919 Changed |= vectorizeStores(makeArrayRef(&it->second[CI], Len), R);
4920 }
4921 }
4922 return Changed;
4923}
4924
4925char SLPVectorizer::ID = 0;
4926static const char lv_name[] = "SLP Vectorizer";
4927INITIALIZE_PASS_BEGIN(SLPVectorizer, SV_NAME, lv_name, false, false)static void *initializeSLPVectorizerPassOnce(PassRegistry &
Registry) {
4928INITIALIZE_PASS_DEPENDENCY(AAResultsWrapperPass)initializeAAResultsWrapperPassPass(Registry);
4929INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass)initializeTargetTransformInfoWrapperPassPass(Registry);
4930INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)initializeAssumptionCacheTrackerPass(Registry);
4931INITIALIZE_PASS_DEPENDENCY(ScalarEvolutionWrapperPass)initializeScalarEvolutionWrapperPassPass(Registry);
4932INITIALIZE_PASS_DEPENDENCY(LoopSimplify)initializeLoopSimplifyPass(Registry);
4933INITIALIZE_PASS_DEPENDENCY(DemandedBitsWrapperPass)initializeDemandedBitsWrapperPassPass(Registry);
4934INITIALIZE_PASS_END(SLPVectorizer, SV_NAME, lv_name, false, false)PassInfo *PI = new PassInfo( lv_name, "slp-vectorizer", &
SLPVectorizer::ID, PassInfo::NormalCtor_t(callDefaultCtor<
SLPVectorizer>), false, false); Registry.registerPass(*PI,
true); return PI; } static once_flag InitializeSLPVectorizerPassFlag
; void llvm::initializeSLPVectorizerPass(PassRegistry &Registry
) { llvm::call_once(InitializeSLPVectorizerPassFlag, initializeSLPVectorizerPassOnce
, std::ref(Registry)); }
4935
4936namespace llvm {
4937Pass *createSLPVectorizerPass() { return new SLPVectorizer(); }
4938}