121
|
1 //===- InterleavedAccessPass.cpp ------------------------------------------===//
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
120
|
3 // The LLVM Compiler Infrastructure
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // This file implements the Interleaved Access pass, which identifies
|
120
|
11 // interleaved memory accesses and transforms them into target specific
|
|
12 // intrinsics.
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 // An interleaved load reads data from memory into several vectors, with
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 // DE-interleaving the data on a factor. An interleaved store writes several
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 // vectors to memory with RE-interleaving the data on a factor.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 //
|
120
|
18 // As interleaved accesses are difficult to identified in CodeGen (mainly
|
|
19 // because the VECTOR_SHUFFLE DAG node is quite different from the shufflevector
|
|
20 // IR), we identify and transform them to intrinsics in this pass so the
|
|
21 // intrinsics can be easily matched into target specific instructions later in
|
|
22 // CodeGen.
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 // E.g. An interleaved load (Factor = 2):
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 // %wide.vec = load <8 x i32>, <8 x i32>* %ptr
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26 // %v0 = shuffle <8 x i32> %wide.vec, <8 x i32> undef, <0, 2, 4, 6>
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 // %v1 = shuffle <8 x i32> %wide.vec, <8 x i32> undef, <1, 3, 5, 7>
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
28 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
29 // It could be transformed into a ld2 intrinsic in AArch64 backend or a vld2
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
30 // intrinsic in ARM backend.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
31 //
|
120
|
32 // In X86, this can be further optimized into a set of target
|
|
33 // specific loads followed by an optimized sequence of shuffles.
|
|
34 //
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
35 // E.g. An interleaved store (Factor = 3):
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
36 // %i.vec = shuffle <8 x i32> %v0, <8 x i32> %v1,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
37 // <0, 4, 8, 1, 5, 9, 2, 6, 10, 3, 7, 11>
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
38 // store <12 x i32> %i.vec, <12 x i32>* %ptr
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
39 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
40 // It could be transformed into a st3 intrinsic in AArch64 backend or a vst3
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
41 // intrinsic in ARM backend.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
42 //
|
120
|
43 // Similarly, a set of interleaved stores can be transformed into an optimized
|
|
44 // sequence of shuffles followed by a set of target specific stores for X86.
|
121
|
45 //
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
46 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
47
|
121
|
48 #include "llvm/ADT/ArrayRef.h"
|
|
49 #include "llvm/ADT/DenseMap.h"
|
|
50 #include "llvm/ADT/SmallVector.h"
|
134
|
51 #include "llvm/CodeGen/TargetLowering.h"
|
121
|
52 #include "llvm/CodeGen/TargetPassConfig.h"
|
134
|
53 #include "llvm/CodeGen/TargetSubtargetInfo.h"
|
121
|
54 #include "llvm/IR/Constants.h"
|
120
|
55 #include "llvm/IR/Dominators.h"
|
121
|
56 #include "llvm/IR/Function.h"
|
|
57 #include "llvm/IR/IRBuilder.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
58 #include "llvm/IR/InstIterator.h"
|
121
|
59 #include "llvm/IR/Instruction.h"
|
|
60 #include "llvm/IR/Instructions.h"
|
|
61 #include "llvm/IR/Type.h"
|
|
62 #include "llvm/Pass.h"
|
|
63 #include "llvm/Support/Casting.h"
|
|
64 #include "llvm/Support/CommandLine.h"
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
65 #include "llvm/Support/Debug.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
66 #include "llvm/Support/MathExtras.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
67 #include "llvm/Support/raw_ostream.h"
|
121
|
68 #include "llvm/Target/TargetMachine.h"
|
|
69 #include <cassert>
|
|
70 #include <utility>
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
71
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
72 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
73
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
74 #define DEBUG_TYPE "interleaved-access"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
75
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
76 static cl::opt<bool> LowerInterleavedAccesses(
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
77 "lower-interleaved-accesses",
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
78 cl::desc("Enable lowering interleaved accesses to intrinsics"),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
79 cl::init(true), cl::Hidden);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
80
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
81 namespace {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
82
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
83 class InterleavedAccess : public FunctionPass {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
84 public:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
85 static char ID;
|
121
|
86
|
|
87 InterleavedAccess() : FunctionPass(ID) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
88 initializeInterleavedAccessPass(*PassRegistry::getPassRegistry());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
89 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
90
|
120
|
91 StringRef getPassName() const override { return "Interleaved Access Pass"; }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
92
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
93 bool runOnFunction(Function &F) override;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
94
|
120
|
95 void getAnalysisUsage(AnalysisUsage &AU) const override {
|
|
96 AU.addRequired<DominatorTreeWrapperPass>();
|
|
97 AU.addPreserved<DominatorTreeWrapperPass>();
|
|
98 }
|
|
99
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
100 private:
|
121
|
101 DominatorTree *DT = nullptr;
|
|
102 const TargetLowering *TLI = nullptr;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
103
|
120
|
104 /// The maximum supported interleave factor.
|
|
105 unsigned MaxFactor;
|
|
106
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
107 /// \brief Transform an interleaved load into target specific intrinsics.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
108 bool lowerInterleavedLoad(LoadInst *LI,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
109 SmallVector<Instruction *, 32> &DeadInsts);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
110
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
111 /// \brief Transform an interleaved store into target specific intrinsics.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
112 bool lowerInterleavedStore(StoreInst *SI,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
113 SmallVector<Instruction *, 32> &DeadInsts);
|
120
|
114
|
|
115 /// \brief Returns true if the uses of an interleaved load by the
|
|
116 /// extractelement instructions in \p Extracts can be replaced by uses of the
|
|
117 /// shufflevector instructions in \p Shuffles instead. If so, the necessary
|
|
118 /// replacements are also performed.
|
|
119 bool tryReplaceExtracts(ArrayRef<ExtractElementInst *> Extracts,
|
|
120 ArrayRef<ShuffleVectorInst *> Shuffles);
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
121 };
|
121
|
122
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
123 } // end anonymous namespace.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
124
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
125 char InterleavedAccess::ID = 0;
|
121
|
126
|
|
127 INITIALIZE_PASS_BEGIN(InterleavedAccess, DEBUG_TYPE,
|
120
|
128 "Lower interleaved memory accesses to target specific intrinsics", false,
|
|
129 false)
|
|
130 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
|
121
|
131 INITIALIZE_PASS_END(InterleavedAccess, DEBUG_TYPE,
|
120
|
132 "Lower interleaved memory accesses to target specific intrinsics", false,
|
|
133 false)
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
134
|
121
|
135 FunctionPass *llvm::createInterleavedAccessPass() {
|
|
136 return new InterleavedAccess();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
137 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
138
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
139 /// \brief Check if the mask is a DE-interleave mask of the given factor
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
140 /// \p Factor like:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
141 /// <Index, Index+Factor, ..., Index+(NumElts-1)*Factor>
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
142 static bool isDeInterleaveMaskOfFactor(ArrayRef<int> Mask, unsigned Factor,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
143 unsigned &Index) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
144 // Check all potential start indices from 0 to (Factor - 1).
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
145 for (Index = 0; Index < Factor; Index++) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
146 unsigned i = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
147
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
148 // Check that elements are in ascending order by Factor. Ignore undef
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149 // elements.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
150 for (; i < Mask.size(); i++)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
151 if (Mask[i] >= 0 && static_cast<unsigned>(Mask[i]) != Index + i * Factor)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
152 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
153
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
154 if (i == Mask.size())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
155 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
156 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
157
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
158 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
159 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
160
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
161 /// \brief Check if the mask is a DE-interleave mask for an interleaved load.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
162 ///
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
163 /// E.g. DE-interleave masks (Factor = 2) could be:
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
164 /// <0, 2, 4, 6> (mask of index 0 to extract even elements)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
165 /// <1, 3, 5, 7> (mask of index 1 to extract odd elements)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
166 static bool isDeInterleaveMask(ArrayRef<int> Mask, unsigned &Factor,
|
120
|
167 unsigned &Index, unsigned MaxFactor) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
168 if (Mask.size() < 2)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
169 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
170
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
171 // Check potential Factors.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
172 for (Factor = 2; Factor <= MaxFactor; Factor++)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
173 if (isDeInterleaveMaskOfFactor(Mask, Factor, Index))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
174 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
175
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
176 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
177 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
178
|
121
|
179 /// \brief Check if the mask can be used in an interleaved store.
|
|
180 //
|
|
181 /// It checks for a more general pattern than the RE-interleave mask.
|
|
182 /// I.e. <x, y, ... z, x+1, y+1, ...z+1, x+2, y+2, ...z+2, ...>
|
|
183 /// E.g. For a Factor of 2 (LaneLen=4): <4, 32, 5, 33, 6, 34, 7, 35>
|
|
184 /// E.g. For a Factor of 3 (LaneLen=4): <4, 32, 16, 5, 33, 17, 6, 34, 18, 7, 35, 19>
|
|
185 /// E.g. For a Factor of 4 (LaneLen=2): <8, 2, 12, 4, 9, 3, 13, 5>
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
186 ///
|
121
|
187 /// The particular case of an RE-interleave mask is:
|
|
188 /// I.e. <0, LaneLen, ... , LaneLen*(Factor - 1), 1, LaneLen + 1, ...>
|
|
189 /// E.g. For a Factor of 2 (LaneLen=4): <0, 4, 1, 5, 2, 6, 3, 7>
|
120
|
190 static bool isReInterleaveMask(ArrayRef<int> Mask, unsigned &Factor,
|
121
|
191 unsigned MaxFactor, unsigned OpNumElts) {
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
192 unsigned NumElts = Mask.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
193 if (NumElts < 4)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
194 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
195
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
196 // Check potential Factors.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
197 for (Factor = 2; Factor <= MaxFactor; Factor++) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
198 if (NumElts % Factor)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
199 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
200
|
121
|
201 unsigned LaneLen = NumElts / Factor;
|
|
202 if (!isPowerOf2_32(LaneLen))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
203 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
204
|
121
|
205 // Check whether each element matches the general interleaved rule.
|
|
206 // Ignore undef elements, as long as the defined elements match the rule.
|
|
207 // Outer loop processes all factors (x, y, z in the above example)
|
|
208 unsigned I = 0, J;
|
|
209 for (; I < Factor; I++) {
|
|
210 unsigned SavedLaneValue;
|
|
211 unsigned SavedNoUndefs = 0;
|
|
212
|
|
213 // Inner loop processes consecutive accesses (x, x+1... in the example)
|
|
214 for (J = 0; J < LaneLen - 1; J++) {
|
|
215 // Lane computes x's position in the Mask
|
|
216 unsigned Lane = J * Factor + I;
|
|
217 unsigned NextLane = Lane + Factor;
|
|
218 int LaneValue = Mask[Lane];
|
|
219 int NextLaneValue = Mask[NextLane];
|
|
220
|
|
221 // If both are defined, values must be sequential
|
|
222 if (LaneValue >= 0 && NextLaneValue >= 0 &&
|
|
223 LaneValue + 1 != NextLaneValue)
|
|
224 break;
|
|
225
|
|
226 // If the next value is undef, save the current one as reference
|
|
227 if (LaneValue >= 0 && NextLaneValue < 0) {
|
|
228 SavedLaneValue = LaneValue;
|
|
229 SavedNoUndefs = 1;
|
|
230 }
|
|
231
|
|
232 // Undefs are allowed, but defined elements must still be consecutive:
|
|
233 // i.e.: x,..., undef,..., x + 2,..., undef,..., undef,..., x + 5, ....
|
|
234 // Verify this by storing the last non-undef followed by an undef
|
|
235 // Check that following non-undef masks are incremented with the
|
|
236 // corresponding distance.
|
|
237 if (SavedNoUndefs > 0 && LaneValue < 0) {
|
|
238 SavedNoUndefs++;
|
|
239 if (NextLaneValue >= 0 &&
|
|
240 SavedLaneValue + SavedNoUndefs != (unsigned)NextLaneValue)
|
|
241 break;
|
|
242 }
|
|
243 }
|
|
244
|
|
245 if (J < LaneLen - 1)
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
246 break;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
247
|
121
|
248 int StartMask = 0;
|
|
249 if (Mask[I] >= 0) {
|
|
250 // Check that the start of the I range (J=0) is greater than 0
|
|
251 StartMask = Mask[I];
|
|
252 } else if (Mask[(LaneLen - 1) * Factor + I] >= 0) {
|
|
253 // StartMask defined by the last value in lane
|
|
254 StartMask = Mask[(LaneLen - 1) * Factor + I] - J;
|
|
255 } else if (SavedNoUndefs > 0) {
|
|
256 // StartMask defined by some non-zero value in the j loop
|
|
257 StartMask = SavedLaneValue - (LaneLen - 1 - SavedNoUndefs);
|
|
258 }
|
|
259 // else StartMask remains set to 0, i.e. all elements are undefs
|
|
260
|
|
261 if (StartMask < 0)
|
|
262 break;
|
|
263 // We must stay within the vectors; This case can happen with undefs.
|
|
264 if (StartMask + LaneLen > OpNumElts*2)
|
|
265 break;
|
|
266 }
|
|
267
|
|
268 // Found an interleaved mask of current factor.
|
|
269 if (I == Factor)
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
270 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
271 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
272
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
273 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
274 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
275
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
276 bool InterleavedAccess::lowerInterleavedLoad(
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
277 LoadInst *LI, SmallVector<Instruction *, 32> &DeadInsts) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
278 if (!LI->isSimple())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
279 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
280
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
281 SmallVector<ShuffleVectorInst *, 4> Shuffles;
|
120
|
282 SmallVector<ExtractElementInst *, 4> Extracts;
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283
|
120
|
284 // Check if all users of this load are shufflevectors. If we encounter any
|
|
285 // users that are extractelement instructions, we save them to later check if
|
|
286 // they can be modifed to extract from one of the shufflevectors instead of
|
|
287 // the load.
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
288 for (auto UI = LI->user_begin(), E = LI->user_end(); UI != E; UI++) {
|
120
|
289 auto *Extract = dyn_cast<ExtractElementInst>(*UI);
|
|
290 if (Extract && isa<ConstantInt>(Extract->getIndexOperand())) {
|
|
291 Extracts.push_back(Extract);
|
|
292 continue;
|
|
293 }
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(*UI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295 if (!SVI || !isa<UndefValue>(SVI->getOperand(1)))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
297
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
298 Shuffles.push_back(SVI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
300
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301 if (Shuffles.empty())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
302 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
303
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304 unsigned Factor, Index;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306 // Check if the first shufflevector is DE-interleave shuffle.
|
120
|
307 if (!isDeInterleaveMask(Shuffles[0]->getShuffleMask(), Factor, Index,
|
|
308 MaxFactor))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
309 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
310
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
311 // Holds the corresponding index for each DE-interleave shuffle.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
312 SmallVector<unsigned, 4> Indices;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
313 Indices.push_back(Index);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
314
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
315 Type *VecTy = Shuffles[0]->getType();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
316
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
317 // Check if other shufflevectors are also DE-interleaved of the same type
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
318 // and factor as the first shufflevector.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
319 for (unsigned i = 1; i < Shuffles.size(); i++) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
320 if (Shuffles[i]->getType() != VecTy)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
321 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
322
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
323 if (!isDeInterleaveMaskOfFactor(Shuffles[i]->getShuffleMask(), Factor,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
324 Index))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
325 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
326
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
327 Indices.push_back(Index);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
328 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
329
|
120
|
330 // Try and modify users of the load that are extractelement instructions to
|
|
331 // use the shufflevector instructions instead of the load.
|
|
332 if (!tryReplaceExtracts(Extracts, Shuffles))
|
|
333 return false;
|
|
334
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
335 DEBUG(dbgs() << "IA: Found an interleaved load: " << *LI << "\n");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
336
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
337 // Try to create target specific intrinsics to replace the load and shuffles.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
338 if (!TLI->lowerInterleavedLoad(LI, Shuffles, Indices, Factor))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
339 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
340
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
341 for (auto SVI : Shuffles)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
342 DeadInsts.push_back(SVI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
343
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
344 DeadInsts.push_back(LI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
345 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
346 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
347
|
120
|
348 bool InterleavedAccess::tryReplaceExtracts(
|
|
349 ArrayRef<ExtractElementInst *> Extracts,
|
|
350 ArrayRef<ShuffleVectorInst *> Shuffles) {
|
|
351 // If there aren't any extractelement instructions to modify, there's nothing
|
|
352 // to do.
|
|
353 if (Extracts.empty())
|
|
354 return true;
|
|
355
|
|
356 // Maps extractelement instructions to vector-index pairs. The extractlement
|
|
357 // instructions will be modified to use the new vector and index operands.
|
|
358 DenseMap<ExtractElementInst *, std::pair<Value *, int>> ReplacementMap;
|
|
359
|
|
360 for (auto *Extract : Extracts) {
|
|
361 // The vector index that is extracted.
|
|
362 auto *IndexOperand = cast<ConstantInt>(Extract->getIndexOperand());
|
|
363 auto Index = IndexOperand->getSExtValue();
|
|
364
|
|
365 // Look for a suitable shufflevector instruction. The goal is to modify the
|
|
366 // extractelement instruction (which uses an interleaved load) to use one
|
|
367 // of the shufflevector instructions instead of the load.
|
|
368 for (auto *Shuffle : Shuffles) {
|
|
369 // If the shufflevector instruction doesn't dominate the extract, we
|
|
370 // can't create a use of it.
|
|
371 if (!DT->dominates(Shuffle, Extract))
|
|
372 continue;
|
|
373
|
|
374 // Inspect the indices of the shufflevector instruction. If the shuffle
|
|
375 // selects the same index that is extracted, we can modify the
|
|
376 // extractelement instruction.
|
|
377 SmallVector<int, 4> Indices;
|
|
378 Shuffle->getShuffleMask(Indices);
|
|
379 for (unsigned I = 0; I < Indices.size(); ++I)
|
|
380 if (Indices[I] == Index) {
|
|
381 assert(Extract->getOperand(0) == Shuffle->getOperand(0) &&
|
|
382 "Vector operations do not match");
|
|
383 ReplacementMap[Extract] = std::make_pair(Shuffle, I);
|
|
384 break;
|
|
385 }
|
|
386
|
|
387 // If we found a suitable shufflevector instruction, stop looking.
|
|
388 if (ReplacementMap.count(Extract))
|
|
389 break;
|
|
390 }
|
|
391
|
|
392 // If we did not find a suitable shufflevector instruction, the
|
|
393 // extractelement instruction cannot be modified, so we must give up.
|
|
394 if (!ReplacementMap.count(Extract))
|
|
395 return false;
|
|
396 }
|
|
397
|
|
398 // Finally, perform the replacements.
|
|
399 IRBuilder<> Builder(Extracts[0]->getContext());
|
|
400 for (auto &Replacement : ReplacementMap) {
|
|
401 auto *Extract = Replacement.first;
|
|
402 auto *Vector = Replacement.second.first;
|
|
403 auto Index = Replacement.second.second;
|
|
404 Builder.SetInsertPoint(Extract);
|
|
405 Extract->replaceAllUsesWith(Builder.CreateExtractElement(Vector, Index));
|
|
406 Extract->eraseFromParent();
|
|
407 }
|
|
408
|
|
409 return true;
|
|
410 }
|
|
411
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
412 bool InterleavedAccess::lowerInterleavedStore(
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
413 StoreInst *SI, SmallVector<Instruction *, 32> &DeadInsts) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
414 if (!SI->isSimple())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
415 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
416
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
417 ShuffleVectorInst *SVI = dyn_cast<ShuffleVectorInst>(SI->getValueOperand());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 if (!SVI || !SVI->hasOneUse())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 // Check if the shufflevector is RE-interleave shuffle.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 unsigned Factor;
|
121
|
423 unsigned OpNumElts = SVI->getOperand(0)->getType()->getVectorNumElements();
|
|
424 if (!isReInterleaveMask(SVI->getShuffleMask(), Factor, MaxFactor, OpNumElts))
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
426
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
427 DEBUG(dbgs() << "IA: Found an interleaved store: " << *SI << "\n");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
429 // Try to create target specific intrinsics to replace the store and shuffle.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
430 if (!TLI->lowerInterleavedStore(SI, SVI, Factor))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
431 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
432
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 // Already have a new target specific interleaved store. Erase the old store.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434 DeadInsts.push_back(SI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435 DeadInsts.push_back(SVI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
437 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
438
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439 bool InterleavedAccess::runOnFunction(Function &F) {
|
121
|
440 auto *TPC = getAnalysisIfAvailable<TargetPassConfig>();
|
|
441 if (!TPC || !LowerInterleavedAccesses)
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
442 return false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
444 DEBUG(dbgs() << "*** " << getPassName() << ": " << F.getName() << "\n");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
445
|
120
|
446 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
121
|
447 auto &TM = TPC->getTM<TargetMachine>();
|
|
448 TLI = TM.getSubtargetImpl(F)->getTargetLowering();
|
95
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449 MaxFactor = TLI->getMaxSupportedInterleaveFactor();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
450
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
451 // Holds dead instructions that will be erased later.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
452 SmallVector<Instruction *, 32> DeadInsts;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
453 bool Changed = false;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
454
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
455 for (auto &I : instructions(F)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
456 if (LoadInst *LI = dyn_cast<LoadInst>(&I))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
457 Changed |= lowerInterleavedLoad(LI, DeadInsts);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
458
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
459 if (StoreInst *SI = dyn_cast<StoreInst>(&I))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
460 Changed |= lowerInterleavedStore(SI, DeadInsts);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
461 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
463 for (auto I : DeadInsts)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464 I->eraseFromParent();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
466 return Changed;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
467 }
|