blob: fe567f4cece82fb3521fe291c8258a76938023cc [file] [log] [blame]
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +00001//===-- X86ShuffleDecode.cpp - X86 shuffle decode logic -------------------===//
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 into a
11// generic vector mask.
12//
13//===----------------------------------------------------------------------===//
14
15#include "X86ShuffleDecode.h"
Mehdi Aminib550cb12016-04-18 09:17:29 +000016#include "llvm/ADT/ArrayRef.h"
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000017
18//===----------------------------------------------------------------------===//
19// Vector Mask Decoding
20//===----------------------------------------------------------------------===//
21
22namespace llvm {
23
24void DecodeINSERTPSMask(unsigned Imm, SmallVectorImpl<int> &ShuffleMask) {
25 // Defaults the copying the dest value.
26 ShuffleMask.push_back(0);
27 ShuffleMask.push_back(1);
28 ShuffleMask.push_back(2);
29 ShuffleMask.push_back(3);
30
31 // Decode the immediate.
32 unsigned ZMask = Imm & 15;
33 unsigned CountD = (Imm >> 4) & 3;
34 unsigned CountS = (Imm >> 6) & 3;
35
36 // CountS selects which input element to use.
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +000037 unsigned InVal = 4 + CountS;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000038 // CountD specifies which element of destination to update.
39 ShuffleMask[CountD] = InVal;
40 // ZMask zaps values, potentially overriding the CountD elt.
41 if (ZMask & 1) ShuffleMask[0] = SM_SentinelZero;
42 if (ZMask & 2) ShuffleMask[1] = SM_SentinelZero;
43 if (ZMask & 4) ShuffleMask[2] = SM_SentinelZero;
44 if (ZMask & 8) ShuffleMask[3] = SM_SentinelZero;
45}
46
Craig Topperacaba3b2018-03-12 16:43:11 +000047void DecodeInsertElementMask(unsigned NumElts, unsigned Idx, unsigned Len,
Simon Pilgrima3d67442016-02-07 15:39:22 +000048 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrima3d67442016-02-07 15:39:22 +000049 assert((Idx + Len) <= NumElts && "Insertion out of range");
50
51 for (unsigned i = 0; i != NumElts; ++i)
52 ShuffleMask.push_back(i);
53 for (unsigned i = 0; i != Len; ++i)
54 ShuffleMask[Idx + i] = NumElts + i;
55}
56
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000057// <3,1> or <6,7,2,3>
58void DecodeMOVHLPSMask(unsigned NElts, SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +000059 for (unsigned i = NElts / 2; i != NElts; ++i)
60 ShuffleMask.push_back(NElts + i);
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000061
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +000062 for (unsigned i = NElts / 2; i != NElts; ++i)
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000063 ShuffleMask.push_back(i);
64}
65
66// <0,2> or <0,1,4,5>
67void DecodeMOVLHPSMask(unsigned NElts, SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +000068 for (unsigned i = 0; i != NElts / 2; ++i)
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000069 ShuffleMask.push_back(i);
70
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +000071 for (unsigned i = 0; i != NElts / 2; ++i)
72 ShuffleMask.push_back(NElts + i);
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000073}
74
Craig Topperacaba3b2018-03-12 16:43:11 +000075void DecodeMOVSLDUPMask(unsigned NumElts, SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000076 for (int i = 0, e = NumElts / 2; i < e; ++i) {
77 ShuffleMask.push_back(2 * i);
78 ShuffleMask.push_back(2 * i);
79 }
80}
81
Craig Topperacaba3b2018-03-12 16:43:11 +000082void DecodeMOVSHDUPMask(unsigned NumElts, SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000083 for (int i = 0, e = NumElts / 2; i < e; ++i) {
84 ShuffleMask.push_back(2 * i + 1);
85 ShuffleMask.push_back(2 * i + 1);
86 }
87}
88
Craig Topperacaba3b2018-03-12 16:43:11 +000089void DecodeMOVDDUPMask(unsigned NumElts, SmallVectorImpl<int> &ShuffleMask) {
90 const unsigned NumLaneElts = 2;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000091
92 for (unsigned l = 0; l < NumElts; l += NumLaneElts)
Craig Topperacaba3b2018-03-12 16:43:11 +000093 for (unsigned i = 0; i < NumLaneElts; ++i)
94 ShuffleMask.push_back(l);
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +000095}
96
Craig Topperacaba3b2018-03-12 16:43:11 +000097void DecodePSLLDQMask(unsigned NumElts, unsigned Imm,
98 SmallVectorImpl<int> &ShuffleMask) {
99 const unsigned NumLaneElts = 16;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000100
101 for (unsigned l = 0; l < NumElts; l += NumLaneElts)
102 for (unsigned i = 0; i < NumLaneElts; ++i) {
103 int M = SM_SentinelZero;
104 if (i >= Imm) M = i - Imm + l;
105 ShuffleMask.push_back(M);
106 }
107}
108
Craig Topperacaba3b2018-03-12 16:43:11 +0000109void DecodePSRLDQMask(unsigned NumElts, unsigned Imm,
110 SmallVectorImpl<int> &ShuffleMask) {
111 const unsigned NumLaneElts = 16;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000112
113 for (unsigned l = 0; l < NumElts; l += NumLaneElts)
114 for (unsigned i = 0; i < NumLaneElts; ++i) {
115 unsigned Base = i + Imm;
116 int M = Base + l;
117 if (Base >= NumLaneElts) M = SM_SentinelZero;
118 ShuffleMask.push_back(M);
119 }
120}
121
Craig Topperacaba3b2018-03-12 16:43:11 +0000122void DecodePALIGNRMask(unsigned NumElts, unsigned Imm,
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000123 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000124 const unsigned NumLaneElts = 16;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000125
126 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
127 for (unsigned i = 0; i != NumLaneElts; ++i) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000128 unsigned Base = i + Imm;
129 // if i+imm is out of this lane then we actually need the other source
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000130 if (Base >= NumLaneElts) Base += NumElts - NumLaneElts;
131 ShuffleMask.push_back(Base + l);
132 }
133 }
134}
135
Craig Topperacaba3b2018-03-12 16:43:11 +0000136void DecodeVALIGNMask(unsigned NumElts, unsigned Imm,
Craig Topperb084c902016-10-22 06:51:56 +0000137 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperb084c902016-10-22 06:51:56 +0000138 // Not all bits of the immediate are used so mask it.
139 assert(isPowerOf2_32(NumElts) && "NumElts should be power of 2");
140 Imm = Imm & (NumElts - 1);
Craig Topperacaba3b2018-03-12 16:43:11 +0000141 for (unsigned i = 0; i != NumElts; ++i)
Craig Topperb084c902016-10-22 06:51:56 +0000142 ShuffleMask.push_back(i + Imm);
143}
144
Simon Pilgrimf8f86ab2015-09-13 11:28:45 +0000145/// DecodePSHUFMask - This decodes the shuffle masks for pshufw, pshufd, and vpermilp*.
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000146/// VT indicates the type of the vector allowing it to handle different
147/// datatypes and vector widths.
Craig Topperacaba3b2018-03-12 16:43:11 +0000148void DecodePSHUFMask(unsigned NumElts, unsigned ScalarBits, unsigned Imm,
149 SmallVectorImpl<int> &ShuffleMask) {
150 unsigned Size = NumElts * ScalarBits;
151 unsigned NumLanes = Size / 128;
Simon Pilgrimf8f86ab2015-09-13 11:28:45 +0000152 if (NumLanes == 0) NumLanes = 1; // Handle MMX
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000153 unsigned NumLaneElts = NumElts / NumLanes;
154
Craig Topper2ed43282018-06-08 01:09:31 +0000155 uint32_t SplatImm = (Imm & 0xff) * 0x01010101;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000156 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
157 for (unsigned i = 0; i != NumLaneElts; ++i) {
Craig Topper2ed43282018-06-08 01:09:31 +0000158 ShuffleMask.push_back(SplatImm % NumLaneElts + l);
159 SplatImm /= NumLaneElts;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000160 }
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000161 }
162}
163
Craig Topperacaba3b2018-03-12 16:43:11 +0000164void DecodePSHUFHWMask(unsigned NumElts, unsigned Imm,
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000165 SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000166 for (unsigned l = 0; l != NumElts; l += 8) {
167 unsigned NewImm = Imm;
168 for (unsigned i = 0, e = 4; i != e; ++i) {
169 ShuffleMask.push_back(l + i);
170 }
171 for (unsigned i = 4, e = 8; i != e; ++i) {
172 ShuffleMask.push_back(l + 4 + (NewImm & 3));
173 NewImm >>= 2;
174 }
175 }
176}
177
Craig Topperacaba3b2018-03-12 16:43:11 +0000178void DecodePSHUFLWMask(unsigned NumElts, unsigned Imm,
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000179 SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000180 for (unsigned l = 0; l != NumElts; l += 8) {
181 unsigned NewImm = Imm;
182 for (unsigned i = 0, e = 4; i != e; ++i) {
183 ShuffleMask.push_back(l + (NewImm & 3));
184 NewImm >>= 2;
185 }
186 for (unsigned i = 4, e = 8; i != e; ++i) {
187 ShuffleMask.push_back(l + i);
188 }
189 }
190}
191
Craig Topperacaba3b2018-03-12 16:43:11 +0000192void DecodePSWAPMask(unsigned NumElts, SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrimf8f86ab2015-09-13 11:28:45 +0000193 unsigned NumHalfElts = NumElts / 2;
194
195 for (unsigned l = 0; l != NumHalfElts; ++l)
196 ShuffleMask.push_back(l + NumHalfElts);
197 for (unsigned h = 0; h != NumHalfElts; ++h)
198 ShuffleMask.push_back(h);
199}
200
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000201/// DecodeSHUFPMask - This decodes the shuffle masks for shufp*. VT indicates
202/// the type of the vector allowing it to handle different datatypes and vector
203/// widths.
Craig Topperacaba3b2018-03-12 16:43:11 +0000204void DecodeSHUFPMask(unsigned NumElts, unsigned ScalarBits,
205 unsigned Imm, SmallVectorImpl<int> &ShuffleMask) {
206 unsigned NumLaneElts = 128 / ScalarBits;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000207
208 unsigned NewImm = Imm;
209 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
210 // each half of a lane comes from different source
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +0000211 for (unsigned s = 0; s != NumElts * 2; s += NumElts) {
212 for (unsigned i = 0; i != NumLaneElts / 2; ++i) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000213 ShuffleMask.push_back(NewImm % NumLaneElts + s + l);
214 NewImm /= NumLaneElts;
215 }
216 }
217 if (NumLaneElts == 4) NewImm = Imm; // reload imm
218 }
219}
220
221/// DecodeUNPCKHMask - This decodes the shuffle masks for unpckhps/unpckhpd
222/// and punpckh*. VT indicates the type of the vector allowing it to handle
223/// different datatypes and vector widths.
Craig Topperacaba3b2018-03-12 16:43:11 +0000224void DecodeUNPCKHMask(unsigned NumElts, unsigned ScalarBits,
225 SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000226 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
227 // independently on 128-bit lanes.
Craig Topperacaba3b2018-03-12 16:43:11 +0000228 unsigned NumLanes = (NumElts * ScalarBits) / 128;
Simon Pilgrimf8f86ab2015-09-13 11:28:45 +0000229 if (NumLanes == 0) NumLanes = 1; // Handle MMX
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000230 unsigned NumLaneElts = NumElts / NumLanes;
231
232 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +0000233 for (unsigned i = l + NumLaneElts / 2, e = l + NumLaneElts; i != e; ++i) {
234 ShuffleMask.push_back(i); // Reads from dest/src1
235 ShuffleMask.push_back(i + NumElts); // Reads from src/src2
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000236 }
237 }
238}
239
240/// DecodeUNPCKLMask - This decodes the shuffle masks for unpcklps/unpcklpd
241/// and punpckl*. VT indicates the type of the vector allowing it to handle
242/// different datatypes and vector widths.
Craig Topperacaba3b2018-03-12 16:43:11 +0000243void DecodeUNPCKLMask(unsigned NumElts, unsigned ScalarBits,
244 SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000245 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
246 // independently on 128-bit lanes.
Craig Topperacaba3b2018-03-12 16:43:11 +0000247 unsigned NumLanes = (NumElts * ScalarBits) / 128;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000248 if (NumLanes == 0 ) NumLanes = 1; // Handle MMX
249 unsigned NumLaneElts = NumElts / NumLanes;
250
251 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +0000252 for (unsigned i = l, e = l + NumLaneElts / 2; i != e; ++i) {
253 ShuffleMask.push_back(i); // Reads from dest/src1
254 ShuffleMask.push_back(i + NumElts); // Reads from src/src2
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000255 }
256 }
257}
258
Simon Pilgrimc941f6b2016-07-18 17:32:59 +0000259/// Decodes a broadcast of the first element of a vector.
Craig Topperacaba3b2018-03-12 16:43:11 +0000260void DecodeVectorBroadcast(unsigned NumElts,
261 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrimc941f6b2016-07-18 17:32:59 +0000262 ShuffleMask.append(NumElts, 0);
263}
264
Simon Pilgrima76a8e52016-07-14 12:07:43 +0000265/// Decodes a broadcast of a subvector to a larger vector type.
Craig Topperacaba3b2018-03-12 16:43:11 +0000266void DecodeSubVectorBroadcast(unsigned DstNumElts, unsigned SrcNumElts,
Simon Pilgrima76a8e52016-07-14 12:07:43 +0000267 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000268 unsigned Scale = DstNumElts / SrcNumElts;
Simon Pilgrima76a8e52016-07-14 12:07:43 +0000269
270 for (unsigned i = 0; i != Scale; ++i)
Craig Topperacaba3b2018-03-12 16:43:11 +0000271 for (unsigned j = 0; j != SrcNumElts; ++j)
Simon Pilgrima76a8e52016-07-14 12:07:43 +0000272 ShuffleMask.push_back(j);
273}
274
Adrian Prantl5f8f34e42018-05-01 15:54:18 +0000275/// Decode a shuffle packed values at 128-bit granularity
Igor Bregerd7bae452015-10-15 13:29:07 +0000276/// (SHUFF32x4/SHUFF64x2/SHUFI32x4/SHUFI64x2)
277/// immediate mask into a shuffle mask.
Craig Topperacaba3b2018-03-12 16:43:11 +0000278void decodeVSHUF64x2FamilyMask(unsigned NumElts, unsigned ScalarSize,
279 unsigned Imm,
280 SmallVectorImpl<int> &ShuffleMask) {
281 unsigned NumElementsInLane = 128 / ScalarSize;
282 unsigned NumLanes = NumElts / NumElementsInLane;
Igor Bregerd7bae452015-10-15 13:29:07 +0000283
Craig Topper2ed43282018-06-08 01:09:31 +0000284 for (unsigned l = 0; l != NumElts; l += NumElementsInLane) {
285 unsigned Index = (Imm % NumLanes) * NumElementsInLane;
286 Imm /= NumLanes; // Discard the bits we just used.
Igor Bregerd7bae452015-10-15 13:29:07 +0000287 // We actually need the other source.
Craig Topper2ed43282018-06-08 01:09:31 +0000288 if (l >= (NumElts / 2))
289 Index += NumElts;
Igor Bregerd7bae452015-10-15 13:29:07 +0000290 for (unsigned i = 0; i != NumElementsInLane; ++i)
Craig Topper2ed43282018-06-08 01:09:31 +0000291 ShuffleMask.push_back(Index + i);
Igor Bregerd7bae452015-10-15 13:29:07 +0000292 }
293}
294
Craig Topperacaba3b2018-03-12 16:43:11 +0000295void DecodeVPERM2X128Mask(unsigned NumElts, unsigned Imm,
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000296 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000297 unsigned HalfSize = NumElts / 2;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000298
299 for (unsigned l = 0; l != 2; ++l) {
Simon Pilgrim40343e62015-07-06 22:46:46 +0000300 unsigned HalfMask = Imm >> (l * 4);
301 unsigned HalfBegin = (HalfMask & 0x3) * HalfSize;
NAKAMURA Takumi5582a6a2015-05-25 01:43:34 +0000302 for (unsigned i = HalfBegin, e = HalfBegin + HalfSize; i != e; ++i)
Denis Protivenskyb6129022015-07-07 07:48:48 +0000303 ShuffleMask.push_back(HalfMask & 8 ? SM_SentinelZero : (int)i);
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000304 }
305}
306
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000307void DecodePSHUFBMask(ArrayRef<uint64_t> RawMask,
308 SmallVectorImpl<int> &ShuffleMask) {
309 for (int i = 0, e = RawMask.size(); i < e; ++i) {
310 uint64_t M = RawMask[i];
311 if (M == (uint64_t)SM_SentinelUndef) {
312 ShuffleMask.push_back(M);
313 continue;
314 }
Simon Pilgrimf33cb612016-03-03 21:55:01 +0000315 // For 256/512-bit vectors the base of the shuffle is the 128-bit
316 // subvector we're inside.
317 int Base = (i / 16) * 16;
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000318 // If the high bit (7) of the byte is set, the element is zeroed.
319 if (M & (1 << 7))
320 ShuffleMask.push_back(SM_SentinelZero);
321 else {
322 // Only the least significant 4 bits of the byte are used.
323 int Index = Base + (M & 0xf);
324 ShuffleMask.push_back(Index);
325 }
326 }
327}
328
Craig Topperacaba3b2018-03-12 16:43:11 +0000329void DecodeBLENDMask(unsigned NumElts, unsigned Imm,
330 SmallVectorImpl<int> &ShuffleMask) {
331 for (unsigned i = 0; i < NumElts; ++i) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000332 // If there are more than 8 elements in the vector, then any immediate blend
Craig Topperacaba3b2018-03-12 16:43:11 +0000333 // mask wraps around.
334 unsigned Bit = i % 8;
335 ShuffleMask.push_back(((Imm >> Bit) & 1) ? NumElts + i : i);
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000336 }
337}
338
Simon Pilgrimfd4b9b02016-04-16 17:52:07 +0000339void DecodeVPPERMMask(ArrayRef<uint64_t> RawMask,
340 SmallVectorImpl<int> &ShuffleMask) {
341 assert(RawMask.size() == 16 && "Illegal VPPERM shuffle mask size");
342
343 // VPPERM Operation
344 // Bits[4:0] - Byte Index (0 - 31)
345 // Bits[7:5] - Permute Operation
346 //
347 // Permute Operation:
348 // 0 - Source byte (no logical operation).
349 // 1 - Invert source byte.
350 // 2 - Bit reverse of source byte.
351 // 3 - Bit reverse of inverted source byte.
352 // 4 - 00h (zero - fill).
353 // 5 - FFh (ones - fill).
354 // 6 - Most significant bit of source byte replicated in all bit positions.
355 // 7 - Invert most significant bit of source byte and replicate in all bit positions.
356 for (int i = 0, e = RawMask.size(); i < e; ++i) {
357 uint64_t M = RawMask[i];
358 if (M == (uint64_t)SM_SentinelUndef) {
359 ShuffleMask.push_back(M);
360 continue;
361 }
362
Simon Pilgrimf379a6c2016-04-24 15:05:04 +0000363 uint64_t PermuteOp = (M >> 5) & 0x7;
Simon Pilgrimfd4b9b02016-04-16 17:52:07 +0000364 if (PermuteOp == 4) {
365 ShuffleMask.push_back(SM_SentinelZero);
366 continue;
367 }
368 if (PermuteOp != 0) {
369 ShuffleMask.clear();
370 return;
371 }
372
373 uint64_t Index = M & 0x1F;
374 ShuffleMask.push_back((int)Index);
375 }
376}
377
Simon Pilgrima0d73832016-07-03 18:27:37 +0000378/// DecodeVPERMMask - this decodes the shuffle masks for VPERMQ/VPERMPD.
Craig Topperacaba3b2018-03-12 16:43:11 +0000379void DecodeVPERMMask(unsigned NumElts, unsigned Imm,
380 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrima0d73832016-07-03 18:27:37 +0000381 for (unsigned l = 0; l != NumElts; l += 4)
382 for (unsigned i = 0; i != 4; ++i)
383 ShuffleMask.push_back(l + ((Imm >> (2 * i)) & 3));
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000384}
385
Craig Topperacaba3b2018-03-12 16:43:11 +0000386void DecodeZeroExtendMask(unsigned SrcScalarBits, unsigned DstScalarBits,
387 unsigned NumDstElts, SmallVectorImpl<int> &Mask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000388 unsigned Scale = DstScalarBits / SrcScalarBits;
389 assert(SrcScalarBits < DstScalarBits &&
390 "Expected zero extension mask to increase scalar size");
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000391
392 for (unsigned i = 0; i != NumDstElts; i++) {
393 Mask.push_back(i);
394 for (unsigned j = 1; j != Scale; j++)
395 Mask.push_back(SM_SentinelZero);
396 }
397}
398
Craig Topperacaba3b2018-03-12 16:43:11 +0000399void DecodeZeroMoveLowMask(unsigned NumElts,
400 SmallVectorImpl<int> &ShuffleMask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000401 ShuffleMask.push_back(0);
402 for (unsigned i = 1; i < NumElts; i++)
403 ShuffleMask.push_back(SM_SentinelZero);
404}
405
Craig Topperacaba3b2018-03-12 16:43:11 +0000406void DecodeScalarMoveMask(unsigned NumElts, bool IsLoad,
407 SmallVectorImpl<int> &Mask) {
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000408 // First element comes from the first element of second source.
409 // Remaining elements: Load zero extends / Move copies from first source.
NAKAMURA Takumifb3bd712015-05-25 01:43:23 +0000410 Mask.push_back(NumElts);
411 for (unsigned i = 1; i < NumElts; i++)
412 Mask.push_back(IsLoad ? static_cast<int>(SM_SentinelZero) : i);
413}
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000414
Craig Topperacaba3b2018-03-12 16:43:11 +0000415void DecodeEXTRQIMask(unsigned NumElts, unsigned EltSize, int Len, int Idx,
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000416 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000417 unsigned HalfElts = NumElts / 2;
418
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000419 // Only the bottom 6 bits are valid for each immediate.
420 Len &= 0x3F;
421 Idx &= 0x3F;
422
423 // We can only decode this bit extraction instruction as a shuffle if both the
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000424 // length and index work with whole elements.
425 if (0 != (Len % EltSize) || 0 != (Idx % EltSize))
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000426 return;
427
428 // A length of zero is equivalent to a bit length of 64.
429 if (Len == 0)
430 Len = 64;
431
432 // If the length + index exceeds the bottom 64 bits the result is undefined.
433 if ((Len + Idx) > 64) {
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000434 ShuffleMask.append(NumElts, SM_SentinelUndef);
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000435 return;
436 }
437
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000438 // Convert index and index to work with elements.
439 Len /= EltSize;
440 Idx /= EltSize;
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000441
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000442 // EXTRQ: Extract Len elements starting from Idx. Zero pad the remaining
443 // elements of the lower 64-bits. The upper 64-bits are undefined.
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000444 for (int i = 0; i != Len; ++i)
445 ShuffleMask.push_back(i + Idx);
Simon Pilgrimf809c5f2017-07-04 17:42:01 +0000446 for (int i = Len; i != (int)HalfElts; ++i)
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000447 ShuffleMask.push_back(SM_SentinelZero);
Simon Pilgrimf809c5f2017-07-04 17:42:01 +0000448 for (int i = HalfElts; i != (int)NumElts; ++i)
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000449 ShuffleMask.push_back(SM_SentinelUndef);
450}
451
Craig Topperacaba3b2018-03-12 16:43:11 +0000452void DecodeINSERTQIMask(unsigned NumElts, unsigned EltSize, int Len, int Idx,
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000453 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000454 unsigned HalfElts = NumElts / 2;
455
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000456 // Only the bottom 6 bits are valid for each immediate.
457 Len &= 0x3F;
458 Idx &= 0x3F;
459
460 // We can only decode this bit insertion instruction as a shuffle if both the
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000461 // length and index work with whole elements.
462 if (0 != (Len % EltSize) || 0 != (Idx % EltSize))
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000463 return;
464
465 // A length of zero is equivalent to a bit length of 64.
466 if (Len == 0)
467 Len = 64;
468
469 // If the length + index exceeds the bottom 64 bits the result is undefined.
470 if ((Len + Idx) > 64) {
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000471 ShuffleMask.append(NumElts, SM_SentinelUndef);
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000472 return;
473 }
474
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000475 // Convert index and index to work with elements.
476 Len /= EltSize;
477 Idx /= EltSize;
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000478
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000479 // INSERTQ: Extract lowest Len elements from lower half of second source and
480 // insert over first source starting at Idx element. The upper 64-bits are
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000481 // undefined.
482 for (int i = 0; i != Idx; ++i)
483 ShuffleMask.push_back(i);
484 for (int i = 0; i != Len; ++i)
Simon Pilgrim9f0a0bd2017-07-04 16:53:12 +0000485 ShuffleMask.push_back(i + NumElts);
Simon Pilgrimf809c5f2017-07-04 17:42:01 +0000486 for (int i = Idx + Len; i != (int)HalfElts; ++i)
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000487 ShuffleMask.push_back(i);
Simon Pilgrimf809c5f2017-07-04 17:42:01 +0000488 for (int i = HalfElts; i != (int)NumElts; ++i)
Simon Pilgrimd85cae32015-07-06 20:46:41 +0000489 ShuffleMask.push_back(SM_SentinelUndef);
490}
491
Craig Topperacaba3b2018-03-12 16:43:11 +0000492void DecodeVPERMILPMask(unsigned NumElts, unsigned ScalarBits,
493 ArrayRef<uint64_t> RawMask,
Simon Pilgrim40e1a712016-03-05 22:53:31 +0000494 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000495 unsigned VecSize = NumElts * ScalarBits;
Simon Pilgrim40e1a712016-03-05 22:53:31 +0000496 unsigned NumLanes = VecSize / 128;
Craig Topperacaba3b2018-03-12 16:43:11 +0000497 unsigned NumEltsPerLane = NumElts / NumLanes;
Simon Pilgrim40e1a712016-03-05 22:53:31 +0000498 assert((VecSize == 128 || VecSize == 256 || VecSize == 512) &&
499 "Unexpected vector size");
Craig Topperacaba3b2018-03-12 16:43:11 +0000500 assert((ScalarBits == 32 || ScalarBits == 64) && "Unexpected element size");
Simon Pilgrim40e1a712016-03-05 22:53:31 +0000501
502 for (unsigned i = 0, e = RawMask.size(); i < e; ++i) {
503 uint64_t M = RawMask[i];
Craig Topperacaba3b2018-03-12 16:43:11 +0000504 M = (ScalarBits == 64 ? ((M >> 1) & 0x1) : (M & 0x3));
Simon Pilgrim40e1a712016-03-05 22:53:31 +0000505 unsigned LaneOffset = i & ~(NumEltsPerLane - 1);
506 ShuffleMask.push_back((int)(LaneOffset + M));
507 }
508}
509
Craig Topperacaba3b2018-03-12 16:43:11 +0000510void DecodeVPERMIL2PMask(unsigned NumElts, unsigned ScalarBits, unsigned M2Z,
511 ArrayRef<uint64_t> RawMask,
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000512 SmallVectorImpl<int> &ShuffleMask) {
Craig Topperacaba3b2018-03-12 16:43:11 +0000513 unsigned VecSize = NumElts * ScalarBits;
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000514 unsigned NumLanes = VecSize / 128;
Simon Pilgrimd5bc5c12016-12-07 11:19:00 +0000515 unsigned NumEltsPerLane = NumElts / NumLanes;
516 assert((VecSize == 128 || VecSize == 256) && "Unexpected vector size");
Craig Topperacaba3b2018-03-12 16:43:11 +0000517 assert((ScalarBits == 32 || ScalarBits == 64) && "Unexpected element size");
Simon Pilgrimd5bc5c12016-12-07 11:19:00 +0000518 assert((NumElts == RawMask.size()) && "Unexpected mask size");
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000519
520 for (unsigned i = 0, e = RawMask.size(); i < e; ++i) {
521 // VPERMIL2 Operation.
522 // Bits[3] - Match Bit.
523 // Bits[2:1] - (Per Lane) PD Shuffle Mask.
524 // Bits[2:0] - (Per Lane) PS Shuffle Mask.
525 uint64_t Selector = RawMask[i];
Filipe Cabecinhas6e7d5462016-06-06 10:49:56 +0000526 unsigned MatchBit = (Selector >> 3) & 0x1;
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000527
528 // M2Z[0:1] MatchBit
529 // 0Xb X Source selected by Selector index.
530 // 10b 0 Source selected by Selector index.
531 // 10b 1 Zero.
532 // 11b 0 Zero.
533 // 11b 1 Source selected by Selector index.
534 if ((M2Z & 0x2) != 0 && MatchBit != (M2Z & 0x1)) {
535 ShuffleMask.push_back(SM_SentinelZero);
536 continue;
537 }
538
Simon Pilgrimd5bc5c12016-12-07 11:19:00 +0000539 int Index = i & ~(NumEltsPerLane - 1);
Craig Topperacaba3b2018-03-12 16:43:11 +0000540 if (ScalarBits == 64)
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000541 Index += (Selector >> 1) & 0x1;
542 else
543 Index += Selector & 0x3;
544
Simon Pilgrimd5bc5c12016-12-07 11:19:00 +0000545 int Src = (Selector >> 2) & 0x1;
546 Index += Src * NumElts;
547 ShuffleMask.push_back(Index);
Simon Pilgrim64c6de42016-06-05 15:21:30 +0000548 }
549}
550
Elena Demikhovskye88038f2015-09-08 06:38:21 +0000551void DecodeVPERMVMask(ArrayRef<uint64_t> RawMask,
552 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrim48adedf2016-07-05 18:31:17 +0000553 uint64_t EltMaskSize = RawMask.size() - 1;
554 for (auto M : RawMask) {
555 M &= EltMaskSize;
Elena Demikhovskye88038f2015-09-08 06:38:21 +0000556 ShuffleMask.push_back((int)M);
557 }
558}
559
560void DecodeVPERMV3Mask(ArrayRef<uint64_t> RawMask,
561 SmallVectorImpl<int> &ShuffleMask) {
Simon Pilgrim253ca342016-03-06 21:54:52 +0000562 uint64_t EltMaskSize = (RawMask.size() * 2) - 1;
563 for (auto M : RawMask) {
564 M &= EltMaskSize;
Elena Demikhovskye88038f2015-09-08 06:38:21 +0000565 ShuffleMask.push_back((int)M);
566 }
567}
568
Alexander Kornienkof00654e2015-06-23 09:49:53 +0000569} // llvm namespace