1 //===-- X86ISelLowering.cpp - X86 DAG Lowering Implementation -------------===//
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 // This file defines the interfaces that X86 uses to lower LLVM code into a
11 // selection DAG.
12 //
13 //===----------------------------------------------------------------------===//
15 #include "X86ISelLowering.h"
16 #include "Utils/X86ShuffleDecode.h"
17 #include "X86CallingConv.h"
18 #include "X86InstrBuilder.h"
19 #include "X86MachineFunctionInfo.h"
20 #include "X86TargetMachine.h"
21 #include "X86TargetObjectFile.h"
22 #include "llvm/ADT/SmallBitVector.h"
23 #include "llvm/ADT/SmallSet.h"
24 #include "llvm/ADT/Statistic.h"
25 #include "llvm/ADT/StringExtras.h"
26 #include "llvm/ADT/StringSwitch.h"
27 #include "llvm/ADT/VariadicFunction.h"
28 #include "llvm/CodeGen/IntrinsicLowering.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineFunction.h"
31 #include "llvm/CodeGen/MachineInstrBuilder.h"
32 #include "llvm/CodeGen/MachineJumpTableInfo.h"
33 #include "llvm/CodeGen/MachineModuleInfo.h"
34 #include "llvm/CodeGen/MachineRegisterInfo.h"
35 #include "llvm/IR/CallSite.h"
36 #include "llvm/IR/CallingConv.h"
37 #include "llvm/IR/Constants.h"
38 #include "llvm/IR/DerivedTypes.h"
39 #include "llvm/IR/Function.h"
40 #include "llvm/IR/GlobalAlias.h"
41 #include "llvm/IR/GlobalVariable.h"
42 #include "llvm/IR/Instructions.h"
43 #include "llvm/IR/Intrinsics.h"
44 #include "llvm/MC/MCAsmInfo.h"
45 #include "llvm/MC/MCContext.h"
46 #include "llvm/MC/MCExpr.h"
47 #include "llvm/MC/MCSymbol.h"
48 #include "llvm/Support/CommandLine.h"
49 #include "llvm/Support/Debug.h"
50 #include "llvm/Support/ErrorHandling.h"
51 #include "llvm/Support/MathExtras.h"
52 #include "llvm/Target/TargetOptions.h"
53 #include "X86IntrinsicsInfo.h"
54 #include <bitset>
55 #include <numeric>
56 #include <cctype>
57 using namespace llvm;
59 #define DEBUG_TYPE "x86-isel"
61 STATISTIC(NumTailCalls, "Number of tail calls");
63 static cl::opt<bool> ExperimentalVectorWideningLegalization(
64 "x86-experimental-vector-widening-legalization", cl::init(false),
65 cl::desc("Enable an experimental vector type legalization through widening "
66 "rather than promotion."),
67 cl::Hidden);
69 static cl::opt<bool> ExperimentalVectorShuffleLowering(
70 "x86-experimental-vector-shuffle-lowering", cl::init(false),
71 cl::desc("Enable an experimental vector shuffle lowering code path."),
72 cl::Hidden);
74 // Forward declarations.
75 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
76 SDValue V2);
78 static SDValue ExtractSubVector(SDValue Vec, unsigned IdxVal,
79 SelectionDAG &DAG, SDLoc dl,
80 unsigned vectorWidth) {
81 assert((vectorWidth == 128 || vectorWidth == 256) &&
82 "Unsupported vector width");
83 EVT VT = Vec.getValueType();
84 EVT ElVT = VT.getVectorElementType();
85 unsigned Factor = VT.getSizeInBits()/vectorWidth;
86 EVT ResultVT = EVT::getVectorVT(*DAG.getContext(), ElVT,
87 VT.getVectorNumElements()/Factor);
89 // Extract from UNDEF is UNDEF.
90 if (Vec.getOpcode() == ISD::UNDEF)
91 return DAG.getUNDEF(ResultVT);
93 // Extract the relevant vectorWidth bits. Generate an EXTRACT_SUBVECTOR
94 unsigned ElemsPerChunk = vectorWidth / ElVT.getSizeInBits();
96 // This is the index of the first element of the vectorWidth-bit chunk
97 // we want.
98 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits()) / vectorWidth)
99 * ElemsPerChunk);
101 // If the input is a buildvector just emit a smaller one.
102 if (Vec.getOpcode() == ISD::BUILD_VECTOR)
103 return DAG.getNode(ISD::BUILD_VECTOR, dl, ResultVT,
104 makeArrayRef(Vec->op_begin()+NormalizedIdxVal,
105 ElemsPerChunk));
107 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
108 SDValue Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec,
109 VecIdx);
111 return Result;
113 }
114 /// Generate a DAG to grab 128-bits from a vector > 128 bits. This
115 /// sets things up to match to an AVX VEXTRACTF128 / VEXTRACTI128
116 /// or AVX-512 VEXTRACTF32x4 / VEXTRACTI32x4
117 /// instructions or a simple subregister reference. Idx is an index in the
118 /// 128 bits we want. It need not be aligned to a 128-bit bounday. That makes
119 /// lowering EXTRACT_VECTOR_ELT operations easier.
120 static SDValue Extract128BitVector(SDValue Vec, unsigned IdxVal,
121 SelectionDAG &DAG, SDLoc dl) {
122 assert((Vec.getValueType().is256BitVector() ||
123 Vec.getValueType().is512BitVector()) && "Unexpected vector size!");
124 return ExtractSubVector(Vec, IdxVal, DAG, dl, 128);
125 }
127 /// Generate a DAG to grab 256-bits from a 512-bit vector.
128 static SDValue Extract256BitVector(SDValue Vec, unsigned IdxVal,
129 SelectionDAG &DAG, SDLoc dl) {
130 assert(Vec.getValueType().is512BitVector() && "Unexpected vector size!");
131 return ExtractSubVector(Vec, IdxVal, DAG, dl, 256);
132 }
134 static SDValue InsertSubVector(SDValue Result, SDValue Vec,
135 unsigned IdxVal, SelectionDAG &DAG,
136 SDLoc dl, unsigned vectorWidth) {
137 assert((vectorWidth == 128 || vectorWidth == 256) &&
138 "Unsupported vector width");
139 // Inserting UNDEF is Result
140 if (Vec.getOpcode() == ISD::UNDEF)
141 return Result;
142 EVT VT = Vec.getValueType();
143 EVT ElVT = VT.getVectorElementType();
144 EVT ResultVT = Result.getValueType();
146 // Insert the relevant vectorWidth bits.
147 unsigned ElemsPerChunk = vectorWidth/ElVT.getSizeInBits();
149 // This is the index of the first element of the vectorWidth-bit chunk
150 // we want.
151 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits())/vectorWidth)
152 * ElemsPerChunk);
154 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
155 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec,
156 VecIdx);
157 }
158 /// Generate a DAG to put 128-bits into a vector > 128 bits. This
159 /// sets things up to match to an AVX VINSERTF128/VINSERTI128 or
160 /// AVX-512 VINSERTF32x4/VINSERTI32x4 instructions or a
161 /// simple superregister reference. Idx is an index in the 128 bits
162 /// we want. It need not be aligned to a 128-bit bounday. That makes
163 /// lowering INSERT_VECTOR_ELT operations easier.
164 static SDValue Insert128BitVector(SDValue Result, SDValue Vec,
165 unsigned IdxVal, SelectionDAG &DAG,
166 SDLoc dl) {
167 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
168 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
169 }
171 static SDValue Insert256BitVector(SDValue Result, SDValue Vec,
172 unsigned IdxVal, SelectionDAG &DAG,
173 SDLoc dl) {
174 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
175 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
176 }
178 /// Concat two 128-bit vectors into a 256 bit vector using VINSERTF128
179 /// instructions. This is used because creating CONCAT_VECTOR nodes of
180 /// BUILD_VECTORS returns a larger BUILD_VECTOR while we're trying to lower
181 /// large BUILD_VECTORS.
182 static SDValue Concat128BitVectors(SDValue V1, SDValue V2, EVT VT,
183 unsigned NumElems, SelectionDAG &DAG,
184 SDLoc dl) {
185 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
186 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
187 }
189 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
190 unsigned NumElems, SelectionDAG &DAG,
191 SDLoc dl) {
192 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
193 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
194 }
196 static TargetLoweringObjectFile *createTLOF(const Triple &TT) {
197 if (TT.isOSBinFormatMachO()) {
198 if (TT.getArch() == Triple::x86_64)
199 return new X86_64MachoTargetObjectFile();
200 return new TargetLoweringObjectFileMachO();
201 }
203 if (TT.isOSLinux())
204 return new X86LinuxTargetObjectFile();
205 if (TT.isOSBinFormatELF())
206 return new TargetLoweringObjectFileELF();
207 if (TT.isKnownWindowsMSVCEnvironment())
208 return new X86WindowsTargetObjectFile();
209 if (TT.isOSBinFormatCOFF())
210 return new TargetLoweringObjectFileCOFF();
211 llvm_unreachable("unknown subtarget type");
212 }
214 // FIXME: This should stop caching the target machine as soon as
215 // we can remove resetOperationActions et al.
216 X86TargetLowering::X86TargetLowering(X86TargetMachine &TM)
217 : TargetLowering(TM, createTLOF(Triple(TM.getTargetTriple()))) {
218 Subtarget = &TM.getSubtarget<X86Subtarget>();
219 X86ScalarSSEf64 = Subtarget->hasSSE2();
220 X86ScalarSSEf32 = Subtarget->hasSSE1();
221 TD = getDataLayout();
223 resetOperationActions();
224 }
226 void X86TargetLowering::resetOperationActions() {
227 const TargetMachine &TM = getTargetMachine();
228 static bool FirstTimeThrough = true;
230 // If none of the target options have changed, then we don't need to reset the
231 // operation actions.
232 if (!FirstTimeThrough && TO == TM.Options) return;
234 if (!FirstTimeThrough) {
235 // Reinitialize the actions.
236 initActions();
237 FirstTimeThrough = false;
238 }
240 TO = TM.Options;
242 // Set up the TargetLowering object.
243 static const MVT IntVTs[] = { MVT::i8, MVT::i16, MVT::i32, MVT::i64 };
245 // X86 is weird, it always uses i8 for shift amounts and setcc results.
246 setBooleanContents(ZeroOrOneBooleanContent);
247 // X86-SSE is even stranger. It uses -1 or 0 for vector masks.
248 setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);
250 // For 64-bit since we have so many registers use the ILP scheduler, for
251 // 32-bit code use the register pressure specific scheduling.
252 // For Atom, always use ILP scheduling.
253 if (Subtarget->isAtom())
254 setSchedulingPreference(Sched::ILP);
255 else if (Subtarget->is64Bit())
256 setSchedulingPreference(Sched::ILP);
257 else
258 setSchedulingPreference(Sched::RegPressure);
259 const X86RegisterInfo *RegInfo =
260 TM.getSubtarget<X86Subtarget>().getRegisterInfo();
261 setStackPointerRegisterToSaveRestore(RegInfo->getStackRegister());
263 // Bypass expensive divides on Atom when compiling with O2
264 if (Subtarget->hasSlowDivide() && TM.getOptLevel() >= CodeGenOpt::Default) {
265 addBypassSlowDiv(32, 8);
266 if (Subtarget->is64Bit())
267 addBypassSlowDiv(64, 16);
268 }
270 if (Subtarget->isTargetKnownWindowsMSVC()) {
271 // Setup Windows compiler runtime calls.
272 setLibcallName(RTLIB::SDIV_I64, "_alldiv");
273 setLibcallName(RTLIB::UDIV_I64, "_aulldiv");
274 setLibcallName(RTLIB::SREM_I64, "_allrem");
275 setLibcallName(RTLIB::UREM_I64, "_aullrem");
276 setLibcallName(RTLIB::MUL_I64, "_allmul");
277 setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::X86_StdCall);
278 setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::X86_StdCall);
279 setLibcallCallingConv(RTLIB::SREM_I64, CallingConv::X86_StdCall);
280 setLibcallCallingConv(RTLIB::UREM_I64, CallingConv::X86_StdCall);
281 setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::X86_StdCall);
283 // The _ftol2 runtime function has an unusual calling conv, which
284 // is modeled by a special pseudo-instruction.
285 setLibcallName(RTLIB::FPTOUINT_F64_I64, nullptr);
286 setLibcallName(RTLIB::FPTOUINT_F32_I64, nullptr);
287 setLibcallName(RTLIB::FPTOUINT_F64_I32, nullptr);
288 setLibcallName(RTLIB::FPTOUINT_F32_I32, nullptr);
289 }
291 if (Subtarget->isTargetDarwin()) {
292 // Darwin should use _setjmp/_longjmp instead of setjmp/longjmp.
293 setUseUnderscoreSetJmp(false);
294 setUseUnderscoreLongJmp(false);
295 } else if (Subtarget->isTargetWindowsGNU()) {
296 // MS runtime is weird: it exports _setjmp, but longjmp!
297 setUseUnderscoreSetJmp(true);
298 setUseUnderscoreLongJmp(false);
299 } else {
300 setUseUnderscoreSetJmp(true);
301 setUseUnderscoreLongJmp(true);
302 }
304 // Set up the register classes.
305 addRegisterClass(MVT::i8, &X86::GR8RegClass);
306 addRegisterClass(MVT::i16, &X86::GR16RegClass);
307 addRegisterClass(MVT::i32, &X86::GR32RegClass);
308 if (Subtarget->is64Bit())
309 addRegisterClass(MVT::i64, &X86::GR64RegClass);
311 setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
313 // We don't accept any truncstore of integer registers.
314 setTruncStoreAction(MVT::i64, MVT::i32, Expand);
315 setTruncStoreAction(MVT::i64, MVT::i16, Expand);
316 setTruncStoreAction(MVT::i64, MVT::i8 , Expand);
317 setTruncStoreAction(MVT::i32, MVT::i16, Expand);
318 setTruncStoreAction(MVT::i32, MVT::i8 , Expand);
319 setTruncStoreAction(MVT::i16, MVT::i8, Expand);
321 setTruncStoreAction(MVT::f64, MVT::f32, Expand);
323 // SETOEQ and SETUNE require checking two conditions.
324 setCondCodeAction(ISD::SETOEQ, MVT::f32, Expand);
325 setCondCodeAction(ISD::SETOEQ, MVT::f64, Expand);
326 setCondCodeAction(ISD::SETOEQ, MVT::f80, Expand);
327 setCondCodeAction(ISD::SETUNE, MVT::f32, Expand);
328 setCondCodeAction(ISD::SETUNE, MVT::f64, Expand);
329 setCondCodeAction(ISD::SETUNE, MVT::f80, Expand);
331 // Promote all UINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have this
332 // operation.
333 setOperationAction(ISD::UINT_TO_FP , MVT::i1 , Promote);
334 setOperationAction(ISD::UINT_TO_FP , MVT::i8 , Promote);
335 setOperationAction(ISD::UINT_TO_FP , MVT::i16 , Promote);
337 if (Subtarget->is64Bit()) {
338 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Promote);
339 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
340 } else if (!TM.Options.UseSoftFloat) {
341 // We have an algorithm for SSE2->double, and we turn this into a
342 // 64-bit FILD followed by conditional FADD for other targets.
343 setOperationAction(ISD::UINT_TO_FP , MVT::i64 , Custom);
344 // We have an algorithm for SSE2, and we turn this into a 64-bit
345 // FILD for other targets.
346 setOperationAction(ISD::UINT_TO_FP , MVT::i32 , Custom);
347 }
349 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
350 // this operation.
351 setOperationAction(ISD::SINT_TO_FP , MVT::i1 , Promote);
352 setOperationAction(ISD::SINT_TO_FP , MVT::i8 , Promote);
354 if (!TM.Options.UseSoftFloat) {
355 // SSE has no i16 to fp conversion, only i32
356 if (X86ScalarSSEf32) {
357 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
358 // f32 and f64 cases are Legal, f80 case is not
359 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
360 } else {
361 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
362 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
363 }
364 } else {
365 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
366 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
367 }
369 // In 32-bit mode these are custom lowered. In 64-bit mode F32 and F64
370 // are Legal, f80 is custom lowered.
371 setOperationAction(ISD::FP_TO_SINT , MVT::i64 , Custom);
372 setOperationAction(ISD::SINT_TO_FP , MVT::i64 , Custom);
374 // Promote i1/i8 FP_TO_SINT to larger FP_TO_SINTS's, as X86 doesn't have
375 // this operation.
376 setOperationAction(ISD::FP_TO_SINT , MVT::i1 , Promote);
377 setOperationAction(ISD::FP_TO_SINT , MVT::i8 , Promote);
379 if (X86ScalarSSEf32) {
380 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Promote);
381 // f32 and f64 cases are Legal, f80 case is not
382 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
383 } else {
384 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
385 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
386 }
388 // Handle FP_TO_UINT by promoting the destination to a larger signed
389 // conversion.
390 setOperationAction(ISD::FP_TO_UINT , MVT::i1 , Promote);
391 setOperationAction(ISD::FP_TO_UINT , MVT::i8 , Promote);
392 setOperationAction(ISD::FP_TO_UINT , MVT::i16 , Promote);
394 if (Subtarget->is64Bit()) {
395 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Expand);
396 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Promote);
397 } else if (!TM.Options.UseSoftFloat) {
398 // Since AVX is a superset of SSE3, only check for SSE here.
399 if (Subtarget->hasSSE1() && !Subtarget->hasSSE3())
400 // Expand FP_TO_UINT into a select.
401 // FIXME: We would like to use a Custom expander here eventually to do
402 // the optimal thing for SSE vs. the default expansion in the legalizer.
403 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Expand);
404 else
405 // With SSE3 we can use fisttpll to convert to a signed i64; without
406 // SSE, we're stuck with a fistpll.
407 setOperationAction(ISD::FP_TO_UINT , MVT::i32 , Custom);
408 }
410 if (isTargetFTOL()) {
411 // Use the _ftol2 runtime function, which has a pseudo-instruction
412 // to handle its weird calling convention.
413 setOperationAction(ISD::FP_TO_UINT , MVT::i64 , Custom);
414 }
416 // TODO: when we have SSE, these could be more efficient, by using movd/movq.
417 if (!X86ScalarSSEf64) {
418 setOperationAction(ISD::BITCAST , MVT::f32 , Expand);
419 setOperationAction(ISD::BITCAST , MVT::i32 , Expand);
420 if (Subtarget->is64Bit()) {
421 setOperationAction(ISD::BITCAST , MVT::f64 , Expand);
422 // Without SSE, i64->f64 goes through memory.
423 setOperationAction(ISD::BITCAST , MVT::i64 , Expand);
424 }
425 }
427 // Scalar integer divide and remainder are lowered to use operations that
428 // produce two results, to match the available instructions. This exposes
429 // the two-result form to trivial CSE, which is able to combine x/y and x%y
430 // into a single instruction.
431 //
432 // Scalar integer multiply-high is also lowered to use two-result
433 // operations, to match the available instructions. However, plain multiply
434 // (low) operations are left as Legal, as there are single-result
435 // instructions for this in x86. Using the two-result multiply instructions
436 // when both high and low results are needed must be arranged by dagcombine.
437 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
438 MVT VT = IntVTs[i];
439 setOperationAction(ISD::MULHS, VT, Expand);
440 setOperationAction(ISD::MULHU, VT, Expand);
441 setOperationAction(ISD::SDIV, VT, Expand);
442 setOperationAction(ISD::UDIV, VT, Expand);
443 setOperationAction(ISD::SREM, VT, Expand);
444 setOperationAction(ISD::UREM, VT, Expand);
446 // Add/Sub overflow ops with MVT::Glues are lowered to EFLAGS dependences.
447 setOperationAction(ISD::ADDC, VT, Custom);
448 setOperationAction(ISD::ADDE, VT, Custom);
449 setOperationAction(ISD::SUBC, VT, Custom);
450 setOperationAction(ISD::SUBE, VT, Custom);
451 }
453 setOperationAction(ISD::BR_JT , MVT::Other, Expand);
454 setOperationAction(ISD::BRCOND , MVT::Other, Custom);
455 setOperationAction(ISD::BR_CC , MVT::f32, Expand);
456 setOperationAction(ISD::BR_CC , MVT::f64, Expand);
457 setOperationAction(ISD::BR_CC , MVT::f80, Expand);
458 setOperationAction(ISD::BR_CC , MVT::i8, Expand);
459 setOperationAction(ISD::BR_CC , MVT::i16, Expand);
460 setOperationAction(ISD::BR_CC , MVT::i32, Expand);
461 setOperationAction(ISD::BR_CC , MVT::i64, Expand);
462 setOperationAction(ISD::SELECT_CC , MVT::f32, Expand);
463 setOperationAction(ISD::SELECT_CC , MVT::f64, Expand);
464 setOperationAction(ISD::SELECT_CC , MVT::f80, Expand);
465 setOperationAction(ISD::SELECT_CC , MVT::i8, Expand);
466 setOperationAction(ISD::SELECT_CC , MVT::i16, Expand);
467 setOperationAction(ISD::SELECT_CC , MVT::i32, Expand);
468 setOperationAction(ISD::SELECT_CC , MVT::i64, Expand);
469 if (Subtarget->is64Bit())
470 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i32, Legal);
471 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16 , Legal);
472 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8 , Legal);
473 setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1 , Expand);
474 setOperationAction(ISD::FP_ROUND_INREG , MVT::f32 , Expand);
475 setOperationAction(ISD::FREM , MVT::f32 , Expand);
476 setOperationAction(ISD::FREM , MVT::f64 , Expand);
477 setOperationAction(ISD::FREM , MVT::f80 , Expand);
478 setOperationAction(ISD::FLT_ROUNDS_ , MVT::i32 , Custom);
480 // Promote the i8 variants and force them on up to i32 which has a shorter
481 // encoding.
482 setOperationAction(ISD::CTTZ , MVT::i8 , Promote);
483 AddPromotedToType (ISD::CTTZ , MVT::i8 , MVT::i32);
484 setOperationAction(ISD::CTTZ_ZERO_UNDEF , MVT::i8 , Promote);
485 AddPromotedToType (ISD::CTTZ_ZERO_UNDEF , MVT::i8 , MVT::i32);
486 if (Subtarget->hasBMI()) {
487 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i16 , Expand);
488 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i32 , Expand);
489 if (Subtarget->is64Bit())
490 setOperationAction(ISD::CTTZ_ZERO_UNDEF, MVT::i64, Expand);
491 } else {
492 setOperationAction(ISD::CTTZ , MVT::i16 , Custom);
493 setOperationAction(ISD::CTTZ , MVT::i32 , Custom);
494 if (Subtarget->is64Bit())
495 setOperationAction(ISD::CTTZ , MVT::i64 , Custom);
496 }
498 if (Subtarget->hasLZCNT()) {
499 // When promoting the i8 variants, force them to i32 for a shorter
500 // encoding.
501 setOperationAction(ISD::CTLZ , MVT::i8 , Promote);
502 AddPromotedToType (ISD::CTLZ , MVT::i8 , MVT::i32);
503 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Promote);
504 AddPromotedToType (ISD::CTLZ_ZERO_UNDEF, MVT::i8 , MVT::i32);
505 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Expand);
506 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Expand);
507 if (Subtarget->is64Bit())
508 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Expand);
509 } else {
510 setOperationAction(ISD::CTLZ , MVT::i8 , Custom);
511 setOperationAction(ISD::CTLZ , MVT::i16 , Custom);
512 setOperationAction(ISD::CTLZ , MVT::i32 , Custom);
513 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i8 , Custom);
514 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i16 , Custom);
515 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i32 , Custom);
516 if (Subtarget->is64Bit()) {
517 setOperationAction(ISD::CTLZ , MVT::i64 , Custom);
518 setOperationAction(ISD::CTLZ_ZERO_UNDEF, MVT::i64, Custom);
519 }
520 }
522 // Special handling for half-precision floating point conversions.
523 // If we don't have F16C support, then lower half float conversions
524 // into library calls.
525 if (TM.Options.UseSoftFloat || !Subtarget->hasF16C()) {
526 setOperationAction(ISD::FP16_TO_FP, MVT::f32, Expand);
527 setOperationAction(ISD::FP_TO_FP16, MVT::f32, Expand);
528 }
530 // There's never any support for operations beyond MVT::f32.
531 setOperationAction(ISD::FP16_TO_FP, MVT::f64, Expand);
532 setOperationAction(ISD::FP16_TO_FP, MVT::f80, Expand);
533 setOperationAction(ISD::FP_TO_FP16, MVT::f64, Expand);
534 setOperationAction(ISD::FP_TO_FP16, MVT::f80, Expand);
536 setLoadExtAction(ISD::EXTLOAD, MVT::f16, Expand);
537 setTruncStoreAction(MVT::f32, MVT::f16, Expand);
538 setTruncStoreAction(MVT::f64, MVT::f16, Expand);
539 setTruncStoreAction(MVT::f80, MVT::f16, Expand);
541 if (Subtarget->hasPOPCNT()) {
542 setOperationAction(ISD::CTPOP , MVT::i8 , Promote);
543 } else {
544 setOperationAction(ISD::CTPOP , MVT::i8 , Expand);
545 setOperationAction(ISD::CTPOP , MVT::i16 , Expand);
546 setOperationAction(ISD::CTPOP , MVT::i32 , Expand);
547 if (Subtarget->is64Bit())
548 setOperationAction(ISD::CTPOP , MVT::i64 , Expand);
549 }
551 setOperationAction(ISD::READCYCLECOUNTER , MVT::i64 , Custom);
553 if (!Subtarget->hasMOVBE())
554 setOperationAction(ISD::BSWAP , MVT::i16 , Expand);
556 // These should be promoted to a larger select which is supported.
557 setOperationAction(ISD::SELECT , MVT::i1 , Promote);
558 // X86 wants to expand cmov itself.
559 setOperationAction(ISD::SELECT , MVT::i8 , Custom);
560 setOperationAction(ISD::SELECT , MVT::i16 , Custom);
561 setOperationAction(ISD::SELECT , MVT::i32 , Custom);
562 setOperationAction(ISD::SELECT , MVT::f32 , Custom);
563 setOperationAction(ISD::SELECT , MVT::f64 , Custom);
564 setOperationAction(ISD::SELECT , MVT::f80 , Custom);
565 setOperationAction(ISD::SETCC , MVT::i8 , Custom);
566 setOperationAction(ISD::SETCC , MVT::i16 , Custom);
567 setOperationAction(ISD::SETCC , MVT::i32 , Custom);
568 setOperationAction(ISD::SETCC , MVT::f32 , Custom);
569 setOperationAction(ISD::SETCC , MVT::f64 , Custom);
570 setOperationAction(ISD::SETCC , MVT::f80 , Custom);
571 if (Subtarget->is64Bit()) {
572 setOperationAction(ISD::SELECT , MVT::i64 , Custom);
573 setOperationAction(ISD::SETCC , MVT::i64 , Custom);
574 }
575 setOperationAction(ISD::EH_RETURN , MVT::Other, Custom);
576 // NOTE: EH_SJLJ_SETJMP/_LONGJMP supported here is NOT intended to support
577 // SjLj exception handling but a light-weight setjmp/longjmp replacement to
578 // support continuation, user-level threading, and etc.. As a result, no
579 // other SjLj exception interfaces are implemented and please don't build
580 // your own exception handling based on them.
581 // LLVM/Clang supports zero-cost DWARF exception handling.
582 setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
583 setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
585 // Darwin ABI issue.
586 setOperationAction(ISD::ConstantPool , MVT::i32 , Custom);
587 setOperationAction(ISD::JumpTable , MVT::i32 , Custom);
588 setOperationAction(ISD::GlobalAddress , MVT::i32 , Custom);
589 setOperationAction(ISD::GlobalTLSAddress, MVT::i32 , Custom);
590 if (Subtarget->is64Bit())
591 setOperationAction(ISD::GlobalTLSAddress, MVT::i64, Custom);
592 setOperationAction(ISD::ExternalSymbol , MVT::i32 , Custom);
593 setOperationAction(ISD::BlockAddress , MVT::i32 , Custom);
594 if (Subtarget->is64Bit()) {
595 setOperationAction(ISD::ConstantPool , MVT::i64 , Custom);
596 setOperationAction(ISD::JumpTable , MVT::i64 , Custom);
597 setOperationAction(ISD::GlobalAddress , MVT::i64 , Custom);
598 setOperationAction(ISD::ExternalSymbol, MVT::i64 , Custom);
599 setOperationAction(ISD::BlockAddress , MVT::i64 , Custom);
600 }
601 // 64-bit addm sub, shl, sra, srl (iff 32-bit x86)
602 setOperationAction(ISD::SHL_PARTS , MVT::i32 , Custom);
603 setOperationAction(ISD::SRA_PARTS , MVT::i32 , Custom);
604 setOperationAction(ISD::SRL_PARTS , MVT::i32 , Custom);
605 if (Subtarget->is64Bit()) {
606 setOperationAction(ISD::SHL_PARTS , MVT::i64 , Custom);
607 setOperationAction(ISD::SRA_PARTS , MVT::i64 , Custom);
608 setOperationAction(ISD::SRL_PARTS , MVT::i64 , Custom);
609 }
611 if (Subtarget->hasSSE1())
612 setOperationAction(ISD::PREFETCH , MVT::Other, Legal);
614 setOperationAction(ISD::ATOMIC_FENCE , MVT::Other, Custom);
616 // Expand certain atomics
617 for (unsigned i = 0; i != array_lengthof(IntVTs); ++i) {
618 MVT VT = IntVTs[i];
619 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Custom);
620 setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);
621 setOperationAction(ISD::ATOMIC_STORE, VT, Custom);
622 }
624 if (Subtarget->hasCmpxchg16b()) {
625 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
626 }
628 // FIXME - use subtarget debug flags
629 if (!Subtarget->isTargetDarwin() && !Subtarget->isTargetELF() &&
630 !Subtarget->isTargetCygMing() && !Subtarget->isTargetWin64()) {
631 setOperationAction(ISD::EH_LABEL, MVT::Other, Expand);
632 }
634 if (Subtarget->is64Bit()) {
635 setExceptionPointerRegister(X86::RAX);
636 setExceptionSelectorRegister(X86::RDX);
637 } else {
638 setExceptionPointerRegister(X86::EAX);
639 setExceptionSelectorRegister(X86::EDX);
640 }
641 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i32, Custom);
642 setOperationAction(ISD::FRAME_TO_ARGS_OFFSET, MVT::i64, Custom);
644 setOperationAction(ISD::INIT_TRAMPOLINE, MVT::Other, Custom);
645 setOperationAction(ISD::ADJUST_TRAMPOLINE, MVT::Other, Custom);
647 setOperationAction(ISD::TRAP, MVT::Other, Legal);
648 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Legal);
650 // VASTART needs to be custom lowered to use the VarArgsFrameIndex
651 setOperationAction(ISD::VASTART , MVT::Other, Custom);
652 setOperationAction(ISD::VAEND , MVT::Other, Expand);
653 if (Subtarget->is64Bit() && !Subtarget->isTargetWin64()) {
654 // TargetInfo::X86_64ABIBuiltinVaList
655 setOperationAction(ISD::VAARG , MVT::Other, Custom);
656 setOperationAction(ISD::VACOPY , MVT::Other, Custom);
657 } else {
658 // TargetInfo::CharPtrBuiltinVaList
659 setOperationAction(ISD::VAARG , MVT::Other, Expand);
660 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
661 }
663 setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
664 setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
666 setOperationAction(ISD::DYNAMIC_STACKALLOC, getPointerTy(), Custom);
668 if (!TM.Options.UseSoftFloat && X86ScalarSSEf64) {
669 // f32 and f64 use SSE.
670 // Set up the FP register classes.
671 addRegisterClass(MVT::f32, &X86::FR32RegClass);
672 addRegisterClass(MVT::f64, &X86::FR64RegClass);
674 // Use ANDPD to simulate FABS.
675 setOperationAction(ISD::FABS , MVT::f64, Custom);
676 setOperationAction(ISD::FABS , MVT::f32, Custom);
678 // Use XORP to simulate FNEG.
679 setOperationAction(ISD::FNEG , MVT::f64, Custom);
680 setOperationAction(ISD::FNEG , MVT::f32, Custom);
682 // Use ANDPD and ORPD to simulate FCOPYSIGN.
683 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
684 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
686 // Lower this to FGETSIGNx86 plus an AND.
687 setOperationAction(ISD::FGETSIGN, MVT::i64, Custom);
688 setOperationAction(ISD::FGETSIGN, MVT::i32, Custom);
690 // We don't support sin/cos/fmod
691 setOperationAction(ISD::FSIN , MVT::f64, Expand);
692 setOperationAction(ISD::FCOS , MVT::f64, Expand);
693 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
694 setOperationAction(ISD::FSIN , MVT::f32, Expand);
695 setOperationAction(ISD::FCOS , MVT::f32, Expand);
696 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
698 // Expand FP immediates into loads from the stack, except for the special
699 // cases we handle.
700 addLegalFPImmediate(APFloat(+0.0)); // xorpd
701 addLegalFPImmediate(APFloat(+0.0f)); // xorps
702 } else if (!TM.Options.UseSoftFloat && X86ScalarSSEf32) {
703 // Use SSE for f32, x87 for f64.
704 // Set up the FP register classes.
705 addRegisterClass(MVT::f32, &X86::FR32RegClass);
706 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
708 // Use ANDPS to simulate FABS.
709 setOperationAction(ISD::FABS , MVT::f32, Custom);
711 // Use XORP to simulate FNEG.
712 setOperationAction(ISD::FNEG , MVT::f32, Custom);
714 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
716 // Use ANDPS and ORPS to simulate FCOPYSIGN.
717 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
718 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
720 // We don't support sin/cos/fmod
721 setOperationAction(ISD::FSIN , MVT::f32, Expand);
722 setOperationAction(ISD::FCOS , MVT::f32, Expand);
723 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
725 // Special cases we handle for FP constants.
726 addLegalFPImmediate(APFloat(+0.0f)); // xorps
727 addLegalFPImmediate(APFloat(+0.0)); // FLD0
728 addLegalFPImmediate(APFloat(+1.0)); // FLD1
729 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
730 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
732 if (!TM.Options.UnsafeFPMath) {
733 setOperationAction(ISD::FSIN , MVT::f64, Expand);
734 setOperationAction(ISD::FCOS , MVT::f64, Expand);
735 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
736 }
737 } else if (!TM.Options.UseSoftFloat) {
738 // f32 and f64 in x87.
739 // Set up the FP register classes.
740 addRegisterClass(MVT::f64, &X86::RFP64RegClass);
741 addRegisterClass(MVT::f32, &X86::RFP32RegClass);
743 setOperationAction(ISD::UNDEF, MVT::f64, Expand);
744 setOperationAction(ISD::UNDEF, MVT::f32, Expand);
745 setOperationAction(ISD::FCOPYSIGN, MVT::f64, Expand);
746 setOperationAction(ISD::FCOPYSIGN, MVT::f32, Expand);
748 if (!TM.Options.UnsafeFPMath) {
749 setOperationAction(ISD::FSIN , MVT::f64, Expand);
750 setOperationAction(ISD::FSIN , MVT::f32, Expand);
751 setOperationAction(ISD::FCOS , MVT::f64, Expand);
752 setOperationAction(ISD::FCOS , MVT::f32, Expand);
753 setOperationAction(ISD::FSINCOS, MVT::f64, Expand);
754 setOperationAction(ISD::FSINCOS, MVT::f32, Expand);
755 }
756 addLegalFPImmediate(APFloat(+0.0)); // FLD0
757 addLegalFPImmediate(APFloat(+1.0)); // FLD1
758 addLegalFPImmediate(APFloat(-0.0)); // FLD0/FCHS
759 addLegalFPImmediate(APFloat(-1.0)); // FLD1/FCHS
760 addLegalFPImmediate(APFloat(+0.0f)); // FLD0
761 addLegalFPImmediate(APFloat(+1.0f)); // FLD1
762 addLegalFPImmediate(APFloat(-0.0f)); // FLD0/FCHS
763 addLegalFPImmediate(APFloat(-1.0f)); // FLD1/FCHS
764 }
766 // We don't support FMA.
767 setOperationAction(ISD::FMA, MVT::f64, Expand);
768 setOperationAction(ISD::FMA, MVT::f32, Expand);
770 // Long double always uses X87.
771 if (!TM.Options.UseSoftFloat) {
772 addRegisterClass(MVT::f80, &X86::RFP80RegClass);
773 setOperationAction(ISD::UNDEF, MVT::f80, Expand);
774 setOperationAction(ISD::FCOPYSIGN, MVT::f80, Expand);
775 {
776 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
777 addLegalFPImmediate(TmpFlt); // FLD0
778 TmpFlt.changeSign();
779 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
781 bool ignored;
782 APFloat TmpFlt2(+1.0);
783 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
784 &ignored);
785 addLegalFPImmediate(TmpFlt2); // FLD1
786 TmpFlt2.changeSign();
787 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
788 }
790 if (!TM.Options.UnsafeFPMath) {
791 setOperationAction(ISD::FSIN , MVT::f80, Expand);
792 setOperationAction(ISD::FCOS , MVT::f80, Expand);
793 setOperationAction(ISD::FSINCOS, MVT::f80, Expand);
794 }
796 setOperationAction(ISD::FFLOOR, MVT::f80, Expand);
797 setOperationAction(ISD::FCEIL, MVT::f80, Expand);
798 setOperationAction(ISD::FTRUNC, MVT::f80, Expand);
799 setOperationAction(ISD::FRINT, MVT::f80, Expand);
800 setOperationAction(ISD::FNEARBYINT, MVT::f80, Expand);
801 setOperationAction(ISD::FMA, MVT::f80, Expand);
802 }
804 // Always use a library call for pow.
805 setOperationAction(ISD::FPOW , MVT::f32 , Expand);
806 setOperationAction(ISD::FPOW , MVT::f64 , Expand);
807 setOperationAction(ISD::FPOW , MVT::f80 , Expand);
809 setOperationAction(ISD::FLOG, MVT::f80, Expand);
810 setOperationAction(ISD::FLOG2, MVT::f80, Expand);
811 setOperationAction(ISD::FLOG10, MVT::f80, Expand);
812 setOperationAction(ISD::FEXP, MVT::f80, Expand);
813 setOperationAction(ISD::FEXP2, MVT::f80, Expand);
815 // First set operation action for all vector types to either promote
816 // (for widening) or expand (for scalarization). Then we will selectively
817 // turn on ones that can be effectively codegen'd.
818 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
819 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
820 MVT VT = (MVT::SimpleValueType)i;
821 setOperationAction(ISD::ADD , VT, Expand);
822 setOperationAction(ISD::SUB , VT, Expand);
823 setOperationAction(ISD::FADD, VT, Expand);
824 setOperationAction(ISD::FNEG, VT, Expand);
825 setOperationAction(ISD::FSUB, VT, Expand);
826 setOperationAction(ISD::MUL , VT, Expand);
827 setOperationAction(ISD::FMUL, VT, Expand);
828 setOperationAction(ISD::SDIV, VT, Expand);
829 setOperationAction(ISD::UDIV, VT, Expand);
830 setOperationAction(ISD::FDIV, VT, Expand);
831 setOperationAction(ISD::SREM, VT, Expand);
832 setOperationAction(ISD::UREM, VT, Expand);
833 setOperationAction(ISD::LOAD, VT, Expand);
834 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Expand);
835 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT,Expand);
836 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Expand);
837 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT,Expand);
838 setOperationAction(ISD::INSERT_SUBVECTOR, VT,Expand);
839 setOperationAction(ISD::FABS, VT, Expand);
840 setOperationAction(ISD::FSIN, VT, Expand);
841 setOperationAction(ISD::FSINCOS, VT, Expand);
842 setOperationAction(ISD::FCOS, VT, Expand);
843 setOperationAction(ISD::FSINCOS, VT, Expand);
844 setOperationAction(ISD::FREM, VT, Expand);
845 setOperationAction(ISD::FMA, VT, Expand);
846 setOperationAction(ISD::FPOWI, VT, Expand);
847 setOperationAction(ISD::FSQRT, VT, Expand);
848 setOperationAction(ISD::FCOPYSIGN, VT, Expand);
849 setOperationAction(ISD::FFLOOR, VT, Expand);
850 setOperationAction(ISD::FCEIL, VT, Expand);
851 setOperationAction(ISD::FTRUNC, VT, Expand);
852 setOperationAction(ISD::FRINT, VT, Expand);
853 setOperationAction(ISD::FNEARBYINT, VT, Expand);
854 setOperationAction(ISD::SMUL_LOHI, VT, Expand);
855 setOperationAction(ISD::MULHS, VT, Expand);
856 setOperationAction(ISD::UMUL_LOHI, VT, Expand);
857 setOperationAction(ISD::MULHU, VT, Expand);
858 setOperationAction(ISD::SDIVREM, VT, Expand);
859 setOperationAction(ISD::UDIVREM, VT, Expand);
860 setOperationAction(ISD::FPOW, VT, Expand);
861 setOperationAction(ISD::CTPOP, VT, Expand);
862 setOperationAction(ISD::CTTZ, VT, Expand);
863 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand);
864 setOperationAction(ISD::CTLZ, VT, Expand);
865 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand);
866 setOperationAction(ISD::SHL, VT, Expand);
867 setOperationAction(ISD::SRA, VT, Expand);
868 setOperationAction(ISD::SRL, VT, Expand);
869 setOperationAction(ISD::ROTL, VT, Expand);
870 setOperationAction(ISD::ROTR, VT, Expand);
871 setOperationAction(ISD::BSWAP, VT, Expand);
872 setOperationAction(ISD::SETCC, VT, Expand);
873 setOperationAction(ISD::FLOG, VT, Expand);
874 setOperationAction(ISD::FLOG2, VT, Expand);
875 setOperationAction(ISD::FLOG10, VT, Expand);
876 setOperationAction(ISD::FEXP, VT, Expand);
877 setOperationAction(ISD::FEXP2, VT, Expand);
878 setOperationAction(ISD::FP_TO_UINT, VT, Expand);
879 setOperationAction(ISD::FP_TO_SINT, VT, Expand);
880 setOperationAction(ISD::UINT_TO_FP, VT, Expand);
881 setOperationAction(ISD::SINT_TO_FP, VT, Expand);
882 setOperationAction(ISD::SIGN_EXTEND_INREG, VT,Expand);
883 setOperationAction(ISD::TRUNCATE, VT, Expand);
884 setOperationAction(ISD::SIGN_EXTEND, VT, Expand);
885 setOperationAction(ISD::ZERO_EXTEND, VT, Expand);
886 setOperationAction(ISD::ANY_EXTEND, VT, Expand);
887 setOperationAction(ISD::VSELECT, VT, Expand);
888 setOperationAction(ISD::SELECT_CC, VT, Expand);
889 for (int InnerVT = MVT::FIRST_VECTOR_VALUETYPE;
890 InnerVT <= MVT::LAST_VECTOR_VALUETYPE; ++InnerVT)
891 setTruncStoreAction(VT,
892 (MVT::SimpleValueType)InnerVT, Expand);
893 setLoadExtAction(ISD::SEXTLOAD, VT, Expand);
894 setLoadExtAction(ISD::ZEXTLOAD, VT, Expand);
896 // N.b. ISD::EXTLOAD legality is basically ignored except for i1-like types,
897 // we have to deal with them whether we ask for Expansion or not. Setting
898 // Expand causes its own optimisation problems though, so leave them legal.
899 if (VT.getVectorElementType() == MVT::i1)
900 setLoadExtAction(ISD::EXTLOAD, VT, Expand);
901 }
903 // FIXME: In order to prevent SSE instructions being expanded to MMX ones
904 // with -msoft-float, disable use of MMX as well.
905 if (!TM.Options.UseSoftFloat && Subtarget->hasMMX()) {
906 addRegisterClass(MVT::x86mmx, &X86::VR64RegClass);
907 // No operations on x86mmx supported, everything uses intrinsics.
908 }
910 // MMX-sized vectors (other than x86mmx) are expected to be expanded
911 // into smaller operations.
912 setOperationAction(ISD::MULHS, MVT::v8i8, Expand);
913 setOperationAction(ISD::MULHS, MVT::v4i16, Expand);
914 setOperationAction(ISD::MULHS, MVT::v2i32, Expand);
915 setOperationAction(ISD::MULHS, MVT::v1i64, Expand);
916 setOperationAction(ISD::AND, MVT::v8i8, Expand);
917 setOperationAction(ISD::AND, MVT::v4i16, Expand);
918 setOperationAction(ISD::AND, MVT::v2i32, Expand);
919 setOperationAction(ISD::AND, MVT::v1i64, Expand);
920 setOperationAction(ISD::OR, MVT::v8i8, Expand);
921 setOperationAction(ISD::OR, MVT::v4i16, Expand);
922 setOperationAction(ISD::OR, MVT::v2i32, Expand);
923 setOperationAction(ISD::OR, MVT::v1i64, Expand);
924 setOperationAction(ISD::XOR, MVT::v8i8, Expand);
925 setOperationAction(ISD::XOR, MVT::v4i16, Expand);
926 setOperationAction(ISD::XOR, MVT::v2i32, Expand);
927 setOperationAction(ISD::XOR, MVT::v1i64, Expand);
928 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i8, Expand);
929 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4i16, Expand);
930 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v2i32, Expand);
931 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v1i64, Expand);
932 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v1i64, Expand);
933 setOperationAction(ISD::SELECT, MVT::v8i8, Expand);
934 setOperationAction(ISD::SELECT, MVT::v4i16, Expand);
935 setOperationAction(ISD::SELECT, MVT::v2i32, Expand);
936 setOperationAction(ISD::SELECT, MVT::v1i64, Expand);
937 setOperationAction(ISD::BITCAST, MVT::v8i8, Expand);
938 setOperationAction(ISD::BITCAST, MVT::v4i16, Expand);
939 setOperationAction(ISD::BITCAST, MVT::v2i32, Expand);
940 setOperationAction(ISD::BITCAST, MVT::v1i64, Expand);
942 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE1()) {
943 addRegisterClass(MVT::v4f32, &X86::VR128RegClass);
945 setOperationAction(ISD::FADD, MVT::v4f32, Legal);
946 setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
947 setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
948 setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
949 setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
950 setOperationAction(ISD::FNEG, MVT::v4f32, Custom);
951 setOperationAction(ISD::FABS, MVT::v4f32, Custom);
952 setOperationAction(ISD::LOAD, MVT::v4f32, Legal);
953 setOperationAction(ISD::BUILD_VECTOR, MVT::v4f32, Custom);
954 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v4f32, Custom);
955 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
956 setOperationAction(ISD::SELECT, MVT::v4f32, Custom);
957 }
959 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE2()) {
960 addRegisterClass(MVT::v2f64, &X86::VR128RegClass);
962 // FIXME: Unfortunately, -soft-float and -no-implicit-float mean XMM
963 // registers cannot be used even for integer operations.
964 addRegisterClass(MVT::v16i8, &X86::VR128RegClass);
965 addRegisterClass(MVT::v8i16, &X86::VR128RegClass);
966 addRegisterClass(MVT::v4i32, &X86::VR128RegClass);
967 addRegisterClass(MVT::v2i64, &X86::VR128RegClass);
969 setOperationAction(ISD::ADD, MVT::v16i8, Legal);
970 setOperationAction(ISD::ADD, MVT::v8i16, Legal);
971 setOperationAction(ISD::ADD, MVT::v4i32, Legal);
972 setOperationAction(ISD::ADD, MVT::v2i64, Legal);
973 setOperationAction(ISD::MUL, MVT::v4i32, Custom);
974 setOperationAction(ISD::MUL, MVT::v2i64, Custom);
975 setOperationAction(ISD::UMUL_LOHI, MVT::v4i32, Custom);
976 setOperationAction(ISD::SMUL_LOHI, MVT::v4i32, Custom);
977 setOperationAction(ISD::MULHU, MVT::v8i16, Legal);
978 setOperationAction(ISD::MULHS, MVT::v8i16, Legal);
979 setOperationAction(ISD::SUB, MVT::v16i8, Legal);
980 setOperationAction(ISD::SUB, MVT::v8i16, Legal);
981 setOperationAction(ISD::SUB, MVT::v4i32, Legal);
982 setOperationAction(ISD::SUB, MVT::v2i64, Legal);
983 setOperationAction(ISD::MUL, MVT::v8i16, Legal);
984 setOperationAction(ISD::FADD, MVT::v2f64, Legal);
985 setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
986 setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
987 setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
988 setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
989 setOperationAction(ISD::FNEG, MVT::v2f64, Custom);
990 setOperationAction(ISD::FABS, MVT::v2f64, Custom);
992 setOperationAction(ISD::SETCC, MVT::v2i64, Custom);
993 setOperationAction(ISD::SETCC, MVT::v16i8, Custom);
994 setOperationAction(ISD::SETCC, MVT::v8i16, Custom);
995 setOperationAction(ISD::SETCC, MVT::v4i32, Custom);
997 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v16i8, Custom);
998 setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v8i16, Custom);
999 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1000 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1001 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1003 // Custom lower build_vector, vector_shuffle, and extract_vector_elt.
1004 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1005 MVT VT = (MVT::SimpleValueType)i;
1006 // Do not attempt to custom lower non-power-of-2 vectors
1007 if (!isPowerOf2_32(VT.getVectorNumElements()))
1008 continue;
1009 // Do not attempt to custom lower non-128-bit vectors
1010 if (!VT.is128BitVector())
1011 continue;
1012 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1013 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1014 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1015 }
1017 // We support custom legalizing of sext and anyext loads for specific
1018 // memory vector types which we can load as a scalar (or sequence of
1019 // scalars) and extend in-register to a legal 128-bit vector type. For sext
1020 // loads these must work with a single scalar load.
1021 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i8, Custom);
1022 setLoadExtAction(ISD::SEXTLOAD, MVT::v4i16, Custom);
1023 setLoadExtAction(ISD::SEXTLOAD, MVT::v8i8, Custom);
1024 setLoadExtAction(ISD::EXTLOAD, MVT::v2i8, Custom);
1025 setLoadExtAction(ISD::EXTLOAD, MVT::v2i16, Custom);
1026 setLoadExtAction(ISD::EXTLOAD, MVT::v2i32, Custom);
1027 setLoadExtAction(ISD::EXTLOAD, MVT::v4i8, Custom);
1028 setLoadExtAction(ISD::EXTLOAD, MVT::v4i16, Custom);
1029 setLoadExtAction(ISD::EXTLOAD, MVT::v8i8, Custom);
1031 setOperationAction(ISD::BUILD_VECTOR, MVT::v2f64, Custom);
1032 setOperationAction(ISD::BUILD_VECTOR, MVT::v2i64, Custom);
1033 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2f64, Custom);
1034 setOperationAction(ISD::VECTOR_SHUFFLE, MVT::v2i64, Custom);
1035 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
1036 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);
1038 if (Subtarget->is64Bit()) {
1039 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1040 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1041 }
1043 // Promote v16i8, v8i16, v4i32 load, select, and, or, xor to v2i64.
1044 for (int i = MVT::v16i8; i != MVT::v2i64; ++i) {
1045 MVT VT = (MVT::SimpleValueType)i;
1047 // Do not attempt to promote non-128-bit vectors
1048 if (!VT.is128BitVector())
1049 continue;
1051 setOperationAction(ISD::AND, VT, Promote);
1052 AddPromotedToType (ISD::AND, VT, MVT::v2i64);
1053 setOperationAction(ISD::OR, VT, Promote);
1054 AddPromotedToType (ISD::OR, VT, MVT::v2i64);
1055 setOperationAction(ISD::XOR, VT, Promote);
1056 AddPromotedToType (ISD::XOR, VT, MVT::v2i64);
1057 setOperationAction(ISD::LOAD, VT, Promote);
1058 AddPromotedToType (ISD::LOAD, VT, MVT::v2i64);
1059 setOperationAction(ISD::SELECT, VT, Promote);
1060 AddPromotedToType (ISD::SELECT, VT, MVT::v2i64);
1061 }
1063 // Custom lower v2i64 and v2f64 selects.
1064 setOperationAction(ISD::LOAD, MVT::v2f64, Legal);
1065 setOperationAction(ISD::LOAD, MVT::v2i64, Legal);
1066 setOperationAction(ISD::SELECT, MVT::v2f64, Custom);
1067 setOperationAction(ISD::SELECT, MVT::v2i64, Custom);
1069 setOperationAction(ISD::FP_TO_SINT, MVT::v4i32, Legal);
1070 setOperationAction(ISD::SINT_TO_FP, MVT::v4i32, Legal);
1072 setOperationAction(ISD::UINT_TO_FP, MVT::v4i8, Custom);
1073 setOperationAction(ISD::UINT_TO_FP, MVT::v4i16, Custom);
1074 // As there is no 64-bit GPR available, we need build a special custom
1075 // sequence to convert from v2i32 to v2f32.
1076 if (!Subtarget->is64Bit())
1077 setOperationAction(ISD::UINT_TO_FP, MVT::v2f32, Custom);
1079 setOperationAction(ISD::FP_EXTEND, MVT::v2f32, Custom);
1080 setOperationAction(ISD::FP_ROUND, MVT::v2f32, Custom);
1082 setLoadExtAction(ISD::EXTLOAD, MVT::v2f32, Legal);
1084 setOperationAction(ISD::BITCAST, MVT::v2i32, Custom);
1085 setOperationAction(ISD::BITCAST, MVT::v4i16, Custom);
1086 setOperationAction(ISD::BITCAST, MVT::v8i8, Custom);
1087 }
1089 if (!TM.Options.UseSoftFloat && Subtarget->hasSSE41()) {
1090 setOperationAction(ISD::FFLOOR, MVT::f32, Legal);
1091 setOperationAction(ISD::FCEIL, MVT::f32, Legal);
1092 setOperationAction(ISD::FTRUNC, MVT::f32, Legal);
1093 setOperationAction(ISD::FRINT, MVT::f32, Legal);
1094 setOperationAction(ISD::FNEARBYINT, MVT::f32, Legal);
1095 setOperationAction(ISD::FFLOOR, MVT::f64, Legal);
1096 setOperationAction(ISD::FCEIL, MVT::f64, Legal);
1097 setOperationAction(ISD::FTRUNC, MVT::f64, Legal);
1098 setOperationAction(ISD::FRINT, MVT::f64, Legal);
1099 setOperationAction(ISD::FNEARBYINT, MVT::f64, Legal);
1101 setOperationAction(ISD::FFLOOR, MVT::v4f32, Legal);
1102 setOperationAction(ISD::FCEIL, MVT::v4f32, Legal);
1103 setOperationAction(ISD::FTRUNC, MVT::v4f32, Legal);
1104 setOperationAction(ISD::FRINT, MVT::v4f32, Legal);
1105 setOperationAction(ISD::FNEARBYINT, MVT::v4f32, Legal);
1106 setOperationAction(ISD::FFLOOR, MVT::v2f64, Legal);
1107 setOperationAction(ISD::FCEIL, MVT::v2f64, Legal);
1108 setOperationAction(ISD::FTRUNC, MVT::v2f64, Legal);
1109 setOperationAction(ISD::FRINT, MVT::v2f64, Legal);
1110 setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Legal);
1112 // FIXME: Do we need to handle scalar-to-vector here?
1113 setOperationAction(ISD::MUL, MVT::v4i32, Legal);
1115 setOperationAction(ISD::VSELECT, MVT::v2f64, Custom);
1116 setOperationAction(ISD::VSELECT, MVT::v2i64, Custom);
1117 setOperationAction(ISD::VSELECT, MVT::v4i32, Custom);
1118 setOperationAction(ISD::VSELECT, MVT::v4f32, Custom);
1119 setOperationAction(ISD::VSELECT, MVT::v8i16, Custom);
1120 // There is no BLENDI for byte vectors. We don't need to custom lower
1121 // some vselects for now.
1122 setOperationAction(ISD::VSELECT, MVT::v16i8, Legal);
1124 // SSE41 brings specific instructions for doing vector sign extend even in
1125 // cases where we don't have SRA.
1126 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i8, Custom);
1127 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i16, Custom);
1128 setLoadExtAction(ISD::SEXTLOAD, MVT::v2i32, Custom);
1130 // i8 and i16 vectors are custom because the source register and source
1131 // source memory operand types are not the same width. f32 vectors are
1132 // custom since the immediate controlling the insert encodes additional
1133 // information.
1134 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i8, Custom);
1135 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i16, Custom);
1136 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4i32, Custom);
1137 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
1139 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i8, Custom);
1140 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i16, Custom);
1141 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4i32, Custom);
1142 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
1144 // FIXME: these should be Legal, but that's only for the case where
1145 // the index is constant. For now custom expand to deal with that.
1146 if (Subtarget->is64Bit()) {
1147 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2i64, Custom);
1148 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2i64, Custom);
1149 }
1150 }
1152 if (Subtarget->hasSSE2()) {
1153 setOperationAction(ISD::SRL, MVT::v8i16, Custom);
1154 setOperationAction(ISD::SRL, MVT::v16i8, Custom);
1156 setOperationAction(ISD::SHL, MVT::v8i16, Custom);
1157 setOperationAction(ISD::SHL, MVT::v16i8, Custom);
1159 setOperationAction(ISD::SRA, MVT::v8i16, Custom);
1160 setOperationAction(ISD::SRA, MVT::v16i8, Custom);
1162 // In the customized shift lowering, the legal cases in AVX2 will be
1163 // recognized.
1164 setOperationAction(ISD::SRL, MVT::v2i64, Custom);
1165 setOperationAction(ISD::SRL, MVT::v4i32, Custom);
1167 setOperationAction(ISD::SHL, MVT::v2i64, Custom);
1168 setOperationAction(ISD::SHL, MVT::v4i32, Custom);
1170 setOperationAction(ISD::SRA, MVT::v4i32, Custom);
1171 }
1173 if (!TM.Options.UseSoftFloat && Subtarget->hasFp256()) {
1174 addRegisterClass(MVT::v32i8, &X86::VR256RegClass);
1175 addRegisterClass(MVT::v16i16, &X86::VR256RegClass);
1176 addRegisterClass(MVT::v8i32, &X86::VR256RegClass);
1177 addRegisterClass(MVT::v8f32, &X86::VR256RegClass);
1178 addRegisterClass(MVT::v4i64, &X86::VR256RegClass);
1179 addRegisterClass(MVT::v4f64, &X86::VR256RegClass);
1181 setOperationAction(ISD::LOAD, MVT::v8f32, Legal);
1182 setOperationAction(ISD::LOAD, MVT::v4f64, Legal);
1183 setOperationAction(ISD::LOAD, MVT::v4i64, Legal);
1185 setOperationAction(ISD::FADD, MVT::v8f32, Legal);
1186 setOperationAction(ISD::FSUB, MVT::v8f32, Legal);
1187 setOperationAction(ISD::FMUL, MVT::v8f32, Legal);
1188 setOperationAction(ISD::FDIV, MVT::v8f32, Legal);
1189 setOperationAction(ISD::FSQRT, MVT::v8f32, Legal);
1190 setOperationAction(ISD::FFLOOR, MVT::v8f32, Legal);
1191 setOperationAction(ISD::FCEIL, MVT::v8f32, Legal);
1192 setOperationAction(ISD::FTRUNC, MVT::v8f32, Legal);
1193 setOperationAction(ISD::FRINT, MVT::v8f32, Legal);
1194 setOperationAction(ISD::FNEARBYINT, MVT::v8f32, Legal);
1195 setOperationAction(ISD::FNEG, MVT::v8f32, Custom);
1196 setOperationAction(ISD::FABS, MVT::v8f32, Custom);
1198 setOperationAction(ISD::FADD, MVT::v4f64, Legal);
1199 setOperationAction(ISD::FSUB, MVT::v4f64, Legal);
1200 setOperationAction(ISD::FMUL, MVT::v4f64, Legal);
1201 setOperationAction(ISD::FDIV, MVT::v4f64, Legal);
1202 setOperationAction(ISD::FSQRT, MVT::v4f64, Legal);
1203 setOperationAction(ISD::FFLOOR, MVT::v4f64, Legal);
1204 setOperationAction(ISD::FCEIL, MVT::v4f64, Legal);
1205 setOperationAction(ISD::FTRUNC, MVT::v4f64, Legal);
1206 setOperationAction(ISD::FRINT, MVT::v4f64, Legal);
1207 setOperationAction(ISD::FNEARBYINT, MVT::v4f64, Legal);
1208 setOperationAction(ISD::FNEG, MVT::v4f64, Custom);
1209 setOperationAction(ISD::FABS, MVT::v4f64, Custom);
1211 // (fp_to_int:v8i16 (v8f32 ..)) requires the result type to be promoted
1212 // even though v8i16 is a legal type.
1213 setOperationAction(ISD::FP_TO_SINT, MVT::v8i16, Promote);
1214 setOperationAction(ISD::FP_TO_UINT, MVT::v8i16, Promote);
1215 setOperationAction(ISD::FP_TO_SINT, MVT::v8i32, Legal);
1217 setOperationAction(ISD::SINT_TO_FP, MVT::v8i16, Promote);
1218 setOperationAction(ISD::SINT_TO_FP, MVT::v8i32, Legal);
1219 setOperationAction(ISD::FP_ROUND, MVT::v4f32, Legal);
1221 setOperationAction(ISD::UINT_TO_FP, MVT::v8i8, Custom);
1222 setOperationAction(ISD::UINT_TO_FP, MVT::v8i16, Custom);
1224 setLoadExtAction(ISD::EXTLOAD, MVT::v4f32, Legal);
1226 setOperationAction(ISD::SRL, MVT::v16i16, Custom);
1227 setOperationAction(ISD::SRL, MVT::v32i8, Custom);
1229 setOperationAction(ISD::SHL, MVT::v16i16, Custom);
1230 setOperationAction(ISD::SHL, MVT::v32i8, Custom);
1232 setOperationAction(ISD::SRA, MVT::v16i16, Custom);
1233 setOperationAction(ISD::SRA, MVT::v32i8, Custom);
1235 setOperationAction(ISD::SETCC, MVT::v32i8, Custom);
1236 setOperationAction(ISD::SETCC, MVT::v16i16, Custom);
1237 setOperationAction(ISD::SETCC, MVT::v8i32, Custom);
1238 setOperationAction(ISD::SETCC, MVT::v4i64, Custom);
1240 setOperationAction(ISD::SELECT, MVT::v4f64, Custom);
1241 setOperationAction(ISD::SELECT, MVT::v4i64, Custom);
1242 setOperationAction(ISD::SELECT, MVT::v8f32, Custom);
1244 setOperationAction(ISD::VSELECT, MVT::v4f64, Custom);
1245 setOperationAction(ISD::VSELECT, MVT::v4i64, Custom);
1246 setOperationAction(ISD::VSELECT, MVT::v8i32, Custom);
1247 setOperationAction(ISD::VSELECT, MVT::v8f32, Custom);
1249 setOperationAction(ISD::SIGN_EXTEND, MVT::v4i64, Custom);
1250 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i32, Custom);
1251 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1252 setOperationAction(ISD::ZERO_EXTEND, MVT::v4i64, Custom);
1253 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i32, Custom);
1254 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i16, Custom);
1255 setOperationAction(ISD::ANY_EXTEND, MVT::v4i64, Custom);
1256 setOperationAction(ISD::ANY_EXTEND, MVT::v8i32, Custom);
1257 setOperationAction(ISD::ANY_EXTEND, MVT::v16i16, Custom);
1258 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1259 setOperationAction(ISD::TRUNCATE, MVT::v8i16, Custom);
1260 setOperationAction(ISD::TRUNCATE, MVT::v4i32, Custom);
1262 if (Subtarget->hasFMA() || Subtarget->hasFMA4()) {
1263 setOperationAction(ISD::FMA, MVT::v8f32, Legal);
1264 setOperationAction(ISD::FMA, MVT::v4f64, Legal);
1265 setOperationAction(ISD::FMA, MVT::v4f32, Legal);
1266 setOperationAction(ISD::FMA, MVT::v2f64, Legal);
1267 setOperationAction(ISD::FMA, MVT::f32, Legal);
1268 setOperationAction(ISD::FMA, MVT::f64, Legal);
1269 }
1271 if (Subtarget->hasInt256()) {
1272 setOperationAction(ISD::ADD, MVT::v4i64, Legal);
1273 setOperationAction(ISD::ADD, MVT::v8i32, Legal);
1274 setOperationAction(ISD::ADD, MVT::v16i16, Legal);
1275 setOperationAction(ISD::ADD, MVT::v32i8, Legal);
1277 setOperationAction(ISD::SUB, MVT::v4i64, Legal);
1278 setOperationAction(ISD::SUB, MVT::v8i32, Legal);
1279 setOperationAction(ISD::SUB, MVT::v16i16, Legal);
1280 setOperationAction(ISD::SUB, MVT::v32i8, Legal);
1282 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1283 setOperationAction(ISD::MUL, MVT::v8i32, Legal);
1284 setOperationAction(ISD::MUL, MVT::v16i16, Legal);
1285 // Don't lower v32i8 because there is no 128-bit byte mul
1287 setOperationAction(ISD::UMUL_LOHI, MVT::v8i32, Custom);
1288 setOperationAction(ISD::SMUL_LOHI, MVT::v8i32, Custom);
1289 setOperationAction(ISD::MULHU, MVT::v16i16, Legal);
1290 setOperationAction(ISD::MULHS, MVT::v16i16, Legal);
1292 setOperationAction(ISD::VSELECT, MVT::v16i16, Custom);
1293 setOperationAction(ISD::VSELECT, MVT::v32i8, Legal);
1294 } else {
1295 setOperationAction(ISD::ADD, MVT::v4i64, Custom);
1296 setOperationAction(ISD::ADD, MVT::v8i32, Custom);
1297 setOperationAction(ISD::ADD, MVT::v16i16, Custom);
1298 setOperationAction(ISD::ADD, MVT::v32i8, Custom);
1300 setOperationAction(ISD::SUB, MVT::v4i64, Custom);
1301 setOperationAction(ISD::SUB, MVT::v8i32, Custom);
1302 setOperationAction(ISD::SUB, MVT::v16i16, Custom);
1303 setOperationAction(ISD::SUB, MVT::v32i8, Custom);
1305 setOperationAction(ISD::MUL, MVT::v4i64, Custom);
1306 setOperationAction(ISD::MUL, MVT::v8i32, Custom);
1307 setOperationAction(ISD::MUL, MVT::v16i16, Custom);
1308 // Don't lower v32i8 because there is no 128-bit byte mul
1309 }
1311 // In the customized shift lowering, the legal cases in AVX2 will be
1312 // recognized.
1313 setOperationAction(ISD::SRL, MVT::v4i64, Custom);
1314 setOperationAction(ISD::SRL, MVT::v8i32, Custom);
1316 setOperationAction(ISD::SHL, MVT::v4i64, Custom);
1317 setOperationAction(ISD::SHL, MVT::v8i32, Custom);
1319 setOperationAction(ISD::SRA, MVT::v8i32, Custom);
1321 // Custom lower several nodes for 256-bit types.
1322 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1323 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1324 MVT VT = (MVT::SimpleValueType)i;
1326 // Extract subvector is special because the value type
1327 // (result) is 128-bit but the source is 256-bit wide.
1328 if (VT.is128BitVector())
1329 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1331 // Do not attempt to custom lower other non-256-bit vectors
1332 if (!VT.is256BitVector())
1333 continue;
1335 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1336 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1337 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1338 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1339 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1340 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1341 setOperationAction(ISD::CONCAT_VECTORS, VT, Custom);
1342 }
1344 // Promote v32i8, v16i16, v8i32 select, and, or, xor to v4i64.
1345 for (int i = MVT::v32i8; i != MVT::v4i64; ++i) {
1346 MVT VT = (MVT::SimpleValueType)i;
1348 // Do not attempt to promote non-256-bit vectors
1349 if (!VT.is256BitVector())
1350 continue;
1352 setOperationAction(ISD::AND, VT, Promote);
1353 AddPromotedToType (ISD::AND, VT, MVT::v4i64);
1354 setOperationAction(ISD::OR, VT, Promote);
1355 AddPromotedToType (ISD::OR, VT, MVT::v4i64);
1356 setOperationAction(ISD::XOR, VT, Promote);
1357 AddPromotedToType (ISD::XOR, VT, MVT::v4i64);
1358 setOperationAction(ISD::LOAD, VT, Promote);
1359 AddPromotedToType (ISD::LOAD, VT, MVT::v4i64);
1360 setOperationAction(ISD::SELECT, VT, Promote);
1361 AddPromotedToType (ISD::SELECT, VT, MVT::v4i64);
1362 }
1363 }
1365 if (!TM.Options.UseSoftFloat && Subtarget->hasAVX512()) {
1366 addRegisterClass(MVT::v16i32, &X86::VR512RegClass);
1367 addRegisterClass(MVT::v16f32, &X86::VR512RegClass);
1368 addRegisterClass(MVT::v8i64, &X86::VR512RegClass);
1369 addRegisterClass(MVT::v8f64, &X86::VR512RegClass);
1371 addRegisterClass(MVT::i1, &X86::VK1RegClass);
1372 addRegisterClass(MVT::v8i1, &X86::VK8RegClass);
1373 addRegisterClass(MVT::v16i1, &X86::VK16RegClass);
1375 setOperationAction(ISD::BR_CC, MVT::i1, Expand);
1376 setOperationAction(ISD::SETCC, MVT::i1, Custom);
1377 setOperationAction(ISD::XOR, MVT::i1, Legal);
1378 setOperationAction(ISD::OR, MVT::i1, Legal);
1379 setOperationAction(ISD::AND, MVT::i1, Legal);
1380 setLoadExtAction(ISD::EXTLOAD, MVT::v8f32, Legal);
1381 setOperationAction(ISD::LOAD, MVT::v16f32, Legal);
1382 setOperationAction(ISD::LOAD, MVT::v8f64, Legal);
1383 setOperationAction(ISD::LOAD, MVT::v8i64, Legal);
1384 setOperationAction(ISD::LOAD, MVT::v16i32, Legal);
1385 setOperationAction(ISD::LOAD, MVT::v16i1, Legal);
1387 setOperationAction(ISD::FADD, MVT::v16f32, Legal);
1388 setOperationAction(ISD::FSUB, MVT::v16f32, Legal);
1389 setOperationAction(ISD::FMUL, MVT::v16f32, Legal);
1390 setOperationAction(ISD::FDIV, MVT::v16f32, Legal);
1391 setOperationAction(ISD::FSQRT, MVT::v16f32, Legal);
1392 setOperationAction(ISD::FNEG, MVT::v16f32, Custom);
1394 setOperationAction(ISD::FADD, MVT::v8f64, Legal);
1395 setOperationAction(ISD::FSUB, MVT::v8f64, Legal);
1396 setOperationAction(ISD::FMUL, MVT::v8f64, Legal);
1397 setOperationAction(ISD::FDIV, MVT::v8f64, Legal);
1398 setOperationAction(ISD::FSQRT, MVT::v8f64, Legal);
1399 setOperationAction(ISD::FNEG, MVT::v8f64, Custom);
1400 setOperationAction(ISD::FMA, MVT::v8f64, Legal);
1401 setOperationAction(ISD::FMA, MVT::v16f32, Legal);
1403 setOperationAction(ISD::FP_TO_SINT, MVT::i32, Legal);
1404 setOperationAction(ISD::FP_TO_UINT, MVT::i32, Legal);
1405 setOperationAction(ISD::SINT_TO_FP, MVT::i32, Legal);
1406 setOperationAction(ISD::UINT_TO_FP, MVT::i32, Legal);
1407 if (Subtarget->is64Bit()) {
1408 setOperationAction(ISD::FP_TO_UINT, MVT::i64, Legal);
1409 setOperationAction(ISD::FP_TO_SINT, MVT::i64, Legal);
1410 setOperationAction(ISD::SINT_TO_FP, MVT::i64, Legal);
1411 setOperationAction(ISD::UINT_TO_FP, MVT::i64, Legal);
1412 }
1413 setOperationAction(ISD::FP_TO_SINT, MVT::v16i32, Legal);
1414 setOperationAction(ISD::FP_TO_UINT, MVT::v16i32, Legal);
1415 setOperationAction(ISD::FP_TO_UINT, MVT::v8i32, Legal);
1416 setOperationAction(ISD::FP_TO_UINT, MVT::v4i32, Legal);
1417 setOperationAction(ISD::SINT_TO_FP, MVT::v16i32, Legal);
1418 setOperationAction(ISD::UINT_TO_FP, MVT::v16i32, Legal);
1419 setOperationAction(ISD::UINT_TO_FP, MVT::v8i32, Legal);
1420 setOperationAction(ISD::UINT_TO_FP, MVT::v4i32, Legal);
1421 setOperationAction(ISD::FP_ROUND, MVT::v8f32, Legal);
1422 setOperationAction(ISD::FP_EXTEND, MVT::v8f32, Legal);
1424 setOperationAction(ISD::TRUNCATE, MVT::i1, Custom);
1425 setOperationAction(ISD::TRUNCATE, MVT::v16i8, Custom);
1426 setOperationAction(ISD::TRUNCATE, MVT::v8i32, Custom);
1427 setOperationAction(ISD::TRUNCATE, MVT::v8i1, Custom);
1428 setOperationAction(ISD::TRUNCATE, MVT::v16i1, Custom);
1429 setOperationAction(ISD::TRUNCATE, MVT::v16i16, Custom);
1430 setOperationAction(ISD::ZERO_EXTEND, MVT::v16i32, Custom);
1431 setOperationAction(ISD::ZERO_EXTEND, MVT::v8i64, Custom);
1432 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i32, Custom);
1433 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i64, Custom);
1434 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i8, Custom);
1435 setOperationAction(ISD::SIGN_EXTEND, MVT::v8i16, Custom);
1436 setOperationAction(ISD::SIGN_EXTEND, MVT::v16i16, Custom);
1438 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8f64, Custom);
1439 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i64, Custom);
1440 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16f32, Custom);
1441 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i32, Custom);
1442 setOperationAction(ISD::CONCAT_VECTORS, MVT::v8i1, Custom);
1443 setOperationAction(ISD::CONCAT_VECTORS, MVT::v16i1, Legal);
1445 setOperationAction(ISD::SETCC, MVT::v16i1, Custom);
1446 setOperationAction(ISD::SETCC, MVT::v8i1, Custom);
1448 setOperationAction(ISD::MUL, MVT::v8i64, Custom);
1450 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v8i1, Custom);
1451 setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v16i1, Custom);
1452 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v16i1, Custom);
1453 setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v8i1, Custom);
1454 setOperationAction(ISD::BUILD_VECTOR, MVT::v8i1, Custom);
1455 setOperationAction(ISD::BUILD_VECTOR, MVT::v16i1, Custom);
1456 setOperationAction(ISD::SELECT, MVT::v8f64, Custom);
1457 setOperationAction(ISD::SELECT, MVT::v8i64, Custom);
1458 setOperationAction(ISD::SELECT, MVT::v16f32, Custom);
1460 setOperationAction(ISD::ADD, MVT::v8i64, Legal);
1461 setOperationAction(ISD::ADD, MVT::v16i32, Legal);
1463 setOperationAction(ISD::SUB, MVT::v8i64, Legal);
1464 setOperationAction(ISD::SUB, MVT::v16i32, Legal);
1466 setOperationAction(ISD::MUL, MVT::v16i32, Legal);
1468 setOperationAction(ISD::SRL, MVT::v8i64, Custom);
1469 setOperationAction(ISD::SRL, MVT::v16i32, Custom);
1471 setOperationAction(ISD::SHL, MVT::v8i64, Custom);
1472 setOperationAction(ISD::SHL, MVT::v16i32, Custom);
1474 setOperationAction(ISD::SRA, MVT::v8i64, Custom);
1475 setOperationAction(ISD::SRA, MVT::v16i32, Custom);
1477 setOperationAction(ISD::AND, MVT::v8i64, Legal);
1478 setOperationAction(ISD::OR, MVT::v8i64, Legal);
1479 setOperationAction(ISD::XOR, MVT::v8i64, Legal);
1480 setOperationAction(ISD::AND, MVT::v16i32, Legal);
1481 setOperationAction(ISD::OR, MVT::v16i32, Legal);
1482 setOperationAction(ISD::XOR, MVT::v16i32, Legal);
1484 if (Subtarget->hasCDI()) {
1485 setOperationAction(ISD::CTLZ, MVT::v8i64, Legal);
1486 setOperationAction(ISD::CTLZ, MVT::v16i32, Legal);
1487 }
1489 // Custom lower several nodes.
1490 for (int i = MVT::FIRST_VECTOR_VALUETYPE;
1491 i <= MVT::LAST_VECTOR_VALUETYPE; ++i) {
1492 MVT VT = (MVT::SimpleValueType)i;
1494 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1495 // Extract subvector is special because the value type
1496 // (result) is 256/128-bit but the source is 512-bit wide.
1497 if (VT.is128BitVector() || VT.is256BitVector())
1498 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Custom);
1500 if (VT.getVectorElementType() == MVT::i1)
1501 setOperationAction(ISD::EXTRACT_SUBVECTOR, VT, Legal);
1503 // Do not attempt to custom lower other non-512-bit vectors
1504 if (!VT.is512BitVector())
1505 continue;
1507 if ( EltSize >= 32) {
1508 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1509 setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Custom);
1510 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1511 setOperationAction(ISD::VSELECT, VT, Legal);
1512 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
1513 setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);
1514 setOperationAction(ISD::INSERT_SUBVECTOR, VT, Custom);
1515 }
1516 }
1517 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1518 MVT VT = (MVT::SimpleValueType)i;
1520 // Do not attempt to promote non-256-bit vectors
1521 if (!VT.is512BitVector())
1522 continue;
1524 setOperationAction(ISD::SELECT, VT, Promote);
1525 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
1526 }
1527 }// has AVX-512
1529 if (!TM.Options.UseSoftFloat && Subtarget->hasBWI()) {
1530 addRegisterClass(MVT::v32i16, &X86::VR512RegClass);
1531 addRegisterClass(MVT::v64i8, &X86::VR512RegClass);
1533 addRegisterClass(MVT::v32i1, &X86::VK32RegClass);
1534 addRegisterClass(MVT::v64i1, &X86::VK64RegClass);
1536 setOperationAction(ISD::LOAD, MVT::v32i16, Legal);
1537 setOperationAction(ISD::LOAD, MVT::v64i8, Legal);
1538 setOperationAction(ISD::SETCC, MVT::v32i1, Custom);
1539 setOperationAction(ISD::SETCC, MVT::v64i1, Custom);
1541 for (int i = MVT::v32i8; i != MVT::v8i64; ++i) {
1542 const MVT VT = (MVT::SimpleValueType)i;
1544 const unsigned EltSize = VT.getVectorElementType().getSizeInBits();
1546 // Do not attempt to promote non-256-bit vectors
1547 if (!VT.is512BitVector())
1548 continue;
1550 if ( EltSize < 32) {
1551 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1552 setOperationAction(ISD::VSELECT, VT, Legal);
1553 }
1554 }
1555 }
1557 if (!TM.Options.UseSoftFloat && Subtarget->hasVLX()) {
1558 addRegisterClass(MVT::v4i1, &X86::VK4RegClass);
1559 addRegisterClass(MVT::v2i1, &X86::VK2RegClass);
1561 setOperationAction(ISD::SETCC, MVT::v4i1, Custom);
1562 setOperationAction(ISD::SETCC, MVT::v2i1, Custom);
1563 }
1565 // SIGN_EXTEND_INREGs are evaluated by the extend type. Handle the expansion
1566 // of this type with custom code.
1567 for (int VT = MVT::FIRST_VECTOR_VALUETYPE;
1568 VT != MVT::LAST_VECTOR_VALUETYPE; VT++) {
1569 setOperationAction(ISD::SIGN_EXTEND_INREG, (MVT::SimpleValueType)VT,
1570 Custom);
1571 }
1573 // We want to custom lower some of our intrinsics.
1574 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1575 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1576 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1577 if (!Subtarget->is64Bit())
1578 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1580 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1581 // handle type legalization for these operations here.
1582 //
1583 // FIXME: We really should do custom legalization for addition and
1584 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1585 // than generic legalization for 64-bit multiplication-with-overflow, though.
1586 for (unsigned i = 0, e = 3+Subtarget->is64Bit(); i != e; ++i) {
1587 // Add/Sub/Mul with overflow operations are custom lowered.
1588 MVT VT = IntVTs[i];
1589 setOperationAction(ISD::SADDO, VT, Custom);
1590 setOperationAction(ISD::UADDO, VT, Custom);
1591 setOperationAction(ISD::SSUBO, VT, Custom);
1592 setOperationAction(ISD::USUBO, VT, Custom);
1593 setOperationAction(ISD::SMULO, VT, Custom);
1594 setOperationAction(ISD::UMULO, VT, Custom);
1595 }
1597 // There are no 8-bit 3-address imul/mul instructions
1598 setOperationAction(ISD::SMULO, MVT::i8, Expand);
1599 setOperationAction(ISD::UMULO, MVT::i8, Expand);
1601 if (!Subtarget->is64Bit()) {
1602 // These libcalls are not available in 32-bit.
1603 setLibcallName(RTLIB::SHL_I128, nullptr);
1604 setLibcallName(RTLIB::SRL_I128, nullptr);
1605 setLibcallName(RTLIB::SRA_I128, nullptr);
1606 }
1608 // Combine sin / cos into one node or libcall if possible.
1609 if (Subtarget->hasSinCos()) {
1610 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1611 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1612 if (Subtarget->isTargetDarwin()) {
1613 // For MacOSX, we don't want to the normal expansion of a libcall to
1614 // sincos. We want to issue a libcall to __sincos_stret to avoid memory
1615 // traffic.
1616 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1617 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1618 }
1619 }
1621 if (Subtarget->isTargetWin64()) {
1622 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1623 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1624 setOperationAction(ISD::SREM, MVT::i128, Custom);
1625 setOperationAction(ISD::UREM, MVT::i128, Custom);
1626 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1627 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1628 }
1630 // We have target-specific dag combine patterns for the following nodes:
1631 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1632 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1633 setTargetDAGCombine(ISD::VSELECT);
1634 setTargetDAGCombine(ISD::SELECT);
1635 setTargetDAGCombine(ISD::SHL);
1636 setTargetDAGCombine(ISD::SRA);
1637 setTargetDAGCombine(ISD::SRL);
1638 setTargetDAGCombine(ISD::OR);
1639 setTargetDAGCombine(ISD::AND);
1640 setTargetDAGCombine(ISD::ADD);
1641 setTargetDAGCombine(ISD::FADD);
1642 setTargetDAGCombine(ISD::FSUB);
1643 setTargetDAGCombine(ISD::FMA);
1644 setTargetDAGCombine(ISD::SUB);
1645 setTargetDAGCombine(ISD::LOAD);
1646 setTargetDAGCombine(ISD::STORE);
1647 setTargetDAGCombine(ISD::ZERO_EXTEND);
1648 setTargetDAGCombine(ISD::ANY_EXTEND);
1649 setTargetDAGCombine(ISD::SIGN_EXTEND);
1650 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1651 setTargetDAGCombine(ISD::TRUNCATE);
1652 setTargetDAGCombine(ISD::SINT_TO_FP);
1653 setTargetDAGCombine(ISD::SETCC);
1654 setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
1655 setTargetDAGCombine(ISD::BUILD_VECTOR);
1656 if (Subtarget->is64Bit())
1657 setTargetDAGCombine(ISD::MUL);
1658 setTargetDAGCombine(ISD::XOR);
1660 computeRegisterProperties();
1662 // On Darwin, -Os means optimize for size without hurting performance,
1663 // do not reduce the limit.
1664 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1665 MaxStoresPerMemsetOptSize = Subtarget->isTargetDarwin() ? 16 : 8;
1666 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1667 MaxStoresPerMemcpyOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1668 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1669 MaxStoresPerMemmoveOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1670 setPrefLoopAlignment(4); // 2^4 bytes.
1672 // Predictable cmov don't hurt on atom because it's in-order.
1673 PredictableSelectIsExpensive = !Subtarget->isAtom();
1675 setPrefFunctionAlignment(4); // 2^4 bytes.
1677 verifyIntrinsicTables();
1678 }
1680 // This has so far only been implemented for 64-bit MachO.
1681 bool X86TargetLowering::useLoadStackGuardNode() const {
1682 return Subtarget->getTargetTriple().getObjectFormat() == Triple::MachO &&
1683 Subtarget->is64Bit();
1684 }
1686 TargetLoweringBase::LegalizeTypeAction
1687 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1688 if (ExperimentalVectorWideningLegalization &&
1689 VT.getVectorNumElements() != 1 &&
1690 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1691 return TypeWidenVector;
1693 return TargetLoweringBase::getPreferredVectorAction(VT);
1694 }
1696 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
1697 if (!VT.isVector())
1698 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1700 const unsigned NumElts = VT.getVectorNumElements();
1701 const EVT EltVT = VT.getVectorElementType();
1702 if (VT.is512BitVector()) {
1703 if (Subtarget->hasAVX512())
1704 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1705 EltVT == MVT::f32 || EltVT == MVT::f64)
1706 switch(NumElts) {
1707 case 8: return MVT::v8i1;
1708 case 16: return MVT::v16i1;
1709 }
1710 if (Subtarget->hasBWI())
1711 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1712 switch(NumElts) {
1713 case 32: return MVT::v32i1;
1714 case 64: return MVT::v64i1;
1715 }
1716 }
1718 if (VT.is256BitVector() || VT.is128BitVector()) {
1719 if (Subtarget->hasVLX())
1720 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1721 EltVT == MVT::f32 || EltVT == MVT::f64)
1722 switch(NumElts) {
1723 case 2: return MVT::v2i1;
1724 case 4: return MVT::v4i1;
1725 case 8: return MVT::v8i1;
1726 }
1727 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1728 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1729 switch(NumElts) {
1730 case 8: return MVT::v8i1;
1731 case 16: return MVT::v16i1;
1732 case 32: return MVT::v32i1;
1733 }
1734 }
1736 return VT.changeVectorElementTypeToInteger();
1737 }
1739 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1740 /// the desired ByVal argument alignment.
1741 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1742 if (MaxAlign == 16)
1743 return;
1744 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1745 if (VTy->getBitWidth() == 128)
1746 MaxAlign = 16;
1747 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1748 unsigned EltAlign = 0;
1749 getMaxByValAlign(ATy->getElementType(), EltAlign);
1750 if (EltAlign > MaxAlign)
1751 MaxAlign = EltAlign;
1752 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1753 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1754 unsigned EltAlign = 0;
1755 getMaxByValAlign(STy->getElementType(i), EltAlign);
1756 if (EltAlign > MaxAlign)
1757 MaxAlign = EltAlign;
1758 if (MaxAlign == 16)
1759 break;
1760 }
1761 }
1762 }
1764 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
1765 /// function arguments in the caller parameter area. For X86, aggregates
1766 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1767 /// are at 4-byte boundaries.
1768 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty) const {
1769 if (Subtarget->is64Bit()) {
1770 // Max of 8 and alignment of type.
1771 unsigned TyAlign = TD->getABITypeAlignment(Ty);
1772 if (TyAlign > 8)
1773 return TyAlign;
1774 return 8;
1775 }
1777 unsigned Align = 4;
1778 if (Subtarget->hasSSE1())
1779 getMaxByValAlign(Ty, Align);
1780 return Align;
1781 }
1783 /// getOptimalMemOpType - Returns the target specific optimal type for load
1784 /// and store operations as a result of memset, memcpy, and memmove
1785 /// lowering. If DstAlign is zero that means it's safe to destination
1786 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1787 /// means there isn't a need to check it against alignment requirement,
1788 /// probably because the source does not need to be loaded. If 'IsMemset' is
1789 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1790 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1791 /// source is constant so it does not need to be loaded.
1792 /// It returns EVT::Other if the type should be determined using generic
1793 /// target-independent logic.
1794 EVT
1795 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1796 unsigned DstAlign, unsigned SrcAlign,
1797 bool IsMemset, bool ZeroMemset,
1798 bool MemcpyStrSrc,
1799 MachineFunction &MF) const {
1800 const Function *F = MF.getFunction();
1801 if ((!IsMemset || ZeroMemset) &&
1802 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1803 Attribute::NoImplicitFloat)) {
1804 if (Size >= 16 &&
1805 (Subtarget->isUnalignedMemAccessFast() ||
1806 ((DstAlign == 0 || DstAlign >= 16) &&
1807 (SrcAlign == 0 || SrcAlign >= 16)))) {
1808 if (Size >= 32) {
1809 if (Subtarget->hasInt256())
1810 return MVT::v8i32;
1811 if (Subtarget->hasFp256())
1812 return MVT::v8f32;
1813 }
1814 if (Subtarget->hasSSE2())
1815 return MVT::v4i32;
1816 if (Subtarget->hasSSE1())
1817 return MVT::v4f32;
1818 } else if (!MemcpyStrSrc && Size >= 8 &&
1819 !Subtarget->is64Bit() &&
1820 Subtarget->hasSSE2()) {
1821 // Do not use f64 to lower memcpy if source is string constant. It's
1822 // better to use i32 to avoid the loads.
1823 return MVT::f64;
1824 }
1825 }
1826 if (Subtarget->is64Bit() && Size >= 8)
1827 return MVT::i64;
1828 return MVT::i32;
1829 }
1831 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1832 if (VT == MVT::f32)
1833 return X86ScalarSSEf32;
1834 else if (VT == MVT::f64)
1835 return X86ScalarSSEf64;
1836 return true;
1837 }
1839 bool
1840 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1841 unsigned,
1842 unsigned,
1843 bool *Fast) const {
1844 if (Fast)
1845 *Fast = Subtarget->isUnalignedMemAccessFast();
1846 return true;
1847 }
1849 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
1850 /// current function. The returned value is a member of the
1851 /// MachineJumpTableInfo::JTEntryKind enum.
1852 unsigned X86TargetLowering::getJumpTableEncoding() const {
1853 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
1854 // symbol.
1855 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
1856 Subtarget->isPICStyleGOT())
1857 return MachineJumpTableInfo::EK_Custom32;
1859 // Otherwise, use the normal jump table encoding heuristics.
1860 return TargetLowering::getJumpTableEncoding();
1861 }
1863 const MCExpr *
1864 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
1865 const MachineBasicBlock *MBB,
1866 unsigned uid,MCContext &Ctx) const{
1867 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
1868 Subtarget->isPICStyleGOT());
1869 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
1870 // entries.
1871 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1872 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1873 }
1875 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
1876 /// jumptable.
1877 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1878 SelectionDAG &DAG) const {
1879 if (!Subtarget->is64Bit())
1880 // This doesn't have SDLoc associated with it, but is not really the
1881 // same as a Register.
1882 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy());
1883 return Table;
1884 }
1886 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1887 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1888 /// MCExpr.
1889 const MCExpr *X86TargetLowering::
1890 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
1891 MCContext &Ctx) const {
1892 // X86-64 uses RIP relative addressing based on the jump table label.
1893 if (Subtarget->isPICStyleRIPRel())
1894 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
1896 // Otherwise, the reference is relative to the PIC base.
1897 return MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx);
1898 }
1900 // FIXME: Why this routine is here? Move to RegInfo!
1901 std::pair<const TargetRegisterClass*, uint8_t>
1902 X86TargetLowering::findRepresentativeClass(MVT VT) const{
1903 const TargetRegisterClass *RRC = nullptr;
1904 uint8_t Cost = 1;
1905 switch (VT.SimpleTy) {
1906 default:
1907 return TargetLowering::findRepresentativeClass(VT);
1908 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
1909 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
1910 break;
1911 case MVT::x86mmx:
1912 RRC = &X86::VR64RegClass;
1913 break;
1914 case MVT::f32: case MVT::f64:
1915 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
1916 case MVT::v4f32: case MVT::v2f64:
1917 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
1918 case MVT::v4f64:
1919 RRC = &X86::VR128RegClass;
1920 break;
1921 }
1922 return std::make_pair(RRC, Cost);
1923 }
1925 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1926 unsigned &Offset) const {
1927 if (!Subtarget->isTargetLinux())
1928 return false;
1930 if (Subtarget->is64Bit()) {
1931 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1932 Offset = 0x28;
1933 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1934 AddressSpace = 256;
1935 else
1936 AddressSpace = 257;
1937 } else {
1938 // %gs:0x14 on i386
1939 Offset = 0x14;
1940 AddressSpace = 256;
1941 }
1942 return true;
1943 }
1945 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1946 unsigned DestAS) const {
1947 assert(SrcAS != DestAS && "Expected different address spaces!");
1949 return SrcAS < 256 && DestAS < 256;
1950 }
1952 //===----------------------------------------------------------------------===//
1953 // Return Value Calling Convention Implementation
1954 //===----------------------------------------------------------------------===//
1956 #include "X86GenCallingConv.inc"
1958 bool
1959 X86TargetLowering::CanLowerReturn(CallingConv::ID CallConv,
1960 MachineFunction &MF, bool isVarArg,
1961 const SmallVectorImpl<ISD::OutputArg> &Outs,
1962 LLVMContext &Context) const {
1963 SmallVector<CCValAssign, 16> RVLocs;
1964 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
1965 return CCInfo.CheckReturn(Outs, RetCC_X86);
1966 }
1968 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1969 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
1970 return ScratchRegs;
1971 }
1973 SDValue
1974 X86TargetLowering::LowerReturn(SDValue Chain,
1975 CallingConv::ID CallConv, bool isVarArg,
1976 const SmallVectorImpl<ISD::OutputArg> &Outs,
1977 const SmallVectorImpl<SDValue> &OutVals,
1978 SDLoc dl, SelectionDAG &DAG) const {
1979 MachineFunction &MF = DAG.getMachineFunction();
1980 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
1982 SmallVector<CCValAssign, 16> RVLocs;
1983 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
1984 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
1986 SDValue Flag;
1987 SmallVector<SDValue, 6> RetOps;
1988 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
1989 // Operand #1 = Bytes To Pop
1990 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(),
1991 MVT::i16));
1993 // Copy the result values into the output registers.
1994 for (unsigned i = 0; i != RVLocs.size(); ++i) {
1995 CCValAssign &VA = RVLocs[i];
1996 assert(VA.isRegLoc() && "Can only return in registers!");
1997 SDValue ValToCopy = OutVals[i];
1998 EVT ValVT = ValToCopy.getValueType();
2000 // Promote values to the appropriate types
2001 if (VA.getLocInfo() == CCValAssign::SExt)
2002 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2003 else if (VA.getLocInfo() == CCValAssign::ZExt)
2004 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2005 else if (VA.getLocInfo() == CCValAssign::AExt)
2006 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2007 else if (VA.getLocInfo() == CCValAssign::BCvt)
2008 ValToCopy = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), ValToCopy);
2010 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2011 "Unexpected FP-extend for return value.");
2013 // If this is x86-64, and we disabled SSE, we can't return FP values,
2014 // or SSE or MMX vectors.
2015 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2016 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2017 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2018 report_fatal_error("SSE register return with SSE disabled");
2019 }
2020 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2021 // llvm-gcc has never done it right and no one has noticed, so this
2022 // should be OK for now.
2023 if (ValVT == MVT::f64 &&
2024 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2025 report_fatal_error("SSE2 register return with SSE2 disabled");
2027 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2028 // the RET instruction and handled by the FP Stackifier.
2029 if (VA.getLocReg() == X86::FP0 ||
2030 VA.getLocReg() == X86::FP1) {
2031 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2032 // change the value to the FP stack register class.
2033 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2034 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2035 RetOps.push_back(ValToCopy);
2036 // Don't emit a copytoreg.
2037 continue;
2038 }
2040 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2041 // which is returned in RAX / RDX.
2042 if (Subtarget->is64Bit()) {
2043 if (ValVT == MVT::x86mmx) {
2044 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2045 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ValToCopy);
2046 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2047 ValToCopy);
2048 // If we don't have SSE2 available, convert to v4f32 so the generated
2049 // register is legal.
2050 if (!Subtarget->hasSSE2())
2051 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32,ValToCopy);
2052 }
2053 }
2054 }
2056 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2057 Flag = Chain.getValue(1);
2058 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2059 }
2061 // The x86-64 ABIs require that for returning structs by value we copy
2062 // the sret argument into %rax/%eax (depending on ABI) for the return.
2063 // Win32 requires us to put the sret argument to %eax as well.
2064 // We saved the argument into a virtual register in the entry block,
2065 // so now we copy the value out and into %rax/%eax.
2066 if (DAG.getMachineFunction().getFunction()->hasStructRetAttr() &&
2067 (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC())) {
2068 MachineFunction &MF = DAG.getMachineFunction();
2069 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2070 unsigned Reg = FuncInfo->getSRetReturnReg();
2071 assert(Reg &&
2072 "SRetReturnReg should have been set in LowerFormalArguments().");
2073 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
2075 unsigned RetValReg
2076 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2077 X86::RAX : X86::EAX;
2078 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2079 Flag = Chain.getValue(1);
2081 // RAX/EAX now acts like a return value.
2082 RetOps.push_back(DAG.getRegister(RetValReg, getPointerTy()));
2083 }
2085 RetOps[0] = Chain; // Update chain.
2087 // Add the flag if we have it.
2088 if (Flag.getNode())
2089 RetOps.push_back(Flag);
2091 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2092 }
2094 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2095 if (N->getNumValues() != 1)
2096 return false;
2097 if (!N->hasNUsesOfValue(1, 0))
2098 return false;
2100 SDValue TCChain = Chain;
2101 SDNode *Copy = *N->use_begin();
2102 if (Copy->getOpcode() == ISD::CopyToReg) {
2103 // If the copy has a glue operand, we conservatively assume it isn't safe to
2104 // perform a tail call.
2105 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2106 return false;
2107 TCChain = Copy->getOperand(0);
2108 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2109 return false;
2111 bool HasRet = false;
2112 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2113 UI != UE; ++UI) {
2114 if (UI->getOpcode() != X86ISD::RET_FLAG)
2115 return false;
2116 // If we are returning more than one value, we can definitely
2117 // not make a tail call see PR19530
2118 if (UI->getNumOperands() > 4)
2119 return false;
2120 if (UI->getNumOperands() == 4 &&
2121 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2122 return false;
2123 HasRet = true;
2124 }
2126 if (!HasRet)
2127 return false;
2129 Chain = TCChain;
2130 return true;
2131 }
2133 EVT
2134 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2135 ISD::NodeType ExtendKind) const {
2136 MVT ReturnMVT;
2137 // TODO: Is this also valid on 32-bit?
2138 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2139 ReturnMVT = MVT::i8;
2140 else
2141 ReturnMVT = MVT::i32;
2143 EVT MinVT = getRegisterType(Context, ReturnMVT);
2144 return VT.bitsLT(MinVT) ? MinVT : VT;
2145 }
2147 /// LowerCallResult - Lower the result values of a call into the
2148 /// appropriate copies out of appropriate physical registers.
2149 ///
2150 SDValue
2151 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2152 CallingConv::ID CallConv, bool isVarArg,
2153 const SmallVectorImpl<ISD::InputArg> &Ins,
2154 SDLoc dl, SelectionDAG &DAG,
2155 SmallVectorImpl<SDValue> &InVals) const {
2157 // Assign locations to each value returned by this call.
2158 SmallVector<CCValAssign, 16> RVLocs;
2159 bool Is64Bit = Subtarget->is64Bit();
2160 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2161 *DAG.getContext());
2162 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2164 // Copy all of the result registers out of their specified physreg.
2165 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2166 CCValAssign &VA = RVLocs[i];
2167 EVT CopyVT = VA.getValVT();
2169 // If this is x86-64, and we disabled SSE, we can't return FP values
2170 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2171 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2172 report_fatal_error("SSE register return with SSE disabled");
2173 }
2175 // If we prefer to use the value in xmm registers, copy it out as f80 and
2176 // use a truncate to move it from fp stack reg to xmm reg.
2177 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2178 isScalarFPTypeInSSEReg(VA.getValVT()))
2179 CopyVT = MVT::f80;
2181 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2182 CopyVT, InFlag).getValue(1);
2183 SDValue Val = Chain.getValue(0);
2185 if (CopyVT != VA.getValVT())
2186 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2187 // This truncation won't change the value.
2188 DAG.getIntPtrConstant(1));
2190 InFlag = Chain.getValue(2);
2191 InVals.push_back(Val);
2192 }
2194 return Chain;
2195 }
2197 //===----------------------------------------------------------------------===//
2198 // C & StdCall & Fast Calling Convention implementation
2199 //===----------------------------------------------------------------------===//
2200 // StdCall calling convention seems to be standard for many Windows' API
2201 // routines and around. It differs from C calling convention just a little:
2202 // callee should clean up the stack, not caller. Symbols should be also
2203 // decorated in some fancy way :) It doesn't support any vector arguments.
2204 // For info on fast calling convention see Fast Calling Convention (tail call)
2205 // implementation LowerX86_32FastCCCallTo.
2207 /// CallIsStructReturn - Determines whether a call uses struct return
2208 /// semantics.
2209 enum StructReturnType {
2210 NotStructReturn,
2211 RegStructReturn,
2212 StackStructReturn
2213 };
2214 static StructReturnType
2215 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2216 if (Outs.empty())
2217 return NotStructReturn;
2219 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2220 if (!Flags.isSRet())
2221 return NotStructReturn;
2222 if (Flags.isInReg())
2223 return RegStructReturn;
2224 return StackStructReturn;
2225 }
2227 /// ArgsAreStructReturn - Determines whether a function uses struct
2228 /// return semantics.
2229 static StructReturnType
2230 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2231 if (Ins.empty())
2232 return NotStructReturn;
2234 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2235 if (!Flags.isSRet())
2236 return NotStructReturn;
2237 if (Flags.isInReg())
2238 return RegStructReturn;
2239 return StackStructReturn;
2240 }
2242 /// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
2243 /// by "Src" to address "Dst" with size and alignment information specified by
2244 /// the specific parameter attribute. The copy will be passed as a byval
2245 /// function parameter.
2246 static SDValue
2247 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2248 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2249 SDLoc dl) {
2250 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
2252 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2253 /*isVolatile*/false, /*AlwaysInline=*/true,
2254 MachinePointerInfo(), MachinePointerInfo());
2255 }
2257 /// IsTailCallConvention - Return true if the calling convention is one that
2258 /// supports tail call optimization.
2259 static bool IsTailCallConvention(CallingConv::ID CC) {
2260 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2261 CC == CallingConv::HiPE);
2262 }
2264 /// \brief Return true if the calling convention is a C calling convention.
2265 static bool IsCCallConvention(CallingConv::ID CC) {
2266 return (CC == CallingConv::C || CC == CallingConv::X86_64_Win64 ||
2267 CC == CallingConv::X86_64_SysV);
2268 }
2270 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2271 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2272 return false;
2274 CallSite CS(CI);
2275 CallingConv::ID CalleeCC = CS.getCallingConv();
2276 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
2277 return false;
2279 return true;
2280 }
2282 /// FuncIsMadeTailCallSafe - Return true if the function is being made into
2283 /// a tailcall target by changing its ABI.
2284 static bool FuncIsMadeTailCallSafe(CallingConv::ID CC,
2285 bool GuaranteedTailCallOpt) {
2286 return GuaranteedTailCallOpt && IsTailCallConvention(CC);
2287 }
2289 SDValue
2290 X86TargetLowering::LowerMemArgument(SDValue Chain,
2291 CallingConv::ID CallConv,
2292 const SmallVectorImpl<ISD::InputArg> &Ins,
2293 SDLoc dl, SelectionDAG &DAG,
2294 const CCValAssign &VA,
2295 MachineFrameInfo *MFI,
2296 unsigned i) const {
2297 // Create the nodes corresponding to a load from this parameter slot.
2298 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2299 bool AlwaysUseMutable = FuncIsMadeTailCallSafe(
2300 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2301 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2302 EVT ValVT;
2304 // If value is passed by pointer we have address passed instead of the value
2305 // itself.
2306 if (VA.getLocInfo() == CCValAssign::Indirect)
2307 ValVT = VA.getLocVT();
2308 else
2309 ValVT = VA.getValVT();
2311 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2312 // changed with more analysis.
2313 // In case of tail call optimization mark all arguments mutable. Since they
2314 // could be overwritten by lowering of arguments in case of a tail call.
2315 if (Flags.isByVal()) {
2316 unsigned Bytes = Flags.getByValSize();
2317 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2318 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2319 return DAG.getFrameIndex(FI, getPointerTy());
2320 } else {
2321 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2322 VA.getLocMemOffset(), isImmutable);
2323 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
2324 return DAG.getLoad(ValVT, dl, Chain, FIN,
2325 MachinePointerInfo::getFixedStack(FI),
2326 false, false, false, 0);
2327 }
2328 }
2330 // FIXME: Get this from tablegen.
2331 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2332 const X86Subtarget *Subtarget) {
2333 assert(Subtarget->is64Bit());
2335 if (Subtarget->isCallingConvWin64(CallConv)) {
2336 static const MCPhysReg GPR64ArgRegsWin64[] = {
2337 X86::RCX, X86::RDX, X86::R8, X86::R9
2338 };
2339 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2340 }
2342 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2343 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2344 };
2345 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2346 }
2348 // FIXME: Get this from tablegen.
2349 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2350 CallingConv::ID CallConv,
2351 const X86Subtarget *Subtarget) {
2352 assert(Subtarget->is64Bit());
2353 if (Subtarget->isCallingConvWin64(CallConv)) {
2354 // The XMM registers which might contain var arg parameters are shadowed
2355 // in their paired GPR. So we only need to save the GPR to their home
2356 // slots.
2357 // TODO: __vectorcall will change this.
2358 return None;
2359 }
2361 const Function *Fn = MF.getFunction();
2362 bool NoImplicitFloatOps = Fn->getAttributes().
2363 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
2364 assert(!(MF.getTarget().Options.UseSoftFloat && NoImplicitFloatOps) &&
2365 "SSE register cannot be used when SSE is disabled!");
2366 if (MF.getTarget().Options.UseSoftFloat || NoImplicitFloatOps ||
2367 !Subtarget->hasSSE1())
2368 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2369 // registers.
2370 return None;
2372 static const MCPhysReg XMMArgRegs64Bit[] = {
2373 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2374 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2375 };
2376 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2377 }
2379 SDValue
2380 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2381 CallingConv::ID CallConv,
2382 bool isVarArg,
2383 const SmallVectorImpl<ISD::InputArg> &Ins,
2384 SDLoc dl,
2385 SelectionDAG &DAG,
2386 SmallVectorImpl<SDValue> &InVals)
2387 const {
2388 MachineFunction &MF = DAG.getMachineFunction();
2389 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2391 const Function* Fn = MF.getFunction();
2392 if (Fn->hasExternalLinkage() &&
2393 Subtarget->isTargetCygMing() &&
2394 Fn->getName() == "main")
2395 FuncInfo->setForceFramePointer(true);
2397 MachineFrameInfo *MFI = MF.getFrameInfo();
2398 bool Is64Bit = Subtarget->is64Bit();
2399 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2401 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2402 "Var args not supported with calling convention fastcc, ghc or hipe");
2404 // Assign locations to all of the incoming arguments.
2405 SmallVector<CCValAssign, 16> ArgLocs;
2406 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2408 // Allocate shadow area for Win64
2409 if (IsWin64)
2410 CCInfo.AllocateStack(32, 8);
2412 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2414 unsigned LastVal = ~0U;
2415 SDValue ArgValue;
2416 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2417 CCValAssign &VA = ArgLocs[i];
2418 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2419 // places.
2420 assert(VA.getValNo() != LastVal &&
2421 "Don't support value assigned to multiple locs yet");
2422 (void)LastVal;
2423 LastVal = VA.getValNo();
2425 if (VA.isRegLoc()) {
2426 EVT RegVT = VA.getLocVT();
2427 const TargetRegisterClass *RC;
2428 if (RegVT == MVT::i32)
2429 RC = &X86::GR32RegClass;
2430 else if (Is64Bit && RegVT == MVT::i64)
2431 RC = &X86::GR64RegClass;
2432 else if (RegVT == MVT::f32)
2433 RC = &X86::FR32RegClass;
2434 else if (RegVT == MVT::f64)
2435 RC = &X86::FR64RegClass;
2436 else if (RegVT.is512BitVector())
2437 RC = &X86::VR512RegClass;
2438 else if (RegVT.is256BitVector())
2439 RC = &X86::VR256RegClass;
2440 else if (RegVT.is128BitVector())
2441 RC = &X86::VR128RegClass;
2442 else if (RegVT == MVT::x86mmx)
2443 RC = &X86::VR64RegClass;
2444 else if (RegVT == MVT::i1)
2445 RC = &X86::VK1RegClass;
2446 else if (RegVT == MVT::v8i1)
2447 RC = &X86::VK8RegClass;
2448 else if (RegVT == MVT::v16i1)
2449 RC = &X86::VK16RegClass;
2450 else if (RegVT == MVT::v32i1)
2451 RC = &X86::VK32RegClass;
2452 else if (RegVT == MVT::v64i1)
2453 RC = &X86::VK64RegClass;
2454 else
2455 llvm_unreachable("Unknown argument type!");
2457 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2458 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2460 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2461 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2462 // right size.
2463 if (VA.getLocInfo() == CCValAssign::SExt)
2464 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2465 DAG.getValueType(VA.getValVT()));
2466 else if (VA.getLocInfo() == CCValAssign::ZExt)
2467 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2468 DAG.getValueType(VA.getValVT()));
2469 else if (VA.getLocInfo() == CCValAssign::BCvt)
2470 ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
2472 if (VA.isExtInLoc()) {
2473 // Handle MMX values passed in XMM regs.
2474 if (RegVT.isVector())
2475 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2476 else
2477 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2478 }
2479 } else {
2480 assert(VA.isMemLoc());
2481 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2482 }
2484 // If value is passed via pointer - do a load.
2485 if (VA.getLocInfo() == CCValAssign::Indirect)
2486 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2487 MachinePointerInfo(), false, false, false, 0);
2489 InVals.push_back(ArgValue);
2490 }
2492 if (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC()) {
2493 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2494 // The x86-64 ABIs require that for returning structs by value we copy
2495 // the sret argument into %rax/%eax (depending on ABI) for the return.
2496 // Win32 requires us to put the sret argument to %eax as well.
2497 // Save the argument into a virtual register so that we can access it
2498 // from the return points.
2499 if (Ins[i].Flags.isSRet()) {
2500 unsigned Reg = FuncInfo->getSRetReturnReg();
2501 if (!Reg) {
2502 MVT PtrTy = getPointerTy();
2503 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2504 FuncInfo->setSRetReturnReg(Reg);
2505 }
2506 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2507 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2508 break;
2509 }
2510 }
2511 }
2513 unsigned StackSize = CCInfo.getNextStackOffset();
2514 // Align stack specially for tail calls.
2515 if (FuncIsMadeTailCallSafe(CallConv,
2516 MF.getTarget().Options.GuaranteedTailCallOpt))
2517 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2519 // If the function takes variable number of arguments, make a frame index for
2520 // the start of the first vararg value... for expansion of llvm.va_start. We
2521 // can skip this if there are no va_start calls.
2522 if (MFI->hasVAStart() &&
2523 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2524 CallConv != CallingConv::X86_ThisCall))) {
2525 FuncInfo->setVarArgsFrameIndex(
2526 MFI->CreateFixedObject(1, StackSize, true));
2527 }
2529 // 64-bit calling conventions support varargs and register parameters, so we
2530 // have to do extra work to spill them in the prologue or forward them to
2531 // musttail calls.
2532 if (Is64Bit && isVarArg &&
2533 (MFI->hasVAStart() || MFI->hasMustTailInVarArgFunc())) {
2534 // Find the first unallocated argument registers.
2535 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2536 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2537 unsigned NumIntRegs =
2538 CCInfo.getFirstUnallocated(ArgGPRs.data(), ArgGPRs.size());
2539 unsigned NumXMMRegs =
2540 CCInfo.getFirstUnallocated(ArgXMMs.data(), ArgXMMs.size());
2541 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2542 "SSE register cannot be used when SSE is disabled!");
2544 // Gather all the live in physical registers.
2545 SmallVector<SDValue, 6> LiveGPRs;
2546 SmallVector<SDValue, 8> LiveXMMRegs;
2547 SDValue ALVal;
2548 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2549 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2550 LiveGPRs.push_back(
2551 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2552 }
2553 if (!ArgXMMs.empty()) {
2554 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2555 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2556 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2557 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2558 LiveXMMRegs.push_back(
2559 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2560 }
2561 }
2563 // Store them to the va_list returned by va_start.
2564 if (MFI->hasVAStart()) {
2565 if (IsWin64) {
2566 const TargetFrameLowering &TFI = *MF.getSubtarget().getFrameLowering();
2567 // Get to the caller-allocated home save location. Add 8 to account
2568 // for the return address.
2569 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2570 FuncInfo->setRegSaveFrameIndex(
2571 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2572 // Fixup to set vararg frame on shadow area (4 x i64).
2573 if (NumIntRegs < 4)
2574 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2575 } else {
2576 // For X86-64, if there are vararg parameters that are passed via
2577 // registers, then we must store them to their spots on the stack so
2578 // they may be loaded by deferencing the result of va_next.
2579 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2580 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2581 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2582 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2583 }
2585 // Store the integer parameter registers.
2586 SmallVector<SDValue, 8> MemOps;
2587 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2588 getPointerTy());
2589 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2590 for (SDValue Val : LiveGPRs) {
2591 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2592 DAG.getIntPtrConstant(Offset));
2593 SDValue Store =
2594 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2595 MachinePointerInfo::getFixedStack(
2596 FuncInfo->getRegSaveFrameIndex(), Offset),
2597 false, false, 0);
2598 MemOps.push_back(Store);
2599 Offset += 8;
2600 }
2602 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2603 // Now store the XMM (fp + vector) parameter registers.
2604 SmallVector<SDValue, 12> SaveXMMOps;
2605 SaveXMMOps.push_back(Chain);
2606 SaveXMMOps.push_back(ALVal);
2607 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2608 FuncInfo->getRegSaveFrameIndex()));
2609 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2610 FuncInfo->getVarArgsFPOffset()));
2611 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2612 LiveXMMRegs.end());
2613 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2614 MVT::Other, SaveXMMOps));
2615 }
2617 if (!MemOps.empty())
2618 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2619 } else {
2620 // Add all GPRs, al, and XMMs to the list of forwards. We will add then
2621 // to the liveout set on a musttail call.
2622 assert(MFI->hasMustTailInVarArgFunc());
2623 auto &Forwards = FuncInfo->getForwardedMustTailRegParms();
2624 typedef X86MachineFunctionInfo::Forward Forward;
2626 for (unsigned I = 0, E = LiveGPRs.size(); I != E; ++I) {
2627 unsigned VReg =
2628 MF.getRegInfo().createVirtualRegister(&X86::GR64RegClass);
2629 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveGPRs[I]);
2630 Forwards.push_back(Forward(VReg, ArgGPRs[NumIntRegs + I], MVT::i64));
2631 }
2633 if (!ArgXMMs.empty()) {
2634 unsigned ALVReg =
2635 MF.getRegInfo().createVirtualRegister(&X86::GR8RegClass);
2636 Chain = DAG.getCopyToReg(Chain, dl, ALVReg, ALVal);
2637 Forwards.push_back(Forward(ALVReg, X86::AL, MVT::i8));
2639 for (unsigned I = 0, E = LiveXMMRegs.size(); I != E; ++I) {
2640 unsigned VReg =
2641 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2642 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2643 Forwards.push_back(
2644 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
2645 }
2646 }
2647 }
2648 }
2650 // Some CCs need callee pop.
2651 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2652 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2653 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2654 } else {
2655 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2656 // If this is an sret function, the return should pop the hidden pointer.
2657 if (!Is64Bit && !IsTailCallConvention(CallConv) &&
2658 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2659 argsAreStructReturn(Ins) == StackStructReturn)
2660 FuncInfo->setBytesToPopOnReturn(4);
2661 }
2663 if (!Is64Bit) {
2664 // RegSaveFrameIndex is X86-64 only.
2665 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2666 if (CallConv == CallingConv::X86_FastCall ||
2667 CallConv == CallingConv::X86_ThisCall)
2668 // fastcc functions can't have varargs.
2669 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2670 }
2672 FuncInfo->setArgumentStackSize(StackSize);
2674 return Chain;
2675 }
2677 SDValue
2678 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2679 SDValue StackPtr, SDValue Arg,
2680 SDLoc dl, SelectionDAG &DAG,
2681 const CCValAssign &VA,
2682 ISD::ArgFlagsTy Flags) const {
2683 unsigned LocMemOffset = VA.getLocMemOffset();
2684 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
2685 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
2686 if (Flags.isByVal())
2687 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2689 return DAG.getStore(Chain, dl, Arg, PtrOff,
2690 MachinePointerInfo::getStack(LocMemOffset),
2691 false, false, 0);
2692 }
2694 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2695 /// optimization is performed and it is required.
2696 SDValue
2697 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2698 SDValue &OutRetAddr, SDValue Chain,
2699 bool IsTailCall, bool Is64Bit,
2700 int FPDiff, SDLoc dl) const {
2701 // Adjust the Return address stack slot.
2702 EVT VT = getPointerTy();
2703 OutRetAddr = getReturnAddressFrameIndex(DAG);
2705 // Load the "old" Return address.
2706 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2707 false, false, false, 0);
2708 return SDValue(OutRetAddr.getNode(), 1);
2709 }
2711 /// EmitTailCallStoreRetAddr - Emit a store of the return address if tail call
2712 /// optimization is performed and it is required (FPDiff!=0).
2713 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2714 SDValue Chain, SDValue RetAddrFrIdx,
2715 EVT PtrVT, unsigned SlotSize,
2716 int FPDiff, SDLoc dl) {
2717 // Store the return address to the appropriate stack slot.
2718 if (!FPDiff) return Chain;
2719 // Calculate the new stack slot for the return address.
2720 int NewReturnAddrFI =
2721 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2722 false);
2723 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2724 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2725 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2726 false, false, 0);
2727 return Chain;
2728 }
2730 SDValue
2731 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2732 SmallVectorImpl<SDValue> &InVals) const {
2733 SelectionDAG &DAG = CLI.DAG;
2734 SDLoc &dl = CLI.DL;
2735 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2736 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2737 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2738 SDValue Chain = CLI.Chain;
2739 SDValue Callee = CLI.Callee;
2740 CallingConv::ID CallConv = CLI.CallConv;
2741 bool &isTailCall = CLI.IsTailCall;
2742 bool isVarArg = CLI.IsVarArg;
2744 MachineFunction &MF = DAG.getMachineFunction();
2745 bool Is64Bit = Subtarget->is64Bit();
2746 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2747 StructReturnType SR = callIsStructReturn(Outs);
2748 bool IsSibcall = false;
2749 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2751 if (MF.getTarget().Options.DisableTailCalls)
2752 isTailCall = false;
2754 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
2755 if (IsMustTail) {
2756 // Force this to be a tail call. The verifier rules are enough to ensure
2757 // that we can lower this successfully without moving the return address
2758 // around.
2759 isTailCall = true;
2760 } else if (isTailCall) {
2761 // Check if it's really possible to do a tail call.
2762 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
2763 isVarArg, SR != NotStructReturn,
2764 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
2765 Outs, OutVals, Ins, DAG);
2767 // Sibcalls are automatically detected tailcalls which do not require
2768 // ABI changes.
2769 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
2770 IsSibcall = true;
2772 if (isTailCall)
2773 ++NumTailCalls;
2774 }
2776 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2777 "Var args not supported with calling convention fastcc, ghc or hipe");
2779 // Analyze operands of the call, assigning locations to each operand.
2780 SmallVector<CCValAssign, 16> ArgLocs;
2781 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2783 // Allocate shadow area for Win64
2784 if (IsWin64)
2785 CCInfo.AllocateStack(32, 8);
2787 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
2789 // Get a count of how many bytes are to be pushed on the stack.
2790 unsigned NumBytes = CCInfo.getNextStackOffset();
2791 if (IsSibcall)
2792 // This is a sibcall. The memory operands are available in caller's
2793 // own caller's stack.
2794 NumBytes = 0;
2795 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2796 IsTailCallConvention(CallConv))
2797 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
2799 int FPDiff = 0;
2800 if (isTailCall && !IsSibcall && !IsMustTail) {
2801 // Lower arguments at fp - stackoffset + fpdiff.
2802 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
2804 FPDiff = NumBytesCallerPushed - NumBytes;
2806 // Set the delta of movement of the returnaddr stackslot.
2807 // But only set if delta is greater than previous delta.
2808 if (FPDiff < X86Info->getTCReturnAddrDelta())
2809 X86Info->setTCReturnAddrDelta(FPDiff);
2810 }
2812 unsigned NumBytesToPush = NumBytes;
2813 unsigned NumBytesToPop = NumBytes;
2815 // If we have an inalloca argument, all stack space has already been allocated
2816 // for us and be right at the top of the stack. We don't support multiple
2817 // arguments passed in memory when using inalloca.
2818 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
2819 NumBytesToPush = 0;
2820 if (!ArgLocs.back().isMemLoc())
2821 report_fatal_error("cannot use inalloca attribute on a register "
2822 "parameter");
2823 if (ArgLocs.back().getLocMemOffset() != 0)
2824 report_fatal_error("any parameter with the inalloca attribute must be "
2825 "the only memory argument");
2826 }
2828 if (!IsSibcall)
2829 Chain = DAG.getCALLSEQ_START(
2830 Chain, DAG.getIntPtrConstant(NumBytesToPush, true), dl);
2832 SDValue RetAddrFrIdx;
2833 // Load return address for tail calls.
2834 if (isTailCall && FPDiff)
2835 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
2836 Is64Bit, FPDiff, dl);
2838 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
2839 SmallVector<SDValue, 8> MemOpChains;
2840 SDValue StackPtr;
2842 // Walk the register/memloc assignments, inserting copies/loads. In the case
2843 // of tail call optimization arguments are handle later.
2844 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
2845 DAG.getSubtarget().getRegisterInfo());
2846 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2847 // Skip inalloca arguments, they have already been written.
2848 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2849 if (Flags.isInAlloca())
2850 continue;
2852 CCValAssign &VA = ArgLocs[i];
2853 EVT RegVT = VA.getLocVT();
2854 SDValue Arg = OutVals[i];
2855 bool isByVal = Flags.isByVal();
2857 // Promote the value if needed.
2858 switch (VA.getLocInfo()) {
2859 default: llvm_unreachable("Unknown loc info!");
2860 case CCValAssign::Full: break;
2861 case CCValAssign::SExt:
2862 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
2863 break;
2864 case CCValAssign::ZExt:
2865 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
2866 break;
2867 case CCValAssign::AExt:
2868 if (RegVT.is128BitVector()) {
2869 // Special case: passing MMX values in XMM registers.
2870 Arg = DAG.getNode(ISD::BITCAST, dl, MVT::i64, Arg);
2871 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
2872 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
2873 } else
2874 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2875 break;
2876 case CCValAssign::BCvt:
2877 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
2878 break;
2879 case CCValAssign::Indirect: {
2880 // Store the argument.
2881 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
2882 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
2883 Chain = DAG.getStore(Chain, dl, Arg, SpillSlot,
2884 MachinePointerInfo::getFixedStack(FI),
2885 false, false, 0);
2886 Arg = SpillSlot;
2887 break;
2888 }
2889 }
2891 if (VA.isRegLoc()) {
2892 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
2893 if (isVarArg && IsWin64) {
2894 // Win64 ABI requires argument XMM reg to be copied to the corresponding
2895 // shadow reg if callee is a varargs function.
2896 unsigned ShadowReg = 0;
2897 switch (VA.getLocReg()) {
2898 case X86::XMM0: ShadowReg = X86::RCX; break;
2899 case X86::XMM1: ShadowReg = X86::RDX; break;
2900 case X86::XMM2: ShadowReg = X86::R8; break;
2901 case X86::XMM3: ShadowReg = X86::R9; break;
2902 }
2903 if (ShadowReg)
2904 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2905 }
2906 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2907 assert(VA.isMemLoc());
2908 if (!StackPtr.getNode())
2909 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2910 getPointerTy());
2911 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2912 dl, DAG, VA, Flags));
2913 }
2914 }
2916 if (!MemOpChains.empty())
2917 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
2919 if (Subtarget->isPICStyleGOT()) {
2920 // ELF / PIC requires GOT in the EBX register before function calls via PLT
2921 // GOT pointer.
2922 if (!isTailCall) {
2923 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2924 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
2925 } else {
2926 // If we are tail calling and generating PIC/GOT style code load the
2927 // address of the callee into ECX. The value in ecx is used as target of
2928 // the tail jump. This is done to circumvent the ebx/callee-saved problem
2929 // for tail calls on PIC/GOT architectures. Normally we would just put the
2930 // address of GOT into ebx and then call target@PLT. But for tail calls
2931 // ebx would be restored (since ebx is callee saved) before jumping to the
2932 // target@PLT.
2934 // Note: The actual moving to ECX is done further down.
2935 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
2936 if (G && !G->getGlobal()->hasHiddenVisibility() &&
2937 !G->getGlobal()->hasProtectedVisibility())
2938 Callee = LowerGlobalAddress(Callee, DAG);
2939 else if (isa<ExternalSymbolSDNode>(Callee))
2940 Callee = LowerExternalSymbol(Callee, DAG);
2941 }
2942 }
2944 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
2945 // From AMD64 ABI document:
2946 // For calls that may call functions that use varargs or stdargs
2947 // (prototype-less calls or calls to functions containing ellipsis (...) in
2948 // the declaration) %al is used as hidden argument to specify the number
2949 // of SSE registers used. The contents of %al do not need to match exactly
2950 // the number of registers, but must be an ubound on the number of SSE
2951 // registers used and is in the range 0 - 8 inclusive.
2953 // Count the number of XMM registers allocated.
2954 static const MCPhysReg XMMArgRegs[] = {
2955 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2956 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2957 };
2958 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs, 8);
2959 assert((Subtarget->hasSSE1() || !NumXMMRegs)
2960 && "SSE registers cannot be used when SSE is disabled");
2962 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
2963 DAG.getConstant(NumXMMRegs, MVT::i8)));
2964 }
2966 if (Is64Bit && isVarArg && IsMustTail) {
2967 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
2968 for (const auto &F : Forwards) {
2969 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2970 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
2971 }
2972 }
2974 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
2975 // don't need this because the eligibility check rejects calls that require
2976 // shuffling arguments passed in memory.
2977 if (!IsSibcall && isTailCall) {
2978 // Force all the incoming stack arguments to be loaded from the stack
2979 // before any new outgoing arguments are stored to the stack, because the
2980 // outgoing stack slots may alias the incoming argument stack slots, and
2981 // the alias isn't otherwise explicit. This is slightly more conservative
2982 // than necessary, because it means that each store effectively depends
2983 // on every argument instead of just those arguments it would clobber.
2984 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
2986 SmallVector<SDValue, 8> MemOpChains2;
2987 SDValue FIN;
2988 int FI = 0;
2989 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2990 CCValAssign &VA = ArgLocs[i];
2991 if (VA.isRegLoc())
2992 continue;
2993 assert(VA.isMemLoc());
2994 SDValue Arg = OutVals[i];
2995 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2996 // Skip inalloca arguments. They don't require any work.
2997 if (Flags.isInAlloca())
2998 continue;
2999 // Create frame index.
3000 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3001 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3002 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3003 FIN = DAG.getFrameIndex(FI, getPointerTy());
3005 if (Flags.isByVal()) {
3006 // Copy relative to framepointer.
3007 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset());
3008 if (!StackPtr.getNode())
3009 StackPtr = DAG.getCopyFromReg(Chain, dl,
3010 RegInfo->getStackRegister(),
3011 getPointerTy());
3012 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3014 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3015 ArgChain,
3016 Flags, DAG, dl));
3017 } else {
3018 // Store relative to framepointer.
3019 MemOpChains2.push_back(
3020 DAG.getStore(ArgChain, dl, Arg, FIN,
3021 MachinePointerInfo::getFixedStack(FI),
3022 false, false, 0));
3023 }
3024 }
3026 if (!MemOpChains2.empty())
3027 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3029 // Store the return address to the appropriate stack slot.
3030 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3031 getPointerTy(), RegInfo->getSlotSize(),
3032 FPDiff, dl);
3033 }
3035 // Build a sequence of copy-to-reg nodes chained together with token chain
3036 // and flag operands which copy the outgoing args into registers.
3037 SDValue InFlag;
3038 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3039 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3040 RegsToPass[i].second, InFlag);
3041 InFlag = Chain.getValue(1);
3042 }
3044 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3045 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3046 // In the 64-bit large code model, we have to make all calls
3047 // through a register, since the call instruction's 32-bit
3048 // pc-relative offset may not be large enough to hold the whole
3049 // address.
3050 } else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
3051 // If the callee is a GlobalAddress node (quite common, every direct call
3052 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3053 // it.
3055 // We should use extra load for direct calls to dllimported functions in
3056 // non-JIT mode.
3057 const GlobalValue *GV = G->getGlobal();
3058 if (!GV->hasDLLImportStorageClass()) {
3059 unsigned char OpFlags = 0;
3060 bool ExtraLoad = false;
3061 unsigned WrapperKind = ISD::DELETED_NODE;
3063 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3064 // external symbols most go through the PLT in PIC mode. If the symbol
3065 // has hidden or protected visibility, or if it is static or local, then
3066 // we don't need to use the PLT - we can directly call it.
3067 if (Subtarget->isTargetELF() &&
3068 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3069 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3070 OpFlags = X86II::MO_PLT;
3071 } else if (Subtarget->isPICStyleStubAny() &&
3072 (GV->isDeclaration() || GV->isWeakForLinker()) &&
3073 (!Subtarget->getTargetTriple().isMacOSX() ||
3074 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3075 // PC-relative references to external symbols should go through $stub,
3076 // unless we're building with the leopard linker or later, which
3077 // automatically synthesizes these stubs.
3078 OpFlags = X86II::MO_DARWIN_STUB;
3079 } else if (Subtarget->isPICStyleRIPRel() &&
3080 isa<Function>(GV) &&
3081 cast<Function>(GV)->getAttributes().
3082 hasAttribute(AttributeSet::FunctionIndex,
3083 Attribute::NonLazyBind)) {
3084 // If the function is marked as non-lazy, generate an indirect call
3085 // which loads from the GOT directly. This avoids runtime overhead
3086 // at the cost of eager binding (and one extra byte of encoding).
3087 OpFlags = X86II::MO_GOTPCREL;
3088 WrapperKind = X86ISD::WrapperRIP;
3089 ExtraLoad = true;
3090 }
3092 Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(),
3093 G->getOffset(), OpFlags);
3095 // Add a wrapper if needed.
3096 if (WrapperKind != ISD::DELETED_NODE)
3097 Callee = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Callee);
3098 // Add extra indirection if needed.
3099 if (ExtraLoad)
3100 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3101 MachinePointerInfo::getGOT(),
3102 false, false, false, 0);
3103 }
3104 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3105 unsigned char OpFlags = 0;
3107 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3108 // external symbols should go through the PLT.
3109 if (Subtarget->isTargetELF() &&
3110 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3111 OpFlags = X86II::MO_PLT;
3112 } else if (Subtarget->isPICStyleStubAny() &&
3113 (!Subtarget->getTargetTriple().isMacOSX() ||
3114 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3115 // PC-relative references to external symbols should go through $stub,
3116 // unless we're building with the leopard linker or later, which
3117 // automatically synthesizes these stubs.
3118 OpFlags = X86II::MO_DARWIN_STUB;
3119 }
3121 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
3122 OpFlags);
3123 } else if (Subtarget->isTarget64BitILP32() && Callee->getValueType(0) == MVT::i32) {
3124 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3125 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3126 }
3128 // Returns a chain & a flag for retval copy to use.
3129 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3130 SmallVector<SDValue, 8> Ops;
3132 if (!IsSibcall && isTailCall) {
3133 Chain = DAG.getCALLSEQ_END(Chain,
3134 DAG.getIntPtrConstant(NumBytesToPop, true),
3135 DAG.getIntPtrConstant(0, true), InFlag, dl);
3136 InFlag = Chain.getValue(1);
3137 }
3139 Ops.push_back(Chain);
3140 Ops.push_back(Callee);
3142 if (isTailCall)
3143 Ops.push_back(DAG.getConstant(FPDiff, MVT::i32));
3145 // Add argument registers to the end of the list so that they are known live
3146 // into the call.
3147 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3148 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3149 RegsToPass[i].second.getValueType()));
3151 // Add a register mask operand representing the call-preserved registers.
3152 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
3153 const uint32_t *Mask = TRI->getCallPreservedMask(CallConv);
3154 assert(Mask && "Missing call preserved mask for calling convention");
3155 Ops.push_back(DAG.getRegisterMask(Mask));
3157 if (InFlag.getNode())
3158 Ops.push_back(InFlag);
3160 if (isTailCall) {
3161 // We used to do:
3162 //// If this is the first return lowered for this function, add the regs
3163 //// to the liveout set for the function.
3164 // This isn't right, although it's probably harmless on x86; liveouts
3165 // should be computed from returns not tail calls. Consider a void
3166 // function making a tail call to a function returning int.
3167 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3168 }
3170 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3171 InFlag = Chain.getValue(1);
3173 // Create the CALLSEQ_END node.
3174 unsigned NumBytesForCalleeToPop;
3175 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3176 DAG.getTarget().Options.GuaranteedTailCallOpt))
3177 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3178 else if (!Is64Bit && !IsTailCallConvention(CallConv) &&
3179 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3180 SR == StackStructReturn)
3181 // If this is a call to a struct-return function, the callee
3182 // pops the hidden struct pointer, so we have to push it back.
3183 // This is common for Darwin/X86, Linux & Mingw32 targets.
3184 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3185 NumBytesForCalleeToPop = 4;
3186 else
3187 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3189 // Returns a flag for retval copy to use.
3190 if (!IsSibcall) {
3191 Chain = DAG.getCALLSEQ_END(Chain,
3192 DAG.getIntPtrConstant(NumBytesToPop, true),
3193 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3194 true),
3195 InFlag, dl);
3196 InFlag = Chain.getValue(1);
3197 }
3199 // Handle result values, copying them out of physregs into vregs that we
3200 // return.
3201 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3202 Ins, dl, DAG, InVals);
3203 }
3205 //===----------------------------------------------------------------------===//
3206 // Fast Calling Convention (tail call) implementation
3207 //===----------------------------------------------------------------------===//
3209 // Like std call, callee cleans arguments, convention except that ECX is
3210 // reserved for storing the tail called function address. Only 2 registers are
3211 // free for argument passing (inreg). Tail call optimization is performed
3212 // provided:
3213 // * tailcallopt is enabled
3214 // * caller/callee are fastcc
3215 // On X86_64 architecture with GOT-style position independent code only local
3216 // (within module) calls are supported at the moment.
3217 // To keep the stack aligned according to platform abi the function
3218 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3219 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3220 // If a tail called function callee has more arguments than the caller the
3221 // caller needs to make sure that there is room to move the RETADDR to. This is
3222 // achieved by reserving an area the size of the argument delta right after the
3223 // original RETADDR, but before the saved framepointer or the spilled registers
3224 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3225 // stack layout:
3226 // arg1
3227 // arg2
3228 // RETADDR
3229 // [ new RETADDR
3230 // move area ]
3231 // (possible EBP)
3232 // ESI
3233 // EDI
3234 // local1 ..
3236 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3237 /// for a 16 byte align requirement.
3238 unsigned
3239 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3240 SelectionDAG& DAG) const {
3241 MachineFunction &MF = DAG.getMachineFunction();
3242 const TargetMachine &TM = MF.getTarget();
3243 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3244 TM.getSubtargetImpl()->getRegisterInfo());
3245 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
3246 unsigned StackAlignment = TFI.getStackAlignment();
3247 uint64_t AlignMask = StackAlignment - 1;
3248 int64_t Offset = StackSize;
3249 unsigned SlotSize = RegInfo->getSlotSize();
3250 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3251 // Number smaller than 12 so just add the difference.
3252 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3253 } else {
3254 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3255 Offset = ((~AlignMask) & Offset) + StackAlignment +
3256 (StackAlignment-SlotSize);
3257 }
3258 return Offset;
3259 }
3261 /// MatchingStackOffset - Return true if the given stack call argument is
3262 /// already available in the same position (relatively) of the caller's
3263 /// incoming argument stack.
3264 static
3265 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3266 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3267 const X86InstrInfo *TII) {
3268 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3269 int FI = INT_MAX;
3270 if (Arg.getOpcode() == ISD::CopyFromReg) {
3271 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3272 if (!TargetRegisterInfo::isVirtualRegister(VR))
3273 return false;
3274 MachineInstr *Def = MRI->getVRegDef(VR);
3275 if (!Def)
3276 return false;
3277 if (!Flags.isByVal()) {
3278 if (!TII->isLoadFromStackSlot(Def, FI))
3279 return false;
3280 } else {
3281 unsigned Opcode = Def->getOpcode();
3282 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r) &&
3283 Def->getOperand(1).isFI()) {
3284 FI = Def->getOperand(1).getIndex();
3285 Bytes = Flags.getByValSize();
3286 } else
3287 return false;
3288 }
3289 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3290 if (Flags.isByVal())
3291 // ByVal argument is passed in as a pointer but it's now being
3292 // dereferenced. e.g.
3293 // define @foo(%struct.X* %A) {
3294 // tail call @bar(%struct.X* byval %A)
3295 // }
3296 return false;
3297 SDValue Ptr = Ld->getBasePtr();
3298 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3299 if (!FINode)
3300 return false;
3301 FI = FINode->getIndex();
3302 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3303 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3304 FI = FINode->getIndex();
3305 Bytes = Flags.getByValSize();
3306 } else
3307 return false;
3309 assert(FI != INT_MAX);
3310 if (!MFI->isFixedObjectIndex(FI))
3311 return false;
3312 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3313 }
3315 /// IsEligibleForTailCallOptimization - Check whether the call is eligible
3316 /// for tail call optimization. Targets which want to do tail call
3317 /// optimization should implement this function.
3318 bool
3319 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3320 CallingConv::ID CalleeCC,
3321 bool isVarArg,
3322 bool isCalleeStructRet,
3323 bool isCallerStructRet,
3324 Type *RetTy,
3325 const SmallVectorImpl<ISD::OutputArg> &Outs,
3326 const SmallVectorImpl<SDValue> &OutVals,
3327 const SmallVectorImpl<ISD::InputArg> &Ins,
3328 SelectionDAG &DAG) const {
3329 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
3330 return false;
3332 // If -tailcallopt is specified, make fastcc functions tail-callable.
3333 const MachineFunction &MF = DAG.getMachineFunction();
3334 const Function *CallerF = MF.getFunction();
3336 // If the function return type is x86_fp80 and the callee return type is not,
3337 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3338 // perform a tailcall optimization here.
3339 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3340 return false;
3342 CallingConv::ID CallerCC = CallerF->getCallingConv();
3343 bool CCMatch = CallerCC == CalleeCC;
3344 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3345 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3347 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3348 if (IsTailCallConvention(CalleeCC) && CCMatch)
3349 return true;
3350 return false;
3351 }
3353 // Look for obvious safe cases to perform tail call optimization that do not
3354 // require ABI changes. This is what gcc calls sibcall.
3356 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3357 // emit a special epilogue.
3358 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3359 DAG.getSubtarget().getRegisterInfo());
3360 if (RegInfo->needsStackRealignment(MF))
3361 return false;
3363 // Also avoid sibcall optimization if either caller or callee uses struct
3364 // return semantics.
3365 if (isCalleeStructRet || isCallerStructRet)
3366 return false;
3368 // An stdcall/thiscall caller is expected to clean up its arguments; the
3369 // callee isn't going to do that.
3370 // FIXME: this is more restrictive than needed. We could produce a tailcall
3371 // when the stack adjustment matches. For example, with a thiscall that takes
3372 // only one argument.
3373 if (!CCMatch && (CallerCC == CallingConv::X86_StdCall ||
3374 CallerCC == CallingConv::X86_ThisCall))
3375 return false;
3377 // Do not sibcall optimize vararg calls unless all arguments are passed via
3378 // registers.
3379 if (isVarArg && !Outs.empty()) {
3381 // Optimizing for varargs on Win64 is unlikely to be safe without
3382 // additional testing.
3383 if (IsCalleeWin64 || IsCallerWin64)
3384 return false;
3386 SmallVector<CCValAssign, 16> ArgLocs;
3387 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3388 *DAG.getContext());
3390 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3391 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3392 if (!ArgLocs[i].isRegLoc())
3393 return false;
3394 }
3396 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3397 // stack. Therefore, if it's not used by the call it is not safe to optimize
3398 // this into a sibcall.
3399 bool Unused = false;
3400 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3401 if (!Ins[i].Used) {
3402 Unused = true;
3403 break;
3404 }
3405 }
3406 if (Unused) {
3407 SmallVector<CCValAssign, 16> RVLocs;
3408 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3409 *DAG.getContext());
3410 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3411 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3412 CCValAssign &VA = RVLocs[i];
3413 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3414 return false;
3415 }
3416 }
3418 // If the calling conventions do not match, then we'd better make sure the
3419 // results are returned in the same way as what the caller expects.
3420 if (!CCMatch) {
3421 SmallVector<CCValAssign, 16> RVLocs1;
3422 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3423 *DAG.getContext());
3424 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3426 SmallVector<CCValAssign, 16> RVLocs2;
3427 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3428 *DAG.getContext());
3429 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3431 if (RVLocs1.size() != RVLocs2.size())
3432 return false;
3433 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3434 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3435 return false;
3436 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3437 return false;
3438 if (RVLocs1[i].isRegLoc()) {
3439 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3440 return false;
3441 } else {
3442 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3443 return false;
3444 }
3445 }
3446 }
3448 // If the callee takes no arguments then go on to check the results of the
3449 // call.
3450 if (!Outs.empty()) {
3451 // Check if stack adjustment is needed. For now, do not do this if any
3452 // argument is passed on the stack.
3453 SmallVector<CCValAssign, 16> ArgLocs;
3454 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3455 *DAG.getContext());
3457 // Allocate shadow area for Win64
3458 if (IsCalleeWin64)
3459 CCInfo.AllocateStack(32, 8);
3461 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3462 if (CCInfo.getNextStackOffset()) {
3463 MachineFunction &MF = DAG.getMachineFunction();
3464 if (MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn())
3465 return false;
3467 // Check if the arguments are already laid out in the right way as
3468 // the caller's fixed stack objects.
3469 MachineFrameInfo *MFI = MF.getFrameInfo();
3470 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3471 const X86InstrInfo *TII =
3472 static_cast<const X86InstrInfo *>(DAG.getSubtarget().getInstrInfo());
3473 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3474 CCValAssign &VA = ArgLocs[i];
3475 SDValue Arg = OutVals[i];
3476 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3477 if (VA.getLocInfo() == CCValAssign::Indirect)
3478 return false;
3479 if (!VA.isRegLoc()) {
3480 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3481 MFI, MRI, TII))
3482 return false;
3483 }
3484 }
3485 }
3487 // If the tailcall address may be in a register, then make sure it's
3488 // possible to register allocate for it. In 32-bit, the call address can
3489 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3490 // callee-saved registers are restored. These happen to be the same
3491 // registers used to pass 'inreg' arguments so watch out for those.
3492 if (!Subtarget->is64Bit() &&
3493 ((!isa<GlobalAddressSDNode>(Callee) &&
3494 !isa<ExternalSymbolSDNode>(Callee)) ||
3495 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3496 unsigned NumInRegs = 0;
3497 // In PIC we need an extra register to formulate the address computation
3498 // for the callee.
3499 unsigned MaxInRegs =
3500 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3502 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3503 CCValAssign &VA = ArgLocs[i];
3504 if (!VA.isRegLoc())
3505 continue;
3506 unsigned Reg = VA.getLocReg();
3507 switch (Reg) {
3508 default: break;
3509 case X86::EAX: case X86::EDX: case X86::ECX:
3510 if (++NumInRegs == MaxInRegs)
3511 return false;
3512 break;
3513 }
3514 }
3515 }
3516 }
3518 return true;
3519 }
3521 FastISel *
3522 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3523 const TargetLibraryInfo *libInfo) const {
3524 return X86::createFastISel(funcInfo, libInfo);
3525 }
3527 //===----------------------------------------------------------------------===//
3528 // Other Lowering Hooks
3529 //===----------------------------------------------------------------------===//
3531 static bool MayFoldLoad(SDValue Op) {
3532 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3533 }
3535 static bool MayFoldIntoStore(SDValue Op) {
3536 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3537 }
3539 static bool isTargetShuffle(unsigned Opcode) {
3540 switch(Opcode) {
3541 default: return false;
3542 case X86ISD::BLENDI:
3543 case X86ISD::PSHUFB:
3544 case X86ISD::PSHUFD:
3545 case X86ISD::PSHUFHW:
3546 case X86ISD::PSHUFLW:
3547 case X86ISD::SHUFP:
3548 case X86ISD::PALIGNR:
3549 case X86ISD::MOVLHPS:
3550 case X86ISD::MOVLHPD:
3551 case X86ISD::MOVHLPS:
3552 case X86ISD::MOVLPS:
3553 case X86ISD::MOVLPD:
3554 case X86ISD::MOVSHDUP:
3555 case X86ISD::MOVSLDUP:
3556 case X86ISD::MOVDDUP:
3557 case X86ISD::MOVSS:
3558 case X86ISD::MOVSD:
3559 case X86ISD::UNPCKL:
3560 case X86ISD::UNPCKH:
3561 case X86ISD::VPERMILPI:
3562 case X86ISD::VPERM2X128:
3563 case X86ISD::VPERMI:
3564 return true;
3565 }
3566 }
3568 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3569 SDValue V1, SelectionDAG &DAG) {
3570 switch(Opc) {
3571 default: llvm_unreachable("Unknown x86 shuffle node");
3572 case X86ISD::MOVSHDUP:
3573 case X86ISD::MOVSLDUP:
3574 case X86ISD::MOVDDUP:
3575 return DAG.getNode(Opc, dl, VT, V1);
3576 }
3577 }
3579 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3580 SDValue V1, unsigned TargetMask,
3581 SelectionDAG &DAG) {
3582 switch(Opc) {
3583 default: llvm_unreachable("Unknown x86 shuffle node");
3584 case X86ISD::PSHUFD:
3585 case X86ISD::PSHUFHW:
3586 case X86ISD::PSHUFLW:
3587 case X86ISD::VPERMILPI:
3588 case X86ISD::VPERMI:
3589 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3590 }
3591 }
3593 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3594 SDValue V1, SDValue V2, unsigned TargetMask,
3595 SelectionDAG &DAG) {
3596 switch(Opc) {
3597 default: llvm_unreachable("Unknown x86 shuffle node");
3598 case X86ISD::PALIGNR:
3599 case X86ISD::VALIGN:
3600 case X86ISD::SHUFP:
3601 case X86ISD::VPERM2X128:
3602 return DAG.getNode(Opc, dl, VT, V1, V2,
3603 DAG.getConstant(TargetMask, MVT::i8));
3604 }
3605 }
3607 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3608 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3609 switch(Opc) {
3610 default: llvm_unreachable("Unknown x86 shuffle node");
3611 case X86ISD::MOVLHPS:
3612 case X86ISD::MOVLHPD:
3613 case X86ISD::MOVHLPS:
3614 case X86ISD::MOVLPS:
3615 case X86ISD::MOVLPD:
3616 case X86ISD::MOVSS:
3617 case X86ISD::MOVSD:
3618 case X86ISD::UNPCKL:
3619 case X86ISD::UNPCKH:
3620 return DAG.getNode(Opc, dl, VT, V1, V2);
3621 }
3622 }
3624 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3625 MachineFunction &MF = DAG.getMachineFunction();
3626 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3627 DAG.getSubtarget().getRegisterInfo());
3628 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3629 int ReturnAddrIndex = FuncInfo->getRAIndex();
3631 if (ReturnAddrIndex == 0) {
3632 // Set up a frame object for the return address.
3633 unsigned SlotSize = RegInfo->getSlotSize();
3634 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3635 -(int64_t)SlotSize,
3636 false);
3637 FuncInfo->setRAIndex(ReturnAddrIndex);
3638 }
3640 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3641 }
3643 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3644 bool hasSymbolicDisplacement) {
3645 // Offset should fit into 32 bit immediate field.
3646 if (!isInt<32>(Offset))
3647 return false;
3649 // If we don't have a symbolic displacement - we don't have any extra
3650 // restrictions.
3651 if (!hasSymbolicDisplacement)
3652 return true;
3654 // FIXME: Some tweaks might be needed for medium code model.
3655 if (M != CodeModel::Small && M != CodeModel::Kernel)
3656 return false;
3658 // For small code model we assume that latest object is 16MB before end of 31
3659 // bits boundary. We may also accept pretty large negative constants knowing
3660 // that all objects are in the positive half of address space.
3661 if (M == CodeModel::Small && Offset < 16*1024*1024)
3662 return true;
3664 // For kernel code model we know that all object resist in the negative half
3665 // of 32bits address space. We may not accept negative offsets, since they may
3666 // be just off and we may accept pretty large positive ones.
3667 if (M == CodeModel::Kernel && Offset > 0)
3668 return true;
3670 return false;
3671 }
3673 /// isCalleePop - Determines whether the callee is required to pop its
3674 /// own arguments. Callee pop is necessary to support tail calls.
3675 bool X86::isCalleePop(CallingConv::ID CallingConv,
3676 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3677 switch (CallingConv) {
3678 default:
3679 return false;
3680 case CallingConv::X86_StdCall:
3681 case CallingConv::X86_FastCall:
3682 case CallingConv::X86_ThisCall:
3683 return !is64Bit;
3684 case CallingConv::Fast:
3685 case CallingConv::GHC:
3686 case CallingConv::HiPE:
3687 if (IsVarArg)
3688 return false;
3689 return TailCallOpt;
3690 }
3691 }
3693 /// \brief Return true if the condition is an unsigned comparison operation.
3694 static bool isX86CCUnsigned(unsigned X86CC) {
3695 switch (X86CC) {
3696 default: llvm_unreachable("Invalid integer condition!");
3697 case X86::COND_E: return true;
3698 case X86::COND_G: return false;
3699 case X86::COND_GE: return false;
3700 case X86::COND_L: return false;
3701 case X86::COND_LE: return false;
3702 case X86::COND_NE: return true;
3703 case X86::COND_B: return true;
3704 case X86::COND_A: return true;
3705 case X86::COND_BE: return true;
3706 case X86::COND_AE: return true;
3707 }
3708 llvm_unreachable("covered switch fell through?!");
3709 }
3711 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3712 /// specific condition code, returning the condition code and the LHS/RHS of the
3713 /// comparison to make.
3714 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3715 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3716 if (!isFP) {
3717 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3718 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3719 // X > -1 -> X == 0, jump !sign.
3720 RHS = DAG.getConstant(0, RHS.getValueType());
3721 return X86::COND_NS;
3722 }
3723 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3724 // X < 0 -> X == 0, jump on sign.
3725 return X86::COND_S;
3726 }
3727 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3728 // X < 1 -> X <= 0
3729 RHS = DAG.getConstant(0, RHS.getValueType());
3730 return X86::COND_LE;
3731 }
3732 }
3734 switch (SetCCOpcode) {
3735 default: llvm_unreachable("Invalid integer condition!");
3736 case ISD::SETEQ: return X86::COND_E;
3737 case ISD::SETGT: return X86::COND_G;
3738 case ISD::SETGE: return X86::COND_GE;
3739 case ISD::SETLT: return X86::COND_L;
3740 case ISD::SETLE: return X86::COND_LE;
3741 case ISD::SETNE: return X86::COND_NE;
3742 case ISD::SETULT: return X86::COND_B;
3743 case ISD::SETUGT: return X86::COND_A;
3744 case ISD::SETULE: return X86::COND_BE;
3745 case ISD::SETUGE: return X86::COND_AE;
3746 }
3747 }
3749 // First determine if it is required or is profitable to flip the operands.
3751 // If LHS is a foldable load, but RHS is not, flip the condition.
3752 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3753 !ISD::isNON_EXTLoad(RHS.getNode())) {
3754 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3755 std::swap(LHS, RHS);
3756 }
3758 switch (SetCCOpcode) {
3759 default: break;
3760 case ISD::SETOLT:
3761 case ISD::SETOLE:
3762 case ISD::SETUGT:
3763 case ISD::SETUGE:
3764 std::swap(LHS, RHS);
3765 break;
3766 }
3768 // On a floating point condition, the flags are set as follows:
3769 // ZF PF CF op
3770 // 0 | 0 | 0 | X > Y
3771 // 0 | 0 | 1 | X < Y
3772 // 1 | 0 | 0 | X == Y
3773 // 1 | 1 | 1 | unordered
3774 switch (SetCCOpcode) {
3775 default: llvm_unreachable("Condcode should be pre-legalized away");
3776 case ISD::SETUEQ:
3777 case ISD::SETEQ: return X86::COND_E;
3778 case ISD::SETOLT: // flipped
3779 case ISD::SETOGT:
3780 case ISD::SETGT: return X86::COND_A;
3781 case ISD::SETOLE: // flipped
3782 case ISD::SETOGE:
3783 case ISD::SETGE: return X86::COND_AE;
3784 case ISD::SETUGT: // flipped
3785 case ISD::SETULT:
3786 case ISD::SETLT: return X86::COND_B;
3787 case ISD::SETUGE: // flipped
3788 case ISD::SETULE:
3789 case ISD::SETLE: return X86::COND_BE;
3790 case ISD::SETONE:
3791 case ISD::SETNE: return X86::COND_NE;
3792 case ISD::SETUO: return X86::COND_P;
3793 case ISD::SETO: return X86::COND_NP;
3794 case ISD::SETOEQ:
3795 case ISD::SETUNE: return X86::COND_INVALID;
3796 }
3797 }
3799 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3800 /// code. Current x86 isa includes the following FP cmov instructions:
3801 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3802 static bool hasFPCMov(unsigned X86CC) {
3803 switch (X86CC) {
3804 default:
3805 return false;
3806 case X86::COND_B:
3807 case X86::COND_BE:
3808 case X86::COND_E:
3809 case X86::COND_P:
3810 case X86::COND_A:
3811 case X86::COND_AE:
3812 case X86::COND_NE:
3813 case X86::COND_NP:
3814 return true;
3815 }
3816 }
3818 /// isFPImmLegal - Returns true if the target can instruction select the
3819 /// specified FP immediate natively. If false, the legalizer will
3820 /// materialize the FP immediate as a load from a constant pool.
3821 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3822 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3823 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3824 return true;
3825 }
3826 return false;
3827 }
3829 /// \brief Returns true if it is beneficial to convert a load of a constant
3830 /// to just the constant itself.
3831 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3832 Type *Ty) const {
3833 assert(Ty->isIntegerTy());
3835 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3836 if (BitSize == 0 || BitSize > 64)
3837 return false;
3838 return true;
3839 }
3841 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3842 /// the specified range (L, H].
3843 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3844 return (Val < 0) || (Val >= Low && Val < Hi);
3845 }
3847 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3848 /// specified value.
3849 static bool isUndefOrEqual(int Val, int CmpVal) {
3850 return (Val < 0 || Val == CmpVal);
3851 }
3853 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3854 /// from position Pos and ending in Pos+Size, falls within the specified
3855 /// sequential range (L, L+Pos]. or is undef.
3856 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3857 unsigned Pos, unsigned Size, int Low) {
3858 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3859 if (!isUndefOrEqual(Mask[i], Low))
3860 return false;
3861 return true;
3862 }
3864 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3865 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3866 /// the second operand.
3867 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3868 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3869 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3870 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3871 return (Mask[0] < 2 && Mask[1] < 2);
3872 return false;
3873 }
3875 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3876 /// is suitable for input to PSHUFHW.
3877 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3878 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3879 return false;
3881 // Lower quadword copied in order or undef.
3882 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3883 return false;
3885 // Upper quadword shuffled.
3886 for (unsigned i = 4; i != 8; ++i)
3887 if (!isUndefOrInRange(Mask[i], 4, 8))
3888 return false;
3890 if (VT == MVT::v16i16) {
3891 // Lower quadword copied in order or undef.
3892 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3893 return false;
3895 // Upper quadword shuffled.
3896 for (unsigned i = 12; i != 16; ++i)
3897 if (!isUndefOrInRange(Mask[i], 12, 16))
3898 return false;
3899 }
3901 return true;
3902 }
3904 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3905 /// is suitable for input to PSHUFLW.
3906 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3907 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3908 return false;
3910 // Upper quadword copied in order.
3911 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3912 return false;
3914 // Lower quadword shuffled.
3915 for (unsigned i = 0; i != 4; ++i)
3916 if (!isUndefOrInRange(Mask[i], 0, 4))
3917 return false;
3919 if (VT == MVT::v16i16) {
3920 // Upper quadword copied in order.
3921 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3922 return false;
3924 // Lower quadword shuffled.
3925 for (unsigned i = 8; i != 12; ++i)
3926 if (!isUndefOrInRange(Mask[i], 8, 12))
3927 return false;
3928 }
3930 return true;
3931 }
3933 /// \brief Return true if the mask specifies a shuffle of elements that is
3934 /// suitable for input to intralane (palignr) or interlane (valign) vector
3935 /// right-shift.
3936 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3937 unsigned NumElts = VT.getVectorNumElements();
3938 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3939 unsigned NumLaneElts = NumElts/NumLanes;
3941 // Do not handle 64-bit element shuffles with palignr.
3942 if (NumLaneElts == 2)
3943 return false;
3945 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3946 unsigned i;
3947 for (i = 0; i != NumLaneElts; ++i) {
3948 if (Mask[i+l] >= 0)
3949 break;
3950 }
3952 // Lane is all undef, go to next lane
3953 if (i == NumLaneElts)
3954 continue;
3956 int Start = Mask[i+l];
3958 // Make sure its in this lane in one of the sources
3959 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3960 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3961 return false;
3963 // If not lane 0, then we must match lane 0
3964 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3965 return false;
3967 // Correct second source to be contiguous with first source
3968 if (Start >= (int)NumElts)
3969 Start -= NumElts - NumLaneElts;
3971 // Make sure we're shifting in the right direction.
3972 if (Start <= (int)(i+l))
3973 return false;
3975 Start -= i;
3977 // Check the rest of the elements to see if they are consecutive.
3978 for (++i; i != NumLaneElts; ++i) {
3979 int Idx = Mask[i+l];
3981 // Make sure its in this lane
3982 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3983 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3984 return false;
3986 // If not lane 0, then we must match lane 0
3987 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3988 return false;
3990 if (Idx >= (int)NumElts)
3991 Idx -= NumElts - NumLaneElts;
3993 if (!isUndefOrEqual(Idx, Start+i))
3994 return false;
3996 }
3997 }
3999 return true;
4000 }
4002 /// \brief Return true if the node specifies a shuffle of elements that is
4003 /// suitable for input to PALIGNR.
4004 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4005 const X86Subtarget *Subtarget) {
4006 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4007 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4008 VT.is512BitVector())
4009 // FIXME: Add AVX512BW.
4010 return false;
4012 return isAlignrMask(Mask, VT, false);
4013 }
4015 /// \brief Return true if the node specifies a shuffle of elements that is
4016 /// suitable for input to VALIGN.
4017 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4018 const X86Subtarget *Subtarget) {
4019 // FIXME: Add AVX512VL.
4020 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4021 return false;
4022 return isAlignrMask(Mask, VT, true);
4023 }
4025 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4026 /// the two vector operands have swapped position.
4027 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4028 unsigned NumElems) {
4029 for (unsigned i = 0; i != NumElems; ++i) {
4030 int idx = Mask[i];
4031 if (idx < 0)
4032 continue;
4033 else if (idx < (int)NumElems)
4034 Mask[i] = idx + NumElems;
4035 else
4036 Mask[i] = idx - NumElems;
4037 }
4038 }
4040 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4041 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4042 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4043 /// reverse of what x86 shuffles want.
4044 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4046 unsigned NumElems = VT.getVectorNumElements();
4047 unsigned NumLanes = VT.getSizeInBits()/128;
4048 unsigned NumLaneElems = NumElems/NumLanes;
4050 if (NumLaneElems != 2 && NumLaneElems != 4)
4051 return false;
4053 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4054 bool symetricMaskRequired =
4055 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4057 // VSHUFPSY divides the resulting vector into 4 chunks.
4058 // The sources are also splitted into 4 chunks, and each destination
4059 // chunk must come from a different source chunk.
4060 //
4061 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4062 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4063 //
4064 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4065 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4066 //
4067 // VSHUFPDY divides the resulting vector into 4 chunks.
4068 // The sources are also splitted into 4 chunks, and each destination
4069 // chunk must come from a different source chunk.
4070 //
4071 // SRC1 => X3 X2 X1 X0
4072 // SRC2 => Y3 Y2 Y1 Y0
4073 //
4074 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4075 //
4076 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4077 unsigned HalfLaneElems = NumLaneElems/2;
4078 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4079 for (unsigned i = 0; i != NumLaneElems; ++i) {
4080 int Idx = Mask[i+l];
4081 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4082 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4083 return false;
4084 // For VSHUFPSY, the mask of the second half must be the same as the
4085 // first but with the appropriate offsets. This works in the same way as
4086 // VPERMILPS works with masks.
4087 if (!symetricMaskRequired || Idx < 0)
4088 continue;
4089 if (MaskVal[i] < 0) {
4090 MaskVal[i] = Idx - l;
4091 continue;
4092 }
4093 if ((signed)(Idx - l) != MaskVal[i])
4094 return false;
4095 }
4096 }
4098 return true;
4099 }
4101 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4102 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4103 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4104 if (!VT.is128BitVector())
4105 return false;
4107 unsigned NumElems = VT.getVectorNumElements();
4109 if (NumElems != 4)
4110 return false;
4112 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4113 return isUndefOrEqual(Mask[0], 6) &&
4114 isUndefOrEqual(Mask[1], 7) &&
4115 isUndefOrEqual(Mask[2], 2) &&
4116 isUndefOrEqual(Mask[3], 3);
4117 }
4119 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4120 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4121 /// <2, 3, 2, 3>
4122 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4123 if (!VT.is128BitVector())
4124 return false;
4126 unsigned NumElems = VT.getVectorNumElements();
4128 if (NumElems != 4)
4129 return false;
4131 return isUndefOrEqual(Mask[0], 2) &&
4132 isUndefOrEqual(Mask[1], 3) &&
4133 isUndefOrEqual(Mask[2], 2) &&
4134 isUndefOrEqual(Mask[3], 3);
4135 }
4137 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4138 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4139 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4140 if (!VT.is128BitVector())
4141 return false;
4143 unsigned NumElems = VT.getVectorNumElements();
4145 if (NumElems != 2 && NumElems != 4)
4146 return false;
4148 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4149 if (!isUndefOrEqual(Mask[i], i + NumElems))
4150 return false;
4152 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4153 if (!isUndefOrEqual(Mask[i], i))
4154 return false;
4156 return true;
4157 }
4159 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4160 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4161 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4162 if (!VT.is128BitVector())
4163 return false;
4165 unsigned NumElems = VT.getVectorNumElements();
4167 if (NumElems != 2 && NumElems != 4)
4168 return false;
4170 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4171 if (!isUndefOrEqual(Mask[i], i))
4172 return false;
4174 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4175 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4176 return false;
4178 return true;
4179 }
4181 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4182 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4183 /// i. e: If all but one element come from the same vector.
4184 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4185 // TODO: Deal with AVX's VINSERTPS
4186 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4187 return false;
4189 unsigned CorrectPosV1 = 0;
4190 unsigned CorrectPosV2 = 0;
4191 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4192 if (Mask[i] == -1) {
4193 ++CorrectPosV1;
4194 ++CorrectPosV2;
4195 continue;
4196 }
4198 if (Mask[i] == i)
4199 ++CorrectPosV1;
4200 else if (Mask[i] == i + 4)
4201 ++CorrectPosV2;
4202 }
4204 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4205 // We have 3 elements (undefs count as elements from any vector) from one
4206 // vector, and one from another.
4207 return true;
4209 return false;
4210 }
4212 //
4213 // Some special combinations that can be optimized.
4214 //
4215 static
4216 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4217 SelectionDAG &DAG) {
4218 MVT VT = SVOp->getSimpleValueType(0);
4219 SDLoc dl(SVOp);
4221 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4222 return SDValue();
4224 ArrayRef<int> Mask = SVOp->getMask();
4226 // These are the special masks that may be optimized.
4227 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4228 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4229 bool MatchEvenMask = true;
4230 bool MatchOddMask = true;
4231 for (int i=0; i<8; ++i) {
4232 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4233 MatchEvenMask = false;
4234 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4235 MatchOddMask = false;
4236 }
4238 if (!MatchEvenMask && !MatchOddMask)
4239 return SDValue();
4241 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4243 SDValue Op0 = SVOp->getOperand(0);
4244 SDValue Op1 = SVOp->getOperand(1);
4246 if (MatchEvenMask) {
4247 // Shift the second operand right to 32 bits.
4248 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4249 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4250 } else {
4251 // Shift the first operand left to 32 bits.
4252 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4253 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4254 }
4255 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4256 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4257 }
4259 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4260 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4261 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4262 bool HasInt256, bool V2IsSplat = false) {
4264 assert(VT.getSizeInBits() >= 128 &&
4265 "Unsupported vector type for unpckl");
4267 unsigned NumElts = VT.getVectorNumElements();
4268 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4269 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4270 return false;
4272 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4273 "Unsupported vector type for unpckh");
4275 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4276 unsigned NumLanes = VT.getSizeInBits()/128;
4277 unsigned NumLaneElts = NumElts/NumLanes;
4279 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4280 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4281 int BitI = Mask[l+i];
4282 int BitI1 = Mask[l+i+1];
4283 if (!isUndefOrEqual(BitI, j))
4284 return false;
4285 if (V2IsSplat) {
4286 if (!isUndefOrEqual(BitI1, NumElts))
4287 return false;
4288 } else {
4289 if (!isUndefOrEqual(BitI1, j + NumElts))
4290 return false;
4291 }
4292 }
4293 }
4295 return true;
4296 }
4298 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4299 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4300 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4301 bool HasInt256, bool V2IsSplat = false) {
4302 assert(VT.getSizeInBits() >= 128 &&
4303 "Unsupported vector type for unpckh");
4305 unsigned NumElts = VT.getVectorNumElements();
4306 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4307 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4308 return false;
4310 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4311 "Unsupported vector type for unpckh");
4313 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4314 unsigned NumLanes = VT.getSizeInBits()/128;
4315 unsigned NumLaneElts = NumElts/NumLanes;
4317 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4318 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4319 int BitI = Mask[l+i];
4320 int BitI1 = Mask[l+i+1];
4321 if (!isUndefOrEqual(BitI, j))
4322 return false;
4323 if (V2IsSplat) {
4324 if (isUndefOrEqual(BitI1, NumElts))
4325 return false;
4326 } else {
4327 if (!isUndefOrEqual(BitI1, j+NumElts))
4328 return false;
4329 }
4330 }
4331 }
4332 return true;
4333 }
4335 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4336 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4337 /// <0, 0, 1, 1>
4338 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4339 unsigned NumElts = VT.getVectorNumElements();
4340 bool Is256BitVec = VT.is256BitVector();
4342 if (VT.is512BitVector())
4343 return false;
4344 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4345 "Unsupported vector type for unpckh");
4347 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4348 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4349 return false;
4351 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4352 // FIXME: Need a better way to get rid of this, there's no latency difference
4353 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4354 // the former later. We should also remove the "_undef" special mask.
4355 if (NumElts == 4 && Is256BitVec)
4356 return false;
4358 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4359 // independently on 128-bit lanes.
4360 unsigned NumLanes = VT.getSizeInBits()/128;
4361 unsigned NumLaneElts = NumElts/NumLanes;
4363 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4364 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4365 int BitI = Mask[l+i];
4366 int BitI1 = Mask[l+i+1];
4368 if (!isUndefOrEqual(BitI, j))
4369 return false;
4370 if (!isUndefOrEqual(BitI1, j))
4371 return false;
4372 }
4373 }
4375 return true;
4376 }
4378 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4379 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4380 /// <2, 2, 3, 3>
4381 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4382 unsigned NumElts = VT.getVectorNumElements();
4384 if (VT.is512BitVector())
4385 return false;
4387 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4388 "Unsupported vector type for unpckh");
4390 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4391 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4392 return false;
4394 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4395 // independently on 128-bit lanes.
4396 unsigned NumLanes = VT.getSizeInBits()/128;
4397 unsigned NumLaneElts = NumElts/NumLanes;
4399 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4400 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4401 int BitI = Mask[l+i];
4402 int BitI1 = Mask[l+i+1];
4403 if (!isUndefOrEqual(BitI, j))
4404 return false;
4405 if (!isUndefOrEqual(BitI1, j))
4406 return false;
4407 }
4408 }
4409 return true;
4410 }
4412 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4413 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4414 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4415 if (!VT.is512BitVector())
4416 return false;
4418 unsigned NumElts = VT.getVectorNumElements();
4419 unsigned HalfSize = NumElts/2;
4420 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4421 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4422 *Imm = 1;
4423 return true;
4424 }
4425 }
4426 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4427 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4428 *Imm = 0;
4429 return true;
4430 }
4431 }
4432 return false;
4433 }
4435 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4436 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4437 /// MOVSD, and MOVD, i.e. setting the lowest element.
4438 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4439 if (VT.getVectorElementType().getSizeInBits() < 32)
4440 return false;
4441 if (!VT.is128BitVector())
4442 return false;
4444 unsigned NumElts = VT.getVectorNumElements();
4446 if (!isUndefOrEqual(Mask[0], NumElts))
4447 return false;
4449 for (unsigned i = 1; i != NumElts; ++i)
4450 if (!isUndefOrEqual(Mask[i], i))
4451 return false;
4453 return true;
4454 }
4456 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4457 /// as permutations between 128-bit chunks or halves. As an example: this
4458 /// shuffle bellow:
4459 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4460 /// The first half comes from the second half of V1 and the second half from the
4461 /// the second half of V2.
4462 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4463 if (!HasFp256 || !VT.is256BitVector())
4464 return false;
4466 // The shuffle result is divided into half A and half B. In total the two
4467 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4468 // B must come from C, D, E or F.
4469 unsigned HalfSize = VT.getVectorNumElements()/2;
4470 bool MatchA = false, MatchB = false;
4472 // Check if A comes from one of C, D, E, F.
4473 for (unsigned Half = 0; Half != 4; ++Half) {
4474 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4475 MatchA = true;
4476 break;
4477 }
4478 }
4480 // Check if B comes from one of C, D, E, F.
4481 for (unsigned Half = 0; Half != 4; ++Half) {
4482 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4483 MatchB = true;
4484 break;
4485 }
4486 }
4488 return MatchA && MatchB;
4489 }
4491 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4492 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4493 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4494 MVT VT = SVOp->getSimpleValueType(0);
4496 unsigned HalfSize = VT.getVectorNumElements()/2;
4498 unsigned FstHalf = 0, SndHalf = 0;
4499 for (unsigned i = 0; i < HalfSize; ++i) {
4500 if (SVOp->getMaskElt(i) > 0) {
4501 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4502 break;
4503 }
4504 }
4505 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4506 if (SVOp->getMaskElt(i) > 0) {
4507 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4508 break;
4509 }
4510 }
4512 return (FstHalf | (SndHalf << 4));
4513 }
4515 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4516 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4517 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4518 if (EltSize < 32)
4519 return false;
4521 unsigned NumElts = VT.getVectorNumElements();
4522 Imm8 = 0;
4523 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4524 for (unsigned i = 0; i != NumElts; ++i) {
4525 if (Mask[i] < 0)
4526 continue;
4527 Imm8 |= Mask[i] << (i*2);
4528 }
4529 return true;
4530 }
4532 unsigned LaneSize = 4;
4533 SmallVector<int, 4> MaskVal(LaneSize, -1);
4535 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4536 for (unsigned i = 0; i != LaneSize; ++i) {
4537 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4538 return false;
4539 if (Mask[i+l] < 0)
4540 continue;
4541 if (MaskVal[i] < 0) {
4542 MaskVal[i] = Mask[i+l] - l;
4543 Imm8 |= MaskVal[i] << (i*2);
4544 continue;
4545 }
4546 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4547 return false;
4548 }
4549 }
4550 return true;
4551 }
4553 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4554 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4555 /// Note that VPERMIL mask matching is different depending whether theunderlying
4556 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4557 /// to the same elements of the low, but to the higher half of the source.
4558 /// In VPERMILPD the two lanes could be shuffled independently of each other
4559 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4560 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4561 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4562 if (VT.getSizeInBits() < 256 || EltSize < 32)
4563 return false;
4564 bool symetricMaskRequired = (EltSize == 32);
4565 unsigned NumElts = VT.getVectorNumElements();
4567 unsigned NumLanes = VT.getSizeInBits()/128;
4568 unsigned LaneSize = NumElts/NumLanes;
4569 // 2 or 4 elements in one lane
4571 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4572 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4573 for (unsigned i = 0; i != LaneSize; ++i) {
4574 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4575 return false;
4576 if (symetricMaskRequired) {
4577 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4578 ExpectedMaskVal[i] = Mask[i+l] - l;
4579 continue;
4580 }
4581 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4582 return false;
4583 }
4584 }
4585 }
4586 return true;
4587 }
4589 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4590 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4591 /// element of vector 2 and the other elements to come from vector 1 in order.
4592 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4593 bool V2IsSplat = false, bool V2IsUndef = false) {
4594 if (!VT.is128BitVector())
4595 return false;
4597 unsigned NumOps = VT.getVectorNumElements();
4598 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4599 return false;
4601 if (!isUndefOrEqual(Mask[0], 0))
4602 return false;
4604 for (unsigned i = 1; i != NumOps; ++i)
4605 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4606 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4607 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4608 return false;
4610 return true;
4611 }
4613 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4614 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4615 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4616 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4617 const X86Subtarget *Subtarget) {
4618 if (!Subtarget->hasSSE3())
4619 return false;
4621 unsigned NumElems = VT.getVectorNumElements();
4623 if ((VT.is128BitVector() && NumElems != 4) ||
4624 (VT.is256BitVector() && NumElems != 8) ||
4625 (VT.is512BitVector() && NumElems != 16))
4626 return false;
4628 // "i+1" is the value the indexed mask element must have
4629 for (unsigned i = 0; i != NumElems; i += 2)
4630 if (!isUndefOrEqual(Mask[i], i+1) ||
4631 !isUndefOrEqual(Mask[i+1], i+1))
4632 return false;
4634 return true;
4635 }
4637 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4638 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4639 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4640 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4641 const X86Subtarget *Subtarget) {
4642 if (!Subtarget->hasSSE3())
4643 return false;
4645 unsigned NumElems = VT.getVectorNumElements();
4647 if ((VT.is128BitVector() && NumElems != 4) ||
4648 (VT.is256BitVector() && NumElems != 8) ||
4649 (VT.is512BitVector() && NumElems != 16))
4650 return false;
4652 // "i" is the value the indexed mask element must have
4653 for (unsigned i = 0; i != NumElems; i += 2)
4654 if (!isUndefOrEqual(Mask[i], i) ||
4655 !isUndefOrEqual(Mask[i+1], i))
4656 return false;
4658 return true;
4659 }
4661 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4662 /// specifies a shuffle of elements that is suitable for input to 256-bit
4663 /// version of MOVDDUP.
4664 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4665 if (!HasFp256 || !VT.is256BitVector())
4666 return false;
4668 unsigned NumElts = VT.getVectorNumElements();
4669 if (NumElts != 4)
4670 return false;
4672 for (unsigned i = 0; i != NumElts/2; ++i)
4673 if (!isUndefOrEqual(Mask[i], 0))
4674 return false;
4675 for (unsigned i = NumElts/2; i != NumElts; ++i)
4676 if (!isUndefOrEqual(Mask[i], NumElts/2))
4677 return false;
4678 return true;
4679 }
4681 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4682 /// specifies a shuffle of elements that is suitable for input to 128-bit
4683 /// version of MOVDDUP.
4684 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4685 if (!VT.is128BitVector())
4686 return false;
4688 unsigned e = VT.getVectorNumElements() / 2;
4689 for (unsigned i = 0; i != e; ++i)
4690 if (!isUndefOrEqual(Mask[i], i))
4691 return false;
4692 for (unsigned i = 0; i != e; ++i)
4693 if (!isUndefOrEqual(Mask[e+i], i))
4694 return false;
4695 return true;
4696 }
4698 /// isVEXTRACTIndex - Return true if the specified
4699 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4700 /// suitable for instruction that extract 128 or 256 bit vectors
4701 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4702 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4703 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4704 return false;
4706 // The index should be aligned on a vecWidth-bit boundary.
4707 uint64_t Index =
4708 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4710 MVT VT = N->getSimpleValueType(0);
4711 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4712 bool Result = (Index * ElSize) % vecWidth == 0;
4714 return Result;
4715 }
4717 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4718 /// operand specifies a subvector insert that is suitable for input to
4719 /// insertion of 128 or 256-bit subvectors
4720 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4721 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4722 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4723 return false;
4724 // The index should be aligned on a vecWidth-bit boundary.
4725 uint64_t Index =
4726 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4728 MVT VT = N->getSimpleValueType(0);
4729 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4730 bool Result = (Index * ElSize) % vecWidth == 0;
4732 return Result;
4733 }
4735 bool X86::isVINSERT128Index(SDNode *N) {
4736 return isVINSERTIndex(N, 128);
4737 }
4739 bool X86::isVINSERT256Index(SDNode *N) {
4740 return isVINSERTIndex(N, 256);
4741 }
4743 bool X86::isVEXTRACT128Index(SDNode *N) {
4744 return isVEXTRACTIndex(N, 128);
4745 }
4747 bool X86::isVEXTRACT256Index(SDNode *N) {
4748 return isVEXTRACTIndex(N, 256);
4749 }
4751 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4752 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4753 /// Handles 128-bit and 256-bit.
4754 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4755 MVT VT = N->getSimpleValueType(0);
4757 assert((VT.getSizeInBits() >= 128) &&
4758 "Unsupported vector type for PSHUF/SHUFP");
4760 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4761 // independently on 128-bit lanes.
4762 unsigned NumElts = VT.getVectorNumElements();
4763 unsigned NumLanes = VT.getSizeInBits()/128;
4764 unsigned NumLaneElts = NumElts/NumLanes;
4766 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4767 "Only supports 2, 4 or 8 elements per lane");
4769 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4770 unsigned Mask = 0;
4771 for (unsigned i = 0; i != NumElts; ++i) {
4772 int Elt = N->getMaskElt(i);
4773 if (Elt < 0) continue;
4774 Elt &= NumLaneElts - 1;
4775 unsigned ShAmt = (i << Shift) % 8;
4776 Mask |= Elt << ShAmt;
4777 }
4779 return Mask;
4780 }
4782 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4783 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4784 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4785 MVT VT = N->getSimpleValueType(0);
4787 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4788 "Unsupported vector type for PSHUFHW");
4790 unsigned NumElts = VT.getVectorNumElements();
4792 unsigned Mask = 0;
4793 for (unsigned l = 0; l != NumElts; l += 8) {
4794 // 8 nodes per lane, but we only care about the last 4.
4795 for (unsigned i = 0; i < 4; ++i) {
4796 int Elt = N->getMaskElt(l+i+4);
4797 if (Elt < 0) continue;
4798 Elt &= 0x3; // only 2-bits.
4799 Mask |= Elt << (i * 2);
4800 }
4801 }
4803 return Mask;
4804 }
4806 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4807 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4808 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4809 MVT VT = N->getSimpleValueType(0);
4811 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4812 "Unsupported vector type for PSHUFHW");
4814 unsigned NumElts = VT.getVectorNumElements();
4816 unsigned Mask = 0;
4817 for (unsigned l = 0; l != NumElts; l += 8) {
4818 // 8 nodes per lane, but we only care about the first 4.
4819 for (unsigned i = 0; i < 4; ++i) {
4820 int Elt = N->getMaskElt(l+i);
4821 if (Elt < 0) continue;
4822 Elt &= 0x3; // only 2-bits
4823 Mask |= Elt << (i * 2);
4824 }
4825 }
4827 return Mask;
4828 }
4830 /// \brief Return the appropriate immediate to shuffle the specified
4831 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4832 /// VALIGN (if Interlane is true) instructions.
4833 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4834 bool InterLane) {
4835 MVT VT = SVOp->getSimpleValueType(0);
4836 unsigned EltSize = InterLane ? 1 :
4837 VT.getVectorElementType().getSizeInBits() >> 3;
4839 unsigned NumElts = VT.getVectorNumElements();
4840 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4841 unsigned NumLaneElts = NumElts/NumLanes;
4843 int Val = 0;
4844 unsigned i;
4845 for (i = 0; i != NumElts; ++i) {
4846 Val = SVOp->getMaskElt(i);
4847 if (Val >= 0)
4848 break;
4849 }
4850 if (Val >= (int)NumElts)
4851 Val -= NumElts - NumLaneElts;
4853 assert(Val - i > 0 && "PALIGNR imm should be positive");
4854 return (Val - i) * EltSize;
4855 }
4857 /// \brief Return the appropriate immediate to shuffle the specified
4858 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4859 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4860 return getShuffleAlignrImmediate(SVOp, false);
4861 }
4863 /// \brief Return the appropriate immediate to shuffle the specified
4864 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4865 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4866 return getShuffleAlignrImmediate(SVOp, true);
4867 }
4870 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4871 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4872 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4873 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4875 uint64_t Index =
4876 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4878 MVT VecVT = N->getOperand(0).getSimpleValueType();
4879 MVT ElVT = VecVT.getVectorElementType();
4881 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4882 return Index / NumElemsPerChunk;
4883 }
4885 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4886 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4887 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4888 llvm_unreachable("Illegal insert subvector for VINSERT");
4890 uint64_t Index =
4891 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4893 MVT VecVT = N->getSimpleValueType(0);
4894 MVT ElVT = VecVT.getVectorElementType();
4896 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4897 return Index / NumElemsPerChunk;
4898 }
4900 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4901 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4902 /// and VINSERTI128 instructions.
4903 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4904 return getExtractVEXTRACTImmediate(N, 128);
4905 }
4907 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4908 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4909 /// and VINSERTI64x4 instructions.
4910 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4911 return getExtractVEXTRACTImmediate(N, 256);
4912 }
4914 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4915 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4916 /// and VINSERTI128 instructions.
4917 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4918 return getInsertVINSERTImmediate(N, 128);
4919 }
4921 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4922 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4923 /// and VINSERTI64x4 instructions.
4924 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4925 return getInsertVINSERTImmediate(N, 256);
4926 }
4928 /// isZero - Returns true if Elt is a constant integer zero
4929 static bool isZero(SDValue V) {
4930 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4931 return C && C->isNullValue();
4932 }
4934 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4935 /// constant +0.0.
4936 bool X86::isZeroNode(SDValue Elt) {
4937 if (isZero(Elt))
4938 return true;
4939 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4940 return CFP->getValueAPF().isPosZero();
4941 return false;
4942 }
4944 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4945 /// match movhlps. The lower half elements should come from upper half of
4946 /// V1 (and in order), and the upper half elements should come from the upper
4947 /// half of V2 (and in order).
4948 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4949 if (!VT.is128BitVector())
4950 return false;
4951 if (VT.getVectorNumElements() != 4)
4952 return false;
4953 for (unsigned i = 0, e = 2; i != e; ++i)
4954 if (!isUndefOrEqual(Mask[i], i+2))
4955 return false;
4956 for (unsigned i = 2; i != 4; ++i)
4957 if (!isUndefOrEqual(Mask[i], i+4))
4958 return false;
4959 return true;
4960 }
4962 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4963 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4964 /// required.
4965 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4966 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4967 return false;
4968 N = N->getOperand(0).getNode();
4969 if (!ISD::isNON_EXTLoad(N))
4970 return false;
4971 if (LD)
4972 *LD = cast<LoadSDNode>(N);
4973 return true;
4974 }
4976 // Test whether the given value is a vector value which will be legalized
4977 // into a load.
4978 static bool WillBeConstantPoolLoad(SDNode *N) {
4979 if (N->getOpcode() != ISD::BUILD_VECTOR)
4980 return false;
4982 // Check for any non-constant elements.
4983 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4984 switch (N->getOperand(i).getNode()->getOpcode()) {
4985 case ISD::UNDEF:
4986 case ISD::ConstantFP:
4987 case ISD::Constant:
4988 break;
4989 default:
4990 return false;
4991 }
4993 // Vectors of all-zeros and all-ones are materialized with special
4994 // instructions rather than being loaded.
4995 return !ISD::isBuildVectorAllZeros(N) &&
4996 !ISD::isBuildVectorAllOnes(N);
4997 }
4999 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
5000 /// match movlp{s|d}. The lower half elements should come from lower half of
5001 /// V1 (and in order), and the upper half elements should come from the upper
5002 /// half of V2 (and in order). And since V1 will become the source of the
5003 /// MOVLP, it must be either a vector load or a scalar load to vector.
5004 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5005 ArrayRef<int> Mask, MVT VT) {
5006 if (!VT.is128BitVector())
5007 return false;
5009 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5010 return false;
5011 // Is V2 is a vector load, don't do this transformation. We will try to use
5012 // load folding shufps op.
5013 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5014 return false;
5016 unsigned NumElems = VT.getVectorNumElements();
5018 if (NumElems != 2 && NumElems != 4)
5019 return false;
5020 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5021 if (!isUndefOrEqual(Mask[i], i))
5022 return false;
5023 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5024 if (!isUndefOrEqual(Mask[i], i+NumElems))
5025 return false;
5026 return true;
5027 }
5029 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5030 /// to an zero vector.
5031 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5032 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5033 SDValue V1 = N->getOperand(0);
5034 SDValue V2 = N->getOperand(1);
5035 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5036 for (unsigned i = 0; i != NumElems; ++i) {
5037 int Idx = N->getMaskElt(i);
5038 if (Idx >= (int)NumElems) {
5039 unsigned Opc = V2.getOpcode();
5040 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5041 continue;
5042 if (Opc != ISD::BUILD_VECTOR ||
5043 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5044 return false;
5045 } else if (Idx >= 0) {
5046 unsigned Opc = V1.getOpcode();
5047 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5048 continue;
5049 if (Opc != ISD::BUILD_VECTOR ||
5050 !X86::isZeroNode(V1.getOperand(Idx)))
5051 return false;
5052 }
5053 }
5054 return true;
5055 }
5057 /// getZeroVector - Returns a vector of specified type with all zero elements.
5058 ///
5059 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5060 SelectionDAG &DAG, SDLoc dl) {
5061 assert(VT.isVector() && "Expected a vector type");
5063 // Always build SSE zero vectors as <4 x i32> bitcasted
5064 // to their dest type. This ensures they get CSE'd.
5065 SDValue Vec;
5066 if (VT.is128BitVector()) { // SSE
5067 if (Subtarget->hasSSE2()) { // SSE2
5068 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5069 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5070 } else { // SSE1
5071 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5072 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5073 }
5074 } else if (VT.is256BitVector()) { // AVX
5075 if (Subtarget->hasInt256()) { // AVX2
5076 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5077 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5078 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5079 } else {
5080 // 256-bit logic and arithmetic instructions in AVX are all
5081 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5082 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5083 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5084 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5085 }
5086 } else if (VT.is512BitVector()) { // AVX-512
5087 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5088 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5089 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5090 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5091 } else if (VT.getScalarType() == MVT::i1) {
5092 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5093 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5094 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5095 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5096 } else
5097 llvm_unreachable("Unexpected vector type");
5099 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5100 }
5102 /// getOnesVector - Returns a vector of specified type with all bits set.
5103 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5104 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5105 /// Then bitcast to their original type, ensuring they get CSE'd.
5106 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5107 SDLoc dl) {
5108 assert(VT.isVector() && "Expected a vector type");
5110 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5111 SDValue Vec;
5112 if (VT.is256BitVector()) {
5113 if (HasInt256) { // AVX2
5114 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5115 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5116 } else { // AVX
5117 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5118 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5119 }
5120 } else if (VT.is128BitVector()) {
5121 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5122 } else
5123 llvm_unreachable("Unexpected vector type");
5125 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5126 }
5128 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5129 /// that point to V2 points to its first element.
5130 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5131 for (unsigned i = 0; i != NumElems; ++i) {
5132 if (Mask[i] > (int)NumElems) {
5133 Mask[i] = NumElems;
5134 }
5135 }
5136 }
5138 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5139 /// operation of specified width.
5140 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5141 SDValue V2) {
5142 unsigned NumElems = VT.getVectorNumElements();
5143 SmallVector<int, 8> Mask;
5144 Mask.push_back(NumElems);
5145 for (unsigned i = 1; i != NumElems; ++i)
5146 Mask.push_back(i);
5147 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5148 }
5150 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5151 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5152 SDValue V2) {
5153 unsigned NumElems = VT.getVectorNumElements();
5154 SmallVector<int, 8> Mask;
5155 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5156 Mask.push_back(i);
5157 Mask.push_back(i + NumElems);
5158 }
5159 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5160 }
5162 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5163 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5164 SDValue V2) {
5165 unsigned NumElems = VT.getVectorNumElements();
5166 SmallVector<int, 8> Mask;
5167 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5168 Mask.push_back(i + Half);
5169 Mask.push_back(i + NumElems + Half);
5170 }
5171 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5172 }
5174 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5175 // a generic shuffle instruction because the target has no such instructions.
5176 // Generate shuffles which repeat i16 and i8 several times until they can be
5177 // represented by v4f32 and then be manipulated by target suported shuffles.
5178 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5179 MVT VT = V.getSimpleValueType();
5180 int NumElems = VT.getVectorNumElements();
5181 SDLoc dl(V);
5183 while (NumElems > 4) {
5184 if (EltNo < NumElems/2) {
5185 V = getUnpackl(DAG, dl, VT, V, V);
5186 } else {
5187 V = getUnpackh(DAG, dl, VT, V, V);
5188 EltNo -= NumElems/2;
5189 }
5190 NumElems >>= 1;
5191 }
5192 return V;
5193 }
5195 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5196 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5197 MVT VT = V.getSimpleValueType();
5198 SDLoc dl(V);
5200 if (VT.is128BitVector()) {
5201 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5202 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5203 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5204 &SplatMask[0]);
5205 } else if (VT.is256BitVector()) {
5206 // To use VPERMILPS to splat scalars, the second half of indicies must
5207 // refer to the higher part, which is a duplication of the lower one,
5208 // because VPERMILPS can only handle in-lane permutations.
5209 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5210 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5212 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5213 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5214 &SplatMask[0]);
5215 } else
5216 llvm_unreachable("Vector size not supported");
5218 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5219 }
5221 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5222 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5223 MVT SrcVT = SV->getSimpleValueType(0);
5224 SDValue V1 = SV->getOperand(0);
5225 SDLoc dl(SV);
5227 int EltNo = SV->getSplatIndex();
5228 int NumElems = SrcVT.getVectorNumElements();
5229 bool Is256BitVec = SrcVT.is256BitVector();
5231 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5232 "Unknown how to promote splat for type");
5234 // Extract the 128-bit part containing the splat element and update
5235 // the splat element index when it refers to the higher register.
5236 if (Is256BitVec) {
5237 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5238 if (EltNo >= NumElems/2)
5239 EltNo -= NumElems/2;
5240 }
5242 // All i16 and i8 vector types can't be used directly by a generic shuffle
5243 // instruction because the target has no such instruction. Generate shuffles
5244 // which repeat i16 and i8 several times until they fit in i32, and then can
5245 // be manipulated by target suported shuffles.
5246 MVT EltVT = SrcVT.getVectorElementType();
5247 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5248 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5250 // Recreate the 256-bit vector and place the same 128-bit vector
5251 // into the low and high part. This is necessary because we want
5252 // to use VPERM* to shuffle the vectors
5253 if (Is256BitVec) {
5254 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5255 }
5257 return getLegalSplat(DAG, V1, EltNo);
5258 }
5260 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5261 /// vector of zero or undef vector. This produces a shuffle where the low
5262 /// element of V2 is swizzled into the zero/undef vector, landing at element
5263 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5264 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5265 bool IsZero,
5266 const X86Subtarget *Subtarget,
5267 SelectionDAG &DAG) {
5268 MVT VT = V2.getSimpleValueType();
5269 SDValue V1 = IsZero
5270 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5271 unsigned NumElems = VT.getVectorNumElements();
5272 SmallVector<int, 16> MaskVec;
5273 for (unsigned i = 0; i != NumElems; ++i)
5274 // If this is the insertion idx, put the low elt of V2 here.
5275 MaskVec.push_back(i == Idx ? NumElems : i);
5276 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5277 }
5279 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5280 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5281 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5282 /// shuffles which use a single input multiple times, and in those cases it will
5283 /// adjust the mask to only have indices within that single input.
5284 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5285 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5286 unsigned NumElems = VT.getVectorNumElements();
5287 SDValue ImmN;
5289 IsUnary = false;
5290 bool IsFakeUnary = false;
5291 switch(N->getOpcode()) {
5292 case X86ISD::BLENDI:
5293 ImmN = N->getOperand(N->getNumOperands()-1);
5294 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5295 break;
5296 case X86ISD::SHUFP:
5297 ImmN = N->getOperand(N->getNumOperands()-1);
5298 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5299 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5300 break;
5301 case X86ISD::UNPCKH:
5302 DecodeUNPCKHMask(VT, Mask);
5303 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5304 break;
5305 case X86ISD::UNPCKL:
5306 DecodeUNPCKLMask(VT, Mask);
5307 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5308 break;
5309 case X86ISD::MOVHLPS:
5310 DecodeMOVHLPSMask(NumElems, Mask);
5311 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5312 break;
5313 case X86ISD::MOVLHPS:
5314 DecodeMOVLHPSMask(NumElems, Mask);
5315 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5316 break;
5317 case X86ISD::PALIGNR:
5318 ImmN = N->getOperand(N->getNumOperands()-1);
5319 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5320 break;
5321 case X86ISD::PSHUFD:
5322 case X86ISD::VPERMILPI:
5323 ImmN = N->getOperand(N->getNumOperands()-1);
5324 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5325 IsUnary = true;
5326 break;
5327 case X86ISD::PSHUFHW:
5328 ImmN = N->getOperand(N->getNumOperands()-1);
5329 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5330 IsUnary = true;
5331 break;
5332 case X86ISD::PSHUFLW:
5333 ImmN = N->getOperand(N->getNumOperands()-1);
5334 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5335 IsUnary = true;
5336 break;
5337 case X86ISD::PSHUFB: {
5338 IsUnary = true;
5339 SDValue MaskNode = N->getOperand(1);
5340 while (MaskNode->getOpcode() == ISD::BITCAST)
5341 MaskNode = MaskNode->getOperand(0);
5343 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5344 // If we have a build-vector, then things are easy.
5345 EVT VT = MaskNode.getValueType();
5346 assert(VT.isVector() &&
5347 "Can't produce a non-vector with a build_vector!");
5348 if (!VT.isInteger())
5349 return false;
5351 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5353 SmallVector<uint64_t, 32> RawMask;
5354 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5355 SDValue Op = MaskNode->getOperand(i);
5356 if (Op->getOpcode() == ISD::UNDEF) {
5357 RawMask.push_back((uint64_t)SM_SentinelUndef);
5358 continue;
5359 }
5360 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
5361 if (!CN)
5362 return false;
5363 APInt MaskElement = CN->getAPIntValue();
5365 // We now have to decode the element which could be any integer size and
5366 // extract each byte of it.
5367 for (int j = 0; j < NumBytesPerElement; ++j) {
5368 // Note that this is x86 and so always little endian: the low byte is
5369 // the first byte of the mask.
5370 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
5371 MaskElement = MaskElement.lshr(8);
5372 }
5373 }
5374 DecodePSHUFBMask(RawMask, Mask);
5375 break;
5376 }
5378 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
5379 if (!MaskLoad)
5380 return false;
5382 SDValue Ptr = MaskLoad->getBasePtr();
5383 if (Ptr->getOpcode() == X86ISD::Wrapper)
5384 Ptr = Ptr->getOperand(0);
5386 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
5387 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
5388 return false;
5390 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
5391 // FIXME: Support AVX-512 here.
5392 Type *Ty = C->getType();
5393 if (!Ty->isVectorTy() || (Ty->getVectorNumElements() != 16 &&
5394 Ty->getVectorNumElements() != 32))
5395 return false;
5397 DecodePSHUFBMask(C, Mask);
5398 break;
5399 }
5401 return false;
5402 }
5403 case X86ISD::VPERMI:
5404 ImmN = N->getOperand(N->getNumOperands()-1);
5405 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5406 IsUnary = true;
5407 break;
5408 case X86ISD::MOVSS:
5409 case X86ISD::MOVSD: {
5410 // The index 0 always comes from the first element of the second source,
5411 // this is why MOVSS and MOVSD are used in the first place. The other
5412 // elements come from the other positions of the first source vector
5413 Mask.push_back(NumElems);
5414 for (unsigned i = 1; i != NumElems; ++i) {
5415 Mask.push_back(i);
5416 }
5417 break;
5418 }
5419 case X86ISD::VPERM2X128:
5420 ImmN = N->getOperand(N->getNumOperands()-1);
5421 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5422 if (Mask.empty()) return false;
5423 break;
5424 case X86ISD::MOVSLDUP:
5425 DecodeMOVSLDUPMask(VT, Mask);
5426 break;
5427 case X86ISD::MOVSHDUP:
5428 DecodeMOVSHDUPMask(VT, Mask);
5429 break;
5430 case X86ISD::MOVDDUP:
5431 case X86ISD::MOVLHPD:
5432 case X86ISD::MOVLPD:
5433 case X86ISD::MOVLPS:
5434 // Not yet implemented
5435 return false;
5436 default: llvm_unreachable("unknown target shuffle node");
5437 }
5439 // If we have a fake unary shuffle, the shuffle mask is spread across two
5440 // inputs that are actually the same node. Re-map the mask to always point
5441 // into the first input.
5442 if (IsFakeUnary)
5443 for (int &M : Mask)
5444 if (M >= (int)Mask.size())
5445 M -= Mask.size();
5447 return true;
5448 }
5450 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5451 /// element of the result of the vector shuffle.
5452 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5453 unsigned Depth) {
5454 if (Depth == 6)
5455 return SDValue(); // Limit search depth.
5457 SDValue V = SDValue(N, 0);
5458 EVT VT = V.getValueType();
5459 unsigned Opcode = V.getOpcode();
5461 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5462 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5463 int Elt = SV->getMaskElt(Index);
5465 if (Elt < 0)
5466 return DAG.getUNDEF(VT.getVectorElementType());
5468 unsigned NumElems = VT.getVectorNumElements();
5469 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5470 : SV->getOperand(1);
5471 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5472 }
5474 // Recurse into target specific vector shuffles to find scalars.
5475 if (isTargetShuffle(Opcode)) {
5476 MVT ShufVT = V.getSimpleValueType();
5477 unsigned NumElems = ShufVT.getVectorNumElements();
5478 SmallVector<int, 16> ShuffleMask;
5479 bool IsUnary;
5481 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5482 return SDValue();
5484 int Elt = ShuffleMask[Index];
5485 if (Elt < 0)
5486 return DAG.getUNDEF(ShufVT.getVectorElementType());
5488 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5489 : N->getOperand(1);
5490 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5491 Depth+1);
5492 }
5494 // Actual nodes that may contain scalar elements
5495 if (Opcode == ISD::BITCAST) {
5496 V = V.getOperand(0);
5497 EVT SrcVT = V.getValueType();
5498 unsigned NumElems = VT.getVectorNumElements();
5500 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5501 return SDValue();
5502 }
5504 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5505 return (Index == 0) ? V.getOperand(0)
5506 : DAG.getUNDEF(VT.getVectorElementType());
5508 if (V.getOpcode() == ISD::BUILD_VECTOR)
5509 return V.getOperand(Index);
5511 return SDValue();
5512 }
5514 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5515 /// shuffle operation which come from a consecutively from a zero. The
5516 /// search can start in two different directions, from left or right.
5517 /// We count undefs as zeros until PreferredNum is reached.
5518 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5519 unsigned NumElems, bool ZerosFromLeft,
5520 SelectionDAG &DAG,
5521 unsigned PreferredNum = -1U) {
5522 unsigned NumZeros = 0;
5523 for (unsigned i = 0; i != NumElems; ++i) {
5524 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5525 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5526 if (!Elt.getNode())
5527 break;
5529 if (X86::isZeroNode(Elt))
5530 ++NumZeros;
5531 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5532 NumZeros = std::min(NumZeros + 1, PreferredNum);
5533 else
5534 break;
5535 }
5537 return NumZeros;
5538 }
5540 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5541 /// correspond consecutively to elements from one of the vector operands,
5542 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5543 static
5544 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5545 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5546 unsigned NumElems, unsigned &OpNum) {
5547 bool SeenV1 = false;
5548 bool SeenV2 = false;
5550 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5551 int Idx = SVOp->getMaskElt(i);
5552 // Ignore undef indicies
5553 if (Idx < 0)
5554 continue;
5556 if (Idx < (int)NumElems)
5557 SeenV1 = true;
5558 else
5559 SeenV2 = true;
5561 // Only accept consecutive elements from the same vector
5562 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5563 return false;
5564 }
5566 OpNum = SeenV1 ? 0 : 1;
5567 return true;
5568 }
5570 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5571 /// logical left shift of a vector.
5572 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5573 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5574 unsigned NumElems =
5575 SVOp->getSimpleValueType(0).getVectorNumElements();
5576 unsigned NumZeros = getNumOfConsecutiveZeros(
5577 SVOp, NumElems, false /* check zeros from right */, DAG,
5578 SVOp->getMaskElt(0));
5579 unsigned OpSrc;
5581 if (!NumZeros)
5582 return false;
5584 // Considering the elements in the mask that are not consecutive zeros,
5585 // check if they consecutively come from only one of the source vectors.
5586 //
5587 // V1 = {X, A, B, C} 0
5588 // \ \ \ /
5589 // vector_shuffle V1, V2 <1, 2, 3, X>
5590 //
5591 if (!isShuffleMaskConsecutive(SVOp,
5592 0, // Mask Start Index
5593 NumElems-NumZeros, // Mask End Index(exclusive)
5594 NumZeros, // Where to start looking in the src vector
5595 NumElems, // Number of elements in vector
5596 OpSrc)) // Which source operand ?
5597 return false;
5599 isLeft = false;
5600 ShAmt = NumZeros;
5601 ShVal = SVOp->getOperand(OpSrc);
5602 return true;
5603 }
5605 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5606 /// logical left shift of a vector.
5607 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5608 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5609 unsigned NumElems =
5610 SVOp->getSimpleValueType(0).getVectorNumElements();
5611 unsigned NumZeros = getNumOfConsecutiveZeros(
5612 SVOp, NumElems, true /* check zeros from left */, DAG,
5613 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5614 unsigned OpSrc;
5616 if (!NumZeros)
5617 return false;
5619 // Considering the elements in the mask that are not consecutive zeros,
5620 // check if they consecutively come from only one of the source vectors.
5621 //
5622 // 0 { A, B, X, X } = V2
5623 // / \ / /
5624 // vector_shuffle V1, V2 <X, X, 4, 5>
5625 //
5626 if (!isShuffleMaskConsecutive(SVOp,
5627 NumZeros, // Mask Start Index
5628 NumElems, // Mask End Index(exclusive)
5629 0, // Where to start looking in the src vector
5630 NumElems, // Number of elements in vector
5631 OpSrc)) // Which source operand ?
5632 return false;
5634 isLeft = true;
5635 ShAmt = NumZeros;
5636 ShVal = SVOp->getOperand(OpSrc);
5637 return true;
5638 }
5640 /// isVectorShift - Returns true if the shuffle can be implemented as a
5641 /// logical left or right shift of a vector.
5642 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5643 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5644 // Although the logic below support any bitwidth size, there are no
5645 // shift instructions which handle more than 128-bit vectors.
5646 if (!SVOp->getSimpleValueType(0).is128BitVector())
5647 return false;
5649 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5650 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5651 return true;
5653 return false;
5654 }
5656 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5657 ///
5658 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5659 unsigned NumNonZero, unsigned NumZero,
5660 SelectionDAG &DAG,
5661 const X86Subtarget* Subtarget,
5662 const TargetLowering &TLI) {
5663 if (NumNonZero > 8)
5664 return SDValue();
5666 SDLoc dl(Op);
5667 SDValue V;
5668 bool First = true;
5669 for (unsigned i = 0; i < 16; ++i) {
5670 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5671 if (ThisIsNonZero && First) {
5672 if (NumZero)
5673 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5674 else
5675 V = DAG.getUNDEF(MVT::v8i16);
5676 First = false;
5677 }
5679 if ((i & 1) != 0) {
5680 SDValue ThisElt, LastElt;
5681 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5682 if (LastIsNonZero) {
5683 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5684 MVT::i16, Op.getOperand(i-1));
5685 }
5686 if (ThisIsNonZero) {
5687 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5688 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5689 ThisElt, DAG.getConstant(8, MVT::i8));
5690 if (LastIsNonZero)
5691 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5692 } else
5693 ThisElt = LastElt;
5695 if (ThisElt.getNode())
5696 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5697 DAG.getIntPtrConstant(i/2));
5698 }
5699 }
5701 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5702 }
5704 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5705 ///
5706 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5707 unsigned NumNonZero, unsigned NumZero,
5708 SelectionDAG &DAG,
5709 const X86Subtarget* Subtarget,
5710 const TargetLowering &TLI) {
5711 if (NumNonZero > 4)
5712 return SDValue();
5714 SDLoc dl(Op);
5715 SDValue V;
5716 bool First = true;
5717 for (unsigned i = 0; i < 8; ++i) {
5718 bool isNonZero = (NonZeros & (1 << i)) != 0;
5719 if (isNonZero) {
5720 if (First) {
5721 if (NumZero)
5722 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5723 else
5724 V = DAG.getUNDEF(MVT::v8i16);
5725 First = false;
5726 }
5727 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5728 MVT::v8i16, V, Op.getOperand(i),
5729 DAG.getIntPtrConstant(i));
5730 }
5731 }
5733 return V;
5734 }
5736 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5737 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5738 unsigned NonZeros, unsigned NumNonZero,
5739 unsigned NumZero, SelectionDAG &DAG,
5740 const X86Subtarget *Subtarget,
5741 const TargetLowering &TLI) {
5742 // We know there's at least one non-zero element
5743 unsigned FirstNonZeroIdx = 0;
5744 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5745 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5746 X86::isZeroNode(FirstNonZero)) {
5747 ++FirstNonZeroIdx;
5748 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5749 }
5751 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5752 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5753 return SDValue();
5755 SDValue V = FirstNonZero.getOperand(0);
5756 MVT VVT = V.getSimpleValueType();
5757 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5758 return SDValue();
5760 unsigned FirstNonZeroDst =
5761 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5762 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5763 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5764 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5766 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5767 SDValue Elem = Op.getOperand(Idx);
5768 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5769 continue;
5771 // TODO: What else can be here? Deal with it.
5772 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5773 return SDValue();
5775 // TODO: Some optimizations are still possible here
5776 // ex: Getting one element from a vector, and the rest from another.
5777 if (Elem.getOperand(0) != V)
5778 return SDValue();
5780 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5781 if (Dst == Idx)
5782 ++CorrectIdx;
5783 else if (IncorrectIdx == -1U) {
5784 IncorrectIdx = Idx;
5785 IncorrectDst = Dst;
5786 } else
5787 // There was already one element with an incorrect index.
5788 // We can't optimize this case to an insertps.
5789 return SDValue();
5790 }
5792 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5793 SDLoc dl(Op);
5794 EVT VT = Op.getSimpleValueType();
5795 unsigned ElementMoveMask = 0;
5796 if (IncorrectIdx == -1U)
5797 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5798 else
5799 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5801 SDValue InsertpsMask =
5802 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5803 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5804 }
5806 return SDValue();
5807 }
5809 /// getVShift - Return a vector logical shift node.
5810 ///
5811 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5812 unsigned NumBits, SelectionDAG &DAG,
5813 const TargetLowering &TLI, SDLoc dl) {
5814 assert(VT.is128BitVector() && "Unknown type for VShift");
5815 EVT ShVT = MVT::v2i64;
5816 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5817 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5818 return DAG.getNode(ISD::BITCAST, dl, VT,
5819 DAG.getNode(Opc, dl, ShVT, SrcOp,
5820 DAG.getConstant(NumBits,
5821 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5822 }
5824 static SDValue
5825 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5827 // Check if the scalar load can be widened into a vector load. And if
5828 // the address is "base + cst" see if the cst can be "absorbed" into
5829 // the shuffle mask.
5830 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5831 SDValue Ptr = LD->getBasePtr();
5832 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5833 return SDValue();
5834 EVT PVT = LD->getValueType(0);
5835 if (PVT != MVT::i32 && PVT != MVT::f32)
5836 return SDValue();
5838 int FI = -1;
5839 int64_t Offset = 0;
5840 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5841 FI = FINode->getIndex();
5842 Offset = 0;
5843 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5844 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5845 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5846 Offset = Ptr.getConstantOperandVal(1);
5847 Ptr = Ptr.getOperand(0);
5848 } else {
5849 return SDValue();
5850 }
5852 // FIXME: 256-bit vector instructions don't require a strict alignment,
5853 // improve this code to support it better.
5854 unsigned RequiredAlign = VT.getSizeInBits()/8;
5855 SDValue Chain = LD->getChain();
5856 // Make sure the stack object alignment is at least 16 or 32.
5857 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5858 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5859 if (MFI->isFixedObjectIndex(FI)) {
5860 // Can't change the alignment. FIXME: It's possible to compute
5861 // the exact stack offset and reference FI + adjust offset instead.
5862 // If someone *really* cares about this. That's the way to implement it.
5863 return SDValue();
5864 } else {
5865 MFI->setObjectAlignment(FI, RequiredAlign);
5866 }
5867 }
5869 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5870 // Ptr + (Offset & ~15).
5871 if (Offset < 0)
5872 return SDValue();
5873 if ((Offset % RequiredAlign) & 3)
5874 return SDValue();
5875 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5876 if (StartOffset)
5877 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5878 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5880 int EltNo = (Offset - StartOffset) >> 2;
5881 unsigned NumElems = VT.getVectorNumElements();
5883 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5884 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5885 LD->getPointerInfo().getWithOffset(StartOffset),
5886 false, false, false, 0);
5888 SmallVector<int, 8> Mask;
5889 for (unsigned i = 0; i != NumElems; ++i)
5890 Mask.push_back(EltNo);
5892 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5893 }
5895 return SDValue();
5896 }
5898 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5899 /// vector of type 'VT', see if the elements can be replaced by a single large
5900 /// load which has the same value as a build_vector whose operands are 'elts'.
5901 ///
5902 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5903 ///
5904 /// FIXME: we'd also like to handle the case where the last elements are zero
5905 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5906 /// There's even a handy isZeroNode for that purpose.
5907 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5908 SDLoc &DL, SelectionDAG &DAG,
5909 bool isAfterLegalize) {
5910 EVT EltVT = VT.getVectorElementType();
5911 unsigned NumElems = Elts.size();
5913 LoadSDNode *LDBase = nullptr;
5914 unsigned LastLoadedElt = -1U;
5916 // For each element in the initializer, see if we've found a load or an undef.
5917 // If we don't find an initial load element, or later load elements are
5918 // non-consecutive, bail out.
5919 for (unsigned i = 0; i < NumElems; ++i) {
5920 SDValue Elt = Elts[i];
5922 if (!Elt.getNode() ||
5923 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5924 return SDValue();
5925 if (!LDBase) {
5926 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5927 return SDValue();
5928 LDBase = cast<LoadSDNode>(Elt.getNode());
5929 LastLoadedElt = i;
5930 continue;
5931 }
5932 if (Elt.getOpcode() == ISD::UNDEF)
5933 continue;
5935 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5936 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5937 return SDValue();
5938 LastLoadedElt = i;
5939 }
5941 // If we have found an entire vector of loads and undefs, then return a large
5942 // load of the entire vector width starting at the base pointer. If we found
5943 // consecutive loads for the low half, generate a vzext_load node.
5944 if (LastLoadedElt == NumElems - 1) {
5946 if (isAfterLegalize &&
5947 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5948 return SDValue();
5950 SDValue NewLd = SDValue();
5952 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5953 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5954 LDBase->getPointerInfo(),
5955 LDBase->isVolatile(), LDBase->isNonTemporal(),
5956 LDBase->isInvariant(), 0);
5957 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5958 LDBase->getPointerInfo(),
5959 LDBase->isVolatile(), LDBase->isNonTemporal(),
5960 LDBase->isInvariant(), LDBase->getAlignment());
5962 if (LDBase->hasAnyUseOfValue(1)) {
5963 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5964 SDValue(LDBase, 1),
5965 SDValue(NewLd.getNode(), 1));
5966 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5967 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5968 SDValue(NewLd.getNode(), 1));
5969 }
5971 return NewLd;
5972 }
5973 if (NumElems == 4 && LastLoadedElt == 1 &&
5974 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5975 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5976 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5977 SDValue ResNode =
5978 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5979 LDBase->getPointerInfo(),
5980 LDBase->getAlignment(),
5981 false/*isVolatile*/, true/*ReadMem*/,
5982 false/*WriteMem*/);
5984 // Make sure the newly-created LOAD is in the same position as LDBase in
5985 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5986 // update uses of LDBase's output chain to use the TokenFactor.
5987 if (LDBase->hasAnyUseOfValue(1)) {
5988 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5989 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5990 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5991 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5992 SDValue(ResNode.getNode(), 1));
5993 }
5995 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
5996 }
5997 return SDValue();
5998 }
6000 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
6001 /// to generate a splat value for the following cases:
6002 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
6003 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
6004 /// a scalar load, or a constant.
6005 /// The VBROADCAST node is returned when a pattern is found,
6006 /// or SDValue() otherwise.
6007 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
6008 SelectionDAG &DAG) {
6009 // VBROADCAST requires AVX.
6010 // TODO: Splats could be generated for non-AVX CPUs using SSE
6011 // instructions, but there's less potential gain for only 128-bit vectors.
6012 if (!Subtarget->hasAVX())
6013 return SDValue();
6015 MVT VT = Op.getSimpleValueType();
6016 SDLoc dl(Op);
6018 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6019 "Unsupported vector type for broadcast.");
6021 SDValue Ld;
6022 bool ConstSplatVal;
6024 switch (Op.getOpcode()) {
6025 default:
6026 // Unknown pattern found.
6027 return SDValue();
6029 case ISD::BUILD_VECTOR: {
6030 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6031 BitVector UndefElements;
6032 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6034 // We need a splat of a single value to use broadcast, and it doesn't
6035 // make any sense if the value is only in one element of the vector.
6036 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6037 return SDValue();
6039 Ld = Splat;
6040 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6041 Ld.getOpcode() == ISD::ConstantFP);
6043 // Make sure that all of the users of a non-constant load are from the
6044 // BUILD_VECTOR node.
6045 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6046 return SDValue();
6047 break;
6048 }
6050 case ISD::VECTOR_SHUFFLE: {
6051 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6053 // Shuffles must have a splat mask where the first element is
6054 // broadcasted.
6055 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6056 return SDValue();
6058 SDValue Sc = Op.getOperand(0);
6059 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6060 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6062 if (!Subtarget->hasInt256())
6063 return SDValue();
6065 // Use the register form of the broadcast instruction available on AVX2.
6066 if (VT.getSizeInBits() >= 256)
6067 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6068 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6069 }
6071 Ld = Sc.getOperand(0);
6072 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6073 Ld.getOpcode() == ISD::ConstantFP);
6075 // The scalar_to_vector node and the suspected
6076 // load node must have exactly one user.
6077 // Constants may have multiple users.
6079 // AVX-512 has register version of the broadcast
6080 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6081 Ld.getValueType().getSizeInBits() >= 32;
6082 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6083 !hasRegVer))
6084 return SDValue();
6085 break;
6086 }
6087 }
6089 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6090 bool IsGE256 = (VT.getSizeInBits() >= 256);
6092 // When optimizing for size, generate up to 5 extra bytes for a broadcast
6093 // instruction to save 8 or more bytes of constant pool data.
6094 // TODO: If multiple splats are generated to load the same constant,
6095 // it may be detrimental to overall size. There needs to be a way to detect
6096 // that condition to know if this is truly a size win.
6097 const Function *F = DAG.getMachineFunction().getFunction();
6098 bool OptForSize = F->getAttributes().
6099 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
6101 // Handle broadcasting a single constant scalar from the constant pool
6102 // into a vector.
6103 // On Sandybridge (no AVX2), it is still better to load a constant vector
6104 // from the constant pool and not to broadcast it from a scalar.
6105 // But override that restriction when optimizing for size.
6106 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
6107 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
6108 EVT CVT = Ld.getValueType();
6109 assert(!CVT.isVector() && "Must not broadcast a vector type");
6111 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
6112 // For size optimization, also splat v2f64 and v2i64, and for size opt
6113 // with AVX2, also splat i8 and i16.
6114 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
6115 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
6116 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
6117 const Constant *C = nullptr;
6118 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6119 C = CI->getConstantIntValue();
6120 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6121 C = CF->getConstantFPValue();
6123 assert(C && "Invalid constant type");
6125 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6126 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6127 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6128 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6129 MachinePointerInfo::getConstantPool(),
6130 false, false, false, Alignment);
6132 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6133 }
6134 }
6136 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6138 // Handle AVX2 in-register broadcasts.
6139 if (!IsLoad && Subtarget->hasInt256() &&
6140 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6141 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6143 // The scalar source must be a normal load.
6144 if (!IsLoad)
6145 return SDValue();
6147 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6148 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6150 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6151 // double since there is no vbroadcastsd xmm
6152 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6153 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6154 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6155 }
6157 // Unsupported broadcast.
6158 return SDValue();
6159 }
6161 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6162 /// underlying vector and index.
6163 ///
6164 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6165 /// index.
6166 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6167 SDValue ExtIdx) {
6168 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6169 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6170 return Idx;
6172 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6173 // lowered this:
6174 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6175 // to:
6176 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6177 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6178 // undef)
6179 // Constant<0>)
6180 // In this case the vector is the extract_subvector expression and the index
6181 // is 2, as specified by the shuffle.
6182 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6183 SDValue ShuffleVec = SVOp->getOperand(0);
6184 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6185 assert(ShuffleVecVT.getVectorElementType() ==
6186 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6188 int ShuffleIdx = SVOp->getMaskElt(Idx);
6189 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6190 ExtractedFromVec = ShuffleVec;
6191 return ShuffleIdx;
6192 }
6193 return Idx;
6194 }
6196 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6197 MVT VT = Op.getSimpleValueType();
6199 // Skip if insert_vec_elt is not supported.
6200 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6201 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6202 return SDValue();
6204 SDLoc DL(Op);
6205 unsigned NumElems = Op.getNumOperands();
6207 SDValue VecIn1;
6208 SDValue VecIn2;
6209 SmallVector<unsigned, 4> InsertIndices;
6210 SmallVector<int, 8> Mask(NumElems, -1);
6212 for (unsigned i = 0; i != NumElems; ++i) {
6213 unsigned Opc = Op.getOperand(i).getOpcode();
6215 if (Opc == ISD::UNDEF)
6216 continue;
6218 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6219 // Quit if more than 1 elements need inserting.
6220 if (InsertIndices.size() > 1)
6221 return SDValue();
6223 InsertIndices.push_back(i);
6224 continue;
6225 }
6227 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6228 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6229 // Quit if non-constant index.
6230 if (!isa<ConstantSDNode>(ExtIdx))
6231 return SDValue();
6232 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6234 // Quit if extracted from vector of different type.
6235 if (ExtractedFromVec.getValueType() != VT)
6236 return SDValue();
6238 if (!VecIn1.getNode())
6239 VecIn1 = ExtractedFromVec;
6240 else if (VecIn1 != ExtractedFromVec) {
6241 if (!VecIn2.getNode())
6242 VecIn2 = ExtractedFromVec;
6243 else if (VecIn2 != ExtractedFromVec)
6244 // Quit if more than 2 vectors to shuffle
6245 return SDValue();
6246 }
6248 if (ExtractedFromVec == VecIn1)
6249 Mask[i] = Idx;
6250 else if (ExtractedFromVec == VecIn2)
6251 Mask[i] = Idx + NumElems;
6252 }
6254 if (!VecIn1.getNode())
6255 return SDValue();
6257 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6258 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6259 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6260 unsigned Idx = InsertIndices[i];
6261 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6262 DAG.getIntPtrConstant(Idx));
6263 }
6265 return NV;
6266 }
6268 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6269 SDValue
6270 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6272 MVT VT = Op.getSimpleValueType();
6273 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6274 "Unexpected type in LowerBUILD_VECTORvXi1!");
6276 SDLoc dl(Op);
6277 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6278 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6279 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6280 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6281 }
6283 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6284 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6285 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6286 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6287 }
6289 bool AllContants = true;
6290 uint64_t Immediate = 0;
6291 int NonConstIdx = -1;
6292 bool IsSplat = true;
6293 unsigned NumNonConsts = 0;
6294 unsigned NumConsts = 0;
6295 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6296 SDValue In = Op.getOperand(idx);
6297 if (In.getOpcode() == ISD::UNDEF)
6298 continue;
6299 if (!isa<ConstantSDNode>(In)) {
6300 AllContants = false;
6301 NonConstIdx = idx;
6302 NumNonConsts++;
6303 }
6304 else {
6305 NumConsts++;
6306 if (cast<ConstantSDNode>(In)->getZExtValue())
6307 Immediate |= (1ULL << idx);
6308 }
6309 if (In != Op.getOperand(0))
6310 IsSplat = false;
6311 }
6313 if (AllContants) {
6314 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6315 DAG.getConstant(Immediate, MVT::i16));
6316 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6317 DAG.getIntPtrConstant(0));
6318 }
6320 if (NumNonConsts == 1 && NonConstIdx != 0) {
6321 SDValue DstVec;
6322 if (NumConsts) {
6323 SDValue VecAsImm = DAG.getConstant(Immediate,
6324 MVT::getIntegerVT(VT.getSizeInBits()));
6325 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6326 }
6327 else
6328 DstVec = DAG.getUNDEF(VT);
6329 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6330 Op.getOperand(NonConstIdx),
6331 DAG.getIntPtrConstant(NonConstIdx));
6332 }
6333 if (!IsSplat && (NonConstIdx != 0))
6334 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6335 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6336 SDValue Select;
6337 if (IsSplat)
6338 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6339 DAG.getConstant(-1, SelectVT),
6340 DAG.getConstant(0, SelectVT));
6341 else
6342 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6343 DAG.getConstant((Immediate | 1), SelectVT),
6344 DAG.getConstant(Immediate, SelectVT));
6345 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6346 }
6348 /// \brief Return true if \p N implements a horizontal binop and return the
6349 /// operands for the horizontal binop into V0 and V1.
6350 ///
6351 /// This is a helper function of PerformBUILD_VECTORCombine.
6352 /// This function checks that the build_vector \p N in input implements a
6353 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6354 /// operation to match.
6355 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6356 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6357 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6358 /// arithmetic sub.
6359 ///
6360 /// This function only analyzes elements of \p N whose indices are
6361 /// in range [BaseIdx, LastIdx).
6362 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6363 SelectionDAG &DAG,
6364 unsigned BaseIdx, unsigned LastIdx,
6365 SDValue &V0, SDValue &V1) {
6366 EVT VT = N->getValueType(0);
6368 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6369 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6370 "Invalid Vector in input!");
6372 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6373 bool CanFold = true;
6374 unsigned ExpectedVExtractIdx = BaseIdx;
6375 unsigned NumElts = LastIdx - BaseIdx;
6376 V0 = DAG.getUNDEF(VT);
6377 V1 = DAG.getUNDEF(VT);
6379 // Check if N implements a horizontal binop.
6380 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6381 SDValue Op = N->getOperand(i + BaseIdx);
6383 // Skip UNDEFs.
6384 if (Op->getOpcode() == ISD::UNDEF) {
6385 // Update the expected vector extract index.
6386 if (i * 2 == NumElts)
6387 ExpectedVExtractIdx = BaseIdx;
6388 ExpectedVExtractIdx += 2;
6389 continue;
6390 }
6392 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6394 if (!CanFold)
6395 break;
6397 SDValue Op0 = Op.getOperand(0);
6398 SDValue Op1 = Op.getOperand(1);
6400 // Try to match the following pattern:
6401 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6402 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6403 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6404 Op0.getOperand(0) == Op1.getOperand(0) &&
6405 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6406 isa<ConstantSDNode>(Op1.getOperand(1)));
6407 if (!CanFold)
6408 break;
6410 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6411 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6413 if (i * 2 < NumElts) {
6414 if (V0.getOpcode() == ISD::UNDEF)
6415 V0 = Op0.getOperand(0);
6416 } else {
6417 if (V1.getOpcode() == ISD::UNDEF)
6418 V1 = Op0.getOperand(0);
6419 if (i * 2 == NumElts)
6420 ExpectedVExtractIdx = BaseIdx;
6421 }
6423 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6424 if (I0 == ExpectedVExtractIdx)
6425 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6426 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6427 // Try to match the following dag sequence:
6428 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6429 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6430 } else
6431 CanFold = false;
6433 ExpectedVExtractIdx += 2;
6434 }
6436 return CanFold;
6437 }
6439 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6440 /// a concat_vector.
6441 ///
6442 /// This is a helper function of PerformBUILD_VECTORCombine.
6443 /// This function expects two 256-bit vectors called V0 and V1.
6444 /// At first, each vector is split into two separate 128-bit vectors.
6445 /// Then, the resulting 128-bit vectors are used to implement two
6446 /// horizontal binary operations.
6447 ///
6448 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6449 ///
6450 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6451 /// the two new horizontal binop.
6452 /// When Mode is set, the first horizontal binop dag node would take as input
6453 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6454 /// horizontal binop dag node would take as input the lower 128-bit of V1
6455 /// and the upper 128-bit of V1.
6456 /// Example:
6457 /// HADD V0_LO, V0_HI
6458 /// HADD V1_LO, V1_HI
6459 ///
6460 /// Otherwise, the first horizontal binop dag node takes as input the lower
6461 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6462 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6463 /// Example:
6464 /// HADD V0_LO, V1_LO
6465 /// HADD V0_HI, V1_HI
6466 ///
6467 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6468 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6469 /// the upper 128-bits of the result.
6470 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6471 SDLoc DL, SelectionDAG &DAG,
6472 unsigned X86Opcode, bool Mode,
6473 bool isUndefLO, bool isUndefHI) {
6474 EVT VT = V0.getValueType();
6475 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6476 "Invalid nodes in input!");
6478 unsigned NumElts = VT.getVectorNumElements();
6479 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6480 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6481 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6482 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6483 EVT NewVT = V0_LO.getValueType();
6485 SDValue LO = DAG.getUNDEF(NewVT);
6486 SDValue HI = DAG.getUNDEF(NewVT);
6488 if (Mode) {
6489 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6490 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6491 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6492 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6493 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6494 } else {
6495 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6496 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6497 V1_LO->getOpcode() != ISD::UNDEF))
6498 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6500 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6501 V1_HI->getOpcode() != ISD::UNDEF))
6502 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6503 }
6505 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6506 }
6508 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6509 /// sequence of 'vadd + vsub + blendi'.
6510 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6511 const X86Subtarget *Subtarget) {
6512 SDLoc DL(BV);
6513 EVT VT = BV->getValueType(0);
6514 unsigned NumElts = VT.getVectorNumElements();
6515 SDValue InVec0 = DAG.getUNDEF(VT);
6516 SDValue InVec1 = DAG.getUNDEF(VT);
6518 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6519 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6521 // Odd-numbered elements in the input build vector are obtained from
6522 // adding two integer/float elements.
6523 // Even-numbered elements in the input build vector are obtained from
6524 // subtracting two integer/float elements.
6525 unsigned ExpectedOpcode = ISD::FSUB;
6526 unsigned NextExpectedOpcode = ISD::FADD;
6527 bool AddFound = false;
6528 bool SubFound = false;
6530 for (unsigned i = 0, e = NumElts; i != e; i++) {
6531 SDValue Op = BV->getOperand(i);
6533 // Skip 'undef' values.
6534 unsigned Opcode = Op.getOpcode();
6535 if (Opcode == ISD::UNDEF) {
6536 std::swap(ExpectedOpcode, NextExpectedOpcode);
6537 continue;
6538 }
6540 // Early exit if we found an unexpected opcode.
6541 if (Opcode != ExpectedOpcode)
6542 return SDValue();
6544 SDValue Op0 = Op.getOperand(0);
6545 SDValue Op1 = Op.getOperand(1);
6547 // Try to match the following pattern:
6548 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6549 // Early exit if we cannot match that sequence.
6550 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6551 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6552 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6553 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6554 Op0.getOperand(1) != Op1.getOperand(1))
6555 return SDValue();
6557 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6558 if (I0 != i)
6559 return SDValue();
6561 // We found a valid add/sub node. Update the information accordingly.
6562 if (i & 1)
6563 AddFound = true;
6564 else
6565 SubFound = true;
6567 // Update InVec0 and InVec1.
6568 if (InVec0.getOpcode() == ISD::UNDEF)
6569 InVec0 = Op0.getOperand(0);
6570 if (InVec1.getOpcode() == ISD::UNDEF)
6571 InVec1 = Op1.getOperand(0);
6573 // Make sure that operands in input to each add/sub node always
6574 // come from a same pair of vectors.
6575 if (InVec0 != Op0.getOperand(0)) {
6576 if (ExpectedOpcode == ISD::FSUB)
6577 return SDValue();
6579 // FADD is commutable. Try to commute the operands
6580 // and then test again.
6581 std::swap(Op0, Op1);
6582 if (InVec0 != Op0.getOperand(0))
6583 return SDValue();
6584 }
6586 if (InVec1 != Op1.getOperand(0))
6587 return SDValue();
6589 // Update the pair of expected opcodes.
6590 std::swap(ExpectedOpcode, NextExpectedOpcode);
6591 }
6593 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6594 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6595 InVec1.getOpcode() != ISD::UNDEF)
6596 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6598 return SDValue();
6599 }
6601 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6602 const X86Subtarget *Subtarget) {
6603 SDLoc DL(N);
6604 EVT VT = N->getValueType(0);
6605 unsigned NumElts = VT.getVectorNumElements();
6606 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6607 SDValue InVec0, InVec1;
6609 // Try to match an ADDSUB.
6610 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6611 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6612 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6613 if (Value.getNode())
6614 return Value;
6615 }
6617 // Try to match horizontal ADD/SUB.
6618 unsigned NumUndefsLO = 0;
6619 unsigned NumUndefsHI = 0;
6620 unsigned Half = NumElts/2;
6622 // Count the number of UNDEF operands in the build_vector in input.
6623 for (unsigned i = 0, e = Half; i != e; ++i)
6624 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6625 NumUndefsLO++;
6627 for (unsigned i = Half, e = NumElts; i != e; ++i)
6628 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6629 NumUndefsHI++;
6631 // Early exit if this is either a build_vector of all UNDEFs or all the
6632 // operands but one are UNDEF.
6633 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6634 return SDValue();
6636 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6637 // Try to match an SSE3 float HADD/HSUB.
6638 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6639 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6641 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6642 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6643 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6644 // Try to match an SSSE3 integer HADD/HSUB.
6645 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6646 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6648 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6649 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6650 }
6652 if (!Subtarget->hasAVX())
6653 return SDValue();
6655 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6656 // Try to match an AVX horizontal add/sub of packed single/double
6657 // precision floating point values from 256-bit vectors.
6658 SDValue InVec2, InVec3;
6659 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6660 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6661 ((InVec0.getOpcode() == ISD::UNDEF ||
6662 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6663 ((InVec1.getOpcode() == ISD::UNDEF ||
6664 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6665 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6667 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6668 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6669 ((InVec0.getOpcode() == ISD::UNDEF ||
6670 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6671 ((InVec1.getOpcode() == ISD::UNDEF ||
6672 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6673 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6674 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6675 // Try to match an AVX2 horizontal add/sub of signed integers.
6676 SDValue InVec2, InVec3;
6677 unsigned X86Opcode;
6678 bool CanFold = true;
6680 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6681 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6682 ((InVec0.getOpcode() == ISD::UNDEF ||
6683 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6684 ((InVec1.getOpcode() == ISD::UNDEF ||
6685 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6686 X86Opcode = X86ISD::HADD;
6687 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6688 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6689 ((InVec0.getOpcode() == ISD::UNDEF ||
6690 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6691 ((InVec1.getOpcode() == ISD::UNDEF ||
6692 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6693 X86Opcode = X86ISD::HSUB;
6694 else
6695 CanFold = false;
6697 if (CanFold) {
6698 // Fold this build_vector into a single horizontal add/sub.
6699 // Do this only if the target has AVX2.
6700 if (Subtarget->hasAVX2())
6701 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6703 // Do not try to expand this build_vector into a pair of horizontal
6704 // add/sub if we can emit a pair of scalar add/sub.
6705 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6706 return SDValue();
6708 // Convert this build_vector into a pair of horizontal binop followed by
6709 // a concat vector.
6710 bool isUndefLO = NumUndefsLO == Half;
6711 bool isUndefHI = NumUndefsHI == Half;
6712 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6713 isUndefLO, isUndefHI);
6714 }
6715 }
6717 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6718 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6719 unsigned X86Opcode;
6720 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6721 X86Opcode = X86ISD::HADD;
6722 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6723 X86Opcode = X86ISD::HSUB;
6724 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6725 X86Opcode = X86ISD::FHADD;
6726 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6727 X86Opcode = X86ISD::FHSUB;
6728 else
6729 return SDValue();
6731 // Don't try to expand this build_vector into a pair of horizontal add/sub
6732 // if we can simply emit a pair of scalar add/sub.
6733 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6734 return SDValue();
6736 // Convert this build_vector into two horizontal add/sub followed by
6737 // a concat vector.
6738 bool isUndefLO = NumUndefsLO == Half;
6739 bool isUndefHI = NumUndefsHI == Half;
6740 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6741 isUndefLO, isUndefHI);
6742 }
6744 return SDValue();
6745 }
6747 SDValue
6748 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6749 SDLoc dl(Op);
6751 MVT VT = Op.getSimpleValueType();
6752 MVT ExtVT = VT.getVectorElementType();
6753 unsigned NumElems = Op.getNumOperands();
6755 // Generate vectors for predicate vectors.
6756 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6757 return LowerBUILD_VECTORvXi1(Op, DAG);
6759 // Vectors containing all zeros can be matched by pxor and xorps later
6760 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6761 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6762 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6763 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6764 return Op;
6766 return getZeroVector(VT, Subtarget, DAG, dl);
6767 }
6769 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6770 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6771 // vpcmpeqd on 256-bit vectors.
6772 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6773 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6774 return Op;
6776 if (!VT.is512BitVector())
6777 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6778 }
6780 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6781 if (Broadcast.getNode())
6782 return Broadcast;
6784 unsigned EVTBits = ExtVT.getSizeInBits();
6786 unsigned NumZero = 0;
6787 unsigned NumNonZero = 0;
6788 unsigned NonZeros = 0;
6789 bool IsAllConstants = true;
6790 SmallSet<SDValue, 8> Values;
6791 for (unsigned i = 0; i < NumElems; ++i) {
6792 SDValue Elt = Op.getOperand(i);
6793 if (Elt.getOpcode() == ISD::UNDEF)
6794 continue;
6795 Values.insert(Elt);
6796 if (Elt.getOpcode() != ISD::Constant &&
6797 Elt.getOpcode() != ISD::ConstantFP)
6798 IsAllConstants = false;
6799 if (X86::isZeroNode(Elt))
6800 NumZero++;
6801 else {
6802 NonZeros |= (1 << i);
6803 NumNonZero++;
6804 }
6805 }
6807 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6808 if (NumNonZero == 0)
6809 return DAG.getUNDEF(VT);
6811 // Special case for single non-zero, non-undef, element.
6812 if (NumNonZero == 1) {
6813 unsigned Idx = countTrailingZeros(NonZeros);
6814 SDValue Item = Op.getOperand(Idx);
6816 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6817 // the value are obviously zero, truncate the value to i32 and do the
6818 // insertion that way. Only do this if the value is non-constant or if the
6819 // value is a constant being inserted into element 0. It is cheaper to do
6820 // a constant pool load than it is to do a movd + shuffle.
6821 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6822 (!IsAllConstants || Idx == 0)) {
6823 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6824 // Handle SSE only.
6825 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6826 EVT VecVT = MVT::v4i32;
6827 unsigned VecElts = 4;
6829 // Truncate the value (which may itself be a constant) to i32, and
6830 // convert it to a vector with movd (S2V+shuffle to zero extend).
6831 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6832 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6834 // If using the new shuffle lowering, just directly insert this.
6835 if (ExperimentalVectorShuffleLowering)
6836 return DAG.getNode(
6837 ISD::BITCAST, dl, VT,
6838 getShuffleVectorZeroOrUndef(Item, Idx * 2, true, Subtarget, DAG));
6840 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6842 // Now we have our 32-bit value zero extended in the low element of
6843 // a vector. If Idx != 0, swizzle it into place.
6844 if (Idx != 0) {
6845 SmallVector<int, 4> Mask;
6846 Mask.push_back(Idx);
6847 for (unsigned i = 1; i != VecElts; ++i)
6848 Mask.push_back(i);
6849 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6850 &Mask[0]);
6851 }
6852 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6853 }
6854 }
6856 // If we have a constant or non-constant insertion into the low element of
6857 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6858 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6859 // depending on what the source datatype is.
6860 if (Idx == 0) {
6861 if (NumZero == 0)
6862 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6864 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6865 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6866 if (VT.is256BitVector() || VT.is512BitVector()) {
6867 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6868 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6869 Item, DAG.getIntPtrConstant(0));
6870 }
6871 assert(VT.is128BitVector() && "Expected an SSE value type!");
6872 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6873 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6874 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6875 }
6877 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6878 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6879 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6880 if (VT.is256BitVector()) {
6881 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6882 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6883 } else {
6884 assert(VT.is128BitVector() && "Expected an SSE value type!");
6885 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6886 }
6887 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6888 }
6889 }
6891 // Is it a vector logical left shift?
6892 if (NumElems == 2 && Idx == 1 &&
6893 X86::isZeroNode(Op.getOperand(0)) &&
6894 !X86::isZeroNode(Op.getOperand(1))) {
6895 unsigned NumBits = VT.getSizeInBits();
6896 return getVShift(true, VT,
6897 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6898 VT, Op.getOperand(1)),
6899 NumBits/2, DAG, *this, dl);
6900 }
6902 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6903 return SDValue();
6905 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6906 // is a non-constant being inserted into an element other than the low one,
6907 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6908 // movd/movss) to move this into the low element, then shuffle it into
6909 // place.
6910 if (EVTBits == 32) {
6911 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6913 // If using the new shuffle lowering, just directly insert this.
6914 if (ExperimentalVectorShuffleLowering)
6915 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6917 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6918 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6919 SmallVector<int, 8> MaskVec;
6920 for (unsigned i = 0; i != NumElems; ++i)
6921 MaskVec.push_back(i == Idx ? 0 : 1);
6922 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6923 }
6924 }
6926 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6927 if (Values.size() == 1) {
6928 if (EVTBits == 32) {
6929 // Instead of a shuffle like this:
6930 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6931 // Check if it's possible to issue this instead.
6932 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6933 unsigned Idx = countTrailingZeros(NonZeros);
6934 SDValue Item = Op.getOperand(Idx);
6935 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6936 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6937 }
6938 return SDValue();
6939 }
6941 // A vector full of immediates; various special cases are already
6942 // handled, so this is best done with a single constant-pool load.
6943 if (IsAllConstants)
6944 return SDValue();
6946 // For AVX-length vectors, build the individual 128-bit pieces and use
6947 // shuffles to put them in place.
6948 if (VT.is256BitVector() || VT.is512BitVector()) {
6949 SmallVector<SDValue, 64> V;
6950 for (unsigned i = 0; i != NumElems; ++i)
6951 V.push_back(Op.getOperand(i));
6953 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6955 // Build both the lower and upper subvector.
6956 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6957 makeArrayRef(&V[0], NumElems/2));
6958 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6959 makeArrayRef(&V[NumElems / 2], NumElems/2));
6961 // Recreate the wider vector with the lower and upper part.
6962 if (VT.is256BitVector())
6963 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6964 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6965 }
6967 // Let legalizer expand 2-wide build_vectors.
6968 if (EVTBits == 64) {
6969 if (NumNonZero == 1) {
6970 // One half is zero or undef.
6971 unsigned Idx = countTrailingZeros(NonZeros);
6972 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6973 Op.getOperand(Idx));
6974 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6975 }
6976 return SDValue();
6977 }
6979 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6980 if (EVTBits == 8 && NumElems == 16) {
6981 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6982 Subtarget, *this);
6983 if (V.getNode()) return V;
6984 }
6986 if (EVTBits == 16 && NumElems == 8) {
6987 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6988 Subtarget, *this);
6989 if (V.getNode()) return V;
6990 }
6992 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6993 if (EVTBits == 32 && NumElems == 4) {
6994 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
6995 NumZero, DAG, Subtarget, *this);
6996 if (V.getNode())
6997 return V;
6998 }
7000 // If element VT is == 32 bits, turn it into a number of shuffles.
7001 SmallVector<SDValue, 8> V(NumElems);
7002 if (NumElems == 4 && NumZero > 0) {
7003 for (unsigned i = 0; i < 4; ++i) {
7004 bool isZero = !(NonZeros & (1 << i));
7005 if (isZero)
7006 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
7007 else
7008 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7009 }
7011 for (unsigned i = 0; i < 2; ++i) {
7012 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
7013 default: break;
7014 case 0:
7015 V[i] = V[i*2]; // Must be a zero vector.
7016 break;
7017 case 1:
7018 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
7019 break;
7020 case 2:
7021 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
7022 break;
7023 case 3:
7024 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7025 break;
7026 }
7027 }
7029 bool Reverse1 = (NonZeros & 0x3) == 2;
7030 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7031 int MaskVec[] = {
7032 Reverse1 ? 1 : 0,
7033 Reverse1 ? 0 : 1,
7034 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7035 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7036 };
7037 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7038 }
7040 if (Values.size() > 1 && VT.is128BitVector()) {
7041 // Check for a build vector of consecutive loads.
7042 for (unsigned i = 0; i < NumElems; ++i)
7043 V[i] = Op.getOperand(i);
7045 // Check for elements which are consecutive loads.
7046 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7047 if (LD.getNode())
7048 return LD;
7050 // Check for a build vector from mostly shuffle plus few inserting.
7051 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7052 if (Sh.getNode())
7053 return Sh;
7055 // For SSE 4.1, use insertps to put the high elements into the low element.
7056 if (getSubtarget()->hasSSE41()) {
7057 SDValue Result;
7058 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7059 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7060 else
7061 Result = DAG.getUNDEF(VT);
7063 for (unsigned i = 1; i < NumElems; ++i) {
7064 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7065 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7066 Op.getOperand(i), DAG.getIntPtrConstant(i));
7067 }
7068 return Result;
7069 }
7071 // Otherwise, expand into a number of unpckl*, start by extending each of
7072 // our (non-undef) elements to the full vector width with the element in the
7073 // bottom slot of the vector (which generates no code for SSE).
7074 for (unsigned i = 0; i < NumElems; ++i) {
7075 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7076 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7077 else
7078 V[i] = DAG.getUNDEF(VT);
7079 }
7081 // Next, we iteratively mix elements, e.g. for v4f32:
7082 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7083 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7084 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7085 unsigned EltStride = NumElems >> 1;
7086 while (EltStride != 0) {
7087 for (unsigned i = 0; i < EltStride; ++i) {
7088 // If V[i+EltStride] is undef and this is the first round of mixing,
7089 // then it is safe to just drop this shuffle: V[i] is already in the
7090 // right place, the one element (since it's the first round) being
7091 // inserted as undef can be dropped. This isn't safe for successive
7092 // rounds because they will permute elements within both vectors.
7093 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7094 EltStride == NumElems/2)
7095 continue;
7097 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7098 }
7099 EltStride >>= 1;
7100 }
7101 return V[0];
7102 }
7103 return SDValue();
7104 }
7106 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7107 // to create 256-bit vectors from two other 128-bit ones.
7108 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7109 SDLoc dl(Op);
7110 MVT ResVT = Op.getSimpleValueType();
7112 assert((ResVT.is256BitVector() ||
7113 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7115 SDValue V1 = Op.getOperand(0);
7116 SDValue V2 = Op.getOperand(1);
7117 unsigned NumElems = ResVT.getVectorNumElements();
7118 if(ResVT.is256BitVector())
7119 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7121 if (Op.getNumOperands() == 4) {
7122 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7123 ResVT.getVectorNumElements()/2);
7124 SDValue V3 = Op.getOperand(2);
7125 SDValue V4 = Op.getOperand(3);
7126 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7127 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7128 }
7129 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7130 }
7132 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7133 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7134 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7135 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7136 Op.getNumOperands() == 4)));
7138 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7139 // from two other 128-bit ones.
7141 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7142 return LowerAVXCONCAT_VECTORS(Op, DAG);
7143 }
7146 //===----------------------------------------------------------------------===//
7147 // Vector shuffle lowering
7148 //
7149 // This is an experimental code path for lowering vector shuffles on x86. It is
7150 // designed to handle arbitrary vector shuffles and blends, gracefully
7151 // degrading performance as necessary. It works hard to recognize idiomatic
7152 // shuffles and lower them to optimal instruction patterns without leaving
7153 // a framework that allows reasonably efficient handling of all vector shuffle
7154 // patterns.
7155 //===----------------------------------------------------------------------===//
7157 /// \brief Tiny helper function to identify a no-op mask.
7158 ///
7159 /// This is a somewhat boring predicate function. It checks whether the mask
7160 /// array input, which is assumed to be a single-input shuffle mask of the kind
7161 /// used by the X86 shuffle instructions (not a fully general
7162 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7163 /// in-place shuffle are 'no-op's.
7164 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7165 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7166 if (Mask[i] != -1 && Mask[i] != i)
7167 return false;
7168 return true;
7169 }
7171 /// \brief Helper function to classify a mask as a single-input mask.
7172 ///
7173 /// This isn't a generic single-input test because in the vector shuffle
7174 /// lowering we canonicalize single inputs to be the first input operand. This
7175 /// means we can more quickly test for a single input by only checking whether
7176 /// an input from the second operand exists. We also assume that the size of
7177 /// mask corresponds to the size of the input vectors which isn't true in the
7178 /// fully general case.
7179 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7180 for (int M : Mask)
7181 if (M >= (int)Mask.size())
7182 return false;
7183 return true;
7184 }
7186 /// \brief Test whether there are elements crossing 128-bit lanes in this
7187 /// shuffle mask.
7188 ///
7189 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
7190 /// and we routinely test for these.
7191 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
7192 int LaneSize = 128 / VT.getScalarSizeInBits();
7193 int Size = Mask.size();
7194 for (int i = 0; i < Size; ++i)
7195 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
7196 return true;
7197 return false;
7198 }
7200 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
7201 ///
7202 /// This checks a shuffle mask to see if it is performing the same
7203 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
7204 /// that it is also not lane-crossing. It may however involve a blend from the
7205 /// same lane of a second vector.
7206 ///
7207 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
7208 /// non-trivial to compute in the face of undef lanes. The representation is
7209 /// *not* suitable for use with existing 128-bit shuffles as it will contain
7210 /// entries from both V1 and V2 inputs to the wider mask.
7211 static bool
7212 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
7213 SmallVectorImpl<int> &RepeatedMask) {
7214 int LaneSize = 128 / VT.getScalarSizeInBits();
7215 RepeatedMask.resize(LaneSize, -1);
7216 int Size = Mask.size();
7217 for (int i = 0; i < Size; ++i) {
7218 if (Mask[i] < 0)
7219 continue;
7220 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
7221 // This entry crosses lanes, so there is no way to model this shuffle.
7222 return false;
7224 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
7225 if (RepeatedMask[i % LaneSize] == -1)
7226 // This is the first non-undef entry in this slot of a 128-bit lane.
7227 RepeatedMask[i % LaneSize] =
7228 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
7229 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
7230 // Found a mismatch with the repeated mask.
7231 return false;
7232 }
7233 return true;
7234 }
7236 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7237 // 2013 will allow us to use it as a non-type template parameter.
7238 namespace {
7240 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7241 ///
7242 /// See its documentation for details.
7243 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7244 if (Mask.size() != Args.size())
7245 return false;
7246 for (int i = 0, e = Mask.size(); i < e; ++i) {
7247 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7248 if (Mask[i] != -1 && Mask[i] != *Args[i])
7249 return false;
7250 }
7251 return true;
7252 }
7254 } // namespace
7256 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7257 /// arguments.
7258 ///
7259 /// This is a fast way to test a shuffle mask against a fixed pattern:
7260 ///
7261 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7262 ///
7263 /// It returns true if the mask is exactly as wide as the argument list, and
7264 /// each element of the mask is either -1 (signifying undef) or the value given
7265 /// in the argument.
7266 static const VariadicFunction1<
7267 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7269 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7270 ///
7271 /// This helper function produces an 8-bit shuffle immediate corresponding to
7272 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7273 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7274 /// example.
7275 ///
7276 /// NB: We rely heavily on "undef" masks preserving the input lane.
7277 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7278 SelectionDAG &DAG) {
7279 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7280 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7281 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7282 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7283 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7285 unsigned Imm = 0;
7286 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7287 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7288 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7289 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7290 return DAG.getConstant(Imm, MVT::i8);
7291 }
7293 /// \brief Try to emit a blend instruction for a shuffle.
7294 ///
7295 /// This doesn't do any checks for the availability of instructions for blending
7296 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7297 /// be matched in the backend with the type given. What it does check for is
7298 /// that the shuffle mask is in fact a blend.
7299 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7300 SDValue V2, ArrayRef<int> Mask,
7301 const X86Subtarget *Subtarget,
7302 SelectionDAG &DAG) {
7304 unsigned BlendMask = 0;
7305 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7306 if (Mask[i] >= Size) {
7307 if (Mask[i] != i + Size)
7308 return SDValue(); // Shuffled V2 input!
7309 BlendMask |= 1u << i;
7310 continue;
7311 }
7312 if (Mask[i] >= 0 && Mask[i] != i)
7313 return SDValue(); // Shuffled V1 input!
7314 }
7315 switch (VT.SimpleTy) {
7316 case MVT::v2f64:
7317 case MVT::v4f32:
7318 case MVT::v4f64:
7319 case MVT::v8f32:
7320 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7321 DAG.getConstant(BlendMask, MVT::i8));
7323 case MVT::v4i64:
7324 case MVT::v8i32:
7325 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7326 // FALLTHROUGH
7327 case MVT::v2i64:
7328 case MVT::v4i32:
7329 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
7330 // that instruction.
7331 if (Subtarget->hasAVX2()) {
7332 // Scale the blend by the number of 32-bit dwords per element.
7333 int Scale = VT.getScalarSizeInBits() / 32;
7334 BlendMask = 0;
7335 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7336 if (Mask[i] >= Size)
7337 for (int j = 0; j < Scale; ++j)
7338 BlendMask |= 1u << (i * Scale + j);
7340 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
7341 V1 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V1);
7342 V2 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V2);
7343 return DAG.getNode(ISD::BITCAST, DL, VT,
7344 DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
7345 DAG.getConstant(BlendMask, MVT::i8)));
7346 }
7347 // FALLTHROUGH
7348 case MVT::v8i16: {
7349 // For integer shuffles we need to expand the mask and cast the inputs to
7350 // v8i16s prior to blending.
7351 int Scale = 8 / VT.getVectorNumElements();
7352 BlendMask = 0;
7353 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7354 if (Mask[i] >= Size)
7355 for (int j = 0; j < Scale; ++j)
7356 BlendMask |= 1u << (i * Scale + j);
7358 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7359 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7360 return DAG.getNode(ISD::BITCAST, DL, VT,
7361 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7362 DAG.getConstant(BlendMask, MVT::i8)));
7363 }
7365 case MVT::v16i16: {
7366 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7367 SmallVector<int, 8> RepeatedMask;
7368 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
7369 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
7370 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
7371 BlendMask = 0;
7372 for (int i = 0; i < 8; ++i)
7373 if (RepeatedMask[i] >= 16)
7374 BlendMask |= 1u << i;
7375 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
7376 DAG.getConstant(BlendMask, MVT::i8));
7377 }
7378 }
7379 // FALLTHROUGH
7380 case MVT::v32i8: {
7381 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7382 // Scale the blend by the number of bytes per element.
7383 int Scale = VT.getScalarSizeInBits() / 8;
7384 assert(Mask.size() * Scale == 32 && "Not a 256-bit vector!");
7386 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
7387 // mix of LLVM's code generator and the x86 backend. We tell the code
7388 // generator that boolean values in the elements of an x86 vector register
7389 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
7390 // mapping a select to operand #1, and 'false' mapping to operand #2. The
7391 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
7392 // of the element (the remaining are ignored) and 0 in that high bit would
7393 // mean operand #1 while 1 in the high bit would mean operand #2. So while
7394 // the LLVM model for boolean values in vector elements gets the relevant
7395 // bit set, it is set backwards and over constrained relative to x86's
7396 // actual model.
7397 SDValue VSELECTMask[32];
7398 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7399 for (int j = 0; j < Scale; ++j)
7400 VSELECTMask[Scale * i + j] =
7401 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7402 : DAG.getConstant(Mask[i] < Size ? -1 : 0, MVT::i8);
7404 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1);
7405 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V2);
7406 return DAG.getNode(
7407 ISD::BITCAST, DL, VT,
7408 DAG.getNode(ISD::VSELECT, DL, MVT::v32i8,
7409 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, VSELECTMask),
7410 V1, V2));
7411 }
7413 default:
7414 llvm_unreachable("Not a supported integer vector type!");
7415 }
7416 }
7418 /// \brief Generic routine to lower a shuffle and blend as a decomposed set of
7419 /// unblended shuffles followed by an unshuffled blend.
7420 ///
7421 /// This matches the extremely common pattern for handling combined
7422 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7423 /// operations.
7424 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7425 SDValue V1,
7426 SDValue V2,
7427 ArrayRef<int> Mask,
7428 SelectionDAG &DAG) {
7429 // Shuffle the input elements into the desired positions in V1 and V2 and
7430 // blend them together.
7431 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7432 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7433 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7434 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7435 if (Mask[i] >= 0 && Mask[i] < Size) {
7436 V1Mask[i] = Mask[i];
7437 BlendMask[i] = i;
7438 } else if (Mask[i] >= Size) {
7439 V2Mask[i] = Mask[i] - Size;
7440 BlendMask[i] = i + Size;
7441 }
7443 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7444 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7445 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7446 }
7448 /// \brief Try to lower a vector shuffle as a byte rotation.
7449 ///
7450 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7451 /// byte-rotation of a the concatentation of two vectors. This routine will
7452 /// try to generically lower a vector shuffle through such an instruction. It
7453 /// does not check for the availability of PALIGNR-based lowerings, only the
7454 /// applicability of this strategy to the given mask. This matches shuffle
7455 /// vectors that look like:
7456 ///
7457 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7458 ///
7459 /// Essentially it concatenates V1 and V2, shifts right by some number of
7460 /// elements, and takes the low elements as the result. Note that while this is
7461 /// specified as a *right shift* because x86 is little-endian, it is a *left
7462 /// rotate* of the vector lanes.
7463 ///
7464 /// Note that this only handles 128-bit vector widths currently.
7465 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7466 SDValue V2,
7467 ArrayRef<int> Mask,
7468 SelectionDAG &DAG) {
7469 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7471 // We need to detect various ways of spelling a rotation:
7472 // [11, 12, 13, 14, 15, 0, 1, 2]
7473 // [-1, 12, 13, 14, -1, -1, 1, -1]
7474 // [-1, -1, -1, -1, -1, -1, 1, 2]
7475 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7476 // [-1, 4, 5, 6, -1, -1, 9, -1]
7477 // [-1, 4, 5, 6, -1, -1, -1, -1]
7478 int Rotation = 0;
7479 SDValue Lo, Hi;
7480 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7481 if (Mask[i] == -1)
7482 continue;
7483 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7485 // Based on the mod-Size value of this mask element determine where
7486 // a rotated vector would have started.
7487 int StartIdx = i - (Mask[i] % Size);
7488 if (StartIdx == 0)
7489 // The identity rotation isn't interesting, stop.
7490 return SDValue();
7492 // If we found the tail of a vector the rotation must be the missing
7493 // front. If we found the head of a vector, it must be how much of the head.
7494 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7496 if (Rotation == 0)
7497 Rotation = CandidateRotation;
7498 else if (Rotation != CandidateRotation)
7499 // The rotations don't match, so we can't match this mask.
7500 return SDValue();
7502 // Compute which value this mask is pointing at.
7503 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7505 // Compute which of the two target values this index should be assigned to.
7506 // This reflects whether the high elements are remaining or the low elements
7507 // are remaining.
7508 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7510 // Either set up this value if we've not encountered it before, or check
7511 // that it remains consistent.
7512 if (!TargetV)
7513 TargetV = MaskV;
7514 else if (TargetV != MaskV)
7515 // This may be a rotation, but it pulls from the inputs in some
7516 // unsupported interleaving.
7517 return SDValue();
7518 }
7520 // Check that we successfully analyzed the mask, and normalize the results.
7521 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7522 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7523 if (!Lo)
7524 Lo = Hi;
7525 else if (!Hi)
7526 Hi = Lo;
7528 // Cast the inputs to v16i8 to match PALIGNR.
7529 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7530 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7532 assert(VT.getSizeInBits() == 128 &&
7533 "Rotate-based lowering only supports 128-bit lowering!");
7534 assert(Mask.size() <= 16 &&
7535 "Can shuffle at most 16 bytes in a 128-bit vector!");
7536 // The actual rotate instruction rotates bytes, so we need to scale the
7537 // rotation based on how many bytes are in the vector.
7538 int Scale = 16 / Mask.size();
7540 return DAG.getNode(ISD::BITCAST, DL, VT,
7541 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7542 DAG.getConstant(Rotation * Scale, MVT::i8)));
7543 }
7545 /// \brief Compute whether each element of a shuffle is zeroable.
7546 ///
7547 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7548 /// Either it is an undef element in the shuffle mask, the element of the input
7549 /// referenced is undef, or the element of the input referenced is known to be
7550 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7551 /// as many lanes with this technique as possible to simplify the remaining
7552 /// shuffle.
7553 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7554 SDValue V1, SDValue V2) {
7555 SmallBitVector Zeroable(Mask.size(), false);
7557 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7558 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7560 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7561 int M = Mask[i];
7562 // Handle the easy cases.
7563 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7564 Zeroable[i] = true;
7565 continue;
7566 }
7568 // If this is an index into a build_vector node, dig out the input value and
7569 // use it.
7570 SDValue V = M < Size ? V1 : V2;
7571 if (V.getOpcode() != ISD::BUILD_VECTOR)
7572 continue;
7574 SDValue Input = V.getOperand(M % Size);
7575 // The UNDEF opcode check really should be dead code here, but not quite
7576 // worth asserting on (it isn't invalid, just unexpected).
7577 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7578 Zeroable[i] = true;
7579 }
7581 return Zeroable;
7582 }
7584 /// \brief Lower a vector shuffle as a zero or any extension.
7585 ///
7586 /// Given a specific number of elements, element bit width, and extension
7587 /// stride, produce either a zero or any extension based on the available
7588 /// features of the subtarget.
7589 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7590 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7591 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7592 assert(Scale > 1 && "Need a scale to extend.");
7593 int EltBits = VT.getSizeInBits() / NumElements;
7594 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7595 "Only 8, 16, and 32 bit elements can be extended.");
7596 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7598 // Found a valid zext mask! Try various lowering strategies based on the
7599 // input type and available ISA extensions.
7600 if (Subtarget->hasSSE41()) {
7601 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7602 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7603 NumElements / Scale);
7604 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7605 return DAG.getNode(ISD::BITCAST, DL, VT,
7606 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7607 }
7609 // For any extends we can cheat for larger element sizes and use shuffle
7610 // instructions that can fold with a load and/or copy.
7611 if (AnyExt && EltBits == 32) {
7612 int PSHUFDMask[4] = {0, -1, 1, -1};
7613 return DAG.getNode(
7614 ISD::BITCAST, DL, VT,
7615 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7616 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7617 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7618 }
7619 if (AnyExt && EltBits == 16 && Scale > 2) {
7620 int PSHUFDMask[4] = {0, -1, 0, -1};
7621 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7622 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7623 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7624 int PSHUFHWMask[4] = {1, -1, -1, -1};
7625 return DAG.getNode(
7626 ISD::BITCAST, DL, VT,
7627 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7628 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7629 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7630 }
7632 // If this would require more than 2 unpack instructions to expand, use
7633 // pshufb when available. We can only use more than 2 unpack instructions
7634 // when zero extending i8 elements which also makes it easier to use pshufb.
7635 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7636 assert(NumElements == 16 && "Unexpected byte vector width!");
7637 SDValue PSHUFBMask[16];
7638 for (int i = 0; i < 16; ++i)
7639 PSHUFBMask[i] =
7640 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7641 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7642 return DAG.getNode(ISD::BITCAST, DL, VT,
7643 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7644 DAG.getNode(ISD::BUILD_VECTOR, DL,
7645 MVT::v16i8, PSHUFBMask)));
7646 }
7648 // Otherwise emit a sequence of unpacks.
7649 do {
7650 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7651 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7652 : getZeroVector(InputVT, Subtarget, DAG, DL);
7653 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7654 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7655 Scale /= 2;
7656 EltBits *= 2;
7657 NumElements /= 2;
7658 } while (Scale > 1);
7659 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7660 }
7662 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7663 ///
7664 /// This routine will try to do everything in its power to cleverly lower
7665 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7666 /// check for the profitability of this lowering, it tries to aggressively
7667 /// match this pattern. It will use all of the micro-architectural details it
7668 /// can to emit an efficient lowering. It handles both blends with all-zero
7669 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7670 /// masking out later).
7671 ///
7672 /// The reason we have dedicated lowering for zext-style shuffles is that they
7673 /// are both incredibly common and often quite performance sensitive.
7674 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7675 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7676 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7677 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7679 int Bits = VT.getSizeInBits();
7680 int NumElements = Mask.size();
7682 // Define a helper function to check a particular ext-scale and lower to it if
7683 // valid.
7684 auto Lower = [&](int Scale) -> SDValue {
7685 SDValue InputV;
7686 bool AnyExt = true;
7687 for (int i = 0; i < NumElements; ++i) {
7688 if (Mask[i] == -1)
7689 continue; // Valid anywhere but doesn't tell us anything.
7690 if (i % Scale != 0) {
7691 // Each of the extend elements needs to be zeroable.
7692 if (!Zeroable[i])
7693 return SDValue();
7695 // We no lorger are in the anyext case.
7696 AnyExt = false;
7697 continue;
7698 }
7700 // Each of the base elements needs to be consecutive indices into the
7701 // same input vector.
7702 SDValue V = Mask[i] < NumElements ? V1 : V2;
7703 if (!InputV)
7704 InputV = V;
7705 else if (InputV != V)
7706 return SDValue(); // Flip-flopping inputs.
7708 if (Mask[i] % NumElements != i / Scale)
7709 return SDValue(); // Non-consecutive strided elemenst.
7710 }
7712 // If we fail to find an input, we have a zero-shuffle which should always
7713 // have already been handled.
7714 // FIXME: Maybe handle this here in case during blending we end up with one?
7715 if (!InputV)
7716 return SDValue();
7718 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7719 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7720 };
7722 // The widest scale possible for extending is to a 64-bit integer.
7723 assert(Bits % 64 == 0 &&
7724 "The number of bits in a vector must be divisible by 64 on x86!");
7725 int NumExtElements = Bits / 64;
7727 // Each iteration, try extending the elements half as much, but into twice as
7728 // many elements.
7729 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7730 assert(NumElements % NumExtElements == 0 &&
7731 "The input vector size must be divisble by the extended size.");
7732 if (SDValue V = Lower(NumElements / NumExtElements))
7733 return V;
7734 }
7736 // No viable ext lowering found.
7737 return SDValue();
7738 }
7740 /// \brief Try to lower insertion of a single element into a zero vector.
7741 ///
7742 /// This is a common pattern that we have especially efficient patterns to lower
7743 /// across all subtarget feature sets.
7744 static SDValue lowerVectorShuffleAsElementInsertion(
7745 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7746 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7747 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7749 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7750 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7751 Mask.begin();
7752 if (Mask.size() == 2) {
7753 if (!Zeroable[V2Index ^ 1]) {
7754 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7755 // with 2 to flip from {2,3} to {0,1} and vice versa.
7756 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7757 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7758 if (Zeroable[V2Index])
7759 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7760 Subtarget, DAG);
7761 else
7762 return SDValue();
7763 }
7764 } else {
7765 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7766 if (i != V2Index && !Zeroable[i])
7767 return SDValue(); // Not inserting into a zero vector.
7768 }
7770 // Step over any bitcasts on either input so we can scan the actual
7771 // BUILD_VECTOR nodes.
7772 while (V1.getOpcode() == ISD::BITCAST)
7773 V1 = V1.getOperand(0);
7774 while (V2.getOpcode() == ISD::BITCAST)
7775 V2 = V2.getOperand(0);
7777 // Check for a single input from a SCALAR_TO_VECTOR node.
7778 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7779 // all the smarts here sunk into that routine. However, the current
7780 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7781 // vector shuffle lowering is dead.
7782 if (!((V2.getOpcode() == ISD::SCALAR_TO_VECTOR &&
7783 Mask[V2Index] == (int)Mask.size()) ||
7784 V2.getOpcode() == ISD::BUILD_VECTOR))
7785 return SDValue();
7787 SDValue V2S = V2.getOperand(Mask[V2Index] - Mask.size());
7789 // First, we need to zext the scalar if it is smaller than an i32.
7790 MVT ExtVT = VT;
7791 MVT EltVT = VT.getVectorElementType();
7792 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7793 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7794 // Zero-extend directly to i32.
7795 ExtVT = MVT::v4i32;
7796 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7797 }
7799 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7800 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7801 if (ExtVT != VT)
7802 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7804 if (V2Index != 0) {
7805 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7806 // the desired position. Otherwise it is more efficient to do a vector
7807 // shift left. We know that we can do a vector shift left because all
7808 // the inputs are zero.
7809 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7810 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7811 V2Shuffle[V2Index] = 0;
7812 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7813 } else {
7814 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7815 V2 = DAG.getNode(
7816 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7817 DAG.getConstant(
7818 V2Index * EltVT.getSizeInBits(),
7819 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7820 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7821 }
7822 }
7823 return V2;
7824 }
7826 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7827 ///
7828 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7829 /// support for floating point shuffles but not integer shuffles. These
7830 /// instructions will incur a domain crossing penalty on some chips though so
7831 /// it is better to avoid lowering through this for integer vectors where
7832 /// possible.
7833 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7834 const X86Subtarget *Subtarget,
7835 SelectionDAG &DAG) {
7836 SDLoc DL(Op);
7837 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7838 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7839 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7840 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7841 ArrayRef<int> Mask = SVOp->getMask();
7842 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7844 if (isSingleInputShuffleMask(Mask)) {
7845 // Straight shuffle of a single input vector. Simulate this by using the
7846 // single input as both of the "inputs" to this instruction..
7847 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7849 if (Subtarget->hasAVX()) {
7850 // If we have AVX, we can use VPERMILPS which will allow folding a load
7851 // into the shuffle.
7852 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
7853 DAG.getConstant(SHUFPDMask, MVT::i8));
7854 }
7856 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7857 DAG.getConstant(SHUFPDMask, MVT::i8));
7858 }
7859 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7860 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7862 // Use dedicated unpack instructions for masks that match their pattern.
7863 if (isShuffleEquivalent(Mask, 0, 2))
7864 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7865 if (isShuffleEquivalent(Mask, 1, 3))
7866 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7868 // If we have a single input, insert that into V1 if we can do so cheaply.
7869 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7870 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7871 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7872 return Insertion;
7874 if (Subtarget->hasSSE41())
7875 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
7876 Subtarget, DAG))
7877 return Blend;
7879 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7880 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7881 DAG.getConstant(SHUFPDMask, MVT::i8));
7882 }
7884 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7885 ///
7886 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7887 /// the integer unit to minimize domain crossing penalties. However, for blends
7888 /// it falls back to the floating point shuffle operation with appropriate bit
7889 /// casting.
7890 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7891 const X86Subtarget *Subtarget,
7892 SelectionDAG &DAG) {
7893 SDLoc DL(Op);
7894 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7895 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7896 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7897 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7898 ArrayRef<int> Mask = SVOp->getMask();
7899 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7901 if (isSingleInputShuffleMask(Mask)) {
7902 // Straight shuffle of a single input vector. For everything from SSE2
7903 // onward this has a single fast instruction with no scary immediates.
7904 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7905 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7906 int WidenedMask[4] = {
7907 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7908 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7909 return DAG.getNode(
7910 ISD::BITCAST, DL, MVT::v2i64,
7911 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7912 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7913 }
7915 // Use dedicated unpack instructions for masks that match their pattern.
7916 if (isShuffleEquivalent(Mask, 0, 2))
7917 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7918 if (isShuffleEquivalent(Mask, 1, 3))
7919 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7921 // If we have a single input from V2 insert that into V1 if we can do so
7922 // cheaply.
7923 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7924 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7925 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7926 return Insertion;
7928 if (Subtarget->hasSSE41())
7929 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
7930 Subtarget, DAG))
7931 return Blend;
7933 // Try to use rotation instructions if available.
7934 if (Subtarget->hasSSSE3())
7935 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7936 DL, MVT::v2i64, V1, V2, Mask, DAG))
7937 return Rotate;
7939 // We implement this with SHUFPD which is pretty lame because it will likely
7940 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7941 // However, all the alternatives are still more cycles and newer chips don't
7942 // have this problem. It would be really nice if x86 had better shuffles here.
7943 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7944 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7945 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7946 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7947 }
7949 /// \brief Lower a vector shuffle using the SHUFPS instruction.
7950 ///
7951 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
7952 /// It makes no assumptions about whether this is the *best* lowering, it simply
7953 /// uses it.
7954 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
7955 ArrayRef<int> Mask, SDValue V1,
7956 SDValue V2, SelectionDAG &DAG) {
7957 SDValue LowV = V1, HighV = V2;
7958 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7960 int NumV2Elements =
7961 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7963 if (NumV2Elements == 1) {
7964 int V2Index =
7965 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7966 Mask.begin();
7968 // Compute the index adjacent to V2Index and in the same half by toggling
7969 // the low bit.
7970 int V2AdjIndex = V2Index ^ 1;
7972 if (Mask[V2AdjIndex] == -1) {
7973 // Handles all the cases where we have a single V2 element and an undef.
7974 // This will only ever happen in the high lanes because we commute the
7975 // vector otherwise.
7976 if (V2Index < 2)
7977 std::swap(LowV, HighV);
7978 NewMask[V2Index] -= 4;
7979 } else {
7980 // Handle the case where the V2 element ends up adjacent to a V1 element.
7981 // To make this work, blend them together as the first step.
7982 int V1Index = V2AdjIndex;
7983 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7984 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
7985 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7987 // Now proceed to reconstruct the final blend as we have the necessary
7988 // high or low half formed.
7989 if (V2Index < 2) {
7990 LowV = V2;
7991 HighV = V1;
7992 } else {
7993 HighV = V2;
7994 }
7995 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7996 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7997 }
7998 } else if (NumV2Elements == 2) {
7999 if (Mask[0] < 4 && Mask[1] < 4) {
8000 // Handle the easy case where we have V1 in the low lanes and V2 in the
8001 // high lanes.
8002 NewMask[2] -= 4;
8003 NewMask[3] -= 4;
8004 } else if (Mask[2] < 4 && Mask[3] < 4) {
8005 // We also handle the reversed case because this utility may get called
8006 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8007 // arrange things in the right direction.
8008 NewMask[0] -= 4;
8009 NewMask[1] -= 4;
8010 HighV = V1;
8011 LowV = V2;
8012 } else {
8013 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8014 // trying to place elements directly, just blend them and set up the final
8015 // shuffle to place them.
8017 // The first two blend mask elements are for V1, the second two are for
8018 // V2.
8019 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8020 Mask[2] < 4 ? Mask[2] : Mask[3],
8021 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8022 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8023 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8024 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8026 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8027 // a blend.
8028 LowV = HighV = V1;
8029 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8030 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8031 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8032 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8033 }
8034 }
8035 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8036 getV4X86ShuffleImm8ForMask(NewMask, DAG));
8037 }
8039 /// \brief Lower 4-lane 32-bit floating point shuffles.
8040 ///
8041 /// Uses instructions exclusively from the floating point unit to minimize
8042 /// domain crossing penalties, as these are sufficient to implement all v4f32
8043 /// shuffles.
8044 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8045 const X86Subtarget *Subtarget,
8046 SelectionDAG &DAG) {
8047 SDLoc DL(Op);
8048 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8049 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8050 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8051 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8052 ArrayRef<int> Mask = SVOp->getMask();
8053 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8055 int NumV2Elements =
8056 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8058 if (NumV2Elements == 0) {
8059 if (Subtarget->hasAVX()) {
8060 // If we have AVX, we can use VPERMILPS which will allow folding a load
8061 // into the shuffle.
8062 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8063 getV4X86ShuffleImm8ForMask(Mask, DAG));
8064 }
8066 // Otherwise, use a straight shuffle of a single input vector. We pass the
8067 // input vector to both operands to simulate this with a SHUFPS.
8068 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8069 getV4X86ShuffleImm8ForMask(Mask, DAG));
8070 }
8072 // Use dedicated unpack instructions for masks that match their pattern.
8073 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8074 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
8075 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8076 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
8078 // There are special ways we can lower some single-element blends. However, we
8079 // have custom ways we can lower more complex single-element blends below that
8080 // we defer to if both this and BLENDPS fail to match, so restrict this to
8081 // when the V2 input is targeting element 0 of the mask -- that is the fast
8082 // case here.
8083 if (NumV2Elements == 1 && Mask[0] >= 4)
8084 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
8085 Mask, Subtarget, DAG))
8086 return V;
8088 if (Subtarget->hasSSE41())
8089 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8090 Subtarget, DAG))
8091 return Blend;
8093 // Check for whether we can use INSERTPS to perform the blend. We only use
8094 // INSERTPS when the V1 elements are already in the correct locations
8095 // because otherwise we can just always use two SHUFPS instructions which
8096 // are much smaller to encode than a SHUFPS and an INSERTPS.
8097 if (NumV2Elements == 1 && Subtarget->hasSSE41()) {
8098 int V2Index =
8099 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8100 Mask.begin();
8102 // When using INSERTPS we can zero any lane of the destination. Collect
8103 // the zero inputs into a mask and drop them from the lanes of V1 which
8104 // actually need to be present as inputs to the INSERTPS.
8105 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8107 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
8108 bool InsertNeedsShuffle = false;
8109 unsigned ZMask = 0;
8110 for (int i = 0; i < 4; ++i)
8111 if (i != V2Index) {
8112 if (Zeroable[i]) {
8113 ZMask |= 1 << i;
8114 } else if (Mask[i] != i) {
8115 InsertNeedsShuffle = true;
8116 break;
8117 }
8118 }
8120 // We don't want to use INSERTPS or other insertion techniques if it will
8121 // require shuffling anyways.
8122 if (!InsertNeedsShuffle) {
8123 // If all of V1 is zeroable, replace it with undef.
8124 if ((ZMask | 1 << V2Index) == 0xF)
8125 V1 = DAG.getUNDEF(MVT::v4f32);
8127 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
8128 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8130 // Insert the V2 element into the desired position.
8131 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8132 DAG.getConstant(InsertPSMask, MVT::i8));
8133 }
8134 }
8136 // Otherwise fall back to a SHUFPS lowering strategy.
8137 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8138 }
8140 /// \brief Lower 4-lane i32 vector shuffles.
8141 ///
8142 /// We try to handle these with integer-domain shuffles where we can, but for
8143 /// blends we use the floating point domain blend instructions.
8144 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8145 const X86Subtarget *Subtarget,
8146 SelectionDAG &DAG) {
8147 SDLoc DL(Op);
8148 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8149 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8150 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8151 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8152 ArrayRef<int> Mask = SVOp->getMask();
8153 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8155 int NumV2Elements =
8156 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8158 if (NumV2Elements == 0) {
8159 // Straight shuffle of a single input vector. For everything from SSE2
8160 // onward this has a single fast instruction with no scary immediates.
8161 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8162 // but we aren't actually going to use the UNPCK instruction because doing
8163 // so prevents folding a load into this instruction or making a copy.
8164 const int UnpackLoMask[] = {0, 0, 1, 1};
8165 const int UnpackHiMask[] = {2, 2, 3, 3};
8166 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
8167 Mask = UnpackLoMask;
8168 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
8169 Mask = UnpackHiMask;
8171 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8172 getV4X86ShuffleImm8ForMask(Mask, DAG));
8173 }
8175 // Whenever we can lower this as a zext, that instruction is strictly faster
8176 // than any alternative.
8177 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8178 Mask, Subtarget, DAG))
8179 return ZExt;
8181 // Use dedicated unpack instructions for masks that match their pattern.
8182 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8183 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
8184 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8185 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
8187 // There are special ways we can lower some single-element blends.
8188 if (NumV2Elements == 1)
8189 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
8190 Mask, Subtarget, DAG))
8191 return V;
8193 if (Subtarget->hasSSE41())
8194 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8195 Subtarget, DAG))
8196 return Blend;
8198 // Try to use rotation instructions if available.
8199 if (Subtarget->hasSSSE3())
8200 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8201 DL, MVT::v4i32, V1, V2, Mask, DAG))
8202 return Rotate;
8204 // We implement this with SHUFPS because it can blend from two vectors.
8205 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8206 // up the inputs, bypassing domain shift penalties that we would encur if we
8207 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8208 // relevant.
8209 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8210 DAG.getVectorShuffle(
8211 MVT::v4f32, DL,
8212 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8213 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8214 }
8216 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8217 /// shuffle lowering, and the most complex part.
8218 ///
8219 /// The lowering strategy is to try to form pairs of input lanes which are
8220 /// targeted at the same half of the final vector, and then use a dword shuffle
8221 /// to place them onto the right half, and finally unpack the paired lanes into
8222 /// their final position.
8223 ///
8224 /// The exact breakdown of how to form these dword pairs and align them on the
8225 /// correct sides is really tricky. See the comments within the function for
8226 /// more of the details.
8227 static SDValue lowerV8I16SingleInputVectorShuffle(
8228 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8229 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8230 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8231 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8232 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8234 SmallVector<int, 4> LoInputs;
8235 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8236 [](int M) { return M >= 0; });
8237 std::sort(LoInputs.begin(), LoInputs.end());
8238 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8239 SmallVector<int, 4> HiInputs;
8240 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8241 [](int M) { return M >= 0; });
8242 std::sort(HiInputs.begin(), HiInputs.end());
8243 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8244 int NumLToL =
8245 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8246 int NumHToL = LoInputs.size() - NumLToL;
8247 int NumLToH =
8248 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8249 int NumHToH = HiInputs.size() - NumLToH;
8250 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8251 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8252 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8253 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8255 // Use dedicated unpack instructions for masks that match their pattern.
8256 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8257 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8258 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8259 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8261 // Try to use rotation instructions if available.
8262 if (Subtarget->hasSSSE3())
8263 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8264 DL, MVT::v8i16, V, V, Mask, DAG))
8265 return Rotate;
8267 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8268 // such inputs we can swap two of the dwords across the half mark and end up
8269 // with <=2 inputs to each half in each half. Once there, we can fall through
8270 // to the generic code below. For example:
8271 //
8272 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8273 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8274 //
8275 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8276 // and an existing 2-into-2 on the other half. In this case we may have to
8277 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8278 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8279 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8280 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8281 // half than the one we target for fixing) will be fixed when we re-enter this
8282 // path. We will also combine away any sequence of PSHUFD instructions that
8283 // result into a single instruction. Here is an example of the tricky case:
8284 //
8285 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8286 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8287 //
8288 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8289 //
8290 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8291 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8292 //
8293 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8294 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8295 //
8296 // The result is fine to be handled by the generic logic.
8297 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8298 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8299 int AOffset, int BOffset) {
8300 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8301 "Must call this with A having 3 or 1 inputs from the A half.");
8302 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8303 "Must call this with B having 1 or 3 inputs from the B half.");
8304 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8305 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8307 // Compute the index of dword with only one word among the three inputs in
8308 // a half by taking the sum of the half with three inputs and subtracting
8309 // the sum of the actual three inputs. The difference is the remaining
8310 // slot.
8311 int ADWord, BDWord;
8312 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8313 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8314 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8315 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8316 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8317 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8318 int TripleNonInputIdx =
8319 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8320 TripleDWord = TripleNonInputIdx / 2;
8322 // We use xor with one to compute the adjacent DWord to whichever one the
8323 // OneInput is in.
8324 OneInputDWord = (OneInput / 2) ^ 1;
8326 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8327 // and BToA inputs. If there is also such a problem with the BToB and AToB
8328 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8329 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8330 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8331 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8332 // Compute how many inputs will be flipped by swapping these DWords. We
8333 // need
8334 // to balance this to ensure we don't form a 3-1 shuffle in the other
8335 // half.
8336 int NumFlippedAToBInputs =
8337 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8338 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8339 int NumFlippedBToBInputs =
8340 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8341 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8342 if ((NumFlippedAToBInputs == 1 &&
8343 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8344 (NumFlippedBToBInputs == 1 &&
8345 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8346 // We choose whether to fix the A half or B half based on whether that
8347 // half has zero flipped inputs. At zero, we may not be able to fix it
8348 // with that half. We also bias towards fixing the B half because that
8349 // will more commonly be the high half, and we have to bias one way.
8350 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8351 ArrayRef<int> Inputs) {
8352 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8353 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8354 PinnedIdx ^ 1) != Inputs.end();
8355 // Determine whether the free index is in the flipped dword or the
8356 // unflipped dword based on where the pinned index is. We use this bit
8357 // in an xor to conditionally select the adjacent dword.
8358 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8359 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8360 FixFreeIdx) != Inputs.end();
8361 if (IsFixIdxInput == IsFixFreeIdxInput)
8362 FixFreeIdx += 1;
8363 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8364 FixFreeIdx) != Inputs.end();
8365 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8366 "We need to be changing the number of flipped inputs!");
8367 int PSHUFHalfMask[] = {0, 1, 2, 3};
8368 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8369 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8370 MVT::v8i16, V,
8371 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8373 for (int &M : Mask)
8374 if (M != -1 && M == FixIdx)
8375 M = FixFreeIdx;
8376 else if (M != -1 && M == FixFreeIdx)
8377 M = FixIdx;
8378 };
8379 if (NumFlippedBToBInputs != 0) {
8380 int BPinnedIdx =
8381 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8382 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8383 } else {
8384 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8385 int APinnedIdx =
8386 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8387 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8388 }
8389 }
8390 }
8392 int PSHUFDMask[] = {0, 1, 2, 3};
8393 PSHUFDMask[ADWord] = BDWord;
8394 PSHUFDMask[BDWord] = ADWord;
8395 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8396 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8397 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8398 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8400 // Adjust the mask to match the new locations of A and B.
8401 for (int &M : Mask)
8402 if (M != -1 && M/2 == ADWord)
8403 M = 2 * BDWord + M % 2;
8404 else if (M != -1 && M/2 == BDWord)
8405 M = 2 * ADWord + M % 2;
8407 // Recurse back into this routine to re-compute state now that this isn't
8408 // a 3 and 1 problem.
8409 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8410 Mask);
8411 };
8412 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8413 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8414 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8415 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8417 // At this point there are at most two inputs to the low and high halves from
8418 // each half. That means the inputs can always be grouped into dwords and
8419 // those dwords can then be moved to the correct half with a dword shuffle.
8420 // We use at most one low and one high word shuffle to collect these paired
8421 // inputs into dwords, and finally a dword shuffle to place them.
8422 int PSHUFLMask[4] = {-1, -1, -1, -1};
8423 int PSHUFHMask[4] = {-1, -1, -1, -1};
8424 int PSHUFDMask[4] = {-1, -1, -1, -1};
8426 // First fix the masks for all the inputs that are staying in their
8427 // original halves. This will then dictate the targets of the cross-half
8428 // shuffles.
8429 auto fixInPlaceInputs =
8430 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8431 MutableArrayRef<int> SourceHalfMask,
8432 MutableArrayRef<int> HalfMask, int HalfOffset) {
8433 if (InPlaceInputs.empty())
8434 return;
8435 if (InPlaceInputs.size() == 1) {
8436 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8437 InPlaceInputs[0] - HalfOffset;
8438 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8439 return;
8440 }
8441 if (IncomingInputs.empty()) {
8442 // Just fix all of the in place inputs.
8443 for (int Input : InPlaceInputs) {
8444 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8445 PSHUFDMask[Input / 2] = Input / 2;
8446 }
8447 return;
8448 }
8450 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8451 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8452 InPlaceInputs[0] - HalfOffset;
8453 // Put the second input next to the first so that they are packed into
8454 // a dword. We find the adjacent index by toggling the low bit.
8455 int AdjIndex = InPlaceInputs[0] ^ 1;
8456 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8457 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8458 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8459 };
8460 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8461 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8463 // Now gather the cross-half inputs and place them into a free dword of
8464 // their target half.
8465 // FIXME: This operation could almost certainly be simplified dramatically to
8466 // look more like the 3-1 fixing operation.
8467 auto moveInputsToRightHalf = [&PSHUFDMask](
8468 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8469 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8470 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8471 int DestOffset) {
8472 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8473 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8474 };
8475 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8476 int Word) {
8477 int LowWord = Word & ~1;
8478 int HighWord = Word | 1;
8479 return isWordClobbered(SourceHalfMask, LowWord) ||
8480 isWordClobbered(SourceHalfMask, HighWord);
8481 };
8483 if (IncomingInputs.empty())
8484 return;
8486 if (ExistingInputs.empty()) {
8487 // Map any dwords with inputs from them into the right half.
8488 for (int Input : IncomingInputs) {
8489 // If the source half mask maps over the inputs, turn those into
8490 // swaps and use the swapped lane.
8491 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8492 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8493 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8494 Input - SourceOffset;
8495 // We have to swap the uses in our half mask in one sweep.
8496 for (int &M : HalfMask)
8497 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8498 M = Input;
8499 else if (M == Input)
8500 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8501 } else {
8502 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8503 Input - SourceOffset &&
8504 "Previous placement doesn't match!");
8505 }
8506 // Note that this correctly re-maps both when we do a swap and when
8507 // we observe the other side of the swap above. We rely on that to
8508 // avoid swapping the members of the input list directly.
8509 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8510 }
8512 // Map the input's dword into the correct half.
8513 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8514 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8515 else
8516 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8517 Input / 2 &&
8518 "Previous placement doesn't match!");
8519 }
8521 // And just directly shift any other-half mask elements to be same-half
8522 // as we will have mirrored the dword containing the element into the
8523 // same position within that half.
8524 for (int &M : HalfMask)
8525 if (M >= SourceOffset && M < SourceOffset + 4) {
8526 M = M - SourceOffset + DestOffset;
8527 assert(M >= 0 && "This should never wrap below zero!");
8528 }
8529 return;
8530 }
8532 // Ensure we have the input in a viable dword of its current half. This
8533 // is particularly tricky because the original position may be clobbered
8534 // by inputs being moved and *staying* in that half.
8535 if (IncomingInputs.size() == 1) {
8536 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8537 int InputFixed = std::find(std::begin(SourceHalfMask),
8538 std::end(SourceHalfMask), -1) -
8539 std::begin(SourceHalfMask) + SourceOffset;
8540 SourceHalfMask[InputFixed - SourceOffset] =
8541 IncomingInputs[0] - SourceOffset;
8542 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8543 InputFixed);
8544 IncomingInputs[0] = InputFixed;
8545 }
8546 } else if (IncomingInputs.size() == 2) {
8547 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8548 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8549 // We have two non-adjacent or clobbered inputs we need to extract from
8550 // the source half. To do this, we need to map them into some adjacent
8551 // dword slot in the source mask.
8552 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8553 IncomingInputs[1] - SourceOffset};
8555 // If there is a free slot in the source half mask adjacent to one of
8556 // the inputs, place the other input in it. We use (Index XOR 1) to
8557 // compute an adjacent index.
8558 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8559 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8560 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8561 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8562 InputsFixed[1] = InputsFixed[0] ^ 1;
8563 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8564 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8565 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8566 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8567 InputsFixed[0] = InputsFixed[1] ^ 1;
8568 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8569 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8570 // The two inputs are in the same DWord but it is clobbered and the
8571 // adjacent DWord isn't used at all. Move both inputs to the free
8572 // slot.
8573 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8574 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8575 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8576 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8577 } else {
8578 // The only way we hit this point is if there is no clobbering
8579 // (because there are no off-half inputs to this half) and there is no
8580 // free slot adjacent to one of the inputs. In this case, we have to
8581 // swap an input with a non-input.
8582 for (int i = 0; i < 4; ++i)
8583 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8584 "We can't handle any clobbers here!");
8585 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8586 "Cannot have adjacent inputs here!");
8588 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8589 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8591 // We also have to update the final source mask in this case because
8592 // it may need to undo the above swap.
8593 for (int &M : FinalSourceHalfMask)
8594 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8595 M = InputsFixed[1] + SourceOffset;
8596 else if (M == InputsFixed[1] + SourceOffset)
8597 M = (InputsFixed[0] ^ 1) + SourceOffset;
8599 InputsFixed[1] = InputsFixed[0] ^ 1;
8600 }
8602 // Point everything at the fixed inputs.
8603 for (int &M : HalfMask)
8604 if (M == IncomingInputs[0])
8605 M = InputsFixed[0] + SourceOffset;
8606 else if (M == IncomingInputs[1])
8607 M = InputsFixed[1] + SourceOffset;
8609 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8610 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8611 }
8612 } else {
8613 llvm_unreachable("Unhandled input size!");
8614 }
8616 // Now hoist the DWord down to the right half.
8617 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8618 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8619 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8620 for (int &M : HalfMask)
8621 for (int Input : IncomingInputs)
8622 if (M == Input)
8623 M = FreeDWord * 2 + Input % 2;
8624 };
8625 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8626 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8627 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8628 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8630 // Now enact all the shuffles we've computed to move the inputs into their
8631 // target half.
8632 if (!isNoopShuffleMask(PSHUFLMask))
8633 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8634 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8635 if (!isNoopShuffleMask(PSHUFHMask))
8636 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8637 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8638 if (!isNoopShuffleMask(PSHUFDMask))
8639 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8640 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8641 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8642 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8644 // At this point, each half should contain all its inputs, and we can then
8645 // just shuffle them into their final position.
8646 assert(std::count_if(LoMask.begin(), LoMask.end(),
8647 [](int M) { return M >= 4; }) == 0 &&
8648 "Failed to lift all the high half inputs to the low mask!");
8649 assert(std::count_if(HiMask.begin(), HiMask.end(),
8650 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8651 "Failed to lift all the low half inputs to the high mask!");
8653 // Do a half shuffle for the low mask.
8654 if (!isNoopShuffleMask(LoMask))
8655 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8656 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8658 // Do a half shuffle with the high mask after shifting its values down.
8659 for (int &M : HiMask)
8660 if (M >= 0)
8661 M -= 4;
8662 if (!isNoopShuffleMask(HiMask))
8663 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8664 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8666 return V;
8667 }
8669 /// \brief Detect whether the mask pattern should be lowered through
8670 /// interleaving.
8671 ///
8672 /// This essentially tests whether viewing the mask as an interleaving of two
8673 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8674 /// lowering it through interleaving is a significantly better strategy.
8675 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8676 int NumEvenInputs[2] = {0, 0};
8677 int NumOddInputs[2] = {0, 0};
8678 int NumLoInputs[2] = {0, 0};
8679 int NumHiInputs[2] = {0, 0};
8680 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8681 if (Mask[i] < 0)
8682 continue;
8684 int InputIdx = Mask[i] >= Size;
8686 if (i < Size / 2)
8687 ++NumLoInputs[InputIdx];
8688 else
8689 ++NumHiInputs[InputIdx];
8691 if ((i % 2) == 0)
8692 ++NumEvenInputs[InputIdx];
8693 else
8694 ++NumOddInputs[InputIdx];
8695 }
8697 // The minimum number of cross-input results for both the interleaved and
8698 // split cases. If interleaving results in fewer cross-input results, return
8699 // true.
8700 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8701 NumEvenInputs[0] + NumOddInputs[1]);
8702 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8703 NumLoInputs[0] + NumHiInputs[1]);
8704 return InterleavedCrosses < SplitCrosses;
8705 }
8707 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8708 ///
8709 /// This strategy only works when the inputs from each vector fit into a single
8710 /// half of that vector, and generally there are not so many inputs as to leave
8711 /// the in-place shuffles required highly constrained (and thus expensive). It
8712 /// shifts all the inputs into a single side of both input vectors and then
8713 /// uses an unpack to interleave these inputs in a single vector. At that
8714 /// point, we will fall back on the generic single input shuffle lowering.
8715 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8716 SDValue V2,
8717 MutableArrayRef<int> Mask,
8718 const X86Subtarget *Subtarget,
8719 SelectionDAG &DAG) {
8720 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8721 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8722 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8723 for (int i = 0; i < 8; ++i)
8724 if (Mask[i] >= 0 && Mask[i] < 4)
8725 LoV1Inputs.push_back(i);
8726 else if (Mask[i] >= 4 && Mask[i] < 8)
8727 HiV1Inputs.push_back(i);
8728 else if (Mask[i] >= 8 && Mask[i] < 12)
8729 LoV2Inputs.push_back(i);
8730 else if (Mask[i] >= 12)
8731 HiV2Inputs.push_back(i);
8733 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8734 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8735 (void)NumV1Inputs;
8736 (void)NumV2Inputs;
8737 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8738 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8739 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8741 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8742 HiV1Inputs.size() + HiV2Inputs.size();
8744 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8745 ArrayRef<int> HiInputs, bool MoveToLo,
8746 int MaskOffset) {
8747 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8748 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8749 if (BadInputs.empty())
8750 return V;
8752 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8753 int MoveOffset = MoveToLo ? 0 : 4;
8755 if (GoodInputs.empty()) {
8756 for (int BadInput : BadInputs) {
8757 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8758 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8759 }
8760 } else {
8761 if (GoodInputs.size() == 2) {
8762 // If the low inputs are spread across two dwords, pack them into
8763 // a single dword.
8764 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8765 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8766 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8767 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8768 } else {
8769 // Otherwise pin the good inputs.
8770 for (int GoodInput : GoodInputs)
8771 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8772 }
8774 if (BadInputs.size() == 2) {
8775 // If we have two bad inputs then there may be either one or two good
8776 // inputs fixed in place. Find a fixed input, and then find the *other*
8777 // two adjacent indices by using modular arithmetic.
8778 int GoodMaskIdx =
8779 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8780 [](int M) { return M >= 0; }) -
8781 std::begin(MoveMask);
8782 int MoveMaskIdx =
8783 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8784 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8785 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8786 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8787 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8788 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8789 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8790 } else {
8791 assert(BadInputs.size() == 1 && "All sizes handled");
8792 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8793 std::end(MoveMask), -1) -
8794 std::begin(MoveMask);
8795 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8796 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8797 }
8798 }
8800 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8801 MoveMask);
8802 };
8803 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8804 /*MaskOffset*/ 0);
8805 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8806 /*MaskOffset*/ 8);
8808 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8809 // cross-half traffic in the final shuffle.
8811 // Munge the mask to be a single-input mask after the unpack merges the
8812 // results.
8813 for (int &M : Mask)
8814 if (M != -1)
8815 M = 2 * (M % 4) + (M / 8);
8817 return DAG.getVectorShuffle(
8818 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8819 DL, MVT::v8i16, V1, V2),
8820 DAG.getUNDEF(MVT::v8i16), Mask);
8821 }
8823 /// \brief Generic lowering of 8-lane i16 shuffles.
8824 ///
8825 /// This handles both single-input shuffles and combined shuffle/blends with
8826 /// two inputs. The single input shuffles are immediately delegated to
8827 /// a dedicated lowering routine.
8828 ///
8829 /// The blends are lowered in one of three fundamental ways. If there are few
8830 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8831 /// of the input is significantly cheaper when lowered as an interleaving of
8832 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8833 /// halves of the inputs separately (making them have relatively few inputs)
8834 /// and then concatenate them.
8835 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8836 const X86Subtarget *Subtarget,
8837 SelectionDAG &DAG) {
8838 SDLoc DL(Op);
8839 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8840 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8841 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8842 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8843 ArrayRef<int> OrigMask = SVOp->getMask();
8844 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8845 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8846 MutableArrayRef<int> Mask(MaskStorage);
8848 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8850 // Whenever we can lower this as a zext, that instruction is strictly faster
8851 // than any alternative.
8852 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8853 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8854 return ZExt;
8856 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8857 auto isV2 = [](int M) { return M >= 8; };
8859 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8860 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8862 if (NumV2Inputs == 0)
8863 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8865 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8866 "to be V1-input shuffles.");
8868 // There are special ways we can lower some single-element blends.
8869 if (NumV2Inputs == 1)
8870 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8871 Mask, Subtarget, DAG))
8872 return V;
8874 if (Subtarget->hasSSE41())
8875 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
8876 Subtarget, DAG))
8877 return Blend;
8879 // Try to use rotation instructions if available.
8880 if (Subtarget->hasSSSE3())
8881 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8882 return Rotate;
8884 if (NumV1Inputs + NumV2Inputs <= 4)
8885 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8887 // Check whether an interleaving lowering is likely to be more efficient.
8888 // This isn't perfect but it is a strong heuristic that tends to work well on
8889 // the kinds of shuffles that show up in practice.
8890 //
8891 // FIXME: Handle 1x, 2x, and 4x interleaving.
8892 if (shouldLowerAsInterleaving(Mask)) {
8893 // FIXME: Figure out whether we should pack these into the low or high
8894 // halves.
8896 int EMask[8], OMask[8];
8897 for (int i = 0; i < 4; ++i) {
8898 EMask[i] = Mask[2*i];
8899 OMask[i] = Mask[2*i + 1];
8900 EMask[i + 4] = -1;
8901 OMask[i + 4] = -1;
8902 }
8904 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8905 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8907 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8908 }
8910 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8911 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8913 for (int i = 0; i < 4; ++i) {
8914 LoBlendMask[i] = Mask[i];
8915 HiBlendMask[i] = Mask[i + 4];
8916 }
8918 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8919 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8920 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8921 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8923 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8924 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8925 }
8927 /// \brief Check whether a compaction lowering can be done by dropping even
8928 /// elements and compute how many times even elements must be dropped.
8929 ///
8930 /// This handles shuffles which take every Nth element where N is a power of
8931 /// two. Example shuffle masks:
8932 ///
8933 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8934 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8935 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8936 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8937 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8938 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8939 ///
8940 /// Any of these lanes can of course be undef.
8941 ///
8942 /// This routine only supports N <= 3.
8943 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8944 /// for larger N.
8945 ///
8946 /// \returns N above, or the number of times even elements must be dropped if
8947 /// there is such a number. Otherwise returns zero.
8948 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8949 // Figure out whether we're looping over two inputs or just one.
8950 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8952 // The modulus for the shuffle vector entries is based on whether this is
8953 // a single input or not.
8954 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8955 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8956 "We should only be called with masks with a power-of-2 size!");
8958 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8960 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8961 // and 2^3 simultaneously. This is because we may have ambiguity with
8962 // partially undef inputs.
8963 bool ViableForN[3] = {true, true, true};
8965 for (int i = 0, e = Mask.size(); i < e; ++i) {
8966 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8967 // want.
8968 if (Mask[i] == -1)
8969 continue;
8971 bool IsAnyViable = false;
8972 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8973 if (ViableForN[j]) {
8974 uint64_t N = j + 1;
8976 // The shuffle mask must be equal to (i * 2^N) % M.
8977 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8978 IsAnyViable = true;
8979 else
8980 ViableForN[j] = false;
8981 }
8982 // Early exit if we exhaust the possible powers of two.
8983 if (!IsAnyViable)
8984 break;
8985 }
8987 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8988 if (ViableForN[j])
8989 return j + 1;
8991 // Return 0 as there is no viable power of two.
8992 return 0;
8993 }
8995 /// \brief Generic lowering of v16i8 shuffles.
8996 ///
8997 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8998 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8999 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9000 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9001 /// back together.
9002 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9003 const X86Subtarget *Subtarget,
9004 SelectionDAG &DAG) {
9005 SDLoc DL(Op);
9006 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9007 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9008 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9009 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9010 ArrayRef<int> OrigMask = SVOp->getMask();
9011 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9013 // Try to use rotation instructions if available.
9014 if (Subtarget->hasSSSE3())
9015 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
9016 OrigMask, DAG))
9017 return Rotate;
9019 // Try to use a zext lowering.
9020 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9021 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
9022 return ZExt;
9024 int MaskStorage[16] = {
9025 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9026 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
9027 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
9028 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
9029 MutableArrayRef<int> Mask(MaskStorage);
9030 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
9031 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
9033 int NumV2Elements =
9034 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9036 // For single-input shuffles, there are some nicer lowering tricks we can use.
9037 if (NumV2Elements == 0) {
9038 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9039 // Notably, this handles splat and partial-splat shuffles more efficiently.
9040 // However, it only makes sense if the pre-duplication shuffle simplifies
9041 // things significantly. Currently, this means we need to be able to
9042 // express the pre-duplication shuffle as an i16 shuffle.
9043 //
9044 // FIXME: We should check for other patterns which can be widened into an
9045 // i16 shuffle as well.
9046 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9047 for (int i = 0; i < 16; i += 2)
9048 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9049 return false;
9051 return true;
9052 };
9053 auto tryToWidenViaDuplication = [&]() -> SDValue {
9054 if (!canWidenViaDuplication(Mask))
9055 return SDValue();
9056 SmallVector<int, 4> LoInputs;
9057 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9058 [](int M) { return M >= 0 && M < 8; });
9059 std::sort(LoInputs.begin(), LoInputs.end());
9060 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9061 LoInputs.end());
9062 SmallVector<int, 4> HiInputs;
9063 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9064 [](int M) { return M >= 8; });
9065 std::sort(HiInputs.begin(), HiInputs.end());
9066 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9067 HiInputs.end());
9069 bool TargetLo = LoInputs.size() >= HiInputs.size();
9070 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9071 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9073 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9074 SmallDenseMap<int, int, 8> LaneMap;
9075 for (int I : InPlaceInputs) {
9076 PreDupI16Shuffle[I/2] = I/2;
9077 LaneMap[I] = I;
9078 }
9079 int j = TargetLo ? 0 : 4, je = j + 4;
9080 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9081 // Check if j is already a shuffle of this input. This happens when
9082 // there are two adjacent bytes after we move the low one.
9083 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9084 // If we haven't yet mapped the input, search for a slot into which
9085 // we can map it.
9086 while (j < je && PreDupI16Shuffle[j] != -1)
9087 ++j;
9089 if (j == je)
9090 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9091 return SDValue();
9093 // Map this input with the i16 shuffle.
9094 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9095 }
9097 // Update the lane map based on the mapping we ended up with.
9098 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9099 }
9100 V1 = DAG.getNode(
9101 ISD::BITCAST, DL, MVT::v16i8,
9102 DAG.getVectorShuffle(MVT::v8i16, DL,
9103 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9104 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9106 // Unpack the bytes to form the i16s that will be shuffled into place.
9107 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9108 MVT::v16i8, V1, V1);
9110 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9111 for (int i = 0; i < 16; ++i)
9112 if (Mask[i] != -1) {
9113 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9114 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9115 if (PostDupI16Shuffle[i / 2] == -1)
9116 PostDupI16Shuffle[i / 2] = MappedMask;
9117 else
9118 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9119 "Conflicting entrties in the original shuffle!");
9120 }
9121 return DAG.getNode(
9122 ISD::BITCAST, DL, MVT::v16i8,
9123 DAG.getVectorShuffle(MVT::v8i16, DL,
9124 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9125 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9126 };
9127 if (SDValue V = tryToWidenViaDuplication())
9128 return V;
9129 }
9131 // Check whether an interleaving lowering is likely to be more efficient.
9132 // This isn't perfect but it is a strong heuristic that tends to work well on
9133 // the kinds of shuffles that show up in practice.
9134 //
9135 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
9136 if (shouldLowerAsInterleaving(Mask)) {
9137 // FIXME: Figure out whether we should pack these into the low or high
9138 // halves.
9140 int EMask[16], OMask[16];
9141 for (int i = 0; i < 8; ++i) {
9142 EMask[i] = Mask[2*i];
9143 OMask[i] = Mask[2*i + 1];
9144 EMask[i + 8] = -1;
9145 OMask[i + 8] = -1;
9146 }
9148 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
9149 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
9151 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
9152 }
9154 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9155 // with PSHUFB. It is important to do this before we attempt to generate any
9156 // blends but after all of the single-input lowerings. If the single input
9157 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9158 // want to preserve that and we can DAG combine any longer sequences into
9159 // a PSHUFB in the end. But once we start blending from multiple inputs,
9160 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9161 // and there are *very* few patterns that would actually be faster than the
9162 // PSHUFB approach because of its ability to zero lanes.
9163 //
9164 // FIXME: The only exceptions to the above are blends which are exact
9165 // interleavings with direct instructions supporting them. We currently don't
9166 // handle those well here.
9167 if (Subtarget->hasSSSE3()) {
9168 SDValue V1Mask[16];
9169 SDValue V2Mask[16];
9170 for (int i = 0; i < 16; ++i)
9171 if (Mask[i] == -1) {
9172 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9173 } else {
9174 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
9175 V2Mask[i] =
9176 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
9177 }
9178 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
9179 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9180 if (isSingleInputShuffleMask(Mask))
9181 return V1; // Single inputs are easy.
9183 // Otherwise, blend the two.
9184 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
9185 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9186 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9187 }
9189 // There are special ways we can lower some single-element blends.
9190 if (NumV2Elements == 1)
9191 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
9192 Mask, Subtarget, DAG))
9193 return V;
9195 // Check whether a compaction lowering can be done. This handles shuffles
9196 // which take every Nth element for some even N. See the helper function for
9197 // details.
9198 //
9199 // We special case these as they can be particularly efficiently handled with
9200 // the PACKUSB instruction on x86 and they show up in common patterns of
9201 // rearranging bytes to truncate wide elements.
9202 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9203 // NumEvenDrops is the power of two stride of the elements. Another way of
9204 // thinking about it is that we need to drop the even elements this many
9205 // times to get the original input.
9206 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9208 // First we need to zero all the dropped bytes.
9209 assert(NumEvenDrops <= 3 &&
9210 "No support for dropping even elements more than 3 times.");
9211 // We use the mask type to pick which bytes are preserved based on how many
9212 // elements are dropped.
9213 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9214 SDValue ByteClearMask =
9215 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9216 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9217 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9218 if (!IsSingleInput)
9219 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9221 // Now pack things back together.
9222 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9223 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9224 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9225 for (int i = 1; i < NumEvenDrops; ++i) {
9226 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9227 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9228 }
9230 return Result;
9231 }
9233 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9234 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9235 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9236 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9238 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9239 MutableArrayRef<int> V1HalfBlendMask,
9240 MutableArrayRef<int> V2HalfBlendMask) {
9241 for (int i = 0; i < 8; ++i)
9242 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9243 V1HalfBlendMask[i] = HalfMask[i];
9244 HalfMask[i] = i;
9245 } else if (HalfMask[i] >= 16) {
9246 V2HalfBlendMask[i] = HalfMask[i] - 16;
9247 HalfMask[i] = i + 8;
9248 }
9249 };
9250 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9251 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9253 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9255 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9256 MutableArrayRef<int> HiBlendMask) {
9257 SDValue V1, V2;
9258 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9259 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9260 // i16s.
9261 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9262 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9263 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9264 [](int M) { return M >= 0 && M % 2 == 1; })) {
9265 // Use a mask to drop the high bytes.
9266 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9267 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9268 DAG.getConstant(0x00FF, MVT::v8i16));
9270 // This will be a single vector shuffle instead of a blend so nuke V2.
9271 V2 = DAG.getUNDEF(MVT::v8i16);
9273 // Squash the masks to point directly into V1.
9274 for (int &M : LoBlendMask)
9275 if (M >= 0)
9276 M /= 2;
9277 for (int &M : HiBlendMask)
9278 if (M >= 0)
9279 M /= 2;
9280 } else {
9281 // Otherwise just unpack the low half of V into V1 and the high half into
9282 // V2 so that we can blend them as i16s.
9283 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9284 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9285 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9286 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9287 }
9289 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9290 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9291 return std::make_pair(BlendedLo, BlendedHi);
9292 };
9293 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9294 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9295 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9297 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9298 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9300 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9301 }
9303 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9304 ///
9305 /// This routine breaks down the specific type of 128-bit shuffle and
9306 /// dispatches to the lowering routines accordingly.
9307 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9308 MVT VT, const X86Subtarget *Subtarget,
9309 SelectionDAG &DAG) {
9310 switch (VT.SimpleTy) {
9311 case MVT::v2i64:
9312 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9313 case MVT::v2f64:
9314 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9315 case MVT::v4i32:
9316 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9317 case MVT::v4f32:
9318 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9319 case MVT::v8i16:
9320 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9321 case MVT::v16i8:
9322 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9324 default:
9325 llvm_unreachable("Unimplemented!");
9326 }
9327 }
9329 /// \brief Generic routine to split ector shuffle into half-sized shuffles.
9330 ///
9331 /// This routine just extracts two subvectors, shuffles them independently, and
9332 /// then concatenates them back together. This should work effectively with all
9333 /// AVX vector shuffle types.
9334 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9335 SDValue V2, ArrayRef<int> Mask,
9336 SelectionDAG &DAG) {
9337 assert(VT.getSizeInBits() >= 256 &&
9338 "Only for 256-bit or wider vector shuffles!");
9339 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9340 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9342 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9343 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9345 int NumElements = VT.getVectorNumElements();
9346 int SplitNumElements = NumElements / 2;
9347 MVT ScalarVT = VT.getScalarType();
9348 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9350 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9351 DAG.getIntPtrConstant(0));
9352 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9353 DAG.getIntPtrConstant(SplitNumElements));
9354 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9355 DAG.getIntPtrConstant(0));
9356 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9357 DAG.getIntPtrConstant(SplitNumElements));
9359 // Now create two 4-way blends of these half-width vectors.
9360 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9361 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9362 for (int i = 0; i < SplitNumElements; ++i) {
9363 int M = HalfMask[i];
9364 if (M >= NumElements) {
9365 V2BlendMask.push_back(M - NumElements);
9366 V1BlendMask.push_back(-1);
9367 BlendMask.push_back(SplitNumElements + i);
9368 } else if (M >= 0) {
9369 V2BlendMask.push_back(-1);
9370 V1BlendMask.push_back(M);
9371 BlendMask.push_back(i);
9372 } else {
9373 V2BlendMask.push_back(-1);
9374 V1BlendMask.push_back(-1);
9375 BlendMask.push_back(-1);
9376 }
9377 }
9378 SDValue V1Blend =
9379 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9380 SDValue V2Blend =
9381 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9382 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9383 };
9384 SDValue Lo = HalfBlend(LoMask);
9385 SDValue Hi = HalfBlend(HiMask);
9386 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9387 }
9389 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
9390 /// a permutation and blend of those lanes.
9391 ///
9392 /// This essentially blends the out-of-lane inputs to each lane into the lane
9393 /// from a permuted copy of the vector. This lowering strategy results in four
9394 /// instructions in the worst case for a single-input cross lane shuffle which
9395 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
9396 /// of. Special cases for each particular shuffle pattern should be handled
9397 /// prior to trying this lowering.
9398 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
9399 SDValue V1, SDValue V2,
9400 ArrayRef<int> Mask,
9401 SelectionDAG &DAG) {
9402 // FIXME: This should probably be generalized for 512-bit vectors as well.
9403 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9404 int LaneSize = Mask.size() / 2;
9406 // If there are only inputs from one 128-bit lane, splitting will in fact be
9407 // less expensive. The flags track wether the given lane contains an element
9408 // that crosses to another lane.
9409 bool LaneCrossing[2] = {false, false};
9410 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9411 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9412 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
9413 if (!LaneCrossing[0] || !LaneCrossing[1])
9414 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9416 if (isSingleInputShuffleMask(Mask)) {
9417 SmallVector<int, 32> FlippedBlendMask;
9418 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9419 FlippedBlendMask.push_back(
9420 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
9421 ? Mask[i]
9422 : Mask[i] % LaneSize +
9423 (i / LaneSize) * LaneSize + Size));
9425 // Flip the vector, and blend the results which should now be in-lane. The
9426 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
9427 // 5 for the high source. The value 3 selects the high half of source 2 and
9428 // the value 2 selects the low half of source 2. We only use source 2 to
9429 // allow folding it into a memory operand.
9430 unsigned PERMMask = 3 | 2 << 4;
9431 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
9432 V1, DAG.getConstant(PERMMask, MVT::i8));
9433 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
9434 }
9436 // This now reduces to two single-input shuffles of V1 and V2 which at worst
9437 // will be handled by the above logic and a blend of the results, much like
9438 // other patterns in AVX.
9439 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
9440 }
9442 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9443 ///
9444 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9445 /// isn't available.
9446 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9447 const X86Subtarget *Subtarget,
9448 SelectionDAG &DAG) {
9449 SDLoc DL(Op);
9450 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9451 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9452 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9453 ArrayRef<int> Mask = SVOp->getMask();
9454 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9456 if (isSingleInputShuffleMask(Mask)) {
9457 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
9458 // Non-half-crossing single input shuffles can be lowerid with an
9459 // interleaved permutation.
9460 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9461 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9462 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
9463 DAG.getConstant(VPERMILPMask, MVT::i8));
9464 }
9466 // With AVX2 we have direct support for this permutation.
9467 if (Subtarget->hasAVX2())
9468 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
9469 getV4X86ShuffleImm8ForMask(Mask, DAG));
9471 // Otherwise, fall back.
9472 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
9473 DAG);
9474 }
9476 // X86 has dedicated unpack instructions that can handle specific blend
9477 // operations: UNPCKH and UNPCKL.
9478 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9479 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9480 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9481 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9483 // If we have a single input to the zero element, insert that into V1 if we
9484 // can do so cheaply.
9485 int NumV2Elements =
9486 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9487 if (NumV2Elements == 1 && Mask[0] >= 4)
9488 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9489 MVT::v4f64, DL, V1, V2, Mask, Subtarget, DAG))
9490 return Insertion;
9492 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
9493 Subtarget, DAG))
9494 return Blend;
9496 // Check if the blend happens to exactly fit that of SHUFPD.
9497 if ((Mask[0] == -1 || Mask[0] < 2) &&
9498 (Mask[1] == -1 || (Mask[1] >= 4 && Mask[1] < 6)) &&
9499 (Mask[2] == -1 || (Mask[2] >= 2 && Mask[2] < 4)) &&
9500 (Mask[3] == -1 || Mask[3] >= 6)) {
9501 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9502 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9503 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9504 DAG.getConstant(SHUFPDMask, MVT::i8));
9505 }
9506 if ((Mask[0] == -1 || (Mask[0] >= 4 && Mask[0] < 6)) &&
9507 (Mask[1] == -1 || Mask[1] < 2) &&
9508 (Mask[2] == -1 || Mask[2] >= 6) &&
9509 (Mask[3] == -1 || (Mask[3] >= 2 && Mask[3] < 4))) {
9510 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9511 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9512 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9513 DAG.getConstant(SHUFPDMask, MVT::i8));
9514 }
9516 // Otherwise fall back on generic blend lowering.
9517 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
9518 Mask, DAG);
9519 }
9521 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9522 ///
9523 /// This routine is only called when we have AVX2 and thus a reasonable
9524 /// instruction set for v4i64 shuffling..
9525 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9526 const X86Subtarget *Subtarget,
9527 SelectionDAG &DAG) {
9528 SDLoc DL(Op);
9529 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9530 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9531 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9532 ArrayRef<int> Mask = SVOp->getMask();
9533 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9534 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
9536 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
9537 Subtarget, DAG))
9538 return Blend;
9540 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
9541 // use lower latency instructions that will operate on both 128-bit lanes.
9542 SmallVector<int, 2> RepeatedMask;
9543 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
9544 if (isSingleInputShuffleMask(Mask)) {
9545 int PSHUFDMask[] = {-1, -1, -1, -1};
9546 for (int i = 0; i < 2; ++i)
9547 if (RepeatedMask[i] >= 0) {
9548 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
9549 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
9550 }
9551 return DAG.getNode(
9552 ISD::BITCAST, DL, MVT::v4i64,
9553 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
9554 DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, V1),
9555 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
9556 }
9558 // Use dedicated unpack instructions for masks that match their pattern.
9559 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9560 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i64, V1, V2);
9561 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9562 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i64, V1, V2);
9563 }
9565 // AVX2 provides a direct instruction for permuting a single input across
9566 // lanes.
9567 if (isSingleInputShuffleMask(Mask))
9568 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
9569 getV4X86ShuffleImm8ForMask(Mask, DAG));
9571 // Otherwise fall back on generic blend lowering.
9572 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
9573 Mask, DAG);
9574 }
9576 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9577 ///
9578 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9579 /// isn't available.
9580 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9581 const X86Subtarget *Subtarget,
9582 SelectionDAG &DAG) {
9583 SDLoc DL(Op);
9584 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9585 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9586 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9587 ArrayRef<int> Mask = SVOp->getMask();
9588 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9590 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
9591 Subtarget, DAG))
9592 return Blend;
9594 // If the shuffle mask is repeated in each 128-bit lane, we have many more
9595 // options to efficiently lower the shuffle.
9596 SmallVector<int, 4> RepeatedMask;
9597 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
9598 assert(RepeatedMask.size() == 4 &&
9599 "Repeated masks must be half the mask width!");
9600 if (isSingleInputShuffleMask(Mask))
9601 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
9602 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9604 // Use dedicated unpack instructions for masks that match their pattern.
9605 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9606 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8f32, V1, V2);
9607 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9608 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8f32, V1, V2);
9610 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
9611 // have already handled any direct blends. We also need to squash the
9612 // repeated mask into a simulated v4f32 mask.
9613 for (int i = 0; i < 4; ++i)
9614 if (RepeatedMask[i] >= 8)
9615 RepeatedMask[i] -= 4;
9616 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
9617 }
9619 // If we have a single input shuffle with different shuffle patterns in the
9620 // two 128-bit lanes use the variable mask to VPERMILPS.
9621 if (isSingleInputShuffleMask(Mask)) {
9622 SDValue VPermMask[8];
9623 for (int i = 0; i < 8; ++i)
9624 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9625 : DAG.getConstant(Mask[i], MVT::i32);
9626 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
9627 return DAG.getNode(
9628 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
9629 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
9631 if (Subtarget->hasAVX2())
9632 return DAG.getNode(X86ISD::VPERMV, DL, MVT::v8f32,
9633 DAG.getNode(ISD::BITCAST, DL, MVT::v8f32,
9634 DAG.getNode(ISD::BUILD_VECTOR, DL,
9635 MVT::v8i32, VPermMask)),
9636 V1);
9638 // Otherwise, fall back.
9639 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
9640 DAG);
9641 }
9643 // Otherwise fall back on generic blend lowering.
9644 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
9645 Mask, DAG);
9646 }
9648 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
9649 ///
9650 /// This routine is only called when we have AVX2 and thus a reasonable
9651 /// instruction set for v8i32 shuffling..
9652 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9653 const X86Subtarget *Subtarget,
9654 SelectionDAG &DAG) {
9655 SDLoc DL(Op);
9656 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9657 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9658 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9659 ArrayRef<int> Mask = SVOp->getMask();
9660 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9661 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
9663 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
9664 Subtarget, DAG))
9665 return Blend;
9667 // If the shuffle mask is repeated in each 128-bit lane we can use more
9668 // efficient instructions that mirror the shuffles across the two 128-bit
9669 // lanes.
9670 SmallVector<int, 4> RepeatedMask;
9671 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
9672 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
9673 if (isSingleInputShuffleMask(Mask))
9674 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
9675 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9677 // Use dedicated unpack instructions for masks that match their pattern.
9678 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9679 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i32, V1, V2);
9680 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9681 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i32, V1, V2);
9682 }
9684 // If the shuffle patterns aren't repeated but it is a single input, directly
9685 // generate a cross-lane VPERMD instruction.
9686 if (isSingleInputShuffleMask(Mask)) {
9687 SDValue VPermMask[8];
9688 for (int i = 0; i < 8; ++i)
9689 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9690 : DAG.getConstant(Mask[i], MVT::i32);
9691 return DAG.getNode(
9692 X86ISD::VPERMV, DL, MVT::v8i32,
9693 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
9694 }
9696 // Otherwise fall back on generic blend lowering.
9697 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
9698 Mask, DAG);
9699 }
9701 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
9702 ///
9703 /// This routine is only called when we have AVX2 and thus a reasonable
9704 /// instruction set for v16i16 shuffling..
9705 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9706 const X86Subtarget *Subtarget,
9707 SelectionDAG &DAG) {
9708 SDLoc DL(Op);
9709 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9710 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9711 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9712 ArrayRef<int> Mask = SVOp->getMask();
9713 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9714 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
9716 // There are no generalized cross-lane shuffle operations available on i16
9717 // element types.
9718 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
9719 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
9720 Mask, DAG);
9722 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
9723 Subtarget, DAG))
9724 return Blend;
9726 // Use dedicated unpack instructions for masks that match their pattern.
9727 if (isShuffleEquivalent(Mask,
9728 // First 128-bit lane:
9729 0, 16, 1, 17, 2, 18, 3, 19,
9730 // Second 128-bit lane:
9731 8, 24, 9, 25, 10, 26, 11, 27))
9732 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i16, V1, V2);
9733 if (isShuffleEquivalent(Mask,
9734 // First 128-bit lane:
9735 4, 20, 5, 21, 6, 22, 7, 23,
9736 // Second 128-bit lane:
9737 12, 28, 13, 29, 14, 30, 15, 31))
9738 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i16, V1, V2);
9740 if (isSingleInputShuffleMask(Mask)) {
9741 SDValue PSHUFBMask[32];
9742 for (int i = 0; i < 16; ++i) {
9743 if (Mask[i] == -1) {
9744 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
9745 continue;
9746 }
9748 int M = i < 8 ? Mask[i] : Mask[i] - 8;
9749 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
9750 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, MVT::i8);
9751 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, MVT::i8);
9752 }
9753 return DAG.getNode(
9754 ISD::BITCAST, DL, MVT::v16i16,
9755 DAG.getNode(
9756 X86ISD::PSHUFB, DL, MVT::v32i8,
9757 DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1),
9758 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask)));
9759 }
9761 // Otherwise fall back on generic blend lowering.
9762 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i16, V1, V2,
9763 Mask, DAG);
9764 }
9766 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
9767 ///
9768 /// This routine is only called when we have AVX2 and thus a reasonable
9769 /// instruction set for v32i8 shuffling..
9770 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9771 const X86Subtarget *Subtarget,
9772 SelectionDAG &DAG) {
9773 SDLoc DL(Op);
9774 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9775 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9776 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9777 ArrayRef<int> Mask = SVOp->getMask();
9778 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
9779 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
9781 // There are no generalized cross-lane shuffle operations available on i8
9782 // element types.
9783 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
9784 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
9785 Mask, DAG);
9787 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
9788 Subtarget, DAG))
9789 return Blend;
9791 // Use dedicated unpack instructions for masks that match their pattern.
9792 // Note that these are repeated 128-bit lane unpacks, not unpacks across all
9793 // 256-bit lanes.
9794 if (isShuffleEquivalent(
9795 Mask,
9796 // First 128-bit lane:
9797 0, 32, 1, 33, 2, 34, 3, 35, 4, 36, 5, 37, 6, 38, 7, 39,
9798 // Second 128-bit lane:
9799 16, 48, 17, 49, 18, 50, 19, 51, 20, 52, 21, 53, 22, 54, 23, 55))
9800 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v32i8, V1, V2);
9801 if (isShuffleEquivalent(
9802 Mask,
9803 // First 128-bit lane:
9804 8, 40, 9, 41, 10, 42, 11, 43, 12, 44, 13, 45, 14, 46, 15, 47,
9805 // Second 128-bit lane:
9806 24, 56, 25, 57, 26, 58, 27, 59, 28, 60, 29, 61, 30, 62, 31, 63))
9807 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v32i8, V1, V2);
9809 if (isSingleInputShuffleMask(Mask)) {
9810 SDValue PSHUFBMask[32];
9811 for (int i = 0; i < 32; ++i)
9812 PSHUFBMask[i] =
9813 Mask[i] < 0
9814 ? DAG.getUNDEF(MVT::i8)
9815 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, MVT::i8);
9817 return DAG.getNode(
9818 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
9819 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
9820 }
9822 // Otherwise fall back on generic blend lowering.
9823 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v32i8, V1, V2,
9824 Mask, DAG);
9825 }
9827 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9828 ///
9829 /// This routine either breaks down the specific type of a 256-bit x86 vector
9830 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9831 /// together based on the available instructions.
9832 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9833 MVT VT, const X86Subtarget *Subtarget,
9834 SelectionDAG &DAG) {
9835 SDLoc DL(Op);
9836 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9837 ArrayRef<int> Mask = SVOp->getMask();
9839 // There is a really nice hard cut-over between AVX1 and AVX2 that means we can
9840 // check for those subtargets here and avoid much of the subtarget querying in
9841 // the per-vector-type lowering routines. With AVX1 we have essentially *zero*
9842 // ability to manipulate a 256-bit vector with integer types. Since we'll use
9843 // floating point types there eventually, just immediately cast everything to
9844 // a float and operate entirely in that domain.
9845 if (VT.isInteger() && !Subtarget->hasAVX2()) {
9846 int ElementBits = VT.getScalarSizeInBits();
9847 if (ElementBits < 32)
9848 // No floating point type available, decompose into 128-bit vectors.
9849 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9851 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
9852 VT.getVectorNumElements());
9853 V1 = DAG.getNode(ISD::BITCAST, DL, FpVT, V1);
9854 V2 = DAG.getNode(ISD::BITCAST, DL, FpVT, V2);
9855 return DAG.getNode(ISD::BITCAST, DL, VT,
9856 DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
9857 }
9859 switch (VT.SimpleTy) {
9860 case MVT::v4f64:
9861 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9862 case MVT::v4i64:
9863 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9864 case MVT::v8f32:
9865 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9866 case MVT::v8i32:
9867 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9868 case MVT::v16i16:
9869 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9870 case MVT::v32i8:
9871 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9873 default:
9874 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9875 }
9876 }
9878 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
9879 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9880 const X86Subtarget *Subtarget,
9881 SelectionDAG &DAG) {
9882 SDLoc DL(Op);
9883 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
9884 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
9885 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9886 ArrayRef<int> Mask = SVOp->getMask();
9887 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9889 // FIXME: Implement direct support for this type!
9890 return splitAndLowerVectorShuffle(DL, MVT::v8f64, V1, V2, Mask, DAG);
9891 }
9893 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
9894 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9895 const X86Subtarget *Subtarget,
9896 SelectionDAG &DAG) {
9897 SDLoc DL(Op);
9898 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
9899 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
9900 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9901 ArrayRef<int> Mask = SVOp->getMask();
9902 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9904 // FIXME: Implement direct support for this type!
9905 return splitAndLowerVectorShuffle(DL, MVT::v16f32, V1, V2, Mask, DAG);
9906 }
9908 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
9909 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9910 const X86Subtarget *Subtarget,
9911 SelectionDAG &DAG) {
9912 SDLoc DL(Op);
9913 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
9914 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
9915 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9916 ArrayRef<int> Mask = SVOp->getMask();
9917 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9918 assert(Subtarget->hasDQI() && "We can only lower v8i64 with AVX-512-DQI");
9920 // FIXME: Implement direct support for this type!
9921 return splitAndLowerVectorShuffle(DL, MVT::v8i64, V1, V2, Mask, DAG);
9922 }
9924 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
9925 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9926 const X86Subtarget *Subtarget,
9927 SelectionDAG &DAG) {
9928 SDLoc DL(Op);
9929 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
9930 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
9931 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9932 ArrayRef<int> Mask = SVOp->getMask();
9933 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9934 assert(Subtarget->hasDQI() && "We can only lower v16i32 with AVX-512-DQI!");
9936 // FIXME: Implement direct support for this type!
9937 return splitAndLowerVectorShuffle(DL, MVT::v16i32, V1, V2, Mask, DAG);
9938 }
9940 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
9941 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9942 const X86Subtarget *Subtarget,
9943 SelectionDAG &DAG) {
9944 SDLoc DL(Op);
9945 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
9946 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
9947 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9948 ArrayRef<int> Mask = SVOp->getMask();
9949 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
9950 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
9952 // FIXME: Implement direct support for this type!
9953 return splitAndLowerVectorShuffle(DL, MVT::v32i16, V1, V2, Mask, DAG);
9954 }
9956 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
9957 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9958 const X86Subtarget *Subtarget,
9959 SelectionDAG &DAG) {
9960 SDLoc DL(Op);
9961 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
9962 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
9963 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9964 ArrayRef<int> Mask = SVOp->getMask();
9965 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
9966 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
9968 // FIXME: Implement direct support for this type!
9969 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
9970 }
9972 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
9973 ///
9974 /// This routine either breaks down the specific type of a 512-bit x86 vector
9975 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
9976 /// together based on the available instructions.
9977 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9978 MVT VT, const X86Subtarget *Subtarget,
9979 SelectionDAG &DAG) {
9980 SDLoc DL(Op);
9981 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9982 ArrayRef<int> Mask = SVOp->getMask();
9983 assert(Subtarget->hasAVX512() &&
9984 "Cannot lower 512-bit vectors w/ basic ISA!");
9986 // Dispatch to each element type for lowering. If we don't have supprot for
9987 // specific element type shuffles at 512 bits, immediately split them and
9988 // lower them. Each lowering routine of a given type is allowed to assume that
9989 // the requisite ISA extensions for that element type are available.
9990 switch (VT.SimpleTy) {
9991 case MVT::v8f64:
9992 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9993 case MVT::v16f32:
9994 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9995 case MVT::v8i64:
9996 if (Subtarget->hasDQI())
9997 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9998 break;
9999 case MVT::v16i32:
10000 if (Subtarget->hasDQI())
10001 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10002 break;
10003 case MVT::v32i16:
10004 if (Subtarget->hasBWI())
10005 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10006 break;
10007 case MVT::v64i8:
10008 if (Subtarget->hasBWI())
10009 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10010 break;
10012 default:
10013 llvm_unreachable("Not a valid 512-bit x86 vector type!");
10014 }
10016 // Otherwise fall back on splitting.
10017 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10018 }
10020 /// \brief Helper function to test whether a shuffle mask could be
10021 /// simplified by widening the elements being shuffled.
10022 ///
10023 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
10024 /// leaves it in an unspecified state.
10025 ///
10026 /// NOTE: This must handle normal vector shuffle masks and *target* vector
10027 /// shuffle masks. The latter have the special property of a '-2' representing
10028 /// a zero-ed lane of a vector.
10029 static bool canWidenShuffleElements(ArrayRef<int> Mask,
10030 SmallVectorImpl<int> &WidenedMask) {
10031 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
10032 // If both elements are undef, its trivial.
10033 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
10034 WidenedMask.push_back(SM_SentinelUndef);
10035 continue;
10036 }
10038 // Check for an undef mask and a mask value properly aligned to fit with
10039 // a pair of values. If we find such a case, use the non-undef mask's value.
10040 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
10041 WidenedMask.push_back(Mask[i + 1] / 2);
10042 continue;
10043 }
10044 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
10045 WidenedMask.push_back(Mask[i] / 2);
10046 continue;
10047 }
10049 // When zeroing, we need to spread the zeroing across both lanes to widen.
10050 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
10051 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
10052 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
10053 WidenedMask.push_back(SM_SentinelZero);
10054 continue;
10055 }
10056 return false;
10057 }
10059 // Finally check if the two mask values are adjacent and aligned with
10060 // a pair.
10061 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
10062 WidenedMask.push_back(Mask[i] / 2);
10063 continue;
10064 }
10066 // Otherwise we can't safely widen the elements used in this shuffle.
10067 return false;
10068 }
10069 assert(WidenedMask.size() == Mask.size() / 2 &&
10070 "Incorrect size of mask after widening the elements!");
10072 return true;
10073 }
10075 /// \brief Top-level lowering for x86 vector shuffles.
10076 ///
10077 /// This handles decomposition, canonicalization, and lowering of all x86
10078 /// vector shuffles. Most of the specific lowering strategies are encapsulated
10079 /// above in helper routines. The canonicalization attempts to widen shuffles
10080 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
10081 /// s.t. only one of the two inputs needs to be tested, etc.
10082 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10083 SelectionDAG &DAG) {
10084 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10085 ArrayRef<int> Mask = SVOp->getMask();
10086 SDValue V1 = Op.getOperand(0);
10087 SDValue V2 = Op.getOperand(1);
10088 MVT VT = Op.getSimpleValueType();
10089 int NumElements = VT.getVectorNumElements();
10090 SDLoc dl(Op);
10092 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10094 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10095 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10096 if (V1IsUndef && V2IsUndef)
10097 return DAG.getUNDEF(VT);
10099 // When we create a shuffle node we put the UNDEF node to second operand,
10100 // but in some cases the first operand may be transformed to UNDEF.
10101 // In this case we should just commute the node.
10102 if (V1IsUndef)
10103 return DAG.getCommutedVectorShuffle(*SVOp);
10105 // Check for non-undef masks pointing at an undef vector and make the masks
10106 // undef as well. This makes it easier to match the shuffle based solely on
10107 // the mask.
10108 if (V2IsUndef)
10109 for (int M : Mask)
10110 if (M >= NumElements) {
10111 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
10112 for (int &M : NewMask)
10113 if (M >= NumElements)
10114 M = -1;
10115 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
10116 }
10118 // For integer vector shuffles, try to collapse them into a shuffle of fewer
10119 // lanes but wider integers. We cap this to not form integers larger than i64
10120 // but it might be interesting to form i128 integers to handle flipping the
10121 // low and high halves of AVX 256-bit vectors.
10122 SmallVector<int, 16> WidenedMask;
10123 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
10124 canWidenShuffleElements(Mask, WidenedMask)) {
10125 MVT NewVT =
10126 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
10127 VT.getVectorNumElements() / 2);
10128 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
10129 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
10130 return DAG.getNode(ISD::BITCAST, dl, VT,
10131 DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
10132 }
10134 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
10135 for (int M : SVOp->getMask())
10136 if (M < 0)
10137 ++NumUndefElements;
10138 else if (M < NumElements)
10139 ++NumV1Elements;
10140 else
10141 ++NumV2Elements;
10143 // Commute the shuffle as needed such that more elements come from V1 than
10144 // V2. This allows us to match the shuffle pattern strictly on how many
10145 // elements come from V1 without handling the symmetric cases.
10146 if (NumV2Elements > NumV1Elements)
10147 return DAG.getCommutedVectorShuffle(*SVOp);
10149 // When the number of V1 and V2 elements are the same, try to minimize the
10150 // number of uses of V2 in the low half of the vector. When that is tied,
10151 // ensure that the sum of indices for V1 is equal to or lower than the sum
10152 // indices for V2.
10153 if (NumV1Elements == NumV2Elements) {
10154 int LowV1Elements = 0, LowV2Elements = 0;
10155 for (int M : SVOp->getMask().slice(0, NumElements / 2))
10156 if (M >= NumElements)
10157 ++LowV2Elements;
10158 else if (M >= 0)
10159 ++LowV1Elements;
10160 if (LowV2Elements > LowV1Elements) {
10161 return DAG.getCommutedVectorShuffle(*SVOp);
10162 } else if (LowV2Elements == LowV1Elements) {
10163 int SumV1Indices = 0, SumV2Indices = 0;
10164 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
10165 if (SVOp->getMask()[i] >= NumElements)
10166 SumV2Indices += i;
10167 else if (SVOp->getMask()[i] >= 0)
10168 SumV1Indices += i;
10169 if (SumV2Indices < SumV1Indices)
10170 return DAG.getCommutedVectorShuffle(*SVOp);
10171 }
10172 }
10174 // For each vector width, delegate to a specialized lowering routine.
10175 if (VT.getSizeInBits() == 128)
10176 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10178 if (VT.getSizeInBits() == 256)
10179 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10181 // Force AVX-512 vectors to be scalarized for now.
10182 // FIXME: Implement AVX-512 support!
10183 if (VT.getSizeInBits() == 512)
10184 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10186 llvm_unreachable("Unimplemented!");
10187 }
10190 //===----------------------------------------------------------------------===//
10191 // Legacy vector shuffle lowering
10192 //
10193 // This code is the legacy code handling vector shuffles until the above
10194 // replaces its functionality and performance.
10195 //===----------------------------------------------------------------------===//
10197 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
10198 bool hasInt256, unsigned *MaskOut = nullptr) {
10199 MVT EltVT = VT.getVectorElementType();
10201 // There is no blend with immediate in AVX-512.
10202 if (VT.is512BitVector())
10203 return false;
10205 if (!hasSSE41 || EltVT == MVT::i8)
10206 return false;
10207 if (!hasInt256 && VT == MVT::v16i16)
10208 return false;
10210 unsigned MaskValue = 0;
10211 unsigned NumElems = VT.getVectorNumElements();
10212 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
10213 unsigned NumLanes = (NumElems - 1) / 8 + 1;
10214 unsigned NumElemsInLane = NumElems / NumLanes;
10216 // Blend for v16i16 should be symetric for the both lanes.
10217 for (unsigned i = 0; i < NumElemsInLane; ++i) {
10219 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
10220 int EltIdx = MaskVals[i];
10222 if ((EltIdx < 0 || EltIdx == (int)i) &&
10223 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
10224 continue;
10226 if (((unsigned)EltIdx == (i + NumElems)) &&
10227 (SndLaneEltIdx < 0 ||
10228 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
10229 MaskValue |= (1 << i);
10230 else
10231 return false;
10232 }
10234 if (MaskOut)
10235 *MaskOut = MaskValue;
10236 return true;
10237 }
10239 // Try to lower a shuffle node into a simple blend instruction.
10240 // This function assumes isBlendMask returns true for this
10241 // SuffleVectorSDNode
10242 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
10243 unsigned MaskValue,
10244 const X86Subtarget *Subtarget,
10245 SelectionDAG &DAG) {
10246 MVT VT = SVOp->getSimpleValueType(0);
10247 MVT EltVT = VT.getVectorElementType();
10248 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
10249 Subtarget->hasInt256() && "Trying to lower a "
10250 "VECTOR_SHUFFLE to a Blend but "
10251 "with the wrong mask"));
10252 SDValue V1 = SVOp->getOperand(0);
10253 SDValue V2 = SVOp->getOperand(1);
10254 SDLoc dl(SVOp);
10255 unsigned NumElems = VT.getVectorNumElements();
10257 // Convert i32 vectors to floating point if it is not AVX2.
10258 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
10259 MVT BlendVT = VT;
10260 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
10261 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
10262 NumElems);
10263 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
10264 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
10265 }
10267 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
10268 DAG.getConstant(MaskValue, MVT::i32));
10269 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
10270 }
10272 /// In vector type \p VT, return true if the element at index \p InputIdx
10273 /// falls on a different 128-bit lane than \p OutputIdx.
10274 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
10275 unsigned OutputIdx) {
10276 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
10277 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
10278 }
10280 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
10281 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
10282 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
10283 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
10284 /// zero.
10285 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
10286 SelectionDAG &DAG) {
10287 MVT VT = V1.getSimpleValueType();
10288 assert(VT.is128BitVector() || VT.is256BitVector());
10290 MVT EltVT = VT.getVectorElementType();
10291 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
10292 unsigned NumElts = VT.getVectorNumElements();
10294 SmallVector<SDValue, 32> PshufbMask;
10295 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
10296 int InputIdx = MaskVals[OutputIdx];
10297 unsigned InputByteIdx;
10299 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
10300 InputByteIdx = 0x80;
10301 else {
10302 // Cross lane is not allowed.
10303 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
10304 return SDValue();
10305 InputByteIdx = InputIdx * EltSizeInBytes;
10306 // Index is an byte offset within the 128-bit lane.
10307 InputByteIdx &= 0xf;
10308 }
10310 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
10311 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
10312 if (InputByteIdx != 0x80)
10313 ++InputByteIdx;
10314 }
10315 }
10317 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
10318 if (ShufVT != VT)
10319 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
10320 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
10321 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
10322 }
10324 // v8i16 shuffles - Prefer shuffles in the following order:
10325 // 1. [all] pshuflw, pshufhw, optional move
10326 // 2. [ssse3] 1 x pshufb
10327 // 3. [ssse3] 2 x pshufb + 1 x por
10328 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
10329 static SDValue
10330 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
10331 SelectionDAG &DAG) {
10332 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10333 SDValue V1 = SVOp->getOperand(0);
10334 SDValue V2 = SVOp->getOperand(1);
10335 SDLoc dl(SVOp);
10336 SmallVector<int, 8> MaskVals;
10338 // Determine if more than 1 of the words in each of the low and high quadwords
10339 // of the result come from the same quadword of one of the two inputs. Undef
10340 // mask values count as coming from any quadword, for better codegen.
10341 //
10342 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
10343 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
10344 unsigned LoQuad[] = { 0, 0, 0, 0 };
10345 unsigned HiQuad[] = { 0, 0, 0, 0 };
10346 // Indices of quads used.
10347 std::bitset<4> InputQuads;
10348 for (unsigned i = 0; i < 8; ++i) {
10349 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
10350 int EltIdx = SVOp->getMaskElt(i);
10351 MaskVals.push_back(EltIdx);
10352 if (EltIdx < 0) {
10353 ++Quad[0];
10354 ++Quad[1];
10355 ++Quad[2];
10356 ++Quad[3];
10357 continue;
10358 }
10359 ++Quad[EltIdx / 4];
10360 InputQuads.set(EltIdx / 4);
10361 }
10363 int BestLoQuad = -1;
10364 unsigned MaxQuad = 1;
10365 for (unsigned i = 0; i < 4; ++i) {
10366 if (LoQuad[i] > MaxQuad) {
10367 BestLoQuad = i;
10368 MaxQuad = LoQuad[i];
10369 }
10370 }
10372 int BestHiQuad = -1;
10373 MaxQuad = 1;
10374 for (unsigned i = 0; i < 4; ++i) {
10375 if (HiQuad[i] > MaxQuad) {
10376 BestHiQuad = i;
10377 MaxQuad = HiQuad[i];
10378 }
10379 }
10381 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
10382 // of the two input vectors, shuffle them into one input vector so only a
10383 // single pshufb instruction is necessary. If there are more than 2 input
10384 // quads, disable the next transformation since it does not help SSSE3.
10385 bool V1Used = InputQuads[0] || InputQuads[1];
10386 bool V2Used = InputQuads[2] || InputQuads[3];
10387 if (Subtarget->hasSSSE3()) {
10388 if (InputQuads.count() == 2 && V1Used && V2Used) {
10389 BestLoQuad = InputQuads[0] ? 0 : 1;
10390 BestHiQuad = InputQuads[2] ? 2 : 3;
10391 }
10392 if (InputQuads.count() > 2) {
10393 BestLoQuad = -1;
10394 BestHiQuad = -1;
10395 }
10396 }
10398 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
10399 // the shuffle mask. If a quad is scored as -1, that means that it contains
10400 // words from all 4 input quadwords.
10401 SDValue NewV;
10402 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
10403 int MaskV[] = {
10404 BestLoQuad < 0 ? 0 : BestLoQuad,
10405 BestHiQuad < 0 ? 1 : BestHiQuad
10406 };
10407 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
10408 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
10409 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
10410 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
10412 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
10413 // source words for the shuffle, to aid later transformations.
10414 bool AllWordsInNewV = true;
10415 bool InOrder[2] = { true, true };
10416 for (unsigned i = 0; i != 8; ++i) {
10417 int idx = MaskVals[i];
10418 if (idx != (int)i)
10419 InOrder[i/4] = false;
10420 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
10421 continue;
10422 AllWordsInNewV = false;
10423 break;
10424 }
10426 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
10427 if (AllWordsInNewV) {
10428 for (int i = 0; i != 8; ++i) {
10429 int idx = MaskVals[i];
10430 if (idx < 0)
10431 continue;
10432 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
10433 if ((idx != i) && idx < 4)
10434 pshufhw = false;
10435 if ((idx != i) && idx > 3)
10436 pshuflw = false;
10437 }
10438 V1 = NewV;
10439 V2Used = false;
10440 BestLoQuad = 0;
10441 BestHiQuad = 1;
10442 }
10444 // If we've eliminated the use of V2, and the new mask is a pshuflw or
10445 // pshufhw, that's as cheap as it gets. Return the new shuffle.
10446 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
10447 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
10448 unsigned TargetMask = 0;
10449 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
10450 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
10451 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10452 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
10453 getShufflePSHUFLWImmediate(SVOp);
10454 V1 = NewV.getOperand(0);
10455 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
10456 }
10457 }
10459 // Promote splats to a larger type which usually leads to more efficient code.
10460 // FIXME: Is this true if pshufb is available?
10461 if (SVOp->isSplat())
10462 return PromoteSplat(SVOp, DAG);
10464 // If we have SSSE3, and all words of the result are from 1 input vector,
10465 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
10466 // is present, fall back to case 4.
10467 if (Subtarget->hasSSSE3()) {
10468 SmallVector<SDValue,16> pshufbMask;
10470 // If we have elements from both input vectors, set the high bit of the
10471 // shuffle mask element to zero out elements that come from V2 in the V1
10472 // mask, and elements that come from V1 in the V2 mask, so that the two
10473 // results can be OR'd together.
10474 bool TwoInputs = V1Used && V2Used;
10475 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
10476 if (!TwoInputs)
10477 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10479 // Calculate the shuffle mask for the second input, shuffle it, and
10480 // OR it with the first shuffled input.
10481 CommuteVectorShuffleMask(MaskVals, 8);
10482 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
10483 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10484 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10485 }
10487 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
10488 // and update MaskVals with new element order.
10489 std::bitset<8> InOrder;
10490 if (BestLoQuad >= 0) {
10491 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
10492 for (int i = 0; i != 4; ++i) {
10493 int idx = MaskVals[i];
10494 if (idx < 0) {
10495 InOrder.set(i);
10496 } else if ((idx / 4) == BestLoQuad) {
10497 MaskV[i] = idx & 3;
10498 InOrder.set(i);
10499 }
10500 }
10501 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10502 &MaskV[0]);
10504 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10505 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10506 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
10507 NewV.getOperand(0),
10508 getShufflePSHUFLWImmediate(SVOp), DAG);
10509 }
10510 }
10512 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
10513 // and update MaskVals with the new element order.
10514 if (BestHiQuad >= 0) {
10515 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
10516 for (unsigned i = 4; i != 8; ++i) {
10517 int idx = MaskVals[i];
10518 if (idx < 0) {
10519 InOrder.set(i);
10520 } else if ((idx / 4) == BestHiQuad) {
10521 MaskV[i] = (idx & 3) + 4;
10522 InOrder.set(i);
10523 }
10524 }
10525 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10526 &MaskV[0]);
10528 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10529 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10530 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
10531 NewV.getOperand(0),
10532 getShufflePSHUFHWImmediate(SVOp), DAG);
10533 }
10534 }
10536 // In case BestHi & BestLo were both -1, which means each quadword has a word
10537 // from each of the four input quadwords, calculate the InOrder bitvector now
10538 // before falling through to the insert/extract cleanup.
10539 if (BestLoQuad == -1 && BestHiQuad == -1) {
10540 NewV = V1;
10541 for (int i = 0; i != 8; ++i)
10542 if (MaskVals[i] < 0 || MaskVals[i] == i)
10543 InOrder.set(i);
10544 }
10546 // The other elements are put in the right place using pextrw and pinsrw.
10547 for (unsigned i = 0; i != 8; ++i) {
10548 if (InOrder[i])
10549 continue;
10550 int EltIdx = MaskVals[i];
10551 if (EltIdx < 0)
10552 continue;
10553 SDValue ExtOp = (EltIdx < 8) ?
10554 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
10555 DAG.getIntPtrConstant(EltIdx)) :
10556 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
10557 DAG.getIntPtrConstant(EltIdx - 8));
10558 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
10559 DAG.getIntPtrConstant(i));
10560 }
10561 return NewV;
10562 }
10564 /// \brief v16i16 shuffles
10565 ///
10566 /// FIXME: We only support generation of a single pshufb currently. We can
10567 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
10568 /// well (e.g 2 x pshufb + 1 x por).
10569 static SDValue
10570 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
10571 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10572 SDValue V1 = SVOp->getOperand(0);
10573 SDValue V2 = SVOp->getOperand(1);
10574 SDLoc dl(SVOp);
10576 if (V2.getOpcode() != ISD::UNDEF)
10577 return SDValue();
10579 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10580 return getPSHUFB(MaskVals, V1, dl, DAG);
10581 }
10583 // v16i8 shuffles - Prefer shuffles in the following order:
10584 // 1. [ssse3] 1 x pshufb
10585 // 2. [ssse3] 2 x pshufb + 1 x por
10586 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
10587 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
10588 const X86Subtarget* Subtarget,
10589 SelectionDAG &DAG) {
10590 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
10591 SDValue V1 = SVOp->getOperand(0);
10592 SDValue V2 = SVOp->getOperand(1);
10593 SDLoc dl(SVOp);
10594 ArrayRef<int> MaskVals = SVOp->getMask();
10596 // Promote splats to a larger type which usually leads to more efficient code.
10597 // FIXME: Is this true if pshufb is available?
10598 if (SVOp->isSplat())
10599 return PromoteSplat(SVOp, DAG);
10601 // If we have SSSE3, case 1 is generated when all result bytes come from
10602 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
10603 // present, fall back to case 3.
10605 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
10606 if (Subtarget->hasSSSE3()) {
10607 SmallVector<SDValue,16> pshufbMask;
10609 // If all result elements are from one input vector, then only translate
10610 // undef mask values to 0x80 (zero out result) in the pshufb mask.
10611 //
10612 // Otherwise, we have elements from both input vectors, and must zero out
10613 // elements that come from V2 in the first mask, and V1 in the second mask
10614 // so that we can OR them together.
10615 for (unsigned i = 0; i != 16; ++i) {
10616 int EltIdx = MaskVals[i];
10617 if (EltIdx < 0 || EltIdx >= 16)
10618 EltIdx = 0x80;
10619 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10620 }
10621 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
10622 DAG.getNode(ISD::BUILD_VECTOR, dl,
10623 MVT::v16i8, pshufbMask));
10625 // As PSHUFB will zero elements with negative indices, it's safe to ignore
10626 // the 2nd operand if it's undefined or zero.
10627 if (V2.getOpcode() == ISD::UNDEF ||
10628 ISD::isBuildVectorAllZeros(V2.getNode()))
10629 return V1;
10631 // Calculate the shuffle mask for the second input, shuffle it, and
10632 // OR it with the first shuffled input.
10633 pshufbMask.clear();
10634 for (unsigned i = 0; i != 16; ++i) {
10635 int EltIdx = MaskVals[i];
10636 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
10637 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10638 }
10639 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
10640 DAG.getNode(ISD::BUILD_VECTOR, dl,
10641 MVT::v16i8, pshufbMask));
10642 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10643 }
10645 // No SSSE3 - Calculate in place words and then fix all out of place words
10646 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
10647 // the 16 different words that comprise the two doublequadword input vectors.
10648 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10649 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
10650 SDValue NewV = V1;
10651 for (int i = 0; i != 8; ++i) {
10652 int Elt0 = MaskVals[i*2];
10653 int Elt1 = MaskVals[i*2+1];
10655 // This word of the result is all undef, skip it.
10656 if (Elt0 < 0 && Elt1 < 0)
10657 continue;
10659 // This word of the result is already in the correct place, skip it.
10660 if ((Elt0 == i*2) && (Elt1 == i*2+1))
10661 continue;
10663 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
10664 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
10665 SDValue InsElt;
10667 // If Elt0 and Elt1 are defined, are consecutive, and can be load
10668 // using a single extract together, load it and store it.
10669 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
10670 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10671 DAG.getIntPtrConstant(Elt1 / 2));
10672 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10673 DAG.getIntPtrConstant(i));
10674 continue;
10675 }
10677 // If Elt1 is defined, extract it from the appropriate source. If the
10678 // source byte is not also odd, shift the extracted word left 8 bits
10679 // otherwise clear the bottom 8 bits if we need to do an or.
10680 if (Elt1 >= 0) {
10681 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10682 DAG.getIntPtrConstant(Elt1 / 2));
10683 if ((Elt1 & 1) == 0)
10684 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
10685 DAG.getConstant(8,
10686 TLI.getShiftAmountTy(InsElt.getValueType())));
10687 else if (Elt0 >= 0)
10688 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
10689 DAG.getConstant(0xFF00, MVT::i16));
10690 }
10691 // If Elt0 is defined, extract it from the appropriate source. If the
10692 // source byte is not also even, shift the extracted word right 8 bits. If
10693 // Elt1 was also defined, OR the extracted values together before
10694 // inserting them in the result.
10695 if (Elt0 >= 0) {
10696 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
10697 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
10698 if ((Elt0 & 1) != 0)
10699 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
10700 DAG.getConstant(8,
10701 TLI.getShiftAmountTy(InsElt0.getValueType())));
10702 else if (Elt1 >= 0)
10703 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
10704 DAG.getConstant(0x00FF, MVT::i16));
10705 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
10706 : InsElt0;
10707 }
10708 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10709 DAG.getIntPtrConstant(i));
10710 }
10711 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10712 }
10714 // v32i8 shuffles - Translate to VPSHUFB if possible.
10715 static
10716 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10717 const X86Subtarget *Subtarget,
10718 SelectionDAG &DAG) {
10719 MVT VT = SVOp->getSimpleValueType(0);
10720 SDValue V1 = SVOp->getOperand(0);
10721 SDValue V2 = SVOp->getOperand(1);
10722 SDLoc dl(SVOp);
10723 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10725 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10726 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
10727 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
10729 // VPSHUFB may be generated if
10730 // (1) one of input vector is undefined or zeroinitializer.
10731 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
10732 // And (2) the mask indexes don't cross the 128-bit lane.
10733 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
10734 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
10735 return SDValue();
10737 if (V1IsAllZero && !V2IsAllZero) {
10738 CommuteVectorShuffleMask(MaskVals, 32);
10739 V1 = V2;
10740 }
10741 return getPSHUFB(MaskVals, V1, dl, DAG);
10742 }
10744 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
10745 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
10746 /// done when every pair / quad of shuffle mask elements point to elements in
10747 /// the right sequence. e.g.
10748 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
10749 static
10750 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
10751 SelectionDAG &DAG) {
10752 MVT VT = SVOp->getSimpleValueType(0);
10753 SDLoc dl(SVOp);
10754 unsigned NumElems = VT.getVectorNumElements();
10755 MVT NewVT;
10756 unsigned Scale;
10757 switch (VT.SimpleTy) {
10758 default: llvm_unreachable("Unexpected!");
10759 case MVT::v2i64:
10760 case MVT::v2f64:
10761 return SDValue(SVOp, 0);
10762 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
10763 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
10764 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
10765 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
10766 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
10767 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10768 }
10770 SmallVector<int, 8> MaskVec;
10771 for (unsigned i = 0; i != NumElems; i += Scale) {
10772 int StartIdx = -1;
10773 for (unsigned j = 0; j != Scale; ++j) {
10774 int EltIdx = SVOp->getMaskElt(i+j);
10775 if (EltIdx < 0)
10776 continue;
10777 if (StartIdx < 0)
10778 StartIdx = (EltIdx / Scale);
10779 if (EltIdx != (int)(StartIdx*Scale + j))
10780 return SDValue();
10781 }
10782 MaskVec.push_back(StartIdx);
10783 }
10785 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10786 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10787 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10788 }
10790 /// getVZextMovL - Return a zero-extending vector move low node.
10791 ///
10792 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10793 SDValue SrcOp, SelectionDAG &DAG,
10794 const X86Subtarget *Subtarget, SDLoc dl) {
10795 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10796 LoadSDNode *LD = nullptr;
10797 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10798 LD = dyn_cast<LoadSDNode>(SrcOp);
10799 if (!LD) {
10800 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10801 // instead.
10802 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10803 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10804 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10805 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10806 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10807 // PR2108
10808 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10809 return DAG.getNode(ISD::BITCAST, dl, VT,
10810 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10811 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10812 OpVT,
10813 SrcOp.getOperand(0)
10814 .getOperand(0))));
10815 }
10816 }
10817 }
10819 return DAG.getNode(ISD::BITCAST, dl, VT,
10820 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10821 DAG.getNode(ISD::BITCAST, dl,
10822 OpVT, SrcOp)));
10823 }
10825 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10826 /// which could not be matched by any known target speficic shuffle
10827 static SDValue
10828 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10830 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10831 if (NewOp.getNode())
10832 return NewOp;
10834 MVT VT = SVOp->getSimpleValueType(0);
10836 unsigned NumElems = VT.getVectorNumElements();
10837 unsigned NumLaneElems = NumElems / 2;
10839 SDLoc dl(SVOp);
10840 MVT EltVT = VT.getVectorElementType();
10841 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10842 SDValue Output[2];
10844 SmallVector<int, 16> Mask;
10845 for (unsigned l = 0; l < 2; ++l) {
10846 // Build a shuffle mask for the output, discovering on the fly which
10847 // input vectors to use as shuffle operands (recorded in InputUsed).
10848 // If building a suitable shuffle vector proves too hard, then bail
10849 // out with UseBuildVector set.
10850 bool UseBuildVector = false;
10851 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10852 unsigned LaneStart = l * NumLaneElems;
10853 for (unsigned i = 0; i != NumLaneElems; ++i) {
10854 // The mask element. This indexes into the input.
10855 int Idx = SVOp->getMaskElt(i+LaneStart);
10856 if (Idx < 0) {
10857 // the mask element does not index into any input vector.
10858 Mask.push_back(-1);
10859 continue;
10860 }
10862 // The input vector this mask element indexes into.
10863 int Input = Idx / NumLaneElems;
10865 // Turn the index into an offset from the start of the input vector.
10866 Idx -= Input * NumLaneElems;
10868 // Find or create a shuffle vector operand to hold this input.
10869 unsigned OpNo;
10870 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10871 if (InputUsed[OpNo] == Input)
10872 // This input vector is already an operand.
10873 break;
10874 if (InputUsed[OpNo] < 0) {
10875 // Create a new operand for this input vector.
10876 InputUsed[OpNo] = Input;
10877 break;
10878 }
10879 }
10881 if (OpNo >= array_lengthof(InputUsed)) {
10882 // More than two input vectors used! Give up on trying to create a
10883 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10884 UseBuildVector = true;
10885 break;
10886 }
10888 // Add the mask index for the new shuffle vector.
10889 Mask.push_back(Idx + OpNo * NumLaneElems);
10890 }
10892 if (UseBuildVector) {
10893 SmallVector<SDValue, 16> SVOps;
10894 for (unsigned i = 0; i != NumLaneElems; ++i) {
10895 // The mask element. This indexes into the input.
10896 int Idx = SVOp->getMaskElt(i+LaneStart);
10897 if (Idx < 0) {
10898 SVOps.push_back(DAG.getUNDEF(EltVT));
10899 continue;
10900 }
10902 // The input vector this mask element indexes into.
10903 int Input = Idx / NumElems;
10905 // Turn the index into an offset from the start of the input vector.
10906 Idx -= Input * NumElems;
10908 // Extract the vector element by hand.
10909 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
10910 SVOp->getOperand(Input),
10911 DAG.getIntPtrConstant(Idx)));
10912 }
10914 // Construct the output using a BUILD_VECTOR.
10915 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
10916 } else if (InputUsed[0] < 0) {
10917 // No input vectors were used! The result is undefined.
10918 Output[l] = DAG.getUNDEF(NVT);
10919 } else {
10920 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
10921 (InputUsed[0] % 2) * NumLaneElems,
10922 DAG, dl);
10923 // If only one input was used, use an undefined vector for the other.
10924 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
10925 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
10926 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
10927 // At least one input vector was used. Create a new shuffle vector.
10928 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
10929 }
10931 Mask.clear();
10932 }
10934 // Concatenate the result back
10935 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
10936 }
10938 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
10939 /// 4 elements, and match them with several different shuffle types.
10940 static SDValue
10941 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10942 SDValue V1 = SVOp->getOperand(0);
10943 SDValue V2 = SVOp->getOperand(1);
10944 SDLoc dl(SVOp);
10945 MVT VT = SVOp->getSimpleValueType(0);
10947 assert(VT.is128BitVector() && "Unsupported vector size");
10949 std::pair<int, int> Locs[4];
10950 int Mask1[] = { -1, -1, -1, -1 };
10951 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
10953 unsigned NumHi = 0;
10954 unsigned NumLo = 0;
10955 for (unsigned i = 0; i != 4; ++i) {
10956 int Idx = PermMask[i];
10957 if (Idx < 0) {
10958 Locs[i] = std::make_pair(-1, -1);
10959 } else {
10960 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
10961 if (Idx < 4) {
10962 Locs[i] = std::make_pair(0, NumLo);
10963 Mask1[NumLo] = Idx;
10964 NumLo++;
10965 } else {
10966 Locs[i] = std::make_pair(1, NumHi);
10967 if (2+NumHi < 4)
10968 Mask1[2+NumHi] = Idx;
10969 NumHi++;
10970 }
10971 }
10972 }
10974 if (NumLo <= 2 && NumHi <= 2) {
10975 // If no more than two elements come from either vector. This can be
10976 // implemented with two shuffles. First shuffle gather the elements.
10977 // The second shuffle, which takes the first shuffle as both of its
10978 // vector operands, put the elements into the right order.
10979 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10981 int Mask2[] = { -1, -1, -1, -1 };
10983 for (unsigned i = 0; i != 4; ++i)
10984 if (Locs[i].first != -1) {
10985 unsigned Idx = (i < 2) ? 0 : 4;
10986 Idx += Locs[i].first * 2 + Locs[i].second;
10987 Mask2[i] = Idx;
10988 }
10990 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
10991 }
10993 if (NumLo == 3 || NumHi == 3) {
10994 // Otherwise, we must have three elements from one vector, call it X, and
10995 // one element from the other, call it Y. First, use a shufps to build an
10996 // intermediate vector with the one element from Y and the element from X
10997 // that will be in the same half in the final destination (the indexes don't
10998 // matter). Then, use a shufps to build the final vector, taking the half
10999 // containing the element from Y from the intermediate, and the other half
11000 // from X.
11001 if (NumHi == 3) {
11002 // Normalize it so the 3 elements come from V1.
11003 CommuteVectorShuffleMask(PermMask, 4);
11004 std::swap(V1, V2);
11005 }
11007 // Find the element from V2.
11008 unsigned HiIndex;
11009 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
11010 int Val = PermMask[HiIndex];
11011 if (Val < 0)
11012 continue;
11013 if (Val >= 4)
11014 break;
11015 }
11017 Mask1[0] = PermMask[HiIndex];
11018 Mask1[1] = -1;
11019 Mask1[2] = PermMask[HiIndex^1];
11020 Mask1[3] = -1;
11021 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11023 if (HiIndex >= 2) {
11024 Mask1[0] = PermMask[0];
11025 Mask1[1] = PermMask[1];
11026 Mask1[2] = HiIndex & 1 ? 6 : 4;
11027 Mask1[3] = HiIndex & 1 ? 4 : 6;
11028 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11029 }
11031 Mask1[0] = HiIndex & 1 ? 2 : 0;
11032 Mask1[1] = HiIndex & 1 ? 0 : 2;
11033 Mask1[2] = PermMask[2];
11034 Mask1[3] = PermMask[3];
11035 if (Mask1[2] >= 0)
11036 Mask1[2] += 4;
11037 if (Mask1[3] >= 0)
11038 Mask1[3] += 4;
11039 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
11040 }
11042 // Break it into (shuffle shuffle_hi, shuffle_lo).
11043 int LoMask[] = { -1, -1, -1, -1 };
11044 int HiMask[] = { -1, -1, -1, -1 };
11046 int *MaskPtr = LoMask;
11047 unsigned MaskIdx = 0;
11048 unsigned LoIdx = 0;
11049 unsigned HiIdx = 2;
11050 for (unsigned i = 0; i != 4; ++i) {
11051 if (i == 2) {
11052 MaskPtr = HiMask;
11053 MaskIdx = 1;
11054 LoIdx = 0;
11055 HiIdx = 2;
11056 }
11057 int Idx = PermMask[i];
11058 if (Idx < 0) {
11059 Locs[i] = std::make_pair(-1, -1);
11060 } else if (Idx < 4) {
11061 Locs[i] = std::make_pair(MaskIdx, LoIdx);
11062 MaskPtr[LoIdx] = Idx;
11063 LoIdx++;
11064 } else {
11065 Locs[i] = std::make_pair(MaskIdx, HiIdx);
11066 MaskPtr[HiIdx] = Idx;
11067 HiIdx++;
11068 }
11069 }
11071 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
11072 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
11073 int MaskOps[] = { -1, -1, -1, -1 };
11074 for (unsigned i = 0; i != 4; ++i)
11075 if (Locs[i].first != -1)
11076 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
11077 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
11078 }
11080 static bool MayFoldVectorLoad(SDValue V) {
11081 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
11082 V = V.getOperand(0);
11084 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
11085 V = V.getOperand(0);
11086 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
11087 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
11088 // BUILD_VECTOR (load), undef
11089 V = V.getOperand(0);
11091 return MayFoldLoad(V);
11092 }
11094 static
11095 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
11096 MVT VT = Op.getSimpleValueType();
11098 // Canonizalize to v2f64.
11099 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
11100 return DAG.getNode(ISD::BITCAST, dl, VT,
11101 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
11102 V1, DAG));
11103 }
11105 static
11106 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
11107 bool HasSSE2) {
11108 SDValue V1 = Op.getOperand(0);
11109 SDValue V2 = Op.getOperand(1);
11110 MVT VT = Op.getSimpleValueType();
11112 assert(VT != MVT::v2i64 && "unsupported shuffle type");
11114 if (HasSSE2 && VT == MVT::v2f64)
11115 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
11117 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
11118 return DAG.getNode(ISD::BITCAST, dl, VT,
11119 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
11120 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
11121 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
11122 }
11124 static
11125 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
11126 SDValue V1 = Op.getOperand(0);
11127 SDValue V2 = Op.getOperand(1);
11128 MVT VT = Op.getSimpleValueType();
11130 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
11131 "unsupported shuffle type");
11133 if (V2.getOpcode() == ISD::UNDEF)
11134 V2 = V1;
11136 // v4i32 or v4f32
11137 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
11138 }
11140 static
11141 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
11142 SDValue V1 = Op.getOperand(0);
11143 SDValue V2 = Op.getOperand(1);
11144 MVT VT = Op.getSimpleValueType();
11145 unsigned NumElems = VT.getVectorNumElements();
11147 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
11148 // operand of these instructions is only memory, so check if there's a
11149 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
11150 // same masks.
11151 bool CanFoldLoad = false;
11153 // Trivial case, when V2 comes from a load.
11154 if (MayFoldVectorLoad(V2))
11155 CanFoldLoad = true;
11157 // When V1 is a load, it can be folded later into a store in isel, example:
11158 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
11159 // turns into:
11160 // (MOVLPSmr addr:$src1, VR128:$src2)
11161 // So, recognize this potential and also use MOVLPS or MOVLPD
11162 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
11163 CanFoldLoad = true;
11165 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11166 if (CanFoldLoad) {
11167 if (HasSSE2 && NumElems == 2)
11168 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
11170 if (NumElems == 4)
11171 // If we don't care about the second element, proceed to use movss.
11172 if (SVOp->getMaskElt(1) != -1)
11173 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
11174 }
11176 // movl and movlp will both match v2i64, but v2i64 is never matched by
11177 // movl earlier because we make it strict to avoid messing with the movlp load
11178 // folding logic (see the code above getMOVLP call). Match it here then,
11179 // this is horrible, but will stay like this until we move all shuffle
11180 // matching to x86 specific nodes. Note that for the 1st condition all
11181 // types are matched with movsd.
11182 if (HasSSE2) {
11183 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
11184 // as to remove this logic from here, as much as possible
11185 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
11186 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11187 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11188 }
11190 assert(VT != MVT::v4i32 && "unsupported shuffle type");
11192 // Invert the operand order and use SHUFPS to match it.
11193 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
11194 getShuffleSHUFImmediate(SVOp), DAG);
11195 }
11197 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
11198 SelectionDAG &DAG) {
11199 SDLoc dl(Load);
11200 MVT VT = Load->getSimpleValueType(0);
11201 MVT EVT = VT.getVectorElementType();
11202 SDValue Addr = Load->getOperand(1);
11203 SDValue NewAddr = DAG.getNode(
11204 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
11205 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
11207 SDValue NewLoad =
11208 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
11209 DAG.getMachineFunction().getMachineMemOperand(
11210 Load->getMemOperand(), 0, EVT.getStoreSize()));
11211 return NewLoad;
11212 }
11214 // It is only safe to call this function if isINSERTPSMask is true for
11215 // this shufflevector mask.
11216 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
11217 SelectionDAG &DAG) {
11218 // Generate an insertps instruction when inserting an f32 from memory onto a
11219 // v4f32 or when copying a member from one v4f32 to another.
11220 // We also use it for transferring i32 from one register to another,
11221 // since it simply copies the same bits.
11222 // If we're transferring an i32 from memory to a specific element in a
11223 // register, we output a generic DAG that will match the PINSRD
11224 // instruction.
11225 MVT VT = SVOp->getSimpleValueType(0);
11226 MVT EVT = VT.getVectorElementType();
11227 SDValue V1 = SVOp->getOperand(0);
11228 SDValue V2 = SVOp->getOperand(1);
11229 auto Mask = SVOp->getMask();
11230 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
11231 "unsupported vector type for insertps/pinsrd");
11233 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
11234 auto FromV2Predicate = [](const int &i) { return i >= 4; };
11235 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
11237 SDValue From;
11238 SDValue To;
11239 unsigned DestIndex;
11240 if (FromV1 == 1) {
11241 From = V1;
11242 To = V2;
11243 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
11244 Mask.begin();
11246 // If we have 1 element from each vector, we have to check if we're
11247 // changing V1's element's place. If so, we're done. Otherwise, we
11248 // should assume we're changing V2's element's place and behave
11249 // accordingly.
11250 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
11251 assert(DestIndex <= INT32_MAX && "truncated destination index");
11252 if (FromV1 == FromV2 &&
11253 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
11254 From = V2;
11255 To = V1;
11256 DestIndex =
11257 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11258 }
11259 } else {
11260 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
11261 "More than one element from V1 and from V2, or no elements from one "
11262 "of the vectors. This case should not have returned true from "
11263 "isINSERTPSMask");
11264 From = V2;
11265 To = V1;
11266 DestIndex =
11267 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11268 }
11270 // Get an index into the source vector in the range [0,4) (the mask is
11271 // in the range [0,8) because it can address V1 and V2)
11272 unsigned SrcIndex = Mask[DestIndex] % 4;
11273 if (MayFoldLoad(From)) {
11274 // Trivial case, when From comes from a load and is only used by the
11275 // shuffle. Make it use insertps from the vector that we need from that
11276 // load.
11277 SDValue NewLoad =
11278 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
11279 if (!NewLoad.getNode())
11280 return SDValue();
11282 if (EVT == MVT::f32) {
11283 // Create this as a scalar to vector to match the instruction pattern.
11284 SDValue LoadScalarToVector =
11285 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
11286 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
11287 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
11288 InsertpsMask);
11289 } else { // EVT == MVT::i32
11290 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
11291 // instruction, to match the PINSRD instruction, which loads an i32 to a
11292 // certain vector element.
11293 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
11294 DAG.getConstant(DestIndex, MVT::i32));
11295 }
11296 }
11298 // Vector-element-to-vector
11299 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
11300 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
11301 }
11303 // Reduce a vector shuffle to zext.
11304 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
11305 SelectionDAG &DAG) {
11306 // PMOVZX is only available from SSE41.
11307 if (!Subtarget->hasSSE41())
11308 return SDValue();
11310 MVT VT = Op.getSimpleValueType();
11312 // Only AVX2 support 256-bit vector integer extending.
11313 if (!Subtarget->hasInt256() && VT.is256BitVector())
11314 return SDValue();
11316 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11317 SDLoc DL(Op);
11318 SDValue V1 = Op.getOperand(0);
11319 SDValue V2 = Op.getOperand(1);
11320 unsigned NumElems = VT.getVectorNumElements();
11322 // Extending is an unary operation and the element type of the source vector
11323 // won't be equal to or larger than i64.
11324 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
11325 VT.getVectorElementType() == MVT::i64)
11326 return SDValue();
11328 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
11329 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
11330 while ((1U << Shift) < NumElems) {
11331 if (SVOp->getMaskElt(1U << Shift) == 1)
11332 break;
11333 Shift += 1;
11334 // The maximal ratio is 8, i.e. from i8 to i64.
11335 if (Shift > 3)
11336 return SDValue();
11337 }
11339 // Check the shuffle mask.
11340 unsigned Mask = (1U << Shift) - 1;
11341 for (unsigned i = 0; i != NumElems; ++i) {
11342 int EltIdx = SVOp->getMaskElt(i);
11343 if ((i & Mask) != 0 && EltIdx != -1)
11344 return SDValue();
11345 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
11346 return SDValue();
11347 }
11349 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
11350 MVT NeVT = MVT::getIntegerVT(NBits);
11351 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
11353 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
11354 return SDValue();
11356 // Simplify the operand as it's prepared to be fed into shuffle.
11357 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
11358 if (V1.getOpcode() == ISD::BITCAST &&
11359 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
11360 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
11361 V1.getOperand(0).getOperand(0)
11362 .getSimpleValueType().getSizeInBits() == SignificantBits) {
11363 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
11364 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
11365 ConstantSDNode *CIdx =
11366 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
11367 // If it's foldable, i.e. normal load with single use, we will let code
11368 // selection to fold it. Otherwise, we will short the conversion sequence.
11369 if (CIdx && CIdx->getZExtValue() == 0 &&
11370 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
11371 MVT FullVT = V.getSimpleValueType();
11372 MVT V1VT = V1.getSimpleValueType();
11373 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
11374 // The "ext_vec_elt" node is wider than the result node.
11375 // In this case we should extract subvector from V.
11376 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
11377 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
11378 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
11379 FullVT.getVectorNumElements()/Ratio);
11380 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
11381 DAG.getIntPtrConstant(0));
11382 }
11383 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
11384 }
11385 }
11387 return DAG.getNode(ISD::BITCAST, DL, VT,
11388 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
11389 }
11391 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11392 SelectionDAG &DAG) {
11393 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11394 MVT VT = Op.getSimpleValueType();
11395 SDLoc dl(Op);
11396 SDValue V1 = Op.getOperand(0);
11397 SDValue V2 = Op.getOperand(1);
11399 if (isZeroShuffle(SVOp))
11400 return getZeroVector(VT, Subtarget, DAG, dl);
11402 // Handle splat operations
11403 if (SVOp->isSplat()) {
11404 // Use vbroadcast whenever the splat comes from a foldable load
11405 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
11406 if (Broadcast.getNode())
11407 return Broadcast;
11408 }
11410 // Check integer expanding shuffles.
11411 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
11412 if (NewOp.getNode())
11413 return NewOp;
11415 // If the shuffle can be profitably rewritten as a narrower shuffle, then
11416 // do it!
11417 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
11418 VT == MVT::v32i8) {
11419 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11420 if (NewOp.getNode())
11421 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
11422 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
11423 // FIXME: Figure out a cleaner way to do this.
11424 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
11425 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11426 if (NewOp.getNode()) {
11427 MVT NewVT = NewOp.getSimpleValueType();
11428 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
11429 NewVT, true, false))
11430 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
11431 dl);
11432 }
11433 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
11434 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11435 if (NewOp.getNode()) {
11436 MVT NewVT = NewOp.getSimpleValueType();
11437 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
11438 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
11439 dl);
11440 }
11441 }
11442 }
11443 return SDValue();
11444 }
11446 SDValue
11447 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
11448 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11449 SDValue V1 = Op.getOperand(0);
11450 SDValue V2 = Op.getOperand(1);
11451 MVT VT = Op.getSimpleValueType();
11452 SDLoc dl(Op);
11453 unsigned NumElems = VT.getVectorNumElements();
11454 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11455 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11456 bool V1IsSplat = false;
11457 bool V2IsSplat = false;
11458 bool HasSSE2 = Subtarget->hasSSE2();
11459 bool HasFp256 = Subtarget->hasFp256();
11460 bool HasInt256 = Subtarget->hasInt256();
11461 MachineFunction &MF = DAG.getMachineFunction();
11462 bool OptForSize = MF.getFunction()->getAttributes().
11463 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
11465 // Check if we should use the experimental vector shuffle lowering. If so,
11466 // delegate completely to that code path.
11467 if (ExperimentalVectorShuffleLowering)
11468 return lowerVectorShuffle(Op, Subtarget, DAG);
11470 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
11472 if (V1IsUndef && V2IsUndef)
11473 return DAG.getUNDEF(VT);
11475 // When we create a shuffle node we put the UNDEF node to second operand,
11476 // but in some cases the first operand may be transformed to UNDEF.
11477 // In this case we should just commute the node.
11478 if (V1IsUndef)
11479 return DAG.getCommutedVectorShuffle(*SVOp);
11481 // Vector shuffle lowering takes 3 steps:
11482 //
11483 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
11484 // narrowing and commutation of operands should be handled.
11485 // 2) Matching of shuffles with known shuffle masks to x86 target specific
11486 // shuffle nodes.
11487 // 3) Rewriting of unmatched masks into new generic shuffle operations,
11488 // so the shuffle can be broken into other shuffles and the legalizer can
11489 // try the lowering again.
11490 //
11491 // The general idea is that no vector_shuffle operation should be left to
11492 // be matched during isel, all of them must be converted to a target specific
11493 // node here.
11495 // Normalize the input vectors. Here splats, zeroed vectors, profitable
11496 // narrowing and commutation of operands should be handled. The actual code
11497 // doesn't include all of those, work in progress...
11498 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
11499 if (NewOp.getNode())
11500 return NewOp;
11502 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
11504 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
11505 // unpckh_undef). Only use pshufd if speed is more important than size.
11506 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11507 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11508 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11509 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11511 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
11512 V2IsUndef && MayFoldVectorLoad(V1))
11513 return getMOVDDup(Op, dl, V1, DAG);
11515 if (isMOVHLPS_v_undef_Mask(M, VT))
11516 return getMOVHighToLow(Op, dl, DAG);
11518 // Use to match splats
11519 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
11520 (VT == MVT::v2f64 || VT == MVT::v2i64))
11521 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11523 if (isPSHUFDMask(M, VT)) {
11524 // The actual implementation will match the mask in the if above and then
11525 // during isel it can match several different instructions, not only pshufd
11526 // as its name says, sad but true, emulate the behavior for now...
11527 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
11528 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
11530 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
11532 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
11533 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
11535 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
11536 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1, TargetMask,
11537 DAG);
11539 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
11540 TargetMask, DAG);
11541 }
11543 if (isPALIGNRMask(M, VT, Subtarget))
11544 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
11545 getShufflePALIGNRImmediate(SVOp),
11546 DAG);
11548 if (isVALIGNMask(M, VT, Subtarget))
11549 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
11550 getShuffleVALIGNImmediate(SVOp),
11551 DAG);
11553 // Check if this can be converted into a logical shift.
11554 bool isLeft = false;
11555 unsigned ShAmt = 0;
11556 SDValue ShVal;
11557 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
11558 if (isShift && ShVal.hasOneUse()) {
11559 // If the shifted value has multiple uses, it may be cheaper to use
11560 // v_set0 + movlhps or movhlps, etc.
11561 MVT EltVT = VT.getVectorElementType();
11562 ShAmt *= EltVT.getSizeInBits();
11563 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11564 }
11566 if (isMOVLMask(M, VT)) {
11567 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11568 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
11569 if (!isMOVLPMask(M, VT)) {
11570 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
11571 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11573 if (VT == MVT::v4i32 || VT == MVT::v4f32)
11574 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11575 }
11576 }
11578 // FIXME: fold these into legal mask.
11579 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
11580 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
11582 if (isMOVHLPSMask(M, VT))
11583 return getMOVHighToLow(Op, dl, DAG);
11585 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
11586 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
11588 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
11589 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
11591 if (isMOVLPMask(M, VT))
11592 return getMOVLP(Op, dl, DAG, HasSSE2);
11594 if (ShouldXformToMOVHLPS(M, VT) ||
11595 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
11596 return DAG.getCommutedVectorShuffle(*SVOp);
11598 if (isShift) {
11599 // No better options. Use a vshldq / vsrldq.
11600 MVT EltVT = VT.getVectorElementType();
11601 ShAmt *= EltVT.getSizeInBits();
11602 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11603 }
11605 bool Commuted = false;
11606 // FIXME: This should also accept a bitcast of a splat? Be careful, not
11607 // 1,1,1,1 -> v8i16 though.
11608 BitVector UndefElements;
11609 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
11610 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11611 V1IsSplat = true;
11612 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
11613 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11614 V2IsSplat = true;
11616 // Canonicalize the splat or undef, if present, to be on the RHS.
11617 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
11618 CommuteVectorShuffleMask(M, NumElems);
11619 std::swap(V1, V2);
11620 std::swap(V1IsSplat, V2IsSplat);
11621 Commuted = true;
11622 }
11624 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
11625 // Shuffling low element of v1 into undef, just return v1.
11626 if (V2IsUndef)
11627 return V1;
11628 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
11629 // the instruction selector will not match, so get a canonical MOVL with
11630 // swapped operands to undo the commute.
11631 return getMOVL(DAG, dl, VT, V2, V1);
11632 }
11634 if (isUNPCKLMask(M, VT, HasInt256))
11635 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11637 if (isUNPCKHMask(M, VT, HasInt256))
11638 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11640 if (V2IsSplat) {
11641 // Normalize mask so all entries that point to V2 points to its first
11642 // element then try to match unpck{h|l} again. If match, return a
11643 // new vector_shuffle with the corrected mask.p
11644 SmallVector<int, 8> NewMask(M.begin(), M.end());
11645 NormalizeMask(NewMask, NumElems);
11646 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
11647 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11648 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
11649 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11650 }
11652 if (Commuted) {
11653 // Commute is back and try unpck* again.
11654 // FIXME: this seems wrong.
11655 CommuteVectorShuffleMask(M, NumElems);
11656 std::swap(V1, V2);
11657 std::swap(V1IsSplat, V2IsSplat);
11659 if (isUNPCKLMask(M, VT, HasInt256))
11660 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11662 if (isUNPCKHMask(M, VT, HasInt256))
11663 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11664 }
11666 // Normalize the node to match x86 shuffle ops if needed
11667 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
11668 return DAG.getCommutedVectorShuffle(*SVOp);
11670 // The checks below are all present in isShuffleMaskLegal, but they are
11671 // inlined here right now to enable us to directly emit target specific
11672 // nodes, and remove one by one until they don't return Op anymore.
11674 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
11675 SVOp->getSplatIndex() == 0 && V2IsUndef) {
11676 if (VT == MVT::v2f64 || VT == MVT::v2i64)
11677 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11678 }
11680 if (isPSHUFHWMask(M, VT, HasInt256))
11681 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
11682 getShufflePSHUFHWImmediate(SVOp),
11683 DAG);
11685 if (isPSHUFLWMask(M, VT, HasInt256))
11686 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
11687 getShufflePSHUFLWImmediate(SVOp),
11688 DAG);
11690 unsigned MaskValue;
11691 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
11692 &MaskValue))
11693 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
11695 if (isSHUFPMask(M, VT))
11696 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
11697 getShuffleSHUFImmediate(SVOp), DAG);
11699 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11700 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11701 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11702 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11704 //===--------------------------------------------------------------------===//
11705 // Generate target specific nodes for 128 or 256-bit shuffles only
11706 // supported in the AVX instruction set.
11707 //
11709 // Handle VMOVDDUPY permutations
11710 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11711 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11713 // Handle VPERMILPS/D* permutations
11714 if (isVPERMILPMask(M, VT)) {
11715 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11716 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11717 getShuffleSHUFImmediate(SVOp), DAG);
11718 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1,
11719 getShuffleSHUFImmediate(SVOp), DAG);
11720 }
11722 unsigned Idx;
11723 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11724 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11725 Idx*(NumElems/2), DAG, dl);
11727 // Handle VPERM2F128/VPERM2I128 permutations
11728 if (isVPERM2X128Mask(M, VT, HasFp256))
11729 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11730 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11732 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11733 return getINSERTPS(SVOp, dl, DAG);
11735 unsigned Imm8;
11736 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11737 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11739 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11740 VT.is512BitVector()) {
11741 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11742 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11743 SmallVector<SDValue, 16> permclMask;
11744 for (unsigned i = 0; i != NumElems; ++i) {
11745 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11746 }
11748 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11749 if (V2IsUndef)
11750 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11751 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11752 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11753 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11754 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
11755 }
11757 //===--------------------------------------------------------------------===//
11758 // Since no target specific shuffle was selected for this generic one,
11759 // lower it into other known shuffles. FIXME: this isn't true yet, but
11760 // this is the plan.
11761 //
11763 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
11764 if (VT == MVT::v8i16) {
11765 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
11766 if (NewOp.getNode())
11767 return NewOp;
11768 }
11770 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11771 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11772 if (NewOp.getNode())
11773 return NewOp;
11774 }
11776 if (VT == MVT::v16i8) {
11777 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11778 if (NewOp.getNode())
11779 return NewOp;
11780 }
11782 if (VT == MVT::v32i8) {
11783 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11784 if (NewOp.getNode())
11785 return NewOp;
11786 }
11788 // Handle all 128-bit wide vectors with 4 elements, and match them with
11789 // several different shuffle types.
11790 if (NumElems == 4 && VT.is128BitVector())
11791 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11793 // Handle general 256-bit shuffles
11794 if (VT.is256BitVector())
11795 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11797 return SDValue();
11798 }
11800 /// \brief Try to lower a VSELECT instruction to an immediate-controlled blend
11801 /// instruction.
11802 static SDValue lowerVSELECTtoBLENDI(SDValue Op, const X86Subtarget *Subtarget,
11803 SelectionDAG &DAG) {
11804 SDValue Cond = Op.getOperand(0);
11805 SDValue LHS = Op.getOperand(1);
11806 SDValue RHS = Op.getOperand(2);
11807 SDLoc DL(Op);
11808 MVT VT = Op.getSimpleValueType();
11809 MVT EltVT = VT.getVectorElementType();
11811 // There is no blend with immediate in AVX-512.
11812 if (VT.is512BitVector())
11813 return SDValue();
11815 // No blend instruction before SSE4.1.
11816 if (!Subtarget->hasSSE41())
11817 return SDValue();
11818 // There is no byte-blend immediate controlled instruction.
11819 if (EltVT == MVT::i8)
11820 return SDValue();
11822 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11823 return SDValue();
11825 auto *CondBV = cast<BuildVectorSDNode>(Cond);
11827 unsigned BlendMask = 0;
11828 MVT BlendVT = VT;
11829 if (VT == MVT::v16i16) {
11830 // v16i16 blends are completely special. We can only do them when we have
11831 // a repeated blend across the two 128-bit halves and we have AVX2.
11832 if (!Subtarget->hasAVX2())
11833 return SDValue();
11835 for (int i = 0; i < 8; ++i) {
11836 SDValue Lo = CondBV->getOperand(i);
11837 SDValue Hi = CondBV->getOperand(i + 8);
11838 bool IsLoZero = X86::isZeroNode(Lo);
11839 bool IsHiZero = X86::isZeroNode(Hi);
11840 if (Lo->getOpcode() != ISD::UNDEF && Hi->getOpcode() != ISD::UNDEF &&
11841 IsLoZero != IsHiZero)
11842 // Asymmetric blends, bail.
11843 return SDValue();
11844 BlendMask |= (unsigned)(IsLoZero || IsHiZero) << i;
11845 }
11846 } else {
11847 // Everything else uses a generic blend mask computation with a custom type.
11848 if (VT.isInteger()) {
11849 if (VT.is256BitVector())
11850 // We cast to floating point types if integer blends aren't available,
11851 // and we coerce integer blends when available to occur on the v8i32
11852 // type.
11853 BlendVT = Subtarget->hasAVX2()
11854 ? MVT::v8i32
11855 : MVT::getVectorVT(
11856 MVT::getFloatingPointVT(VT.getScalarSizeInBits()),
11857 VT.getVectorNumElements());
11858 else
11859 // For 128-bit vectors we do the blend on v8i16 types.
11860 BlendVT = MVT::v8i16;
11861 }
11862 assert(BlendVT.getVectorNumElements() <= 8 &&
11863 "Cannot blend more than 8 elements with an immediate!");
11864 // Scale the blend mask based on the number of elements in the selected
11865 // blend type.
11866 int Scale = BlendVT.getVectorNumElements() / VT.getVectorNumElements();
11867 for (int i = 0, e = CondBV->getNumOperands(); i < e; ++i) {
11868 SDValue CondElement = CondBV->getOperand(i);
11869 if (CondElement->getOpcode() != ISD::UNDEF &&
11870 X86::isZeroNode(CondElement))
11871 for (int j = 0; j < Scale; ++j)
11872 BlendMask |= 1u << (i * Scale + j);
11873 }
11874 }
11876 LHS = DAG.getNode(ISD::BITCAST, DL, BlendVT, LHS);
11877 RHS = DAG.getNode(ISD::BITCAST, DL, BlendVT, RHS);
11879 return DAG.getNode(ISD::BITCAST, DL, VT,
11880 DAG.getNode(X86ISD::BLENDI, DL, BlendVT, LHS, RHS,
11881 DAG.getConstant(BlendMask, MVT::i8)));
11882 }
11884 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11885 // A vselect where all conditions and data are constants can be optimized into
11886 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11887 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11888 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11889 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11890 return SDValue();
11892 SDValue BlendOp = lowerVSELECTtoBLENDI(Op, Subtarget, DAG);
11893 if (BlendOp.getNode())
11894 return BlendOp;
11896 // Some types for vselect were previously set to Expand, not Legal or
11897 // Custom. Return an empty SDValue so we fall-through to Expand, after
11898 // the Custom lowering phase.
11899 MVT VT = Op.getSimpleValueType();
11900 switch (VT.SimpleTy) {
11901 default:
11902 break;
11903 case MVT::v8i16:
11904 case MVT::v16i16:
11905 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11906 break;
11907 return SDValue();
11908 }
11910 // We couldn't create a "Blend with immediate" node.
11911 // This node should still be legal, but we'll have to emit a blendv*
11912 // instruction.
11913 return Op;
11914 }
11916 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11917 MVT VT = Op.getSimpleValueType();
11918 SDLoc dl(Op);
11920 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11921 return SDValue();
11923 if (VT.getSizeInBits() == 8) {
11924 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11925 Op.getOperand(0), Op.getOperand(1));
11926 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11927 DAG.getValueType(VT));
11928 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11929 }
11931 if (VT.getSizeInBits() == 16) {
11932 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11933 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11934 if (Idx == 0)
11935 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11936 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11937 DAG.getNode(ISD::BITCAST, dl,
11938 MVT::v4i32,
11939 Op.getOperand(0)),
11940 Op.getOperand(1)));
11941 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11942 Op.getOperand(0), Op.getOperand(1));
11943 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11944 DAG.getValueType(VT));
11945 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11946 }
11948 if (VT == MVT::f32) {
11949 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11950 // the result back to FR32 register. It's only worth matching if the
11951 // result has a single use which is a store or a bitcast to i32. And in
11952 // the case of a store, it's not worth it if the index is a constant 0,
11953 // because a MOVSSmr can be used instead, which is smaller and faster.
11954 if (!Op.hasOneUse())
11955 return SDValue();
11956 SDNode *User = *Op.getNode()->use_begin();
11957 if ((User->getOpcode() != ISD::STORE ||
11958 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11959 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11960 (User->getOpcode() != ISD::BITCAST ||
11961 User->getValueType(0) != MVT::i32))
11962 return SDValue();
11963 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11964 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
11965 Op.getOperand(0)),
11966 Op.getOperand(1));
11967 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
11968 }
11970 if (VT == MVT::i32 || VT == MVT::i64) {
11971 // ExtractPS/pextrq works with constant index.
11972 if (isa<ConstantSDNode>(Op.getOperand(1)))
11973 return Op;
11974 }
11975 return SDValue();
11976 }
11978 /// Extract one bit from mask vector, like v16i1 or v8i1.
11979 /// AVX-512 feature.
11980 SDValue
11981 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11982 SDValue Vec = Op.getOperand(0);
11983 SDLoc dl(Vec);
11984 MVT VecVT = Vec.getSimpleValueType();
11985 SDValue Idx = Op.getOperand(1);
11986 MVT EltVT = Op.getSimpleValueType();
11988 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11990 // variable index can't be handled in mask registers,
11991 // extend vector to VR512
11992 if (!isa<ConstantSDNode>(Idx)) {
11993 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11994 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11995 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11996 ExtVT.getVectorElementType(), Ext, Idx);
11997 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11998 }
12000 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12001 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12002 unsigned MaxSift = rc->getSize()*8 - 1;
12003 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
12004 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12005 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
12006 DAG.getConstant(MaxSift, MVT::i8));
12007 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
12008 DAG.getIntPtrConstant(0));
12009 }
12011 SDValue
12012 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
12013 SelectionDAG &DAG) const {
12014 SDLoc dl(Op);
12015 SDValue Vec = Op.getOperand(0);
12016 MVT VecVT = Vec.getSimpleValueType();
12017 SDValue Idx = Op.getOperand(1);
12019 if (Op.getSimpleValueType() == MVT::i1)
12020 return ExtractBitFromMaskVector(Op, DAG);
12022 if (!isa<ConstantSDNode>(Idx)) {
12023 if (VecVT.is512BitVector() ||
12024 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
12025 VecVT.getVectorElementType().getSizeInBits() == 32)) {
12027 MVT MaskEltVT =
12028 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
12029 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
12030 MaskEltVT.getSizeInBits());
12032 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
12033 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
12034 getZeroVector(MaskVT, Subtarget, DAG, dl),
12035 Idx, DAG.getConstant(0, getPointerTy()));
12036 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
12037 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
12038 Perm, DAG.getConstant(0, getPointerTy()));
12039 }
12040 return SDValue();
12041 }
12043 // If this is a 256-bit vector result, first extract the 128-bit vector and
12044 // then extract the element from the 128-bit vector.
12045 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
12047 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12048 // Get the 128-bit vector.
12049 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
12050 MVT EltVT = VecVT.getVectorElementType();
12052 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
12054 //if (IdxVal >= NumElems/2)
12055 // IdxVal -= NumElems/2;
12056 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
12057 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
12058 DAG.getConstant(IdxVal, MVT::i32));
12059 }
12061 assert(VecVT.is128BitVector() && "Unexpected vector length");
12063 if (Subtarget->hasSSE41()) {
12064 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
12065 if (Res.getNode())
12066 return Res;
12067 }
12069 MVT VT = Op.getSimpleValueType();
12070 // TODO: handle v16i8.
12071 if (VT.getSizeInBits() == 16) {
12072 SDValue Vec = Op.getOperand(0);
12073 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12074 if (Idx == 0)
12075 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12076 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12077 DAG.getNode(ISD::BITCAST, dl,
12078 MVT::v4i32, Vec),
12079 Op.getOperand(1)));
12080 // Transform it so it match pextrw which produces a 32-bit result.
12081 MVT EltVT = MVT::i32;
12082 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
12083 Op.getOperand(0), Op.getOperand(1));
12084 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
12085 DAG.getValueType(VT));
12086 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12087 }
12089 if (VT.getSizeInBits() == 32) {
12090 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12091 if (Idx == 0)
12092 return Op;
12094 // SHUFPS the element to the lowest double word, then movss.
12095 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
12096 MVT VVT = Op.getOperand(0).getSimpleValueType();
12097 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12098 DAG.getUNDEF(VVT), Mask);
12099 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12100 DAG.getIntPtrConstant(0));
12101 }
12103 if (VT.getSizeInBits() == 64) {
12104 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
12105 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
12106 // to match extract_elt for f64.
12107 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12108 if (Idx == 0)
12109 return Op;
12111 // UNPCKHPD the element to the lowest double word, then movsd.
12112 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
12113 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
12114 int Mask[2] = { 1, -1 };
12115 MVT VVT = Op.getOperand(0).getSimpleValueType();
12116 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12117 DAG.getUNDEF(VVT), Mask);
12118 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12119 DAG.getIntPtrConstant(0));
12120 }
12122 return SDValue();
12123 }
12125 /// Insert one bit to mask vector, like v16i1 or v8i1.
12126 /// AVX-512 feature.
12127 SDValue
12128 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
12129 SDLoc dl(Op);
12130 SDValue Vec = Op.getOperand(0);
12131 SDValue Elt = Op.getOperand(1);
12132 SDValue Idx = Op.getOperand(2);
12133 MVT VecVT = Vec.getSimpleValueType();
12135 if (!isa<ConstantSDNode>(Idx)) {
12136 // Non constant index. Extend source and destination,
12137 // insert element and then truncate the result.
12138 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12139 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
12140 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
12141 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
12142 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
12143 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
12144 }
12146 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12147 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
12148 if (Vec.getOpcode() == ISD::UNDEF)
12149 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12150 DAG.getConstant(IdxVal, MVT::i8));
12151 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12152 unsigned MaxSift = rc->getSize()*8 - 1;
12153 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12154 DAG.getConstant(MaxSift, MVT::i8));
12155 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
12156 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12157 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
12158 }
12160 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
12161 SelectionDAG &DAG) const {
12162 MVT VT = Op.getSimpleValueType();
12163 MVT EltVT = VT.getVectorElementType();
12165 if (EltVT == MVT::i1)
12166 return InsertBitToMaskVector(Op, DAG);
12168 SDLoc dl(Op);
12169 SDValue N0 = Op.getOperand(0);
12170 SDValue N1 = Op.getOperand(1);
12171 SDValue N2 = Op.getOperand(2);
12172 if (!isa<ConstantSDNode>(N2))
12173 return SDValue();
12174 auto *N2C = cast<ConstantSDNode>(N2);
12175 unsigned IdxVal = N2C->getZExtValue();
12177 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
12178 // into that, and then insert the subvector back into the result.
12179 if (VT.is256BitVector() || VT.is512BitVector()) {
12180 // Get the desired 128-bit vector half.
12181 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
12183 // Insert the element into the desired half.
12184 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
12185 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
12187 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
12188 DAG.getConstant(IdxIn128, MVT::i32));
12190 // Insert the changed part back to the 256-bit vector
12191 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
12192 }
12193 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
12195 if (Subtarget->hasSSE41()) {
12196 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
12197 unsigned Opc;
12198 if (VT == MVT::v8i16) {
12199 Opc = X86ISD::PINSRW;
12200 } else {
12201 assert(VT == MVT::v16i8);
12202 Opc = X86ISD::PINSRB;
12203 }
12205 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
12206 // argument.
12207 if (N1.getValueType() != MVT::i32)
12208 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12209 if (N2.getValueType() != MVT::i32)
12210 N2 = DAG.getIntPtrConstant(IdxVal);
12211 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
12212 }
12214 if (EltVT == MVT::f32) {
12215 // Bits [7:6] of the constant are the source select. This will always be
12216 // zero here. The DAG Combiner may combine an extract_elt index into
12217 // these
12218 // bits. For example (insert (extract, 3), 2) could be matched by
12219 // putting
12220 // the '3' into bits [7:6] of X86ISD::INSERTPS.
12221 // Bits [5:4] of the constant are the destination select. This is the
12222 // value of the incoming immediate.
12223 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
12224 // combine either bitwise AND or insert of float 0.0 to set these bits.
12225 N2 = DAG.getIntPtrConstant(IdxVal << 4);
12226 // Create this as a scalar to vector..
12227 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
12228 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
12229 }
12231 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
12232 // PINSR* works with constant index.
12233 return Op;
12234 }
12235 }
12237 if (EltVT == MVT::i8)
12238 return SDValue();
12240 if (EltVT.getSizeInBits() == 16) {
12241 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
12242 // as its second argument.
12243 if (N1.getValueType() != MVT::i32)
12244 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12245 if (N2.getValueType() != MVT::i32)
12246 N2 = DAG.getIntPtrConstant(IdxVal);
12247 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
12248 }
12249 return SDValue();
12250 }
12252 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
12253 SDLoc dl(Op);
12254 MVT OpVT = Op.getSimpleValueType();
12256 // If this is a 256-bit vector result, first insert into a 128-bit
12257 // vector and then insert into the 256-bit vector.
12258 if (!OpVT.is128BitVector()) {
12259 // Insert into a 128-bit vector.
12260 unsigned SizeFactor = OpVT.getSizeInBits()/128;
12261 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
12262 OpVT.getVectorNumElements() / SizeFactor);
12264 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
12266 // Insert the 128-bit vector.
12267 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
12268 }
12270 if (OpVT == MVT::v1i64 &&
12271 Op.getOperand(0).getValueType() == MVT::i64)
12272 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
12274 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
12275 assert(OpVT.is128BitVector() && "Expected an SSE type!");
12276 return DAG.getNode(ISD::BITCAST, dl, OpVT,
12277 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
12278 }
12280 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
12281 // a simple subregister reference or explicit instructions to grab
12282 // upper bits of a vector.
12283 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12284 SelectionDAG &DAG) {
12285 SDLoc dl(Op);
12286 SDValue In = Op.getOperand(0);
12287 SDValue Idx = Op.getOperand(1);
12288 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12289 MVT ResVT = Op.getSimpleValueType();
12290 MVT InVT = In.getSimpleValueType();
12292 if (Subtarget->hasFp256()) {
12293 if (ResVT.is128BitVector() &&
12294 (InVT.is256BitVector() || InVT.is512BitVector()) &&
12295 isa<ConstantSDNode>(Idx)) {
12296 return Extract128BitVector(In, IdxVal, DAG, dl);
12297 }
12298 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
12299 isa<ConstantSDNode>(Idx)) {
12300 return Extract256BitVector(In, IdxVal, DAG, dl);
12301 }
12302 }
12303 return SDValue();
12304 }
12306 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
12307 // simple superregister reference or explicit instructions to insert
12308 // the upper bits of a vector.
12309 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12310 SelectionDAG &DAG) {
12311 if (Subtarget->hasFp256()) {
12312 SDLoc dl(Op.getNode());
12313 SDValue Vec = Op.getNode()->getOperand(0);
12314 SDValue SubVec = Op.getNode()->getOperand(1);
12315 SDValue Idx = Op.getNode()->getOperand(2);
12317 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
12318 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
12319 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
12320 isa<ConstantSDNode>(Idx)) {
12321 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12322 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
12323 }
12325 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
12326 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
12327 isa<ConstantSDNode>(Idx)) {
12328 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12329 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
12330 }
12331 }
12332 return SDValue();
12333 }
12335 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
12336 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
12337 // one of the above mentioned nodes. It has to be wrapped because otherwise
12338 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
12339 // be used to form addressing mode. These wrapped nodes will be selected
12340 // into MOV32ri.
12341 SDValue
12342 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
12343 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
12345 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12346 // global base reg.
12347 unsigned char OpFlag = 0;
12348 unsigned WrapperKind = X86ISD::Wrapper;
12349 CodeModel::Model M = DAG.getTarget().getCodeModel();
12351 if (Subtarget->isPICStyleRIPRel() &&
12352 (M == CodeModel::Small || M == CodeModel::Kernel))
12353 WrapperKind = X86ISD::WrapperRIP;
12354 else if (Subtarget->isPICStyleGOT())
12355 OpFlag = X86II::MO_GOTOFF;
12356 else if (Subtarget->isPICStyleStubPIC())
12357 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12359 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
12360 CP->getAlignment(),
12361 CP->getOffset(), OpFlag);
12362 SDLoc DL(CP);
12363 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12364 // With PIC, the address is actually $g + Offset.
12365 if (OpFlag) {
12366 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12367 DAG.getNode(X86ISD::GlobalBaseReg,
12368 SDLoc(), getPointerTy()),
12369 Result);
12370 }
12372 return Result;
12373 }
12375 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
12376 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
12378 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12379 // global base reg.
12380 unsigned char OpFlag = 0;
12381 unsigned WrapperKind = X86ISD::Wrapper;
12382 CodeModel::Model M = DAG.getTarget().getCodeModel();
12384 if (Subtarget->isPICStyleRIPRel() &&
12385 (M == CodeModel::Small || M == CodeModel::Kernel))
12386 WrapperKind = X86ISD::WrapperRIP;
12387 else if (Subtarget->isPICStyleGOT())
12388 OpFlag = X86II::MO_GOTOFF;
12389 else if (Subtarget->isPICStyleStubPIC())
12390 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12392 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
12393 OpFlag);
12394 SDLoc DL(JT);
12395 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12397 // With PIC, the address is actually $g + Offset.
12398 if (OpFlag)
12399 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12400 DAG.getNode(X86ISD::GlobalBaseReg,
12401 SDLoc(), getPointerTy()),
12402 Result);
12404 return Result;
12405 }
12407 SDValue
12408 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
12409 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
12411 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12412 // global base reg.
12413 unsigned char OpFlag = 0;
12414 unsigned WrapperKind = X86ISD::Wrapper;
12415 CodeModel::Model M = DAG.getTarget().getCodeModel();
12417 if (Subtarget->isPICStyleRIPRel() &&
12418 (M == CodeModel::Small || M == CodeModel::Kernel)) {
12419 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
12420 OpFlag = X86II::MO_GOTPCREL;
12421 WrapperKind = X86ISD::WrapperRIP;
12422 } else if (Subtarget->isPICStyleGOT()) {
12423 OpFlag = X86II::MO_GOT;
12424 } else if (Subtarget->isPICStyleStubPIC()) {
12425 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12426 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12427 OpFlag = X86II::MO_DARWIN_NONLAZY;
12428 }
12430 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
12432 SDLoc DL(Op);
12433 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12435 // With PIC, the address is actually $g + Offset.
12436 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12437 !Subtarget->is64Bit()) {
12438 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12439 DAG.getNode(X86ISD::GlobalBaseReg,
12440 SDLoc(), getPointerTy()),
12441 Result);
12442 }
12444 // For symbols that require a load from a stub to get the address, emit the
12445 // load.
12446 if (isGlobalStubReference(OpFlag))
12447 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
12448 MachinePointerInfo::getGOT(), false, false, false, 0);
12450 return Result;
12451 }
12453 SDValue
12454 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12455 // Create the TargetBlockAddressAddress node.
12456 unsigned char OpFlags =
12457 Subtarget->ClassifyBlockAddressReference();
12458 CodeModel::Model M = DAG.getTarget().getCodeModel();
12459 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12460 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12461 SDLoc dl(Op);
12462 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
12463 OpFlags);
12465 if (Subtarget->isPICStyleRIPRel() &&
12466 (M == CodeModel::Small || M == CodeModel::Kernel))
12467 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12468 else
12469 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12471 // With PIC, the address is actually $g + Offset.
12472 if (isGlobalRelativeToPICBase(OpFlags)) {
12473 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12474 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12475 Result);
12476 }
12478 return Result;
12479 }
12481 SDValue
12482 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12483 int64_t Offset, SelectionDAG &DAG) const {
12484 // Create the TargetGlobalAddress node, folding in the constant
12485 // offset if it is legal.
12486 unsigned char OpFlags =
12487 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12488 CodeModel::Model M = DAG.getTarget().getCodeModel();
12489 SDValue Result;
12490 if (OpFlags == X86II::MO_NO_FLAG &&
12491 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12492 // A direct static reference to a global.
12493 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
12494 Offset = 0;
12495 } else {
12496 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
12497 }
12499 if (Subtarget->isPICStyleRIPRel() &&
12500 (M == CodeModel::Small || M == CodeModel::Kernel))
12501 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12502 else
12503 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12505 // With PIC, the address is actually $g + Offset.
12506 if (isGlobalRelativeToPICBase(OpFlags)) {
12507 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12508 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12509 Result);
12510 }
12512 // For globals that require a load from a stub to get the address, emit the
12513 // load.
12514 if (isGlobalStubReference(OpFlags))
12515 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
12516 MachinePointerInfo::getGOT(), false, false, false, 0);
12518 // If there was a non-zero offset that we didn't fold, create an explicit
12519 // addition for it.
12520 if (Offset != 0)
12521 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
12522 DAG.getConstant(Offset, getPointerTy()));
12524 return Result;
12525 }
12527 SDValue
12528 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12529 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12530 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12531 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12532 }
12534 static SDValue
12535 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12536 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12537 unsigned char OperandFlags, bool LocalDynamic = false) {
12538 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12539 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12540 SDLoc dl(GA);
12541 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12542 GA->getValueType(0),
12543 GA->getOffset(),
12544 OperandFlags);
12546 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12547 : X86ISD::TLSADDR;
12549 if (InFlag) {
12550 SDValue Ops[] = { Chain, TGA, *InFlag };
12551 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12552 } else {
12553 SDValue Ops[] = { Chain, TGA };
12554 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12555 }
12557 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12558 MFI->setAdjustsStack(true);
12560 SDValue Flag = Chain.getValue(1);
12561 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12562 }
12564 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12565 static SDValue
12566 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12567 const EVT PtrVT) {
12568 SDValue InFlag;
12569 SDLoc dl(GA); // ? function entry point might be better
12570 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12571 DAG.getNode(X86ISD::GlobalBaseReg,
12572 SDLoc(), PtrVT), InFlag);
12573 InFlag = Chain.getValue(1);
12575 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12576 }
12578 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12579 static SDValue
12580 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12581 const EVT PtrVT) {
12582 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12583 X86::RAX, X86II::MO_TLSGD);
12584 }
12586 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12587 SelectionDAG &DAG,
12588 const EVT PtrVT,
12589 bool is64Bit) {
12590 SDLoc dl(GA);
12592 // Get the start address of the TLS block for this module.
12593 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12594 .getInfo<X86MachineFunctionInfo>();
12595 MFI->incNumLocalDynamicTLSAccesses();
12597 SDValue Base;
12598 if (is64Bit) {
12599 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12600 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12601 } else {
12602 SDValue InFlag;
12603 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12604 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12605 InFlag = Chain.getValue(1);
12606 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12607 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12608 }
12610 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12611 // of Base.
12613 // Build x@dtpoff.
12614 unsigned char OperandFlags = X86II::MO_DTPOFF;
12615 unsigned WrapperKind = X86ISD::Wrapper;
12616 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12617 GA->getValueType(0),
12618 GA->getOffset(), OperandFlags);
12619 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12621 // Add x@dtpoff with the base.
12622 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12623 }
12625 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12626 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12627 const EVT PtrVT, TLSModel::Model model,
12628 bool is64Bit, bool isPIC) {
12629 SDLoc dl(GA);
12631 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12632 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12633 is64Bit ? 257 : 256));
12635 SDValue ThreadPointer =
12636 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
12637 MachinePointerInfo(Ptr), false, false, false, 0);
12639 unsigned char OperandFlags = 0;
12640 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12641 // initialexec.
12642 unsigned WrapperKind = X86ISD::Wrapper;
12643 if (model == TLSModel::LocalExec) {
12644 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12645 } else if (model == TLSModel::InitialExec) {
12646 if (is64Bit) {
12647 OperandFlags = X86II::MO_GOTTPOFF;
12648 WrapperKind = X86ISD::WrapperRIP;
12649 } else {
12650 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12651 }
12652 } else {
12653 llvm_unreachable("Unexpected model");
12654 }
12656 // emit "addl x@ntpoff,%eax" (local exec)
12657 // or "addl x@indntpoff,%eax" (initial exec)
12658 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12659 SDValue TGA =
12660 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12661 GA->getOffset(), OperandFlags);
12662 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12664 if (model == TLSModel::InitialExec) {
12665 if (isPIC && !is64Bit) {
12666 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12667 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12668 Offset);
12669 }
12671 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12672 MachinePointerInfo::getGOT(), false, false, false, 0);
12673 }
12675 // The address of the thread local variable is the add of the thread
12676 // pointer with the offset of the variable.
12677 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12678 }
12680 SDValue
12681 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12683 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12684 const GlobalValue *GV = GA->getGlobal();
12686 if (Subtarget->isTargetELF()) {
12687 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12689 switch (model) {
12690 case TLSModel::GeneralDynamic:
12691 if (Subtarget->is64Bit())
12692 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
12693 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
12694 case TLSModel::LocalDynamic:
12695 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
12696 Subtarget->is64Bit());
12697 case TLSModel::InitialExec:
12698 case TLSModel::LocalExec:
12699 return LowerToTLSExecModel(
12700 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
12701 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
12702 }
12703 llvm_unreachable("Unknown TLS model.");
12704 }
12706 if (Subtarget->isTargetDarwin()) {
12707 // Darwin only has one model of TLS. Lower to that.
12708 unsigned char OpFlag = 0;
12709 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12710 X86ISD::WrapperRIP : X86ISD::Wrapper;
12712 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12713 // global base reg.
12714 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12715 !Subtarget->is64Bit();
12716 if (PIC32)
12717 OpFlag = X86II::MO_TLVP_PIC_BASE;
12718 else
12719 OpFlag = X86II::MO_TLVP;
12720 SDLoc DL(Op);
12721 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12722 GA->getValueType(0),
12723 GA->getOffset(), OpFlag);
12724 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12726 // With PIC32, the address is actually $g + Offset.
12727 if (PIC32)
12728 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12729 DAG.getNode(X86ISD::GlobalBaseReg,
12730 SDLoc(), getPointerTy()),
12731 Offset);
12733 // Lowering the machine isd will make sure everything is in the right
12734 // location.
12735 SDValue Chain = DAG.getEntryNode();
12736 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12737 SDValue Args[] = { Chain, Offset };
12738 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12740 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12741 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12742 MFI->setAdjustsStack(true);
12744 // And our return value (tls address) is in the standard call return value
12745 // location.
12746 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12747 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12748 Chain.getValue(1));
12749 }
12751 if (Subtarget->isTargetKnownWindowsMSVC() ||
12752 Subtarget->isTargetWindowsGNU()) {
12753 // Just use the implicit TLS architecture
12754 // Need to generate someting similar to:
12755 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12756 // ; from TEB
12757 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12758 // mov rcx, qword [rdx+rcx*8]
12759 // mov eax, .tls$:tlsvar
12760 // [rax+rcx] contains the address
12761 // Windows 64bit: gs:0x58
12762 // Windows 32bit: fs:__tls_array
12764 SDLoc dl(GA);
12765 SDValue Chain = DAG.getEntryNode();
12767 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12768 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12769 // use its literal value of 0x2C.
12770 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12771 ? Type::getInt8PtrTy(*DAG.getContext(),
12772 256)
12773 : Type::getInt32PtrTy(*DAG.getContext(),
12774 257));
12776 SDValue TlsArray =
12777 Subtarget->is64Bit()
12778 ? DAG.getIntPtrConstant(0x58)
12779 : (Subtarget->isTargetWindowsGNU()
12780 ? DAG.getIntPtrConstant(0x2C)
12781 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12783 SDValue ThreadPointer =
12784 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12785 MachinePointerInfo(Ptr), false, false, false, 0);
12787 // Load the _tls_index variable
12788 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12789 if (Subtarget->is64Bit())
12790 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12791 IDX, MachinePointerInfo(), MVT::i32,
12792 false, false, false, 0);
12793 else
12794 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12795 false, false, false, 0);
12797 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12798 getPointerTy());
12799 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12801 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12802 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12803 false, false, false, 0);
12805 // Get the offset of start of .tls section
12806 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12807 GA->getValueType(0),
12808 GA->getOffset(), X86II::MO_SECREL);
12809 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12811 // The address of the thread local variable is the add of the thread
12812 // pointer with the offset of the variable.
12813 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12814 }
12816 llvm_unreachable("TLS not implemented for this target.");
12817 }
12819 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12820 /// and take a 2 x i32 value to shift plus a shift amount.
12821 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12822 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12823 MVT VT = Op.getSimpleValueType();
12824 unsigned VTBits = VT.getSizeInBits();
12825 SDLoc dl(Op);
12826 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12827 SDValue ShOpLo = Op.getOperand(0);
12828 SDValue ShOpHi = Op.getOperand(1);
12829 SDValue ShAmt = Op.getOperand(2);
12830 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12831 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12832 // during isel.
12833 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12834 DAG.getConstant(VTBits - 1, MVT::i8));
12835 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12836 DAG.getConstant(VTBits - 1, MVT::i8))
12837 : DAG.getConstant(0, VT);
12839 SDValue Tmp2, Tmp3;
12840 if (Op.getOpcode() == ISD::SHL_PARTS) {
12841 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12842 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12843 } else {
12844 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12845 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12846 }
12848 // If the shift amount is larger or equal than the width of a part we can't
12849 // rely on the results of shld/shrd. Insert a test and select the appropriate
12850 // values for large shift amounts.
12851 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12852 DAG.getConstant(VTBits, MVT::i8));
12853 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12854 AndNode, DAG.getConstant(0, MVT::i8));
12856 SDValue Hi, Lo;
12857 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12858 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12859 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12861 if (Op.getOpcode() == ISD::SHL_PARTS) {
12862 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12863 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12864 } else {
12865 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12866 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12867 }
12869 SDValue Ops[2] = { Lo, Hi };
12870 return DAG.getMergeValues(Ops, dl);
12871 }
12873 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12874 SelectionDAG &DAG) const {
12875 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12877 if (SrcVT.isVector())
12878 return SDValue();
12880 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12881 "Unknown SINT_TO_FP to lower!");
12883 // These are really Legal; return the operand so the caller accepts it as
12884 // Legal.
12885 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12886 return Op;
12887 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12888 Subtarget->is64Bit()) {
12889 return Op;
12890 }
12892 SDLoc dl(Op);
12893 unsigned Size = SrcVT.getSizeInBits()/8;
12894 MachineFunction &MF = DAG.getMachineFunction();
12895 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12896 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12897 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12898 StackSlot,
12899 MachinePointerInfo::getFixedStack(SSFI),
12900 false, false, 0);
12901 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12902 }
12904 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12905 SDValue StackSlot,
12906 SelectionDAG &DAG) const {
12907 // Build the FILD
12908 SDLoc DL(Op);
12909 SDVTList Tys;
12910 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12911 if (useSSE)
12912 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12913 else
12914 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12916 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12918 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12919 MachineMemOperand *MMO;
12920 if (FI) {
12921 int SSFI = FI->getIndex();
12922 MMO =
12923 DAG.getMachineFunction()
12924 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12925 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12926 } else {
12927 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12928 StackSlot = StackSlot.getOperand(1);
12929 }
12930 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12931 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12932 X86ISD::FILD, DL,
12933 Tys, Ops, SrcVT, MMO);
12935 if (useSSE) {
12936 Chain = Result.getValue(1);
12937 SDValue InFlag = Result.getValue(2);
12939 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12940 // shouldn't be necessary except that RFP cannot be live across
12941 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12942 MachineFunction &MF = DAG.getMachineFunction();
12943 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12944 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12945 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12946 Tys = DAG.getVTList(MVT::Other);
12947 SDValue Ops[] = {
12948 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12949 };
12950 MachineMemOperand *MMO =
12951 DAG.getMachineFunction()
12952 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12953 MachineMemOperand::MOStore, SSFISize, SSFISize);
12955 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12956 Ops, Op.getValueType(), MMO);
12957 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
12958 MachinePointerInfo::getFixedStack(SSFI),
12959 false, false, false, 0);
12960 }
12962 return Result;
12963 }
12965 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12966 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12967 SelectionDAG &DAG) const {
12968 // This algorithm is not obvious. Here it is what we're trying to output:
12969 /*
12970 movq %rax, %xmm0
12971 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12972 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12973 #ifdef __SSE3__
12974 haddpd %xmm0, %xmm0
12975 #else
12976 pshufd $0x4e, %xmm0, %xmm1
12977 addpd %xmm1, %xmm0
12978 #endif
12979 */
12981 SDLoc dl(Op);
12982 LLVMContext *Context = DAG.getContext();
12984 // Build some magic constants.
12985 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12986 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12987 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
12989 SmallVector<Constant*,2> CV1;
12990 CV1.push_back(
12991 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12992 APInt(64, 0x4330000000000000ULL))));
12993 CV1.push_back(
12994 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12995 APInt(64, 0x4530000000000000ULL))));
12996 Constant *C1 = ConstantVector::get(CV1);
12997 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
12999 // Load the 64-bit value into an XMM register.
13000 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
13001 Op.getOperand(0));
13002 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
13003 MachinePointerInfo::getConstantPool(),
13004 false, false, false, 16);
13005 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
13006 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
13007 CLod0);
13009 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
13010 MachinePointerInfo::getConstantPool(),
13011 false, false, false, 16);
13012 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
13013 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
13014 SDValue Result;
13016 if (Subtarget->hasSSE3()) {
13017 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
13018 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
13019 } else {
13020 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
13021 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
13022 S2F, 0x4E, DAG);
13023 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
13024 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
13025 Sub);
13026 }
13028 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
13029 DAG.getIntPtrConstant(0));
13030 }
13032 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
13033 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
13034 SelectionDAG &DAG) const {
13035 SDLoc dl(Op);
13036 // FP constant to bias correct the final result.
13037 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
13038 MVT::f64);
13040 // Load the 32-bit value into an XMM register.
13041 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
13042 Op.getOperand(0));
13044 // Zero out the upper parts of the register.
13045 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
13047 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13048 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
13049 DAG.getIntPtrConstant(0));
13051 // Or the load with the bias.
13052 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
13053 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13054 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13055 MVT::v2f64, Load)),
13056 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13057 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13058 MVT::v2f64, Bias)));
13059 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13060 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
13061 DAG.getIntPtrConstant(0));
13063 // Subtract the bias.
13064 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
13066 // Handle final rounding.
13067 EVT DestVT = Op.getValueType();
13069 if (DestVT.bitsLT(MVT::f64))
13070 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
13071 DAG.getIntPtrConstant(0));
13072 if (DestVT.bitsGT(MVT::f64))
13073 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
13075 // Handle final rounding.
13076 return Sub;
13077 }
13079 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
13080 SelectionDAG &DAG) const {
13081 SDValue N0 = Op.getOperand(0);
13082 MVT SVT = N0.getSimpleValueType();
13083 SDLoc dl(Op);
13085 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
13086 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
13087 "Custom UINT_TO_FP is not supported!");
13089 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
13090 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
13091 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
13092 }
13094 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
13095 SelectionDAG &DAG) const {
13096 SDValue N0 = Op.getOperand(0);
13097 SDLoc dl(Op);
13099 if (Op.getValueType().isVector())
13100 return lowerUINT_TO_FP_vec(Op, DAG);
13102 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
13103 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
13104 // the optimization here.
13105 if (DAG.SignBitIsZero(N0))
13106 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
13108 MVT SrcVT = N0.getSimpleValueType();
13109 MVT DstVT = Op.getSimpleValueType();
13110 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
13111 return LowerUINT_TO_FP_i64(Op, DAG);
13112 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
13113 return LowerUINT_TO_FP_i32(Op, DAG);
13114 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
13115 return SDValue();
13117 // Make a 64-bit buffer, and use it to build an FILD.
13118 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
13119 if (SrcVT == MVT::i32) {
13120 SDValue WordOff = DAG.getConstant(4, getPointerTy());
13121 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
13122 getPointerTy(), StackSlot, WordOff);
13123 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13124 StackSlot, MachinePointerInfo(),
13125 false, false, 0);
13126 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
13127 OffsetSlot, MachinePointerInfo(),
13128 false, false, 0);
13129 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
13130 return Fild;
13131 }
13133 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
13134 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13135 StackSlot, MachinePointerInfo(),
13136 false, false, 0);
13137 // For i64 source, we need to add the appropriate power of 2 if the input
13138 // was negative. This is the same as the optimization in
13139 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
13140 // we must be careful to do the computation in x87 extended precision, not
13141 // in SSE. (The generic code can't know it's OK to do this, or how to.)
13142 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
13143 MachineMemOperand *MMO =
13144 DAG.getMachineFunction()
13145 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13146 MachineMemOperand::MOLoad, 8, 8);
13148 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
13149 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
13150 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
13151 MVT::i64, MMO);
13153 APInt FF(32, 0x5F800000ULL);
13155 // Check whether the sign bit is set.
13156 SDValue SignSet = DAG.getSetCC(dl,
13157 getSetCCResultType(*DAG.getContext(), MVT::i64),
13158 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
13159 ISD::SETLT);
13161 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
13162 SDValue FudgePtr = DAG.getConstantPool(
13163 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
13164 getPointerTy());
13166 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
13167 SDValue Zero = DAG.getIntPtrConstant(0);
13168 SDValue Four = DAG.getIntPtrConstant(4);
13169 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
13170 Zero, Four);
13171 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
13173 // Load the value out, extending it from f32 to f80.
13174 // FIXME: Avoid the extend by constructing the right constant pool?
13175 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
13176 FudgePtr, MachinePointerInfo::getConstantPool(),
13177 MVT::f32, false, false, false, 4);
13178 // Extend everything to 80 bits to force it to be done on x87.
13179 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
13180 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
13181 }
13183 std::pair<SDValue,SDValue>
13184 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
13185 bool IsSigned, bool IsReplace) const {
13186 SDLoc DL(Op);
13188 EVT DstTy = Op.getValueType();
13190 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
13191 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
13192 DstTy = MVT::i64;
13193 }
13195 assert(DstTy.getSimpleVT() <= MVT::i64 &&
13196 DstTy.getSimpleVT() >= MVT::i16 &&
13197 "Unknown FP_TO_INT to lower!");
13199 // These are really Legal.
13200 if (DstTy == MVT::i32 &&
13201 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13202 return std::make_pair(SDValue(), SDValue());
13203 if (Subtarget->is64Bit() &&
13204 DstTy == MVT::i64 &&
13205 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13206 return std::make_pair(SDValue(), SDValue());
13208 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
13209 // stack slot, or into the FTOL runtime function.
13210 MachineFunction &MF = DAG.getMachineFunction();
13211 unsigned MemSize = DstTy.getSizeInBits()/8;
13212 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13213 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13215 unsigned Opc;
13216 if (!IsSigned && isIntegerTypeFTOL(DstTy))
13217 Opc = X86ISD::WIN_FTOL;
13218 else
13219 switch (DstTy.getSimpleVT().SimpleTy) {
13220 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
13221 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
13222 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
13223 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
13224 }
13226 SDValue Chain = DAG.getEntryNode();
13227 SDValue Value = Op.getOperand(0);
13228 EVT TheVT = Op.getOperand(0).getValueType();
13229 // FIXME This causes a redundant load/store if the SSE-class value is already
13230 // in memory, such as if it is on the callstack.
13231 if (isScalarFPTypeInSSEReg(TheVT)) {
13232 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13233 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13234 MachinePointerInfo::getFixedStack(SSFI),
13235 false, false, 0);
13236 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13237 SDValue Ops[] = {
13238 Chain, StackSlot, DAG.getValueType(TheVT)
13239 };
13241 MachineMemOperand *MMO =
13242 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13243 MachineMemOperand::MOLoad, MemSize, MemSize);
13244 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13245 Chain = Value.getValue(1);
13246 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13247 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13248 }
13250 MachineMemOperand *MMO =
13251 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13252 MachineMemOperand::MOStore, MemSize, MemSize);
13254 if (Opc != X86ISD::WIN_FTOL) {
13255 // Build the FP_TO_INT*_IN_MEM
13256 SDValue Ops[] = { Chain, Value, StackSlot };
13257 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13258 Ops, DstTy, MMO);
13259 return std::make_pair(FIST, StackSlot);
13260 } else {
13261 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
13262 DAG.getVTList(MVT::Other, MVT::Glue),
13263 Chain, Value);
13264 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
13265 MVT::i32, ftol.getValue(1));
13266 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
13267 MVT::i32, eax.getValue(2));
13268 SDValue Ops[] = { eax, edx };
13269 SDValue pair = IsReplace
13270 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
13271 : DAG.getMergeValues(Ops, DL);
13272 return std::make_pair(pair, SDValue());
13273 }
13274 }
13276 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13277 const X86Subtarget *Subtarget) {
13278 MVT VT = Op->getSimpleValueType(0);
13279 SDValue In = Op->getOperand(0);
13280 MVT InVT = In.getSimpleValueType();
13281 SDLoc dl(Op);
13283 // Optimize vectors in AVX mode:
13284 //
13285 // v8i16 -> v8i32
13286 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13287 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13288 // Concat upper and lower parts.
13289 //
13290 // v4i32 -> v4i64
13291 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13292 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13293 // Concat upper and lower parts.
13294 //
13296 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13297 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13298 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13299 return SDValue();
13301 if (Subtarget->hasInt256())
13302 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13304 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13305 SDValue Undef = DAG.getUNDEF(InVT);
13306 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13307 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13308 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13310 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13311 VT.getVectorNumElements()/2);
13313 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
13314 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
13316 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13317 }
13319 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13320 SelectionDAG &DAG) {
13321 MVT VT = Op->getSimpleValueType(0);
13322 SDValue In = Op->getOperand(0);
13323 MVT InVT = In.getSimpleValueType();
13324 SDLoc DL(Op);
13325 unsigned int NumElts = VT.getVectorNumElements();
13326 if (NumElts != 8 && NumElts != 16)
13327 return SDValue();
13329 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13330 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13332 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
13333 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13334 // Now we have only mask extension
13335 assert(InVT.getVectorElementType() == MVT::i1);
13336 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
13337 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13338 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
13339 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13340 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13341 MachinePointerInfo::getConstantPool(),
13342 false, false, false, Alignment);
13344 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
13345 if (VT.is512BitVector())
13346 return Brcst;
13347 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
13348 }
13350 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13351 SelectionDAG &DAG) {
13352 if (Subtarget->hasFp256()) {
13353 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13354 if (Res.getNode())
13355 return Res;
13356 }
13358 return SDValue();
13359 }
13361 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13362 SelectionDAG &DAG) {
13363 SDLoc DL(Op);
13364 MVT VT = Op.getSimpleValueType();
13365 SDValue In = Op.getOperand(0);
13366 MVT SVT = In.getSimpleValueType();
13368 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13369 return LowerZERO_EXTEND_AVX512(Op, DAG);
13371 if (Subtarget->hasFp256()) {
13372 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13373 if (Res.getNode())
13374 return Res;
13375 }
13377 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13378 VT.getVectorNumElements() != SVT.getVectorNumElements());
13379 return SDValue();
13380 }
13382 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13383 SDLoc DL(Op);
13384 MVT VT = Op.getSimpleValueType();
13385 SDValue In = Op.getOperand(0);
13386 MVT InVT = In.getSimpleValueType();
13388 if (VT == MVT::i1) {
13389 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13390 "Invalid scalar TRUNCATE operation");
13391 if (InVT.getSizeInBits() >= 32)
13392 return SDValue();
13393 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13394 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13395 }
13396 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13397 "Invalid TRUNCATE operation");
13399 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
13400 if (VT.getVectorElementType().getSizeInBits() >=8)
13401 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13403 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13404 unsigned NumElts = InVT.getVectorNumElements();
13405 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13406 if (InVT.getSizeInBits() < 512) {
13407 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13408 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13409 InVT = ExtVT;
13410 }
13412 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
13413 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13414 SDValue CP = DAG.getConstantPool(C, getPointerTy());
13415 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13416 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13417 MachinePointerInfo::getConstantPool(),
13418 false, false, false, Alignment);
13419 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
13420 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13421 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13422 }
13424 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13425 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13426 if (Subtarget->hasInt256()) {
13427 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13428 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
13429 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13430 ShufMask);
13431 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13432 DAG.getIntPtrConstant(0));
13433 }
13435 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13436 DAG.getIntPtrConstant(0));
13437 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13438 DAG.getIntPtrConstant(2));
13439 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13440 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13441 static const int ShufMask[] = {0, 2, 4, 6};
13442 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13443 }
13445 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13446 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13447 if (Subtarget->hasInt256()) {
13448 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
13450 SmallVector<SDValue,32> pshufbMask;
13451 for (unsigned i = 0; i < 2; ++i) {
13452 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
13453 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
13454 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
13455 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
13456 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
13457 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
13458 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
13459 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
13460 for (unsigned j = 0; j < 8; ++j)
13461 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
13462 }
13463 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13464 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13465 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
13467 static const int ShufMask[] = {0, 2, -1, -1};
13468 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13469 &ShufMask[0]);
13470 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13471 DAG.getIntPtrConstant(0));
13472 return DAG.getNode(ISD::BITCAST, DL, VT, In);
13473 }
13475 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13476 DAG.getIntPtrConstant(0));
13478 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13479 DAG.getIntPtrConstant(4));
13481 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
13482 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
13484 // The PSHUFB mask:
13485 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13486 -1, -1, -1, -1, -1, -1, -1, -1};
13488 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13489 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13490 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13492 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13493 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13495 // The MOVLHPS Mask:
13496 static const int ShufMask2[] = {0, 1, 4, 5};
13497 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13498 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
13499 }
13501 // Handle truncation of V256 to V128 using shuffles.
13502 if (!VT.is128BitVector() || !InVT.is256BitVector())
13503 return SDValue();
13505 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13507 unsigned NumElems = VT.getVectorNumElements();
13508 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13510 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13511 // Prepare truncation shuffle mask
13512 for (unsigned i = 0; i != NumElems; ++i)
13513 MaskVec[i] = i * 2;
13514 SDValue V = DAG.getVectorShuffle(NVT, DL,
13515 DAG.getNode(ISD::BITCAST, DL, NVT, In),
13516 DAG.getUNDEF(NVT), &MaskVec[0]);
13517 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13518 DAG.getIntPtrConstant(0));
13519 }
13521 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13522 SelectionDAG &DAG) const {
13523 assert(!Op.getSimpleValueType().isVector());
13525 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13526 /*IsSigned=*/ true, /*IsReplace=*/ false);
13527 SDValue FIST = Vals.first, StackSlot = Vals.second;
13528 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13529 if (!FIST.getNode()) return Op;
13531 if (StackSlot.getNode())
13532 // Load the result.
13533 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13534 FIST, StackSlot, MachinePointerInfo(),
13535 false, false, false, 0);
13537 // The node is the result.
13538 return FIST;
13539 }
13541 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13542 SelectionDAG &DAG) const {
13543 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13544 /*IsSigned=*/ false, /*IsReplace=*/ false);
13545 SDValue FIST = Vals.first, StackSlot = Vals.second;
13546 assert(FIST.getNode() && "Unexpected failure");
13548 if (StackSlot.getNode())
13549 // Load the result.
13550 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13551 FIST, StackSlot, MachinePointerInfo(),
13552 false, false, false, 0);
13554 // The node is the result.
13555 return FIST;
13556 }
13558 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13559 SDLoc DL(Op);
13560 MVT VT = Op.getSimpleValueType();
13561 SDValue In = Op.getOperand(0);
13562 MVT SVT = In.getSimpleValueType();
13564 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13566 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13567 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13568 In, DAG.getUNDEF(SVT)));
13569 }
13571 // The only differences between FABS and FNEG are the mask and the logic op.
13572 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13573 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13574 "Wrong opcode for lowering FABS or FNEG.");
13576 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13577 SDLoc dl(Op);
13578 MVT VT = Op.getSimpleValueType();
13579 // Assume scalar op for initialization; update for vector if needed.
13580 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
13581 // generate a 16-byte vector constant and logic op even for the scalar case.
13582 // Using a 16-byte mask allows folding the load of the mask with
13583 // the logic op, so it can save (~4 bytes) on code size.
13584 MVT EltVT = VT;
13585 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
13586 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13587 // decide if we should generate a 16-byte constant mask when we only need 4 or
13588 // 8 bytes for the scalar case.
13589 if (VT.isVector()) {
13590 EltVT = VT.getVectorElementType();
13591 NumElts = VT.getVectorNumElements();
13592 }
13594 unsigned EltBits = EltVT.getSizeInBits();
13595 LLVMContext *Context = DAG.getContext();
13596 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13597 APInt MaskElt =
13598 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13599 Constant *C = ConstantInt::get(*Context, MaskElt);
13600 C = ConstantVector::getSplat(NumElts, C);
13601 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13602 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
13603 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13604 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13605 MachinePointerInfo::getConstantPool(),
13606 false, false, false, Alignment);
13608 if (VT.isVector()) {
13609 // For a vector, cast operands to a vector type, perform the logic op,
13610 // and cast the result back to the original value type.
13611 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
13612 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
13613 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
13614 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
13615 return DAG.getNode(ISD::BITCAST, dl, VT,
13616 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
13617 }
13618 // If not vector, then scalar.
13619 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
13620 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
13621 }
13623 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13624 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13625 LLVMContext *Context = DAG.getContext();
13626 SDValue Op0 = Op.getOperand(0);
13627 SDValue Op1 = Op.getOperand(1);
13628 SDLoc dl(Op);
13629 MVT VT = Op.getSimpleValueType();
13630 MVT SrcVT = Op1.getSimpleValueType();
13632 // If second operand is smaller, extend it first.
13633 if (SrcVT.bitsLT(VT)) {
13634 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13635 SrcVT = VT;
13636 }
13637 // And if it is bigger, shrink it first.
13638 if (SrcVT.bitsGT(VT)) {
13639 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
13640 SrcVT = VT;
13641 }
13643 // At this point the operands and the result should have the same
13644 // type, and that won't be f80 since that is not custom lowered.
13646 // First get the sign bit of second operand.
13647 SmallVector<Constant*,4> CV;
13648 if (SrcVT == MVT::f64) {
13649 const fltSemantics &Sem = APFloat::IEEEdouble;
13650 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
13651 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13652 } else {
13653 const fltSemantics &Sem = APFloat::IEEEsingle;
13654 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
13655 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13656 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13657 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13658 }
13659 Constant *C = ConstantVector::get(CV);
13660 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13661 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
13662 MachinePointerInfo::getConstantPool(),
13663 false, false, false, 16);
13664 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
13666 // Shift sign bit right or left if the two operands have different types.
13667 if (SrcVT.bitsGT(VT)) {
13668 // Op0 is MVT::f32, Op1 is MVT::f64.
13669 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
13670 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
13671 DAG.getConstant(32, MVT::i32));
13672 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
13673 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
13674 DAG.getIntPtrConstant(0));
13675 }
13677 // Clear first operand sign bit.
13678 CV.clear();
13679 if (VT == MVT::f64) {
13680 const fltSemantics &Sem = APFloat::IEEEdouble;
13681 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13682 APInt(64, ~(1ULL << 63)))));
13683 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13684 } else {
13685 const fltSemantics &Sem = APFloat::IEEEsingle;
13686 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13687 APInt(32, ~(1U << 31)))));
13688 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13689 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13690 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13691 }
13692 C = ConstantVector::get(CV);
13693 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13694 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13695 MachinePointerInfo::getConstantPool(),
13696 false, false, false, 16);
13697 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
13699 // Or the value with the sign bit.
13700 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
13701 }
13703 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13704 SDValue N0 = Op.getOperand(0);
13705 SDLoc dl(Op);
13706 MVT VT = Op.getSimpleValueType();
13708 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13709 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13710 DAG.getConstant(1, VT));
13711 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
13712 }
13714 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
13715 //
13716 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13717 SelectionDAG &DAG) {
13718 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13720 if (!Subtarget->hasSSE41())
13721 return SDValue();
13723 if (!Op->hasOneUse())
13724 return SDValue();
13726 SDNode *N = Op.getNode();
13727 SDLoc DL(N);
13729 SmallVector<SDValue, 8> Opnds;
13730 DenseMap<SDValue, unsigned> VecInMap;
13731 SmallVector<SDValue, 8> VecIns;
13732 EVT VT = MVT::Other;
13734 // Recognize a special case where a vector is casted into wide integer to
13735 // test all 0s.
13736 Opnds.push_back(N->getOperand(0));
13737 Opnds.push_back(N->getOperand(1));
13739 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13740 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13741 // BFS traverse all OR'd operands.
13742 if (I->getOpcode() == ISD::OR) {
13743 Opnds.push_back(I->getOperand(0));
13744 Opnds.push_back(I->getOperand(1));
13745 // Re-evaluate the number of nodes to be traversed.
13746 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13747 continue;
13748 }
13750 // Quit if a non-EXTRACT_VECTOR_ELT
13751 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13752 return SDValue();
13754 // Quit if without a constant index.
13755 SDValue Idx = I->getOperand(1);
13756 if (!isa<ConstantSDNode>(Idx))
13757 return SDValue();
13759 SDValue ExtractedFromVec = I->getOperand(0);
13760 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13761 if (M == VecInMap.end()) {
13762 VT = ExtractedFromVec.getValueType();
13763 // Quit if not 128/256-bit vector.
13764 if (!VT.is128BitVector() && !VT.is256BitVector())
13765 return SDValue();
13766 // Quit if not the same type.
13767 if (VecInMap.begin() != VecInMap.end() &&
13768 VT != VecInMap.begin()->first.getValueType())
13769 return SDValue();
13770 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13771 VecIns.push_back(ExtractedFromVec);
13772 }
13773 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13774 }
13776 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13777 "Not extracted from 128-/256-bit vector.");
13779 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13781 for (DenseMap<SDValue, unsigned>::const_iterator
13782 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13783 // Quit if not all elements are used.
13784 if (I->second != FullMask)
13785 return SDValue();
13786 }
13788 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13790 // Cast all vectors into TestVT for PTEST.
13791 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13792 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13794 // If more than one full vectors are evaluated, OR them first before PTEST.
13795 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13796 // Each iteration will OR 2 nodes and append the result until there is only
13797 // 1 node left, i.e. the final OR'd value of all vectors.
13798 SDValue LHS = VecIns[Slot];
13799 SDValue RHS = VecIns[Slot + 1];
13800 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13801 }
13803 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13804 VecIns.back(), VecIns.back());
13805 }
13807 /// \brief return true if \c Op has a use that doesn't just read flags.
13808 static bool hasNonFlagsUse(SDValue Op) {
13809 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13810 ++UI) {
13811 SDNode *User = *UI;
13812 unsigned UOpNo = UI.getOperandNo();
13813 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13814 // Look pass truncate.
13815 UOpNo = User->use_begin().getOperandNo();
13816 User = *User->use_begin();
13817 }
13819 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13820 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13821 return true;
13822 }
13823 return false;
13824 }
13826 /// Emit nodes that will be selected as "test Op0,Op0", or something
13827 /// equivalent.
13828 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13829 SelectionDAG &DAG) const {
13830 if (Op.getValueType() == MVT::i1)
13831 // KORTEST instruction should be selected
13832 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13833 DAG.getConstant(0, Op.getValueType()));
13835 // CF and OF aren't always set the way we want. Determine which
13836 // of these we need.
13837 bool NeedCF = false;
13838 bool NeedOF = false;
13839 switch (X86CC) {
13840 default: break;
13841 case X86::COND_A: case X86::COND_AE:
13842 case X86::COND_B: case X86::COND_BE:
13843 NeedCF = true;
13844 break;
13845 case X86::COND_G: case X86::COND_GE:
13846 case X86::COND_L: case X86::COND_LE:
13847 case X86::COND_O: case X86::COND_NO: {
13848 // Check if we really need to set the
13849 // Overflow flag. If NoSignedWrap is present
13850 // that is not actually needed.
13851 switch (Op->getOpcode()) {
13852 case ISD::ADD:
13853 case ISD::SUB:
13854 case ISD::MUL:
13855 case ISD::SHL: {
13856 const BinaryWithFlagsSDNode *BinNode =
13857 cast<BinaryWithFlagsSDNode>(Op.getNode());
13858 if (BinNode->hasNoSignedWrap())
13859 break;
13860 }
13861 default:
13862 NeedOF = true;
13863 break;
13864 }
13865 break;
13866 }
13867 }
13868 // See if we can use the EFLAGS value from the operand instead of
13869 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13870 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13871 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13872 // Emit a CMP with 0, which is the TEST pattern.
13873 //if (Op.getValueType() == MVT::i1)
13874 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13875 // DAG.getConstant(0, MVT::i1));
13876 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13877 DAG.getConstant(0, Op.getValueType()));
13878 }
13879 unsigned Opcode = 0;
13880 unsigned NumOperands = 0;
13882 // Truncate operations may prevent the merge of the SETCC instruction
13883 // and the arithmetic instruction before it. Attempt to truncate the operands
13884 // of the arithmetic instruction and use a reduced bit-width instruction.
13885 bool NeedTruncation = false;
13886 SDValue ArithOp = Op;
13887 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13888 SDValue Arith = Op->getOperand(0);
13889 // Both the trunc and the arithmetic op need to have one user each.
13890 if (Arith->hasOneUse())
13891 switch (Arith.getOpcode()) {
13892 default: break;
13893 case ISD::ADD:
13894 case ISD::SUB:
13895 case ISD::AND:
13896 case ISD::OR:
13897 case ISD::XOR: {
13898 NeedTruncation = true;
13899 ArithOp = Arith;
13900 }
13901 }
13902 }
13904 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13905 // which may be the result of a CAST. We use the variable 'Op', which is the
13906 // non-casted variable when we check for possible users.
13907 switch (ArithOp.getOpcode()) {
13908 case ISD::ADD:
13909 // Due to an isel shortcoming, be conservative if this add is likely to be
13910 // selected as part of a load-modify-store instruction. When the root node
13911 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13912 // uses of other nodes in the match, such as the ADD in this case. This
13913 // leads to the ADD being left around and reselected, with the result being
13914 // two adds in the output. Alas, even if none our users are stores, that
13915 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13916 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13917 // climbing the DAG back to the root, and it doesn't seem to be worth the
13918 // effort.
13919 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13920 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13921 if (UI->getOpcode() != ISD::CopyToReg &&
13922 UI->getOpcode() != ISD::SETCC &&
13923 UI->getOpcode() != ISD::STORE)
13924 goto default_case;
13926 if (ConstantSDNode *C =
13927 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13928 // An add of one will be selected as an INC.
13929 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13930 Opcode = X86ISD::INC;
13931 NumOperands = 1;
13932 break;
13933 }
13935 // An add of negative one (subtract of one) will be selected as a DEC.
13936 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13937 Opcode = X86ISD::DEC;
13938 NumOperands = 1;
13939 break;
13940 }
13941 }
13943 // Otherwise use a regular EFLAGS-setting add.
13944 Opcode = X86ISD::ADD;
13945 NumOperands = 2;
13946 break;
13947 case ISD::SHL:
13948 case ISD::SRL:
13949 // If we have a constant logical shift that's only used in a comparison
13950 // against zero turn it into an equivalent AND. This allows turning it into
13951 // a TEST instruction later.
13952 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13953 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13954 EVT VT = Op.getValueType();
13955 unsigned BitWidth = VT.getSizeInBits();
13956 unsigned ShAmt = Op->getConstantOperandVal(1);
13957 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13958 break;
13959 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13960 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13961 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13962 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13963 break;
13964 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13965 DAG.getConstant(Mask, VT));
13966 DAG.ReplaceAllUsesWith(Op, New);
13967 Op = New;
13968 }
13969 break;
13971 case ISD::AND:
13972 // If the primary and result isn't used, don't bother using X86ISD::AND,
13973 // because a TEST instruction will be better.
13974 if (!hasNonFlagsUse(Op))
13975 break;
13976 // FALL THROUGH
13977 case ISD::SUB:
13978 case ISD::OR:
13979 case ISD::XOR:
13980 // Due to the ISEL shortcoming noted above, be conservative if this op is
13981 // likely to be selected as part of a load-modify-store instruction.
13982 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13983 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13984 if (UI->getOpcode() == ISD::STORE)
13985 goto default_case;
13987 // Otherwise use a regular EFLAGS-setting instruction.
13988 switch (ArithOp.getOpcode()) {
13989 default: llvm_unreachable("unexpected operator!");
13990 case ISD::SUB: Opcode = X86ISD::SUB; break;
13991 case ISD::XOR: Opcode = X86ISD::XOR; break;
13992 case ISD::AND: Opcode = X86ISD::AND; break;
13993 case ISD::OR: {
13994 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13995 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13996 if (EFLAGS.getNode())
13997 return EFLAGS;
13998 }
13999 Opcode = X86ISD::OR;
14000 break;
14001 }
14002 }
14004 NumOperands = 2;
14005 break;
14006 case X86ISD::ADD:
14007 case X86ISD::SUB:
14008 case X86ISD::INC:
14009 case X86ISD::DEC:
14010 case X86ISD::OR:
14011 case X86ISD::XOR:
14012 case X86ISD::AND:
14013 return SDValue(Op.getNode(), 1);
14014 default:
14015 default_case:
14016 break;
14017 }
14019 // If we found that truncation is beneficial, perform the truncation and
14020 // update 'Op'.
14021 if (NeedTruncation) {
14022 EVT VT = Op.getValueType();
14023 SDValue WideVal = Op->getOperand(0);
14024 EVT WideVT = WideVal.getValueType();
14025 unsigned ConvertedOp = 0;
14026 // Use a target machine opcode to prevent further DAGCombine
14027 // optimizations that may separate the arithmetic operations
14028 // from the setcc node.
14029 switch (WideVal.getOpcode()) {
14030 default: break;
14031 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
14032 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
14033 case ISD::AND: ConvertedOp = X86ISD::AND; break;
14034 case ISD::OR: ConvertedOp = X86ISD::OR; break;
14035 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
14036 }
14038 if (ConvertedOp) {
14039 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14040 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
14041 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
14042 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
14043 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
14044 }
14045 }
14046 }
14048 if (Opcode == 0)
14049 // Emit a CMP with 0, which is the TEST pattern.
14050 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14051 DAG.getConstant(0, Op.getValueType()));
14053 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14054 SmallVector<SDValue, 4> Ops;
14055 for (unsigned i = 0; i != NumOperands; ++i)
14056 Ops.push_back(Op.getOperand(i));
14058 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
14059 DAG.ReplaceAllUsesWith(Op, New);
14060 return SDValue(New.getNode(), 1);
14061 }
14063 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
14064 /// equivalent.
14065 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
14066 SDLoc dl, SelectionDAG &DAG) const {
14067 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
14068 if (C->getAPIntValue() == 0)
14069 return EmitTest(Op0, X86CC, dl, DAG);
14071 if (Op0.getValueType() == MVT::i1)
14072 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
14073 }
14075 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
14076 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
14077 // Do the comparison at i32 if it's smaller, besides the Atom case.
14078 // This avoids subregister aliasing issues. Keep the smaller reference
14079 // if we're optimizing for size, however, as that'll allow better folding
14080 // of memory operations.
14081 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
14082 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
14083 AttributeSet::FunctionIndex, Attribute::MinSize) &&
14084 !Subtarget->isAtom()) {
14085 unsigned ExtendOp =
14086 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
14087 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
14088 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
14089 }
14090 // Use SUB instead of CMP to enable CSE between SUB and CMP.
14091 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
14092 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
14093 Op0, Op1);
14094 return SDValue(Sub.getNode(), 1);
14095 }
14096 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
14097 }
14099 /// Convert a comparison if required by the subtarget.
14100 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
14101 SelectionDAG &DAG) const {
14102 // If the subtarget does not support the FUCOMI instruction, floating-point
14103 // comparisons have to be converted.
14104 if (Subtarget->hasCMov() ||
14105 Cmp.getOpcode() != X86ISD::CMP ||
14106 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
14107 !Cmp.getOperand(1).getValueType().isFloatingPoint())
14108 return Cmp;
14110 // The instruction selector will select an FUCOM instruction instead of
14111 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
14112 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
14113 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
14114 SDLoc dl(Cmp);
14115 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
14116 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
14117 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
14118 DAG.getConstant(8, MVT::i8));
14119 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
14120 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
14121 }
14123 static bool isAllOnes(SDValue V) {
14124 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
14125 return C && C->isAllOnesValue();
14126 }
14128 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14129 /// if it's possible.
14130 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14131 SDLoc dl, SelectionDAG &DAG) const {
14132 SDValue Op0 = And.getOperand(0);
14133 SDValue Op1 = And.getOperand(1);
14134 if (Op0.getOpcode() == ISD::TRUNCATE)
14135 Op0 = Op0.getOperand(0);
14136 if (Op1.getOpcode() == ISD::TRUNCATE)
14137 Op1 = Op1.getOperand(0);
14139 SDValue LHS, RHS;
14140 if (Op1.getOpcode() == ISD::SHL)
14141 std::swap(Op0, Op1);
14142 if (Op0.getOpcode() == ISD::SHL) {
14143 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
14144 if (And00C->getZExtValue() == 1) {
14145 // If we looked past a truncate, check that it's only truncating away
14146 // known zeros.
14147 unsigned BitWidth = Op0.getValueSizeInBits();
14148 unsigned AndBitWidth = And.getValueSizeInBits();
14149 if (BitWidth > AndBitWidth) {
14150 APInt Zeros, Ones;
14151 DAG.computeKnownBits(Op0, Zeros, Ones);
14152 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14153 return SDValue();
14154 }
14155 LHS = Op1;
14156 RHS = Op0.getOperand(1);
14157 }
14158 } else if (Op1.getOpcode() == ISD::Constant) {
14159 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14160 uint64_t AndRHSVal = AndRHS->getZExtValue();
14161 SDValue AndLHS = Op0;
14163 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14164 LHS = AndLHS.getOperand(0);
14165 RHS = AndLHS.getOperand(1);
14166 }
14168 // Use BT if the immediate can't be encoded in a TEST instruction.
14169 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14170 LHS = AndLHS;
14171 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
14172 }
14173 }
14175 if (LHS.getNode()) {
14176 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14177 // instruction. Since the shift amount is in-range-or-undefined, we know
14178 // that doing a bittest on the i32 value is ok. We extend to i32 because
14179 // the encoding for the i16 version is larger than the i32 version.
14180 // Also promote i16 to i32 for performance / code size reason.
14181 if (LHS.getValueType() == MVT::i8 ||
14182 LHS.getValueType() == MVT::i16)
14183 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14185 // If the operand types disagree, extend the shift amount to match. Since
14186 // BT ignores high bits (like shifts) we can use anyextend.
14187 if (LHS.getValueType() != RHS.getValueType())
14188 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14190 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14191 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14192 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14193 DAG.getConstant(Cond, MVT::i8), BT);
14194 }
14196 return SDValue();
14197 }
14199 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14200 /// mask CMPs.
14201 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14202 SDValue &Op1) {
14203 unsigned SSECC;
14204 bool Swap = false;
14206 // SSE Condition code mapping:
14207 // 0 - EQ
14208 // 1 - LT
14209 // 2 - LE
14210 // 3 - UNORD
14211 // 4 - NEQ
14212 // 5 - NLT
14213 // 6 - NLE
14214 // 7 - ORD
14215 switch (SetCCOpcode) {
14216 default: llvm_unreachable("Unexpected SETCC condition");
14217 case ISD::SETOEQ:
14218 case ISD::SETEQ: SSECC = 0; break;
14219 case ISD::SETOGT:
14220 case ISD::SETGT: Swap = true; // Fallthrough
14221 case ISD::SETLT:
14222 case ISD::SETOLT: SSECC = 1; break;
14223 case ISD::SETOGE:
14224 case ISD::SETGE: Swap = true; // Fallthrough
14225 case ISD::SETLE:
14226 case ISD::SETOLE: SSECC = 2; break;
14227 case ISD::SETUO: SSECC = 3; break;
14228 case ISD::SETUNE:
14229 case ISD::SETNE: SSECC = 4; break;
14230 case ISD::SETULE: Swap = true; // Fallthrough
14231 case ISD::SETUGE: SSECC = 5; break;
14232 case ISD::SETULT: Swap = true; // Fallthrough
14233 case ISD::SETUGT: SSECC = 6; break;
14234 case ISD::SETO: SSECC = 7; break;
14235 case ISD::SETUEQ:
14236 case ISD::SETONE: SSECC = 8; break;
14237 }
14238 if (Swap)
14239 std::swap(Op0, Op1);
14241 return SSECC;
14242 }
14244 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14245 // ones, and then concatenate the result back.
14246 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14247 MVT VT = Op.getSimpleValueType();
14249 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14250 "Unsupported value type for operation");
14252 unsigned NumElems = VT.getVectorNumElements();
14253 SDLoc dl(Op);
14254 SDValue CC = Op.getOperand(2);
14256 // Extract the LHS vectors
14257 SDValue LHS = Op.getOperand(0);
14258 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14259 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14261 // Extract the RHS vectors
14262 SDValue RHS = Op.getOperand(1);
14263 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14264 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14266 // Issue the operation on the smaller types and concatenate the result back
14267 MVT EltVT = VT.getVectorElementType();
14268 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14269 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14270 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14271 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14272 }
14274 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14275 const X86Subtarget *Subtarget) {
14276 SDValue Op0 = Op.getOperand(0);
14277 SDValue Op1 = Op.getOperand(1);
14278 SDValue CC = Op.getOperand(2);
14279 MVT VT = Op.getSimpleValueType();
14280 SDLoc dl(Op);
14282 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
14283 Op.getValueType().getScalarType() == MVT::i1 &&
14284 "Cannot set masked compare for this operation");
14286 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14287 unsigned Opc = 0;
14288 bool Unsigned = false;
14289 bool Swap = false;
14290 unsigned SSECC;
14291 switch (SetCCOpcode) {
14292 default: llvm_unreachable("Unexpected SETCC condition");
14293 case ISD::SETNE: SSECC = 4; break;
14294 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14295 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14296 case ISD::SETLT: Swap = true; //fall-through
14297 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14298 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14299 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14300 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14301 case ISD::SETULE: Unsigned = true; //fall-through
14302 case ISD::SETLE: SSECC = 2; break;
14303 }
14305 if (Swap)
14306 std::swap(Op0, Op1);
14307 if (Opc)
14308 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14309 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14310 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14311 DAG.getConstant(SSECC, MVT::i8));
14312 }
14314 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14315 /// operand \p Op1. If non-trivial (for example because it's not constant)
14316 /// return an empty value.
14317 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14318 {
14319 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14320 if (!BV)
14321 return SDValue();
14323 MVT VT = Op1.getSimpleValueType();
14324 MVT EVT = VT.getVectorElementType();
14325 unsigned n = VT.getVectorNumElements();
14326 SmallVector<SDValue, 8> ULTOp1;
14328 for (unsigned i = 0; i < n; ++i) {
14329 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14330 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
14331 return SDValue();
14333 // Avoid underflow.
14334 APInt Val = Elt->getAPIntValue();
14335 if (Val == 0)
14336 return SDValue();
14338 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
14339 }
14341 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14342 }
14344 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14345 SelectionDAG &DAG) {
14346 SDValue Op0 = Op.getOperand(0);
14347 SDValue Op1 = Op.getOperand(1);
14348 SDValue CC = Op.getOperand(2);
14349 MVT VT = Op.getSimpleValueType();
14350 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14351 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14352 SDLoc dl(Op);
14354 if (isFP) {
14355 #ifndef NDEBUG
14356 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14357 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14358 #endif
14360 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14361 unsigned Opc = X86ISD::CMPP;
14362 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14363 assert(VT.getVectorNumElements() <= 16);
14364 Opc = X86ISD::CMPM;
14365 }
14366 // In the two special cases we can't handle, emit two comparisons.
14367 if (SSECC == 8) {
14368 unsigned CC0, CC1;
14369 unsigned CombineOpc;
14370 if (SetCCOpcode == ISD::SETUEQ) {
14371 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14372 } else {
14373 assert(SetCCOpcode == ISD::SETONE);
14374 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14375 }
14377 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14378 DAG.getConstant(CC0, MVT::i8));
14379 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14380 DAG.getConstant(CC1, MVT::i8));
14381 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14382 }
14383 // Handle all other FP comparisons here.
14384 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14385 DAG.getConstant(SSECC, MVT::i8));
14386 }
14388 // Break 256-bit integer vector compare into smaller ones.
14389 if (VT.is256BitVector() && !Subtarget->hasInt256())
14390 return Lower256IntVSETCC(Op, DAG);
14392 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14393 EVT OpVT = Op1.getValueType();
14394 if (Subtarget->hasAVX512()) {
14395 if (Op1.getValueType().is512BitVector() ||
14396 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14397 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14398 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14400 // In AVX-512 architecture setcc returns mask with i1 elements,
14401 // But there is no compare instruction for i8 and i16 elements in KNL.
14402 // We are not talking about 512-bit operands in this case, these
14403 // types are illegal.
14404 if (MaskResult &&
14405 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14406 OpVT.getVectorElementType().getSizeInBits() >= 8))
14407 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14408 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14409 }
14411 // We are handling one of the integer comparisons here. Since SSE only has
14412 // GT and EQ comparisons for integer, swapping operands and multiple
14413 // operations may be required for some comparisons.
14414 unsigned Opc;
14415 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14416 bool Subus = false;
14418 switch (SetCCOpcode) {
14419 default: llvm_unreachable("Unexpected SETCC condition");
14420 case ISD::SETNE: Invert = true;
14421 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14422 case ISD::SETLT: Swap = true;
14423 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14424 case ISD::SETGE: Swap = true;
14425 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14426 Invert = true; break;
14427 case ISD::SETULT: Swap = true;
14428 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14429 FlipSigns = true; break;
14430 case ISD::SETUGE: Swap = true;
14431 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14432 FlipSigns = true; Invert = true; break;
14433 }
14435 // Special case: Use min/max operations for SETULE/SETUGE
14436 MVT VET = VT.getVectorElementType();
14437 bool hasMinMax =
14438 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14439 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14441 if (hasMinMax) {
14442 switch (SetCCOpcode) {
14443 default: break;
14444 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
14445 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
14446 }
14448 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14449 }
14451 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14452 if (!MinMax && hasSubus) {
14453 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14454 // Op0 u<= Op1:
14455 // t = psubus Op0, Op1
14456 // pcmpeq t, <0..0>
14457 switch (SetCCOpcode) {
14458 default: break;
14459 case ISD::SETULT: {
14460 // If the comparison is against a constant we can turn this into a
14461 // setule. With psubus, setule does not require a swap. This is
14462 // beneficial because the constant in the register is no longer
14463 // destructed as the destination so it can be hoisted out of a loop.
14464 // Only do this pre-AVX since vpcmp* is no longer destructive.
14465 if (Subtarget->hasAVX())
14466 break;
14467 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14468 if (ULEOp1.getNode()) {
14469 Op1 = ULEOp1;
14470 Subus = true; Invert = false; Swap = false;
14471 }
14472 break;
14473 }
14474 // Psubus is better than flip-sign because it requires no inversion.
14475 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14476 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14477 }
14479 if (Subus) {
14480 Opc = X86ISD::SUBUS;
14481 FlipSigns = false;
14482 }
14483 }
14485 if (Swap)
14486 std::swap(Op0, Op1);
14488 // Check that the operation in question is available (most are plain SSE2,
14489 // but PCMPGTQ and PCMPEQQ have different requirements).
14490 if (VT == MVT::v2i64) {
14491 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14492 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14494 // First cast everything to the right type.
14495 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14496 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14498 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14499 // bits of the inputs before performing those operations. The lower
14500 // compare is always unsigned.
14501 SDValue SB;
14502 if (FlipSigns) {
14503 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
14504 } else {
14505 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
14506 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
14507 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14508 Sign, Zero, Sign, Zero);
14509 }
14510 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14511 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14513 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14514 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14515 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14517 // Create masks for only the low parts/high parts of the 64 bit integers.
14518 static const int MaskHi[] = { 1, 1, 3, 3 };
14519 static const int MaskLo[] = { 0, 0, 2, 2 };
14520 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14521 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14522 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14524 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14525 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14527 if (Invert)
14528 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14530 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14531 }
14533 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14534 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14535 // pcmpeqd + pshufd + pand.
14536 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14538 // First cast everything to the right type.
14539 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14540 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14542 // Do the compare.
14543 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14545 // Make sure the lower and upper halves are both all-ones.
14546 static const int Mask[] = { 1, 0, 3, 2 };
14547 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14548 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14550 if (Invert)
14551 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14553 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14554 }
14555 }
14557 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14558 // bits of the inputs before performing those operations.
14559 if (FlipSigns) {
14560 EVT EltVT = VT.getVectorElementType();
14561 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
14562 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14563 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14564 }
14566 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14568 // If the logical-not of the result is required, perform that now.
14569 if (Invert)
14570 Result = DAG.getNOT(dl, Result, VT);
14572 if (MinMax)
14573 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14575 if (Subus)
14576 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14577 getZeroVector(VT, Subtarget, DAG, dl));
14579 return Result;
14580 }
14582 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14584 MVT VT = Op.getSimpleValueType();
14586 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14588 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14589 && "SetCC type must be 8-bit or 1-bit integer");
14590 SDValue Op0 = Op.getOperand(0);
14591 SDValue Op1 = Op.getOperand(1);
14592 SDLoc dl(Op);
14593 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14595 // Optimize to BT if possible.
14596 // Lower (X & (1 << N)) == 0 to BT(X, N).
14597 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14598 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14599 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14600 Op1.getOpcode() == ISD::Constant &&
14601 cast<ConstantSDNode>(Op1)->isNullValue() &&
14602 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14603 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
14604 if (NewSetCC.getNode())
14605 return NewSetCC;
14606 }
14608 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14609 // these.
14610 if (Op1.getOpcode() == ISD::Constant &&
14611 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
14612 cast<ConstantSDNode>(Op1)->isNullValue()) &&
14613 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14615 // If the input is a setcc, then reuse the input setcc or use a new one with
14616 // the inverted condition.
14617 if (Op0.getOpcode() == X86ISD::SETCC) {
14618 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14619 bool Invert = (CC == ISD::SETNE) ^
14620 cast<ConstantSDNode>(Op1)->isNullValue();
14621 if (!Invert)
14622 return Op0;
14624 CCode = X86::GetOppositeBranchCondition(CCode);
14625 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14626 DAG.getConstant(CCode, MVT::i8),
14627 Op0.getOperand(1));
14628 if (VT == MVT::i1)
14629 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14630 return SetCC;
14631 }
14632 }
14633 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
14634 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
14635 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14637 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14638 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
14639 }
14641 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14642 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
14643 if (X86CC == X86::COND_INVALID)
14644 return SDValue();
14646 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14647 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14648 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14649 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
14650 if (VT == MVT::i1)
14651 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14652 return SetCC;
14653 }
14655 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14656 static bool isX86LogicalCmp(SDValue Op) {
14657 unsigned Opc = Op.getNode()->getOpcode();
14658 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14659 Opc == X86ISD::SAHF)
14660 return true;
14661 if (Op.getResNo() == 1 &&
14662 (Opc == X86ISD::ADD ||
14663 Opc == X86ISD::SUB ||
14664 Opc == X86ISD::ADC ||
14665 Opc == X86ISD::SBB ||
14666 Opc == X86ISD::SMUL ||
14667 Opc == X86ISD::UMUL ||
14668 Opc == X86ISD::INC ||
14669 Opc == X86ISD::DEC ||
14670 Opc == X86ISD::OR ||
14671 Opc == X86ISD::XOR ||
14672 Opc == X86ISD::AND))
14673 return true;
14675 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14676 return true;
14678 return false;
14679 }
14681 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14682 if (V.getOpcode() != ISD::TRUNCATE)
14683 return false;
14685 SDValue VOp0 = V.getOperand(0);
14686 unsigned InBits = VOp0.getValueSizeInBits();
14687 unsigned Bits = V.getValueSizeInBits();
14688 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14689 }
14691 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14692 bool addTest = true;
14693 SDValue Cond = Op.getOperand(0);
14694 SDValue Op1 = Op.getOperand(1);
14695 SDValue Op2 = Op.getOperand(2);
14696 SDLoc DL(Op);
14697 EVT VT = Op1.getValueType();
14698 SDValue CC;
14700 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14701 // are available. Otherwise fp cmovs get lowered into a less efficient branch
14702 // sequence later on.
14703 if (Cond.getOpcode() == ISD::SETCC &&
14704 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14705 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14706 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
14707 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14708 int SSECC = translateX86FSETCC(
14709 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14711 if (SSECC != 8) {
14712 if (Subtarget->hasAVX512()) {
14713 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14714 DAG.getConstant(SSECC, MVT::i8));
14715 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14716 }
14717 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14718 DAG.getConstant(SSECC, MVT::i8));
14719 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14720 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14721 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14722 }
14723 }
14725 if (Cond.getOpcode() == ISD::SETCC) {
14726 SDValue NewCond = LowerSETCC(Cond, DAG);
14727 if (NewCond.getNode())
14728 Cond = NewCond;
14729 }
14731 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14732 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14733 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14734 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14735 if (Cond.getOpcode() == X86ISD::SETCC &&
14736 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14737 isZero(Cond.getOperand(1).getOperand(1))) {
14738 SDValue Cmp = Cond.getOperand(1);
14740 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14742 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14743 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14744 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14746 SDValue CmpOp0 = Cmp.getOperand(0);
14747 // Apply further optimizations for special cases
14748 // (select (x != 0), -1, 0) -> neg & sbb
14749 // (select (x == 0), 0, -1) -> neg & sbb
14750 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14751 if (YC->isNullValue() &&
14752 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14753 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14754 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14755 DAG.getConstant(0, CmpOp0.getValueType()),
14756 CmpOp0);
14757 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14758 DAG.getConstant(X86::COND_B, MVT::i8),
14759 SDValue(Neg.getNode(), 1));
14760 return Res;
14761 }
14763 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14764 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
14765 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14767 SDValue Res = // Res = 0 or -1.
14768 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14769 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
14771 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14772 Res = DAG.getNOT(DL, Res, Res.getValueType());
14774 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14775 if (!N2C || !N2C->isNullValue())
14776 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14777 return Res;
14778 }
14779 }
14781 // Look past (and (setcc_carry (cmp ...)), 1).
14782 if (Cond.getOpcode() == ISD::AND &&
14783 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14784 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14785 if (C && C->getAPIntValue() == 1)
14786 Cond = Cond.getOperand(0);
14787 }
14789 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14790 // setting operand in place of the X86ISD::SETCC.
14791 unsigned CondOpcode = Cond.getOpcode();
14792 if (CondOpcode == X86ISD::SETCC ||
14793 CondOpcode == X86ISD::SETCC_CARRY) {
14794 CC = Cond.getOperand(0);
14796 SDValue Cmp = Cond.getOperand(1);
14797 unsigned Opc = Cmp.getOpcode();
14798 MVT VT = Op.getSimpleValueType();
14800 bool IllegalFPCMov = false;
14801 if (VT.isFloatingPoint() && !VT.isVector() &&
14802 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14803 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14805 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14806 Opc == X86ISD::BT) { // FIXME
14807 Cond = Cmp;
14808 addTest = false;
14809 }
14810 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14811 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14812 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14813 Cond.getOperand(0).getValueType() != MVT::i8)) {
14814 SDValue LHS = Cond.getOperand(0);
14815 SDValue RHS = Cond.getOperand(1);
14816 unsigned X86Opcode;
14817 unsigned X86Cond;
14818 SDVTList VTs;
14819 switch (CondOpcode) {
14820 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14821 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14822 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14823 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14824 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14825 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14826 default: llvm_unreachable("unexpected overflowing operator");
14827 }
14828 if (CondOpcode == ISD::UMULO)
14829 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14830 MVT::i32);
14831 else
14832 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14834 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14836 if (CondOpcode == ISD::UMULO)
14837 Cond = X86Op.getValue(2);
14838 else
14839 Cond = X86Op.getValue(1);
14841 CC = DAG.getConstant(X86Cond, MVT::i8);
14842 addTest = false;
14843 }
14845 if (addTest) {
14846 // Look pass the truncate if the high bits are known zero.
14847 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14848 Cond = Cond.getOperand(0);
14850 // We know the result of AND is compared against zero. Try to match
14851 // it to BT.
14852 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14853 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14854 if (NewSetCC.getNode()) {
14855 CC = NewSetCC.getOperand(0);
14856 Cond = NewSetCC.getOperand(1);
14857 addTest = false;
14858 }
14859 }
14860 }
14862 if (addTest) {
14863 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14864 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14865 }
14867 // a < b ? -1 : 0 -> RES = ~setcc_carry
14868 // a < b ? 0 : -1 -> RES = setcc_carry
14869 // a >= b ? -1 : 0 -> RES = setcc_carry
14870 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14871 if (Cond.getOpcode() == X86ISD::SUB) {
14872 Cond = ConvertCmpIfNecessary(Cond, DAG);
14873 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14875 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14876 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14877 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14878 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14879 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14880 return DAG.getNOT(DL, Res, Res.getValueType());
14881 return Res;
14882 }
14883 }
14885 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14886 // widen the cmov and push the truncate through. This avoids introducing a new
14887 // branch during isel and doesn't add any extensions.
14888 if (Op.getValueType() == MVT::i8 &&
14889 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14890 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14891 if (T1.getValueType() == T2.getValueType() &&
14892 // Blacklist CopyFromReg to avoid partial register stalls.
14893 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14894 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14895 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14896 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14897 }
14898 }
14900 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14901 // condition is true.
14902 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14903 SDValue Ops[] = { Op2, Op1, CC, Cond };
14904 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14905 }
14907 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
14908 MVT VT = Op->getSimpleValueType(0);
14909 SDValue In = Op->getOperand(0);
14910 MVT InVT = In.getSimpleValueType();
14911 SDLoc dl(Op);
14913 unsigned int NumElts = VT.getVectorNumElements();
14914 if (NumElts != 8 && NumElts != 16)
14915 return SDValue();
14917 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
14918 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14920 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14921 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14923 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
14924 Constant *C = ConstantInt::get(*DAG.getContext(),
14925 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
14927 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
14928 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
14929 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
14930 MachinePointerInfo::getConstantPool(),
14931 false, false, false, Alignment);
14932 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
14933 if (VT.is512BitVector())
14934 return Brcst;
14935 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
14936 }
14938 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
14939 SelectionDAG &DAG) {
14940 MVT VT = Op->getSimpleValueType(0);
14941 SDValue In = Op->getOperand(0);
14942 MVT InVT = In.getSimpleValueType();
14943 SDLoc dl(Op);
14945 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
14946 return LowerSIGN_EXTEND_AVX512(Op, DAG);
14948 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
14949 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
14950 (VT != MVT::v16i16 || InVT != MVT::v16i8))
14951 return SDValue();
14953 if (Subtarget->hasInt256())
14954 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14956 // Optimize vectors in AVX mode
14957 // Sign extend v8i16 to v8i32 and
14958 // v4i32 to v4i64
14959 //
14960 // Divide input vector into two parts
14961 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
14962 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
14963 // concat the vectors to original VT
14965 unsigned NumElems = InVT.getVectorNumElements();
14966 SDValue Undef = DAG.getUNDEF(InVT);
14968 SmallVector<int,8> ShufMask1(NumElems, -1);
14969 for (unsigned i = 0; i != NumElems/2; ++i)
14970 ShufMask1[i] = i;
14972 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
14974 SmallVector<int,8> ShufMask2(NumElems, -1);
14975 for (unsigned i = 0; i != NumElems/2; ++i)
14976 ShufMask2[i] = i + NumElems/2;
14978 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
14980 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
14981 VT.getVectorNumElements()/2);
14983 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
14984 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
14986 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
14987 }
14989 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
14990 // may emit an illegal shuffle but the expansion is still better than scalar
14991 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
14992 // we'll emit a shuffle and a arithmetic shift.
14993 // TODO: It is possible to support ZExt by zeroing the undef values during
14994 // the shuffle phase or after the shuffle.
14995 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
14996 SelectionDAG &DAG) {
14997 MVT RegVT = Op.getSimpleValueType();
14998 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
14999 assert(RegVT.isInteger() &&
15000 "We only custom lower integer vector sext loads.");
15002 // Nothing useful we can do without SSE2 shuffles.
15003 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15005 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15006 SDLoc dl(Ld);
15007 EVT MemVT = Ld->getMemoryVT();
15008 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15009 unsigned RegSz = RegVT.getSizeInBits();
15011 ISD::LoadExtType Ext = Ld->getExtensionType();
15013 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15014 && "Only anyext and sext are currently implemented.");
15015 assert(MemVT != RegVT && "Cannot extend to the same type");
15016 assert(MemVT.isVector() && "Must load a vector from memory");
15018 unsigned NumElems = RegVT.getVectorNumElements();
15019 unsigned MemSz = MemVT.getSizeInBits();
15020 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15022 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15023 // The only way in which we have a legal 256-bit vector result but not the
15024 // integer 256-bit operations needed to directly lower a sextload is if we
15025 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15026 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15027 // correctly legalized. We do this late to allow the canonical form of
15028 // sextload to persist throughout the rest of the DAG combiner -- it wants
15029 // to fold together any extensions it can, and so will fuse a sign_extend
15030 // of an sextload into a sextload targeting a wider value.
15031 SDValue Load;
15032 if (MemSz == 128) {
15033 // Just switch this to a normal load.
15034 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15035 "it must be a legal 128-bit vector "
15036 "type!");
15037 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15038 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15039 Ld->isInvariant(), Ld->getAlignment());
15040 } else {
15041 assert(MemSz < 128 &&
15042 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15043 // Do an sext load to a 128-bit vector type. We want to use the same
15044 // number of elements, but elements half as wide. This will end up being
15045 // recursively lowered by this routine, but will succeed as we definitely
15046 // have all the necessary features if we're using AVX1.
15047 EVT HalfEltVT =
15048 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15049 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15050 Load =
15051 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15052 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15053 Ld->isNonTemporal(), Ld->isInvariant(),
15054 Ld->getAlignment());
15055 }
15057 // Replace chain users with the new chain.
15058 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15059 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15061 // Finally, do a normal sign-extend to the desired register.
15062 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15063 }
15065 // All sizes must be a power of two.
15066 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15067 "Non-power-of-two elements are not custom lowered!");
15069 // Attempt to load the original value using scalar loads.
15070 // Find the largest scalar type that divides the total loaded size.
15071 MVT SclrLoadTy = MVT::i8;
15072 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
15073 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
15074 MVT Tp = (MVT::SimpleValueType)tp;
15075 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15076 SclrLoadTy = Tp;
15077 }
15078 }
15080 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15081 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15082 (64 <= MemSz))
15083 SclrLoadTy = MVT::f64;
15085 // Calculate the number of scalar loads that we need to perform
15086 // in order to load our vector from memory.
15087 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15089 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15090 "Can only lower sext loads with a single scalar load!");
15092 unsigned loadRegZize = RegSz;
15093 if (Ext == ISD::SEXTLOAD && RegSz == 256)
15094 loadRegZize /= 2;
15096 // Represent our vector as a sequence of elements which are the
15097 // largest scalar that we can load.
15098 EVT LoadUnitVecVT = EVT::getVectorVT(
15099 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15101 // Represent the data using the same element type that is stored in
15102 // memory. In practice, we ''widen'' MemVT.
15103 EVT WideVecVT =
15104 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15105 loadRegZize / MemVT.getScalarType().getSizeInBits());
15107 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15108 "Invalid vector type");
15110 // We can't shuffle using an illegal type.
15111 assert(TLI.isTypeLegal(WideVecVT) &&
15112 "We only lower types that form legal widened vector types");
15114 SmallVector<SDValue, 8> Chains;
15115 SDValue Ptr = Ld->getBasePtr();
15116 SDValue Increment =
15117 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
15118 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15120 for (unsigned i = 0; i < NumLoads; ++i) {
15121 // Perform a single load.
15122 SDValue ScalarLoad =
15123 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15124 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15125 Ld->getAlignment());
15126 Chains.push_back(ScalarLoad.getValue(1));
15127 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15128 // another round of DAGCombining.
15129 if (i == 0)
15130 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15131 else
15132 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15133 ScalarLoad, DAG.getIntPtrConstant(i));
15135 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15136 }
15138 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15140 // Bitcast the loaded value to a vector of the original element type, in
15141 // the size of the target vector type.
15142 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
15143 unsigned SizeRatio = RegSz / MemSz;
15145 if (Ext == ISD::SEXTLOAD) {
15146 // If we have SSE4.1, we can directly emit a VSEXT node.
15147 if (Subtarget->hasSSE41()) {
15148 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15149 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15150 return Sext;
15151 }
15153 // Otherwise we'll shuffle the small elements in the high bits of the
15154 // larger type and perform an arithmetic shift. If the shift is not legal
15155 // it's better to scalarize.
15156 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
15157 "We can't implement a sext load without an arithmetic right shift!");
15159 // Redistribute the loaded elements into the different locations.
15160 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15161 for (unsigned i = 0; i != NumElems; ++i)
15162 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
15164 SDValue Shuff = DAG.getVectorShuffle(
15165 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15167 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15169 // Build the arithmetic shift.
15170 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
15171 MemVT.getVectorElementType().getSizeInBits();
15172 Shuff =
15173 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
15175 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15176 return Shuff;
15177 }
15179 // Redistribute the loaded elements into the different locations.
15180 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15181 for (unsigned i = 0; i != NumElems; ++i)
15182 ShuffleVec[i * SizeRatio] = i;
15184 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15185 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15187 // Bitcast to the requested type.
15188 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15189 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15190 return Shuff;
15191 }
15193 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15194 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15195 // from the AND / OR.
15196 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15197 Opc = Op.getOpcode();
15198 if (Opc != ISD::OR && Opc != ISD::AND)
15199 return false;
15200 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15201 Op.getOperand(0).hasOneUse() &&
15202 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15203 Op.getOperand(1).hasOneUse());
15204 }
15206 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15207 // 1 and that the SETCC node has a single use.
15208 static bool isXor1OfSetCC(SDValue Op) {
15209 if (Op.getOpcode() != ISD::XOR)
15210 return false;
15211 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
15212 if (N1C && N1C->getAPIntValue() == 1) {
15213 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15214 Op.getOperand(0).hasOneUse();
15215 }
15216 return false;
15217 }
15219 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15220 bool addTest = true;
15221 SDValue Chain = Op.getOperand(0);
15222 SDValue Cond = Op.getOperand(1);
15223 SDValue Dest = Op.getOperand(2);
15224 SDLoc dl(Op);
15225 SDValue CC;
15226 bool Inverted = false;
15228 if (Cond.getOpcode() == ISD::SETCC) {
15229 // Check for setcc([su]{add,sub,mul}o == 0).
15230 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15231 isa<ConstantSDNode>(Cond.getOperand(1)) &&
15232 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
15233 Cond.getOperand(0).getResNo() == 1 &&
15234 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15235 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15236 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15237 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15238 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15239 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15240 Inverted = true;
15241 Cond = Cond.getOperand(0);
15242 } else {
15243 SDValue NewCond = LowerSETCC(Cond, DAG);
15244 if (NewCond.getNode())
15245 Cond = NewCond;
15246 }
15247 }
15248 #if 0
15249 // FIXME: LowerXALUO doesn't handle these!!
15250 else if (Cond.getOpcode() == X86ISD::ADD ||
15251 Cond.getOpcode() == X86ISD::SUB ||
15252 Cond.getOpcode() == X86ISD::SMUL ||
15253 Cond.getOpcode() == X86ISD::UMUL)
15254 Cond = LowerXALUO(Cond, DAG);
15255 #endif
15257 // Look pass (and (setcc_carry (cmp ...)), 1).
15258 if (Cond.getOpcode() == ISD::AND &&
15259 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15260 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15261 if (C && C->getAPIntValue() == 1)
15262 Cond = Cond.getOperand(0);
15263 }
15265 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15266 // setting operand in place of the X86ISD::SETCC.
15267 unsigned CondOpcode = Cond.getOpcode();
15268 if (CondOpcode == X86ISD::SETCC ||
15269 CondOpcode == X86ISD::SETCC_CARRY) {
15270 CC = Cond.getOperand(0);
15272 SDValue Cmp = Cond.getOperand(1);
15273 unsigned Opc = Cmp.getOpcode();
15274 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15275 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15276 Cond = Cmp;
15277 addTest = false;
15278 } else {
15279 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15280 default: break;
15281 case X86::COND_O:
15282 case X86::COND_B:
15283 // These can only come from an arithmetic instruction with overflow,
15284 // e.g. SADDO, UADDO.
15285 Cond = Cond.getNode()->getOperand(1);
15286 addTest = false;
15287 break;
15288 }
15289 }
15290 }
15291 CondOpcode = Cond.getOpcode();
15292 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15293 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15294 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15295 Cond.getOperand(0).getValueType() != MVT::i8)) {
15296 SDValue LHS = Cond.getOperand(0);
15297 SDValue RHS = Cond.getOperand(1);
15298 unsigned X86Opcode;
15299 unsigned X86Cond;
15300 SDVTList VTs;
15301 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15302 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15303 // X86ISD::INC).
15304 switch (CondOpcode) {
15305 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15306 case ISD::SADDO:
15307 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15308 if (C->isOne()) {
15309 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15310 break;
15311 }
15312 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15313 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15314 case ISD::SSUBO:
15315 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15316 if (C->isOne()) {
15317 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15318 break;
15319 }
15320 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15321 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15322 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15323 default: llvm_unreachable("unexpected overflowing operator");
15324 }
15325 if (Inverted)
15326 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15327 if (CondOpcode == ISD::UMULO)
15328 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15329 MVT::i32);
15330 else
15331 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15333 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15335 if (CondOpcode == ISD::UMULO)
15336 Cond = X86Op.getValue(2);
15337 else
15338 Cond = X86Op.getValue(1);
15340 CC = DAG.getConstant(X86Cond, MVT::i8);
15341 addTest = false;
15342 } else {
15343 unsigned CondOpc;
15344 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15345 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15346 if (CondOpc == ISD::OR) {
15347 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15348 // two branches instead of an explicit OR instruction with a
15349 // separate test.
15350 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15351 isX86LogicalCmp(Cmp)) {
15352 CC = Cond.getOperand(0).getOperand(0);
15353 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15354 Chain, Dest, CC, Cmp);
15355 CC = Cond.getOperand(1).getOperand(0);
15356 Cond = Cmp;
15357 addTest = false;
15358 }
15359 } else { // ISD::AND
15360 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15361 // two branches instead of an explicit AND instruction with a
15362 // separate test. However, we only do this if this block doesn't
15363 // have a fall-through edge, because this requires an explicit
15364 // jmp when the condition is false.
15365 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15366 isX86LogicalCmp(Cmp) &&
15367 Op.getNode()->hasOneUse()) {
15368 X86::CondCode CCode =
15369 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15370 CCode = X86::GetOppositeBranchCondition(CCode);
15371 CC = DAG.getConstant(CCode, MVT::i8);
15372 SDNode *User = *Op.getNode()->use_begin();
15373 // Look for an unconditional branch following this conditional branch.
15374 // We need this because we need to reverse the successors in order
15375 // to implement FCMP_OEQ.
15376 if (User->getOpcode() == ISD::BR) {
15377 SDValue FalseBB = User->getOperand(1);
15378 SDNode *NewBR =
15379 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15380 assert(NewBR == User);
15381 (void)NewBR;
15382 Dest = FalseBB;
15384 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15385 Chain, Dest, CC, Cmp);
15386 X86::CondCode CCode =
15387 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15388 CCode = X86::GetOppositeBranchCondition(CCode);
15389 CC = DAG.getConstant(CCode, MVT::i8);
15390 Cond = Cmp;
15391 addTest = false;
15392 }
15393 }
15394 }
15395 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15396 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15397 // It should be transformed during dag combiner except when the condition
15398 // is set by a arithmetics with overflow node.
15399 X86::CondCode CCode =
15400 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15401 CCode = X86::GetOppositeBranchCondition(CCode);
15402 CC = DAG.getConstant(CCode, MVT::i8);
15403 Cond = Cond.getOperand(0).getOperand(1);
15404 addTest = false;
15405 } else if (Cond.getOpcode() == ISD::SETCC &&
15406 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15407 // For FCMP_OEQ, we can emit
15408 // two branches instead of an explicit AND instruction with a
15409 // separate test. However, we only do this if this block doesn't
15410 // have a fall-through edge, because this requires an explicit
15411 // jmp when the condition is false.
15412 if (Op.getNode()->hasOneUse()) {
15413 SDNode *User = *Op.getNode()->use_begin();
15414 // Look for an unconditional branch following this conditional branch.
15415 // We need this because we need to reverse the successors in order
15416 // to implement FCMP_OEQ.
15417 if (User->getOpcode() == ISD::BR) {
15418 SDValue FalseBB = User->getOperand(1);
15419 SDNode *NewBR =
15420 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15421 assert(NewBR == User);
15422 (void)NewBR;
15423 Dest = FalseBB;
15425 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15426 Cond.getOperand(0), Cond.getOperand(1));
15427 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15428 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15429 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15430 Chain, Dest, CC, Cmp);
15431 CC = DAG.getConstant(X86::COND_P, MVT::i8);
15432 Cond = Cmp;
15433 addTest = false;
15434 }
15435 }
15436 } else if (Cond.getOpcode() == ISD::SETCC &&
15437 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15438 // For FCMP_UNE, we can emit
15439 // two branches instead of an explicit AND instruction with a
15440 // separate test. However, we only do this if this block doesn't
15441 // have a fall-through edge, because this requires an explicit
15442 // jmp when the condition is false.
15443 if (Op.getNode()->hasOneUse()) {
15444 SDNode *User = *Op.getNode()->use_begin();
15445 // Look for an unconditional branch following this conditional branch.
15446 // We need this because we need to reverse the successors in order
15447 // to implement FCMP_UNE.
15448 if (User->getOpcode() == ISD::BR) {
15449 SDValue FalseBB = User->getOperand(1);
15450 SDNode *NewBR =
15451 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15452 assert(NewBR == User);
15453 (void)NewBR;
15455 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15456 Cond.getOperand(0), Cond.getOperand(1));
15457 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15458 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15459 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15460 Chain, Dest, CC, Cmp);
15461 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
15462 Cond = Cmp;
15463 addTest = false;
15464 Dest = FalseBB;
15465 }
15466 }
15467 }
15468 }
15470 if (addTest) {
15471 // Look pass the truncate if the high bits are known zero.
15472 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15473 Cond = Cond.getOperand(0);
15475 // We know the result of AND is compared against zero. Try to match
15476 // it to BT.
15477 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15478 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
15479 if (NewSetCC.getNode()) {
15480 CC = NewSetCC.getOperand(0);
15481 Cond = NewSetCC.getOperand(1);
15482 addTest = false;
15483 }
15484 }
15485 }
15487 if (addTest) {
15488 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15489 CC = DAG.getConstant(X86Cond, MVT::i8);
15490 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15491 }
15492 Cond = ConvertCmpIfNecessary(Cond, DAG);
15493 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15494 Chain, Dest, CC, Cond);
15495 }
15497 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15498 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15499 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15500 // that the guard pages used by the OS virtual memory manager are allocated in
15501 // correct sequence.
15502 SDValue
15503 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15504 SelectionDAG &DAG) const {
15505 MachineFunction &MF = DAG.getMachineFunction();
15506 bool SplitStack = MF.shouldSplitStack();
15507 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
15508 SplitStack;
15509 SDLoc dl(Op);
15511 if (!Lower) {
15512 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15513 SDNode* Node = Op.getNode();
15515 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15516 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15517 " not tell us which reg is the stack pointer!");
15518 EVT VT = Node->getValueType(0);
15519 SDValue Tmp1 = SDValue(Node, 0);
15520 SDValue Tmp2 = SDValue(Node, 1);
15521 SDValue Tmp3 = Node->getOperand(2);
15522 SDValue Chain = Tmp1.getOperand(0);
15524 // Chain the dynamic stack allocation so that it doesn't modify the stack
15525 // pointer when other instructions are using the stack.
15526 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
15527 SDLoc(Node));
15529 SDValue Size = Tmp2.getOperand(1);
15530 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15531 Chain = SP.getValue(1);
15532 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15533 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
15534 unsigned StackAlign = TFI.getStackAlignment();
15535 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15536 if (Align > StackAlign)
15537 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
15538 DAG.getConstant(-(uint64_t)Align, VT));
15539 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
15541 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
15542 DAG.getIntPtrConstant(0, true), SDValue(),
15543 SDLoc(Node));
15545 SDValue Ops[2] = { Tmp1, Tmp2 };
15546 return DAG.getMergeValues(Ops, dl);
15547 }
15549 // Get the inputs.
15550 SDValue Chain = Op.getOperand(0);
15551 SDValue Size = Op.getOperand(1);
15552 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15553 EVT VT = Op.getNode()->getValueType(0);
15555 bool Is64Bit = Subtarget->is64Bit();
15556 EVT SPTy = getPointerTy();
15558 if (SplitStack) {
15559 MachineRegisterInfo &MRI = MF.getRegInfo();
15561 if (Is64Bit) {
15562 // The 64 bit implementation of segmented stacks needs to clobber both r10
15563 // r11. This makes it impossible to use it along with nested parameters.
15564 const Function *F = MF.getFunction();
15566 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15567 I != E; ++I)
15568 if (I->hasNestAttr())
15569 report_fatal_error("Cannot use segmented stacks with functions that "
15570 "have nested arguments.");
15571 }
15573 const TargetRegisterClass *AddrRegClass =
15574 getRegClassFor(getPointerTy());
15575 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15576 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15577 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15578 DAG.getRegister(Vreg, SPTy));
15579 SDValue Ops1[2] = { Value, Chain };
15580 return DAG.getMergeValues(Ops1, dl);
15581 } else {
15582 SDValue Flag;
15583 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15585 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15586 Flag = Chain.getValue(1);
15587 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15589 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15591 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15592 DAG.getSubtarget().getRegisterInfo());
15593 unsigned SPReg = RegInfo->getStackRegister();
15594 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15595 Chain = SP.getValue(1);
15597 if (Align) {
15598 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15599 DAG.getConstant(-(uint64_t)Align, VT));
15600 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15601 }
15603 SDValue Ops1[2] = { SP, Chain };
15604 return DAG.getMergeValues(Ops1, dl);
15605 }
15606 }
15608 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15609 MachineFunction &MF = DAG.getMachineFunction();
15610 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15612 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15613 SDLoc DL(Op);
15615 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
15616 // vastart just stores the address of the VarArgsFrameIndex slot into the
15617 // memory location argument.
15618 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15619 getPointerTy());
15620 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15621 MachinePointerInfo(SV), false, false, 0);
15622 }
15624 // __va_list_tag:
15625 // gp_offset (0 - 6 * 8)
15626 // fp_offset (48 - 48 + 8 * 16)
15627 // overflow_arg_area (point to parameters coming in memory).
15628 // reg_save_area
15629 SmallVector<SDValue, 8> MemOps;
15630 SDValue FIN = Op.getOperand(1);
15631 // Store gp_offset
15632 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15633 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15634 MVT::i32),
15635 FIN, MachinePointerInfo(SV), false, false, 0);
15636 MemOps.push_back(Store);
15638 // Store fp_offset
15639 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15640 FIN, DAG.getIntPtrConstant(4));
15641 Store = DAG.getStore(Op.getOperand(0), DL,
15642 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
15643 MVT::i32),
15644 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15645 MemOps.push_back(Store);
15647 // Store ptr to overflow_arg_area
15648 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15649 FIN, DAG.getIntPtrConstant(4));
15650 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15651 getPointerTy());
15652 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15653 MachinePointerInfo(SV, 8),
15654 false, false, 0);
15655 MemOps.push_back(Store);
15657 // Store ptr to reg_save_area.
15658 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15659 FIN, DAG.getIntPtrConstant(8));
15660 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
15661 getPointerTy());
15662 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
15663 MachinePointerInfo(SV, 16), false, false, 0);
15664 MemOps.push_back(Store);
15665 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15666 }
15668 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15669 assert(Subtarget->is64Bit() &&
15670 "LowerVAARG only handles 64-bit va_arg!");
15671 assert((Subtarget->isTargetLinux() ||
15672 Subtarget->isTargetDarwin()) &&
15673 "Unhandled target in LowerVAARG");
15674 assert(Op.getNode()->getNumOperands() == 4);
15675 SDValue Chain = Op.getOperand(0);
15676 SDValue SrcPtr = Op.getOperand(1);
15677 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15678 unsigned Align = Op.getConstantOperandVal(3);
15679 SDLoc dl(Op);
15681 EVT ArgVT = Op.getNode()->getValueType(0);
15682 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15683 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
15684 uint8_t ArgMode;
15686 // Decide which area this value should be read from.
15687 // TODO: Implement the AMD64 ABI in its entirety. This simple
15688 // selection mechanism works only for the basic types.
15689 if (ArgVT == MVT::f80) {
15690 llvm_unreachable("va_arg for f80 not yet implemented");
15691 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15692 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15693 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15694 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15695 } else {
15696 llvm_unreachable("Unhandled argument type in LowerVAARG");
15697 }
15699 if (ArgMode == 2) {
15700 // Sanity Check: Make sure using fp_offset makes sense.
15701 assert(!DAG.getTarget().Options.UseSoftFloat &&
15702 !(DAG.getMachineFunction()
15703 .getFunction()->getAttributes()
15704 .hasAttribute(AttributeSet::FunctionIndex,
15705 Attribute::NoImplicitFloat)) &&
15706 Subtarget->hasSSE1());
15707 }
15709 // Insert VAARG_64 node into the DAG
15710 // VAARG_64 returns two values: Variable Argument Address, Chain
15711 SmallVector<SDValue, 11> InstOps;
15712 InstOps.push_back(Chain);
15713 InstOps.push_back(SrcPtr);
15714 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
15715 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
15716 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
15717 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
15718 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15719 VTs, InstOps, MVT::i64,
15720 MachinePointerInfo(SV),
15721 /*Align=*/0,
15722 /*Volatile=*/false,
15723 /*ReadMem=*/true,
15724 /*WriteMem=*/true);
15725 Chain = VAARG.getValue(1);
15727 // Load the next argument and return it
15728 return DAG.getLoad(ArgVT, dl,
15729 Chain,
15730 VAARG,
15731 MachinePointerInfo(),
15732 false, false, false, 0);
15733 }
15735 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15736 SelectionDAG &DAG) {
15737 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
15738 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15739 SDValue Chain = Op.getOperand(0);
15740 SDValue DstPtr = Op.getOperand(1);
15741 SDValue SrcPtr = Op.getOperand(2);
15742 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15743 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15744 SDLoc DL(Op);
15746 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15747 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
15748 false,
15749 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15750 }
15752 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15753 // amount is a constant. Takes immediate version of shift as input.
15754 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15755 SDValue SrcOp, uint64_t ShiftAmt,
15756 SelectionDAG &DAG) {
15757 MVT ElementType = VT.getVectorElementType();
15759 // Fold this packed shift into its first operand if ShiftAmt is 0.
15760 if (ShiftAmt == 0)
15761 return SrcOp;
15763 // Check for ShiftAmt >= element width
15764 if (ShiftAmt >= ElementType.getSizeInBits()) {
15765 if (Opc == X86ISD::VSRAI)
15766 ShiftAmt = ElementType.getSizeInBits() - 1;
15767 else
15768 return DAG.getConstant(0, VT);
15769 }
15771 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15772 && "Unknown target vector shift-by-constant node");
15774 // Fold this packed vector shift into a build vector if SrcOp is a
15775 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15776 if (VT == SrcOp.getSimpleValueType() &&
15777 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15778 SmallVector<SDValue, 8> Elts;
15779 unsigned NumElts = SrcOp->getNumOperands();
15780 ConstantSDNode *ND;
15782 switch(Opc) {
15783 default: llvm_unreachable(nullptr);
15784 case X86ISD::VSHLI:
15785 for (unsigned i=0; i!=NumElts; ++i) {
15786 SDValue CurrentOp = SrcOp->getOperand(i);
15787 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15788 Elts.push_back(CurrentOp);
15789 continue;
15790 }
15791 ND = cast<ConstantSDNode>(CurrentOp);
15792 const APInt &C = ND->getAPIntValue();
15793 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15794 }
15795 break;
15796 case X86ISD::VSRLI:
15797 for (unsigned i=0; i!=NumElts; ++i) {
15798 SDValue CurrentOp = SrcOp->getOperand(i);
15799 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15800 Elts.push_back(CurrentOp);
15801 continue;
15802 }
15803 ND = cast<ConstantSDNode>(CurrentOp);
15804 const APInt &C = ND->getAPIntValue();
15805 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15806 }
15807 break;
15808 case X86ISD::VSRAI:
15809 for (unsigned i=0; i!=NumElts; ++i) {
15810 SDValue CurrentOp = SrcOp->getOperand(i);
15811 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15812 Elts.push_back(CurrentOp);
15813 continue;
15814 }
15815 ND = cast<ConstantSDNode>(CurrentOp);
15816 const APInt &C = ND->getAPIntValue();
15817 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15818 }
15819 break;
15820 }
15822 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15823 }
15825 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15826 }
15828 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15829 // may or may not be a constant. Takes immediate version of shift as input.
15830 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15831 SDValue SrcOp, SDValue ShAmt,
15832 SelectionDAG &DAG) {
15833 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15835 // Catch shift-by-constant.
15836 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15837 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15838 CShAmt->getZExtValue(), DAG);
15840 // Change opcode to non-immediate version
15841 switch (Opc) {
15842 default: llvm_unreachable("Unknown target vector shift node");
15843 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15844 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15845 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15846 }
15848 // Need to build a vector containing shift amount
15849 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15850 SDValue ShOps[4];
15851 ShOps[0] = ShAmt;
15852 ShOps[1] = DAG.getConstant(0, MVT::i32);
15853 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15854 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15856 // The return type has to be a 128-bit type with the same element
15857 // type as the input type.
15858 MVT EltVT = VT.getVectorElementType();
15859 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15861 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15862 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15863 }
15865 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
15866 /// necessary casting for \p Mask when lowering masking intrinsics.
15867 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15868 SDValue PreservedSrc, SelectionDAG &DAG) {
15869 EVT VT = Op.getValueType();
15870 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15871 MVT::i1, VT.getVectorNumElements());
15872 SDLoc dl(Op);
15874 assert(MaskVT.isSimple() && "invalid mask type");
15875 return DAG.getNode(ISD::VSELECT, dl, VT,
15876 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
15877 Op, PreservedSrc);
15878 }
15880 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
15881 switch (IntNo) {
15882 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15883 case Intrinsic::x86_fma_vfmadd_ps:
15884 case Intrinsic::x86_fma_vfmadd_pd:
15885 case Intrinsic::x86_fma_vfmadd_ps_256:
15886 case Intrinsic::x86_fma_vfmadd_pd_256:
15887 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15888 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15889 return X86ISD::FMADD;
15890 case Intrinsic::x86_fma_vfmsub_ps:
15891 case Intrinsic::x86_fma_vfmsub_pd:
15892 case Intrinsic::x86_fma_vfmsub_ps_256:
15893 case Intrinsic::x86_fma_vfmsub_pd_256:
15894 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15895 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15896 return X86ISD::FMSUB;
15897 case Intrinsic::x86_fma_vfnmadd_ps:
15898 case Intrinsic::x86_fma_vfnmadd_pd:
15899 case Intrinsic::x86_fma_vfnmadd_ps_256:
15900 case Intrinsic::x86_fma_vfnmadd_pd_256:
15901 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15902 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15903 return X86ISD::FNMADD;
15904 case Intrinsic::x86_fma_vfnmsub_ps:
15905 case Intrinsic::x86_fma_vfnmsub_pd:
15906 case Intrinsic::x86_fma_vfnmsub_ps_256:
15907 case Intrinsic::x86_fma_vfnmsub_pd_256:
15908 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15909 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15910 return X86ISD::FNMSUB;
15911 case Intrinsic::x86_fma_vfmaddsub_ps:
15912 case Intrinsic::x86_fma_vfmaddsub_pd:
15913 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15914 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15915 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15916 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15917 return X86ISD::FMADDSUB;
15918 case Intrinsic::x86_fma_vfmsubadd_ps:
15919 case Intrinsic::x86_fma_vfmsubadd_pd:
15920 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15921 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15922 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15923 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
15924 return X86ISD::FMSUBADD;
15925 }
15926 }
15928 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
15929 SDLoc dl(Op);
15930 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15932 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
15933 if (IntrData) {
15934 switch(IntrData->Type) {
15935 case INTR_TYPE_1OP:
15936 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
15937 case INTR_TYPE_2OP:
15938 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15939 Op.getOperand(2));
15940 case INTR_TYPE_3OP:
15941 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15942 Op.getOperand(2), Op.getOperand(3));
15943 case COMI: { // Comparison intrinsics
15944 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
15945 SDValue LHS = Op.getOperand(1);
15946 SDValue RHS = Op.getOperand(2);
15947 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
15948 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
15949 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
15950 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15951 DAG.getConstant(X86CC, MVT::i8), Cond);
15952 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15953 }
15954 case VSHIFT:
15955 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
15956 Op.getOperand(1), Op.getOperand(2), DAG);
15957 default:
15958 break;
15959 }
15960 }
15962 switch (IntNo) {
15963 default: return SDValue(); // Don't custom lower most intrinsics.
15965 // Arithmetic intrinsics.
15966 case Intrinsic::x86_sse2_pmulu_dq:
15967 case Intrinsic::x86_avx2_pmulu_dq:
15968 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
15969 Op.getOperand(1), Op.getOperand(2));
15971 case Intrinsic::x86_sse41_pmuldq:
15972 case Intrinsic::x86_avx2_pmul_dq:
15973 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
15974 Op.getOperand(1), Op.getOperand(2));
15976 case Intrinsic::x86_sse2_pmulhu_w:
15977 case Intrinsic::x86_avx2_pmulhu_w:
15978 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
15979 Op.getOperand(1), Op.getOperand(2));
15981 case Intrinsic::x86_sse2_pmulh_w:
15982 case Intrinsic::x86_avx2_pmulh_w:
15983 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
15984 Op.getOperand(1), Op.getOperand(2));
15986 // SSE/SSE2/AVX floating point max/min intrinsics.
15987 case Intrinsic::x86_sse_max_ps:
15988 case Intrinsic::x86_sse2_max_pd:
15989 case Intrinsic::x86_avx_max_ps_256:
15990 case Intrinsic::x86_avx_max_pd_256:
15991 case Intrinsic::x86_sse_min_ps:
15992 case Intrinsic::x86_sse2_min_pd:
15993 case Intrinsic::x86_avx_min_ps_256:
15994 case Intrinsic::x86_avx_min_pd_256: {
15995 unsigned Opcode;
15996 switch (IntNo) {
15997 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15998 case Intrinsic::x86_sse_max_ps:
15999 case Intrinsic::x86_sse2_max_pd:
16000 case Intrinsic::x86_avx_max_ps_256:
16001 case Intrinsic::x86_avx_max_pd_256:
16002 Opcode = X86ISD::FMAX;
16003 break;
16004 case Intrinsic::x86_sse_min_ps:
16005 case Intrinsic::x86_sse2_min_pd:
16006 case Intrinsic::x86_avx_min_ps_256:
16007 case Intrinsic::x86_avx_min_pd_256:
16008 Opcode = X86ISD::FMIN;
16009 break;
16010 }
16011 return DAG.getNode(Opcode, dl, Op.getValueType(),
16012 Op.getOperand(1), Op.getOperand(2));
16013 }
16015 // AVX2 variable shift intrinsics
16016 case Intrinsic::x86_avx2_psllv_d:
16017 case Intrinsic::x86_avx2_psllv_q:
16018 case Intrinsic::x86_avx2_psllv_d_256:
16019 case Intrinsic::x86_avx2_psllv_q_256:
16020 case Intrinsic::x86_avx2_psrlv_d:
16021 case Intrinsic::x86_avx2_psrlv_q:
16022 case Intrinsic::x86_avx2_psrlv_d_256:
16023 case Intrinsic::x86_avx2_psrlv_q_256:
16024 case Intrinsic::x86_avx2_psrav_d:
16025 case Intrinsic::x86_avx2_psrav_d_256: {
16026 unsigned Opcode;
16027 switch (IntNo) {
16028 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16029 case Intrinsic::x86_avx2_psllv_d:
16030 case Intrinsic::x86_avx2_psllv_q:
16031 case Intrinsic::x86_avx2_psllv_d_256:
16032 case Intrinsic::x86_avx2_psllv_q_256:
16033 Opcode = ISD::SHL;
16034 break;
16035 case Intrinsic::x86_avx2_psrlv_d:
16036 case Intrinsic::x86_avx2_psrlv_q:
16037 case Intrinsic::x86_avx2_psrlv_d_256:
16038 case Intrinsic::x86_avx2_psrlv_q_256:
16039 Opcode = ISD::SRL;
16040 break;
16041 case Intrinsic::x86_avx2_psrav_d:
16042 case Intrinsic::x86_avx2_psrav_d_256:
16043 Opcode = ISD::SRA;
16044 break;
16045 }
16046 return DAG.getNode(Opcode, dl, Op.getValueType(),
16047 Op.getOperand(1), Op.getOperand(2));
16048 }
16050 case Intrinsic::x86_sse2_packssdw_128:
16051 case Intrinsic::x86_sse2_packsswb_128:
16052 case Intrinsic::x86_avx2_packssdw:
16053 case Intrinsic::x86_avx2_packsswb:
16054 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
16055 Op.getOperand(1), Op.getOperand(2));
16057 case Intrinsic::x86_sse2_packuswb_128:
16058 case Intrinsic::x86_sse41_packusdw:
16059 case Intrinsic::x86_avx2_packuswb:
16060 case Intrinsic::x86_avx2_packusdw:
16061 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
16062 Op.getOperand(1), Op.getOperand(2));
16064 case Intrinsic::x86_ssse3_pshuf_b_128:
16065 case Intrinsic::x86_avx2_pshuf_b:
16066 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
16067 Op.getOperand(1), Op.getOperand(2));
16069 case Intrinsic::x86_sse2_pshuf_d:
16070 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
16071 Op.getOperand(1), Op.getOperand(2));
16073 case Intrinsic::x86_sse2_pshufl_w:
16074 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
16075 Op.getOperand(1), Op.getOperand(2));
16077 case Intrinsic::x86_sse2_pshufh_w:
16078 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
16079 Op.getOperand(1), Op.getOperand(2));
16081 case Intrinsic::x86_ssse3_psign_b_128:
16082 case Intrinsic::x86_ssse3_psign_w_128:
16083 case Intrinsic::x86_ssse3_psign_d_128:
16084 case Intrinsic::x86_avx2_psign_b:
16085 case Intrinsic::x86_avx2_psign_w:
16086 case Intrinsic::x86_avx2_psign_d:
16087 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
16088 Op.getOperand(1), Op.getOperand(2));
16090 case Intrinsic::x86_avx2_permd:
16091 case Intrinsic::x86_avx2_permps:
16092 // Operands intentionally swapped. Mask is last operand to intrinsic,
16093 // but second operand for node/instruction.
16094 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16095 Op.getOperand(2), Op.getOperand(1));
16097 case Intrinsic::x86_avx512_mask_valign_q_512:
16098 case Intrinsic::x86_avx512_mask_valign_d_512:
16099 // Vector source operands are swapped.
16100 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
16101 Op.getValueType(), Op.getOperand(2),
16102 Op.getOperand(1),
16103 Op.getOperand(3)),
16104 Op.getOperand(5), Op.getOperand(4), DAG);
16106 // ptest and testp intrinsics. The intrinsic these come from are designed to
16107 // return an integer value, not just an instruction so lower it to the ptest
16108 // or testp pattern and a setcc for the result.
16109 case Intrinsic::x86_sse41_ptestz:
16110 case Intrinsic::x86_sse41_ptestc:
16111 case Intrinsic::x86_sse41_ptestnzc:
16112 case Intrinsic::x86_avx_ptestz_256:
16113 case Intrinsic::x86_avx_ptestc_256:
16114 case Intrinsic::x86_avx_ptestnzc_256:
16115 case Intrinsic::x86_avx_vtestz_ps:
16116 case Intrinsic::x86_avx_vtestc_ps:
16117 case Intrinsic::x86_avx_vtestnzc_ps:
16118 case Intrinsic::x86_avx_vtestz_pd:
16119 case Intrinsic::x86_avx_vtestc_pd:
16120 case Intrinsic::x86_avx_vtestnzc_pd:
16121 case Intrinsic::x86_avx_vtestz_ps_256:
16122 case Intrinsic::x86_avx_vtestc_ps_256:
16123 case Intrinsic::x86_avx_vtestnzc_ps_256:
16124 case Intrinsic::x86_avx_vtestz_pd_256:
16125 case Intrinsic::x86_avx_vtestc_pd_256:
16126 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16127 bool IsTestPacked = false;
16128 unsigned X86CC;
16129 switch (IntNo) {
16130 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16131 case Intrinsic::x86_avx_vtestz_ps:
16132 case Intrinsic::x86_avx_vtestz_pd:
16133 case Intrinsic::x86_avx_vtestz_ps_256:
16134 case Intrinsic::x86_avx_vtestz_pd_256:
16135 IsTestPacked = true; // Fallthrough
16136 case Intrinsic::x86_sse41_ptestz:
16137 case Intrinsic::x86_avx_ptestz_256:
16138 // ZF = 1
16139 X86CC = X86::COND_E;
16140 break;
16141 case Intrinsic::x86_avx_vtestc_ps:
16142 case Intrinsic::x86_avx_vtestc_pd:
16143 case Intrinsic::x86_avx_vtestc_ps_256:
16144 case Intrinsic::x86_avx_vtestc_pd_256:
16145 IsTestPacked = true; // Fallthrough
16146 case Intrinsic::x86_sse41_ptestc:
16147 case Intrinsic::x86_avx_ptestc_256:
16148 // CF = 1
16149 X86CC = X86::COND_B;
16150 break;
16151 case Intrinsic::x86_avx_vtestnzc_ps:
16152 case Intrinsic::x86_avx_vtestnzc_pd:
16153 case Intrinsic::x86_avx_vtestnzc_ps_256:
16154 case Intrinsic::x86_avx_vtestnzc_pd_256:
16155 IsTestPacked = true; // Fallthrough
16156 case Intrinsic::x86_sse41_ptestnzc:
16157 case Intrinsic::x86_avx_ptestnzc_256:
16158 // ZF and CF = 0
16159 X86CC = X86::COND_A;
16160 break;
16161 }
16163 SDValue LHS = Op.getOperand(1);
16164 SDValue RHS = Op.getOperand(2);
16165 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16166 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16167 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16168 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16169 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16170 }
16171 case Intrinsic::x86_avx512_kortestz_w:
16172 case Intrinsic::x86_avx512_kortestc_w: {
16173 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16174 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
16175 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
16176 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16177 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16178 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16179 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16180 }
16182 case Intrinsic::x86_sse42_pcmpistria128:
16183 case Intrinsic::x86_sse42_pcmpestria128:
16184 case Intrinsic::x86_sse42_pcmpistric128:
16185 case Intrinsic::x86_sse42_pcmpestric128:
16186 case Intrinsic::x86_sse42_pcmpistrio128:
16187 case Intrinsic::x86_sse42_pcmpestrio128:
16188 case Intrinsic::x86_sse42_pcmpistris128:
16189 case Intrinsic::x86_sse42_pcmpestris128:
16190 case Intrinsic::x86_sse42_pcmpistriz128:
16191 case Intrinsic::x86_sse42_pcmpestriz128: {
16192 unsigned Opcode;
16193 unsigned X86CC;
16194 switch (IntNo) {
16195 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16196 case Intrinsic::x86_sse42_pcmpistria128:
16197 Opcode = X86ISD::PCMPISTRI;
16198 X86CC = X86::COND_A;
16199 break;
16200 case Intrinsic::x86_sse42_pcmpestria128:
16201 Opcode = X86ISD::PCMPESTRI;
16202 X86CC = X86::COND_A;
16203 break;
16204 case Intrinsic::x86_sse42_pcmpistric128:
16205 Opcode = X86ISD::PCMPISTRI;
16206 X86CC = X86::COND_B;
16207 break;
16208 case Intrinsic::x86_sse42_pcmpestric128:
16209 Opcode = X86ISD::PCMPESTRI;
16210 X86CC = X86::COND_B;
16211 break;
16212 case Intrinsic::x86_sse42_pcmpistrio128:
16213 Opcode = X86ISD::PCMPISTRI;
16214 X86CC = X86::COND_O;
16215 break;
16216 case Intrinsic::x86_sse42_pcmpestrio128:
16217 Opcode = X86ISD::PCMPESTRI;
16218 X86CC = X86::COND_O;
16219 break;
16220 case Intrinsic::x86_sse42_pcmpistris128:
16221 Opcode = X86ISD::PCMPISTRI;
16222 X86CC = X86::COND_S;
16223 break;
16224 case Intrinsic::x86_sse42_pcmpestris128:
16225 Opcode = X86ISD::PCMPESTRI;
16226 X86CC = X86::COND_S;
16227 break;
16228 case Intrinsic::x86_sse42_pcmpistriz128:
16229 Opcode = X86ISD::PCMPISTRI;
16230 X86CC = X86::COND_E;
16231 break;
16232 case Intrinsic::x86_sse42_pcmpestriz128:
16233 Opcode = X86ISD::PCMPESTRI;
16234 X86CC = X86::COND_E;
16235 break;
16236 }
16237 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16238 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16239 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16240 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16241 DAG.getConstant(X86CC, MVT::i8),
16242 SDValue(PCMP.getNode(), 1));
16243 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16244 }
16246 case Intrinsic::x86_sse42_pcmpistri128:
16247 case Intrinsic::x86_sse42_pcmpestri128: {
16248 unsigned Opcode;
16249 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16250 Opcode = X86ISD::PCMPISTRI;
16251 else
16252 Opcode = X86ISD::PCMPESTRI;
16254 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16255 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16256 return DAG.getNode(Opcode, dl, VTs, NewOps);
16257 }
16259 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16260 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16261 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16262 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16263 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16264 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16265 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16266 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16267 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16268 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16269 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16270 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
16271 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
16272 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
16273 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
16274 dl, Op.getValueType(),
16275 Op.getOperand(1),
16276 Op.getOperand(2),
16277 Op.getOperand(3)),
16278 Op.getOperand(4), Op.getOperand(1), DAG);
16279 else
16280 return SDValue();
16281 }
16283 case Intrinsic::x86_fma_vfmadd_ps:
16284 case Intrinsic::x86_fma_vfmadd_pd:
16285 case Intrinsic::x86_fma_vfmsub_ps:
16286 case Intrinsic::x86_fma_vfmsub_pd:
16287 case Intrinsic::x86_fma_vfnmadd_ps:
16288 case Intrinsic::x86_fma_vfnmadd_pd:
16289 case Intrinsic::x86_fma_vfnmsub_ps:
16290 case Intrinsic::x86_fma_vfnmsub_pd:
16291 case Intrinsic::x86_fma_vfmaddsub_ps:
16292 case Intrinsic::x86_fma_vfmaddsub_pd:
16293 case Intrinsic::x86_fma_vfmsubadd_ps:
16294 case Intrinsic::x86_fma_vfmsubadd_pd:
16295 case Intrinsic::x86_fma_vfmadd_ps_256:
16296 case Intrinsic::x86_fma_vfmadd_pd_256:
16297 case Intrinsic::x86_fma_vfmsub_ps_256:
16298 case Intrinsic::x86_fma_vfmsub_pd_256:
16299 case Intrinsic::x86_fma_vfnmadd_ps_256:
16300 case Intrinsic::x86_fma_vfnmadd_pd_256:
16301 case Intrinsic::x86_fma_vfnmsub_ps_256:
16302 case Intrinsic::x86_fma_vfnmsub_pd_256:
16303 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16304 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16305 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16306 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16307 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
16308 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
16309 }
16310 }
16312 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16313 SDValue Src, SDValue Mask, SDValue Base,
16314 SDValue Index, SDValue ScaleOp, SDValue Chain,
16315 const X86Subtarget * Subtarget) {
16316 SDLoc dl(Op);
16317 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16318 assert(C && "Invalid scale type");
16319 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16320 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16321 Index.getSimpleValueType().getVectorNumElements());
16322 SDValue MaskInReg;
16323 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16324 if (MaskC)
16325 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16326 else
16327 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16328 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16329 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16330 SDValue Segment = DAG.getRegister(0, MVT::i32);
16331 if (Src.getOpcode() == ISD::UNDEF)
16332 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
16333 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16334 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16335 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16336 return DAG.getMergeValues(RetOps, dl);
16337 }
16339 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16340 SDValue Src, SDValue Mask, SDValue Base,
16341 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16342 SDLoc dl(Op);
16343 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16344 assert(C && "Invalid scale type");
16345 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16346 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16347 SDValue Segment = DAG.getRegister(0, MVT::i32);
16348 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16349 Index.getSimpleValueType().getVectorNumElements());
16350 SDValue MaskInReg;
16351 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16352 if (MaskC)
16353 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16354 else
16355 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16356 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16357 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16358 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16359 return SDValue(Res, 1);
16360 }
16362 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16363 SDValue Mask, SDValue Base, SDValue Index,
16364 SDValue ScaleOp, SDValue Chain) {
16365 SDLoc dl(Op);
16366 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16367 assert(C && "Invalid scale type");
16368 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16369 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16370 SDValue Segment = DAG.getRegister(0, MVT::i32);
16371 EVT MaskVT =
16372 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16373 SDValue MaskInReg;
16374 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16375 if (MaskC)
16376 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16377 else
16378 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16379 //SDVTList VTs = DAG.getVTList(MVT::Other);
16380 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16381 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16382 return SDValue(Res, 0);
16383 }
16385 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16386 // read performance monitor counters (x86_rdpmc).
16387 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16388 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16389 SmallVectorImpl<SDValue> &Results) {
16390 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16391 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16392 SDValue LO, HI;
16394 // The ECX register is used to select the index of the performance counter
16395 // to read.
16396 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16397 N->getOperand(2));
16398 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16400 // Reads the content of a 64-bit performance counter and returns it in the
16401 // registers EDX:EAX.
16402 if (Subtarget->is64Bit()) {
16403 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16404 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16405 LO.getValue(2));
16406 } else {
16407 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16408 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16409 LO.getValue(2));
16410 }
16411 Chain = HI.getValue(1);
16413 if (Subtarget->is64Bit()) {
16414 // The EAX register is loaded with the low-order 32 bits. The EDX register
16415 // is loaded with the supported high-order bits of the counter.
16416 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16417 DAG.getConstant(32, MVT::i8));
16418 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16419 Results.push_back(Chain);
16420 return;
16421 }
16423 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16424 SDValue Ops[] = { LO, HI };
16425 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16426 Results.push_back(Pair);
16427 Results.push_back(Chain);
16428 }
16430 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
16431 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
16432 // also used to custom lower READCYCLECOUNTER nodes.
16433 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
16434 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16435 SmallVectorImpl<SDValue> &Results) {
16436 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16437 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
16438 SDValue LO, HI;
16440 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
16441 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
16442 // and the EAX register is loaded with the low-order 32 bits.
16443 if (Subtarget->is64Bit()) {
16444 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16445 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16446 LO.getValue(2));
16447 } else {
16448 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16449 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16450 LO.getValue(2));
16451 }
16452 SDValue Chain = HI.getValue(1);
16454 if (Opcode == X86ISD::RDTSCP_DAG) {
16455 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16457 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
16458 // the ECX register. Add 'ecx' explicitly to the chain.
16459 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
16460 HI.getValue(2));
16461 // Explicitly store the content of ECX at the location passed in input
16462 // to the 'rdtscp' intrinsic.
16463 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
16464 MachinePointerInfo(), false, false, 0);
16465 }
16467 if (Subtarget->is64Bit()) {
16468 // The EDX register is loaded with the high-order 32 bits of the MSR, and
16469 // the EAX register is loaded with the low-order 32 bits.
16470 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16471 DAG.getConstant(32, MVT::i8));
16472 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16473 Results.push_back(Chain);
16474 return;
16475 }
16477 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16478 SDValue Ops[] = { LO, HI };
16479 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16480 Results.push_back(Pair);
16481 Results.push_back(Chain);
16482 }
16484 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
16485 SelectionDAG &DAG) {
16486 SmallVector<SDValue, 2> Results;
16487 SDLoc DL(Op);
16488 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
16489 Results);
16490 return DAG.getMergeValues(Results, DL);
16491 }
16494 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16495 SelectionDAG &DAG) {
16496 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
16498 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
16499 if (!IntrData)
16500 return SDValue();
16502 SDLoc dl(Op);
16503 switch(IntrData->Type) {
16504 default:
16505 llvm_unreachable("Unknown Intrinsic Type");
16506 break;
16507 case RDSEED:
16508 case RDRAND: {
16509 // Emit the node with the right value type.
16510 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
16511 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16513 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
16514 // Otherwise return the value from Rand, which is always 0, casted to i32.
16515 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
16516 DAG.getConstant(1, Op->getValueType(1)),
16517 DAG.getConstant(X86::COND_B, MVT::i32),
16518 SDValue(Result.getNode(), 1) };
16519 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
16520 DAG.getVTList(Op->getValueType(1), MVT::Glue),
16521 Ops);
16523 // Return { result, isValid, chain }.
16524 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
16525 SDValue(Result.getNode(), 2));
16526 }
16527 case GATHER: {
16528 //gather(v1, mask, index, base, scale);
16529 SDValue Chain = Op.getOperand(0);
16530 SDValue Src = Op.getOperand(2);
16531 SDValue Base = Op.getOperand(3);
16532 SDValue Index = Op.getOperand(4);
16533 SDValue Mask = Op.getOperand(5);
16534 SDValue Scale = Op.getOperand(6);
16535 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
16536 Subtarget);
16537 }
16538 case SCATTER: {
16539 //scatter(base, mask, index, v1, scale);
16540 SDValue Chain = Op.getOperand(0);
16541 SDValue Base = Op.getOperand(2);
16542 SDValue Mask = Op.getOperand(3);
16543 SDValue Index = Op.getOperand(4);
16544 SDValue Src = Op.getOperand(5);
16545 SDValue Scale = Op.getOperand(6);
16546 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
16547 }
16548 case PREFETCH: {
16549 SDValue Hint = Op.getOperand(6);
16550 unsigned HintVal;
16551 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
16552 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
16553 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
16554 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
16555 SDValue Chain = Op.getOperand(0);
16556 SDValue Mask = Op.getOperand(2);
16557 SDValue Index = Op.getOperand(3);
16558 SDValue Base = Op.getOperand(4);
16559 SDValue Scale = Op.getOperand(5);
16560 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
16561 }
16562 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
16563 case RDTSC: {
16564 SmallVector<SDValue, 2> Results;
16565 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
16566 return DAG.getMergeValues(Results, dl);
16567 }
16568 // Read Performance Monitoring Counters.
16569 case RDPMC: {
16570 SmallVector<SDValue, 2> Results;
16571 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
16572 return DAG.getMergeValues(Results, dl);
16573 }
16574 // XTEST intrinsics.
16575 case XTEST: {
16576 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16577 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16578 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16579 DAG.getConstant(X86::COND_NE, MVT::i8),
16580 InTrans);
16581 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
16582 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
16583 Ret, SDValue(InTrans.getNode(), 1));
16584 }
16585 // ADC/ADCX/SBB
16586 case ADX: {
16587 SmallVector<SDValue, 2> Results;
16588 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16589 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
16590 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
16591 DAG.getConstant(-1, MVT::i8));
16592 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
16593 Op.getOperand(4), GenCF.getValue(1));
16594 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
16595 Op.getOperand(5), MachinePointerInfo(),
16596 false, false, 0);
16597 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16598 DAG.getConstant(X86::COND_B, MVT::i8),
16599 Res.getValue(1));
16600 Results.push_back(SetCC);
16601 Results.push_back(Store);
16602 return DAG.getMergeValues(Results, dl);
16603 }
16604 }
16605 }
16607 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
16608 SelectionDAG &DAG) const {
16609 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16610 MFI->setReturnAddressIsTaken(true);
16612 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
16613 return SDValue();
16615 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16616 SDLoc dl(Op);
16617 EVT PtrVT = getPointerTy();
16619 if (Depth > 0) {
16620 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
16621 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16622 DAG.getSubtarget().getRegisterInfo());
16623 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
16624 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16625 DAG.getNode(ISD::ADD, dl, PtrVT,
16626 FrameAddr, Offset),
16627 MachinePointerInfo(), false, false, false, 0);
16628 }
16630 // Just load the return address.
16631 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
16632 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16633 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
16634 }
16636 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
16637 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16638 MFI->setFrameAddressIsTaken(true);
16640 EVT VT = Op.getValueType();
16641 SDLoc dl(Op); // FIXME probably not meaningful
16642 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16643 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16644 DAG.getSubtarget().getRegisterInfo());
16645 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16646 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
16647 (FrameReg == X86::EBP && VT == MVT::i32)) &&
16648 "Invalid Frame Register!");
16649 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
16650 while (Depth--)
16651 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
16652 MachinePointerInfo(),
16653 false, false, false, 0);
16654 return FrameAddr;
16655 }
16657 // FIXME? Maybe this could be a TableGen attribute on some registers and
16658 // this table could be generated automatically from RegInfo.
16659 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
16660 EVT VT) const {
16661 unsigned Reg = StringSwitch<unsigned>(RegName)
16662 .Case("esp", X86::ESP)
16663 .Case("rsp", X86::RSP)
16664 .Default(0);
16665 if (Reg)
16666 return Reg;
16667 report_fatal_error("Invalid register name global variable");
16668 }
16670 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
16671 SelectionDAG &DAG) const {
16672 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16673 DAG.getSubtarget().getRegisterInfo());
16674 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
16675 }
16677 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
16678 SDValue Chain = Op.getOperand(0);
16679 SDValue Offset = Op.getOperand(1);
16680 SDValue Handler = Op.getOperand(2);
16681 SDLoc dl (Op);
16683 EVT PtrVT = getPointerTy();
16684 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16685 DAG.getSubtarget().getRegisterInfo());
16686 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16687 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
16688 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
16689 "Invalid Frame Register!");
16690 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
16691 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
16693 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
16694 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
16695 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
16696 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
16697 false, false, 0);
16698 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
16700 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
16701 DAG.getRegister(StoreAddrReg, PtrVT));
16702 }
16704 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
16705 SelectionDAG &DAG) const {
16706 SDLoc DL(Op);
16707 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
16708 DAG.getVTList(MVT::i32, MVT::Other),
16709 Op.getOperand(0), Op.getOperand(1));
16710 }
16712 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
16713 SelectionDAG &DAG) const {
16714 SDLoc DL(Op);
16715 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
16716 Op.getOperand(0), Op.getOperand(1));
16717 }
16719 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
16720 return Op.getOperand(0);
16721 }
16723 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
16724 SelectionDAG &DAG) const {
16725 SDValue Root = Op.getOperand(0);
16726 SDValue Trmp = Op.getOperand(1); // trampoline
16727 SDValue FPtr = Op.getOperand(2); // nested function
16728 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
16729 SDLoc dl (Op);
16731 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16732 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
16734 if (Subtarget->is64Bit()) {
16735 SDValue OutChains[6];
16737 // Large code-model.
16738 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
16739 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
16741 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
16742 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
16744 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
16746 // Load the pointer to the nested function into R11.
16747 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
16748 SDValue Addr = Trmp;
16749 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16750 Addr, MachinePointerInfo(TrmpAddr),
16751 false, false, 0);
16753 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16754 DAG.getConstant(2, MVT::i64));
16755 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
16756 MachinePointerInfo(TrmpAddr, 2),
16757 false, false, 2);
16759 // Load the 'nest' parameter value into R10.
16760 // R10 is specified in X86CallingConv.td
16761 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
16762 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16763 DAG.getConstant(10, MVT::i64));
16764 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16765 Addr, MachinePointerInfo(TrmpAddr, 10),
16766 false, false, 0);
16768 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16769 DAG.getConstant(12, MVT::i64));
16770 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
16771 MachinePointerInfo(TrmpAddr, 12),
16772 false, false, 2);
16774 // Jump to the nested function.
16775 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
16776 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16777 DAG.getConstant(20, MVT::i64));
16778 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16779 Addr, MachinePointerInfo(TrmpAddr, 20),
16780 false, false, 0);
16782 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16783 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16784 DAG.getConstant(22, MVT::i64));
16785 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16786 MachinePointerInfo(TrmpAddr, 22),
16787 false, false, 0);
16789 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16790 } else {
16791 const Function *Func =
16792 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16793 CallingConv::ID CC = Func->getCallingConv();
16794 unsigned NestReg;
16796 switch (CC) {
16797 default:
16798 llvm_unreachable("Unsupported calling convention");
16799 case CallingConv::C:
16800 case CallingConv::X86_StdCall: {
16801 // Pass 'nest' parameter in ECX.
16802 // Must be kept in sync with X86CallingConv.td
16803 NestReg = X86::ECX;
16805 // Check that ECX wasn't needed by an 'inreg' parameter.
16806 FunctionType *FTy = Func->getFunctionType();
16807 const AttributeSet &Attrs = Func->getAttributes();
16809 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16810 unsigned InRegCount = 0;
16811 unsigned Idx = 1;
16813 for (FunctionType::param_iterator I = FTy->param_begin(),
16814 E = FTy->param_end(); I != E; ++I, ++Idx)
16815 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16816 // FIXME: should only count parameters that are lowered to integers.
16817 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16819 if (InRegCount > 2) {
16820 report_fatal_error("Nest register in use - reduce number of inreg"
16821 " parameters!");
16822 }
16823 }
16824 break;
16825 }
16826 case CallingConv::X86_FastCall:
16827 case CallingConv::X86_ThisCall:
16828 case CallingConv::Fast:
16829 // Pass 'nest' parameter in EAX.
16830 // Must be kept in sync with X86CallingConv.td
16831 NestReg = X86::EAX;
16832 break;
16833 }
16835 SDValue OutChains[4];
16836 SDValue Addr, Disp;
16838 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16839 DAG.getConstant(10, MVT::i32));
16840 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16842 // This is storing the opcode for MOV32ri.
16843 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16844 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16845 OutChains[0] = DAG.getStore(Root, dl,
16846 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
16847 Trmp, MachinePointerInfo(TrmpAddr),
16848 false, false, 0);
16850 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16851 DAG.getConstant(1, MVT::i32));
16852 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
16853 MachinePointerInfo(TrmpAddr, 1),
16854 false, false, 1);
16856 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
16857 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16858 DAG.getConstant(5, MVT::i32));
16859 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
16860 MachinePointerInfo(TrmpAddr, 5),
16861 false, false, 1);
16863 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16864 DAG.getConstant(6, MVT::i32));
16865 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
16866 MachinePointerInfo(TrmpAddr, 6),
16867 false, false, 1);
16869 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16870 }
16871 }
16873 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
16874 SelectionDAG &DAG) const {
16875 /*
16876 The rounding mode is in bits 11:10 of FPSR, and has the following
16877 settings:
16878 00 Round to nearest
16879 01 Round to -inf
16880 10 Round to +inf
16881 11 Round to 0
16883 FLT_ROUNDS, on the other hand, expects the following:
16884 -1 Undefined
16885 0 Round to 0
16886 1 Round to nearest
16887 2 Round to +inf
16888 3 Round to -inf
16890 To perform the conversion, we do:
16891 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
16892 */
16894 MachineFunction &MF = DAG.getMachineFunction();
16895 const TargetMachine &TM = MF.getTarget();
16896 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
16897 unsigned StackAlignment = TFI.getStackAlignment();
16898 MVT VT = Op.getSimpleValueType();
16899 SDLoc DL(Op);
16901 // Save FP Control Word to stack slot
16902 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
16903 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
16905 MachineMemOperand *MMO =
16906 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
16907 MachineMemOperand::MOStore, 2, 2);
16909 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
16910 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
16911 DAG.getVTList(MVT::Other),
16912 Ops, MVT::i16, MMO);
16914 // Load FP Control Word from stack slot
16915 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
16916 MachinePointerInfo(), false, false, false, 0);
16918 // Transform as necessary
16919 SDValue CWD1 =
16920 DAG.getNode(ISD::SRL, DL, MVT::i16,
16921 DAG.getNode(ISD::AND, DL, MVT::i16,
16922 CWD, DAG.getConstant(0x800, MVT::i16)),
16923 DAG.getConstant(11, MVT::i8));
16924 SDValue CWD2 =
16925 DAG.getNode(ISD::SRL, DL, MVT::i16,
16926 DAG.getNode(ISD::AND, DL, MVT::i16,
16927 CWD, DAG.getConstant(0x400, MVT::i16)),
16928 DAG.getConstant(9, MVT::i8));
16930 SDValue RetVal =
16931 DAG.getNode(ISD::AND, DL, MVT::i16,
16932 DAG.getNode(ISD::ADD, DL, MVT::i16,
16933 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
16934 DAG.getConstant(1, MVT::i16)),
16935 DAG.getConstant(3, MVT::i16));
16937 return DAG.getNode((VT.getSizeInBits() < 16 ?
16938 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
16939 }
16941 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
16942 MVT VT = Op.getSimpleValueType();
16943 EVT OpVT = VT;
16944 unsigned NumBits = VT.getSizeInBits();
16945 SDLoc dl(Op);
16947 Op = Op.getOperand(0);
16948 if (VT == MVT::i8) {
16949 // Zero extend to i32 since there is not an i8 bsr.
16950 OpVT = MVT::i32;
16951 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16952 }
16954 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
16955 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16956 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16958 // If src is zero (i.e. bsr sets ZF), returns NumBits.
16959 SDValue Ops[] = {
16960 Op,
16961 DAG.getConstant(NumBits+NumBits-1, OpVT),
16962 DAG.getConstant(X86::COND_E, MVT::i8),
16963 Op.getValue(1)
16964 };
16965 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
16967 // Finally xor with NumBits-1.
16968 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16970 if (VT == MVT::i8)
16971 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16972 return Op;
16973 }
16975 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
16976 MVT VT = Op.getSimpleValueType();
16977 EVT OpVT = VT;
16978 unsigned NumBits = VT.getSizeInBits();
16979 SDLoc dl(Op);
16981 Op = Op.getOperand(0);
16982 if (VT == MVT::i8) {
16983 // Zero extend to i32 since there is not an i8 bsr.
16984 OpVT = MVT::i32;
16985 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16986 }
16988 // Issue a bsr (scan bits in reverse).
16989 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16990 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16992 // And xor with NumBits-1.
16993 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16995 if (VT == MVT::i8)
16996 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16997 return Op;
16998 }
17000 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17001 MVT VT = Op.getSimpleValueType();
17002 unsigned NumBits = VT.getSizeInBits();
17003 SDLoc dl(Op);
17004 Op = Op.getOperand(0);
17006 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17007 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17008 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
17010 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17011 SDValue Ops[] = {
17012 Op,
17013 DAG.getConstant(NumBits, VT),
17014 DAG.getConstant(X86::COND_E, MVT::i8),
17015 Op.getValue(1)
17016 };
17017 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17018 }
17020 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17021 // ones, and then concatenate the result back.
17022 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17023 MVT VT = Op.getSimpleValueType();
17025 assert(VT.is256BitVector() && VT.isInteger() &&
17026 "Unsupported value type for operation");
17028 unsigned NumElems = VT.getVectorNumElements();
17029 SDLoc dl(Op);
17031 // Extract the LHS vectors
17032 SDValue LHS = Op.getOperand(0);
17033 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17034 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17036 // Extract the RHS vectors
17037 SDValue RHS = Op.getOperand(1);
17038 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17039 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17041 MVT EltVT = VT.getVectorElementType();
17042 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17044 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17045 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17046 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17047 }
17049 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17050 assert(Op.getSimpleValueType().is256BitVector() &&
17051 Op.getSimpleValueType().isInteger() &&
17052 "Only handle AVX 256-bit vector integer operation");
17053 return Lower256IntArith(Op, DAG);
17054 }
17056 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17057 assert(Op.getSimpleValueType().is256BitVector() &&
17058 Op.getSimpleValueType().isInteger() &&
17059 "Only handle AVX 256-bit vector integer operation");
17060 return Lower256IntArith(Op, DAG);
17061 }
17063 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17064 SelectionDAG &DAG) {
17065 SDLoc dl(Op);
17066 MVT VT = Op.getSimpleValueType();
17068 // Decompose 256-bit ops into smaller 128-bit ops.
17069 if (VT.is256BitVector() && !Subtarget->hasInt256())
17070 return Lower256IntArith(Op, DAG);
17072 SDValue A = Op.getOperand(0);
17073 SDValue B = Op.getOperand(1);
17075 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
17076 if (VT == MVT::v4i32) {
17077 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
17078 "Should not custom lower when pmuldq is available!");
17080 // Extract the odd parts.
17081 static const int UnpackMask[] = { 1, -1, 3, -1 };
17082 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
17083 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
17085 // Multiply the even parts.
17086 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
17087 // Now multiply odd parts.
17088 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
17090 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
17091 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
17093 // Merge the two vectors back together with a shuffle. This expands into 2
17094 // shuffles.
17095 static const int ShufMask[] = { 0, 4, 2, 6 };
17096 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
17097 }
17099 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
17100 "Only know how to lower V2I64/V4I64/V8I64 multiply");
17102 // Ahi = psrlqi(a, 32);
17103 // Bhi = psrlqi(b, 32);
17104 //
17105 // AloBlo = pmuludq(a, b);
17106 // AloBhi = pmuludq(a, Bhi);
17107 // AhiBlo = pmuludq(Ahi, b);
17109 // AloBhi = psllqi(AloBhi, 32);
17110 // AhiBlo = psllqi(AhiBlo, 32);
17111 // return AloBlo + AloBhi + AhiBlo;
17113 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
17114 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
17116 // Bit cast to 32-bit vectors for MULUDQ
17117 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
17118 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
17119 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
17120 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
17121 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
17122 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
17124 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
17125 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
17126 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
17128 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
17129 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
17131 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
17132 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
17133 }
17135 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
17136 assert(Subtarget->isTargetWin64() && "Unexpected target");
17137 EVT VT = Op.getValueType();
17138 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
17139 "Unexpected return type for lowering");
17141 RTLIB::Libcall LC;
17142 bool isSigned;
17143 switch (Op->getOpcode()) {
17144 default: llvm_unreachable("Unexpected request for libcall!");
17145 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
17146 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
17147 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
17148 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
17149 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
17150 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
17151 }
17153 SDLoc dl(Op);
17154 SDValue InChain = DAG.getEntryNode();
17156 TargetLowering::ArgListTy Args;
17157 TargetLowering::ArgListEntry Entry;
17158 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
17159 EVT ArgVT = Op->getOperand(i).getValueType();
17160 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
17161 "Unexpected argument type for lowering");
17162 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
17163 Entry.Node = StackPtr;
17164 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
17165 false, false, 16);
17166 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17167 Entry.Ty = PointerType::get(ArgTy,0);
17168 Entry.isSExt = false;
17169 Entry.isZExt = false;
17170 Args.push_back(Entry);
17171 }
17173 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
17174 getPointerTy());
17176 TargetLowering::CallLoweringInfo CLI(DAG);
17177 CLI.setDebugLoc(dl).setChain(InChain)
17178 .setCallee(getLibcallCallingConv(LC),
17179 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
17180 Callee, std::move(Args), 0)
17181 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
17183 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
17184 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
17185 }
17187 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
17188 SelectionDAG &DAG) {
17189 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
17190 EVT VT = Op0.getValueType();
17191 SDLoc dl(Op);
17193 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
17194 (VT == MVT::v8i32 && Subtarget->hasInt256()));
17196 // PMULxD operations multiply each even value (starting at 0) of LHS with
17197 // the related value of RHS and produce a widen result.
17198 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17199 // => <2 x i64> <ae|cg>
17200 //
17201 // In other word, to have all the results, we need to perform two PMULxD:
17202 // 1. one with the even values.
17203 // 2. one with the odd values.
17204 // To achieve #2, with need to place the odd values at an even position.
17205 //
17206 // Place the odd value at an even position (basically, shift all values 1
17207 // step to the left):
17208 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
17209 // <a|b|c|d> => <b|undef|d|undef>
17210 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
17211 // <e|f|g|h> => <f|undef|h|undef>
17212 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
17214 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
17215 // ints.
17216 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
17217 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
17218 unsigned Opcode =
17219 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
17220 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17221 // => <2 x i64> <ae|cg>
17222 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
17223 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
17224 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
17225 // => <2 x i64> <bf|dh>
17226 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
17227 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
17229 // Shuffle it back into the right order.
17230 SDValue Highs, Lows;
17231 if (VT == MVT::v8i32) {
17232 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
17233 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17234 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
17235 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17236 } else {
17237 const int HighMask[] = {1, 5, 3, 7};
17238 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17239 const int LowMask[] = {0, 4, 2, 6};
17240 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17241 }
17243 // If we have a signed multiply but no PMULDQ fix up the high parts of a
17244 // unsigned multiply.
17245 if (IsSigned && !Subtarget->hasSSE41()) {
17246 SDValue ShAmt =
17247 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
17248 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
17249 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
17250 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
17251 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
17253 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
17254 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
17255 }
17257 // The first result of MUL_LOHI is actually the low value, followed by the
17258 // high value.
17259 SDValue Ops[] = {Lows, Highs};
17260 return DAG.getMergeValues(Ops, dl);
17261 }
17263 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
17264 const X86Subtarget *Subtarget) {
17265 MVT VT = Op.getSimpleValueType();
17266 SDLoc dl(Op);
17267 SDValue R = Op.getOperand(0);
17268 SDValue Amt = Op.getOperand(1);
17270 // Optimize shl/srl/sra with constant shift amount.
17271 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
17272 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
17273 uint64_t ShiftAmt = ShiftConst->getZExtValue();
17275 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
17276 (Subtarget->hasInt256() &&
17277 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17278 (Subtarget->hasAVX512() &&
17279 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17280 if (Op.getOpcode() == ISD::SHL)
17281 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17282 DAG);
17283 if (Op.getOpcode() == ISD::SRL)
17284 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17285 DAG);
17286 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
17287 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17288 DAG);
17289 }
17291 if (VT == MVT::v16i8) {
17292 if (Op.getOpcode() == ISD::SHL) {
17293 // Make a large shift.
17294 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17295 MVT::v8i16, R, ShiftAmt,
17296 DAG);
17297 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17298 // Zero out the rightmost bits.
17299 SmallVector<SDValue, 16> V(16,
17300 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17301 MVT::i8));
17302 return DAG.getNode(ISD::AND, dl, VT, SHL,
17303 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17304 }
17305 if (Op.getOpcode() == ISD::SRL) {
17306 // Make a large shift.
17307 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17308 MVT::v8i16, R, ShiftAmt,
17309 DAG);
17310 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17311 // Zero out the leftmost bits.
17312 SmallVector<SDValue, 16> V(16,
17313 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17314 MVT::i8));
17315 return DAG.getNode(ISD::AND, dl, VT, SRL,
17316 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17317 }
17318 if (Op.getOpcode() == ISD::SRA) {
17319 if (ShiftAmt == 7) {
17320 // R s>> 7 === R s< 0
17321 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17322 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17323 }
17325 // R s>> a === ((R u>> a) ^ m) - m
17326 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17327 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
17328 MVT::i8));
17329 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17330 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17331 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17332 return Res;
17333 }
17334 llvm_unreachable("Unknown shift opcode.");
17335 }
17337 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
17338 if (Op.getOpcode() == ISD::SHL) {
17339 // Make a large shift.
17340 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17341 MVT::v16i16, R, ShiftAmt,
17342 DAG);
17343 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17344 // Zero out the rightmost bits.
17345 SmallVector<SDValue, 32> V(32,
17346 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17347 MVT::i8));
17348 return DAG.getNode(ISD::AND, dl, VT, SHL,
17349 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17350 }
17351 if (Op.getOpcode() == ISD::SRL) {
17352 // Make a large shift.
17353 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17354 MVT::v16i16, R, ShiftAmt,
17355 DAG);
17356 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17357 // Zero out the leftmost bits.
17358 SmallVector<SDValue, 32> V(32,
17359 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17360 MVT::i8));
17361 return DAG.getNode(ISD::AND, dl, VT, SRL,
17362 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17363 }
17364 if (Op.getOpcode() == ISD::SRA) {
17365 if (ShiftAmt == 7) {
17366 // R s>> 7 === R s< 0
17367 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17368 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17369 }
17371 // R s>> a === ((R u>> a) ^ m) - m
17372 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17373 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
17374 MVT::i8));
17375 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17376 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17377 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17378 return Res;
17379 }
17380 llvm_unreachable("Unknown shift opcode.");
17381 }
17382 }
17383 }
17385 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17386 if (!Subtarget->is64Bit() &&
17387 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
17388 Amt.getOpcode() == ISD::BITCAST &&
17389 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17390 Amt = Amt.getOperand(0);
17391 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17392 VT.getVectorNumElements();
17393 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
17394 uint64_t ShiftAmt = 0;
17395 for (unsigned i = 0; i != Ratio; ++i) {
17396 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
17397 if (!C)
17398 return SDValue();
17399 // 6 == Log2(64)
17400 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
17401 }
17402 // Check remaining shift amounts.
17403 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17404 uint64_t ShAmt = 0;
17405 for (unsigned j = 0; j != Ratio; ++j) {
17406 ConstantSDNode *C =
17407 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
17408 if (!C)
17409 return SDValue();
17410 // 6 == Log2(64)
17411 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
17412 }
17413 if (ShAmt != ShiftAmt)
17414 return SDValue();
17415 }
17416 switch (Op.getOpcode()) {
17417 default:
17418 llvm_unreachable("Unknown shift opcode!");
17419 case ISD::SHL:
17420 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17421 DAG);
17422 case ISD::SRL:
17423 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17424 DAG);
17425 case ISD::SRA:
17426 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17427 DAG);
17428 }
17429 }
17431 return SDValue();
17432 }
17434 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
17435 const X86Subtarget* Subtarget) {
17436 MVT VT = Op.getSimpleValueType();
17437 SDLoc dl(Op);
17438 SDValue R = Op.getOperand(0);
17439 SDValue Amt = Op.getOperand(1);
17441 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
17442 VT == MVT::v4i32 || VT == MVT::v8i16 ||
17443 (Subtarget->hasInt256() &&
17444 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
17445 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17446 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17447 SDValue BaseShAmt;
17448 EVT EltVT = VT.getVectorElementType();
17450 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17451 unsigned NumElts = VT.getVectorNumElements();
17452 unsigned i, j;
17453 for (i = 0; i != NumElts; ++i) {
17454 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
17455 continue;
17456 break;
17457 }
17458 for (j = i; j != NumElts; ++j) {
17459 SDValue Arg = Amt.getOperand(j);
17460 if (Arg.getOpcode() == ISD::UNDEF) continue;
17461 if (Arg != Amt.getOperand(i))
17462 break;
17463 }
17464 if (i != NumElts && j == NumElts)
17465 BaseShAmt = Amt.getOperand(i);
17466 } else {
17467 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
17468 Amt = Amt.getOperand(0);
17469 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
17470 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
17471 SDValue InVec = Amt.getOperand(0);
17472 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
17473 unsigned NumElts = InVec.getValueType().getVectorNumElements();
17474 unsigned i = 0;
17475 for (; i != NumElts; ++i) {
17476 SDValue Arg = InVec.getOperand(i);
17477 if (Arg.getOpcode() == ISD::UNDEF) continue;
17478 BaseShAmt = Arg;
17479 break;
17480 }
17481 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
17482 if (ConstantSDNode *C =
17483 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
17484 unsigned SplatIdx =
17485 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
17486 if (C->getZExtValue() == SplatIdx)
17487 BaseShAmt = InVec.getOperand(1);
17488 }
17489 }
17490 if (!BaseShAmt.getNode())
17491 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
17492 DAG.getIntPtrConstant(0));
17493 }
17494 }
17496 if (BaseShAmt.getNode()) {
17497 if (EltVT.bitsGT(MVT::i32))
17498 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
17499 else if (EltVT.bitsLT(MVT::i32))
17500 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
17502 switch (Op.getOpcode()) {
17503 default:
17504 llvm_unreachable("Unknown shift opcode!");
17505 case ISD::SHL:
17506 switch (VT.SimpleTy) {
17507 default: return SDValue();
17508 case MVT::v2i64:
17509 case MVT::v4i32:
17510 case MVT::v8i16:
17511 case MVT::v4i64:
17512 case MVT::v8i32:
17513 case MVT::v16i16:
17514 case MVT::v16i32:
17515 case MVT::v8i64:
17516 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
17517 }
17518 case ISD::SRA:
17519 switch (VT.SimpleTy) {
17520 default: return SDValue();
17521 case MVT::v4i32:
17522 case MVT::v8i16:
17523 case MVT::v8i32:
17524 case MVT::v16i16:
17525 case MVT::v16i32:
17526 case MVT::v8i64:
17527 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
17528 }
17529 case ISD::SRL:
17530 switch (VT.SimpleTy) {
17531 default: return SDValue();
17532 case MVT::v2i64:
17533 case MVT::v4i32:
17534 case MVT::v8i16:
17535 case MVT::v4i64:
17536 case MVT::v8i32:
17537 case MVT::v16i16:
17538 case MVT::v16i32:
17539 case MVT::v8i64:
17540 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
17541 }
17542 }
17543 }
17544 }
17546 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17547 if (!Subtarget->is64Bit() &&
17548 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
17549 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
17550 Amt.getOpcode() == ISD::BITCAST &&
17551 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17552 Amt = Amt.getOperand(0);
17553 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17554 VT.getVectorNumElements();
17555 std::vector<SDValue> Vals(Ratio);
17556 for (unsigned i = 0; i != Ratio; ++i)
17557 Vals[i] = Amt.getOperand(i);
17558 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17559 for (unsigned j = 0; j != Ratio; ++j)
17560 if (Vals[j] != Amt.getOperand(i + j))
17561 return SDValue();
17562 }
17563 switch (Op.getOpcode()) {
17564 default:
17565 llvm_unreachable("Unknown shift opcode!");
17566 case ISD::SHL:
17567 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
17568 case ISD::SRL:
17569 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
17570 case ISD::SRA:
17571 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
17572 }
17573 }
17575 return SDValue();
17576 }
17578 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
17579 SelectionDAG &DAG) {
17580 MVT VT = Op.getSimpleValueType();
17581 SDLoc dl(Op);
17582 SDValue R = Op.getOperand(0);
17583 SDValue Amt = Op.getOperand(1);
17584 SDValue V;
17586 assert(VT.isVector() && "Custom lowering only for vector shifts!");
17587 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
17589 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
17590 if (V.getNode())
17591 return V;
17593 V = LowerScalarVariableShift(Op, DAG, Subtarget);
17594 if (V.getNode())
17595 return V;
17597 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
17598 return Op;
17599 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
17600 if (Subtarget->hasInt256()) {
17601 if (Op.getOpcode() == ISD::SRL &&
17602 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17603 VT == MVT::v4i64 || VT == MVT::v8i32))
17604 return Op;
17605 if (Op.getOpcode() == ISD::SHL &&
17606 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17607 VT == MVT::v4i64 || VT == MVT::v8i32))
17608 return Op;
17609 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
17610 return Op;
17611 }
17613 // If possible, lower this packed shift into a vector multiply instead of
17614 // expanding it into a sequence of scalar shifts.
17615 // Do this only if the vector shift count is a constant build_vector.
17616 if (Op.getOpcode() == ISD::SHL &&
17617 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
17618 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
17619 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17620 SmallVector<SDValue, 8> Elts;
17621 EVT SVT = VT.getScalarType();
17622 unsigned SVTBits = SVT.getSizeInBits();
17623 const APInt &One = APInt(SVTBits, 1);
17624 unsigned NumElems = VT.getVectorNumElements();
17626 for (unsigned i=0; i !=NumElems; ++i) {
17627 SDValue Op = Amt->getOperand(i);
17628 if (Op->getOpcode() == ISD::UNDEF) {
17629 Elts.push_back(Op);
17630 continue;
17631 }
17633 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
17634 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
17635 uint64_t ShAmt = C.getZExtValue();
17636 if (ShAmt >= SVTBits) {
17637 Elts.push_back(DAG.getUNDEF(SVT));
17638 continue;
17639 }
17640 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
17641 }
17642 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
17643 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
17644 }
17646 // Lower SHL with variable shift amount.
17647 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
17648 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
17650 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
17651 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
17652 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
17653 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
17654 }
17656 // If possible, lower this shift as a sequence of two shifts by
17657 // constant plus a MOVSS/MOVSD instead of scalarizing it.
17658 // Example:
17659 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
17660 //
17661 // Could be rewritten as:
17662 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
17663 //
17664 // The advantage is that the two shifts from the example would be
17665 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
17666 // the vector shift into four scalar shifts plus four pairs of vector
17667 // insert/extract.
17668 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
17669 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17670 unsigned TargetOpcode = X86ISD::MOVSS;
17671 bool CanBeSimplified;
17672 // The splat value for the first packed shift (the 'X' from the example).
17673 SDValue Amt1 = Amt->getOperand(0);
17674 // The splat value for the second packed shift (the 'Y' from the example).
17675 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
17676 Amt->getOperand(2);
17678 // See if it is possible to replace this node with a sequence of
17679 // two shifts followed by a MOVSS/MOVSD
17680 if (VT == MVT::v4i32) {
17681 // Check if it is legal to use a MOVSS.
17682 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
17683 Amt2 == Amt->getOperand(3);
17684 if (!CanBeSimplified) {
17685 // Otherwise, check if we can still simplify this node using a MOVSD.
17686 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
17687 Amt->getOperand(2) == Amt->getOperand(3);
17688 TargetOpcode = X86ISD::MOVSD;
17689 Amt2 = Amt->getOperand(2);
17690 }
17691 } else {
17692 // Do similar checks for the case where the machine value type
17693 // is MVT::v8i16.
17694 CanBeSimplified = Amt1 == Amt->getOperand(1);
17695 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
17696 CanBeSimplified = Amt2 == Amt->getOperand(i);
17698 if (!CanBeSimplified) {
17699 TargetOpcode = X86ISD::MOVSD;
17700 CanBeSimplified = true;
17701 Amt2 = Amt->getOperand(4);
17702 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
17703 CanBeSimplified = Amt1 == Amt->getOperand(i);
17704 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
17705 CanBeSimplified = Amt2 == Amt->getOperand(j);
17706 }
17707 }
17709 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
17710 isa<ConstantSDNode>(Amt2)) {
17711 // Replace this node with two shifts followed by a MOVSS/MOVSD.
17712 EVT CastVT = MVT::v4i32;
17713 SDValue Splat1 =
17714 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
17715 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
17716 SDValue Splat2 =
17717 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
17718 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
17719 if (TargetOpcode == X86ISD::MOVSD)
17720 CastVT = MVT::v2i64;
17721 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
17722 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
17723 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
17724 BitCast1, DAG);
17725 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
17726 }
17727 }
17729 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
17730 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
17732 // a = a << 5;
17733 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
17734 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
17736 // Turn 'a' into a mask suitable for VSELECT
17737 SDValue VSelM = DAG.getConstant(0x80, VT);
17738 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17739 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17741 SDValue CM1 = DAG.getConstant(0x0f, VT);
17742 SDValue CM2 = DAG.getConstant(0x3f, VT);
17744 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
17745 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
17746 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
17747 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17748 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17750 // a += a
17751 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17752 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17753 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17755 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
17756 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
17757 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
17758 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17759 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17761 // a += a
17762 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17763 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17764 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17766 // return VSELECT(r, r+r, a);
17767 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
17768 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
17769 return R;
17770 }
17772 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
17773 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
17774 // solution better.
17775 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
17776 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
17777 unsigned ExtOpc =
17778 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
17779 R = DAG.getNode(ExtOpc, dl, NewVT, R);
17780 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
17781 return DAG.getNode(ISD::TRUNCATE, dl, VT,
17782 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17783 }
17785 // Decompose 256-bit shifts into smaller 128-bit shifts.
17786 if (VT.is256BitVector()) {
17787 unsigned NumElems = VT.getVectorNumElements();
17788 MVT EltVT = VT.getVectorElementType();
17789 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17791 // Extract the two vectors
17792 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17793 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17795 // Recreate the shift amount vectors
17796 SDValue Amt1, Amt2;
17797 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17798 // Constant shift amount
17799 SmallVector<SDValue, 4> Amt1Csts;
17800 SmallVector<SDValue, 4> Amt2Csts;
17801 for (unsigned i = 0; i != NumElems/2; ++i)
17802 Amt1Csts.push_back(Amt->getOperand(i));
17803 for (unsigned i = NumElems/2; i != NumElems; ++i)
17804 Amt2Csts.push_back(Amt->getOperand(i));
17806 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17807 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17808 } else {
17809 // Variable shift amount
17810 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17811 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17812 }
17814 // Issue new vector shifts for the smaller types
17815 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17816 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17818 // Concatenate the result back
17819 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17820 }
17822 return SDValue();
17823 }
17825 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17826 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17827 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17828 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17829 // has only one use.
17830 SDNode *N = Op.getNode();
17831 SDValue LHS = N->getOperand(0);
17832 SDValue RHS = N->getOperand(1);
17833 unsigned BaseOp = 0;
17834 unsigned Cond = 0;
17835 SDLoc DL(Op);
17836 switch (Op.getOpcode()) {
17837 default: llvm_unreachable("Unknown ovf instruction!");
17838 case ISD::SADDO:
17839 // A subtract of one will be selected as a INC. Note that INC doesn't
17840 // set CF, so we can't do this for UADDO.
17841 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17842 if (C->isOne()) {
17843 BaseOp = X86ISD::INC;
17844 Cond = X86::COND_O;
17845 break;
17846 }
17847 BaseOp = X86ISD::ADD;
17848 Cond = X86::COND_O;
17849 break;
17850 case ISD::UADDO:
17851 BaseOp = X86ISD::ADD;
17852 Cond = X86::COND_B;
17853 break;
17854 case ISD::SSUBO:
17855 // A subtract of one will be selected as a DEC. Note that DEC doesn't
17856 // set CF, so we can't do this for USUBO.
17857 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17858 if (C->isOne()) {
17859 BaseOp = X86ISD::DEC;
17860 Cond = X86::COND_O;
17861 break;
17862 }
17863 BaseOp = X86ISD::SUB;
17864 Cond = X86::COND_O;
17865 break;
17866 case ISD::USUBO:
17867 BaseOp = X86ISD::SUB;
17868 Cond = X86::COND_B;
17869 break;
17870 case ISD::SMULO:
17871 BaseOp = X86ISD::SMUL;
17872 Cond = X86::COND_O;
17873 break;
17874 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
17875 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
17876 MVT::i32);
17877 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
17879 SDValue SetCC =
17880 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
17881 DAG.getConstant(X86::COND_O, MVT::i32),
17882 SDValue(Sum.getNode(), 2));
17884 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17885 }
17886 }
17888 // Also sets EFLAGS.
17889 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
17890 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
17892 SDValue SetCC =
17893 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
17894 DAG.getConstant(Cond, MVT::i32),
17895 SDValue(Sum.getNode(), 1));
17897 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17898 }
17900 // Sign extension of the low part of vector elements. This may be used either
17901 // when sign extend instructions are not available or if the vector element
17902 // sizes already match the sign-extended size. If the vector elements are in
17903 // their pre-extended size and sign extend instructions are available, that will
17904 // be handled by LowerSIGN_EXTEND.
17905 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
17906 SelectionDAG &DAG) const {
17907 SDLoc dl(Op);
17908 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
17909 MVT VT = Op.getSimpleValueType();
17911 if (!Subtarget->hasSSE2() || !VT.isVector())
17912 return SDValue();
17914 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
17915 ExtraVT.getScalarType().getSizeInBits();
17917 switch (VT.SimpleTy) {
17918 default: return SDValue();
17919 case MVT::v8i32:
17920 case MVT::v16i16:
17921 if (!Subtarget->hasFp256())
17922 return SDValue();
17923 if (!Subtarget->hasInt256()) {
17924 // needs to be split
17925 unsigned NumElems = VT.getVectorNumElements();
17927 // Extract the LHS vectors
17928 SDValue LHS = Op.getOperand(0);
17929 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17930 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17932 MVT EltVT = VT.getVectorElementType();
17933 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17935 EVT ExtraEltVT = ExtraVT.getVectorElementType();
17936 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
17937 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
17938 ExtraNumElems/2);
17939 SDValue Extra = DAG.getValueType(ExtraVT);
17941 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
17942 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
17944 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
17945 }
17946 // fall through
17947 case MVT::v4i32:
17948 case MVT::v8i16: {
17949 SDValue Op0 = Op.getOperand(0);
17951 // This is a sign extension of some low part of vector elements without
17952 // changing the size of the vector elements themselves:
17953 // Shift-Left + Shift-Right-Algebraic.
17954 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
17955 BitsDiff, DAG);
17956 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
17957 DAG);
17958 }
17959 }
17960 }
17962 /// Returns true if the operand type is exactly twice the native width, and
17963 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
17964 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
17965 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
17966 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
17967 const X86Subtarget &Subtarget =
17968 getTargetMachine().getSubtarget<X86Subtarget>();
17969 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
17971 if (OpWidth == 64)
17972 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
17973 else if (OpWidth == 128)
17974 return Subtarget.hasCmpxchg16b();
17975 else
17976 return false;
17977 }
17979 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
17980 return needsCmpXchgNb(SI->getValueOperand()->getType());
17981 }
17983 // Note: this turns large loads into lock cmpxchg8b/16b.
17984 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
17985 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
17986 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
17987 return needsCmpXchgNb(PTy->getElementType());
17988 }
17990 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
17991 const X86Subtarget &Subtarget =
17992 getTargetMachine().getSubtarget<X86Subtarget>();
17993 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
17994 const Type *MemType = AI->getType();
17996 // If the operand is too big, we must see if cmpxchg8/16b is available
17997 // and default to library calls otherwise.
17998 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
17999 return needsCmpXchgNb(MemType);
18001 AtomicRMWInst::BinOp Op = AI->getOperation();
18002 switch (Op) {
18003 default:
18004 llvm_unreachable("Unknown atomic operation");
18005 case AtomicRMWInst::Xchg:
18006 case AtomicRMWInst::Add:
18007 case AtomicRMWInst::Sub:
18008 // It's better to use xadd, xsub or xchg for these in all cases.
18009 return false;
18010 case AtomicRMWInst::Or:
18011 case AtomicRMWInst::And:
18012 case AtomicRMWInst::Xor:
18013 // If the atomicrmw's result isn't actually used, we can just add a "lock"
18014 // prefix to a normal instruction for these operations.
18015 return !AI->use_empty();
18016 case AtomicRMWInst::Nand:
18017 case AtomicRMWInst::Max:
18018 case AtomicRMWInst::Min:
18019 case AtomicRMWInst::UMax:
18020 case AtomicRMWInst::UMin:
18021 // These always require a non-trivial set of data operations on x86. We must
18022 // use a cmpxchg loop.
18023 return true;
18024 }
18025 }
18027 static bool hasMFENCE(const X86Subtarget& Subtarget) {
18028 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
18029 // no-sse2). There isn't any reason to disable it if the target processor
18030 // supports it.
18031 return Subtarget.hasSSE2() || Subtarget.is64Bit();
18032 }
18034 LoadInst *
18035 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
18036 const X86Subtarget &Subtarget =
18037 getTargetMachine().getSubtarget<X86Subtarget>();
18038 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18039 const Type *MemType = AI->getType();
18040 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
18041 // there is no benefit in turning such RMWs into loads, and it is actually
18042 // harmful as it introduces a mfence.
18043 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18044 return nullptr;
18046 auto Builder = IRBuilder<>(AI);
18047 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
18048 auto SynchScope = AI->getSynchScope();
18049 // We must restrict the ordering to avoid generating loads with Release or
18050 // ReleaseAcquire orderings.
18051 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
18052 auto Ptr = AI->getPointerOperand();
18054 // Before the load we need a fence. Here is an example lifted from
18055 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
18056 // is required:
18057 // Thread 0:
18058 // x.store(1, relaxed);
18059 // r1 = y.fetch_add(0, release);
18060 // Thread 1:
18061 // y.fetch_add(42, acquire);
18062 // r2 = x.load(relaxed);
18063 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
18064 // lowered to just a load without a fence. A mfence flushes the store buffer,
18065 // making the optimization clearly correct.
18066 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
18067 // otherwise, we might be able to be more agressive on relaxed idempotent
18068 // rmw. In practice, they do not look useful, so we don't try to be
18069 // especially clever.
18070 if (SynchScope == SingleThread) {
18071 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
18072 // the IR level, so we must wrap it in an intrinsic.
18073 return nullptr;
18074 } else if (hasMFENCE(Subtarget)) {
18075 Function *MFence = llvm::Intrinsic::getDeclaration(M,
18076 Intrinsic::x86_sse2_mfence);
18077 Builder.CreateCall(MFence);
18078 } else {
18079 // FIXME: it might make sense to use a locked operation here but on a
18080 // different cache-line to prevent cache-line bouncing. In practice it
18081 // is probably a small win, and x86 processors without mfence are rare
18082 // enough that we do not bother.
18083 return nullptr;
18084 }
18086 // Finally we can emit the atomic load.
18087 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
18088 AI->getType()->getPrimitiveSizeInBits());
18089 Loaded->setAtomic(Order, SynchScope);
18090 AI->replaceAllUsesWith(Loaded);
18091 AI->eraseFromParent();
18092 return Loaded;
18093 }
18095 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
18096 SelectionDAG &DAG) {
18097 SDLoc dl(Op);
18098 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
18099 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
18100 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
18101 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
18103 // The only fence that needs an instruction is a sequentially-consistent
18104 // cross-thread fence.
18105 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
18106 if (hasMFENCE(*Subtarget))
18107 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
18109 SDValue Chain = Op.getOperand(0);
18110 SDValue Zero = DAG.getConstant(0, MVT::i32);
18111 SDValue Ops[] = {
18112 DAG.getRegister(X86::ESP, MVT::i32), // Base
18113 DAG.getTargetConstant(1, MVT::i8), // Scale
18114 DAG.getRegister(0, MVT::i32), // Index
18115 DAG.getTargetConstant(0, MVT::i32), // Disp
18116 DAG.getRegister(0, MVT::i32), // Segment.
18117 Zero,
18118 Chain
18119 };
18120 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
18121 return SDValue(Res, 0);
18122 }
18124 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
18125 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
18126 }
18128 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
18129 SelectionDAG &DAG) {
18130 MVT T = Op.getSimpleValueType();
18131 SDLoc DL(Op);
18132 unsigned Reg = 0;
18133 unsigned size = 0;
18134 switch(T.SimpleTy) {
18135 default: llvm_unreachable("Invalid value type!");
18136 case MVT::i8: Reg = X86::AL; size = 1; break;
18137 case MVT::i16: Reg = X86::AX; size = 2; break;
18138 case MVT::i32: Reg = X86::EAX; size = 4; break;
18139 case MVT::i64:
18140 assert(Subtarget->is64Bit() && "Node not type legal!");
18141 Reg = X86::RAX; size = 8;
18142 break;
18143 }
18144 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
18145 Op.getOperand(2), SDValue());
18146 SDValue Ops[] = { cpIn.getValue(0),
18147 Op.getOperand(1),
18148 Op.getOperand(3),
18149 DAG.getTargetConstant(size, MVT::i8),
18150 cpIn.getValue(1) };
18151 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18152 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
18153 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
18154 Ops, T, MMO);
18156 SDValue cpOut =
18157 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
18158 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
18159 MVT::i32, cpOut.getValue(2));
18160 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
18161 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18163 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
18164 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
18165 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
18166 return SDValue();
18167 }
18169 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
18170 SelectionDAG &DAG) {
18171 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
18172 MVT DstVT = Op.getSimpleValueType();
18174 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
18175 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18176 if (DstVT != MVT::f64)
18177 // This conversion needs to be expanded.
18178 return SDValue();
18180 SDValue InVec = Op->getOperand(0);
18181 SDLoc dl(Op);
18182 unsigned NumElts = SrcVT.getVectorNumElements();
18183 EVT SVT = SrcVT.getVectorElementType();
18185 // Widen the vector in input in the case of MVT::v2i32.
18186 // Example: from MVT::v2i32 to MVT::v4i32.
18187 SmallVector<SDValue, 16> Elts;
18188 for (unsigned i = 0, e = NumElts; i != e; ++i)
18189 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
18190 DAG.getIntPtrConstant(i)));
18192 // Explicitly mark the extra elements as Undef.
18193 SDValue Undef = DAG.getUNDEF(SVT);
18194 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
18195 Elts.push_back(Undef);
18197 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18198 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
18199 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
18200 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
18201 DAG.getIntPtrConstant(0));
18202 }
18204 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
18205 Subtarget->hasMMX() && "Unexpected custom BITCAST");
18206 assert((DstVT == MVT::i64 ||
18207 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
18208 "Unexpected custom BITCAST");
18209 // i64 <=> MMX conversions are Legal.
18210 if (SrcVT==MVT::i64 && DstVT.isVector())
18211 return Op;
18212 if (DstVT==MVT::i64 && SrcVT.isVector())
18213 return Op;
18214 // MMX <=> MMX conversions are Legal.
18215 if (SrcVT.isVector() && DstVT.isVector())
18216 return Op;
18217 // All other conversions need to be expanded.
18218 return SDValue();
18219 }
18221 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
18222 SDNode *Node = Op.getNode();
18223 SDLoc dl(Node);
18224 EVT T = Node->getValueType(0);
18225 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
18226 DAG.getConstant(0, T), Node->getOperand(2));
18227 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
18228 cast<AtomicSDNode>(Node)->getMemoryVT(),
18229 Node->getOperand(0),
18230 Node->getOperand(1), negOp,
18231 cast<AtomicSDNode>(Node)->getMemOperand(),
18232 cast<AtomicSDNode>(Node)->getOrdering(),
18233 cast<AtomicSDNode>(Node)->getSynchScope());
18234 }
18236 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
18237 SDNode *Node = Op.getNode();
18238 SDLoc dl(Node);
18239 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
18241 // Convert seq_cst store -> xchg
18242 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
18243 // FIXME: On 32-bit, store -> fist or movq would be more efficient
18244 // (The only way to get a 16-byte store is cmpxchg16b)
18245 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
18246 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
18247 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
18248 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
18249 cast<AtomicSDNode>(Node)->getMemoryVT(),
18250 Node->getOperand(0),
18251 Node->getOperand(1), Node->getOperand(2),
18252 cast<AtomicSDNode>(Node)->getMemOperand(),
18253 cast<AtomicSDNode>(Node)->getOrdering(),
18254 cast<AtomicSDNode>(Node)->getSynchScope());
18255 return Swap.getValue(1);
18256 }
18257 // Other atomic stores have a simple pattern.
18258 return Op;
18259 }
18261 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
18262 EVT VT = Op.getNode()->getSimpleValueType(0);
18264 // Let legalize expand this if it isn't a legal type yet.
18265 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
18266 return SDValue();
18268 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
18270 unsigned Opc;
18271 bool ExtraOp = false;
18272 switch (Op.getOpcode()) {
18273 default: llvm_unreachable("Invalid code");
18274 case ISD::ADDC: Opc = X86ISD::ADD; break;
18275 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
18276 case ISD::SUBC: Opc = X86ISD::SUB; break;
18277 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
18278 }
18280 if (!ExtraOp)
18281 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18282 Op.getOperand(1));
18283 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18284 Op.getOperand(1), Op.getOperand(2));
18285 }
18287 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
18288 SelectionDAG &DAG) {
18289 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
18291 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
18292 // which returns the values as { float, float } (in XMM0) or
18293 // { double, double } (which is returned in XMM0, XMM1).
18294 SDLoc dl(Op);
18295 SDValue Arg = Op.getOperand(0);
18296 EVT ArgVT = Arg.getValueType();
18297 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18299 TargetLowering::ArgListTy Args;
18300 TargetLowering::ArgListEntry Entry;
18302 Entry.Node = Arg;
18303 Entry.Ty = ArgTy;
18304 Entry.isSExt = false;
18305 Entry.isZExt = false;
18306 Args.push_back(Entry);
18308 bool isF64 = ArgVT == MVT::f64;
18309 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
18310 // the small struct {f32, f32} is returned in (eax, edx). For f64,
18311 // the results are returned via SRet in memory.
18312 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
18313 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18314 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
18316 Type *RetTy = isF64
18317 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
18318 : (Type*)VectorType::get(ArgTy, 4);
18320 TargetLowering::CallLoweringInfo CLI(DAG);
18321 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
18322 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
18324 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
18326 if (isF64)
18327 // Returned in xmm0 and xmm1.
18328 return CallResult.first;
18330 // Returned in bits 0:31 and 32:64 xmm0.
18331 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18332 CallResult.first, DAG.getIntPtrConstant(0));
18333 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18334 CallResult.first, DAG.getIntPtrConstant(1));
18335 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
18336 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
18337 }
18339 /// LowerOperation - Provide custom lowering hooks for some operations.
18340 ///
18341 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
18342 switch (Op.getOpcode()) {
18343 default: llvm_unreachable("Should not custom lower this!");
18344 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
18345 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
18346 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
18347 return LowerCMP_SWAP(Op, Subtarget, DAG);
18348 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
18349 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
18350 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
18351 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
18352 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
18353 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
18354 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
18355 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
18356 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
18357 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
18358 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
18359 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
18360 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
18361 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
18362 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
18363 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
18364 case ISD::SHL_PARTS:
18365 case ISD::SRA_PARTS:
18366 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
18367 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
18368 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
18369 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
18370 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
18371 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
18372 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
18373 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
18374 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
18375 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
18376 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
18377 case ISD::FABS:
18378 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
18379 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
18380 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
18381 case ISD::SETCC: return LowerSETCC(Op, DAG);
18382 case ISD::SELECT: return LowerSELECT(Op, DAG);
18383 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
18384 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
18385 case ISD::VASTART: return LowerVASTART(Op, DAG);
18386 case ISD::VAARG: return LowerVAARG(Op, DAG);
18387 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
18388 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
18389 case ISD::INTRINSIC_VOID:
18390 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
18391 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
18392 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
18393 case ISD::FRAME_TO_ARGS_OFFSET:
18394 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
18395 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
18396 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
18397 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
18398 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
18399 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
18400 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
18401 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
18402 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
18403 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
18404 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
18405 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
18406 case ISD::UMUL_LOHI:
18407 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
18408 case ISD::SRA:
18409 case ISD::SRL:
18410 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
18411 case ISD::SADDO:
18412 case ISD::UADDO:
18413 case ISD::SSUBO:
18414 case ISD::USUBO:
18415 case ISD::SMULO:
18416 case ISD::UMULO: return LowerXALUO(Op, DAG);
18417 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
18418 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
18419 case ISD::ADDC:
18420 case ISD::ADDE:
18421 case ISD::SUBC:
18422 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
18423 case ISD::ADD: return LowerADD(Op, DAG);
18424 case ISD::SUB: return LowerSUB(Op, DAG);
18425 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
18426 }
18427 }
18429 /// ReplaceNodeResults - Replace a node with an illegal result type
18430 /// with a new node built out of custom code.
18431 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
18432 SmallVectorImpl<SDValue>&Results,
18433 SelectionDAG &DAG) const {
18434 SDLoc dl(N);
18435 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18436 switch (N->getOpcode()) {
18437 default:
18438 llvm_unreachable("Do not know how to custom type legalize this operation!");
18439 case ISD::SIGN_EXTEND_INREG:
18440 case ISD::ADDC:
18441 case ISD::ADDE:
18442 case ISD::SUBC:
18443 case ISD::SUBE:
18444 // We don't want to expand or promote these.
18445 return;
18446 case ISD::SDIV:
18447 case ISD::UDIV:
18448 case ISD::SREM:
18449 case ISD::UREM:
18450 case ISD::SDIVREM:
18451 case ISD::UDIVREM: {
18452 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
18453 Results.push_back(V);
18454 return;
18455 }
18456 case ISD::FP_TO_SINT:
18457 case ISD::FP_TO_UINT: {
18458 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
18460 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
18461 return;
18463 std::pair<SDValue,SDValue> Vals =
18464 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
18465 SDValue FIST = Vals.first, StackSlot = Vals.second;
18466 if (FIST.getNode()) {
18467 EVT VT = N->getValueType(0);
18468 // Return a load from the stack slot.
18469 if (StackSlot.getNode())
18470 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
18471 MachinePointerInfo(),
18472 false, false, false, 0));
18473 else
18474 Results.push_back(FIST);
18475 }
18476 return;
18477 }
18478 case ISD::UINT_TO_FP: {
18479 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18480 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
18481 N->getValueType(0) != MVT::v2f32)
18482 return;
18483 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
18484 N->getOperand(0));
18485 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
18486 MVT::f64);
18487 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
18488 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
18489 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
18490 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
18491 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
18492 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
18493 return;
18494 }
18495 case ISD::FP_ROUND: {
18496 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
18497 return;
18498 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
18499 Results.push_back(V);
18500 return;
18501 }
18502 case ISD::INTRINSIC_W_CHAIN: {
18503 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
18504 switch (IntNo) {
18505 default : llvm_unreachable("Do not know how to custom type "
18506 "legalize this intrinsic operation!");
18507 case Intrinsic::x86_rdtsc:
18508 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18509 Results);
18510 case Intrinsic::x86_rdtscp:
18511 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
18512 Results);
18513 case Intrinsic::x86_rdpmc:
18514 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
18515 }
18516 }
18517 case ISD::READCYCLECOUNTER: {
18518 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18519 Results);
18520 }
18521 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
18522 EVT T = N->getValueType(0);
18523 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
18524 bool Regs64bit = T == MVT::i128;
18525 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
18526 SDValue cpInL, cpInH;
18527 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18528 DAG.getConstant(0, HalfT));
18529 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18530 DAG.getConstant(1, HalfT));
18531 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
18532 Regs64bit ? X86::RAX : X86::EAX,
18533 cpInL, SDValue());
18534 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
18535 Regs64bit ? X86::RDX : X86::EDX,
18536 cpInH, cpInL.getValue(1));
18537 SDValue swapInL, swapInH;
18538 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18539 DAG.getConstant(0, HalfT));
18540 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18541 DAG.getConstant(1, HalfT));
18542 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
18543 Regs64bit ? X86::RBX : X86::EBX,
18544 swapInL, cpInH.getValue(1));
18545 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
18546 Regs64bit ? X86::RCX : X86::ECX,
18547 swapInH, swapInL.getValue(1));
18548 SDValue Ops[] = { swapInH.getValue(0),
18549 N->getOperand(1),
18550 swapInH.getValue(1) };
18551 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18552 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
18553 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
18554 X86ISD::LCMPXCHG8_DAG;
18555 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
18556 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
18557 Regs64bit ? X86::RAX : X86::EAX,
18558 HalfT, Result.getValue(1));
18559 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
18560 Regs64bit ? X86::RDX : X86::EDX,
18561 HalfT, cpOutL.getValue(2));
18562 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
18564 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
18565 MVT::i32, cpOutH.getValue(2));
18566 SDValue Success =
18567 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
18568 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18569 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
18571 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
18572 Results.push_back(Success);
18573 Results.push_back(EFLAGS.getValue(1));
18574 return;
18575 }
18576 case ISD::ATOMIC_SWAP:
18577 case ISD::ATOMIC_LOAD_ADD:
18578 case ISD::ATOMIC_LOAD_SUB:
18579 case ISD::ATOMIC_LOAD_AND:
18580 case ISD::ATOMIC_LOAD_OR:
18581 case ISD::ATOMIC_LOAD_XOR:
18582 case ISD::ATOMIC_LOAD_NAND:
18583 case ISD::ATOMIC_LOAD_MIN:
18584 case ISD::ATOMIC_LOAD_MAX:
18585 case ISD::ATOMIC_LOAD_UMIN:
18586 case ISD::ATOMIC_LOAD_UMAX:
18587 case ISD::ATOMIC_LOAD: {
18588 // Delegate to generic TypeLegalization. Situations we can really handle
18589 // should have already been dealt with by AtomicExpandPass.cpp.
18590 break;
18591 }
18592 case ISD::BITCAST: {
18593 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18594 EVT DstVT = N->getValueType(0);
18595 EVT SrcVT = N->getOperand(0)->getValueType(0);
18597 if (SrcVT != MVT::f64 ||
18598 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
18599 return;
18601 unsigned NumElts = DstVT.getVectorNumElements();
18602 EVT SVT = DstVT.getVectorElementType();
18603 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18604 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
18605 MVT::v2f64, N->getOperand(0));
18606 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
18608 if (ExperimentalVectorWideningLegalization) {
18609 // If we are legalizing vectors by widening, we already have the desired
18610 // legal vector type, just return it.
18611 Results.push_back(ToVecInt);
18612 return;
18613 }
18615 SmallVector<SDValue, 8> Elts;
18616 for (unsigned i = 0, e = NumElts; i != e; ++i)
18617 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
18618 ToVecInt, DAG.getIntPtrConstant(i)));
18620 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
18621 }
18622 }
18623 }
18625 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
18626 switch (Opcode) {
18627 default: return nullptr;
18628 case X86ISD::BSF: return "X86ISD::BSF";
18629 case X86ISD::BSR: return "X86ISD::BSR";
18630 case X86ISD::SHLD: return "X86ISD::SHLD";
18631 case X86ISD::SHRD: return "X86ISD::SHRD";
18632 case X86ISD::FAND: return "X86ISD::FAND";
18633 case X86ISD::FANDN: return "X86ISD::FANDN";
18634 case X86ISD::FOR: return "X86ISD::FOR";
18635 case X86ISD::FXOR: return "X86ISD::FXOR";
18636 case X86ISD::FSRL: return "X86ISD::FSRL";
18637 case X86ISD::FILD: return "X86ISD::FILD";
18638 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
18639 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
18640 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
18641 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
18642 case X86ISD::FLD: return "X86ISD::FLD";
18643 case X86ISD::FST: return "X86ISD::FST";
18644 case X86ISD::CALL: return "X86ISD::CALL";
18645 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
18646 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
18647 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
18648 case X86ISD::BT: return "X86ISD::BT";
18649 case X86ISD::CMP: return "X86ISD::CMP";
18650 case X86ISD::COMI: return "X86ISD::COMI";
18651 case X86ISD::UCOMI: return "X86ISD::UCOMI";
18652 case X86ISD::CMPM: return "X86ISD::CMPM";
18653 case X86ISD::CMPMU: return "X86ISD::CMPMU";
18654 case X86ISD::SETCC: return "X86ISD::SETCC";
18655 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
18656 case X86ISD::FSETCC: return "X86ISD::FSETCC";
18657 case X86ISD::CMOV: return "X86ISD::CMOV";
18658 case X86ISD::BRCOND: return "X86ISD::BRCOND";
18659 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
18660 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
18661 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
18662 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
18663 case X86ISD::Wrapper: return "X86ISD::Wrapper";
18664 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
18665 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
18666 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
18667 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
18668 case X86ISD::PINSRB: return "X86ISD::PINSRB";
18669 case X86ISD::PINSRW: return "X86ISD::PINSRW";
18670 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
18671 case X86ISD::ANDNP: return "X86ISD::ANDNP";
18672 case X86ISD::PSIGN: return "X86ISD::PSIGN";
18673 case X86ISD::BLENDI: return "X86ISD::BLENDI";
18674 case X86ISD::SUBUS: return "X86ISD::SUBUS";
18675 case X86ISD::HADD: return "X86ISD::HADD";
18676 case X86ISD::HSUB: return "X86ISD::HSUB";
18677 case X86ISD::FHADD: return "X86ISD::FHADD";
18678 case X86ISD::FHSUB: return "X86ISD::FHSUB";
18679 case X86ISD::UMAX: return "X86ISD::UMAX";
18680 case X86ISD::UMIN: return "X86ISD::UMIN";
18681 case X86ISD::SMAX: return "X86ISD::SMAX";
18682 case X86ISD::SMIN: return "X86ISD::SMIN";
18683 case X86ISD::FMAX: return "X86ISD::FMAX";
18684 case X86ISD::FMIN: return "X86ISD::FMIN";
18685 case X86ISD::FMAXC: return "X86ISD::FMAXC";
18686 case X86ISD::FMINC: return "X86ISD::FMINC";
18687 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
18688 case X86ISD::FRCP: return "X86ISD::FRCP";
18689 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
18690 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
18691 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
18692 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
18693 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
18694 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
18695 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
18696 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
18697 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
18698 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
18699 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
18700 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
18701 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
18702 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
18703 case X86ISD::VZEXT: return "X86ISD::VZEXT";
18704 case X86ISD::VSEXT: return "X86ISD::VSEXT";
18705 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
18706 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
18707 case X86ISD::VINSERT: return "X86ISD::VINSERT";
18708 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
18709 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
18710 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
18711 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
18712 case X86ISD::VSHL: return "X86ISD::VSHL";
18713 case X86ISD::VSRL: return "X86ISD::VSRL";
18714 case X86ISD::VSRA: return "X86ISD::VSRA";
18715 case X86ISD::VSHLI: return "X86ISD::VSHLI";
18716 case X86ISD::VSRLI: return "X86ISD::VSRLI";
18717 case X86ISD::VSRAI: return "X86ISD::VSRAI";
18718 case X86ISD::CMPP: return "X86ISD::CMPP";
18719 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
18720 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
18721 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
18722 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
18723 case X86ISD::ADD: return "X86ISD::ADD";
18724 case X86ISD::SUB: return "X86ISD::SUB";
18725 case X86ISD::ADC: return "X86ISD::ADC";
18726 case X86ISD::SBB: return "X86ISD::SBB";
18727 case X86ISD::SMUL: return "X86ISD::SMUL";
18728 case X86ISD::UMUL: return "X86ISD::UMUL";
18729 case X86ISD::INC: return "X86ISD::INC";
18730 case X86ISD::DEC: return "X86ISD::DEC";
18731 case X86ISD::OR: return "X86ISD::OR";
18732 case X86ISD::XOR: return "X86ISD::XOR";
18733 case X86ISD::AND: return "X86ISD::AND";
18734 case X86ISD::BEXTR: return "X86ISD::BEXTR";
18735 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
18736 case X86ISD::PTEST: return "X86ISD::PTEST";
18737 case X86ISD::TESTP: return "X86ISD::TESTP";
18738 case X86ISD::TESTM: return "X86ISD::TESTM";
18739 case X86ISD::TESTNM: return "X86ISD::TESTNM";
18740 case X86ISD::KORTEST: return "X86ISD::KORTEST";
18741 case X86ISD::PACKSS: return "X86ISD::PACKSS";
18742 case X86ISD::PACKUS: return "X86ISD::PACKUS";
18743 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
18744 case X86ISD::VALIGN: return "X86ISD::VALIGN";
18745 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
18746 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
18747 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
18748 case X86ISD::SHUFP: return "X86ISD::SHUFP";
18749 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
18750 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
18751 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
18752 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
18753 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
18754 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
18755 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
18756 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
18757 case X86ISD::MOVSD: return "X86ISD::MOVSD";
18758 case X86ISD::MOVSS: return "X86ISD::MOVSS";
18759 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
18760 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
18761 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
18762 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
18763 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
18764 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
18765 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
18766 case X86ISD::VPERMV: return "X86ISD::VPERMV";
18767 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
18768 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
18769 case X86ISD::VPERMI: return "X86ISD::VPERMI";
18770 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
18771 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
18772 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
18773 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
18774 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
18775 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
18776 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
18777 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
18778 case X86ISD::SAHF: return "X86ISD::SAHF";
18779 case X86ISD::RDRAND: return "X86ISD::RDRAND";
18780 case X86ISD::RDSEED: return "X86ISD::RDSEED";
18781 case X86ISD::FMADD: return "X86ISD::FMADD";
18782 case X86ISD::FMSUB: return "X86ISD::FMSUB";
18783 case X86ISD::FNMADD: return "X86ISD::FNMADD";
18784 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
18785 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
18786 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
18787 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
18788 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
18789 case X86ISD::XTEST: return "X86ISD::XTEST";
18790 }
18791 }
18793 // isLegalAddressingMode - Return true if the addressing mode represented
18794 // by AM is legal for this target, for a load/store of the specified type.
18795 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
18796 Type *Ty) const {
18797 // X86 supports extremely general addressing modes.
18798 CodeModel::Model M = getTargetMachine().getCodeModel();
18799 Reloc::Model R = getTargetMachine().getRelocationModel();
18801 // X86 allows a sign-extended 32-bit immediate field as a displacement.
18802 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
18803 return false;
18805 if (AM.BaseGV) {
18806 unsigned GVFlags =
18807 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
18809 // If a reference to this global requires an extra load, we can't fold it.
18810 if (isGlobalStubReference(GVFlags))
18811 return false;
18813 // If BaseGV requires a register for the PIC base, we cannot also have a
18814 // BaseReg specified.
18815 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
18816 return false;
18818 // If lower 4G is not available, then we must use rip-relative addressing.
18819 if ((M != CodeModel::Small || R != Reloc::Static) &&
18820 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
18821 return false;
18822 }
18824 switch (AM.Scale) {
18825 case 0:
18826 case 1:
18827 case 2:
18828 case 4:
18829 case 8:
18830 // These scales always work.
18831 break;
18832 case 3:
18833 case 5:
18834 case 9:
18835 // These scales are formed with basereg+scalereg. Only accept if there is
18836 // no basereg yet.
18837 if (AM.HasBaseReg)
18838 return false;
18839 break;
18840 default: // Other stuff never works.
18841 return false;
18842 }
18844 return true;
18845 }
18847 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
18848 unsigned Bits = Ty->getScalarSizeInBits();
18850 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
18851 // particularly cheaper than those without.
18852 if (Bits == 8)
18853 return false;
18855 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
18856 // variable shifts just as cheap as scalar ones.
18857 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
18858 return false;
18860 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
18861 // fully general vector.
18862 return true;
18863 }
18865 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
18866 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18867 return false;
18868 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
18869 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
18870 return NumBits1 > NumBits2;
18871 }
18873 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
18874 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18875 return false;
18877 if (!isTypeLegal(EVT::getEVT(Ty1)))
18878 return false;
18880 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
18882 // Assuming the caller doesn't have a zeroext or signext return parameter,
18883 // truncation all the way down to i1 is valid.
18884 return true;
18885 }
18887 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
18888 return isInt<32>(Imm);
18889 }
18891 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
18892 // Can also use sub to handle negated immediates.
18893 return isInt<32>(Imm);
18894 }
18896 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
18897 if (!VT1.isInteger() || !VT2.isInteger())
18898 return false;
18899 unsigned NumBits1 = VT1.getSizeInBits();
18900 unsigned NumBits2 = VT2.getSizeInBits();
18901 return NumBits1 > NumBits2;
18902 }
18904 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
18905 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18906 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
18907 }
18909 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
18910 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18911 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
18912 }
18914 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
18915 EVT VT1 = Val.getValueType();
18916 if (isZExtFree(VT1, VT2))
18917 return true;
18919 if (Val.getOpcode() != ISD::LOAD)
18920 return false;
18922 if (!VT1.isSimple() || !VT1.isInteger() ||
18923 !VT2.isSimple() || !VT2.isInteger())
18924 return false;
18926 switch (VT1.getSimpleVT().SimpleTy) {
18927 default: break;
18928 case MVT::i8:
18929 case MVT::i16:
18930 case MVT::i32:
18931 // X86 has 8, 16, and 32-bit zero-extending loads.
18932 return true;
18933 }
18935 return false;
18936 }
18938 bool
18939 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
18940 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
18941 return false;
18943 VT = VT.getScalarType();
18945 if (!VT.isSimple())
18946 return false;
18948 switch (VT.getSimpleVT().SimpleTy) {
18949 case MVT::f32:
18950 case MVT::f64:
18951 return true;
18952 default:
18953 break;
18954 }
18956 return false;
18957 }
18959 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
18960 // i16 instructions are longer (0x66 prefix) and potentially slower.
18961 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
18962 }
18964 /// isShuffleMaskLegal - Targets can use this to indicate that they only
18965 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
18966 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
18967 /// are assumed to be legal.
18968 bool
18969 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
18970 EVT VT) const {
18971 if (!VT.isSimple())
18972 return false;
18974 MVT SVT = VT.getSimpleVT();
18976 // Very little shuffling can be done for 64-bit vectors right now.
18977 if (VT.getSizeInBits() == 64)
18978 return false;
18980 // If this is a single-input shuffle with no 128 bit lane crossings we can
18981 // lower it into pshufb.
18982 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
18983 (SVT.is256BitVector() && Subtarget->hasInt256())) {
18984 bool isLegal = true;
18985 for (unsigned I = 0, E = M.size(); I != E; ++I) {
18986 if (M[I] >= (int)SVT.getVectorNumElements() ||
18987 ShuffleCrosses128bitLane(SVT, I, M[I])) {
18988 isLegal = false;
18989 break;
18990 }
18991 }
18992 if (isLegal)
18993 return true;
18994 }
18996 // FIXME: blends, shifts.
18997 return (SVT.getVectorNumElements() == 2 ||
18998 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
18999 isMOVLMask(M, SVT) ||
19000 isMOVHLPSMask(M, SVT) ||
19001 isSHUFPMask(M, SVT) ||
19002 isPSHUFDMask(M, SVT) ||
19003 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
19004 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
19005 isPALIGNRMask(M, SVT, Subtarget) ||
19006 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
19007 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
19008 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19009 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19010 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
19011 }
19013 bool
19014 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
19015 EVT VT) const {
19016 if (!VT.isSimple())
19017 return false;
19019 MVT SVT = VT.getSimpleVT();
19020 unsigned NumElts = SVT.getVectorNumElements();
19021 // FIXME: This collection of masks seems suspect.
19022 if (NumElts == 2)
19023 return true;
19024 if (NumElts == 4 && SVT.is128BitVector()) {
19025 return (isMOVLMask(Mask, SVT) ||
19026 isCommutedMOVLMask(Mask, SVT, true) ||
19027 isSHUFPMask(Mask, SVT) ||
19028 isSHUFPMask(Mask, SVT, /* Commuted */ true));
19029 }
19030 return false;
19031 }
19033 //===----------------------------------------------------------------------===//
19034 // X86 Scheduler Hooks
19035 //===----------------------------------------------------------------------===//
19037 /// Utility function to emit xbegin specifying the start of an RTM region.
19038 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
19039 const TargetInstrInfo *TII) {
19040 DebugLoc DL = MI->getDebugLoc();
19042 const BasicBlock *BB = MBB->getBasicBlock();
19043 MachineFunction::iterator I = MBB;
19044 ++I;
19046 // For the v = xbegin(), we generate
19047 //
19048 // thisMBB:
19049 // xbegin sinkMBB
19050 //
19051 // mainMBB:
19052 // eax = -1
19053 //
19054 // sinkMBB:
19055 // v = eax
19057 MachineBasicBlock *thisMBB = MBB;
19058 MachineFunction *MF = MBB->getParent();
19059 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19060 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19061 MF->insert(I, mainMBB);
19062 MF->insert(I, sinkMBB);
19064 // Transfer the remainder of BB and its successor edges to sinkMBB.
19065 sinkMBB->splice(sinkMBB->begin(), MBB,
19066 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19067 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19069 // thisMBB:
19070 // xbegin sinkMBB
19071 // # fallthrough to mainMBB
19072 // # abortion to sinkMBB
19073 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
19074 thisMBB->addSuccessor(mainMBB);
19075 thisMBB->addSuccessor(sinkMBB);
19077 // mainMBB:
19078 // EAX = -1
19079 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
19080 mainMBB->addSuccessor(sinkMBB);
19082 // sinkMBB:
19083 // EAX is live into the sinkMBB
19084 sinkMBB->addLiveIn(X86::EAX);
19085 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19086 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19087 .addReg(X86::EAX);
19089 MI->eraseFromParent();
19090 return sinkMBB;
19091 }
19093 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
19094 // or XMM0_V32I8 in AVX all of this code can be replaced with that
19095 // in the .td file.
19096 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
19097 const TargetInstrInfo *TII) {
19098 unsigned Opc;
19099 switch (MI->getOpcode()) {
19100 default: llvm_unreachable("illegal opcode!");
19101 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
19102 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
19103 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
19104 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
19105 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
19106 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
19107 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
19108 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
19109 }
19111 DebugLoc dl = MI->getDebugLoc();
19112 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19114 unsigned NumArgs = MI->getNumOperands();
19115 for (unsigned i = 1; i < NumArgs; ++i) {
19116 MachineOperand &Op = MI->getOperand(i);
19117 if (!(Op.isReg() && Op.isImplicit()))
19118 MIB.addOperand(Op);
19119 }
19120 if (MI->hasOneMemOperand())
19121 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19123 BuildMI(*BB, MI, dl,
19124 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19125 .addReg(X86::XMM0);
19127 MI->eraseFromParent();
19128 return BB;
19129 }
19131 // FIXME: Custom handling because TableGen doesn't support multiple implicit
19132 // defs in an instruction pattern
19133 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
19134 const TargetInstrInfo *TII) {
19135 unsigned Opc;
19136 switch (MI->getOpcode()) {
19137 default: llvm_unreachable("illegal opcode!");
19138 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
19139 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
19140 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
19141 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
19142 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
19143 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
19144 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
19145 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
19146 }
19148 DebugLoc dl = MI->getDebugLoc();
19149 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19151 unsigned NumArgs = MI->getNumOperands(); // remove the results
19152 for (unsigned i = 1; i < NumArgs; ++i) {
19153 MachineOperand &Op = MI->getOperand(i);
19154 if (!(Op.isReg() && Op.isImplicit()))
19155 MIB.addOperand(Op);
19156 }
19157 if (MI->hasOneMemOperand())
19158 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19160 BuildMI(*BB, MI, dl,
19161 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19162 .addReg(X86::ECX);
19164 MI->eraseFromParent();
19165 return BB;
19166 }
19168 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
19169 const TargetInstrInfo *TII,
19170 const X86Subtarget* Subtarget) {
19171 DebugLoc dl = MI->getDebugLoc();
19173 // Address into RAX/EAX, other two args into ECX, EDX.
19174 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
19175 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
19176 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
19177 for (int i = 0; i < X86::AddrNumOperands; ++i)
19178 MIB.addOperand(MI->getOperand(i));
19180 unsigned ValOps = X86::AddrNumOperands;
19181 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
19182 .addReg(MI->getOperand(ValOps).getReg());
19183 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
19184 .addReg(MI->getOperand(ValOps+1).getReg());
19186 // The instruction doesn't actually take any operands though.
19187 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
19189 MI->eraseFromParent(); // The pseudo is gone now.
19190 return BB;
19191 }
19193 MachineBasicBlock *
19194 X86TargetLowering::EmitVAARG64WithCustomInserter(
19195 MachineInstr *MI,
19196 MachineBasicBlock *MBB) const {
19197 // Emit va_arg instruction on X86-64.
19199 // Operands to this pseudo-instruction:
19200 // 0 ) Output : destination address (reg)
19201 // 1-5) Input : va_list address (addr, i64mem)
19202 // 6 ) ArgSize : Size (in bytes) of vararg type
19203 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
19204 // 8 ) Align : Alignment of type
19205 // 9 ) EFLAGS (implicit-def)
19207 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
19208 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
19210 unsigned DestReg = MI->getOperand(0).getReg();
19211 MachineOperand &Base = MI->getOperand(1);
19212 MachineOperand &Scale = MI->getOperand(2);
19213 MachineOperand &Index = MI->getOperand(3);
19214 MachineOperand &Disp = MI->getOperand(4);
19215 MachineOperand &Segment = MI->getOperand(5);
19216 unsigned ArgSize = MI->getOperand(6).getImm();
19217 unsigned ArgMode = MI->getOperand(7).getImm();
19218 unsigned Align = MI->getOperand(8).getImm();
19220 // Memory Reference
19221 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
19222 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19223 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19225 // Machine Information
19226 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19227 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
19228 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
19229 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
19230 DebugLoc DL = MI->getDebugLoc();
19232 // struct va_list {
19233 // i32 gp_offset
19234 // i32 fp_offset
19235 // i64 overflow_area (address)
19236 // i64 reg_save_area (address)
19237 // }
19238 // sizeof(va_list) = 24
19239 // alignment(va_list) = 8
19241 unsigned TotalNumIntRegs = 6;
19242 unsigned TotalNumXMMRegs = 8;
19243 bool UseGPOffset = (ArgMode == 1);
19244 bool UseFPOffset = (ArgMode == 2);
19245 unsigned MaxOffset = TotalNumIntRegs * 8 +
19246 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
19248 /* Align ArgSize to a multiple of 8 */
19249 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
19250 bool NeedsAlign = (Align > 8);
19252 MachineBasicBlock *thisMBB = MBB;
19253 MachineBasicBlock *overflowMBB;
19254 MachineBasicBlock *offsetMBB;
19255 MachineBasicBlock *endMBB;
19257 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
19258 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
19259 unsigned OffsetReg = 0;
19261 if (!UseGPOffset && !UseFPOffset) {
19262 // If we only pull from the overflow region, we don't create a branch.
19263 // We don't need to alter control flow.
19264 OffsetDestReg = 0; // unused
19265 OverflowDestReg = DestReg;
19267 offsetMBB = nullptr;
19268 overflowMBB = thisMBB;
19269 endMBB = thisMBB;
19270 } else {
19271 // First emit code to check if gp_offset (or fp_offset) is below the bound.
19272 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
19273 // If not, pull from overflow_area. (branch to overflowMBB)
19274 //
19275 // thisMBB
19276 // | .
19277 // | .
19278 // offsetMBB overflowMBB
19279 // | .
19280 // | .
19281 // endMBB
19283 // Registers for the PHI in endMBB
19284 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
19285 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
19287 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19288 MachineFunction *MF = MBB->getParent();
19289 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19290 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19291 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19293 MachineFunction::iterator MBBIter = MBB;
19294 ++MBBIter;
19296 // Insert the new basic blocks
19297 MF->insert(MBBIter, offsetMBB);
19298 MF->insert(MBBIter, overflowMBB);
19299 MF->insert(MBBIter, endMBB);
19301 // Transfer the remainder of MBB and its successor edges to endMBB.
19302 endMBB->splice(endMBB->begin(), thisMBB,
19303 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
19304 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
19306 // Make offsetMBB and overflowMBB successors of thisMBB
19307 thisMBB->addSuccessor(offsetMBB);
19308 thisMBB->addSuccessor(overflowMBB);
19310 // endMBB is a successor of both offsetMBB and overflowMBB
19311 offsetMBB->addSuccessor(endMBB);
19312 overflowMBB->addSuccessor(endMBB);
19314 // Load the offset value into a register
19315 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19316 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
19317 .addOperand(Base)
19318 .addOperand(Scale)
19319 .addOperand(Index)
19320 .addDisp(Disp, UseFPOffset ? 4 : 0)
19321 .addOperand(Segment)
19322 .setMemRefs(MMOBegin, MMOEnd);
19324 // Check if there is enough room left to pull this argument.
19325 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
19326 .addReg(OffsetReg)
19327 .addImm(MaxOffset + 8 - ArgSizeA8);
19329 // Branch to "overflowMBB" if offset >= max
19330 // Fall through to "offsetMBB" otherwise
19331 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
19332 .addMBB(overflowMBB);
19333 }
19335 // In offsetMBB, emit code to use the reg_save_area.
19336 if (offsetMBB) {
19337 assert(OffsetReg != 0);
19339 // Read the reg_save_area address.
19340 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
19341 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
19342 .addOperand(Base)
19343 .addOperand(Scale)
19344 .addOperand(Index)
19345 .addDisp(Disp, 16)
19346 .addOperand(Segment)
19347 .setMemRefs(MMOBegin, MMOEnd);
19349 // Zero-extend the offset
19350 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
19351 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
19352 .addImm(0)
19353 .addReg(OffsetReg)
19354 .addImm(X86::sub_32bit);
19356 // Add the offset to the reg_save_area to get the final address.
19357 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
19358 .addReg(OffsetReg64)
19359 .addReg(RegSaveReg);
19361 // Compute the offset for the next argument
19362 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19363 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
19364 .addReg(OffsetReg)
19365 .addImm(UseFPOffset ? 16 : 8);
19367 // Store it back into the va_list.
19368 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
19369 .addOperand(Base)
19370 .addOperand(Scale)
19371 .addOperand(Index)
19372 .addDisp(Disp, UseFPOffset ? 4 : 0)
19373 .addOperand(Segment)
19374 .addReg(NextOffsetReg)
19375 .setMemRefs(MMOBegin, MMOEnd);
19377 // Jump to endMBB
19378 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
19379 .addMBB(endMBB);
19380 }
19382 //
19383 // Emit code to use overflow area
19384 //
19386 // Load the overflow_area address into a register.
19387 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
19388 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
19389 .addOperand(Base)
19390 .addOperand(Scale)
19391 .addOperand(Index)
19392 .addDisp(Disp, 8)
19393 .addOperand(Segment)
19394 .setMemRefs(MMOBegin, MMOEnd);
19396 // If we need to align it, do so. Otherwise, just copy the address
19397 // to OverflowDestReg.
19398 if (NeedsAlign) {
19399 // Align the overflow address
19400 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
19401 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
19403 // aligned_addr = (addr + (align-1)) & ~(align-1)
19404 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
19405 .addReg(OverflowAddrReg)
19406 .addImm(Align-1);
19408 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
19409 .addReg(TmpReg)
19410 .addImm(~(uint64_t)(Align-1));
19411 } else {
19412 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
19413 .addReg(OverflowAddrReg);
19414 }
19416 // Compute the next overflow address after this argument.
19417 // (the overflow address should be kept 8-byte aligned)
19418 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
19419 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
19420 .addReg(OverflowDestReg)
19421 .addImm(ArgSizeA8);
19423 // Store the new overflow address.
19424 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
19425 .addOperand(Base)
19426 .addOperand(Scale)
19427 .addOperand(Index)
19428 .addDisp(Disp, 8)
19429 .addOperand(Segment)
19430 .addReg(NextAddrReg)
19431 .setMemRefs(MMOBegin, MMOEnd);
19433 // If we branched, emit the PHI to the front of endMBB.
19434 if (offsetMBB) {
19435 BuildMI(*endMBB, endMBB->begin(), DL,
19436 TII->get(X86::PHI), DestReg)
19437 .addReg(OffsetDestReg).addMBB(offsetMBB)
19438 .addReg(OverflowDestReg).addMBB(overflowMBB);
19439 }
19441 // Erase the pseudo instruction
19442 MI->eraseFromParent();
19444 return endMBB;
19445 }
19447 MachineBasicBlock *
19448 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
19449 MachineInstr *MI,
19450 MachineBasicBlock *MBB) const {
19451 // Emit code to save XMM registers to the stack. The ABI says that the
19452 // number of registers to save is given in %al, so it's theoretically
19453 // possible to do an indirect jump trick to avoid saving all of them,
19454 // however this code takes a simpler approach and just executes all
19455 // of the stores if %al is non-zero. It's less code, and it's probably
19456 // easier on the hardware branch predictor, and stores aren't all that
19457 // expensive anyway.
19459 // Create the new basic blocks. One block contains all the XMM stores,
19460 // and one block is the final destination regardless of whether any
19461 // stores were performed.
19462 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19463 MachineFunction *F = MBB->getParent();
19464 MachineFunction::iterator MBBIter = MBB;
19465 ++MBBIter;
19466 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
19467 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
19468 F->insert(MBBIter, XMMSaveMBB);
19469 F->insert(MBBIter, EndMBB);
19471 // Transfer the remainder of MBB and its successor edges to EndMBB.
19472 EndMBB->splice(EndMBB->begin(), MBB,
19473 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19474 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
19476 // The original block will now fall through to the XMM save block.
19477 MBB->addSuccessor(XMMSaveMBB);
19478 // The XMMSaveMBB will fall through to the end block.
19479 XMMSaveMBB->addSuccessor(EndMBB);
19481 // Now add the instructions.
19482 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19483 DebugLoc DL = MI->getDebugLoc();
19485 unsigned CountReg = MI->getOperand(0).getReg();
19486 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
19487 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
19489 if (!Subtarget->isTargetWin64()) {
19490 // If %al is 0, branch around the XMM save block.
19491 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
19492 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
19493 MBB->addSuccessor(EndMBB);
19494 }
19496 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
19497 // that was just emitted, but clearly shouldn't be "saved".
19498 assert((MI->getNumOperands() <= 3 ||
19499 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
19500 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
19501 && "Expected last argument to be EFLAGS");
19502 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
19503 // In the XMM save block, save all the XMM argument registers.
19504 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
19505 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
19506 MachineMemOperand *MMO =
19507 F->getMachineMemOperand(
19508 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
19509 MachineMemOperand::MOStore,
19510 /*Size=*/16, /*Align=*/16);
19511 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
19512 .addFrameIndex(RegSaveFrameIndex)
19513 .addImm(/*Scale=*/1)
19514 .addReg(/*IndexReg=*/0)
19515 .addImm(/*Disp=*/Offset)
19516 .addReg(/*Segment=*/0)
19517 .addReg(MI->getOperand(i).getReg())
19518 .addMemOperand(MMO);
19519 }
19521 MI->eraseFromParent(); // The pseudo instruction is gone now.
19523 return EndMBB;
19524 }
19526 // The EFLAGS operand of SelectItr might be missing a kill marker
19527 // because there were multiple uses of EFLAGS, and ISel didn't know
19528 // which to mark. Figure out whether SelectItr should have had a
19529 // kill marker, and set it if it should. Returns the correct kill
19530 // marker value.
19531 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
19532 MachineBasicBlock* BB,
19533 const TargetRegisterInfo* TRI) {
19534 // Scan forward through BB for a use/def of EFLAGS.
19535 MachineBasicBlock::iterator miI(std::next(SelectItr));
19536 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
19537 const MachineInstr& mi = *miI;
19538 if (mi.readsRegister(X86::EFLAGS))
19539 return false;
19540 if (mi.definesRegister(X86::EFLAGS))
19541 break; // Should have kill-flag - update below.
19542 }
19544 // If we hit the end of the block, check whether EFLAGS is live into a
19545 // successor.
19546 if (miI == BB->end()) {
19547 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
19548 sEnd = BB->succ_end();
19549 sItr != sEnd; ++sItr) {
19550 MachineBasicBlock* succ = *sItr;
19551 if (succ->isLiveIn(X86::EFLAGS))
19552 return false;
19553 }
19554 }
19556 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
19557 // out. SelectMI should have a kill flag on EFLAGS.
19558 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
19559 return true;
19560 }
19562 MachineBasicBlock *
19563 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
19564 MachineBasicBlock *BB) const {
19565 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19566 DebugLoc DL = MI->getDebugLoc();
19568 // To "insert" a SELECT_CC instruction, we actually have to insert the
19569 // diamond control-flow pattern. The incoming instruction knows the
19570 // destination vreg to set, the condition code register to branch on, the
19571 // true/false values to select between, and a branch opcode to use.
19572 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19573 MachineFunction::iterator It = BB;
19574 ++It;
19576 // thisMBB:
19577 // ...
19578 // TrueVal = ...
19579 // cmpTY ccX, r1, r2
19580 // bCC copy1MBB
19581 // fallthrough --> copy0MBB
19582 MachineBasicBlock *thisMBB = BB;
19583 MachineFunction *F = BB->getParent();
19584 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
19585 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
19586 F->insert(It, copy0MBB);
19587 F->insert(It, sinkMBB);
19589 // If the EFLAGS register isn't dead in the terminator, then claim that it's
19590 // live into the sink and copy blocks.
19591 const TargetRegisterInfo *TRI =
19592 BB->getParent()->getSubtarget().getRegisterInfo();
19593 if (!MI->killsRegister(X86::EFLAGS) &&
19594 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
19595 copy0MBB->addLiveIn(X86::EFLAGS);
19596 sinkMBB->addLiveIn(X86::EFLAGS);
19597 }
19599 // Transfer the remainder of BB and its successor edges to sinkMBB.
19600 sinkMBB->splice(sinkMBB->begin(), BB,
19601 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19602 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
19604 // Add the true and fallthrough blocks as its successors.
19605 BB->addSuccessor(copy0MBB);
19606 BB->addSuccessor(sinkMBB);
19608 // Create the conditional branch instruction.
19609 unsigned Opc =
19610 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
19611 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
19613 // copy0MBB:
19614 // %FalseValue = ...
19615 // # fallthrough to sinkMBB
19616 copy0MBB->addSuccessor(sinkMBB);
19618 // sinkMBB:
19619 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
19620 // ...
19621 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19622 TII->get(X86::PHI), MI->getOperand(0).getReg())
19623 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
19624 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
19626 MI->eraseFromParent(); // The pseudo instruction is gone now.
19627 return sinkMBB;
19628 }
19630 MachineBasicBlock *
19631 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
19632 MachineBasicBlock *BB) const {
19633 MachineFunction *MF = BB->getParent();
19634 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19635 DebugLoc DL = MI->getDebugLoc();
19636 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19638 assert(MF->shouldSplitStack());
19640 const bool Is64Bit = Subtarget->is64Bit();
19641 const bool IsLP64 = Subtarget->isTarget64BitLP64();
19643 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
19644 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
19646 // BB:
19647 // ... [Till the alloca]
19648 // If stacklet is not large enough, jump to mallocMBB
19649 //
19650 // bumpMBB:
19651 // Allocate by subtracting from RSP
19652 // Jump to continueMBB
19653 //
19654 // mallocMBB:
19655 // Allocate by call to runtime
19656 //
19657 // continueMBB:
19658 // ...
19659 // [rest of original BB]
19660 //
19662 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19663 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19664 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19666 MachineRegisterInfo &MRI = MF->getRegInfo();
19667 const TargetRegisterClass *AddrRegClass =
19668 getRegClassFor(getPointerTy());
19670 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19671 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19672 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
19673 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
19674 sizeVReg = MI->getOperand(1).getReg(),
19675 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
19677 MachineFunction::iterator MBBIter = BB;
19678 ++MBBIter;
19680 MF->insert(MBBIter, bumpMBB);
19681 MF->insert(MBBIter, mallocMBB);
19682 MF->insert(MBBIter, continueMBB);
19684 continueMBB->splice(continueMBB->begin(), BB,
19685 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19686 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
19688 // Add code to the main basic block to check if the stack limit has been hit,
19689 // and if so, jump to mallocMBB otherwise to bumpMBB.
19690 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
19691 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
19692 .addReg(tmpSPVReg).addReg(sizeVReg);
19693 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
19694 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
19695 .addReg(SPLimitVReg);
19696 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
19698 // bumpMBB simply decreases the stack pointer, since we know the current
19699 // stacklet has enough space.
19700 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
19701 .addReg(SPLimitVReg);
19702 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
19703 .addReg(SPLimitVReg);
19704 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19706 // Calls into a routine in libgcc to allocate more space from the heap.
19707 const uint32_t *RegMask = MF->getTarget()
19708 .getSubtargetImpl()
19709 ->getRegisterInfo()
19710 ->getCallPreservedMask(CallingConv::C);
19711 if (IsLP64) {
19712 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
19713 .addReg(sizeVReg);
19714 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19715 .addExternalSymbol("__morestack_allocate_stack_space")
19716 .addRegMask(RegMask)
19717 .addReg(X86::RDI, RegState::Implicit)
19718 .addReg(X86::RAX, RegState::ImplicitDefine);
19719 } else if (Is64Bit) {
19720 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
19721 .addReg(sizeVReg);
19722 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19723 .addExternalSymbol("__morestack_allocate_stack_space")
19724 .addRegMask(RegMask)
19725 .addReg(X86::EDI, RegState::Implicit)
19726 .addReg(X86::EAX, RegState::ImplicitDefine);
19727 } else {
19728 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
19729 .addImm(12);
19730 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
19731 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
19732 .addExternalSymbol("__morestack_allocate_stack_space")
19733 .addRegMask(RegMask)
19734 .addReg(X86::EAX, RegState::ImplicitDefine);
19735 }
19737 if (!Is64Bit)
19738 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
19739 .addImm(16);
19741 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
19742 .addReg(IsLP64 ? X86::RAX : X86::EAX);
19743 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19745 // Set up the CFG correctly.
19746 BB->addSuccessor(bumpMBB);
19747 BB->addSuccessor(mallocMBB);
19748 mallocMBB->addSuccessor(continueMBB);
19749 bumpMBB->addSuccessor(continueMBB);
19751 // Take care of the PHI nodes.
19752 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
19753 MI->getOperand(0).getReg())
19754 .addReg(mallocPtrVReg).addMBB(mallocMBB)
19755 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
19757 // Delete the original pseudo instruction.
19758 MI->eraseFromParent();
19760 // And we're done.
19761 return continueMBB;
19762 }
19764 MachineBasicBlock *
19765 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
19766 MachineBasicBlock *BB) const {
19767 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19768 DebugLoc DL = MI->getDebugLoc();
19770 assert(!Subtarget->isTargetMacho());
19772 // The lowering is pretty easy: we're just emitting the call to _alloca. The
19773 // non-trivial part is impdef of ESP.
19775 if (Subtarget->isTargetWin64()) {
19776 if (Subtarget->isTargetCygMing()) {
19777 // ___chkstk(Mingw64):
19778 // Clobbers R10, R11, RAX and EFLAGS.
19779 // Updates RSP.
19780 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19781 .addExternalSymbol("___chkstk")
19782 .addReg(X86::RAX, RegState::Implicit)
19783 .addReg(X86::RSP, RegState::Implicit)
19784 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
19785 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
19786 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19787 } else {
19788 // __chkstk(MSVCRT): does not update stack pointer.
19789 // Clobbers R10, R11 and EFLAGS.
19790 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19791 .addExternalSymbol("__chkstk")
19792 .addReg(X86::RAX, RegState::Implicit)
19793 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19794 // RAX has the offset to be subtracted from RSP.
19795 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
19796 .addReg(X86::RSP)
19797 .addReg(X86::RAX);
19798 }
19799 } else {
19800 const char *StackProbeSymbol =
19801 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
19803 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
19804 .addExternalSymbol(StackProbeSymbol)
19805 .addReg(X86::EAX, RegState::Implicit)
19806 .addReg(X86::ESP, RegState::Implicit)
19807 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
19808 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
19809 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19810 }
19812 MI->eraseFromParent(); // The pseudo instruction is gone now.
19813 return BB;
19814 }
19816 MachineBasicBlock *
19817 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
19818 MachineBasicBlock *BB) const {
19819 // This is pretty easy. We're taking the value that we received from
19820 // our load from the relocation, sticking it in either RDI (x86-64)
19821 // or EAX and doing an indirect call. The return value will then
19822 // be in the normal return register.
19823 MachineFunction *F = BB->getParent();
19824 const X86InstrInfo *TII =
19825 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
19826 DebugLoc DL = MI->getDebugLoc();
19828 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
19829 assert(MI->getOperand(3).isGlobal() && "This should be a global");
19831 // Get a register mask for the lowered call.
19832 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
19833 // proper register mask.
19834 const uint32_t *RegMask = F->getTarget()
19835 .getSubtargetImpl()
19836 ->getRegisterInfo()
19837 ->getCallPreservedMask(CallingConv::C);
19838 if (Subtarget->is64Bit()) {
19839 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19840 TII->get(X86::MOV64rm), X86::RDI)
19841 .addReg(X86::RIP)
19842 .addImm(0).addReg(0)
19843 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19844 MI->getOperand(3).getTargetFlags())
19845 .addReg(0);
19846 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
19847 addDirectMem(MIB, X86::RDI);
19848 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
19849 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
19850 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19851 TII->get(X86::MOV32rm), X86::EAX)
19852 .addReg(0)
19853 .addImm(0).addReg(0)
19854 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19855 MI->getOperand(3).getTargetFlags())
19856 .addReg(0);
19857 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19858 addDirectMem(MIB, X86::EAX);
19859 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19860 } else {
19861 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19862 TII->get(X86::MOV32rm), X86::EAX)
19863 .addReg(TII->getGlobalBaseReg(F))
19864 .addImm(0).addReg(0)
19865 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19866 MI->getOperand(3).getTargetFlags())
19867 .addReg(0);
19868 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19869 addDirectMem(MIB, X86::EAX);
19870 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19871 }
19873 MI->eraseFromParent(); // The pseudo instruction is gone now.
19874 return BB;
19875 }
19877 MachineBasicBlock *
19878 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
19879 MachineBasicBlock *MBB) const {
19880 DebugLoc DL = MI->getDebugLoc();
19881 MachineFunction *MF = MBB->getParent();
19882 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19883 MachineRegisterInfo &MRI = MF->getRegInfo();
19885 const BasicBlock *BB = MBB->getBasicBlock();
19886 MachineFunction::iterator I = MBB;
19887 ++I;
19889 // Memory Reference
19890 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19891 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19893 unsigned DstReg;
19894 unsigned MemOpndSlot = 0;
19896 unsigned CurOp = 0;
19898 DstReg = MI->getOperand(CurOp++).getReg();
19899 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
19900 assert(RC->hasType(MVT::i32) && "Invalid destination!");
19901 unsigned mainDstReg = MRI.createVirtualRegister(RC);
19902 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
19904 MemOpndSlot = CurOp;
19906 MVT PVT = getPointerTy();
19907 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19908 "Invalid Pointer Size!");
19910 // For v = setjmp(buf), we generate
19911 //
19912 // thisMBB:
19913 // buf[LabelOffset] = restoreMBB
19914 // SjLjSetup restoreMBB
19915 //
19916 // mainMBB:
19917 // v_main = 0
19918 //
19919 // sinkMBB:
19920 // v = phi(main, restore)
19921 //
19922 // restoreMBB:
19923 // v_restore = 1
19925 MachineBasicBlock *thisMBB = MBB;
19926 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19927 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19928 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
19929 MF->insert(I, mainMBB);
19930 MF->insert(I, sinkMBB);
19931 MF->push_back(restoreMBB);
19933 MachineInstrBuilder MIB;
19935 // Transfer the remainder of BB and its successor edges to sinkMBB.
19936 sinkMBB->splice(sinkMBB->begin(), MBB,
19937 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19938 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19940 // thisMBB:
19941 unsigned PtrStoreOpc = 0;
19942 unsigned LabelReg = 0;
19943 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19944 Reloc::Model RM = MF->getTarget().getRelocationModel();
19945 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
19946 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
19948 // Prepare IP either in reg or imm.
19949 if (!UseImmLabel) {
19950 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
19951 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
19952 LabelReg = MRI.createVirtualRegister(PtrRC);
19953 if (Subtarget->is64Bit()) {
19954 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
19955 .addReg(X86::RIP)
19956 .addImm(0)
19957 .addReg(0)
19958 .addMBB(restoreMBB)
19959 .addReg(0);
19960 } else {
19961 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
19962 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
19963 .addReg(XII->getGlobalBaseReg(MF))
19964 .addImm(0)
19965 .addReg(0)
19966 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
19967 .addReg(0);
19968 }
19969 } else
19970 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
19971 // Store IP
19972 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
19973 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19974 if (i == X86::AddrDisp)
19975 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
19976 else
19977 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
19978 }
19979 if (!UseImmLabel)
19980 MIB.addReg(LabelReg);
19981 else
19982 MIB.addMBB(restoreMBB);
19983 MIB.setMemRefs(MMOBegin, MMOEnd);
19984 // Setup
19985 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
19986 .addMBB(restoreMBB);
19988 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19989 MF->getSubtarget().getRegisterInfo());
19990 MIB.addRegMask(RegInfo->getNoPreservedMask());
19991 thisMBB->addSuccessor(mainMBB);
19992 thisMBB->addSuccessor(restoreMBB);
19994 // mainMBB:
19995 // EAX = 0
19996 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
19997 mainMBB->addSuccessor(sinkMBB);
19999 // sinkMBB:
20000 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20001 TII->get(X86::PHI), DstReg)
20002 .addReg(mainDstReg).addMBB(mainMBB)
20003 .addReg(restoreDstReg).addMBB(restoreMBB);
20005 // restoreMBB:
20006 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
20007 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
20008 restoreMBB->addSuccessor(sinkMBB);
20010 MI->eraseFromParent();
20011 return sinkMBB;
20012 }
20014 MachineBasicBlock *
20015 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
20016 MachineBasicBlock *MBB) const {
20017 DebugLoc DL = MI->getDebugLoc();
20018 MachineFunction *MF = MBB->getParent();
20019 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20020 MachineRegisterInfo &MRI = MF->getRegInfo();
20022 // Memory Reference
20023 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20024 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20026 MVT PVT = getPointerTy();
20027 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20028 "Invalid Pointer Size!");
20030 const TargetRegisterClass *RC =
20031 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
20032 unsigned Tmp = MRI.createVirtualRegister(RC);
20033 // Since FP is only updated here but NOT referenced, it's treated as GPR.
20034 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20035 MF->getSubtarget().getRegisterInfo());
20036 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
20037 unsigned SP = RegInfo->getStackRegister();
20039 MachineInstrBuilder MIB;
20041 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20042 const int64_t SPOffset = 2 * PVT.getStoreSize();
20044 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
20045 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
20047 // Reload FP
20048 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
20049 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
20050 MIB.addOperand(MI->getOperand(i));
20051 MIB.setMemRefs(MMOBegin, MMOEnd);
20052 // Reload IP
20053 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
20054 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20055 if (i == X86::AddrDisp)
20056 MIB.addDisp(MI->getOperand(i), LabelOffset);
20057 else
20058 MIB.addOperand(MI->getOperand(i));
20059 }
20060 MIB.setMemRefs(MMOBegin, MMOEnd);
20061 // Reload SP
20062 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
20063 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20064 if (i == X86::AddrDisp)
20065 MIB.addDisp(MI->getOperand(i), SPOffset);
20066 else
20067 MIB.addOperand(MI->getOperand(i));
20068 }
20069 MIB.setMemRefs(MMOBegin, MMOEnd);
20070 // Jump
20071 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
20073 MI->eraseFromParent();
20074 return MBB;
20075 }
20077 // Replace 213-type (isel default) FMA3 instructions with 231-type for
20078 // accumulator loops. Writing back to the accumulator allows the coalescer
20079 // to remove extra copies in the loop.
20080 MachineBasicBlock *
20081 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
20082 MachineBasicBlock *MBB) const {
20083 MachineOperand &AddendOp = MI->getOperand(3);
20085 // Bail out early if the addend isn't a register - we can't switch these.
20086 if (!AddendOp.isReg())
20087 return MBB;
20089 MachineFunction &MF = *MBB->getParent();
20090 MachineRegisterInfo &MRI = MF.getRegInfo();
20092 // Check whether the addend is defined by a PHI:
20093 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
20094 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
20095 if (!AddendDef.isPHI())
20096 return MBB;
20098 // Look for the following pattern:
20099 // loop:
20100 // %addend = phi [%entry, 0], [%loop, %result]
20101 // ...
20102 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
20104 // Replace with:
20105 // loop:
20106 // %addend = phi [%entry, 0], [%loop, %result]
20107 // ...
20108 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
20110 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
20111 assert(AddendDef.getOperand(i).isReg());
20112 MachineOperand PHISrcOp = AddendDef.getOperand(i);
20113 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
20114 if (&PHISrcInst == MI) {
20115 // Found a matching instruction.
20116 unsigned NewFMAOpc = 0;
20117 switch (MI->getOpcode()) {
20118 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
20119 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
20120 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
20121 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
20122 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
20123 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
20124 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
20125 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
20126 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
20127 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
20128 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
20129 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
20130 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
20131 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
20132 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
20133 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
20134 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
20135 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
20136 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
20137 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
20138 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
20139 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
20140 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
20141 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
20142 default: llvm_unreachable("Unrecognized FMA variant.");
20143 }
20145 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
20146 MachineInstrBuilder MIB =
20147 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
20148 .addOperand(MI->getOperand(0))
20149 .addOperand(MI->getOperand(3))
20150 .addOperand(MI->getOperand(2))
20151 .addOperand(MI->getOperand(1));
20152 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
20153 MI->eraseFromParent();
20154 }
20155 }
20157 return MBB;
20158 }
20160 MachineBasicBlock *
20161 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
20162 MachineBasicBlock *BB) const {
20163 switch (MI->getOpcode()) {
20164 default: llvm_unreachable("Unexpected instr type to insert");
20165 case X86::TAILJMPd64:
20166 case X86::TAILJMPr64:
20167 case X86::TAILJMPm64:
20168 llvm_unreachable("TAILJMP64 would not be touched here.");
20169 case X86::TCRETURNdi64:
20170 case X86::TCRETURNri64:
20171 case X86::TCRETURNmi64:
20172 return BB;
20173 case X86::WIN_ALLOCA:
20174 return EmitLoweredWinAlloca(MI, BB);
20175 case X86::SEG_ALLOCA_32:
20176 case X86::SEG_ALLOCA_64:
20177 return EmitLoweredSegAlloca(MI, BB);
20178 case X86::TLSCall_32:
20179 case X86::TLSCall_64:
20180 return EmitLoweredTLSCall(MI, BB);
20181 case X86::CMOV_GR8:
20182 case X86::CMOV_FR32:
20183 case X86::CMOV_FR64:
20184 case X86::CMOV_V4F32:
20185 case X86::CMOV_V2F64:
20186 case X86::CMOV_V2I64:
20187 case X86::CMOV_V8F32:
20188 case X86::CMOV_V4F64:
20189 case X86::CMOV_V4I64:
20190 case X86::CMOV_V16F32:
20191 case X86::CMOV_V8F64:
20192 case X86::CMOV_V8I64:
20193 case X86::CMOV_GR16:
20194 case X86::CMOV_GR32:
20195 case X86::CMOV_RFP32:
20196 case X86::CMOV_RFP64:
20197 case X86::CMOV_RFP80:
20198 return EmitLoweredSelect(MI, BB);
20200 case X86::FP32_TO_INT16_IN_MEM:
20201 case X86::FP32_TO_INT32_IN_MEM:
20202 case X86::FP32_TO_INT64_IN_MEM:
20203 case X86::FP64_TO_INT16_IN_MEM:
20204 case X86::FP64_TO_INT32_IN_MEM:
20205 case X86::FP64_TO_INT64_IN_MEM:
20206 case X86::FP80_TO_INT16_IN_MEM:
20207 case X86::FP80_TO_INT32_IN_MEM:
20208 case X86::FP80_TO_INT64_IN_MEM: {
20209 MachineFunction *F = BB->getParent();
20210 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
20211 DebugLoc DL = MI->getDebugLoc();
20213 // Change the floating point control register to use "round towards zero"
20214 // mode when truncating to an integer value.
20215 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
20216 addFrameReference(BuildMI(*BB, MI, DL,
20217 TII->get(X86::FNSTCW16m)), CWFrameIdx);
20219 // Load the old value of the high byte of the control word...
20220 unsigned OldCW =
20221 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
20222 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
20223 CWFrameIdx);
20225 // Set the high part to be round to zero...
20226 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
20227 .addImm(0xC7F);
20229 // Reload the modified control word now...
20230 addFrameReference(BuildMI(*BB, MI, DL,
20231 TII->get(X86::FLDCW16m)), CWFrameIdx);
20233 // Restore the memory image of control word to original value
20234 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
20235 .addReg(OldCW);
20237 // Get the X86 opcode to use.
20238 unsigned Opc;
20239 switch (MI->getOpcode()) {
20240 default: llvm_unreachable("illegal opcode!");
20241 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
20242 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
20243 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
20244 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
20245 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
20246 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
20247 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
20248 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
20249 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
20250 }
20252 X86AddressMode AM;
20253 MachineOperand &Op = MI->getOperand(0);
20254 if (Op.isReg()) {
20255 AM.BaseType = X86AddressMode::RegBase;
20256 AM.Base.Reg = Op.getReg();
20257 } else {
20258 AM.BaseType = X86AddressMode::FrameIndexBase;
20259 AM.Base.FrameIndex = Op.getIndex();
20260 }
20261 Op = MI->getOperand(1);
20262 if (Op.isImm())
20263 AM.Scale = Op.getImm();
20264 Op = MI->getOperand(2);
20265 if (Op.isImm())
20266 AM.IndexReg = Op.getImm();
20267 Op = MI->getOperand(3);
20268 if (Op.isGlobal()) {
20269 AM.GV = Op.getGlobal();
20270 } else {
20271 AM.Disp = Op.getImm();
20272 }
20273 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
20274 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
20276 // Reload the original control word now.
20277 addFrameReference(BuildMI(*BB, MI, DL,
20278 TII->get(X86::FLDCW16m)), CWFrameIdx);
20280 MI->eraseFromParent(); // The pseudo instruction is gone now.
20281 return BB;
20282 }
20283 // String/text processing lowering.
20284 case X86::PCMPISTRM128REG:
20285 case X86::VPCMPISTRM128REG:
20286 case X86::PCMPISTRM128MEM:
20287 case X86::VPCMPISTRM128MEM:
20288 case X86::PCMPESTRM128REG:
20289 case X86::VPCMPESTRM128REG:
20290 case X86::PCMPESTRM128MEM:
20291 case X86::VPCMPESTRM128MEM:
20292 assert(Subtarget->hasSSE42() &&
20293 "Target must have SSE4.2 or AVX features enabled");
20294 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20296 // String/text processing lowering.
20297 case X86::PCMPISTRIREG:
20298 case X86::VPCMPISTRIREG:
20299 case X86::PCMPISTRIMEM:
20300 case X86::VPCMPISTRIMEM:
20301 case X86::PCMPESTRIREG:
20302 case X86::VPCMPESTRIREG:
20303 case X86::PCMPESTRIMEM:
20304 case X86::VPCMPESTRIMEM:
20305 assert(Subtarget->hasSSE42() &&
20306 "Target must have SSE4.2 or AVX features enabled");
20307 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20309 // Thread synchronization.
20310 case X86::MONITOR:
20311 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
20312 Subtarget);
20314 // xbegin
20315 case X86::XBEGIN:
20316 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20318 case X86::VASTART_SAVE_XMM_REGS:
20319 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
20321 case X86::VAARG_64:
20322 return EmitVAARG64WithCustomInserter(MI, BB);
20324 case X86::EH_SjLj_SetJmp32:
20325 case X86::EH_SjLj_SetJmp64:
20326 return emitEHSjLjSetJmp(MI, BB);
20328 case X86::EH_SjLj_LongJmp32:
20329 case X86::EH_SjLj_LongJmp64:
20330 return emitEHSjLjLongJmp(MI, BB);
20332 case TargetOpcode::STACKMAP:
20333 case TargetOpcode::PATCHPOINT:
20334 return emitPatchPoint(MI, BB);
20336 case X86::VFMADDPDr213r:
20337 case X86::VFMADDPSr213r:
20338 case X86::VFMADDSDr213r:
20339 case X86::VFMADDSSr213r:
20340 case X86::VFMSUBPDr213r:
20341 case X86::VFMSUBPSr213r:
20342 case X86::VFMSUBSDr213r:
20343 case X86::VFMSUBSSr213r:
20344 case X86::VFNMADDPDr213r:
20345 case X86::VFNMADDPSr213r:
20346 case X86::VFNMADDSDr213r:
20347 case X86::VFNMADDSSr213r:
20348 case X86::VFNMSUBPDr213r:
20349 case X86::VFNMSUBPSr213r:
20350 case X86::VFNMSUBSDr213r:
20351 case X86::VFNMSUBSSr213r:
20352 case X86::VFMADDPDr213rY:
20353 case X86::VFMADDPSr213rY:
20354 case X86::VFMSUBPDr213rY:
20355 case X86::VFMSUBPSr213rY:
20356 case X86::VFNMADDPDr213rY:
20357 case X86::VFNMADDPSr213rY:
20358 case X86::VFNMSUBPDr213rY:
20359 case X86::VFNMSUBPSr213rY:
20360 return emitFMA3Instr(MI, BB);
20361 }
20362 }
20364 //===----------------------------------------------------------------------===//
20365 // X86 Optimization Hooks
20366 //===----------------------------------------------------------------------===//
20368 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
20369 APInt &KnownZero,
20370 APInt &KnownOne,
20371 const SelectionDAG &DAG,
20372 unsigned Depth) const {
20373 unsigned BitWidth = KnownZero.getBitWidth();
20374 unsigned Opc = Op.getOpcode();
20375 assert((Opc >= ISD::BUILTIN_OP_END ||
20376 Opc == ISD::INTRINSIC_WO_CHAIN ||
20377 Opc == ISD::INTRINSIC_W_CHAIN ||
20378 Opc == ISD::INTRINSIC_VOID) &&
20379 "Should use MaskedValueIsZero if you don't know whether Op"
20380 " is a target node!");
20382 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
20383 switch (Opc) {
20384 default: break;
20385 case X86ISD::ADD:
20386 case X86ISD::SUB:
20387 case X86ISD::ADC:
20388 case X86ISD::SBB:
20389 case X86ISD::SMUL:
20390 case X86ISD::UMUL:
20391 case X86ISD::INC:
20392 case X86ISD::DEC:
20393 case X86ISD::OR:
20394 case X86ISD::XOR:
20395 case X86ISD::AND:
20396 // These nodes' second result is a boolean.
20397 if (Op.getResNo() == 0)
20398 break;
20399 // Fallthrough
20400 case X86ISD::SETCC:
20401 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
20402 break;
20403 case ISD::INTRINSIC_WO_CHAIN: {
20404 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
20405 unsigned NumLoBits = 0;
20406 switch (IntId) {
20407 default: break;
20408 case Intrinsic::x86_sse_movmsk_ps:
20409 case Intrinsic::x86_avx_movmsk_ps_256:
20410 case Intrinsic::x86_sse2_movmsk_pd:
20411 case Intrinsic::x86_avx_movmsk_pd_256:
20412 case Intrinsic::x86_mmx_pmovmskb:
20413 case Intrinsic::x86_sse2_pmovmskb_128:
20414 case Intrinsic::x86_avx2_pmovmskb: {
20415 // High bits of movmskp{s|d}, pmovmskb are known zero.
20416 switch (IntId) {
20417 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
20418 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
20419 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
20420 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
20421 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
20422 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
20423 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
20424 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
20425 }
20426 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
20427 break;
20428 }
20429 }
20430 break;
20431 }
20432 }
20433 }
20435 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
20436 SDValue Op,
20437 const SelectionDAG &,
20438 unsigned Depth) const {
20439 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
20440 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
20441 return Op.getValueType().getScalarType().getSizeInBits();
20443 // Fallback case.
20444 return 1;
20445 }
20447 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
20448 /// node is a GlobalAddress + offset.
20449 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
20450 const GlobalValue* &GA,
20451 int64_t &Offset) const {
20452 if (N->getOpcode() == X86ISD::Wrapper) {
20453 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
20454 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
20455 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
20456 return true;
20457 }
20458 }
20459 return TargetLowering::isGAPlusOffset(N, GA, Offset);
20460 }
20462 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
20463 /// same as extracting the high 128-bit part of 256-bit vector and then
20464 /// inserting the result into the low part of a new 256-bit vector
20465 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
20466 EVT VT = SVOp->getValueType(0);
20467 unsigned NumElems = VT.getVectorNumElements();
20469 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20470 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
20471 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20472 SVOp->getMaskElt(j) >= 0)
20473 return false;
20475 return true;
20476 }
20478 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
20479 /// same as extracting the low 128-bit part of 256-bit vector and then
20480 /// inserting the result into the high part of a new 256-bit vector
20481 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
20482 EVT VT = SVOp->getValueType(0);
20483 unsigned NumElems = VT.getVectorNumElements();
20485 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20486 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
20487 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20488 SVOp->getMaskElt(j) >= 0)
20489 return false;
20491 return true;
20492 }
20494 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
20495 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
20496 TargetLowering::DAGCombinerInfo &DCI,
20497 const X86Subtarget* Subtarget) {
20498 SDLoc dl(N);
20499 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20500 SDValue V1 = SVOp->getOperand(0);
20501 SDValue V2 = SVOp->getOperand(1);
20502 EVT VT = SVOp->getValueType(0);
20503 unsigned NumElems = VT.getVectorNumElements();
20505 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
20506 V2.getOpcode() == ISD::CONCAT_VECTORS) {
20507 //
20508 // 0,0,0,...
20509 // |
20510 // V UNDEF BUILD_VECTOR UNDEF
20511 // \ / \ /
20512 // CONCAT_VECTOR CONCAT_VECTOR
20513 // \ /
20514 // \ /
20515 // RESULT: V + zero extended
20516 //
20517 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
20518 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
20519 V1.getOperand(1).getOpcode() != ISD::UNDEF)
20520 return SDValue();
20522 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
20523 return SDValue();
20525 // To match the shuffle mask, the first half of the mask should
20526 // be exactly the first vector, and all the rest a splat with the
20527 // first element of the second one.
20528 for (unsigned i = 0; i != NumElems/2; ++i)
20529 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
20530 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
20531 return SDValue();
20533 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
20534 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
20535 if (Ld->hasNUsesOfValue(1, 0)) {
20536 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
20537 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
20538 SDValue ResNode =
20539 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
20540 Ld->getMemoryVT(),
20541 Ld->getPointerInfo(),
20542 Ld->getAlignment(),
20543 false/*isVolatile*/, true/*ReadMem*/,
20544 false/*WriteMem*/);
20546 // Make sure the newly-created LOAD is in the same position as Ld in
20547 // terms of dependency. We create a TokenFactor for Ld and ResNode,
20548 // and update uses of Ld's output chain to use the TokenFactor.
20549 if (Ld->hasAnyUseOfValue(1)) {
20550 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
20551 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
20552 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
20553 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
20554 SDValue(ResNode.getNode(), 1));
20555 }
20557 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
20558 }
20559 }
20561 // Emit a zeroed vector and insert the desired subvector on its
20562 // first half.
20563 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
20564 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
20565 return DCI.CombineTo(N, InsV);
20566 }
20568 //===--------------------------------------------------------------------===//
20569 // Combine some shuffles into subvector extracts and inserts:
20570 //
20572 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20573 if (isShuffleHigh128VectorInsertLow(SVOp)) {
20574 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
20575 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
20576 return DCI.CombineTo(N, InsV);
20577 }
20579 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20580 if (isShuffleLow128VectorInsertHigh(SVOp)) {
20581 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
20582 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
20583 return DCI.CombineTo(N, InsV);
20584 }
20586 return SDValue();
20587 }
20589 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
20590 /// possible.
20591 ///
20592 /// This is the leaf of the recursive combinine below. When we have found some
20593 /// chain of single-use x86 shuffle instructions and accumulated the combined
20594 /// shuffle mask represented by them, this will try to pattern match that mask
20595 /// into either a single instruction if there is a special purpose instruction
20596 /// for this operation, or into a PSHUFB instruction which is a fully general
20597 /// instruction but should only be used to replace chains over a certain depth.
20598 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
20599 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
20600 TargetLowering::DAGCombinerInfo &DCI,
20601 const X86Subtarget *Subtarget) {
20602 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
20604 // Find the operand that enters the chain. Note that multiple uses are OK
20605 // here, we're not going to remove the operand we find.
20606 SDValue Input = Op.getOperand(0);
20607 while (Input.getOpcode() == ISD::BITCAST)
20608 Input = Input.getOperand(0);
20610 MVT VT = Input.getSimpleValueType();
20611 MVT RootVT = Root.getSimpleValueType();
20612 SDLoc DL(Root);
20614 // Just remove no-op shuffle masks.
20615 if (Mask.size() == 1) {
20616 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
20617 /*AddTo*/ true);
20618 return true;
20619 }
20621 // Use the float domain if the operand type is a floating point type.
20622 bool FloatDomain = VT.isFloatingPoint();
20624 // For floating point shuffles, we don't have free copies in the shuffle
20625 // instructions or the ability to load as part of the instruction, so
20626 // canonicalize their shuffles to UNPCK or MOV variants.
20627 //
20628 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
20629 // vectors because it can have a load folded into it that UNPCK cannot. This
20630 // doesn't preclude something switching to the shorter encoding post-RA.
20631 if (FloatDomain) {
20632 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
20633 bool Lo = Mask.equals(0, 0);
20634 unsigned Shuffle;
20635 MVT ShuffleVT;
20636 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
20637 // is no slower than UNPCKLPD but has the option to fold the input operand
20638 // into even an unaligned memory load.
20639 if (Lo && Subtarget->hasSSE3()) {
20640 Shuffle = X86ISD::MOVDDUP;
20641 ShuffleVT = MVT::v2f64;
20642 } else {
20643 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
20644 // than the UNPCK variants.
20645 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
20646 ShuffleVT = MVT::v4f32;
20647 }
20648 if (Depth == 1 && Root->getOpcode() == Shuffle)
20649 return false; // Nothing to do!
20650 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20651 DCI.AddToWorklist(Op.getNode());
20652 if (Shuffle == X86ISD::MOVDDUP)
20653 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20654 else
20655 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20656 DCI.AddToWorklist(Op.getNode());
20657 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20658 /*AddTo*/ true);
20659 return true;
20660 }
20661 if (Subtarget->hasSSE3() &&
20662 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
20663 bool Lo = Mask.equals(0, 0, 2, 2);
20664 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
20665 MVT ShuffleVT = MVT::v4f32;
20666 if (Depth == 1 && Root->getOpcode() == Shuffle)
20667 return false; // Nothing to do!
20668 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20669 DCI.AddToWorklist(Op.getNode());
20670 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20671 DCI.AddToWorklist(Op.getNode());
20672 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20673 /*AddTo*/ true);
20674 return true;
20675 }
20676 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
20677 bool Lo = Mask.equals(0, 0, 1, 1);
20678 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20679 MVT ShuffleVT = MVT::v4f32;
20680 if (Depth == 1 && Root->getOpcode() == Shuffle)
20681 return false; // Nothing to do!
20682 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20683 DCI.AddToWorklist(Op.getNode());
20684 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20685 DCI.AddToWorklist(Op.getNode());
20686 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20687 /*AddTo*/ true);
20688 return true;
20689 }
20690 }
20692 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
20693 // variants as none of these have single-instruction variants that are
20694 // superior to the UNPCK formulation.
20695 if (!FloatDomain &&
20696 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
20697 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
20698 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
20699 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
20700 15))) {
20701 bool Lo = Mask[0] == 0;
20702 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20703 if (Depth == 1 && Root->getOpcode() == Shuffle)
20704 return false; // Nothing to do!
20705 MVT ShuffleVT;
20706 switch (Mask.size()) {
20707 case 8:
20708 ShuffleVT = MVT::v8i16;
20709 break;
20710 case 16:
20711 ShuffleVT = MVT::v16i8;
20712 break;
20713 default:
20714 llvm_unreachable("Impossible mask size!");
20715 };
20716 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20717 DCI.AddToWorklist(Op.getNode());
20718 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20719 DCI.AddToWorklist(Op.getNode());
20720 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20721 /*AddTo*/ true);
20722 return true;
20723 }
20725 // Don't try to re-form single instruction chains under any circumstances now
20726 // that we've done encoding canonicalization for them.
20727 if (Depth < 2)
20728 return false;
20730 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
20731 // can replace them with a single PSHUFB instruction profitably. Intel's
20732 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
20733 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
20734 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
20735 SmallVector<SDValue, 16> PSHUFBMask;
20736 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
20737 int Ratio = 16 / Mask.size();
20738 for (unsigned i = 0; i < 16; ++i) {
20739 if (Mask[i / Ratio] == SM_SentinelUndef) {
20740 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
20741 continue;
20742 }
20743 int M = Mask[i / Ratio] != SM_SentinelZero
20744 ? Ratio * Mask[i / Ratio] + i % Ratio
20745 : 255;
20746 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
20747 }
20748 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
20749 DCI.AddToWorklist(Op.getNode());
20750 SDValue PSHUFBMaskOp =
20751 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
20752 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
20753 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
20754 DCI.AddToWorklist(Op.getNode());
20755 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20756 /*AddTo*/ true);
20757 return true;
20758 }
20760 // Failed to find any combines.
20761 return false;
20762 }
20764 /// \brief Fully generic combining of x86 shuffle instructions.
20765 ///
20766 /// This should be the last combine run over the x86 shuffle instructions. Once
20767 /// they have been fully optimized, this will recursively consider all chains
20768 /// of single-use shuffle instructions, build a generic model of the cumulative
20769 /// shuffle operation, and check for simpler instructions which implement this
20770 /// operation. We use this primarily for two purposes:
20771 ///
20772 /// 1) Collapse generic shuffles to specialized single instructions when
20773 /// equivalent. In most cases, this is just an encoding size win, but
20774 /// sometimes we will collapse multiple generic shuffles into a single
20775 /// special-purpose shuffle.
20776 /// 2) Look for sequences of shuffle instructions with 3 or more total
20777 /// instructions, and replace them with the slightly more expensive SSSE3
20778 /// PSHUFB instruction if available. We do this as the last combining step
20779 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
20780 /// a suitable short sequence of other instructions. The PHUFB will either
20781 /// use a register or have to read from memory and so is slightly (but only
20782 /// slightly) more expensive than the other shuffle instructions.
20783 ///
20784 /// Because this is inherently a quadratic operation (for each shuffle in
20785 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
20786 /// This should never be an issue in practice as the shuffle lowering doesn't
20787 /// produce sequences of more than 8 instructions.
20788 ///
20789 /// FIXME: We will currently miss some cases where the redundant shuffling
20790 /// would simplify under the threshold for PSHUFB formation because of
20791 /// combine-ordering. To fix this, we should do the redundant instruction
20792 /// combining in this recursive walk.
20793 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
20794 ArrayRef<int> RootMask,
20795 int Depth, bool HasPSHUFB,
20796 SelectionDAG &DAG,
20797 TargetLowering::DAGCombinerInfo &DCI,
20798 const X86Subtarget *Subtarget) {
20799 // Bound the depth of our recursive combine because this is ultimately
20800 // quadratic in nature.
20801 if (Depth > 8)
20802 return false;
20804 // Directly rip through bitcasts to find the underlying operand.
20805 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
20806 Op = Op.getOperand(0);
20808 MVT VT = Op.getSimpleValueType();
20809 if (!VT.isVector())
20810 return false; // Bail if we hit a non-vector.
20811 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
20812 // version should be added.
20813 if (VT.getSizeInBits() != 128)
20814 return false;
20816 assert(Root.getSimpleValueType().isVector() &&
20817 "Shuffles operate on vector types!");
20818 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
20819 "Can only combine shuffles of the same vector register size.");
20821 if (!isTargetShuffle(Op.getOpcode()))
20822 return false;
20823 SmallVector<int, 16> OpMask;
20824 bool IsUnary;
20825 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
20826 // We only can combine unary shuffles which we can decode the mask for.
20827 if (!HaveMask || !IsUnary)
20828 return false;
20830 assert(VT.getVectorNumElements() == OpMask.size() &&
20831 "Different mask size from vector size!");
20832 assert(((RootMask.size() > OpMask.size() &&
20833 RootMask.size() % OpMask.size() == 0) ||
20834 (OpMask.size() > RootMask.size() &&
20835 OpMask.size() % RootMask.size() == 0) ||
20836 OpMask.size() == RootMask.size()) &&
20837 "The smaller number of elements must divide the larger.");
20838 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20839 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20840 assert(((RootRatio == 1 && OpRatio == 1) ||
20841 (RootRatio == 1) != (OpRatio == 1)) &&
20842 "Must not have a ratio for both incoming and op masks!");
20844 SmallVector<int, 16> Mask;
20845 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
20847 // Merge this shuffle operation's mask into our accumulated mask. Note that
20848 // this shuffle's mask will be the first applied to the input, followed by the
20849 // root mask to get us all the way to the root value arrangement. The reason
20850 // for this order is that we are recursing up the operation chain.
20851 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
20852 int RootIdx = i / RootRatio;
20853 if (RootMask[RootIdx] < 0) {
20854 // This is a zero or undef lane, we're done.
20855 Mask.push_back(RootMask[RootIdx]);
20856 continue;
20857 }
20859 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
20860 int OpIdx = RootMaskedIdx / OpRatio;
20861 if (OpMask[OpIdx] < 0) {
20862 // The incoming lanes are zero or undef, it doesn't matter which ones we
20863 // are using.
20864 Mask.push_back(OpMask[OpIdx]);
20865 continue;
20866 }
20868 // Ok, we have non-zero lanes, map them through.
20869 Mask.push_back(OpMask[OpIdx] * OpRatio +
20870 RootMaskedIdx % OpRatio);
20871 }
20873 // See if we can recurse into the operand to combine more things.
20874 switch (Op.getOpcode()) {
20875 case X86ISD::PSHUFB:
20876 HasPSHUFB = true;
20877 case X86ISD::PSHUFD:
20878 case X86ISD::PSHUFHW:
20879 case X86ISD::PSHUFLW:
20880 if (Op.getOperand(0).hasOneUse() &&
20881 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20882 HasPSHUFB, DAG, DCI, Subtarget))
20883 return true;
20884 break;
20886 case X86ISD::UNPCKL:
20887 case X86ISD::UNPCKH:
20888 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
20889 // We can't check for single use, we have to check that this shuffle is the only user.
20890 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
20891 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20892 HasPSHUFB, DAG, DCI, Subtarget))
20893 return true;
20894 break;
20895 }
20897 // Minor canonicalization of the accumulated shuffle mask to make it easier
20898 // to match below. All this does is detect masks with squential pairs of
20899 // elements, and shrink them to the half-width mask. It does this in a loop
20900 // so it will reduce the size of the mask to the minimal width mask which
20901 // performs an equivalent shuffle.
20902 SmallVector<int, 16> WidenedMask;
20903 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
20904 Mask = std::move(WidenedMask);
20905 WidenedMask.clear();
20906 }
20908 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
20909 Subtarget);
20910 }
20912 /// \brief Get the PSHUF-style mask from PSHUF node.
20913 ///
20914 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
20915 /// PSHUF-style masks that can be reused with such instructions.
20916 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
20917 SmallVector<int, 4> Mask;
20918 bool IsUnary;
20919 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
20920 (void)HaveMask;
20921 assert(HaveMask);
20923 switch (N.getOpcode()) {
20924 case X86ISD::PSHUFD:
20925 return Mask;
20926 case X86ISD::PSHUFLW:
20927 Mask.resize(4);
20928 return Mask;
20929 case X86ISD::PSHUFHW:
20930 Mask.erase(Mask.begin(), Mask.begin() + 4);
20931 for (int &M : Mask)
20932 M -= 4;
20933 return Mask;
20934 default:
20935 llvm_unreachable("No valid shuffle instruction found!");
20936 }
20937 }
20939 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
20940 ///
20941 /// We walk up the chain and look for a combinable shuffle, skipping over
20942 /// shuffles that we could hoist this shuffle's transformation past without
20943 /// altering anything.
20944 static SDValue
20945 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
20946 SelectionDAG &DAG,
20947 TargetLowering::DAGCombinerInfo &DCI) {
20948 assert(N.getOpcode() == X86ISD::PSHUFD &&
20949 "Called with something other than an x86 128-bit half shuffle!");
20950 SDLoc DL(N);
20952 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
20953 // of the shuffles in the chain so that we can form a fresh chain to replace
20954 // this one.
20955 SmallVector<SDValue, 8> Chain;
20956 SDValue V = N.getOperand(0);
20957 for (; V.hasOneUse(); V = V.getOperand(0)) {
20958 switch (V.getOpcode()) {
20959 default:
20960 return SDValue(); // Nothing combined!
20962 case ISD::BITCAST:
20963 // Skip bitcasts as we always know the type for the target specific
20964 // instructions.
20965 continue;
20967 case X86ISD::PSHUFD:
20968 // Found another dword shuffle.
20969 break;
20971 case X86ISD::PSHUFLW:
20972 // Check that the low words (being shuffled) are the identity in the
20973 // dword shuffle, and the high words are self-contained.
20974 if (Mask[0] != 0 || Mask[1] != 1 ||
20975 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
20976 return SDValue();
20978 Chain.push_back(V);
20979 continue;
20981 case X86ISD::PSHUFHW:
20982 // Check that the high words (being shuffled) are the identity in the
20983 // dword shuffle, and the low words are self-contained.
20984 if (Mask[2] != 2 || Mask[3] != 3 ||
20985 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
20986 return SDValue();
20988 Chain.push_back(V);
20989 continue;
20991 case X86ISD::UNPCKL:
20992 case X86ISD::UNPCKH:
20993 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
20994 // shuffle into a preceding word shuffle.
20995 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
20996 return SDValue();
20998 // Search for a half-shuffle which we can combine with.
20999 unsigned CombineOp =
21000 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
21001 if (V.getOperand(0) != V.getOperand(1) ||
21002 !V->isOnlyUserOf(V.getOperand(0).getNode()))
21003 return SDValue();
21004 Chain.push_back(V);
21005 V = V.getOperand(0);
21006 do {
21007 switch (V.getOpcode()) {
21008 default:
21009 return SDValue(); // Nothing to combine.
21011 case X86ISD::PSHUFLW:
21012 case X86ISD::PSHUFHW:
21013 if (V.getOpcode() == CombineOp)
21014 break;
21016 Chain.push_back(V);
21018 // Fallthrough!
21019 case ISD::BITCAST:
21020 V = V.getOperand(0);
21021 continue;
21022 }
21023 break;
21024 } while (V.hasOneUse());
21025 break;
21026 }
21027 // Break out of the loop if we break out of the switch.
21028 break;
21029 }
21031 if (!V.hasOneUse())
21032 // We fell out of the loop without finding a viable combining instruction.
21033 return SDValue();
21035 // Merge this node's mask and our incoming mask.
21036 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21037 for (int &M : Mask)
21038 M = VMask[M];
21039 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
21040 getV4X86ShuffleImm8ForMask(Mask, DAG));
21042 // Rebuild the chain around this new shuffle.
21043 while (!Chain.empty()) {
21044 SDValue W = Chain.pop_back_val();
21046 if (V.getValueType() != W.getOperand(0).getValueType())
21047 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
21049 switch (W.getOpcode()) {
21050 default:
21051 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
21053 case X86ISD::UNPCKL:
21054 case X86ISD::UNPCKH:
21055 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
21056 break;
21058 case X86ISD::PSHUFD:
21059 case X86ISD::PSHUFLW:
21060 case X86ISD::PSHUFHW:
21061 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
21062 break;
21063 }
21064 }
21065 if (V.getValueType() != N.getValueType())
21066 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
21068 // Return the new chain to replace N.
21069 return V;
21070 }
21072 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
21073 ///
21074 /// We walk up the chain, skipping shuffles of the other half and looking
21075 /// through shuffles which switch halves trying to find a shuffle of the same
21076 /// pair of dwords.
21077 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
21078 SelectionDAG &DAG,
21079 TargetLowering::DAGCombinerInfo &DCI) {
21080 assert(
21081 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
21082 "Called with something other than an x86 128-bit half shuffle!");
21083 SDLoc DL(N);
21084 unsigned CombineOpcode = N.getOpcode();
21086 // Walk up a single-use chain looking for a combinable shuffle.
21087 SDValue V = N.getOperand(0);
21088 for (; V.hasOneUse(); V = V.getOperand(0)) {
21089 switch (V.getOpcode()) {
21090 default:
21091 return false; // Nothing combined!
21093 case ISD::BITCAST:
21094 // Skip bitcasts as we always know the type for the target specific
21095 // instructions.
21096 continue;
21098 case X86ISD::PSHUFLW:
21099 case X86ISD::PSHUFHW:
21100 if (V.getOpcode() == CombineOpcode)
21101 break;
21103 // Other-half shuffles are no-ops.
21104 continue;
21105 }
21106 // Break out of the loop if we break out of the switch.
21107 break;
21108 }
21110 if (!V.hasOneUse())
21111 // We fell out of the loop without finding a viable combining instruction.
21112 return false;
21114 // Combine away the bottom node as its shuffle will be accumulated into
21115 // a preceding shuffle.
21116 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21118 // Record the old value.
21119 SDValue Old = V;
21121 // Merge this node's mask and our incoming mask (adjusted to account for all
21122 // the pshufd instructions encountered).
21123 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21124 for (int &M : Mask)
21125 M = VMask[M];
21126 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
21127 getV4X86ShuffleImm8ForMask(Mask, DAG));
21129 // Check that the shuffles didn't cancel each other out. If not, we need to
21130 // combine to the new one.
21131 if (Old != V)
21132 // Replace the combinable shuffle with the combined one, updating all users
21133 // so that we re-evaluate the chain here.
21134 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
21136 return true;
21137 }
21139 /// \brief Try to combine x86 target specific shuffles.
21140 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
21141 TargetLowering::DAGCombinerInfo &DCI,
21142 const X86Subtarget *Subtarget) {
21143 SDLoc DL(N);
21144 MVT VT = N.getSimpleValueType();
21145 SmallVector<int, 4> Mask;
21147 switch (N.getOpcode()) {
21148 case X86ISD::PSHUFD:
21149 case X86ISD::PSHUFLW:
21150 case X86ISD::PSHUFHW:
21151 Mask = getPSHUFShuffleMask(N);
21152 assert(Mask.size() == 4);
21153 break;
21154 default:
21155 return SDValue();
21156 }
21158 // Nuke no-op shuffles that show up after combining.
21159 if (isNoopShuffleMask(Mask))
21160 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21162 // Look for simplifications involving one or two shuffle instructions.
21163 SDValue V = N.getOperand(0);
21164 switch (N.getOpcode()) {
21165 default:
21166 break;
21167 case X86ISD::PSHUFLW:
21168 case X86ISD::PSHUFHW:
21169 assert(VT == MVT::v8i16);
21170 (void)VT;
21172 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
21173 return SDValue(); // We combined away this shuffle, so we're done.
21175 // See if this reduces to a PSHUFD which is no more expensive and can
21176 // combine with more operations. Note that it has to at least flip the
21177 // dwords as otherwise it would have been removed as a no-op.
21178 if (Mask[0] == 2 && Mask[1] == 3 && Mask[2] == 0 && Mask[3] == 1) {
21179 int DMask[] = {0, 1, 2, 3};
21180 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
21181 DMask[DOffset + 0] = DOffset + 1;
21182 DMask[DOffset + 1] = DOffset + 0;
21183 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
21184 DCI.AddToWorklist(V.getNode());
21185 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
21186 getV4X86ShuffleImm8ForMask(DMask, DAG));
21187 DCI.AddToWorklist(V.getNode());
21188 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
21189 }
21191 // Look for shuffle patterns which can be implemented as a single unpack.
21192 // FIXME: This doesn't handle the location of the PSHUFD generically, and
21193 // only works when we have a PSHUFD followed by two half-shuffles.
21194 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
21195 (V.getOpcode() == X86ISD::PSHUFLW ||
21196 V.getOpcode() == X86ISD::PSHUFHW) &&
21197 V.getOpcode() != N.getOpcode() &&
21198 V.hasOneUse()) {
21199 SDValue D = V.getOperand(0);
21200 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
21201 D = D.getOperand(0);
21202 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
21203 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21204 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
21205 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21206 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21207 int WordMask[8];
21208 for (int i = 0; i < 4; ++i) {
21209 WordMask[i + NOffset] = Mask[i] + NOffset;
21210 WordMask[i + VOffset] = VMask[i] + VOffset;
21211 }
21212 // Map the word mask through the DWord mask.
21213 int MappedMask[8];
21214 for (int i = 0; i < 8; ++i)
21215 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
21216 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
21217 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
21218 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
21219 std::begin(UnpackLoMask)) ||
21220 std::equal(std::begin(MappedMask), std::end(MappedMask),
21221 std::begin(UnpackHiMask))) {
21222 // We can replace all three shuffles with an unpack.
21223 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
21224 DCI.AddToWorklist(V.getNode());
21225 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
21226 : X86ISD::UNPCKH,
21227 DL, MVT::v8i16, V, V);
21228 }
21229 }
21230 }
21232 break;
21234 case X86ISD::PSHUFD:
21235 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
21236 return NewN;
21238 break;
21239 }
21241 return SDValue();
21242 }
21244 /// \brief Try to combine a shuffle into a target-specific add-sub node.
21245 ///
21246 /// We combine this directly on the abstract vector shuffle nodes so it is
21247 /// easier to generically match. We also insert dummy vector shuffle nodes for
21248 /// the operands which explicitly discard the lanes which are unused by this
21249 /// operation to try to flow through the rest of the combiner the fact that
21250 /// they're unused.
21251 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
21252 SDLoc DL(N);
21253 EVT VT = N->getValueType(0);
21255 // We only handle target-independent shuffles.
21256 // FIXME: It would be easy and harmless to use the target shuffle mask
21257 // extraction tool to support more.
21258 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
21259 return SDValue();
21261 auto *SVN = cast<ShuffleVectorSDNode>(N);
21262 ArrayRef<int> Mask = SVN->getMask();
21263 SDValue V1 = N->getOperand(0);
21264 SDValue V2 = N->getOperand(1);
21266 // We require the first shuffle operand to be the SUB node, and the second to
21267 // be the ADD node.
21268 // FIXME: We should support the commuted patterns.
21269 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
21270 return SDValue();
21272 // If there are other uses of these operations we can't fold them.
21273 if (!V1->hasOneUse() || !V2->hasOneUse())
21274 return SDValue();
21276 // Ensure that both operations have the same operands. Note that we can
21277 // commute the FADD operands.
21278 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
21279 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
21280 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
21281 return SDValue();
21283 // We're looking for blends between FADD and FSUB nodes. We insist on these
21284 // nodes being lined up in a specific expected pattern.
21285 if (!(isShuffleEquivalent(Mask, 0, 3) ||
21286 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
21287 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
21288 return SDValue();
21290 // Only specific types are legal at this point, assert so we notice if and
21291 // when these change.
21292 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
21293 VT == MVT::v4f64) &&
21294 "Unknown vector type encountered!");
21296 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
21297 }
21299 /// PerformShuffleCombine - Performs several different shuffle combines.
21300 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
21301 TargetLowering::DAGCombinerInfo &DCI,
21302 const X86Subtarget *Subtarget) {
21303 SDLoc dl(N);
21304 SDValue N0 = N->getOperand(0);
21305 SDValue N1 = N->getOperand(1);
21306 EVT VT = N->getValueType(0);
21308 // Don't create instructions with illegal types after legalize types has run.
21309 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21310 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
21311 return SDValue();
21313 // If we have legalized the vector types, look for blends of FADD and FSUB
21314 // nodes that we can fuse into an ADDSUB node.
21315 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
21316 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
21317 return AddSub;
21319 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
21320 if (Subtarget->hasFp256() && VT.is256BitVector() &&
21321 N->getOpcode() == ISD::VECTOR_SHUFFLE)
21322 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
21324 // During Type Legalization, when promoting illegal vector types,
21325 // the backend might introduce new shuffle dag nodes and bitcasts.
21326 //
21327 // This code performs the following transformation:
21328 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
21329 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
21330 //
21331 // We do this only if both the bitcast and the BINOP dag nodes have
21332 // one use. Also, perform this transformation only if the new binary
21333 // operation is legal. This is to avoid introducing dag nodes that
21334 // potentially need to be further expanded (or custom lowered) into a
21335 // less optimal sequence of dag nodes.
21336 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
21337 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
21338 N0.getOpcode() == ISD::BITCAST) {
21339 SDValue BC0 = N0.getOperand(0);
21340 EVT SVT = BC0.getValueType();
21341 unsigned Opcode = BC0.getOpcode();
21342 unsigned NumElts = VT.getVectorNumElements();
21344 if (BC0.hasOneUse() && SVT.isVector() &&
21345 SVT.getVectorNumElements() * 2 == NumElts &&
21346 TLI.isOperationLegal(Opcode, VT)) {
21347 bool CanFold = false;
21348 switch (Opcode) {
21349 default : break;
21350 case ISD::ADD :
21351 case ISD::FADD :
21352 case ISD::SUB :
21353 case ISD::FSUB :
21354 case ISD::MUL :
21355 case ISD::FMUL :
21356 CanFold = true;
21357 }
21359 unsigned SVTNumElts = SVT.getVectorNumElements();
21360 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
21361 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
21362 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
21363 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
21364 CanFold = SVOp->getMaskElt(i) < 0;
21366 if (CanFold) {
21367 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
21368 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
21369 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
21370 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
21371 }
21372 }
21373 }
21375 // Only handle 128 wide vector from here on.
21376 if (!VT.is128BitVector())
21377 return SDValue();
21379 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
21380 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
21381 // consecutive, non-overlapping, and in the right order.
21382 SmallVector<SDValue, 16> Elts;
21383 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
21384 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
21386 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
21387 if (LD.getNode())
21388 return LD;
21390 if (isTargetShuffle(N->getOpcode())) {
21391 SDValue Shuffle =
21392 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
21393 if (Shuffle.getNode())
21394 return Shuffle;
21396 // Try recursively combining arbitrary sequences of x86 shuffle
21397 // instructions into higher-order shuffles. We do this after combining
21398 // specific PSHUF instruction sequences into their minimal form so that we
21399 // can evaluate how many specialized shuffle instructions are involved in
21400 // a particular chain.
21401 SmallVector<int, 1> NonceMask; // Just a placeholder.
21402 NonceMask.push_back(0);
21403 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
21404 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
21405 DCI, Subtarget))
21406 return SDValue(); // This routine will use CombineTo to replace N.
21407 }
21409 return SDValue();
21410 }
21412 /// PerformTruncateCombine - Converts truncate operation to
21413 /// a sequence of vector shuffle operations.
21414 /// It is possible when we truncate 256-bit vector to 128-bit vector
21415 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
21416 TargetLowering::DAGCombinerInfo &DCI,
21417 const X86Subtarget *Subtarget) {
21418 return SDValue();
21419 }
21421 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
21422 /// specific shuffle of a load can be folded into a single element load.
21423 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
21424 /// shuffles have been customed lowered so we need to handle those here.
21425 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
21426 TargetLowering::DAGCombinerInfo &DCI) {
21427 if (DCI.isBeforeLegalizeOps())
21428 return SDValue();
21430 SDValue InVec = N->getOperand(0);
21431 SDValue EltNo = N->getOperand(1);
21433 if (!isa<ConstantSDNode>(EltNo))
21434 return SDValue();
21436 EVT VT = InVec.getValueType();
21438 if (InVec.getOpcode() == ISD::BITCAST) {
21439 // Don't duplicate a load with other uses.
21440 if (!InVec.hasOneUse())
21441 return SDValue();
21442 EVT BCVT = InVec.getOperand(0).getValueType();
21443 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
21444 return SDValue();
21445 InVec = InVec.getOperand(0);
21446 }
21448 if (!isTargetShuffle(InVec.getOpcode()))
21449 return SDValue();
21451 // Don't duplicate a load with other uses.
21452 if (!InVec.hasOneUse())
21453 return SDValue();
21455 SmallVector<int, 16> ShuffleMask;
21456 bool UnaryShuffle;
21457 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
21458 UnaryShuffle))
21459 return SDValue();
21461 // Select the input vector, guarding against out of range extract vector.
21462 unsigned NumElems = VT.getVectorNumElements();
21463 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
21464 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
21465 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
21466 : InVec.getOperand(1);
21468 // If inputs to shuffle are the same for both ops, then allow 2 uses
21469 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
21471 if (LdNode.getOpcode() == ISD::BITCAST) {
21472 // Don't duplicate a load with other uses.
21473 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
21474 return SDValue();
21476 AllowedUses = 1; // only allow 1 load use if we have a bitcast
21477 LdNode = LdNode.getOperand(0);
21478 }
21480 if (!ISD::isNormalLoad(LdNode.getNode()))
21481 return SDValue();
21483 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
21485 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
21486 return SDValue();
21488 EVT EltVT = N->getValueType(0);
21489 // If there's a bitcast before the shuffle, check if the load type and
21490 // alignment is valid.
21491 unsigned Align = LN0->getAlignment();
21492 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21493 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
21494 EltVT.getTypeForEVT(*DAG.getContext()));
21496 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
21497 return SDValue();
21499 // All checks match so transform back to vector_shuffle so that DAG combiner
21500 // can finish the job
21501 SDLoc dl(N);
21503 // Create shuffle node taking into account the case that its a unary shuffle
21504 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
21505 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
21506 InVec.getOperand(0), Shuffle,
21507 &ShuffleMask[0]);
21508 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
21509 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
21510 EltNo);
21511 }
21513 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
21514 /// generation and convert it from being a bunch of shuffles and extracts
21515 /// to a simple store and scalar loads to extract the elements.
21516 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
21517 TargetLowering::DAGCombinerInfo &DCI) {
21518 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
21519 if (NewOp.getNode())
21520 return NewOp;
21522 SDValue InputVector = N->getOperand(0);
21524 // Detect whether we are trying to convert from mmx to i32 and the bitcast
21525 // from mmx to v2i32 has a single usage.
21526 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
21527 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
21528 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
21529 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
21530 N->getValueType(0),
21531 InputVector.getNode()->getOperand(0));
21533 // Only operate on vectors of 4 elements, where the alternative shuffling
21534 // gets to be more expensive.
21535 if (InputVector.getValueType() != MVT::v4i32)
21536 return SDValue();
21538 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
21539 // single use which is a sign-extend or zero-extend, and all elements are
21540 // used.
21541 SmallVector<SDNode *, 4> Uses;
21542 unsigned ExtractedElements = 0;
21543 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
21544 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
21545 if (UI.getUse().getResNo() != InputVector.getResNo())
21546 return SDValue();
21548 SDNode *Extract = *UI;
21549 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
21550 return SDValue();
21552 if (Extract->getValueType(0) != MVT::i32)
21553 return SDValue();
21554 if (!Extract->hasOneUse())
21555 return SDValue();
21556 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
21557 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
21558 return SDValue();
21559 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
21560 return SDValue();
21562 // Record which element was extracted.
21563 ExtractedElements |=
21564 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
21566 Uses.push_back(Extract);
21567 }
21569 // If not all the elements were used, this may not be worthwhile.
21570 if (ExtractedElements != 15)
21571 return SDValue();
21573 // Ok, we've now decided to do the transformation.
21574 SDLoc dl(InputVector);
21576 // Store the value to a temporary stack slot.
21577 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
21578 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
21579 MachinePointerInfo(), false, false, 0);
21581 // Replace each use (extract) with a load of the appropriate element.
21582 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
21583 UE = Uses.end(); UI != UE; ++UI) {
21584 SDNode *Extract = *UI;
21586 // cOMpute the element's address.
21587 SDValue Idx = Extract->getOperand(1);
21588 unsigned EltSize =
21589 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
21590 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
21591 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21592 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
21594 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
21595 StackPtr, OffsetVal);
21597 // Load the scalar.
21598 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
21599 ScalarAddr, MachinePointerInfo(),
21600 false, false, false, 0);
21602 // Replace the exact with the load.
21603 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
21604 }
21606 // The replacement was made in place; don't return anything.
21607 return SDValue();
21608 }
21610 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
21611 static std::pair<unsigned, bool>
21612 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
21613 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
21614 if (!VT.isVector())
21615 return std::make_pair(0, false);
21617 bool NeedSplit = false;
21618 switch (VT.getSimpleVT().SimpleTy) {
21619 default: return std::make_pair(0, false);
21620 case MVT::v32i8:
21621 case MVT::v16i16:
21622 case MVT::v8i32:
21623 if (!Subtarget->hasAVX2())
21624 NeedSplit = true;
21625 if (!Subtarget->hasAVX())
21626 return std::make_pair(0, false);
21627 break;
21628 case MVT::v16i8:
21629 case MVT::v8i16:
21630 case MVT::v4i32:
21631 if (!Subtarget->hasSSE2())
21632 return std::make_pair(0, false);
21633 }
21635 // SSE2 has only a small subset of the operations.
21636 bool hasUnsigned = Subtarget->hasSSE41() ||
21637 (Subtarget->hasSSE2() && VT == MVT::v16i8);
21638 bool hasSigned = Subtarget->hasSSE41() ||
21639 (Subtarget->hasSSE2() && VT == MVT::v8i16);
21641 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21643 unsigned Opc = 0;
21644 // Check for x CC y ? x : y.
21645 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21646 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21647 switch (CC) {
21648 default: break;
21649 case ISD::SETULT:
21650 case ISD::SETULE:
21651 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21652 case ISD::SETUGT:
21653 case ISD::SETUGE:
21654 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21655 case ISD::SETLT:
21656 case ISD::SETLE:
21657 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21658 case ISD::SETGT:
21659 case ISD::SETGE:
21660 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21661 }
21662 // Check for x CC y ? y : x -- a min/max with reversed arms.
21663 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21664 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21665 switch (CC) {
21666 default: break;
21667 case ISD::SETULT:
21668 case ISD::SETULE:
21669 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21670 case ISD::SETUGT:
21671 case ISD::SETUGE:
21672 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21673 case ISD::SETLT:
21674 case ISD::SETLE:
21675 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21676 case ISD::SETGT:
21677 case ISD::SETGE:
21678 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21679 }
21680 }
21682 return std::make_pair(Opc, NeedSplit);
21683 }
21685 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
21686 /// nodes.
21687 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
21688 TargetLowering::DAGCombinerInfo &DCI,
21689 const X86Subtarget *Subtarget) {
21690 SDLoc DL(N);
21691 SDValue Cond = N->getOperand(0);
21692 // Get the LHS/RHS of the select.
21693 SDValue LHS = N->getOperand(1);
21694 SDValue RHS = N->getOperand(2);
21695 EVT VT = LHS.getValueType();
21696 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21698 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
21699 // instructions match the semantics of the common C idiom x<y?x:y but not
21700 // x<=y?x:y, because of how they handle negative zero (which can be
21701 // ignored in unsafe-math mode).
21702 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
21703 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
21704 (Subtarget->hasSSE2() ||
21705 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
21706 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21708 unsigned Opcode = 0;
21709 // Check for x CC y ? x : y.
21710 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21711 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21712 switch (CC) {
21713 default: break;
21714 case ISD::SETULT:
21715 // Converting this to a min would handle NaNs incorrectly, and swapping
21716 // the operands would cause it to handle comparisons between positive
21717 // and negative zero incorrectly.
21718 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21719 if (!DAG.getTarget().Options.UnsafeFPMath &&
21720 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21721 break;
21722 std::swap(LHS, RHS);
21723 }
21724 Opcode = X86ISD::FMIN;
21725 break;
21726 case ISD::SETOLE:
21727 // Converting this to a min would handle comparisons between positive
21728 // and negative zero incorrectly.
21729 if (!DAG.getTarget().Options.UnsafeFPMath &&
21730 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21731 break;
21732 Opcode = X86ISD::FMIN;
21733 break;
21734 case ISD::SETULE:
21735 // Converting this to a min would handle both negative zeros and NaNs
21736 // incorrectly, but we can swap the operands to fix both.
21737 std::swap(LHS, RHS);
21738 case ISD::SETOLT:
21739 case ISD::SETLT:
21740 case ISD::SETLE:
21741 Opcode = X86ISD::FMIN;
21742 break;
21744 case ISD::SETOGE:
21745 // Converting this to a max would handle comparisons between positive
21746 // and negative zero incorrectly.
21747 if (!DAG.getTarget().Options.UnsafeFPMath &&
21748 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21749 break;
21750 Opcode = X86ISD::FMAX;
21751 break;
21752 case ISD::SETUGT:
21753 // Converting this to a max would handle NaNs incorrectly, and swapping
21754 // the operands would cause it to handle comparisons between positive
21755 // and negative zero incorrectly.
21756 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21757 if (!DAG.getTarget().Options.UnsafeFPMath &&
21758 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21759 break;
21760 std::swap(LHS, RHS);
21761 }
21762 Opcode = X86ISD::FMAX;
21763 break;
21764 case ISD::SETUGE:
21765 // Converting this to a max would handle both negative zeros and NaNs
21766 // incorrectly, but we can swap the operands to fix both.
21767 std::swap(LHS, RHS);
21768 case ISD::SETOGT:
21769 case ISD::SETGT:
21770 case ISD::SETGE:
21771 Opcode = X86ISD::FMAX;
21772 break;
21773 }
21774 // Check for x CC y ? y : x -- a min/max with reversed arms.
21775 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21776 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21777 switch (CC) {
21778 default: break;
21779 case ISD::SETOGE:
21780 // Converting this to a min would handle comparisons between positive
21781 // and negative zero incorrectly, and swapping the operands would
21782 // cause it to handle NaNs incorrectly.
21783 if (!DAG.getTarget().Options.UnsafeFPMath &&
21784 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
21785 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21786 break;
21787 std::swap(LHS, RHS);
21788 }
21789 Opcode = X86ISD::FMIN;
21790 break;
21791 case ISD::SETUGT:
21792 // Converting this to a min would handle NaNs incorrectly.
21793 if (!DAG.getTarget().Options.UnsafeFPMath &&
21794 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
21795 break;
21796 Opcode = X86ISD::FMIN;
21797 break;
21798 case ISD::SETUGE:
21799 // Converting this to a min would handle both negative zeros and NaNs
21800 // incorrectly, but we can swap the operands to fix both.
21801 std::swap(LHS, RHS);
21802 case ISD::SETOGT:
21803 case ISD::SETGT:
21804 case ISD::SETGE:
21805 Opcode = X86ISD::FMIN;
21806 break;
21808 case ISD::SETULT:
21809 // Converting this to a max would handle NaNs incorrectly.
21810 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21811 break;
21812 Opcode = X86ISD::FMAX;
21813 break;
21814 case ISD::SETOLE:
21815 // Converting this to a max would handle comparisons between positive
21816 // and negative zero incorrectly, and swapping the operands would
21817 // cause it to handle NaNs incorrectly.
21818 if (!DAG.getTarget().Options.UnsafeFPMath &&
21819 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
21820 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21821 break;
21822 std::swap(LHS, RHS);
21823 }
21824 Opcode = X86ISD::FMAX;
21825 break;
21826 case ISD::SETULE:
21827 // Converting this to a max would handle both negative zeros and NaNs
21828 // incorrectly, but we can swap the operands to fix both.
21829 std::swap(LHS, RHS);
21830 case ISD::SETOLT:
21831 case ISD::SETLT:
21832 case ISD::SETLE:
21833 Opcode = X86ISD::FMAX;
21834 break;
21835 }
21836 }
21838 if (Opcode)
21839 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
21840 }
21842 EVT CondVT = Cond.getValueType();
21843 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
21844 CondVT.getVectorElementType() == MVT::i1) {
21845 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
21846 // lowering on KNL. In this case we convert it to
21847 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
21848 // The same situation for all 128 and 256-bit vectors of i8 and i16.
21849 // Since SKX these selects have a proper lowering.
21850 EVT OpVT = LHS.getValueType();
21851 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
21852 (OpVT.getVectorElementType() == MVT::i8 ||
21853 OpVT.getVectorElementType() == MVT::i16) &&
21854 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
21855 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
21856 DCI.AddToWorklist(Cond.getNode());
21857 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
21858 }
21859 }
21860 // If this is a select between two integer constants, try to do some
21861 // optimizations.
21862 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
21863 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
21864 // Don't do this for crazy integer types.
21865 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
21866 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
21867 // so that TrueC (the true value) is larger than FalseC.
21868 bool NeedsCondInvert = false;
21870 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
21871 // Efficiently invertible.
21872 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
21873 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
21874 isa<ConstantSDNode>(Cond.getOperand(1))))) {
21875 NeedsCondInvert = true;
21876 std::swap(TrueC, FalseC);
21877 }
21879 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
21880 if (FalseC->getAPIntValue() == 0 &&
21881 TrueC->getAPIntValue().isPowerOf2()) {
21882 if (NeedsCondInvert) // Invert the condition if needed.
21883 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21884 DAG.getConstant(1, Cond.getValueType()));
21886 // Zero extend the condition if needed.
21887 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
21889 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21890 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
21891 DAG.getConstant(ShAmt, MVT::i8));
21892 }
21894 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
21895 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21896 if (NeedsCondInvert) // Invert the condition if needed.
21897 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21898 DAG.getConstant(1, Cond.getValueType()));
21900 // Zero extend the condition if needed.
21901 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21902 FalseC->getValueType(0), Cond);
21903 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21904 SDValue(FalseC, 0));
21905 }
21907 // Optimize cases that will turn into an LEA instruction. This requires
21908 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21909 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21910 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21911 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21913 bool isFastMultiplier = false;
21914 if (Diff < 10) {
21915 switch ((unsigned char)Diff) {
21916 default: break;
21917 case 1: // result = add base, cond
21918 case 2: // result = lea base( , cond*2)
21919 case 3: // result = lea base(cond, cond*2)
21920 case 4: // result = lea base( , cond*4)
21921 case 5: // result = lea base(cond, cond*4)
21922 case 8: // result = lea base( , cond*8)
21923 case 9: // result = lea base(cond, cond*8)
21924 isFastMultiplier = true;
21925 break;
21926 }
21927 }
21929 if (isFastMultiplier) {
21930 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21931 if (NeedsCondInvert) // Invert the condition if needed.
21932 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21933 DAG.getConstant(1, Cond.getValueType()));
21935 // Zero extend the condition if needed.
21936 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21937 Cond);
21938 // Scale the condition by the difference.
21939 if (Diff != 1)
21940 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21941 DAG.getConstant(Diff, Cond.getValueType()));
21943 // Add the base if non-zero.
21944 if (FalseC->getAPIntValue() != 0)
21945 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21946 SDValue(FalseC, 0));
21947 return Cond;
21948 }
21949 }
21950 }
21951 }
21953 // Canonicalize max and min:
21954 // (x > y) ? x : y -> (x >= y) ? x : y
21955 // (x < y) ? x : y -> (x <= y) ? x : y
21956 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
21957 // the need for an extra compare
21958 // against zero. e.g.
21959 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
21960 // subl %esi, %edi
21961 // testl %edi, %edi
21962 // movl $0, %eax
21963 // cmovgl %edi, %eax
21964 // =>
21965 // xorl %eax, %eax
21966 // subl %esi, $edi
21967 // cmovsl %eax, %edi
21968 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
21969 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21970 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21971 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21972 switch (CC) {
21973 default: break;
21974 case ISD::SETLT:
21975 case ISD::SETGT: {
21976 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
21977 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
21978 Cond.getOperand(0), Cond.getOperand(1), NewCC);
21979 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
21980 }
21981 }
21982 }
21984 // Early exit check
21985 if (!TLI.isTypeLegal(VT))
21986 return SDValue();
21988 // Match VSELECTs into subs with unsigned saturation.
21989 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21990 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
21991 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
21992 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
21993 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21995 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
21996 // left side invert the predicate to simplify logic below.
21997 SDValue Other;
21998 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
21999 Other = RHS;
22000 CC = ISD::getSetCCInverse(CC, true);
22001 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
22002 Other = LHS;
22003 }
22005 if (Other.getNode() && Other->getNumOperands() == 2 &&
22006 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
22007 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
22008 SDValue CondRHS = Cond->getOperand(1);
22010 // Look for a general sub with unsigned saturation first.
22011 // x >= y ? x-y : 0 --> subus x, y
22012 // x > y ? x-y : 0 --> subus x, y
22013 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
22014 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
22015 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
22017 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
22018 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
22019 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
22020 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
22021 // If the RHS is a constant we have to reverse the const
22022 // canonicalization.
22023 // x > C-1 ? x+-C : 0 --> subus x, C
22024 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
22025 CondRHSConst->getAPIntValue() ==
22026 (-OpRHSConst->getAPIntValue() - 1))
22027 return DAG.getNode(
22028 X86ISD::SUBUS, DL, VT, OpLHS,
22029 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
22031 // Another special case: If C was a sign bit, the sub has been
22032 // canonicalized into a xor.
22033 // FIXME: Would it be better to use computeKnownBits to determine
22034 // whether it's safe to decanonicalize the xor?
22035 // x s< 0 ? x^C : 0 --> subus x, C
22036 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
22037 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
22038 OpRHSConst->getAPIntValue().isSignBit())
22039 // Note that we have to rebuild the RHS constant here to ensure we
22040 // don't rely on particular values of undef lanes.
22041 return DAG.getNode(
22042 X86ISD::SUBUS, DL, VT, OpLHS,
22043 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
22044 }
22045 }
22046 }
22048 // Try to match a min/max vector operation.
22049 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
22050 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
22051 unsigned Opc = ret.first;
22052 bool NeedSplit = ret.second;
22054 if (Opc && NeedSplit) {
22055 unsigned NumElems = VT.getVectorNumElements();
22056 // Extract the LHS vectors
22057 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
22058 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
22060 // Extract the RHS vectors
22061 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
22062 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
22064 // Create min/max for each subvector
22065 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
22066 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
22068 // Merge the result
22069 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
22070 } else if (Opc)
22071 return DAG.getNode(Opc, DL, VT, LHS, RHS);
22072 }
22074 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
22075 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22076 // Check if SETCC has already been promoted
22077 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
22078 // Check that condition value type matches vselect operand type
22079 CondVT == VT) {
22081 assert(Cond.getValueType().isVector() &&
22082 "vector select expects a vector selector!");
22084 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
22085 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
22087 if (!TValIsAllOnes && !FValIsAllZeros) {
22088 // Try invert the condition if true value is not all 1s and false value
22089 // is not all 0s.
22090 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
22091 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
22093 if (TValIsAllZeros || FValIsAllOnes) {
22094 SDValue CC = Cond.getOperand(2);
22095 ISD::CondCode NewCC =
22096 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
22097 Cond.getOperand(0).getValueType().isInteger());
22098 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
22099 std::swap(LHS, RHS);
22100 TValIsAllOnes = FValIsAllOnes;
22101 FValIsAllZeros = TValIsAllZeros;
22102 }
22103 }
22105 if (TValIsAllOnes || FValIsAllZeros) {
22106 SDValue Ret;
22108 if (TValIsAllOnes && FValIsAllZeros)
22109 Ret = Cond;
22110 else if (TValIsAllOnes)
22111 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
22112 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
22113 else if (FValIsAllZeros)
22114 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
22115 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
22117 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
22118 }
22119 }
22121 // Try to fold this VSELECT into a MOVSS/MOVSD
22122 if (N->getOpcode() == ISD::VSELECT &&
22123 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
22124 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
22125 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
22126 bool CanFold = false;
22127 unsigned NumElems = Cond.getNumOperands();
22128 SDValue A = LHS;
22129 SDValue B = RHS;
22131 if (isZero(Cond.getOperand(0))) {
22132 CanFold = true;
22134 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
22135 // fold (vselect <0,-1> -> (movsd A, B)
22136 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22137 CanFold = isAllOnes(Cond.getOperand(i));
22138 } else if (isAllOnes(Cond.getOperand(0))) {
22139 CanFold = true;
22140 std::swap(A, B);
22142 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
22143 // fold (vselect <-1,0> -> (movsd B, A)
22144 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22145 CanFold = isZero(Cond.getOperand(i));
22146 }
22148 if (CanFold) {
22149 if (VT == MVT::v4i32 || VT == MVT::v4f32)
22150 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
22151 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
22152 }
22154 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
22155 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
22156 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
22157 // (v2i64 (bitcast B)))))
22158 //
22159 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
22160 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
22161 // (v2f64 (bitcast B)))))
22162 //
22163 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
22164 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
22165 // (v2i64 (bitcast A)))))
22166 //
22167 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
22168 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
22169 // (v2f64 (bitcast A)))))
22171 CanFold = (isZero(Cond.getOperand(0)) &&
22172 isZero(Cond.getOperand(1)) &&
22173 isAllOnes(Cond.getOperand(2)) &&
22174 isAllOnes(Cond.getOperand(3)));
22176 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
22177 isAllOnes(Cond.getOperand(1)) &&
22178 isZero(Cond.getOperand(2)) &&
22179 isZero(Cond.getOperand(3))) {
22180 CanFold = true;
22181 std::swap(LHS, RHS);
22182 }
22184 if (CanFold) {
22185 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
22186 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
22187 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
22188 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
22189 NewB, DAG);
22190 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
22191 }
22192 }
22193 }
22194 }
22196 // If we know that this node is legal then we know that it is going to be
22197 // matched by one of the SSE/AVX BLEND instructions. These instructions only
22198 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
22199 // to simplify previous instructions.
22200 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
22201 !DCI.isBeforeLegalize() &&
22202 // We explicitly check against v8i16 and v16i16 because, although
22203 // they're marked as Custom, they might only be legal when Cond is a
22204 // build_vector of constants. This will be taken care in a later
22205 // condition.
22206 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
22207 VT != MVT::v8i16)) {
22208 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
22210 // Don't optimize vector selects that map to mask-registers.
22211 if (BitWidth == 1)
22212 return SDValue();
22214 // Check all uses of that condition operand to check whether it will be
22215 // consumed by non-BLEND instructions, which may depend on all bits are set
22216 // properly.
22217 for (SDNode::use_iterator I = Cond->use_begin(),
22218 E = Cond->use_end(); I != E; ++I)
22219 if (I->getOpcode() != ISD::VSELECT)
22220 // TODO: Add other opcodes eventually lowered into BLEND.
22221 return SDValue();
22223 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
22224 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
22226 APInt KnownZero, KnownOne;
22227 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
22228 DCI.isBeforeLegalizeOps());
22229 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
22230 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
22231 DCI.CommitTargetLoweringOpt(TLO);
22232 }
22234 return SDValue();
22235 }
22237 // Check whether a boolean test is testing a boolean value generated by
22238 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
22239 // code.
22240 //
22241 // Simplify the following patterns:
22242 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
22243 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
22244 // to (Op EFLAGS Cond)
22245 //
22246 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
22247 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
22248 // to (Op EFLAGS !Cond)
22249 //
22250 // where Op could be BRCOND or CMOV.
22251 //
22252 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
22253 // Quit if not CMP and SUB with its value result used.
22254 if (Cmp.getOpcode() != X86ISD::CMP &&
22255 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
22256 return SDValue();
22258 // Quit if not used as a boolean value.
22259 if (CC != X86::COND_E && CC != X86::COND_NE)
22260 return SDValue();
22262 // Check CMP operands. One of them should be 0 or 1 and the other should be
22263 // an SetCC or extended from it.
22264 SDValue Op1 = Cmp.getOperand(0);
22265 SDValue Op2 = Cmp.getOperand(1);
22267 SDValue SetCC;
22268 const ConstantSDNode* C = nullptr;
22269 bool needOppositeCond = (CC == X86::COND_E);
22270 bool checkAgainstTrue = false; // Is it a comparison against 1?
22272 if ((C = dyn_cast<ConstantSDNode>(Op1)))
22273 SetCC = Op2;
22274 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
22275 SetCC = Op1;
22276 else // Quit if all operands are not constants.
22277 return SDValue();
22279 if (C->getZExtValue() == 1) {
22280 needOppositeCond = !needOppositeCond;
22281 checkAgainstTrue = true;
22282 } else if (C->getZExtValue() != 0)
22283 // Quit if the constant is neither 0 or 1.
22284 return SDValue();
22286 bool truncatedToBoolWithAnd = false;
22287 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
22288 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
22289 SetCC.getOpcode() == ISD::TRUNCATE ||
22290 SetCC.getOpcode() == ISD::AND) {
22291 if (SetCC.getOpcode() == ISD::AND) {
22292 int OpIdx = -1;
22293 ConstantSDNode *CS;
22294 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
22295 CS->getZExtValue() == 1)
22296 OpIdx = 1;
22297 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
22298 CS->getZExtValue() == 1)
22299 OpIdx = 0;
22300 if (OpIdx == -1)
22301 break;
22302 SetCC = SetCC.getOperand(OpIdx);
22303 truncatedToBoolWithAnd = true;
22304 } else
22305 SetCC = SetCC.getOperand(0);
22306 }
22308 switch (SetCC.getOpcode()) {
22309 case X86ISD::SETCC_CARRY:
22310 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
22311 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
22312 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
22313 // truncated to i1 using 'and'.
22314 if (checkAgainstTrue && !truncatedToBoolWithAnd)
22315 break;
22316 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
22317 "Invalid use of SETCC_CARRY!");
22318 // FALL THROUGH
22319 case X86ISD::SETCC:
22320 // Set the condition code or opposite one if necessary.
22321 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
22322 if (needOppositeCond)
22323 CC = X86::GetOppositeBranchCondition(CC);
22324 return SetCC.getOperand(1);
22325 case X86ISD::CMOV: {
22326 // Check whether false/true value has canonical one, i.e. 0 or 1.
22327 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
22328 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
22329 // Quit if true value is not a constant.
22330 if (!TVal)
22331 return SDValue();
22332 // Quit if false value is not a constant.
22333 if (!FVal) {
22334 SDValue Op = SetCC.getOperand(0);
22335 // Skip 'zext' or 'trunc' node.
22336 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
22337 Op.getOpcode() == ISD::TRUNCATE)
22338 Op = Op.getOperand(0);
22339 // A special case for rdrand/rdseed, where 0 is set if false cond is
22340 // found.
22341 if ((Op.getOpcode() != X86ISD::RDRAND &&
22342 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
22343 return SDValue();
22344 }
22345 // Quit if false value is not the constant 0 or 1.
22346 bool FValIsFalse = true;
22347 if (FVal && FVal->getZExtValue() != 0) {
22348 if (FVal->getZExtValue() != 1)
22349 return SDValue();
22350 // If FVal is 1, opposite cond is needed.
22351 needOppositeCond = !needOppositeCond;
22352 FValIsFalse = false;
22353 }
22354 // Quit if TVal is not the constant opposite of FVal.
22355 if (FValIsFalse && TVal->getZExtValue() != 1)
22356 return SDValue();
22357 if (!FValIsFalse && TVal->getZExtValue() != 0)
22358 return SDValue();
22359 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
22360 if (needOppositeCond)
22361 CC = X86::GetOppositeBranchCondition(CC);
22362 return SetCC.getOperand(3);
22363 }
22364 }
22366 return SDValue();
22367 }
22369 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
22370 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
22371 TargetLowering::DAGCombinerInfo &DCI,
22372 const X86Subtarget *Subtarget) {
22373 SDLoc DL(N);
22375 // If the flag operand isn't dead, don't touch this CMOV.
22376 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
22377 return SDValue();
22379 SDValue FalseOp = N->getOperand(0);
22380 SDValue TrueOp = N->getOperand(1);
22381 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
22382 SDValue Cond = N->getOperand(3);
22384 if (CC == X86::COND_E || CC == X86::COND_NE) {
22385 switch (Cond.getOpcode()) {
22386 default: break;
22387 case X86ISD::BSR:
22388 case X86ISD::BSF:
22389 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
22390 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
22391 return (CC == X86::COND_E) ? FalseOp : TrueOp;
22392 }
22393 }
22395 SDValue Flags;
22397 Flags = checkBoolTestSetCCCombine(Cond, CC);
22398 if (Flags.getNode() &&
22399 // Extra check as FCMOV only supports a subset of X86 cond.
22400 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
22401 SDValue Ops[] = { FalseOp, TrueOp,
22402 DAG.getConstant(CC, MVT::i8), Flags };
22403 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
22404 }
22406 // If this is a select between two integer constants, try to do some
22407 // optimizations. Note that the operands are ordered the opposite of SELECT
22408 // operands.
22409 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
22410 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
22411 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
22412 // larger than FalseC (the false value).
22413 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
22414 CC = X86::GetOppositeBranchCondition(CC);
22415 std::swap(TrueC, FalseC);
22416 std::swap(TrueOp, FalseOp);
22417 }
22419 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
22420 // This is efficient for any integer data type (including i8/i16) and
22421 // shift amount.
22422 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
22423 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22424 DAG.getConstant(CC, MVT::i8), Cond);
22426 // Zero extend the condition if needed.
22427 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
22429 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22430 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
22431 DAG.getConstant(ShAmt, MVT::i8));
22432 if (N->getNumValues() == 2) // Dead flag value?
22433 return DCI.CombineTo(N, Cond, SDValue());
22434 return Cond;
22435 }
22437 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
22438 // for any integer data type, including i8/i16.
22439 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22440 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22441 DAG.getConstant(CC, MVT::i8), Cond);
22443 // Zero extend the condition if needed.
22444 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22445 FalseC->getValueType(0), Cond);
22446 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22447 SDValue(FalseC, 0));
22449 if (N->getNumValues() == 2) // Dead flag value?
22450 return DCI.CombineTo(N, Cond, SDValue());
22451 return Cond;
22452 }
22454 // Optimize cases that will turn into an LEA instruction. This requires
22455 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22456 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22457 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22458 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22460 bool isFastMultiplier = false;
22461 if (Diff < 10) {
22462 switch ((unsigned char)Diff) {
22463 default: break;
22464 case 1: // result = add base, cond
22465 case 2: // result = lea base( , cond*2)
22466 case 3: // result = lea base(cond, cond*2)
22467 case 4: // result = lea base( , cond*4)
22468 case 5: // result = lea base(cond, cond*4)
22469 case 8: // result = lea base( , cond*8)
22470 case 9: // result = lea base(cond, cond*8)
22471 isFastMultiplier = true;
22472 break;
22473 }
22474 }
22476 if (isFastMultiplier) {
22477 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22478 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22479 DAG.getConstant(CC, MVT::i8), Cond);
22480 // Zero extend the condition if needed.
22481 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22482 Cond);
22483 // Scale the condition by the difference.
22484 if (Diff != 1)
22485 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22486 DAG.getConstant(Diff, Cond.getValueType()));
22488 // Add the base if non-zero.
22489 if (FalseC->getAPIntValue() != 0)
22490 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22491 SDValue(FalseC, 0));
22492 if (N->getNumValues() == 2) // Dead flag value?
22493 return DCI.CombineTo(N, Cond, SDValue());
22494 return Cond;
22495 }
22496 }
22497 }
22498 }
22500 // Handle these cases:
22501 // (select (x != c), e, c) -> select (x != c), e, x),
22502 // (select (x == c), c, e) -> select (x == c), x, e)
22503 // where the c is an integer constant, and the "select" is the combination
22504 // of CMOV and CMP.
22505 //
22506 // The rationale for this change is that the conditional-move from a constant
22507 // needs two instructions, however, conditional-move from a register needs
22508 // only one instruction.
22509 //
22510 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
22511 // some instruction-combining opportunities. This opt needs to be
22512 // postponed as late as possible.
22513 //
22514 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
22515 // the DCI.xxxx conditions are provided to postpone the optimization as
22516 // late as possible.
22518 ConstantSDNode *CmpAgainst = nullptr;
22519 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
22520 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
22521 !isa<ConstantSDNode>(Cond.getOperand(0))) {
22523 if (CC == X86::COND_NE &&
22524 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
22525 CC = X86::GetOppositeBranchCondition(CC);
22526 std::swap(TrueOp, FalseOp);
22527 }
22529 if (CC == X86::COND_E &&
22530 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
22531 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
22532 DAG.getConstant(CC, MVT::i8), Cond };
22533 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
22534 }
22535 }
22536 }
22538 return SDValue();
22539 }
22541 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
22542 const X86Subtarget *Subtarget) {
22543 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
22544 switch (IntNo) {
22545 default: return SDValue();
22546 // SSE/AVX/AVX2 blend intrinsics.
22547 case Intrinsic::x86_avx2_pblendvb:
22548 case Intrinsic::x86_avx2_pblendw:
22549 case Intrinsic::x86_avx2_pblendd_128:
22550 case Intrinsic::x86_avx2_pblendd_256:
22551 // Don't try to simplify this intrinsic if we don't have AVX2.
22552 if (!Subtarget->hasAVX2())
22553 return SDValue();
22554 // FALL-THROUGH
22555 case Intrinsic::x86_avx_blend_pd_256:
22556 case Intrinsic::x86_avx_blend_ps_256:
22557 case Intrinsic::x86_avx_blendv_pd_256:
22558 case Intrinsic::x86_avx_blendv_ps_256:
22559 // Don't try to simplify this intrinsic if we don't have AVX.
22560 if (!Subtarget->hasAVX())
22561 return SDValue();
22562 // FALL-THROUGH
22563 case Intrinsic::x86_sse41_pblendw:
22564 case Intrinsic::x86_sse41_blendpd:
22565 case Intrinsic::x86_sse41_blendps:
22566 case Intrinsic::x86_sse41_blendvps:
22567 case Intrinsic::x86_sse41_blendvpd:
22568 case Intrinsic::x86_sse41_pblendvb: {
22569 SDValue Op0 = N->getOperand(1);
22570 SDValue Op1 = N->getOperand(2);
22571 SDValue Mask = N->getOperand(3);
22573 // Don't try to simplify this intrinsic if we don't have SSE4.1.
22574 if (!Subtarget->hasSSE41())
22575 return SDValue();
22577 // fold (blend A, A, Mask) -> A
22578 if (Op0 == Op1)
22579 return Op0;
22580 // fold (blend A, B, allZeros) -> A
22581 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
22582 return Op0;
22583 // fold (blend A, B, allOnes) -> B
22584 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
22585 return Op1;
22587 // Simplify the case where the mask is a constant i32 value.
22588 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
22589 if (C->isNullValue())
22590 return Op0;
22591 if (C->isAllOnesValue())
22592 return Op1;
22593 }
22595 return SDValue();
22596 }
22598 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
22599 case Intrinsic::x86_sse2_psrai_w:
22600 case Intrinsic::x86_sse2_psrai_d:
22601 case Intrinsic::x86_avx2_psrai_w:
22602 case Intrinsic::x86_avx2_psrai_d:
22603 case Intrinsic::x86_sse2_psra_w:
22604 case Intrinsic::x86_sse2_psra_d:
22605 case Intrinsic::x86_avx2_psra_w:
22606 case Intrinsic::x86_avx2_psra_d: {
22607 SDValue Op0 = N->getOperand(1);
22608 SDValue Op1 = N->getOperand(2);
22609 EVT VT = Op0.getValueType();
22610 assert(VT.isVector() && "Expected a vector type!");
22612 if (isa<BuildVectorSDNode>(Op1))
22613 Op1 = Op1.getOperand(0);
22615 if (!isa<ConstantSDNode>(Op1))
22616 return SDValue();
22618 EVT SVT = VT.getVectorElementType();
22619 unsigned SVTBits = SVT.getSizeInBits();
22621 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
22622 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
22623 uint64_t ShAmt = C.getZExtValue();
22625 // Don't try to convert this shift into a ISD::SRA if the shift
22626 // count is bigger than or equal to the element size.
22627 if (ShAmt >= SVTBits)
22628 return SDValue();
22630 // Trivial case: if the shift count is zero, then fold this
22631 // into the first operand.
22632 if (ShAmt == 0)
22633 return Op0;
22635 // Replace this packed shift intrinsic with a target independent
22636 // shift dag node.
22637 SDValue Splat = DAG.getConstant(C, VT);
22638 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
22639 }
22640 }
22641 }
22643 /// PerformMulCombine - Optimize a single multiply with constant into two
22644 /// in order to implement it with two cheaper instructions, e.g.
22645 /// LEA + SHL, LEA + LEA.
22646 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
22647 TargetLowering::DAGCombinerInfo &DCI) {
22648 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
22649 return SDValue();
22651 EVT VT = N->getValueType(0);
22652 if (VT != MVT::i64)
22653 return SDValue();
22655 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
22656 if (!C)
22657 return SDValue();
22658 uint64_t MulAmt = C->getZExtValue();
22659 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
22660 return SDValue();
22662 uint64_t MulAmt1 = 0;
22663 uint64_t MulAmt2 = 0;
22664 if ((MulAmt % 9) == 0) {
22665 MulAmt1 = 9;
22666 MulAmt2 = MulAmt / 9;
22667 } else if ((MulAmt % 5) == 0) {
22668 MulAmt1 = 5;
22669 MulAmt2 = MulAmt / 5;
22670 } else if ((MulAmt % 3) == 0) {
22671 MulAmt1 = 3;
22672 MulAmt2 = MulAmt / 3;
22673 }
22674 if (MulAmt2 &&
22675 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
22676 SDLoc DL(N);
22678 if (isPowerOf2_64(MulAmt2) &&
22679 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
22680 // If second multiplifer is pow2, issue it first. We want the multiply by
22681 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
22682 // is an add.
22683 std::swap(MulAmt1, MulAmt2);
22685 SDValue NewMul;
22686 if (isPowerOf2_64(MulAmt1))
22687 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
22688 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
22689 else
22690 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
22691 DAG.getConstant(MulAmt1, VT));
22693 if (isPowerOf2_64(MulAmt2))
22694 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
22695 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
22696 else
22697 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
22698 DAG.getConstant(MulAmt2, VT));
22700 // Do not add new nodes to DAG combiner worklist.
22701 DCI.CombineTo(N, NewMul, false);
22702 }
22703 return SDValue();
22704 }
22706 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
22707 SDValue N0 = N->getOperand(0);
22708 SDValue N1 = N->getOperand(1);
22709 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
22710 EVT VT = N0.getValueType();
22712 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
22713 // since the result of setcc_c is all zero's or all ones.
22714 if (VT.isInteger() && !VT.isVector() &&
22715 N1C && N0.getOpcode() == ISD::AND &&
22716 N0.getOperand(1).getOpcode() == ISD::Constant) {
22717 SDValue N00 = N0.getOperand(0);
22718 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
22719 ((N00.getOpcode() == ISD::ANY_EXTEND ||
22720 N00.getOpcode() == ISD::ZERO_EXTEND) &&
22721 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
22722 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
22723 APInt ShAmt = N1C->getAPIntValue();
22724 Mask = Mask.shl(ShAmt);
22725 if (Mask != 0)
22726 return DAG.getNode(ISD::AND, SDLoc(N), VT,
22727 N00, DAG.getConstant(Mask, VT));
22728 }
22729 }
22731 // Hardware support for vector shifts is sparse which makes us scalarize the
22732 // vector operations in many cases. Also, on sandybridge ADD is faster than
22733 // shl.
22734 // (shl V, 1) -> add V,V
22735 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
22736 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
22737 assert(N0.getValueType().isVector() && "Invalid vector shift type");
22738 // We shift all of the values by one. In many cases we do not have
22739 // hardware support for this operation. This is better expressed as an ADD
22740 // of two values.
22741 if (N1SplatC->getZExtValue() == 1)
22742 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
22743 }
22745 return SDValue();
22746 }
22748 /// \brief Returns a vector of 0s if the node in input is a vector logical
22749 /// shift by a constant amount which is known to be bigger than or equal
22750 /// to the vector element size in bits.
22751 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
22752 const X86Subtarget *Subtarget) {
22753 EVT VT = N->getValueType(0);
22755 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
22756 (!Subtarget->hasInt256() ||
22757 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
22758 return SDValue();
22760 SDValue Amt = N->getOperand(1);
22761 SDLoc DL(N);
22762 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
22763 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
22764 APInt ShiftAmt = AmtSplat->getAPIntValue();
22765 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
22767 // SSE2/AVX2 logical shifts always return a vector of 0s
22768 // if the shift amount is bigger than or equal to
22769 // the element size. The constant shift amount will be
22770 // encoded as a 8-bit immediate.
22771 if (ShiftAmt.trunc(8).uge(MaxAmount))
22772 return getZeroVector(VT, Subtarget, DAG, DL);
22773 }
22775 return SDValue();
22776 }
22778 /// PerformShiftCombine - Combine shifts.
22779 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
22780 TargetLowering::DAGCombinerInfo &DCI,
22781 const X86Subtarget *Subtarget) {
22782 if (N->getOpcode() == ISD::SHL) {
22783 SDValue V = PerformSHLCombine(N, DAG);
22784 if (V.getNode()) return V;
22785 }
22787 if (N->getOpcode() != ISD::SRA) {
22788 // Try to fold this logical shift into a zero vector.
22789 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
22790 if (V.getNode()) return V;
22791 }
22793 return SDValue();
22794 }
22796 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
22797 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
22798 // and friends. Likewise for OR -> CMPNEQSS.
22799 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
22800 TargetLowering::DAGCombinerInfo &DCI,
22801 const X86Subtarget *Subtarget) {
22802 unsigned opcode;
22804 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
22805 // we're requiring SSE2 for both.
22806 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
22807 SDValue N0 = N->getOperand(0);
22808 SDValue N1 = N->getOperand(1);
22809 SDValue CMP0 = N0->getOperand(1);
22810 SDValue CMP1 = N1->getOperand(1);
22811 SDLoc DL(N);
22813 // The SETCCs should both refer to the same CMP.
22814 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
22815 return SDValue();
22817 SDValue CMP00 = CMP0->getOperand(0);
22818 SDValue CMP01 = CMP0->getOperand(1);
22819 EVT VT = CMP00.getValueType();
22821 if (VT == MVT::f32 || VT == MVT::f64) {
22822 bool ExpectingFlags = false;
22823 // Check for any users that want flags:
22824 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
22825 !ExpectingFlags && UI != UE; ++UI)
22826 switch (UI->getOpcode()) {
22827 default:
22828 case ISD::BR_CC:
22829 case ISD::BRCOND:
22830 case ISD::SELECT:
22831 ExpectingFlags = true;
22832 break;
22833 case ISD::CopyToReg:
22834 case ISD::SIGN_EXTEND:
22835 case ISD::ZERO_EXTEND:
22836 case ISD::ANY_EXTEND:
22837 break;
22838 }
22840 if (!ExpectingFlags) {
22841 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
22842 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
22844 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
22845 X86::CondCode tmp = cc0;
22846 cc0 = cc1;
22847 cc1 = tmp;
22848 }
22850 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
22851 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
22852 // FIXME: need symbolic constants for these magic numbers.
22853 // See X86ATTInstPrinter.cpp:printSSECC().
22854 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
22855 if (Subtarget->hasAVX512()) {
22856 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
22857 CMP01, DAG.getConstant(x86cc, MVT::i8));
22858 if (N->getValueType(0) != MVT::i1)
22859 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
22860 FSetCC);
22861 return FSetCC;
22862 }
22863 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
22864 CMP00.getValueType(), CMP00, CMP01,
22865 DAG.getConstant(x86cc, MVT::i8));
22867 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
22868 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
22870 if (is64BitFP && !Subtarget->is64Bit()) {
22871 // On a 32-bit target, we cannot bitcast the 64-bit float to a
22872 // 64-bit integer, since that's not a legal type. Since
22873 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
22874 // bits, but can do this little dance to extract the lowest 32 bits
22875 // and work with those going forward.
22876 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
22877 OnesOrZeroesF);
22878 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
22879 Vector64);
22880 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
22881 Vector32, DAG.getIntPtrConstant(0));
22882 IntVT = MVT::i32;
22883 }
22885 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
22886 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
22887 DAG.getConstant(1, IntVT));
22888 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
22889 return OneBitOfTruth;
22890 }
22891 }
22892 }
22893 }
22894 return SDValue();
22895 }
22897 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
22898 /// so it can be folded inside ANDNP.
22899 static bool CanFoldXORWithAllOnes(const SDNode *N) {
22900 EVT VT = N->getValueType(0);
22902 // Match direct AllOnes for 128 and 256-bit vectors
22903 if (ISD::isBuildVectorAllOnes(N))
22904 return true;
22906 // Look through a bit convert.
22907 if (N->getOpcode() == ISD::BITCAST)
22908 N = N->getOperand(0).getNode();
22910 // Sometimes the operand may come from a insert_subvector building a 256-bit
22911 // allones vector
22912 if (VT.is256BitVector() &&
22913 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
22914 SDValue V1 = N->getOperand(0);
22915 SDValue V2 = N->getOperand(1);
22917 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
22918 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
22919 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
22920 ISD::isBuildVectorAllOnes(V2.getNode()))
22921 return true;
22922 }
22924 return false;
22925 }
22927 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
22928 // register. In most cases we actually compare or select YMM-sized registers
22929 // and mixing the two types creates horrible code. This method optimizes
22930 // some of the transition sequences.
22931 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
22932 TargetLowering::DAGCombinerInfo &DCI,
22933 const X86Subtarget *Subtarget) {
22934 EVT VT = N->getValueType(0);
22935 if (!VT.is256BitVector())
22936 return SDValue();
22938 assert((N->getOpcode() == ISD::ANY_EXTEND ||
22939 N->getOpcode() == ISD::ZERO_EXTEND ||
22940 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
22942 SDValue Narrow = N->getOperand(0);
22943 EVT NarrowVT = Narrow->getValueType(0);
22944 if (!NarrowVT.is128BitVector())
22945 return SDValue();
22947 if (Narrow->getOpcode() != ISD::XOR &&
22948 Narrow->getOpcode() != ISD::AND &&
22949 Narrow->getOpcode() != ISD::OR)
22950 return SDValue();
22952 SDValue N0 = Narrow->getOperand(0);
22953 SDValue N1 = Narrow->getOperand(1);
22954 SDLoc DL(Narrow);
22956 // The Left side has to be a trunc.
22957 if (N0.getOpcode() != ISD::TRUNCATE)
22958 return SDValue();
22960 // The type of the truncated inputs.
22961 EVT WideVT = N0->getOperand(0)->getValueType(0);
22962 if (WideVT != VT)
22963 return SDValue();
22965 // The right side has to be a 'trunc' or a constant vector.
22966 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
22967 ConstantSDNode *RHSConstSplat = nullptr;
22968 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
22969 RHSConstSplat = RHSBV->getConstantSplatNode();
22970 if (!RHSTrunc && !RHSConstSplat)
22971 return SDValue();
22973 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22975 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
22976 return SDValue();
22978 // Set N0 and N1 to hold the inputs to the new wide operation.
22979 N0 = N0->getOperand(0);
22980 if (RHSConstSplat) {
22981 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
22982 SDValue(RHSConstSplat, 0));
22983 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
22984 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
22985 } else if (RHSTrunc) {
22986 N1 = N1->getOperand(0);
22987 }
22989 // Generate the wide operation.
22990 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
22991 unsigned Opcode = N->getOpcode();
22992 switch (Opcode) {
22993 case ISD::ANY_EXTEND:
22994 return Op;
22995 case ISD::ZERO_EXTEND: {
22996 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
22997 APInt Mask = APInt::getAllOnesValue(InBits);
22998 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
22999 return DAG.getNode(ISD::AND, DL, VT,
23000 Op, DAG.getConstant(Mask, VT));
23001 }
23002 case ISD::SIGN_EXTEND:
23003 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
23004 Op, DAG.getValueType(NarrowVT));
23005 default:
23006 llvm_unreachable("Unexpected opcode");
23007 }
23008 }
23010 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
23011 TargetLowering::DAGCombinerInfo &DCI,
23012 const X86Subtarget *Subtarget) {
23013 EVT VT = N->getValueType(0);
23014 if (DCI.isBeforeLegalizeOps())
23015 return SDValue();
23017 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23018 if (R.getNode())
23019 return R;
23021 // Create BEXTR instructions
23022 // BEXTR is ((X >> imm) & (2**size-1))
23023 if (VT == MVT::i32 || VT == MVT::i64) {
23024 SDValue N0 = N->getOperand(0);
23025 SDValue N1 = N->getOperand(1);
23026 SDLoc DL(N);
23028 // Check for BEXTR.
23029 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
23030 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
23031 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
23032 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23033 if (MaskNode && ShiftNode) {
23034 uint64_t Mask = MaskNode->getZExtValue();
23035 uint64_t Shift = ShiftNode->getZExtValue();
23036 if (isMask_64(Mask)) {
23037 uint64_t MaskSize = CountPopulation_64(Mask);
23038 if (Shift + MaskSize <= VT.getSizeInBits())
23039 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
23040 DAG.getConstant(Shift | (MaskSize << 8), VT));
23041 }
23042 }
23043 } // BEXTR
23045 return SDValue();
23046 }
23048 // Want to form ANDNP nodes:
23049 // 1) In the hopes of then easily combining them with OR and AND nodes
23050 // to form PBLEND/PSIGN.
23051 // 2) To match ANDN packed intrinsics
23052 if (VT != MVT::v2i64 && VT != MVT::v4i64)
23053 return SDValue();
23055 SDValue N0 = N->getOperand(0);
23056 SDValue N1 = N->getOperand(1);
23057 SDLoc DL(N);
23059 // Check LHS for vnot
23060 if (N0.getOpcode() == ISD::XOR &&
23061 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
23062 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
23063 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
23065 // Check RHS for vnot
23066 if (N1.getOpcode() == ISD::XOR &&
23067 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
23068 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
23069 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
23071 return SDValue();
23072 }
23074 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
23075 TargetLowering::DAGCombinerInfo &DCI,
23076 const X86Subtarget *Subtarget) {
23077 if (DCI.isBeforeLegalizeOps())
23078 return SDValue();
23080 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23081 if (R.getNode())
23082 return R;
23084 SDValue N0 = N->getOperand(0);
23085 SDValue N1 = N->getOperand(1);
23086 EVT VT = N->getValueType(0);
23088 // look for psign/blend
23089 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
23090 if (!Subtarget->hasSSSE3() ||
23091 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
23092 return SDValue();
23094 // Canonicalize pandn to RHS
23095 if (N0.getOpcode() == X86ISD::ANDNP)
23096 std::swap(N0, N1);
23097 // or (and (m, y), (pandn m, x))
23098 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
23099 SDValue Mask = N1.getOperand(0);
23100 SDValue X = N1.getOperand(1);
23101 SDValue Y;
23102 if (N0.getOperand(0) == Mask)
23103 Y = N0.getOperand(1);
23104 if (N0.getOperand(1) == Mask)
23105 Y = N0.getOperand(0);
23107 // Check to see if the mask appeared in both the AND and ANDNP and
23108 if (!Y.getNode())
23109 return SDValue();
23111 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
23112 // Look through mask bitcast.
23113 if (Mask.getOpcode() == ISD::BITCAST)
23114 Mask = Mask.getOperand(0);
23115 if (X.getOpcode() == ISD::BITCAST)
23116 X = X.getOperand(0);
23117 if (Y.getOpcode() == ISD::BITCAST)
23118 Y = Y.getOperand(0);
23120 EVT MaskVT = Mask.getValueType();
23122 // Validate that the Mask operand is a vector sra node.
23123 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
23124 // there is no psrai.b
23125 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
23126 unsigned SraAmt = ~0;
23127 if (Mask.getOpcode() == ISD::SRA) {
23128 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
23129 if (auto *AmtConst = AmtBV->getConstantSplatNode())
23130 SraAmt = AmtConst->getZExtValue();
23131 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
23132 SDValue SraC = Mask.getOperand(1);
23133 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
23134 }
23135 if ((SraAmt + 1) != EltBits)
23136 return SDValue();
23138 SDLoc DL(N);
23140 // Now we know we at least have a plendvb with the mask val. See if
23141 // we can form a psignb/w/d.
23142 // psign = x.type == y.type == mask.type && y = sub(0, x);
23143 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
23144 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
23145 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
23146 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
23147 "Unsupported VT for PSIGN");
23148 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
23149 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23150 }
23151 // PBLENDVB only available on SSE 4.1
23152 if (!Subtarget->hasSSE41())
23153 return SDValue();
23155 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
23157 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
23158 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
23159 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
23160 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
23161 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23162 }
23163 }
23165 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
23166 return SDValue();
23168 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
23169 MachineFunction &MF = DAG.getMachineFunction();
23170 bool OptForSize = MF.getFunction()->getAttributes().
23171 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
23173 // SHLD/SHRD instructions have lower register pressure, but on some
23174 // platforms they have higher latency than the equivalent
23175 // series of shifts/or that would otherwise be generated.
23176 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
23177 // have higher latencies and we are not optimizing for size.
23178 if (!OptForSize && Subtarget->isSHLDSlow())
23179 return SDValue();
23181 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
23182 std::swap(N0, N1);
23183 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
23184 return SDValue();
23185 if (!N0.hasOneUse() || !N1.hasOneUse())
23186 return SDValue();
23188 SDValue ShAmt0 = N0.getOperand(1);
23189 if (ShAmt0.getValueType() != MVT::i8)
23190 return SDValue();
23191 SDValue ShAmt1 = N1.getOperand(1);
23192 if (ShAmt1.getValueType() != MVT::i8)
23193 return SDValue();
23194 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
23195 ShAmt0 = ShAmt0.getOperand(0);
23196 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
23197 ShAmt1 = ShAmt1.getOperand(0);
23199 SDLoc DL(N);
23200 unsigned Opc = X86ISD::SHLD;
23201 SDValue Op0 = N0.getOperand(0);
23202 SDValue Op1 = N1.getOperand(0);
23203 if (ShAmt0.getOpcode() == ISD::SUB) {
23204 Opc = X86ISD::SHRD;
23205 std::swap(Op0, Op1);
23206 std::swap(ShAmt0, ShAmt1);
23207 }
23209 unsigned Bits = VT.getSizeInBits();
23210 if (ShAmt1.getOpcode() == ISD::SUB) {
23211 SDValue Sum = ShAmt1.getOperand(0);
23212 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
23213 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
23214 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
23215 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
23216 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
23217 return DAG.getNode(Opc, DL, VT,
23218 Op0, Op1,
23219 DAG.getNode(ISD::TRUNCATE, DL,
23220 MVT::i8, ShAmt0));
23221 }
23222 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
23223 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
23224 if (ShAmt0C &&
23225 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
23226 return DAG.getNode(Opc, DL, VT,
23227 N0.getOperand(0), N1.getOperand(0),
23228 DAG.getNode(ISD::TRUNCATE, DL,
23229 MVT::i8, ShAmt0));
23230 }
23232 return SDValue();
23233 }
23235 // Generate NEG and CMOV for integer abs.
23236 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
23237 EVT VT = N->getValueType(0);
23239 // Since X86 does not have CMOV for 8-bit integer, we don't convert
23240 // 8-bit integer abs to NEG and CMOV.
23241 if (VT.isInteger() && VT.getSizeInBits() == 8)
23242 return SDValue();
23244 SDValue N0 = N->getOperand(0);
23245 SDValue N1 = N->getOperand(1);
23246 SDLoc DL(N);
23248 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
23249 // and change it to SUB and CMOV.
23250 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
23251 N0.getOpcode() == ISD::ADD &&
23252 N0.getOperand(1) == N1 &&
23253 N1.getOpcode() == ISD::SRA &&
23254 N1.getOperand(0) == N0.getOperand(0))
23255 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
23256 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
23257 // Generate SUB & CMOV.
23258 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
23259 DAG.getConstant(0, VT), N0.getOperand(0));
23261 SDValue Ops[] = { N0.getOperand(0), Neg,
23262 DAG.getConstant(X86::COND_GE, MVT::i8),
23263 SDValue(Neg.getNode(), 1) };
23264 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
23265 }
23266 return SDValue();
23267 }
23269 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
23270 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
23271 TargetLowering::DAGCombinerInfo &DCI,
23272 const X86Subtarget *Subtarget) {
23273 if (DCI.isBeforeLegalizeOps())
23274 return SDValue();
23276 if (Subtarget->hasCMov()) {
23277 SDValue RV = performIntegerAbsCombine(N, DAG);
23278 if (RV.getNode())
23279 return RV;
23280 }
23282 return SDValue();
23283 }
23285 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
23286 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
23287 TargetLowering::DAGCombinerInfo &DCI,
23288 const X86Subtarget *Subtarget) {
23289 LoadSDNode *Ld = cast<LoadSDNode>(N);
23290 EVT RegVT = Ld->getValueType(0);
23291 EVT MemVT = Ld->getMemoryVT();
23292 SDLoc dl(Ld);
23293 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23295 // On Sandybridge unaligned 256bit loads are inefficient.
23296 ISD::LoadExtType Ext = Ld->getExtensionType();
23297 unsigned Alignment = Ld->getAlignment();
23298 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
23299 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
23300 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
23301 unsigned NumElems = RegVT.getVectorNumElements();
23302 if (NumElems < 2)
23303 return SDValue();
23305 SDValue Ptr = Ld->getBasePtr();
23306 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
23308 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
23309 NumElems/2);
23310 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23311 Ld->getPointerInfo(), Ld->isVolatile(),
23312 Ld->isNonTemporal(), Ld->isInvariant(),
23313 Alignment);
23314 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23315 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23316 Ld->getPointerInfo(), Ld->isVolatile(),
23317 Ld->isNonTemporal(), Ld->isInvariant(),
23318 std::min(16U, Alignment));
23319 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
23320 Load1.getValue(1),
23321 Load2.getValue(1));
23323 SDValue NewVec = DAG.getUNDEF(RegVT);
23324 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
23325 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
23326 return DCI.CombineTo(N, NewVec, TF, true);
23327 }
23329 return SDValue();
23330 }
23332 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
23333 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
23334 const X86Subtarget *Subtarget) {
23335 StoreSDNode *St = cast<StoreSDNode>(N);
23336 EVT VT = St->getValue().getValueType();
23337 EVT StVT = St->getMemoryVT();
23338 SDLoc dl(St);
23339 SDValue StoredVal = St->getOperand(1);
23340 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23342 // If we are saving a concatenation of two XMM registers, perform two stores.
23343 // On Sandy Bridge, 256-bit memory operations are executed by two
23344 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
23345 // memory operation.
23346 unsigned Alignment = St->getAlignment();
23347 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
23348 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
23349 StVT == VT && !IsAligned) {
23350 unsigned NumElems = VT.getVectorNumElements();
23351 if (NumElems < 2)
23352 return SDValue();
23354 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
23355 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
23357 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
23358 SDValue Ptr0 = St->getBasePtr();
23359 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
23361 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
23362 St->getPointerInfo(), St->isVolatile(),
23363 St->isNonTemporal(), Alignment);
23364 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
23365 St->getPointerInfo(), St->isVolatile(),
23366 St->isNonTemporal(),
23367 std::min(16U, Alignment));
23368 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
23369 }
23371 // Optimize trunc store (of multiple scalars) to shuffle and store.
23372 // First, pack all of the elements in one place. Next, store to memory
23373 // in fewer chunks.
23374 if (St->isTruncatingStore() && VT.isVector()) {
23375 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23376 unsigned NumElems = VT.getVectorNumElements();
23377 assert(StVT != VT && "Cannot truncate to the same type");
23378 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
23379 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
23381 // From, To sizes and ElemCount must be pow of two
23382 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
23383 // We are going to use the original vector elt for storing.
23384 // Accumulated smaller vector elements must be a multiple of the store size.
23385 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
23387 unsigned SizeRatio = FromSz / ToSz;
23389 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
23391 // Create a type on which we perform the shuffle
23392 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
23393 StVT.getScalarType(), NumElems*SizeRatio);
23395 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
23397 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
23398 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
23399 for (unsigned i = 0; i != NumElems; ++i)
23400 ShuffleVec[i] = i * SizeRatio;
23402 // Can't shuffle using an illegal type.
23403 if (!TLI.isTypeLegal(WideVecVT))
23404 return SDValue();
23406 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
23407 DAG.getUNDEF(WideVecVT),
23408 &ShuffleVec[0]);
23409 // At this point all of the data is stored at the bottom of the
23410 // register. We now need to save it to mem.
23412 // Find the largest store unit
23413 MVT StoreType = MVT::i8;
23414 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
23415 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
23416 MVT Tp = (MVT::SimpleValueType)tp;
23417 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
23418 StoreType = Tp;
23419 }
23421 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
23422 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
23423 (64 <= NumElems * ToSz))
23424 StoreType = MVT::f64;
23426 // Bitcast the original vector into a vector of store-size units
23427 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
23428 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
23429 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
23430 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
23431 SmallVector<SDValue, 8> Chains;
23432 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
23433 TLI.getPointerTy());
23434 SDValue Ptr = St->getBasePtr();
23436 // Perform one or more big stores into memory.
23437 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
23438 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
23439 StoreType, ShuffWide,
23440 DAG.getIntPtrConstant(i));
23441 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
23442 St->getPointerInfo(), St->isVolatile(),
23443 St->isNonTemporal(), St->getAlignment());
23444 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23445 Chains.push_back(Ch);
23446 }
23448 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
23449 }
23451 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
23452 // the FP state in cases where an emms may be missing.
23453 // A preferable solution to the general problem is to figure out the right
23454 // places to insert EMMS. This qualifies as a quick hack.
23456 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
23457 if (VT.getSizeInBits() != 64)
23458 return SDValue();
23460 const Function *F = DAG.getMachineFunction().getFunction();
23461 bool NoImplicitFloatOps = F->getAttributes().
23462 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
23463 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
23464 && Subtarget->hasSSE2();
23465 if ((VT.isVector() ||
23466 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
23467 isa<LoadSDNode>(St->getValue()) &&
23468 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
23469 St->getChain().hasOneUse() && !St->isVolatile()) {
23470 SDNode* LdVal = St->getValue().getNode();
23471 LoadSDNode *Ld = nullptr;
23472 int TokenFactorIndex = -1;
23473 SmallVector<SDValue, 8> Ops;
23474 SDNode* ChainVal = St->getChain().getNode();
23475 // Must be a store of a load. We currently handle two cases: the load
23476 // is a direct child, and it's under an intervening TokenFactor. It is
23477 // possible to dig deeper under nested TokenFactors.
23478 if (ChainVal == LdVal)
23479 Ld = cast<LoadSDNode>(St->getChain());
23480 else if (St->getValue().hasOneUse() &&
23481 ChainVal->getOpcode() == ISD::TokenFactor) {
23482 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
23483 if (ChainVal->getOperand(i).getNode() == LdVal) {
23484 TokenFactorIndex = i;
23485 Ld = cast<LoadSDNode>(St->getValue());
23486 } else
23487 Ops.push_back(ChainVal->getOperand(i));
23488 }
23489 }
23491 if (!Ld || !ISD::isNormalLoad(Ld))
23492 return SDValue();
23494 // If this is not the MMX case, i.e. we are just turning i64 load/store
23495 // into f64 load/store, avoid the transformation if there are multiple
23496 // uses of the loaded value.
23497 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
23498 return SDValue();
23500 SDLoc LdDL(Ld);
23501 SDLoc StDL(N);
23502 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
23503 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
23504 // pair instead.
23505 if (Subtarget->is64Bit() || F64IsLegal) {
23506 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
23507 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
23508 Ld->getPointerInfo(), Ld->isVolatile(),
23509 Ld->isNonTemporal(), Ld->isInvariant(),
23510 Ld->getAlignment());
23511 SDValue NewChain = NewLd.getValue(1);
23512 if (TokenFactorIndex != -1) {
23513 Ops.push_back(NewChain);
23514 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23515 }
23516 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
23517 St->getPointerInfo(),
23518 St->isVolatile(), St->isNonTemporal(),
23519 St->getAlignment());
23520 }
23522 // Otherwise, lower to two pairs of 32-bit loads / stores.
23523 SDValue LoAddr = Ld->getBasePtr();
23524 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
23525 DAG.getConstant(4, MVT::i32));
23527 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
23528 Ld->getPointerInfo(),
23529 Ld->isVolatile(), Ld->isNonTemporal(),
23530 Ld->isInvariant(), Ld->getAlignment());
23531 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
23532 Ld->getPointerInfo().getWithOffset(4),
23533 Ld->isVolatile(), Ld->isNonTemporal(),
23534 Ld->isInvariant(),
23535 MinAlign(Ld->getAlignment(), 4));
23537 SDValue NewChain = LoLd.getValue(1);
23538 if (TokenFactorIndex != -1) {
23539 Ops.push_back(LoLd);
23540 Ops.push_back(HiLd);
23541 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23542 }
23544 LoAddr = St->getBasePtr();
23545 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
23546 DAG.getConstant(4, MVT::i32));
23548 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
23549 St->getPointerInfo(),
23550 St->isVolatile(), St->isNonTemporal(),
23551 St->getAlignment());
23552 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
23553 St->getPointerInfo().getWithOffset(4),
23554 St->isVolatile(),
23555 St->isNonTemporal(),
23556 MinAlign(St->getAlignment(), 4));
23557 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
23558 }
23559 return SDValue();
23560 }
23562 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
23563 /// and return the operands for the horizontal operation in LHS and RHS. A
23564 /// horizontal operation performs the binary operation on successive elements
23565 /// of its first operand, then on successive elements of its second operand,
23566 /// returning the resulting values in a vector. For example, if
23567 /// A = < float a0, float a1, float a2, float a3 >
23568 /// and
23569 /// B = < float b0, float b1, float b2, float b3 >
23570 /// then the result of doing a horizontal operation on A and B is
23571 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
23572 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
23573 /// A horizontal-op B, for some already available A and B, and if so then LHS is
23574 /// set to A, RHS to B, and the routine returns 'true'.
23575 /// Note that the binary operation should have the property that if one of the
23576 /// operands is UNDEF then the result is UNDEF.
23577 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
23578 // Look for the following pattern: if
23579 // A = < float a0, float a1, float a2, float a3 >
23580 // B = < float b0, float b1, float b2, float b3 >
23581 // and
23582 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
23583 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
23584 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
23585 // which is A horizontal-op B.
23587 // At least one of the operands should be a vector shuffle.
23588 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
23589 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
23590 return false;
23592 MVT VT = LHS.getSimpleValueType();
23594 assert((VT.is128BitVector() || VT.is256BitVector()) &&
23595 "Unsupported vector type for horizontal add/sub");
23597 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
23598 // operate independently on 128-bit lanes.
23599 unsigned NumElts = VT.getVectorNumElements();
23600 unsigned NumLanes = VT.getSizeInBits()/128;
23601 unsigned NumLaneElts = NumElts / NumLanes;
23602 assert((NumLaneElts % 2 == 0) &&
23603 "Vector type should have an even number of elements in each lane");
23604 unsigned HalfLaneElts = NumLaneElts/2;
23606 // View LHS in the form
23607 // LHS = VECTOR_SHUFFLE A, B, LMask
23608 // If LHS is not a shuffle then pretend it is the shuffle
23609 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
23610 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
23611 // type VT.
23612 SDValue A, B;
23613 SmallVector<int, 16> LMask(NumElts);
23614 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23615 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
23616 A = LHS.getOperand(0);
23617 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
23618 B = LHS.getOperand(1);
23619 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
23620 std::copy(Mask.begin(), Mask.end(), LMask.begin());
23621 } else {
23622 if (LHS.getOpcode() != ISD::UNDEF)
23623 A = LHS;
23624 for (unsigned i = 0; i != NumElts; ++i)
23625 LMask[i] = i;
23626 }
23628 // Likewise, view RHS in the form
23629 // RHS = VECTOR_SHUFFLE C, D, RMask
23630 SDValue C, D;
23631 SmallVector<int, 16> RMask(NumElts);
23632 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23633 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
23634 C = RHS.getOperand(0);
23635 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
23636 D = RHS.getOperand(1);
23637 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
23638 std::copy(Mask.begin(), Mask.end(), RMask.begin());
23639 } else {
23640 if (RHS.getOpcode() != ISD::UNDEF)
23641 C = RHS;
23642 for (unsigned i = 0; i != NumElts; ++i)
23643 RMask[i] = i;
23644 }
23646 // Check that the shuffles are both shuffling the same vectors.
23647 if (!(A == C && B == D) && !(A == D && B == C))
23648 return false;
23650 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
23651 if (!A.getNode() && !B.getNode())
23652 return false;
23654 // If A and B occur in reverse order in RHS, then "swap" them (which means
23655 // rewriting the mask).
23656 if (A != C)
23657 CommuteVectorShuffleMask(RMask, NumElts);
23659 // At this point LHS and RHS are equivalent to
23660 // LHS = VECTOR_SHUFFLE A, B, LMask
23661 // RHS = VECTOR_SHUFFLE A, B, RMask
23662 // Check that the masks correspond to performing a horizontal operation.
23663 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
23664 for (unsigned i = 0; i != NumLaneElts; ++i) {
23665 int LIdx = LMask[i+l], RIdx = RMask[i+l];
23667 // Ignore any UNDEF components.
23668 if (LIdx < 0 || RIdx < 0 ||
23669 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
23670 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
23671 continue;
23673 // Check that successive elements are being operated on. If not, this is
23674 // not a horizontal operation.
23675 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
23676 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
23677 if (!(LIdx == Index && RIdx == Index + 1) &&
23678 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
23679 return false;
23680 }
23681 }
23683 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
23684 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
23685 return true;
23686 }
23688 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
23689 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
23690 const X86Subtarget *Subtarget) {
23691 EVT VT = N->getValueType(0);
23692 SDValue LHS = N->getOperand(0);
23693 SDValue RHS = N->getOperand(1);
23695 // Try to synthesize horizontal adds from adds of shuffles.
23696 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23697 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23698 isHorizontalBinOp(LHS, RHS, true))
23699 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
23700 return SDValue();
23701 }
23703 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
23704 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
23705 const X86Subtarget *Subtarget) {
23706 EVT VT = N->getValueType(0);
23707 SDValue LHS = N->getOperand(0);
23708 SDValue RHS = N->getOperand(1);
23710 // Try to synthesize horizontal subs from subs of shuffles.
23711 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23712 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23713 isHorizontalBinOp(LHS, RHS, false))
23714 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
23715 return SDValue();
23716 }
23718 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
23719 /// X86ISD::FXOR nodes.
23720 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
23721 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
23722 // F[X]OR(0.0, x) -> x
23723 // F[X]OR(x, 0.0) -> x
23724 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23725 if (C->getValueAPF().isPosZero())
23726 return N->getOperand(1);
23727 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23728 if (C->getValueAPF().isPosZero())
23729 return N->getOperand(0);
23730 return SDValue();
23731 }
23733 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
23734 /// X86ISD::FMAX nodes.
23735 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
23736 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
23738 // Only perform optimizations if UnsafeMath is used.
23739 if (!DAG.getTarget().Options.UnsafeFPMath)
23740 return SDValue();
23742 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
23743 // into FMINC and FMAXC, which are Commutative operations.
23744 unsigned NewOp = 0;
23745 switch (N->getOpcode()) {
23746 default: llvm_unreachable("unknown opcode");
23747 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
23748 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
23749 }
23751 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
23752 N->getOperand(0), N->getOperand(1));
23753 }
23755 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
23756 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
23757 // FAND(0.0, x) -> 0.0
23758 // FAND(x, 0.0) -> 0.0
23759 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23760 if (C->getValueAPF().isPosZero())
23761 return N->getOperand(0);
23762 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23763 if (C->getValueAPF().isPosZero())
23764 return N->getOperand(1);
23765 return SDValue();
23766 }
23768 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
23769 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
23770 // FANDN(x, 0.0) -> 0.0
23771 // FANDN(0.0, x) -> x
23772 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23773 if (C->getValueAPF().isPosZero())
23774 return N->getOperand(1);
23775 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23776 if (C->getValueAPF().isPosZero())
23777 return N->getOperand(1);
23778 return SDValue();
23779 }
23781 static SDValue PerformBTCombine(SDNode *N,
23782 SelectionDAG &DAG,
23783 TargetLowering::DAGCombinerInfo &DCI) {
23784 // BT ignores high bits in the bit index operand.
23785 SDValue Op1 = N->getOperand(1);
23786 if (Op1.hasOneUse()) {
23787 unsigned BitWidth = Op1.getValueSizeInBits();
23788 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
23789 APInt KnownZero, KnownOne;
23790 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
23791 !DCI.isBeforeLegalizeOps());
23792 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23793 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
23794 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
23795 DCI.CommitTargetLoweringOpt(TLO);
23796 }
23797 return SDValue();
23798 }
23800 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
23801 SDValue Op = N->getOperand(0);
23802 if (Op.getOpcode() == ISD::BITCAST)
23803 Op = Op.getOperand(0);
23804 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
23805 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
23806 VT.getVectorElementType().getSizeInBits() ==
23807 OpVT.getVectorElementType().getSizeInBits()) {
23808 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
23809 }
23810 return SDValue();
23811 }
23813 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
23814 const X86Subtarget *Subtarget) {
23815 EVT VT = N->getValueType(0);
23816 if (!VT.isVector())
23817 return SDValue();
23819 SDValue N0 = N->getOperand(0);
23820 SDValue N1 = N->getOperand(1);
23821 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
23822 SDLoc dl(N);
23824 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
23825 // both SSE and AVX2 since there is no sign-extended shift right
23826 // operation on a vector with 64-bit elements.
23827 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
23828 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
23829 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
23830 N0.getOpcode() == ISD::SIGN_EXTEND)) {
23831 SDValue N00 = N0.getOperand(0);
23833 // EXTLOAD has a better solution on AVX2,
23834 // it may be replaced with X86ISD::VSEXT node.
23835 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
23836 if (!ISD::isNormalLoad(N00.getNode()))
23837 return SDValue();
23839 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
23840 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
23841 N00, N1);
23842 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
23843 }
23844 }
23845 return SDValue();
23846 }
23848 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
23849 TargetLowering::DAGCombinerInfo &DCI,
23850 const X86Subtarget *Subtarget) {
23851 if (!DCI.isBeforeLegalizeOps())
23852 return SDValue();
23854 if (!Subtarget->hasFp256())
23855 return SDValue();
23857 EVT VT = N->getValueType(0);
23858 if (VT.isVector() && VT.getSizeInBits() == 256) {
23859 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23860 if (R.getNode())
23861 return R;
23862 }
23864 return SDValue();
23865 }
23867 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
23868 const X86Subtarget* Subtarget) {
23869 SDLoc dl(N);
23870 EVT VT = N->getValueType(0);
23872 // Let legalize expand this if it isn't a legal type yet.
23873 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
23874 return SDValue();
23876 EVT ScalarVT = VT.getScalarType();
23877 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
23878 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
23879 return SDValue();
23881 SDValue A = N->getOperand(0);
23882 SDValue B = N->getOperand(1);
23883 SDValue C = N->getOperand(2);
23885 bool NegA = (A.getOpcode() == ISD::FNEG);
23886 bool NegB = (B.getOpcode() == ISD::FNEG);
23887 bool NegC = (C.getOpcode() == ISD::FNEG);
23889 // Negative multiplication when NegA xor NegB
23890 bool NegMul = (NegA != NegB);
23891 if (NegA)
23892 A = A.getOperand(0);
23893 if (NegB)
23894 B = B.getOperand(0);
23895 if (NegC)
23896 C = C.getOperand(0);
23898 unsigned Opcode;
23899 if (!NegMul)
23900 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
23901 else
23902 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
23904 return DAG.getNode(Opcode, dl, VT, A, B, C);
23905 }
23907 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
23908 TargetLowering::DAGCombinerInfo &DCI,
23909 const X86Subtarget *Subtarget) {
23910 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
23911 // (and (i32 x86isd::setcc_carry), 1)
23912 // This eliminates the zext. This transformation is necessary because
23913 // ISD::SETCC is always legalized to i8.
23914 SDLoc dl(N);
23915 SDValue N0 = N->getOperand(0);
23916 EVT VT = N->getValueType(0);
23918 if (N0.getOpcode() == ISD::AND &&
23919 N0.hasOneUse() &&
23920 N0.getOperand(0).hasOneUse()) {
23921 SDValue N00 = N0.getOperand(0);
23922 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23923 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23924 if (!C || C->getZExtValue() != 1)
23925 return SDValue();
23926 return DAG.getNode(ISD::AND, dl, VT,
23927 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23928 N00.getOperand(0), N00.getOperand(1)),
23929 DAG.getConstant(1, VT));
23930 }
23931 }
23933 if (N0.getOpcode() == ISD::TRUNCATE &&
23934 N0.hasOneUse() &&
23935 N0.getOperand(0).hasOneUse()) {
23936 SDValue N00 = N0.getOperand(0);
23937 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23938 return DAG.getNode(ISD::AND, dl, VT,
23939 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23940 N00.getOperand(0), N00.getOperand(1)),
23941 DAG.getConstant(1, VT));
23942 }
23943 }
23944 if (VT.is256BitVector()) {
23945 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23946 if (R.getNode())
23947 return R;
23948 }
23950 return SDValue();
23951 }
23953 // Optimize x == -y --> x+y == 0
23954 // x != -y --> x+y != 0
23955 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
23956 const X86Subtarget* Subtarget) {
23957 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
23958 SDValue LHS = N->getOperand(0);
23959 SDValue RHS = N->getOperand(1);
23960 EVT VT = N->getValueType(0);
23961 SDLoc DL(N);
23963 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
23964 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
23965 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
23966 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23967 LHS.getValueType(), RHS, LHS.getOperand(1));
23968 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23969 addV, DAG.getConstant(0, addV.getValueType()), CC);
23970 }
23971 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
23972 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
23973 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
23974 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23975 RHS.getValueType(), LHS, RHS.getOperand(1));
23976 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23977 addV, DAG.getConstant(0, addV.getValueType()), CC);
23978 }
23980 if (VT.getScalarType() == MVT::i1) {
23981 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
23982 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23983 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
23984 if (!IsSEXT0 && !IsVZero0)
23985 return SDValue();
23986 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
23987 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23988 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
23990 if (!IsSEXT1 && !IsVZero1)
23991 return SDValue();
23993 if (IsSEXT0 && IsVZero1) {
23994 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
23995 if (CC == ISD::SETEQ)
23996 return DAG.getNOT(DL, LHS.getOperand(0), VT);
23997 return LHS.getOperand(0);
23998 }
23999 if (IsSEXT1 && IsVZero0) {
24000 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
24001 if (CC == ISD::SETEQ)
24002 return DAG.getNOT(DL, RHS.getOperand(0), VT);
24003 return RHS.getOperand(0);
24004 }
24005 }
24007 return SDValue();
24008 }
24010 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
24011 const X86Subtarget *Subtarget) {
24012 SDLoc dl(N);
24013 MVT VT = N->getOperand(1)->getSimpleValueType(0);
24014 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
24015 "X86insertps is only defined for v4x32");
24017 SDValue Ld = N->getOperand(1);
24018 if (MayFoldLoad(Ld)) {
24019 // Extract the countS bits from the immediate so we can get the proper
24020 // address when narrowing the vector load to a specific element.
24021 // When the second source op is a memory address, interps doesn't use
24022 // countS and just gets an f32 from that address.
24023 unsigned DestIndex =
24024 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
24025 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
24026 } else
24027 return SDValue();
24029 // Create this as a scalar to vector to match the instruction pattern.
24030 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
24031 // countS bits are ignored when loading from memory on insertps, which
24032 // means we don't need to explicitly set them to 0.
24033 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
24034 LoadScalarToVector, N->getOperand(2));
24035 }
24037 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
24038 // as "sbb reg,reg", since it can be extended without zext and produces
24039 // an all-ones bit which is more useful than 0/1 in some cases.
24040 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
24041 MVT VT) {
24042 if (VT == MVT::i8)
24043 return DAG.getNode(ISD::AND, DL, VT,
24044 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24045 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
24046 DAG.getConstant(1, VT));
24047 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
24048 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
24049 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24050 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
24051 }
24053 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
24054 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
24055 TargetLowering::DAGCombinerInfo &DCI,
24056 const X86Subtarget *Subtarget) {
24057 SDLoc DL(N);
24058 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
24059 SDValue EFLAGS = N->getOperand(1);
24061 if (CC == X86::COND_A) {
24062 // Try to convert COND_A into COND_B in an attempt to facilitate
24063 // materializing "setb reg".
24064 //
24065 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
24066 // cannot take an immediate as its first operand.
24067 //
24068 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
24069 EFLAGS.getValueType().isInteger() &&
24070 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
24071 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
24072 EFLAGS.getNode()->getVTList(),
24073 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
24074 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
24075 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
24076 }
24077 }
24079 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
24080 // a zext and produces an all-ones bit which is more useful than 0/1 in some
24081 // cases.
24082 if (CC == X86::COND_B)
24083 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
24085 SDValue Flags;
24087 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24088 if (Flags.getNode()) {
24089 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24090 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
24091 }
24093 return SDValue();
24094 }
24096 // Optimize branch condition evaluation.
24097 //
24098 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
24099 TargetLowering::DAGCombinerInfo &DCI,
24100 const X86Subtarget *Subtarget) {
24101 SDLoc DL(N);
24102 SDValue Chain = N->getOperand(0);
24103 SDValue Dest = N->getOperand(1);
24104 SDValue EFLAGS = N->getOperand(3);
24105 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
24107 SDValue Flags;
24109 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24110 if (Flags.getNode()) {
24111 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24112 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
24113 Flags);
24114 }
24116 return SDValue();
24117 }
24119 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
24120 SelectionDAG &DAG) {
24121 // Take advantage of vector comparisons producing 0 or -1 in each lane to
24122 // optimize away operation when it's from a constant.
24123 //
24124 // The general transformation is:
24125 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
24126 // AND(VECTOR_CMP(x,y), constant2)
24127 // constant2 = UNARYOP(constant)
24129 // Early exit if this isn't a vector operation, the operand of the
24130 // unary operation isn't a bitwise AND, or if the sizes of the operations
24131 // aren't the same.
24132 EVT VT = N->getValueType(0);
24133 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
24134 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
24135 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
24136 return SDValue();
24138 // Now check that the other operand of the AND is a constant. We could
24139 // make the transformation for non-constant splats as well, but it's unclear
24140 // that would be a benefit as it would not eliminate any operations, just
24141 // perform one more step in scalar code before moving to the vector unit.
24142 if (BuildVectorSDNode *BV =
24143 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
24144 // Bail out if the vector isn't a constant.
24145 if (!BV->isConstant())
24146 return SDValue();
24148 // Everything checks out. Build up the new and improved node.
24149 SDLoc DL(N);
24150 EVT IntVT = BV->getValueType(0);
24151 // Create a new constant of the appropriate type for the transformed
24152 // DAG.
24153 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
24154 // The AND node needs bitcasts to/from an integer vector type around it.
24155 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
24156 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
24157 N->getOperand(0)->getOperand(0), MaskConst);
24158 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
24159 return Res;
24160 }
24162 return SDValue();
24163 }
24165 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
24166 const X86TargetLowering *XTLI) {
24167 // First try to optimize away the conversion entirely when it's
24168 // conditionally from a constant. Vectors only.
24169 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
24170 if (Res != SDValue())
24171 return Res;
24173 // Now move on to more general possibilities.
24174 SDValue Op0 = N->getOperand(0);
24175 EVT InVT = Op0->getValueType(0);
24177 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
24178 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
24179 SDLoc dl(N);
24180 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
24181 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
24182 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
24183 }
24185 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
24186 // a 32-bit target where SSE doesn't support i64->FP operations.
24187 if (Op0.getOpcode() == ISD::LOAD) {
24188 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
24189 EVT VT = Ld->getValueType(0);
24190 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
24191 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
24192 !XTLI->getSubtarget()->is64Bit() &&
24193 VT == MVT::i64) {
24194 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
24195 Ld->getChain(), Op0, DAG);
24196 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
24197 return FILDChain;
24198 }
24199 }
24200 return SDValue();
24201 }
24203 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
24204 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
24205 X86TargetLowering::DAGCombinerInfo &DCI) {
24206 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
24207 // the result is either zero or one (depending on the input carry bit).
24208 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
24209 if (X86::isZeroNode(N->getOperand(0)) &&
24210 X86::isZeroNode(N->getOperand(1)) &&
24211 // We don't have a good way to replace an EFLAGS use, so only do this when
24212 // dead right now.
24213 SDValue(N, 1).use_empty()) {
24214 SDLoc DL(N);
24215 EVT VT = N->getValueType(0);
24216 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
24217 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
24218 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
24219 DAG.getConstant(X86::COND_B,MVT::i8),
24220 N->getOperand(2)),
24221 DAG.getConstant(1, VT));
24222 return DCI.CombineTo(N, Res1, CarryOut);
24223 }
24225 return SDValue();
24226 }
24228 // fold (add Y, (sete X, 0)) -> adc 0, Y
24229 // (add Y, (setne X, 0)) -> sbb -1, Y
24230 // (sub (sete X, 0), Y) -> sbb 0, Y
24231 // (sub (setne X, 0), Y) -> adc -1, Y
24232 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
24233 SDLoc DL(N);
24235 // Look through ZExts.
24236 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
24237 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
24238 return SDValue();
24240 SDValue SetCC = Ext.getOperand(0);
24241 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
24242 return SDValue();
24244 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
24245 if (CC != X86::COND_E && CC != X86::COND_NE)
24246 return SDValue();
24248 SDValue Cmp = SetCC.getOperand(1);
24249 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
24250 !X86::isZeroNode(Cmp.getOperand(1)) ||
24251 !Cmp.getOperand(0).getValueType().isInteger())
24252 return SDValue();
24254 SDValue CmpOp0 = Cmp.getOperand(0);
24255 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
24256 DAG.getConstant(1, CmpOp0.getValueType()));
24258 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
24259 if (CC == X86::COND_NE)
24260 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
24261 DL, OtherVal.getValueType(), OtherVal,
24262 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
24263 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
24264 DL, OtherVal.getValueType(), OtherVal,
24265 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
24266 }
24268 /// PerformADDCombine - Do target-specific dag combines on integer adds.
24269 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
24270 const X86Subtarget *Subtarget) {
24271 EVT VT = N->getValueType(0);
24272 SDValue Op0 = N->getOperand(0);
24273 SDValue Op1 = N->getOperand(1);
24275 // Try to synthesize horizontal adds from adds of shuffles.
24276 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24277 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24278 isHorizontalBinOp(Op0, Op1, true))
24279 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
24281 return OptimizeConditionalInDecrement(N, DAG);
24282 }
24284 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
24285 const X86Subtarget *Subtarget) {
24286 SDValue Op0 = N->getOperand(0);
24287 SDValue Op1 = N->getOperand(1);
24289 // X86 can't encode an immediate LHS of a sub. See if we can push the
24290 // negation into a preceding instruction.
24291 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
24292 // If the RHS of the sub is a XOR with one use and a constant, invert the
24293 // immediate. Then add one to the LHS of the sub so we can turn
24294 // X-Y -> X+~Y+1, saving one register.
24295 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
24296 isa<ConstantSDNode>(Op1.getOperand(1))) {
24297 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
24298 EVT VT = Op0.getValueType();
24299 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
24300 Op1.getOperand(0),
24301 DAG.getConstant(~XorC, VT));
24302 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
24303 DAG.getConstant(C->getAPIntValue()+1, VT));
24304 }
24305 }
24307 // Try to synthesize horizontal adds from adds of shuffles.
24308 EVT VT = N->getValueType(0);
24309 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24310 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24311 isHorizontalBinOp(Op0, Op1, true))
24312 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
24314 return OptimizeConditionalInDecrement(N, DAG);
24315 }
24317 /// performVZEXTCombine - Performs build vector combines
24318 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
24319 TargetLowering::DAGCombinerInfo &DCI,
24320 const X86Subtarget *Subtarget) {
24321 // (vzext (bitcast (vzext (x)) -> (vzext x)
24322 SDValue In = N->getOperand(0);
24323 while (In.getOpcode() == ISD::BITCAST)
24324 In = In.getOperand(0);
24326 if (In.getOpcode() != X86ISD::VZEXT)
24327 return SDValue();
24329 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
24330 In.getOperand(0));
24331 }
24333 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
24334 DAGCombinerInfo &DCI) const {
24335 SelectionDAG &DAG = DCI.DAG;
24336 switch (N->getOpcode()) {
24337 default: break;
24338 case ISD::EXTRACT_VECTOR_ELT:
24339 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
24340 case ISD::VSELECT:
24341 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
24342 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
24343 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
24344 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
24345 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
24346 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
24347 case ISD::SHL:
24348 case ISD::SRA:
24349 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
24350 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
24351 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
24352 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
24353 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
24354 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
24355 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
24356 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
24357 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
24358 case X86ISD::FXOR:
24359 case X86ISD::FOR: return PerformFORCombine(N, DAG);
24360 case X86ISD::FMIN:
24361 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
24362 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
24363 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
24364 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
24365 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
24366 case ISD::ANY_EXTEND:
24367 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
24368 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
24369 case ISD::SIGN_EXTEND_INREG:
24370 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
24371 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
24372 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
24373 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
24374 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
24375 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
24376 case X86ISD::SHUFP: // Handle all target specific shuffles
24377 case X86ISD::PALIGNR:
24378 case X86ISD::UNPCKH:
24379 case X86ISD::UNPCKL:
24380 case X86ISD::MOVHLPS:
24381 case X86ISD::MOVLHPS:
24382 case X86ISD::PSHUFB:
24383 case X86ISD::PSHUFD:
24384 case X86ISD::PSHUFHW:
24385 case X86ISD::PSHUFLW:
24386 case X86ISD::MOVSS:
24387 case X86ISD::MOVSD:
24388 case X86ISD::VPERMILPI:
24389 case X86ISD::VPERM2X128:
24390 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
24391 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
24392 case ISD::INTRINSIC_WO_CHAIN:
24393 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
24394 case X86ISD::INSERTPS:
24395 return PerformINSERTPSCombine(N, DAG, Subtarget);
24396 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
24397 }
24399 return SDValue();
24400 }
24402 /// isTypeDesirableForOp - Return true if the target has native support for
24403 /// the specified value type and it is 'desirable' to use the type for the
24404 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
24405 /// instruction encodings are longer and some i16 instructions are slow.
24406 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
24407 if (!isTypeLegal(VT))
24408 return false;
24409 if (VT != MVT::i16)
24410 return true;
24412 switch (Opc) {
24413 default:
24414 return true;
24415 case ISD::LOAD:
24416 case ISD::SIGN_EXTEND:
24417 case ISD::ZERO_EXTEND:
24418 case ISD::ANY_EXTEND:
24419 case ISD::SHL:
24420 case ISD::SRL:
24421 case ISD::SUB:
24422 case ISD::ADD:
24423 case ISD::MUL:
24424 case ISD::AND:
24425 case ISD::OR:
24426 case ISD::XOR:
24427 return false;
24428 }
24429 }
24431 /// IsDesirableToPromoteOp - This method query the target whether it is
24432 /// beneficial for dag combiner to promote the specified node. If true, it
24433 /// should return the desired promotion type by reference.
24434 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
24435 EVT VT = Op.getValueType();
24436 if (VT != MVT::i16)
24437 return false;
24439 bool Promote = false;
24440 bool Commute = false;
24441 switch (Op.getOpcode()) {
24442 default: break;
24443 case ISD::LOAD: {
24444 LoadSDNode *LD = cast<LoadSDNode>(Op);
24445 // If the non-extending load has a single use and it's not live out, then it
24446 // might be folded.
24447 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
24448 Op.hasOneUse()*/) {
24449 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
24450 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
24451 // The only case where we'd want to promote LOAD (rather then it being
24452 // promoted as an operand is when it's only use is liveout.
24453 if (UI->getOpcode() != ISD::CopyToReg)
24454 return false;
24455 }
24456 }
24457 Promote = true;
24458 break;
24459 }
24460 case ISD::SIGN_EXTEND:
24461 case ISD::ZERO_EXTEND:
24462 case ISD::ANY_EXTEND:
24463 Promote = true;
24464 break;
24465 case ISD::SHL:
24466 case ISD::SRL: {
24467 SDValue N0 = Op.getOperand(0);
24468 // Look out for (store (shl (load), x)).
24469 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
24470 return false;
24471 Promote = true;
24472 break;
24473 }
24474 case ISD::ADD:
24475 case ISD::MUL:
24476 case ISD::AND:
24477 case ISD::OR:
24478 case ISD::XOR:
24479 Commute = true;
24480 // fallthrough
24481 case ISD::SUB: {
24482 SDValue N0 = Op.getOperand(0);
24483 SDValue N1 = Op.getOperand(1);
24484 if (!Commute && MayFoldLoad(N1))
24485 return false;
24486 // Avoid disabling potential load folding opportunities.
24487 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
24488 return false;
24489 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
24490 return false;
24491 Promote = true;
24492 }
24493 }
24495 PVT = MVT::i32;
24496 return Promote;
24497 }
24499 //===----------------------------------------------------------------------===//
24500 // X86 Inline Assembly Support
24501 //===----------------------------------------------------------------------===//
24503 namespace {
24504 // Helper to match a string separated by whitespace.
24505 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
24506 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
24508 for (unsigned i = 0, e = args.size(); i != e; ++i) {
24509 StringRef piece(*args[i]);
24510 if (!s.startswith(piece)) // Check if the piece matches.
24511 return false;
24513 s = s.substr(piece.size());
24514 StringRef::size_type pos = s.find_first_not_of(" \t");
24515 if (pos == 0) // We matched a prefix.
24516 return false;
24518 s = s.substr(pos);
24519 }
24521 return s.empty();
24522 }
24523 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
24524 }
24526 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
24528 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
24529 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
24530 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
24531 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
24533 if (AsmPieces.size() == 3)
24534 return true;
24535 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
24536 return true;
24537 }
24538 }
24539 return false;
24540 }
24542 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
24543 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
24545 std::string AsmStr = IA->getAsmString();
24547 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
24548 if (!Ty || Ty->getBitWidth() % 16 != 0)
24549 return false;
24551 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
24552 SmallVector<StringRef, 4> AsmPieces;
24553 SplitString(AsmStr, AsmPieces, ";\n");
24555 switch (AsmPieces.size()) {
24556 default: return false;
24557 case 1:
24558 // FIXME: this should verify that we are targeting a 486 or better. If not,
24559 // we will turn this bswap into something that will be lowered to logical
24560 // ops instead of emitting the bswap asm. For now, we don't support 486 or
24561 // lower so don't worry about this.
24562 // bswap $0
24563 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
24564 matchAsm(AsmPieces[0], "bswapl", "$0") ||
24565 matchAsm(AsmPieces[0], "bswapq", "$0") ||
24566 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
24567 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
24568 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
24569 // No need to check constraints, nothing other than the equivalent of
24570 // "=r,0" would be valid here.
24571 return IntrinsicLowering::LowerToByteSwap(CI);
24572 }
24574 // rorw $$8, ${0:w} --> llvm.bswap.i16
24575 if (CI->getType()->isIntegerTy(16) &&
24576 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24577 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
24578 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
24579 AsmPieces.clear();
24580 const std::string &ConstraintsStr = IA->getConstraintString();
24581 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24582 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24583 if (clobbersFlagRegisters(AsmPieces))
24584 return IntrinsicLowering::LowerToByteSwap(CI);
24585 }
24586 break;
24587 case 3:
24588 if (CI->getType()->isIntegerTy(32) &&
24589 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24590 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
24591 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
24592 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
24593 AsmPieces.clear();
24594 const std::string &ConstraintsStr = IA->getConstraintString();
24595 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24596 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24597 if (clobbersFlagRegisters(AsmPieces))
24598 return IntrinsicLowering::LowerToByteSwap(CI);
24599 }
24601 if (CI->getType()->isIntegerTy(64)) {
24602 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
24603 if (Constraints.size() >= 2 &&
24604 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
24605 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
24606 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
24607 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
24608 matchAsm(AsmPieces[1], "bswap", "%edx") &&
24609 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
24610 return IntrinsicLowering::LowerToByteSwap(CI);
24611 }
24612 }
24613 break;
24614 }
24615 return false;
24616 }
24618 /// getConstraintType - Given a constraint letter, return the type of
24619 /// constraint it is for this target.
24620 X86TargetLowering::ConstraintType
24621 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
24622 if (Constraint.size() == 1) {
24623 switch (Constraint[0]) {
24624 case 'R':
24625 case 'q':
24626 case 'Q':
24627 case 'f':
24628 case 't':
24629 case 'u':
24630 case 'y':
24631 case 'x':
24632 case 'Y':
24633 case 'l':
24634 return C_RegisterClass;
24635 case 'a':
24636 case 'b':
24637 case 'c':
24638 case 'd':
24639 case 'S':
24640 case 'D':
24641 case 'A':
24642 return C_Register;
24643 case 'I':
24644 case 'J':
24645 case 'K':
24646 case 'L':
24647 case 'M':
24648 case 'N':
24649 case 'G':
24650 case 'C':
24651 case 'e':
24652 case 'Z':
24653 return C_Other;
24654 default:
24655 break;
24656 }
24657 }
24658 return TargetLowering::getConstraintType(Constraint);
24659 }
24661 /// Examine constraint type and operand type and determine a weight value.
24662 /// This object must already have been set up with the operand type
24663 /// and the current alternative constraint selected.
24664 TargetLowering::ConstraintWeight
24665 X86TargetLowering::getSingleConstraintMatchWeight(
24666 AsmOperandInfo &info, const char *constraint) const {
24667 ConstraintWeight weight = CW_Invalid;
24668 Value *CallOperandVal = info.CallOperandVal;
24669 // If we don't have a value, we can't do a match,
24670 // but allow it at the lowest weight.
24671 if (!CallOperandVal)
24672 return CW_Default;
24673 Type *type = CallOperandVal->getType();
24674 // Look at the constraint type.
24675 switch (*constraint) {
24676 default:
24677 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
24678 case 'R':
24679 case 'q':
24680 case 'Q':
24681 case 'a':
24682 case 'b':
24683 case 'c':
24684 case 'd':
24685 case 'S':
24686 case 'D':
24687 case 'A':
24688 if (CallOperandVal->getType()->isIntegerTy())
24689 weight = CW_SpecificReg;
24690 break;
24691 case 'f':
24692 case 't':
24693 case 'u':
24694 if (type->isFloatingPointTy())
24695 weight = CW_SpecificReg;
24696 break;
24697 case 'y':
24698 if (type->isX86_MMXTy() && Subtarget->hasMMX())
24699 weight = CW_SpecificReg;
24700 break;
24701 case 'x':
24702 case 'Y':
24703 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
24704 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
24705 weight = CW_Register;
24706 break;
24707 case 'I':
24708 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
24709 if (C->getZExtValue() <= 31)
24710 weight = CW_Constant;
24711 }
24712 break;
24713 case 'J':
24714 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24715 if (C->getZExtValue() <= 63)
24716 weight = CW_Constant;
24717 }
24718 break;
24719 case 'K':
24720 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24721 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
24722 weight = CW_Constant;
24723 }
24724 break;
24725 case 'L':
24726 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24727 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
24728 weight = CW_Constant;
24729 }
24730 break;
24731 case 'M':
24732 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24733 if (C->getZExtValue() <= 3)
24734 weight = CW_Constant;
24735 }
24736 break;
24737 case 'N':
24738 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24739 if (C->getZExtValue() <= 0xff)
24740 weight = CW_Constant;
24741 }
24742 break;
24743 case 'G':
24744 case 'C':
24745 if (dyn_cast<ConstantFP>(CallOperandVal)) {
24746 weight = CW_Constant;
24747 }
24748 break;
24749 case 'e':
24750 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24751 if ((C->getSExtValue() >= -0x80000000LL) &&
24752 (C->getSExtValue() <= 0x7fffffffLL))
24753 weight = CW_Constant;
24754 }
24755 break;
24756 case 'Z':
24757 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24758 if (C->getZExtValue() <= 0xffffffff)
24759 weight = CW_Constant;
24760 }
24761 break;
24762 }
24763 return weight;
24764 }
24766 /// LowerXConstraint - try to replace an X constraint, which matches anything,
24767 /// with another that has more specific requirements based on the type of the
24768 /// corresponding operand.
24769 const char *X86TargetLowering::
24770 LowerXConstraint(EVT ConstraintVT) const {
24771 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
24772 // 'f' like normal targets.
24773 if (ConstraintVT.isFloatingPoint()) {
24774 if (Subtarget->hasSSE2())
24775 return "Y";
24776 if (Subtarget->hasSSE1())
24777 return "x";
24778 }
24780 return TargetLowering::LowerXConstraint(ConstraintVT);
24781 }
24783 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
24784 /// vector. If it is invalid, don't add anything to Ops.
24785 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
24786 std::string &Constraint,
24787 std::vector<SDValue>&Ops,
24788 SelectionDAG &DAG) const {
24789 SDValue Result;
24791 // Only support length 1 constraints for now.
24792 if (Constraint.length() > 1) return;
24794 char ConstraintLetter = Constraint[0];
24795 switch (ConstraintLetter) {
24796 default: break;
24797 case 'I':
24798 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24799 if (C->getZExtValue() <= 31) {
24800 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24801 break;
24802 }
24803 }
24804 return;
24805 case 'J':
24806 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24807 if (C->getZExtValue() <= 63) {
24808 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24809 break;
24810 }
24811 }
24812 return;
24813 case 'K':
24814 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24815 if (isInt<8>(C->getSExtValue())) {
24816 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24817 break;
24818 }
24819 }
24820 return;
24821 case 'N':
24822 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24823 if (C->getZExtValue() <= 255) {
24824 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24825 break;
24826 }
24827 }
24828 return;
24829 case 'e': {
24830 // 32-bit signed value
24831 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24832 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24833 C->getSExtValue())) {
24834 // Widen to 64 bits here to get it sign extended.
24835 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
24836 break;
24837 }
24838 // FIXME gcc accepts some relocatable values here too, but only in certain
24839 // memory models; it's complicated.
24840 }
24841 return;
24842 }
24843 case 'Z': {
24844 // 32-bit unsigned value
24845 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24846 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24847 C->getZExtValue())) {
24848 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24849 break;
24850 }
24851 }
24852 // FIXME gcc accepts some relocatable values here too, but only in certain
24853 // memory models; it's complicated.
24854 return;
24855 }
24856 case 'i': {
24857 // Literal immediates are always ok.
24858 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
24859 // Widen to 64 bits here to get it sign extended.
24860 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
24861 break;
24862 }
24864 // In any sort of PIC mode addresses need to be computed at runtime by
24865 // adding in a register or some sort of table lookup. These can't
24866 // be used as immediates.
24867 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
24868 return;
24870 // If we are in non-pic codegen mode, we allow the address of a global (with
24871 // an optional displacement) to be used with 'i'.
24872 GlobalAddressSDNode *GA = nullptr;
24873 int64_t Offset = 0;
24875 // Match either (GA), (GA+C), (GA+C1+C2), etc.
24876 while (1) {
24877 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
24878 Offset += GA->getOffset();
24879 break;
24880 } else if (Op.getOpcode() == ISD::ADD) {
24881 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24882 Offset += C->getZExtValue();
24883 Op = Op.getOperand(0);
24884 continue;
24885 }
24886 } else if (Op.getOpcode() == ISD::SUB) {
24887 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24888 Offset += -C->getZExtValue();
24889 Op = Op.getOperand(0);
24890 continue;
24891 }
24892 }
24894 // Otherwise, this isn't something we can handle, reject it.
24895 return;
24896 }
24898 const GlobalValue *GV = GA->getGlobal();
24899 // If we require an extra load to get this address, as in PIC mode, we
24900 // can't accept it.
24901 if (isGlobalStubReference(
24902 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
24903 return;
24905 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
24906 GA->getValueType(0), Offset);
24907 break;
24908 }
24909 }
24911 if (Result.getNode()) {
24912 Ops.push_back(Result);
24913 return;
24914 }
24915 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
24916 }
24918 std::pair<unsigned, const TargetRegisterClass*>
24919 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
24920 MVT VT) const {
24921 // First, see if this is a constraint that directly corresponds to an LLVM
24922 // register class.
24923 if (Constraint.size() == 1) {
24924 // GCC Constraint Letters
24925 switch (Constraint[0]) {
24926 default: break;
24927 // TODO: Slight differences here in allocation order and leaving
24928 // RIP in the class. Do they matter any more here than they do
24929 // in the normal allocation?
24930 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
24931 if (Subtarget->is64Bit()) {
24932 if (VT == MVT::i32 || VT == MVT::f32)
24933 return std::make_pair(0U, &X86::GR32RegClass);
24934 if (VT == MVT::i16)
24935 return std::make_pair(0U, &X86::GR16RegClass);
24936 if (VT == MVT::i8 || VT == MVT::i1)
24937 return std::make_pair(0U, &X86::GR8RegClass);
24938 if (VT == MVT::i64 || VT == MVT::f64)
24939 return std::make_pair(0U, &X86::GR64RegClass);
24940 break;
24941 }
24942 // 32-bit fallthrough
24943 case 'Q': // Q_REGS
24944 if (VT == MVT::i32 || VT == MVT::f32)
24945 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
24946 if (VT == MVT::i16)
24947 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
24948 if (VT == MVT::i8 || VT == MVT::i1)
24949 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
24950 if (VT == MVT::i64)
24951 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
24952 break;
24953 case 'r': // GENERAL_REGS
24954 case 'l': // INDEX_REGS
24955 if (VT == MVT::i8 || VT == MVT::i1)
24956 return std::make_pair(0U, &X86::GR8RegClass);
24957 if (VT == MVT::i16)
24958 return std::make_pair(0U, &X86::GR16RegClass);
24959 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
24960 return std::make_pair(0U, &X86::GR32RegClass);
24961 return std::make_pair(0U, &X86::GR64RegClass);
24962 case 'R': // LEGACY_REGS
24963 if (VT == MVT::i8 || VT == MVT::i1)
24964 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
24965 if (VT == MVT::i16)
24966 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
24967 if (VT == MVT::i32 || !Subtarget->is64Bit())
24968 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
24969 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
24970 case 'f': // FP Stack registers.
24971 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
24972 // value to the correct fpstack register class.
24973 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
24974 return std::make_pair(0U, &X86::RFP32RegClass);
24975 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
24976 return std::make_pair(0U, &X86::RFP64RegClass);
24977 return std::make_pair(0U, &X86::RFP80RegClass);
24978 case 'y': // MMX_REGS if MMX allowed.
24979 if (!Subtarget->hasMMX()) break;
24980 return std::make_pair(0U, &X86::VR64RegClass);
24981 case 'Y': // SSE_REGS if SSE2 allowed
24982 if (!Subtarget->hasSSE2()) break;
24983 // FALL THROUGH.
24984 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
24985 if (!Subtarget->hasSSE1()) break;
24987 switch (VT.SimpleTy) {
24988 default: break;
24989 // Scalar SSE types.
24990 case MVT::f32:
24991 case MVT::i32:
24992 return std::make_pair(0U, &X86::FR32RegClass);
24993 case MVT::f64:
24994 case MVT::i64:
24995 return std::make_pair(0U, &X86::FR64RegClass);
24996 // Vector types.
24997 case MVT::v16i8:
24998 case MVT::v8i16:
24999 case MVT::v4i32:
25000 case MVT::v2i64:
25001 case MVT::v4f32:
25002 case MVT::v2f64:
25003 return std::make_pair(0U, &X86::VR128RegClass);
25004 // AVX types.
25005 case MVT::v32i8:
25006 case MVT::v16i16:
25007 case MVT::v8i32:
25008 case MVT::v4i64:
25009 case MVT::v8f32:
25010 case MVT::v4f64:
25011 return std::make_pair(0U, &X86::VR256RegClass);
25012 case MVT::v8f64:
25013 case MVT::v16f32:
25014 case MVT::v16i32:
25015 case MVT::v8i64:
25016 return std::make_pair(0U, &X86::VR512RegClass);
25017 }
25018 break;
25019 }
25020 }
25022 // Use the default implementation in TargetLowering to convert the register
25023 // constraint into a member of a register class.
25024 std::pair<unsigned, const TargetRegisterClass*> Res;
25025 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
25027 // Not found as a standard register?
25028 if (!Res.second) {
25029 // Map st(0) -> st(7) -> ST0
25030 if (Constraint.size() == 7 && Constraint[0] == '{' &&
25031 tolower(Constraint[1]) == 's' &&
25032 tolower(Constraint[2]) == 't' &&
25033 Constraint[3] == '(' &&
25034 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
25035 Constraint[5] == ')' &&
25036 Constraint[6] == '}') {
25038 Res.first = X86::FP0+Constraint[4]-'0';
25039 Res.second = &X86::RFP80RegClass;
25040 return Res;
25041 }
25043 // GCC allows "st(0)" to be called just plain "st".
25044 if (StringRef("{st}").equals_lower(Constraint)) {
25045 Res.first = X86::FP0;
25046 Res.second = &X86::RFP80RegClass;
25047 return Res;
25048 }
25050 // flags -> EFLAGS
25051 if (StringRef("{flags}").equals_lower(Constraint)) {
25052 Res.first = X86::EFLAGS;
25053 Res.second = &X86::CCRRegClass;
25054 return Res;
25055 }
25057 // 'A' means EAX + EDX.
25058 if (Constraint == "A") {
25059 Res.first = X86::EAX;
25060 Res.second = &X86::GR32_ADRegClass;
25061 return Res;
25062 }
25063 return Res;
25064 }
25066 // Otherwise, check to see if this is a register class of the wrong value
25067 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
25068 // turn into {ax},{dx}.
25069 if (Res.second->hasType(VT))
25070 return Res; // Correct type already, nothing to do.
25072 // All of the single-register GCC register classes map their values onto
25073 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
25074 // really want an 8-bit or 32-bit register, map to the appropriate register
25075 // class and return the appropriate register.
25076 if (Res.second == &X86::GR16RegClass) {
25077 if (VT == MVT::i8 || VT == MVT::i1) {
25078 unsigned DestReg = 0;
25079 switch (Res.first) {
25080 default: break;
25081 case X86::AX: DestReg = X86::AL; break;
25082 case X86::DX: DestReg = X86::DL; break;
25083 case X86::CX: DestReg = X86::CL; break;
25084 case X86::BX: DestReg = X86::BL; break;
25085 }
25086 if (DestReg) {
25087 Res.first = DestReg;
25088 Res.second = &X86::GR8RegClass;
25089 }
25090 } else if (VT == MVT::i32 || VT == MVT::f32) {
25091 unsigned DestReg = 0;
25092 switch (Res.first) {
25093 default: break;
25094 case X86::AX: DestReg = X86::EAX; break;
25095 case X86::DX: DestReg = X86::EDX; break;
25096 case X86::CX: DestReg = X86::ECX; break;
25097 case X86::BX: DestReg = X86::EBX; break;
25098 case X86::SI: DestReg = X86::ESI; break;
25099 case X86::DI: DestReg = X86::EDI; break;
25100 case X86::BP: DestReg = X86::EBP; break;
25101 case X86::SP: DestReg = X86::ESP; break;
25102 }
25103 if (DestReg) {
25104 Res.first = DestReg;
25105 Res.second = &X86::GR32RegClass;
25106 }
25107 } else if (VT == MVT::i64 || VT == MVT::f64) {
25108 unsigned DestReg = 0;
25109 switch (Res.first) {
25110 default: break;
25111 case X86::AX: DestReg = X86::RAX; break;
25112 case X86::DX: DestReg = X86::RDX; break;
25113 case X86::CX: DestReg = X86::RCX; break;
25114 case X86::BX: DestReg = X86::RBX; break;
25115 case X86::SI: DestReg = X86::RSI; break;
25116 case X86::DI: DestReg = X86::RDI; break;
25117 case X86::BP: DestReg = X86::RBP; break;
25118 case X86::SP: DestReg = X86::RSP; break;
25119 }
25120 if (DestReg) {
25121 Res.first = DestReg;
25122 Res.second = &X86::GR64RegClass;
25123 }
25124 }
25125 } else if (Res.second == &X86::FR32RegClass ||
25126 Res.second == &X86::FR64RegClass ||
25127 Res.second == &X86::VR128RegClass ||
25128 Res.second == &X86::VR256RegClass ||
25129 Res.second == &X86::FR32XRegClass ||
25130 Res.second == &X86::FR64XRegClass ||
25131 Res.second == &X86::VR128XRegClass ||
25132 Res.second == &X86::VR256XRegClass ||
25133 Res.second == &X86::VR512RegClass) {
25134 // Handle references to XMM physical registers that got mapped into the
25135 // wrong class. This can happen with constraints like {xmm0} where the
25136 // target independent register mapper will just pick the first match it can
25137 // find, ignoring the required type.
25139 if (VT == MVT::f32 || VT == MVT::i32)
25140 Res.second = &X86::FR32RegClass;
25141 else if (VT == MVT::f64 || VT == MVT::i64)
25142 Res.second = &X86::FR64RegClass;
25143 else if (X86::VR128RegClass.hasType(VT))
25144 Res.second = &X86::VR128RegClass;
25145 else if (X86::VR256RegClass.hasType(VT))
25146 Res.second = &X86::VR256RegClass;
25147 else if (X86::VR512RegClass.hasType(VT))
25148 Res.second = &X86::VR512RegClass;
25149 }
25151 return Res;
25152 }
25154 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
25155 Type *Ty) const {
25156 // Scaling factors are not free at all.
25157 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
25158 // will take 2 allocations in the out of order engine instead of 1
25159 // for plain addressing mode, i.e. inst (reg1).
25160 // E.g.,
25161 // vaddps (%rsi,%drx), %ymm0, %ymm1
25162 // Requires two allocations (one for the load, one for the computation)
25163 // whereas:
25164 // vaddps (%rsi), %ymm0, %ymm1
25165 // Requires just 1 allocation, i.e., freeing allocations for other operations
25166 // and having less micro operations to execute.
25167 //
25168 // For some X86 architectures, this is even worse because for instance for
25169 // stores, the complex addressing mode forces the instruction to use the
25170 // "load" ports instead of the dedicated "store" port.
25171 // E.g., on Haswell:
25172 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
25173 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
25174 if (isLegalAddressingMode(AM, Ty))
25175 // Scale represents reg2 * scale, thus account for 1
25176 // as soon as we use a second register.
25177 return AM.Scale != 0;
25178 return -1;
25179 }
25181 bool X86TargetLowering::isTargetFTOL() const {
25182 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();
25183 }