1 //===-- X86ISelLowering.cpp - X86 DAG Lowering Implementation -------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the interfaces that X86 uses to lower LLVM code into a
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"
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."),
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."),
74 // Forward declarations.
75 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
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
98 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits()) / vectorWidth)
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,
107 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
108 SDValue Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, ResultVT, Vec,
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);
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);
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)
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
151 unsigned NormalizedIdxVal = (((IdxVal * ElVT.getSizeInBits())/vectorWidth)
154 SDValue VecIdx = DAG.getIntPtrConstant(NormalizedIdxVal);
155 return DAG.getNode(ISD::INSERT_SUBVECTOR, dl, ResultVT, Result, Vec,
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,
167 assert(Vec.getValueType().is128BitVector() && "Unexpected vector size!");
168 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 128);
171 static SDValue Insert256BitVector(SDValue Result, SDValue Vec,
172 unsigned IdxVal, SelectionDAG &DAG,
174 assert(Vec.getValueType().is256BitVector() && "Unexpected vector size!");
175 return InsertSubVector(Result, Vec, IdxVal, DAG, dl, 256);
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,
185 SDValue V = Insert128BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
186 return Insert128BitVector(V, V2, NumElems/2, DAG, dl);
189 static SDValue Concat256BitVectors(SDValue V1, SDValue V2, EVT VT,
190 unsigned NumElems, SelectionDAG &DAG,
192 SDValue V = Insert256BitVector(DAG.getUNDEF(VT), V1, 0, DAG, dl);
193 return Insert256BitVector(V, V2, NumElems/2, DAG, dl);
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();
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");
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();
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.
237 FirstTimeThrough = false;
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);
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);
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);
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);
300 setUseUnderscoreSetJmp(true);
301 setUseUnderscoreLongJmp(true);
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
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);
349 // Promote i1/i8 SINT_TO_FP to larger SINT_TO_FP's, as X86 doesn't have
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);
361 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Custom);
362 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Custom);
365 setOperationAction(ISD::SINT_TO_FP , MVT::i16 , Promote);
366 setOperationAction(ISD::SINT_TO_FP , MVT::i32 , Promote);
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
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);
384 setOperationAction(ISD::FP_TO_SINT , MVT::i16 , Custom);
385 setOperationAction(ISD::FP_TO_SINT , MVT::i32 , Custom);
388 // Handle FP_TO_UINT by promoting the destination to a larger signed
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);
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);
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);
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);
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.
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) {
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);
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
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);
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);
498 if (Subtarget->hasLZCNT()) {
499 // When promoting the i8 variants, force them to i32 for a shorter
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);
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);
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);
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);
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);
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);
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);
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);
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);
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) {
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);
624 if (Subtarget->hasCmpxchg16b()) {
625 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);
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);
634 if (Subtarget->is64Bit()) {
635 setExceptionPointerRegister(X86::RAX);
636 setExceptionSelectorRegister(X86::RDX);
638 setExceptionPointerRegister(X86::EAX);
639 setExceptionSelectorRegister(X86::EDX);
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);
658 // TargetInfo::CharPtrBuiltinVaList
659 setOperationAction(ISD::VAARG , MVT::Other, Expand);
660 setOperationAction(ISD::VACOPY , MVT::Other, Expand);
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
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);
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);
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
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);
776 APFloat TmpFlt = APFloat::getZero(APFloat::x87DoubleExtended);
777 addLegalFPImmediate(TmpFlt); // FLD0
779 addLegalFPImmediate(TmpFlt); // FLD0/FCHS
782 APFloat TmpFlt2(+1.0);
783 TmpFlt2.convert(APFloat::x87DoubleExtended, APFloat::rmNearestTiesToEven,
785 addLegalFPImmediate(TmpFlt2); // FLD1
786 TmpFlt2.changeSign();
787 addLegalFPImmediate(TmpFlt2); // FLD1/FCHS
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);
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);
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);
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.
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);
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()))
1009 // Do not attempt to custom lower non-128-bit vectors
1010 if (!VT.is128BitVector())
1012 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1013 setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
1014 setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Custom);
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);
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())
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);
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);
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
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);
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
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);
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);
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);
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
1311 // In the customized shift lowering, the legal cases in AVX2 will be
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())
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);
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())
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);
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);
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);
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())
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);
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())
1524 setOperationAction(ISD::SELECT, VT, Promote);
1525 AddPromotedToType (ISD::SELECT, VT, MVT::v8i64);
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())
1550 if ( EltSize < 32) {
1551 setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
1552 setOperationAction(ISD::VSELECT, VT, Legal);
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);
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,
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.
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.
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);
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);
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
1616 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1617 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
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);
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();
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();
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);
1696 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
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)
1707 case 8: return MVT::v8i1;
1708 case 16: return MVT::v16i1;
1710 if (Subtarget->hasBWI())
1711 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1713 case 32: return MVT::v32i1;
1714 case 64: return MVT::v64i1;
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)
1723 case 2: return MVT::v2i1;
1724 case 4: return MVT::v4i1;
1725 case 8: return MVT::v8i1;
1727 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1728 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1730 case 8: return MVT::v8i1;
1731 case 16: return MVT::v16i1;
1732 case 32: return MVT::v32i1;
1736 return VT.changeVectorElementTypeToInteger();
1739 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1740 /// the desired ByVal argument alignment.
1741 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1744 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1745 if (VTy->getBitWidth() == 128)
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;
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);
1778 if (Subtarget->hasSSE1())
1779 getMaxByValAlign(Ty, Align);
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.
1795 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1796 unsigned DstAlign, unsigned SrcAlign,
1797 bool IsMemset, bool ZeroMemset,
1799 MachineFunction &MF) const {
1800 const Function *F = MF.getFunction();
1801 if ((!IsMemset || ZeroMemset) &&
1802 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1803 Attribute::NoImplicitFloat)) {
1805 (Subtarget->isUnalignedMemAccessFast() ||
1806 ((DstAlign == 0 || DstAlign >= 16) &&
1807 (SrcAlign == 0 || SrcAlign >= 16)))) {
1809 if (Subtarget->hasInt256())
1811 if (Subtarget->hasFp256())
1814 if (Subtarget->hasSSE2())
1816 if (Subtarget->hasSSE1())
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.
1826 if (Subtarget->is64Bit() && Size >= 8)
1831 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1833 return X86ScalarSSEf32;
1834 else if (VT == MVT::f64)
1835 return X86ScalarSSEf64;
1840 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1845 *Fast = Subtarget->isUnalignedMemAccessFast();
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
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();
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
1871 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1872 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1875 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
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());
1886 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1887 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
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);
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;
1905 switch (VT.SimpleTy) {
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;
1912 RRC = &X86::VR64RegClass;
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:
1919 RRC = &X86::VR128RegClass;
1922 return std::make_pair(RRC, Cost);
1925 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1926 unsigned &Offset) const {
1927 if (!Subtarget->isTargetLinux())
1930 if (Subtarget->is64Bit()) {
1931 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1933 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1945 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1946 unsigned DestAS) const {
1947 assert(SrcAS != DestAS && "Expected different address spaces!");
1949 return SrcAS < 256 && DestAS < 256;
1952 //===----------------------------------------------------------------------===//
1953 // Return Value Calling Convention Implementation
1954 //===----------------------------------------------------------------------===//
1956 #include "X86GenCallingConv.inc"
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);
1968 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1969 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
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);
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(),
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");
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.
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,
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);
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()));
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();
2072 "SRetReturnReg should have been set in LowerFormalArguments().");
2073 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
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()));
2085 RetOps[0] = Chain; // Update chain.
2087 // Add the flag if we have it.
2089 RetOps.push_back(Flag);
2091 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2094 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2095 if (N->getNumValues() != 1)
2097 if (!N->hasNUsesOfValue(1, 0))
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)
2107 TCChain = Copy->getOperand(0);
2108 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2111 bool HasRet = false;
2112 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2114 if (UI->getOpcode() != X86ISD::RET_FLAG)
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)
2120 if (UI->getNumOperands() == 4 &&
2121 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2134 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2135 ISD::NodeType ExtendKind) const {
2137 // TODO: Is this also valid on 32-bit?
2138 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2139 ReturnMVT = MVT::i8;
2141 ReturnMVT = MVT::i32;
2143 EVT MinVT = getRegisterType(Context, ReturnMVT);
2144 return VT.bitsLT(MinVT) ? MinVT : VT;
2147 /// LowerCallResult - Lower the result values of a call into the
2148 /// appropriate copies out of appropriate physical registers.
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,
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");
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()))
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);
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
2209 enum StructReturnType {
2214 static StructReturnType
2215 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
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;
2227 /// ArgsAreStructReturn - Determines whether a function uses struct
2228 /// return semantics.
2229 static StructReturnType
2230 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
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;
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.
2247 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2248 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
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());
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);
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);
2270 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2271 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2275 CallingConv::ID CalleeCC = CS.getCallingConv();
2276 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
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);
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,
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();
2304 // If value is passed by pointer we have address passed instead of the value
2306 if (VA.getLocInfo() == CCValAssign::Indirect)
2307 ValVT = VA.getLocVT();
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());
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);
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
2339 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2342 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2343 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2345 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
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
2357 // TODO: __vectorcall will change this.
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
2372 static const MCPhysReg XMMArgRegs64Bit[] = {
2373 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2374 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2376 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2380 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2381 CallingConv::ID CallConv,
2383 const SmallVectorImpl<ISD::InputArg> &Ins,
2386 SmallVectorImpl<SDValue> &InVals)
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
2410 CCInfo.AllocateStack(32, 8);
2412 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2414 unsigned LastVal = ~0U;
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
2420 assert(VA.getValNo() != LastVal &&
2421 "Don't support value assigned to multiple locs yet");
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;
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
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);
2477 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2480 assert(VA.isMemLoc());
2481 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
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);
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();
2502 MVT PtrTy = getPointerTy();
2503 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2504 FuncInfo->setSRetReturnReg(Reg);
2506 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2507 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
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));
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
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;
2548 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2549 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2551 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
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));
2563 // Store them to the va_list returned by va_start.
2564 if (MFI->hasVAStart()) {
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).
2574 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
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));
2585 // Store the integer parameter registers.
2586 SmallVector<SDValue, 8> MemOps;
2587 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2589 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2590 for (SDValue Val : LiveGPRs) {
2591 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2592 DAG.getIntPtrConstant(Offset));
2594 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2595 MachinePointerInfo::getFixedStack(
2596 FuncInfo->getRegSaveFrameIndex(), Offset),
2598 MemOps.push_back(Store);
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(),
2613 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2614 MVT::Other, SaveXMMOps));
2617 if (!MemOps.empty())
2618 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
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) {
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));
2633 if (!ArgXMMs.empty()) {
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) {
2641 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2642 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2644 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
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.
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);
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);
2672 FuncInfo->setArgumentStackSize(StackSize);
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),
2694 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2695 /// optimization is performed and it is required.
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);
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,
2723 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2724 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2725 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2731 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2732 SmallVectorImpl<SDValue> &InVals) const {
2733 SelectionDAG &DAG = CLI.DAG;
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)
2754 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
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
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
2769 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
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
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();
2792 // This is a sibcall. The memory operands are available in caller's
2793 // own caller's stack.
2795 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2796 IsTailCallConvention(CallConv))
2797 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
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);
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()) {
2820 if (!ArgLocs.back().isMemLoc())
2821 report_fatal_error("cannot use inalloca attribute on a register "
2823 if (ArgLocs.back().getLocMemOffset() != 0)
2824 report_fatal_error("any parameter with the inalloca attribute must be "
2825 "the only memory argument");
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;
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())
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);
2864 case CCValAssign::ZExt:
2865 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
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);
2874 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2876 case CCValAssign::BCvt:
2877 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
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),
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;
2904 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2906 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2907 assert(VA.isMemLoc());
2908 if (!StackPtr.getNode())
2909 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2911 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2912 dl, DAG, VA, Flags));
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
2923 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2924 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
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
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);
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
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)));
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));
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;
2989 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2990 CCValAssign &VA = ArgLocs[i];
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())
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(),
3012 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3014 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3018 // Store relative to framepointer.
3019 MemOpChains2.push_back(
3020 DAG.getStore(ArgChain, dl, Arg, FIN,
3021 MachinePointerInfo::getFixedStack(FI),
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(),
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.
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);
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
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
3055 // We should use extra load for direct calls to dllimported functions in
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;
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.
3100 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3101 MachinePointerInfo::getGOT(),
3102 false, false, false, 0);
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;
3121 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
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);
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);
3139 Ops.push_back(Chain);
3140 Ops.push_back(Callee);
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
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);
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);
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;
3187 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3189 // Returns a flag for retval copy to use.
3191 Chain = DAG.getCALLSEQ_END(Chain,
3192 DAG.getIntPtrConstant(NumBytesToPop, true),
3193 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3196 InFlag = Chain.getValue(1);
3199 // Handle result values, copying them out of physregs into vregs that we
3201 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3202 Ins, dl, DAG, InVals);
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
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)
3236 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3237 /// for a 16 byte align requirement.
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));
3254 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3255 Offset = ((~AlignMask) & Offset) + StackAlignment +
3256 (StackAlignment-SlotSize);
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.
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;
3270 if (Arg.getOpcode() == ISD::CopyFromReg) {
3271 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3272 if (!TargetRegisterInfo::isVirtualRegister(VR))
3274 MachineInstr *Def = MRI->getVRegDef(VR);
3277 if (!Flags.isByVal()) {
3278 if (!TII->isLoadFromStackSlot(Def, FI))
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();
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)
3297 SDValue Ptr = Ld->getBasePtr();
3298 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
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();
3309 assert(FI != INT_MAX);
3310 if (!MFI->isFixedObjectIndex(FI))
3312 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
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.
3319 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3320 CallingConv::ID CalleeCC,
3322 bool isCalleeStructRet,
3323 bool isCallerStructRet,
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))
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())
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)
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))
3363 // Also avoid sibcall optimization if either caller or callee uses struct
3364 // return semantics.
3365 if (isCalleeStructRet || isCallerStructRet)
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))
3377 // Do not sibcall optimize vararg calls unless all arguments are passed via
3379 if (isVarArg && !Outs.empty()) {
3381 // Optimizing for varargs on Win64 is unlikely to be safe without
3382 // additional testing.
3383 if (IsCalleeWin64 || IsCallerWin64)
3386 SmallVector<CCValAssign, 16> ArgLocs;
3387 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3390 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3391 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3392 if (!ArgLocs[i].isRegLoc())
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) {
3407 SmallVector<CCValAssign, 16> RVLocs;
3408 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
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)
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.
3421 SmallVector<CCValAssign, 16> RVLocs1;
3422 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3424 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3426 SmallVector<CCValAssign, 16> RVLocs2;
3427 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3429 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3431 if (RVLocs1.size() != RVLocs2.size())
3433 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3434 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3436 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3438 if (RVLocs1[i].isRegLoc()) {
3439 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3442 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3448 // If the callee takes no arguments then go on to check the results of the
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,
3457 // Allocate shadow area for Win64
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())
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)
3479 if (!VA.isRegLoc()) {
3480 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
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
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];
3506 unsigned Reg = VA.getLocReg();
3509 case X86::EAX: case X86::EDX: case X86::ECX:
3510 if (++NumInRegs == MaxInRegs)
3522 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3523 const TargetLibraryInfo *libInfo) const {
3524 return X86::createFastISel(funcInfo, libInfo);
3527 //===----------------------------------------------------------------------===//
3528 // Other Lowering Hooks
3529 //===----------------------------------------------------------------------===//
3531 static bool MayFoldLoad(SDValue Op) {
3532 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3535 static bool MayFoldIntoStore(SDValue Op) {
3536 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3539 static bool isTargetShuffle(unsigned Opcode) {
3541 default: return false;
3542 case X86ISD::PSHUFB:
3543 case X86ISD::PSHUFD:
3544 case X86ISD::PSHUFHW:
3545 case X86ISD::PSHUFLW:
3547 case X86ISD::PALIGNR:
3548 case X86ISD::MOVLHPS:
3549 case X86ISD::MOVLHPD:
3550 case X86ISD::MOVHLPS:
3551 case X86ISD::MOVLPS:
3552 case X86ISD::MOVLPD:
3553 case X86ISD::MOVSHDUP:
3554 case X86ISD::MOVSLDUP:
3555 case X86ISD::MOVDDUP:
3558 case X86ISD::UNPCKL:
3559 case X86ISD::UNPCKH:
3560 case X86ISD::VPERMILP:
3561 case X86ISD::VPERM2X128:
3562 case X86ISD::VPERMI:
3567 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3568 SDValue V1, SelectionDAG &DAG) {
3570 default: llvm_unreachable("Unknown x86 shuffle node");
3571 case X86ISD::MOVSHDUP:
3572 case X86ISD::MOVSLDUP:
3573 case X86ISD::MOVDDUP:
3574 return DAG.getNode(Opc, dl, VT, V1);
3578 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3579 SDValue V1, unsigned TargetMask,
3580 SelectionDAG &DAG) {
3582 default: llvm_unreachable("Unknown x86 shuffle node");
3583 case X86ISD::PSHUFD:
3584 case X86ISD::PSHUFHW:
3585 case X86ISD::PSHUFLW:
3586 case X86ISD::VPERMILP:
3587 case X86ISD::VPERMI:
3588 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3592 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3593 SDValue V1, SDValue V2, unsigned TargetMask,
3594 SelectionDAG &DAG) {
3596 default: llvm_unreachable("Unknown x86 shuffle node");
3597 case X86ISD::PALIGNR:
3598 case X86ISD::VALIGN:
3600 case X86ISD::VPERM2X128:
3601 return DAG.getNode(Opc, dl, VT, V1, V2,
3602 DAG.getConstant(TargetMask, MVT::i8));
3606 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3607 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3609 default: llvm_unreachable("Unknown x86 shuffle node");
3610 case X86ISD::MOVLHPS:
3611 case X86ISD::MOVLHPD:
3612 case X86ISD::MOVHLPS:
3613 case X86ISD::MOVLPS:
3614 case X86ISD::MOVLPD:
3617 case X86ISD::UNPCKL:
3618 case X86ISD::UNPCKH:
3619 return DAG.getNode(Opc, dl, VT, V1, V2);
3623 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3624 MachineFunction &MF = DAG.getMachineFunction();
3625 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3626 DAG.getSubtarget().getRegisterInfo());
3627 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3628 int ReturnAddrIndex = FuncInfo->getRAIndex();
3630 if (ReturnAddrIndex == 0) {
3631 // Set up a frame object for the return address.
3632 unsigned SlotSize = RegInfo->getSlotSize();
3633 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3636 FuncInfo->setRAIndex(ReturnAddrIndex);
3639 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3642 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3643 bool hasSymbolicDisplacement) {
3644 // Offset should fit into 32 bit immediate field.
3645 if (!isInt<32>(Offset))
3648 // If we don't have a symbolic displacement - we don't have any extra
3650 if (!hasSymbolicDisplacement)
3653 // FIXME: Some tweaks might be needed for medium code model.
3654 if (M != CodeModel::Small && M != CodeModel::Kernel)
3657 // For small code model we assume that latest object is 16MB before end of 31
3658 // bits boundary. We may also accept pretty large negative constants knowing
3659 // that all objects are in the positive half of address space.
3660 if (M == CodeModel::Small && Offset < 16*1024*1024)
3663 // For kernel code model we know that all object resist in the negative half
3664 // of 32bits address space. We may not accept negative offsets, since they may
3665 // be just off and we may accept pretty large positive ones.
3666 if (M == CodeModel::Kernel && Offset > 0)
3672 /// isCalleePop - Determines whether the callee is required to pop its
3673 /// own arguments. Callee pop is necessary to support tail calls.
3674 bool X86::isCalleePop(CallingConv::ID CallingConv,
3675 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3676 switch (CallingConv) {
3679 case CallingConv::X86_StdCall:
3680 case CallingConv::X86_FastCall:
3681 case CallingConv::X86_ThisCall:
3683 case CallingConv::Fast:
3684 case CallingConv::GHC:
3685 case CallingConv::HiPE:
3692 /// \brief Return true if the condition is an unsigned comparison operation.
3693 static bool isX86CCUnsigned(unsigned X86CC) {
3695 default: llvm_unreachable("Invalid integer condition!");
3696 case X86::COND_E: return true;
3697 case X86::COND_G: return false;
3698 case X86::COND_GE: return false;
3699 case X86::COND_L: return false;
3700 case X86::COND_LE: return false;
3701 case X86::COND_NE: return true;
3702 case X86::COND_B: return true;
3703 case X86::COND_A: return true;
3704 case X86::COND_BE: return true;
3705 case X86::COND_AE: return true;
3707 llvm_unreachable("covered switch fell through?!");
3710 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3711 /// specific condition code, returning the condition code and the LHS/RHS of the
3712 /// comparison to make.
3713 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3714 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3716 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3717 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3718 // X > -1 -> X == 0, jump !sign.
3719 RHS = DAG.getConstant(0, RHS.getValueType());
3720 return X86::COND_NS;
3722 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3723 // X < 0 -> X == 0, jump on sign.
3726 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3728 RHS = DAG.getConstant(0, RHS.getValueType());
3729 return X86::COND_LE;
3733 switch (SetCCOpcode) {
3734 default: llvm_unreachable("Invalid integer condition!");
3735 case ISD::SETEQ: return X86::COND_E;
3736 case ISD::SETGT: return X86::COND_G;
3737 case ISD::SETGE: return X86::COND_GE;
3738 case ISD::SETLT: return X86::COND_L;
3739 case ISD::SETLE: return X86::COND_LE;
3740 case ISD::SETNE: return X86::COND_NE;
3741 case ISD::SETULT: return X86::COND_B;
3742 case ISD::SETUGT: return X86::COND_A;
3743 case ISD::SETULE: return X86::COND_BE;
3744 case ISD::SETUGE: return X86::COND_AE;
3748 // First determine if it is required or is profitable to flip the operands.
3750 // If LHS is a foldable load, but RHS is not, flip the condition.
3751 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3752 !ISD::isNON_EXTLoad(RHS.getNode())) {
3753 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3754 std::swap(LHS, RHS);
3757 switch (SetCCOpcode) {
3763 std::swap(LHS, RHS);
3767 // On a floating point condition, the flags are set as follows:
3769 // 0 | 0 | 0 | X > Y
3770 // 0 | 0 | 1 | X < Y
3771 // 1 | 0 | 0 | X == Y
3772 // 1 | 1 | 1 | unordered
3773 switch (SetCCOpcode) {
3774 default: llvm_unreachable("Condcode should be pre-legalized away");
3776 case ISD::SETEQ: return X86::COND_E;
3777 case ISD::SETOLT: // flipped
3779 case ISD::SETGT: return X86::COND_A;
3780 case ISD::SETOLE: // flipped
3782 case ISD::SETGE: return X86::COND_AE;
3783 case ISD::SETUGT: // flipped
3785 case ISD::SETLT: return X86::COND_B;
3786 case ISD::SETUGE: // flipped
3788 case ISD::SETLE: return X86::COND_BE;
3790 case ISD::SETNE: return X86::COND_NE;
3791 case ISD::SETUO: return X86::COND_P;
3792 case ISD::SETO: return X86::COND_NP;
3794 case ISD::SETUNE: return X86::COND_INVALID;
3798 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3799 /// code. Current x86 isa includes the following FP cmov instructions:
3800 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3801 static bool hasFPCMov(unsigned X86CC) {
3817 /// isFPImmLegal - Returns true if the target can instruction select the
3818 /// specified FP immediate natively. If false, the legalizer will
3819 /// materialize the FP immediate as a load from a constant pool.
3820 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3821 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3822 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3828 /// \brief Returns true if it is beneficial to convert a load of a constant
3829 /// to just the constant itself.
3830 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3832 assert(Ty->isIntegerTy());
3834 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3835 if (BitSize == 0 || BitSize > 64)
3840 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3841 /// the specified range (L, H].
3842 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3843 return (Val < 0) || (Val >= Low && Val < Hi);
3846 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3847 /// specified value.
3848 static bool isUndefOrEqual(int Val, int CmpVal) {
3849 return (Val < 0 || Val == CmpVal);
3852 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3853 /// from position Pos and ending in Pos+Size, falls within the specified
3854 /// sequential range (L, L+Pos]. or is undef.
3855 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3856 unsigned Pos, unsigned Size, int Low) {
3857 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3858 if (!isUndefOrEqual(Mask[i], Low))
3863 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3864 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3865 /// the second operand.
3866 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3867 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3868 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3869 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3870 return (Mask[0] < 2 && Mask[1] < 2);
3874 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3875 /// is suitable for input to PSHUFHW.
3876 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3877 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3880 // Lower quadword copied in order or undef.
3881 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3884 // Upper quadword shuffled.
3885 for (unsigned i = 4; i != 8; ++i)
3886 if (!isUndefOrInRange(Mask[i], 4, 8))
3889 if (VT == MVT::v16i16) {
3890 // Lower quadword copied in order or undef.
3891 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3894 // Upper quadword shuffled.
3895 for (unsigned i = 12; i != 16; ++i)
3896 if (!isUndefOrInRange(Mask[i], 12, 16))
3903 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3904 /// is suitable for input to PSHUFLW.
3905 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3906 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3909 // Upper quadword copied in order.
3910 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3913 // Lower quadword shuffled.
3914 for (unsigned i = 0; i != 4; ++i)
3915 if (!isUndefOrInRange(Mask[i], 0, 4))
3918 if (VT == MVT::v16i16) {
3919 // Upper quadword copied in order.
3920 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3923 // Lower quadword shuffled.
3924 for (unsigned i = 8; i != 12; ++i)
3925 if (!isUndefOrInRange(Mask[i], 8, 12))
3932 /// \brief Return true if the mask specifies a shuffle of elements that is
3933 /// suitable for input to intralane (palignr) or interlane (valign) vector
3935 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3936 unsigned NumElts = VT.getVectorNumElements();
3937 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3938 unsigned NumLaneElts = NumElts/NumLanes;
3940 // Do not handle 64-bit element shuffles with palignr.
3941 if (NumLaneElts == 2)
3944 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3946 for (i = 0; i != NumLaneElts; ++i) {
3951 // Lane is all undef, go to next lane
3952 if (i == NumLaneElts)
3955 int Start = Mask[i+l];
3957 // Make sure its in this lane in one of the sources
3958 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3959 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3962 // If not lane 0, then we must match lane 0
3963 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3966 // Correct second source to be contiguous with first source
3967 if (Start >= (int)NumElts)
3968 Start -= NumElts - NumLaneElts;
3970 // Make sure we're shifting in the right direction.
3971 if (Start <= (int)(i+l))
3976 // Check the rest of the elements to see if they are consecutive.
3977 for (++i; i != NumLaneElts; ++i) {
3978 int Idx = Mask[i+l];
3980 // Make sure its in this lane
3981 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3982 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3985 // If not lane 0, then we must match lane 0
3986 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3989 if (Idx >= (int)NumElts)
3990 Idx -= NumElts - NumLaneElts;
3992 if (!isUndefOrEqual(Idx, Start+i))
4001 /// \brief Return true if the node specifies a shuffle of elements that is
4002 /// suitable for input to PALIGNR.
4003 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4004 const X86Subtarget *Subtarget) {
4005 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4006 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4007 VT.is512BitVector())
4008 // FIXME: Add AVX512BW.
4011 return isAlignrMask(Mask, VT, false);
4014 /// \brief Return true if the node specifies a shuffle of elements that is
4015 /// suitable for input to VALIGN.
4016 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4017 const X86Subtarget *Subtarget) {
4018 // FIXME: Add AVX512VL.
4019 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4021 return isAlignrMask(Mask, VT, true);
4024 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4025 /// the two vector operands have swapped position.
4026 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4027 unsigned NumElems) {
4028 for (unsigned i = 0; i != NumElems; ++i) {
4032 else if (idx < (int)NumElems)
4033 Mask[i] = idx + NumElems;
4035 Mask[i] = idx - NumElems;
4039 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4040 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4041 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4042 /// reverse of what x86 shuffles want.
4043 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4045 unsigned NumElems = VT.getVectorNumElements();
4046 unsigned NumLanes = VT.getSizeInBits()/128;
4047 unsigned NumLaneElems = NumElems/NumLanes;
4049 if (NumLaneElems != 2 && NumLaneElems != 4)
4052 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4053 bool symetricMaskRequired =
4054 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4056 // VSHUFPSY divides the resulting vector into 4 chunks.
4057 // The sources are also splitted into 4 chunks, and each destination
4058 // chunk must come from a different source chunk.
4060 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4061 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4063 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4064 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4066 // VSHUFPDY divides the resulting vector into 4 chunks.
4067 // The sources are also splitted into 4 chunks, and each destination
4068 // chunk must come from a different source chunk.
4070 // SRC1 => X3 X2 X1 X0
4071 // SRC2 => Y3 Y2 Y1 Y0
4073 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4075 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4076 unsigned HalfLaneElems = NumLaneElems/2;
4077 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4078 for (unsigned i = 0; i != NumLaneElems; ++i) {
4079 int Idx = Mask[i+l];
4080 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4081 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4083 // For VSHUFPSY, the mask of the second half must be the same as the
4084 // first but with the appropriate offsets. This works in the same way as
4085 // VPERMILPS works with masks.
4086 if (!symetricMaskRequired || Idx < 0)
4088 if (MaskVal[i] < 0) {
4089 MaskVal[i] = Idx - l;
4092 if ((signed)(Idx - l) != MaskVal[i])
4100 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4101 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4102 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4103 if (!VT.is128BitVector())
4106 unsigned NumElems = VT.getVectorNumElements();
4111 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4112 return isUndefOrEqual(Mask[0], 6) &&
4113 isUndefOrEqual(Mask[1], 7) &&
4114 isUndefOrEqual(Mask[2], 2) &&
4115 isUndefOrEqual(Mask[3], 3);
4118 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4119 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4121 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4122 if (!VT.is128BitVector())
4125 unsigned NumElems = VT.getVectorNumElements();
4130 return isUndefOrEqual(Mask[0], 2) &&
4131 isUndefOrEqual(Mask[1], 3) &&
4132 isUndefOrEqual(Mask[2], 2) &&
4133 isUndefOrEqual(Mask[3], 3);
4136 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4137 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4138 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4139 if (!VT.is128BitVector())
4142 unsigned NumElems = VT.getVectorNumElements();
4144 if (NumElems != 2 && NumElems != 4)
4147 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4148 if (!isUndefOrEqual(Mask[i], i + NumElems))
4151 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4152 if (!isUndefOrEqual(Mask[i], i))
4158 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4159 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4160 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4161 if (!VT.is128BitVector())
4164 unsigned NumElems = VT.getVectorNumElements();
4166 if (NumElems != 2 && NumElems != 4)
4169 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4170 if (!isUndefOrEqual(Mask[i], i))
4173 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4174 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4180 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4181 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4182 /// i. e: If all but one element come from the same vector.
4183 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4184 // TODO: Deal with AVX's VINSERTPS
4185 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4188 unsigned CorrectPosV1 = 0;
4189 unsigned CorrectPosV2 = 0;
4190 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4191 if (Mask[i] == -1) {
4199 else if (Mask[i] == i + 4)
4203 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4204 // We have 3 elements (undefs count as elements from any vector) from one
4205 // vector, and one from another.
4212 // Some special combinations that can be optimized.
4215 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4216 SelectionDAG &DAG) {
4217 MVT VT = SVOp->getSimpleValueType(0);
4220 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4223 ArrayRef<int> Mask = SVOp->getMask();
4225 // These are the special masks that may be optimized.
4226 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4227 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4228 bool MatchEvenMask = true;
4229 bool MatchOddMask = true;
4230 for (int i=0; i<8; ++i) {
4231 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4232 MatchEvenMask = false;
4233 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4234 MatchOddMask = false;
4237 if (!MatchEvenMask && !MatchOddMask)
4240 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4242 SDValue Op0 = SVOp->getOperand(0);
4243 SDValue Op1 = SVOp->getOperand(1);
4245 if (MatchEvenMask) {
4246 // Shift the second operand right to 32 bits.
4247 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4248 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4250 // Shift the first operand left to 32 bits.
4251 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4252 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4254 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4255 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4258 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4259 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4260 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4261 bool HasInt256, bool V2IsSplat = false) {
4263 assert(VT.getSizeInBits() >= 128 &&
4264 "Unsupported vector type for unpckl");
4266 unsigned NumElts = VT.getVectorNumElements();
4267 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4268 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4271 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4272 "Unsupported vector type for unpckh");
4274 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4275 unsigned NumLanes = VT.getSizeInBits()/128;
4276 unsigned NumLaneElts = NumElts/NumLanes;
4278 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4279 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4280 int BitI = Mask[l+i];
4281 int BitI1 = Mask[l+i+1];
4282 if (!isUndefOrEqual(BitI, j))
4285 if (!isUndefOrEqual(BitI1, NumElts))
4288 if (!isUndefOrEqual(BitI1, j + NumElts))
4297 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4298 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4299 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4300 bool HasInt256, bool V2IsSplat = false) {
4301 assert(VT.getSizeInBits() >= 128 &&
4302 "Unsupported vector type for unpckh");
4304 unsigned NumElts = VT.getVectorNumElements();
4305 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4306 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4309 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4310 "Unsupported vector type for unpckh");
4312 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4313 unsigned NumLanes = VT.getSizeInBits()/128;
4314 unsigned NumLaneElts = NumElts/NumLanes;
4316 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4317 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4318 int BitI = Mask[l+i];
4319 int BitI1 = Mask[l+i+1];
4320 if (!isUndefOrEqual(BitI, j))
4323 if (isUndefOrEqual(BitI1, NumElts))
4326 if (!isUndefOrEqual(BitI1, j+NumElts))
4334 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4335 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4337 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4338 unsigned NumElts = VT.getVectorNumElements();
4339 bool Is256BitVec = VT.is256BitVector();
4341 if (VT.is512BitVector())
4343 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4344 "Unsupported vector type for unpckh");
4346 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4347 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4350 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4351 // FIXME: Need a better way to get rid of this, there's no latency difference
4352 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4353 // the former later. We should also remove the "_undef" special mask.
4354 if (NumElts == 4 && Is256BitVec)
4357 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4358 // independently on 128-bit lanes.
4359 unsigned NumLanes = VT.getSizeInBits()/128;
4360 unsigned NumLaneElts = NumElts/NumLanes;
4362 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4363 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4364 int BitI = Mask[l+i];
4365 int BitI1 = Mask[l+i+1];
4367 if (!isUndefOrEqual(BitI, j))
4369 if (!isUndefOrEqual(BitI1, j))
4377 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4378 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4380 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4381 unsigned NumElts = VT.getVectorNumElements();
4383 if (VT.is512BitVector())
4386 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4387 "Unsupported vector type for unpckh");
4389 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4390 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4393 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4394 // independently on 128-bit lanes.
4395 unsigned NumLanes = VT.getSizeInBits()/128;
4396 unsigned NumLaneElts = NumElts/NumLanes;
4398 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4399 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4400 int BitI = Mask[l+i];
4401 int BitI1 = Mask[l+i+1];
4402 if (!isUndefOrEqual(BitI, j))
4404 if (!isUndefOrEqual(BitI1, j))
4411 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4412 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4413 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4414 if (!VT.is512BitVector())
4417 unsigned NumElts = VT.getVectorNumElements();
4418 unsigned HalfSize = NumElts/2;
4419 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4420 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4425 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4426 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4434 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4435 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4436 /// MOVSD, and MOVD, i.e. setting the lowest element.
4437 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4438 if (VT.getVectorElementType().getSizeInBits() < 32)
4440 if (!VT.is128BitVector())
4443 unsigned NumElts = VT.getVectorNumElements();
4445 if (!isUndefOrEqual(Mask[0], NumElts))
4448 for (unsigned i = 1; i != NumElts; ++i)
4449 if (!isUndefOrEqual(Mask[i], i))
4455 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4456 /// as permutations between 128-bit chunks or halves. As an example: this
4458 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4459 /// The first half comes from the second half of V1 and the second half from the
4460 /// the second half of V2.
4461 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4462 if (!HasFp256 || !VT.is256BitVector())
4465 // The shuffle result is divided into half A and half B. In total the two
4466 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4467 // B must come from C, D, E or F.
4468 unsigned HalfSize = VT.getVectorNumElements()/2;
4469 bool MatchA = false, MatchB = false;
4471 // Check if A comes from one of C, D, E, F.
4472 for (unsigned Half = 0; Half != 4; ++Half) {
4473 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4479 // Check if B comes from one of C, D, E, F.
4480 for (unsigned Half = 0; Half != 4; ++Half) {
4481 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4487 return MatchA && MatchB;
4490 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4491 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4492 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4493 MVT VT = SVOp->getSimpleValueType(0);
4495 unsigned HalfSize = VT.getVectorNumElements()/2;
4497 unsigned FstHalf = 0, SndHalf = 0;
4498 for (unsigned i = 0; i < HalfSize; ++i) {
4499 if (SVOp->getMaskElt(i) > 0) {
4500 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4504 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4505 if (SVOp->getMaskElt(i) > 0) {
4506 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4511 return (FstHalf | (SndHalf << 4));
4514 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4515 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4516 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4520 unsigned NumElts = VT.getVectorNumElements();
4522 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4523 for (unsigned i = 0; i != NumElts; ++i) {
4526 Imm8 |= Mask[i] << (i*2);
4531 unsigned LaneSize = 4;
4532 SmallVector<int, 4> MaskVal(LaneSize, -1);
4534 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4535 for (unsigned i = 0; i != LaneSize; ++i) {
4536 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4540 if (MaskVal[i] < 0) {
4541 MaskVal[i] = Mask[i+l] - l;
4542 Imm8 |= MaskVal[i] << (i*2);
4545 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4552 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4553 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4554 /// Note that VPERMIL mask matching is different depending whether theunderlying
4555 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4556 /// to the same elements of the low, but to the higher half of the source.
4557 /// In VPERMILPD the two lanes could be shuffled independently of each other
4558 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4559 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4560 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4561 if (VT.getSizeInBits() < 256 || EltSize < 32)
4563 bool symetricMaskRequired = (EltSize == 32);
4564 unsigned NumElts = VT.getVectorNumElements();
4566 unsigned NumLanes = VT.getSizeInBits()/128;
4567 unsigned LaneSize = NumElts/NumLanes;
4568 // 2 or 4 elements in one lane
4570 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4571 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4572 for (unsigned i = 0; i != LaneSize; ++i) {
4573 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4575 if (symetricMaskRequired) {
4576 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4577 ExpectedMaskVal[i] = Mask[i+l] - l;
4580 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4588 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4589 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4590 /// element of vector 2 and the other elements to come from vector 1 in order.
4591 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4592 bool V2IsSplat = false, bool V2IsUndef = false) {
4593 if (!VT.is128BitVector())
4596 unsigned NumOps = VT.getVectorNumElements();
4597 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4600 if (!isUndefOrEqual(Mask[0], 0))
4603 for (unsigned i = 1; i != NumOps; ++i)
4604 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4605 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4606 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4612 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4613 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4614 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4615 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4616 const X86Subtarget *Subtarget) {
4617 if (!Subtarget->hasSSE3())
4620 unsigned NumElems = VT.getVectorNumElements();
4622 if ((VT.is128BitVector() && NumElems != 4) ||
4623 (VT.is256BitVector() && NumElems != 8) ||
4624 (VT.is512BitVector() && NumElems != 16))
4627 // "i+1" is the value the indexed mask element must have
4628 for (unsigned i = 0; i != NumElems; i += 2)
4629 if (!isUndefOrEqual(Mask[i], i+1) ||
4630 !isUndefOrEqual(Mask[i+1], i+1))
4636 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4637 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4638 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4639 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4640 const X86Subtarget *Subtarget) {
4641 if (!Subtarget->hasSSE3())
4644 unsigned NumElems = VT.getVectorNumElements();
4646 if ((VT.is128BitVector() && NumElems != 4) ||
4647 (VT.is256BitVector() && NumElems != 8) ||
4648 (VT.is512BitVector() && NumElems != 16))
4651 // "i" is the value the indexed mask element must have
4652 for (unsigned i = 0; i != NumElems; i += 2)
4653 if (!isUndefOrEqual(Mask[i], i) ||
4654 !isUndefOrEqual(Mask[i+1], i))
4660 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4661 /// specifies a shuffle of elements that is suitable for input to 256-bit
4662 /// version of MOVDDUP.
4663 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4664 if (!HasFp256 || !VT.is256BitVector())
4667 unsigned NumElts = VT.getVectorNumElements();
4671 for (unsigned i = 0; i != NumElts/2; ++i)
4672 if (!isUndefOrEqual(Mask[i], 0))
4674 for (unsigned i = NumElts/2; i != NumElts; ++i)
4675 if (!isUndefOrEqual(Mask[i], NumElts/2))
4680 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4681 /// specifies a shuffle of elements that is suitable for input to 128-bit
4682 /// version of MOVDDUP.
4683 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4684 if (!VT.is128BitVector())
4687 unsigned e = VT.getVectorNumElements() / 2;
4688 for (unsigned i = 0; i != e; ++i)
4689 if (!isUndefOrEqual(Mask[i], i))
4691 for (unsigned i = 0; i != e; ++i)
4692 if (!isUndefOrEqual(Mask[e+i], i))
4697 /// isVEXTRACTIndex - Return true if the specified
4698 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4699 /// suitable for instruction that extract 128 or 256 bit vectors
4700 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4701 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4702 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4705 // The index should be aligned on a vecWidth-bit boundary.
4707 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4709 MVT VT = N->getSimpleValueType(0);
4710 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4711 bool Result = (Index * ElSize) % vecWidth == 0;
4716 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4717 /// operand specifies a subvector insert that is suitable for input to
4718 /// insertion of 128 or 256-bit subvectors
4719 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4720 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4721 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4723 // The index should be aligned on a vecWidth-bit boundary.
4725 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4727 MVT VT = N->getSimpleValueType(0);
4728 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4729 bool Result = (Index * ElSize) % vecWidth == 0;
4734 bool X86::isVINSERT128Index(SDNode *N) {
4735 return isVINSERTIndex(N, 128);
4738 bool X86::isVINSERT256Index(SDNode *N) {
4739 return isVINSERTIndex(N, 256);
4742 bool X86::isVEXTRACT128Index(SDNode *N) {
4743 return isVEXTRACTIndex(N, 128);
4746 bool X86::isVEXTRACT256Index(SDNode *N) {
4747 return isVEXTRACTIndex(N, 256);
4750 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4751 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4752 /// Handles 128-bit and 256-bit.
4753 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4754 MVT VT = N->getSimpleValueType(0);
4756 assert((VT.getSizeInBits() >= 128) &&
4757 "Unsupported vector type for PSHUF/SHUFP");
4759 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4760 // independently on 128-bit lanes.
4761 unsigned NumElts = VT.getVectorNumElements();
4762 unsigned NumLanes = VT.getSizeInBits()/128;
4763 unsigned NumLaneElts = NumElts/NumLanes;
4765 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4766 "Only supports 2, 4 or 8 elements per lane");
4768 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4770 for (unsigned i = 0; i != NumElts; ++i) {
4771 int Elt = N->getMaskElt(i);
4772 if (Elt < 0) continue;
4773 Elt &= NumLaneElts - 1;
4774 unsigned ShAmt = (i << Shift) % 8;
4775 Mask |= Elt << ShAmt;
4781 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4782 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4783 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4784 MVT VT = N->getSimpleValueType(0);
4786 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4787 "Unsupported vector type for PSHUFHW");
4789 unsigned NumElts = VT.getVectorNumElements();
4792 for (unsigned l = 0; l != NumElts; l += 8) {
4793 // 8 nodes per lane, but we only care about the last 4.
4794 for (unsigned i = 0; i < 4; ++i) {
4795 int Elt = N->getMaskElt(l+i+4);
4796 if (Elt < 0) continue;
4797 Elt &= 0x3; // only 2-bits.
4798 Mask |= Elt << (i * 2);
4805 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4806 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4807 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4808 MVT VT = N->getSimpleValueType(0);
4810 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4811 "Unsupported vector type for PSHUFHW");
4813 unsigned NumElts = VT.getVectorNumElements();
4816 for (unsigned l = 0; l != NumElts; l += 8) {
4817 // 8 nodes per lane, but we only care about the first 4.
4818 for (unsigned i = 0; i < 4; ++i) {
4819 int Elt = N->getMaskElt(l+i);
4820 if (Elt < 0) continue;
4821 Elt &= 0x3; // only 2-bits
4822 Mask |= Elt << (i * 2);
4829 /// \brief Return the appropriate immediate to shuffle the specified
4830 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4831 /// VALIGN (if Interlane is true) instructions.
4832 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4834 MVT VT = SVOp->getSimpleValueType(0);
4835 unsigned EltSize = InterLane ? 1 :
4836 VT.getVectorElementType().getSizeInBits() >> 3;
4838 unsigned NumElts = VT.getVectorNumElements();
4839 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4840 unsigned NumLaneElts = NumElts/NumLanes;
4844 for (i = 0; i != NumElts; ++i) {
4845 Val = SVOp->getMaskElt(i);
4849 if (Val >= (int)NumElts)
4850 Val -= NumElts - NumLaneElts;
4852 assert(Val - i > 0 && "PALIGNR imm should be positive");
4853 return (Val - i) * EltSize;
4856 /// \brief Return the appropriate immediate to shuffle the specified
4857 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4858 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4859 return getShuffleAlignrImmediate(SVOp, false);
4862 /// \brief Return the appropriate immediate to shuffle the specified
4863 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4864 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4865 return getShuffleAlignrImmediate(SVOp, true);
4869 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4870 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4871 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4872 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4875 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4877 MVT VecVT = N->getOperand(0).getSimpleValueType();
4878 MVT ElVT = VecVT.getVectorElementType();
4880 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4881 return Index / NumElemsPerChunk;
4884 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4885 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4886 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4887 llvm_unreachable("Illegal insert subvector for VINSERT");
4890 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4892 MVT VecVT = N->getSimpleValueType(0);
4893 MVT ElVT = VecVT.getVectorElementType();
4895 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4896 return Index / NumElemsPerChunk;
4899 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4900 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4901 /// and VINSERTI128 instructions.
4902 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4903 return getExtractVEXTRACTImmediate(N, 128);
4906 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4907 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4908 /// and VINSERTI64x4 instructions.
4909 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4910 return getExtractVEXTRACTImmediate(N, 256);
4913 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4914 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4915 /// and VINSERTI128 instructions.
4916 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4917 return getInsertVINSERTImmediate(N, 128);
4920 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4921 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4922 /// and VINSERTI64x4 instructions.
4923 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4924 return getInsertVINSERTImmediate(N, 256);
4927 /// isZero - Returns true if Elt is a constant integer zero
4928 static bool isZero(SDValue V) {
4929 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4930 return C && C->isNullValue();
4933 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4935 bool X86::isZeroNode(SDValue Elt) {
4938 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4939 return CFP->getValueAPF().isPosZero();
4943 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4944 /// match movhlps. The lower half elements should come from upper half of
4945 /// V1 (and in order), and the upper half elements should come from the upper
4946 /// half of V2 (and in order).
4947 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4948 if (!VT.is128BitVector())
4950 if (VT.getVectorNumElements() != 4)
4952 for (unsigned i = 0, e = 2; i != e; ++i)
4953 if (!isUndefOrEqual(Mask[i], i+2))
4955 for (unsigned i = 2; i != 4; ++i)
4956 if (!isUndefOrEqual(Mask[i], i+4))
4961 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4962 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4964 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4965 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4967 N = N->getOperand(0).getNode();
4968 if (!ISD::isNON_EXTLoad(N))
4971 *LD = cast<LoadSDNode>(N);
4975 // Test whether the given value is a vector value which will be legalized
4977 static bool WillBeConstantPoolLoad(SDNode *N) {
4978 if (N->getOpcode() != ISD::BUILD_VECTOR)
4981 // Check for any non-constant elements.
4982 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4983 switch (N->getOperand(i).getNode()->getOpcode()) {
4985 case ISD::ConstantFP:
4992 // Vectors of all-zeros and all-ones are materialized with special
4993 // instructions rather than being loaded.
4994 return !ISD::isBuildVectorAllZeros(N) &&
4995 !ISD::isBuildVectorAllOnes(N);
4998 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
4999 /// match movlp{s|d}. The lower half elements should come from lower half of
5000 /// V1 (and in order), and the upper half elements should come from the upper
5001 /// half of V2 (and in order). And since V1 will become the source of the
5002 /// MOVLP, it must be either a vector load or a scalar load to vector.
5003 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5004 ArrayRef<int> Mask, MVT VT) {
5005 if (!VT.is128BitVector())
5008 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5010 // Is V2 is a vector load, don't do this transformation. We will try to use
5011 // load folding shufps op.
5012 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5015 unsigned NumElems = VT.getVectorNumElements();
5017 if (NumElems != 2 && NumElems != 4)
5019 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5020 if (!isUndefOrEqual(Mask[i], i))
5022 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5023 if (!isUndefOrEqual(Mask[i], i+NumElems))
5028 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5029 /// to an zero vector.
5030 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5031 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5032 SDValue V1 = N->getOperand(0);
5033 SDValue V2 = N->getOperand(1);
5034 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5035 for (unsigned i = 0; i != NumElems; ++i) {
5036 int Idx = N->getMaskElt(i);
5037 if (Idx >= (int)NumElems) {
5038 unsigned Opc = V2.getOpcode();
5039 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5041 if (Opc != ISD::BUILD_VECTOR ||
5042 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5044 } else if (Idx >= 0) {
5045 unsigned Opc = V1.getOpcode();
5046 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5048 if (Opc != ISD::BUILD_VECTOR ||
5049 !X86::isZeroNode(V1.getOperand(Idx)))
5056 /// getZeroVector - Returns a vector of specified type with all zero elements.
5058 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5059 SelectionDAG &DAG, SDLoc dl) {
5060 assert(VT.isVector() && "Expected a vector type");
5062 // Always build SSE zero vectors as <4 x i32> bitcasted
5063 // to their dest type. This ensures they get CSE'd.
5065 if (VT.is128BitVector()) { // SSE
5066 if (Subtarget->hasSSE2()) { // SSE2
5067 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5068 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5070 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5071 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5073 } else if (VT.is256BitVector()) { // AVX
5074 if (Subtarget->hasInt256()) { // AVX2
5075 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5076 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5077 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5079 // 256-bit logic and arithmetic instructions in AVX are all
5080 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5081 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5082 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5083 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5085 } else if (VT.is512BitVector()) { // AVX-512
5086 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5087 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5088 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5089 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5090 } else if (VT.getScalarType() == MVT::i1) {
5091 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5092 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5093 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5094 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5096 llvm_unreachable("Unexpected vector type");
5098 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5101 /// getOnesVector - Returns a vector of specified type with all bits set.
5102 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5103 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5104 /// Then bitcast to their original type, ensuring they get CSE'd.
5105 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5107 assert(VT.isVector() && "Expected a vector type");
5109 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5111 if (VT.is256BitVector()) {
5112 if (HasInt256) { // AVX2
5113 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5114 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5116 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5117 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5119 } else if (VT.is128BitVector()) {
5120 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5122 llvm_unreachable("Unexpected vector type");
5124 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5127 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5128 /// that point to V2 points to its first element.
5129 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5130 for (unsigned i = 0; i != NumElems; ++i) {
5131 if (Mask[i] > (int)NumElems) {
5137 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5138 /// operation of specified width.
5139 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5141 unsigned NumElems = VT.getVectorNumElements();
5142 SmallVector<int, 8> Mask;
5143 Mask.push_back(NumElems);
5144 for (unsigned i = 1; i != NumElems; ++i)
5146 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5149 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5150 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5152 unsigned NumElems = VT.getVectorNumElements();
5153 SmallVector<int, 8> Mask;
5154 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5156 Mask.push_back(i + NumElems);
5158 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5161 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5162 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5164 unsigned NumElems = VT.getVectorNumElements();
5165 SmallVector<int, 8> Mask;
5166 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5167 Mask.push_back(i + Half);
5168 Mask.push_back(i + NumElems + Half);
5170 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5173 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5174 // a generic shuffle instruction because the target has no such instructions.
5175 // Generate shuffles which repeat i16 and i8 several times until they can be
5176 // represented by v4f32 and then be manipulated by target suported shuffles.
5177 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5178 MVT VT = V.getSimpleValueType();
5179 int NumElems = VT.getVectorNumElements();
5182 while (NumElems > 4) {
5183 if (EltNo < NumElems/2) {
5184 V = getUnpackl(DAG, dl, VT, V, V);
5186 V = getUnpackh(DAG, dl, VT, V, V);
5187 EltNo -= NumElems/2;
5194 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5195 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5196 MVT VT = V.getSimpleValueType();
5199 if (VT.is128BitVector()) {
5200 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5201 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5202 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5204 } else if (VT.is256BitVector()) {
5205 // To use VPERMILPS to splat scalars, the second half of indicies must
5206 // refer to the higher part, which is a duplication of the lower one,
5207 // because VPERMILPS can only handle in-lane permutations.
5208 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5209 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5211 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5212 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5215 llvm_unreachable("Vector size not supported");
5217 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5220 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5221 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5222 MVT SrcVT = SV->getSimpleValueType(0);
5223 SDValue V1 = SV->getOperand(0);
5226 int EltNo = SV->getSplatIndex();
5227 int NumElems = SrcVT.getVectorNumElements();
5228 bool Is256BitVec = SrcVT.is256BitVector();
5230 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5231 "Unknown how to promote splat for type");
5233 // Extract the 128-bit part containing the splat element and update
5234 // the splat element index when it refers to the higher register.
5236 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5237 if (EltNo >= NumElems/2)
5238 EltNo -= NumElems/2;
5241 // All i16 and i8 vector types can't be used directly by a generic shuffle
5242 // instruction because the target has no such instruction. Generate shuffles
5243 // which repeat i16 and i8 several times until they fit in i32, and then can
5244 // be manipulated by target suported shuffles.
5245 MVT EltVT = SrcVT.getVectorElementType();
5246 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5247 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5249 // Recreate the 256-bit vector and place the same 128-bit vector
5250 // into the low and high part. This is necessary because we want
5251 // to use VPERM* to shuffle the vectors
5253 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5256 return getLegalSplat(DAG, V1, EltNo);
5259 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5260 /// vector of zero or undef vector. This produces a shuffle where the low
5261 /// element of V2 is swizzled into the zero/undef vector, landing at element
5262 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5263 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5265 const X86Subtarget *Subtarget,
5266 SelectionDAG &DAG) {
5267 MVT VT = V2.getSimpleValueType();
5269 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5270 unsigned NumElems = VT.getVectorNumElements();
5271 SmallVector<int, 16> MaskVec;
5272 for (unsigned i = 0; i != NumElems; ++i)
5273 // If this is the insertion idx, put the low elt of V2 here.
5274 MaskVec.push_back(i == Idx ? NumElems : i);
5275 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5278 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5279 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5280 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5281 /// shuffles which use a single input multiple times, and in those cases it will
5282 /// adjust the mask to only have indices within that single input.
5283 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5284 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5285 unsigned NumElems = VT.getVectorNumElements();
5289 bool IsFakeUnary = false;
5290 switch(N->getOpcode()) {
5292 ImmN = N->getOperand(N->getNumOperands()-1);
5293 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5294 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5296 case X86ISD::UNPCKH:
5297 DecodeUNPCKHMask(VT, Mask);
5298 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5300 case X86ISD::UNPCKL:
5301 DecodeUNPCKLMask(VT, Mask);
5302 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5304 case X86ISD::MOVHLPS:
5305 DecodeMOVHLPSMask(NumElems, Mask);
5306 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5308 case X86ISD::MOVLHPS:
5309 DecodeMOVLHPSMask(NumElems, Mask);
5310 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5312 case X86ISD::PALIGNR:
5313 ImmN = N->getOperand(N->getNumOperands()-1);
5314 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5316 case X86ISD::PSHUFD:
5317 case X86ISD::VPERMILP:
5318 ImmN = N->getOperand(N->getNumOperands()-1);
5319 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5322 case X86ISD::PSHUFHW:
5323 ImmN = N->getOperand(N->getNumOperands()-1);
5324 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5327 case X86ISD::PSHUFLW:
5328 ImmN = N->getOperand(N->getNumOperands()-1);
5329 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5332 case X86ISD::PSHUFB: {
5334 SDValue MaskNode = N->getOperand(1);
5335 while (MaskNode->getOpcode() == ISD::BITCAST)
5336 MaskNode = MaskNode->getOperand(0);
5338 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5339 // If we have a build-vector, then things are easy.
5340 EVT VT = MaskNode.getValueType();
5341 assert(VT.isVector() &&
5342 "Can't produce a non-vector with a build_vector!");
5343 if (!VT.isInteger())
5346 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5348 SmallVector<uint64_t, 32> RawMask;
5349 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5350 auto *CN = dyn_cast<ConstantSDNode>(MaskNode->getOperand(i));
5353 APInt MaskElement = CN->getAPIntValue();
5355 // We now have to decode the element which could be any integer size and
5356 // extract each byte of it.
5357 for (int j = 0; j < NumBytesPerElement; ++j) {
5358 // Note that this is x86 and so always little endian: the low byte is
5359 // the first byte of the mask.
5360 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
5361 MaskElement = MaskElement.lshr(8);
5364 DecodePSHUFBMask(RawMask, Mask);
5368 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
5372 SDValue Ptr = MaskLoad->getBasePtr();
5373 if (Ptr->getOpcode() == X86ISD::Wrapper)
5374 Ptr = Ptr->getOperand(0);
5376 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
5377 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
5380 if (auto *C = dyn_cast<ConstantDataSequential>(MaskCP->getConstVal())) {
5381 // FIXME: Support AVX-512 here.
5382 if (!C->getType()->isVectorTy() ||
5383 (C->getNumElements() != 16 && C->getNumElements() != 32))
5386 assert(C->getType()->isVectorTy() && "Expected a vector constant.");
5387 DecodePSHUFBMask(C, Mask);
5393 case X86ISD::VPERMI:
5394 ImmN = N->getOperand(N->getNumOperands()-1);
5395 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5399 case X86ISD::MOVSD: {
5400 // The index 0 always comes from the first element of the second source,
5401 // this is why MOVSS and MOVSD are used in the first place. The other
5402 // elements come from the other positions of the first source vector
5403 Mask.push_back(NumElems);
5404 for (unsigned i = 1; i != NumElems; ++i) {
5409 case X86ISD::VPERM2X128:
5410 ImmN = N->getOperand(N->getNumOperands()-1);
5411 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5412 if (Mask.empty()) return false;
5414 case X86ISD::MOVSLDUP:
5415 DecodeMOVSLDUPMask(VT, Mask);
5417 case X86ISD::MOVSHDUP:
5418 DecodeMOVSHDUPMask(VT, Mask);
5420 case X86ISD::MOVDDUP:
5421 case X86ISD::MOVLHPD:
5422 case X86ISD::MOVLPD:
5423 case X86ISD::MOVLPS:
5424 // Not yet implemented
5426 default: llvm_unreachable("unknown target shuffle node");
5429 // If we have a fake unary shuffle, the shuffle mask is spread across two
5430 // inputs that are actually the same node. Re-map the mask to always point
5431 // into the first input.
5434 if (M >= (int)Mask.size())
5440 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5441 /// element of the result of the vector shuffle.
5442 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5445 return SDValue(); // Limit search depth.
5447 SDValue V = SDValue(N, 0);
5448 EVT VT = V.getValueType();
5449 unsigned Opcode = V.getOpcode();
5451 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5452 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5453 int Elt = SV->getMaskElt(Index);
5456 return DAG.getUNDEF(VT.getVectorElementType());
5458 unsigned NumElems = VT.getVectorNumElements();
5459 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5460 : SV->getOperand(1);
5461 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5464 // Recurse into target specific vector shuffles to find scalars.
5465 if (isTargetShuffle(Opcode)) {
5466 MVT ShufVT = V.getSimpleValueType();
5467 unsigned NumElems = ShufVT.getVectorNumElements();
5468 SmallVector<int, 16> ShuffleMask;
5471 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5474 int Elt = ShuffleMask[Index];
5476 return DAG.getUNDEF(ShufVT.getVectorElementType());
5478 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5480 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5484 // Actual nodes that may contain scalar elements
5485 if (Opcode == ISD::BITCAST) {
5486 V = V.getOperand(0);
5487 EVT SrcVT = V.getValueType();
5488 unsigned NumElems = VT.getVectorNumElements();
5490 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5494 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5495 return (Index == 0) ? V.getOperand(0)
5496 : DAG.getUNDEF(VT.getVectorElementType());
5498 if (V.getOpcode() == ISD::BUILD_VECTOR)
5499 return V.getOperand(Index);
5504 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5505 /// shuffle operation which come from a consecutively from a zero. The
5506 /// search can start in two different directions, from left or right.
5507 /// We count undefs as zeros until PreferredNum is reached.
5508 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5509 unsigned NumElems, bool ZerosFromLeft,
5511 unsigned PreferredNum = -1U) {
5512 unsigned NumZeros = 0;
5513 for (unsigned i = 0; i != NumElems; ++i) {
5514 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5515 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5519 if (X86::isZeroNode(Elt))
5521 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5522 NumZeros = std::min(NumZeros + 1, PreferredNum);
5530 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5531 /// correspond consecutively to elements from one of the vector operands,
5532 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5534 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5535 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5536 unsigned NumElems, unsigned &OpNum) {
5537 bool SeenV1 = false;
5538 bool SeenV2 = false;
5540 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5541 int Idx = SVOp->getMaskElt(i);
5542 // Ignore undef indicies
5546 if (Idx < (int)NumElems)
5551 // Only accept consecutive elements from the same vector
5552 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5556 OpNum = SeenV1 ? 0 : 1;
5560 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5561 /// logical left shift of a vector.
5562 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5563 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5565 SVOp->getSimpleValueType(0).getVectorNumElements();
5566 unsigned NumZeros = getNumOfConsecutiveZeros(
5567 SVOp, NumElems, false /* check zeros from right */, DAG,
5568 SVOp->getMaskElt(0));
5574 // Considering the elements in the mask that are not consecutive zeros,
5575 // check if they consecutively come from only one of the source vectors.
5577 // V1 = {X, A, B, C} 0
5579 // vector_shuffle V1, V2 <1, 2, 3, X>
5581 if (!isShuffleMaskConsecutive(SVOp,
5582 0, // Mask Start Index
5583 NumElems-NumZeros, // Mask End Index(exclusive)
5584 NumZeros, // Where to start looking in the src vector
5585 NumElems, // Number of elements in vector
5586 OpSrc)) // Which source operand ?
5591 ShVal = SVOp->getOperand(OpSrc);
5595 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5596 /// logical left shift of a vector.
5597 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5598 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5600 SVOp->getSimpleValueType(0).getVectorNumElements();
5601 unsigned NumZeros = getNumOfConsecutiveZeros(
5602 SVOp, NumElems, true /* check zeros from left */, DAG,
5603 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5609 // Considering the elements in the mask that are not consecutive zeros,
5610 // check if they consecutively come from only one of the source vectors.
5612 // 0 { A, B, X, X } = V2
5614 // vector_shuffle V1, V2 <X, X, 4, 5>
5616 if (!isShuffleMaskConsecutive(SVOp,
5617 NumZeros, // Mask Start Index
5618 NumElems, // Mask End Index(exclusive)
5619 0, // Where to start looking in the src vector
5620 NumElems, // Number of elements in vector
5621 OpSrc)) // Which source operand ?
5626 ShVal = SVOp->getOperand(OpSrc);
5630 /// isVectorShift - Returns true if the shuffle can be implemented as a
5631 /// logical left or right shift of a vector.
5632 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5633 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5634 // Although the logic below support any bitwidth size, there are no
5635 // shift instructions which handle more than 128-bit vectors.
5636 if (!SVOp->getSimpleValueType(0).is128BitVector())
5639 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5640 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5646 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5648 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5649 unsigned NumNonZero, unsigned NumZero,
5651 const X86Subtarget* Subtarget,
5652 const TargetLowering &TLI) {
5659 for (unsigned i = 0; i < 16; ++i) {
5660 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5661 if (ThisIsNonZero && First) {
5663 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5665 V = DAG.getUNDEF(MVT::v8i16);
5670 SDValue ThisElt, LastElt;
5671 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5672 if (LastIsNonZero) {
5673 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5674 MVT::i16, Op.getOperand(i-1));
5676 if (ThisIsNonZero) {
5677 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5678 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5679 ThisElt, DAG.getConstant(8, MVT::i8));
5681 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5685 if (ThisElt.getNode())
5686 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5687 DAG.getIntPtrConstant(i/2));
5691 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5694 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5696 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5697 unsigned NumNonZero, unsigned NumZero,
5699 const X86Subtarget* Subtarget,
5700 const TargetLowering &TLI) {
5707 for (unsigned i = 0; i < 8; ++i) {
5708 bool isNonZero = (NonZeros & (1 << i)) != 0;
5712 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5714 V = DAG.getUNDEF(MVT::v8i16);
5717 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5718 MVT::v8i16, V, Op.getOperand(i),
5719 DAG.getIntPtrConstant(i));
5726 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5727 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5728 unsigned NonZeros, unsigned NumNonZero,
5729 unsigned NumZero, SelectionDAG &DAG,
5730 const X86Subtarget *Subtarget,
5731 const TargetLowering &TLI) {
5732 // We know there's at least one non-zero element
5733 unsigned FirstNonZeroIdx = 0;
5734 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5735 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5736 X86::isZeroNode(FirstNonZero)) {
5738 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5741 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5742 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5745 SDValue V = FirstNonZero.getOperand(0);
5746 MVT VVT = V.getSimpleValueType();
5747 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5750 unsigned FirstNonZeroDst =
5751 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5752 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5753 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5754 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5756 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5757 SDValue Elem = Op.getOperand(Idx);
5758 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5761 // TODO: What else can be here? Deal with it.
5762 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5765 // TODO: Some optimizations are still possible here
5766 // ex: Getting one element from a vector, and the rest from another.
5767 if (Elem.getOperand(0) != V)
5770 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5773 else if (IncorrectIdx == -1U) {
5777 // There was already one element with an incorrect index.
5778 // We can't optimize this case to an insertps.
5782 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5784 EVT VT = Op.getSimpleValueType();
5785 unsigned ElementMoveMask = 0;
5786 if (IncorrectIdx == -1U)
5787 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5789 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5791 SDValue InsertpsMask =
5792 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5793 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5799 /// getVShift - Return a vector logical shift node.
5801 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5802 unsigned NumBits, SelectionDAG &DAG,
5803 const TargetLowering &TLI, SDLoc dl) {
5804 assert(VT.is128BitVector() && "Unknown type for VShift");
5805 EVT ShVT = MVT::v2i64;
5806 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5807 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5808 return DAG.getNode(ISD::BITCAST, dl, VT,
5809 DAG.getNode(Opc, dl, ShVT, SrcOp,
5810 DAG.getConstant(NumBits,
5811 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5815 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5817 // Check if the scalar load can be widened into a vector load. And if
5818 // the address is "base + cst" see if the cst can be "absorbed" into
5819 // the shuffle mask.
5820 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5821 SDValue Ptr = LD->getBasePtr();
5822 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5824 EVT PVT = LD->getValueType(0);
5825 if (PVT != MVT::i32 && PVT != MVT::f32)
5830 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5831 FI = FINode->getIndex();
5833 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5834 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5835 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5836 Offset = Ptr.getConstantOperandVal(1);
5837 Ptr = Ptr.getOperand(0);
5842 // FIXME: 256-bit vector instructions don't require a strict alignment,
5843 // improve this code to support it better.
5844 unsigned RequiredAlign = VT.getSizeInBits()/8;
5845 SDValue Chain = LD->getChain();
5846 // Make sure the stack object alignment is at least 16 or 32.
5847 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5848 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5849 if (MFI->isFixedObjectIndex(FI)) {
5850 // Can't change the alignment. FIXME: It's possible to compute
5851 // the exact stack offset and reference FI + adjust offset instead.
5852 // If someone *really* cares about this. That's the way to implement it.
5855 MFI->setObjectAlignment(FI, RequiredAlign);
5859 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5860 // Ptr + (Offset & ~15).
5863 if ((Offset % RequiredAlign) & 3)
5865 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5867 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5868 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5870 int EltNo = (Offset - StartOffset) >> 2;
5871 unsigned NumElems = VT.getVectorNumElements();
5873 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5874 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5875 LD->getPointerInfo().getWithOffset(StartOffset),
5876 false, false, false, 0);
5878 SmallVector<int, 8> Mask;
5879 for (unsigned i = 0; i != NumElems; ++i)
5880 Mask.push_back(EltNo);
5882 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5888 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5889 /// vector of type 'VT', see if the elements can be replaced by a single large
5890 /// load which has the same value as a build_vector whose operands are 'elts'.
5892 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5894 /// FIXME: we'd also like to handle the case where the last elements are zero
5895 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5896 /// There's even a handy isZeroNode for that purpose.
5897 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5898 SDLoc &DL, SelectionDAG &DAG,
5899 bool isAfterLegalize) {
5900 EVT EltVT = VT.getVectorElementType();
5901 unsigned NumElems = Elts.size();
5903 LoadSDNode *LDBase = nullptr;
5904 unsigned LastLoadedElt = -1U;
5906 // For each element in the initializer, see if we've found a load or an undef.
5907 // If we don't find an initial load element, or later load elements are
5908 // non-consecutive, bail out.
5909 for (unsigned i = 0; i < NumElems; ++i) {
5910 SDValue Elt = Elts[i];
5912 if (!Elt.getNode() ||
5913 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5916 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5918 LDBase = cast<LoadSDNode>(Elt.getNode());
5922 if (Elt.getOpcode() == ISD::UNDEF)
5925 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5926 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5931 // If we have found an entire vector of loads and undefs, then return a large
5932 // load of the entire vector width starting at the base pointer. If we found
5933 // consecutive loads for the low half, generate a vzext_load node.
5934 if (LastLoadedElt == NumElems - 1) {
5936 if (isAfterLegalize &&
5937 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5940 SDValue NewLd = SDValue();
5942 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5943 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5944 LDBase->getPointerInfo(),
5945 LDBase->isVolatile(), LDBase->isNonTemporal(),
5946 LDBase->isInvariant(), 0);
5947 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5948 LDBase->getPointerInfo(),
5949 LDBase->isVolatile(), LDBase->isNonTemporal(),
5950 LDBase->isInvariant(), LDBase->getAlignment());
5952 if (LDBase->hasAnyUseOfValue(1)) {
5953 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5955 SDValue(NewLd.getNode(), 1));
5956 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5957 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5958 SDValue(NewLd.getNode(), 1));
5963 if (NumElems == 4 && LastLoadedElt == 1 &&
5964 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5965 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5966 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5968 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5969 LDBase->getPointerInfo(),
5970 LDBase->getAlignment(),
5971 false/*isVolatile*/, true/*ReadMem*/,
5974 // Make sure the newly-created LOAD is in the same position as LDBase in
5975 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5976 // update uses of LDBase's output chain to use the TokenFactor.
5977 if (LDBase->hasAnyUseOfValue(1)) {
5978 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5979 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5980 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5981 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5982 SDValue(ResNode.getNode(), 1));
5985 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
5990 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
5991 /// to generate a splat value for the following cases:
5992 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
5993 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
5994 /// a scalar load, or a constant.
5995 /// The VBROADCAST node is returned when a pattern is found,
5996 /// or SDValue() otherwise.
5997 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
5998 SelectionDAG &DAG) {
5999 if (!Subtarget->hasFp256())
6002 MVT VT = Op.getSimpleValueType();
6005 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6006 "Unsupported vector type for broadcast.");
6011 switch (Op.getOpcode()) {
6013 // Unknown pattern found.
6016 case ISD::BUILD_VECTOR: {
6017 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6018 BitVector UndefElements;
6019 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6021 // We need a splat of a single value to use broadcast, and it doesn't
6022 // make any sense if the value is only in one element of the vector.
6023 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6027 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6028 Ld.getOpcode() == ISD::ConstantFP);
6030 // Make sure that all of the users of a non-constant load are from the
6031 // BUILD_VECTOR node.
6032 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6037 case ISD::VECTOR_SHUFFLE: {
6038 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6040 // Shuffles must have a splat mask where the first element is
6042 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6045 SDValue Sc = Op.getOperand(0);
6046 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6047 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6049 if (!Subtarget->hasInt256())
6052 // Use the register form of the broadcast instruction available on AVX2.
6053 if (VT.getSizeInBits() >= 256)
6054 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6055 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6058 Ld = Sc.getOperand(0);
6059 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6060 Ld.getOpcode() == ISD::ConstantFP);
6062 // The scalar_to_vector node and the suspected
6063 // load node must have exactly one user.
6064 // Constants may have multiple users.
6066 // AVX-512 has register version of the broadcast
6067 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6068 Ld.getValueType().getSizeInBits() >= 32;
6069 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6076 bool IsGE256 = (VT.getSizeInBits() >= 256);
6078 // Handle the broadcasting a single constant scalar from the constant pool
6079 // into a vector. On Sandybridge it is still better to load a constant vector
6080 // from the constant pool and not to broadcast it from a scalar.
6081 if (ConstSplatVal && Subtarget->hasInt256()) {
6082 EVT CVT = Ld.getValueType();
6083 assert(!CVT.isVector() && "Must not broadcast a vector type");
6084 unsigned ScalarSize = CVT.getSizeInBits();
6086 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)) {
6087 const Constant *C = nullptr;
6088 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6089 C = CI->getConstantIntValue();
6090 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6091 C = CF->getConstantFPValue();
6093 assert(C && "Invalid constant type");
6095 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6096 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6097 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6098 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6099 MachinePointerInfo::getConstantPool(),
6100 false, false, false, Alignment);
6102 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6106 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6107 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6109 // Handle AVX2 in-register broadcasts.
6110 if (!IsLoad && Subtarget->hasInt256() &&
6111 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6112 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6114 // The scalar source must be a normal load.
6118 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6119 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6121 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6122 // double since there is no vbroadcastsd xmm
6123 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6124 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6125 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6128 // Unsupported broadcast.
6132 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6133 /// underlying vector and index.
6135 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6137 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6139 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6140 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6143 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6145 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6147 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6148 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6151 // In this case the vector is the extract_subvector expression and the index
6152 // is 2, as specified by the shuffle.
6153 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6154 SDValue ShuffleVec = SVOp->getOperand(0);
6155 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6156 assert(ShuffleVecVT.getVectorElementType() ==
6157 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6159 int ShuffleIdx = SVOp->getMaskElt(Idx);
6160 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6161 ExtractedFromVec = ShuffleVec;
6167 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6168 MVT VT = Op.getSimpleValueType();
6170 // Skip if insert_vec_elt is not supported.
6171 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6172 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6176 unsigned NumElems = Op.getNumOperands();
6180 SmallVector<unsigned, 4> InsertIndices;
6181 SmallVector<int, 8> Mask(NumElems, -1);
6183 for (unsigned i = 0; i != NumElems; ++i) {
6184 unsigned Opc = Op.getOperand(i).getOpcode();
6186 if (Opc == ISD::UNDEF)
6189 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6190 // Quit if more than 1 elements need inserting.
6191 if (InsertIndices.size() > 1)
6194 InsertIndices.push_back(i);
6198 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6199 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6200 // Quit if non-constant index.
6201 if (!isa<ConstantSDNode>(ExtIdx))
6203 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6205 // Quit if extracted from vector of different type.
6206 if (ExtractedFromVec.getValueType() != VT)
6209 if (!VecIn1.getNode())
6210 VecIn1 = ExtractedFromVec;
6211 else if (VecIn1 != ExtractedFromVec) {
6212 if (!VecIn2.getNode())
6213 VecIn2 = ExtractedFromVec;
6214 else if (VecIn2 != ExtractedFromVec)
6215 // Quit if more than 2 vectors to shuffle
6219 if (ExtractedFromVec == VecIn1)
6221 else if (ExtractedFromVec == VecIn2)
6222 Mask[i] = Idx + NumElems;
6225 if (!VecIn1.getNode())
6228 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6229 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6230 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6231 unsigned Idx = InsertIndices[i];
6232 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6233 DAG.getIntPtrConstant(Idx));
6239 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6241 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6243 MVT VT = Op.getSimpleValueType();
6244 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6245 "Unexpected type in LowerBUILD_VECTORvXi1!");
6248 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6249 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6250 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6251 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6254 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6255 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6256 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6257 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6260 bool AllContants = true;
6261 uint64_t Immediate = 0;
6262 int NonConstIdx = -1;
6263 bool IsSplat = true;
6264 unsigned NumNonConsts = 0;
6265 unsigned NumConsts = 0;
6266 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6267 SDValue In = Op.getOperand(idx);
6268 if (In.getOpcode() == ISD::UNDEF)
6270 if (!isa<ConstantSDNode>(In)) {
6271 AllContants = false;
6277 if (cast<ConstantSDNode>(In)->getZExtValue())
6278 Immediate |= (1ULL << idx);
6280 if (In != Op.getOperand(0))
6285 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6286 DAG.getConstant(Immediate, MVT::i16));
6287 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6288 DAG.getIntPtrConstant(0));
6291 if (NumNonConsts == 1 && NonConstIdx != 0) {
6294 SDValue VecAsImm = DAG.getConstant(Immediate,
6295 MVT::getIntegerVT(VT.getSizeInBits()));
6296 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6299 DstVec = DAG.getUNDEF(VT);
6300 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6301 Op.getOperand(NonConstIdx),
6302 DAG.getIntPtrConstant(NonConstIdx));
6304 if (!IsSplat && (NonConstIdx != 0))
6305 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6306 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6309 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6310 DAG.getConstant(-1, SelectVT),
6311 DAG.getConstant(0, SelectVT));
6313 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6314 DAG.getConstant((Immediate | 1), SelectVT),
6315 DAG.getConstant(Immediate, SelectVT));
6316 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6319 /// \brief Return true if \p N implements a horizontal binop and return the
6320 /// operands for the horizontal binop into V0 and V1.
6322 /// This is a helper function of PerformBUILD_VECTORCombine.
6323 /// This function checks that the build_vector \p N in input implements a
6324 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6325 /// operation to match.
6326 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6327 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6328 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6331 /// This function only analyzes elements of \p N whose indices are
6332 /// in range [BaseIdx, LastIdx).
6333 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6335 unsigned BaseIdx, unsigned LastIdx,
6336 SDValue &V0, SDValue &V1) {
6337 EVT VT = N->getValueType(0);
6339 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6340 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6341 "Invalid Vector in input!");
6343 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6344 bool CanFold = true;
6345 unsigned ExpectedVExtractIdx = BaseIdx;
6346 unsigned NumElts = LastIdx - BaseIdx;
6347 V0 = DAG.getUNDEF(VT);
6348 V1 = DAG.getUNDEF(VT);
6350 // Check if N implements a horizontal binop.
6351 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6352 SDValue Op = N->getOperand(i + BaseIdx);
6355 if (Op->getOpcode() == ISD::UNDEF) {
6356 // Update the expected vector extract index.
6357 if (i * 2 == NumElts)
6358 ExpectedVExtractIdx = BaseIdx;
6359 ExpectedVExtractIdx += 2;
6363 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6368 SDValue Op0 = Op.getOperand(0);
6369 SDValue Op1 = Op.getOperand(1);
6371 // Try to match the following pattern:
6372 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6373 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6374 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6375 Op0.getOperand(0) == Op1.getOperand(0) &&
6376 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6377 isa<ConstantSDNode>(Op1.getOperand(1)));
6381 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6382 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6384 if (i * 2 < NumElts) {
6385 if (V0.getOpcode() == ISD::UNDEF)
6386 V0 = Op0.getOperand(0);
6388 if (V1.getOpcode() == ISD::UNDEF)
6389 V1 = Op0.getOperand(0);
6390 if (i * 2 == NumElts)
6391 ExpectedVExtractIdx = BaseIdx;
6394 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6395 if (I0 == ExpectedVExtractIdx)
6396 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6397 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6398 // Try to match the following dag sequence:
6399 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6400 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6404 ExpectedVExtractIdx += 2;
6410 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6411 /// a concat_vector.
6413 /// This is a helper function of PerformBUILD_VECTORCombine.
6414 /// This function expects two 256-bit vectors called V0 and V1.
6415 /// At first, each vector is split into two separate 128-bit vectors.
6416 /// Then, the resulting 128-bit vectors are used to implement two
6417 /// horizontal binary operations.
6419 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6421 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6422 /// the two new horizontal binop.
6423 /// When Mode is set, the first horizontal binop dag node would take as input
6424 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6425 /// horizontal binop dag node would take as input the lower 128-bit of V1
6426 /// and the upper 128-bit of V1.
6428 /// HADD V0_LO, V0_HI
6429 /// HADD V1_LO, V1_HI
6431 /// Otherwise, the first horizontal binop dag node takes as input the lower
6432 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6433 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6435 /// HADD V0_LO, V1_LO
6436 /// HADD V0_HI, V1_HI
6438 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6439 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6440 /// the upper 128-bits of the result.
6441 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6442 SDLoc DL, SelectionDAG &DAG,
6443 unsigned X86Opcode, bool Mode,
6444 bool isUndefLO, bool isUndefHI) {
6445 EVT VT = V0.getValueType();
6446 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6447 "Invalid nodes in input!");
6449 unsigned NumElts = VT.getVectorNumElements();
6450 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6451 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6452 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6453 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6454 EVT NewVT = V0_LO.getValueType();
6456 SDValue LO = DAG.getUNDEF(NewVT);
6457 SDValue HI = DAG.getUNDEF(NewVT);
6460 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6461 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6462 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6463 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6464 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6466 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6467 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6468 V1_LO->getOpcode() != ISD::UNDEF))
6469 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6471 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6472 V1_HI->getOpcode() != ISD::UNDEF))
6473 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6476 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6479 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6480 /// sequence of 'vadd + vsub + blendi'.
6481 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6482 const X86Subtarget *Subtarget) {
6484 EVT VT = BV->getValueType(0);
6485 unsigned NumElts = VT.getVectorNumElements();
6486 SDValue InVec0 = DAG.getUNDEF(VT);
6487 SDValue InVec1 = DAG.getUNDEF(VT);
6489 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6490 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6492 // Odd-numbered elements in the input build vector are obtained from
6493 // adding two integer/float elements.
6494 // Even-numbered elements in the input build vector are obtained from
6495 // subtracting two integer/float elements.
6496 unsigned ExpectedOpcode = ISD::FSUB;
6497 unsigned NextExpectedOpcode = ISD::FADD;
6498 bool AddFound = false;
6499 bool SubFound = false;
6501 for (unsigned i = 0, e = NumElts; i != e; i++) {
6502 SDValue Op = BV->getOperand(i);
6504 // Skip 'undef' values.
6505 unsigned Opcode = Op.getOpcode();
6506 if (Opcode == ISD::UNDEF) {
6507 std::swap(ExpectedOpcode, NextExpectedOpcode);
6511 // Early exit if we found an unexpected opcode.
6512 if (Opcode != ExpectedOpcode)
6515 SDValue Op0 = Op.getOperand(0);
6516 SDValue Op1 = Op.getOperand(1);
6518 // Try to match the following pattern:
6519 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6520 // Early exit if we cannot match that sequence.
6521 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6522 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6523 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6524 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6525 Op0.getOperand(1) != Op1.getOperand(1))
6528 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6532 // We found a valid add/sub node. Update the information accordingly.
6538 // Update InVec0 and InVec1.
6539 if (InVec0.getOpcode() == ISD::UNDEF)
6540 InVec0 = Op0.getOperand(0);
6541 if (InVec1.getOpcode() == ISD::UNDEF)
6542 InVec1 = Op1.getOperand(0);
6544 // Make sure that operands in input to each add/sub node always
6545 // come from a same pair of vectors.
6546 if (InVec0 != Op0.getOperand(0)) {
6547 if (ExpectedOpcode == ISD::FSUB)
6550 // FADD is commutable. Try to commute the operands
6551 // and then test again.
6552 std::swap(Op0, Op1);
6553 if (InVec0 != Op0.getOperand(0))
6557 if (InVec1 != Op1.getOperand(0))
6560 // Update the pair of expected opcodes.
6561 std::swap(ExpectedOpcode, NextExpectedOpcode);
6564 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6565 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6566 InVec1.getOpcode() != ISD::UNDEF)
6567 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6572 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6573 const X86Subtarget *Subtarget) {
6575 EVT VT = N->getValueType(0);
6576 unsigned NumElts = VT.getVectorNumElements();
6577 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6578 SDValue InVec0, InVec1;
6580 // Try to match an ADDSUB.
6581 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6582 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6583 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6584 if (Value.getNode())
6588 // Try to match horizontal ADD/SUB.
6589 unsigned NumUndefsLO = 0;
6590 unsigned NumUndefsHI = 0;
6591 unsigned Half = NumElts/2;
6593 // Count the number of UNDEF operands in the build_vector in input.
6594 for (unsigned i = 0, e = Half; i != e; ++i)
6595 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6598 for (unsigned i = Half, e = NumElts; i != e; ++i)
6599 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6602 // Early exit if this is either a build_vector of all UNDEFs or all the
6603 // operands but one are UNDEF.
6604 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6607 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6608 // Try to match an SSE3 float HADD/HSUB.
6609 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6610 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6612 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6613 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6614 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6615 // Try to match an SSSE3 integer HADD/HSUB.
6616 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6617 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6619 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6620 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6623 if (!Subtarget->hasAVX())
6626 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6627 // Try to match an AVX horizontal add/sub of packed single/double
6628 // precision floating point values from 256-bit vectors.
6629 SDValue InVec2, InVec3;
6630 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6631 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6632 ((InVec0.getOpcode() == ISD::UNDEF ||
6633 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6634 ((InVec1.getOpcode() == ISD::UNDEF ||
6635 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6636 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6638 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6639 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6640 ((InVec0.getOpcode() == ISD::UNDEF ||
6641 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6642 ((InVec1.getOpcode() == ISD::UNDEF ||
6643 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6644 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6645 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6646 // Try to match an AVX2 horizontal add/sub of signed integers.
6647 SDValue InVec2, InVec3;
6649 bool CanFold = true;
6651 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6652 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6653 ((InVec0.getOpcode() == ISD::UNDEF ||
6654 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6655 ((InVec1.getOpcode() == ISD::UNDEF ||
6656 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6657 X86Opcode = X86ISD::HADD;
6658 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6659 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6660 ((InVec0.getOpcode() == ISD::UNDEF ||
6661 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6662 ((InVec1.getOpcode() == ISD::UNDEF ||
6663 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6664 X86Opcode = X86ISD::HSUB;
6669 // Fold this build_vector into a single horizontal add/sub.
6670 // Do this only if the target has AVX2.
6671 if (Subtarget->hasAVX2())
6672 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6674 // Do not try to expand this build_vector into a pair of horizontal
6675 // add/sub if we can emit a pair of scalar add/sub.
6676 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6679 // Convert this build_vector into a pair of horizontal binop followed by
6681 bool isUndefLO = NumUndefsLO == Half;
6682 bool isUndefHI = NumUndefsHI == Half;
6683 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6684 isUndefLO, isUndefHI);
6688 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6689 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6691 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6692 X86Opcode = X86ISD::HADD;
6693 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6694 X86Opcode = X86ISD::HSUB;
6695 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6696 X86Opcode = X86ISD::FHADD;
6697 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6698 X86Opcode = X86ISD::FHSUB;
6702 // Don't try to expand this build_vector into a pair of horizontal add/sub
6703 // if we can simply emit a pair of scalar add/sub.
6704 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6707 // Convert this build_vector into two horizontal add/sub followed by
6709 bool isUndefLO = NumUndefsLO == Half;
6710 bool isUndefHI = NumUndefsHI == Half;
6711 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6712 isUndefLO, isUndefHI);
6719 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6722 MVT VT = Op.getSimpleValueType();
6723 MVT ExtVT = VT.getVectorElementType();
6724 unsigned NumElems = Op.getNumOperands();
6726 // Generate vectors for predicate vectors.
6727 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6728 return LowerBUILD_VECTORvXi1(Op, DAG);
6730 // Vectors containing all zeros can be matched by pxor and xorps later
6731 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6732 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6733 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6734 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6737 return getZeroVector(VT, Subtarget, DAG, dl);
6740 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6741 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6742 // vpcmpeqd on 256-bit vectors.
6743 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6744 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6747 if (!VT.is512BitVector())
6748 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6751 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6752 if (Broadcast.getNode())
6755 unsigned EVTBits = ExtVT.getSizeInBits();
6757 unsigned NumZero = 0;
6758 unsigned NumNonZero = 0;
6759 unsigned NonZeros = 0;
6760 bool IsAllConstants = true;
6761 SmallSet<SDValue, 8> Values;
6762 for (unsigned i = 0; i < NumElems; ++i) {
6763 SDValue Elt = Op.getOperand(i);
6764 if (Elt.getOpcode() == ISD::UNDEF)
6767 if (Elt.getOpcode() != ISD::Constant &&
6768 Elt.getOpcode() != ISD::ConstantFP)
6769 IsAllConstants = false;
6770 if (X86::isZeroNode(Elt))
6773 NonZeros |= (1 << i);
6778 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6779 if (NumNonZero == 0)
6780 return DAG.getUNDEF(VT);
6782 // Special case for single non-zero, non-undef, element.
6783 if (NumNonZero == 1) {
6784 unsigned Idx = countTrailingZeros(NonZeros);
6785 SDValue Item = Op.getOperand(Idx);
6787 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6788 // the value are obviously zero, truncate the value to i32 and do the
6789 // insertion that way. Only do this if the value is non-constant or if the
6790 // value is a constant being inserted into element 0. It is cheaper to do
6791 // a constant pool load than it is to do a movd + shuffle.
6792 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6793 (!IsAllConstants || Idx == 0)) {
6794 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6796 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6797 EVT VecVT = MVT::v4i32;
6798 unsigned VecElts = 4;
6800 // Truncate the value (which may itself be a constant) to i32, and
6801 // convert it to a vector with movd (S2V+shuffle to zero extend).
6802 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6803 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6805 // If using the new shuffle lowering, just directly insert this.
6806 if (ExperimentalVectorShuffleLowering)
6808 ISD::BITCAST, dl, VT,
6809 getShuffleVectorZeroOrUndef(Item, Idx * 2, true, Subtarget, DAG));
6811 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6813 // Now we have our 32-bit value zero extended in the low element of
6814 // a vector. If Idx != 0, swizzle it into place.
6816 SmallVector<int, 4> Mask;
6817 Mask.push_back(Idx);
6818 for (unsigned i = 1; i != VecElts; ++i)
6820 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6823 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6827 // If we have a constant or non-constant insertion into the low element of
6828 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6829 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6830 // depending on what the source datatype is.
6833 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6835 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6836 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6837 if (VT.is256BitVector() || VT.is512BitVector()) {
6838 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6839 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6840 Item, DAG.getIntPtrConstant(0));
6842 assert(VT.is128BitVector() && "Expected an SSE value type!");
6843 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6844 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6845 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6848 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6849 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6850 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6851 if (VT.is256BitVector()) {
6852 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6853 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6855 assert(VT.is128BitVector() && "Expected an SSE value type!");
6856 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6858 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6862 // Is it a vector logical left shift?
6863 if (NumElems == 2 && Idx == 1 &&
6864 X86::isZeroNode(Op.getOperand(0)) &&
6865 !X86::isZeroNode(Op.getOperand(1))) {
6866 unsigned NumBits = VT.getSizeInBits();
6867 return getVShift(true, VT,
6868 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6869 VT, Op.getOperand(1)),
6870 NumBits/2, DAG, *this, dl);
6873 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6876 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6877 // is a non-constant being inserted into an element other than the low one,
6878 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6879 // movd/movss) to move this into the low element, then shuffle it into
6881 if (EVTBits == 32) {
6882 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6884 // If using the new shuffle lowering, just directly insert this.
6885 if (ExperimentalVectorShuffleLowering)
6886 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6888 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6889 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6890 SmallVector<int, 8> MaskVec;
6891 for (unsigned i = 0; i != NumElems; ++i)
6892 MaskVec.push_back(i == Idx ? 0 : 1);
6893 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6897 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6898 if (Values.size() == 1) {
6899 if (EVTBits == 32) {
6900 // Instead of a shuffle like this:
6901 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6902 // Check if it's possible to issue this instead.
6903 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6904 unsigned Idx = countTrailingZeros(NonZeros);
6905 SDValue Item = Op.getOperand(Idx);
6906 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6907 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6912 // A vector full of immediates; various special cases are already
6913 // handled, so this is best done with a single constant-pool load.
6917 // For AVX-length vectors, build the individual 128-bit pieces and use
6918 // shuffles to put them in place.
6919 if (VT.is256BitVector() || VT.is512BitVector()) {
6920 SmallVector<SDValue, 64> V;
6921 for (unsigned i = 0; i != NumElems; ++i)
6922 V.push_back(Op.getOperand(i));
6924 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6926 // Build both the lower and upper subvector.
6927 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6928 makeArrayRef(&V[0], NumElems/2));
6929 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6930 makeArrayRef(&V[NumElems / 2], NumElems/2));
6932 // Recreate the wider vector with the lower and upper part.
6933 if (VT.is256BitVector())
6934 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6935 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6938 // Let legalizer expand 2-wide build_vectors.
6939 if (EVTBits == 64) {
6940 if (NumNonZero == 1) {
6941 // One half is zero or undef.
6942 unsigned Idx = countTrailingZeros(NonZeros);
6943 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6944 Op.getOperand(Idx));
6945 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6950 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6951 if (EVTBits == 8 && NumElems == 16) {
6952 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6954 if (V.getNode()) return V;
6957 if (EVTBits == 16 && NumElems == 8) {
6958 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6960 if (V.getNode()) return V;
6963 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6964 if (EVTBits == 32 && NumElems == 4) {
6965 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
6966 NumZero, DAG, Subtarget, *this);
6971 // If element VT is == 32 bits, turn it into a number of shuffles.
6972 SmallVector<SDValue, 8> V(NumElems);
6973 if (NumElems == 4 && NumZero > 0) {
6974 for (unsigned i = 0; i < 4; ++i) {
6975 bool isZero = !(NonZeros & (1 << i));
6977 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
6979 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
6982 for (unsigned i = 0; i < 2; ++i) {
6983 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
6986 V[i] = V[i*2]; // Must be a zero vector.
6989 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
6992 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
6995 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7000 bool Reverse1 = (NonZeros & 0x3) == 2;
7001 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7005 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7006 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7008 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7011 if (Values.size() > 1 && VT.is128BitVector()) {
7012 // Check for a build vector of consecutive loads.
7013 for (unsigned i = 0; i < NumElems; ++i)
7014 V[i] = Op.getOperand(i);
7016 // Check for elements which are consecutive loads.
7017 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7021 // Check for a build vector from mostly shuffle plus few inserting.
7022 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7026 // For SSE 4.1, use insertps to put the high elements into the low element.
7027 if (getSubtarget()->hasSSE41()) {
7029 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7030 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7032 Result = DAG.getUNDEF(VT);
7034 for (unsigned i = 1; i < NumElems; ++i) {
7035 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7036 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7037 Op.getOperand(i), DAG.getIntPtrConstant(i));
7042 // Otherwise, expand into a number of unpckl*, start by extending each of
7043 // our (non-undef) elements to the full vector width with the element in the
7044 // bottom slot of the vector (which generates no code for SSE).
7045 for (unsigned i = 0; i < NumElems; ++i) {
7046 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7047 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7049 V[i] = DAG.getUNDEF(VT);
7052 // Next, we iteratively mix elements, e.g. for v4f32:
7053 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7054 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7055 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7056 unsigned EltStride = NumElems >> 1;
7057 while (EltStride != 0) {
7058 for (unsigned i = 0; i < EltStride; ++i) {
7059 // If V[i+EltStride] is undef and this is the first round of mixing,
7060 // then it is safe to just drop this shuffle: V[i] is already in the
7061 // right place, the one element (since it's the first round) being
7062 // inserted as undef can be dropped. This isn't safe for successive
7063 // rounds because they will permute elements within both vectors.
7064 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7065 EltStride == NumElems/2)
7068 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7077 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7078 // to create 256-bit vectors from two other 128-bit ones.
7079 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7081 MVT ResVT = Op.getSimpleValueType();
7083 assert((ResVT.is256BitVector() ||
7084 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7086 SDValue V1 = Op.getOperand(0);
7087 SDValue V2 = Op.getOperand(1);
7088 unsigned NumElems = ResVT.getVectorNumElements();
7089 if(ResVT.is256BitVector())
7090 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7092 if (Op.getNumOperands() == 4) {
7093 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7094 ResVT.getVectorNumElements()/2);
7095 SDValue V3 = Op.getOperand(2);
7096 SDValue V4 = Op.getOperand(3);
7097 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7098 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7100 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7103 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7104 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7105 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7106 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7107 Op.getNumOperands() == 4)));
7109 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7110 // from two other 128-bit ones.
7112 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7113 return LowerAVXCONCAT_VECTORS(Op, DAG);
7117 //===----------------------------------------------------------------------===//
7118 // Vector shuffle lowering
7120 // This is an experimental code path for lowering vector shuffles on x86. It is
7121 // designed to handle arbitrary vector shuffles and blends, gracefully
7122 // degrading performance as necessary. It works hard to recognize idiomatic
7123 // shuffles and lower them to optimal instruction patterns without leaving
7124 // a framework that allows reasonably efficient handling of all vector shuffle
7126 //===----------------------------------------------------------------------===//
7128 /// \brief Tiny helper function to identify a no-op mask.
7130 /// This is a somewhat boring predicate function. It checks whether the mask
7131 /// array input, which is assumed to be a single-input shuffle mask of the kind
7132 /// used by the X86 shuffle instructions (not a fully general
7133 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7134 /// in-place shuffle are 'no-op's.
7135 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7136 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7137 if (Mask[i] != -1 && Mask[i] != i)
7142 /// \brief Helper function to classify a mask as a single-input mask.
7144 /// This isn't a generic single-input test because in the vector shuffle
7145 /// lowering we canonicalize single inputs to be the first input operand. This
7146 /// means we can more quickly test for a single input by only checking whether
7147 /// an input from the second operand exists. We also assume that the size of
7148 /// mask corresponds to the size of the input vectors which isn't true in the
7149 /// fully general case.
7150 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7152 if (M >= (int)Mask.size())
7157 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7158 // 2013 will allow us to use it as a non-type template parameter.
7161 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7163 /// See its documentation for details.
7164 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7165 if (Mask.size() != Args.size())
7167 for (int i = 0, e = Mask.size(); i < e; ++i) {
7168 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7169 if (Mask[i] != -1 && Mask[i] != *Args[i])
7177 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7180 /// This is a fast way to test a shuffle mask against a fixed pattern:
7182 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7184 /// It returns true if the mask is exactly as wide as the argument list, and
7185 /// each element of the mask is either -1 (signifying undef) or the value given
7186 /// in the argument.
7187 static const VariadicFunction1<
7188 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7190 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7192 /// This helper function produces an 8-bit shuffle immediate corresponding to
7193 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7194 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7197 /// NB: We rely heavily on "undef" masks preserving the input lane.
7198 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7199 SelectionDAG &DAG) {
7200 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7201 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7202 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7203 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7204 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7207 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7208 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7209 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7210 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7211 return DAG.getConstant(Imm, MVT::i8);
7214 /// \brief Try to emit a blend instruction for a shuffle.
7216 /// This doesn't do any checks for the availability of instructions for blending
7217 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7218 /// be matched in the backend with the type given. What it does check for is
7219 /// that the shuffle mask is in fact a blend.
7220 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7221 SDValue V2, ArrayRef<int> Mask,
7222 SelectionDAG &DAG) {
7224 unsigned BlendMask = 0;
7225 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7226 if (Mask[i] >= Size) {
7227 if (Mask[i] != i + Size)
7228 return SDValue(); // Shuffled V2 input!
7229 BlendMask |= 1u << i;
7232 if (Mask[i] >= 0 && Mask[i] != i)
7233 return SDValue(); // Shuffled V1 input!
7235 switch (VT.SimpleTy) {
7240 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7241 DAG.getConstant(BlendMask, MVT::i8));
7246 // For integer shuffles we need to expand the mask and cast the inputs to
7247 // v8i16s prior to blending.
7248 int Scale = 8 / VT.getVectorNumElements();
7250 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7251 if (Mask[i] >= Size)
7252 for (int j = 0; j < Scale; ++j)
7253 BlendMask |= 1u << (i * Scale + j);
7255 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7256 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7257 return DAG.getNode(ISD::BITCAST, DL, VT,
7258 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7259 DAG.getConstant(BlendMask, MVT::i8)));
7263 llvm_unreachable("Not a supported integer vector type!");
7267 /// \brief Try to lower a vector shuffle as a byte rotation.
7269 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7270 /// byte-rotation of a the concatentation of two vectors. This routine will
7271 /// try to generically lower a vector shuffle through such an instruction. It
7272 /// does not check for the availability of PALIGNR-based lowerings, only the
7273 /// applicability of this strategy to the given mask. This matches shuffle
7274 /// vectors that look like:
7276 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7278 /// Essentially it concatenates V1 and V2, shifts right by some number of
7279 /// elements, and takes the low elements as the result. Note that while this is
7280 /// specified as a *right shift* because x86 is little-endian, it is a *left
7281 /// rotate* of the vector lanes.
7283 /// Note that this only handles 128-bit vector widths currently.
7284 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7287 SelectionDAG &DAG) {
7288 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7290 // We need to detect various ways of spelling a rotation:
7291 // [11, 12, 13, 14, 15, 0, 1, 2]
7292 // [-1, 12, 13, 14, -1, -1, 1, -1]
7293 // [-1, -1, -1, -1, -1, -1, 1, 2]
7294 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7295 // [-1, 4, 5, 6, -1, -1, 9, -1]
7296 // [-1, 4, 5, 6, -1, -1, -1, -1]
7299 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7302 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7304 // Based on the mod-Size value of this mask element determine where
7305 // a rotated vector would have started.
7306 int StartIdx = i - (Mask[i] % Size);
7308 // The identity rotation isn't interesting, stop.
7311 // If we found the tail of a vector the rotation must be the missing
7312 // front. If we found the head of a vector, it must be how much of the head.
7313 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7316 Rotation = CandidateRotation;
7317 else if (Rotation != CandidateRotation)
7318 // The rotations don't match, so we can't match this mask.
7321 // Compute which value this mask is pointing at.
7322 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7324 // Compute which of the two target values this index should be assigned to.
7325 // This reflects whether the high elements are remaining or the low elements
7327 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7329 // Either set up this value if we've not encountered it before, or check
7330 // that it remains consistent.
7333 else if (TargetV != MaskV)
7334 // This may be a rotation, but it pulls from the inputs in some
7335 // unsupported interleaving.
7339 // Check that we successfully analyzed the mask, and normalize the results.
7340 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7341 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7347 // Cast the inputs to v16i8 to match PALIGNR.
7348 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7349 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7351 assert(VT.getSizeInBits() == 128 &&
7352 "Rotate-based lowering only supports 128-bit lowering!");
7353 assert(Mask.size() <= 16 &&
7354 "Can shuffle at most 16 bytes in a 128-bit vector!");
7355 // The actual rotate instruction rotates bytes, so we need to scale the
7356 // rotation based on how many bytes are in the vector.
7357 int Scale = 16 / Mask.size();
7359 return DAG.getNode(ISD::BITCAST, DL, VT,
7360 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7361 DAG.getConstant(Rotation * Scale, MVT::i8)));
7364 /// \brief Compute whether each element of a shuffle is zeroable.
7366 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7367 /// Either it is an undef element in the shuffle mask, the element of the input
7368 /// referenced is undef, or the element of the input referenced is known to be
7369 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7370 /// as many lanes with this technique as possible to simplify the remaining
7372 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7373 SDValue V1, SDValue V2) {
7374 SmallBitVector Zeroable(Mask.size(), false);
7376 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7377 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7379 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7381 // Handle the easy cases.
7382 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7387 // If this is an index into a build_vector node, dig out the input value and
7389 SDValue V = M < Size ? V1 : V2;
7390 if (V.getOpcode() != ISD::BUILD_VECTOR)
7393 SDValue Input = V.getOperand(M % Size);
7394 // The UNDEF opcode check really should be dead code here, but not quite
7395 // worth asserting on (it isn't invalid, just unexpected).
7396 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7403 /// \brief Lower a vector shuffle as a zero or any extension.
7405 /// Given a specific number of elements, element bit width, and extension
7406 /// stride, produce either a zero or any extension based on the available
7407 /// features of the subtarget.
7408 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7409 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7410 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7411 assert(Scale > 1 && "Need a scale to extend.");
7412 int EltBits = VT.getSizeInBits() / NumElements;
7413 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7414 "Only 8, 16, and 32 bit elements can be extended.");
7415 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7417 // Found a valid zext mask! Try various lowering strategies based on the
7418 // input type and available ISA extensions.
7419 if (Subtarget->hasSSE41()) {
7420 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7421 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7422 NumElements / Scale);
7423 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7424 return DAG.getNode(ISD::BITCAST, DL, VT,
7425 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7428 // For any extends we can cheat for larger element sizes and use shuffle
7429 // instructions that can fold with a load and/or copy.
7430 if (AnyExt && EltBits == 32) {
7431 int PSHUFDMask[4] = {0, -1, 1, -1};
7433 ISD::BITCAST, DL, VT,
7434 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7435 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7436 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7438 if (AnyExt && EltBits == 16 && Scale > 2) {
7439 int PSHUFDMask[4] = {0, -1, 0, -1};
7440 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7441 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7442 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7443 int PSHUFHWMask[4] = {1, -1, -1, -1};
7445 ISD::BITCAST, DL, VT,
7446 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7447 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7448 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7451 // If this would require more than 2 unpack instructions to expand, use
7452 // pshufb when available. We can only use more than 2 unpack instructions
7453 // when zero extending i8 elements which also makes it easier to use pshufb.
7454 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7455 assert(NumElements == 16 && "Unexpected byte vector width!");
7456 SDValue PSHUFBMask[16];
7457 for (int i = 0; i < 16; ++i)
7459 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7460 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7461 return DAG.getNode(ISD::BITCAST, DL, VT,
7462 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7463 DAG.getNode(ISD::BUILD_VECTOR, DL,
7464 MVT::v16i8, PSHUFBMask)));
7467 // Otherwise emit a sequence of unpacks.
7469 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7470 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7471 : getZeroVector(InputVT, Subtarget, DAG, DL);
7472 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7473 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7477 } while (Scale > 1);
7478 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7481 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7483 /// This routine will try to do everything in its power to cleverly lower
7484 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7485 /// check for the profitability of this lowering, it tries to aggressively
7486 /// match this pattern. It will use all of the micro-architectural details it
7487 /// can to emit an efficient lowering. It handles both blends with all-zero
7488 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7489 /// masking out later).
7491 /// The reason we have dedicated lowering for zext-style shuffles is that they
7492 /// are both incredibly common and often quite performance sensitive.
7493 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7494 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7495 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7496 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7498 int Bits = VT.getSizeInBits();
7499 int NumElements = Mask.size();
7501 // Define a helper function to check a particular ext-scale and lower to it if
7503 auto Lower = [&](int Scale) -> SDValue {
7506 for (int i = 0; i < NumElements; ++i) {
7508 continue; // Valid anywhere but doesn't tell us anything.
7509 if (i % Scale != 0) {
7510 // Each of the extend elements needs to be zeroable.
7514 // We no lorger are in the anyext case.
7519 // Each of the base elements needs to be consecutive indices into the
7520 // same input vector.
7521 SDValue V = Mask[i] < NumElements ? V1 : V2;
7524 else if (InputV != V)
7525 return SDValue(); // Flip-flopping inputs.
7527 if (Mask[i] % NumElements != i / Scale)
7528 return SDValue(); // Non-consecutive strided elemenst.
7531 // If we fail to find an input, we have a zero-shuffle which should always
7532 // have already been handled.
7533 // FIXME: Maybe handle this here in case during blending we end up with one?
7537 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7538 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7541 // The widest scale possible for extending is to a 64-bit integer.
7542 assert(Bits % 64 == 0 &&
7543 "The number of bits in a vector must be divisible by 64 on x86!");
7544 int NumExtElements = Bits / 64;
7546 // Each iteration, try extending the elements half as much, but into twice as
7548 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7549 assert(NumElements % NumExtElements == 0 &&
7550 "The input vector size must be divisble by the extended size.");
7551 if (SDValue V = Lower(NumElements / NumExtElements))
7555 // No viable ext lowering found.
7559 /// \brief Try to lower insertion of a single element into a zero vector.
7561 /// This is a common pattern that we have especially efficient patterns to lower
7562 /// across all subtarget feature sets.
7563 static SDValue lowerVectorShuffleAsElementInsertion(
7564 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7565 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7566 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7568 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7569 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7571 if (Mask.size() == 2) {
7572 if (!Zeroable[V2Index ^ 1]) {
7573 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7574 // with 2 to flip from {2,3} to {0,1} and vice versa.
7575 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7576 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7577 if (Zeroable[V2Index])
7578 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7584 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7585 if (i != V2Index && !Zeroable[i])
7586 return SDValue(); // Not inserting into a zero vector.
7589 // Step over any bitcasts on either input so we can scan the actual
7590 // BUILD_VECTOR nodes.
7591 while (V1.getOpcode() == ISD::BITCAST)
7592 V1 = V1.getOperand(0);
7593 while (V2.getOpcode() == ISD::BITCAST)
7594 V2 = V2.getOperand(0);
7596 // Check for a single input from a SCALAR_TO_VECTOR node.
7597 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7598 // all the smarts here sunk into that routine. However, the current
7599 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7600 // vector shuffle lowering is dead.
7601 if (!((V2.getOpcode() == ISD::SCALAR_TO_VECTOR &&
7602 Mask[V2Index] == (int)Mask.size()) ||
7603 V2.getOpcode() == ISD::BUILD_VECTOR))
7606 SDValue V2S = V2.getOperand(Mask[V2Index] - Mask.size());
7608 // First, we need to zext the scalar if it is smaller than an i32.
7610 MVT EltVT = VT.getVectorElementType();
7611 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7612 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7613 // Zero-extend directly to i32.
7615 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7618 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7619 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7621 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7624 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7625 // the desired position. Otherwise it is more efficient to do a vector
7626 // shift left. We know that we can do a vector shift left because all
7627 // the inputs are zero.
7628 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7629 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7630 V2Shuffle[V2Index] = 0;
7631 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7633 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7635 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7637 V2Index * EltVT.getSizeInBits(),
7638 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7639 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7645 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7647 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7648 /// support for floating point shuffles but not integer shuffles. These
7649 /// instructions will incur a domain crossing penalty on some chips though so
7650 /// it is better to avoid lowering through this for integer vectors where
7652 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7653 const X86Subtarget *Subtarget,
7654 SelectionDAG &DAG) {
7656 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7657 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7658 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7659 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7660 ArrayRef<int> Mask = SVOp->getMask();
7661 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7663 if (isSingleInputShuffleMask(Mask)) {
7664 // Straight shuffle of a single input vector. Simulate this by using the
7665 // single input as both of the "inputs" to this instruction..
7666 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7668 if (Subtarget->hasAVX()) {
7669 // If we have AVX, we can use VPERMILPS which will allow folding a load
7670 // into the shuffle.
7671 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v2f64, V1,
7672 DAG.getConstant(SHUFPDMask, MVT::i8));
7675 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7676 DAG.getConstant(SHUFPDMask, MVT::i8));
7678 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7679 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7681 // Use dedicated unpack instructions for masks that match their pattern.
7682 if (isShuffleEquivalent(Mask, 0, 2))
7683 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7684 if (isShuffleEquivalent(Mask, 1, 3))
7685 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7687 // If we have a single input, insert that into V1 if we can do so cheaply.
7688 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7689 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7690 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7693 if (Subtarget->hasSSE41())
7695 lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask, DAG))
7698 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7699 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7700 DAG.getConstant(SHUFPDMask, MVT::i8));
7703 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7705 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7706 /// the integer unit to minimize domain crossing penalties. However, for blends
7707 /// it falls back to the floating point shuffle operation with appropriate bit
7709 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7710 const X86Subtarget *Subtarget,
7711 SelectionDAG &DAG) {
7713 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7714 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7715 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7716 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7717 ArrayRef<int> Mask = SVOp->getMask();
7718 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7720 if (isSingleInputShuffleMask(Mask)) {
7721 // Straight shuffle of a single input vector. For everything from SSE2
7722 // onward this has a single fast instruction with no scary immediates.
7723 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7724 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7725 int WidenedMask[4] = {
7726 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7727 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7729 ISD::BITCAST, DL, MVT::v2i64,
7730 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7731 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7734 // Use dedicated unpack instructions for masks that match their pattern.
7735 if (isShuffleEquivalent(Mask, 0, 2))
7736 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7737 if (isShuffleEquivalent(Mask, 1, 3))
7738 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7740 // If we have a single input from V2 insert that into V1 if we can do so
7742 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7743 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7744 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7747 if (Subtarget->hasSSE41())
7749 lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask, DAG))
7752 // Try to use rotation instructions if available.
7753 if (Subtarget->hasSSSE3())
7754 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7755 DL, MVT::v2i64, V1, V2, Mask, DAG))
7758 // We implement this with SHUFPD which is pretty lame because it will likely
7759 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7760 // However, all the alternatives are still more cycles and newer chips don't
7761 // have this problem. It would be really nice if x86 had better shuffles here.
7762 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7763 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7764 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7765 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7768 /// \brief Lower a vector shuffle using the SHUFPS instruction.
7770 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
7771 /// It makes no assumptions about whether this is the *best* lowering, it simply
7773 static SDValue lowerVectorShuffleWithSHUPFS(SDLoc DL, MVT VT,
7774 ArrayRef<int> Mask, SDValue V1,
7775 SDValue V2, SelectionDAG &DAG) {
7776 SDValue LowV = V1, HighV = V2;
7777 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7780 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7782 if (NumV2Elements == 1) {
7784 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7787 // Compute the index adjacent to V2Index and in the same half by toggling
7789 int V2AdjIndex = V2Index ^ 1;
7791 if (Mask[V2AdjIndex] == -1) {
7792 // Handles all the cases where we have a single V2 element and an undef.
7793 // This will only ever happen in the high lanes because we commute the
7794 // vector otherwise.
7796 std::swap(LowV, HighV);
7797 NewMask[V2Index] -= 4;
7799 // Handle the case where the V2 element ends up adjacent to a V1 element.
7800 // To make this work, blend them together as the first step.
7801 int V1Index = V2AdjIndex;
7802 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7803 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
7804 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7806 // Now proceed to reconstruct the final blend as we have the necessary
7807 // high or low half formed.
7814 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7815 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7817 } else if (NumV2Elements == 2) {
7818 if (Mask[0] < 4 && Mask[1] < 4) {
7819 // Handle the easy case where we have V1 in the low lanes and V2 in the
7820 // high lanes. We never see this reversed because we sort the shuffle.
7824 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
7825 // trying to place elements directly, just blend them and set up the final
7826 // shuffle to place them.
7828 // The first two blend mask elements are for V1, the second two are for
7830 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
7831 Mask[2] < 4 ? Mask[2] : Mask[3],
7832 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
7833 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
7834 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
7835 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7837 // Now we do a normal shuffle of V1 by giving V1 as both operands to
7840 NewMask[0] = Mask[0] < 4 ? 0 : 2;
7841 NewMask[1] = Mask[0] < 4 ? 2 : 0;
7842 NewMask[2] = Mask[2] < 4 ? 1 : 3;
7843 NewMask[3] = Mask[2] < 4 ? 3 : 1;
7846 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
7847 getV4X86ShuffleImm8ForMask(NewMask, DAG));
7850 /// \brief Lower 4-lane 32-bit floating point shuffles.
7852 /// Uses instructions exclusively from the floating point unit to minimize
7853 /// domain crossing penalties, as these are sufficient to implement all v4f32
7855 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7856 const X86Subtarget *Subtarget,
7857 SelectionDAG &DAG) {
7859 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
7860 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7861 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7862 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7863 ArrayRef<int> Mask = SVOp->getMask();
7864 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7867 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7869 if (NumV2Elements == 0) {
7870 if (Subtarget->hasAVX()) {
7871 // If we have AVX, we can use VPERMILPS which will allow folding a load
7872 // into the shuffle.
7873 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f32, V1,
7874 getV4X86ShuffleImm8ForMask(Mask, DAG));
7877 // Otherwise, use a straight shuffle of a single input vector. We pass the
7878 // input vector to both operands to simulate this with a SHUFPS.
7879 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
7880 getV4X86ShuffleImm8ForMask(Mask, DAG));
7883 // Use dedicated unpack instructions for masks that match their pattern.
7884 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7885 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
7886 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7887 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
7889 // There are special ways we can lower some single-element blends. However, we
7890 // have custom ways we can lower more complex single-element blends below that
7891 // we defer to if both this and BLENDPS fail to match, so restrict this to
7892 // when the V2 input is targeting element 0 of the mask -- that is the fast
7894 if (NumV2Elements == 1 && Mask[0] >= 4)
7895 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
7896 Mask, Subtarget, DAG))
7899 if (Subtarget->hasSSE41())
7901 lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask, DAG))
7904 // Check for whether we can use INSERTPS to perform the blend. We only use
7905 // INSERTPS when the V1 elements are already in the correct locations
7906 // because otherwise we can just always use two SHUFPS instructions which
7907 // are much smaller to encode than a SHUFPS and an INSERTPS.
7908 if (NumV2Elements == 1 && Subtarget->hasSSE41()) {
7910 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7913 // When using INSERTPS we can zero any lane of the destination. Collect
7914 // the zero inputs into a mask and drop them from the lanes of V1 which
7915 // actually need to be present as inputs to the INSERTPS.
7916 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7918 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
7919 bool InsertNeedsShuffle = false;
7921 for (int i = 0; i < 4; ++i)
7925 } else if (Mask[i] != i) {
7926 InsertNeedsShuffle = true;
7931 // We don't want to use INSERTPS or other insertion techniques if it will
7932 // require shuffling anyways.
7933 if (!InsertNeedsShuffle) {
7934 // If all of V1 is zeroable, replace it with undef.
7935 if ((ZMask | 1 << V2Index) == 0xF)
7936 V1 = DAG.getUNDEF(MVT::v4f32);
7938 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
7939 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
7941 // Insert the V2 element into the desired position.
7942 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
7943 DAG.getConstant(InsertPSMask, MVT::i8));
7947 // Otherwise fall back to a SHUFPS lowering strategy.
7948 return lowerVectorShuffleWithSHUPFS(DL, MVT::v4f32, Mask, V1, V2, DAG);
7951 /// \brief Lower 4-lane i32 vector shuffles.
7953 /// We try to handle these with integer-domain shuffles where we can, but for
7954 /// blends we use the floating point domain blend instructions.
7955 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7956 const X86Subtarget *Subtarget,
7957 SelectionDAG &DAG) {
7959 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
7960 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7961 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7962 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7963 ArrayRef<int> Mask = SVOp->getMask();
7964 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7967 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7969 if (NumV2Elements == 0) {
7970 // Straight shuffle of a single input vector. For everything from SSE2
7971 // onward this has a single fast instruction with no scary immediates.
7972 // We coerce the shuffle pattern to be compatible with UNPCK instructions
7973 // but we aren't actually going to use the UNPCK instruction because doing
7974 // so prevents folding a load into this instruction or making a copy.
7975 const int UnpackLoMask[] = {0, 0, 1, 1};
7976 const int UnpackHiMask[] = {2, 2, 3, 3};
7977 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
7978 Mask = UnpackLoMask;
7979 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
7980 Mask = UnpackHiMask;
7982 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
7983 getV4X86ShuffleImm8ForMask(Mask, DAG));
7986 // Whenever we can lower this as a zext, that instruction is strictly faster
7987 // than any alternative.
7988 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
7989 Mask, Subtarget, DAG))
7992 // Use dedicated unpack instructions for masks that match their pattern.
7993 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7994 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
7995 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7996 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
7998 // There are special ways we can lower some single-element blends.
7999 if (NumV2Elements == 1)
8000 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
8001 Mask, Subtarget, DAG))
8004 if (Subtarget->hasSSE41())
8006 lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask, DAG))
8009 // Try to use rotation instructions if available.
8010 if (Subtarget->hasSSSE3())
8011 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8012 DL, MVT::v4i32, V1, V2, Mask, DAG))
8015 // We implement this with SHUFPS because it can blend from two vectors.
8016 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8017 // up the inputs, bypassing domain shift penalties that we would encur if we
8018 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8020 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8021 DAG.getVectorShuffle(
8023 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8024 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8027 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8028 /// shuffle lowering, and the most complex part.
8030 /// The lowering strategy is to try to form pairs of input lanes which are
8031 /// targeted at the same half of the final vector, and then use a dword shuffle
8032 /// to place them onto the right half, and finally unpack the paired lanes into
8033 /// their final position.
8035 /// The exact breakdown of how to form these dword pairs and align them on the
8036 /// correct sides is really tricky. See the comments within the function for
8037 /// more of the details.
8038 static SDValue lowerV8I16SingleInputVectorShuffle(
8039 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8040 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8041 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8042 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8043 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8045 SmallVector<int, 4> LoInputs;
8046 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8047 [](int M) { return M >= 0; });
8048 std::sort(LoInputs.begin(), LoInputs.end());
8049 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8050 SmallVector<int, 4> HiInputs;
8051 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8052 [](int M) { return M >= 0; });
8053 std::sort(HiInputs.begin(), HiInputs.end());
8054 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8056 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8057 int NumHToL = LoInputs.size() - NumLToL;
8059 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8060 int NumHToH = HiInputs.size() - NumLToH;
8061 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8062 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8063 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8064 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8066 // Use dedicated unpack instructions for masks that match their pattern.
8067 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8068 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8069 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8070 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8072 // Try to use rotation instructions if available.
8073 if (Subtarget->hasSSSE3())
8074 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8075 DL, MVT::v8i16, V, V, Mask, DAG))
8078 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8079 // such inputs we can swap two of the dwords across the half mark and end up
8080 // with <=2 inputs to each half in each half. Once there, we can fall through
8081 // to the generic code below. For example:
8083 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8084 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8086 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8087 // and an existing 2-into-2 on the other half. In this case we may have to
8088 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8089 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8090 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8091 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8092 // half than the one we target for fixing) will be fixed when we re-enter this
8093 // path. We will also combine away any sequence of PSHUFD instructions that
8094 // result into a single instruction. Here is an example of the tricky case:
8096 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8097 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8099 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8101 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8102 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8104 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8105 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8107 // The result is fine to be handled by the generic logic.
8108 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8109 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8110 int AOffset, int BOffset) {
8111 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8112 "Must call this with A having 3 or 1 inputs from the A half.");
8113 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8114 "Must call this with B having 1 or 3 inputs from the B half.");
8115 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8116 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8118 // Compute the index of dword with only one word among the three inputs in
8119 // a half by taking the sum of the half with three inputs and subtracting
8120 // the sum of the actual three inputs. The difference is the remaining
8123 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8124 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8125 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8126 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8127 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8128 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8129 int TripleNonInputIdx =
8130 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8131 TripleDWord = TripleNonInputIdx / 2;
8133 // We use xor with one to compute the adjacent DWord to whichever one the
8135 OneInputDWord = (OneInput / 2) ^ 1;
8137 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8138 // and BToA inputs. If there is also such a problem with the BToB and AToB
8139 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8140 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8141 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8142 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8143 // Compute how many inputs will be flipped by swapping these DWords. We
8145 // to balance this to ensure we don't form a 3-1 shuffle in the other
8147 int NumFlippedAToBInputs =
8148 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8149 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8150 int NumFlippedBToBInputs =
8151 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8152 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8153 if ((NumFlippedAToBInputs == 1 &&
8154 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8155 (NumFlippedBToBInputs == 1 &&
8156 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8157 // We choose whether to fix the A half or B half based on whether that
8158 // half has zero flipped inputs. At zero, we may not be able to fix it
8159 // with that half. We also bias towards fixing the B half because that
8160 // will more commonly be the high half, and we have to bias one way.
8161 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8162 ArrayRef<int> Inputs) {
8163 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8164 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8165 PinnedIdx ^ 1) != Inputs.end();
8166 // Determine whether the free index is in the flipped dword or the
8167 // unflipped dword based on where the pinned index is. We use this bit
8168 // in an xor to conditionally select the adjacent dword.
8169 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8170 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8171 FixFreeIdx) != Inputs.end();
8172 if (IsFixIdxInput == IsFixFreeIdxInput)
8174 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8175 FixFreeIdx) != Inputs.end();
8176 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8177 "We need to be changing the number of flipped inputs!");
8178 int PSHUFHalfMask[] = {0, 1, 2, 3};
8179 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8180 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8182 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8185 if (M != -1 && M == FixIdx)
8187 else if (M != -1 && M == FixFreeIdx)
8190 if (NumFlippedBToBInputs != 0) {
8192 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8193 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8195 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8197 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8198 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8203 int PSHUFDMask[] = {0, 1, 2, 3};
8204 PSHUFDMask[ADWord] = BDWord;
8205 PSHUFDMask[BDWord] = ADWord;
8206 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8207 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8208 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8209 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8211 // Adjust the mask to match the new locations of A and B.
8213 if (M != -1 && M/2 == ADWord)
8214 M = 2 * BDWord + M % 2;
8215 else if (M != -1 && M/2 == BDWord)
8216 M = 2 * ADWord + M % 2;
8218 // Recurse back into this routine to re-compute state now that this isn't
8219 // a 3 and 1 problem.
8220 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8223 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8224 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8225 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8226 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8228 // At this point there are at most two inputs to the low and high halves from
8229 // each half. That means the inputs can always be grouped into dwords and
8230 // those dwords can then be moved to the correct half with a dword shuffle.
8231 // We use at most one low and one high word shuffle to collect these paired
8232 // inputs into dwords, and finally a dword shuffle to place them.
8233 int PSHUFLMask[4] = {-1, -1, -1, -1};
8234 int PSHUFHMask[4] = {-1, -1, -1, -1};
8235 int PSHUFDMask[4] = {-1, -1, -1, -1};
8237 // First fix the masks for all the inputs that are staying in their
8238 // original halves. This will then dictate the targets of the cross-half
8240 auto fixInPlaceInputs =
8241 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8242 MutableArrayRef<int> SourceHalfMask,
8243 MutableArrayRef<int> HalfMask, int HalfOffset) {
8244 if (InPlaceInputs.empty())
8246 if (InPlaceInputs.size() == 1) {
8247 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8248 InPlaceInputs[0] - HalfOffset;
8249 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8252 if (IncomingInputs.empty()) {
8253 // Just fix all of the in place inputs.
8254 for (int Input : InPlaceInputs) {
8255 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8256 PSHUFDMask[Input / 2] = Input / 2;
8261 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8262 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8263 InPlaceInputs[0] - HalfOffset;
8264 // Put the second input next to the first so that they are packed into
8265 // a dword. We find the adjacent index by toggling the low bit.
8266 int AdjIndex = InPlaceInputs[0] ^ 1;
8267 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8268 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8269 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8271 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8272 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8274 // Now gather the cross-half inputs and place them into a free dword of
8275 // their target half.
8276 // FIXME: This operation could almost certainly be simplified dramatically to
8277 // look more like the 3-1 fixing operation.
8278 auto moveInputsToRightHalf = [&PSHUFDMask](
8279 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8280 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8281 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8283 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8284 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8286 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8288 int LowWord = Word & ~1;
8289 int HighWord = Word | 1;
8290 return isWordClobbered(SourceHalfMask, LowWord) ||
8291 isWordClobbered(SourceHalfMask, HighWord);
8294 if (IncomingInputs.empty())
8297 if (ExistingInputs.empty()) {
8298 // Map any dwords with inputs from them into the right half.
8299 for (int Input : IncomingInputs) {
8300 // If the source half mask maps over the inputs, turn those into
8301 // swaps and use the swapped lane.
8302 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8303 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8304 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8305 Input - SourceOffset;
8306 // We have to swap the uses in our half mask in one sweep.
8307 for (int &M : HalfMask)
8308 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8310 else if (M == Input)
8311 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8313 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8314 Input - SourceOffset &&
8315 "Previous placement doesn't match!");
8317 // Note that this correctly re-maps both when we do a swap and when
8318 // we observe the other side of the swap above. We rely on that to
8319 // avoid swapping the members of the input list directly.
8320 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8323 // Map the input's dword into the correct half.
8324 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8325 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8327 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8329 "Previous placement doesn't match!");
8332 // And just directly shift any other-half mask elements to be same-half
8333 // as we will have mirrored the dword containing the element into the
8334 // same position within that half.
8335 for (int &M : HalfMask)
8336 if (M >= SourceOffset && M < SourceOffset + 4) {
8337 M = M - SourceOffset + DestOffset;
8338 assert(M >= 0 && "This should never wrap below zero!");
8343 // Ensure we have the input in a viable dword of its current half. This
8344 // is particularly tricky because the original position may be clobbered
8345 // by inputs being moved and *staying* in that half.
8346 if (IncomingInputs.size() == 1) {
8347 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8348 int InputFixed = std::find(std::begin(SourceHalfMask),
8349 std::end(SourceHalfMask), -1) -
8350 std::begin(SourceHalfMask) + SourceOffset;
8351 SourceHalfMask[InputFixed - SourceOffset] =
8352 IncomingInputs[0] - SourceOffset;
8353 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8355 IncomingInputs[0] = InputFixed;
8357 } else if (IncomingInputs.size() == 2) {
8358 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8359 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8360 // We have two non-adjacent or clobbered inputs we need to extract from
8361 // the source half. To do this, we need to map them into some adjacent
8362 // dword slot in the source mask.
8363 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8364 IncomingInputs[1] - SourceOffset};
8366 // If there is a free slot in the source half mask adjacent to one of
8367 // the inputs, place the other input in it. We use (Index XOR 1) to
8368 // compute an adjacent index.
8369 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8370 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8371 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8372 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8373 InputsFixed[1] = InputsFixed[0] ^ 1;
8374 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8375 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8376 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8377 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8378 InputsFixed[0] = InputsFixed[1] ^ 1;
8379 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8380 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8381 // The two inputs are in the same DWord but it is clobbered and the
8382 // adjacent DWord isn't used at all. Move both inputs to the free
8384 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8385 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8386 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8387 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8389 // The only way we hit this point is if there is no clobbering
8390 // (because there are no off-half inputs to this half) and there is no
8391 // free slot adjacent to one of the inputs. In this case, we have to
8392 // swap an input with a non-input.
8393 for (int i = 0; i < 4; ++i)
8394 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8395 "We can't handle any clobbers here!");
8396 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8397 "Cannot have adjacent inputs here!");
8399 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8400 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8402 // We also have to update the final source mask in this case because
8403 // it may need to undo the above swap.
8404 for (int &M : FinalSourceHalfMask)
8405 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8406 M = InputsFixed[1] + SourceOffset;
8407 else if (M == InputsFixed[1] + SourceOffset)
8408 M = (InputsFixed[0] ^ 1) + SourceOffset;
8410 InputsFixed[1] = InputsFixed[0] ^ 1;
8413 // Point everything at the fixed inputs.
8414 for (int &M : HalfMask)
8415 if (M == IncomingInputs[0])
8416 M = InputsFixed[0] + SourceOffset;
8417 else if (M == IncomingInputs[1])
8418 M = InputsFixed[1] + SourceOffset;
8420 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8421 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8424 llvm_unreachable("Unhandled input size!");
8427 // Now hoist the DWord down to the right half.
8428 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8429 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8430 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8431 for (int &M : HalfMask)
8432 for (int Input : IncomingInputs)
8434 M = FreeDWord * 2 + Input % 2;
8436 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8437 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8438 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8439 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8441 // Now enact all the shuffles we've computed to move the inputs into their
8443 if (!isNoopShuffleMask(PSHUFLMask))
8444 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8445 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8446 if (!isNoopShuffleMask(PSHUFHMask))
8447 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8448 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8449 if (!isNoopShuffleMask(PSHUFDMask))
8450 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8451 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8452 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8453 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8455 // At this point, each half should contain all its inputs, and we can then
8456 // just shuffle them into their final position.
8457 assert(std::count_if(LoMask.begin(), LoMask.end(),
8458 [](int M) { return M >= 4; }) == 0 &&
8459 "Failed to lift all the high half inputs to the low mask!");
8460 assert(std::count_if(HiMask.begin(), HiMask.end(),
8461 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8462 "Failed to lift all the low half inputs to the high mask!");
8464 // Do a half shuffle for the low mask.
8465 if (!isNoopShuffleMask(LoMask))
8466 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8467 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8469 // Do a half shuffle with the high mask after shifting its values down.
8470 for (int &M : HiMask)
8473 if (!isNoopShuffleMask(HiMask))
8474 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8475 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8480 /// \brief Detect whether the mask pattern should be lowered through
8483 /// This essentially tests whether viewing the mask as an interleaving of two
8484 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8485 /// lowering it through interleaving is a significantly better strategy.
8486 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8487 int NumEvenInputs[2] = {0, 0};
8488 int NumOddInputs[2] = {0, 0};
8489 int NumLoInputs[2] = {0, 0};
8490 int NumHiInputs[2] = {0, 0};
8491 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8495 int InputIdx = Mask[i] >= Size;
8498 ++NumLoInputs[InputIdx];
8500 ++NumHiInputs[InputIdx];
8503 ++NumEvenInputs[InputIdx];
8505 ++NumOddInputs[InputIdx];
8508 // The minimum number of cross-input results for both the interleaved and
8509 // split cases. If interleaving results in fewer cross-input results, return
8511 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8512 NumEvenInputs[0] + NumOddInputs[1]);
8513 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8514 NumLoInputs[0] + NumHiInputs[1]);
8515 return InterleavedCrosses < SplitCrosses;
8518 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8520 /// This strategy only works when the inputs from each vector fit into a single
8521 /// half of that vector, and generally there are not so many inputs as to leave
8522 /// the in-place shuffles required highly constrained (and thus expensive). It
8523 /// shifts all the inputs into a single side of both input vectors and then
8524 /// uses an unpack to interleave these inputs in a single vector. At that
8525 /// point, we will fall back on the generic single input shuffle lowering.
8526 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8528 MutableArrayRef<int> Mask,
8529 const X86Subtarget *Subtarget,
8530 SelectionDAG &DAG) {
8531 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8532 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8533 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8534 for (int i = 0; i < 8; ++i)
8535 if (Mask[i] >= 0 && Mask[i] < 4)
8536 LoV1Inputs.push_back(i);
8537 else if (Mask[i] >= 4 && Mask[i] < 8)
8538 HiV1Inputs.push_back(i);
8539 else if (Mask[i] >= 8 && Mask[i] < 12)
8540 LoV2Inputs.push_back(i);
8541 else if (Mask[i] >= 12)
8542 HiV2Inputs.push_back(i);
8544 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8545 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8548 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8549 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8550 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8552 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8553 HiV1Inputs.size() + HiV2Inputs.size();
8555 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8556 ArrayRef<int> HiInputs, bool MoveToLo,
8558 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8559 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8560 if (BadInputs.empty())
8563 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8564 int MoveOffset = MoveToLo ? 0 : 4;
8566 if (GoodInputs.empty()) {
8567 for (int BadInput : BadInputs) {
8568 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8569 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8572 if (GoodInputs.size() == 2) {
8573 // If the low inputs are spread across two dwords, pack them into
8575 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8576 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8577 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8578 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8580 // Otherwise pin the good inputs.
8581 for (int GoodInput : GoodInputs)
8582 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8585 if (BadInputs.size() == 2) {
8586 // If we have two bad inputs then there may be either one or two good
8587 // inputs fixed in place. Find a fixed input, and then find the *other*
8588 // two adjacent indices by using modular arithmetic.
8590 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8591 [](int M) { return M >= 0; }) -
8592 std::begin(MoveMask);
8594 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8595 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8596 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8597 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8598 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8599 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8600 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8602 assert(BadInputs.size() == 1 && "All sizes handled");
8603 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8604 std::end(MoveMask), -1) -
8605 std::begin(MoveMask);
8606 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8607 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8611 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8614 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8616 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8619 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8620 // cross-half traffic in the final shuffle.
8622 // Munge the mask to be a single-input mask after the unpack merges the
8626 M = 2 * (M % 4) + (M / 8);
8628 return DAG.getVectorShuffle(
8629 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8630 DL, MVT::v8i16, V1, V2),
8631 DAG.getUNDEF(MVT::v8i16), Mask);
8634 /// \brief Generic lowering of 8-lane i16 shuffles.
8636 /// This handles both single-input shuffles and combined shuffle/blends with
8637 /// two inputs. The single input shuffles are immediately delegated to
8638 /// a dedicated lowering routine.
8640 /// The blends are lowered in one of three fundamental ways. If there are few
8641 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8642 /// of the input is significantly cheaper when lowered as an interleaving of
8643 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8644 /// halves of the inputs separately (making them have relatively few inputs)
8645 /// and then concatenate them.
8646 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8647 const X86Subtarget *Subtarget,
8648 SelectionDAG &DAG) {
8650 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8651 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8652 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8653 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8654 ArrayRef<int> OrigMask = SVOp->getMask();
8655 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8656 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8657 MutableArrayRef<int> Mask(MaskStorage);
8659 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8661 // Whenever we can lower this as a zext, that instruction is strictly faster
8662 // than any alternative.
8663 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8664 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8667 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8668 auto isV2 = [](int M) { return M >= 8; };
8670 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8671 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8673 if (NumV2Inputs == 0)
8674 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8676 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8677 "to be V1-input shuffles.");
8679 // There are special ways we can lower some single-element blends.
8680 if (NumV2Inputs == 1)
8681 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8682 Mask, Subtarget, DAG))
8685 if (Subtarget->hasSSE41())
8687 lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
8690 // Try to use rotation instructions if available.
8691 if (Subtarget->hasSSSE3())
8692 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8695 if (NumV1Inputs + NumV2Inputs <= 4)
8696 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8698 // Check whether an interleaving lowering is likely to be more efficient.
8699 // This isn't perfect but it is a strong heuristic that tends to work well on
8700 // the kinds of shuffles that show up in practice.
8702 // FIXME: Handle 1x, 2x, and 4x interleaving.
8703 if (shouldLowerAsInterleaving(Mask)) {
8704 // FIXME: Figure out whether we should pack these into the low or high
8707 int EMask[8], OMask[8];
8708 for (int i = 0; i < 4; ++i) {
8709 EMask[i] = Mask[2*i];
8710 OMask[i] = Mask[2*i + 1];
8715 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8716 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8718 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8721 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8722 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8724 for (int i = 0; i < 4; ++i) {
8725 LoBlendMask[i] = Mask[i];
8726 HiBlendMask[i] = Mask[i + 4];
8729 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8730 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8731 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8732 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8734 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8735 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8738 /// \brief Check whether a compaction lowering can be done by dropping even
8739 /// elements and compute how many times even elements must be dropped.
8741 /// This handles shuffles which take every Nth element where N is a power of
8742 /// two. Example shuffle masks:
8744 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8745 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8746 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8747 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8748 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8749 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8751 /// Any of these lanes can of course be undef.
8753 /// This routine only supports N <= 3.
8754 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8757 /// \returns N above, or the number of times even elements must be dropped if
8758 /// there is such a number. Otherwise returns zero.
8759 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8760 // Figure out whether we're looping over two inputs or just one.
8761 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8763 // The modulus for the shuffle vector entries is based on whether this is
8764 // a single input or not.
8765 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8766 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8767 "We should only be called with masks with a power-of-2 size!");
8769 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8771 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8772 // and 2^3 simultaneously. This is because we may have ambiguity with
8773 // partially undef inputs.
8774 bool ViableForN[3] = {true, true, true};
8776 for (int i = 0, e = Mask.size(); i < e; ++i) {
8777 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8782 bool IsAnyViable = false;
8783 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8784 if (ViableForN[j]) {
8787 // The shuffle mask must be equal to (i * 2^N) % M.
8788 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8791 ViableForN[j] = false;
8793 // Early exit if we exhaust the possible powers of two.
8798 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8802 // Return 0 as there is no viable power of two.
8806 /// \brief Generic lowering of v16i8 shuffles.
8808 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8809 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8810 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
8811 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
8813 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8814 const X86Subtarget *Subtarget,
8815 SelectionDAG &DAG) {
8817 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
8818 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8819 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8820 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8821 ArrayRef<int> OrigMask = SVOp->getMask();
8822 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
8824 // Try to use rotation instructions if available.
8825 if (Subtarget->hasSSSE3())
8826 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
8830 // Try to use a zext lowering.
8831 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8832 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
8835 int MaskStorage[16] = {
8836 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8837 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
8838 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
8839 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
8840 MutableArrayRef<int> Mask(MaskStorage);
8841 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
8842 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
8845 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
8847 // For single-input shuffles, there are some nicer lowering tricks we can use.
8848 if (NumV2Elements == 0) {
8849 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
8850 // Notably, this handles splat and partial-splat shuffles more efficiently.
8851 // However, it only makes sense if the pre-duplication shuffle simplifies
8852 // things significantly. Currently, this means we need to be able to
8853 // express the pre-duplication shuffle as an i16 shuffle.
8855 // FIXME: We should check for other patterns which can be widened into an
8856 // i16 shuffle as well.
8857 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
8858 for (int i = 0; i < 16; i += 2)
8859 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
8864 auto tryToWidenViaDuplication = [&]() -> SDValue {
8865 if (!canWidenViaDuplication(Mask))
8867 SmallVector<int, 4> LoInputs;
8868 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
8869 [](int M) { return M >= 0 && M < 8; });
8870 std::sort(LoInputs.begin(), LoInputs.end());
8871 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
8873 SmallVector<int, 4> HiInputs;
8874 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
8875 [](int M) { return M >= 8; });
8876 std::sort(HiInputs.begin(), HiInputs.end());
8877 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
8880 bool TargetLo = LoInputs.size() >= HiInputs.size();
8881 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
8882 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
8884 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8885 SmallDenseMap<int, int, 8> LaneMap;
8886 for (int I : InPlaceInputs) {
8887 PreDupI16Shuffle[I/2] = I/2;
8890 int j = TargetLo ? 0 : 4, je = j + 4;
8891 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
8892 // Check if j is already a shuffle of this input. This happens when
8893 // there are two adjacent bytes after we move the low one.
8894 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
8895 // If we haven't yet mapped the input, search for a slot into which
8897 while (j < je && PreDupI16Shuffle[j] != -1)
8901 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
8904 // Map this input with the i16 shuffle.
8905 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
8908 // Update the lane map based on the mapping we ended up with.
8909 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
8912 ISD::BITCAST, DL, MVT::v16i8,
8913 DAG.getVectorShuffle(MVT::v8i16, DL,
8914 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8915 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
8917 // Unpack the bytes to form the i16s that will be shuffled into place.
8918 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8919 MVT::v16i8, V1, V1);
8921 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8922 for (int i = 0; i < 16; i += 2) {
8924 PostDupI16Shuffle[i / 2] = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
8925 assert(PostDupI16Shuffle[i / 2] < 8 && "Invalid v8 shuffle mask!");
8928 ISD::BITCAST, DL, MVT::v16i8,
8929 DAG.getVectorShuffle(MVT::v8i16, DL,
8930 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8931 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
8933 if (SDValue V = tryToWidenViaDuplication())
8937 // Check whether an interleaving lowering is likely to be more efficient.
8938 // This isn't perfect but it is a strong heuristic that tends to work well on
8939 // the kinds of shuffles that show up in practice.
8941 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
8942 if (shouldLowerAsInterleaving(Mask)) {
8943 // FIXME: Figure out whether we should pack these into the low or high
8946 int EMask[16], OMask[16];
8947 for (int i = 0; i < 8; ++i) {
8948 EMask[i] = Mask[2*i];
8949 OMask[i] = Mask[2*i + 1];
8954 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
8955 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
8957 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
8960 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
8961 // with PSHUFB. It is important to do this before we attempt to generate any
8962 // blends but after all of the single-input lowerings. If the single input
8963 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
8964 // want to preserve that and we can DAG combine any longer sequences into
8965 // a PSHUFB in the end. But once we start blending from multiple inputs,
8966 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
8967 // and there are *very* few patterns that would actually be faster than the
8968 // PSHUFB approach because of its ability to zero lanes.
8970 // FIXME: The only exceptions to the above are blends which are exact
8971 // interleavings with direct instructions supporting them. We currently don't
8972 // handle those well here.
8973 if (Subtarget->hasSSSE3()) {
8976 for (int i = 0; i < 16; ++i)
8977 if (Mask[i] == -1) {
8978 V1Mask[i] = V2Mask[i] = DAG.getConstant(0x80, MVT::i8);
8980 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
8982 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
8984 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
8985 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
8986 if (isSingleInputShuffleMask(Mask))
8987 return V1; // Single inputs are easy.
8989 // Otherwise, blend the two.
8990 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
8991 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
8992 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
8995 // There are special ways we can lower some single-element blends.
8996 if (NumV2Elements == 1)
8997 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
8998 Mask, Subtarget, DAG))
9001 // Check whether a compaction lowering can be done. This handles shuffles
9002 // which take every Nth element for some even N. See the helper function for
9005 // We special case these as they can be particularly efficiently handled with
9006 // the PACKUSB instruction on x86 and they show up in common patterns of
9007 // rearranging bytes to truncate wide elements.
9008 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9009 // NumEvenDrops is the power of two stride of the elements. Another way of
9010 // thinking about it is that we need to drop the even elements this many
9011 // times to get the original input.
9012 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9014 // First we need to zero all the dropped bytes.
9015 assert(NumEvenDrops <= 3 &&
9016 "No support for dropping even elements more than 3 times.");
9017 // We use the mask type to pick which bytes are preserved based on how many
9018 // elements are dropped.
9019 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9020 SDValue ByteClearMask =
9021 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9022 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9023 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9025 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9027 // Now pack things back together.
9028 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9029 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9030 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9031 for (int i = 1; i < NumEvenDrops; ++i) {
9032 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9033 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9039 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9040 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9041 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9042 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9044 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9045 MutableArrayRef<int> V1HalfBlendMask,
9046 MutableArrayRef<int> V2HalfBlendMask) {
9047 for (int i = 0; i < 8; ++i)
9048 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9049 V1HalfBlendMask[i] = HalfMask[i];
9051 } else if (HalfMask[i] >= 16) {
9052 V2HalfBlendMask[i] = HalfMask[i] - 16;
9053 HalfMask[i] = i + 8;
9056 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9057 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9059 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9061 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9062 MutableArrayRef<int> HiBlendMask) {
9064 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9065 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9067 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9068 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9069 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9070 [](int M) { return M >= 0 && M % 2 == 1; })) {
9071 // Use a mask to drop the high bytes.
9072 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9073 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9074 DAG.getConstant(0x00FF, MVT::v8i16));
9076 // This will be a single vector shuffle instead of a blend so nuke V2.
9077 V2 = DAG.getUNDEF(MVT::v8i16);
9079 // Squash the masks to point directly into V1.
9080 for (int &M : LoBlendMask)
9083 for (int &M : HiBlendMask)
9087 // Otherwise just unpack the low half of V into V1 and the high half into
9088 // V2 so that we can blend them as i16s.
9089 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9090 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9091 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9092 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9095 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9096 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9097 return std::make_pair(BlendedLo, BlendedHi);
9099 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9100 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9101 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9103 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9104 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9106 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9109 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9111 /// This routine breaks down the specific type of 128-bit shuffle and
9112 /// dispatches to the lowering routines accordingly.
9113 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9114 MVT VT, const X86Subtarget *Subtarget,
9115 SelectionDAG &DAG) {
9116 switch (VT.SimpleTy) {
9118 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9120 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9122 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9124 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9126 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9128 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9131 llvm_unreachable("Unimplemented!");
9135 /// \brief Test whether there are elements crossing 128-bit lanes in this
9138 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
9139 /// and we routinely test for these.
9140 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
9141 int LaneSize = 128 / VT.getScalarSizeInBits();
9142 int Size = Mask.size();
9143 for (int i = 0; i < Size; ++i)
9144 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9149 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
9151 /// This checks a shuffle mask to see if it is performing the same
9152 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
9153 /// that it is also not lane-crossing.
9154 static bool is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask) {
9155 int LaneSize = 128 / VT.getScalarSizeInBits();
9156 int Size = Mask.size();
9157 for (int i = LaneSize; i < Size; ++i)
9158 if (Mask[i] >= 0 && Mask[i] != (Mask[i % LaneSize] + (i / LaneSize) * LaneSize))
9163 /// \brief Generic routine to split a 256-bit vector shuffle into 128-bit
9166 /// There is a severely limited set of shuffles available in AVX1 for 256-bit
9167 /// vectors resulting in routinely needing to split the shuffle into two 128-bit
9168 /// shuffles. This can be done generically for any 256-bit vector shuffle and so
9169 /// we encode the logic here for specific shuffle lowering routines to bail to
9170 /// when they exhaust the features avaible to more directly handle the shuffle.
9171 static SDValue splitAndLower256BitVectorShuffle(SDValue Op, SDValue V1,
9173 const X86Subtarget *Subtarget,
9174 SelectionDAG &DAG) {
9176 MVT VT = Op.getSimpleValueType();
9177 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9178 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9179 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9180 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9181 ArrayRef<int> Mask = SVOp->getMask();
9183 ArrayRef<int> LoMask = Mask.slice(0, Mask.size()/2);
9184 ArrayRef<int> HiMask = Mask.slice(Mask.size()/2);
9186 int NumElements = VT.getVectorNumElements();
9187 int SplitNumElements = NumElements / 2;
9188 MVT ScalarVT = VT.getScalarType();
9189 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9191 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9192 DAG.getIntPtrConstant(0));
9193 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9194 DAG.getIntPtrConstant(SplitNumElements));
9195 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9196 DAG.getIntPtrConstant(0));
9197 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9198 DAG.getIntPtrConstant(SplitNumElements));
9200 // Now create two 4-way blends of these half-width vectors.
9201 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9202 SmallVector<int, 16> V1BlendMask, V2BlendMask, BlendMask;
9203 for (int i = 0; i < SplitNumElements; ++i) {
9204 int M = HalfMask[i];
9205 if (M >= NumElements) {
9206 V2BlendMask.push_back(M - NumElements);
9207 V1BlendMask.push_back(-1);
9208 BlendMask.push_back(SplitNumElements + i);
9209 } else if (M >= 0) {
9210 V2BlendMask.push_back(-1);
9211 V1BlendMask.push_back(M);
9212 BlendMask.push_back(i);
9214 V2BlendMask.push_back(-1);
9215 V1BlendMask.push_back(-1);
9216 BlendMask.push_back(-1);
9219 SDValue V1Blend = DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9220 SDValue V2Blend = DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9221 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9223 SDValue Lo = HalfBlend(LoMask);
9224 SDValue Hi = HalfBlend(HiMask);
9225 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9228 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9230 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9231 /// isn't available.
9232 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9233 const X86Subtarget *Subtarget,
9234 SelectionDAG &DAG) {
9236 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9237 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9238 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9239 ArrayRef<int> Mask = SVOp->getMask();
9240 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9242 if (is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask))
9243 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9245 if (isSingleInputShuffleMask(Mask)) {
9246 // Non-half-crossing single input shuffles can be lowerid with an
9247 // interleaved permutation.
9248 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9249 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9250 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f64, V1,
9251 DAG.getConstant(VPERMILPMask, MVT::i8));
9254 // X86 has dedicated unpack instructions that can handle specific blend
9255 // operations: UNPCKH and UNPCKL.
9256 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9257 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9258 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9259 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9261 // If we have a single input to the zero element, insert that into V1 if we
9262 // can do so cheaply.
9264 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9265 if (NumV2Elements == 1 && Mask[0] >= 4)
9266 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9267 MVT::v4f64, DL, V1, V2, Mask, Subtarget, DAG))
9271 lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask, DAG))
9274 // Check if the blend happens to exactly fit that of SHUFPD.
9275 if (Mask[0] < 4 && (Mask[1] == -1 || Mask[1] >= 4) &&
9276 Mask[2] < 4 && (Mask[3] == -1 || Mask[3] >= 4)) {
9277 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9278 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9279 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9280 DAG.getConstant(SHUFPDMask, MVT::i8));
9282 if ((Mask[0] == -1 || Mask[0] >= 4) && Mask[1] < 4 &&
9283 (Mask[2] == -1 || Mask[2] >= 4) && Mask[3] < 4) {
9284 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9285 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9286 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9287 DAG.getConstant(SHUFPDMask, MVT::i8));
9290 // Shuffle the input elements into the desired positions in V1 and V2 and
9291 // blend them together.
9292 int V1Mask[] = {-1, -1, -1, -1};
9293 int V2Mask[] = {-1, -1, -1, -1};
9294 for (int i = 0; i < 4; ++i)
9295 if (Mask[i] >= 0 && Mask[i] < 4)
9296 V1Mask[i] = Mask[i];
9297 else if (Mask[i] >= 4)
9298 V2Mask[i] = Mask[i] - 4;
9300 V1 = DAG.getVectorShuffle(MVT::v4f64, DL, V1, DAG.getUNDEF(MVT::v4f64), V1Mask);
9301 V2 = DAG.getVectorShuffle(MVT::v4f64, DL, V2, DAG.getUNDEF(MVT::v4f64), V2Mask);
9303 unsigned BlendMask = 0;
9304 for (int i = 0; i < 4; ++i)
9306 BlendMask |= 1 << i;
9308 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v4f64, V1, V2,
9309 DAG.getConstant(BlendMask, MVT::i8));
9312 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9314 /// Largely delegates to common code when we have AVX2 and to the floating-point
9315 /// code when we only have AVX.
9316 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9317 const X86Subtarget *Subtarget,
9318 SelectionDAG &DAG) {
9320 assert(Op.getSimpleValueType() == MVT::v4i64 && "Bad shuffle type!");
9321 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9322 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9323 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9324 ArrayRef<int> Mask = SVOp->getMask();
9325 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9327 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9328 // shuffles aren't a problem and FP and int have the same patterns.
9330 if (is128BitLaneCrossingShuffleMask(MVT::v4i64, Mask))
9331 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9333 // If we have a single input to the zero element, insert that into V1 if we
9334 // can do so cheaply.
9336 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9337 if (NumV2Elements == 1 && Mask[0] >= 4)
9338 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9339 MVT::v4i64, DL, V1, V2, Mask, Subtarget, DAG))
9342 // AVX1 doesn't provide any facilities for v4i64 shuffles, bitcast and
9343 // delegate to floating point code.
9344 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V1);
9345 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V2);
9346 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i64,
9347 lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG));
9350 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9352 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9353 /// isn't available.
9354 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9355 const X86Subtarget *Subtarget,
9356 SelectionDAG &DAG) {
9358 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9359 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9360 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9361 ArrayRef<int> Mask = SVOp->getMask();
9362 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9364 if (is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
9365 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9368 lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask, DAG))
9371 // If the shuffle mask is repeated in each 128-bit lane, we have many more
9372 // options to efficiently lower the shuffle.
9373 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask)) {
9374 ArrayRef<int> LoMask = Mask.slice(0, 4);
9375 if (isSingleInputShuffleMask(Mask))
9376 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v8f32, V1,
9377 getV4X86ShuffleImm8ForMask(LoMask, DAG));
9379 // Use dedicated unpack instructions for masks that match their pattern.
9380 if (isShuffleEquivalent(LoMask, 0, 8, 1, 9))
9381 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8f32, V1, V2);
9382 if (isShuffleEquivalent(LoMask, 2, 10, 3, 11))
9383 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8f32, V1, V2);
9385 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
9386 // have already handled any direct blends.
9387 int SHUFPSMask[] = {Mask[0], Mask[1], Mask[2], Mask[3]};
9388 for (int &M : SHUFPSMask)
9391 return lowerVectorShuffleWithSHUPFS(DL, MVT::v8f32, SHUFPSMask, V1, V2, DAG);
9394 if (isSingleInputShuffleMask(Mask))
9395 // FIXME: We can do better than just falling back blindly.
9396 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9398 // Shuffle the input elements into the desired positions in V1 and V2 and
9399 // blend them together.
9400 int V1Mask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9401 int V2Mask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9402 unsigned BlendMask = 0;
9403 for (int i = 0; i < 8; ++i)
9404 if (Mask[i] >= 0 && Mask[i] < 8) {
9405 V1Mask[i] = Mask[i];
9406 } else if (Mask[i] >= 8) {
9407 V2Mask[i] = Mask[i] - 8;
9408 BlendMask |= 1 << i;
9411 V1 = DAG.getVectorShuffle(MVT::v8f32, DL, V1, DAG.getUNDEF(MVT::v8f32), V1Mask);
9412 V2 = DAG.getVectorShuffle(MVT::v8f32, DL, V2, DAG.getUNDEF(MVT::v8f32), V2Mask);
9414 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v8f32, V1, V2,
9415 DAG.getConstant(BlendMask, MVT::i8));
9418 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9420 /// This routine either breaks down the specific type of a 256-bit x86 vector
9421 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9422 /// together based on the available instructions.
9423 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9424 MVT VT, const X86Subtarget *Subtarget,
9425 SelectionDAG &DAG) {
9426 switch (VT.SimpleTy) {
9428 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9430 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9432 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9436 // Fall back to the basic pattern of extracting the high half and forming
9438 // FIXME: Add targeted lowering for each type that can document rationale
9439 // for delegating to this when necessary.
9440 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9443 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9447 /// \brief Tiny helper function to test whether a shuffle mask could be
9448 /// simplified by widening the elements being shuffled.
9449 static bool canWidenShuffleElements(ArrayRef<int> Mask) {
9450 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9451 if ((Mask[i] != -1 && Mask[i] % 2 != 0) ||
9452 (Mask[i + 1] != -1 && (Mask[i + 1] % 2 != 1 ||
9453 (Mask[i] != -1 && Mask[i] + 1 != Mask[i + 1]))))
9459 /// \brief Top-level lowering for x86 vector shuffles.
9461 /// This handles decomposition, canonicalization, and lowering of all x86
9462 /// vector shuffles. Most of the specific lowering strategies are encapsulated
9463 /// above in helper routines. The canonicalization attempts to widen shuffles
9464 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
9465 /// s.t. only one of the two inputs needs to be tested, etc.
9466 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
9467 SelectionDAG &DAG) {
9468 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9469 ArrayRef<int> Mask = SVOp->getMask();
9470 SDValue V1 = Op.getOperand(0);
9471 SDValue V2 = Op.getOperand(1);
9472 MVT VT = Op.getSimpleValueType();
9473 int NumElements = VT.getVectorNumElements();
9476 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
9478 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
9479 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9480 if (V1IsUndef && V2IsUndef)
9481 return DAG.getUNDEF(VT);
9483 // When we create a shuffle node we put the UNDEF node to second operand,
9484 // but in some cases the first operand may be transformed to UNDEF.
9485 // In this case we should just commute the node.
9487 return DAG.getCommutedVectorShuffle(*SVOp);
9489 // Check for non-undef masks pointing at an undef vector and make the masks
9490 // undef as well. This makes it easier to match the shuffle based solely on
9494 if (M >= NumElements) {
9495 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
9496 for (int &M : NewMask)
9497 if (M >= NumElements)
9499 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
9502 // For integer vector shuffles, try to collapse them into a shuffle of fewer
9503 // lanes but wider integers. We cap this to not form integers larger than i64
9504 // but it might be interesting to form i128 integers to handle flipping the
9505 // low and high halves of AVX 256-bit vectors.
9506 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
9507 canWidenShuffleElements(Mask)) {
9508 SmallVector<int, 8> NewMask;
9509 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9510 NewMask.push_back(Mask[i] != -1
9512 : (Mask[i + 1] != -1 ? Mask[i + 1] / 2 : -1));
9514 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
9515 VT.getVectorNumElements() / 2);
9516 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
9517 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
9518 return DAG.getNode(ISD::BITCAST, dl, VT,
9519 DAG.getVectorShuffle(NewVT, dl, V1, V2, NewMask));
9522 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
9523 for (int M : SVOp->getMask())
9526 else if (M < NumElements)
9531 // Commute the shuffle as needed such that more elements come from V1 than
9532 // V2. This allows us to match the shuffle pattern strictly on how many
9533 // elements come from V1 without handling the symmetric cases.
9534 if (NumV2Elements > NumV1Elements)
9535 return DAG.getCommutedVectorShuffle(*SVOp);
9537 // When the number of V1 and V2 elements are the same, try to minimize the
9538 // number of uses of V2 in the low half of the vector. When that is tied,
9539 // ensure that the sum of indices for V1 is equal to or lower than the sum
9541 if (NumV1Elements == NumV2Elements) {
9542 int LowV1Elements = 0, LowV2Elements = 0;
9543 for (int M : SVOp->getMask().slice(0, NumElements / 2))
9544 if (M >= NumElements)
9548 if (LowV2Elements > LowV1Elements)
9549 return DAG.getCommutedVectorShuffle(*SVOp);
9551 int SumV1Indices = 0, SumV2Indices = 0;
9552 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
9553 if (SVOp->getMask()[i] >= NumElements)
9555 else if (SVOp->getMask()[i] >= 0)
9557 if (SumV2Indices < SumV1Indices)
9558 return DAG.getCommutedVectorShuffle(*SVOp);
9561 // For each vector width, delegate to a specialized lowering routine.
9562 if (VT.getSizeInBits() == 128)
9563 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9565 if (VT.getSizeInBits() == 256)
9566 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9568 llvm_unreachable("Unimplemented!");
9572 //===----------------------------------------------------------------------===//
9573 // Legacy vector shuffle lowering
9575 // This code is the legacy code handling vector shuffles until the above
9576 // replaces its functionality and performance.
9577 //===----------------------------------------------------------------------===//
9579 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
9580 bool hasInt256, unsigned *MaskOut = nullptr) {
9581 MVT EltVT = VT.getVectorElementType();
9583 // There is no blend with immediate in AVX-512.
9584 if (VT.is512BitVector())
9587 if (!hasSSE41 || EltVT == MVT::i8)
9589 if (!hasInt256 && VT == MVT::v16i16)
9592 unsigned MaskValue = 0;
9593 unsigned NumElems = VT.getVectorNumElements();
9594 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
9595 unsigned NumLanes = (NumElems - 1) / 8 + 1;
9596 unsigned NumElemsInLane = NumElems / NumLanes;
9598 // Blend for v16i16 should be symetric for the both lanes.
9599 for (unsigned i = 0; i < NumElemsInLane; ++i) {
9601 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
9602 int EltIdx = MaskVals[i];
9604 if ((EltIdx < 0 || EltIdx == (int)i) &&
9605 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
9608 if (((unsigned)EltIdx == (i + NumElems)) &&
9609 (SndLaneEltIdx < 0 ||
9610 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
9611 MaskValue |= (1 << i);
9617 *MaskOut = MaskValue;
9621 // Try to lower a shuffle node into a simple blend instruction.
9622 // This function assumes isBlendMask returns true for this
9623 // SuffleVectorSDNode
9624 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
9626 const X86Subtarget *Subtarget,
9627 SelectionDAG &DAG) {
9628 MVT VT = SVOp->getSimpleValueType(0);
9629 MVT EltVT = VT.getVectorElementType();
9630 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
9631 Subtarget->hasInt256() && "Trying to lower a "
9632 "VECTOR_SHUFFLE to a Blend but "
9633 "with the wrong mask"));
9634 SDValue V1 = SVOp->getOperand(0);
9635 SDValue V2 = SVOp->getOperand(1);
9637 unsigned NumElems = VT.getVectorNumElements();
9639 // Convert i32 vectors to floating point if it is not AVX2.
9640 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
9642 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
9643 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
9645 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
9646 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
9649 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
9650 DAG.getConstant(MaskValue, MVT::i32));
9651 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
9654 /// In vector type \p VT, return true if the element at index \p InputIdx
9655 /// falls on a different 128-bit lane than \p OutputIdx.
9656 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
9657 unsigned OutputIdx) {
9658 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
9659 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
9662 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
9663 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
9664 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
9665 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
9667 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
9668 SelectionDAG &DAG) {
9669 MVT VT = V1.getSimpleValueType();
9670 assert(VT.is128BitVector() || VT.is256BitVector());
9672 MVT EltVT = VT.getVectorElementType();
9673 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
9674 unsigned NumElts = VT.getVectorNumElements();
9676 SmallVector<SDValue, 32> PshufbMask;
9677 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
9678 int InputIdx = MaskVals[OutputIdx];
9679 unsigned InputByteIdx;
9681 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
9682 InputByteIdx = 0x80;
9684 // Cross lane is not allowed.
9685 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
9687 InputByteIdx = InputIdx * EltSizeInBytes;
9688 // Index is an byte offset within the 128-bit lane.
9689 InputByteIdx &= 0xf;
9692 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
9693 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
9694 if (InputByteIdx != 0x80)
9699 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
9701 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
9702 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
9703 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
9706 // v8i16 shuffles - Prefer shuffles in the following order:
9707 // 1. [all] pshuflw, pshufhw, optional move
9708 // 2. [ssse3] 1 x pshufb
9709 // 3. [ssse3] 2 x pshufb + 1 x por
9710 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
9712 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
9713 SelectionDAG &DAG) {
9714 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9715 SDValue V1 = SVOp->getOperand(0);
9716 SDValue V2 = SVOp->getOperand(1);
9718 SmallVector<int, 8> MaskVals;
9720 // Determine if more than 1 of the words in each of the low and high quadwords
9721 // of the result come from the same quadword of one of the two inputs. Undef
9722 // mask values count as coming from any quadword, for better codegen.
9724 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
9725 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
9726 unsigned LoQuad[] = { 0, 0, 0, 0 };
9727 unsigned HiQuad[] = { 0, 0, 0, 0 };
9728 // Indices of quads used.
9729 std::bitset<4> InputQuads;
9730 for (unsigned i = 0; i < 8; ++i) {
9731 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
9732 int EltIdx = SVOp->getMaskElt(i);
9733 MaskVals.push_back(EltIdx);
9742 InputQuads.set(EltIdx / 4);
9745 int BestLoQuad = -1;
9746 unsigned MaxQuad = 1;
9747 for (unsigned i = 0; i < 4; ++i) {
9748 if (LoQuad[i] > MaxQuad) {
9750 MaxQuad = LoQuad[i];
9754 int BestHiQuad = -1;
9756 for (unsigned i = 0; i < 4; ++i) {
9757 if (HiQuad[i] > MaxQuad) {
9759 MaxQuad = HiQuad[i];
9763 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
9764 // of the two input vectors, shuffle them into one input vector so only a
9765 // single pshufb instruction is necessary. If there are more than 2 input
9766 // quads, disable the next transformation since it does not help SSSE3.
9767 bool V1Used = InputQuads[0] || InputQuads[1];
9768 bool V2Used = InputQuads[2] || InputQuads[3];
9769 if (Subtarget->hasSSSE3()) {
9770 if (InputQuads.count() == 2 && V1Used && V2Used) {
9771 BestLoQuad = InputQuads[0] ? 0 : 1;
9772 BestHiQuad = InputQuads[2] ? 2 : 3;
9774 if (InputQuads.count() > 2) {
9780 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
9781 // the shuffle mask. If a quad is scored as -1, that means that it contains
9782 // words from all 4 input quadwords.
9784 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
9786 BestLoQuad < 0 ? 0 : BestLoQuad,
9787 BestHiQuad < 0 ? 1 : BestHiQuad
9789 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
9790 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
9791 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
9792 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
9794 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
9795 // source words for the shuffle, to aid later transformations.
9796 bool AllWordsInNewV = true;
9797 bool InOrder[2] = { true, true };
9798 for (unsigned i = 0; i != 8; ++i) {
9799 int idx = MaskVals[i];
9801 InOrder[i/4] = false;
9802 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
9804 AllWordsInNewV = false;
9808 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
9809 if (AllWordsInNewV) {
9810 for (int i = 0; i != 8; ++i) {
9811 int idx = MaskVals[i];
9814 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
9815 if ((idx != i) && idx < 4)
9817 if ((idx != i) && idx > 3)
9826 // If we've eliminated the use of V2, and the new mask is a pshuflw or
9827 // pshufhw, that's as cheap as it gets. Return the new shuffle.
9828 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
9829 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
9830 unsigned TargetMask = 0;
9831 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
9832 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
9833 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9834 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
9835 getShufflePSHUFLWImmediate(SVOp);
9836 V1 = NewV.getOperand(0);
9837 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
9841 // Promote splats to a larger type which usually leads to more efficient code.
9842 // FIXME: Is this true if pshufb is available?
9843 if (SVOp->isSplat())
9844 return PromoteSplat(SVOp, DAG);
9846 // If we have SSSE3, and all words of the result are from 1 input vector,
9847 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
9848 // is present, fall back to case 4.
9849 if (Subtarget->hasSSSE3()) {
9850 SmallVector<SDValue,16> pshufbMask;
9852 // If we have elements from both input vectors, set the high bit of the
9853 // shuffle mask element to zero out elements that come from V2 in the V1
9854 // mask, and elements that come from V1 in the V2 mask, so that the two
9855 // results can be OR'd together.
9856 bool TwoInputs = V1Used && V2Used;
9857 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
9859 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9861 // Calculate the shuffle mask for the second input, shuffle it, and
9862 // OR it with the first shuffled input.
9863 CommuteVectorShuffleMask(MaskVals, 8);
9864 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
9865 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9866 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9869 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
9870 // and update MaskVals with new element order.
9871 std::bitset<8> InOrder;
9872 if (BestLoQuad >= 0) {
9873 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
9874 for (int i = 0; i != 4; ++i) {
9875 int idx = MaskVals[i];
9878 } else if ((idx / 4) == BestLoQuad) {
9883 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9886 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9887 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9888 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
9890 getShufflePSHUFLWImmediate(SVOp), DAG);
9894 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
9895 // and update MaskVals with the new element order.
9896 if (BestHiQuad >= 0) {
9897 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
9898 for (unsigned i = 4; i != 8; ++i) {
9899 int idx = MaskVals[i];
9902 } else if ((idx / 4) == BestHiQuad) {
9903 MaskV[i] = (idx & 3) + 4;
9907 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9910 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9911 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9912 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
9914 getShufflePSHUFHWImmediate(SVOp), DAG);
9918 // In case BestHi & BestLo were both -1, which means each quadword has a word
9919 // from each of the four input quadwords, calculate the InOrder bitvector now
9920 // before falling through to the insert/extract cleanup.
9921 if (BestLoQuad == -1 && BestHiQuad == -1) {
9923 for (int i = 0; i != 8; ++i)
9924 if (MaskVals[i] < 0 || MaskVals[i] == i)
9928 // The other elements are put in the right place using pextrw and pinsrw.
9929 for (unsigned i = 0; i != 8; ++i) {
9932 int EltIdx = MaskVals[i];
9935 SDValue ExtOp = (EltIdx < 8) ?
9936 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
9937 DAG.getIntPtrConstant(EltIdx)) :
9938 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
9939 DAG.getIntPtrConstant(EltIdx - 8));
9940 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
9941 DAG.getIntPtrConstant(i));
9946 /// \brief v16i16 shuffles
9948 /// FIXME: We only support generation of a single pshufb currently. We can
9949 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
9950 /// well (e.g 2 x pshufb + 1 x por).
9952 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
9953 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9954 SDValue V1 = SVOp->getOperand(0);
9955 SDValue V2 = SVOp->getOperand(1);
9958 if (V2.getOpcode() != ISD::UNDEF)
9961 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9962 return getPSHUFB(MaskVals, V1, dl, DAG);
9965 // v16i8 shuffles - Prefer shuffles in the following order:
9966 // 1. [ssse3] 1 x pshufb
9967 // 2. [ssse3] 2 x pshufb + 1 x por
9968 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
9969 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
9970 const X86Subtarget* Subtarget,
9971 SelectionDAG &DAG) {
9972 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
9973 SDValue V1 = SVOp->getOperand(0);
9974 SDValue V2 = SVOp->getOperand(1);
9976 ArrayRef<int> MaskVals = SVOp->getMask();
9978 // Promote splats to a larger type which usually leads to more efficient code.
9979 // FIXME: Is this true if pshufb is available?
9980 if (SVOp->isSplat())
9981 return PromoteSplat(SVOp, DAG);
9983 // If we have SSSE3, case 1 is generated when all result bytes come from
9984 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
9985 // present, fall back to case 3.
9987 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
9988 if (Subtarget->hasSSSE3()) {
9989 SmallVector<SDValue,16> pshufbMask;
9991 // If all result elements are from one input vector, then only translate
9992 // undef mask values to 0x80 (zero out result) in the pshufb mask.
9994 // Otherwise, we have elements from both input vectors, and must zero out
9995 // elements that come from V2 in the first mask, and V1 in the second mask
9996 // so that we can OR them together.
9997 for (unsigned i = 0; i != 16; ++i) {
9998 int EltIdx = MaskVals[i];
9999 if (EltIdx < 0 || EltIdx >= 16)
10001 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10003 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
10004 DAG.getNode(ISD::BUILD_VECTOR, dl,
10005 MVT::v16i8, pshufbMask));
10007 // As PSHUFB will zero elements with negative indices, it's safe to ignore
10008 // the 2nd operand if it's undefined or zero.
10009 if (V2.getOpcode() == ISD::UNDEF ||
10010 ISD::isBuildVectorAllZeros(V2.getNode()))
10013 // Calculate the shuffle mask for the second input, shuffle it, and
10014 // OR it with the first shuffled input.
10015 pshufbMask.clear();
10016 for (unsigned i = 0; i != 16; ++i) {
10017 int EltIdx = MaskVals[i];
10018 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
10019 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10021 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
10022 DAG.getNode(ISD::BUILD_VECTOR, dl,
10023 MVT::v16i8, pshufbMask));
10024 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10027 // No SSSE3 - Calculate in place words and then fix all out of place words
10028 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
10029 // the 16 different words that comprise the two doublequadword input vectors.
10030 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10031 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
10033 for (int i = 0; i != 8; ++i) {
10034 int Elt0 = MaskVals[i*2];
10035 int Elt1 = MaskVals[i*2+1];
10037 // This word of the result is all undef, skip it.
10038 if (Elt0 < 0 && Elt1 < 0)
10041 // This word of the result is already in the correct place, skip it.
10042 if ((Elt0 == i*2) && (Elt1 == i*2+1))
10045 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
10046 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
10049 // If Elt0 and Elt1 are defined, are consecutive, and can be load
10050 // using a single extract together, load it and store it.
10051 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
10052 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10053 DAG.getIntPtrConstant(Elt1 / 2));
10054 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10055 DAG.getIntPtrConstant(i));
10059 // If Elt1 is defined, extract it from the appropriate source. If the
10060 // source byte is not also odd, shift the extracted word left 8 bits
10061 // otherwise clear the bottom 8 bits if we need to do an or.
10063 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10064 DAG.getIntPtrConstant(Elt1 / 2));
10065 if ((Elt1 & 1) == 0)
10066 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
10068 TLI.getShiftAmountTy(InsElt.getValueType())));
10069 else if (Elt0 >= 0)
10070 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
10071 DAG.getConstant(0xFF00, MVT::i16));
10073 // If Elt0 is defined, extract it from the appropriate source. If the
10074 // source byte is not also even, shift the extracted word right 8 bits. If
10075 // Elt1 was also defined, OR the extracted values together before
10076 // inserting them in the result.
10078 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
10079 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
10080 if ((Elt0 & 1) != 0)
10081 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
10083 TLI.getShiftAmountTy(InsElt0.getValueType())));
10084 else if (Elt1 >= 0)
10085 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
10086 DAG.getConstant(0x00FF, MVT::i16));
10087 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
10090 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10091 DAG.getIntPtrConstant(i));
10093 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10096 // v32i8 shuffles - Translate to VPSHUFB if possible.
10098 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10099 const X86Subtarget *Subtarget,
10100 SelectionDAG &DAG) {
10101 MVT VT = SVOp->getSimpleValueType(0);
10102 SDValue V1 = SVOp->getOperand(0);
10103 SDValue V2 = SVOp->getOperand(1);
10105 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10107 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10108 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
10109 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
10111 // VPSHUFB may be generated if
10112 // (1) one of input vector is undefined or zeroinitializer.
10113 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
10114 // And (2) the mask indexes don't cross the 128-bit lane.
10115 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
10116 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
10119 if (V1IsAllZero && !V2IsAllZero) {
10120 CommuteVectorShuffleMask(MaskVals, 32);
10123 return getPSHUFB(MaskVals, V1, dl, DAG);
10126 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
10127 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
10128 /// done when every pair / quad of shuffle mask elements point to elements in
10129 /// the right sequence. e.g.
10130 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
10132 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
10133 SelectionDAG &DAG) {
10134 MVT VT = SVOp->getSimpleValueType(0);
10136 unsigned NumElems = VT.getVectorNumElements();
10139 switch (VT.SimpleTy) {
10140 default: llvm_unreachable("Unexpected!");
10143 return SDValue(SVOp, 0);
10144 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
10145 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
10146 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
10147 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
10148 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
10149 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10152 SmallVector<int, 8> MaskVec;
10153 for (unsigned i = 0; i != NumElems; i += Scale) {
10155 for (unsigned j = 0; j != Scale; ++j) {
10156 int EltIdx = SVOp->getMaskElt(i+j);
10160 StartIdx = (EltIdx / Scale);
10161 if (EltIdx != (int)(StartIdx*Scale + j))
10164 MaskVec.push_back(StartIdx);
10167 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10168 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10169 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10172 /// getVZextMovL - Return a zero-extending vector move low node.
10174 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10175 SDValue SrcOp, SelectionDAG &DAG,
10176 const X86Subtarget *Subtarget, SDLoc dl) {
10177 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10178 LoadSDNode *LD = nullptr;
10179 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10180 LD = dyn_cast<LoadSDNode>(SrcOp);
10182 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10184 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10185 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10186 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10187 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10188 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10190 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10191 return DAG.getNode(ISD::BITCAST, dl, VT,
10192 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10193 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10195 SrcOp.getOperand(0)
10201 return DAG.getNode(ISD::BITCAST, dl, VT,
10202 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10203 DAG.getNode(ISD::BITCAST, dl,
10207 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10208 /// which could not be matched by any known target speficic shuffle
10210 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10212 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10213 if (NewOp.getNode())
10216 MVT VT = SVOp->getSimpleValueType(0);
10218 unsigned NumElems = VT.getVectorNumElements();
10219 unsigned NumLaneElems = NumElems / 2;
10222 MVT EltVT = VT.getVectorElementType();
10223 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10226 SmallVector<int, 16> Mask;
10227 for (unsigned l = 0; l < 2; ++l) {
10228 // Build a shuffle mask for the output, discovering on the fly which
10229 // input vectors to use as shuffle operands (recorded in InputUsed).
10230 // If building a suitable shuffle vector proves too hard, then bail
10231 // out with UseBuildVector set.
10232 bool UseBuildVector = false;
10233 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10234 unsigned LaneStart = l * NumLaneElems;
10235 for (unsigned i = 0; i != NumLaneElems; ++i) {
10236 // The mask element. This indexes into the input.
10237 int Idx = SVOp->getMaskElt(i+LaneStart);
10239 // the mask element does not index into any input vector.
10240 Mask.push_back(-1);
10244 // The input vector this mask element indexes into.
10245 int Input = Idx / NumLaneElems;
10247 // Turn the index into an offset from the start of the input vector.
10248 Idx -= Input * NumLaneElems;
10250 // Find or create a shuffle vector operand to hold this input.
10252 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10253 if (InputUsed[OpNo] == Input)
10254 // This input vector is already an operand.
10256 if (InputUsed[OpNo] < 0) {
10257 // Create a new operand for this input vector.
10258 InputUsed[OpNo] = Input;
10263 if (OpNo >= array_lengthof(InputUsed)) {
10264 // More than two input vectors used! Give up on trying to create a
10265 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10266 UseBuildVector = true;
10270 // Add the mask index for the new shuffle vector.
10271 Mask.push_back(Idx + OpNo * NumLaneElems);
10274 if (UseBuildVector) {
10275 SmallVector<SDValue, 16> SVOps;
10276 for (unsigned i = 0; i != NumLaneElems; ++i) {
10277 // The mask element. This indexes into the input.
10278 int Idx = SVOp->getMaskElt(i+LaneStart);
10280 SVOps.push_back(DAG.getUNDEF(EltVT));
10284 // The input vector this mask element indexes into.
10285 int Input = Idx / NumElems;
10287 // Turn the index into an offset from the start of the input vector.
10288 Idx -= Input * NumElems;
10290 // Extract the vector element by hand.
10291 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
10292 SVOp->getOperand(Input),
10293 DAG.getIntPtrConstant(Idx)));
10296 // Construct the output using a BUILD_VECTOR.
10297 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
10298 } else if (InputUsed[0] < 0) {
10299 // No input vectors were used! The result is undefined.
10300 Output[l] = DAG.getUNDEF(NVT);
10302 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
10303 (InputUsed[0] % 2) * NumLaneElems,
10305 // If only one input was used, use an undefined vector for the other.
10306 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
10307 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
10308 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
10309 // At least one input vector was used. Create a new shuffle vector.
10310 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
10316 // Concatenate the result back
10317 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
10320 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
10321 /// 4 elements, and match them with several different shuffle types.
10323 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10324 SDValue V1 = SVOp->getOperand(0);
10325 SDValue V2 = SVOp->getOperand(1);
10327 MVT VT = SVOp->getSimpleValueType(0);
10329 assert(VT.is128BitVector() && "Unsupported vector size");
10331 std::pair<int, int> Locs[4];
10332 int Mask1[] = { -1, -1, -1, -1 };
10333 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
10335 unsigned NumHi = 0;
10336 unsigned NumLo = 0;
10337 for (unsigned i = 0; i != 4; ++i) {
10338 int Idx = PermMask[i];
10340 Locs[i] = std::make_pair(-1, -1);
10342 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
10344 Locs[i] = std::make_pair(0, NumLo);
10345 Mask1[NumLo] = Idx;
10348 Locs[i] = std::make_pair(1, NumHi);
10350 Mask1[2+NumHi] = Idx;
10356 if (NumLo <= 2 && NumHi <= 2) {
10357 // If no more than two elements come from either vector. This can be
10358 // implemented with two shuffles. First shuffle gather the elements.
10359 // The second shuffle, which takes the first shuffle as both of its
10360 // vector operands, put the elements into the right order.
10361 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10363 int Mask2[] = { -1, -1, -1, -1 };
10365 for (unsigned i = 0; i != 4; ++i)
10366 if (Locs[i].first != -1) {
10367 unsigned Idx = (i < 2) ? 0 : 4;
10368 Idx += Locs[i].first * 2 + Locs[i].second;
10372 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
10375 if (NumLo == 3 || NumHi == 3) {
10376 // Otherwise, we must have three elements from one vector, call it X, and
10377 // one element from the other, call it Y. First, use a shufps to build an
10378 // intermediate vector with the one element from Y and the element from X
10379 // that will be in the same half in the final destination (the indexes don't
10380 // matter). Then, use a shufps to build the final vector, taking the half
10381 // containing the element from Y from the intermediate, and the other half
10384 // Normalize it so the 3 elements come from V1.
10385 CommuteVectorShuffleMask(PermMask, 4);
10389 // Find the element from V2.
10391 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
10392 int Val = PermMask[HiIndex];
10399 Mask1[0] = PermMask[HiIndex];
10401 Mask1[2] = PermMask[HiIndex^1];
10403 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10405 if (HiIndex >= 2) {
10406 Mask1[0] = PermMask[0];
10407 Mask1[1] = PermMask[1];
10408 Mask1[2] = HiIndex & 1 ? 6 : 4;
10409 Mask1[3] = HiIndex & 1 ? 4 : 6;
10410 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10413 Mask1[0] = HiIndex & 1 ? 2 : 0;
10414 Mask1[1] = HiIndex & 1 ? 0 : 2;
10415 Mask1[2] = PermMask[2];
10416 Mask1[3] = PermMask[3];
10421 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
10424 // Break it into (shuffle shuffle_hi, shuffle_lo).
10425 int LoMask[] = { -1, -1, -1, -1 };
10426 int HiMask[] = { -1, -1, -1, -1 };
10428 int *MaskPtr = LoMask;
10429 unsigned MaskIdx = 0;
10430 unsigned LoIdx = 0;
10431 unsigned HiIdx = 2;
10432 for (unsigned i = 0; i != 4; ++i) {
10439 int Idx = PermMask[i];
10441 Locs[i] = std::make_pair(-1, -1);
10442 } else if (Idx < 4) {
10443 Locs[i] = std::make_pair(MaskIdx, LoIdx);
10444 MaskPtr[LoIdx] = Idx;
10447 Locs[i] = std::make_pair(MaskIdx, HiIdx);
10448 MaskPtr[HiIdx] = Idx;
10453 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
10454 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
10455 int MaskOps[] = { -1, -1, -1, -1 };
10456 for (unsigned i = 0; i != 4; ++i)
10457 if (Locs[i].first != -1)
10458 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
10459 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
10462 static bool MayFoldVectorLoad(SDValue V) {
10463 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
10464 V = V.getOperand(0);
10466 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
10467 V = V.getOperand(0);
10468 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
10469 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
10470 // BUILD_VECTOR (load), undef
10471 V = V.getOperand(0);
10473 return MayFoldLoad(V);
10477 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
10478 MVT VT = Op.getSimpleValueType();
10480 // Canonizalize to v2f64.
10481 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
10482 return DAG.getNode(ISD::BITCAST, dl, VT,
10483 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
10488 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
10490 SDValue V1 = Op.getOperand(0);
10491 SDValue V2 = Op.getOperand(1);
10492 MVT VT = Op.getSimpleValueType();
10494 assert(VT != MVT::v2i64 && "unsupported shuffle type");
10496 if (HasSSE2 && VT == MVT::v2f64)
10497 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
10499 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
10500 return DAG.getNode(ISD::BITCAST, dl, VT,
10501 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
10502 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
10503 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
10507 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
10508 SDValue V1 = Op.getOperand(0);
10509 SDValue V2 = Op.getOperand(1);
10510 MVT VT = Op.getSimpleValueType();
10512 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
10513 "unsupported shuffle type");
10515 if (V2.getOpcode() == ISD::UNDEF)
10519 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
10523 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
10524 SDValue V1 = Op.getOperand(0);
10525 SDValue V2 = Op.getOperand(1);
10526 MVT VT = Op.getSimpleValueType();
10527 unsigned NumElems = VT.getVectorNumElements();
10529 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
10530 // operand of these instructions is only memory, so check if there's a
10531 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
10533 bool CanFoldLoad = false;
10535 // Trivial case, when V2 comes from a load.
10536 if (MayFoldVectorLoad(V2))
10537 CanFoldLoad = true;
10539 // When V1 is a load, it can be folded later into a store in isel, example:
10540 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
10542 // (MOVLPSmr addr:$src1, VR128:$src2)
10543 // So, recognize this potential and also use MOVLPS or MOVLPD
10544 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
10545 CanFoldLoad = true;
10547 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10549 if (HasSSE2 && NumElems == 2)
10550 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
10553 // If we don't care about the second element, proceed to use movss.
10554 if (SVOp->getMaskElt(1) != -1)
10555 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
10558 // movl and movlp will both match v2i64, but v2i64 is never matched by
10559 // movl earlier because we make it strict to avoid messing with the movlp load
10560 // folding logic (see the code above getMOVLP call). Match it here then,
10561 // this is horrible, but will stay like this until we move all shuffle
10562 // matching to x86 specific nodes. Note that for the 1st condition all
10563 // types are matched with movsd.
10565 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
10566 // as to remove this logic from here, as much as possible
10567 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
10568 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10569 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10572 assert(VT != MVT::v4i32 && "unsupported shuffle type");
10574 // Invert the operand order and use SHUFPS to match it.
10575 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
10576 getShuffleSHUFImmediate(SVOp), DAG);
10579 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
10580 SelectionDAG &DAG) {
10582 MVT VT = Load->getSimpleValueType(0);
10583 MVT EVT = VT.getVectorElementType();
10584 SDValue Addr = Load->getOperand(1);
10585 SDValue NewAddr = DAG.getNode(
10586 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
10587 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
10590 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
10591 DAG.getMachineFunction().getMachineMemOperand(
10592 Load->getMemOperand(), 0, EVT.getStoreSize()));
10596 // It is only safe to call this function if isINSERTPSMask is true for
10597 // this shufflevector mask.
10598 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
10599 SelectionDAG &DAG) {
10600 // Generate an insertps instruction when inserting an f32 from memory onto a
10601 // v4f32 or when copying a member from one v4f32 to another.
10602 // We also use it for transferring i32 from one register to another,
10603 // since it simply copies the same bits.
10604 // If we're transferring an i32 from memory to a specific element in a
10605 // register, we output a generic DAG that will match the PINSRD
10607 MVT VT = SVOp->getSimpleValueType(0);
10608 MVT EVT = VT.getVectorElementType();
10609 SDValue V1 = SVOp->getOperand(0);
10610 SDValue V2 = SVOp->getOperand(1);
10611 auto Mask = SVOp->getMask();
10612 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
10613 "unsupported vector type for insertps/pinsrd");
10615 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
10616 auto FromV2Predicate = [](const int &i) { return i >= 4; };
10617 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
10621 unsigned DestIndex;
10625 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
10628 // If we have 1 element from each vector, we have to check if we're
10629 // changing V1's element's place. If so, we're done. Otherwise, we
10630 // should assume we're changing V2's element's place and behave
10632 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
10633 assert(DestIndex <= INT32_MAX && "truncated destination index");
10634 if (FromV1 == FromV2 &&
10635 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
10639 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10642 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
10643 "More than one element from V1 and from V2, or no elements from one "
10644 "of the vectors. This case should not have returned true from "
10649 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10652 // Get an index into the source vector in the range [0,4) (the mask is
10653 // in the range [0,8) because it can address V1 and V2)
10654 unsigned SrcIndex = Mask[DestIndex] % 4;
10655 if (MayFoldLoad(From)) {
10656 // Trivial case, when From comes from a load and is only used by the
10657 // shuffle. Make it use insertps from the vector that we need from that
10660 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
10661 if (!NewLoad.getNode())
10664 if (EVT == MVT::f32) {
10665 // Create this as a scalar to vector to match the instruction pattern.
10666 SDValue LoadScalarToVector =
10667 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
10668 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
10669 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
10671 } else { // EVT == MVT::i32
10672 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
10673 // instruction, to match the PINSRD instruction, which loads an i32 to a
10674 // certain vector element.
10675 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
10676 DAG.getConstant(DestIndex, MVT::i32));
10680 // Vector-element-to-vector
10681 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
10682 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
10685 // Reduce a vector shuffle to zext.
10686 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
10687 SelectionDAG &DAG) {
10688 // PMOVZX is only available from SSE41.
10689 if (!Subtarget->hasSSE41())
10692 MVT VT = Op.getSimpleValueType();
10694 // Only AVX2 support 256-bit vector integer extending.
10695 if (!Subtarget->hasInt256() && VT.is256BitVector())
10698 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10700 SDValue V1 = Op.getOperand(0);
10701 SDValue V2 = Op.getOperand(1);
10702 unsigned NumElems = VT.getVectorNumElements();
10704 // Extending is an unary operation and the element type of the source vector
10705 // won't be equal to or larger than i64.
10706 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
10707 VT.getVectorElementType() == MVT::i64)
10710 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
10711 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
10712 while ((1U << Shift) < NumElems) {
10713 if (SVOp->getMaskElt(1U << Shift) == 1)
10716 // The maximal ratio is 8, i.e. from i8 to i64.
10721 // Check the shuffle mask.
10722 unsigned Mask = (1U << Shift) - 1;
10723 for (unsigned i = 0; i != NumElems; ++i) {
10724 int EltIdx = SVOp->getMaskElt(i);
10725 if ((i & Mask) != 0 && EltIdx != -1)
10727 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
10731 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
10732 MVT NeVT = MVT::getIntegerVT(NBits);
10733 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
10735 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
10738 // Simplify the operand as it's prepared to be fed into shuffle.
10739 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
10740 if (V1.getOpcode() == ISD::BITCAST &&
10741 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
10742 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
10743 V1.getOperand(0).getOperand(0)
10744 .getSimpleValueType().getSizeInBits() == SignificantBits) {
10745 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
10746 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
10747 ConstantSDNode *CIdx =
10748 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
10749 // If it's foldable, i.e. normal load with single use, we will let code
10750 // selection to fold it. Otherwise, we will short the conversion sequence.
10751 if (CIdx && CIdx->getZExtValue() == 0 &&
10752 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
10753 MVT FullVT = V.getSimpleValueType();
10754 MVT V1VT = V1.getSimpleValueType();
10755 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
10756 // The "ext_vec_elt" node is wider than the result node.
10757 // In this case we should extract subvector from V.
10758 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
10759 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
10760 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
10761 FullVT.getVectorNumElements()/Ratio);
10762 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
10763 DAG.getIntPtrConstant(0));
10765 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
10769 return DAG.getNode(ISD::BITCAST, DL, VT,
10770 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
10773 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10774 SelectionDAG &DAG) {
10775 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10776 MVT VT = Op.getSimpleValueType();
10778 SDValue V1 = Op.getOperand(0);
10779 SDValue V2 = Op.getOperand(1);
10781 if (isZeroShuffle(SVOp))
10782 return getZeroVector(VT, Subtarget, DAG, dl);
10784 // Handle splat operations
10785 if (SVOp->isSplat()) {
10786 // Use vbroadcast whenever the splat comes from a foldable load
10787 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
10788 if (Broadcast.getNode())
10792 // Check integer expanding shuffles.
10793 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
10794 if (NewOp.getNode())
10797 // If the shuffle can be profitably rewritten as a narrower shuffle, then
10799 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
10800 VT == MVT::v32i8) {
10801 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10802 if (NewOp.getNode())
10803 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
10804 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
10805 // FIXME: Figure out a cleaner way to do this.
10806 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
10807 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10808 if (NewOp.getNode()) {
10809 MVT NewVT = NewOp.getSimpleValueType();
10810 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
10811 NewVT, true, false))
10812 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
10815 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
10816 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10817 if (NewOp.getNode()) {
10818 MVT NewVT = NewOp.getSimpleValueType();
10819 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
10820 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
10829 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
10830 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10831 SDValue V1 = Op.getOperand(0);
10832 SDValue V2 = Op.getOperand(1);
10833 MVT VT = Op.getSimpleValueType();
10835 unsigned NumElems = VT.getVectorNumElements();
10836 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10837 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10838 bool V1IsSplat = false;
10839 bool V2IsSplat = false;
10840 bool HasSSE2 = Subtarget->hasSSE2();
10841 bool HasFp256 = Subtarget->hasFp256();
10842 bool HasInt256 = Subtarget->hasInt256();
10843 MachineFunction &MF = DAG.getMachineFunction();
10844 bool OptForSize = MF.getFunction()->getAttributes().
10845 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
10847 // Check if we should use the experimental vector shuffle lowering. If so,
10848 // delegate completely to that code path.
10849 if (ExperimentalVectorShuffleLowering)
10850 return lowerVectorShuffle(Op, Subtarget, DAG);
10852 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10854 if (V1IsUndef && V2IsUndef)
10855 return DAG.getUNDEF(VT);
10857 // When we create a shuffle node we put the UNDEF node to second operand,
10858 // but in some cases the first operand may be transformed to UNDEF.
10859 // In this case we should just commute the node.
10861 return DAG.getCommutedVectorShuffle(*SVOp);
10863 // Vector shuffle lowering takes 3 steps:
10865 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
10866 // narrowing and commutation of operands should be handled.
10867 // 2) Matching of shuffles with known shuffle masks to x86 target specific
10869 // 3) Rewriting of unmatched masks into new generic shuffle operations,
10870 // so the shuffle can be broken into other shuffles and the legalizer can
10871 // try the lowering again.
10873 // The general idea is that no vector_shuffle operation should be left to
10874 // be matched during isel, all of them must be converted to a target specific
10877 // Normalize the input vectors. Here splats, zeroed vectors, profitable
10878 // narrowing and commutation of operands should be handled. The actual code
10879 // doesn't include all of those, work in progress...
10880 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
10881 if (NewOp.getNode())
10884 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
10886 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
10887 // unpckh_undef). Only use pshufd if speed is more important than size.
10888 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10889 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10890 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10891 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10893 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
10894 V2IsUndef && MayFoldVectorLoad(V1))
10895 return getMOVDDup(Op, dl, V1, DAG);
10897 if (isMOVHLPS_v_undef_Mask(M, VT))
10898 return getMOVHighToLow(Op, dl, DAG);
10900 // Use to match splats
10901 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
10902 (VT == MVT::v2f64 || VT == MVT::v2i64))
10903 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10905 if (isPSHUFDMask(M, VT)) {
10906 // The actual implementation will match the mask in the if above and then
10907 // during isel it can match several different instructions, not only pshufd
10908 // as its name says, sad but true, emulate the behavior for now...
10909 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
10910 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
10912 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
10914 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
10915 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
10917 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
10918 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1, TargetMask,
10921 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
10925 if (isPALIGNRMask(M, VT, Subtarget))
10926 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
10927 getShufflePALIGNRImmediate(SVOp),
10930 if (isVALIGNMask(M, VT, Subtarget))
10931 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
10932 getShuffleVALIGNImmediate(SVOp),
10935 // Check if this can be converted into a logical shift.
10936 bool isLeft = false;
10937 unsigned ShAmt = 0;
10939 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
10940 if (isShift && ShVal.hasOneUse()) {
10941 // If the shifted value has multiple uses, it may be cheaper to use
10942 // v_set0 + movlhps or movhlps, etc.
10943 MVT EltVT = VT.getVectorElementType();
10944 ShAmt *= EltVT.getSizeInBits();
10945 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10948 if (isMOVLMask(M, VT)) {
10949 if (ISD::isBuildVectorAllZeros(V1.getNode()))
10950 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
10951 if (!isMOVLPMask(M, VT)) {
10952 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
10953 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10955 if (VT == MVT::v4i32 || VT == MVT::v4f32)
10956 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10960 // FIXME: fold these into legal mask.
10961 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
10962 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
10964 if (isMOVHLPSMask(M, VT))
10965 return getMOVHighToLow(Op, dl, DAG);
10967 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
10968 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
10970 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
10971 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
10973 if (isMOVLPMask(M, VT))
10974 return getMOVLP(Op, dl, DAG, HasSSE2);
10976 if (ShouldXformToMOVHLPS(M, VT) ||
10977 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
10978 return DAG.getCommutedVectorShuffle(*SVOp);
10981 // No better options. Use a vshldq / vsrldq.
10982 MVT EltVT = VT.getVectorElementType();
10983 ShAmt *= EltVT.getSizeInBits();
10984 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10987 bool Commuted = false;
10988 // FIXME: This should also accept a bitcast of a splat? Be careful, not
10989 // 1,1,1,1 -> v8i16 though.
10990 BitVector UndefElements;
10991 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
10992 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10994 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
10995 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10998 // Canonicalize the splat or undef, if present, to be on the RHS.
10999 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
11000 CommuteVectorShuffleMask(M, NumElems);
11002 std::swap(V1IsSplat, V2IsSplat);
11006 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
11007 // Shuffling low element of v1 into undef, just return v1.
11010 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
11011 // the instruction selector will not match, so get a canonical MOVL with
11012 // swapped operands to undo the commute.
11013 return getMOVL(DAG, dl, VT, V2, V1);
11016 if (isUNPCKLMask(M, VT, HasInt256))
11017 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11019 if (isUNPCKHMask(M, VT, HasInt256))
11020 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11023 // Normalize mask so all entries that point to V2 points to its first
11024 // element then try to match unpck{h|l} again. If match, return a
11025 // new vector_shuffle with the corrected mask.p
11026 SmallVector<int, 8> NewMask(M.begin(), M.end());
11027 NormalizeMask(NewMask, NumElems);
11028 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
11029 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11030 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
11031 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11035 // Commute is back and try unpck* again.
11036 // FIXME: this seems wrong.
11037 CommuteVectorShuffleMask(M, NumElems);
11039 std::swap(V1IsSplat, V2IsSplat);
11041 if (isUNPCKLMask(M, VT, HasInt256))
11042 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11044 if (isUNPCKHMask(M, VT, HasInt256))
11045 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11048 // Normalize the node to match x86 shuffle ops if needed
11049 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
11050 return DAG.getCommutedVectorShuffle(*SVOp);
11052 // The checks below are all present in isShuffleMaskLegal, but they are
11053 // inlined here right now to enable us to directly emit target specific
11054 // nodes, and remove one by one until they don't return Op anymore.
11056 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
11057 SVOp->getSplatIndex() == 0 && V2IsUndef) {
11058 if (VT == MVT::v2f64 || VT == MVT::v2i64)
11059 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11062 if (isPSHUFHWMask(M, VT, HasInt256))
11063 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
11064 getShufflePSHUFHWImmediate(SVOp),
11067 if (isPSHUFLWMask(M, VT, HasInt256))
11068 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
11069 getShufflePSHUFLWImmediate(SVOp),
11072 unsigned MaskValue;
11073 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
11075 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
11077 if (isSHUFPMask(M, VT))
11078 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
11079 getShuffleSHUFImmediate(SVOp), DAG);
11081 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11082 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11083 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11084 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11086 //===--------------------------------------------------------------------===//
11087 // Generate target specific nodes for 128 or 256-bit shuffles only
11088 // supported in the AVX instruction set.
11091 // Handle VMOVDDUPY permutations
11092 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11093 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11095 // Handle VPERMILPS/D* permutations
11096 if (isVPERMILPMask(M, VT)) {
11097 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11098 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11099 getShuffleSHUFImmediate(SVOp), DAG);
11100 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1,
11101 getShuffleSHUFImmediate(SVOp), DAG);
11105 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11106 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11107 Idx*(NumElems/2), DAG, dl);
11109 // Handle VPERM2F128/VPERM2I128 permutations
11110 if (isVPERM2X128Mask(M, VT, HasFp256))
11111 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11112 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11114 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11115 return getINSERTPS(SVOp, dl, DAG);
11118 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11119 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11121 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11122 VT.is512BitVector()) {
11123 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11124 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11125 SmallVector<SDValue, 16> permclMask;
11126 for (unsigned i = 0; i != NumElems; ++i) {
11127 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11130 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11132 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11133 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11134 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11135 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11136 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
11139 //===--------------------------------------------------------------------===//
11140 // Since no target specific shuffle was selected for this generic one,
11141 // lower it into other known shuffles. FIXME: this isn't true yet, but
11142 // this is the plan.
11145 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
11146 if (VT == MVT::v8i16) {
11147 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
11148 if (NewOp.getNode())
11152 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11153 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11154 if (NewOp.getNode())
11158 if (VT == MVT::v16i8) {
11159 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11160 if (NewOp.getNode())
11164 if (VT == MVT::v32i8) {
11165 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11166 if (NewOp.getNode())
11170 // Handle all 128-bit wide vectors with 4 elements, and match them with
11171 // several different shuffle types.
11172 if (NumElems == 4 && VT.is128BitVector())
11173 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11175 // Handle general 256-bit shuffles
11176 if (VT.is256BitVector())
11177 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11182 // This function assumes its argument is a BUILD_VECTOR of constants or
11183 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11185 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11186 unsigned &MaskValue) {
11188 unsigned NumElems = BuildVector->getNumOperands();
11189 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11190 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11191 unsigned NumElemsInLane = NumElems / NumLanes;
11193 // Blend for v16i16 should be symetric for the both lanes.
11194 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11195 SDValue EltCond = BuildVector->getOperand(i);
11196 SDValue SndLaneEltCond =
11197 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11199 int Lane1Cond = -1, Lane2Cond = -1;
11200 if (isa<ConstantSDNode>(EltCond))
11201 Lane1Cond = !isZero(EltCond);
11202 if (isa<ConstantSDNode>(SndLaneEltCond))
11203 Lane2Cond = !isZero(SndLaneEltCond);
11205 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11206 // Lane1Cond != 0, means we want the first argument.
11207 // Lane1Cond == 0, means we want the second argument.
11208 // The encoding of this argument is 0 for the first argument, 1
11209 // for the second. Therefore, invert the condition.
11210 MaskValue |= !Lane1Cond << i;
11211 else if (Lane1Cond < 0)
11212 MaskValue |= !Lane2Cond << i;
11219 // Try to lower a vselect node into a simple blend instruction.
11220 static SDValue LowerVSELECTtoBlend(SDValue Op, const X86Subtarget *Subtarget,
11221 SelectionDAG &DAG) {
11222 SDValue Cond = Op.getOperand(0);
11223 SDValue LHS = Op.getOperand(1);
11224 SDValue RHS = Op.getOperand(2);
11226 MVT VT = Op.getSimpleValueType();
11227 MVT EltVT = VT.getVectorElementType();
11228 unsigned NumElems = VT.getVectorNumElements();
11230 // There is no blend with immediate in AVX-512.
11231 if (VT.is512BitVector())
11234 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
11236 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
11239 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11242 // Check the mask for BLEND and build the value.
11243 unsigned MaskValue = 0;
11244 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
11247 // Convert i32 vectors to floating point if it is not AVX2.
11248 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
11250 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
11251 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
11253 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
11254 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
11257 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
11258 DAG.getConstant(MaskValue, MVT::i32));
11259 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
11262 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11263 // A vselect where all conditions and data are constants can be optimized into
11264 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11265 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11266 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11267 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11270 SDValue BlendOp = LowerVSELECTtoBlend(Op, Subtarget, DAG);
11271 if (BlendOp.getNode())
11274 // Some types for vselect were previously set to Expand, not Legal or
11275 // Custom. Return an empty SDValue so we fall-through to Expand, after
11276 // the Custom lowering phase.
11277 MVT VT = Op.getSimpleValueType();
11278 switch (VT.SimpleTy) {
11283 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11288 // We couldn't create a "Blend with immediate" node.
11289 // This node should still be legal, but we'll have to emit a blendv*
11294 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11295 MVT VT = Op.getSimpleValueType();
11298 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11301 if (VT.getSizeInBits() == 8) {
11302 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11303 Op.getOperand(0), Op.getOperand(1));
11304 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11305 DAG.getValueType(VT));
11306 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11309 if (VT.getSizeInBits() == 16) {
11310 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11311 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11313 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11314 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11315 DAG.getNode(ISD::BITCAST, dl,
11318 Op.getOperand(1)));
11319 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11320 Op.getOperand(0), Op.getOperand(1));
11321 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11322 DAG.getValueType(VT));
11323 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11326 if (VT == MVT::f32) {
11327 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11328 // the result back to FR32 register. It's only worth matching if the
11329 // result has a single use which is a store or a bitcast to i32. And in
11330 // the case of a store, it's not worth it if the index is a constant 0,
11331 // because a MOVSSmr can be used instead, which is smaller and faster.
11332 if (!Op.hasOneUse())
11334 SDNode *User = *Op.getNode()->use_begin();
11335 if ((User->getOpcode() != ISD::STORE ||
11336 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11337 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11338 (User->getOpcode() != ISD::BITCAST ||
11339 User->getValueType(0) != MVT::i32))
11341 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11342 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
11345 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
11348 if (VT == MVT::i32 || VT == MVT::i64) {
11349 // ExtractPS/pextrq works with constant index.
11350 if (isa<ConstantSDNode>(Op.getOperand(1)))
11356 /// Extract one bit from mask vector, like v16i1 or v8i1.
11357 /// AVX-512 feature.
11359 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11360 SDValue Vec = Op.getOperand(0);
11362 MVT VecVT = Vec.getSimpleValueType();
11363 SDValue Idx = Op.getOperand(1);
11364 MVT EltVT = Op.getSimpleValueType();
11366 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11368 // variable index can't be handled in mask registers,
11369 // extend vector to VR512
11370 if (!isa<ConstantSDNode>(Idx)) {
11371 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11372 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11373 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11374 ExtVT.getVectorElementType(), Ext, Idx);
11375 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11378 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11379 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11380 unsigned MaxSift = rc->getSize()*8 - 1;
11381 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11382 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11383 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11384 DAG.getConstant(MaxSift, MVT::i8));
11385 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11386 DAG.getIntPtrConstant(0));
11390 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11391 SelectionDAG &DAG) const {
11393 SDValue Vec = Op.getOperand(0);
11394 MVT VecVT = Vec.getSimpleValueType();
11395 SDValue Idx = Op.getOperand(1);
11397 if (Op.getSimpleValueType() == MVT::i1)
11398 return ExtractBitFromMaskVector(Op, DAG);
11400 if (!isa<ConstantSDNode>(Idx)) {
11401 if (VecVT.is512BitVector() ||
11402 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11403 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11406 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11407 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11408 MaskEltVT.getSizeInBits());
11410 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11411 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11412 getZeroVector(MaskVT, Subtarget, DAG, dl),
11413 Idx, DAG.getConstant(0, getPointerTy()));
11414 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11415 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
11416 Perm, DAG.getConstant(0, getPointerTy()));
11421 // If this is a 256-bit vector result, first extract the 128-bit vector and
11422 // then extract the element from the 128-bit vector.
11423 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11425 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11426 // Get the 128-bit vector.
11427 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11428 MVT EltVT = VecVT.getVectorElementType();
11430 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11432 //if (IdxVal >= NumElems/2)
11433 // IdxVal -= NumElems/2;
11434 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
11435 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11436 DAG.getConstant(IdxVal, MVT::i32));
11439 assert(VecVT.is128BitVector() && "Unexpected vector length");
11441 if (Subtarget->hasSSE41()) {
11442 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
11447 MVT VT = Op.getSimpleValueType();
11448 // TODO: handle v16i8.
11449 if (VT.getSizeInBits() == 16) {
11450 SDValue Vec = Op.getOperand(0);
11451 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11453 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11454 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11455 DAG.getNode(ISD::BITCAST, dl,
11457 Op.getOperand(1)));
11458 // Transform it so it match pextrw which produces a 32-bit result.
11459 MVT EltVT = MVT::i32;
11460 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11461 Op.getOperand(0), Op.getOperand(1));
11462 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11463 DAG.getValueType(VT));
11464 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11467 if (VT.getSizeInBits() == 32) {
11468 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11472 // SHUFPS the element to the lowest double word, then movss.
11473 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11474 MVT VVT = Op.getOperand(0).getSimpleValueType();
11475 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11476 DAG.getUNDEF(VVT), Mask);
11477 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11478 DAG.getIntPtrConstant(0));
11481 if (VT.getSizeInBits() == 64) {
11482 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11483 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11484 // to match extract_elt for f64.
11485 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11489 // UNPCKHPD the element to the lowest double word, then movsd.
11490 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11491 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11492 int Mask[2] = { 1, -1 };
11493 MVT VVT = Op.getOperand(0).getSimpleValueType();
11494 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11495 DAG.getUNDEF(VVT), Mask);
11496 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11497 DAG.getIntPtrConstant(0));
11503 /// Insert one bit to mask vector, like v16i1 or v8i1.
11504 /// AVX-512 feature.
11506 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11508 SDValue Vec = Op.getOperand(0);
11509 SDValue Elt = Op.getOperand(1);
11510 SDValue Idx = Op.getOperand(2);
11511 MVT VecVT = Vec.getSimpleValueType();
11513 if (!isa<ConstantSDNode>(Idx)) {
11514 // Non constant index. Extend source and destination,
11515 // insert element and then truncate the result.
11516 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11517 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11518 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11519 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11520 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11521 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11524 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11525 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11526 if (Vec.getOpcode() == ISD::UNDEF)
11527 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11528 DAG.getConstant(IdxVal, MVT::i8));
11529 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11530 unsigned MaxSift = rc->getSize()*8 - 1;
11531 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11532 DAG.getConstant(MaxSift, MVT::i8));
11533 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
11534 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11535 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11538 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11539 SelectionDAG &DAG) const {
11540 MVT VT = Op.getSimpleValueType();
11541 MVT EltVT = VT.getVectorElementType();
11543 if (EltVT == MVT::i1)
11544 return InsertBitToMaskVector(Op, DAG);
11547 SDValue N0 = Op.getOperand(0);
11548 SDValue N1 = Op.getOperand(1);
11549 SDValue N2 = Op.getOperand(2);
11550 if (!isa<ConstantSDNode>(N2))
11552 auto *N2C = cast<ConstantSDNode>(N2);
11553 unsigned IdxVal = N2C->getZExtValue();
11555 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11556 // into that, and then insert the subvector back into the result.
11557 if (VT.is256BitVector() || VT.is512BitVector()) {
11558 // Get the desired 128-bit vector half.
11559 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11561 // Insert the element into the desired half.
11562 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11563 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
11565 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11566 DAG.getConstant(IdxIn128, MVT::i32));
11568 // Insert the changed part back to the 256-bit vector
11569 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11571 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11573 if (Subtarget->hasSSE41()) {
11574 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11576 if (VT == MVT::v8i16) {
11577 Opc = X86ISD::PINSRW;
11579 assert(VT == MVT::v16i8);
11580 Opc = X86ISD::PINSRB;
11583 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11585 if (N1.getValueType() != MVT::i32)
11586 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11587 if (N2.getValueType() != MVT::i32)
11588 N2 = DAG.getIntPtrConstant(IdxVal);
11589 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11592 if (EltVT == MVT::f32) {
11593 // Bits [7:6] of the constant are the source select. This will always be
11594 // zero here. The DAG Combiner may combine an extract_elt index into
11596 // bits. For example (insert (extract, 3), 2) could be matched by
11598 // the '3' into bits [7:6] of X86ISD::INSERTPS.
11599 // Bits [5:4] of the constant are the destination select. This is the
11600 // value of the incoming immediate.
11601 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11602 // combine either bitwise AND or insert of float 0.0 to set these bits.
11603 N2 = DAG.getIntPtrConstant(IdxVal << 4);
11604 // Create this as a scalar to vector..
11605 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11606 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11609 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11610 // PINSR* works with constant index.
11615 if (EltVT == MVT::i8)
11618 if (EltVT.getSizeInBits() == 16) {
11619 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11620 // as its second argument.
11621 if (N1.getValueType() != MVT::i32)
11622 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11623 if (N2.getValueType() != MVT::i32)
11624 N2 = DAG.getIntPtrConstant(IdxVal);
11625 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11630 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11632 MVT OpVT = Op.getSimpleValueType();
11634 // If this is a 256-bit vector result, first insert into a 128-bit
11635 // vector and then insert into the 256-bit vector.
11636 if (!OpVT.is128BitVector()) {
11637 // Insert into a 128-bit vector.
11638 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11639 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11640 OpVT.getVectorNumElements() / SizeFactor);
11642 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11644 // Insert the 128-bit vector.
11645 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11648 if (OpVT == MVT::v1i64 &&
11649 Op.getOperand(0).getValueType() == MVT::i64)
11650 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11652 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11653 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11654 return DAG.getNode(ISD::BITCAST, dl, OpVT,
11655 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
11658 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11659 // a simple subregister reference or explicit instructions to grab
11660 // upper bits of a vector.
11661 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11662 SelectionDAG &DAG) {
11664 SDValue In = Op.getOperand(0);
11665 SDValue Idx = Op.getOperand(1);
11666 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11667 MVT ResVT = Op.getSimpleValueType();
11668 MVT InVT = In.getSimpleValueType();
11670 if (Subtarget->hasFp256()) {
11671 if (ResVT.is128BitVector() &&
11672 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11673 isa<ConstantSDNode>(Idx)) {
11674 return Extract128BitVector(In, IdxVal, DAG, dl);
11676 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11677 isa<ConstantSDNode>(Idx)) {
11678 return Extract256BitVector(In, IdxVal, DAG, dl);
11684 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11685 // simple superregister reference or explicit instructions to insert
11686 // the upper bits of a vector.
11687 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11688 SelectionDAG &DAG) {
11689 if (Subtarget->hasFp256()) {
11690 SDLoc dl(Op.getNode());
11691 SDValue Vec = Op.getNode()->getOperand(0);
11692 SDValue SubVec = Op.getNode()->getOperand(1);
11693 SDValue Idx = Op.getNode()->getOperand(2);
11695 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
11696 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
11697 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
11698 isa<ConstantSDNode>(Idx)) {
11699 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11700 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11703 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
11704 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
11705 isa<ConstantSDNode>(Idx)) {
11706 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11707 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11713 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11714 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11715 // one of the above mentioned nodes. It has to be wrapped because otherwise
11716 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11717 // be used to form addressing mode. These wrapped nodes will be selected
11720 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11721 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11723 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11724 // global base reg.
11725 unsigned char OpFlag = 0;
11726 unsigned WrapperKind = X86ISD::Wrapper;
11727 CodeModel::Model M = DAG.getTarget().getCodeModel();
11729 if (Subtarget->isPICStyleRIPRel() &&
11730 (M == CodeModel::Small || M == CodeModel::Kernel))
11731 WrapperKind = X86ISD::WrapperRIP;
11732 else if (Subtarget->isPICStyleGOT())
11733 OpFlag = X86II::MO_GOTOFF;
11734 else if (Subtarget->isPICStyleStubPIC())
11735 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11737 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
11738 CP->getAlignment(),
11739 CP->getOffset(), OpFlag);
11741 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11742 // With PIC, the address is actually $g + Offset.
11744 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11745 DAG.getNode(X86ISD::GlobalBaseReg,
11746 SDLoc(), getPointerTy()),
11753 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11754 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11756 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11757 // global base reg.
11758 unsigned char OpFlag = 0;
11759 unsigned WrapperKind = X86ISD::Wrapper;
11760 CodeModel::Model M = DAG.getTarget().getCodeModel();
11762 if (Subtarget->isPICStyleRIPRel() &&
11763 (M == CodeModel::Small || M == CodeModel::Kernel))
11764 WrapperKind = X86ISD::WrapperRIP;
11765 else if (Subtarget->isPICStyleGOT())
11766 OpFlag = X86II::MO_GOTOFF;
11767 else if (Subtarget->isPICStyleStubPIC())
11768 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11770 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
11773 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11775 // With PIC, the address is actually $g + Offset.
11777 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11778 DAG.getNode(X86ISD::GlobalBaseReg,
11779 SDLoc(), getPointerTy()),
11786 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11787 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11789 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11790 // global base reg.
11791 unsigned char OpFlag = 0;
11792 unsigned WrapperKind = X86ISD::Wrapper;
11793 CodeModel::Model M = DAG.getTarget().getCodeModel();
11795 if (Subtarget->isPICStyleRIPRel() &&
11796 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11797 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11798 OpFlag = X86II::MO_GOTPCREL;
11799 WrapperKind = X86ISD::WrapperRIP;
11800 } else if (Subtarget->isPICStyleGOT()) {
11801 OpFlag = X86II::MO_GOT;
11802 } else if (Subtarget->isPICStyleStubPIC()) {
11803 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11804 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11805 OpFlag = X86II::MO_DARWIN_NONLAZY;
11808 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
11811 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11813 // With PIC, the address is actually $g + Offset.
11814 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11815 !Subtarget->is64Bit()) {
11816 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11817 DAG.getNode(X86ISD::GlobalBaseReg,
11818 SDLoc(), getPointerTy()),
11822 // For symbols that require a load from a stub to get the address, emit the
11824 if (isGlobalStubReference(OpFlag))
11825 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
11826 MachinePointerInfo::getGOT(), false, false, false, 0);
11832 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11833 // Create the TargetBlockAddressAddress node.
11834 unsigned char OpFlags =
11835 Subtarget->ClassifyBlockAddressReference();
11836 CodeModel::Model M = DAG.getTarget().getCodeModel();
11837 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11838 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11840 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
11843 if (Subtarget->isPICStyleRIPRel() &&
11844 (M == CodeModel::Small || M == CodeModel::Kernel))
11845 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11847 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11849 // With PIC, the address is actually $g + Offset.
11850 if (isGlobalRelativeToPICBase(OpFlags)) {
11851 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11852 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11860 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11861 int64_t Offset, SelectionDAG &DAG) const {
11862 // Create the TargetGlobalAddress node, folding in the constant
11863 // offset if it is legal.
11864 unsigned char OpFlags =
11865 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11866 CodeModel::Model M = DAG.getTarget().getCodeModel();
11868 if (OpFlags == X86II::MO_NO_FLAG &&
11869 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11870 // A direct static reference to a global.
11871 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
11874 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
11877 if (Subtarget->isPICStyleRIPRel() &&
11878 (M == CodeModel::Small || M == CodeModel::Kernel))
11879 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11881 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11883 // With PIC, the address is actually $g + Offset.
11884 if (isGlobalRelativeToPICBase(OpFlags)) {
11885 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11886 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11890 // For globals that require a load from a stub to get the address, emit the
11892 if (isGlobalStubReference(OpFlags))
11893 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
11894 MachinePointerInfo::getGOT(), false, false, false, 0);
11896 // If there was a non-zero offset that we didn't fold, create an explicit
11897 // addition for it.
11899 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
11900 DAG.getConstant(Offset, getPointerTy()));
11906 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11907 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11908 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11909 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11913 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11914 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
11915 unsigned char OperandFlags, bool LocalDynamic = false) {
11916 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11917 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11919 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11920 GA->getValueType(0),
11924 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
11928 SDValue Ops[] = { Chain, TGA, *InFlag };
11929 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11931 SDValue Ops[] = { Chain, TGA };
11932 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11935 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
11936 MFI->setAdjustsStack(true);
11938 SDValue Flag = Chain.getValue(1);
11939 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
11942 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
11944 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11947 SDLoc dl(GA); // ? function entry point might be better
11948 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11949 DAG.getNode(X86ISD::GlobalBaseReg,
11950 SDLoc(), PtrVT), InFlag);
11951 InFlag = Chain.getValue(1);
11953 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
11956 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
11958 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11960 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
11961 X86::RAX, X86II::MO_TLSGD);
11964 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
11970 // Get the start address of the TLS block for this module.
11971 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
11972 .getInfo<X86MachineFunctionInfo>();
11973 MFI->incNumLocalDynamicTLSAccesses();
11977 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
11978 X86II::MO_TLSLD, /*LocalDynamic=*/true);
11981 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11982 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
11983 InFlag = Chain.getValue(1);
11984 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
11985 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
11988 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
11992 unsigned char OperandFlags = X86II::MO_DTPOFF;
11993 unsigned WrapperKind = X86ISD::Wrapper;
11994 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11995 GA->getValueType(0),
11996 GA->getOffset(), OperandFlags);
11997 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11999 // Add x@dtpoff with the base.
12000 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12003 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12004 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12005 const EVT PtrVT, TLSModel::Model model,
12006 bool is64Bit, bool isPIC) {
12009 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12010 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12011 is64Bit ? 257 : 256));
12013 SDValue ThreadPointer =
12014 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
12015 MachinePointerInfo(Ptr), false, false, false, 0);
12017 unsigned char OperandFlags = 0;
12018 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12020 unsigned WrapperKind = X86ISD::Wrapper;
12021 if (model == TLSModel::LocalExec) {
12022 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12023 } else if (model == TLSModel::InitialExec) {
12025 OperandFlags = X86II::MO_GOTTPOFF;
12026 WrapperKind = X86ISD::WrapperRIP;
12028 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12031 llvm_unreachable("Unexpected model");
12034 // emit "addl x@ntpoff,%eax" (local exec)
12035 // or "addl x@indntpoff,%eax" (initial exec)
12036 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12038 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12039 GA->getOffset(), OperandFlags);
12040 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12042 if (model == TLSModel::InitialExec) {
12043 if (isPIC && !is64Bit) {
12044 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12045 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12049 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12050 MachinePointerInfo::getGOT(), false, false, false, 0);
12053 // The address of the thread local variable is the add of the thread
12054 // pointer with the offset of the variable.
12055 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12059 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12061 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12062 const GlobalValue *GV = GA->getGlobal();
12064 if (Subtarget->isTargetELF()) {
12065 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12068 case TLSModel::GeneralDynamic:
12069 if (Subtarget->is64Bit())
12070 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
12071 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
12072 case TLSModel::LocalDynamic:
12073 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
12074 Subtarget->is64Bit());
12075 case TLSModel::InitialExec:
12076 case TLSModel::LocalExec:
12077 return LowerToTLSExecModel(
12078 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
12079 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
12081 llvm_unreachable("Unknown TLS model.");
12084 if (Subtarget->isTargetDarwin()) {
12085 // Darwin only has one model of TLS. Lower to that.
12086 unsigned char OpFlag = 0;
12087 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12088 X86ISD::WrapperRIP : X86ISD::Wrapper;
12090 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12091 // global base reg.
12092 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12093 !Subtarget->is64Bit();
12095 OpFlag = X86II::MO_TLVP_PIC_BASE;
12097 OpFlag = X86II::MO_TLVP;
12099 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12100 GA->getValueType(0),
12101 GA->getOffset(), OpFlag);
12102 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12104 // With PIC32, the address is actually $g + Offset.
12106 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12107 DAG.getNode(X86ISD::GlobalBaseReg,
12108 SDLoc(), getPointerTy()),
12111 // Lowering the machine isd will make sure everything is in the right
12113 SDValue Chain = DAG.getEntryNode();
12114 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12115 SDValue Args[] = { Chain, Offset };
12116 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12118 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12119 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12120 MFI->setAdjustsStack(true);
12122 // And our return value (tls address) is in the standard call return value
12124 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12125 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12126 Chain.getValue(1));
12129 if (Subtarget->isTargetKnownWindowsMSVC() ||
12130 Subtarget->isTargetWindowsGNU()) {
12131 // Just use the implicit TLS architecture
12132 // Need to generate someting similar to:
12133 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12135 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12136 // mov rcx, qword [rdx+rcx*8]
12137 // mov eax, .tls$:tlsvar
12138 // [rax+rcx] contains the address
12139 // Windows 64bit: gs:0x58
12140 // Windows 32bit: fs:__tls_array
12143 SDValue Chain = DAG.getEntryNode();
12145 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12146 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12147 // use its literal value of 0x2C.
12148 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12149 ? Type::getInt8PtrTy(*DAG.getContext(),
12151 : Type::getInt32PtrTy(*DAG.getContext(),
12155 Subtarget->is64Bit()
12156 ? DAG.getIntPtrConstant(0x58)
12157 : (Subtarget->isTargetWindowsGNU()
12158 ? DAG.getIntPtrConstant(0x2C)
12159 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12161 SDValue ThreadPointer =
12162 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12163 MachinePointerInfo(Ptr), false, false, false, 0);
12165 // Load the _tls_index variable
12166 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12167 if (Subtarget->is64Bit())
12168 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12169 IDX, MachinePointerInfo(), MVT::i32,
12170 false, false, false, 0);
12172 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12173 false, false, false, 0);
12175 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12177 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12179 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12180 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12181 false, false, false, 0);
12183 // Get the offset of start of .tls section
12184 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12185 GA->getValueType(0),
12186 GA->getOffset(), X86II::MO_SECREL);
12187 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12189 // The address of the thread local variable is the add of the thread
12190 // pointer with the offset of the variable.
12191 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12194 llvm_unreachable("TLS not implemented for this target.");
12197 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12198 /// and take a 2 x i32 value to shift plus a shift amount.
12199 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12200 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12201 MVT VT = Op.getSimpleValueType();
12202 unsigned VTBits = VT.getSizeInBits();
12204 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12205 SDValue ShOpLo = Op.getOperand(0);
12206 SDValue ShOpHi = Op.getOperand(1);
12207 SDValue ShAmt = Op.getOperand(2);
12208 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12209 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12211 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12212 DAG.getConstant(VTBits - 1, MVT::i8));
12213 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12214 DAG.getConstant(VTBits - 1, MVT::i8))
12215 : DAG.getConstant(0, VT);
12217 SDValue Tmp2, Tmp3;
12218 if (Op.getOpcode() == ISD::SHL_PARTS) {
12219 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12220 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12222 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12223 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12226 // If the shift amount is larger or equal than the width of a part we can't
12227 // rely on the results of shld/shrd. Insert a test and select the appropriate
12228 // values for large shift amounts.
12229 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12230 DAG.getConstant(VTBits, MVT::i8));
12231 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12232 AndNode, DAG.getConstant(0, MVT::i8));
12235 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12236 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12237 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12239 if (Op.getOpcode() == ISD::SHL_PARTS) {
12240 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12241 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12243 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12244 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12247 SDValue Ops[2] = { Lo, Hi };
12248 return DAG.getMergeValues(Ops, dl);
12251 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12252 SelectionDAG &DAG) const {
12253 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12255 if (SrcVT.isVector())
12258 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12259 "Unknown SINT_TO_FP to lower!");
12261 // These are really Legal; return the operand so the caller accepts it as
12263 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12265 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12266 Subtarget->is64Bit()) {
12271 unsigned Size = SrcVT.getSizeInBits()/8;
12272 MachineFunction &MF = DAG.getMachineFunction();
12273 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12274 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12275 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12277 MachinePointerInfo::getFixedStack(SSFI),
12279 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12282 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12284 SelectionDAG &DAG) const {
12288 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12290 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12292 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12294 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12296 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12297 MachineMemOperand *MMO;
12299 int SSFI = FI->getIndex();
12301 DAG.getMachineFunction()
12302 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12303 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12305 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12306 StackSlot = StackSlot.getOperand(1);
12308 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12309 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12311 Tys, Ops, SrcVT, MMO);
12314 Chain = Result.getValue(1);
12315 SDValue InFlag = Result.getValue(2);
12317 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12318 // shouldn't be necessary except that RFP cannot be live across
12319 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12320 MachineFunction &MF = DAG.getMachineFunction();
12321 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12322 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12323 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12324 Tys = DAG.getVTList(MVT::Other);
12326 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12328 MachineMemOperand *MMO =
12329 DAG.getMachineFunction()
12330 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12331 MachineMemOperand::MOStore, SSFISize, SSFISize);
12333 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12334 Ops, Op.getValueType(), MMO);
12335 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
12336 MachinePointerInfo::getFixedStack(SSFI),
12337 false, false, false, 0);
12343 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12344 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12345 SelectionDAG &DAG) const {
12346 // This algorithm is not obvious. Here it is what we're trying to output:
12349 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12350 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12352 haddpd %xmm0, %xmm0
12354 pshufd $0x4e, %xmm0, %xmm1
12360 LLVMContext *Context = DAG.getContext();
12362 // Build some magic constants.
12363 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12364 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12365 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
12367 SmallVector<Constant*,2> CV1;
12369 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12370 APInt(64, 0x4330000000000000ULL))));
12372 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12373 APInt(64, 0x4530000000000000ULL))));
12374 Constant *C1 = ConstantVector::get(CV1);
12375 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
12377 // Load the 64-bit value into an XMM register.
12378 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12380 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12381 MachinePointerInfo::getConstantPool(),
12382 false, false, false, 16);
12383 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
12384 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
12387 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12388 MachinePointerInfo::getConstantPool(),
12389 false, false, false, 16);
12390 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
12391 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12394 if (Subtarget->hasSSE3()) {
12395 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12396 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12398 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
12399 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12401 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12402 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
12406 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12407 DAG.getIntPtrConstant(0));
12410 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12411 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12412 SelectionDAG &DAG) const {
12414 // FP constant to bias correct the final result.
12415 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
12418 // Load the 32-bit value into an XMM register.
12419 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12422 // Zero out the upper parts of the register.
12423 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12425 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12426 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
12427 DAG.getIntPtrConstant(0));
12429 // Or the load with the bias.
12430 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
12431 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12432 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12433 MVT::v2f64, Load)),
12434 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12435 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12436 MVT::v2f64, Bias)));
12437 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12438 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
12439 DAG.getIntPtrConstant(0));
12441 // Subtract the bias.
12442 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12444 // Handle final rounding.
12445 EVT DestVT = Op.getValueType();
12447 if (DestVT.bitsLT(MVT::f64))
12448 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12449 DAG.getIntPtrConstant(0));
12450 if (DestVT.bitsGT(MVT::f64))
12451 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12453 // Handle final rounding.
12457 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12458 SelectionDAG &DAG) const {
12459 SDValue N0 = Op.getOperand(0);
12460 MVT SVT = N0.getSimpleValueType();
12463 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
12464 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
12465 "Custom UINT_TO_FP is not supported!");
12467 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12468 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12469 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12472 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12473 SelectionDAG &DAG) const {
12474 SDValue N0 = Op.getOperand(0);
12477 if (Op.getValueType().isVector())
12478 return lowerUINT_TO_FP_vec(Op, DAG);
12480 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12481 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12482 // the optimization here.
12483 if (DAG.SignBitIsZero(N0))
12484 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12486 MVT SrcVT = N0.getSimpleValueType();
12487 MVT DstVT = Op.getSimpleValueType();
12488 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12489 return LowerUINT_TO_FP_i64(Op, DAG);
12490 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12491 return LowerUINT_TO_FP_i32(Op, DAG);
12492 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12495 // Make a 64-bit buffer, and use it to build an FILD.
12496 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12497 if (SrcVT == MVT::i32) {
12498 SDValue WordOff = DAG.getConstant(4, getPointerTy());
12499 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
12500 getPointerTy(), StackSlot, WordOff);
12501 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12502 StackSlot, MachinePointerInfo(),
12504 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
12505 OffsetSlot, MachinePointerInfo(),
12507 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12511 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12512 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12513 StackSlot, MachinePointerInfo(),
12515 // For i64 source, we need to add the appropriate power of 2 if the input
12516 // was negative. This is the same as the optimization in
12517 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12518 // we must be careful to do the computation in x87 extended precision, not
12519 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12520 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12521 MachineMemOperand *MMO =
12522 DAG.getMachineFunction()
12523 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12524 MachineMemOperand::MOLoad, 8, 8);
12526 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12527 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12528 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12531 APInt FF(32, 0x5F800000ULL);
12533 // Check whether the sign bit is set.
12534 SDValue SignSet = DAG.getSetCC(dl,
12535 getSetCCResultType(*DAG.getContext(), MVT::i64),
12536 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
12539 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12540 SDValue FudgePtr = DAG.getConstantPool(
12541 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
12544 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12545 SDValue Zero = DAG.getIntPtrConstant(0);
12546 SDValue Four = DAG.getIntPtrConstant(4);
12547 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12549 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
12551 // Load the value out, extending it from f32 to f80.
12552 // FIXME: Avoid the extend by constructing the right constant pool?
12553 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
12554 FudgePtr, MachinePointerInfo::getConstantPool(),
12555 MVT::f32, false, false, false, 4);
12556 // Extend everything to 80 bits to force it to be done on x87.
12557 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12558 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
12561 std::pair<SDValue,SDValue>
12562 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12563 bool IsSigned, bool IsReplace) const {
12566 EVT DstTy = Op.getValueType();
12568 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
12569 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12573 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12574 DstTy.getSimpleVT() >= MVT::i16 &&
12575 "Unknown FP_TO_INT to lower!");
12577 // These are really Legal.
12578 if (DstTy == MVT::i32 &&
12579 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12580 return std::make_pair(SDValue(), SDValue());
12581 if (Subtarget->is64Bit() &&
12582 DstTy == MVT::i64 &&
12583 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12584 return std::make_pair(SDValue(), SDValue());
12586 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
12587 // stack slot, or into the FTOL runtime function.
12588 MachineFunction &MF = DAG.getMachineFunction();
12589 unsigned MemSize = DstTy.getSizeInBits()/8;
12590 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12591 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12594 if (!IsSigned && isIntegerTypeFTOL(DstTy))
12595 Opc = X86ISD::WIN_FTOL;
12597 switch (DstTy.getSimpleVT().SimpleTy) {
12598 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12599 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12600 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12601 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12604 SDValue Chain = DAG.getEntryNode();
12605 SDValue Value = Op.getOperand(0);
12606 EVT TheVT = Op.getOperand(0).getValueType();
12607 // FIXME This causes a redundant load/store if the SSE-class value is already
12608 // in memory, such as if it is on the callstack.
12609 if (isScalarFPTypeInSSEReg(TheVT)) {
12610 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
12611 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
12612 MachinePointerInfo::getFixedStack(SSFI),
12614 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
12616 Chain, StackSlot, DAG.getValueType(TheVT)
12619 MachineMemOperand *MMO =
12620 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12621 MachineMemOperand::MOLoad, MemSize, MemSize);
12622 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
12623 Chain = Value.getValue(1);
12624 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12625 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12628 MachineMemOperand *MMO =
12629 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12630 MachineMemOperand::MOStore, MemSize, MemSize);
12632 if (Opc != X86ISD::WIN_FTOL) {
12633 // Build the FP_TO_INT*_IN_MEM
12634 SDValue Ops[] = { Chain, Value, StackSlot };
12635 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12637 return std::make_pair(FIST, StackSlot);
12639 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
12640 DAG.getVTList(MVT::Other, MVT::Glue),
12642 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
12643 MVT::i32, ftol.getValue(1));
12644 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
12645 MVT::i32, eax.getValue(2));
12646 SDValue Ops[] = { eax, edx };
12647 SDValue pair = IsReplace
12648 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
12649 : DAG.getMergeValues(Ops, DL);
12650 return std::make_pair(pair, SDValue());
12654 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
12655 const X86Subtarget *Subtarget) {
12656 MVT VT = Op->getSimpleValueType(0);
12657 SDValue In = Op->getOperand(0);
12658 MVT InVT = In.getSimpleValueType();
12661 // Optimize vectors in AVX mode:
12664 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
12665 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
12666 // Concat upper and lower parts.
12669 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
12670 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
12671 // Concat upper and lower parts.
12674 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
12675 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
12676 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
12679 if (Subtarget->hasInt256())
12680 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
12682 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
12683 SDValue Undef = DAG.getUNDEF(InVT);
12684 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
12685 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12686 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12688 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
12689 VT.getVectorNumElements()/2);
12691 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
12692 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
12694 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
12697 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
12698 SelectionDAG &DAG) {
12699 MVT VT = Op->getSimpleValueType(0);
12700 SDValue In = Op->getOperand(0);
12701 MVT InVT = In.getSimpleValueType();
12703 unsigned int NumElts = VT.getVectorNumElements();
12704 if (NumElts != 8 && NumElts != 16)
12707 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
12708 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
12710 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
12711 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12712 // Now we have only mask extension
12713 assert(InVT.getVectorElementType() == MVT::i1);
12714 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
12715 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12716 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
12717 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12718 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12719 MachinePointerInfo::getConstantPool(),
12720 false, false, false, Alignment);
12722 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
12723 if (VT.is512BitVector())
12725 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
12728 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12729 SelectionDAG &DAG) {
12730 if (Subtarget->hasFp256()) {
12731 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12739 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12740 SelectionDAG &DAG) {
12742 MVT VT = Op.getSimpleValueType();
12743 SDValue In = Op.getOperand(0);
12744 MVT SVT = In.getSimpleValueType();
12746 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
12747 return LowerZERO_EXTEND_AVX512(Op, DAG);
12749 if (Subtarget->hasFp256()) {
12750 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12755 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
12756 VT.getVectorNumElements() != SVT.getVectorNumElements());
12760 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
12762 MVT VT = Op.getSimpleValueType();
12763 SDValue In = Op.getOperand(0);
12764 MVT InVT = In.getSimpleValueType();
12766 if (VT == MVT::i1) {
12767 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
12768 "Invalid scalar TRUNCATE operation");
12769 if (InVT.getSizeInBits() >= 32)
12771 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
12772 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
12774 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
12775 "Invalid TRUNCATE operation");
12777 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
12778 if (VT.getVectorElementType().getSizeInBits() >=8)
12779 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
12781 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
12782 unsigned NumElts = InVT.getVectorNumElements();
12783 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
12784 if (InVT.getSizeInBits() < 512) {
12785 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
12786 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
12790 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
12791 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12792 SDValue CP = DAG.getConstantPool(C, getPointerTy());
12793 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12794 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12795 MachinePointerInfo::getConstantPool(),
12796 false, false, false, Alignment);
12797 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
12798 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
12799 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
12802 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
12803 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
12804 if (Subtarget->hasInt256()) {
12805 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
12806 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
12807 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
12809 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
12810 DAG.getIntPtrConstant(0));
12813 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12814 DAG.getIntPtrConstant(0));
12815 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12816 DAG.getIntPtrConstant(2));
12817 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12818 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12819 static const int ShufMask[] = {0, 2, 4, 6};
12820 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
12823 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
12824 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
12825 if (Subtarget->hasInt256()) {
12826 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
12828 SmallVector<SDValue,32> pshufbMask;
12829 for (unsigned i = 0; i < 2; ++i) {
12830 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
12831 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
12832 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
12833 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
12834 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
12835 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
12836 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
12837 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
12838 for (unsigned j = 0; j < 8; ++j)
12839 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
12841 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
12842 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
12843 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
12845 static const int ShufMask[] = {0, 2, -1, -1};
12846 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
12848 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12849 DAG.getIntPtrConstant(0));
12850 return DAG.getNode(ISD::BITCAST, DL, VT, In);
12853 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12854 DAG.getIntPtrConstant(0));
12856 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12857 DAG.getIntPtrConstant(4));
12859 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
12860 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
12862 // The PSHUFB mask:
12863 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
12864 -1, -1, -1, -1, -1, -1, -1, -1};
12866 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
12867 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
12868 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
12870 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12871 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12873 // The MOVLHPS Mask:
12874 static const int ShufMask2[] = {0, 1, 4, 5};
12875 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
12876 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
12879 // Handle truncation of V256 to V128 using shuffles.
12880 if (!VT.is128BitVector() || !InVT.is256BitVector())
12883 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
12885 unsigned NumElems = VT.getVectorNumElements();
12886 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
12888 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
12889 // Prepare truncation shuffle mask
12890 for (unsigned i = 0; i != NumElems; ++i)
12891 MaskVec[i] = i * 2;
12892 SDValue V = DAG.getVectorShuffle(NVT, DL,
12893 DAG.getNode(ISD::BITCAST, DL, NVT, In),
12894 DAG.getUNDEF(NVT), &MaskVec[0]);
12895 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
12896 DAG.getIntPtrConstant(0));
12899 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
12900 SelectionDAG &DAG) const {
12901 assert(!Op.getSimpleValueType().isVector());
12903 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12904 /*IsSigned=*/ true, /*IsReplace=*/ false);
12905 SDValue FIST = Vals.first, StackSlot = Vals.second;
12906 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
12907 if (!FIST.getNode()) return Op;
12909 if (StackSlot.getNode())
12910 // Load the result.
12911 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12912 FIST, StackSlot, MachinePointerInfo(),
12913 false, false, false, 0);
12915 // The node is the result.
12919 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
12920 SelectionDAG &DAG) const {
12921 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12922 /*IsSigned=*/ false, /*IsReplace=*/ false);
12923 SDValue FIST = Vals.first, StackSlot = Vals.second;
12924 assert(FIST.getNode() && "Unexpected failure");
12926 if (StackSlot.getNode())
12927 // Load the result.
12928 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12929 FIST, StackSlot, MachinePointerInfo(),
12930 false, false, false, 0);
12932 // The node is the result.
12936 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
12938 MVT VT = Op.getSimpleValueType();
12939 SDValue In = Op.getOperand(0);
12940 MVT SVT = In.getSimpleValueType();
12942 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
12944 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
12945 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
12946 In, DAG.getUNDEF(SVT)));
12949 // The only differences between FABS and FNEG are the mask and the logic op.
12950 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
12951 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
12952 "Wrong opcode for lowering FABS or FNEG.");
12954 bool IsFABS = (Op.getOpcode() == ISD::FABS);
12956 MVT VT = Op.getSimpleValueType();
12957 // Assume scalar op for initialization; update for vector if needed.
12958 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
12959 // generate a 16-byte vector constant and logic op even for the scalar case.
12960 // Using a 16-byte mask allows folding the load of the mask with
12961 // the logic op, so it can save (~4 bytes) on code size.
12963 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
12964 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
12965 // decide if we should generate a 16-byte constant mask when we only need 4 or
12966 // 8 bytes for the scalar case.
12967 if (VT.isVector()) {
12968 EltVT = VT.getVectorElementType();
12969 NumElts = VT.getVectorNumElements();
12972 unsigned EltBits = EltVT.getSizeInBits();
12973 LLVMContext *Context = DAG.getContext();
12974 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
12976 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
12977 Constant *C = ConstantInt::get(*Context, MaskElt);
12978 C = ConstantVector::getSplat(NumElts, C);
12979 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12980 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
12981 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
12982 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12983 MachinePointerInfo::getConstantPool(),
12984 false, false, false, Alignment);
12986 if (VT.isVector()) {
12987 // For a vector, cast operands to a vector type, perform the logic op,
12988 // and cast the result back to the original value type.
12989 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
12990 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
12991 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
12992 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
12993 return DAG.getNode(ISD::BITCAST, dl, VT,
12994 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
12996 // If not vector, then scalar.
12997 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
12998 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
13001 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13002 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13003 LLVMContext *Context = DAG.getContext();
13004 SDValue Op0 = Op.getOperand(0);
13005 SDValue Op1 = Op.getOperand(1);
13007 MVT VT = Op.getSimpleValueType();
13008 MVT SrcVT = Op1.getSimpleValueType();
13010 // If second operand is smaller, extend it first.
13011 if (SrcVT.bitsLT(VT)) {
13012 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13015 // And if it is bigger, shrink it first.
13016 if (SrcVT.bitsGT(VT)) {
13017 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
13021 // At this point the operands and the result should have the same
13022 // type, and that won't be f80 since that is not custom lowered.
13024 // First get the sign bit of second operand.
13025 SmallVector<Constant*,4> CV;
13026 if (SrcVT == MVT::f64) {
13027 const fltSemantics &Sem = APFloat::IEEEdouble;
13028 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
13029 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13031 const fltSemantics &Sem = APFloat::IEEEsingle;
13032 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
13033 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13034 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13035 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13037 Constant *C = ConstantVector::get(CV);
13038 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13039 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
13040 MachinePointerInfo::getConstantPool(),
13041 false, false, false, 16);
13042 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
13044 // Shift sign bit right or left if the two operands have different types.
13045 if (SrcVT.bitsGT(VT)) {
13046 // Op0 is MVT::f32, Op1 is MVT::f64.
13047 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
13048 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
13049 DAG.getConstant(32, MVT::i32));
13050 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
13051 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
13052 DAG.getIntPtrConstant(0));
13055 // Clear first operand sign bit.
13057 if (VT == MVT::f64) {
13058 const fltSemantics &Sem = APFloat::IEEEdouble;
13059 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13060 APInt(64, ~(1ULL << 63)))));
13061 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13063 const fltSemantics &Sem = APFloat::IEEEsingle;
13064 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13065 APInt(32, ~(1U << 31)))));
13066 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13067 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13068 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13070 C = ConstantVector::get(CV);
13071 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13072 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13073 MachinePointerInfo::getConstantPool(),
13074 false, false, false, 16);
13075 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
13077 // Or the value with the sign bit.
13078 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
13081 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13082 SDValue N0 = Op.getOperand(0);
13084 MVT VT = Op.getSimpleValueType();
13086 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13087 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13088 DAG.getConstant(1, VT));
13089 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
13092 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
13094 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13095 SelectionDAG &DAG) {
13096 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13098 if (!Subtarget->hasSSE41())
13101 if (!Op->hasOneUse())
13104 SDNode *N = Op.getNode();
13107 SmallVector<SDValue, 8> Opnds;
13108 DenseMap<SDValue, unsigned> VecInMap;
13109 SmallVector<SDValue, 8> VecIns;
13110 EVT VT = MVT::Other;
13112 // Recognize a special case where a vector is casted into wide integer to
13114 Opnds.push_back(N->getOperand(0));
13115 Opnds.push_back(N->getOperand(1));
13117 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13118 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13119 // BFS traverse all OR'd operands.
13120 if (I->getOpcode() == ISD::OR) {
13121 Opnds.push_back(I->getOperand(0));
13122 Opnds.push_back(I->getOperand(1));
13123 // Re-evaluate the number of nodes to be traversed.
13124 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13128 // Quit if a non-EXTRACT_VECTOR_ELT
13129 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13132 // Quit if without a constant index.
13133 SDValue Idx = I->getOperand(1);
13134 if (!isa<ConstantSDNode>(Idx))
13137 SDValue ExtractedFromVec = I->getOperand(0);
13138 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13139 if (M == VecInMap.end()) {
13140 VT = ExtractedFromVec.getValueType();
13141 // Quit if not 128/256-bit vector.
13142 if (!VT.is128BitVector() && !VT.is256BitVector())
13144 // Quit if not the same type.
13145 if (VecInMap.begin() != VecInMap.end() &&
13146 VT != VecInMap.begin()->first.getValueType())
13148 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13149 VecIns.push_back(ExtractedFromVec);
13151 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13154 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13155 "Not extracted from 128-/256-bit vector.");
13157 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13159 for (DenseMap<SDValue, unsigned>::const_iterator
13160 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13161 // Quit if not all elements are used.
13162 if (I->second != FullMask)
13166 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13168 // Cast all vectors into TestVT for PTEST.
13169 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13170 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13172 // If more than one full vectors are evaluated, OR them first before PTEST.
13173 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13174 // Each iteration will OR 2 nodes and append the result until there is only
13175 // 1 node left, i.e. the final OR'd value of all vectors.
13176 SDValue LHS = VecIns[Slot];
13177 SDValue RHS = VecIns[Slot + 1];
13178 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13181 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13182 VecIns.back(), VecIns.back());
13185 /// \brief return true if \c Op has a use that doesn't just read flags.
13186 static bool hasNonFlagsUse(SDValue Op) {
13187 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13189 SDNode *User = *UI;
13190 unsigned UOpNo = UI.getOperandNo();
13191 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13192 // Look pass truncate.
13193 UOpNo = User->use_begin().getOperandNo();
13194 User = *User->use_begin();
13197 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13198 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13204 /// Emit nodes that will be selected as "test Op0,Op0", or something
13206 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13207 SelectionDAG &DAG) const {
13208 if (Op.getValueType() == MVT::i1)
13209 // KORTEST instruction should be selected
13210 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13211 DAG.getConstant(0, Op.getValueType()));
13213 // CF and OF aren't always set the way we want. Determine which
13214 // of these we need.
13215 bool NeedCF = false;
13216 bool NeedOF = false;
13219 case X86::COND_A: case X86::COND_AE:
13220 case X86::COND_B: case X86::COND_BE:
13223 case X86::COND_G: case X86::COND_GE:
13224 case X86::COND_L: case X86::COND_LE:
13225 case X86::COND_O: case X86::COND_NO: {
13226 // Check if we really need to set the
13227 // Overflow flag. If NoSignedWrap is present
13228 // that is not actually needed.
13229 switch (Op->getOpcode()) {
13234 const BinaryWithFlagsSDNode *BinNode =
13235 cast<BinaryWithFlagsSDNode>(Op.getNode());
13236 if (BinNode->hasNoSignedWrap())
13246 // See if we can use the EFLAGS value from the operand instead of
13247 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13248 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13249 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13250 // Emit a CMP with 0, which is the TEST pattern.
13251 //if (Op.getValueType() == MVT::i1)
13252 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13253 // DAG.getConstant(0, MVT::i1));
13254 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13255 DAG.getConstant(0, Op.getValueType()));
13257 unsigned Opcode = 0;
13258 unsigned NumOperands = 0;
13260 // Truncate operations may prevent the merge of the SETCC instruction
13261 // and the arithmetic instruction before it. Attempt to truncate the operands
13262 // of the arithmetic instruction and use a reduced bit-width instruction.
13263 bool NeedTruncation = false;
13264 SDValue ArithOp = Op;
13265 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13266 SDValue Arith = Op->getOperand(0);
13267 // Both the trunc and the arithmetic op need to have one user each.
13268 if (Arith->hasOneUse())
13269 switch (Arith.getOpcode()) {
13276 NeedTruncation = true;
13282 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13283 // which may be the result of a CAST. We use the variable 'Op', which is the
13284 // non-casted variable when we check for possible users.
13285 switch (ArithOp.getOpcode()) {
13287 // Due to an isel shortcoming, be conservative if this add is likely to be
13288 // selected as part of a load-modify-store instruction. When the root node
13289 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13290 // uses of other nodes in the match, such as the ADD in this case. This
13291 // leads to the ADD being left around and reselected, with the result being
13292 // two adds in the output. Alas, even if none our users are stores, that
13293 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13294 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13295 // climbing the DAG back to the root, and it doesn't seem to be worth the
13297 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13298 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13299 if (UI->getOpcode() != ISD::CopyToReg &&
13300 UI->getOpcode() != ISD::SETCC &&
13301 UI->getOpcode() != ISD::STORE)
13304 if (ConstantSDNode *C =
13305 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13306 // An add of one will be selected as an INC.
13307 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13308 Opcode = X86ISD::INC;
13313 // An add of negative one (subtract of one) will be selected as a DEC.
13314 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13315 Opcode = X86ISD::DEC;
13321 // Otherwise use a regular EFLAGS-setting add.
13322 Opcode = X86ISD::ADD;
13327 // If we have a constant logical shift that's only used in a comparison
13328 // against zero turn it into an equivalent AND. This allows turning it into
13329 // a TEST instruction later.
13330 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13331 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13332 EVT VT = Op.getValueType();
13333 unsigned BitWidth = VT.getSizeInBits();
13334 unsigned ShAmt = Op->getConstantOperandVal(1);
13335 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13337 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13338 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13339 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13340 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13342 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13343 DAG.getConstant(Mask, VT));
13344 DAG.ReplaceAllUsesWith(Op, New);
13350 // If the primary and result isn't used, don't bother using X86ISD::AND,
13351 // because a TEST instruction will be better.
13352 if (!hasNonFlagsUse(Op))
13358 // Due to the ISEL shortcoming noted above, be conservative if this op is
13359 // likely to be selected as part of a load-modify-store instruction.
13360 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13361 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13362 if (UI->getOpcode() == ISD::STORE)
13365 // Otherwise use a regular EFLAGS-setting instruction.
13366 switch (ArithOp.getOpcode()) {
13367 default: llvm_unreachable("unexpected operator!");
13368 case ISD::SUB: Opcode = X86ISD::SUB; break;
13369 case ISD::XOR: Opcode = X86ISD::XOR; break;
13370 case ISD::AND: Opcode = X86ISD::AND; break;
13372 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13373 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13374 if (EFLAGS.getNode())
13377 Opcode = X86ISD::OR;
13391 return SDValue(Op.getNode(), 1);
13397 // If we found that truncation is beneficial, perform the truncation and
13399 if (NeedTruncation) {
13400 EVT VT = Op.getValueType();
13401 SDValue WideVal = Op->getOperand(0);
13402 EVT WideVT = WideVal.getValueType();
13403 unsigned ConvertedOp = 0;
13404 // Use a target machine opcode to prevent further DAGCombine
13405 // optimizations that may separate the arithmetic operations
13406 // from the setcc node.
13407 switch (WideVal.getOpcode()) {
13409 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13410 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13411 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13412 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13413 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13417 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13418 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13419 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13420 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13421 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13427 // Emit a CMP with 0, which is the TEST pattern.
13428 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13429 DAG.getConstant(0, Op.getValueType()));
13431 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13432 SmallVector<SDValue, 4> Ops;
13433 for (unsigned i = 0; i != NumOperands; ++i)
13434 Ops.push_back(Op.getOperand(i));
13436 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13437 DAG.ReplaceAllUsesWith(Op, New);
13438 return SDValue(New.getNode(), 1);
13441 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13443 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13444 SDLoc dl, SelectionDAG &DAG) const {
13445 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
13446 if (C->getAPIntValue() == 0)
13447 return EmitTest(Op0, X86CC, dl, DAG);
13449 if (Op0.getValueType() == MVT::i1)
13450 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
13453 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13454 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13455 // Do the comparison at i32 if it's smaller, besides the Atom case.
13456 // This avoids subregister aliasing issues. Keep the smaller reference
13457 // if we're optimizing for size, however, as that'll allow better folding
13458 // of memory operations.
13459 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13460 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
13461 AttributeSet::FunctionIndex, Attribute::MinSize) &&
13462 !Subtarget->isAtom()) {
13463 unsigned ExtendOp =
13464 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13465 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13466 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13468 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13469 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13470 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13472 return SDValue(Sub.getNode(), 1);
13474 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13477 /// Convert a comparison if required by the subtarget.
13478 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13479 SelectionDAG &DAG) const {
13480 // If the subtarget does not support the FUCOMI instruction, floating-point
13481 // comparisons have to be converted.
13482 if (Subtarget->hasCMov() ||
13483 Cmp.getOpcode() != X86ISD::CMP ||
13484 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13485 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13488 // The instruction selector will select an FUCOM instruction instead of
13489 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13490 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13491 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13493 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13494 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13495 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13496 DAG.getConstant(8, MVT::i8));
13497 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13498 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13501 static bool isAllOnes(SDValue V) {
13502 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
13503 return C && C->isAllOnesValue();
13506 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
13507 /// if it's possible.
13508 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
13509 SDLoc dl, SelectionDAG &DAG) const {
13510 SDValue Op0 = And.getOperand(0);
13511 SDValue Op1 = And.getOperand(1);
13512 if (Op0.getOpcode() == ISD::TRUNCATE)
13513 Op0 = Op0.getOperand(0);
13514 if (Op1.getOpcode() == ISD::TRUNCATE)
13515 Op1 = Op1.getOperand(0);
13518 if (Op1.getOpcode() == ISD::SHL)
13519 std::swap(Op0, Op1);
13520 if (Op0.getOpcode() == ISD::SHL) {
13521 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
13522 if (And00C->getZExtValue() == 1) {
13523 // If we looked past a truncate, check that it's only truncating away
13525 unsigned BitWidth = Op0.getValueSizeInBits();
13526 unsigned AndBitWidth = And.getValueSizeInBits();
13527 if (BitWidth > AndBitWidth) {
13529 DAG.computeKnownBits(Op0, Zeros, Ones);
13530 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
13534 RHS = Op0.getOperand(1);
13536 } else if (Op1.getOpcode() == ISD::Constant) {
13537 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
13538 uint64_t AndRHSVal = AndRHS->getZExtValue();
13539 SDValue AndLHS = Op0;
13541 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
13542 LHS = AndLHS.getOperand(0);
13543 RHS = AndLHS.getOperand(1);
13546 // Use BT if the immediate can't be encoded in a TEST instruction.
13547 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
13549 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
13553 if (LHS.getNode()) {
13554 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
13555 // instruction. Since the shift amount is in-range-or-undefined, we know
13556 // that doing a bittest on the i32 value is ok. We extend to i32 because
13557 // the encoding for the i16 version is larger than the i32 version.
13558 // Also promote i16 to i32 for performance / code size reason.
13559 if (LHS.getValueType() == MVT::i8 ||
13560 LHS.getValueType() == MVT::i16)
13561 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
13563 // If the operand types disagree, extend the shift amount to match. Since
13564 // BT ignores high bits (like shifts) we can use anyextend.
13565 if (LHS.getValueType() != RHS.getValueType())
13566 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
13568 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
13569 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
13570 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13571 DAG.getConstant(Cond, MVT::i8), BT);
13577 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
13579 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
13584 // SSE Condition code mapping:
13593 switch (SetCCOpcode) {
13594 default: llvm_unreachable("Unexpected SETCC condition");
13596 case ISD::SETEQ: SSECC = 0; break;
13598 case ISD::SETGT: Swap = true; // Fallthrough
13600 case ISD::SETOLT: SSECC = 1; break;
13602 case ISD::SETGE: Swap = true; // Fallthrough
13604 case ISD::SETOLE: SSECC = 2; break;
13605 case ISD::SETUO: SSECC = 3; break;
13607 case ISD::SETNE: SSECC = 4; break;
13608 case ISD::SETULE: Swap = true; // Fallthrough
13609 case ISD::SETUGE: SSECC = 5; break;
13610 case ISD::SETULT: Swap = true; // Fallthrough
13611 case ISD::SETUGT: SSECC = 6; break;
13612 case ISD::SETO: SSECC = 7; break;
13614 case ISD::SETONE: SSECC = 8; break;
13617 std::swap(Op0, Op1);
13622 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
13623 // ones, and then concatenate the result back.
13624 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
13625 MVT VT = Op.getSimpleValueType();
13627 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
13628 "Unsupported value type for operation");
13630 unsigned NumElems = VT.getVectorNumElements();
13632 SDValue CC = Op.getOperand(2);
13634 // Extract the LHS vectors
13635 SDValue LHS = Op.getOperand(0);
13636 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
13637 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
13639 // Extract the RHS vectors
13640 SDValue RHS = Op.getOperand(1);
13641 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
13642 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
13644 // Issue the operation on the smaller types and concatenate the result back
13645 MVT EltVT = VT.getVectorElementType();
13646 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
13647 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
13648 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
13649 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
13652 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
13653 const X86Subtarget *Subtarget) {
13654 SDValue Op0 = Op.getOperand(0);
13655 SDValue Op1 = Op.getOperand(1);
13656 SDValue CC = Op.getOperand(2);
13657 MVT VT = Op.getSimpleValueType();
13660 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
13661 Op.getValueType().getScalarType() == MVT::i1 &&
13662 "Cannot set masked compare for this operation");
13664 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13666 bool Unsigned = false;
13669 switch (SetCCOpcode) {
13670 default: llvm_unreachable("Unexpected SETCC condition");
13671 case ISD::SETNE: SSECC = 4; break;
13672 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
13673 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
13674 case ISD::SETLT: Swap = true; //fall-through
13675 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
13676 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
13677 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
13678 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
13679 case ISD::SETULE: Unsigned = true; //fall-through
13680 case ISD::SETLE: SSECC = 2; break;
13684 std::swap(Op0, Op1);
13686 return DAG.getNode(Opc, dl, VT, Op0, Op1);
13687 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
13688 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13689 DAG.getConstant(SSECC, MVT::i8));
13692 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
13693 /// operand \p Op1. If non-trivial (for example because it's not constant)
13694 /// return an empty value.
13695 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
13697 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
13701 MVT VT = Op1.getSimpleValueType();
13702 MVT EVT = VT.getVectorElementType();
13703 unsigned n = VT.getVectorNumElements();
13704 SmallVector<SDValue, 8> ULTOp1;
13706 for (unsigned i = 0; i < n; ++i) {
13707 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
13708 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
13711 // Avoid underflow.
13712 APInt Val = Elt->getAPIntValue();
13716 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
13719 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
13722 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
13723 SelectionDAG &DAG) {
13724 SDValue Op0 = Op.getOperand(0);
13725 SDValue Op1 = Op.getOperand(1);
13726 SDValue CC = Op.getOperand(2);
13727 MVT VT = Op.getSimpleValueType();
13728 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13729 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
13734 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
13735 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
13738 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
13739 unsigned Opc = X86ISD::CMPP;
13740 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
13741 assert(VT.getVectorNumElements() <= 16);
13742 Opc = X86ISD::CMPM;
13744 // In the two special cases we can't handle, emit two comparisons.
13747 unsigned CombineOpc;
13748 if (SetCCOpcode == ISD::SETUEQ) {
13749 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
13751 assert(SetCCOpcode == ISD::SETONE);
13752 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
13755 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13756 DAG.getConstant(CC0, MVT::i8));
13757 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13758 DAG.getConstant(CC1, MVT::i8));
13759 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
13761 // Handle all other FP comparisons here.
13762 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13763 DAG.getConstant(SSECC, MVT::i8));
13766 // Break 256-bit integer vector compare into smaller ones.
13767 if (VT.is256BitVector() && !Subtarget->hasInt256())
13768 return Lower256IntVSETCC(Op, DAG);
13770 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
13771 EVT OpVT = Op1.getValueType();
13772 if (Subtarget->hasAVX512()) {
13773 if (Op1.getValueType().is512BitVector() ||
13774 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
13775 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
13776 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
13778 // In AVX-512 architecture setcc returns mask with i1 elements,
13779 // But there is no compare instruction for i8 and i16 elements in KNL.
13780 // We are not talking about 512-bit operands in this case, these
13781 // types are illegal.
13783 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
13784 OpVT.getVectorElementType().getSizeInBits() >= 8))
13785 return DAG.getNode(ISD::TRUNCATE, dl, VT,
13786 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
13789 // We are handling one of the integer comparisons here. Since SSE only has
13790 // GT and EQ comparisons for integer, swapping operands and multiple
13791 // operations may be required for some comparisons.
13793 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
13794 bool Subus = false;
13796 switch (SetCCOpcode) {
13797 default: llvm_unreachable("Unexpected SETCC condition");
13798 case ISD::SETNE: Invert = true;
13799 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
13800 case ISD::SETLT: Swap = true;
13801 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
13802 case ISD::SETGE: Swap = true;
13803 case ISD::SETLE: Opc = X86ISD::PCMPGT;
13804 Invert = true; break;
13805 case ISD::SETULT: Swap = true;
13806 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
13807 FlipSigns = true; break;
13808 case ISD::SETUGE: Swap = true;
13809 case ISD::SETULE: Opc = X86ISD::PCMPGT;
13810 FlipSigns = true; Invert = true; break;
13813 // Special case: Use min/max operations for SETULE/SETUGE
13814 MVT VET = VT.getVectorElementType();
13816 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
13817 || (Subtarget->hasSSE2() && (VET == MVT::i8));
13820 switch (SetCCOpcode) {
13822 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
13823 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
13826 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
13829 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
13830 if (!MinMax && hasSubus) {
13831 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
13833 // t = psubus Op0, Op1
13834 // pcmpeq t, <0..0>
13835 switch (SetCCOpcode) {
13837 case ISD::SETULT: {
13838 // If the comparison is against a constant we can turn this into a
13839 // setule. With psubus, setule does not require a swap. This is
13840 // beneficial because the constant in the register is no longer
13841 // destructed as the destination so it can be hoisted out of a loop.
13842 // Only do this pre-AVX since vpcmp* is no longer destructive.
13843 if (Subtarget->hasAVX())
13845 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
13846 if (ULEOp1.getNode()) {
13848 Subus = true; Invert = false; Swap = false;
13852 // Psubus is better than flip-sign because it requires no inversion.
13853 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
13854 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
13858 Opc = X86ISD::SUBUS;
13864 std::swap(Op0, Op1);
13866 // Check that the operation in question is available (most are plain SSE2,
13867 // but PCMPGTQ and PCMPEQQ have different requirements).
13868 if (VT == MVT::v2i64) {
13869 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
13870 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
13872 // First cast everything to the right type.
13873 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13874 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13876 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13877 // bits of the inputs before performing those operations. The lower
13878 // compare is always unsigned.
13881 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
13883 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
13884 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
13885 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
13886 Sign, Zero, Sign, Zero);
13888 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
13889 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
13891 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
13892 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
13893 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
13895 // Create masks for only the low parts/high parts of the 64 bit integers.
13896 static const int MaskHi[] = { 1, 1, 3, 3 };
13897 static const int MaskLo[] = { 0, 0, 2, 2 };
13898 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
13899 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
13900 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
13902 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
13903 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
13906 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13908 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13911 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
13912 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
13913 // pcmpeqd + pshufd + pand.
13914 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
13916 // First cast everything to the right type.
13917 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13918 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13921 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
13923 // Make sure the lower and upper halves are both all-ones.
13924 static const int Mask[] = { 1, 0, 3, 2 };
13925 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
13926 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
13929 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13931 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13935 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13936 // bits of the inputs before performing those operations.
13938 EVT EltVT = VT.getVectorElementType();
13939 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
13940 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
13941 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
13944 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
13946 // If the logical-not of the result is required, perform that now.
13948 Result = DAG.getNOT(dl, Result, VT);
13951 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
13954 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
13955 getZeroVector(VT, Subtarget, DAG, dl));
13960 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
13962 MVT VT = Op.getSimpleValueType();
13964 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
13966 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
13967 && "SetCC type must be 8-bit or 1-bit integer");
13968 SDValue Op0 = Op.getOperand(0);
13969 SDValue Op1 = Op.getOperand(1);
13971 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
13973 // Optimize to BT if possible.
13974 // Lower (X & (1 << N)) == 0 to BT(X, N).
13975 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
13976 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
13977 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
13978 Op1.getOpcode() == ISD::Constant &&
13979 cast<ConstantSDNode>(Op1)->isNullValue() &&
13980 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13981 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
13982 if (NewSetCC.getNode())
13986 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
13988 if (Op1.getOpcode() == ISD::Constant &&
13989 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
13990 cast<ConstantSDNode>(Op1)->isNullValue()) &&
13991 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13993 // If the input is a setcc, then reuse the input setcc or use a new one with
13994 // the inverted condition.
13995 if (Op0.getOpcode() == X86ISD::SETCC) {
13996 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
13997 bool Invert = (CC == ISD::SETNE) ^
13998 cast<ConstantSDNode>(Op1)->isNullValue();
14002 CCode = X86::GetOppositeBranchCondition(CCode);
14003 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14004 DAG.getConstant(CCode, MVT::i8),
14005 Op0.getOperand(1));
14007 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14011 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
14012 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
14013 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14015 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14016 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
14019 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14020 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
14021 if (X86CC == X86::COND_INVALID)
14024 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14025 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14026 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14027 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
14029 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14033 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14034 static bool isX86LogicalCmp(SDValue Op) {
14035 unsigned Opc = Op.getNode()->getOpcode();
14036 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14037 Opc == X86ISD::SAHF)
14039 if (Op.getResNo() == 1 &&
14040 (Opc == X86ISD::ADD ||
14041 Opc == X86ISD::SUB ||
14042 Opc == X86ISD::ADC ||
14043 Opc == X86ISD::SBB ||
14044 Opc == X86ISD::SMUL ||
14045 Opc == X86ISD::UMUL ||
14046 Opc == X86ISD::INC ||
14047 Opc == X86ISD::DEC ||
14048 Opc == X86ISD::OR ||
14049 Opc == X86ISD::XOR ||
14050 Opc == X86ISD::AND))
14053 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14059 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14060 if (V.getOpcode() != ISD::TRUNCATE)
14063 SDValue VOp0 = V.getOperand(0);
14064 unsigned InBits = VOp0.getValueSizeInBits();
14065 unsigned Bits = V.getValueSizeInBits();
14066 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14069 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14070 bool addTest = true;
14071 SDValue Cond = Op.getOperand(0);
14072 SDValue Op1 = Op.getOperand(1);
14073 SDValue Op2 = Op.getOperand(2);
14075 EVT VT = Op1.getValueType();
14078 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14079 // are available. Otherwise fp cmovs get lowered into a less efficient branch
14080 // sequence later on.
14081 if (Cond.getOpcode() == ISD::SETCC &&
14082 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14083 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14084 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
14085 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14086 int SSECC = translateX86FSETCC(
14087 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14090 if (Subtarget->hasAVX512()) {
14091 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14092 DAG.getConstant(SSECC, MVT::i8));
14093 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14095 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14096 DAG.getConstant(SSECC, MVT::i8));
14097 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14098 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14099 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14103 if (Cond.getOpcode() == ISD::SETCC) {
14104 SDValue NewCond = LowerSETCC(Cond, DAG);
14105 if (NewCond.getNode())
14109 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14110 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14111 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14112 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14113 if (Cond.getOpcode() == X86ISD::SETCC &&
14114 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14115 isZero(Cond.getOperand(1).getOperand(1))) {
14116 SDValue Cmp = Cond.getOperand(1);
14118 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14120 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14121 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14122 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14124 SDValue CmpOp0 = Cmp.getOperand(0);
14125 // Apply further optimizations for special cases
14126 // (select (x != 0), -1, 0) -> neg & sbb
14127 // (select (x == 0), 0, -1) -> neg & sbb
14128 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14129 if (YC->isNullValue() &&
14130 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14131 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14132 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14133 DAG.getConstant(0, CmpOp0.getValueType()),
14135 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14136 DAG.getConstant(X86::COND_B, MVT::i8),
14137 SDValue(Neg.getNode(), 1));
14141 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14142 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
14143 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14145 SDValue Res = // Res = 0 or -1.
14146 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14147 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
14149 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14150 Res = DAG.getNOT(DL, Res, Res.getValueType());
14152 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14153 if (!N2C || !N2C->isNullValue())
14154 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14159 // Look past (and (setcc_carry (cmp ...)), 1).
14160 if (Cond.getOpcode() == ISD::AND &&
14161 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14162 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14163 if (C && C->getAPIntValue() == 1)
14164 Cond = Cond.getOperand(0);
14167 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14168 // setting operand in place of the X86ISD::SETCC.
14169 unsigned CondOpcode = Cond.getOpcode();
14170 if (CondOpcode == X86ISD::SETCC ||
14171 CondOpcode == X86ISD::SETCC_CARRY) {
14172 CC = Cond.getOperand(0);
14174 SDValue Cmp = Cond.getOperand(1);
14175 unsigned Opc = Cmp.getOpcode();
14176 MVT VT = Op.getSimpleValueType();
14178 bool IllegalFPCMov = false;
14179 if (VT.isFloatingPoint() && !VT.isVector() &&
14180 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14181 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14183 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14184 Opc == X86ISD::BT) { // FIXME
14188 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14189 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14190 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14191 Cond.getOperand(0).getValueType() != MVT::i8)) {
14192 SDValue LHS = Cond.getOperand(0);
14193 SDValue RHS = Cond.getOperand(1);
14194 unsigned X86Opcode;
14197 switch (CondOpcode) {
14198 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14199 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14200 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14201 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14202 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14203 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14204 default: llvm_unreachable("unexpected overflowing operator");
14206 if (CondOpcode == ISD::UMULO)
14207 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14210 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14212 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14214 if (CondOpcode == ISD::UMULO)
14215 Cond = X86Op.getValue(2);
14217 Cond = X86Op.getValue(1);
14219 CC = DAG.getConstant(X86Cond, MVT::i8);
14224 // Look pass the truncate if the high bits are known zero.
14225 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14226 Cond = Cond.getOperand(0);
14228 // We know the result of AND is compared against zero. Try to match
14230 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14231 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14232 if (NewSetCC.getNode()) {
14233 CC = NewSetCC.getOperand(0);
14234 Cond = NewSetCC.getOperand(1);
14241 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14242 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14245 // a < b ? -1 : 0 -> RES = ~setcc_carry
14246 // a < b ? 0 : -1 -> RES = setcc_carry
14247 // a >= b ? -1 : 0 -> RES = setcc_carry
14248 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14249 if (Cond.getOpcode() == X86ISD::SUB) {
14250 Cond = ConvertCmpIfNecessary(Cond, DAG);
14251 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14253 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14254 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14255 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14256 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14257 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14258 return DAG.getNOT(DL, Res, Res.getValueType());
14263 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14264 // widen the cmov and push the truncate through. This avoids introducing a new
14265 // branch during isel and doesn't add any extensions.
14266 if (Op.getValueType() == MVT::i8 &&
14267 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14268 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14269 if (T1.getValueType() == T2.getValueType() &&
14270 // Blacklist CopyFromReg to avoid partial register stalls.
14271 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14272 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14273 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14274 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14278 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14279 // condition is true.
14280 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14281 SDValue Ops[] = { Op2, Op1, CC, Cond };
14282 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14285 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
14286 MVT VT = Op->getSimpleValueType(0);
14287 SDValue In = Op->getOperand(0);
14288 MVT InVT = In.getSimpleValueType();
14291 unsigned int NumElts = VT.getVectorNumElements();
14292 if (NumElts != 8 && NumElts != 16)
14295 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
14296 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14298 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14299 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14301 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
14302 Constant *C = ConstantInt::get(*DAG.getContext(),
14303 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
14305 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
14306 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
14307 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
14308 MachinePointerInfo::getConstantPool(),
14309 false, false, false, Alignment);
14310 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
14311 if (VT.is512BitVector())
14313 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
14316 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
14317 SelectionDAG &DAG) {
14318 MVT VT = Op->getSimpleValueType(0);
14319 SDValue In = Op->getOperand(0);
14320 MVT InVT = In.getSimpleValueType();
14323 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
14324 return LowerSIGN_EXTEND_AVX512(Op, DAG);
14326 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
14327 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
14328 (VT != MVT::v16i16 || InVT != MVT::v16i8))
14331 if (Subtarget->hasInt256())
14332 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14334 // Optimize vectors in AVX mode
14335 // Sign extend v8i16 to v8i32 and
14338 // Divide input vector into two parts
14339 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
14340 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
14341 // concat the vectors to original VT
14343 unsigned NumElems = InVT.getVectorNumElements();
14344 SDValue Undef = DAG.getUNDEF(InVT);
14346 SmallVector<int,8> ShufMask1(NumElems, -1);
14347 for (unsigned i = 0; i != NumElems/2; ++i)
14350 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
14352 SmallVector<int,8> ShufMask2(NumElems, -1);
14353 for (unsigned i = 0; i != NumElems/2; ++i)
14354 ShufMask2[i] = i + NumElems/2;
14356 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
14358 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
14359 VT.getVectorNumElements()/2);
14361 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
14362 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
14364 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
14367 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
14368 // may emit an illegal shuffle but the expansion is still better than scalar
14369 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
14370 // we'll emit a shuffle and a arithmetic shift.
14371 // TODO: It is possible to support ZExt by zeroing the undef values during
14372 // the shuffle phase or after the shuffle.
14373 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
14374 SelectionDAG &DAG) {
14375 MVT RegVT = Op.getSimpleValueType();
14376 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
14377 assert(RegVT.isInteger() &&
14378 "We only custom lower integer vector sext loads.");
14380 // Nothing useful we can do without SSE2 shuffles.
14381 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
14383 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
14385 EVT MemVT = Ld->getMemoryVT();
14386 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14387 unsigned RegSz = RegVT.getSizeInBits();
14389 ISD::LoadExtType Ext = Ld->getExtensionType();
14391 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
14392 && "Only anyext and sext are currently implemented.");
14393 assert(MemVT != RegVT && "Cannot extend to the same type");
14394 assert(MemVT.isVector() && "Must load a vector from memory");
14396 unsigned NumElems = RegVT.getVectorNumElements();
14397 unsigned MemSz = MemVT.getSizeInBits();
14398 assert(RegSz > MemSz && "Register size must be greater than the mem size");
14400 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
14401 // The only way in which we have a legal 256-bit vector result but not the
14402 // integer 256-bit operations needed to directly lower a sextload is if we
14403 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
14404 // a 128-bit vector and a normal sign_extend to 256-bits that should get
14405 // correctly legalized. We do this late to allow the canonical form of
14406 // sextload to persist throughout the rest of the DAG combiner -- it wants
14407 // to fold together any extensions it can, and so will fuse a sign_extend
14408 // of an sextload into a sextload targeting a wider value.
14410 if (MemSz == 128) {
14411 // Just switch this to a normal load.
14412 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
14413 "it must be a legal 128-bit vector "
14415 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
14416 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
14417 Ld->isInvariant(), Ld->getAlignment());
14419 assert(MemSz < 128 &&
14420 "Can't extend a type wider than 128 bits to a 256 bit vector!");
14421 // Do an sext load to a 128-bit vector type. We want to use the same
14422 // number of elements, but elements half as wide. This will end up being
14423 // recursively lowered by this routine, but will succeed as we definitely
14424 // have all the necessary features if we're using AVX1.
14426 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
14427 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
14429 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
14430 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
14431 Ld->isNonTemporal(), Ld->isInvariant(),
14432 Ld->getAlignment());
14435 // Replace chain users with the new chain.
14436 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
14437 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
14439 // Finally, do a normal sign-extend to the desired register.
14440 return DAG.getSExtOrTrunc(Load, dl, RegVT);
14443 // All sizes must be a power of two.
14444 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
14445 "Non-power-of-two elements are not custom lowered!");
14447 // Attempt to load the original value using scalar loads.
14448 // Find the largest scalar type that divides the total loaded size.
14449 MVT SclrLoadTy = MVT::i8;
14450 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
14451 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
14452 MVT Tp = (MVT::SimpleValueType)tp;
14453 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
14458 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
14459 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
14461 SclrLoadTy = MVT::f64;
14463 // Calculate the number of scalar loads that we need to perform
14464 // in order to load our vector from memory.
14465 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
14467 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
14468 "Can only lower sext loads with a single scalar load!");
14470 unsigned loadRegZize = RegSz;
14471 if (Ext == ISD::SEXTLOAD && RegSz == 256)
14474 // Represent our vector as a sequence of elements which are the
14475 // largest scalar that we can load.
14476 EVT LoadUnitVecVT = EVT::getVectorVT(
14477 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
14479 // Represent the data using the same element type that is stored in
14480 // memory. In practice, we ''widen'' MemVT.
14482 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
14483 loadRegZize / MemVT.getScalarType().getSizeInBits());
14485 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
14486 "Invalid vector type");
14488 // We can't shuffle using an illegal type.
14489 assert(TLI.isTypeLegal(WideVecVT) &&
14490 "We only lower types that form legal widened vector types");
14492 SmallVector<SDValue, 8> Chains;
14493 SDValue Ptr = Ld->getBasePtr();
14494 SDValue Increment =
14495 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
14496 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
14498 for (unsigned i = 0; i < NumLoads; ++i) {
14499 // Perform a single load.
14500 SDValue ScalarLoad =
14501 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
14502 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
14503 Ld->getAlignment());
14504 Chains.push_back(ScalarLoad.getValue(1));
14505 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
14506 // another round of DAGCombining.
14508 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
14510 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
14511 ScalarLoad, DAG.getIntPtrConstant(i));
14513 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
14516 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
14518 // Bitcast the loaded value to a vector of the original element type, in
14519 // the size of the target vector type.
14520 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
14521 unsigned SizeRatio = RegSz / MemSz;
14523 if (Ext == ISD::SEXTLOAD) {
14524 // If we have SSE4.1, we can directly emit a VSEXT node.
14525 if (Subtarget->hasSSE41()) {
14526 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
14527 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14531 // Otherwise we'll shuffle the small elements in the high bits of the
14532 // larger type and perform an arithmetic shift. If the shift is not legal
14533 // it's better to scalarize.
14534 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
14535 "We can't implement a sext load without an arithmetic right shift!");
14537 // Redistribute the loaded elements into the different locations.
14538 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14539 for (unsigned i = 0; i != NumElems; ++i)
14540 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
14542 SDValue Shuff = DAG.getVectorShuffle(
14543 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14545 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14547 // Build the arithmetic shift.
14548 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
14549 MemVT.getVectorElementType().getSizeInBits();
14551 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
14553 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14557 // Redistribute the loaded elements into the different locations.
14558 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14559 for (unsigned i = 0; i != NumElems; ++i)
14560 ShuffleVec[i * SizeRatio] = i;
14562 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
14563 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14565 // Bitcast to the requested type.
14566 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14567 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14571 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
14572 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
14573 // from the AND / OR.
14574 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
14575 Opc = Op.getOpcode();
14576 if (Opc != ISD::OR && Opc != ISD::AND)
14578 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14579 Op.getOperand(0).hasOneUse() &&
14580 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
14581 Op.getOperand(1).hasOneUse());
14584 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
14585 // 1 and that the SETCC node has a single use.
14586 static bool isXor1OfSetCC(SDValue Op) {
14587 if (Op.getOpcode() != ISD::XOR)
14589 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
14590 if (N1C && N1C->getAPIntValue() == 1) {
14591 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14592 Op.getOperand(0).hasOneUse();
14597 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
14598 bool addTest = true;
14599 SDValue Chain = Op.getOperand(0);
14600 SDValue Cond = Op.getOperand(1);
14601 SDValue Dest = Op.getOperand(2);
14604 bool Inverted = false;
14606 if (Cond.getOpcode() == ISD::SETCC) {
14607 // Check for setcc([su]{add,sub,mul}o == 0).
14608 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
14609 isa<ConstantSDNode>(Cond.getOperand(1)) &&
14610 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
14611 Cond.getOperand(0).getResNo() == 1 &&
14612 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
14613 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
14614 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
14615 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
14616 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
14617 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
14619 Cond = Cond.getOperand(0);
14621 SDValue NewCond = LowerSETCC(Cond, DAG);
14622 if (NewCond.getNode())
14627 // FIXME: LowerXALUO doesn't handle these!!
14628 else if (Cond.getOpcode() == X86ISD::ADD ||
14629 Cond.getOpcode() == X86ISD::SUB ||
14630 Cond.getOpcode() == X86ISD::SMUL ||
14631 Cond.getOpcode() == X86ISD::UMUL)
14632 Cond = LowerXALUO(Cond, DAG);
14635 // Look pass (and (setcc_carry (cmp ...)), 1).
14636 if (Cond.getOpcode() == ISD::AND &&
14637 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14638 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14639 if (C && C->getAPIntValue() == 1)
14640 Cond = Cond.getOperand(0);
14643 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14644 // setting operand in place of the X86ISD::SETCC.
14645 unsigned CondOpcode = Cond.getOpcode();
14646 if (CondOpcode == X86ISD::SETCC ||
14647 CondOpcode == X86ISD::SETCC_CARRY) {
14648 CC = Cond.getOperand(0);
14650 SDValue Cmp = Cond.getOperand(1);
14651 unsigned Opc = Cmp.getOpcode();
14652 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
14653 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
14657 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
14661 // These can only come from an arithmetic instruction with overflow,
14662 // e.g. SADDO, UADDO.
14663 Cond = Cond.getNode()->getOperand(1);
14669 CondOpcode = Cond.getOpcode();
14670 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14671 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14672 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14673 Cond.getOperand(0).getValueType() != MVT::i8)) {
14674 SDValue LHS = Cond.getOperand(0);
14675 SDValue RHS = Cond.getOperand(1);
14676 unsigned X86Opcode;
14679 // Keep this in sync with LowerXALUO, otherwise we might create redundant
14680 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
14682 switch (CondOpcode) {
14683 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14685 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14687 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
14690 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14691 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14693 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14695 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
14698 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14699 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14700 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14701 default: llvm_unreachable("unexpected overflowing operator");
14704 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
14705 if (CondOpcode == ISD::UMULO)
14706 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14709 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14711 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
14713 if (CondOpcode == ISD::UMULO)
14714 Cond = X86Op.getValue(2);
14716 Cond = X86Op.getValue(1);
14718 CC = DAG.getConstant(X86Cond, MVT::i8);
14722 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
14723 SDValue Cmp = Cond.getOperand(0).getOperand(1);
14724 if (CondOpc == ISD::OR) {
14725 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
14726 // two branches instead of an explicit OR instruction with a
14728 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14729 isX86LogicalCmp(Cmp)) {
14730 CC = Cond.getOperand(0).getOperand(0);
14731 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14732 Chain, Dest, CC, Cmp);
14733 CC = Cond.getOperand(1).getOperand(0);
14737 } else { // ISD::AND
14738 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
14739 // two branches instead of an explicit AND instruction with a
14740 // separate test. However, we only do this if this block doesn't
14741 // have a fall-through edge, because this requires an explicit
14742 // jmp when the condition is false.
14743 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14744 isX86LogicalCmp(Cmp) &&
14745 Op.getNode()->hasOneUse()) {
14746 X86::CondCode CCode =
14747 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14748 CCode = X86::GetOppositeBranchCondition(CCode);
14749 CC = DAG.getConstant(CCode, MVT::i8);
14750 SDNode *User = *Op.getNode()->use_begin();
14751 // Look for an unconditional branch following this conditional branch.
14752 // We need this because we need to reverse the successors in order
14753 // to implement FCMP_OEQ.
14754 if (User->getOpcode() == ISD::BR) {
14755 SDValue FalseBB = User->getOperand(1);
14757 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14758 assert(NewBR == User);
14762 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14763 Chain, Dest, CC, Cmp);
14764 X86::CondCode CCode =
14765 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
14766 CCode = X86::GetOppositeBranchCondition(CCode);
14767 CC = DAG.getConstant(CCode, MVT::i8);
14773 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
14774 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
14775 // It should be transformed during dag combiner except when the condition
14776 // is set by a arithmetics with overflow node.
14777 X86::CondCode CCode =
14778 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14779 CCode = X86::GetOppositeBranchCondition(CCode);
14780 CC = DAG.getConstant(CCode, MVT::i8);
14781 Cond = Cond.getOperand(0).getOperand(1);
14783 } else if (Cond.getOpcode() == ISD::SETCC &&
14784 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
14785 // For FCMP_OEQ, we can emit
14786 // two branches instead of an explicit AND instruction with a
14787 // separate test. However, we only do this if this block doesn't
14788 // have a fall-through edge, because this requires an explicit
14789 // jmp when the condition is false.
14790 if (Op.getNode()->hasOneUse()) {
14791 SDNode *User = *Op.getNode()->use_begin();
14792 // Look for an unconditional branch following this conditional branch.
14793 // We need this because we need to reverse the successors in order
14794 // to implement FCMP_OEQ.
14795 if (User->getOpcode() == ISD::BR) {
14796 SDValue FalseBB = User->getOperand(1);
14798 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14799 assert(NewBR == User);
14803 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14804 Cond.getOperand(0), Cond.getOperand(1));
14805 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14806 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14807 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14808 Chain, Dest, CC, Cmp);
14809 CC = DAG.getConstant(X86::COND_P, MVT::i8);
14814 } else if (Cond.getOpcode() == ISD::SETCC &&
14815 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
14816 // For FCMP_UNE, we can emit
14817 // two branches instead of an explicit AND instruction with a
14818 // separate test. However, we only do this if this block doesn't
14819 // have a fall-through edge, because this requires an explicit
14820 // jmp when the condition is false.
14821 if (Op.getNode()->hasOneUse()) {
14822 SDNode *User = *Op.getNode()->use_begin();
14823 // Look for an unconditional branch following this conditional branch.
14824 // We need this because we need to reverse the successors in order
14825 // to implement FCMP_UNE.
14826 if (User->getOpcode() == ISD::BR) {
14827 SDValue FalseBB = User->getOperand(1);
14829 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14830 assert(NewBR == User);
14833 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14834 Cond.getOperand(0), Cond.getOperand(1));
14835 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14836 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14837 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14838 Chain, Dest, CC, Cmp);
14839 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
14849 // Look pass the truncate if the high bits are known zero.
14850 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14851 Cond = Cond.getOperand(0);
14853 // We know the result of AND is compared against zero. Try to match
14855 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14856 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
14857 if (NewSetCC.getNode()) {
14858 CC = NewSetCC.getOperand(0);
14859 Cond = NewSetCC.getOperand(1);
14866 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
14867 CC = DAG.getConstant(X86Cond, MVT::i8);
14868 Cond = EmitTest(Cond, X86Cond, dl, DAG);
14870 Cond = ConvertCmpIfNecessary(Cond, DAG);
14871 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14872 Chain, Dest, CC, Cond);
14875 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
14876 // Calls to _alloca are needed to probe the stack when allocating more than 4k
14877 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
14878 // that the guard pages used by the OS virtual memory manager are allocated in
14879 // correct sequence.
14881 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
14882 SelectionDAG &DAG) const {
14883 MachineFunction &MF = DAG.getMachineFunction();
14884 bool SplitStack = MF.shouldSplitStack();
14885 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
14890 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14891 SDNode* Node = Op.getNode();
14893 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
14894 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
14895 " not tell us which reg is the stack pointer!");
14896 EVT VT = Node->getValueType(0);
14897 SDValue Tmp1 = SDValue(Node, 0);
14898 SDValue Tmp2 = SDValue(Node, 1);
14899 SDValue Tmp3 = Node->getOperand(2);
14900 SDValue Chain = Tmp1.getOperand(0);
14902 // Chain the dynamic stack allocation so that it doesn't modify the stack
14903 // pointer when other instructions are using the stack.
14904 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
14907 SDValue Size = Tmp2.getOperand(1);
14908 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
14909 Chain = SP.getValue(1);
14910 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
14911 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
14912 unsigned StackAlign = TFI.getStackAlignment();
14913 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
14914 if (Align > StackAlign)
14915 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
14916 DAG.getConstant(-(uint64_t)Align, VT));
14917 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
14919 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
14920 DAG.getIntPtrConstant(0, true), SDValue(),
14923 SDValue Ops[2] = { Tmp1, Tmp2 };
14924 return DAG.getMergeValues(Ops, dl);
14928 SDValue Chain = Op.getOperand(0);
14929 SDValue Size = Op.getOperand(1);
14930 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
14931 EVT VT = Op.getNode()->getValueType(0);
14933 bool Is64Bit = Subtarget->is64Bit();
14934 EVT SPTy = Is64Bit ? MVT::i64 : MVT::i32;
14937 MachineRegisterInfo &MRI = MF.getRegInfo();
14940 // The 64 bit implementation of segmented stacks needs to clobber both r10
14941 // r11. This makes it impossible to use it along with nested parameters.
14942 const Function *F = MF.getFunction();
14944 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
14946 if (I->hasNestAttr())
14947 report_fatal_error("Cannot use segmented stacks with functions that "
14948 "have nested arguments.");
14951 const TargetRegisterClass *AddrRegClass =
14952 getRegClassFor(Subtarget->is64Bit() ? MVT::i64:MVT::i32);
14953 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
14954 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
14955 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
14956 DAG.getRegister(Vreg, SPTy));
14957 SDValue Ops1[2] = { Value, Chain };
14958 return DAG.getMergeValues(Ops1, dl);
14961 unsigned Reg = (Subtarget->is64Bit() ? X86::RAX : X86::EAX);
14963 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
14964 Flag = Chain.getValue(1);
14965 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
14967 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
14969 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
14970 DAG.getSubtarget().getRegisterInfo());
14971 unsigned SPReg = RegInfo->getStackRegister();
14972 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
14973 Chain = SP.getValue(1);
14976 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
14977 DAG.getConstant(-(uint64_t)Align, VT));
14978 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
14981 SDValue Ops1[2] = { SP, Chain };
14982 return DAG.getMergeValues(Ops1, dl);
14986 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
14987 MachineFunction &MF = DAG.getMachineFunction();
14988 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
14990 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14993 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
14994 // vastart just stores the address of the VarArgsFrameIndex slot into the
14995 // memory location argument.
14996 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14998 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
14999 MachinePointerInfo(SV), false, false, 0);
15003 // gp_offset (0 - 6 * 8)
15004 // fp_offset (48 - 48 + 8 * 16)
15005 // overflow_arg_area (point to parameters coming in memory).
15007 SmallVector<SDValue, 8> MemOps;
15008 SDValue FIN = Op.getOperand(1);
15010 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15011 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15013 FIN, MachinePointerInfo(SV), false, false, 0);
15014 MemOps.push_back(Store);
15017 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15018 FIN, DAG.getIntPtrConstant(4));
15019 Store = DAG.getStore(Op.getOperand(0), DL,
15020 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
15022 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15023 MemOps.push_back(Store);
15025 // Store ptr to overflow_arg_area
15026 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15027 FIN, DAG.getIntPtrConstant(4));
15028 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15030 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15031 MachinePointerInfo(SV, 8),
15033 MemOps.push_back(Store);
15035 // Store ptr to reg_save_area.
15036 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15037 FIN, DAG.getIntPtrConstant(8));
15038 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
15040 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
15041 MachinePointerInfo(SV, 16), false, false, 0);
15042 MemOps.push_back(Store);
15043 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15046 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15047 assert(Subtarget->is64Bit() &&
15048 "LowerVAARG only handles 64-bit va_arg!");
15049 assert((Subtarget->isTargetLinux() ||
15050 Subtarget->isTargetDarwin()) &&
15051 "Unhandled target in LowerVAARG");
15052 assert(Op.getNode()->getNumOperands() == 4);
15053 SDValue Chain = Op.getOperand(0);
15054 SDValue SrcPtr = Op.getOperand(1);
15055 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15056 unsigned Align = Op.getConstantOperandVal(3);
15059 EVT ArgVT = Op.getNode()->getValueType(0);
15060 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15061 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
15064 // Decide which area this value should be read from.
15065 // TODO: Implement the AMD64 ABI in its entirety. This simple
15066 // selection mechanism works only for the basic types.
15067 if (ArgVT == MVT::f80) {
15068 llvm_unreachable("va_arg for f80 not yet implemented");
15069 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15070 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15071 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15072 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15074 llvm_unreachable("Unhandled argument type in LowerVAARG");
15077 if (ArgMode == 2) {
15078 // Sanity Check: Make sure using fp_offset makes sense.
15079 assert(!DAG.getTarget().Options.UseSoftFloat &&
15080 !(DAG.getMachineFunction()
15081 .getFunction()->getAttributes()
15082 .hasAttribute(AttributeSet::FunctionIndex,
15083 Attribute::NoImplicitFloat)) &&
15084 Subtarget->hasSSE1());
15087 // Insert VAARG_64 node into the DAG
15088 // VAARG_64 returns two values: Variable Argument Address, Chain
15089 SmallVector<SDValue, 11> InstOps;
15090 InstOps.push_back(Chain);
15091 InstOps.push_back(SrcPtr);
15092 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
15093 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
15094 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
15095 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
15096 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15097 VTs, InstOps, MVT::i64,
15098 MachinePointerInfo(SV),
15100 /*Volatile=*/false,
15102 /*WriteMem=*/true);
15103 Chain = VAARG.getValue(1);
15105 // Load the next argument and return it
15106 return DAG.getLoad(ArgVT, dl,
15109 MachinePointerInfo(),
15110 false, false, false, 0);
15113 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15114 SelectionDAG &DAG) {
15115 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
15116 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15117 SDValue Chain = Op.getOperand(0);
15118 SDValue DstPtr = Op.getOperand(1);
15119 SDValue SrcPtr = Op.getOperand(2);
15120 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15121 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15124 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15125 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
15127 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15130 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15131 // amount is a constant. Takes immediate version of shift as input.
15132 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15133 SDValue SrcOp, uint64_t ShiftAmt,
15134 SelectionDAG &DAG) {
15135 MVT ElementType = VT.getVectorElementType();
15137 // Fold this packed shift into its first operand if ShiftAmt is 0.
15141 // Check for ShiftAmt >= element width
15142 if (ShiftAmt >= ElementType.getSizeInBits()) {
15143 if (Opc == X86ISD::VSRAI)
15144 ShiftAmt = ElementType.getSizeInBits() - 1;
15146 return DAG.getConstant(0, VT);
15149 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15150 && "Unknown target vector shift-by-constant node");
15152 // Fold this packed vector shift into a build vector if SrcOp is a
15153 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15154 if (VT == SrcOp.getSimpleValueType() &&
15155 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15156 SmallVector<SDValue, 8> Elts;
15157 unsigned NumElts = SrcOp->getNumOperands();
15158 ConstantSDNode *ND;
15161 default: llvm_unreachable(nullptr);
15162 case X86ISD::VSHLI:
15163 for (unsigned i=0; i!=NumElts; ++i) {
15164 SDValue CurrentOp = SrcOp->getOperand(i);
15165 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15166 Elts.push_back(CurrentOp);
15169 ND = cast<ConstantSDNode>(CurrentOp);
15170 const APInt &C = ND->getAPIntValue();
15171 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15174 case X86ISD::VSRLI:
15175 for (unsigned i=0; i!=NumElts; ++i) {
15176 SDValue CurrentOp = SrcOp->getOperand(i);
15177 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15178 Elts.push_back(CurrentOp);
15181 ND = cast<ConstantSDNode>(CurrentOp);
15182 const APInt &C = ND->getAPIntValue();
15183 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15186 case X86ISD::VSRAI:
15187 for (unsigned i=0; i!=NumElts; ++i) {
15188 SDValue CurrentOp = SrcOp->getOperand(i);
15189 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15190 Elts.push_back(CurrentOp);
15193 ND = cast<ConstantSDNode>(CurrentOp);
15194 const APInt &C = ND->getAPIntValue();
15195 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15200 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15203 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15206 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15207 // may or may not be a constant. Takes immediate version of shift as input.
15208 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15209 SDValue SrcOp, SDValue ShAmt,
15210 SelectionDAG &DAG) {
15211 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15213 // Catch shift-by-constant.
15214 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15215 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15216 CShAmt->getZExtValue(), DAG);
15218 // Change opcode to non-immediate version
15220 default: llvm_unreachable("Unknown target vector shift node");
15221 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15222 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15223 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15226 // Need to build a vector containing shift amount
15227 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15230 ShOps[1] = DAG.getConstant(0, MVT::i32);
15231 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15232 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15234 // The return type has to be a 128-bit type with the same element
15235 // type as the input type.
15236 MVT EltVT = VT.getVectorElementType();
15237 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15239 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15240 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15243 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
15244 /// necessary casting for \p Mask when lowering masking intrinsics.
15245 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15246 SDValue PreservedSrc, SelectionDAG &DAG) {
15247 EVT VT = Op.getValueType();
15248 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15249 MVT::i1, VT.getVectorNumElements());
15252 assert(MaskVT.isSimple() && "invalid mask type");
15253 return DAG.getNode(ISD::VSELECT, dl, VT,
15254 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
15258 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
15260 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15261 case Intrinsic::x86_fma_vfmadd_ps:
15262 case Intrinsic::x86_fma_vfmadd_pd:
15263 case Intrinsic::x86_fma_vfmadd_ps_256:
15264 case Intrinsic::x86_fma_vfmadd_pd_256:
15265 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15266 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15267 return X86ISD::FMADD;
15268 case Intrinsic::x86_fma_vfmsub_ps:
15269 case Intrinsic::x86_fma_vfmsub_pd:
15270 case Intrinsic::x86_fma_vfmsub_ps_256:
15271 case Intrinsic::x86_fma_vfmsub_pd_256:
15272 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15273 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15274 return X86ISD::FMSUB;
15275 case Intrinsic::x86_fma_vfnmadd_ps:
15276 case Intrinsic::x86_fma_vfnmadd_pd:
15277 case Intrinsic::x86_fma_vfnmadd_ps_256:
15278 case Intrinsic::x86_fma_vfnmadd_pd_256:
15279 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15280 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15281 return X86ISD::FNMADD;
15282 case Intrinsic::x86_fma_vfnmsub_ps:
15283 case Intrinsic::x86_fma_vfnmsub_pd:
15284 case Intrinsic::x86_fma_vfnmsub_ps_256:
15285 case Intrinsic::x86_fma_vfnmsub_pd_256:
15286 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15287 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15288 return X86ISD::FNMSUB;
15289 case Intrinsic::x86_fma_vfmaddsub_ps:
15290 case Intrinsic::x86_fma_vfmaddsub_pd:
15291 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15292 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15293 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15294 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15295 return X86ISD::FMADDSUB;
15296 case Intrinsic::x86_fma_vfmsubadd_ps:
15297 case Intrinsic::x86_fma_vfmsubadd_pd:
15298 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15299 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15300 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15301 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
15302 return X86ISD::FMSUBADD;
15306 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
15308 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15310 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
15312 switch(IntrData->Type) {
15313 case INTR_TYPE_1OP:
15314 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
15315 case INTR_TYPE_2OP:
15316 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15318 case INTR_TYPE_3OP:
15319 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15320 Op.getOperand(2), Op.getOperand(3));
15321 case COMI: { // Comparison intrinsics
15322 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
15323 SDValue LHS = Op.getOperand(1);
15324 SDValue RHS = Op.getOperand(2);
15325 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
15326 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
15327 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
15328 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15329 DAG.getConstant(X86CC, MVT::i8), Cond);
15330 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15333 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
15334 Op.getOperand(1), Op.getOperand(2), DAG);
15341 default: return SDValue(); // Don't custom lower most intrinsics.
15343 // Arithmetic intrinsics.
15344 case Intrinsic::x86_sse2_pmulu_dq:
15345 case Intrinsic::x86_avx2_pmulu_dq:
15346 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
15347 Op.getOperand(1), Op.getOperand(2));
15349 case Intrinsic::x86_sse41_pmuldq:
15350 case Intrinsic::x86_avx2_pmul_dq:
15351 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
15352 Op.getOperand(1), Op.getOperand(2));
15354 case Intrinsic::x86_sse2_pmulhu_w:
15355 case Intrinsic::x86_avx2_pmulhu_w:
15356 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
15357 Op.getOperand(1), Op.getOperand(2));
15359 case Intrinsic::x86_sse2_pmulh_w:
15360 case Intrinsic::x86_avx2_pmulh_w:
15361 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
15362 Op.getOperand(1), Op.getOperand(2));
15364 // SSE/SSE2/AVX floating point max/min intrinsics.
15365 case Intrinsic::x86_sse_max_ps:
15366 case Intrinsic::x86_sse2_max_pd:
15367 case Intrinsic::x86_avx_max_ps_256:
15368 case Intrinsic::x86_avx_max_pd_256:
15369 case Intrinsic::x86_sse_min_ps:
15370 case Intrinsic::x86_sse2_min_pd:
15371 case Intrinsic::x86_avx_min_ps_256:
15372 case Intrinsic::x86_avx_min_pd_256: {
15375 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15376 case Intrinsic::x86_sse_max_ps:
15377 case Intrinsic::x86_sse2_max_pd:
15378 case Intrinsic::x86_avx_max_ps_256:
15379 case Intrinsic::x86_avx_max_pd_256:
15380 Opcode = X86ISD::FMAX;
15382 case Intrinsic::x86_sse_min_ps:
15383 case Intrinsic::x86_sse2_min_pd:
15384 case Intrinsic::x86_avx_min_ps_256:
15385 case Intrinsic::x86_avx_min_pd_256:
15386 Opcode = X86ISD::FMIN;
15389 return DAG.getNode(Opcode, dl, Op.getValueType(),
15390 Op.getOperand(1), Op.getOperand(2));
15393 // AVX2 variable shift intrinsics
15394 case Intrinsic::x86_avx2_psllv_d:
15395 case Intrinsic::x86_avx2_psllv_q:
15396 case Intrinsic::x86_avx2_psllv_d_256:
15397 case Intrinsic::x86_avx2_psllv_q_256:
15398 case Intrinsic::x86_avx2_psrlv_d:
15399 case Intrinsic::x86_avx2_psrlv_q:
15400 case Intrinsic::x86_avx2_psrlv_d_256:
15401 case Intrinsic::x86_avx2_psrlv_q_256:
15402 case Intrinsic::x86_avx2_psrav_d:
15403 case Intrinsic::x86_avx2_psrav_d_256: {
15406 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15407 case Intrinsic::x86_avx2_psllv_d:
15408 case Intrinsic::x86_avx2_psllv_q:
15409 case Intrinsic::x86_avx2_psllv_d_256:
15410 case Intrinsic::x86_avx2_psllv_q_256:
15413 case Intrinsic::x86_avx2_psrlv_d:
15414 case Intrinsic::x86_avx2_psrlv_q:
15415 case Intrinsic::x86_avx2_psrlv_d_256:
15416 case Intrinsic::x86_avx2_psrlv_q_256:
15419 case Intrinsic::x86_avx2_psrav_d:
15420 case Intrinsic::x86_avx2_psrav_d_256:
15424 return DAG.getNode(Opcode, dl, Op.getValueType(),
15425 Op.getOperand(1), Op.getOperand(2));
15428 case Intrinsic::x86_sse2_packssdw_128:
15429 case Intrinsic::x86_sse2_packsswb_128:
15430 case Intrinsic::x86_avx2_packssdw:
15431 case Intrinsic::x86_avx2_packsswb:
15432 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
15433 Op.getOperand(1), Op.getOperand(2));
15435 case Intrinsic::x86_sse2_packuswb_128:
15436 case Intrinsic::x86_sse41_packusdw:
15437 case Intrinsic::x86_avx2_packuswb:
15438 case Intrinsic::x86_avx2_packusdw:
15439 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
15440 Op.getOperand(1), Op.getOperand(2));
15442 case Intrinsic::x86_ssse3_pshuf_b_128:
15443 case Intrinsic::x86_avx2_pshuf_b:
15444 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
15445 Op.getOperand(1), Op.getOperand(2));
15447 case Intrinsic::x86_sse2_pshuf_d:
15448 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
15449 Op.getOperand(1), Op.getOperand(2));
15451 case Intrinsic::x86_sse2_pshufl_w:
15452 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
15453 Op.getOperand(1), Op.getOperand(2));
15455 case Intrinsic::x86_sse2_pshufh_w:
15456 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
15457 Op.getOperand(1), Op.getOperand(2));
15459 case Intrinsic::x86_ssse3_psign_b_128:
15460 case Intrinsic::x86_ssse3_psign_w_128:
15461 case Intrinsic::x86_ssse3_psign_d_128:
15462 case Intrinsic::x86_avx2_psign_b:
15463 case Intrinsic::x86_avx2_psign_w:
15464 case Intrinsic::x86_avx2_psign_d:
15465 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
15466 Op.getOperand(1), Op.getOperand(2));
15468 case Intrinsic::x86_avx2_permd:
15469 case Intrinsic::x86_avx2_permps:
15470 // Operands intentionally swapped. Mask is last operand to intrinsic,
15471 // but second operand for node/instruction.
15472 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
15473 Op.getOperand(2), Op.getOperand(1));
15475 case Intrinsic::x86_avx512_mask_valign_q_512:
15476 case Intrinsic::x86_avx512_mask_valign_d_512:
15477 // Vector source operands are swapped.
15478 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
15479 Op.getValueType(), Op.getOperand(2),
15482 Op.getOperand(5), Op.getOperand(4), DAG);
15484 // ptest and testp intrinsics. The intrinsic these come from are designed to
15485 // return an integer value, not just an instruction so lower it to the ptest
15486 // or testp pattern and a setcc for the result.
15487 case Intrinsic::x86_sse41_ptestz:
15488 case Intrinsic::x86_sse41_ptestc:
15489 case Intrinsic::x86_sse41_ptestnzc:
15490 case Intrinsic::x86_avx_ptestz_256:
15491 case Intrinsic::x86_avx_ptestc_256:
15492 case Intrinsic::x86_avx_ptestnzc_256:
15493 case Intrinsic::x86_avx_vtestz_ps:
15494 case Intrinsic::x86_avx_vtestc_ps:
15495 case Intrinsic::x86_avx_vtestnzc_ps:
15496 case Intrinsic::x86_avx_vtestz_pd:
15497 case Intrinsic::x86_avx_vtestc_pd:
15498 case Intrinsic::x86_avx_vtestnzc_pd:
15499 case Intrinsic::x86_avx_vtestz_ps_256:
15500 case Intrinsic::x86_avx_vtestc_ps_256:
15501 case Intrinsic::x86_avx_vtestnzc_ps_256:
15502 case Intrinsic::x86_avx_vtestz_pd_256:
15503 case Intrinsic::x86_avx_vtestc_pd_256:
15504 case Intrinsic::x86_avx_vtestnzc_pd_256: {
15505 bool IsTestPacked = false;
15508 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
15509 case Intrinsic::x86_avx_vtestz_ps:
15510 case Intrinsic::x86_avx_vtestz_pd:
15511 case Intrinsic::x86_avx_vtestz_ps_256:
15512 case Intrinsic::x86_avx_vtestz_pd_256:
15513 IsTestPacked = true; // Fallthrough
15514 case Intrinsic::x86_sse41_ptestz:
15515 case Intrinsic::x86_avx_ptestz_256:
15517 X86CC = X86::COND_E;
15519 case Intrinsic::x86_avx_vtestc_ps:
15520 case Intrinsic::x86_avx_vtestc_pd:
15521 case Intrinsic::x86_avx_vtestc_ps_256:
15522 case Intrinsic::x86_avx_vtestc_pd_256:
15523 IsTestPacked = true; // Fallthrough
15524 case Intrinsic::x86_sse41_ptestc:
15525 case Intrinsic::x86_avx_ptestc_256:
15527 X86CC = X86::COND_B;
15529 case Intrinsic::x86_avx_vtestnzc_ps:
15530 case Intrinsic::x86_avx_vtestnzc_pd:
15531 case Intrinsic::x86_avx_vtestnzc_ps_256:
15532 case Intrinsic::x86_avx_vtestnzc_pd_256:
15533 IsTestPacked = true; // Fallthrough
15534 case Intrinsic::x86_sse41_ptestnzc:
15535 case Intrinsic::x86_avx_ptestnzc_256:
15537 X86CC = X86::COND_A;
15541 SDValue LHS = Op.getOperand(1);
15542 SDValue RHS = Op.getOperand(2);
15543 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
15544 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
15545 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15546 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
15547 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15549 case Intrinsic::x86_avx512_kortestz_w:
15550 case Intrinsic::x86_avx512_kortestc_w: {
15551 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
15552 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
15553 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
15554 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15555 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
15556 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
15557 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15560 case Intrinsic::x86_sse42_pcmpistria128:
15561 case Intrinsic::x86_sse42_pcmpestria128:
15562 case Intrinsic::x86_sse42_pcmpistric128:
15563 case Intrinsic::x86_sse42_pcmpestric128:
15564 case Intrinsic::x86_sse42_pcmpistrio128:
15565 case Intrinsic::x86_sse42_pcmpestrio128:
15566 case Intrinsic::x86_sse42_pcmpistris128:
15567 case Intrinsic::x86_sse42_pcmpestris128:
15568 case Intrinsic::x86_sse42_pcmpistriz128:
15569 case Intrinsic::x86_sse42_pcmpestriz128: {
15573 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15574 case Intrinsic::x86_sse42_pcmpistria128:
15575 Opcode = X86ISD::PCMPISTRI;
15576 X86CC = X86::COND_A;
15578 case Intrinsic::x86_sse42_pcmpestria128:
15579 Opcode = X86ISD::PCMPESTRI;
15580 X86CC = X86::COND_A;
15582 case Intrinsic::x86_sse42_pcmpistric128:
15583 Opcode = X86ISD::PCMPISTRI;
15584 X86CC = X86::COND_B;
15586 case Intrinsic::x86_sse42_pcmpestric128:
15587 Opcode = X86ISD::PCMPESTRI;
15588 X86CC = X86::COND_B;
15590 case Intrinsic::x86_sse42_pcmpistrio128:
15591 Opcode = X86ISD::PCMPISTRI;
15592 X86CC = X86::COND_O;
15594 case Intrinsic::x86_sse42_pcmpestrio128:
15595 Opcode = X86ISD::PCMPESTRI;
15596 X86CC = X86::COND_O;
15598 case Intrinsic::x86_sse42_pcmpistris128:
15599 Opcode = X86ISD::PCMPISTRI;
15600 X86CC = X86::COND_S;
15602 case Intrinsic::x86_sse42_pcmpestris128:
15603 Opcode = X86ISD::PCMPESTRI;
15604 X86CC = X86::COND_S;
15606 case Intrinsic::x86_sse42_pcmpistriz128:
15607 Opcode = X86ISD::PCMPISTRI;
15608 X86CC = X86::COND_E;
15610 case Intrinsic::x86_sse42_pcmpestriz128:
15611 Opcode = X86ISD::PCMPESTRI;
15612 X86CC = X86::COND_E;
15615 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15616 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15617 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
15618 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15619 DAG.getConstant(X86CC, MVT::i8),
15620 SDValue(PCMP.getNode(), 1));
15621 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15624 case Intrinsic::x86_sse42_pcmpistri128:
15625 case Intrinsic::x86_sse42_pcmpestri128: {
15627 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
15628 Opcode = X86ISD::PCMPISTRI;
15630 Opcode = X86ISD::PCMPESTRI;
15632 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15633 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15634 return DAG.getNode(Opcode, dl, VTs, NewOps);
15637 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15638 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15639 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15640 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15641 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15642 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15643 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15644 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15645 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15646 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15647 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15648 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
15649 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
15650 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
15651 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
15652 dl, Op.getValueType(),
15656 Op.getOperand(4), Op.getOperand(1), DAG);
15661 case Intrinsic::x86_fma_vfmadd_ps:
15662 case Intrinsic::x86_fma_vfmadd_pd:
15663 case Intrinsic::x86_fma_vfmsub_ps:
15664 case Intrinsic::x86_fma_vfmsub_pd:
15665 case Intrinsic::x86_fma_vfnmadd_ps:
15666 case Intrinsic::x86_fma_vfnmadd_pd:
15667 case Intrinsic::x86_fma_vfnmsub_ps:
15668 case Intrinsic::x86_fma_vfnmsub_pd:
15669 case Intrinsic::x86_fma_vfmaddsub_ps:
15670 case Intrinsic::x86_fma_vfmaddsub_pd:
15671 case Intrinsic::x86_fma_vfmsubadd_ps:
15672 case Intrinsic::x86_fma_vfmsubadd_pd:
15673 case Intrinsic::x86_fma_vfmadd_ps_256:
15674 case Intrinsic::x86_fma_vfmadd_pd_256:
15675 case Intrinsic::x86_fma_vfmsub_ps_256:
15676 case Intrinsic::x86_fma_vfmsub_pd_256:
15677 case Intrinsic::x86_fma_vfnmadd_ps_256:
15678 case Intrinsic::x86_fma_vfnmadd_pd_256:
15679 case Intrinsic::x86_fma_vfnmsub_ps_256:
15680 case Intrinsic::x86_fma_vfnmsub_pd_256:
15681 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15682 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15683 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15684 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15685 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
15686 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
15690 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15691 SDValue Src, SDValue Mask, SDValue Base,
15692 SDValue Index, SDValue ScaleOp, SDValue Chain,
15693 const X86Subtarget * Subtarget) {
15695 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15696 assert(C && "Invalid scale type");
15697 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15698 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15699 Index.getSimpleValueType().getVectorNumElements());
15701 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15703 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15705 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15706 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
15707 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15708 SDValue Segment = DAG.getRegister(0, MVT::i32);
15709 if (Src.getOpcode() == ISD::UNDEF)
15710 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
15711 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15712 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15713 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
15714 return DAG.getMergeValues(RetOps, dl);
15717 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15718 SDValue Src, SDValue Mask, SDValue Base,
15719 SDValue Index, SDValue ScaleOp, SDValue Chain) {
15721 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15722 assert(C && "Invalid scale type");
15723 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15724 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15725 SDValue Segment = DAG.getRegister(0, MVT::i32);
15726 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15727 Index.getSimpleValueType().getVectorNumElements());
15729 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15731 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15733 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15734 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
15735 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
15736 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15737 return SDValue(Res, 1);
15740 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15741 SDValue Mask, SDValue Base, SDValue Index,
15742 SDValue ScaleOp, SDValue Chain) {
15744 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15745 assert(C && "Invalid scale type");
15746 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15747 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15748 SDValue Segment = DAG.getRegister(0, MVT::i32);
15750 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
15752 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15754 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15756 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15757 //SDVTList VTs = DAG.getVTList(MVT::Other);
15758 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15759 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
15760 return SDValue(Res, 0);
15763 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
15764 // read performance monitor counters (x86_rdpmc).
15765 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
15766 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15767 SmallVectorImpl<SDValue> &Results) {
15768 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15769 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15772 // The ECX register is used to select the index of the performance counter
15774 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
15776 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
15778 // Reads the content of a 64-bit performance counter and returns it in the
15779 // registers EDX:EAX.
15780 if (Subtarget->is64Bit()) {
15781 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15782 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15785 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15786 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15789 Chain = HI.getValue(1);
15791 if (Subtarget->is64Bit()) {
15792 // The EAX register is loaded with the low-order 32 bits. The EDX register
15793 // is loaded with the supported high-order bits of the counter.
15794 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15795 DAG.getConstant(32, MVT::i8));
15796 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15797 Results.push_back(Chain);
15801 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15802 SDValue Ops[] = { LO, HI };
15803 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15804 Results.push_back(Pair);
15805 Results.push_back(Chain);
15808 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
15809 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
15810 // also used to custom lower READCYCLECOUNTER nodes.
15811 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
15812 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15813 SmallVectorImpl<SDValue> &Results) {
15814 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15815 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
15818 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
15819 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
15820 // and the EAX register is loaded with the low-order 32 bits.
15821 if (Subtarget->is64Bit()) {
15822 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15823 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15826 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15827 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15830 SDValue Chain = HI.getValue(1);
15832 if (Opcode == X86ISD::RDTSCP_DAG) {
15833 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15835 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
15836 // the ECX register. Add 'ecx' explicitly to the chain.
15837 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
15839 // Explicitly store the content of ECX at the location passed in input
15840 // to the 'rdtscp' intrinsic.
15841 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
15842 MachinePointerInfo(), false, false, 0);
15845 if (Subtarget->is64Bit()) {
15846 // The EDX register is loaded with the high-order 32 bits of the MSR, and
15847 // the EAX register is loaded with the low-order 32 bits.
15848 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15849 DAG.getConstant(32, MVT::i8));
15850 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15851 Results.push_back(Chain);
15855 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15856 SDValue Ops[] = { LO, HI };
15857 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15858 Results.push_back(Pair);
15859 Results.push_back(Chain);
15862 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
15863 SelectionDAG &DAG) {
15864 SmallVector<SDValue, 2> Results;
15866 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
15868 return DAG.getMergeValues(Results, DL);
15872 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
15873 SelectionDAG &DAG) {
15874 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
15876 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
15881 switch(IntrData->Type) {
15883 llvm_unreachable("Unknown Intrinsic Type");
15887 // Emit the node with the right value type.
15888 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
15889 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15891 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
15892 // Otherwise return the value from Rand, which is always 0, casted to i32.
15893 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
15894 DAG.getConstant(1, Op->getValueType(1)),
15895 DAG.getConstant(X86::COND_B, MVT::i32),
15896 SDValue(Result.getNode(), 1) };
15897 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
15898 DAG.getVTList(Op->getValueType(1), MVT::Glue),
15901 // Return { result, isValid, chain }.
15902 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
15903 SDValue(Result.getNode(), 2));
15906 //gather(v1, mask, index, base, scale);
15907 SDValue Chain = Op.getOperand(0);
15908 SDValue Src = Op.getOperand(2);
15909 SDValue Base = Op.getOperand(3);
15910 SDValue Index = Op.getOperand(4);
15911 SDValue Mask = Op.getOperand(5);
15912 SDValue Scale = Op.getOperand(6);
15913 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
15917 //scatter(base, mask, index, v1, scale);
15918 SDValue Chain = Op.getOperand(0);
15919 SDValue Base = Op.getOperand(2);
15920 SDValue Mask = Op.getOperand(3);
15921 SDValue Index = Op.getOperand(4);
15922 SDValue Src = Op.getOperand(5);
15923 SDValue Scale = Op.getOperand(6);
15924 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
15927 SDValue Hint = Op.getOperand(6);
15929 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
15930 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
15931 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
15932 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
15933 SDValue Chain = Op.getOperand(0);
15934 SDValue Mask = Op.getOperand(2);
15935 SDValue Index = Op.getOperand(3);
15936 SDValue Base = Op.getOperand(4);
15937 SDValue Scale = Op.getOperand(5);
15938 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
15940 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
15942 SmallVector<SDValue, 2> Results;
15943 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
15944 return DAG.getMergeValues(Results, dl);
15946 // Read Performance Monitoring Counters.
15948 SmallVector<SDValue, 2> Results;
15949 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
15950 return DAG.getMergeValues(Results, dl);
15952 // XTEST intrinsics.
15954 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15955 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15956 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15957 DAG.getConstant(X86::COND_NE, MVT::i8),
15959 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
15960 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
15961 Ret, SDValue(InTrans.getNode(), 1));
15965 SmallVector<SDValue, 2> Results;
15966 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15967 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
15968 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
15969 DAG.getConstant(-1, MVT::i8));
15970 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
15971 Op.getOperand(4), GenCF.getValue(1));
15972 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
15973 Op.getOperand(5), MachinePointerInfo(),
15975 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15976 DAG.getConstant(X86::COND_B, MVT::i8),
15978 Results.push_back(SetCC);
15979 Results.push_back(Store);
15980 return DAG.getMergeValues(Results, dl);
15985 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
15986 SelectionDAG &DAG) const {
15987 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15988 MFI->setReturnAddressIsTaken(true);
15990 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
15993 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15995 EVT PtrVT = getPointerTy();
15998 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
15999 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16000 DAG.getSubtarget().getRegisterInfo());
16001 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
16002 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16003 DAG.getNode(ISD::ADD, dl, PtrVT,
16004 FrameAddr, Offset),
16005 MachinePointerInfo(), false, false, false, 0);
16008 // Just load the return address.
16009 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
16010 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16011 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
16014 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
16015 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16016 MFI->setFrameAddressIsTaken(true);
16018 EVT VT = Op.getValueType();
16019 SDLoc dl(Op); // FIXME probably not meaningful
16020 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16021 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16022 DAG.getSubtarget().getRegisterInfo());
16023 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16024 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
16025 (FrameReg == X86::EBP && VT == MVT::i32)) &&
16026 "Invalid Frame Register!");
16027 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
16029 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
16030 MachinePointerInfo(),
16031 false, false, false, 0);
16035 // FIXME? Maybe this could be a TableGen attribute on some registers and
16036 // this table could be generated automatically from RegInfo.
16037 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
16039 unsigned Reg = StringSwitch<unsigned>(RegName)
16040 .Case("esp", X86::ESP)
16041 .Case("rsp", X86::RSP)
16045 report_fatal_error("Invalid register name global variable");
16048 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
16049 SelectionDAG &DAG) const {
16050 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16051 DAG.getSubtarget().getRegisterInfo());
16052 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
16055 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
16056 SDValue Chain = Op.getOperand(0);
16057 SDValue Offset = Op.getOperand(1);
16058 SDValue Handler = Op.getOperand(2);
16061 EVT PtrVT = getPointerTy();
16062 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16063 DAG.getSubtarget().getRegisterInfo());
16064 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16065 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
16066 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
16067 "Invalid Frame Register!");
16068 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
16069 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
16071 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
16072 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
16073 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
16074 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
16076 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
16078 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
16079 DAG.getRegister(StoreAddrReg, PtrVT));
16082 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
16083 SelectionDAG &DAG) const {
16085 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
16086 DAG.getVTList(MVT::i32, MVT::Other),
16087 Op.getOperand(0), Op.getOperand(1));
16090 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
16091 SelectionDAG &DAG) const {
16093 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
16094 Op.getOperand(0), Op.getOperand(1));
16097 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
16098 return Op.getOperand(0);
16101 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
16102 SelectionDAG &DAG) const {
16103 SDValue Root = Op.getOperand(0);
16104 SDValue Trmp = Op.getOperand(1); // trampoline
16105 SDValue FPtr = Op.getOperand(2); // nested function
16106 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
16109 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16110 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
16112 if (Subtarget->is64Bit()) {
16113 SDValue OutChains[6];
16115 // Large code-model.
16116 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
16117 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
16119 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
16120 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
16122 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
16124 // Load the pointer to the nested function into R11.
16125 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
16126 SDValue Addr = Trmp;
16127 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16128 Addr, MachinePointerInfo(TrmpAddr),
16131 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16132 DAG.getConstant(2, MVT::i64));
16133 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
16134 MachinePointerInfo(TrmpAddr, 2),
16137 // Load the 'nest' parameter value into R10.
16138 // R10 is specified in X86CallingConv.td
16139 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
16140 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16141 DAG.getConstant(10, MVT::i64));
16142 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16143 Addr, MachinePointerInfo(TrmpAddr, 10),
16146 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16147 DAG.getConstant(12, MVT::i64));
16148 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
16149 MachinePointerInfo(TrmpAddr, 12),
16152 // Jump to the nested function.
16153 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
16154 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16155 DAG.getConstant(20, MVT::i64));
16156 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16157 Addr, MachinePointerInfo(TrmpAddr, 20),
16160 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16161 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16162 DAG.getConstant(22, MVT::i64));
16163 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16164 MachinePointerInfo(TrmpAddr, 22),
16167 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16169 const Function *Func =
16170 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16171 CallingConv::ID CC = Func->getCallingConv();
16176 llvm_unreachable("Unsupported calling convention");
16177 case CallingConv::C:
16178 case CallingConv::X86_StdCall: {
16179 // Pass 'nest' parameter in ECX.
16180 // Must be kept in sync with X86CallingConv.td
16181 NestReg = X86::ECX;
16183 // Check that ECX wasn't needed by an 'inreg' parameter.
16184 FunctionType *FTy = Func->getFunctionType();
16185 const AttributeSet &Attrs = Func->getAttributes();
16187 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16188 unsigned InRegCount = 0;
16191 for (FunctionType::param_iterator I = FTy->param_begin(),
16192 E = FTy->param_end(); I != E; ++I, ++Idx)
16193 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16194 // FIXME: should only count parameters that are lowered to integers.
16195 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16197 if (InRegCount > 2) {
16198 report_fatal_error("Nest register in use - reduce number of inreg"
16204 case CallingConv::X86_FastCall:
16205 case CallingConv::X86_ThisCall:
16206 case CallingConv::Fast:
16207 // Pass 'nest' parameter in EAX.
16208 // Must be kept in sync with X86CallingConv.td
16209 NestReg = X86::EAX;
16213 SDValue OutChains[4];
16214 SDValue Addr, Disp;
16216 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16217 DAG.getConstant(10, MVT::i32));
16218 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16220 // This is storing the opcode for MOV32ri.
16221 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16222 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16223 OutChains[0] = DAG.getStore(Root, dl,
16224 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
16225 Trmp, MachinePointerInfo(TrmpAddr),
16228 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16229 DAG.getConstant(1, MVT::i32));
16230 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
16231 MachinePointerInfo(TrmpAddr, 1),
16234 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
16235 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16236 DAG.getConstant(5, MVT::i32));
16237 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
16238 MachinePointerInfo(TrmpAddr, 5),
16241 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16242 DAG.getConstant(6, MVT::i32));
16243 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
16244 MachinePointerInfo(TrmpAddr, 6),
16247 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16251 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
16252 SelectionDAG &DAG) const {
16254 The rounding mode is in bits 11:10 of FPSR, and has the following
16256 00 Round to nearest
16261 FLT_ROUNDS, on the other hand, expects the following:
16268 To perform the conversion, we do:
16269 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
16272 MachineFunction &MF = DAG.getMachineFunction();
16273 const TargetMachine &TM = MF.getTarget();
16274 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
16275 unsigned StackAlignment = TFI.getStackAlignment();
16276 MVT VT = Op.getSimpleValueType();
16279 // Save FP Control Word to stack slot
16280 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
16281 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
16283 MachineMemOperand *MMO =
16284 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
16285 MachineMemOperand::MOStore, 2, 2);
16287 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
16288 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
16289 DAG.getVTList(MVT::Other),
16290 Ops, MVT::i16, MMO);
16292 // Load FP Control Word from stack slot
16293 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
16294 MachinePointerInfo(), false, false, false, 0);
16296 // Transform as necessary
16298 DAG.getNode(ISD::SRL, DL, MVT::i16,
16299 DAG.getNode(ISD::AND, DL, MVT::i16,
16300 CWD, DAG.getConstant(0x800, MVT::i16)),
16301 DAG.getConstant(11, MVT::i8));
16303 DAG.getNode(ISD::SRL, DL, MVT::i16,
16304 DAG.getNode(ISD::AND, DL, MVT::i16,
16305 CWD, DAG.getConstant(0x400, MVT::i16)),
16306 DAG.getConstant(9, MVT::i8));
16309 DAG.getNode(ISD::AND, DL, MVT::i16,
16310 DAG.getNode(ISD::ADD, DL, MVT::i16,
16311 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
16312 DAG.getConstant(1, MVT::i16)),
16313 DAG.getConstant(3, MVT::i16));
16315 return DAG.getNode((VT.getSizeInBits() < 16 ?
16316 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
16319 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
16320 MVT VT = Op.getSimpleValueType();
16322 unsigned NumBits = VT.getSizeInBits();
16325 Op = Op.getOperand(0);
16326 if (VT == MVT::i8) {
16327 // Zero extend to i32 since there is not an i8 bsr.
16329 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16332 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
16333 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16334 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16336 // If src is zero (i.e. bsr sets ZF), returns NumBits.
16339 DAG.getConstant(NumBits+NumBits-1, OpVT),
16340 DAG.getConstant(X86::COND_E, MVT::i8),
16343 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
16345 // Finally xor with NumBits-1.
16346 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16349 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16353 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
16354 MVT VT = Op.getSimpleValueType();
16356 unsigned NumBits = VT.getSizeInBits();
16359 Op = Op.getOperand(0);
16360 if (VT == MVT::i8) {
16361 // Zero extend to i32 since there is not an i8 bsr.
16363 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16366 // Issue a bsr (scan bits in reverse).
16367 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16368 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16370 // And xor with NumBits-1.
16371 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16374 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16378 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
16379 MVT VT = Op.getSimpleValueType();
16380 unsigned NumBits = VT.getSizeInBits();
16382 Op = Op.getOperand(0);
16384 // Issue a bsf (scan bits forward) which also sets EFLAGS.
16385 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
16386 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
16388 // If src is zero (i.e. bsf sets ZF), returns NumBits.
16391 DAG.getConstant(NumBits, VT),
16392 DAG.getConstant(X86::COND_E, MVT::i8),
16395 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
16398 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
16399 // ones, and then concatenate the result back.
16400 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
16401 MVT VT = Op.getSimpleValueType();
16403 assert(VT.is256BitVector() && VT.isInteger() &&
16404 "Unsupported value type for operation");
16406 unsigned NumElems = VT.getVectorNumElements();
16409 // Extract the LHS vectors
16410 SDValue LHS = Op.getOperand(0);
16411 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
16412 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
16414 // Extract the RHS vectors
16415 SDValue RHS = Op.getOperand(1);
16416 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
16417 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
16419 MVT EltVT = VT.getVectorElementType();
16420 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16422 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
16423 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
16424 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
16427 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
16428 assert(Op.getSimpleValueType().is256BitVector() &&
16429 Op.getSimpleValueType().isInteger() &&
16430 "Only handle AVX 256-bit vector integer operation");
16431 return Lower256IntArith(Op, DAG);
16434 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
16435 assert(Op.getSimpleValueType().is256BitVector() &&
16436 Op.getSimpleValueType().isInteger() &&
16437 "Only handle AVX 256-bit vector integer operation");
16438 return Lower256IntArith(Op, DAG);
16441 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
16442 SelectionDAG &DAG) {
16444 MVT VT = Op.getSimpleValueType();
16446 // Decompose 256-bit ops into smaller 128-bit ops.
16447 if (VT.is256BitVector() && !Subtarget->hasInt256())
16448 return Lower256IntArith(Op, DAG);
16450 SDValue A = Op.getOperand(0);
16451 SDValue B = Op.getOperand(1);
16453 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
16454 if (VT == MVT::v4i32) {
16455 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
16456 "Should not custom lower when pmuldq is available!");
16458 // Extract the odd parts.
16459 static const int UnpackMask[] = { 1, -1, 3, -1 };
16460 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
16461 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
16463 // Multiply the even parts.
16464 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
16465 // Now multiply odd parts.
16466 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
16468 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
16469 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
16471 // Merge the two vectors back together with a shuffle. This expands into 2
16473 static const int ShufMask[] = { 0, 4, 2, 6 };
16474 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
16477 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
16478 "Only know how to lower V2I64/V4I64/V8I64 multiply");
16480 // Ahi = psrlqi(a, 32);
16481 // Bhi = psrlqi(b, 32);
16483 // AloBlo = pmuludq(a, b);
16484 // AloBhi = pmuludq(a, Bhi);
16485 // AhiBlo = pmuludq(Ahi, b);
16487 // AloBhi = psllqi(AloBhi, 32);
16488 // AhiBlo = psllqi(AhiBlo, 32);
16489 // return AloBlo + AloBhi + AhiBlo;
16491 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
16492 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
16494 // Bit cast to 32-bit vectors for MULUDQ
16495 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
16496 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
16497 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
16498 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
16499 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
16500 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
16502 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
16503 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
16504 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
16506 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
16507 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
16509 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
16510 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
16513 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
16514 assert(Subtarget->isTargetWin64() && "Unexpected target");
16515 EVT VT = Op.getValueType();
16516 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
16517 "Unexpected return type for lowering");
16521 switch (Op->getOpcode()) {
16522 default: llvm_unreachable("Unexpected request for libcall!");
16523 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
16524 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
16525 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
16526 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
16527 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
16528 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
16532 SDValue InChain = DAG.getEntryNode();
16534 TargetLowering::ArgListTy Args;
16535 TargetLowering::ArgListEntry Entry;
16536 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
16537 EVT ArgVT = Op->getOperand(i).getValueType();
16538 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
16539 "Unexpected argument type for lowering");
16540 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
16541 Entry.Node = StackPtr;
16542 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
16544 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16545 Entry.Ty = PointerType::get(ArgTy,0);
16546 Entry.isSExt = false;
16547 Entry.isZExt = false;
16548 Args.push_back(Entry);
16551 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
16554 TargetLowering::CallLoweringInfo CLI(DAG);
16555 CLI.setDebugLoc(dl).setChain(InChain)
16556 .setCallee(getLibcallCallingConv(LC),
16557 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
16558 Callee, std::move(Args), 0)
16559 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
16561 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
16562 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
16565 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
16566 SelectionDAG &DAG) {
16567 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
16568 EVT VT = Op0.getValueType();
16571 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
16572 (VT == MVT::v8i32 && Subtarget->hasInt256()));
16574 // PMULxD operations multiply each even value (starting at 0) of LHS with
16575 // the related value of RHS and produce a widen result.
16576 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16577 // => <2 x i64> <ae|cg>
16579 // In other word, to have all the results, we need to perform two PMULxD:
16580 // 1. one with the even values.
16581 // 2. one with the odd values.
16582 // To achieve #2, with need to place the odd values at an even position.
16584 // Place the odd value at an even position (basically, shift all values 1
16585 // step to the left):
16586 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
16587 // <a|b|c|d> => <b|undef|d|undef>
16588 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
16589 // <e|f|g|h> => <f|undef|h|undef>
16590 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
16592 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
16594 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
16595 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
16597 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
16598 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16599 // => <2 x i64> <ae|cg>
16600 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
16601 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
16602 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
16603 // => <2 x i64> <bf|dh>
16604 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
16605 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
16607 // Shuffle it back into the right order.
16608 SDValue Highs, Lows;
16609 if (VT == MVT::v8i32) {
16610 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
16611 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16612 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
16613 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16615 const int HighMask[] = {1, 5, 3, 7};
16616 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16617 const int LowMask[] = {0, 4, 2, 6};
16618 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16621 // If we have a signed multiply but no PMULDQ fix up the high parts of a
16622 // unsigned multiply.
16623 if (IsSigned && !Subtarget->hasSSE41()) {
16625 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
16626 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
16627 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
16628 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
16629 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
16631 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
16632 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
16635 // The first result of MUL_LOHI is actually the low value, followed by the
16637 SDValue Ops[] = {Lows, Highs};
16638 return DAG.getMergeValues(Ops, dl);
16641 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
16642 const X86Subtarget *Subtarget) {
16643 MVT VT = Op.getSimpleValueType();
16645 SDValue R = Op.getOperand(0);
16646 SDValue Amt = Op.getOperand(1);
16648 // Optimize shl/srl/sra with constant shift amount.
16649 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
16650 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
16651 uint64_t ShiftAmt = ShiftConst->getZExtValue();
16653 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
16654 (Subtarget->hasInt256() &&
16655 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16656 (Subtarget->hasAVX512() &&
16657 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16658 if (Op.getOpcode() == ISD::SHL)
16659 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16661 if (Op.getOpcode() == ISD::SRL)
16662 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16664 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
16665 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16669 if (VT == MVT::v16i8) {
16670 if (Op.getOpcode() == ISD::SHL) {
16671 // Make a large shift.
16672 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16673 MVT::v8i16, R, ShiftAmt,
16675 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16676 // Zero out the rightmost bits.
16677 SmallVector<SDValue, 16> V(16,
16678 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16680 return DAG.getNode(ISD::AND, dl, VT, SHL,
16681 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16683 if (Op.getOpcode() == ISD::SRL) {
16684 // Make a large shift.
16685 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16686 MVT::v8i16, R, ShiftAmt,
16688 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16689 // Zero out the leftmost bits.
16690 SmallVector<SDValue, 16> V(16,
16691 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16693 return DAG.getNode(ISD::AND, dl, VT, SRL,
16694 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16696 if (Op.getOpcode() == ISD::SRA) {
16697 if (ShiftAmt == 7) {
16698 // R s>> 7 === R s< 0
16699 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16700 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16703 // R s>> a === ((R u>> a) ^ m) - m
16704 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16705 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
16707 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16708 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16709 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16712 llvm_unreachable("Unknown shift opcode.");
16715 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
16716 if (Op.getOpcode() == ISD::SHL) {
16717 // Make a large shift.
16718 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16719 MVT::v16i16, R, ShiftAmt,
16721 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16722 // Zero out the rightmost bits.
16723 SmallVector<SDValue, 32> V(32,
16724 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16726 return DAG.getNode(ISD::AND, dl, VT, SHL,
16727 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16729 if (Op.getOpcode() == ISD::SRL) {
16730 // Make a large shift.
16731 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16732 MVT::v16i16, R, ShiftAmt,
16734 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16735 // Zero out the leftmost bits.
16736 SmallVector<SDValue, 32> V(32,
16737 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16739 return DAG.getNode(ISD::AND, dl, VT, SRL,
16740 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16742 if (Op.getOpcode() == ISD::SRA) {
16743 if (ShiftAmt == 7) {
16744 // R s>> 7 === R s< 0
16745 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16746 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16749 // R s>> a === ((R u>> a) ^ m) - m
16750 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16751 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
16753 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16754 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16755 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16758 llvm_unreachable("Unknown shift opcode.");
16763 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16764 if (!Subtarget->is64Bit() &&
16765 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
16766 Amt.getOpcode() == ISD::BITCAST &&
16767 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16768 Amt = Amt.getOperand(0);
16769 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16770 VT.getVectorNumElements();
16771 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
16772 uint64_t ShiftAmt = 0;
16773 for (unsigned i = 0; i != Ratio; ++i) {
16774 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
16778 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
16780 // Check remaining shift amounts.
16781 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16782 uint64_t ShAmt = 0;
16783 for (unsigned j = 0; j != Ratio; ++j) {
16784 ConstantSDNode *C =
16785 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
16789 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
16791 if (ShAmt != ShiftAmt)
16794 switch (Op.getOpcode()) {
16796 llvm_unreachable("Unknown shift opcode!");
16798 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16801 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16804 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16812 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
16813 const X86Subtarget* Subtarget) {
16814 MVT VT = Op.getSimpleValueType();
16816 SDValue R = Op.getOperand(0);
16817 SDValue Amt = Op.getOperand(1);
16819 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
16820 VT == MVT::v4i32 || VT == MVT::v8i16 ||
16821 (Subtarget->hasInt256() &&
16822 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
16823 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16824 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16826 EVT EltVT = VT.getVectorElementType();
16828 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16829 unsigned NumElts = VT.getVectorNumElements();
16831 for (i = 0; i != NumElts; ++i) {
16832 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
16836 for (j = i; j != NumElts; ++j) {
16837 SDValue Arg = Amt.getOperand(j);
16838 if (Arg.getOpcode() == ISD::UNDEF) continue;
16839 if (Arg != Amt.getOperand(i))
16842 if (i != NumElts && j == NumElts)
16843 BaseShAmt = Amt.getOperand(i);
16845 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
16846 Amt = Amt.getOperand(0);
16847 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
16848 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
16849 SDValue InVec = Amt.getOperand(0);
16850 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
16851 unsigned NumElts = InVec.getValueType().getVectorNumElements();
16853 for (; i != NumElts; ++i) {
16854 SDValue Arg = InVec.getOperand(i);
16855 if (Arg.getOpcode() == ISD::UNDEF) continue;
16859 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
16860 if (ConstantSDNode *C =
16861 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
16862 unsigned SplatIdx =
16863 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
16864 if (C->getZExtValue() == SplatIdx)
16865 BaseShAmt = InVec.getOperand(1);
16868 if (!BaseShAmt.getNode())
16869 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
16870 DAG.getIntPtrConstant(0));
16874 if (BaseShAmt.getNode()) {
16875 if (EltVT.bitsGT(MVT::i32))
16876 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
16877 else if (EltVT.bitsLT(MVT::i32))
16878 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
16880 switch (Op.getOpcode()) {
16882 llvm_unreachable("Unknown shift opcode!");
16884 switch (VT.SimpleTy) {
16885 default: return SDValue();
16894 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
16897 switch (VT.SimpleTy) {
16898 default: return SDValue();
16905 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
16908 switch (VT.SimpleTy) {
16909 default: return SDValue();
16918 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
16924 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16925 if (!Subtarget->is64Bit() &&
16926 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
16927 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
16928 Amt.getOpcode() == ISD::BITCAST &&
16929 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16930 Amt = Amt.getOperand(0);
16931 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16932 VT.getVectorNumElements();
16933 std::vector<SDValue> Vals(Ratio);
16934 for (unsigned i = 0; i != Ratio; ++i)
16935 Vals[i] = Amt.getOperand(i);
16936 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16937 for (unsigned j = 0; j != Ratio; ++j)
16938 if (Vals[j] != Amt.getOperand(i + j))
16941 switch (Op.getOpcode()) {
16943 llvm_unreachable("Unknown shift opcode!");
16945 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
16947 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
16949 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
16956 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
16957 SelectionDAG &DAG) {
16958 MVT VT = Op.getSimpleValueType();
16960 SDValue R = Op.getOperand(0);
16961 SDValue Amt = Op.getOperand(1);
16964 assert(VT.isVector() && "Custom lowering only for vector shifts!");
16965 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
16967 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
16971 V = LowerScalarVariableShift(Op, DAG, Subtarget);
16975 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
16977 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
16978 if (Subtarget->hasInt256()) {
16979 if (Op.getOpcode() == ISD::SRL &&
16980 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16981 VT == MVT::v4i64 || VT == MVT::v8i32))
16983 if (Op.getOpcode() == ISD::SHL &&
16984 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16985 VT == MVT::v4i64 || VT == MVT::v8i32))
16987 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
16991 // If possible, lower this packed shift into a vector multiply instead of
16992 // expanding it into a sequence of scalar shifts.
16993 // Do this only if the vector shift count is a constant build_vector.
16994 if (Op.getOpcode() == ISD::SHL &&
16995 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
16996 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
16997 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16998 SmallVector<SDValue, 8> Elts;
16999 EVT SVT = VT.getScalarType();
17000 unsigned SVTBits = SVT.getSizeInBits();
17001 const APInt &One = APInt(SVTBits, 1);
17002 unsigned NumElems = VT.getVectorNumElements();
17004 for (unsigned i=0; i !=NumElems; ++i) {
17005 SDValue Op = Amt->getOperand(i);
17006 if (Op->getOpcode() == ISD::UNDEF) {
17007 Elts.push_back(Op);
17011 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
17012 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
17013 uint64_t ShAmt = C.getZExtValue();
17014 if (ShAmt >= SVTBits) {
17015 Elts.push_back(DAG.getUNDEF(SVT));
17018 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
17020 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
17021 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
17024 // Lower SHL with variable shift amount.
17025 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
17026 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
17028 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
17029 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
17030 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
17031 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
17034 // If possible, lower this shift as a sequence of two shifts by
17035 // constant plus a MOVSS/MOVSD instead of scalarizing it.
17037 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
17039 // Could be rewritten as:
17040 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
17042 // The advantage is that the two shifts from the example would be
17043 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
17044 // the vector shift into four scalar shifts plus four pairs of vector
17046 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
17047 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17048 unsigned TargetOpcode = X86ISD::MOVSS;
17049 bool CanBeSimplified;
17050 // The splat value for the first packed shift (the 'X' from the example).
17051 SDValue Amt1 = Amt->getOperand(0);
17052 // The splat value for the second packed shift (the 'Y' from the example).
17053 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
17054 Amt->getOperand(2);
17056 // See if it is possible to replace this node with a sequence of
17057 // two shifts followed by a MOVSS/MOVSD
17058 if (VT == MVT::v4i32) {
17059 // Check if it is legal to use a MOVSS.
17060 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
17061 Amt2 == Amt->getOperand(3);
17062 if (!CanBeSimplified) {
17063 // Otherwise, check if we can still simplify this node using a MOVSD.
17064 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
17065 Amt->getOperand(2) == Amt->getOperand(3);
17066 TargetOpcode = X86ISD::MOVSD;
17067 Amt2 = Amt->getOperand(2);
17070 // Do similar checks for the case where the machine value type
17072 CanBeSimplified = Amt1 == Amt->getOperand(1);
17073 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
17074 CanBeSimplified = Amt2 == Amt->getOperand(i);
17076 if (!CanBeSimplified) {
17077 TargetOpcode = X86ISD::MOVSD;
17078 CanBeSimplified = true;
17079 Amt2 = Amt->getOperand(4);
17080 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
17081 CanBeSimplified = Amt1 == Amt->getOperand(i);
17082 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
17083 CanBeSimplified = Amt2 == Amt->getOperand(j);
17087 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
17088 isa<ConstantSDNode>(Amt2)) {
17089 // Replace this node with two shifts followed by a MOVSS/MOVSD.
17090 EVT CastVT = MVT::v4i32;
17092 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
17093 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
17095 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
17096 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
17097 if (TargetOpcode == X86ISD::MOVSD)
17098 CastVT = MVT::v2i64;
17099 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
17100 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
17101 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
17103 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
17107 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
17108 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
17111 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
17112 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
17114 // Turn 'a' into a mask suitable for VSELECT
17115 SDValue VSelM = DAG.getConstant(0x80, VT);
17116 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17117 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17119 SDValue CM1 = DAG.getConstant(0x0f, VT);
17120 SDValue CM2 = DAG.getConstant(0x3f, VT);
17122 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
17123 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
17124 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
17125 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17126 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17129 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17130 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17131 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17133 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
17134 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
17135 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
17136 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17137 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17140 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17141 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17142 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17144 // return VSELECT(r, r+r, a);
17145 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
17146 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
17150 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
17151 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
17152 // solution better.
17153 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
17154 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
17156 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
17157 R = DAG.getNode(ExtOpc, dl, NewVT, R);
17158 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
17159 return DAG.getNode(ISD::TRUNCATE, dl, VT,
17160 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17163 // Decompose 256-bit shifts into smaller 128-bit shifts.
17164 if (VT.is256BitVector()) {
17165 unsigned NumElems = VT.getVectorNumElements();
17166 MVT EltVT = VT.getVectorElementType();
17167 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17169 // Extract the two vectors
17170 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17171 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17173 // Recreate the shift amount vectors
17174 SDValue Amt1, Amt2;
17175 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17176 // Constant shift amount
17177 SmallVector<SDValue, 4> Amt1Csts;
17178 SmallVector<SDValue, 4> Amt2Csts;
17179 for (unsigned i = 0; i != NumElems/2; ++i)
17180 Amt1Csts.push_back(Amt->getOperand(i));
17181 for (unsigned i = NumElems/2; i != NumElems; ++i)
17182 Amt2Csts.push_back(Amt->getOperand(i));
17184 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17185 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17187 // Variable shift amount
17188 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17189 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17192 // Issue new vector shifts for the smaller types
17193 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17194 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17196 // Concatenate the result back
17197 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17203 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17204 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17205 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17206 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17207 // has only one use.
17208 SDNode *N = Op.getNode();
17209 SDValue LHS = N->getOperand(0);
17210 SDValue RHS = N->getOperand(1);
17211 unsigned BaseOp = 0;
17214 switch (Op.getOpcode()) {
17215 default: llvm_unreachable("Unknown ovf instruction!");
17217 // A subtract of one will be selected as a INC. Note that INC doesn't
17218 // set CF, so we can't do this for UADDO.
17219 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17221 BaseOp = X86ISD::INC;
17222 Cond = X86::COND_O;
17225 BaseOp = X86ISD::ADD;
17226 Cond = X86::COND_O;
17229 BaseOp = X86ISD::ADD;
17230 Cond = X86::COND_B;
17233 // A subtract of one will be selected as a DEC. Note that DEC doesn't
17234 // set CF, so we can't do this for USUBO.
17235 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17237 BaseOp = X86ISD::DEC;
17238 Cond = X86::COND_O;
17241 BaseOp = X86ISD::SUB;
17242 Cond = X86::COND_O;
17245 BaseOp = X86ISD::SUB;
17246 Cond = X86::COND_B;
17249 BaseOp = X86ISD::SMUL;
17250 Cond = X86::COND_O;
17252 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
17253 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
17255 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
17258 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
17259 DAG.getConstant(X86::COND_O, MVT::i32),
17260 SDValue(Sum.getNode(), 2));
17262 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17266 // Also sets EFLAGS.
17267 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
17268 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
17271 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
17272 DAG.getConstant(Cond, MVT::i32),
17273 SDValue(Sum.getNode(), 1));
17275 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17278 // Sign extension of the low part of vector elements. This may be used either
17279 // when sign extend instructions are not available or if the vector element
17280 // sizes already match the sign-extended size. If the vector elements are in
17281 // their pre-extended size and sign extend instructions are available, that will
17282 // be handled by LowerSIGN_EXTEND.
17283 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
17284 SelectionDAG &DAG) const {
17286 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
17287 MVT VT = Op.getSimpleValueType();
17289 if (!Subtarget->hasSSE2() || !VT.isVector())
17292 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
17293 ExtraVT.getScalarType().getSizeInBits();
17295 switch (VT.SimpleTy) {
17296 default: return SDValue();
17299 if (!Subtarget->hasFp256())
17301 if (!Subtarget->hasInt256()) {
17302 // needs to be split
17303 unsigned NumElems = VT.getVectorNumElements();
17305 // Extract the LHS vectors
17306 SDValue LHS = Op.getOperand(0);
17307 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17308 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17310 MVT EltVT = VT.getVectorElementType();
17311 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17313 EVT ExtraEltVT = ExtraVT.getVectorElementType();
17314 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
17315 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
17317 SDValue Extra = DAG.getValueType(ExtraVT);
17319 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
17320 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
17322 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
17327 SDValue Op0 = Op.getOperand(0);
17329 // This is a sign extension of some low part of vector elements without
17330 // changing the size of the vector elements themselves:
17331 // Shift-Left + Shift-Right-Algebraic.
17332 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
17334 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
17340 /// Returns true if the operand type is exactly twice the native width, and
17341 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
17342 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
17343 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
17344 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
17345 const X86Subtarget &Subtarget =
17346 getTargetMachine().getSubtarget<X86Subtarget>();
17347 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
17350 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
17351 else if (OpWidth == 128)
17352 return Subtarget.hasCmpxchg16b();
17357 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
17358 return needsCmpXchgNb(SI->getValueOperand()->getType());
17361 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *SI) const {
17362 return false; // FIXME, currently these are expanded separately in this file.
17365 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
17366 const X86Subtarget &Subtarget =
17367 getTargetMachine().getSubtarget<X86Subtarget>();
17368 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
17369 const Type *MemType = AI->getType();
17371 // If the operand is too big, we must see if cmpxchg8/16b is available
17372 // and default to library calls otherwise.
17373 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
17374 return needsCmpXchgNb(MemType);
17376 AtomicRMWInst::BinOp Op = AI->getOperation();
17379 llvm_unreachable("Unknown atomic operation");
17380 case AtomicRMWInst::Xchg:
17381 case AtomicRMWInst::Add:
17382 case AtomicRMWInst::Sub:
17383 // It's better to use xadd, xsub or xchg for these in all cases.
17385 case AtomicRMWInst::Or:
17386 case AtomicRMWInst::And:
17387 case AtomicRMWInst::Xor:
17388 // If the atomicrmw's result isn't actually used, we can just add a "lock"
17389 // prefix to a normal instruction for these operations.
17390 return !AI->use_empty();
17391 case AtomicRMWInst::Nand:
17392 case AtomicRMWInst::Max:
17393 case AtomicRMWInst::Min:
17394 case AtomicRMWInst::UMax:
17395 case AtomicRMWInst::UMin:
17396 // These always require a non-trivial set of data operations on x86. We must
17397 // use a cmpxchg loop.
17402 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
17403 SelectionDAG &DAG) {
17405 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
17406 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
17407 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
17408 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
17410 // The only fence that needs an instruction is a sequentially-consistent
17411 // cross-thread fence.
17412 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
17413 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
17414 // no-sse2). There isn't any reason to disable it if the target processor
17416 if (Subtarget->hasSSE2() || Subtarget->is64Bit())
17417 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
17419 SDValue Chain = Op.getOperand(0);
17420 SDValue Zero = DAG.getConstant(0, MVT::i32);
17422 DAG.getRegister(X86::ESP, MVT::i32), // Base
17423 DAG.getTargetConstant(1, MVT::i8), // Scale
17424 DAG.getRegister(0, MVT::i32), // Index
17425 DAG.getTargetConstant(0, MVT::i32), // Disp
17426 DAG.getRegister(0, MVT::i32), // Segment.
17430 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
17431 return SDValue(Res, 0);
17434 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
17435 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
17438 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
17439 SelectionDAG &DAG) {
17440 MVT T = Op.getSimpleValueType();
17444 switch(T.SimpleTy) {
17445 default: llvm_unreachable("Invalid value type!");
17446 case MVT::i8: Reg = X86::AL; size = 1; break;
17447 case MVT::i16: Reg = X86::AX; size = 2; break;
17448 case MVT::i32: Reg = X86::EAX; size = 4; break;
17450 assert(Subtarget->is64Bit() && "Node not type legal!");
17451 Reg = X86::RAX; size = 8;
17454 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
17455 Op.getOperand(2), SDValue());
17456 SDValue Ops[] = { cpIn.getValue(0),
17459 DAG.getTargetConstant(size, MVT::i8),
17460 cpIn.getValue(1) };
17461 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17462 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
17463 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
17467 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
17468 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
17469 MVT::i32, cpOut.getValue(2));
17470 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
17471 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17473 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
17474 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
17475 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
17479 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
17480 SelectionDAG &DAG) {
17481 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
17482 MVT DstVT = Op.getSimpleValueType();
17484 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
17485 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17486 if (DstVT != MVT::f64)
17487 // This conversion needs to be expanded.
17490 SDValue InVec = Op->getOperand(0);
17492 unsigned NumElts = SrcVT.getVectorNumElements();
17493 EVT SVT = SrcVT.getVectorElementType();
17495 // Widen the vector in input in the case of MVT::v2i32.
17496 // Example: from MVT::v2i32 to MVT::v4i32.
17497 SmallVector<SDValue, 16> Elts;
17498 for (unsigned i = 0, e = NumElts; i != e; ++i)
17499 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
17500 DAG.getIntPtrConstant(i)));
17502 // Explicitly mark the extra elements as Undef.
17503 SDValue Undef = DAG.getUNDEF(SVT);
17504 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
17505 Elts.push_back(Undef);
17507 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17508 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
17509 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
17510 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
17511 DAG.getIntPtrConstant(0));
17514 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
17515 Subtarget->hasMMX() && "Unexpected custom BITCAST");
17516 assert((DstVT == MVT::i64 ||
17517 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
17518 "Unexpected custom BITCAST");
17519 // i64 <=> MMX conversions are Legal.
17520 if (SrcVT==MVT::i64 && DstVT.isVector())
17522 if (DstVT==MVT::i64 && SrcVT.isVector())
17524 // MMX <=> MMX conversions are Legal.
17525 if (SrcVT.isVector() && DstVT.isVector())
17527 // All other conversions need to be expanded.
17531 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
17532 SDNode *Node = Op.getNode();
17534 EVT T = Node->getValueType(0);
17535 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
17536 DAG.getConstant(0, T), Node->getOperand(2));
17537 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
17538 cast<AtomicSDNode>(Node)->getMemoryVT(),
17539 Node->getOperand(0),
17540 Node->getOperand(1), negOp,
17541 cast<AtomicSDNode>(Node)->getMemOperand(),
17542 cast<AtomicSDNode>(Node)->getOrdering(),
17543 cast<AtomicSDNode>(Node)->getSynchScope());
17546 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
17547 SDNode *Node = Op.getNode();
17549 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17551 // Convert seq_cst store -> xchg
17552 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
17553 // FIXME: On 32-bit, store -> fist or movq would be more efficient
17554 // (The only way to get a 16-byte store is cmpxchg16b)
17555 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
17556 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
17557 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
17558 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
17559 cast<AtomicSDNode>(Node)->getMemoryVT(),
17560 Node->getOperand(0),
17561 Node->getOperand(1), Node->getOperand(2),
17562 cast<AtomicSDNode>(Node)->getMemOperand(),
17563 cast<AtomicSDNode>(Node)->getOrdering(),
17564 cast<AtomicSDNode>(Node)->getSynchScope());
17565 return Swap.getValue(1);
17567 // Other atomic stores have a simple pattern.
17571 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
17572 EVT VT = Op.getNode()->getSimpleValueType(0);
17574 // Let legalize expand this if it isn't a legal type yet.
17575 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
17578 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17581 bool ExtraOp = false;
17582 switch (Op.getOpcode()) {
17583 default: llvm_unreachable("Invalid code");
17584 case ISD::ADDC: Opc = X86ISD::ADD; break;
17585 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
17586 case ISD::SUBC: Opc = X86ISD::SUB; break;
17587 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
17591 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17593 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17594 Op.getOperand(1), Op.getOperand(2));
17597 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
17598 SelectionDAG &DAG) {
17599 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
17601 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
17602 // which returns the values as { float, float } (in XMM0) or
17603 // { double, double } (which is returned in XMM0, XMM1).
17605 SDValue Arg = Op.getOperand(0);
17606 EVT ArgVT = Arg.getValueType();
17607 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17609 TargetLowering::ArgListTy Args;
17610 TargetLowering::ArgListEntry Entry;
17614 Entry.isSExt = false;
17615 Entry.isZExt = false;
17616 Args.push_back(Entry);
17618 bool isF64 = ArgVT == MVT::f64;
17619 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
17620 // the small struct {f32, f32} is returned in (eax, edx). For f64,
17621 // the results are returned via SRet in memory.
17622 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
17623 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17624 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
17626 Type *RetTy = isF64
17627 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
17628 : (Type*)VectorType::get(ArgTy, 4);
17630 TargetLowering::CallLoweringInfo CLI(DAG);
17631 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
17632 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
17634 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
17637 // Returned in xmm0 and xmm1.
17638 return CallResult.first;
17640 // Returned in bits 0:31 and 32:64 xmm0.
17641 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17642 CallResult.first, DAG.getIntPtrConstant(0));
17643 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17644 CallResult.first, DAG.getIntPtrConstant(1));
17645 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
17646 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
17649 /// LowerOperation - Provide custom lowering hooks for some operations.
17651 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
17652 switch (Op.getOpcode()) {
17653 default: llvm_unreachable("Should not custom lower this!");
17654 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
17655 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
17656 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
17657 return LowerCMP_SWAP(Op, Subtarget, DAG);
17658 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
17659 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
17660 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
17661 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
17662 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
17663 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
17664 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
17665 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
17666 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
17667 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
17668 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
17669 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
17670 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
17671 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
17672 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
17673 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
17674 case ISD::SHL_PARTS:
17675 case ISD::SRA_PARTS:
17676 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
17677 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
17678 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
17679 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
17680 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
17681 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
17682 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
17683 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
17684 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
17685 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
17686 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
17688 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
17689 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
17690 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
17691 case ISD::SETCC: return LowerSETCC(Op, DAG);
17692 case ISD::SELECT: return LowerSELECT(Op, DAG);
17693 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
17694 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
17695 case ISD::VASTART: return LowerVASTART(Op, DAG);
17696 case ISD::VAARG: return LowerVAARG(Op, DAG);
17697 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
17698 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
17699 case ISD::INTRINSIC_VOID:
17700 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
17701 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
17702 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
17703 case ISD::FRAME_TO_ARGS_OFFSET:
17704 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
17705 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
17706 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
17707 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
17708 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
17709 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
17710 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
17711 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
17712 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
17713 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
17714 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
17715 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
17716 case ISD::UMUL_LOHI:
17717 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
17720 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
17726 case ISD::UMULO: return LowerXALUO(Op, DAG);
17727 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
17728 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
17732 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
17733 case ISD::ADD: return LowerADD(Op, DAG);
17734 case ISD::SUB: return LowerSUB(Op, DAG);
17735 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
17739 static void ReplaceATOMIC_LOAD(SDNode *Node,
17740 SmallVectorImpl<SDValue> &Results,
17741 SelectionDAG &DAG) {
17743 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17745 // Convert wide load -> cmpxchg8b/cmpxchg16b
17746 // FIXME: On 32-bit, load -> fild or movq would be more efficient
17747 // (The only way to get a 16-byte load is cmpxchg16b)
17748 // FIXME: 16-byte ATOMIC_CMP_SWAP isn't actually hooked up at the moment.
17749 SDValue Zero = DAG.getConstant(0, VT);
17750 SDVTList VTs = DAG.getVTList(VT, MVT::i1, MVT::Other);
17752 DAG.getAtomicCmpSwap(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, VT, VTs,
17753 Node->getOperand(0), Node->getOperand(1), Zero, Zero,
17754 cast<AtomicSDNode>(Node)->getMemOperand(),
17755 cast<AtomicSDNode>(Node)->getOrdering(),
17756 cast<AtomicSDNode>(Node)->getOrdering(),
17757 cast<AtomicSDNode>(Node)->getSynchScope());
17758 Results.push_back(Swap.getValue(0));
17759 Results.push_back(Swap.getValue(2));
17762 /// ReplaceNodeResults - Replace a node with an illegal result type
17763 /// with a new node built out of custom code.
17764 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
17765 SmallVectorImpl<SDValue>&Results,
17766 SelectionDAG &DAG) const {
17768 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17769 switch (N->getOpcode()) {
17771 llvm_unreachable("Do not know how to custom type legalize this operation!");
17772 case ISD::SIGN_EXTEND_INREG:
17777 // We don't want to expand or promote these.
17784 case ISD::UDIVREM: {
17785 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
17786 Results.push_back(V);
17789 case ISD::FP_TO_SINT:
17790 case ISD::FP_TO_UINT: {
17791 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
17793 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
17796 std::pair<SDValue,SDValue> Vals =
17797 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
17798 SDValue FIST = Vals.first, StackSlot = Vals.second;
17799 if (FIST.getNode()) {
17800 EVT VT = N->getValueType(0);
17801 // Return a load from the stack slot.
17802 if (StackSlot.getNode())
17803 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
17804 MachinePointerInfo(),
17805 false, false, false, 0));
17807 Results.push_back(FIST);
17811 case ISD::UINT_TO_FP: {
17812 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17813 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
17814 N->getValueType(0) != MVT::v2f32)
17816 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
17818 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
17820 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
17821 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
17822 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
17823 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
17824 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
17825 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
17828 case ISD::FP_ROUND: {
17829 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
17831 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
17832 Results.push_back(V);
17835 case ISD::INTRINSIC_W_CHAIN: {
17836 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
17838 default : llvm_unreachable("Do not know how to custom type "
17839 "legalize this intrinsic operation!");
17840 case Intrinsic::x86_rdtsc:
17841 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17843 case Intrinsic::x86_rdtscp:
17844 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
17846 case Intrinsic::x86_rdpmc:
17847 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
17850 case ISD::READCYCLECOUNTER: {
17851 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17854 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
17855 EVT T = N->getValueType(0);
17856 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
17857 bool Regs64bit = T == MVT::i128;
17858 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
17859 SDValue cpInL, cpInH;
17860 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17861 DAG.getConstant(0, HalfT));
17862 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17863 DAG.getConstant(1, HalfT));
17864 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
17865 Regs64bit ? X86::RAX : X86::EAX,
17867 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
17868 Regs64bit ? X86::RDX : X86::EDX,
17869 cpInH, cpInL.getValue(1));
17870 SDValue swapInL, swapInH;
17871 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17872 DAG.getConstant(0, HalfT));
17873 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17874 DAG.getConstant(1, HalfT));
17875 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
17876 Regs64bit ? X86::RBX : X86::EBX,
17877 swapInL, cpInH.getValue(1));
17878 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
17879 Regs64bit ? X86::RCX : X86::ECX,
17880 swapInH, swapInL.getValue(1));
17881 SDValue Ops[] = { swapInH.getValue(0),
17883 swapInH.getValue(1) };
17884 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17885 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
17886 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
17887 X86ISD::LCMPXCHG8_DAG;
17888 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
17889 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
17890 Regs64bit ? X86::RAX : X86::EAX,
17891 HalfT, Result.getValue(1));
17892 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
17893 Regs64bit ? X86::RDX : X86::EDX,
17894 HalfT, cpOutL.getValue(2));
17895 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
17897 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
17898 MVT::i32, cpOutH.getValue(2));
17900 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17901 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17902 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
17904 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
17905 Results.push_back(Success);
17906 Results.push_back(EFLAGS.getValue(1));
17909 case ISD::ATOMIC_SWAP:
17910 case ISD::ATOMIC_LOAD_ADD:
17911 case ISD::ATOMIC_LOAD_SUB:
17912 case ISD::ATOMIC_LOAD_AND:
17913 case ISD::ATOMIC_LOAD_OR:
17914 case ISD::ATOMIC_LOAD_XOR:
17915 case ISD::ATOMIC_LOAD_NAND:
17916 case ISD::ATOMIC_LOAD_MIN:
17917 case ISD::ATOMIC_LOAD_MAX:
17918 case ISD::ATOMIC_LOAD_UMIN:
17919 case ISD::ATOMIC_LOAD_UMAX:
17920 // Delegate to generic TypeLegalization. Situations we can really handle
17921 // should have already been dealt with by AtomicExpandPass.cpp.
17923 case ISD::ATOMIC_LOAD: {
17924 ReplaceATOMIC_LOAD(N, Results, DAG);
17927 case ISD::BITCAST: {
17928 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17929 EVT DstVT = N->getValueType(0);
17930 EVT SrcVT = N->getOperand(0)->getValueType(0);
17932 if (SrcVT != MVT::f64 ||
17933 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
17936 unsigned NumElts = DstVT.getVectorNumElements();
17937 EVT SVT = DstVT.getVectorElementType();
17938 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17939 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
17940 MVT::v2f64, N->getOperand(0));
17941 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
17943 if (ExperimentalVectorWideningLegalization) {
17944 // If we are legalizing vectors by widening, we already have the desired
17945 // legal vector type, just return it.
17946 Results.push_back(ToVecInt);
17950 SmallVector<SDValue, 8> Elts;
17951 for (unsigned i = 0, e = NumElts; i != e; ++i)
17952 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
17953 ToVecInt, DAG.getIntPtrConstant(i)));
17955 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
17960 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
17962 default: return nullptr;
17963 case X86ISD::BSF: return "X86ISD::BSF";
17964 case X86ISD::BSR: return "X86ISD::BSR";
17965 case X86ISD::SHLD: return "X86ISD::SHLD";
17966 case X86ISD::SHRD: return "X86ISD::SHRD";
17967 case X86ISD::FAND: return "X86ISD::FAND";
17968 case X86ISD::FANDN: return "X86ISD::FANDN";
17969 case X86ISD::FOR: return "X86ISD::FOR";
17970 case X86ISD::FXOR: return "X86ISD::FXOR";
17971 case X86ISD::FSRL: return "X86ISD::FSRL";
17972 case X86ISD::FILD: return "X86ISD::FILD";
17973 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
17974 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
17975 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
17976 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
17977 case X86ISD::FLD: return "X86ISD::FLD";
17978 case X86ISD::FST: return "X86ISD::FST";
17979 case X86ISD::CALL: return "X86ISD::CALL";
17980 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
17981 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
17982 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
17983 case X86ISD::BT: return "X86ISD::BT";
17984 case X86ISD::CMP: return "X86ISD::CMP";
17985 case X86ISD::COMI: return "X86ISD::COMI";
17986 case X86ISD::UCOMI: return "X86ISD::UCOMI";
17987 case X86ISD::CMPM: return "X86ISD::CMPM";
17988 case X86ISD::CMPMU: return "X86ISD::CMPMU";
17989 case X86ISD::SETCC: return "X86ISD::SETCC";
17990 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
17991 case X86ISD::FSETCC: return "X86ISD::FSETCC";
17992 case X86ISD::CMOV: return "X86ISD::CMOV";
17993 case X86ISD::BRCOND: return "X86ISD::BRCOND";
17994 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
17995 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
17996 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
17997 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
17998 case X86ISD::Wrapper: return "X86ISD::Wrapper";
17999 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
18000 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
18001 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
18002 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
18003 case X86ISD::PINSRB: return "X86ISD::PINSRB";
18004 case X86ISD::PINSRW: return "X86ISD::PINSRW";
18005 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
18006 case X86ISD::ANDNP: return "X86ISD::ANDNP";
18007 case X86ISD::PSIGN: return "X86ISD::PSIGN";
18008 case X86ISD::BLENDV: return "X86ISD::BLENDV";
18009 case X86ISD::BLENDI: return "X86ISD::BLENDI";
18010 case X86ISD::SUBUS: return "X86ISD::SUBUS";
18011 case X86ISD::HADD: return "X86ISD::HADD";
18012 case X86ISD::HSUB: return "X86ISD::HSUB";
18013 case X86ISD::FHADD: return "X86ISD::FHADD";
18014 case X86ISD::FHSUB: return "X86ISD::FHSUB";
18015 case X86ISD::UMAX: return "X86ISD::UMAX";
18016 case X86ISD::UMIN: return "X86ISD::UMIN";
18017 case X86ISD::SMAX: return "X86ISD::SMAX";
18018 case X86ISD::SMIN: return "X86ISD::SMIN";
18019 case X86ISD::FMAX: return "X86ISD::FMAX";
18020 case X86ISD::FMIN: return "X86ISD::FMIN";
18021 case X86ISD::FMAXC: return "X86ISD::FMAXC";
18022 case X86ISD::FMINC: return "X86ISD::FMINC";
18023 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
18024 case X86ISD::FRCP: return "X86ISD::FRCP";
18025 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
18026 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
18027 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
18028 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
18029 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
18030 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
18031 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
18032 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
18033 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
18034 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
18035 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
18036 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
18037 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
18038 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
18039 case X86ISD::VZEXT: return "X86ISD::VZEXT";
18040 case X86ISD::VSEXT: return "X86ISD::VSEXT";
18041 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
18042 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
18043 case X86ISD::VINSERT: return "X86ISD::VINSERT";
18044 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
18045 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
18046 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
18047 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
18048 case X86ISD::VSHL: return "X86ISD::VSHL";
18049 case X86ISD::VSRL: return "X86ISD::VSRL";
18050 case X86ISD::VSRA: return "X86ISD::VSRA";
18051 case X86ISD::VSHLI: return "X86ISD::VSHLI";
18052 case X86ISD::VSRLI: return "X86ISD::VSRLI";
18053 case X86ISD::VSRAI: return "X86ISD::VSRAI";
18054 case X86ISD::CMPP: return "X86ISD::CMPP";
18055 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
18056 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
18057 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
18058 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
18059 case X86ISD::ADD: return "X86ISD::ADD";
18060 case X86ISD::SUB: return "X86ISD::SUB";
18061 case X86ISD::ADC: return "X86ISD::ADC";
18062 case X86ISD::SBB: return "X86ISD::SBB";
18063 case X86ISD::SMUL: return "X86ISD::SMUL";
18064 case X86ISD::UMUL: return "X86ISD::UMUL";
18065 case X86ISD::INC: return "X86ISD::INC";
18066 case X86ISD::DEC: return "X86ISD::DEC";
18067 case X86ISD::OR: return "X86ISD::OR";
18068 case X86ISD::XOR: return "X86ISD::XOR";
18069 case X86ISD::AND: return "X86ISD::AND";
18070 case X86ISD::BEXTR: return "X86ISD::BEXTR";
18071 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
18072 case X86ISD::PTEST: return "X86ISD::PTEST";
18073 case X86ISD::TESTP: return "X86ISD::TESTP";
18074 case X86ISD::TESTM: return "X86ISD::TESTM";
18075 case X86ISD::TESTNM: return "X86ISD::TESTNM";
18076 case X86ISD::KORTEST: return "X86ISD::KORTEST";
18077 case X86ISD::PACKSS: return "X86ISD::PACKSS";
18078 case X86ISD::PACKUS: return "X86ISD::PACKUS";
18079 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
18080 case X86ISD::VALIGN: return "X86ISD::VALIGN";
18081 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
18082 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
18083 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
18084 case X86ISD::SHUFP: return "X86ISD::SHUFP";
18085 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
18086 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
18087 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
18088 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
18089 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
18090 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
18091 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
18092 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
18093 case X86ISD::MOVSD: return "X86ISD::MOVSD";
18094 case X86ISD::MOVSS: return "X86ISD::MOVSS";
18095 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
18096 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
18097 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
18098 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
18099 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
18100 case X86ISD::VPERMILP: return "X86ISD::VPERMILP";
18101 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
18102 case X86ISD::VPERMV: return "X86ISD::VPERMV";
18103 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
18104 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
18105 case X86ISD::VPERMI: return "X86ISD::VPERMI";
18106 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
18107 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
18108 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
18109 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
18110 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
18111 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
18112 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
18113 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
18114 case X86ISD::SAHF: return "X86ISD::SAHF";
18115 case X86ISD::RDRAND: return "X86ISD::RDRAND";
18116 case X86ISD::RDSEED: return "X86ISD::RDSEED";
18117 case X86ISD::FMADD: return "X86ISD::FMADD";
18118 case X86ISD::FMSUB: return "X86ISD::FMSUB";
18119 case X86ISD::FNMADD: return "X86ISD::FNMADD";
18120 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
18121 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
18122 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
18123 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
18124 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
18125 case X86ISD::XTEST: return "X86ISD::XTEST";
18129 // isLegalAddressingMode - Return true if the addressing mode represented
18130 // by AM is legal for this target, for a load/store of the specified type.
18131 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
18133 // X86 supports extremely general addressing modes.
18134 CodeModel::Model M = getTargetMachine().getCodeModel();
18135 Reloc::Model R = getTargetMachine().getRelocationModel();
18137 // X86 allows a sign-extended 32-bit immediate field as a displacement.
18138 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
18143 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
18145 // If a reference to this global requires an extra load, we can't fold it.
18146 if (isGlobalStubReference(GVFlags))
18149 // If BaseGV requires a register for the PIC base, we cannot also have a
18150 // BaseReg specified.
18151 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
18154 // If lower 4G is not available, then we must use rip-relative addressing.
18155 if ((M != CodeModel::Small || R != Reloc::Static) &&
18156 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
18160 switch (AM.Scale) {
18166 // These scales always work.
18171 // These scales are formed with basereg+scalereg. Only accept if there is
18176 default: // Other stuff never works.
18183 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
18184 unsigned Bits = Ty->getScalarSizeInBits();
18186 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
18187 // particularly cheaper than those without.
18191 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
18192 // variable shifts just as cheap as scalar ones.
18193 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
18196 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
18197 // fully general vector.
18201 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
18202 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18204 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
18205 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
18206 return NumBits1 > NumBits2;
18209 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
18210 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18213 if (!isTypeLegal(EVT::getEVT(Ty1)))
18216 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
18218 // Assuming the caller doesn't have a zeroext or signext return parameter,
18219 // truncation all the way down to i1 is valid.
18223 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
18224 return isInt<32>(Imm);
18227 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
18228 // Can also use sub to handle negated immediates.
18229 return isInt<32>(Imm);
18232 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
18233 if (!VT1.isInteger() || !VT2.isInteger())
18235 unsigned NumBits1 = VT1.getSizeInBits();
18236 unsigned NumBits2 = VT2.getSizeInBits();
18237 return NumBits1 > NumBits2;
18240 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
18241 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18242 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
18245 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
18246 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18247 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
18250 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
18251 EVT VT1 = Val.getValueType();
18252 if (isZExtFree(VT1, VT2))
18255 if (Val.getOpcode() != ISD::LOAD)
18258 if (!VT1.isSimple() || !VT1.isInteger() ||
18259 !VT2.isSimple() || !VT2.isInteger())
18262 switch (VT1.getSimpleVT().SimpleTy) {
18267 // X86 has 8, 16, and 32-bit zero-extending loads.
18275 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
18276 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
18279 VT = VT.getScalarType();
18281 if (!VT.isSimple())
18284 switch (VT.getSimpleVT().SimpleTy) {
18295 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
18296 // i16 instructions are longer (0x66 prefix) and potentially slower.
18297 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
18300 /// isShuffleMaskLegal - Targets can use this to indicate that they only
18301 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
18302 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
18303 /// are assumed to be legal.
18305 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
18307 if (!VT.isSimple())
18310 MVT SVT = VT.getSimpleVT();
18312 // Very little shuffling can be done for 64-bit vectors right now.
18313 if (VT.getSizeInBits() == 64)
18316 // If this is a single-input shuffle with no 128 bit lane crossings we can
18317 // lower it into pshufb.
18318 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
18319 (SVT.is256BitVector() && Subtarget->hasInt256())) {
18320 bool isLegal = true;
18321 for (unsigned I = 0, E = M.size(); I != E; ++I) {
18322 if (M[I] >= (int)SVT.getVectorNumElements() ||
18323 ShuffleCrosses128bitLane(SVT, I, M[I])) {
18332 // FIXME: blends, shifts.
18333 return (SVT.getVectorNumElements() == 2 ||
18334 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
18335 isMOVLMask(M, SVT) ||
18336 isMOVHLPSMask(M, SVT) ||
18337 isSHUFPMask(M, SVT) ||
18338 isPSHUFDMask(M, SVT) ||
18339 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
18340 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
18341 isPALIGNRMask(M, SVT, Subtarget) ||
18342 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
18343 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
18344 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18345 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18346 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
18350 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
18352 if (!VT.isSimple())
18355 MVT SVT = VT.getSimpleVT();
18356 unsigned NumElts = SVT.getVectorNumElements();
18357 // FIXME: This collection of masks seems suspect.
18360 if (NumElts == 4 && SVT.is128BitVector()) {
18361 return (isMOVLMask(Mask, SVT) ||
18362 isCommutedMOVLMask(Mask, SVT, true) ||
18363 isSHUFPMask(Mask, SVT) ||
18364 isSHUFPMask(Mask, SVT, /* Commuted */ true));
18369 //===----------------------------------------------------------------------===//
18370 // X86 Scheduler Hooks
18371 //===----------------------------------------------------------------------===//
18373 /// Utility function to emit xbegin specifying the start of an RTM region.
18374 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
18375 const TargetInstrInfo *TII) {
18376 DebugLoc DL = MI->getDebugLoc();
18378 const BasicBlock *BB = MBB->getBasicBlock();
18379 MachineFunction::iterator I = MBB;
18382 // For the v = xbegin(), we generate
18393 MachineBasicBlock *thisMBB = MBB;
18394 MachineFunction *MF = MBB->getParent();
18395 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
18396 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
18397 MF->insert(I, mainMBB);
18398 MF->insert(I, sinkMBB);
18400 // Transfer the remainder of BB and its successor edges to sinkMBB.
18401 sinkMBB->splice(sinkMBB->begin(), MBB,
18402 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18403 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
18407 // # fallthrough to mainMBB
18408 // # abortion to sinkMBB
18409 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
18410 thisMBB->addSuccessor(mainMBB);
18411 thisMBB->addSuccessor(sinkMBB);
18415 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
18416 mainMBB->addSuccessor(sinkMBB);
18419 // EAX is live into the sinkMBB
18420 sinkMBB->addLiveIn(X86::EAX);
18421 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18422 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18425 MI->eraseFromParent();
18429 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
18430 // or XMM0_V32I8 in AVX all of this code can be replaced with that
18431 // in the .td file.
18432 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
18433 const TargetInstrInfo *TII) {
18435 switch (MI->getOpcode()) {
18436 default: llvm_unreachable("illegal opcode!");
18437 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
18438 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
18439 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
18440 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
18441 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
18442 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
18443 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
18444 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
18447 DebugLoc dl = MI->getDebugLoc();
18448 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18450 unsigned NumArgs = MI->getNumOperands();
18451 for (unsigned i = 1; i < NumArgs; ++i) {
18452 MachineOperand &Op = MI->getOperand(i);
18453 if (!(Op.isReg() && Op.isImplicit()))
18454 MIB.addOperand(Op);
18456 if (MI->hasOneMemOperand())
18457 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18459 BuildMI(*BB, MI, dl,
18460 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18461 .addReg(X86::XMM0);
18463 MI->eraseFromParent();
18467 // FIXME: Custom handling because TableGen doesn't support multiple implicit
18468 // defs in an instruction pattern
18469 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
18470 const TargetInstrInfo *TII) {
18472 switch (MI->getOpcode()) {
18473 default: llvm_unreachable("illegal opcode!");
18474 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
18475 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
18476 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
18477 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
18478 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
18479 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
18480 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
18481 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
18484 DebugLoc dl = MI->getDebugLoc();
18485 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18487 unsigned NumArgs = MI->getNumOperands(); // remove the results
18488 for (unsigned i = 1; i < NumArgs; ++i) {
18489 MachineOperand &Op = MI->getOperand(i);
18490 if (!(Op.isReg() && Op.isImplicit()))
18491 MIB.addOperand(Op);
18493 if (MI->hasOneMemOperand())
18494 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18496 BuildMI(*BB, MI, dl,
18497 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18500 MI->eraseFromParent();
18504 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
18505 const TargetInstrInfo *TII,
18506 const X86Subtarget* Subtarget) {
18507 DebugLoc dl = MI->getDebugLoc();
18509 // Address into RAX/EAX, other two args into ECX, EDX.
18510 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
18511 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
18512 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
18513 for (int i = 0; i < X86::AddrNumOperands; ++i)
18514 MIB.addOperand(MI->getOperand(i));
18516 unsigned ValOps = X86::AddrNumOperands;
18517 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
18518 .addReg(MI->getOperand(ValOps).getReg());
18519 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
18520 .addReg(MI->getOperand(ValOps+1).getReg());
18522 // The instruction doesn't actually take any operands though.
18523 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
18525 MI->eraseFromParent(); // The pseudo is gone now.
18529 MachineBasicBlock *
18530 X86TargetLowering::EmitVAARG64WithCustomInserter(
18532 MachineBasicBlock *MBB) const {
18533 // Emit va_arg instruction on X86-64.
18535 // Operands to this pseudo-instruction:
18536 // 0 ) Output : destination address (reg)
18537 // 1-5) Input : va_list address (addr, i64mem)
18538 // 6 ) ArgSize : Size (in bytes) of vararg type
18539 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
18540 // 8 ) Align : Alignment of type
18541 // 9 ) EFLAGS (implicit-def)
18543 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
18544 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
18546 unsigned DestReg = MI->getOperand(0).getReg();
18547 MachineOperand &Base = MI->getOperand(1);
18548 MachineOperand &Scale = MI->getOperand(2);
18549 MachineOperand &Index = MI->getOperand(3);
18550 MachineOperand &Disp = MI->getOperand(4);
18551 MachineOperand &Segment = MI->getOperand(5);
18552 unsigned ArgSize = MI->getOperand(6).getImm();
18553 unsigned ArgMode = MI->getOperand(7).getImm();
18554 unsigned Align = MI->getOperand(8).getImm();
18556 // Memory Reference
18557 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
18558 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18559 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18561 // Machine Information
18562 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18563 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
18564 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
18565 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
18566 DebugLoc DL = MI->getDebugLoc();
18568 // struct va_list {
18571 // i64 overflow_area (address)
18572 // i64 reg_save_area (address)
18574 // sizeof(va_list) = 24
18575 // alignment(va_list) = 8
18577 unsigned TotalNumIntRegs = 6;
18578 unsigned TotalNumXMMRegs = 8;
18579 bool UseGPOffset = (ArgMode == 1);
18580 bool UseFPOffset = (ArgMode == 2);
18581 unsigned MaxOffset = TotalNumIntRegs * 8 +
18582 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
18584 /* Align ArgSize to a multiple of 8 */
18585 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
18586 bool NeedsAlign = (Align > 8);
18588 MachineBasicBlock *thisMBB = MBB;
18589 MachineBasicBlock *overflowMBB;
18590 MachineBasicBlock *offsetMBB;
18591 MachineBasicBlock *endMBB;
18593 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
18594 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
18595 unsigned OffsetReg = 0;
18597 if (!UseGPOffset && !UseFPOffset) {
18598 // If we only pull from the overflow region, we don't create a branch.
18599 // We don't need to alter control flow.
18600 OffsetDestReg = 0; // unused
18601 OverflowDestReg = DestReg;
18603 offsetMBB = nullptr;
18604 overflowMBB = thisMBB;
18607 // First emit code to check if gp_offset (or fp_offset) is below the bound.
18608 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
18609 // If not, pull from overflow_area. (branch to overflowMBB)
18614 // offsetMBB overflowMBB
18619 // Registers for the PHI in endMBB
18620 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
18621 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
18623 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18624 MachineFunction *MF = MBB->getParent();
18625 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18626 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18627 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18629 MachineFunction::iterator MBBIter = MBB;
18632 // Insert the new basic blocks
18633 MF->insert(MBBIter, offsetMBB);
18634 MF->insert(MBBIter, overflowMBB);
18635 MF->insert(MBBIter, endMBB);
18637 // Transfer the remainder of MBB and its successor edges to endMBB.
18638 endMBB->splice(endMBB->begin(), thisMBB,
18639 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
18640 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
18642 // Make offsetMBB and overflowMBB successors of thisMBB
18643 thisMBB->addSuccessor(offsetMBB);
18644 thisMBB->addSuccessor(overflowMBB);
18646 // endMBB is a successor of both offsetMBB and overflowMBB
18647 offsetMBB->addSuccessor(endMBB);
18648 overflowMBB->addSuccessor(endMBB);
18650 // Load the offset value into a register
18651 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18652 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
18656 .addDisp(Disp, UseFPOffset ? 4 : 0)
18657 .addOperand(Segment)
18658 .setMemRefs(MMOBegin, MMOEnd);
18660 // Check if there is enough room left to pull this argument.
18661 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
18663 .addImm(MaxOffset + 8 - ArgSizeA8);
18665 // Branch to "overflowMBB" if offset >= max
18666 // Fall through to "offsetMBB" otherwise
18667 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
18668 .addMBB(overflowMBB);
18671 // In offsetMBB, emit code to use the reg_save_area.
18673 assert(OffsetReg != 0);
18675 // Read the reg_save_area address.
18676 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
18677 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
18682 .addOperand(Segment)
18683 .setMemRefs(MMOBegin, MMOEnd);
18685 // Zero-extend the offset
18686 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
18687 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
18690 .addImm(X86::sub_32bit);
18692 // Add the offset to the reg_save_area to get the final address.
18693 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
18694 .addReg(OffsetReg64)
18695 .addReg(RegSaveReg);
18697 // Compute the offset for the next argument
18698 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18699 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
18701 .addImm(UseFPOffset ? 16 : 8);
18703 // Store it back into the va_list.
18704 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
18708 .addDisp(Disp, UseFPOffset ? 4 : 0)
18709 .addOperand(Segment)
18710 .addReg(NextOffsetReg)
18711 .setMemRefs(MMOBegin, MMOEnd);
18714 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
18719 // Emit code to use overflow area
18722 // Load the overflow_area address into a register.
18723 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
18724 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
18729 .addOperand(Segment)
18730 .setMemRefs(MMOBegin, MMOEnd);
18732 // If we need to align it, do so. Otherwise, just copy the address
18733 // to OverflowDestReg.
18735 // Align the overflow address
18736 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
18737 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
18739 // aligned_addr = (addr + (align-1)) & ~(align-1)
18740 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
18741 .addReg(OverflowAddrReg)
18744 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
18746 .addImm(~(uint64_t)(Align-1));
18748 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
18749 .addReg(OverflowAddrReg);
18752 // Compute the next overflow address after this argument.
18753 // (the overflow address should be kept 8-byte aligned)
18754 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
18755 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
18756 .addReg(OverflowDestReg)
18757 .addImm(ArgSizeA8);
18759 // Store the new overflow address.
18760 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
18765 .addOperand(Segment)
18766 .addReg(NextAddrReg)
18767 .setMemRefs(MMOBegin, MMOEnd);
18769 // If we branched, emit the PHI to the front of endMBB.
18771 BuildMI(*endMBB, endMBB->begin(), DL,
18772 TII->get(X86::PHI), DestReg)
18773 .addReg(OffsetDestReg).addMBB(offsetMBB)
18774 .addReg(OverflowDestReg).addMBB(overflowMBB);
18777 // Erase the pseudo instruction
18778 MI->eraseFromParent();
18783 MachineBasicBlock *
18784 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
18786 MachineBasicBlock *MBB) const {
18787 // Emit code to save XMM registers to the stack. The ABI says that the
18788 // number of registers to save is given in %al, so it's theoretically
18789 // possible to do an indirect jump trick to avoid saving all of them,
18790 // however this code takes a simpler approach and just executes all
18791 // of the stores if %al is non-zero. It's less code, and it's probably
18792 // easier on the hardware branch predictor, and stores aren't all that
18793 // expensive anyway.
18795 // Create the new basic blocks. One block contains all the XMM stores,
18796 // and one block is the final destination regardless of whether any
18797 // stores were performed.
18798 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18799 MachineFunction *F = MBB->getParent();
18800 MachineFunction::iterator MBBIter = MBB;
18802 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
18803 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
18804 F->insert(MBBIter, XMMSaveMBB);
18805 F->insert(MBBIter, EndMBB);
18807 // Transfer the remainder of MBB and its successor edges to EndMBB.
18808 EndMBB->splice(EndMBB->begin(), MBB,
18809 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18810 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
18812 // The original block will now fall through to the XMM save block.
18813 MBB->addSuccessor(XMMSaveMBB);
18814 // The XMMSaveMBB will fall through to the end block.
18815 XMMSaveMBB->addSuccessor(EndMBB);
18817 // Now add the instructions.
18818 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18819 DebugLoc DL = MI->getDebugLoc();
18821 unsigned CountReg = MI->getOperand(0).getReg();
18822 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
18823 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
18825 if (!Subtarget->isTargetWin64()) {
18826 // If %al is 0, branch around the XMM save block.
18827 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
18828 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
18829 MBB->addSuccessor(EndMBB);
18832 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
18833 // that was just emitted, but clearly shouldn't be "saved".
18834 assert((MI->getNumOperands() <= 3 ||
18835 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
18836 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
18837 && "Expected last argument to be EFLAGS");
18838 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
18839 // In the XMM save block, save all the XMM argument registers.
18840 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
18841 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
18842 MachineMemOperand *MMO =
18843 F->getMachineMemOperand(
18844 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
18845 MachineMemOperand::MOStore,
18846 /*Size=*/16, /*Align=*/16);
18847 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
18848 .addFrameIndex(RegSaveFrameIndex)
18849 .addImm(/*Scale=*/1)
18850 .addReg(/*IndexReg=*/0)
18851 .addImm(/*Disp=*/Offset)
18852 .addReg(/*Segment=*/0)
18853 .addReg(MI->getOperand(i).getReg())
18854 .addMemOperand(MMO);
18857 MI->eraseFromParent(); // The pseudo instruction is gone now.
18862 // The EFLAGS operand of SelectItr might be missing a kill marker
18863 // because there were multiple uses of EFLAGS, and ISel didn't know
18864 // which to mark. Figure out whether SelectItr should have had a
18865 // kill marker, and set it if it should. Returns the correct kill
18867 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
18868 MachineBasicBlock* BB,
18869 const TargetRegisterInfo* TRI) {
18870 // Scan forward through BB for a use/def of EFLAGS.
18871 MachineBasicBlock::iterator miI(std::next(SelectItr));
18872 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
18873 const MachineInstr& mi = *miI;
18874 if (mi.readsRegister(X86::EFLAGS))
18876 if (mi.definesRegister(X86::EFLAGS))
18877 break; // Should have kill-flag - update below.
18880 // If we hit the end of the block, check whether EFLAGS is live into a
18882 if (miI == BB->end()) {
18883 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
18884 sEnd = BB->succ_end();
18885 sItr != sEnd; ++sItr) {
18886 MachineBasicBlock* succ = *sItr;
18887 if (succ->isLiveIn(X86::EFLAGS))
18892 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
18893 // out. SelectMI should have a kill flag on EFLAGS.
18894 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
18898 MachineBasicBlock *
18899 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
18900 MachineBasicBlock *BB) const {
18901 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18902 DebugLoc DL = MI->getDebugLoc();
18904 // To "insert" a SELECT_CC instruction, we actually have to insert the
18905 // diamond control-flow pattern. The incoming instruction knows the
18906 // destination vreg to set, the condition code register to branch on, the
18907 // true/false values to select between, and a branch opcode to use.
18908 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18909 MachineFunction::iterator It = BB;
18915 // cmpTY ccX, r1, r2
18917 // fallthrough --> copy0MBB
18918 MachineBasicBlock *thisMBB = BB;
18919 MachineFunction *F = BB->getParent();
18920 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
18921 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
18922 F->insert(It, copy0MBB);
18923 F->insert(It, sinkMBB);
18925 // If the EFLAGS register isn't dead in the terminator, then claim that it's
18926 // live into the sink and copy blocks.
18927 const TargetRegisterInfo *TRI =
18928 BB->getParent()->getSubtarget().getRegisterInfo();
18929 if (!MI->killsRegister(X86::EFLAGS) &&
18930 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
18931 copy0MBB->addLiveIn(X86::EFLAGS);
18932 sinkMBB->addLiveIn(X86::EFLAGS);
18935 // Transfer the remainder of BB and its successor edges to sinkMBB.
18936 sinkMBB->splice(sinkMBB->begin(), BB,
18937 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18938 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
18940 // Add the true and fallthrough blocks as its successors.
18941 BB->addSuccessor(copy0MBB);
18942 BB->addSuccessor(sinkMBB);
18944 // Create the conditional branch instruction.
18946 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
18947 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
18950 // %FalseValue = ...
18951 // # fallthrough to sinkMBB
18952 copy0MBB->addSuccessor(sinkMBB);
18955 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
18957 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18958 TII->get(X86::PHI), MI->getOperand(0).getReg())
18959 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
18960 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
18962 MI->eraseFromParent(); // The pseudo instruction is gone now.
18966 MachineBasicBlock *
18967 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI, MachineBasicBlock *BB,
18968 bool Is64Bit) const {
18969 MachineFunction *MF = BB->getParent();
18970 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18971 DebugLoc DL = MI->getDebugLoc();
18972 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18974 assert(MF->shouldSplitStack());
18976 unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
18977 unsigned TlsOffset = Is64Bit ? 0x70 : 0x30;
18980 // ... [Till the alloca]
18981 // If stacklet is not large enough, jump to mallocMBB
18984 // Allocate by subtracting from RSP
18985 // Jump to continueMBB
18988 // Allocate by call to runtime
18992 // [rest of original BB]
18995 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18996 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18997 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18999 MachineRegisterInfo &MRI = MF->getRegInfo();
19000 const TargetRegisterClass *AddrRegClass =
19001 getRegClassFor(Is64Bit ? MVT::i64:MVT::i32);
19003 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19004 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19005 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
19006 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
19007 sizeVReg = MI->getOperand(1).getReg(),
19008 physSPReg = Is64Bit ? X86::RSP : X86::ESP;
19010 MachineFunction::iterator MBBIter = BB;
19013 MF->insert(MBBIter, bumpMBB);
19014 MF->insert(MBBIter, mallocMBB);
19015 MF->insert(MBBIter, continueMBB);
19017 continueMBB->splice(continueMBB->begin(), BB,
19018 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19019 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
19021 // Add code to the main basic block to check if the stack limit has been hit,
19022 // and if so, jump to mallocMBB otherwise to bumpMBB.
19023 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
19024 BuildMI(BB, DL, TII->get(Is64Bit ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
19025 .addReg(tmpSPVReg).addReg(sizeVReg);
19026 BuildMI(BB, DL, TII->get(Is64Bit ? X86::CMP64mr:X86::CMP32mr))
19027 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
19028 .addReg(SPLimitVReg);
19029 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
19031 // bumpMBB simply decreases the stack pointer, since we know the current
19032 // stacklet has enough space.
19033 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
19034 .addReg(SPLimitVReg);
19035 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
19036 .addReg(SPLimitVReg);
19037 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19039 // Calls into a routine in libgcc to allocate more space from the heap.
19040 const uint32_t *RegMask = MF->getTarget()
19041 .getSubtargetImpl()
19042 ->getRegisterInfo()
19043 ->getCallPreservedMask(CallingConv::C);
19045 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
19047 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19048 .addExternalSymbol("__morestack_allocate_stack_space")
19049 .addRegMask(RegMask)
19050 .addReg(X86::RDI, RegState::Implicit)
19051 .addReg(X86::RAX, RegState::ImplicitDefine);
19053 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
19055 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
19056 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
19057 .addExternalSymbol("__morestack_allocate_stack_space")
19058 .addRegMask(RegMask)
19059 .addReg(X86::EAX, RegState::ImplicitDefine);
19063 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
19066 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
19067 .addReg(Is64Bit ? X86::RAX : X86::EAX);
19068 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19070 // Set up the CFG correctly.
19071 BB->addSuccessor(bumpMBB);
19072 BB->addSuccessor(mallocMBB);
19073 mallocMBB->addSuccessor(continueMBB);
19074 bumpMBB->addSuccessor(continueMBB);
19076 // Take care of the PHI nodes.
19077 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
19078 MI->getOperand(0).getReg())
19079 .addReg(mallocPtrVReg).addMBB(mallocMBB)
19080 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
19082 // Delete the original pseudo instruction.
19083 MI->eraseFromParent();
19086 return continueMBB;
19089 MachineBasicBlock *
19090 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
19091 MachineBasicBlock *BB) const {
19092 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19093 DebugLoc DL = MI->getDebugLoc();
19095 assert(!Subtarget->isTargetMacho());
19097 // The lowering is pretty easy: we're just emitting the call to _alloca. The
19098 // non-trivial part is impdef of ESP.
19100 if (Subtarget->isTargetWin64()) {
19101 if (Subtarget->isTargetCygMing()) {
19102 // ___chkstk(Mingw64):
19103 // Clobbers R10, R11, RAX and EFLAGS.
19105 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19106 .addExternalSymbol("___chkstk")
19107 .addReg(X86::RAX, RegState::Implicit)
19108 .addReg(X86::RSP, RegState::Implicit)
19109 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
19110 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
19111 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19113 // __chkstk(MSVCRT): does not update stack pointer.
19114 // Clobbers R10, R11 and EFLAGS.
19115 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
19116 .addExternalSymbol("__chkstk")
19117 .addReg(X86::RAX, RegState::Implicit)
19118 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19119 // RAX has the offset to be subtracted from RSP.
19120 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
19125 const char *StackProbeSymbol =
19126 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
19128 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
19129 .addExternalSymbol(StackProbeSymbol)
19130 .addReg(X86::EAX, RegState::Implicit)
19131 .addReg(X86::ESP, RegState::Implicit)
19132 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
19133 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
19134 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
19137 MI->eraseFromParent(); // The pseudo instruction is gone now.
19141 MachineBasicBlock *
19142 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
19143 MachineBasicBlock *BB) const {
19144 // This is pretty easy. We're taking the value that we received from
19145 // our load from the relocation, sticking it in either RDI (x86-64)
19146 // or EAX and doing an indirect call. The return value will then
19147 // be in the normal return register.
19148 MachineFunction *F = BB->getParent();
19149 const X86InstrInfo *TII =
19150 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
19151 DebugLoc DL = MI->getDebugLoc();
19153 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
19154 assert(MI->getOperand(3).isGlobal() && "This should be a global");
19156 // Get a register mask for the lowered call.
19157 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
19158 // proper register mask.
19159 const uint32_t *RegMask = F->getTarget()
19160 .getSubtargetImpl()
19161 ->getRegisterInfo()
19162 ->getCallPreservedMask(CallingConv::C);
19163 if (Subtarget->is64Bit()) {
19164 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19165 TII->get(X86::MOV64rm), X86::RDI)
19167 .addImm(0).addReg(0)
19168 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19169 MI->getOperand(3).getTargetFlags())
19171 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
19172 addDirectMem(MIB, X86::RDI);
19173 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
19174 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
19175 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19176 TII->get(X86::MOV32rm), X86::EAX)
19178 .addImm(0).addReg(0)
19179 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19180 MI->getOperand(3).getTargetFlags())
19182 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19183 addDirectMem(MIB, X86::EAX);
19184 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19186 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19187 TII->get(X86::MOV32rm), X86::EAX)
19188 .addReg(TII->getGlobalBaseReg(F))
19189 .addImm(0).addReg(0)
19190 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19191 MI->getOperand(3).getTargetFlags())
19193 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19194 addDirectMem(MIB, X86::EAX);
19195 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19198 MI->eraseFromParent(); // The pseudo instruction is gone now.
19202 MachineBasicBlock *
19203 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
19204 MachineBasicBlock *MBB) const {
19205 DebugLoc DL = MI->getDebugLoc();
19206 MachineFunction *MF = MBB->getParent();
19207 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19208 MachineRegisterInfo &MRI = MF->getRegInfo();
19210 const BasicBlock *BB = MBB->getBasicBlock();
19211 MachineFunction::iterator I = MBB;
19214 // Memory Reference
19215 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19216 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19219 unsigned MemOpndSlot = 0;
19221 unsigned CurOp = 0;
19223 DstReg = MI->getOperand(CurOp++).getReg();
19224 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
19225 assert(RC->hasType(MVT::i32) && "Invalid destination!");
19226 unsigned mainDstReg = MRI.createVirtualRegister(RC);
19227 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
19229 MemOpndSlot = CurOp;
19231 MVT PVT = getPointerTy();
19232 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19233 "Invalid Pointer Size!");
19235 // For v = setjmp(buf), we generate
19238 // buf[LabelOffset] = restoreMBB
19239 // SjLjSetup restoreMBB
19245 // v = phi(main, restore)
19250 MachineBasicBlock *thisMBB = MBB;
19251 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19252 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19253 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
19254 MF->insert(I, mainMBB);
19255 MF->insert(I, sinkMBB);
19256 MF->push_back(restoreMBB);
19258 MachineInstrBuilder MIB;
19260 // Transfer the remainder of BB and its successor edges to sinkMBB.
19261 sinkMBB->splice(sinkMBB->begin(), MBB,
19262 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19263 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19266 unsigned PtrStoreOpc = 0;
19267 unsigned LabelReg = 0;
19268 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19269 Reloc::Model RM = MF->getTarget().getRelocationModel();
19270 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
19271 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
19273 // Prepare IP either in reg or imm.
19274 if (!UseImmLabel) {
19275 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
19276 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
19277 LabelReg = MRI.createVirtualRegister(PtrRC);
19278 if (Subtarget->is64Bit()) {
19279 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
19283 .addMBB(restoreMBB)
19286 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
19287 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
19288 .addReg(XII->getGlobalBaseReg(MF))
19291 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
19295 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
19297 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
19298 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19299 if (i == X86::AddrDisp)
19300 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
19302 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
19305 MIB.addReg(LabelReg);
19307 MIB.addMBB(restoreMBB);
19308 MIB.setMemRefs(MMOBegin, MMOEnd);
19310 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
19311 .addMBB(restoreMBB);
19313 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19314 MF->getSubtarget().getRegisterInfo());
19315 MIB.addRegMask(RegInfo->getNoPreservedMask());
19316 thisMBB->addSuccessor(mainMBB);
19317 thisMBB->addSuccessor(restoreMBB);
19321 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
19322 mainMBB->addSuccessor(sinkMBB);
19325 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19326 TII->get(X86::PHI), DstReg)
19327 .addReg(mainDstReg).addMBB(mainMBB)
19328 .addReg(restoreDstReg).addMBB(restoreMBB);
19331 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
19332 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
19333 restoreMBB->addSuccessor(sinkMBB);
19335 MI->eraseFromParent();
19339 MachineBasicBlock *
19340 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
19341 MachineBasicBlock *MBB) const {
19342 DebugLoc DL = MI->getDebugLoc();
19343 MachineFunction *MF = MBB->getParent();
19344 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19345 MachineRegisterInfo &MRI = MF->getRegInfo();
19347 // Memory Reference
19348 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19349 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19351 MVT PVT = getPointerTy();
19352 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19353 "Invalid Pointer Size!");
19355 const TargetRegisterClass *RC =
19356 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
19357 unsigned Tmp = MRI.createVirtualRegister(RC);
19358 // Since FP is only updated here but NOT referenced, it's treated as GPR.
19359 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19360 MF->getSubtarget().getRegisterInfo());
19361 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
19362 unsigned SP = RegInfo->getStackRegister();
19364 MachineInstrBuilder MIB;
19366 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19367 const int64_t SPOffset = 2 * PVT.getStoreSize();
19369 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
19370 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
19373 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
19374 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
19375 MIB.addOperand(MI->getOperand(i));
19376 MIB.setMemRefs(MMOBegin, MMOEnd);
19378 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
19379 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19380 if (i == X86::AddrDisp)
19381 MIB.addDisp(MI->getOperand(i), LabelOffset);
19383 MIB.addOperand(MI->getOperand(i));
19385 MIB.setMemRefs(MMOBegin, MMOEnd);
19387 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
19388 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19389 if (i == X86::AddrDisp)
19390 MIB.addDisp(MI->getOperand(i), SPOffset);
19392 MIB.addOperand(MI->getOperand(i));
19394 MIB.setMemRefs(MMOBegin, MMOEnd);
19396 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
19398 MI->eraseFromParent();
19402 // Replace 213-type (isel default) FMA3 instructions with 231-type for
19403 // accumulator loops. Writing back to the accumulator allows the coalescer
19404 // to remove extra copies in the loop.
19405 MachineBasicBlock *
19406 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
19407 MachineBasicBlock *MBB) const {
19408 MachineOperand &AddendOp = MI->getOperand(3);
19410 // Bail out early if the addend isn't a register - we can't switch these.
19411 if (!AddendOp.isReg())
19414 MachineFunction &MF = *MBB->getParent();
19415 MachineRegisterInfo &MRI = MF.getRegInfo();
19417 // Check whether the addend is defined by a PHI:
19418 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
19419 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
19420 if (!AddendDef.isPHI())
19423 // Look for the following pattern:
19425 // %addend = phi [%entry, 0], [%loop, %result]
19427 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
19431 // %addend = phi [%entry, 0], [%loop, %result]
19433 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
19435 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
19436 assert(AddendDef.getOperand(i).isReg());
19437 MachineOperand PHISrcOp = AddendDef.getOperand(i);
19438 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
19439 if (&PHISrcInst == MI) {
19440 // Found a matching instruction.
19441 unsigned NewFMAOpc = 0;
19442 switch (MI->getOpcode()) {
19443 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
19444 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
19445 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
19446 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
19447 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
19448 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
19449 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
19450 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
19451 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
19452 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
19453 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
19454 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
19455 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
19456 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
19457 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
19458 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
19459 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
19460 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
19461 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
19462 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
19463 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
19464 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
19465 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
19466 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
19467 default: llvm_unreachable("Unrecognized FMA variant.");
19470 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
19471 MachineInstrBuilder MIB =
19472 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
19473 .addOperand(MI->getOperand(0))
19474 .addOperand(MI->getOperand(3))
19475 .addOperand(MI->getOperand(2))
19476 .addOperand(MI->getOperand(1));
19477 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
19478 MI->eraseFromParent();
19485 MachineBasicBlock *
19486 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
19487 MachineBasicBlock *BB) const {
19488 switch (MI->getOpcode()) {
19489 default: llvm_unreachable("Unexpected instr type to insert");
19490 case X86::TAILJMPd64:
19491 case X86::TAILJMPr64:
19492 case X86::TAILJMPm64:
19493 llvm_unreachable("TAILJMP64 would not be touched here.");
19494 case X86::TCRETURNdi64:
19495 case X86::TCRETURNri64:
19496 case X86::TCRETURNmi64:
19498 case X86::WIN_ALLOCA:
19499 return EmitLoweredWinAlloca(MI, BB);
19500 case X86::SEG_ALLOCA_32:
19501 return EmitLoweredSegAlloca(MI, BB, false);
19502 case X86::SEG_ALLOCA_64:
19503 return EmitLoweredSegAlloca(MI, BB, true);
19504 case X86::TLSCall_32:
19505 case X86::TLSCall_64:
19506 return EmitLoweredTLSCall(MI, BB);
19507 case X86::CMOV_GR8:
19508 case X86::CMOV_FR32:
19509 case X86::CMOV_FR64:
19510 case X86::CMOV_V4F32:
19511 case X86::CMOV_V2F64:
19512 case X86::CMOV_V2I64:
19513 case X86::CMOV_V8F32:
19514 case X86::CMOV_V4F64:
19515 case X86::CMOV_V4I64:
19516 case X86::CMOV_V16F32:
19517 case X86::CMOV_V8F64:
19518 case X86::CMOV_V8I64:
19519 case X86::CMOV_GR16:
19520 case X86::CMOV_GR32:
19521 case X86::CMOV_RFP32:
19522 case X86::CMOV_RFP64:
19523 case X86::CMOV_RFP80:
19524 return EmitLoweredSelect(MI, BB);
19526 case X86::FP32_TO_INT16_IN_MEM:
19527 case X86::FP32_TO_INT32_IN_MEM:
19528 case X86::FP32_TO_INT64_IN_MEM:
19529 case X86::FP64_TO_INT16_IN_MEM:
19530 case X86::FP64_TO_INT32_IN_MEM:
19531 case X86::FP64_TO_INT64_IN_MEM:
19532 case X86::FP80_TO_INT16_IN_MEM:
19533 case X86::FP80_TO_INT32_IN_MEM:
19534 case X86::FP80_TO_INT64_IN_MEM: {
19535 MachineFunction *F = BB->getParent();
19536 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
19537 DebugLoc DL = MI->getDebugLoc();
19539 // Change the floating point control register to use "round towards zero"
19540 // mode when truncating to an integer value.
19541 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
19542 addFrameReference(BuildMI(*BB, MI, DL,
19543 TII->get(X86::FNSTCW16m)), CWFrameIdx);
19545 // Load the old value of the high byte of the control word...
19547 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
19548 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
19551 // Set the high part to be round to zero...
19552 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
19555 // Reload the modified control word now...
19556 addFrameReference(BuildMI(*BB, MI, DL,
19557 TII->get(X86::FLDCW16m)), CWFrameIdx);
19559 // Restore the memory image of control word to original value
19560 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
19563 // Get the X86 opcode to use.
19565 switch (MI->getOpcode()) {
19566 default: llvm_unreachable("illegal opcode!");
19567 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
19568 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
19569 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
19570 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
19571 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
19572 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
19573 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
19574 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
19575 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
19579 MachineOperand &Op = MI->getOperand(0);
19581 AM.BaseType = X86AddressMode::RegBase;
19582 AM.Base.Reg = Op.getReg();
19584 AM.BaseType = X86AddressMode::FrameIndexBase;
19585 AM.Base.FrameIndex = Op.getIndex();
19587 Op = MI->getOperand(1);
19589 AM.Scale = Op.getImm();
19590 Op = MI->getOperand(2);
19592 AM.IndexReg = Op.getImm();
19593 Op = MI->getOperand(3);
19594 if (Op.isGlobal()) {
19595 AM.GV = Op.getGlobal();
19597 AM.Disp = Op.getImm();
19599 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
19600 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
19602 // Reload the original control word now.
19603 addFrameReference(BuildMI(*BB, MI, DL,
19604 TII->get(X86::FLDCW16m)), CWFrameIdx);
19606 MI->eraseFromParent(); // The pseudo instruction is gone now.
19609 // String/text processing lowering.
19610 case X86::PCMPISTRM128REG:
19611 case X86::VPCMPISTRM128REG:
19612 case X86::PCMPISTRM128MEM:
19613 case X86::VPCMPISTRM128MEM:
19614 case X86::PCMPESTRM128REG:
19615 case X86::VPCMPESTRM128REG:
19616 case X86::PCMPESTRM128MEM:
19617 case X86::VPCMPESTRM128MEM:
19618 assert(Subtarget->hasSSE42() &&
19619 "Target must have SSE4.2 or AVX features enabled");
19620 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19622 // String/text processing lowering.
19623 case X86::PCMPISTRIREG:
19624 case X86::VPCMPISTRIREG:
19625 case X86::PCMPISTRIMEM:
19626 case X86::VPCMPISTRIMEM:
19627 case X86::PCMPESTRIREG:
19628 case X86::VPCMPESTRIREG:
19629 case X86::PCMPESTRIMEM:
19630 case X86::VPCMPESTRIMEM:
19631 assert(Subtarget->hasSSE42() &&
19632 "Target must have SSE4.2 or AVX features enabled");
19633 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19635 // Thread synchronization.
19637 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
19642 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19644 case X86::VASTART_SAVE_XMM_REGS:
19645 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
19647 case X86::VAARG_64:
19648 return EmitVAARG64WithCustomInserter(MI, BB);
19650 case X86::EH_SjLj_SetJmp32:
19651 case X86::EH_SjLj_SetJmp64:
19652 return emitEHSjLjSetJmp(MI, BB);
19654 case X86::EH_SjLj_LongJmp32:
19655 case X86::EH_SjLj_LongJmp64:
19656 return emitEHSjLjLongJmp(MI, BB);
19658 case TargetOpcode::STACKMAP:
19659 case TargetOpcode::PATCHPOINT:
19660 return emitPatchPoint(MI, BB);
19662 case X86::VFMADDPDr213r:
19663 case X86::VFMADDPSr213r:
19664 case X86::VFMADDSDr213r:
19665 case X86::VFMADDSSr213r:
19666 case X86::VFMSUBPDr213r:
19667 case X86::VFMSUBPSr213r:
19668 case X86::VFMSUBSDr213r:
19669 case X86::VFMSUBSSr213r:
19670 case X86::VFNMADDPDr213r:
19671 case X86::VFNMADDPSr213r:
19672 case X86::VFNMADDSDr213r:
19673 case X86::VFNMADDSSr213r:
19674 case X86::VFNMSUBPDr213r:
19675 case X86::VFNMSUBPSr213r:
19676 case X86::VFNMSUBSDr213r:
19677 case X86::VFNMSUBSSr213r:
19678 case X86::VFMADDPDr213rY:
19679 case X86::VFMADDPSr213rY:
19680 case X86::VFMSUBPDr213rY:
19681 case X86::VFMSUBPSr213rY:
19682 case X86::VFNMADDPDr213rY:
19683 case X86::VFNMADDPSr213rY:
19684 case X86::VFNMSUBPDr213rY:
19685 case X86::VFNMSUBPSr213rY:
19686 return emitFMA3Instr(MI, BB);
19690 //===----------------------------------------------------------------------===//
19691 // X86 Optimization Hooks
19692 //===----------------------------------------------------------------------===//
19694 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
19697 const SelectionDAG &DAG,
19698 unsigned Depth) const {
19699 unsigned BitWidth = KnownZero.getBitWidth();
19700 unsigned Opc = Op.getOpcode();
19701 assert((Opc >= ISD::BUILTIN_OP_END ||
19702 Opc == ISD::INTRINSIC_WO_CHAIN ||
19703 Opc == ISD::INTRINSIC_W_CHAIN ||
19704 Opc == ISD::INTRINSIC_VOID) &&
19705 "Should use MaskedValueIsZero if you don't know whether Op"
19706 " is a target node!");
19708 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
19722 // These nodes' second result is a boolean.
19723 if (Op.getResNo() == 0)
19726 case X86ISD::SETCC:
19727 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
19729 case ISD::INTRINSIC_WO_CHAIN: {
19730 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
19731 unsigned NumLoBits = 0;
19734 case Intrinsic::x86_sse_movmsk_ps:
19735 case Intrinsic::x86_avx_movmsk_ps_256:
19736 case Intrinsic::x86_sse2_movmsk_pd:
19737 case Intrinsic::x86_avx_movmsk_pd_256:
19738 case Intrinsic::x86_mmx_pmovmskb:
19739 case Intrinsic::x86_sse2_pmovmskb_128:
19740 case Intrinsic::x86_avx2_pmovmskb: {
19741 // High bits of movmskp{s|d}, pmovmskb are known zero.
19743 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
19744 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
19745 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
19746 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
19747 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
19748 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
19749 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
19750 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
19752 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
19761 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
19763 const SelectionDAG &,
19764 unsigned Depth) const {
19765 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
19766 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
19767 return Op.getValueType().getScalarType().getSizeInBits();
19773 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
19774 /// node is a GlobalAddress + offset.
19775 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
19776 const GlobalValue* &GA,
19777 int64_t &Offset) const {
19778 if (N->getOpcode() == X86ISD::Wrapper) {
19779 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
19780 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
19781 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
19785 return TargetLowering::isGAPlusOffset(N, GA, Offset);
19788 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
19789 /// same as extracting the high 128-bit part of 256-bit vector and then
19790 /// inserting the result into the low part of a new 256-bit vector
19791 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
19792 EVT VT = SVOp->getValueType(0);
19793 unsigned NumElems = VT.getVectorNumElements();
19795 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19796 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
19797 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19798 SVOp->getMaskElt(j) >= 0)
19804 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
19805 /// same as extracting the low 128-bit part of 256-bit vector and then
19806 /// inserting the result into the high part of a new 256-bit vector
19807 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
19808 EVT VT = SVOp->getValueType(0);
19809 unsigned NumElems = VT.getVectorNumElements();
19811 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19812 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
19813 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19814 SVOp->getMaskElt(j) >= 0)
19820 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
19821 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
19822 TargetLowering::DAGCombinerInfo &DCI,
19823 const X86Subtarget* Subtarget) {
19825 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19826 SDValue V1 = SVOp->getOperand(0);
19827 SDValue V2 = SVOp->getOperand(1);
19828 EVT VT = SVOp->getValueType(0);
19829 unsigned NumElems = VT.getVectorNumElements();
19831 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
19832 V2.getOpcode() == ISD::CONCAT_VECTORS) {
19836 // V UNDEF BUILD_VECTOR UNDEF
19838 // CONCAT_VECTOR CONCAT_VECTOR
19841 // RESULT: V + zero extended
19843 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
19844 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
19845 V1.getOperand(1).getOpcode() != ISD::UNDEF)
19848 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
19851 // To match the shuffle mask, the first half of the mask should
19852 // be exactly the first vector, and all the rest a splat with the
19853 // first element of the second one.
19854 for (unsigned i = 0; i != NumElems/2; ++i)
19855 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
19856 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
19859 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
19860 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
19861 if (Ld->hasNUsesOfValue(1, 0)) {
19862 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
19863 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
19865 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
19867 Ld->getPointerInfo(),
19868 Ld->getAlignment(),
19869 false/*isVolatile*/, true/*ReadMem*/,
19870 false/*WriteMem*/);
19872 // Make sure the newly-created LOAD is in the same position as Ld in
19873 // terms of dependency. We create a TokenFactor for Ld and ResNode,
19874 // and update uses of Ld's output chain to use the TokenFactor.
19875 if (Ld->hasAnyUseOfValue(1)) {
19876 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
19877 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
19878 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
19879 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
19880 SDValue(ResNode.getNode(), 1));
19883 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
19887 // Emit a zeroed vector and insert the desired subvector on its
19889 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
19890 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
19891 return DCI.CombineTo(N, InsV);
19894 //===--------------------------------------------------------------------===//
19895 // Combine some shuffles into subvector extracts and inserts:
19898 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19899 if (isShuffleHigh128VectorInsertLow(SVOp)) {
19900 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
19901 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
19902 return DCI.CombineTo(N, InsV);
19905 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19906 if (isShuffleLow128VectorInsertHigh(SVOp)) {
19907 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
19908 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
19909 return DCI.CombineTo(N, InsV);
19915 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
19918 /// This is the leaf of the recursive combinine below. When we have found some
19919 /// chain of single-use x86 shuffle instructions and accumulated the combined
19920 /// shuffle mask represented by them, this will try to pattern match that mask
19921 /// into either a single instruction if there is a special purpose instruction
19922 /// for this operation, or into a PSHUFB instruction which is a fully general
19923 /// instruction but should only be used to replace chains over a certain depth.
19924 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
19925 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
19926 TargetLowering::DAGCombinerInfo &DCI,
19927 const X86Subtarget *Subtarget) {
19928 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
19930 // Find the operand that enters the chain. Note that multiple uses are OK
19931 // here, we're not going to remove the operand we find.
19932 SDValue Input = Op.getOperand(0);
19933 while (Input.getOpcode() == ISD::BITCAST)
19934 Input = Input.getOperand(0);
19936 MVT VT = Input.getSimpleValueType();
19937 MVT RootVT = Root.getSimpleValueType();
19940 // Just remove no-op shuffle masks.
19941 if (Mask.size() == 1) {
19942 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
19947 // Use the float domain if the operand type is a floating point type.
19948 bool FloatDomain = VT.isFloatingPoint();
19950 // For floating point shuffles, we don't have free copies in the shuffle
19951 // instructions or the ability to load as part of the instruction, so
19952 // canonicalize their shuffles to UNPCK or MOV variants.
19954 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
19955 // vectors because it can have a load folded into it that UNPCK cannot. This
19956 // doesn't preclude something switching to the shorter encoding post-RA.
19958 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
19959 bool Lo = Mask.equals(0, 0);
19962 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
19963 // is no slower than UNPCKLPD but has the option to fold the input operand
19964 // into even an unaligned memory load.
19965 if (Lo && Subtarget->hasSSE3()) {
19966 Shuffle = X86ISD::MOVDDUP;
19967 ShuffleVT = MVT::v2f64;
19969 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
19970 // than the UNPCK variants.
19971 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
19972 ShuffleVT = MVT::v4f32;
19974 if (Depth == 1 && Root->getOpcode() == Shuffle)
19975 return false; // Nothing to do!
19976 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19977 DCI.AddToWorklist(Op.getNode());
19978 if (Shuffle == X86ISD::MOVDDUP)
19979 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19981 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19982 DCI.AddToWorklist(Op.getNode());
19983 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19987 if (Subtarget->hasSSE3() &&
19988 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
19989 bool Lo = Mask.equals(0, 0, 2, 2);
19990 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
19991 MVT ShuffleVT = MVT::v4f32;
19992 if (Depth == 1 && Root->getOpcode() == Shuffle)
19993 return false; // Nothing to do!
19994 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19995 DCI.AddToWorklist(Op.getNode());
19996 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19997 DCI.AddToWorklist(Op.getNode());
19998 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20002 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
20003 bool Lo = Mask.equals(0, 0, 1, 1);
20004 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20005 MVT ShuffleVT = MVT::v4f32;
20006 if (Depth == 1 && Root->getOpcode() == Shuffle)
20007 return false; // Nothing to do!
20008 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20009 DCI.AddToWorklist(Op.getNode());
20010 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20011 DCI.AddToWorklist(Op.getNode());
20012 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20018 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
20019 // variants as none of these have single-instruction variants that are
20020 // superior to the UNPCK formulation.
20021 if (!FloatDomain &&
20022 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
20023 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
20024 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
20025 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
20027 bool Lo = Mask[0] == 0;
20028 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20029 if (Depth == 1 && Root->getOpcode() == Shuffle)
20030 return false; // Nothing to do!
20032 switch (Mask.size()) {
20034 ShuffleVT = MVT::v8i16;
20037 ShuffleVT = MVT::v16i8;
20040 llvm_unreachable("Impossible mask size!");
20042 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20043 DCI.AddToWorklist(Op.getNode());
20044 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20045 DCI.AddToWorklist(Op.getNode());
20046 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20051 // Don't try to re-form single instruction chains under any circumstances now
20052 // that we've done encoding canonicalization for them.
20056 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
20057 // can replace them with a single PSHUFB instruction profitably. Intel's
20058 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
20059 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
20060 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
20061 SmallVector<SDValue, 16> PSHUFBMask;
20062 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
20063 int Ratio = 16 / Mask.size();
20064 for (unsigned i = 0; i < 16; ++i) {
20065 int M = Mask[i / Ratio] != SM_SentinelZero
20066 ? Ratio * Mask[i / Ratio] + i % Ratio
20068 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
20070 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
20071 DCI.AddToWorklist(Op.getNode());
20072 SDValue PSHUFBMaskOp =
20073 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
20074 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
20075 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
20076 DCI.AddToWorklist(Op.getNode());
20077 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20082 // Failed to find any combines.
20086 /// \brief Fully generic combining of x86 shuffle instructions.
20088 /// This should be the last combine run over the x86 shuffle instructions. Once
20089 /// they have been fully optimized, this will recursively consider all chains
20090 /// of single-use shuffle instructions, build a generic model of the cumulative
20091 /// shuffle operation, and check for simpler instructions which implement this
20092 /// operation. We use this primarily for two purposes:
20094 /// 1) Collapse generic shuffles to specialized single instructions when
20095 /// equivalent. In most cases, this is just an encoding size win, but
20096 /// sometimes we will collapse multiple generic shuffles into a single
20097 /// special-purpose shuffle.
20098 /// 2) Look for sequences of shuffle instructions with 3 or more total
20099 /// instructions, and replace them with the slightly more expensive SSSE3
20100 /// PSHUFB instruction if available. We do this as the last combining step
20101 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
20102 /// a suitable short sequence of other instructions. The PHUFB will either
20103 /// use a register or have to read from memory and so is slightly (but only
20104 /// slightly) more expensive than the other shuffle instructions.
20106 /// Because this is inherently a quadratic operation (for each shuffle in
20107 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
20108 /// This should never be an issue in practice as the shuffle lowering doesn't
20109 /// produce sequences of more than 8 instructions.
20111 /// FIXME: We will currently miss some cases where the redundant shuffling
20112 /// would simplify under the threshold for PSHUFB formation because of
20113 /// combine-ordering. To fix this, we should do the redundant instruction
20114 /// combining in this recursive walk.
20115 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
20116 ArrayRef<int> RootMask,
20117 int Depth, bool HasPSHUFB,
20119 TargetLowering::DAGCombinerInfo &DCI,
20120 const X86Subtarget *Subtarget) {
20121 // Bound the depth of our recursive combine because this is ultimately
20122 // quadratic in nature.
20126 // Directly rip through bitcasts to find the underlying operand.
20127 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
20128 Op = Op.getOperand(0);
20130 MVT VT = Op.getSimpleValueType();
20131 if (!VT.isVector())
20132 return false; // Bail if we hit a non-vector.
20133 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
20134 // version should be added.
20135 if (VT.getSizeInBits() != 128)
20138 assert(Root.getSimpleValueType().isVector() &&
20139 "Shuffles operate on vector types!");
20140 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
20141 "Can only combine shuffles of the same vector register size.");
20143 if (!isTargetShuffle(Op.getOpcode()))
20145 SmallVector<int, 16> OpMask;
20147 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
20148 // We only can combine unary shuffles which we can decode the mask for.
20149 if (!HaveMask || !IsUnary)
20152 assert(VT.getVectorNumElements() == OpMask.size() &&
20153 "Different mask size from vector size!");
20154 assert(((RootMask.size() > OpMask.size() &&
20155 RootMask.size() % OpMask.size() == 0) ||
20156 (OpMask.size() > RootMask.size() &&
20157 OpMask.size() % RootMask.size() == 0) ||
20158 OpMask.size() == RootMask.size()) &&
20159 "The smaller number of elements must divide the larger.");
20160 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20161 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20162 assert(((RootRatio == 1 && OpRatio == 1) ||
20163 (RootRatio == 1) != (OpRatio == 1)) &&
20164 "Must not have a ratio for both incoming and op masks!");
20166 SmallVector<int, 16> Mask;
20167 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
20169 // Merge this shuffle operation's mask into our accumulated mask. Note that
20170 // this shuffle's mask will be the first applied to the input, followed by the
20171 // root mask to get us all the way to the root value arrangement. The reason
20172 // for this order is that we are recursing up the operation chain.
20173 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
20174 int RootIdx = i / RootRatio;
20175 if (RootMask[RootIdx] == SM_SentinelZero) {
20176 // This is a zero-ed lane, we're done.
20177 Mask.push_back(SM_SentinelZero);
20181 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
20182 int OpIdx = RootMaskedIdx / OpRatio;
20183 if (OpMask[OpIdx] == SM_SentinelZero) {
20184 // The incoming lanes are zero, it doesn't matter which ones we are using.
20185 Mask.push_back(SM_SentinelZero);
20189 // Ok, we have non-zero lanes, map them through.
20190 Mask.push_back(OpMask[OpIdx] * OpRatio +
20191 RootMaskedIdx % OpRatio);
20194 // See if we can recurse into the operand to combine more things.
20195 switch (Op.getOpcode()) {
20196 case X86ISD::PSHUFB:
20198 case X86ISD::PSHUFD:
20199 case X86ISD::PSHUFHW:
20200 case X86ISD::PSHUFLW:
20201 if (Op.getOperand(0).hasOneUse() &&
20202 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20203 HasPSHUFB, DAG, DCI, Subtarget))
20207 case X86ISD::UNPCKL:
20208 case X86ISD::UNPCKH:
20209 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
20210 // We can't check for single use, we have to check that this shuffle is the only user.
20211 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
20212 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20213 HasPSHUFB, DAG, DCI, Subtarget))
20218 // Minor canonicalization of the accumulated shuffle mask to make it easier
20219 // to match below. All this does is detect masks with squential pairs of
20220 // elements, and shrink them to the half-width mask. It does this in a loop
20221 // so it will reduce the size of the mask to the minimal width mask which
20222 // performs an equivalent shuffle.
20223 while (Mask.size() > 1 && canWidenShuffleElements(Mask)) {
20224 for (int i = 0, e = Mask.size() / 2; i < e; ++i)
20225 Mask[i] = Mask[2 * i] / 2;
20226 Mask.resize(Mask.size() / 2);
20229 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
20233 /// \brief Get the PSHUF-style mask from PSHUF node.
20235 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
20236 /// PSHUF-style masks that can be reused with such instructions.
20237 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
20238 SmallVector<int, 4> Mask;
20240 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
20244 switch (N.getOpcode()) {
20245 case X86ISD::PSHUFD:
20247 case X86ISD::PSHUFLW:
20250 case X86ISD::PSHUFHW:
20251 Mask.erase(Mask.begin(), Mask.begin() + 4);
20252 for (int &M : Mask)
20256 llvm_unreachable("No valid shuffle instruction found!");
20260 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
20262 /// We walk up the chain and look for a combinable shuffle, skipping over
20263 /// shuffles that we could hoist this shuffle's transformation past without
20264 /// altering anything.
20266 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
20268 TargetLowering::DAGCombinerInfo &DCI) {
20269 assert(N.getOpcode() == X86ISD::PSHUFD &&
20270 "Called with something other than an x86 128-bit half shuffle!");
20273 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
20274 // of the shuffles in the chain so that we can form a fresh chain to replace
20276 SmallVector<SDValue, 8> Chain;
20277 SDValue V = N.getOperand(0);
20278 for (; V.hasOneUse(); V = V.getOperand(0)) {
20279 switch (V.getOpcode()) {
20281 return SDValue(); // Nothing combined!
20284 // Skip bitcasts as we always know the type for the target specific
20288 case X86ISD::PSHUFD:
20289 // Found another dword shuffle.
20292 case X86ISD::PSHUFLW:
20293 // Check that the low words (being shuffled) are the identity in the
20294 // dword shuffle, and the high words are self-contained.
20295 if (Mask[0] != 0 || Mask[1] != 1 ||
20296 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
20299 Chain.push_back(V);
20302 case X86ISD::PSHUFHW:
20303 // Check that the high words (being shuffled) are the identity in the
20304 // dword shuffle, and the low words are self-contained.
20305 if (Mask[2] != 2 || Mask[3] != 3 ||
20306 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
20309 Chain.push_back(V);
20312 case X86ISD::UNPCKL:
20313 case X86ISD::UNPCKH:
20314 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
20315 // shuffle into a preceding word shuffle.
20316 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
20319 // Search for a half-shuffle which we can combine with.
20320 unsigned CombineOp =
20321 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
20322 if (V.getOperand(0) != V.getOperand(1) ||
20323 !V->isOnlyUserOf(V.getOperand(0).getNode()))
20325 Chain.push_back(V);
20326 V = V.getOperand(0);
20328 switch (V.getOpcode()) {
20330 return SDValue(); // Nothing to combine.
20332 case X86ISD::PSHUFLW:
20333 case X86ISD::PSHUFHW:
20334 if (V.getOpcode() == CombineOp)
20337 Chain.push_back(V);
20341 V = V.getOperand(0);
20345 } while (V.hasOneUse());
20348 // Break out of the loop if we break out of the switch.
20352 if (!V.hasOneUse())
20353 // We fell out of the loop without finding a viable combining instruction.
20356 // Merge this node's mask and our incoming mask.
20357 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20358 for (int &M : Mask)
20360 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
20361 getV4X86ShuffleImm8ForMask(Mask, DAG));
20363 // Rebuild the chain around this new shuffle.
20364 while (!Chain.empty()) {
20365 SDValue W = Chain.pop_back_val();
20367 if (V.getValueType() != W.getOperand(0).getValueType())
20368 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
20370 switch (W.getOpcode()) {
20372 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
20374 case X86ISD::UNPCKL:
20375 case X86ISD::UNPCKH:
20376 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
20379 case X86ISD::PSHUFD:
20380 case X86ISD::PSHUFLW:
20381 case X86ISD::PSHUFHW:
20382 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
20386 if (V.getValueType() != N.getValueType())
20387 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
20389 // Return the new chain to replace N.
20393 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
20395 /// We walk up the chain, skipping shuffles of the other half and looking
20396 /// through shuffles which switch halves trying to find a shuffle of the same
20397 /// pair of dwords.
20398 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
20400 TargetLowering::DAGCombinerInfo &DCI) {
20402 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
20403 "Called with something other than an x86 128-bit half shuffle!");
20405 unsigned CombineOpcode = N.getOpcode();
20407 // Walk up a single-use chain looking for a combinable shuffle.
20408 SDValue V = N.getOperand(0);
20409 for (; V.hasOneUse(); V = V.getOperand(0)) {
20410 switch (V.getOpcode()) {
20412 return false; // Nothing combined!
20415 // Skip bitcasts as we always know the type for the target specific
20419 case X86ISD::PSHUFLW:
20420 case X86ISD::PSHUFHW:
20421 if (V.getOpcode() == CombineOpcode)
20424 // Other-half shuffles are no-ops.
20427 // Break out of the loop if we break out of the switch.
20431 if (!V.hasOneUse())
20432 // We fell out of the loop without finding a viable combining instruction.
20435 // Combine away the bottom node as its shuffle will be accumulated into
20436 // a preceding shuffle.
20437 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20439 // Record the old value.
20442 // Merge this node's mask and our incoming mask (adjusted to account for all
20443 // the pshufd instructions encountered).
20444 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20445 for (int &M : Mask)
20447 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
20448 getV4X86ShuffleImm8ForMask(Mask, DAG));
20450 // Check that the shuffles didn't cancel each other out. If not, we need to
20451 // combine to the new one.
20453 // Replace the combinable shuffle with the combined one, updating all users
20454 // so that we re-evaluate the chain here.
20455 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
20460 /// \brief Try to combine x86 target specific shuffles.
20461 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
20462 TargetLowering::DAGCombinerInfo &DCI,
20463 const X86Subtarget *Subtarget) {
20465 MVT VT = N.getSimpleValueType();
20466 SmallVector<int, 4> Mask;
20468 switch (N.getOpcode()) {
20469 case X86ISD::PSHUFD:
20470 case X86ISD::PSHUFLW:
20471 case X86ISD::PSHUFHW:
20472 Mask = getPSHUFShuffleMask(N);
20473 assert(Mask.size() == 4);
20479 // Nuke no-op shuffles that show up after combining.
20480 if (isNoopShuffleMask(Mask))
20481 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20483 // Look for simplifications involving one or two shuffle instructions.
20484 SDValue V = N.getOperand(0);
20485 switch (N.getOpcode()) {
20488 case X86ISD::PSHUFLW:
20489 case X86ISD::PSHUFHW:
20490 assert(VT == MVT::v8i16);
20493 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
20494 return SDValue(); // We combined away this shuffle, so we're done.
20496 // See if this reduces to a PSHUFD which is no more expensive and can
20497 // combine with more operations.
20498 if (canWidenShuffleElements(Mask)) {
20499 int DMask[] = {-1, -1, -1, -1};
20500 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
20501 DMask[DOffset + 0] = DOffset + Mask[0] / 2;
20502 DMask[DOffset + 1] = DOffset + Mask[2] / 2;
20503 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
20504 DCI.AddToWorklist(V.getNode());
20505 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
20506 getV4X86ShuffleImm8ForMask(DMask, DAG));
20507 DCI.AddToWorklist(V.getNode());
20508 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
20511 // Look for shuffle patterns which can be implemented as a single unpack.
20512 // FIXME: This doesn't handle the location of the PSHUFD generically, and
20513 // only works when we have a PSHUFD followed by two half-shuffles.
20514 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
20515 (V.getOpcode() == X86ISD::PSHUFLW ||
20516 V.getOpcode() == X86ISD::PSHUFHW) &&
20517 V.getOpcode() != N.getOpcode() &&
20519 SDValue D = V.getOperand(0);
20520 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
20521 D = D.getOperand(0);
20522 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
20523 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20524 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
20525 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20526 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20528 for (int i = 0; i < 4; ++i) {
20529 WordMask[i + NOffset] = Mask[i] + NOffset;
20530 WordMask[i + VOffset] = VMask[i] + VOffset;
20532 // Map the word mask through the DWord mask.
20534 for (int i = 0; i < 8; ++i)
20535 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
20536 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
20537 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
20538 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
20539 std::begin(UnpackLoMask)) ||
20540 std::equal(std::begin(MappedMask), std::end(MappedMask),
20541 std::begin(UnpackHiMask))) {
20542 // We can replace all three shuffles with an unpack.
20543 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
20544 DCI.AddToWorklist(V.getNode());
20545 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
20547 DL, MVT::v8i16, V, V);
20554 case X86ISD::PSHUFD:
20555 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
20564 /// \brief Try to combine a shuffle into a target-specific add-sub node.
20566 /// We combine this directly on the abstract vector shuffle nodes so it is
20567 /// easier to generically match. We also insert dummy vector shuffle nodes for
20568 /// the operands which explicitly discard the lanes which are unused by this
20569 /// operation to try to flow through the rest of the combiner the fact that
20570 /// they're unused.
20571 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
20573 EVT VT = N->getValueType(0);
20575 // We only handle target-independent shuffles.
20576 // FIXME: It would be easy and harmless to use the target shuffle mask
20577 // extraction tool to support more.
20578 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
20581 auto *SVN = cast<ShuffleVectorSDNode>(N);
20582 ArrayRef<int> Mask = SVN->getMask();
20583 SDValue V1 = N->getOperand(0);
20584 SDValue V2 = N->getOperand(1);
20586 // We require the first shuffle operand to be the SUB node, and the second to
20587 // be the ADD node.
20588 // FIXME: We should support the commuted patterns.
20589 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
20592 // If there are other uses of these operations we can't fold them.
20593 if (!V1->hasOneUse() || !V2->hasOneUse())
20596 // Ensure that both operations have the same operands. Note that we can
20597 // commute the FADD operands.
20598 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
20599 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
20600 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
20603 // We're looking for blends between FADD and FSUB nodes. We insist on these
20604 // nodes being lined up in a specific expected pattern.
20605 if (!(isShuffleEquivalent(Mask, 0, 3) ||
20606 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
20607 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
20610 // Only specific types are legal at this point, assert so we notice if and
20611 // when these change.
20612 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
20613 VT == MVT::v4f64) &&
20614 "Unknown vector type encountered!");
20616 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
20619 /// PerformShuffleCombine - Performs several different shuffle combines.
20620 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
20621 TargetLowering::DAGCombinerInfo &DCI,
20622 const X86Subtarget *Subtarget) {
20624 SDValue N0 = N->getOperand(0);
20625 SDValue N1 = N->getOperand(1);
20626 EVT VT = N->getValueType(0);
20628 // Don't create instructions with illegal types after legalize types has run.
20629 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20630 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
20633 // If we have legalized the vector types, look for blends of FADD and FSUB
20634 // nodes that we can fuse into an ADDSUB node.
20635 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
20636 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
20639 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
20640 if (Subtarget->hasFp256() && VT.is256BitVector() &&
20641 N->getOpcode() == ISD::VECTOR_SHUFFLE)
20642 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
20644 // During Type Legalization, when promoting illegal vector types,
20645 // the backend might introduce new shuffle dag nodes and bitcasts.
20647 // This code performs the following transformation:
20648 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
20649 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
20651 // We do this only if both the bitcast and the BINOP dag nodes have
20652 // one use. Also, perform this transformation only if the new binary
20653 // operation is legal. This is to avoid introducing dag nodes that
20654 // potentially need to be further expanded (or custom lowered) into a
20655 // less optimal sequence of dag nodes.
20656 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
20657 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
20658 N0.getOpcode() == ISD::BITCAST) {
20659 SDValue BC0 = N0.getOperand(0);
20660 EVT SVT = BC0.getValueType();
20661 unsigned Opcode = BC0.getOpcode();
20662 unsigned NumElts = VT.getVectorNumElements();
20664 if (BC0.hasOneUse() && SVT.isVector() &&
20665 SVT.getVectorNumElements() * 2 == NumElts &&
20666 TLI.isOperationLegal(Opcode, VT)) {
20667 bool CanFold = false;
20679 unsigned SVTNumElts = SVT.getVectorNumElements();
20680 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20681 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
20682 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
20683 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
20684 CanFold = SVOp->getMaskElt(i) < 0;
20687 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
20688 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
20689 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
20690 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
20695 // Only handle 128 wide vector from here on.
20696 if (!VT.is128BitVector())
20699 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
20700 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
20701 // consecutive, non-overlapping, and in the right order.
20702 SmallVector<SDValue, 16> Elts;
20703 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
20704 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
20706 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
20710 if (isTargetShuffle(N->getOpcode())) {
20712 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
20713 if (Shuffle.getNode())
20716 // Try recursively combining arbitrary sequences of x86 shuffle
20717 // instructions into higher-order shuffles. We do this after combining
20718 // specific PSHUF instruction sequences into their minimal form so that we
20719 // can evaluate how many specialized shuffle instructions are involved in
20720 // a particular chain.
20721 SmallVector<int, 1> NonceMask; // Just a placeholder.
20722 NonceMask.push_back(0);
20723 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
20724 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
20726 return SDValue(); // This routine will use CombineTo to replace N.
20732 /// PerformTruncateCombine - Converts truncate operation to
20733 /// a sequence of vector shuffle operations.
20734 /// It is possible when we truncate 256-bit vector to 128-bit vector
20735 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
20736 TargetLowering::DAGCombinerInfo &DCI,
20737 const X86Subtarget *Subtarget) {
20741 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
20742 /// specific shuffle of a load can be folded into a single element load.
20743 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
20744 /// shuffles have been customed lowered so we need to handle those here.
20745 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
20746 TargetLowering::DAGCombinerInfo &DCI) {
20747 if (DCI.isBeforeLegalizeOps())
20750 SDValue InVec = N->getOperand(0);
20751 SDValue EltNo = N->getOperand(1);
20753 if (!isa<ConstantSDNode>(EltNo))
20756 EVT VT = InVec.getValueType();
20758 if (InVec.getOpcode() == ISD::BITCAST) {
20759 // Don't duplicate a load with other uses.
20760 if (!InVec.hasOneUse())
20762 EVT BCVT = InVec.getOperand(0).getValueType();
20763 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
20765 InVec = InVec.getOperand(0);
20768 if (!isTargetShuffle(InVec.getOpcode()))
20771 // Don't duplicate a load with other uses.
20772 if (!InVec.hasOneUse())
20775 SmallVector<int, 16> ShuffleMask;
20777 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
20781 // Select the input vector, guarding against out of range extract vector.
20782 unsigned NumElems = VT.getVectorNumElements();
20783 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
20784 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
20785 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
20786 : InVec.getOperand(1);
20788 // If inputs to shuffle are the same for both ops, then allow 2 uses
20789 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
20791 if (LdNode.getOpcode() == ISD::BITCAST) {
20792 // Don't duplicate a load with other uses.
20793 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
20796 AllowedUses = 1; // only allow 1 load use if we have a bitcast
20797 LdNode = LdNode.getOperand(0);
20800 if (!ISD::isNormalLoad(LdNode.getNode()))
20803 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
20805 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
20808 EVT EltVT = N->getValueType(0);
20809 // If there's a bitcast before the shuffle, check if the load type and
20810 // alignment is valid.
20811 unsigned Align = LN0->getAlignment();
20812 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20813 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
20814 EltVT.getTypeForEVT(*DAG.getContext()));
20816 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
20819 // All checks match so transform back to vector_shuffle so that DAG combiner
20820 // can finish the job
20823 // Create shuffle node taking into account the case that its a unary shuffle
20824 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
20825 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
20826 InVec.getOperand(0), Shuffle,
20828 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
20829 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
20833 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
20834 /// generation and convert it from being a bunch of shuffles and extracts
20835 /// to a simple store and scalar loads to extract the elements.
20836 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
20837 TargetLowering::DAGCombinerInfo &DCI) {
20838 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
20839 if (NewOp.getNode())
20842 SDValue InputVector = N->getOperand(0);
20844 // Detect whether we are trying to convert from mmx to i32 and the bitcast
20845 // from mmx to v2i32 has a single usage.
20846 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
20847 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
20848 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
20849 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
20850 N->getValueType(0),
20851 InputVector.getNode()->getOperand(0));
20853 // Only operate on vectors of 4 elements, where the alternative shuffling
20854 // gets to be more expensive.
20855 if (InputVector.getValueType() != MVT::v4i32)
20858 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
20859 // single use which is a sign-extend or zero-extend, and all elements are
20861 SmallVector<SDNode *, 4> Uses;
20862 unsigned ExtractedElements = 0;
20863 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
20864 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
20865 if (UI.getUse().getResNo() != InputVector.getResNo())
20868 SDNode *Extract = *UI;
20869 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
20872 if (Extract->getValueType(0) != MVT::i32)
20874 if (!Extract->hasOneUse())
20876 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
20877 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
20879 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
20882 // Record which element was extracted.
20883 ExtractedElements |=
20884 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
20886 Uses.push_back(Extract);
20889 // If not all the elements were used, this may not be worthwhile.
20890 if (ExtractedElements != 15)
20893 // Ok, we've now decided to do the transformation.
20894 SDLoc dl(InputVector);
20896 // Store the value to a temporary stack slot.
20897 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
20898 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
20899 MachinePointerInfo(), false, false, 0);
20901 // Replace each use (extract) with a load of the appropriate element.
20902 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
20903 UE = Uses.end(); UI != UE; ++UI) {
20904 SDNode *Extract = *UI;
20906 // cOMpute the element's address.
20907 SDValue Idx = Extract->getOperand(1);
20909 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
20910 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
20911 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20912 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
20914 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
20915 StackPtr, OffsetVal);
20917 // Load the scalar.
20918 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
20919 ScalarAddr, MachinePointerInfo(),
20920 false, false, false, 0);
20922 // Replace the exact with the load.
20923 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
20926 // The replacement was made in place; don't return anything.
20930 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
20931 static std::pair<unsigned, bool>
20932 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
20933 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
20934 if (!VT.isVector())
20935 return std::make_pair(0, false);
20937 bool NeedSplit = false;
20938 switch (VT.getSimpleVT().SimpleTy) {
20939 default: return std::make_pair(0, false);
20943 if (!Subtarget->hasAVX2())
20945 if (!Subtarget->hasAVX())
20946 return std::make_pair(0, false);
20951 if (!Subtarget->hasSSE2())
20952 return std::make_pair(0, false);
20955 // SSE2 has only a small subset of the operations.
20956 bool hasUnsigned = Subtarget->hasSSE41() ||
20957 (Subtarget->hasSSE2() && VT == MVT::v16i8);
20958 bool hasSigned = Subtarget->hasSSE41() ||
20959 (Subtarget->hasSSE2() && VT == MVT::v8i16);
20961 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20964 // Check for x CC y ? x : y.
20965 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20966 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20971 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20974 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20977 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20980 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20982 // Check for x CC y ? y : x -- a min/max with reversed arms.
20983 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20984 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20989 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20992 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20995 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20998 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21002 return std::make_pair(Opc, NeedSplit);
21006 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
21007 const X86Subtarget *Subtarget) {
21009 SDValue Cond = N->getOperand(0);
21010 SDValue LHS = N->getOperand(1);
21011 SDValue RHS = N->getOperand(2);
21013 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
21014 SDValue CondSrc = Cond->getOperand(0);
21015 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
21016 Cond = CondSrc->getOperand(0);
21019 MVT VT = N->getSimpleValueType(0);
21020 MVT EltVT = VT.getVectorElementType();
21021 unsigned NumElems = VT.getVectorNumElements();
21022 // There is no blend with immediate in AVX-512.
21023 if (VT.is512BitVector())
21026 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
21028 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
21031 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
21034 // A vselect where all conditions and data are constants can be optimized into
21035 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
21036 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
21037 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
21040 unsigned MaskValue = 0;
21041 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
21044 SmallVector<int, 8> ShuffleMask(NumElems, -1);
21045 for (unsigned i = 0; i < NumElems; ++i) {
21046 // Be sure we emit undef where we can.
21047 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
21048 ShuffleMask[i] = -1;
21050 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
21053 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
21056 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
21058 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
21059 TargetLowering::DAGCombinerInfo &DCI,
21060 const X86Subtarget *Subtarget) {
21062 SDValue Cond = N->getOperand(0);
21063 // Get the LHS/RHS of the select.
21064 SDValue LHS = N->getOperand(1);
21065 SDValue RHS = N->getOperand(2);
21066 EVT VT = LHS.getValueType();
21067 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21069 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
21070 // instructions match the semantics of the common C idiom x<y?x:y but not
21071 // x<=y?x:y, because of how they handle negative zero (which can be
21072 // ignored in unsafe-math mode).
21073 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
21074 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
21075 (Subtarget->hasSSE2() ||
21076 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
21077 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21079 unsigned Opcode = 0;
21080 // Check for x CC y ? x : y.
21081 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21082 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21086 // Converting this to a min would handle NaNs incorrectly, and swapping
21087 // the operands would cause it to handle comparisons between positive
21088 // and negative zero incorrectly.
21089 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21090 if (!DAG.getTarget().Options.UnsafeFPMath &&
21091 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21093 std::swap(LHS, RHS);
21095 Opcode = X86ISD::FMIN;
21098 // Converting this to a min would handle comparisons between positive
21099 // and negative zero incorrectly.
21100 if (!DAG.getTarget().Options.UnsafeFPMath &&
21101 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21103 Opcode = X86ISD::FMIN;
21106 // Converting this to a min would handle both negative zeros and NaNs
21107 // incorrectly, but we can swap the operands to fix both.
21108 std::swap(LHS, RHS);
21112 Opcode = X86ISD::FMIN;
21116 // Converting this to a max would handle comparisons between positive
21117 // and negative zero incorrectly.
21118 if (!DAG.getTarget().Options.UnsafeFPMath &&
21119 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
21121 Opcode = X86ISD::FMAX;
21124 // Converting this to a max would handle NaNs incorrectly, and swapping
21125 // the operands would cause it to handle comparisons between positive
21126 // and negative zero incorrectly.
21127 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
21128 if (!DAG.getTarget().Options.UnsafeFPMath &&
21129 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
21131 std::swap(LHS, RHS);
21133 Opcode = X86ISD::FMAX;
21136 // Converting this to a max would handle both negative zeros and NaNs
21137 // incorrectly, but we can swap the operands to fix both.
21138 std::swap(LHS, RHS);
21142 Opcode = X86ISD::FMAX;
21145 // Check for x CC y ? y : x -- a min/max with reversed arms.
21146 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21147 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21151 // Converting this to a min would handle comparisons between positive
21152 // and negative zero incorrectly, and swapping the operands would
21153 // cause it to handle NaNs incorrectly.
21154 if (!DAG.getTarget().Options.UnsafeFPMath &&
21155 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
21156 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21158 std::swap(LHS, RHS);
21160 Opcode = X86ISD::FMIN;
21163 // Converting this to a min would handle NaNs incorrectly.
21164 if (!DAG.getTarget().Options.UnsafeFPMath &&
21165 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
21167 Opcode = X86ISD::FMIN;
21170 // Converting this to a min would handle both negative zeros and NaNs
21171 // incorrectly, but we can swap the operands to fix both.
21172 std::swap(LHS, RHS);
21176 Opcode = X86ISD::FMIN;
21180 // Converting this to a max would handle NaNs incorrectly.
21181 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21183 Opcode = X86ISD::FMAX;
21186 // Converting this to a max would handle comparisons between positive
21187 // and negative zero incorrectly, and swapping the operands would
21188 // cause it to handle NaNs incorrectly.
21189 if (!DAG.getTarget().Options.UnsafeFPMath &&
21190 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
21191 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21193 std::swap(LHS, RHS);
21195 Opcode = X86ISD::FMAX;
21198 // Converting this to a max would handle both negative zeros and NaNs
21199 // incorrectly, but we can swap the operands to fix both.
21200 std::swap(LHS, RHS);
21204 Opcode = X86ISD::FMAX;
21210 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
21213 EVT CondVT = Cond.getValueType();
21214 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
21215 CondVT.getVectorElementType() == MVT::i1) {
21216 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
21217 // lowering on KNL. In this case we convert it to
21218 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
21219 // The same situation for all 128 and 256-bit vectors of i8 and i16.
21220 // Since SKX these selects have a proper lowering.
21221 EVT OpVT = LHS.getValueType();
21222 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
21223 (OpVT.getVectorElementType() == MVT::i8 ||
21224 OpVT.getVectorElementType() == MVT::i16) &&
21225 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
21226 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
21227 DCI.AddToWorklist(Cond.getNode());
21228 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
21231 // If this is a select between two integer constants, try to do some
21233 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
21234 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
21235 // Don't do this for crazy integer types.
21236 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
21237 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
21238 // so that TrueC (the true value) is larger than FalseC.
21239 bool NeedsCondInvert = false;
21241 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
21242 // Efficiently invertible.
21243 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
21244 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
21245 isa<ConstantSDNode>(Cond.getOperand(1))))) {
21246 NeedsCondInvert = true;
21247 std::swap(TrueC, FalseC);
21250 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
21251 if (FalseC->getAPIntValue() == 0 &&
21252 TrueC->getAPIntValue().isPowerOf2()) {
21253 if (NeedsCondInvert) // Invert the condition if needed.
21254 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21255 DAG.getConstant(1, Cond.getValueType()));
21257 // Zero extend the condition if needed.
21258 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
21260 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21261 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
21262 DAG.getConstant(ShAmt, MVT::i8));
21265 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
21266 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21267 if (NeedsCondInvert) // Invert the condition if needed.
21268 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21269 DAG.getConstant(1, Cond.getValueType()));
21271 // Zero extend the condition if needed.
21272 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21273 FalseC->getValueType(0), Cond);
21274 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21275 SDValue(FalseC, 0));
21278 // Optimize cases that will turn into an LEA instruction. This requires
21279 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21280 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21281 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21282 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21284 bool isFastMultiplier = false;
21286 switch ((unsigned char)Diff) {
21288 case 1: // result = add base, cond
21289 case 2: // result = lea base( , cond*2)
21290 case 3: // result = lea base(cond, cond*2)
21291 case 4: // result = lea base( , cond*4)
21292 case 5: // result = lea base(cond, cond*4)
21293 case 8: // result = lea base( , cond*8)
21294 case 9: // result = lea base(cond, cond*8)
21295 isFastMultiplier = true;
21300 if (isFastMultiplier) {
21301 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21302 if (NeedsCondInvert) // Invert the condition if needed.
21303 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21304 DAG.getConstant(1, Cond.getValueType()));
21306 // Zero extend the condition if needed.
21307 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21309 // Scale the condition by the difference.
21311 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21312 DAG.getConstant(Diff, Cond.getValueType()));
21314 // Add the base if non-zero.
21315 if (FalseC->getAPIntValue() != 0)
21316 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21317 SDValue(FalseC, 0));
21324 // Canonicalize max and min:
21325 // (x > y) ? x : y -> (x >= y) ? x : y
21326 // (x < y) ? x : y -> (x <= y) ? x : y
21327 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
21328 // the need for an extra compare
21329 // against zero. e.g.
21330 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
21332 // testl %edi, %edi
21334 // cmovgl %edi, %eax
21338 // cmovsl %eax, %edi
21339 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
21340 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21341 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21342 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21347 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
21348 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
21349 Cond.getOperand(0), Cond.getOperand(1), NewCC);
21350 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
21355 // Early exit check
21356 if (!TLI.isTypeLegal(VT))
21359 // Match VSELECTs into subs with unsigned saturation.
21360 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21361 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
21362 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
21363 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
21364 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21366 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
21367 // left side invert the predicate to simplify logic below.
21369 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
21371 CC = ISD::getSetCCInverse(CC, true);
21372 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
21376 if (Other.getNode() && Other->getNumOperands() == 2 &&
21377 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
21378 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
21379 SDValue CondRHS = Cond->getOperand(1);
21381 // Look for a general sub with unsigned saturation first.
21382 // x >= y ? x-y : 0 --> subus x, y
21383 // x > y ? x-y : 0 --> subus x, y
21384 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
21385 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
21386 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
21388 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
21389 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
21390 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
21391 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
21392 // If the RHS is a constant we have to reverse the const
21393 // canonicalization.
21394 // x > C-1 ? x+-C : 0 --> subus x, C
21395 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
21396 CondRHSConst->getAPIntValue() ==
21397 (-OpRHSConst->getAPIntValue() - 1))
21398 return DAG.getNode(
21399 X86ISD::SUBUS, DL, VT, OpLHS,
21400 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
21402 // Another special case: If C was a sign bit, the sub has been
21403 // canonicalized into a xor.
21404 // FIXME: Would it be better to use computeKnownBits to determine
21405 // whether it's safe to decanonicalize the xor?
21406 // x s< 0 ? x^C : 0 --> subus x, C
21407 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
21408 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
21409 OpRHSConst->getAPIntValue().isSignBit())
21410 // Note that we have to rebuild the RHS constant here to ensure we
21411 // don't rely on particular values of undef lanes.
21412 return DAG.getNode(
21413 X86ISD::SUBUS, DL, VT, OpLHS,
21414 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
21419 // Try to match a min/max vector operation.
21420 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
21421 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
21422 unsigned Opc = ret.first;
21423 bool NeedSplit = ret.second;
21425 if (Opc && NeedSplit) {
21426 unsigned NumElems = VT.getVectorNumElements();
21427 // Extract the LHS vectors
21428 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
21429 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
21431 // Extract the RHS vectors
21432 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
21433 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
21435 // Create min/max for each subvector
21436 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
21437 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
21439 // Merge the result
21440 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
21442 return DAG.getNode(Opc, DL, VT, LHS, RHS);
21445 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
21446 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21447 // Check if SETCC has already been promoted
21448 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
21449 // Check that condition value type matches vselect operand type
21452 assert(Cond.getValueType().isVector() &&
21453 "vector select expects a vector selector!");
21455 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
21456 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
21458 if (!TValIsAllOnes && !FValIsAllZeros) {
21459 // Try invert the condition if true value is not all 1s and false value
21461 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
21462 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
21464 if (TValIsAllZeros || FValIsAllOnes) {
21465 SDValue CC = Cond.getOperand(2);
21466 ISD::CondCode NewCC =
21467 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
21468 Cond.getOperand(0).getValueType().isInteger());
21469 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
21470 std::swap(LHS, RHS);
21471 TValIsAllOnes = FValIsAllOnes;
21472 FValIsAllZeros = TValIsAllZeros;
21476 if (TValIsAllOnes || FValIsAllZeros) {
21479 if (TValIsAllOnes && FValIsAllZeros)
21481 else if (TValIsAllOnes)
21482 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
21483 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
21484 else if (FValIsAllZeros)
21485 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
21486 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
21488 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
21492 // Try to fold this VSELECT into a MOVSS/MOVSD
21493 if (N->getOpcode() == ISD::VSELECT &&
21494 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
21495 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
21496 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
21497 bool CanFold = false;
21498 unsigned NumElems = Cond.getNumOperands();
21502 if (isZero(Cond.getOperand(0))) {
21505 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
21506 // fold (vselect <0,-1> -> (movsd A, B)
21507 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21508 CanFold = isAllOnes(Cond.getOperand(i));
21509 } else if (isAllOnes(Cond.getOperand(0))) {
21513 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
21514 // fold (vselect <-1,0> -> (movsd B, A)
21515 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21516 CanFold = isZero(Cond.getOperand(i));
21520 if (VT == MVT::v4i32 || VT == MVT::v4f32)
21521 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
21522 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
21525 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
21526 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
21527 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
21528 // (v2i64 (bitcast B)))))
21530 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
21531 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
21532 // (v2f64 (bitcast B)))))
21534 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
21535 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
21536 // (v2i64 (bitcast A)))))
21538 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
21539 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
21540 // (v2f64 (bitcast A)))))
21542 CanFold = (isZero(Cond.getOperand(0)) &&
21543 isZero(Cond.getOperand(1)) &&
21544 isAllOnes(Cond.getOperand(2)) &&
21545 isAllOnes(Cond.getOperand(3)));
21547 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
21548 isAllOnes(Cond.getOperand(1)) &&
21549 isZero(Cond.getOperand(2)) &&
21550 isZero(Cond.getOperand(3))) {
21552 std::swap(LHS, RHS);
21556 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
21557 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
21558 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
21559 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
21561 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
21567 // If we know that this node is legal then we know that it is going to be
21568 // matched by one of the SSE/AVX BLEND instructions. These instructions only
21569 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
21570 // to simplify previous instructions.
21571 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
21572 !DCI.isBeforeLegalize() &&
21573 // We explicitly check against v8i16 and v16i16 because, although
21574 // they're marked as Custom, they might only be legal when Cond is a
21575 // build_vector of constants. This will be taken care in a later
21577 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
21578 VT != MVT::v8i16)) {
21579 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
21581 // Don't optimize vector selects that map to mask-registers.
21585 // Check all uses of that condition operand to check whether it will be
21586 // consumed by non-BLEND instructions, which may depend on all bits are set
21588 for (SDNode::use_iterator I = Cond->use_begin(),
21589 E = Cond->use_end(); I != E; ++I)
21590 if (I->getOpcode() != ISD::VSELECT)
21591 // TODO: Add other opcodes eventually lowered into BLEND.
21594 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
21595 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
21597 APInt KnownZero, KnownOne;
21598 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
21599 DCI.isBeforeLegalizeOps());
21600 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
21601 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
21602 DCI.CommitTargetLoweringOpt(TLO);
21605 // We should generate an X86ISD::BLENDI from a vselect if its argument
21606 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
21607 // constants. This specific pattern gets generated when we split a
21608 // selector for a 512 bit vector in a machine without AVX512 (but with
21609 // 256-bit vectors), during legalization:
21611 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
21613 // Iff we find this pattern and the build_vectors are built from
21614 // constants, we translate the vselect into a shuffle_vector that we
21615 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
21616 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
21617 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
21618 if (Shuffle.getNode())
21625 // Check whether a boolean test is testing a boolean value generated by
21626 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
21629 // Simplify the following patterns:
21630 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
21631 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
21632 // to (Op EFLAGS Cond)
21634 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
21635 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
21636 // to (Op EFLAGS !Cond)
21638 // where Op could be BRCOND or CMOV.
21640 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
21641 // Quit if not CMP and SUB with its value result used.
21642 if (Cmp.getOpcode() != X86ISD::CMP &&
21643 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
21646 // Quit if not used as a boolean value.
21647 if (CC != X86::COND_E && CC != X86::COND_NE)
21650 // Check CMP operands. One of them should be 0 or 1 and the other should be
21651 // an SetCC or extended from it.
21652 SDValue Op1 = Cmp.getOperand(0);
21653 SDValue Op2 = Cmp.getOperand(1);
21656 const ConstantSDNode* C = nullptr;
21657 bool needOppositeCond = (CC == X86::COND_E);
21658 bool checkAgainstTrue = false; // Is it a comparison against 1?
21660 if ((C = dyn_cast<ConstantSDNode>(Op1)))
21662 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
21664 else // Quit if all operands are not constants.
21667 if (C->getZExtValue() == 1) {
21668 needOppositeCond = !needOppositeCond;
21669 checkAgainstTrue = true;
21670 } else if (C->getZExtValue() != 0)
21671 // Quit if the constant is neither 0 or 1.
21674 bool truncatedToBoolWithAnd = false;
21675 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
21676 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
21677 SetCC.getOpcode() == ISD::TRUNCATE ||
21678 SetCC.getOpcode() == ISD::AND) {
21679 if (SetCC.getOpcode() == ISD::AND) {
21681 ConstantSDNode *CS;
21682 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
21683 CS->getZExtValue() == 1)
21685 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
21686 CS->getZExtValue() == 1)
21690 SetCC = SetCC.getOperand(OpIdx);
21691 truncatedToBoolWithAnd = true;
21693 SetCC = SetCC.getOperand(0);
21696 switch (SetCC.getOpcode()) {
21697 case X86ISD::SETCC_CARRY:
21698 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
21699 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
21700 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
21701 // truncated to i1 using 'and'.
21702 if (checkAgainstTrue && !truncatedToBoolWithAnd)
21704 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
21705 "Invalid use of SETCC_CARRY!");
21707 case X86ISD::SETCC:
21708 // Set the condition code or opposite one if necessary.
21709 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
21710 if (needOppositeCond)
21711 CC = X86::GetOppositeBranchCondition(CC);
21712 return SetCC.getOperand(1);
21713 case X86ISD::CMOV: {
21714 // Check whether false/true value has canonical one, i.e. 0 or 1.
21715 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
21716 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
21717 // Quit if true value is not a constant.
21720 // Quit if false value is not a constant.
21722 SDValue Op = SetCC.getOperand(0);
21723 // Skip 'zext' or 'trunc' node.
21724 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
21725 Op.getOpcode() == ISD::TRUNCATE)
21726 Op = Op.getOperand(0);
21727 // A special case for rdrand/rdseed, where 0 is set if false cond is
21729 if ((Op.getOpcode() != X86ISD::RDRAND &&
21730 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
21733 // Quit if false value is not the constant 0 or 1.
21734 bool FValIsFalse = true;
21735 if (FVal && FVal->getZExtValue() != 0) {
21736 if (FVal->getZExtValue() != 1)
21738 // If FVal is 1, opposite cond is needed.
21739 needOppositeCond = !needOppositeCond;
21740 FValIsFalse = false;
21742 // Quit if TVal is not the constant opposite of FVal.
21743 if (FValIsFalse && TVal->getZExtValue() != 1)
21745 if (!FValIsFalse && TVal->getZExtValue() != 0)
21747 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
21748 if (needOppositeCond)
21749 CC = X86::GetOppositeBranchCondition(CC);
21750 return SetCC.getOperand(3);
21757 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
21758 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
21759 TargetLowering::DAGCombinerInfo &DCI,
21760 const X86Subtarget *Subtarget) {
21763 // If the flag operand isn't dead, don't touch this CMOV.
21764 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
21767 SDValue FalseOp = N->getOperand(0);
21768 SDValue TrueOp = N->getOperand(1);
21769 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
21770 SDValue Cond = N->getOperand(3);
21772 if (CC == X86::COND_E || CC == X86::COND_NE) {
21773 switch (Cond.getOpcode()) {
21777 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
21778 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
21779 return (CC == X86::COND_E) ? FalseOp : TrueOp;
21785 Flags = checkBoolTestSetCCCombine(Cond, CC);
21786 if (Flags.getNode() &&
21787 // Extra check as FCMOV only supports a subset of X86 cond.
21788 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
21789 SDValue Ops[] = { FalseOp, TrueOp,
21790 DAG.getConstant(CC, MVT::i8), Flags };
21791 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
21794 // If this is a select between two integer constants, try to do some
21795 // optimizations. Note that the operands are ordered the opposite of SELECT
21797 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
21798 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
21799 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
21800 // larger than FalseC (the false value).
21801 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
21802 CC = X86::GetOppositeBranchCondition(CC);
21803 std::swap(TrueC, FalseC);
21804 std::swap(TrueOp, FalseOp);
21807 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
21808 // This is efficient for any integer data type (including i8/i16) and
21810 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
21811 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21812 DAG.getConstant(CC, MVT::i8), Cond);
21814 // Zero extend the condition if needed.
21815 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
21817 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21818 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
21819 DAG.getConstant(ShAmt, MVT::i8));
21820 if (N->getNumValues() == 2) // Dead flag value?
21821 return DCI.CombineTo(N, Cond, SDValue());
21825 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
21826 // for any integer data type, including i8/i16.
21827 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21828 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21829 DAG.getConstant(CC, MVT::i8), Cond);
21831 // Zero extend the condition if needed.
21832 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21833 FalseC->getValueType(0), Cond);
21834 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21835 SDValue(FalseC, 0));
21837 if (N->getNumValues() == 2) // Dead flag value?
21838 return DCI.CombineTo(N, Cond, SDValue());
21842 // Optimize cases that will turn into an LEA instruction. This requires
21843 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21844 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21845 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21846 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21848 bool isFastMultiplier = false;
21850 switch ((unsigned char)Diff) {
21852 case 1: // result = add base, cond
21853 case 2: // result = lea base( , cond*2)
21854 case 3: // result = lea base(cond, cond*2)
21855 case 4: // result = lea base( , cond*4)
21856 case 5: // result = lea base(cond, cond*4)
21857 case 8: // result = lea base( , cond*8)
21858 case 9: // result = lea base(cond, cond*8)
21859 isFastMultiplier = true;
21864 if (isFastMultiplier) {
21865 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21866 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21867 DAG.getConstant(CC, MVT::i8), Cond);
21868 // Zero extend the condition if needed.
21869 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21871 // Scale the condition by the difference.
21873 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21874 DAG.getConstant(Diff, Cond.getValueType()));
21876 // Add the base if non-zero.
21877 if (FalseC->getAPIntValue() != 0)
21878 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21879 SDValue(FalseC, 0));
21880 if (N->getNumValues() == 2) // Dead flag value?
21881 return DCI.CombineTo(N, Cond, SDValue());
21888 // Handle these cases:
21889 // (select (x != c), e, c) -> select (x != c), e, x),
21890 // (select (x == c), c, e) -> select (x == c), x, e)
21891 // where the c is an integer constant, and the "select" is the combination
21892 // of CMOV and CMP.
21894 // The rationale for this change is that the conditional-move from a constant
21895 // needs two instructions, however, conditional-move from a register needs
21896 // only one instruction.
21898 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
21899 // some instruction-combining opportunities. This opt needs to be
21900 // postponed as late as possible.
21902 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
21903 // the DCI.xxxx conditions are provided to postpone the optimization as
21904 // late as possible.
21906 ConstantSDNode *CmpAgainst = nullptr;
21907 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
21908 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
21909 !isa<ConstantSDNode>(Cond.getOperand(0))) {
21911 if (CC == X86::COND_NE &&
21912 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
21913 CC = X86::GetOppositeBranchCondition(CC);
21914 std::swap(TrueOp, FalseOp);
21917 if (CC == X86::COND_E &&
21918 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
21919 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
21920 DAG.getConstant(CC, MVT::i8), Cond };
21921 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
21929 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
21930 const X86Subtarget *Subtarget) {
21931 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
21933 default: return SDValue();
21934 // SSE/AVX/AVX2 blend intrinsics.
21935 case Intrinsic::x86_avx2_pblendvb:
21936 case Intrinsic::x86_avx2_pblendw:
21937 case Intrinsic::x86_avx2_pblendd_128:
21938 case Intrinsic::x86_avx2_pblendd_256:
21939 // Don't try to simplify this intrinsic if we don't have AVX2.
21940 if (!Subtarget->hasAVX2())
21943 case Intrinsic::x86_avx_blend_pd_256:
21944 case Intrinsic::x86_avx_blend_ps_256:
21945 case Intrinsic::x86_avx_blendv_pd_256:
21946 case Intrinsic::x86_avx_blendv_ps_256:
21947 // Don't try to simplify this intrinsic if we don't have AVX.
21948 if (!Subtarget->hasAVX())
21951 case Intrinsic::x86_sse41_pblendw:
21952 case Intrinsic::x86_sse41_blendpd:
21953 case Intrinsic::x86_sse41_blendps:
21954 case Intrinsic::x86_sse41_blendvps:
21955 case Intrinsic::x86_sse41_blendvpd:
21956 case Intrinsic::x86_sse41_pblendvb: {
21957 SDValue Op0 = N->getOperand(1);
21958 SDValue Op1 = N->getOperand(2);
21959 SDValue Mask = N->getOperand(3);
21961 // Don't try to simplify this intrinsic if we don't have SSE4.1.
21962 if (!Subtarget->hasSSE41())
21965 // fold (blend A, A, Mask) -> A
21968 // fold (blend A, B, allZeros) -> A
21969 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
21971 // fold (blend A, B, allOnes) -> B
21972 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
21975 // Simplify the case where the mask is a constant i32 value.
21976 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
21977 if (C->isNullValue())
21979 if (C->isAllOnesValue())
21986 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
21987 case Intrinsic::x86_sse2_psrai_w:
21988 case Intrinsic::x86_sse2_psrai_d:
21989 case Intrinsic::x86_avx2_psrai_w:
21990 case Intrinsic::x86_avx2_psrai_d:
21991 case Intrinsic::x86_sse2_psra_w:
21992 case Intrinsic::x86_sse2_psra_d:
21993 case Intrinsic::x86_avx2_psra_w:
21994 case Intrinsic::x86_avx2_psra_d: {
21995 SDValue Op0 = N->getOperand(1);
21996 SDValue Op1 = N->getOperand(2);
21997 EVT VT = Op0.getValueType();
21998 assert(VT.isVector() && "Expected a vector type!");
22000 if (isa<BuildVectorSDNode>(Op1))
22001 Op1 = Op1.getOperand(0);
22003 if (!isa<ConstantSDNode>(Op1))
22006 EVT SVT = VT.getVectorElementType();
22007 unsigned SVTBits = SVT.getSizeInBits();
22009 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
22010 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
22011 uint64_t ShAmt = C.getZExtValue();
22013 // Don't try to convert this shift into a ISD::SRA if the shift
22014 // count is bigger than or equal to the element size.
22015 if (ShAmt >= SVTBits)
22018 // Trivial case: if the shift count is zero, then fold this
22019 // into the first operand.
22023 // Replace this packed shift intrinsic with a target independent
22025 SDValue Splat = DAG.getConstant(C, VT);
22026 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
22031 /// PerformMulCombine - Optimize a single multiply with constant into two
22032 /// in order to implement it with two cheaper instructions, e.g.
22033 /// LEA + SHL, LEA + LEA.
22034 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
22035 TargetLowering::DAGCombinerInfo &DCI) {
22036 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
22039 EVT VT = N->getValueType(0);
22040 if (VT != MVT::i64)
22043 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
22046 uint64_t MulAmt = C->getZExtValue();
22047 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
22050 uint64_t MulAmt1 = 0;
22051 uint64_t MulAmt2 = 0;
22052 if ((MulAmt % 9) == 0) {
22054 MulAmt2 = MulAmt / 9;
22055 } else if ((MulAmt % 5) == 0) {
22057 MulAmt2 = MulAmt / 5;
22058 } else if ((MulAmt % 3) == 0) {
22060 MulAmt2 = MulAmt / 3;
22063 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
22066 if (isPowerOf2_64(MulAmt2) &&
22067 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
22068 // If second multiplifer is pow2, issue it first. We want the multiply by
22069 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
22071 std::swap(MulAmt1, MulAmt2);
22074 if (isPowerOf2_64(MulAmt1))
22075 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
22076 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
22078 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
22079 DAG.getConstant(MulAmt1, VT));
22081 if (isPowerOf2_64(MulAmt2))
22082 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
22083 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
22085 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
22086 DAG.getConstant(MulAmt2, VT));
22088 // Do not add new nodes to DAG combiner worklist.
22089 DCI.CombineTo(N, NewMul, false);
22094 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
22095 SDValue N0 = N->getOperand(0);
22096 SDValue N1 = N->getOperand(1);
22097 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
22098 EVT VT = N0.getValueType();
22100 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
22101 // since the result of setcc_c is all zero's or all ones.
22102 if (VT.isInteger() && !VT.isVector() &&
22103 N1C && N0.getOpcode() == ISD::AND &&
22104 N0.getOperand(1).getOpcode() == ISD::Constant) {
22105 SDValue N00 = N0.getOperand(0);
22106 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
22107 ((N00.getOpcode() == ISD::ANY_EXTEND ||
22108 N00.getOpcode() == ISD::ZERO_EXTEND) &&
22109 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
22110 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
22111 APInt ShAmt = N1C->getAPIntValue();
22112 Mask = Mask.shl(ShAmt);
22114 return DAG.getNode(ISD::AND, SDLoc(N), VT,
22115 N00, DAG.getConstant(Mask, VT));
22119 // Hardware support for vector shifts is sparse which makes us scalarize the
22120 // vector operations in many cases. Also, on sandybridge ADD is faster than
22122 // (shl V, 1) -> add V,V
22123 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
22124 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
22125 assert(N0.getValueType().isVector() && "Invalid vector shift type");
22126 // We shift all of the values by one. In many cases we do not have
22127 // hardware support for this operation. This is better expressed as an ADD
22129 if (N1SplatC->getZExtValue() == 1)
22130 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
22136 /// \brief Returns a vector of 0s if the node in input is a vector logical
22137 /// shift by a constant amount which is known to be bigger than or equal
22138 /// to the vector element size in bits.
22139 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
22140 const X86Subtarget *Subtarget) {
22141 EVT VT = N->getValueType(0);
22143 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
22144 (!Subtarget->hasInt256() ||
22145 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
22148 SDValue Amt = N->getOperand(1);
22150 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
22151 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
22152 APInt ShiftAmt = AmtSplat->getAPIntValue();
22153 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
22155 // SSE2/AVX2 logical shifts always return a vector of 0s
22156 // if the shift amount is bigger than or equal to
22157 // the element size. The constant shift amount will be
22158 // encoded as a 8-bit immediate.
22159 if (ShiftAmt.trunc(8).uge(MaxAmount))
22160 return getZeroVector(VT, Subtarget, DAG, DL);
22166 /// PerformShiftCombine - Combine shifts.
22167 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
22168 TargetLowering::DAGCombinerInfo &DCI,
22169 const X86Subtarget *Subtarget) {
22170 if (N->getOpcode() == ISD::SHL) {
22171 SDValue V = PerformSHLCombine(N, DAG);
22172 if (V.getNode()) return V;
22175 if (N->getOpcode() != ISD::SRA) {
22176 // Try to fold this logical shift into a zero vector.
22177 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
22178 if (V.getNode()) return V;
22184 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
22185 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
22186 // and friends. Likewise for OR -> CMPNEQSS.
22187 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
22188 TargetLowering::DAGCombinerInfo &DCI,
22189 const X86Subtarget *Subtarget) {
22192 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
22193 // we're requiring SSE2 for both.
22194 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
22195 SDValue N0 = N->getOperand(0);
22196 SDValue N1 = N->getOperand(1);
22197 SDValue CMP0 = N0->getOperand(1);
22198 SDValue CMP1 = N1->getOperand(1);
22201 // The SETCCs should both refer to the same CMP.
22202 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
22205 SDValue CMP00 = CMP0->getOperand(0);
22206 SDValue CMP01 = CMP0->getOperand(1);
22207 EVT VT = CMP00.getValueType();
22209 if (VT == MVT::f32 || VT == MVT::f64) {
22210 bool ExpectingFlags = false;
22211 // Check for any users that want flags:
22212 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
22213 !ExpectingFlags && UI != UE; ++UI)
22214 switch (UI->getOpcode()) {
22219 ExpectingFlags = true;
22221 case ISD::CopyToReg:
22222 case ISD::SIGN_EXTEND:
22223 case ISD::ZERO_EXTEND:
22224 case ISD::ANY_EXTEND:
22228 if (!ExpectingFlags) {
22229 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
22230 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
22232 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
22233 X86::CondCode tmp = cc0;
22238 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
22239 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
22240 // FIXME: need symbolic constants for these magic numbers.
22241 // See X86ATTInstPrinter.cpp:printSSECC().
22242 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
22243 if (Subtarget->hasAVX512()) {
22244 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
22245 CMP01, DAG.getConstant(x86cc, MVT::i8));
22246 if (N->getValueType(0) != MVT::i1)
22247 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
22251 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
22252 CMP00.getValueType(), CMP00, CMP01,
22253 DAG.getConstant(x86cc, MVT::i8));
22255 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
22256 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
22258 if (is64BitFP && !Subtarget->is64Bit()) {
22259 // On a 32-bit target, we cannot bitcast the 64-bit float to a
22260 // 64-bit integer, since that's not a legal type. Since
22261 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
22262 // bits, but can do this little dance to extract the lowest 32 bits
22263 // and work with those going forward.
22264 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
22266 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
22268 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
22269 Vector32, DAG.getIntPtrConstant(0));
22273 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
22274 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
22275 DAG.getConstant(1, IntVT));
22276 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
22277 return OneBitOfTruth;
22285 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
22286 /// so it can be folded inside ANDNP.
22287 static bool CanFoldXORWithAllOnes(const SDNode *N) {
22288 EVT VT = N->getValueType(0);
22290 // Match direct AllOnes for 128 and 256-bit vectors
22291 if (ISD::isBuildVectorAllOnes(N))
22294 // Look through a bit convert.
22295 if (N->getOpcode() == ISD::BITCAST)
22296 N = N->getOperand(0).getNode();
22298 // Sometimes the operand may come from a insert_subvector building a 256-bit
22300 if (VT.is256BitVector() &&
22301 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
22302 SDValue V1 = N->getOperand(0);
22303 SDValue V2 = N->getOperand(1);
22305 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
22306 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
22307 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
22308 ISD::isBuildVectorAllOnes(V2.getNode()))
22315 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
22316 // register. In most cases we actually compare or select YMM-sized registers
22317 // and mixing the two types creates horrible code. This method optimizes
22318 // some of the transition sequences.
22319 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
22320 TargetLowering::DAGCombinerInfo &DCI,
22321 const X86Subtarget *Subtarget) {
22322 EVT VT = N->getValueType(0);
22323 if (!VT.is256BitVector())
22326 assert((N->getOpcode() == ISD::ANY_EXTEND ||
22327 N->getOpcode() == ISD::ZERO_EXTEND ||
22328 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
22330 SDValue Narrow = N->getOperand(0);
22331 EVT NarrowVT = Narrow->getValueType(0);
22332 if (!NarrowVT.is128BitVector())
22335 if (Narrow->getOpcode() != ISD::XOR &&
22336 Narrow->getOpcode() != ISD::AND &&
22337 Narrow->getOpcode() != ISD::OR)
22340 SDValue N0 = Narrow->getOperand(0);
22341 SDValue N1 = Narrow->getOperand(1);
22344 // The Left side has to be a trunc.
22345 if (N0.getOpcode() != ISD::TRUNCATE)
22348 // The type of the truncated inputs.
22349 EVT WideVT = N0->getOperand(0)->getValueType(0);
22353 // The right side has to be a 'trunc' or a constant vector.
22354 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
22355 ConstantSDNode *RHSConstSplat = nullptr;
22356 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
22357 RHSConstSplat = RHSBV->getConstantSplatNode();
22358 if (!RHSTrunc && !RHSConstSplat)
22361 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22363 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
22366 // Set N0 and N1 to hold the inputs to the new wide operation.
22367 N0 = N0->getOperand(0);
22368 if (RHSConstSplat) {
22369 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
22370 SDValue(RHSConstSplat, 0));
22371 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
22372 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
22373 } else if (RHSTrunc) {
22374 N1 = N1->getOperand(0);
22377 // Generate the wide operation.
22378 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
22379 unsigned Opcode = N->getOpcode();
22381 case ISD::ANY_EXTEND:
22383 case ISD::ZERO_EXTEND: {
22384 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
22385 APInt Mask = APInt::getAllOnesValue(InBits);
22386 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
22387 return DAG.getNode(ISD::AND, DL, VT,
22388 Op, DAG.getConstant(Mask, VT));
22390 case ISD::SIGN_EXTEND:
22391 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
22392 Op, DAG.getValueType(NarrowVT));
22394 llvm_unreachable("Unexpected opcode");
22398 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
22399 TargetLowering::DAGCombinerInfo &DCI,
22400 const X86Subtarget *Subtarget) {
22401 EVT VT = N->getValueType(0);
22402 if (DCI.isBeforeLegalizeOps())
22405 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22409 // Create BEXTR instructions
22410 // BEXTR is ((X >> imm) & (2**size-1))
22411 if (VT == MVT::i32 || VT == MVT::i64) {
22412 SDValue N0 = N->getOperand(0);
22413 SDValue N1 = N->getOperand(1);
22416 // Check for BEXTR.
22417 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
22418 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
22419 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
22420 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
22421 if (MaskNode && ShiftNode) {
22422 uint64_t Mask = MaskNode->getZExtValue();
22423 uint64_t Shift = ShiftNode->getZExtValue();
22424 if (isMask_64(Mask)) {
22425 uint64_t MaskSize = CountPopulation_64(Mask);
22426 if (Shift + MaskSize <= VT.getSizeInBits())
22427 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
22428 DAG.getConstant(Shift | (MaskSize << 8), VT));
22436 // Want to form ANDNP nodes:
22437 // 1) In the hopes of then easily combining them with OR and AND nodes
22438 // to form PBLEND/PSIGN.
22439 // 2) To match ANDN packed intrinsics
22440 if (VT != MVT::v2i64 && VT != MVT::v4i64)
22443 SDValue N0 = N->getOperand(0);
22444 SDValue N1 = N->getOperand(1);
22447 // Check LHS for vnot
22448 if (N0.getOpcode() == ISD::XOR &&
22449 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
22450 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
22451 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
22453 // Check RHS for vnot
22454 if (N1.getOpcode() == ISD::XOR &&
22455 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
22456 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
22457 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
22462 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
22463 TargetLowering::DAGCombinerInfo &DCI,
22464 const X86Subtarget *Subtarget) {
22465 if (DCI.isBeforeLegalizeOps())
22468 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22472 SDValue N0 = N->getOperand(0);
22473 SDValue N1 = N->getOperand(1);
22474 EVT VT = N->getValueType(0);
22476 // look for psign/blend
22477 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
22478 if (!Subtarget->hasSSSE3() ||
22479 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
22482 // Canonicalize pandn to RHS
22483 if (N0.getOpcode() == X86ISD::ANDNP)
22485 // or (and (m, y), (pandn m, x))
22486 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
22487 SDValue Mask = N1.getOperand(0);
22488 SDValue X = N1.getOperand(1);
22490 if (N0.getOperand(0) == Mask)
22491 Y = N0.getOperand(1);
22492 if (N0.getOperand(1) == Mask)
22493 Y = N0.getOperand(0);
22495 // Check to see if the mask appeared in both the AND and ANDNP and
22499 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
22500 // Look through mask bitcast.
22501 if (Mask.getOpcode() == ISD::BITCAST)
22502 Mask = Mask.getOperand(0);
22503 if (X.getOpcode() == ISD::BITCAST)
22504 X = X.getOperand(0);
22505 if (Y.getOpcode() == ISD::BITCAST)
22506 Y = Y.getOperand(0);
22508 EVT MaskVT = Mask.getValueType();
22510 // Validate that the Mask operand is a vector sra node.
22511 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
22512 // there is no psrai.b
22513 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
22514 unsigned SraAmt = ~0;
22515 if (Mask.getOpcode() == ISD::SRA) {
22516 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
22517 if (auto *AmtConst = AmtBV->getConstantSplatNode())
22518 SraAmt = AmtConst->getZExtValue();
22519 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
22520 SDValue SraC = Mask.getOperand(1);
22521 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
22523 if ((SraAmt + 1) != EltBits)
22528 // Now we know we at least have a plendvb with the mask val. See if
22529 // we can form a psignb/w/d.
22530 // psign = x.type == y.type == mask.type && y = sub(0, x);
22531 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
22532 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
22533 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
22534 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
22535 "Unsupported VT for PSIGN");
22536 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
22537 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22539 // PBLENDVB only available on SSE 4.1
22540 if (!Subtarget->hasSSE41())
22543 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
22545 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
22546 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
22547 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
22548 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
22549 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22553 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
22556 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
22557 MachineFunction &MF = DAG.getMachineFunction();
22558 bool OptForSize = MF.getFunction()->getAttributes().
22559 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
22561 // SHLD/SHRD instructions have lower register pressure, but on some
22562 // platforms they have higher latency than the equivalent
22563 // series of shifts/or that would otherwise be generated.
22564 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
22565 // have higher latencies and we are not optimizing for size.
22566 if (!OptForSize && Subtarget->isSHLDSlow())
22569 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
22571 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
22573 if (!N0.hasOneUse() || !N1.hasOneUse())
22576 SDValue ShAmt0 = N0.getOperand(1);
22577 if (ShAmt0.getValueType() != MVT::i8)
22579 SDValue ShAmt1 = N1.getOperand(1);
22580 if (ShAmt1.getValueType() != MVT::i8)
22582 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
22583 ShAmt0 = ShAmt0.getOperand(0);
22584 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
22585 ShAmt1 = ShAmt1.getOperand(0);
22588 unsigned Opc = X86ISD::SHLD;
22589 SDValue Op0 = N0.getOperand(0);
22590 SDValue Op1 = N1.getOperand(0);
22591 if (ShAmt0.getOpcode() == ISD::SUB) {
22592 Opc = X86ISD::SHRD;
22593 std::swap(Op0, Op1);
22594 std::swap(ShAmt0, ShAmt1);
22597 unsigned Bits = VT.getSizeInBits();
22598 if (ShAmt1.getOpcode() == ISD::SUB) {
22599 SDValue Sum = ShAmt1.getOperand(0);
22600 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
22601 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
22602 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
22603 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
22604 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
22605 return DAG.getNode(Opc, DL, VT,
22607 DAG.getNode(ISD::TRUNCATE, DL,
22610 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
22611 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
22613 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
22614 return DAG.getNode(Opc, DL, VT,
22615 N0.getOperand(0), N1.getOperand(0),
22616 DAG.getNode(ISD::TRUNCATE, DL,
22623 // Generate NEG and CMOV for integer abs.
22624 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
22625 EVT VT = N->getValueType(0);
22627 // Since X86 does not have CMOV for 8-bit integer, we don't convert
22628 // 8-bit integer abs to NEG and CMOV.
22629 if (VT.isInteger() && VT.getSizeInBits() == 8)
22632 SDValue N0 = N->getOperand(0);
22633 SDValue N1 = N->getOperand(1);
22636 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
22637 // and change it to SUB and CMOV.
22638 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
22639 N0.getOpcode() == ISD::ADD &&
22640 N0.getOperand(1) == N1 &&
22641 N1.getOpcode() == ISD::SRA &&
22642 N1.getOperand(0) == N0.getOperand(0))
22643 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
22644 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
22645 // Generate SUB & CMOV.
22646 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
22647 DAG.getConstant(0, VT), N0.getOperand(0));
22649 SDValue Ops[] = { N0.getOperand(0), Neg,
22650 DAG.getConstant(X86::COND_GE, MVT::i8),
22651 SDValue(Neg.getNode(), 1) };
22652 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
22657 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
22658 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
22659 TargetLowering::DAGCombinerInfo &DCI,
22660 const X86Subtarget *Subtarget) {
22661 if (DCI.isBeforeLegalizeOps())
22664 if (Subtarget->hasCMov()) {
22665 SDValue RV = performIntegerAbsCombine(N, DAG);
22673 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
22674 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
22675 TargetLowering::DAGCombinerInfo &DCI,
22676 const X86Subtarget *Subtarget) {
22677 LoadSDNode *Ld = cast<LoadSDNode>(N);
22678 EVT RegVT = Ld->getValueType(0);
22679 EVT MemVT = Ld->getMemoryVT();
22681 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22683 // On Sandybridge unaligned 256bit loads are inefficient.
22684 ISD::LoadExtType Ext = Ld->getExtensionType();
22685 unsigned Alignment = Ld->getAlignment();
22686 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
22687 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
22688 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
22689 unsigned NumElems = RegVT.getVectorNumElements();
22693 SDValue Ptr = Ld->getBasePtr();
22694 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
22696 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
22698 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22699 Ld->getPointerInfo(), Ld->isVolatile(),
22700 Ld->isNonTemporal(), Ld->isInvariant(),
22702 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22703 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22704 Ld->getPointerInfo(), Ld->isVolatile(),
22705 Ld->isNonTemporal(), Ld->isInvariant(),
22706 std::min(16U, Alignment));
22707 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22709 Load2.getValue(1));
22711 SDValue NewVec = DAG.getUNDEF(RegVT);
22712 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
22713 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
22714 return DCI.CombineTo(N, NewVec, TF, true);
22720 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
22721 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
22722 const X86Subtarget *Subtarget) {
22723 StoreSDNode *St = cast<StoreSDNode>(N);
22724 EVT VT = St->getValue().getValueType();
22725 EVT StVT = St->getMemoryVT();
22727 SDValue StoredVal = St->getOperand(1);
22728 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22730 // If we are saving a concatenation of two XMM registers, perform two stores.
22731 // On Sandy Bridge, 256-bit memory operations are executed by two
22732 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
22733 // memory operation.
22734 unsigned Alignment = St->getAlignment();
22735 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
22736 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
22737 StVT == VT && !IsAligned) {
22738 unsigned NumElems = VT.getVectorNumElements();
22742 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
22743 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
22745 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
22746 SDValue Ptr0 = St->getBasePtr();
22747 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
22749 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
22750 St->getPointerInfo(), St->isVolatile(),
22751 St->isNonTemporal(), Alignment);
22752 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
22753 St->getPointerInfo(), St->isVolatile(),
22754 St->isNonTemporal(),
22755 std::min(16U, Alignment));
22756 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
22759 // Optimize trunc store (of multiple scalars) to shuffle and store.
22760 // First, pack all of the elements in one place. Next, store to memory
22761 // in fewer chunks.
22762 if (St->isTruncatingStore() && VT.isVector()) {
22763 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22764 unsigned NumElems = VT.getVectorNumElements();
22765 assert(StVT != VT && "Cannot truncate to the same type");
22766 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
22767 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
22769 // From, To sizes and ElemCount must be pow of two
22770 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
22771 // We are going to use the original vector elt for storing.
22772 // Accumulated smaller vector elements must be a multiple of the store size.
22773 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
22775 unsigned SizeRatio = FromSz / ToSz;
22777 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
22779 // Create a type on which we perform the shuffle
22780 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
22781 StVT.getScalarType(), NumElems*SizeRatio);
22783 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
22785 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
22786 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
22787 for (unsigned i = 0; i != NumElems; ++i)
22788 ShuffleVec[i] = i * SizeRatio;
22790 // Can't shuffle using an illegal type.
22791 if (!TLI.isTypeLegal(WideVecVT))
22794 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
22795 DAG.getUNDEF(WideVecVT),
22797 // At this point all of the data is stored at the bottom of the
22798 // register. We now need to save it to mem.
22800 // Find the largest store unit
22801 MVT StoreType = MVT::i8;
22802 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
22803 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
22804 MVT Tp = (MVT::SimpleValueType)tp;
22805 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
22809 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
22810 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
22811 (64 <= NumElems * ToSz))
22812 StoreType = MVT::f64;
22814 // Bitcast the original vector into a vector of store-size units
22815 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
22816 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
22817 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
22818 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
22819 SmallVector<SDValue, 8> Chains;
22820 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
22821 TLI.getPointerTy());
22822 SDValue Ptr = St->getBasePtr();
22824 // Perform one or more big stores into memory.
22825 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
22826 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
22827 StoreType, ShuffWide,
22828 DAG.getIntPtrConstant(i));
22829 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
22830 St->getPointerInfo(), St->isVolatile(),
22831 St->isNonTemporal(), St->getAlignment());
22832 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22833 Chains.push_back(Ch);
22836 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
22839 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
22840 // the FP state in cases where an emms may be missing.
22841 // A preferable solution to the general problem is to figure out the right
22842 // places to insert EMMS. This qualifies as a quick hack.
22844 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
22845 if (VT.getSizeInBits() != 64)
22848 const Function *F = DAG.getMachineFunction().getFunction();
22849 bool NoImplicitFloatOps = F->getAttributes().
22850 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
22851 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
22852 && Subtarget->hasSSE2();
22853 if ((VT.isVector() ||
22854 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
22855 isa<LoadSDNode>(St->getValue()) &&
22856 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
22857 St->getChain().hasOneUse() && !St->isVolatile()) {
22858 SDNode* LdVal = St->getValue().getNode();
22859 LoadSDNode *Ld = nullptr;
22860 int TokenFactorIndex = -1;
22861 SmallVector<SDValue, 8> Ops;
22862 SDNode* ChainVal = St->getChain().getNode();
22863 // Must be a store of a load. We currently handle two cases: the load
22864 // is a direct child, and it's under an intervening TokenFactor. It is
22865 // possible to dig deeper under nested TokenFactors.
22866 if (ChainVal == LdVal)
22867 Ld = cast<LoadSDNode>(St->getChain());
22868 else if (St->getValue().hasOneUse() &&
22869 ChainVal->getOpcode() == ISD::TokenFactor) {
22870 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
22871 if (ChainVal->getOperand(i).getNode() == LdVal) {
22872 TokenFactorIndex = i;
22873 Ld = cast<LoadSDNode>(St->getValue());
22875 Ops.push_back(ChainVal->getOperand(i));
22879 if (!Ld || !ISD::isNormalLoad(Ld))
22882 // If this is not the MMX case, i.e. we are just turning i64 load/store
22883 // into f64 load/store, avoid the transformation if there are multiple
22884 // uses of the loaded value.
22885 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
22890 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
22891 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
22893 if (Subtarget->is64Bit() || F64IsLegal) {
22894 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
22895 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
22896 Ld->getPointerInfo(), Ld->isVolatile(),
22897 Ld->isNonTemporal(), Ld->isInvariant(),
22898 Ld->getAlignment());
22899 SDValue NewChain = NewLd.getValue(1);
22900 if (TokenFactorIndex != -1) {
22901 Ops.push_back(NewChain);
22902 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22904 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
22905 St->getPointerInfo(),
22906 St->isVolatile(), St->isNonTemporal(),
22907 St->getAlignment());
22910 // Otherwise, lower to two pairs of 32-bit loads / stores.
22911 SDValue LoAddr = Ld->getBasePtr();
22912 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
22913 DAG.getConstant(4, MVT::i32));
22915 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
22916 Ld->getPointerInfo(),
22917 Ld->isVolatile(), Ld->isNonTemporal(),
22918 Ld->isInvariant(), Ld->getAlignment());
22919 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
22920 Ld->getPointerInfo().getWithOffset(4),
22921 Ld->isVolatile(), Ld->isNonTemporal(),
22923 MinAlign(Ld->getAlignment(), 4));
22925 SDValue NewChain = LoLd.getValue(1);
22926 if (TokenFactorIndex != -1) {
22927 Ops.push_back(LoLd);
22928 Ops.push_back(HiLd);
22929 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22932 LoAddr = St->getBasePtr();
22933 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
22934 DAG.getConstant(4, MVT::i32));
22936 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
22937 St->getPointerInfo(),
22938 St->isVolatile(), St->isNonTemporal(),
22939 St->getAlignment());
22940 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
22941 St->getPointerInfo().getWithOffset(4),
22943 St->isNonTemporal(),
22944 MinAlign(St->getAlignment(), 4));
22945 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
22950 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
22951 /// and return the operands for the horizontal operation in LHS and RHS. A
22952 /// horizontal operation performs the binary operation on successive elements
22953 /// of its first operand, then on successive elements of its second operand,
22954 /// returning the resulting values in a vector. For example, if
22955 /// A = < float a0, float a1, float a2, float a3 >
22957 /// B = < float b0, float b1, float b2, float b3 >
22958 /// then the result of doing a horizontal operation on A and B is
22959 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
22960 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
22961 /// A horizontal-op B, for some already available A and B, and if so then LHS is
22962 /// set to A, RHS to B, and the routine returns 'true'.
22963 /// Note that the binary operation should have the property that if one of the
22964 /// operands is UNDEF then the result is UNDEF.
22965 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
22966 // Look for the following pattern: if
22967 // A = < float a0, float a1, float a2, float a3 >
22968 // B = < float b0, float b1, float b2, float b3 >
22970 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
22971 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
22972 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
22973 // which is A horizontal-op B.
22975 // At least one of the operands should be a vector shuffle.
22976 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
22977 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
22980 MVT VT = LHS.getSimpleValueType();
22982 assert((VT.is128BitVector() || VT.is256BitVector()) &&
22983 "Unsupported vector type for horizontal add/sub");
22985 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
22986 // operate independently on 128-bit lanes.
22987 unsigned NumElts = VT.getVectorNumElements();
22988 unsigned NumLanes = VT.getSizeInBits()/128;
22989 unsigned NumLaneElts = NumElts / NumLanes;
22990 assert((NumLaneElts % 2 == 0) &&
22991 "Vector type should have an even number of elements in each lane");
22992 unsigned HalfLaneElts = NumLaneElts/2;
22994 // View LHS in the form
22995 // LHS = VECTOR_SHUFFLE A, B, LMask
22996 // If LHS is not a shuffle then pretend it is the shuffle
22997 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
22998 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
23001 SmallVector<int, 16> LMask(NumElts);
23002 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23003 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
23004 A = LHS.getOperand(0);
23005 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
23006 B = LHS.getOperand(1);
23007 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
23008 std::copy(Mask.begin(), Mask.end(), LMask.begin());
23010 if (LHS.getOpcode() != ISD::UNDEF)
23012 for (unsigned i = 0; i != NumElts; ++i)
23016 // Likewise, view RHS in the form
23017 // RHS = VECTOR_SHUFFLE C, D, RMask
23019 SmallVector<int, 16> RMask(NumElts);
23020 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23021 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
23022 C = RHS.getOperand(0);
23023 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
23024 D = RHS.getOperand(1);
23025 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
23026 std::copy(Mask.begin(), Mask.end(), RMask.begin());
23028 if (RHS.getOpcode() != ISD::UNDEF)
23030 for (unsigned i = 0; i != NumElts; ++i)
23034 // Check that the shuffles are both shuffling the same vectors.
23035 if (!(A == C && B == D) && !(A == D && B == C))
23038 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
23039 if (!A.getNode() && !B.getNode())
23042 // If A and B occur in reverse order in RHS, then "swap" them (which means
23043 // rewriting the mask).
23045 CommuteVectorShuffleMask(RMask, NumElts);
23047 // At this point LHS and RHS are equivalent to
23048 // LHS = VECTOR_SHUFFLE A, B, LMask
23049 // RHS = VECTOR_SHUFFLE A, B, RMask
23050 // Check that the masks correspond to performing a horizontal operation.
23051 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
23052 for (unsigned i = 0; i != NumLaneElts; ++i) {
23053 int LIdx = LMask[i+l], RIdx = RMask[i+l];
23055 // Ignore any UNDEF components.
23056 if (LIdx < 0 || RIdx < 0 ||
23057 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
23058 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
23061 // Check that successive elements are being operated on. If not, this is
23062 // not a horizontal operation.
23063 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
23064 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
23065 if (!(LIdx == Index && RIdx == Index + 1) &&
23066 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
23071 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
23072 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
23076 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
23077 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
23078 const X86Subtarget *Subtarget) {
23079 EVT VT = N->getValueType(0);
23080 SDValue LHS = N->getOperand(0);
23081 SDValue RHS = N->getOperand(1);
23083 // Try to synthesize horizontal adds from adds of shuffles.
23084 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23085 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23086 isHorizontalBinOp(LHS, RHS, true))
23087 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
23091 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
23092 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
23093 const X86Subtarget *Subtarget) {
23094 EVT VT = N->getValueType(0);
23095 SDValue LHS = N->getOperand(0);
23096 SDValue RHS = N->getOperand(1);
23098 // Try to synthesize horizontal subs from subs of shuffles.
23099 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23100 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23101 isHorizontalBinOp(LHS, RHS, false))
23102 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
23106 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
23107 /// X86ISD::FXOR nodes.
23108 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
23109 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
23110 // F[X]OR(0.0, x) -> x
23111 // F[X]OR(x, 0.0) -> x
23112 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23113 if (C->getValueAPF().isPosZero())
23114 return N->getOperand(1);
23115 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23116 if (C->getValueAPF().isPosZero())
23117 return N->getOperand(0);
23121 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
23122 /// X86ISD::FMAX nodes.
23123 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
23124 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
23126 // Only perform optimizations if UnsafeMath is used.
23127 if (!DAG.getTarget().Options.UnsafeFPMath)
23130 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
23131 // into FMINC and FMAXC, which are Commutative operations.
23132 unsigned NewOp = 0;
23133 switch (N->getOpcode()) {
23134 default: llvm_unreachable("unknown opcode");
23135 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
23136 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
23139 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
23140 N->getOperand(0), N->getOperand(1));
23143 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
23144 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
23145 // FAND(0.0, x) -> 0.0
23146 // FAND(x, 0.0) -> 0.0
23147 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23148 if (C->getValueAPF().isPosZero())
23149 return N->getOperand(0);
23150 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23151 if (C->getValueAPF().isPosZero())
23152 return N->getOperand(1);
23156 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
23157 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
23158 // FANDN(x, 0.0) -> 0.0
23159 // FANDN(0.0, x) -> x
23160 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23161 if (C->getValueAPF().isPosZero())
23162 return N->getOperand(1);
23163 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23164 if (C->getValueAPF().isPosZero())
23165 return N->getOperand(1);
23169 static SDValue PerformBTCombine(SDNode *N,
23171 TargetLowering::DAGCombinerInfo &DCI) {
23172 // BT ignores high bits in the bit index operand.
23173 SDValue Op1 = N->getOperand(1);
23174 if (Op1.hasOneUse()) {
23175 unsigned BitWidth = Op1.getValueSizeInBits();
23176 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
23177 APInt KnownZero, KnownOne;
23178 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
23179 !DCI.isBeforeLegalizeOps());
23180 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23181 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
23182 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
23183 DCI.CommitTargetLoweringOpt(TLO);
23188 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
23189 SDValue Op = N->getOperand(0);
23190 if (Op.getOpcode() == ISD::BITCAST)
23191 Op = Op.getOperand(0);
23192 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
23193 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
23194 VT.getVectorElementType().getSizeInBits() ==
23195 OpVT.getVectorElementType().getSizeInBits()) {
23196 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
23201 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
23202 const X86Subtarget *Subtarget) {
23203 EVT VT = N->getValueType(0);
23204 if (!VT.isVector())
23207 SDValue N0 = N->getOperand(0);
23208 SDValue N1 = N->getOperand(1);
23209 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
23212 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
23213 // both SSE and AVX2 since there is no sign-extended shift right
23214 // operation on a vector with 64-bit elements.
23215 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
23216 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
23217 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
23218 N0.getOpcode() == ISD::SIGN_EXTEND)) {
23219 SDValue N00 = N0.getOperand(0);
23221 // EXTLOAD has a better solution on AVX2,
23222 // it may be replaced with X86ISD::VSEXT node.
23223 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
23224 if (!ISD::isNormalLoad(N00.getNode()))
23227 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
23228 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
23230 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
23236 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
23237 TargetLowering::DAGCombinerInfo &DCI,
23238 const X86Subtarget *Subtarget) {
23239 if (!DCI.isBeforeLegalizeOps())
23242 if (!Subtarget->hasFp256())
23245 EVT VT = N->getValueType(0);
23246 if (VT.isVector() && VT.getSizeInBits() == 256) {
23247 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23255 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
23256 const X86Subtarget* Subtarget) {
23258 EVT VT = N->getValueType(0);
23260 // Let legalize expand this if it isn't a legal type yet.
23261 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
23264 EVT ScalarVT = VT.getScalarType();
23265 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
23266 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
23269 SDValue A = N->getOperand(0);
23270 SDValue B = N->getOperand(1);
23271 SDValue C = N->getOperand(2);
23273 bool NegA = (A.getOpcode() == ISD::FNEG);
23274 bool NegB = (B.getOpcode() == ISD::FNEG);
23275 bool NegC = (C.getOpcode() == ISD::FNEG);
23277 // Negative multiplication when NegA xor NegB
23278 bool NegMul = (NegA != NegB);
23280 A = A.getOperand(0);
23282 B = B.getOperand(0);
23284 C = C.getOperand(0);
23288 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
23290 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
23292 return DAG.getNode(Opcode, dl, VT, A, B, C);
23295 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
23296 TargetLowering::DAGCombinerInfo &DCI,
23297 const X86Subtarget *Subtarget) {
23298 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
23299 // (and (i32 x86isd::setcc_carry), 1)
23300 // This eliminates the zext. This transformation is necessary because
23301 // ISD::SETCC is always legalized to i8.
23303 SDValue N0 = N->getOperand(0);
23304 EVT VT = N->getValueType(0);
23306 if (N0.getOpcode() == ISD::AND &&
23308 N0.getOperand(0).hasOneUse()) {
23309 SDValue N00 = N0.getOperand(0);
23310 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23311 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23312 if (!C || C->getZExtValue() != 1)
23314 return DAG.getNode(ISD::AND, dl, VT,
23315 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23316 N00.getOperand(0), N00.getOperand(1)),
23317 DAG.getConstant(1, VT));
23321 if (N0.getOpcode() == ISD::TRUNCATE &&
23323 N0.getOperand(0).hasOneUse()) {
23324 SDValue N00 = N0.getOperand(0);
23325 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23326 return DAG.getNode(ISD::AND, dl, VT,
23327 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23328 N00.getOperand(0), N00.getOperand(1)),
23329 DAG.getConstant(1, VT));
23332 if (VT.is256BitVector()) {
23333 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23341 // Optimize x == -y --> x+y == 0
23342 // x != -y --> x+y != 0
23343 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
23344 const X86Subtarget* Subtarget) {
23345 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
23346 SDValue LHS = N->getOperand(0);
23347 SDValue RHS = N->getOperand(1);
23348 EVT VT = N->getValueType(0);
23351 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
23352 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
23353 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
23354 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23355 LHS.getValueType(), RHS, LHS.getOperand(1));
23356 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23357 addV, DAG.getConstant(0, addV.getValueType()), CC);
23359 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
23360 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
23361 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
23362 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23363 RHS.getValueType(), LHS, RHS.getOperand(1));
23364 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23365 addV, DAG.getConstant(0, addV.getValueType()), CC);
23368 if (VT.getScalarType() == MVT::i1) {
23369 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
23370 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23371 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
23372 if (!IsSEXT0 && !IsVZero0)
23374 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
23375 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23376 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
23378 if (!IsSEXT1 && !IsVZero1)
23381 if (IsSEXT0 && IsVZero1) {
23382 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
23383 if (CC == ISD::SETEQ)
23384 return DAG.getNOT(DL, LHS.getOperand(0), VT);
23385 return LHS.getOperand(0);
23387 if (IsSEXT1 && IsVZero0) {
23388 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
23389 if (CC == ISD::SETEQ)
23390 return DAG.getNOT(DL, RHS.getOperand(0), VT);
23391 return RHS.getOperand(0);
23398 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
23399 const X86Subtarget *Subtarget) {
23401 MVT VT = N->getOperand(1)->getSimpleValueType(0);
23402 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
23403 "X86insertps is only defined for v4x32");
23405 SDValue Ld = N->getOperand(1);
23406 if (MayFoldLoad(Ld)) {
23407 // Extract the countS bits from the immediate so we can get the proper
23408 // address when narrowing the vector load to a specific element.
23409 // When the second source op is a memory address, interps doesn't use
23410 // countS and just gets an f32 from that address.
23411 unsigned DestIndex =
23412 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
23413 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
23417 // Create this as a scalar to vector to match the instruction pattern.
23418 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
23419 // countS bits are ignored when loading from memory on insertps, which
23420 // means we don't need to explicitly set them to 0.
23421 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
23422 LoadScalarToVector, N->getOperand(2));
23425 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
23426 // as "sbb reg,reg", since it can be extended without zext and produces
23427 // an all-ones bit which is more useful than 0/1 in some cases.
23428 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
23431 return DAG.getNode(ISD::AND, DL, VT,
23432 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23433 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
23434 DAG.getConstant(1, VT));
23435 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
23436 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
23437 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23438 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
23441 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
23442 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
23443 TargetLowering::DAGCombinerInfo &DCI,
23444 const X86Subtarget *Subtarget) {
23446 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
23447 SDValue EFLAGS = N->getOperand(1);
23449 if (CC == X86::COND_A) {
23450 // Try to convert COND_A into COND_B in an attempt to facilitate
23451 // materializing "setb reg".
23453 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
23454 // cannot take an immediate as its first operand.
23456 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
23457 EFLAGS.getValueType().isInteger() &&
23458 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
23459 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
23460 EFLAGS.getNode()->getVTList(),
23461 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
23462 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
23463 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
23467 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
23468 // a zext and produces an all-ones bit which is more useful than 0/1 in some
23470 if (CC == X86::COND_B)
23471 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
23475 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23476 if (Flags.getNode()) {
23477 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23478 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
23484 // Optimize branch condition evaluation.
23486 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
23487 TargetLowering::DAGCombinerInfo &DCI,
23488 const X86Subtarget *Subtarget) {
23490 SDValue Chain = N->getOperand(0);
23491 SDValue Dest = N->getOperand(1);
23492 SDValue EFLAGS = N->getOperand(3);
23493 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
23497 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23498 if (Flags.getNode()) {
23499 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23500 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
23507 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
23508 SelectionDAG &DAG) {
23509 // Take advantage of vector comparisons producing 0 or -1 in each lane to
23510 // optimize away operation when it's from a constant.
23512 // The general transformation is:
23513 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
23514 // AND(VECTOR_CMP(x,y), constant2)
23515 // constant2 = UNARYOP(constant)
23517 // Early exit if this isn't a vector operation, the operand of the
23518 // unary operation isn't a bitwise AND, or if the sizes of the operations
23519 // aren't the same.
23520 EVT VT = N->getValueType(0);
23521 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
23522 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
23523 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
23526 // Now check that the other operand of the AND is a constant. We could
23527 // make the transformation for non-constant splats as well, but it's unclear
23528 // that would be a benefit as it would not eliminate any operations, just
23529 // perform one more step in scalar code before moving to the vector unit.
23530 if (BuildVectorSDNode *BV =
23531 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
23532 // Bail out if the vector isn't a constant.
23533 if (!BV->isConstant())
23536 // Everything checks out. Build up the new and improved node.
23538 EVT IntVT = BV->getValueType(0);
23539 // Create a new constant of the appropriate type for the transformed
23541 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
23542 // The AND node needs bitcasts to/from an integer vector type around it.
23543 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
23544 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
23545 N->getOperand(0)->getOperand(0), MaskConst);
23546 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
23553 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
23554 const X86TargetLowering *XTLI) {
23555 // First try to optimize away the conversion entirely when it's
23556 // conditionally from a constant. Vectors only.
23557 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
23558 if (Res != SDValue())
23561 // Now move on to more general possibilities.
23562 SDValue Op0 = N->getOperand(0);
23563 EVT InVT = Op0->getValueType(0);
23565 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
23566 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
23568 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
23569 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
23570 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
23573 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
23574 // a 32-bit target where SSE doesn't support i64->FP operations.
23575 if (Op0.getOpcode() == ISD::LOAD) {
23576 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
23577 EVT VT = Ld->getValueType(0);
23578 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
23579 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
23580 !XTLI->getSubtarget()->is64Bit() &&
23582 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
23583 Ld->getChain(), Op0, DAG);
23584 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
23591 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
23592 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
23593 X86TargetLowering::DAGCombinerInfo &DCI) {
23594 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
23595 // the result is either zero or one (depending on the input carry bit).
23596 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
23597 if (X86::isZeroNode(N->getOperand(0)) &&
23598 X86::isZeroNode(N->getOperand(1)) &&
23599 // We don't have a good way to replace an EFLAGS use, so only do this when
23601 SDValue(N, 1).use_empty()) {
23603 EVT VT = N->getValueType(0);
23604 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
23605 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
23606 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
23607 DAG.getConstant(X86::COND_B,MVT::i8),
23609 DAG.getConstant(1, VT));
23610 return DCI.CombineTo(N, Res1, CarryOut);
23616 // fold (add Y, (sete X, 0)) -> adc 0, Y
23617 // (add Y, (setne X, 0)) -> sbb -1, Y
23618 // (sub (sete X, 0), Y) -> sbb 0, Y
23619 // (sub (setne X, 0), Y) -> adc -1, Y
23620 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
23623 // Look through ZExts.
23624 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
23625 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
23628 SDValue SetCC = Ext.getOperand(0);
23629 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
23632 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
23633 if (CC != X86::COND_E && CC != X86::COND_NE)
23636 SDValue Cmp = SetCC.getOperand(1);
23637 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
23638 !X86::isZeroNode(Cmp.getOperand(1)) ||
23639 !Cmp.getOperand(0).getValueType().isInteger())
23642 SDValue CmpOp0 = Cmp.getOperand(0);
23643 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
23644 DAG.getConstant(1, CmpOp0.getValueType()));
23646 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
23647 if (CC == X86::COND_NE)
23648 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
23649 DL, OtherVal.getValueType(), OtherVal,
23650 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
23651 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
23652 DL, OtherVal.getValueType(), OtherVal,
23653 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
23656 /// PerformADDCombine - Do target-specific dag combines on integer adds.
23657 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
23658 const X86Subtarget *Subtarget) {
23659 EVT VT = N->getValueType(0);
23660 SDValue Op0 = N->getOperand(0);
23661 SDValue Op1 = N->getOperand(1);
23663 // Try to synthesize horizontal adds from adds of shuffles.
23664 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23665 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23666 isHorizontalBinOp(Op0, Op1, true))
23667 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
23669 return OptimizeConditionalInDecrement(N, DAG);
23672 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
23673 const X86Subtarget *Subtarget) {
23674 SDValue Op0 = N->getOperand(0);
23675 SDValue Op1 = N->getOperand(1);
23677 // X86 can't encode an immediate LHS of a sub. See if we can push the
23678 // negation into a preceding instruction.
23679 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
23680 // If the RHS of the sub is a XOR with one use and a constant, invert the
23681 // immediate. Then add one to the LHS of the sub so we can turn
23682 // X-Y -> X+~Y+1, saving one register.
23683 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
23684 isa<ConstantSDNode>(Op1.getOperand(1))) {
23685 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
23686 EVT VT = Op0.getValueType();
23687 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
23689 DAG.getConstant(~XorC, VT));
23690 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
23691 DAG.getConstant(C->getAPIntValue()+1, VT));
23695 // Try to synthesize horizontal adds from adds of shuffles.
23696 EVT VT = N->getValueType(0);
23697 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23698 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23699 isHorizontalBinOp(Op0, Op1, true))
23700 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
23702 return OptimizeConditionalInDecrement(N, DAG);
23705 /// performVZEXTCombine - Performs build vector combines
23706 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
23707 TargetLowering::DAGCombinerInfo &DCI,
23708 const X86Subtarget *Subtarget) {
23709 // (vzext (bitcast (vzext (x)) -> (vzext x)
23710 SDValue In = N->getOperand(0);
23711 while (In.getOpcode() == ISD::BITCAST)
23712 In = In.getOperand(0);
23714 if (In.getOpcode() != X86ISD::VZEXT)
23717 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
23721 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
23722 DAGCombinerInfo &DCI) const {
23723 SelectionDAG &DAG = DCI.DAG;
23724 switch (N->getOpcode()) {
23726 case ISD::EXTRACT_VECTOR_ELT:
23727 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
23729 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
23730 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
23731 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
23732 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
23733 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
23734 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
23737 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
23738 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
23739 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
23740 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
23741 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
23742 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
23743 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
23744 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
23745 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
23747 case X86ISD::FOR: return PerformFORCombine(N, DAG);
23749 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
23750 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
23751 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
23752 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
23753 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
23754 case ISD::ANY_EXTEND:
23755 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
23756 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
23757 case ISD::SIGN_EXTEND_INREG:
23758 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
23759 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
23760 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
23761 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
23762 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
23763 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
23764 case X86ISD::SHUFP: // Handle all target specific shuffles
23765 case X86ISD::PALIGNR:
23766 case X86ISD::UNPCKH:
23767 case X86ISD::UNPCKL:
23768 case X86ISD::MOVHLPS:
23769 case X86ISD::MOVLHPS:
23770 case X86ISD::PSHUFB:
23771 case X86ISD::PSHUFD:
23772 case X86ISD::PSHUFHW:
23773 case X86ISD::PSHUFLW:
23774 case X86ISD::MOVSS:
23775 case X86ISD::MOVSD:
23776 case X86ISD::VPERMILP:
23777 case X86ISD::VPERM2X128:
23778 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
23779 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
23780 case ISD::INTRINSIC_WO_CHAIN:
23781 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
23782 case X86ISD::INSERTPS:
23783 return PerformINSERTPSCombine(N, DAG, Subtarget);
23784 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
23790 /// isTypeDesirableForOp - Return true if the target has native support for
23791 /// the specified value type and it is 'desirable' to use the type for the
23792 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
23793 /// instruction encodings are longer and some i16 instructions are slow.
23794 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
23795 if (!isTypeLegal(VT))
23797 if (VT != MVT::i16)
23804 case ISD::SIGN_EXTEND:
23805 case ISD::ZERO_EXTEND:
23806 case ISD::ANY_EXTEND:
23819 /// IsDesirableToPromoteOp - This method query the target whether it is
23820 /// beneficial for dag combiner to promote the specified node. If true, it
23821 /// should return the desired promotion type by reference.
23822 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
23823 EVT VT = Op.getValueType();
23824 if (VT != MVT::i16)
23827 bool Promote = false;
23828 bool Commute = false;
23829 switch (Op.getOpcode()) {
23832 LoadSDNode *LD = cast<LoadSDNode>(Op);
23833 // If the non-extending load has a single use and it's not live out, then it
23834 // might be folded.
23835 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
23836 Op.hasOneUse()*/) {
23837 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
23838 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
23839 // The only case where we'd want to promote LOAD (rather then it being
23840 // promoted as an operand is when it's only use is liveout.
23841 if (UI->getOpcode() != ISD::CopyToReg)
23848 case ISD::SIGN_EXTEND:
23849 case ISD::ZERO_EXTEND:
23850 case ISD::ANY_EXTEND:
23855 SDValue N0 = Op.getOperand(0);
23856 // Look out for (store (shl (load), x)).
23857 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
23870 SDValue N0 = Op.getOperand(0);
23871 SDValue N1 = Op.getOperand(1);
23872 if (!Commute && MayFoldLoad(N1))
23874 // Avoid disabling potential load folding opportunities.
23875 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
23877 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
23887 //===----------------------------------------------------------------------===//
23888 // X86 Inline Assembly Support
23889 //===----------------------------------------------------------------------===//
23892 // Helper to match a string separated by whitespace.
23893 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
23894 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
23896 for (unsigned i = 0, e = args.size(); i != e; ++i) {
23897 StringRef piece(*args[i]);
23898 if (!s.startswith(piece)) // Check if the piece matches.
23901 s = s.substr(piece.size());
23902 StringRef::size_type pos = s.find_first_not_of(" \t");
23903 if (pos == 0) // We matched a prefix.
23911 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
23914 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
23916 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
23917 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
23918 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
23919 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
23921 if (AsmPieces.size() == 3)
23923 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
23930 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
23931 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
23933 std::string AsmStr = IA->getAsmString();
23935 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
23936 if (!Ty || Ty->getBitWidth() % 16 != 0)
23939 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
23940 SmallVector<StringRef, 4> AsmPieces;
23941 SplitString(AsmStr, AsmPieces, ";\n");
23943 switch (AsmPieces.size()) {
23944 default: return false;
23946 // FIXME: this should verify that we are targeting a 486 or better. If not,
23947 // we will turn this bswap into something that will be lowered to logical
23948 // ops instead of emitting the bswap asm. For now, we don't support 486 or
23949 // lower so don't worry about this.
23951 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
23952 matchAsm(AsmPieces[0], "bswapl", "$0") ||
23953 matchAsm(AsmPieces[0], "bswapq", "$0") ||
23954 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
23955 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
23956 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
23957 // No need to check constraints, nothing other than the equivalent of
23958 // "=r,0" would be valid here.
23959 return IntrinsicLowering::LowerToByteSwap(CI);
23962 // rorw $$8, ${0:w} --> llvm.bswap.i16
23963 if (CI->getType()->isIntegerTy(16) &&
23964 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23965 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
23966 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
23968 const std::string &ConstraintsStr = IA->getConstraintString();
23969 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23970 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23971 if (clobbersFlagRegisters(AsmPieces))
23972 return IntrinsicLowering::LowerToByteSwap(CI);
23976 if (CI->getType()->isIntegerTy(32) &&
23977 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23978 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
23979 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
23980 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
23982 const std::string &ConstraintsStr = IA->getConstraintString();
23983 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23984 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23985 if (clobbersFlagRegisters(AsmPieces))
23986 return IntrinsicLowering::LowerToByteSwap(CI);
23989 if (CI->getType()->isIntegerTy(64)) {
23990 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
23991 if (Constraints.size() >= 2 &&
23992 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
23993 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
23994 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
23995 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
23996 matchAsm(AsmPieces[1], "bswap", "%edx") &&
23997 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
23998 return IntrinsicLowering::LowerToByteSwap(CI);
24006 /// getConstraintType - Given a constraint letter, return the type of
24007 /// constraint it is for this target.
24008 X86TargetLowering::ConstraintType
24009 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
24010 if (Constraint.size() == 1) {
24011 switch (Constraint[0]) {
24022 return C_RegisterClass;
24046 return TargetLowering::getConstraintType(Constraint);
24049 /// Examine constraint type and operand type and determine a weight value.
24050 /// This object must already have been set up with the operand type
24051 /// and the current alternative constraint selected.
24052 TargetLowering::ConstraintWeight
24053 X86TargetLowering::getSingleConstraintMatchWeight(
24054 AsmOperandInfo &info, const char *constraint) const {
24055 ConstraintWeight weight = CW_Invalid;
24056 Value *CallOperandVal = info.CallOperandVal;
24057 // If we don't have a value, we can't do a match,
24058 // but allow it at the lowest weight.
24059 if (!CallOperandVal)
24061 Type *type = CallOperandVal->getType();
24062 // Look at the constraint type.
24063 switch (*constraint) {
24065 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
24076 if (CallOperandVal->getType()->isIntegerTy())
24077 weight = CW_SpecificReg;
24082 if (type->isFloatingPointTy())
24083 weight = CW_SpecificReg;
24086 if (type->isX86_MMXTy() && Subtarget->hasMMX())
24087 weight = CW_SpecificReg;
24091 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
24092 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
24093 weight = CW_Register;
24096 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
24097 if (C->getZExtValue() <= 31)
24098 weight = CW_Constant;
24102 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24103 if (C->getZExtValue() <= 63)
24104 weight = CW_Constant;
24108 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24109 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
24110 weight = CW_Constant;
24114 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24115 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
24116 weight = CW_Constant;
24120 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24121 if (C->getZExtValue() <= 3)
24122 weight = CW_Constant;
24126 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24127 if (C->getZExtValue() <= 0xff)
24128 weight = CW_Constant;
24133 if (dyn_cast<ConstantFP>(CallOperandVal)) {
24134 weight = CW_Constant;
24138 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24139 if ((C->getSExtValue() >= -0x80000000LL) &&
24140 (C->getSExtValue() <= 0x7fffffffLL))
24141 weight = CW_Constant;
24145 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
24146 if (C->getZExtValue() <= 0xffffffff)
24147 weight = CW_Constant;
24154 /// LowerXConstraint - try to replace an X constraint, which matches anything,
24155 /// with another that has more specific requirements based on the type of the
24156 /// corresponding operand.
24157 const char *X86TargetLowering::
24158 LowerXConstraint(EVT ConstraintVT) const {
24159 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
24160 // 'f' like normal targets.
24161 if (ConstraintVT.isFloatingPoint()) {
24162 if (Subtarget->hasSSE2())
24164 if (Subtarget->hasSSE1())
24168 return TargetLowering::LowerXConstraint(ConstraintVT);
24171 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
24172 /// vector. If it is invalid, don't add anything to Ops.
24173 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
24174 std::string &Constraint,
24175 std::vector<SDValue>&Ops,
24176 SelectionDAG &DAG) const {
24179 // Only support length 1 constraints for now.
24180 if (Constraint.length() > 1) return;
24182 char ConstraintLetter = Constraint[0];
24183 switch (ConstraintLetter) {
24186 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24187 if (C->getZExtValue() <= 31) {
24188 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24194 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24195 if (C->getZExtValue() <= 63) {
24196 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24202 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24203 if (isInt<8>(C->getSExtValue())) {
24204 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24210 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24211 if (C->getZExtValue() <= 255) {
24212 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24218 // 32-bit signed value
24219 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24220 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24221 C->getSExtValue())) {
24222 // Widen to 64 bits here to get it sign extended.
24223 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
24226 // FIXME gcc accepts some relocatable values here too, but only in certain
24227 // memory models; it's complicated.
24232 // 32-bit unsigned value
24233 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24234 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24235 C->getZExtValue())) {
24236 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24240 // FIXME gcc accepts some relocatable values here too, but only in certain
24241 // memory models; it's complicated.
24245 // Literal immediates are always ok.
24246 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
24247 // Widen to 64 bits here to get it sign extended.
24248 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
24252 // In any sort of PIC mode addresses need to be computed at runtime by
24253 // adding in a register or some sort of table lookup. These can't
24254 // be used as immediates.
24255 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
24258 // If we are in non-pic codegen mode, we allow the address of a global (with
24259 // an optional displacement) to be used with 'i'.
24260 GlobalAddressSDNode *GA = nullptr;
24261 int64_t Offset = 0;
24263 // Match either (GA), (GA+C), (GA+C1+C2), etc.
24265 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
24266 Offset += GA->getOffset();
24268 } else if (Op.getOpcode() == ISD::ADD) {
24269 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24270 Offset += C->getZExtValue();
24271 Op = Op.getOperand(0);
24274 } else if (Op.getOpcode() == ISD::SUB) {
24275 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24276 Offset += -C->getZExtValue();
24277 Op = Op.getOperand(0);
24282 // Otherwise, this isn't something we can handle, reject it.
24286 const GlobalValue *GV = GA->getGlobal();
24287 // If we require an extra load to get this address, as in PIC mode, we
24288 // can't accept it.
24289 if (isGlobalStubReference(
24290 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
24293 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
24294 GA->getValueType(0), Offset);
24299 if (Result.getNode()) {
24300 Ops.push_back(Result);
24303 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
24306 std::pair<unsigned, const TargetRegisterClass*>
24307 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
24309 // First, see if this is a constraint that directly corresponds to an LLVM
24311 if (Constraint.size() == 1) {
24312 // GCC Constraint Letters
24313 switch (Constraint[0]) {
24315 // TODO: Slight differences here in allocation order and leaving
24316 // RIP in the class. Do they matter any more here than they do
24317 // in the normal allocation?
24318 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
24319 if (Subtarget->is64Bit()) {
24320 if (VT == MVT::i32 || VT == MVT::f32)
24321 return std::make_pair(0U, &X86::GR32RegClass);
24322 if (VT == MVT::i16)
24323 return std::make_pair(0U, &X86::GR16RegClass);
24324 if (VT == MVT::i8 || VT == MVT::i1)
24325 return std::make_pair(0U, &X86::GR8RegClass);
24326 if (VT == MVT::i64 || VT == MVT::f64)
24327 return std::make_pair(0U, &X86::GR64RegClass);
24330 // 32-bit fallthrough
24331 case 'Q': // Q_REGS
24332 if (VT == MVT::i32 || VT == MVT::f32)
24333 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
24334 if (VT == MVT::i16)
24335 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
24336 if (VT == MVT::i8 || VT == MVT::i1)
24337 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
24338 if (VT == MVT::i64)
24339 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
24341 case 'r': // GENERAL_REGS
24342 case 'l': // INDEX_REGS
24343 if (VT == MVT::i8 || VT == MVT::i1)
24344 return std::make_pair(0U, &X86::GR8RegClass);
24345 if (VT == MVT::i16)
24346 return std::make_pair(0U, &X86::GR16RegClass);
24347 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
24348 return std::make_pair(0U, &X86::GR32RegClass);
24349 return std::make_pair(0U, &X86::GR64RegClass);
24350 case 'R': // LEGACY_REGS
24351 if (VT == MVT::i8 || VT == MVT::i1)
24352 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
24353 if (VT == MVT::i16)
24354 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
24355 if (VT == MVT::i32 || !Subtarget->is64Bit())
24356 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
24357 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
24358 case 'f': // FP Stack registers.
24359 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
24360 // value to the correct fpstack register class.
24361 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
24362 return std::make_pair(0U, &X86::RFP32RegClass);
24363 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
24364 return std::make_pair(0U, &X86::RFP64RegClass);
24365 return std::make_pair(0U, &X86::RFP80RegClass);
24366 case 'y': // MMX_REGS if MMX allowed.
24367 if (!Subtarget->hasMMX()) break;
24368 return std::make_pair(0U, &X86::VR64RegClass);
24369 case 'Y': // SSE_REGS if SSE2 allowed
24370 if (!Subtarget->hasSSE2()) break;
24372 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
24373 if (!Subtarget->hasSSE1()) break;
24375 switch (VT.SimpleTy) {
24377 // Scalar SSE types.
24380 return std::make_pair(0U, &X86::FR32RegClass);
24383 return std::make_pair(0U, &X86::FR64RegClass);
24391 return std::make_pair(0U, &X86::VR128RegClass);
24399 return std::make_pair(0U, &X86::VR256RegClass);
24404 return std::make_pair(0U, &X86::VR512RegClass);
24410 // Use the default implementation in TargetLowering to convert the register
24411 // constraint into a member of a register class.
24412 std::pair<unsigned, const TargetRegisterClass*> Res;
24413 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
24415 // Not found as a standard register?
24417 // Map st(0) -> st(7) -> ST0
24418 if (Constraint.size() == 7 && Constraint[0] == '{' &&
24419 tolower(Constraint[1]) == 's' &&
24420 tolower(Constraint[2]) == 't' &&
24421 Constraint[3] == '(' &&
24422 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
24423 Constraint[5] == ')' &&
24424 Constraint[6] == '}') {
24426 Res.first = X86::FP0+Constraint[4]-'0';
24427 Res.second = &X86::RFP80RegClass;
24431 // GCC allows "st(0)" to be called just plain "st".
24432 if (StringRef("{st}").equals_lower(Constraint)) {
24433 Res.first = X86::FP0;
24434 Res.second = &X86::RFP80RegClass;
24439 if (StringRef("{flags}").equals_lower(Constraint)) {
24440 Res.first = X86::EFLAGS;
24441 Res.second = &X86::CCRRegClass;
24445 // 'A' means EAX + EDX.
24446 if (Constraint == "A") {
24447 Res.first = X86::EAX;
24448 Res.second = &X86::GR32_ADRegClass;
24454 // Otherwise, check to see if this is a register class of the wrong value
24455 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
24456 // turn into {ax},{dx}.
24457 if (Res.second->hasType(VT))
24458 return Res; // Correct type already, nothing to do.
24460 // All of the single-register GCC register classes map their values onto
24461 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
24462 // really want an 8-bit or 32-bit register, map to the appropriate register
24463 // class and return the appropriate register.
24464 if (Res.second == &X86::GR16RegClass) {
24465 if (VT == MVT::i8 || VT == MVT::i1) {
24466 unsigned DestReg = 0;
24467 switch (Res.first) {
24469 case X86::AX: DestReg = X86::AL; break;
24470 case X86::DX: DestReg = X86::DL; break;
24471 case X86::CX: DestReg = X86::CL; break;
24472 case X86::BX: DestReg = X86::BL; break;
24475 Res.first = DestReg;
24476 Res.second = &X86::GR8RegClass;
24478 } else if (VT == MVT::i32 || VT == MVT::f32) {
24479 unsigned DestReg = 0;
24480 switch (Res.first) {
24482 case X86::AX: DestReg = X86::EAX; break;
24483 case X86::DX: DestReg = X86::EDX; break;
24484 case X86::CX: DestReg = X86::ECX; break;
24485 case X86::BX: DestReg = X86::EBX; break;
24486 case X86::SI: DestReg = X86::ESI; break;
24487 case X86::DI: DestReg = X86::EDI; break;
24488 case X86::BP: DestReg = X86::EBP; break;
24489 case X86::SP: DestReg = X86::ESP; break;
24492 Res.first = DestReg;
24493 Res.second = &X86::GR32RegClass;
24495 } else if (VT == MVT::i64 || VT == MVT::f64) {
24496 unsigned DestReg = 0;
24497 switch (Res.first) {
24499 case X86::AX: DestReg = X86::RAX; break;
24500 case X86::DX: DestReg = X86::RDX; break;
24501 case X86::CX: DestReg = X86::RCX; break;
24502 case X86::BX: DestReg = X86::RBX; break;
24503 case X86::SI: DestReg = X86::RSI; break;
24504 case X86::DI: DestReg = X86::RDI; break;
24505 case X86::BP: DestReg = X86::RBP; break;
24506 case X86::SP: DestReg = X86::RSP; break;
24509 Res.first = DestReg;
24510 Res.second = &X86::GR64RegClass;
24513 } else if (Res.second == &X86::FR32RegClass ||
24514 Res.second == &X86::FR64RegClass ||
24515 Res.second == &X86::VR128RegClass ||
24516 Res.second == &X86::VR256RegClass ||
24517 Res.second == &X86::FR32XRegClass ||
24518 Res.second == &X86::FR64XRegClass ||
24519 Res.second == &X86::VR128XRegClass ||
24520 Res.second == &X86::VR256XRegClass ||
24521 Res.second == &X86::VR512RegClass) {
24522 // Handle references to XMM physical registers that got mapped into the
24523 // wrong class. This can happen with constraints like {xmm0} where the
24524 // target independent register mapper will just pick the first match it can
24525 // find, ignoring the required type.
24527 if (VT == MVT::f32 || VT == MVT::i32)
24528 Res.second = &X86::FR32RegClass;
24529 else if (VT == MVT::f64 || VT == MVT::i64)
24530 Res.second = &X86::FR64RegClass;
24531 else if (X86::VR128RegClass.hasType(VT))
24532 Res.second = &X86::VR128RegClass;
24533 else if (X86::VR256RegClass.hasType(VT))
24534 Res.second = &X86::VR256RegClass;
24535 else if (X86::VR512RegClass.hasType(VT))
24536 Res.second = &X86::VR512RegClass;
24542 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
24544 // Scaling factors are not free at all.
24545 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
24546 // will take 2 allocations in the out of order engine instead of 1
24547 // for plain addressing mode, i.e. inst (reg1).
24549 // vaddps (%rsi,%drx), %ymm0, %ymm1
24550 // Requires two allocations (one for the load, one for the computation)
24552 // vaddps (%rsi), %ymm0, %ymm1
24553 // Requires just 1 allocation, i.e., freeing allocations for other operations
24554 // and having less micro operations to execute.
24556 // For some X86 architectures, this is even worse because for instance for
24557 // stores, the complex addressing mode forces the instruction to use the
24558 // "load" ports instead of the dedicated "store" port.
24559 // E.g., on Haswell:
24560 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
24561 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
24562 if (isLegalAddressingMode(AM, Ty))
24563 // Scale represents reg2 * scale, thus account for 1
24564 // as soon as we use a second register.
24565 return AM.Scale != 0;
24569 bool X86TargetLowering::isTargetFTOL() const {
24570 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();