blob: c7ddf93f8e85144064ceb658f674177e8c7feacc [file] [log] [blame]
Craig Topper69653af2015-12-31 22:40:45 +00001//===-- X86ShuffleDecodeConstantPool.cpp - X86 shuffle decode -------------===//
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//
10// Define several functions to decode x86 specific shuffle semantics using
11// constants from the constant pool.
12//
13//===----------------------------------------------------------------------===//
14
Craig Topper69653af2015-12-31 22:40:45 +000015#include "Utils/X86ShuffleDecode.h"
Craig Topper53e5a38d2017-02-27 16:15:25 +000016#include "llvm/ADT/APInt.h"
Craig Topper69653af2015-12-31 22:40:45 +000017#include "llvm/IR/Constants.h"
18
19//===----------------------------------------------------------------------===//
20// Vector Mask Decoding
21//===----------------------------------------------------------------------===//
22
23namespace llvm {
24
Simon Pilgrim97a48202016-09-29 15:25:48 +000025static bool extractConstantMask(const Constant *C, unsigned MaskEltSizeInBits,
Craig Topper53e5a38d2017-02-27 16:15:25 +000026 APInt &UndefElts,
Simon Pilgrim97a48202016-09-29 15:25:48 +000027 SmallVectorImpl<uint64_t> &RawMask) {
28 // It is not an error for shuffle masks to not be a vector of
29 // MaskEltSizeInBits because the constant pool uniques constants by their
30 // bit representation.
Craig Topper69653af2015-12-31 22:40:45 +000031 // e.g. the following take up the same space in the constant pool:
32 // i128 -170141183420855150465331762880109871104
33 //
34 // <2 x i64> <i64 -9223372034707292160, i64 -9223372034707292160>
35 //
36 // <4 x i32> <i32 -2147483648, i32 -2147483648,
37 // i32 -2147483648, i32 -2147483648>
Simon Pilgrim97a48202016-09-29 15:25:48 +000038 Type *CstTy = C->getType();
39 if (!CstTy->isVectorTy())
40 return false;
Craig Topper69653af2015-12-31 22:40:45 +000041
Simon Pilgrim97a48202016-09-29 15:25:48 +000042 Type *CstEltTy = CstTy->getVectorElementType();
43 if (!CstEltTy->isIntegerTy())
44 return false;
Craig Topper69653af2015-12-31 22:40:45 +000045
Simon Pilgrim97a48202016-09-29 15:25:48 +000046 unsigned CstSizeInBits = CstTy->getPrimitiveSizeInBits();
47 unsigned CstEltSizeInBits = CstTy->getScalarSizeInBits();
48 unsigned NumCstElts = CstTy->getVectorNumElements();
Craig Topper69653af2015-12-31 22:40:45 +000049
Simon Pilgrime86b7e22017-03-09 14:06:39 +000050 assert((CstSizeInBits % MaskEltSizeInBits) == 0 &&
51 "Unaligned shuffle mask size");
52
53 unsigned NumMaskElts = CstSizeInBits / MaskEltSizeInBits;
54 UndefElts = APInt(NumMaskElts, 0);
55 RawMask.resize(NumMaskElts, 0);
56
57 // Fast path - if the constants match the mask size then copy direct.
58 if (MaskEltSizeInBits == CstEltSizeInBits) {
59 assert(NumCstElts == NumMaskElts && "Unaligned shuffle mask size");
60 for (unsigned i = 0; i != NumMaskElts; ++i) {
61 Constant *COp = C->getAggregateElement(i);
62 if (!COp || (!isa<UndefValue>(COp) && !isa<ConstantInt>(COp)))
63 return false;
64
65 if (isa<UndefValue>(COp)) {
66 UndefElts.setBit(i);
67 RawMask[i] = 0;
68 continue;
69 }
70
71 auto *Elt = cast<ConstantInt>(COp);
72 RawMask[i] = Elt->getValue().getZExtValue();
73 }
74 return true;
75 }
76
Simon Pilgrim97a48202016-09-29 15:25:48 +000077 // Extract all the undef/constant element data and pack into single bitsets.
78 APInt UndefBits(CstSizeInBits, 0);
79 APInt MaskBits(CstSizeInBits, 0);
80 for (unsigned i = 0; i != NumCstElts; ++i) {
Simon Pilgrim05e48b92016-02-18 10:17:40 +000081 Constant *COp = C->getAggregateElement(i);
Simon Pilgrim97a48202016-09-29 15:25:48 +000082 if (!COp || (!isa<UndefValue>(COp) && !isa<ConstantInt>(COp)))
83 return false;
84
Simon Pilgrim3a895c42017-02-22 15:04:55 +000085 unsigned BitOffset = i * CstEltSizeInBits;
86
Simon Pilgrim97a48202016-09-29 15:25:48 +000087 if (isa<UndefValue>(COp)) {
Simon Pilgrimaed35222017-02-24 10:15:29 +000088 UndefBits.setBits(BitOffset, BitOffset + CstEltSizeInBits);
Simon Pilgrim05e48b92016-02-18 10:17:40 +000089 continue;
90 }
91
Simon Pilgrimb02667c2017-03-10 13:44:32 +000092 MaskBits.insertBits(cast<ConstantInt>(COp)->getValue(), BitOffset);
Craig Topper69653af2015-12-31 22:40:45 +000093 }
Simon Pilgrim05e48b92016-02-18 10:17:40 +000094
Simon Pilgrim97a48202016-09-29 15:25:48 +000095 // Now extract the undef/constant bit data into the raw shuffle masks.
Simon Pilgrim97a48202016-09-29 15:25:48 +000096 for (unsigned i = 0; i != NumMaskElts; ++i) {
Simon Pilgrim0f5fb5f2017-02-25 20:01:58 +000097 unsigned BitOffset = i * MaskEltSizeInBits;
98 APInt EltUndef = UndefBits.extractBits(MaskEltSizeInBits, BitOffset);
Simon Pilgrim97a48202016-09-29 15:25:48 +000099
100 // Only treat the element as UNDEF if all bits are UNDEF, otherwise
101 // treat it as zero.
Simon Pilgrim96ef0c12016-10-23 15:09:44 +0000102 if (EltUndef.isAllOnesValue()) {
Craig Topper53e5a38d2017-02-27 16:15:25 +0000103 UndefElts.setBit(i);
Simon Pilgrim97a48202016-09-29 15:25:48 +0000104 RawMask[i] = 0;
105 continue;
106 }
107
Simon Pilgrim0f5fb5f2017-02-25 20:01:58 +0000108 APInt EltBits = MaskBits.extractBits(MaskEltSizeInBits, BitOffset);
Simon Pilgrim97a48202016-09-29 15:25:48 +0000109 RawMask[i] = EltBits.getZExtValue();
110 }
111
112 return true;
113}
114
115void DecodePSHUFBMask(const Constant *C, SmallVectorImpl<int> &ShuffleMask) {
116 Type *MaskTy = C->getType();
117 unsigned MaskTySize = MaskTy->getPrimitiveSizeInBits();
Douglas Katzman3ace13a2016-09-29 17:26:12 +0000118 (void)MaskTySize;
Simon Pilgrim630dd6f2016-10-01 20:12:56 +0000119 assert((MaskTySize == 128 || MaskTySize == 256 || MaskTySize == 512) &&
120 "Unexpected vector size.");
Simon Pilgrim97a48202016-09-29 15:25:48 +0000121
122 // The shuffle mask requires a byte vector.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000123 APInt UndefElts;
Craig Toppere1be95c2017-02-27 16:15:27 +0000124 SmallVector<uint64_t, 64> RawMask;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000125 if (!extractConstantMask(C, 8, UndefElts, RawMask))
126 return;
127
128 unsigned NumElts = RawMask.size();
129 assert((NumElts == 16 || NumElts == 32 || NumElts == 64) &&
130 "Unexpected number of vector elements.");
131
132 for (unsigned i = 0; i != NumElts; ++i) {
133 if (UndefElts[i]) {
134 ShuffleMask.push_back(SM_SentinelUndef);
135 continue;
136 }
137
138 uint64_t Element = RawMask[i];
139 // If the high bit (7) of the byte is set, the element is zeroed.
140 if (Element & (1 << 7))
141 ShuffleMask.push_back(SM_SentinelZero);
142 else {
143 // For AVX vectors with 32 bytes the base of the shuffle is the 16-byte
144 // lane of the vector we're inside.
145 unsigned Base = i & ~0xf;
146
147 // Only the least significant 4 bits of the byte are used.
148 int Index = Base + (Element & 0xf);
149 ShuffleMask.push_back(Index);
150 }
151 }
Craig Topper69653af2015-12-31 22:40:45 +0000152}
153
154void DecodeVPERMILPMask(const Constant *C, unsigned ElSize,
155 SmallVectorImpl<int> &ShuffleMask) {
156 Type *MaskTy = C->getType();
Simon Pilgrim48d83402016-07-13 15:10:43 +0000157 unsigned MaskTySize = MaskTy->getPrimitiveSizeInBits();
Douglas Katzman3ace13a2016-09-29 17:26:12 +0000158 (void)MaskTySize;
Simon Pilgrim630dd6f2016-10-01 20:12:56 +0000159 assert((MaskTySize == 128 || MaskTySize == 256 || MaskTySize == 512) &&
160 "Unexpected vector size.");
161 assert((ElSize == 32 || ElSize == 64) && "Unexpected vector element size.");
Simon Pilgrim97a48202016-09-29 15:25:48 +0000162
163 // The shuffle mask requires elements the same size as the target.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000164 APInt UndefElts;
Craig Toppere1be95c2017-02-27 16:15:27 +0000165 SmallVector<uint64_t, 16> RawMask;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000166 if (!extractConstantMask(C, ElSize, UndefElts, RawMask))
Craig Topper69653af2015-12-31 22:40:45 +0000167 return;
168
Simon Pilgrim97a48202016-09-29 15:25:48 +0000169 unsigned NumElts = RawMask.size();
170 unsigned NumEltsPerLane = 128 / ElSize;
171 assert((NumElts == 2 || NumElts == 4 || NumElts == 8 || NumElts == 16) &&
Craig Topper69653af2015-12-31 22:40:45 +0000172 "Unexpected number of vector elements.");
Craig Topper69653af2015-12-31 22:40:45 +0000173
Simon Pilgrim97a48202016-09-29 15:25:48 +0000174 for (unsigned i = 0; i != NumElts; ++i) {
175 if (UndefElts[i]) {
Craig Topper69653af2015-12-31 22:40:45 +0000176 ShuffleMask.push_back(SM_SentinelUndef);
177 continue;
178 }
Simon Pilgrim97a48202016-09-29 15:25:48 +0000179
180 int Index = i & ~(NumEltsPerLane - 1);
181 uint64_t Element = RawMask[i];
Craig Topper69653af2015-12-31 22:40:45 +0000182 if (ElSize == 64)
183 Index += (Element >> 1) & 0x1;
184 else
185 Index += Element & 0x3;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000186
Craig Topper69653af2015-12-31 22:40:45 +0000187 ShuffleMask.push_back(Index);
188 }
Craig Topper69653af2015-12-31 22:40:45 +0000189}
190
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000191void DecodeVPERMIL2PMask(const Constant *C, unsigned M2Z, unsigned ElSize,
192 SmallVectorImpl<int> &ShuffleMask) {
193 Type *MaskTy = C->getType();
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000194 unsigned MaskTySize = MaskTy->getPrimitiveSizeInBits();
Douglas Katzman3ace13a2016-09-29 17:26:12 +0000195 (void)MaskTySize;
Simon Pilgrim630dd6f2016-10-01 20:12:56 +0000196 assert((MaskTySize == 128 || MaskTySize == 256) && "Unexpected vector size.");
Simon Pilgrim97a48202016-09-29 15:25:48 +0000197
198 // The shuffle mask requires elements the same size as the target.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000199 APInt UndefElts;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000200 SmallVector<uint64_t, 8> RawMask;
201 if (!extractConstantMask(C, ElSize, UndefElts, RawMask))
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000202 return;
203
Simon Pilgrim97a48202016-09-29 15:25:48 +0000204 unsigned NumElts = RawMask.size();
205 unsigned NumEltsPerLane = 128 / ElSize;
206 assert((NumElts == 2 || NumElts == 4 || NumElts == 8) &&
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000207 "Unexpected number of vector elements.");
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000208
Simon Pilgrim97a48202016-09-29 15:25:48 +0000209 for (unsigned i = 0; i != NumElts; ++i) {
210 if (UndefElts[i]) {
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000211 ShuffleMask.push_back(SM_SentinelUndef);
212 continue;
213 }
214
215 // VPERMIL2 Operation.
216 // Bits[3] - Match Bit.
217 // Bits[2:1] - (Per Lane) PD Shuffle Mask.
218 // Bits[2:0] - (Per Lane) PS Shuffle Mask.
Simon Pilgrim97a48202016-09-29 15:25:48 +0000219 uint64_t Selector = RawMask[i];
Chandler Carruth4c0e94d2016-06-11 09:13:00 +0000220 unsigned MatchBit = (Selector >> 3) & 0x1;
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000221
222 // M2Z[0:1] MatchBit
223 // 0Xb X Source selected by Selector index.
224 // 10b 0 Source selected by Selector index.
225 // 10b 1 Zero.
226 // 11b 0 Zero.
227 // 11b 1 Source selected by Selector index.
Chandler Carruth306e2702016-06-11 08:02:01 +0000228 if ((M2Z & 0x2) != 0u && MatchBit != (M2Z & 0x1)) {
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000229 ShuffleMask.push_back(SM_SentinelZero);
230 continue;
231 }
232
Simon Pilgrim97a48202016-09-29 15:25:48 +0000233 int Index = i & ~(NumEltsPerLane - 1);
Simon Pilgrim163987a2016-06-05 14:33:43 +0000234 if (ElSize == 64)
235 Index += (Selector >> 1) & 0x1;
236 else
237 Index += Selector & 0x3;
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000238
239 int Src = (Selector >> 2) & 0x1;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000240 Index += Src * NumElts;
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000241 ShuffleMask.push_back(Index);
242 }
Simon Pilgrim2ead8612016-06-04 21:44:28 +0000243}
244
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000245void DecodeVPPERMMask(const Constant *C, SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrim630dd6f2016-10-01 20:12:56 +0000246 assert(C->getType()->getPrimitiveSizeInBits() == 128 &&
247 "Unexpected vector size.");
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000248
Simon Pilgrim97a48202016-09-29 15:25:48 +0000249 // The shuffle mask requires a byte vector.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000250 APInt UndefElts;
Craig Toppere1be95c2017-02-27 16:15:27 +0000251 SmallVector<uint64_t, 16> RawMask;
Simon Pilgrim97a48202016-09-29 15:25:48 +0000252 if (!extractConstantMask(C, 8, UndefElts, RawMask))
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000253 return;
254
Simon Pilgrim97a48202016-09-29 15:25:48 +0000255 unsigned NumElts = RawMask.size();
256 assert(NumElts == 16 && "Unexpected number of vector elements.");
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000257
Simon Pilgrim97a48202016-09-29 15:25:48 +0000258 for (unsigned i = 0; i != NumElts; ++i) {
259 if (UndefElts[i]) {
260 ShuffleMask.push_back(SM_SentinelUndef);
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000261 continue;
262 }
263
264 // VPPERM Operation
265 // Bits[4:0] - Byte Index (0 - 31)
266 // Bits[7:5] - Permute Operation
267 //
268 // Permute Operation:
269 // 0 - Source byte (no logical operation).
270 // 1 - Invert source byte.
271 // 2 - Bit reverse of source byte.
272 // 3 - Bit reverse of inverted source byte.
273 // 4 - 00h (zero - fill).
274 // 5 - FFh (ones - fill).
275 // 6 - Most significant bit of source byte replicated in all bit positions.
Simon Pilgrim97a48202016-09-29 15:25:48 +0000276 // 7 - Invert most significant bit of source byte and replicate in all bit
277 // positions.
278 uint64_t Element = RawMask[i];
279 uint64_t Index = Element & 0x1F;
280 uint64_t PermuteOp = (Element >> 5) & 0x7;
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000281
Simon Pilgrim97a48202016-09-29 15:25:48 +0000282 if (PermuteOp == 4) {
283 ShuffleMask.push_back(SM_SentinelZero);
284 continue;
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000285 }
Simon Pilgrim97a48202016-09-29 15:25:48 +0000286 if (PermuteOp != 0) {
287 ShuffleMask.clear();
288 return;
289 }
290 ShuffleMask.push_back((int)Index);
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000291 }
Simon Pilgrim1cc57122016-04-09 14:51:26 +0000292}
293
Craig Topper448358b2016-10-18 04:48:33 +0000294void DecodeVPERMVMask(const Constant *C, unsigned ElSize,
Craig Topper69653af2015-12-31 22:40:45 +0000295 SmallVectorImpl<int> &ShuffleMask) {
296 Type *MaskTy = C->getType();
Craig Topper448358b2016-10-18 04:48:33 +0000297 unsigned MaskTySize = MaskTy->getPrimitiveSizeInBits();
298 (void)MaskTySize;
299 assert((MaskTySize == 128 || MaskTySize == 256 || MaskTySize == 512) &&
300 "Unexpected vector size.");
301 assert((ElSize == 8 || ElSize == 16 || ElSize == 32 || ElSize == 64) &&
302 "Unexpected vector element size.");
303
304 // The shuffle mask requires elements the same size as the target.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000305 APInt UndefElts;
Craig Toppere1be95c2017-02-27 16:15:27 +0000306 SmallVector<uint64_t, 64> RawMask;
Craig Topper448358b2016-10-18 04:48:33 +0000307 if (!extractConstantMask(C, ElSize, UndefElts, RawMask))
308 return;
309
310 unsigned NumElts = RawMask.size();
311
312 for (unsigned i = 0; i != NumElts; ++i) {
313 if (UndefElts[i]) {
314 ShuffleMask.push_back(SM_SentinelUndef);
315 continue;
Craig Topper69653af2015-12-31 22:40:45 +0000316 }
Craig Topper448358b2016-10-18 04:48:33 +0000317 int Index = RawMask[i] & (NumElts - 1);
318 ShuffleMask.push_back(Index);
Craig Topper69653af2015-12-31 22:40:45 +0000319 }
Craig Topper69653af2015-12-31 22:40:45 +0000320}
321
Craig Topper7268bf92016-10-18 04:00:32 +0000322void DecodeVPERMV3Mask(const Constant *C, unsigned ElSize,
Craig Topper69653af2015-12-31 22:40:45 +0000323 SmallVectorImpl<int> &ShuffleMask) {
324 Type *MaskTy = C->getType();
Craig Topper7268bf92016-10-18 04:00:32 +0000325 unsigned MaskTySize = MaskTy->getPrimitiveSizeInBits();
326 (void)MaskTySize;
327 assert((MaskTySize == 128 || MaskTySize == 256 || MaskTySize == 512) &&
328 "Unexpected vector size.");
329 assert((ElSize == 8 || ElSize == 16 || ElSize == 32 || ElSize == 64) &&
330 "Unexpected vector element size.");
331
332 // The shuffle mask requires elements the same size as the target.
Craig Topper53e5a38d2017-02-27 16:15:25 +0000333 APInt UndefElts;
Craig Toppere1be95c2017-02-27 16:15:27 +0000334 SmallVector<uint64_t, 64> RawMask;
Craig Topper7268bf92016-10-18 04:00:32 +0000335 if (!extractConstantMask(C, ElSize, UndefElts, RawMask))
336 return;
337
338 unsigned NumElts = RawMask.size();
339
340 for (unsigned i = 0; i != NumElts; ++i) {
341 if (UndefElts[i]) {
342 ShuffleMask.push_back(SM_SentinelUndef);
343 continue;
Craig Topper69653af2015-12-31 22:40:45 +0000344 }
Craig Topper7268bf92016-10-18 04:00:32 +0000345 int Index = RawMask[i] & (NumElts*2 - 1);
346 ShuffleMask.push_back(Index);
Craig Topper69653af2015-12-31 22:40:45 +0000347 }
348}
349} // llvm namespace