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 assert(*Args[i] < (int)Args.size() * 2 &&
7170 "Argument outside the range of possible shuffle inputs!");
7171 if (Mask[i] != -1 && Mask[i] != *Args[i])
7179 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7182 /// This is a fast way to test a shuffle mask against a fixed pattern:
7184 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7186 /// It returns true if the mask is exactly as wide as the argument list, and
7187 /// each element of the mask is either -1 (signifying undef) or the value given
7188 /// in the argument.
7189 static const VariadicFunction1<
7190 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7192 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7194 /// This helper function produces an 8-bit shuffle immediate corresponding to
7195 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7196 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7199 /// NB: We rely heavily on "undef" masks preserving the input lane.
7200 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7201 SelectionDAG &DAG) {
7202 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7203 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7204 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7205 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7206 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7209 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7210 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7211 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7212 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7213 return DAG.getConstant(Imm, MVT::i8);
7216 /// \brief Try to emit a blend instruction for a shuffle.
7218 /// This doesn't do any checks for the availability of instructions for blending
7219 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7220 /// be matched in the backend with the type given. What it does check for is
7221 /// that the shuffle mask is in fact a blend.
7222 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7223 SDValue V2, ArrayRef<int> Mask,
7224 SelectionDAG &DAG) {
7226 unsigned BlendMask = 0;
7227 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7228 if (Mask[i] >= Size) {
7229 if (Mask[i] != i + Size)
7230 return SDValue(); // Shuffled V2 input!
7231 BlendMask |= 1u << i;
7234 if (Mask[i] >= 0 && Mask[i] != i)
7235 return SDValue(); // Shuffled V1 input!
7237 if (VT == MVT::v4f32 || VT == MVT::v2f64)
7238 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7239 DAG.getConstant(BlendMask, MVT::i8));
7240 assert(!VT.isFloatingPoint() && "Only v4f32 and v2f64 are supported!");
7242 // For integer shuffles we need to expand the mask and cast the inputs to
7243 // v8i16s prior to blending.
7244 assert((VT == MVT::v8i16 || VT == MVT::v4i32 || VT == MVT::v2i64) &&
7245 "Not a supported integer vector type!");
7246 int Scale = 8 / VT.getVectorNumElements();
7248 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7249 if (Mask[i] >= Size)
7250 for (int j = 0; j < Scale; ++j)
7251 BlendMask |= 1u << (i * Scale + j);
7253 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7254 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7255 return DAG.getNode(ISD::BITCAST, DL, VT,
7256 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7257 DAG.getConstant(BlendMask, MVT::i8)));
7260 /// \brief Try to lower a vector shuffle as a byte rotation.
7262 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7263 /// byte-rotation of a the concatentation of two vectors. This routine will
7264 /// try to generically lower a vector shuffle through such an instruction. It
7265 /// does not check for the availability of PALIGNR-based lowerings, only the
7266 /// applicability of this strategy to the given mask. This matches shuffle
7267 /// vectors that look like:
7269 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7271 /// Essentially it concatenates V1 and V2, shifts right by some number of
7272 /// elements, and takes the low elements as the result. Note that while this is
7273 /// specified as a *right shift* because x86 is little-endian, it is a *left
7274 /// rotate* of the vector lanes.
7276 /// Note that this only handles 128-bit vector widths currently.
7277 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7280 SelectionDAG &DAG) {
7281 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7283 // We need to detect various ways of spelling a rotation:
7284 // [11, 12, 13, 14, 15, 0, 1, 2]
7285 // [-1, 12, 13, 14, -1, -1, 1, -1]
7286 // [-1, -1, -1, -1, -1, -1, 1, 2]
7287 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7288 // [-1, 4, 5, 6, -1, -1, 9, -1]
7289 // [-1, 4, 5, 6, -1, -1, -1, -1]
7292 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7295 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7297 // Based on the mod-Size value of this mask element determine where
7298 // a rotated vector would have started.
7299 int StartIdx = i - (Mask[i] % Size);
7301 // The identity rotation isn't interesting, stop.
7304 // If we found the tail of a vector the rotation must be the missing
7305 // front. If we found the head of a vector, it must be how much of the head.
7306 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7309 Rotation = CandidateRotation;
7310 else if (Rotation != CandidateRotation)
7311 // The rotations don't match, so we can't match this mask.
7314 // Compute which value this mask is pointing at.
7315 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7317 // Compute which of the two target values this index should be assigned to.
7318 // This reflects whether the high elements are remaining or the low elements
7320 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7322 // Either set up this value if we've not encountered it before, or check
7323 // that it remains consistent.
7326 else if (TargetV != MaskV)
7327 // This may be a rotation, but it pulls from the inputs in some
7328 // unsupported interleaving.
7332 // Check that we successfully analyzed the mask, and normalize the results.
7333 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7334 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7340 // Cast the inputs to v16i8 to match PALIGNR.
7341 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7342 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7344 assert(VT.getSizeInBits() == 128 &&
7345 "Rotate-based lowering only supports 128-bit lowering!");
7346 assert(Mask.size() <= 16 &&
7347 "Can shuffle at most 16 bytes in a 128-bit vector!");
7348 // The actual rotate instruction rotates bytes, so we need to scale the
7349 // rotation based on how many bytes are in the vector.
7350 int Scale = 16 / Mask.size();
7352 return DAG.getNode(ISD::BITCAST, DL, VT,
7353 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7354 DAG.getConstant(Rotation * Scale, MVT::i8)));
7357 /// \brief Compute whether each element of a shuffle is zeroable.
7359 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7360 /// Either it is an undef element in the shuffle mask, the element of the input
7361 /// referenced is undef, or the element of the input referenced is known to be
7362 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7363 /// as many lanes with this technique as possible to simplify the remaining
7365 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7366 SDValue V1, SDValue V2) {
7367 SmallBitVector Zeroable(Mask.size(), false);
7369 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7370 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7372 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7374 // Handle the easy cases.
7375 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7380 // If this is an index into a build_vector node, dig out the input value and
7382 SDValue V = M < Size ? V1 : V2;
7383 if (V.getOpcode() != ISD::BUILD_VECTOR)
7386 SDValue Input = V.getOperand(M % Size);
7387 // The UNDEF opcode check really should be dead code here, but not quite
7388 // worth asserting on (it isn't invalid, just unexpected).
7389 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7396 /// \brief Lower a vector shuffle as a zero or any extension.
7398 /// Given a specific number of elements, element bit width, and extension
7399 /// stride, produce either a zero or any extension based on the available
7400 /// features of the subtarget.
7401 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7402 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7403 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7404 assert(Scale > 1 && "Need a scale to extend.");
7405 int EltBits = VT.getSizeInBits() / NumElements;
7406 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7407 "Only 8, 16, and 32 bit elements can be extended.");
7408 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7410 // Found a valid zext mask! Try various lowering strategies based on the
7411 // input type and available ISA extensions.
7412 if (Subtarget->hasSSE41()) {
7413 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7414 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7415 NumElements / Scale);
7416 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7417 return DAG.getNode(ISD::BITCAST, DL, VT,
7418 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7421 // For any extends we can cheat for larger element sizes and use shuffle
7422 // instructions that can fold with a load and/or copy.
7423 if (AnyExt && EltBits == 32) {
7424 int PSHUFDMask[4] = {0, -1, 1, -1};
7426 ISD::BITCAST, DL, VT,
7427 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7428 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7429 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7431 if (AnyExt && EltBits == 16 && Scale > 2) {
7432 int PSHUFDMask[4] = {0, -1, 0, -1};
7433 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7434 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7435 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7436 int PSHUFHWMask[4] = {1, -1, -1, -1};
7438 ISD::BITCAST, DL, VT,
7439 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7440 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7441 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7444 // If this would require more than 2 unpack instructions to expand, use
7445 // pshufb when available. We can only use more than 2 unpack instructions
7446 // when zero extending i8 elements which also makes it easier to use pshufb.
7447 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7448 assert(NumElements == 16 && "Unexpected byte vector width!");
7449 SDValue PSHUFBMask[16];
7450 for (int i = 0; i < 16; ++i)
7452 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7453 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7454 return DAG.getNode(ISD::BITCAST, DL, VT,
7455 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7456 DAG.getNode(ISD::BUILD_VECTOR, DL,
7457 MVT::v16i8, PSHUFBMask)));
7460 // Otherwise emit a sequence of unpacks.
7462 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7463 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7464 : getZeroVector(InputVT, Subtarget, DAG, DL);
7465 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7466 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7470 } while (Scale > 1);
7471 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7474 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7476 /// This routine will try to do everything in its power to cleverly lower
7477 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7478 /// check for the profitability of this lowering, it tries to aggressively
7479 /// match this pattern. It will use all of the micro-architectural details it
7480 /// can to emit an efficient lowering. It handles both blends with all-zero
7481 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7482 /// masking out later).
7484 /// The reason we have dedicated lowering for zext-style shuffles is that they
7485 /// are both incredibly common and often quite performance sensitive.
7486 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7487 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7488 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7489 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7491 int Bits = VT.getSizeInBits();
7492 int NumElements = Mask.size();
7494 // Define a helper function to check a particular ext-scale and lower to it if
7496 auto Lower = [&](int Scale) -> SDValue {
7499 for (int i = 0; i < NumElements; ++i) {
7501 continue; // Valid anywhere but doesn't tell us anything.
7502 if (i % Scale != 0) {
7503 // Each of the extend elements needs to be zeroable.
7507 // We no lorger are in the anyext case.
7512 // Each of the base elements needs to be consecutive indices into the
7513 // same input vector.
7514 SDValue V = Mask[i] < NumElements ? V1 : V2;
7517 else if (InputV != V)
7518 return SDValue(); // Flip-flopping inputs.
7520 if (Mask[i] % NumElements != i / Scale)
7521 return SDValue(); // Non-consecutive strided elemenst.
7524 // If we fail to find an input, we have a zero-shuffle which should always
7525 // have already been handled.
7526 // FIXME: Maybe handle this here in case during blending we end up with one?
7530 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7531 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7534 // The widest scale possible for extending is to a 64-bit integer.
7535 assert(Bits % 64 == 0 &&
7536 "The number of bits in a vector must be divisible by 64 on x86!");
7537 int NumExtElements = Bits / 64;
7539 // Each iteration, try extending the elements half as much, but into twice as
7541 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7542 assert(NumElements % NumExtElements == 0 &&
7543 "The input vector size must be divisble by the extended size.");
7544 if (SDValue V = Lower(NumElements / NumExtElements))
7548 // No viable ext lowering found.
7552 /// \brief Try to lower insertion of a single element into a zero vector.
7554 /// This is a common pattern that we have especially efficient patterns to lower
7555 /// across all subtarget feature sets.
7556 static SDValue lowerVectorShuffleAsElementInsertion(
7557 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7558 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7559 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7561 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7562 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7564 if (Mask.size() == 2) {
7565 if (!Zeroable[V2Index ^ 1]) {
7566 // For 2-wide masks we may be able to just invert the inputs. We use an xor
7567 // with 2 to flip from {2,3} to {0,1} and vice versa.
7568 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7569 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7570 if (Zeroable[V2Index])
7571 return lowerVectorShuffleAsElementInsertion(VT, DL, V2, V1, InverseMask,
7577 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7578 if (i != V2Index && !Zeroable[i])
7579 return SDValue(); // Not inserting into a zero vector.
7582 // Step over any bitcasts on either input so we can scan the actual
7583 // BUILD_VECTOR nodes.
7584 while (V1.getOpcode() == ISD::BITCAST)
7585 V1 = V1.getOperand(0);
7586 while (V2.getOpcode() == ISD::BITCAST)
7587 V2 = V2.getOperand(0);
7589 // Check for a single input from a SCALAR_TO_VECTOR node.
7590 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7591 // all the smarts here sunk into that routine. However, the current
7592 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7593 // vector shuffle lowering is dead.
7594 if (!((V2.getOpcode() == ISD::SCALAR_TO_VECTOR &&
7595 Mask[V2Index] == (int)Mask.size()) ||
7596 V2.getOpcode() == ISD::BUILD_VECTOR))
7599 SDValue V2S = V2.getOperand(Mask[V2Index] - Mask.size());
7601 // First, we need to zext the scalar if it is smaller than an i32.
7603 MVT EltVT = VT.getVectorElementType();
7604 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7605 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7606 // Zero-extend directly to i32.
7608 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7611 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT,
7612 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S));
7614 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7617 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7618 // the desired position. Otherwise it is more efficient to do a vector
7619 // shift left. We know that we can do a vector shift left because all
7620 // the inputs are zero.
7621 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7622 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7623 V2Shuffle[V2Index] = 0;
7624 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7626 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7628 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7630 V2Index * EltVT.getSizeInBits(),
7631 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7632 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7638 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7640 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7641 /// support for floating point shuffles but not integer shuffles. These
7642 /// instructions will incur a domain crossing penalty on some chips though so
7643 /// it is better to avoid lowering through this for integer vectors where
7645 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7646 const X86Subtarget *Subtarget,
7647 SelectionDAG &DAG) {
7649 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7650 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7651 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7652 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7653 ArrayRef<int> Mask = SVOp->getMask();
7654 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7656 if (isSingleInputShuffleMask(Mask)) {
7657 // Straight shuffle of a single input vector. Simulate this by using the
7658 // single input as both of the "inputs" to this instruction..
7659 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7660 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7661 DAG.getConstant(SHUFPDMask, MVT::i8));
7663 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7664 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7666 // Use dedicated unpack instructions for masks that match their pattern.
7667 if (isShuffleEquivalent(Mask, 0, 2))
7668 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7669 if (isShuffleEquivalent(Mask, 1, 3))
7670 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7672 // If we have a single input, insert that into V1 if we can do so cheaply.
7673 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7674 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7675 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7678 if (Subtarget->hasSSE41())
7680 lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask, DAG))
7683 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7684 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7685 DAG.getConstant(SHUFPDMask, MVT::i8));
7688 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7690 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7691 /// the integer unit to minimize domain crossing penalties. However, for blends
7692 /// it falls back to the floating point shuffle operation with appropriate bit
7694 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7695 const X86Subtarget *Subtarget,
7696 SelectionDAG &DAG) {
7698 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
7699 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7700 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
7701 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7702 ArrayRef<int> Mask = SVOp->getMask();
7703 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7705 if (isSingleInputShuffleMask(Mask)) {
7706 // Straight shuffle of a single input vector. For everything from SSE2
7707 // onward this has a single fast instruction with no scary immediates.
7708 // We have to map the mask as it is actually a v4i32 shuffle instruction.
7709 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
7710 int WidenedMask[4] = {
7711 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
7712 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
7714 ISD::BITCAST, DL, MVT::v2i64,
7715 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
7716 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
7719 // Use dedicated unpack instructions for masks that match their pattern.
7720 if (isShuffleEquivalent(Mask, 0, 2))
7721 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
7722 if (isShuffleEquivalent(Mask, 1, 3))
7723 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
7725 // If we have a single input from V2 insert that into V1 if we can do so
7727 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1)
7728 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7729 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
7732 if (Subtarget->hasSSE41())
7734 lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask, DAG))
7737 // Try to use rotation instructions if available.
7738 if (Subtarget->hasSSSE3())
7739 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7740 DL, MVT::v2i64, V1, V2, Mask, DAG))
7743 // We implement this with SHUFPD which is pretty lame because it will likely
7744 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
7745 // However, all the alternatives are still more cycles and newer chips don't
7746 // have this problem. It would be really nice if x86 had better shuffles here.
7747 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
7748 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
7749 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
7750 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
7753 /// \brief Lower 4-lane 32-bit floating point shuffles.
7755 /// Uses instructions exclusively from the floating point unit to minimize
7756 /// domain crossing penalties, as these are sufficient to implement all v4f32
7758 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7759 const X86Subtarget *Subtarget,
7760 SelectionDAG &DAG) {
7762 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
7763 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7764 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
7765 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7766 ArrayRef<int> Mask = SVOp->getMask();
7767 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7769 SDValue LowV = V1, HighV = V2;
7770 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
7773 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7775 if (NumV2Elements == 0)
7776 // Straight shuffle of a single input vector. We pass the input vector to
7777 // both operands to simulate this with a SHUFPS.
7778 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
7779 getV4X86ShuffleImm8ForMask(Mask, DAG));
7781 // Use dedicated unpack instructions for masks that match their pattern.
7782 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7783 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
7784 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7785 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
7787 if (Subtarget->hasSSE41())
7789 lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask, DAG))
7792 if (NumV2Elements == 1) {
7794 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
7797 // Check for whether we can use INSERTPS to perform the blend. We only use
7798 // INSERTPS when the V1 elements are already in the correct locations
7799 // because otherwise we can just always use two SHUFPS instructions which
7800 // are much smaller to encode than a SHUFPS and an INSERTPS.
7801 if (Subtarget->hasSSE41()) {
7802 // When using INSERTPS we can zero any lane of the destination. Collect
7803 // the zero inputs into a mask and drop them from the lanes of V1 which
7804 // actually need to be present as inputs to the INSERTPS.
7805 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7807 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
7808 bool InsertNeedsShuffle = false;
7810 for (int i = 0; i < 4; ++i)
7814 } else if (Mask[i] != i) {
7815 InsertNeedsShuffle = true;
7820 // We don't want to use INSERTPS or other insertion techniques if it will
7821 // require shuffling anyways.
7822 if (!InsertNeedsShuffle) {
7823 // If all of V1 is zeroable, replace it with undef.
7824 if ((ZMask | 1 << V2Index) == 0xF)
7825 V1 = DAG.getUNDEF(MVT::v4f32);
7827 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
7828 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
7830 // Insert the V2 element into the desired position.
7831 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
7832 DAG.getConstant(InsertPSMask, MVT::i8));
7836 // Compute the index adjacent to V2Index and in the same half by toggling
7838 int V2AdjIndex = V2Index ^ 1;
7840 if (Mask[V2AdjIndex] == -1) {
7841 // Handles all the cases where we have a single V2 element and an undef.
7842 // This will only ever happen in the high lanes because we commute the
7843 // vector otherwise.
7845 std::swap(LowV, HighV);
7846 NewMask[V2Index] -= 4;
7848 // Handle the case where the V2 element ends up adjacent to a V1 element.
7849 // To make this work, blend them together as the first step.
7850 int V1Index = V2AdjIndex;
7851 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
7852 V2 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V2, V1,
7853 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7855 // Now proceed to reconstruct the final blend as we have the necessary
7856 // high or low half formed.
7863 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
7864 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
7866 } else if (NumV2Elements == 2) {
7867 if (Mask[0] < 4 && Mask[1] < 4) {
7868 // Handle the easy case where we have V1 in the low lanes and V2 in the
7869 // high lanes. We never see this reversed because we sort the shuffle.
7873 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
7874 // trying to place elements directly, just blend them and set up the final
7875 // shuffle to place them.
7877 // The first two blend mask elements are for V1, the second two are for
7879 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
7880 Mask[2] < 4 ? Mask[2] : Mask[3],
7881 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
7882 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
7883 V1 = DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V2,
7884 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
7886 // Now we do a normal shuffle of V1 by giving V1 as both operands to
7889 NewMask[0] = Mask[0] < 4 ? 0 : 2;
7890 NewMask[1] = Mask[0] < 4 ? 2 : 0;
7891 NewMask[2] = Mask[2] < 4 ? 1 : 3;
7892 NewMask[3] = Mask[2] < 4 ? 3 : 1;
7895 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, LowV, HighV,
7896 getV4X86ShuffleImm8ForMask(NewMask, DAG));
7899 /// \brief Lower 4-lane i32 vector shuffles.
7901 /// We try to handle these with integer-domain shuffles where we can, but for
7902 /// blends we use the floating point domain blend instructions.
7903 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7904 const X86Subtarget *Subtarget,
7905 SelectionDAG &DAG) {
7907 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
7908 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7909 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
7910 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7911 ArrayRef<int> Mask = SVOp->getMask();
7912 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
7915 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
7917 if (NumV2Elements == 0) {
7918 // Straight shuffle of a single input vector. For everything from SSE2
7919 // onward this has a single fast instruction with no scary immediates.
7920 // We coerce the shuffle pattern to be compatible with UNPCK instructions
7921 // but we aren't actually going to use the UNPCK instruction because doing
7922 // so prevents folding a load into this instruction or making a copy.
7923 const int UnpackLoMask[] = {0, 0, 1, 1};
7924 const int UnpackHiMask[] = {2, 2, 3, 3};
7925 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
7926 Mask = UnpackLoMask;
7927 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
7928 Mask = UnpackHiMask;
7930 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
7931 getV4X86ShuffleImm8ForMask(Mask, DAG));
7934 // Whenever we can lower this as a zext, that instruction is strictly faster
7935 // than any alternative.
7936 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
7937 Mask, Subtarget, DAG))
7940 // Use dedicated unpack instructions for masks that match their pattern.
7941 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
7942 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
7943 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
7944 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
7946 // There are special ways we can lower some single-element blends.
7947 if (NumV2Elements == 1)
7948 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
7949 Mask, Subtarget, DAG))
7952 if (Subtarget->hasSSE41())
7954 lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask, DAG))
7957 // Try to use rotation instructions if available.
7958 if (Subtarget->hasSSSE3())
7959 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
7960 DL, MVT::v4i32, V1, V2, Mask, DAG))
7963 // We implement this with SHUFPS because it can blend from two vectors.
7964 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
7965 // up the inputs, bypassing domain shift penalties that we would encur if we
7966 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
7968 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
7969 DAG.getVectorShuffle(
7971 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
7972 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
7975 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
7976 /// shuffle lowering, and the most complex part.
7978 /// The lowering strategy is to try to form pairs of input lanes which are
7979 /// targeted at the same half of the final vector, and then use a dword shuffle
7980 /// to place them onto the right half, and finally unpack the paired lanes into
7981 /// their final position.
7983 /// The exact breakdown of how to form these dword pairs and align them on the
7984 /// correct sides is really tricky. See the comments within the function for
7985 /// more of the details.
7986 static SDValue lowerV8I16SingleInputVectorShuffle(
7987 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
7988 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7989 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
7990 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
7991 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
7993 SmallVector<int, 4> LoInputs;
7994 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
7995 [](int M) { return M >= 0; });
7996 std::sort(LoInputs.begin(), LoInputs.end());
7997 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
7998 SmallVector<int, 4> HiInputs;
7999 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8000 [](int M) { return M >= 0; });
8001 std::sort(HiInputs.begin(), HiInputs.end());
8002 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8004 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8005 int NumHToL = LoInputs.size() - NumLToL;
8007 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8008 int NumHToH = HiInputs.size() - NumLToH;
8009 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8010 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8011 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8012 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8014 // Use dedicated unpack instructions for masks that match their pattern.
8015 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8016 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8017 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8018 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8020 // Try to use rotation instructions if available.
8021 if (Subtarget->hasSSSE3())
8022 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8023 DL, MVT::v8i16, V, V, Mask, DAG))
8026 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8027 // such inputs we can swap two of the dwords across the half mark and end up
8028 // with <=2 inputs to each half in each half. Once there, we can fall through
8029 // to the generic code below. For example:
8031 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8032 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8034 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8035 // and an existing 2-into-2 on the other half. In this case we may have to
8036 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8037 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8038 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8039 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8040 // half than the one we target for fixing) will be fixed when we re-enter this
8041 // path. We will also combine away any sequence of PSHUFD instructions that
8042 // result into a single instruction. Here is an example of the tricky case:
8044 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8045 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8047 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8049 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8050 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8052 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8053 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8055 // The result is fine to be handled by the generic logic.
8056 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8057 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8058 int AOffset, int BOffset) {
8059 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8060 "Must call this with A having 3 or 1 inputs from the A half.");
8061 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8062 "Must call this with B having 1 or 3 inputs from the B half.");
8063 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8064 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8066 // Compute the index of dword with only one word among the three inputs in
8067 // a half by taking the sum of the half with three inputs and subtracting
8068 // the sum of the actual three inputs. The difference is the remaining
8071 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8072 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8073 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8074 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8075 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8076 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8077 int TripleNonInputIdx =
8078 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8079 TripleDWord = TripleNonInputIdx / 2;
8081 // We use xor with one to compute the adjacent DWord to whichever one the
8083 OneInputDWord = (OneInput / 2) ^ 1;
8085 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8086 // and BToA inputs. If there is also such a problem with the BToB and AToB
8087 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8088 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8089 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8090 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8091 // Compute how many inputs will be flipped by swapping these DWords. We
8093 // to balance this to ensure we don't form a 3-1 shuffle in the other
8095 int NumFlippedAToBInputs =
8096 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8097 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8098 int NumFlippedBToBInputs =
8099 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8100 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8101 if ((NumFlippedAToBInputs == 1 &&
8102 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8103 (NumFlippedBToBInputs == 1 &&
8104 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8105 // We choose whether to fix the A half or B half based on whether that
8106 // half has zero flipped inputs. At zero, we may not be able to fix it
8107 // with that half. We also bias towards fixing the B half because that
8108 // will more commonly be the high half, and we have to bias one way.
8109 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8110 ArrayRef<int> Inputs) {
8111 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8112 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8113 PinnedIdx ^ 1) != Inputs.end();
8114 // Determine whether the free index is in the flipped dword or the
8115 // unflipped dword based on where the pinned index is. We use this bit
8116 // in an xor to conditionally select the adjacent dword.
8117 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8118 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8119 FixFreeIdx) != Inputs.end();
8120 if (IsFixIdxInput == IsFixFreeIdxInput)
8122 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8123 FixFreeIdx) != Inputs.end();
8124 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8125 "We need to be changing the number of flipped inputs!");
8126 int PSHUFHalfMask[] = {0, 1, 2, 3};
8127 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8128 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8130 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8133 if (M != -1 && M == FixIdx)
8135 else if (M != -1 && M == FixFreeIdx)
8138 if (NumFlippedBToBInputs != 0) {
8140 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8141 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8143 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8145 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8146 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8151 int PSHUFDMask[] = {0, 1, 2, 3};
8152 PSHUFDMask[ADWord] = BDWord;
8153 PSHUFDMask[BDWord] = ADWord;
8154 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8155 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8156 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8157 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8159 // Adjust the mask to match the new locations of A and B.
8161 if (M != -1 && M/2 == ADWord)
8162 M = 2 * BDWord + M % 2;
8163 else if (M != -1 && M/2 == BDWord)
8164 M = 2 * ADWord + M % 2;
8166 // Recurse back into this routine to re-compute state now that this isn't
8167 // a 3 and 1 problem.
8168 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8171 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8172 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8173 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8174 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8176 // At this point there are at most two inputs to the low and high halves from
8177 // each half. That means the inputs can always be grouped into dwords and
8178 // those dwords can then be moved to the correct half with a dword shuffle.
8179 // We use at most one low and one high word shuffle to collect these paired
8180 // inputs into dwords, and finally a dword shuffle to place them.
8181 int PSHUFLMask[4] = {-1, -1, -1, -1};
8182 int PSHUFHMask[4] = {-1, -1, -1, -1};
8183 int PSHUFDMask[4] = {-1, -1, -1, -1};
8185 // First fix the masks for all the inputs that are staying in their
8186 // original halves. This will then dictate the targets of the cross-half
8188 auto fixInPlaceInputs =
8189 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8190 MutableArrayRef<int> SourceHalfMask,
8191 MutableArrayRef<int> HalfMask, int HalfOffset) {
8192 if (InPlaceInputs.empty())
8194 if (InPlaceInputs.size() == 1) {
8195 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8196 InPlaceInputs[0] - HalfOffset;
8197 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8200 if (IncomingInputs.empty()) {
8201 // Just fix all of the in place inputs.
8202 for (int Input : InPlaceInputs) {
8203 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8204 PSHUFDMask[Input / 2] = Input / 2;
8209 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8210 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8211 InPlaceInputs[0] - HalfOffset;
8212 // Put the second input next to the first so that they are packed into
8213 // a dword. We find the adjacent index by toggling the low bit.
8214 int AdjIndex = InPlaceInputs[0] ^ 1;
8215 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8216 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8217 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8219 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8220 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8222 // Now gather the cross-half inputs and place them into a free dword of
8223 // their target half.
8224 // FIXME: This operation could almost certainly be simplified dramatically to
8225 // look more like the 3-1 fixing operation.
8226 auto moveInputsToRightHalf = [&PSHUFDMask](
8227 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8228 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8229 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8231 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8232 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8234 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8236 int LowWord = Word & ~1;
8237 int HighWord = Word | 1;
8238 return isWordClobbered(SourceHalfMask, LowWord) ||
8239 isWordClobbered(SourceHalfMask, HighWord);
8242 if (IncomingInputs.empty())
8245 if (ExistingInputs.empty()) {
8246 // Map any dwords with inputs from them into the right half.
8247 for (int Input : IncomingInputs) {
8248 // If the source half mask maps over the inputs, turn those into
8249 // swaps and use the swapped lane.
8250 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8251 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8252 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8253 Input - SourceOffset;
8254 // We have to swap the uses in our half mask in one sweep.
8255 for (int &M : HalfMask)
8256 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8258 else if (M == Input)
8259 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8261 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8262 Input - SourceOffset &&
8263 "Previous placement doesn't match!");
8265 // Note that this correctly re-maps both when we do a swap and when
8266 // we observe the other side of the swap above. We rely on that to
8267 // avoid swapping the members of the input list directly.
8268 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8271 // Map the input's dword into the correct half.
8272 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8273 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8275 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8277 "Previous placement doesn't match!");
8280 // And just directly shift any other-half mask elements to be same-half
8281 // as we will have mirrored the dword containing the element into the
8282 // same position within that half.
8283 for (int &M : HalfMask)
8284 if (M >= SourceOffset && M < SourceOffset + 4) {
8285 M = M - SourceOffset + DestOffset;
8286 assert(M >= 0 && "This should never wrap below zero!");
8291 // Ensure we have the input in a viable dword of its current half. This
8292 // is particularly tricky because the original position may be clobbered
8293 // by inputs being moved and *staying* in that half.
8294 if (IncomingInputs.size() == 1) {
8295 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8296 int InputFixed = std::find(std::begin(SourceHalfMask),
8297 std::end(SourceHalfMask), -1) -
8298 std::begin(SourceHalfMask) + SourceOffset;
8299 SourceHalfMask[InputFixed - SourceOffset] =
8300 IncomingInputs[0] - SourceOffset;
8301 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8303 IncomingInputs[0] = InputFixed;
8305 } else if (IncomingInputs.size() == 2) {
8306 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8307 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8308 // We have two non-adjacent or clobbered inputs we need to extract from
8309 // the source half. To do this, we need to map them into some adjacent
8310 // dword slot in the source mask.
8311 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8312 IncomingInputs[1] - SourceOffset};
8314 // If there is a free slot in the source half mask adjacent to one of
8315 // the inputs, place the other input in it. We use (Index XOR 1) to
8316 // compute an adjacent index.
8317 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8318 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8319 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8320 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8321 InputsFixed[1] = InputsFixed[0] ^ 1;
8322 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8323 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8324 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8325 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8326 InputsFixed[0] = InputsFixed[1] ^ 1;
8327 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8328 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8329 // The two inputs are in the same DWord but it is clobbered and the
8330 // adjacent DWord isn't used at all. Move both inputs to the free
8332 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8333 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8334 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8335 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8337 // The only way we hit this point is if there is no clobbering
8338 // (because there are no off-half inputs to this half) and there is no
8339 // free slot adjacent to one of the inputs. In this case, we have to
8340 // swap an input with a non-input.
8341 for (int i = 0; i < 4; ++i)
8342 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8343 "We can't handle any clobbers here!");
8344 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8345 "Cannot have adjacent inputs here!");
8347 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8348 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8350 // We also have to update the final source mask in this case because
8351 // it may need to undo the above swap.
8352 for (int &M : FinalSourceHalfMask)
8353 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8354 M = InputsFixed[1] + SourceOffset;
8355 else if (M == InputsFixed[1] + SourceOffset)
8356 M = (InputsFixed[0] ^ 1) + SourceOffset;
8358 InputsFixed[1] = InputsFixed[0] ^ 1;
8361 // Point everything at the fixed inputs.
8362 for (int &M : HalfMask)
8363 if (M == IncomingInputs[0])
8364 M = InputsFixed[0] + SourceOffset;
8365 else if (M == IncomingInputs[1])
8366 M = InputsFixed[1] + SourceOffset;
8368 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8369 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8372 llvm_unreachable("Unhandled input size!");
8375 // Now hoist the DWord down to the right half.
8376 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8377 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8378 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8379 for (int &M : HalfMask)
8380 for (int Input : IncomingInputs)
8382 M = FreeDWord * 2 + Input % 2;
8384 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8385 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8386 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8387 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8389 // Now enact all the shuffles we've computed to move the inputs into their
8391 if (!isNoopShuffleMask(PSHUFLMask))
8392 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8393 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8394 if (!isNoopShuffleMask(PSHUFHMask))
8395 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8396 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8397 if (!isNoopShuffleMask(PSHUFDMask))
8398 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8399 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8400 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8401 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8403 // At this point, each half should contain all its inputs, and we can then
8404 // just shuffle them into their final position.
8405 assert(std::count_if(LoMask.begin(), LoMask.end(),
8406 [](int M) { return M >= 4; }) == 0 &&
8407 "Failed to lift all the high half inputs to the low mask!");
8408 assert(std::count_if(HiMask.begin(), HiMask.end(),
8409 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8410 "Failed to lift all the low half inputs to the high mask!");
8412 // Do a half shuffle for the low mask.
8413 if (!isNoopShuffleMask(LoMask))
8414 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8415 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8417 // Do a half shuffle with the high mask after shifting its values down.
8418 for (int &M : HiMask)
8421 if (!isNoopShuffleMask(HiMask))
8422 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8423 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8428 /// \brief Detect whether the mask pattern should be lowered through
8431 /// This essentially tests whether viewing the mask as an interleaving of two
8432 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8433 /// lowering it through interleaving is a significantly better strategy.
8434 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8435 int NumEvenInputs[2] = {0, 0};
8436 int NumOddInputs[2] = {0, 0};
8437 int NumLoInputs[2] = {0, 0};
8438 int NumHiInputs[2] = {0, 0};
8439 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8443 int InputIdx = Mask[i] >= Size;
8446 ++NumLoInputs[InputIdx];
8448 ++NumHiInputs[InputIdx];
8451 ++NumEvenInputs[InputIdx];
8453 ++NumOddInputs[InputIdx];
8456 // The minimum number of cross-input results for both the interleaved and
8457 // split cases. If interleaving results in fewer cross-input results, return
8459 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8460 NumEvenInputs[0] + NumOddInputs[1]);
8461 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8462 NumLoInputs[0] + NumHiInputs[1]);
8463 return InterleavedCrosses < SplitCrosses;
8466 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8468 /// This strategy only works when the inputs from each vector fit into a single
8469 /// half of that vector, and generally there are not so many inputs as to leave
8470 /// the in-place shuffles required highly constrained (and thus expensive). It
8471 /// shifts all the inputs into a single side of both input vectors and then
8472 /// uses an unpack to interleave these inputs in a single vector. At that
8473 /// point, we will fall back on the generic single input shuffle lowering.
8474 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8476 MutableArrayRef<int> Mask,
8477 const X86Subtarget *Subtarget,
8478 SelectionDAG &DAG) {
8479 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8480 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8481 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8482 for (int i = 0; i < 8; ++i)
8483 if (Mask[i] >= 0 && Mask[i] < 4)
8484 LoV1Inputs.push_back(i);
8485 else if (Mask[i] >= 4 && Mask[i] < 8)
8486 HiV1Inputs.push_back(i);
8487 else if (Mask[i] >= 8 && Mask[i] < 12)
8488 LoV2Inputs.push_back(i);
8489 else if (Mask[i] >= 12)
8490 HiV2Inputs.push_back(i);
8492 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8493 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8496 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8497 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8498 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8500 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8501 HiV1Inputs.size() + HiV2Inputs.size();
8503 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8504 ArrayRef<int> HiInputs, bool MoveToLo,
8506 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8507 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8508 if (BadInputs.empty())
8511 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8512 int MoveOffset = MoveToLo ? 0 : 4;
8514 if (GoodInputs.empty()) {
8515 for (int BadInput : BadInputs) {
8516 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8517 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8520 if (GoodInputs.size() == 2) {
8521 // If the low inputs are spread across two dwords, pack them into
8523 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8524 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8525 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8526 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8528 // Otherwise pin the good inputs.
8529 for (int GoodInput : GoodInputs)
8530 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8533 if (BadInputs.size() == 2) {
8534 // If we have two bad inputs then there may be either one or two good
8535 // inputs fixed in place. Find a fixed input, and then find the *other*
8536 // two adjacent indices by using modular arithmetic.
8538 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8539 [](int M) { return M >= 0; }) -
8540 std::begin(MoveMask);
8542 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8543 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8544 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8545 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8546 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8547 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8548 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8550 assert(BadInputs.size() == 1 && "All sizes handled");
8551 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8552 std::end(MoveMask), -1) -
8553 std::begin(MoveMask);
8554 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8555 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8559 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8562 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8564 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8567 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8568 // cross-half traffic in the final shuffle.
8570 // Munge the mask to be a single-input mask after the unpack merges the
8574 M = 2 * (M % 4) + (M / 8);
8576 return DAG.getVectorShuffle(
8577 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8578 DL, MVT::v8i16, V1, V2),
8579 DAG.getUNDEF(MVT::v8i16), Mask);
8582 /// \brief Generic lowering of 8-lane i16 shuffles.
8584 /// This handles both single-input shuffles and combined shuffle/blends with
8585 /// two inputs. The single input shuffles are immediately delegated to
8586 /// a dedicated lowering routine.
8588 /// The blends are lowered in one of three fundamental ways. If there are few
8589 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8590 /// of the input is significantly cheaper when lowered as an interleaving of
8591 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8592 /// halves of the inputs separately (making them have relatively few inputs)
8593 /// and then concatenate them.
8594 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8595 const X86Subtarget *Subtarget,
8596 SelectionDAG &DAG) {
8598 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8599 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8600 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8601 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8602 ArrayRef<int> OrigMask = SVOp->getMask();
8603 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8604 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8605 MutableArrayRef<int> Mask(MaskStorage);
8607 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8609 // Whenever we can lower this as a zext, that instruction is strictly faster
8610 // than any alternative.
8611 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8612 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8615 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8616 auto isV2 = [](int M) { return M >= 8; };
8618 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8619 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8621 if (NumV2Inputs == 0)
8622 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8624 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
8625 "to be V1-input shuffles.");
8627 // There are special ways we can lower some single-element blends.
8628 if (NumV2Inputs == 1)
8629 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
8630 Mask, Subtarget, DAG))
8633 if (Subtarget->hasSSE41())
8635 lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask, DAG))
8638 // Try to use rotation instructions if available.
8639 if (Subtarget->hasSSSE3())
8640 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
8643 if (NumV1Inputs + NumV2Inputs <= 4)
8644 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
8646 // Check whether an interleaving lowering is likely to be more efficient.
8647 // This isn't perfect but it is a strong heuristic that tends to work well on
8648 // the kinds of shuffles that show up in practice.
8650 // FIXME: Handle 1x, 2x, and 4x interleaving.
8651 if (shouldLowerAsInterleaving(Mask)) {
8652 // FIXME: Figure out whether we should pack these into the low or high
8655 int EMask[8], OMask[8];
8656 for (int i = 0; i < 4; ++i) {
8657 EMask[i] = Mask[2*i];
8658 OMask[i] = Mask[2*i + 1];
8663 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
8664 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
8666 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
8669 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8670 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8672 for (int i = 0; i < 4; ++i) {
8673 LoBlendMask[i] = Mask[i];
8674 HiBlendMask[i] = Mask[i + 4];
8677 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
8678 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
8679 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
8680 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
8682 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8683 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
8686 /// \brief Check whether a compaction lowering can be done by dropping even
8687 /// elements and compute how many times even elements must be dropped.
8689 /// This handles shuffles which take every Nth element where N is a power of
8690 /// two. Example shuffle masks:
8692 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
8693 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
8694 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
8695 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
8696 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
8697 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
8699 /// Any of these lanes can of course be undef.
8701 /// This routine only supports N <= 3.
8702 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
8705 /// \returns N above, or the number of times even elements must be dropped if
8706 /// there is such a number. Otherwise returns zero.
8707 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
8708 // Figure out whether we're looping over two inputs or just one.
8709 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8711 // The modulus for the shuffle vector entries is based on whether this is
8712 // a single input or not.
8713 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
8714 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
8715 "We should only be called with masks with a power-of-2 size!");
8717 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
8719 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
8720 // and 2^3 simultaneously. This is because we may have ambiguity with
8721 // partially undef inputs.
8722 bool ViableForN[3] = {true, true, true};
8724 for (int i = 0, e = Mask.size(); i < e; ++i) {
8725 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
8730 bool IsAnyViable = false;
8731 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8732 if (ViableForN[j]) {
8735 // The shuffle mask must be equal to (i * 2^N) % M.
8736 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
8739 ViableForN[j] = false;
8741 // Early exit if we exhaust the possible powers of two.
8746 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
8750 // Return 0 as there is no viable power of two.
8754 /// \brief Generic lowering of v16i8 shuffles.
8756 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
8757 /// detect any complexity reducing interleaving. If that doesn't help, it uses
8758 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
8759 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
8761 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8762 const X86Subtarget *Subtarget,
8763 SelectionDAG &DAG) {
8765 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
8766 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8767 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
8768 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8769 ArrayRef<int> OrigMask = SVOp->getMask();
8770 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
8772 // Try to use rotation instructions if available.
8773 if (Subtarget->hasSSSE3())
8774 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
8778 // Try to use a zext lowering.
8779 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8780 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
8783 int MaskStorage[16] = {
8784 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8785 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
8786 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
8787 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
8788 MutableArrayRef<int> Mask(MaskStorage);
8789 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
8790 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
8793 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
8795 // For single-input shuffles, there are some nicer lowering tricks we can use.
8796 if (NumV2Elements == 0) {
8797 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
8798 // Notably, this handles splat and partial-splat shuffles more efficiently.
8799 // However, it only makes sense if the pre-duplication shuffle simplifies
8800 // things significantly. Currently, this means we need to be able to
8801 // express the pre-duplication shuffle as an i16 shuffle.
8803 // FIXME: We should check for other patterns which can be widened into an
8804 // i16 shuffle as well.
8805 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
8806 for (int i = 0; i < 16; i += 2)
8807 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
8812 auto tryToWidenViaDuplication = [&]() -> SDValue {
8813 if (!canWidenViaDuplication(Mask))
8815 SmallVector<int, 4> LoInputs;
8816 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
8817 [](int M) { return M >= 0 && M < 8; });
8818 std::sort(LoInputs.begin(), LoInputs.end());
8819 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
8821 SmallVector<int, 4> HiInputs;
8822 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
8823 [](int M) { return M >= 8; });
8824 std::sort(HiInputs.begin(), HiInputs.end());
8825 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
8828 bool TargetLo = LoInputs.size() >= HiInputs.size();
8829 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
8830 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
8832 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8833 SmallDenseMap<int, int, 8> LaneMap;
8834 for (int I : InPlaceInputs) {
8835 PreDupI16Shuffle[I/2] = I/2;
8838 int j = TargetLo ? 0 : 4, je = j + 4;
8839 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
8840 // Check if j is already a shuffle of this input. This happens when
8841 // there are two adjacent bytes after we move the low one.
8842 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
8843 // If we haven't yet mapped the input, search for a slot into which
8845 while (j < je && PreDupI16Shuffle[j] != -1)
8849 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
8852 // Map this input with the i16 shuffle.
8853 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
8856 // Update the lane map based on the mapping we ended up with.
8857 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
8860 ISD::BITCAST, DL, MVT::v16i8,
8861 DAG.getVectorShuffle(MVT::v8i16, DL,
8862 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8863 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
8865 // Unpack the bytes to form the i16s that will be shuffled into place.
8866 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
8867 MVT::v16i8, V1, V1);
8869 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8870 for (int i = 0; i < 16; i += 2) {
8872 PostDupI16Shuffle[i / 2] = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
8873 assert(PostDupI16Shuffle[i / 2] < 8 && "Invalid v8 shuffle mask!");
8876 ISD::BITCAST, DL, MVT::v16i8,
8877 DAG.getVectorShuffle(MVT::v8i16, DL,
8878 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
8879 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
8881 if (SDValue V = tryToWidenViaDuplication())
8885 // Check whether an interleaving lowering is likely to be more efficient.
8886 // This isn't perfect but it is a strong heuristic that tends to work well on
8887 // the kinds of shuffles that show up in practice.
8889 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
8890 if (shouldLowerAsInterleaving(Mask)) {
8891 // FIXME: Figure out whether we should pack these into the low or high
8894 int EMask[16], OMask[16];
8895 for (int i = 0; i < 8; ++i) {
8896 EMask[i] = Mask[2*i];
8897 OMask[i] = Mask[2*i + 1];
8902 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
8903 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
8905 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
8908 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
8909 // with PSHUFB. It is important to do this before we attempt to generate any
8910 // blends but after all of the single-input lowerings. If the single input
8911 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
8912 // want to preserve that and we can DAG combine any longer sequences into
8913 // a PSHUFB in the end. But once we start blending from multiple inputs,
8914 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
8915 // and there are *very* few patterns that would actually be faster than the
8916 // PSHUFB approach because of its ability to zero lanes.
8918 // FIXME: The only exceptions to the above are blends which are exact
8919 // interleavings with direct instructions supporting them. We currently don't
8920 // handle those well here.
8921 if (Subtarget->hasSSSE3()) {
8924 for (int i = 0; i < 16; ++i)
8925 if (Mask[i] == -1) {
8926 V1Mask[i] = V2Mask[i] = DAG.getConstant(0x80, MVT::i8);
8928 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
8930 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
8932 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
8933 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
8934 if (isSingleInputShuffleMask(Mask))
8935 return V1; // Single inputs are easy.
8937 // Otherwise, blend the two.
8938 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
8939 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
8940 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
8943 // There are special ways we can lower some single-element blends.
8944 if (NumV2Elements == 1)
8945 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
8946 Mask, Subtarget, DAG))
8949 // Check whether a compaction lowering can be done. This handles shuffles
8950 // which take every Nth element for some even N. See the helper function for
8953 // We special case these as they can be particularly efficiently handled with
8954 // the PACKUSB instruction on x86 and they show up in common patterns of
8955 // rearranging bytes to truncate wide elements.
8956 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
8957 // NumEvenDrops is the power of two stride of the elements. Another way of
8958 // thinking about it is that we need to drop the even elements this many
8959 // times to get the original input.
8960 bool IsSingleInput = isSingleInputShuffleMask(Mask);
8962 // First we need to zero all the dropped bytes.
8963 assert(NumEvenDrops <= 3 &&
8964 "No support for dropping even elements more than 3 times.");
8965 // We use the mask type to pick which bytes are preserved based on how many
8966 // elements are dropped.
8967 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
8968 SDValue ByteClearMask =
8969 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
8970 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
8971 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
8973 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
8975 // Now pack things back together.
8976 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
8977 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
8978 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
8979 for (int i = 1; i < NumEvenDrops; ++i) {
8980 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
8981 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
8987 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8988 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8989 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8990 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
8992 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
8993 MutableArrayRef<int> V1HalfBlendMask,
8994 MutableArrayRef<int> V2HalfBlendMask) {
8995 for (int i = 0; i < 8; ++i)
8996 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
8997 V1HalfBlendMask[i] = HalfMask[i];
8999 } else if (HalfMask[i] >= 16) {
9000 V2HalfBlendMask[i] = HalfMask[i] - 16;
9001 HalfMask[i] = i + 8;
9004 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9005 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9007 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9009 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9010 MutableArrayRef<int> HiBlendMask) {
9012 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9013 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9015 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9016 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9017 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9018 [](int M) { return M >= 0 && M % 2 == 1; })) {
9019 // Use a mask to drop the high bytes.
9020 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9021 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9022 DAG.getConstant(0x00FF, MVT::v8i16));
9024 // This will be a single vector shuffle instead of a blend so nuke V2.
9025 V2 = DAG.getUNDEF(MVT::v8i16);
9027 // Squash the masks to point directly into V1.
9028 for (int &M : LoBlendMask)
9031 for (int &M : HiBlendMask)
9035 // Otherwise just unpack the low half of V into V1 and the high half into
9036 // V2 so that we can blend them as i16s.
9037 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9038 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9039 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9040 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9043 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9044 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9045 return std::make_pair(BlendedLo, BlendedHi);
9047 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9048 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9049 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9051 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9052 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9054 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9057 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9059 /// This routine breaks down the specific type of 128-bit shuffle and
9060 /// dispatches to the lowering routines accordingly.
9061 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9062 MVT VT, const X86Subtarget *Subtarget,
9063 SelectionDAG &DAG) {
9064 switch (VT.SimpleTy) {
9066 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9068 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9070 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9072 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9074 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9076 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9079 llvm_unreachable("Unimplemented!");
9083 static bool isHalfCrossingShuffleMask(ArrayRef<int> Mask) {
9084 int Size = Mask.size();
9085 for (int M : Mask.slice(0, Size / 2))
9086 if (M >= 0 && (M % Size) >= Size / 2)
9088 for (int M : Mask.slice(Size / 2, Size / 2))
9089 if (M >= 0 && (M % Size) < Size / 2)
9094 /// \brief Generic routine to split a 256-bit vector shuffle into 128-bit
9097 /// There is a severely limited set of shuffles available in AVX1 for 256-bit
9098 /// vectors resulting in routinely needing to split the shuffle into two 128-bit
9099 /// shuffles. This can be done generically for any 256-bit vector shuffle and so
9100 /// we encode the logic here for specific shuffle lowering routines to bail to
9101 /// when they exhaust the features avaible to more directly handle the shuffle.
9102 static SDValue splitAndLower256BitVectorShuffle(SDValue Op, SDValue V1,
9104 const X86Subtarget *Subtarget,
9105 SelectionDAG &DAG) {
9107 MVT VT = Op.getSimpleValueType();
9108 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9109 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9110 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9111 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9112 ArrayRef<int> Mask = SVOp->getMask();
9114 ArrayRef<int> LoMask = Mask.slice(0, Mask.size()/2);
9115 ArrayRef<int> HiMask = Mask.slice(Mask.size()/2);
9117 int NumElements = VT.getVectorNumElements();
9118 int SplitNumElements = NumElements / 2;
9119 MVT ScalarVT = VT.getScalarType();
9120 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9122 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9123 DAG.getIntPtrConstant(0));
9124 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9125 DAG.getIntPtrConstant(SplitNumElements));
9126 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9127 DAG.getIntPtrConstant(0));
9128 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9129 DAG.getIntPtrConstant(SplitNumElements));
9131 // Now create two 4-way blends of these half-width vectors.
9132 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9133 SmallVector<int, 16> V1BlendMask, V2BlendMask, BlendMask;
9134 for (int i = 0; i < SplitNumElements; ++i) {
9135 int M = HalfMask[i];
9136 if (M >= NumElements) {
9137 V2BlendMask.push_back(M - NumElements);
9138 V1BlendMask.push_back(-1);
9139 BlendMask.push_back(SplitNumElements + i);
9140 } else if (M >= 0) {
9141 V2BlendMask.push_back(-1);
9142 V1BlendMask.push_back(M);
9143 BlendMask.push_back(i);
9145 V2BlendMask.push_back(-1);
9146 V1BlendMask.push_back(-1);
9147 BlendMask.push_back(-1);
9150 SDValue V1Blend = DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9151 SDValue V2Blend = DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9152 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9154 SDValue Lo = HalfBlend(LoMask);
9155 SDValue Hi = HalfBlend(HiMask);
9156 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9159 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9161 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9162 /// isn't available.
9163 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9164 const X86Subtarget *Subtarget,
9165 SelectionDAG &DAG) {
9167 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9168 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9169 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9170 ArrayRef<int> Mask = SVOp->getMask();
9171 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9173 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9174 // shuffles aren't a problem and FP and int have the same patterns.
9176 // FIXME: We can handle these more cleverly than splitting for v4f64.
9177 if (isHalfCrossingShuffleMask(Mask))
9178 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9180 if (isSingleInputShuffleMask(Mask)) {
9181 // Non-half-crossing single input shuffles can be lowerid with an
9182 // interleaved permutation.
9183 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9184 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9185 return DAG.getNode(X86ISD::VPERMILP, DL, MVT::v4f64, V1,
9186 DAG.getConstant(VPERMILPMask, MVT::i8));
9189 // X86 has dedicated unpack instructions that can handle specific blend
9190 // operations: UNPCKH and UNPCKL.
9191 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9192 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9193 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9194 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9195 // FIXME: It would be nice to find a way to get canonicalization to commute
9197 if (isShuffleEquivalent(Mask, 4, 0, 6, 2))
9198 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V2, V1);
9199 if (isShuffleEquivalent(Mask, 5, 1, 7, 3))
9200 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V2, V1);
9202 // Check if the blend happens to exactly fit that of SHUFPD.
9203 if (Mask[0] < 4 && (Mask[1] == -1 || Mask[1] >= 4) &&
9204 Mask[2] < 4 && (Mask[3] == -1 || Mask[3] >= 4)) {
9205 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9206 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9207 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9208 DAG.getConstant(SHUFPDMask, MVT::i8));
9210 if ((Mask[0] == -1 || Mask[0] >= 4) && Mask[1] < 4 &&
9211 (Mask[2] == -1 || Mask[2] >= 4) && Mask[3] < 4) {
9212 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9213 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9214 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9215 DAG.getConstant(SHUFPDMask, MVT::i8));
9218 // Shuffle the input elements into the desired positions in V1 and V2 and
9219 // blend them together.
9220 int V1Mask[] = {-1, -1, -1, -1};
9221 int V2Mask[] = {-1, -1, -1, -1};
9222 for (int i = 0; i < 4; ++i)
9223 if (Mask[i] >= 0 && Mask[i] < 4)
9224 V1Mask[i] = Mask[i];
9225 else if (Mask[i] >= 4)
9226 V2Mask[i] = Mask[i] - 4;
9228 V1 = DAG.getVectorShuffle(MVT::v4f64, DL, V1, DAG.getUNDEF(MVT::v4f64), V1Mask);
9229 V2 = DAG.getVectorShuffle(MVT::v4f64, DL, V2, DAG.getUNDEF(MVT::v4f64), V2Mask);
9231 unsigned BlendMask = 0;
9232 for (int i = 0; i < 4; ++i)
9234 BlendMask |= 1 << i;
9236 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v4f64, V1, V2,
9237 DAG.getConstant(BlendMask, MVT::i8));
9240 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9242 /// Largely delegates to common code when we have AVX2 and to the floating-point
9243 /// code when we only have AVX.
9244 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9245 const X86Subtarget *Subtarget,
9246 SelectionDAG &DAG) {
9248 assert(Op.getSimpleValueType() == MVT::v4i64 && "Bad shuffle type!");
9249 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9250 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9251 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9252 ArrayRef<int> Mask = SVOp->getMask();
9253 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9255 // FIXME: If we have AVX2, we should delegate to generic code as crossing
9256 // shuffles aren't a problem and FP and int have the same patterns.
9258 if (isHalfCrossingShuffleMask(Mask))
9259 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9261 // AVX1 doesn't provide any facilities for v4i64 shuffles, bitcast and
9262 // delegate to floating point code.
9263 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V1);
9264 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f64, V2);
9265 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i64,
9266 lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG));
9269 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9271 /// This routine either breaks down the specific type of a 256-bit x86 vector
9272 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
9273 /// together based on the available instructions.
9274 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9275 MVT VT, const X86Subtarget *Subtarget,
9276 SelectionDAG &DAG) {
9277 switch (VT.SimpleTy) {
9279 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9281 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9286 // Fall back to the basic pattern of extracting the high half and forming
9288 // FIXME: Add targeted lowering for each type that can document rationale
9289 // for delegating to this when necessary.
9290 return splitAndLower256BitVectorShuffle(Op, V1, V2, Subtarget, DAG);
9293 llvm_unreachable("Not a valid 256-bit x86 vector type!");
9297 /// \brief Tiny helper function to test whether a shuffle mask could be
9298 /// simplified by widening the elements being shuffled.
9299 static bool canWidenShuffleElements(ArrayRef<int> Mask) {
9300 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9301 if ((Mask[i] != -1 && Mask[i] % 2 != 0) ||
9302 (Mask[i + 1] != -1 && (Mask[i + 1] % 2 != 1 ||
9303 (Mask[i] != -1 && Mask[i] + 1 != Mask[i + 1]))))
9309 /// \brief Top-level lowering for x86 vector shuffles.
9311 /// This handles decomposition, canonicalization, and lowering of all x86
9312 /// vector shuffles. Most of the specific lowering strategies are encapsulated
9313 /// above in helper routines. The canonicalization attempts to widen shuffles
9314 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
9315 /// s.t. only one of the two inputs needs to be tested, etc.
9316 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
9317 SelectionDAG &DAG) {
9318 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9319 ArrayRef<int> Mask = SVOp->getMask();
9320 SDValue V1 = Op.getOperand(0);
9321 SDValue V2 = Op.getOperand(1);
9322 MVT VT = Op.getSimpleValueType();
9323 int NumElements = VT.getVectorNumElements();
9326 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
9328 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
9329 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9330 if (V1IsUndef && V2IsUndef)
9331 return DAG.getUNDEF(VT);
9333 // When we create a shuffle node we put the UNDEF node to second operand,
9334 // but in some cases the first operand may be transformed to UNDEF.
9335 // In this case we should just commute the node.
9337 return DAG.getCommutedVectorShuffle(*SVOp);
9339 // Check for non-undef masks pointing at an undef vector and make the masks
9340 // undef as well. This makes it easier to match the shuffle based solely on
9344 if (M >= NumElements) {
9345 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
9346 for (int &M : NewMask)
9347 if (M >= NumElements)
9349 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
9352 // For integer vector shuffles, try to collapse them into a shuffle of fewer
9353 // lanes but wider integers. We cap this to not form integers larger than i64
9354 // but it might be interesting to form i128 integers to handle flipping the
9355 // low and high halves of AVX 256-bit vectors.
9356 if (VT.isInteger() && VT.getScalarSizeInBits() < 64 &&
9357 canWidenShuffleElements(Mask)) {
9358 SmallVector<int, 8> NewMask;
9359 for (int i = 0, Size = Mask.size(); i < Size; i += 2)
9360 NewMask.push_back(Mask[i] != -1
9362 : (Mask[i + 1] != -1 ? Mask[i + 1] / 2 : -1));
9364 MVT::getVectorVT(MVT::getIntegerVT(VT.getScalarSizeInBits() * 2),
9365 VT.getVectorNumElements() / 2);
9366 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
9367 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
9368 return DAG.getNode(ISD::BITCAST, dl, VT,
9369 DAG.getVectorShuffle(NewVT, dl, V1, V2, NewMask));
9372 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
9373 for (int M : SVOp->getMask())
9376 else if (M < NumElements)
9381 // Commute the shuffle as needed such that more elements come from V1 than
9382 // V2. This allows us to match the shuffle pattern strictly on how many
9383 // elements come from V1 without handling the symmetric cases.
9384 if (NumV2Elements > NumV1Elements)
9385 return DAG.getCommutedVectorShuffle(*SVOp);
9387 // When the number of V1 and V2 elements are the same, try to minimize the
9388 // number of uses of V2 in the low half of the vector.
9389 if (NumV1Elements == NumV2Elements) {
9390 int LowV1Elements = 0, LowV2Elements = 0;
9391 for (int M : SVOp->getMask().slice(0, NumElements / 2))
9392 if (M >= NumElements)
9396 if (LowV2Elements > LowV1Elements)
9397 return DAG.getCommutedVectorShuffle(*SVOp);
9400 // For each vector width, delegate to a specialized lowering routine.
9401 if (VT.getSizeInBits() == 128)
9402 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9404 if (VT.getSizeInBits() == 256)
9405 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
9407 llvm_unreachable("Unimplemented!");
9411 //===----------------------------------------------------------------------===//
9412 // Legacy vector shuffle lowering
9414 // This code is the legacy code handling vector shuffles until the above
9415 // replaces its functionality and performance.
9416 //===----------------------------------------------------------------------===//
9418 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
9419 bool hasInt256, unsigned *MaskOut = nullptr) {
9420 MVT EltVT = VT.getVectorElementType();
9422 // There is no blend with immediate in AVX-512.
9423 if (VT.is512BitVector())
9426 if (!hasSSE41 || EltVT == MVT::i8)
9428 if (!hasInt256 && VT == MVT::v16i16)
9431 unsigned MaskValue = 0;
9432 unsigned NumElems = VT.getVectorNumElements();
9433 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
9434 unsigned NumLanes = (NumElems - 1) / 8 + 1;
9435 unsigned NumElemsInLane = NumElems / NumLanes;
9437 // Blend for v16i16 should be symetric for the both lanes.
9438 for (unsigned i = 0; i < NumElemsInLane; ++i) {
9440 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
9441 int EltIdx = MaskVals[i];
9443 if ((EltIdx < 0 || EltIdx == (int)i) &&
9444 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
9447 if (((unsigned)EltIdx == (i + NumElems)) &&
9448 (SndLaneEltIdx < 0 ||
9449 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
9450 MaskValue |= (1 << i);
9456 *MaskOut = MaskValue;
9460 // Try to lower a shuffle node into a simple blend instruction.
9461 // This function assumes isBlendMask returns true for this
9462 // SuffleVectorSDNode
9463 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
9465 const X86Subtarget *Subtarget,
9466 SelectionDAG &DAG) {
9467 MVT VT = SVOp->getSimpleValueType(0);
9468 MVT EltVT = VT.getVectorElementType();
9469 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
9470 Subtarget->hasInt256() && "Trying to lower a "
9471 "VECTOR_SHUFFLE to a Blend but "
9472 "with the wrong mask"));
9473 SDValue V1 = SVOp->getOperand(0);
9474 SDValue V2 = SVOp->getOperand(1);
9476 unsigned NumElems = VT.getVectorNumElements();
9478 // Convert i32 vectors to floating point if it is not AVX2.
9479 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
9481 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
9482 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
9484 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
9485 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
9488 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
9489 DAG.getConstant(MaskValue, MVT::i32));
9490 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
9493 /// In vector type \p VT, return true if the element at index \p InputIdx
9494 /// falls on a different 128-bit lane than \p OutputIdx.
9495 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
9496 unsigned OutputIdx) {
9497 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
9498 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
9501 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
9502 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
9503 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
9504 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
9506 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
9507 SelectionDAG &DAG) {
9508 MVT VT = V1.getSimpleValueType();
9509 assert(VT.is128BitVector() || VT.is256BitVector());
9511 MVT EltVT = VT.getVectorElementType();
9512 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
9513 unsigned NumElts = VT.getVectorNumElements();
9515 SmallVector<SDValue, 32> PshufbMask;
9516 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
9517 int InputIdx = MaskVals[OutputIdx];
9518 unsigned InputByteIdx;
9520 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
9521 InputByteIdx = 0x80;
9523 // Cross lane is not allowed.
9524 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
9526 InputByteIdx = InputIdx * EltSizeInBytes;
9527 // Index is an byte offset within the 128-bit lane.
9528 InputByteIdx &= 0xf;
9531 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
9532 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
9533 if (InputByteIdx != 0x80)
9538 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
9540 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
9541 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
9542 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
9545 // v8i16 shuffles - Prefer shuffles in the following order:
9546 // 1. [all] pshuflw, pshufhw, optional move
9547 // 2. [ssse3] 1 x pshufb
9548 // 3. [ssse3] 2 x pshufb + 1 x por
9549 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
9551 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
9552 SelectionDAG &DAG) {
9553 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9554 SDValue V1 = SVOp->getOperand(0);
9555 SDValue V2 = SVOp->getOperand(1);
9557 SmallVector<int, 8> MaskVals;
9559 // Determine if more than 1 of the words in each of the low and high quadwords
9560 // of the result come from the same quadword of one of the two inputs. Undef
9561 // mask values count as coming from any quadword, for better codegen.
9563 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
9564 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
9565 unsigned LoQuad[] = { 0, 0, 0, 0 };
9566 unsigned HiQuad[] = { 0, 0, 0, 0 };
9567 // Indices of quads used.
9568 std::bitset<4> InputQuads;
9569 for (unsigned i = 0; i < 8; ++i) {
9570 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
9571 int EltIdx = SVOp->getMaskElt(i);
9572 MaskVals.push_back(EltIdx);
9581 InputQuads.set(EltIdx / 4);
9584 int BestLoQuad = -1;
9585 unsigned MaxQuad = 1;
9586 for (unsigned i = 0; i < 4; ++i) {
9587 if (LoQuad[i] > MaxQuad) {
9589 MaxQuad = LoQuad[i];
9593 int BestHiQuad = -1;
9595 for (unsigned i = 0; i < 4; ++i) {
9596 if (HiQuad[i] > MaxQuad) {
9598 MaxQuad = HiQuad[i];
9602 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
9603 // of the two input vectors, shuffle them into one input vector so only a
9604 // single pshufb instruction is necessary. If there are more than 2 input
9605 // quads, disable the next transformation since it does not help SSSE3.
9606 bool V1Used = InputQuads[0] || InputQuads[1];
9607 bool V2Used = InputQuads[2] || InputQuads[3];
9608 if (Subtarget->hasSSSE3()) {
9609 if (InputQuads.count() == 2 && V1Used && V2Used) {
9610 BestLoQuad = InputQuads[0] ? 0 : 1;
9611 BestHiQuad = InputQuads[2] ? 2 : 3;
9613 if (InputQuads.count() > 2) {
9619 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
9620 // the shuffle mask. If a quad is scored as -1, that means that it contains
9621 // words from all 4 input quadwords.
9623 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
9625 BestLoQuad < 0 ? 0 : BestLoQuad,
9626 BestHiQuad < 0 ? 1 : BestHiQuad
9628 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
9629 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
9630 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
9631 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
9633 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
9634 // source words for the shuffle, to aid later transformations.
9635 bool AllWordsInNewV = true;
9636 bool InOrder[2] = { true, true };
9637 for (unsigned i = 0; i != 8; ++i) {
9638 int idx = MaskVals[i];
9640 InOrder[i/4] = false;
9641 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
9643 AllWordsInNewV = false;
9647 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
9648 if (AllWordsInNewV) {
9649 for (int i = 0; i != 8; ++i) {
9650 int idx = MaskVals[i];
9653 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
9654 if ((idx != i) && idx < 4)
9656 if ((idx != i) && idx > 3)
9665 // If we've eliminated the use of V2, and the new mask is a pshuflw or
9666 // pshufhw, that's as cheap as it gets. Return the new shuffle.
9667 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
9668 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
9669 unsigned TargetMask = 0;
9670 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
9671 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
9672 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9673 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
9674 getShufflePSHUFLWImmediate(SVOp);
9675 V1 = NewV.getOperand(0);
9676 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
9680 // Promote splats to a larger type which usually leads to more efficient code.
9681 // FIXME: Is this true if pshufb is available?
9682 if (SVOp->isSplat())
9683 return PromoteSplat(SVOp, DAG);
9685 // If we have SSSE3, and all words of the result are from 1 input vector,
9686 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
9687 // is present, fall back to case 4.
9688 if (Subtarget->hasSSSE3()) {
9689 SmallVector<SDValue,16> pshufbMask;
9691 // If we have elements from both input vectors, set the high bit of the
9692 // shuffle mask element to zero out elements that come from V2 in the V1
9693 // mask, and elements that come from V1 in the V2 mask, so that the two
9694 // results can be OR'd together.
9695 bool TwoInputs = V1Used && V2Used;
9696 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
9698 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9700 // Calculate the shuffle mask for the second input, shuffle it, and
9701 // OR it with the first shuffled input.
9702 CommuteVectorShuffleMask(MaskVals, 8);
9703 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
9704 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9705 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9708 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
9709 // and update MaskVals with new element order.
9710 std::bitset<8> InOrder;
9711 if (BestLoQuad >= 0) {
9712 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
9713 for (int i = 0; i != 4; ++i) {
9714 int idx = MaskVals[i];
9717 } else if ((idx / 4) == BestLoQuad) {
9722 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9725 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9726 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9727 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
9729 getShufflePSHUFLWImmediate(SVOp), DAG);
9733 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
9734 // and update MaskVals with the new element order.
9735 if (BestHiQuad >= 0) {
9736 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
9737 for (unsigned i = 4; i != 8; ++i) {
9738 int idx = MaskVals[i];
9741 } else if ((idx / 4) == BestHiQuad) {
9742 MaskV[i] = (idx & 3) + 4;
9746 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
9749 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
9750 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
9751 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
9753 getShufflePSHUFHWImmediate(SVOp), DAG);
9757 // In case BestHi & BestLo were both -1, which means each quadword has a word
9758 // from each of the four input quadwords, calculate the InOrder bitvector now
9759 // before falling through to the insert/extract cleanup.
9760 if (BestLoQuad == -1 && BestHiQuad == -1) {
9762 for (int i = 0; i != 8; ++i)
9763 if (MaskVals[i] < 0 || MaskVals[i] == i)
9767 // The other elements are put in the right place using pextrw and pinsrw.
9768 for (unsigned i = 0; i != 8; ++i) {
9771 int EltIdx = MaskVals[i];
9774 SDValue ExtOp = (EltIdx < 8) ?
9775 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
9776 DAG.getIntPtrConstant(EltIdx)) :
9777 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
9778 DAG.getIntPtrConstant(EltIdx - 8));
9779 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
9780 DAG.getIntPtrConstant(i));
9785 /// \brief v16i16 shuffles
9787 /// FIXME: We only support generation of a single pshufb currently. We can
9788 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
9789 /// well (e.g 2 x pshufb + 1 x por).
9791 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
9792 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9793 SDValue V1 = SVOp->getOperand(0);
9794 SDValue V2 = SVOp->getOperand(1);
9797 if (V2.getOpcode() != ISD::UNDEF)
9800 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9801 return getPSHUFB(MaskVals, V1, dl, DAG);
9804 // v16i8 shuffles - Prefer shuffles in the following order:
9805 // 1. [ssse3] 1 x pshufb
9806 // 2. [ssse3] 2 x pshufb + 1 x por
9807 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
9808 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
9809 const X86Subtarget* Subtarget,
9810 SelectionDAG &DAG) {
9811 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
9812 SDValue V1 = SVOp->getOperand(0);
9813 SDValue V2 = SVOp->getOperand(1);
9815 ArrayRef<int> MaskVals = SVOp->getMask();
9817 // Promote splats to a larger type which usually leads to more efficient code.
9818 // FIXME: Is this true if pshufb is available?
9819 if (SVOp->isSplat())
9820 return PromoteSplat(SVOp, DAG);
9822 // If we have SSSE3, case 1 is generated when all result bytes come from
9823 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
9824 // present, fall back to case 3.
9826 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
9827 if (Subtarget->hasSSSE3()) {
9828 SmallVector<SDValue,16> pshufbMask;
9830 // If all result elements are from one input vector, then only translate
9831 // undef mask values to 0x80 (zero out result) in the pshufb mask.
9833 // Otherwise, we have elements from both input vectors, and must zero out
9834 // elements that come from V2 in the first mask, and V1 in the second mask
9835 // so that we can OR them together.
9836 for (unsigned i = 0; i != 16; ++i) {
9837 int EltIdx = MaskVals[i];
9838 if (EltIdx < 0 || EltIdx >= 16)
9840 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9842 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
9843 DAG.getNode(ISD::BUILD_VECTOR, dl,
9844 MVT::v16i8, pshufbMask));
9846 // As PSHUFB will zero elements with negative indices, it's safe to ignore
9847 // the 2nd operand if it's undefined or zero.
9848 if (V2.getOpcode() == ISD::UNDEF ||
9849 ISD::isBuildVectorAllZeros(V2.getNode()))
9852 // Calculate the shuffle mask for the second input, shuffle it, and
9853 // OR it with the first shuffled input.
9855 for (unsigned i = 0; i != 16; ++i) {
9856 int EltIdx = MaskVals[i];
9857 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
9858 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
9860 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
9861 DAG.getNode(ISD::BUILD_VECTOR, dl,
9862 MVT::v16i8, pshufbMask));
9863 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
9866 // No SSSE3 - Calculate in place words and then fix all out of place words
9867 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
9868 // the 16 different words that comprise the two doublequadword input vectors.
9869 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
9870 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
9872 for (int i = 0; i != 8; ++i) {
9873 int Elt0 = MaskVals[i*2];
9874 int Elt1 = MaskVals[i*2+1];
9876 // This word of the result is all undef, skip it.
9877 if (Elt0 < 0 && Elt1 < 0)
9880 // This word of the result is already in the correct place, skip it.
9881 if ((Elt0 == i*2) && (Elt1 == i*2+1))
9884 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
9885 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
9888 // If Elt0 and Elt1 are defined, are consecutive, and can be load
9889 // using a single extract together, load it and store it.
9890 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
9891 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9892 DAG.getIntPtrConstant(Elt1 / 2));
9893 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9894 DAG.getIntPtrConstant(i));
9898 // If Elt1 is defined, extract it from the appropriate source. If the
9899 // source byte is not also odd, shift the extracted word left 8 bits
9900 // otherwise clear the bottom 8 bits if we need to do an or.
9902 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
9903 DAG.getIntPtrConstant(Elt1 / 2));
9904 if ((Elt1 & 1) == 0)
9905 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
9907 TLI.getShiftAmountTy(InsElt.getValueType())));
9909 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
9910 DAG.getConstant(0xFF00, MVT::i16));
9912 // If Elt0 is defined, extract it from the appropriate source. If the
9913 // source byte is not also even, shift the extracted word right 8 bits. If
9914 // Elt1 was also defined, OR the extracted values together before
9915 // inserting them in the result.
9917 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
9918 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
9919 if ((Elt0 & 1) != 0)
9920 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
9922 TLI.getShiftAmountTy(InsElt0.getValueType())));
9924 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
9925 DAG.getConstant(0x00FF, MVT::i16));
9926 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
9929 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
9930 DAG.getIntPtrConstant(i));
9932 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
9935 // v32i8 shuffles - Translate to VPSHUFB if possible.
9937 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
9938 const X86Subtarget *Subtarget,
9939 SelectionDAG &DAG) {
9940 MVT VT = SVOp->getSimpleValueType(0);
9941 SDValue V1 = SVOp->getOperand(0);
9942 SDValue V2 = SVOp->getOperand(1);
9944 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
9946 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
9947 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
9948 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
9950 // VPSHUFB may be generated if
9951 // (1) one of input vector is undefined or zeroinitializer.
9952 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
9953 // And (2) the mask indexes don't cross the 128-bit lane.
9954 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
9955 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
9958 if (V1IsAllZero && !V2IsAllZero) {
9959 CommuteVectorShuffleMask(MaskVals, 32);
9962 return getPSHUFB(MaskVals, V1, dl, DAG);
9965 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
9966 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
9967 /// done when every pair / quad of shuffle mask elements point to elements in
9968 /// the right sequence. e.g.
9969 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
9971 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
9972 SelectionDAG &DAG) {
9973 MVT VT = SVOp->getSimpleValueType(0);
9975 unsigned NumElems = VT.getVectorNumElements();
9978 switch (VT.SimpleTy) {
9979 default: llvm_unreachable("Unexpected!");
9982 return SDValue(SVOp, 0);
9983 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
9984 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
9985 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
9986 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
9987 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
9988 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
9991 SmallVector<int, 8> MaskVec;
9992 for (unsigned i = 0; i != NumElems; i += Scale) {
9994 for (unsigned j = 0; j != Scale; ++j) {
9995 int EltIdx = SVOp->getMaskElt(i+j);
9999 StartIdx = (EltIdx / Scale);
10000 if (EltIdx != (int)(StartIdx*Scale + j))
10003 MaskVec.push_back(StartIdx);
10006 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10007 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10008 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10011 /// getVZextMovL - Return a zero-extending vector move low node.
10013 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10014 SDValue SrcOp, SelectionDAG &DAG,
10015 const X86Subtarget *Subtarget, SDLoc dl) {
10016 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10017 LoadSDNode *LD = nullptr;
10018 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10019 LD = dyn_cast<LoadSDNode>(SrcOp);
10021 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10023 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10024 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10025 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10026 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10027 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10029 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10030 return DAG.getNode(ISD::BITCAST, dl, VT,
10031 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10032 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10034 SrcOp.getOperand(0)
10040 return DAG.getNode(ISD::BITCAST, dl, VT,
10041 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10042 DAG.getNode(ISD::BITCAST, dl,
10046 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
10047 /// which could not be matched by any known target speficic shuffle
10049 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10051 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
10052 if (NewOp.getNode())
10055 MVT VT = SVOp->getSimpleValueType(0);
10057 unsigned NumElems = VT.getVectorNumElements();
10058 unsigned NumLaneElems = NumElems / 2;
10061 MVT EltVT = VT.getVectorElementType();
10062 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
10065 SmallVector<int, 16> Mask;
10066 for (unsigned l = 0; l < 2; ++l) {
10067 // Build a shuffle mask for the output, discovering on the fly which
10068 // input vectors to use as shuffle operands (recorded in InputUsed).
10069 // If building a suitable shuffle vector proves too hard, then bail
10070 // out with UseBuildVector set.
10071 bool UseBuildVector = false;
10072 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
10073 unsigned LaneStart = l * NumLaneElems;
10074 for (unsigned i = 0; i != NumLaneElems; ++i) {
10075 // The mask element. This indexes into the input.
10076 int Idx = SVOp->getMaskElt(i+LaneStart);
10078 // the mask element does not index into any input vector.
10079 Mask.push_back(-1);
10083 // The input vector this mask element indexes into.
10084 int Input = Idx / NumLaneElems;
10086 // Turn the index into an offset from the start of the input vector.
10087 Idx -= Input * NumLaneElems;
10089 // Find or create a shuffle vector operand to hold this input.
10091 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
10092 if (InputUsed[OpNo] == Input)
10093 // This input vector is already an operand.
10095 if (InputUsed[OpNo] < 0) {
10096 // Create a new operand for this input vector.
10097 InputUsed[OpNo] = Input;
10102 if (OpNo >= array_lengthof(InputUsed)) {
10103 // More than two input vectors used! Give up on trying to create a
10104 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
10105 UseBuildVector = true;
10109 // Add the mask index for the new shuffle vector.
10110 Mask.push_back(Idx + OpNo * NumLaneElems);
10113 if (UseBuildVector) {
10114 SmallVector<SDValue, 16> SVOps;
10115 for (unsigned i = 0; i != NumLaneElems; ++i) {
10116 // The mask element. This indexes into the input.
10117 int Idx = SVOp->getMaskElt(i+LaneStart);
10119 SVOps.push_back(DAG.getUNDEF(EltVT));
10123 // The input vector this mask element indexes into.
10124 int Input = Idx / NumElems;
10126 // Turn the index into an offset from the start of the input vector.
10127 Idx -= Input * NumElems;
10129 // Extract the vector element by hand.
10130 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
10131 SVOp->getOperand(Input),
10132 DAG.getIntPtrConstant(Idx)));
10135 // Construct the output using a BUILD_VECTOR.
10136 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
10137 } else if (InputUsed[0] < 0) {
10138 // No input vectors were used! The result is undefined.
10139 Output[l] = DAG.getUNDEF(NVT);
10141 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
10142 (InputUsed[0] % 2) * NumLaneElems,
10144 // If only one input was used, use an undefined vector for the other.
10145 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
10146 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
10147 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
10148 // At least one input vector was used. Create a new shuffle vector.
10149 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
10155 // Concatenate the result back
10156 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
10159 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
10160 /// 4 elements, and match them with several different shuffle types.
10162 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
10163 SDValue V1 = SVOp->getOperand(0);
10164 SDValue V2 = SVOp->getOperand(1);
10166 MVT VT = SVOp->getSimpleValueType(0);
10168 assert(VT.is128BitVector() && "Unsupported vector size");
10170 std::pair<int, int> Locs[4];
10171 int Mask1[] = { -1, -1, -1, -1 };
10172 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
10174 unsigned NumHi = 0;
10175 unsigned NumLo = 0;
10176 for (unsigned i = 0; i != 4; ++i) {
10177 int Idx = PermMask[i];
10179 Locs[i] = std::make_pair(-1, -1);
10181 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
10183 Locs[i] = std::make_pair(0, NumLo);
10184 Mask1[NumLo] = Idx;
10187 Locs[i] = std::make_pair(1, NumHi);
10189 Mask1[2+NumHi] = Idx;
10195 if (NumLo <= 2 && NumHi <= 2) {
10196 // If no more than two elements come from either vector. This can be
10197 // implemented with two shuffles. First shuffle gather the elements.
10198 // The second shuffle, which takes the first shuffle as both of its
10199 // vector operands, put the elements into the right order.
10200 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10202 int Mask2[] = { -1, -1, -1, -1 };
10204 for (unsigned i = 0; i != 4; ++i)
10205 if (Locs[i].first != -1) {
10206 unsigned Idx = (i < 2) ? 0 : 4;
10207 Idx += Locs[i].first * 2 + Locs[i].second;
10211 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
10214 if (NumLo == 3 || NumHi == 3) {
10215 // Otherwise, we must have three elements from one vector, call it X, and
10216 // one element from the other, call it Y. First, use a shufps to build an
10217 // intermediate vector with the one element from Y and the element from X
10218 // that will be in the same half in the final destination (the indexes don't
10219 // matter). Then, use a shufps to build the final vector, taking the half
10220 // containing the element from Y from the intermediate, and the other half
10223 // Normalize it so the 3 elements come from V1.
10224 CommuteVectorShuffleMask(PermMask, 4);
10228 // Find the element from V2.
10230 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
10231 int Val = PermMask[HiIndex];
10238 Mask1[0] = PermMask[HiIndex];
10240 Mask1[2] = PermMask[HiIndex^1];
10242 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10244 if (HiIndex >= 2) {
10245 Mask1[0] = PermMask[0];
10246 Mask1[1] = PermMask[1];
10247 Mask1[2] = HiIndex & 1 ? 6 : 4;
10248 Mask1[3] = HiIndex & 1 ? 4 : 6;
10249 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
10252 Mask1[0] = HiIndex & 1 ? 2 : 0;
10253 Mask1[1] = HiIndex & 1 ? 0 : 2;
10254 Mask1[2] = PermMask[2];
10255 Mask1[3] = PermMask[3];
10260 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
10263 // Break it into (shuffle shuffle_hi, shuffle_lo).
10264 int LoMask[] = { -1, -1, -1, -1 };
10265 int HiMask[] = { -1, -1, -1, -1 };
10267 int *MaskPtr = LoMask;
10268 unsigned MaskIdx = 0;
10269 unsigned LoIdx = 0;
10270 unsigned HiIdx = 2;
10271 for (unsigned i = 0; i != 4; ++i) {
10278 int Idx = PermMask[i];
10280 Locs[i] = std::make_pair(-1, -1);
10281 } else if (Idx < 4) {
10282 Locs[i] = std::make_pair(MaskIdx, LoIdx);
10283 MaskPtr[LoIdx] = Idx;
10286 Locs[i] = std::make_pair(MaskIdx, HiIdx);
10287 MaskPtr[HiIdx] = Idx;
10292 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
10293 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
10294 int MaskOps[] = { -1, -1, -1, -1 };
10295 for (unsigned i = 0; i != 4; ++i)
10296 if (Locs[i].first != -1)
10297 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
10298 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
10301 static bool MayFoldVectorLoad(SDValue V) {
10302 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
10303 V = V.getOperand(0);
10305 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
10306 V = V.getOperand(0);
10307 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
10308 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
10309 // BUILD_VECTOR (load), undef
10310 V = V.getOperand(0);
10312 return MayFoldLoad(V);
10316 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
10317 MVT VT = Op.getSimpleValueType();
10319 // Canonizalize to v2f64.
10320 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
10321 return DAG.getNode(ISD::BITCAST, dl, VT,
10322 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
10327 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
10329 SDValue V1 = Op.getOperand(0);
10330 SDValue V2 = Op.getOperand(1);
10331 MVT VT = Op.getSimpleValueType();
10333 assert(VT != MVT::v2i64 && "unsupported shuffle type");
10335 if (HasSSE2 && VT == MVT::v2f64)
10336 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
10338 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
10339 return DAG.getNode(ISD::BITCAST, dl, VT,
10340 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
10341 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
10342 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
10346 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
10347 SDValue V1 = Op.getOperand(0);
10348 SDValue V2 = Op.getOperand(1);
10349 MVT VT = Op.getSimpleValueType();
10351 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
10352 "unsupported shuffle type");
10354 if (V2.getOpcode() == ISD::UNDEF)
10358 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
10362 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
10363 SDValue V1 = Op.getOperand(0);
10364 SDValue V2 = Op.getOperand(1);
10365 MVT VT = Op.getSimpleValueType();
10366 unsigned NumElems = VT.getVectorNumElements();
10368 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
10369 // operand of these instructions is only memory, so check if there's a
10370 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
10372 bool CanFoldLoad = false;
10374 // Trivial case, when V2 comes from a load.
10375 if (MayFoldVectorLoad(V2))
10376 CanFoldLoad = true;
10378 // When V1 is a load, it can be folded later into a store in isel, example:
10379 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
10381 // (MOVLPSmr addr:$src1, VR128:$src2)
10382 // So, recognize this potential and also use MOVLPS or MOVLPD
10383 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
10384 CanFoldLoad = true;
10386 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10388 if (HasSSE2 && NumElems == 2)
10389 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
10392 // If we don't care about the second element, proceed to use movss.
10393 if (SVOp->getMaskElt(1) != -1)
10394 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
10397 // movl and movlp will both match v2i64, but v2i64 is never matched by
10398 // movl earlier because we make it strict to avoid messing with the movlp load
10399 // folding logic (see the code above getMOVLP call). Match it here then,
10400 // this is horrible, but will stay like this until we move all shuffle
10401 // matching to x86 specific nodes. Note that for the 1st condition all
10402 // types are matched with movsd.
10404 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
10405 // as to remove this logic from here, as much as possible
10406 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
10407 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10408 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10411 assert(VT != MVT::v4i32 && "unsupported shuffle type");
10413 // Invert the operand order and use SHUFPS to match it.
10414 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
10415 getShuffleSHUFImmediate(SVOp), DAG);
10418 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
10419 SelectionDAG &DAG) {
10421 MVT VT = Load->getSimpleValueType(0);
10422 MVT EVT = VT.getVectorElementType();
10423 SDValue Addr = Load->getOperand(1);
10424 SDValue NewAddr = DAG.getNode(
10425 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
10426 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
10429 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
10430 DAG.getMachineFunction().getMachineMemOperand(
10431 Load->getMemOperand(), 0, EVT.getStoreSize()));
10435 // It is only safe to call this function if isINSERTPSMask is true for
10436 // this shufflevector mask.
10437 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
10438 SelectionDAG &DAG) {
10439 // Generate an insertps instruction when inserting an f32 from memory onto a
10440 // v4f32 or when copying a member from one v4f32 to another.
10441 // We also use it for transferring i32 from one register to another,
10442 // since it simply copies the same bits.
10443 // If we're transferring an i32 from memory to a specific element in a
10444 // register, we output a generic DAG that will match the PINSRD
10446 MVT VT = SVOp->getSimpleValueType(0);
10447 MVT EVT = VT.getVectorElementType();
10448 SDValue V1 = SVOp->getOperand(0);
10449 SDValue V2 = SVOp->getOperand(1);
10450 auto Mask = SVOp->getMask();
10451 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
10452 "unsupported vector type for insertps/pinsrd");
10454 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
10455 auto FromV2Predicate = [](const int &i) { return i >= 4; };
10456 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
10460 unsigned DestIndex;
10464 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
10467 // If we have 1 element from each vector, we have to check if we're
10468 // changing V1's element's place. If so, we're done. Otherwise, we
10469 // should assume we're changing V2's element's place and behave
10471 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
10472 assert(DestIndex <= INT32_MAX && "truncated destination index");
10473 if (FromV1 == FromV2 &&
10474 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
10478 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10481 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
10482 "More than one element from V1 and from V2, or no elements from one "
10483 "of the vectors. This case should not have returned true from "
10488 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
10491 // Get an index into the source vector in the range [0,4) (the mask is
10492 // in the range [0,8) because it can address V1 and V2)
10493 unsigned SrcIndex = Mask[DestIndex] % 4;
10494 if (MayFoldLoad(From)) {
10495 // Trivial case, when From comes from a load and is only used by the
10496 // shuffle. Make it use insertps from the vector that we need from that
10499 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
10500 if (!NewLoad.getNode())
10503 if (EVT == MVT::f32) {
10504 // Create this as a scalar to vector to match the instruction pattern.
10505 SDValue LoadScalarToVector =
10506 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
10507 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
10508 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
10510 } else { // EVT == MVT::i32
10511 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
10512 // instruction, to match the PINSRD instruction, which loads an i32 to a
10513 // certain vector element.
10514 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
10515 DAG.getConstant(DestIndex, MVT::i32));
10519 // Vector-element-to-vector
10520 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
10521 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
10524 // Reduce a vector shuffle to zext.
10525 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
10526 SelectionDAG &DAG) {
10527 // PMOVZX is only available from SSE41.
10528 if (!Subtarget->hasSSE41())
10531 MVT VT = Op.getSimpleValueType();
10533 // Only AVX2 support 256-bit vector integer extending.
10534 if (!Subtarget->hasInt256() && VT.is256BitVector())
10537 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10539 SDValue V1 = Op.getOperand(0);
10540 SDValue V2 = Op.getOperand(1);
10541 unsigned NumElems = VT.getVectorNumElements();
10543 // Extending is an unary operation and the element type of the source vector
10544 // won't be equal to or larger than i64.
10545 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
10546 VT.getVectorElementType() == MVT::i64)
10549 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
10550 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
10551 while ((1U << Shift) < NumElems) {
10552 if (SVOp->getMaskElt(1U << Shift) == 1)
10555 // The maximal ratio is 8, i.e. from i8 to i64.
10560 // Check the shuffle mask.
10561 unsigned Mask = (1U << Shift) - 1;
10562 for (unsigned i = 0; i != NumElems; ++i) {
10563 int EltIdx = SVOp->getMaskElt(i);
10564 if ((i & Mask) != 0 && EltIdx != -1)
10566 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
10570 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
10571 MVT NeVT = MVT::getIntegerVT(NBits);
10572 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
10574 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
10577 // Simplify the operand as it's prepared to be fed into shuffle.
10578 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
10579 if (V1.getOpcode() == ISD::BITCAST &&
10580 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
10581 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
10582 V1.getOperand(0).getOperand(0)
10583 .getSimpleValueType().getSizeInBits() == SignificantBits) {
10584 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
10585 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
10586 ConstantSDNode *CIdx =
10587 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
10588 // If it's foldable, i.e. normal load with single use, we will let code
10589 // selection to fold it. Otherwise, we will short the conversion sequence.
10590 if (CIdx && CIdx->getZExtValue() == 0 &&
10591 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
10592 MVT FullVT = V.getSimpleValueType();
10593 MVT V1VT = V1.getSimpleValueType();
10594 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
10595 // The "ext_vec_elt" node is wider than the result node.
10596 // In this case we should extract subvector from V.
10597 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
10598 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
10599 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
10600 FullVT.getVectorNumElements()/Ratio);
10601 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
10602 DAG.getIntPtrConstant(0));
10604 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
10608 return DAG.getNode(ISD::BITCAST, DL, VT,
10609 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
10612 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10613 SelectionDAG &DAG) {
10614 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10615 MVT VT = Op.getSimpleValueType();
10617 SDValue V1 = Op.getOperand(0);
10618 SDValue V2 = Op.getOperand(1);
10620 if (isZeroShuffle(SVOp))
10621 return getZeroVector(VT, Subtarget, DAG, dl);
10623 // Handle splat operations
10624 if (SVOp->isSplat()) {
10625 // Use vbroadcast whenever the splat comes from a foldable load
10626 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
10627 if (Broadcast.getNode())
10631 // Check integer expanding shuffles.
10632 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
10633 if (NewOp.getNode())
10636 // If the shuffle can be profitably rewritten as a narrower shuffle, then
10638 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
10639 VT == MVT::v32i8) {
10640 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10641 if (NewOp.getNode())
10642 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
10643 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
10644 // FIXME: Figure out a cleaner way to do this.
10645 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
10646 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10647 if (NewOp.getNode()) {
10648 MVT NewVT = NewOp.getSimpleValueType();
10649 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
10650 NewVT, true, false))
10651 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
10654 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
10655 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
10656 if (NewOp.getNode()) {
10657 MVT NewVT = NewOp.getSimpleValueType();
10658 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
10659 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
10668 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
10669 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10670 SDValue V1 = Op.getOperand(0);
10671 SDValue V2 = Op.getOperand(1);
10672 MVT VT = Op.getSimpleValueType();
10674 unsigned NumElems = VT.getVectorNumElements();
10675 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10676 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10677 bool V1IsSplat = false;
10678 bool V2IsSplat = false;
10679 bool HasSSE2 = Subtarget->hasSSE2();
10680 bool HasFp256 = Subtarget->hasFp256();
10681 bool HasInt256 = Subtarget->hasInt256();
10682 MachineFunction &MF = DAG.getMachineFunction();
10683 bool OptForSize = MF.getFunction()->getAttributes().
10684 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
10686 // Check if we should use the experimental vector shuffle lowering. If so,
10687 // delegate completely to that code path.
10688 if (ExperimentalVectorShuffleLowering)
10689 return lowerVectorShuffle(Op, Subtarget, DAG);
10691 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10693 if (V1IsUndef && V2IsUndef)
10694 return DAG.getUNDEF(VT);
10696 // When we create a shuffle node we put the UNDEF node to second operand,
10697 // but in some cases the first operand may be transformed to UNDEF.
10698 // In this case we should just commute the node.
10700 return DAG.getCommutedVectorShuffle(*SVOp);
10702 // Vector shuffle lowering takes 3 steps:
10704 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
10705 // narrowing and commutation of operands should be handled.
10706 // 2) Matching of shuffles with known shuffle masks to x86 target specific
10708 // 3) Rewriting of unmatched masks into new generic shuffle operations,
10709 // so the shuffle can be broken into other shuffles and the legalizer can
10710 // try the lowering again.
10712 // The general idea is that no vector_shuffle operation should be left to
10713 // be matched during isel, all of them must be converted to a target specific
10716 // Normalize the input vectors. Here splats, zeroed vectors, profitable
10717 // narrowing and commutation of operands should be handled. The actual code
10718 // doesn't include all of those, work in progress...
10719 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
10720 if (NewOp.getNode())
10723 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
10725 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
10726 // unpckh_undef). Only use pshufd if speed is more important than size.
10727 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10728 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10729 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10730 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10732 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
10733 V2IsUndef && MayFoldVectorLoad(V1))
10734 return getMOVDDup(Op, dl, V1, DAG);
10736 if (isMOVHLPS_v_undef_Mask(M, VT))
10737 return getMOVHighToLow(Op, dl, DAG);
10739 // Use to match splats
10740 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
10741 (VT == MVT::v2f64 || VT == MVT::v2i64))
10742 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10744 if (isPSHUFDMask(M, VT)) {
10745 // The actual implementation will match the mask in the if above and then
10746 // during isel it can match several different instructions, not only pshufd
10747 // as its name says, sad but true, emulate the behavior for now...
10748 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
10749 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
10751 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
10753 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
10754 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
10756 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
10757 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1, TargetMask,
10760 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
10764 if (isPALIGNRMask(M, VT, Subtarget))
10765 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
10766 getShufflePALIGNRImmediate(SVOp),
10769 if (isVALIGNMask(M, VT, Subtarget))
10770 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
10771 getShuffleVALIGNImmediate(SVOp),
10774 // Check if this can be converted into a logical shift.
10775 bool isLeft = false;
10776 unsigned ShAmt = 0;
10778 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
10779 if (isShift && ShVal.hasOneUse()) {
10780 // If the shifted value has multiple uses, it may be cheaper to use
10781 // v_set0 + movlhps or movhlps, etc.
10782 MVT EltVT = VT.getVectorElementType();
10783 ShAmt *= EltVT.getSizeInBits();
10784 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10787 if (isMOVLMask(M, VT)) {
10788 if (ISD::isBuildVectorAllZeros(V1.getNode()))
10789 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
10790 if (!isMOVLPMask(M, VT)) {
10791 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
10792 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
10794 if (VT == MVT::v4i32 || VT == MVT::v4f32)
10795 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
10799 // FIXME: fold these into legal mask.
10800 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
10801 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
10803 if (isMOVHLPSMask(M, VT))
10804 return getMOVHighToLow(Op, dl, DAG);
10806 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
10807 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
10809 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
10810 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
10812 if (isMOVLPMask(M, VT))
10813 return getMOVLP(Op, dl, DAG, HasSSE2);
10815 if (ShouldXformToMOVHLPS(M, VT) ||
10816 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
10817 return DAG.getCommutedVectorShuffle(*SVOp);
10820 // No better options. Use a vshldq / vsrldq.
10821 MVT EltVT = VT.getVectorElementType();
10822 ShAmt *= EltVT.getSizeInBits();
10823 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
10826 bool Commuted = false;
10827 // FIXME: This should also accept a bitcast of a splat? Be careful, not
10828 // 1,1,1,1 -> v8i16 though.
10829 BitVector UndefElements;
10830 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
10831 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10833 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
10834 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
10837 // Canonicalize the splat or undef, if present, to be on the RHS.
10838 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
10839 CommuteVectorShuffleMask(M, NumElems);
10841 std::swap(V1IsSplat, V2IsSplat);
10845 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
10846 // Shuffling low element of v1 into undef, just return v1.
10849 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
10850 // the instruction selector will not match, so get a canonical MOVL with
10851 // swapped operands to undo the commute.
10852 return getMOVL(DAG, dl, VT, V2, V1);
10855 if (isUNPCKLMask(M, VT, HasInt256))
10856 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10858 if (isUNPCKHMask(M, VT, HasInt256))
10859 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10862 // Normalize mask so all entries that point to V2 points to its first
10863 // element then try to match unpck{h|l} again. If match, return a
10864 // new vector_shuffle with the corrected mask.p
10865 SmallVector<int, 8> NewMask(M.begin(), M.end());
10866 NormalizeMask(NewMask, NumElems);
10867 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
10868 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10869 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
10870 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10874 // Commute is back and try unpck* again.
10875 // FIXME: this seems wrong.
10876 CommuteVectorShuffleMask(M, NumElems);
10878 std::swap(V1IsSplat, V2IsSplat);
10880 if (isUNPCKLMask(M, VT, HasInt256))
10881 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
10883 if (isUNPCKHMask(M, VT, HasInt256))
10884 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
10887 // Normalize the node to match x86 shuffle ops if needed
10888 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
10889 return DAG.getCommutedVectorShuffle(*SVOp);
10891 // The checks below are all present in isShuffleMaskLegal, but they are
10892 // inlined here right now to enable us to directly emit target specific
10893 // nodes, and remove one by one until they don't return Op anymore.
10895 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
10896 SVOp->getSplatIndex() == 0 && V2IsUndef) {
10897 if (VT == MVT::v2f64 || VT == MVT::v2i64)
10898 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10901 if (isPSHUFHWMask(M, VT, HasInt256))
10902 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
10903 getShufflePSHUFHWImmediate(SVOp),
10906 if (isPSHUFLWMask(M, VT, HasInt256))
10907 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
10908 getShufflePSHUFLWImmediate(SVOp),
10911 unsigned MaskValue;
10912 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
10914 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
10916 if (isSHUFPMask(M, VT))
10917 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
10918 getShuffleSHUFImmediate(SVOp), DAG);
10920 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
10921 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
10922 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
10923 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
10925 //===--------------------------------------------------------------------===//
10926 // Generate target specific nodes for 128 or 256-bit shuffles only
10927 // supported in the AVX instruction set.
10930 // Handle VMOVDDUPY permutations
10931 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
10932 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
10934 // Handle VPERMILPS/D* permutations
10935 if (isVPERMILPMask(M, VT)) {
10936 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
10937 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
10938 getShuffleSHUFImmediate(SVOp), DAG);
10939 return getTargetShuffleNode(X86ISD::VPERMILP, dl, VT, V1,
10940 getShuffleSHUFImmediate(SVOp), DAG);
10944 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
10945 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
10946 Idx*(NumElems/2), DAG, dl);
10948 // Handle VPERM2F128/VPERM2I128 permutations
10949 if (isVPERM2X128Mask(M, VT, HasFp256))
10950 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
10951 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
10953 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
10954 return getINSERTPS(SVOp, dl, DAG);
10957 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
10958 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
10960 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
10961 VT.is512BitVector()) {
10962 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
10963 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
10964 SmallVector<SDValue, 16> permclMask;
10965 for (unsigned i = 0; i != NumElems; ++i) {
10966 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
10969 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
10971 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
10972 return DAG.getNode(X86ISD::VPERMV, dl, VT,
10973 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
10974 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
10975 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
10978 //===--------------------------------------------------------------------===//
10979 // Since no target specific shuffle was selected for this generic one,
10980 // lower it into other known shuffles. FIXME: this isn't true yet, but
10981 // this is the plan.
10984 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
10985 if (VT == MVT::v8i16) {
10986 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
10987 if (NewOp.getNode())
10991 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
10992 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
10993 if (NewOp.getNode())
10997 if (VT == MVT::v16i8) {
10998 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
10999 if (NewOp.getNode())
11003 if (VT == MVT::v32i8) {
11004 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11005 if (NewOp.getNode())
11009 // Handle all 128-bit wide vectors with 4 elements, and match them with
11010 // several different shuffle types.
11011 if (NumElems == 4 && VT.is128BitVector())
11012 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11014 // Handle general 256-bit shuffles
11015 if (VT.is256BitVector())
11016 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11021 // This function assumes its argument is a BUILD_VECTOR of constants or
11022 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11024 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11025 unsigned &MaskValue) {
11027 unsigned NumElems = BuildVector->getNumOperands();
11028 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11029 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11030 unsigned NumElemsInLane = NumElems / NumLanes;
11032 // Blend for v16i16 should be symetric for the both lanes.
11033 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11034 SDValue EltCond = BuildVector->getOperand(i);
11035 SDValue SndLaneEltCond =
11036 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11038 int Lane1Cond = -1, Lane2Cond = -1;
11039 if (isa<ConstantSDNode>(EltCond))
11040 Lane1Cond = !isZero(EltCond);
11041 if (isa<ConstantSDNode>(SndLaneEltCond))
11042 Lane2Cond = !isZero(SndLaneEltCond);
11044 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11045 // Lane1Cond != 0, means we want the first argument.
11046 // Lane1Cond == 0, means we want the second argument.
11047 // The encoding of this argument is 0 for the first argument, 1
11048 // for the second. Therefore, invert the condition.
11049 MaskValue |= !Lane1Cond << i;
11050 else if (Lane1Cond < 0)
11051 MaskValue |= !Lane2Cond << i;
11058 // Try to lower a vselect node into a simple blend instruction.
11059 static SDValue LowerVSELECTtoBlend(SDValue Op, const X86Subtarget *Subtarget,
11060 SelectionDAG &DAG) {
11061 SDValue Cond = Op.getOperand(0);
11062 SDValue LHS = Op.getOperand(1);
11063 SDValue RHS = Op.getOperand(2);
11065 MVT VT = Op.getSimpleValueType();
11066 MVT EltVT = VT.getVectorElementType();
11067 unsigned NumElems = VT.getVectorNumElements();
11069 // There is no blend with immediate in AVX-512.
11070 if (VT.is512BitVector())
11073 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
11075 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
11078 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
11081 // Check the mask for BLEND and build the value.
11082 unsigned MaskValue = 0;
11083 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
11086 // Convert i32 vectors to floating point if it is not AVX2.
11087 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
11089 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
11090 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
11092 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
11093 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
11096 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
11097 DAG.getConstant(MaskValue, MVT::i32));
11098 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
11101 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
11102 // A vselect where all conditions and data are constants can be optimized into
11103 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
11104 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
11105 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
11106 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
11109 SDValue BlendOp = LowerVSELECTtoBlend(Op, Subtarget, DAG);
11110 if (BlendOp.getNode())
11113 // Some types for vselect were previously set to Expand, not Legal or
11114 // Custom. Return an empty SDValue so we fall-through to Expand, after
11115 // the Custom lowering phase.
11116 MVT VT = Op.getSimpleValueType();
11117 switch (VT.SimpleTy) {
11122 if (Subtarget->hasBWI() && Subtarget->hasVLX())
11127 // We couldn't create a "Blend with immediate" node.
11128 // This node should still be legal, but we'll have to emit a blendv*
11133 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
11134 MVT VT = Op.getSimpleValueType();
11137 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
11140 if (VT.getSizeInBits() == 8) {
11141 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
11142 Op.getOperand(0), Op.getOperand(1));
11143 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11144 DAG.getValueType(VT));
11145 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11148 if (VT.getSizeInBits() == 16) {
11149 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11150 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
11152 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11153 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11154 DAG.getNode(ISD::BITCAST, dl,
11157 Op.getOperand(1)));
11158 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
11159 Op.getOperand(0), Op.getOperand(1));
11160 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
11161 DAG.getValueType(VT));
11162 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11165 if (VT == MVT::f32) {
11166 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
11167 // the result back to FR32 register. It's only worth matching if the
11168 // result has a single use which is a store or a bitcast to i32. And in
11169 // the case of a store, it's not worth it if the index is a constant 0,
11170 // because a MOVSSmr can be used instead, which is smaller and faster.
11171 if (!Op.hasOneUse())
11173 SDNode *User = *Op.getNode()->use_begin();
11174 if ((User->getOpcode() != ISD::STORE ||
11175 (isa<ConstantSDNode>(Op.getOperand(1)) &&
11176 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
11177 (User->getOpcode() != ISD::BITCAST ||
11178 User->getValueType(0) != MVT::i32))
11180 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11181 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
11184 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
11187 if (VT == MVT::i32 || VT == MVT::i64) {
11188 // ExtractPS/pextrq works with constant index.
11189 if (isa<ConstantSDNode>(Op.getOperand(1)))
11195 /// Extract one bit from mask vector, like v16i1 or v8i1.
11196 /// AVX-512 feature.
11198 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
11199 SDValue Vec = Op.getOperand(0);
11201 MVT VecVT = Vec.getSimpleValueType();
11202 SDValue Idx = Op.getOperand(1);
11203 MVT EltVT = Op.getSimpleValueType();
11205 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
11207 // variable index can't be handled in mask registers,
11208 // extend vector to VR512
11209 if (!isa<ConstantSDNode>(Idx)) {
11210 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11211 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
11212 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
11213 ExtVT.getVectorElementType(), Ext, Idx);
11214 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
11217 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11218 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11219 unsigned MaxSift = rc->getSize()*8 - 1;
11220 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
11221 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11222 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
11223 DAG.getConstant(MaxSift, MVT::i8));
11224 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
11225 DAG.getIntPtrConstant(0));
11229 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
11230 SelectionDAG &DAG) const {
11232 SDValue Vec = Op.getOperand(0);
11233 MVT VecVT = Vec.getSimpleValueType();
11234 SDValue Idx = Op.getOperand(1);
11236 if (Op.getSimpleValueType() == MVT::i1)
11237 return ExtractBitFromMaskVector(Op, DAG);
11239 if (!isa<ConstantSDNode>(Idx)) {
11240 if (VecVT.is512BitVector() ||
11241 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
11242 VecVT.getVectorElementType().getSizeInBits() == 32)) {
11245 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
11246 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
11247 MaskEltVT.getSizeInBits());
11249 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
11250 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
11251 getZeroVector(MaskVT, Subtarget, DAG, dl),
11252 Idx, DAG.getConstant(0, getPointerTy()));
11253 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
11254 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
11255 Perm, DAG.getConstant(0, getPointerTy()));
11260 // If this is a 256-bit vector result, first extract the 128-bit vector and
11261 // then extract the element from the 128-bit vector.
11262 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
11264 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11265 // Get the 128-bit vector.
11266 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
11267 MVT EltVT = VecVT.getVectorElementType();
11269 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
11271 //if (IdxVal >= NumElems/2)
11272 // IdxVal -= NumElems/2;
11273 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
11274 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
11275 DAG.getConstant(IdxVal, MVT::i32));
11278 assert(VecVT.is128BitVector() && "Unexpected vector length");
11280 if (Subtarget->hasSSE41()) {
11281 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
11286 MVT VT = Op.getSimpleValueType();
11287 // TODO: handle v16i8.
11288 if (VT.getSizeInBits() == 16) {
11289 SDValue Vec = Op.getOperand(0);
11290 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11292 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
11293 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
11294 DAG.getNode(ISD::BITCAST, dl,
11296 Op.getOperand(1)));
11297 // Transform it so it match pextrw which produces a 32-bit result.
11298 MVT EltVT = MVT::i32;
11299 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
11300 Op.getOperand(0), Op.getOperand(1));
11301 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
11302 DAG.getValueType(VT));
11303 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
11306 if (VT.getSizeInBits() == 32) {
11307 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11311 // SHUFPS the element to the lowest double word, then movss.
11312 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
11313 MVT VVT = Op.getOperand(0).getSimpleValueType();
11314 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11315 DAG.getUNDEF(VVT), Mask);
11316 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11317 DAG.getIntPtrConstant(0));
11320 if (VT.getSizeInBits() == 64) {
11321 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
11322 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
11323 // to match extract_elt for f64.
11324 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
11328 // UNPCKHPD the element to the lowest double word, then movsd.
11329 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
11330 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
11331 int Mask[2] = { 1, -1 };
11332 MVT VVT = Op.getOperand(0).getSimpleValueType();
11333 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
11334 DAG.getUNDEF(VVT), Mask);
11335 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
11336 DAG.getIntPtrConstant(0));
11342 /// Insert one bit to mask vector, like v16i1 or v8i1.
11343 /// AVX-512 feature.
11345 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
11347 SDValue Vec = Op.getOperand(0);
11348 SDValue Elt = Op.getOperand(1);
11349 SDValue Idx = Op.getOperand(2);
11350 MVT VecVT = Vec.getSimpleValueType();
11352 if (!isa<ConstantSDNode>(Idx)) {
11353 // Non constant index. Extend source and destination,
11354 // insert element and then truncate the result.
11355 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
11356 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
11357 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
11358 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
11359 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
11360 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
11363 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11364 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
11365 if (Vec.getOpcode() == ISD::UNDEF)
11366 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11367 DAG.getConstant(IdxVal, MVT::i8));
11368 const TargetRegisterClass* rc = getRegClassFor(VecVT);
11369 unsigned MaxSift = rc->getSize()*8 - 1;
11370 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
11371 DAG.getConstant(MaxSift, MVT::i8));
11372 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
11373 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
11374 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
11377 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
11378 SelectionDAG &DAG) const {
11379 MVT VT = Op.getSimpleValueType();
11380 MVT EltVT = VT.getVectorElementType();
11382 if (EltVT == MVT::i1)
11383 return InsertBitToMaskVector(Op, DAG);
11386 SDValue N0 = Op.getOperand(0);
11387 SDValue N1 = Op.getOperand(1);
11388 SDValue N2 = Op.getOperand(2);
11389 if (!isa<ConstantSDNode>(N2))
11391 auto *N2C = cast<ConstantSDNode>(N2);
11392 unsigned IdxVal = N2C->getZExtValue();
11394 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
11395 // into that, and then insert the subvector back into the result.
11396 if (VT.is256BitVector() || VT.is512BitVector()) {
11397 // Get the desired 128-bit vector half.
11398 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
11400 // Insert the element into the desired half.
11401 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
11402 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
11404 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
11405 DAG.getConstant(IdxIn128, MVT::i32));
11407 // Insert the changed part back to the 256-bit vector
11408 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
11410 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
11412 if (Subtarget->hasSSE41()) {
11413 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
11415 if (VT == MVT::v8i16) {
11416 Opc = X86ISD::PINSRW;
11418 assert(VT == MVT::v16i8);
11419 Opc = X86ISD::PINSRB;
11422 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
11424 if (N1.getValueType() != MVT::i32)
11425 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11426 if (N2.getValueType() != MVT::i32)
11427 N2 = DAG.getIntPtrConstant(IdxVal);
11428 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
11431 if (EltVT == MVT::f32) {
11432 // Bits [7:6] of the constant are the source select. This will always be
11433 // zero here. The DAG Combiner may combine an extract_elt index into
11435 // bits. For example (insert (extract, 3), 2) could be matched by
11437 // the '3' into bits [7:6] of X86ISD::INSERTPS.
11438 // Bits [5:4] of the constant are the destination select. This is the
11439 // value of the incoming immediate.
11440 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
11441 // combine either bitwise AND or insert of float 0.0 to set these bits.
11442 N2 = DAG.getIntPtrConstant(IdxVal << 4);
11443 // Create this as a scalar to vector..
11444 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
11445 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
11448 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
11449 // PINSR* works with constant index.
11454 if (EltVT == MVT::i8)
11457 if (EltVT.getSizeInBits() == 16) {
11458 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
11459 // as its second argument.
11460 if (N1.getValueType() != MVT::i32)
11461 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
11462 if (N2.getValueType() != MVT::i32)
11463 N2 = DAG.getIntPtrConstant(IdxVal);
11464 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
11469 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
11471 MVT OpVT = Op.getSimpleValueType();
11473 // If this is a 256-bit vector result, first insert into a 128-bit
11474 // vector and then insert into the 256-bit vector.
11475 if (!OpVT.is128BitVector()) {
11476 // Insert into a 128-bit vector.
11477 unsigned SizeFactor = OpVT.getSizeInBits()/128;
11478 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
11479 OpVT.getVectorNumElements() / SizeFactor);
11481 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
11483 // Insert the 128-bit vector.
11484 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
11487 if (OpVT == MVT::v1i64 &&
11488 Op.getOperand(0).getValueType() == MVT::i64)
11489 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
11491 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
11492 assert(OpVT.is128BitVector() && "Expected an SSE type!");
11493 return DAG.getNode(ISD::BITCAST, dl, OpVT,
11494 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
11497 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
11498 // a simple subregister reference or explicit instructions to grab
11499 // upper bits of a vector.
11500 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11501 SelectionDAG &DAG) {
11503 SDValue In = Op.getOperand(0);
11504 SDValue Idx = Op.getOperand(1);
11505 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11506 MVT ResVT = Op.getSimpleValueType();
11507 MVT InVT = In.getSimpleValueType();
11509 if (Subtarget->hasFp256()) {
11510 if (ResVT.is128BitVector() &&
11511 (InVT.is256BitVector() || InVT.is512BitVector()) &&
11512 isa<ConstantSDNode>(Idx)) {
11513 return Extract128BitVector(In, IdxVal, DAG, dl);
11515 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
11516 isa<ConstantSDNode>(Idx)) {
11517 return Extract256BitVector(In, IdxVal, DAG, dl);
11523 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
11524 // simple superregister reference or explicit instructions to insert
11525 // the upper bits of a vector.
11526 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
11527 SelectionDAG &DAG) {
11528 if (Subtarget->hasFp256()) {
11529 SDLoc dl(Op.getNode());
11530 SDValue Vec = Op.getNode()->getOperand(0);
11531 SDValue SubVec = Op.getNode()->getOperand(1);
11532 SDValue Idx = Op.getNode()->getOperand(2);
11534 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
11535 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
11536 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
11537 isa<ConstantSDNode>(Idx)) {
11538 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11539 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
11542 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
11543 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
11544 isa<ConstantSDNode>(Idx)) {
11545 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
11546 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
11552 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
11553 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
11554 // one of the above mentioned nodes. It has to be wrapped because otherwise
11555 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
11556 // be used to form addressing mode. These wrapped nodes will be selected
11559 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
11560 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
11562 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11563 // global base reg.
11564 unsigned char OpFlag = 0;
11565 unsigned WrapperKind = X86ISD::Wrapper;
11566 CodeModel::Model M = DAG.getTarget().getCodeModel();
11568 if (Subtarget->isPICStyleRIPRel() &&
11569 (M == CodeModel::Small || M == CodeModel::Kernel))
11570 WrapperKind = X86ISD::WrapperRIP;
11571 else if (Subtarget->isPICStyleGOT())
11572 OpFlag = X86II::MO_GOTOFF;
11573 else if (Subtarget->isPICStyleStubPIC())
11574 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11576 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
11577 CP->getAlignment(),
11578 CP->getOffset(), OpFlag);
11580 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11581 // With PIC, the address is actually $g + Offset.
11583 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11584 DAG.getNode(X86ISD::GlobalBaseReg,
11585 SDLoc(), getPointerTy()),
11592 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
11593 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
11595 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11596 // global base reg.
11597 unsigned char OpFlag = 0;
11598 unsigned WrapperKind = X86ISD::Wrapper;
11599 CodeModel::Model M = DAG.getTarget().getCodeModel();
11601 if (Subtarget->isPICStyleRIPRel() &&
11602 (M == CodeModel::Small || M == CodeModel::Kernel))
11603 WrapperKind = X86ISD::WrapperRIP;
11604 else if (Subtarget->isPICStyleGOT())
11605 OpFlag = X86II::MO_GOTOFF;
11606 else if (Subtarget->isPICStyleStubPIC())
11607 OpFlag = X86II::MO_PIC_BASE_OFFSET;
11609 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
11612 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11614 // With PIC, the address is actually $g + Offset.
11616 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11617 DAG.getNode(X86ISD::GlobalBaseReg,
11618 SDLoc(), getPointerTy()),
11625 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
11626 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
11628 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11629 // global base reg.
11630 unsigned char OpFlag = 0;
11631 unsigned WrapperKind = X86ISD::Wrapper;
11632 CodeModel::Model M = DAG.getTarget().getCodeModel();
11634 if (Subtarget->isPICStyleRIPRel() &&
11635 (M == CodeModel::Small || M == CodeModel::Kernel)) {
11636 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
11637 OpFlag = X86II::MO_GOTPCREL;
11638 WrapperKind = X86ISD::WrapperRIP;
11639 } else if (Subtarget->isPICStyleGOT()) {
11640 OpFlag = X86II::MO_GOT;
11641 } else if (Subtarget->isPICStyleStubPIC()) {
11642 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
11643 } else if (Subtarget->isPICStyleStubNoDynamic()) {
11644 OpFlag = X86II::MO_DARWIN_NONLAZY;
11647 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
11650 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11652 // With PIC, the address is actually $g + Offset.
11653 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
11654 !Subtarget->is64Bit()) {
11655 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11656 DAG.getNode(X86ISD::GlobalBaseReg,
11657 SDLoc(), getPointerTy()),
11661 // For symbols that require a load from a stub to get the address, emit the
11663 if (isGlobalStubReference(OpFlag))
11664 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
11665 MachinePointerInfo::getGOT(), false, false, false, 0);
11671 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
11672 // Create the TargetBlockAddressAddress node.
11673 unsigned char OpFlags =
11674 Subtarget->ClassifyBlockAddressReference();
11675 CodeModel::Model M = DAG.getTarget().getCodeModel();
11676 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
11677 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
11679 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
11682 if (Subtarget->isPICStyleRIPRel() &&
11683 (M == CodeModel::Small || M == CodeModel::Kernel))
11684 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11686 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11688 // With PIC, the address is actually $g + Offset.
11689 if (isGlobalRelativeToPICBase(OpFlags)) {
11690 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11691 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11699 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
11700 int64_t Offset, SelectionDAG &DAG) const {
11701 // Create the TargetGlobalAddress node, folding in the constant
11702 // offset if it is legal.
11703 unsigned char OpFlags =
11704 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
11705 CodeModel::Model M = DAG.getTarget().getCodeModel();
11707 if (OpFlags == X86II::MO_NO_FLAG &&
11708 X86::isOffsetSuitableForCodeModel(Offset, M)) {
11709 // A direct static reference to a global.
11710 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
11713 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
11716 if (Subtarget->isPICStyleRIPRel() &&
11717 (M == CodeModel::Small || M == CodeModel::Kernel))
11718 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
11720 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
11722 // With PIC, the address is actually $g + Offset.
11723 if (isGlobalRelativeToPICBase(OpFlags)) {
11724 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
11725 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
11729 // For globals that require a load from a stub to get the address, emit the
11731 if (isGlobalStubReference(OpFlags))
11732 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
11733 MachinePointerInfo::getGOT(), false, false, false, 0);
11735 // If there was a non-zero offset that we didn't fold, create an explicit
11736 // addition for it.
11738 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
11739 DAG.getConstant(Offset, getPointerTy()));
11745 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
11746 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
11747 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
11748 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
11752 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
11753 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
11754 unsigned char OperandFlags, bool LocalDynamic = false) {
11755 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11756 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11758 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11759 GA->getValueType(0),
11763 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
11767 SDValue Ops[] = { Chain, TGA, *InFlag };
11768 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11770 SDValue Ops[] = { Chain, TGA };
11771 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
11774 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
11775 MFI->setAdjustsStack(true);
11777 SDValue Flag = Chain.getValue(1);
11778 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
11781 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
11783 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11786 SDLoc dl(GA); // ? function entry point might be better
11787 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11788 DAG.getNode(X86ISD::GlobalBaseReg,
11789 SDLoc(), PtrVT), InFlag);
11790 InFlag = Chain.getValue(1);
11792 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
11795 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
11797 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11799 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
11800 X86::RAX, X86II::MO_TLSGD);
11803 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
11809 // Get the start address of the TLS block for this module.
11810 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
11811 .getInfo<X86MachineFunctionInfo>();
11812 MFI->incNumLocalDynamicTLSAccesses();
11816 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
11817 X86II::MO_TLSLD, /*LocalDynamic=*/true);
11820 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
11821 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
11822 InFlag = Chain.getValue(1);
11823 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
11824 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
11827 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
11831 unsigned char OperandFlags = X86II::MO_DTPOFF;
11832 unsigned WrapperKind = X86ISD::Wrapper;
11833 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
11834 GA->getValueType(0),
11835 GA->getOffset(), OperandFlags);
11836 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11838 // Add x@dtpoff with the base.
11839 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
11842 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
11843 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
11844 const EVT PtrVT, TLSModel::Model model,
11845 bool is64Bit, bool isPIC) {
11848 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
11849 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
11850 is64Bit ? 257 : 256));
11852 SDValue ThreadPointer =
11853 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
11854 MachinePointerInfo(Ptr), false, false, false, 0);
11856 unsigned char OperandFlags = 0;
11857 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
11859 unsigned WrapperKind = X86ISD::Wrapper;
11860 if (model == TLSModel::LocalExec) {
11861 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
11862 } else if (model == TLSModel::InitialExec) {
11864 OperandFlags = X86II::MO_GOTTPOFF;
11865 WrapperKind = X86ISD::WrapperRIP;
11867 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
11870 llvm_unreachable("Unexpected model");
11873 // emit "addl x@ntpoff,%eax" (local exec)
11874 // or "addl x@indntpoff,%eax" (initial exec)
11875 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
11877 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
11878 GA->getOffset(), OperandFlags);
11879 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
11881 if (model == TLSModel::InitialExec) {
11882 if (isPIC && !is64Bit) {
11883 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
11884 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
11888 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
11889 MachinePointerInfo::getGOT(), false, false, false, 0);
11892 // The address of the thread local variable is the add of the thread
11893 // pointer with the offset of the variable.
11894 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
11898 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
11900 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
11901 const GlobalValue *GV = GA->getGlobal();
11903 if (Subtarget->isTargetELF()) {
11904 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
11907 case TLSModel::GeneralDynamic:
11908 if (Subtarget->is64Bit())
11909 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
11910 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
11911 case TLSModel::LocalDynamic:
11912 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
11913 Subtarget->is64Bit());
11914 case TLSModel::InitialExec:
11915 case TLSModel::LocalExec:
11916 return LowerToTLSExecModel(
11917 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
11918 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
11920 llvm_unreachable("Unknown TLS model.");
11923 if (Subtarget->isTargetDarwin()) {
11924 // Darwin only has one model of TLS. Lower to that.
11925 unsigned char OpFlag = 0;
11926 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
11927 X86ISD::WrapperRIP : X86ISD::Wrapper;
11929 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
11930 // global base reg.
11931 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
11932 !Subtarget->is64Bit();
11934 OpFlag = X86II::MO_TLVP_PIC_BASE;
11936 OpFlag = X86II::MO_TLVP;
11938 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
11939 GA->getValueType(0),
11940 GA->getOffset(), OpFlag);
11941 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
11943 // With PIC32, the address is actually $g + Offset.
11945 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
11946 DAG.getNode(X86ISD::GlobalBaseReg,
11947 SDLoc(), getPointerTy()),
11950 // Lowering the machine isd will make sure everything is in the right
11952 SDValue Chain = DAG.getEntryNode();
11953 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
11954 SDValue Args[] = { Chain, Offset };
11955 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
11957 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
11958 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
11959 MFI->setAdjustsStack(true);
11961 // And our return value (tls address) is in the standard call return value
11963 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
11964 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
11965 Chain.getValue(1));
11968 if (Subtarget->isTargetKnownWindowsMSVC() ||
11969 Subtarget->isTargetWindowsGNU()) {
11970 // Just use the implicit TLS architecture
11971 // Need to generate someting similar to:
11972 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
11974 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
11975 // mov rcx, qword [rdx+rcx*8]
11976 // mov eax, .tls$:tlsvar
11977 // [rax+rcx] contains the address
11978 // Windows 64bit: gs:0x58
11979 // Windows 32bit: fs:__tls_array
11982 SDValue Chain = DAG.getEntryNode();
11984 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
11985 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
11986 // use its literal value of 0x2C.
11987 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
11988 ? Type::getInt8PtrTy(*DAG.getContext(),
11990 : Type::getInt32PtrTy(*DAG.getContext(),
11994 Subtarget->is64Bit()
11995 ? DAG.getIntPtrConstant(0x58)
11996 : (Subtarget->isTargetWindowsGNU()
11997 ? DAG.getIntPtrConstant(0x2C)
11998 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12000 SDValue ThreadPointer =
12001 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12002 MachinePointerInfo(Ptr), false, false, false, 0);
12004 // Load the _tls_index variable
12005 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12006 if (Subtarget->is64Bit())
12007 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12008 IDX, MachinePointerInfo(), MVT::i32,
12009 false, false, false, 0);
12011 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12012 false, false, false, 0);
12014 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12016 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12018 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12019 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12020 false, false, false, 0);
12022 // Get the offset of start of .tls section
12023 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12024 GA->getValueType(0),
12025 GA->getOffset(), X86II::MO_SECREL);
12026 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12028 // The address of the thread local variable is the add of the thread
12029 // pointer with the offset of the variable.
12030 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12033 llvm_unreachable("TLS not implemented for this target.");
12036 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12037 /// and take a 2 x i32 value to shift plus a shift amount.
12038 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12039 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12040 MVT VT = Op.getSimpleValueType();
12041 unsigned VTBits = VT.getSizeInBits();
12043 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12044 SDValue ShOpLo = Op.getOperand(0);
12045 SDValue ShOpHi = Op.getOperand(1);
12046 SDValue ShAmt = Op.getOperand(2);
12047 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
12048 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
12050 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12051 DAG.getConstant(VTBits - 1, MVT::i8));
12052 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
12053 DAG.getConstant(VTBits - 1, MVT::i8))
12054 : DAG.getConstant(0, VT);
12056 SDValue Tmp2, Tmp3;
12057 if (Op.getOpcode() == ISD::SHL_PARTS) {
12058 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
12059 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
12061 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
12062 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
12065 // If the shift amount is larger or equal than the width of a part we can't
12066 // rely on the results of shld/shrd. Insert a test and select the appropriate
12067 // values for large shift amounts.
12068 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
12069 DAG.getConstant(VTBits, MVT::i8));
12070 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
12071 AndNode, DAG.getConstant(0, MVT::i8));
12074 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
12075 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
12076 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
12078 if (Op.getOpcode() == ISD::SHL_PARTS) {
12079 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12080 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12082 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
12083 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
12086 SDValue Ops[2] = { Lo, Hi };
12087 return DAG.getMergeValues(Ops, dl);
12090 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
12091 SelectionDAG &DAG) const {
12092 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
12094 if (SrcVT.isVector())
12097 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
12098 "Unknown SINT_TO_FP to lower!");
12100 // These are really Legal; return the operand so the caller accepts it as
12102 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
12104 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
12105 Subtarget->is64Bit()) {
12110 unsigned Size = SrcVT.getSizeInBits()/8;
12111 MachineFunction &MF = DAG.getMachineFunction();
12112 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
12113 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12114 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12116 MachinePointerInfo::getFixedStack(SSFI),
12118 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
12121 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
12123 SelectionDAG &DAG) const {
12127 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
12129 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
12131 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
12133 unsigned ByteSize = SrcVT.getSizeInBits()/8;
12135 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
12136 MachineMemOperand *MMO;
12138 int SSFI = FI->getIndex();
12140 DAG.getMachineFunction()
12141 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12142 MachineMemOperand::MOLoad, ByteSize, ByteSize);
12144 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
12145 StackSlot = StackSlot.getOperand(1);
12147 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
12148 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
12150 Tys, Ops, SrcVT, MMO);
12153 Chain = Result.getValue(1);
12154 SDValue InFlag = Result.getValue(2);
12156 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
12157 // shouldn't be necessary except that RFP cannot be live across
12158 // multiple blocks. When stackifier is fixed, they can be uncoupled.
12159 MachineFunction &MF = DAG.getMachineFunction();
12160 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
12161 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
12162 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12163 Tys = DAG.getVTList(MVT::Other);
12165 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
12167 MachineMemOperand *MMO =
12168 DAG.getMachineFunction()
12169 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12170 MachineMemOperand::MOStore, SSFISize, SSFISize);
12172 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
12173 Ops, Op.getValueType(), MMO);
12174 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
12175 MachinePointerInfo::getFixedStack(SSFI),
12176 false, false, false, 0);
12182 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
12183 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
12184 SelectionDAG &DAG) const {
12185 // This algorithm is not obvious. Here it is what we're trying to output:
12188 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
12189 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
12191 haddpd %xmm0, %xmm0
12193 pshufd $0x4e, %xmm0, %xmm1
12199 LLVMContext *Context = DAG.getContext();
12201 // Build some magic constants.
12202 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
12203 Constant *C0 = ConstantDataVector::get(*Context, CV0);
12204 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
12206 SmallVector<Constant*,2> CV1;
12208 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12209 APInt(64, 0x4330000000000000ULL))));
12211 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
12212 APInt(64, 0x4530000000000000ULL))));
12213 Constant *C1 = ConstantVector::get(CV1);
12214 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
12216 // Load the 64-bit value into an XMM register.
12217 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
12219 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
12220 MachinePointerInfo::getConstantPool(),
12221 false, false, false, 16);
12222 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
12223 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
12226 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
12227 MachinePointerInfo::getConstantPool(),
12228 false, false, false, 16);
12229 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
12230 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
12233 if (Subtarget->hasSSE3()) {
12234 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
12235 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
12237 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
12238 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
12240 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
12241 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
12245 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
12246 DAG.getIntPtrConstant(0));
12249 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
12250 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
12251 SelectionDAG &DAG) const {
12253 // FP constant to bias correct the final result.
12254 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
12257 // Load the 32-bit value into an XMM register.
12258 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
12261 // Zero out the upper parts of the register.
12262 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
12264 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12265 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
12266 DAG.getIntPtrConstant(0));
12268 // Or the load with the bias.
12269 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
12270 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12271 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12272 MVT::v2f64, Load)),
12273 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
12274 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
12275 MVT::v2f64, Bias)));
12276 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
12277 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
12278 DAG.getIntPtrConstant(0));
12280 // Subtract the bias.
12281 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
12283 // Handle final rounding.
12284 EVT DestVT = Op.getValueType();
12286 if (DestVT.bitsLT(MVT::f64))
12287 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
12288 DAG.getIntPtrConstant(0));
12289 if (DestVT.bitsGT(MVT::f64))
12290 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
12292 // Handle final rounding.
12296 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
12297 SelectionDAG &DAG) const {
12298 SDValue N0 = Op.getOperand(0);
12299 MVT SVT = N0.getSimpleValueType();
12302 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
12303 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
12304 "Custom UINT_TO_FP is not supported!");
12306 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
12307 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
12308 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
12311 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
12312 SelectionDAG &DAG) const {
12313 SDValue N0 = Op.getOperand(0);
12316 if (Op.getValueType().isVector())
12317 return lowerUINT_TO_FP_vec(Op, DAG);
12319 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
12320 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
12321 // the optimization here.
12322 if (DAG.SignBitIsZero(N0))
12323 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
12325 MVT SrcVT = N0.getSimpleValueType();
12326 MVT DstVT = Op.getSimpleValueType();
12327 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
12328 return LowerUINT_TO_FP_i64(Op, DAG);
12329 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
12330 return LowerUINT_TO_FP_i32(Op, DAG);
12331 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
12334 // Make a 64-bit buffer, and use it to build an FILD.
12335 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
12336 if (SrcVT == MVT::i32) {
12337 SDValue WordOff = DAG.getConstant(4, getPointerTy());
12338 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
12339 getPointerTy(), StackSlot, WordOff);
12340 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12341 StackSlot, MachinePointerInfo(),
12343 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
12344 OffsetSlot, MachinePointerInfo(),
12346 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
12350 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
12351 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
12352 StackSlot, MachinePointerInfo(),
12354 // For i64 source, we need to add the appropriate power of 2 if the input
12355 // was negative. This is the same as the optimization in
12356 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
12357 // we must be careful to do the computation in x87 extended precision, not
12358 // in SSE. (The generic code can't know it's OK to do this, or how to.)
12359 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
12360 MachineMemOperand *MMO =
12361 DAG.getMachineFunction()
12362 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12363 MachineMemOperand::MOLoad, 8, 8);
12365 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
12366 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
12367 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
12370 APInt FF(32, 0x5F800000ULL);
12372 // Check whether the sign bit is set.
12373 SDValue SignSet = DAG.getSetCC(dl,
12374 getSetCCResultType(*DAG.getContext(), MVT::i64),
12375 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
12378 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
12379 SDValue FudgePtr = DAG.getConstantPool(
12380 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
12383 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
12384 SDValue Zero = DAG.getIntPtrConstant(0);
12385 SDValue Four = DAG.getIntPtrConstant(4);
12386 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
12388 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
12390 // Load the value out, extending it from f32 to f80.
12391 // FIXME: Avoid the extend by constructing the right constant pool?
12392 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
12393 FudgePtr, MachinePointerInfo::getConstantPool(),
12394 MVT::f32, false, false, false, 4);
12395 // Extend everything to 80 bits to force it to be done on x87.
12396 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
12397 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
12400 std::pair<SDValue,SDValue>
12401 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
12402 bool IsSigned, bool IsReplace) const {
12405 EVT DstTy = Op.getValueType();
12407 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
12408 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
12412 assert(DstTy.getSimpleVT() <= MVT::i64 &&
12413 DstTy.getSimpleVT() >= MVT::i16 &&
12414 "Unknown FP_TO_INT to lower!");
12416 // These are really Legal.
12417 if (DstTy == MVT::i32 &&
12418 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12419 return std::make_pair(SDValue(), SDValue());
12420 if (Subtarget->is64Bit() &&
12421 DstTy == MVT::i64 &&
12422 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
12423 return std::make_pair(SDValue(), SDValue());
12425 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
12426 // stack slot, or into the FTOL runtime function.
12427 MachineFunction &MF = DAG.getMachineFunction();
12428 unsigned MemSize = DstTy.getSizeInBits()/8;
12429 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12430 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12433 if (!IsSigned && isIntegerTypeFTOL(DstTy))
12434 Opc = X86ISD::WIN_FTOL;
12436 switch (DstTy.getSimpleVT().SimpleTy) {
12437 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
12438 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
12439 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
12440 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
12443 SDValue Chain = DAG.getEntryNode();
12444 SDValue Value = Op.getOperand(0);
12445 EVT TheVT = Op.getOperand(0).getValueType();
12446 // FIXME This causes a redundant load/store if the SSE-class value is already
12447 // in memory, such as if it is on the callstack.
12448 if (isScalarFPTypeInSSEReg(TheVT)) {
12449 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
12450 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
12451 MachinePointerInfo::getFixedStack(SSFI),
12453 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
12455 Chain, StackSlot, DAG.getValueType(TheVT)
12458 MachineMemOperand *MMO =
12459 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12460 MachineMemOperand::MOLoad, MemSize, MemSize);
12461 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
12462 Chain = Value.getValue(1);
12463 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
12464 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
12467 MachineMemOperand *MMO =
12468 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
12469 MachineMemOperand::MOStore, MemSize, MemSize);
12471 if (Opc != X86ISD::WIN_FTOL) {
12472 // Build the FP_TO_INT*_IN_MEM
12473 SDValue Ops[] = { Chain, Value, StackSlot };
12474 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
12476 return std::make_pair(FIST, StackSlot);
12478 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
12479 DAG.getVTList(MVT::Other, MVT::Glue),
12481 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
12482 MVT::i32, ftol.getValue(1));
12483 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
12484 MVT::i32, eax.getValue(2));
12485 SDValue Ops[] = { eax, edx };
12486 SDValue pair = IsReplace
12487 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
12488 : DAG.getMergeValues(Ops, DL);
12489 return std::make_pair(pair, SDValue());
12493 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
12494 const X86Subtarget *Subtarget) {
12495 MVT VT = Op->getSimpleValueType(0);
12496 SDValue In = Op->getOperand(0);
12497 MVT InVT = In.getSimpleValueType();
12500 // Optimize vectors in AVX mode:
12503 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
12504 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
12505 // Concat upper and lower parts.
12508 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
12509 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
12510 // Concat upper and lower parts.
12513 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
12514 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
12515 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
12518 if (Subtarget->hasInt256())
12519 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
12521 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
12522 SDValue Undef = DAG.getUNDEF(InVT);
12523 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
12524 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12525 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
12527 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
12528 VT.getVectorNumElements()/2);
12530 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
12531 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
12533 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
12536 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
12537 SelectionDAG &DAG) {
12538 MVT VT = Op->getSimpleValueType(0);
12539 SDValue In = Op->getOperand(0);
12540 MVT InVT = In.getSimpleValueType();
12542 unsigned int NumElts = VT.getVectorNumElements();
12543 if (NumElts != 8 && NumElts != 16)
12546 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
12547 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
12549 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
12550 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12551 // Now we have only mask extension
12552 assert(InVT.getVectorElementType() == MVT::i1);
12553 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
12554 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12555 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
12556 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12557 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12558 MachinePointerInfo::getConstantPool(),
12559 false, false, false, Alignment);
12561 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
12562 if (VT.is512BitVector())
12564 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
12567 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12568 SelectionDAG &DAG) {
12569 if (Subtarget->hasFp256()) {
12570 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12578 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
12579 SelectionDAG &DAG) {
12581 MVT VT = Op.getSimpleValueType();
12582 SDValue In = Op.getOperand(0);
12583 MVT SVT = In.getSimpleValueType();
12585 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
12586 return LowerZERO_EXTEND_AVX512(Op, DAG);
12588 if (Subtarget->hasFp256()) {
12589 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
12594 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
12595 VT.getVectorNumElements() != SVT.getVectorNumElements());
12599 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
12601 MVT VT = Op.getSimpleValueType();
12602 SDValue In = Op.getOperand(0);
12603 MVT InVT = In.getSimpleValueType();
12605 if (VT == MVT::i1) {
12606 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
12607 "Invalid scalar TRUNCATE operation");
12608 if (InVT.getSizeInBits() >= 32)
12610 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
12611 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
12613 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
12614 "Invalid TRUNCATE operation");
12616 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
12617 if (VT.getVectorElementType().getSizeInBits() >=8)
12618 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
12620 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
12621 unsigned NumElts = InVT.getVectorNumElements();
12622 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
12623 if (InVT.getSizeInBits() < 512) {
12624 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
12625 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
12629 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
12630 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
12631 SDValue CP = DAG.getConstantPool(C, getPointerTy());
12632 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
12633 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
12634 MachinePointerInfo::getConstantPool(),
12635 false, false, false, Alignment);
12636 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
12637 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
12638 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
12641 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
12642 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
12643 if (Subtarget->hasInt256()) {
12644 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
12645 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
12646 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
12648 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
12649 DAG.getIntPtrConstant(0));
12652 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12653 DAG.getIntPtrConstant(0));
12654 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12655 DAG.getIntPtrConstant(2));
12656 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12657 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12658 static const int ShufMask[] = {0, 2, 4, 6};
12659 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
12662 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
12663 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
12664 if (Subtarget->hasInt256()) {
12665 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
12667 SmallVector<SDValue,32> pshufbMask;
12668 for (unsigned i = 0; i < 2; ++i) {
12669 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
12670 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
12671 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
12672 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
12673 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
12674 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
12675 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
12676 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
12677 for (unsigned j = 0; j < 8; ++j)
12678 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
12680 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
12681 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
12682 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
12684 static const int ShufMask[] = {0, 2, -1, -1};
12685 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
12687 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
12688 DAG.getIntPtrConstant(0));
12689 return DAG.getNode(ISD::BITCAST, DL, VT, In);
12692 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12693 DAG.getIntPtrConstant(0));
12695 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
12696 DAG.getIntPtrConstant(4));
12698 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
12699 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
12701 // The PSHUFB mask:
12702 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
12703 -1, -1, -1, -1, -1, -1, -1, -1};
12705 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
12706 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
12707 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
12709 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
12710 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
12712 // The MOVLHPS Mask:
12713 static const int ShufMask2[] = {0, 1, 4, 5};
12714 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
12715 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
12718 // Handle truncation of V256 to V128 using shuffles.
12719 if (!VT.is128BitVector() || !InVT.is256BitVector())
12722 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
12724 unsigned NumElems = VT.getVectorNumElements();
12725 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
12727 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
12728 // Prepare truncation shuffle mask
12729 for (unsigned i = 0; i != NumElems; ++i)
12730 MaskVec[i] = i * 2;
12731 SDValue V = DAG.getVectorShuffle(NVT, DL,
12732 DAG.getNode(ISD::BITCAST, DL, NVT, In),
12733 DAG.getUNDEF(NVT), &MaskVec[0]);
12734 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
12735 DAG.getIntPtrConstant(0));
12738 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
12739 SelectionDAG &DAG) const {
12740 assert(!Op.getSimpleValueType().isVector());
12742 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12743 /*IsSigned=*/ true, /*IsReplace=*/ false);
12744 SDValue FIST = Vals.first, StackSlot = Vals.second;
12745 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
12746 if (!FIST.getNode()) return Op;
12748 if (StackSlot.getNode())
12749 // Load the result.
12750 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12751 FIST, StackSlot, MachinePointerInfo(),
12752 false, false, false, 0);
12754 // The node is the result.
12758 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
12759 SelectionDAG &DAG) const {
12760 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
12761 /*IsSigned=*/ false, /*IsReplace=*/ false);
12762 SDValue FIST = Vals.first, StackSlot = Vals.second;
12763 assert(FIST.getNode() && "Unexpected failure");
12765 if (StackSlot.getNode())
12766 // Load the result.
12767 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
12768 FIST, StackSlot, MachinePointerInfo(),
12769 false, false, false, 0);
12771 // The node is the result.
12775 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
12777 MVT VT = Op.getSimpleValueType();
12778 SDValue In = Op.getOperand(0);
12779 MVT SVT = In.getSimpleValueType();
12781 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
12783 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
12784 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
12785 In, DAG.getUNDEF(SVT)));
12788 // The only differences between FABS and FNEG are the mask and the logic op.
12789 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
12790 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
12791 "Wrong opcode for lowering FABS or FNEG.");
12793 bool IsFABS = (Op.getOpcode() == ISD::FABS);
12795 MVT VT = Op.getSimpleValueType();
12796 // Assume scalar op for initialization; update for vector if needed.
12797 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
12798 // generate a 16-byte vector constant and logic op even for the scalar case.
12799 // Using a 16-byte mask allows folding the load of the mask with
12800 // the logic op, so it can save (~4 bytes) on code size.
12802 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
12803 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
12804 // decide if we should generate a 16-byte constant mask when we only need 4 or
12805 // 8 bytes for the scalar case.
12806 if (VT.isVector()) {
12807 EltVT = VT.getVectorElementType();
12808 NumElts = VT.getVectorNumElements();
12811 unsigned EltBits = EltVT.getSizeInBits();
12812 LLVMContext *Context = DAG.getContext();
12813 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
12815 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
12816 Constant *C = ConstantInt::get(*Context, MaskElt);
12817 C = ConstantVector::getSplat(NumElts, C);
12818 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12819 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
12820 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
12821 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12822 MachinePointerInfo::getConstantPool(),
12823 false, false, false, Alignment);
12825 if (VT.isVector()) {
12826 // For a vector, cast operands to a vector type, perform the logic op,
12827 // and cast the result back to the original value type.
12828 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
12829 SDValue Op0Casted = DAG.getNode(ISD::BITCAST, dl, VecVT, Op.getOperand(0));
12830 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
12831 unsigned LogicOp = IsFABS ? ISD::AND : ISD::XOR;
12832 return DAG.getNode(ISD::BITCAST, dl, VT,
12833 DAG.getNode(LogicOp, dl, VecVT, Op0Casted, MaskCasted));
12835 // If not vector, then scalar.
12836 unsigned LogicOp = IsFABS ? X86ISD::FAND : X86ISD::FXOR;
12837 return DAG.getNode(LogicOp, dl, VT, Op.getOperand(0), Mask);
12840 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
12841 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
12842 LLVMContext *Context = DAG.getContext();
12843 SDValue Op0 = Op.getOperand(0);
12844 SDValue Op1 = Op.getOperand(1);
12846 MVT VT = Op.getSimpleValueType();
12847 MVT SrcVT = Op1.getSimpleValueType();
12849 // If second operand is smaller, extend it first.
12850 if (SrcVT.bitsLT(VT)) {
12851 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
12854 // And if it is bigger, shrink it first.
12855 if (SrcVT.bitsGT(VT)) {
12856 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
12860 // At this point the operands and the result should have the same
12861 // type, and that won't be f80 since that is not custom lowered.
12863 // First get the sign bit of second operand.
12864 SmallVector<Constant*,4> CV;
12865 if (SrcVT == MVT::f64) {
12866 const fltSemantics &Sem = APFloat::IEEEdouble;
12867 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
12868 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12870 const fltSemantics &Sem = APFloat::IEEEsingle;
12871 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
12872 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12873 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12874 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12876 Constant *C = ConstantVector::get(CV);
12877 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12878 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
12879 MachinePointerInfo::getConstantPool(),
12880 false, false, false, 16);
12881 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
12883 // Shift sign bit right or left if the two operands have different types.
12884 if (SrcVT.bitsGT(VT)) {
12885 // Op0 is MVT::f32, Op1 is MVT::f64.
12886 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
12887 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
12888 DAG.getConstant(32, MVT::i32));
12889 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
12890 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
12891 DAG.getIntPtrConstant(0));
12894 // Clear first operand sign bit.
12896 if (VT == MVT::f64) {
12897 const fltSemantics &Sem = APFloat::IEEEdouble;
12898 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12899 APInt(64, ~(1ULL << 63)))));
12900 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
12902 const fltSemantics &Sem = APFloat::IEEEsingle;
12903 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
12904 APInt(32, ~(1U << 31)))));
12905 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12906 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12907 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
12909 C = ConstantVector::get(CV);
12910 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
12911 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
12912 MachinePointerInfo::getConstantPool(),
12913 false, false, false, 16);
12914 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
12916 // Or the value with the sign bit.
12917 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
12920 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
12921 SDValue N0 = Op.getOperand(0);
12923 MVT VT = Op.getSimpleValueType();
12925 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
12926 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
12927 DAG.getConstant(1, VT));
12928 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
12931 // LowerVectorAllZeroTest - Check whether an OR'd tree is PTEST-able.
12933 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
12934 SelectionDAG &DAG) {
12935 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
12937 if (!Subtarget->hasSSE41())
12940 if (!Op->hasOneUse())
12943 SDNode *N = Op.getNode();
12946 SmallVector<SDValue, 8> Opnds;
12947 DenseMap<SDValue, unsigned> VecInMap;
12948 SmallVector<SDValue, 8> VecIns;
12949 EVT VT = MVT::Other;
12951 // Recognize a special case where a vector is casted into wide integer to
12953 Opnds.push_back(N->getOperand(0));
12954 Opnds.push_back(N->getOperand(1));
12956 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
12957 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
12958 // BFS traverse all OR'd operands.
12959 if (I->getOpcode() == ISD::OR) {
12960 Opnds.push_back(I->getOperand(0));
12961 Opnds.push_back(I->getOperand(1));
12962 // Re-evaluate the number of nodes to be traversed.
12963 e += 2; // 2 more nodes (LHS and RHS) are pushed.
12967 // Quit if a non-EXTRACT_VECTOR_ELT
12968 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
12971 // Quit if without a constant index.
12972 SDValue Idx = I->getOperand(1);
12973 if (!isa<ConstantSDNode>(Idx))
12976 SDValue ExtractedFromVec = I->getOperand(0);
12977 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
12978 if (M == VecInMap.end()) {
12979 VT = ExtractedFromVec.getValueType();
12980 // Quit if not 128/256-bit vector.
12981 if (!VT.is128BitVector() && !VT.is256BitVector())
12983 // Quit if not the same type.
12984 if (VecInMap.begin() != VecInMap.end() &&
12985 VT != VecInMap.begin()->first.getValueType())
12987 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
12988 VecIns.push_back(ExtractedFromVec);
12990 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
12993 assert((VT.is128BitVector() || VT.is256BitVector()) &&
12994 "Not extracted from 128-/256-bit vector.");
12996 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
12998 for (DenseMap<SDValue, unsigned>::const_iterator
12999 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13000 // Quit if not all elements are used.
13001 if (I->second != FullMask)
13005 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13007 // Cast all vectors into TestVT for PTEST.
13008 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13009 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13011 // If more than one full vectors are evaluated, OR them first before PTEST.
13012 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13013 // Each iteration will OR 2 nodes and append the result until there is only
13014 // 1 node left, i.e. the final OR'd value of all vectors.
13015 SDValue LHS = VecIns[Slot];
13016 SDValue RHS = VecIns[Slot + 1];
13017 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13020 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13021 VecIns.back(), VecIns.back());
13024 /// \brief return true if \c Op has a use that doesn't just read flags.
13025 static bool hasNonFlagsUse(SDValue Op) {
13026 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13028 SDNode *User = *UI;
13029 unsigned UOpNo = UI.getOperandNo();
13030 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
13031 // Look pass truncate.
13032 UOpNo = User->use_begin().getOperandNo();
13033 User = *User->use_begin();
13036 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
13037 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
13043 /// Emit nodes that will be selected as "test Op0,Op0", or something
13045 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
13046 SelectionDAG &DAG) const {
13047 if (Op.getValueType() == MVT::i1)
13048 // KORTEST instruction should be selected
13049 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13050 DAG.getConstant(0, Op.getValueType()));
13052 // CF and OF aren't always set the way we want. Determine which
13053 // of these we need.
13054 bool NeedCF = false;
13055 bool NeedOF = false;
13058 case X86::COND_A: case X86::COND_AE:
13059 case X86::COND_B: case X86::COND_BE:
13062 case X86::COND_G: case X86::COND_GE:
13063 case X86::COND_L: case X86::COND_LE:
13064 case X86::COND_O: case X86::COND_NO: {
13065 // Check if we really need to set the
13066 // Overflow flag. If NoSignedWrap is present
13067 // that is not actually needed.
13068 switch (Op->getOpcode()) {
13073 const BinaryWithFlagsSDNode *BinNode =
13074 cast<BinaryWithFlagsSDNode>(Op.getNode());
13075 if (BinNode->hasNoSignedWrap())
13085 // See if we can use the EFLAGS value from the operand instead of
13086 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
13087 // we prove that the arithmetic won't overflow, we can't use OF or CF.
13088 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
13089 // Emit a CMP with 0, which is the TEST pattern.
13090 //if (Op.getValueType() == MVT::i1)
13091 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
13092 // DAG.getConstant(0, MVT::i1));
13093 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13094 DAG.getConstant(0, Op.getValueType()));
13096 unsigned Opcode = 0;
13097 unsigned NumOperands = 0;
13099 // Truncate operations may prevent the merge of the SETCC instruction
13100 // and the arithmetic instruction before it. Attempt to truncate the operands
13101 // of the arithmetic instruction and use a reduced bit-width instruction.
13102 bool NeedTruncation = false;
13103 SDValue ArithOp = Op;
13104 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
13105 SDValue Arith = Op->getOperand(0);
13106 // Both the trunc and the arithmetic op need to have one user each.
13107 if (Arith->hasOneUse())
13108 switch (Arith.getOpcode()) {
13115 NeedTruncation = true;
13121 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
13122 // which may be the result of a CAST. We use the variable 'Op', which is the
13123 // non-casted variable when we check for possible users.
13124 switch (ArithOp.getOpcode()) {
13126 // Due to an isel shortcoming, be conservative if this add is likely to be
13127 // selected as part of a load-modify-store instruction. When the root node
13128 // in a match is a store, isel doesn't know how to remap non-chain non-flag
13129 // uses of other nodes in the match, such as the ADD in this case. This
13130 // leads to the ADD being left around and reselected, with the result being
13131 // two adds in the output. Alas, even if none our users are stores, that
13132 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
13133 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
13134 // climbing the DAG back to the root, and it doesn't seem to be worth the
13136 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13137 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13138 if (UI->getOpcode() != ISD::CopyToReg &&
13139 UI->getOpcode() != ISD::SETCC &&
13140 UI->getOpcode() != ISD::STORE)
13143 if (ConstantSDNode *C =
13144 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
13145 // An add of one will be selected as an INC.
13146 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
13147 Opcode = X86ISD::INC;
13152 // An add of negative one (subtract of one) will be selected as a DEC.
13153 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
13154 Opcode = X86ISD::DEC;
13160 // Otherwise use a regular EFLAGS-setting add.
13161 Opcode = X86ISD::ADD;
13166 // If we have a constant logical shift that's only used in a comparison
13167 // against zero turn it into an equivalent AND. This allows turning it into
13168 // a TEST instruction later.
13169 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
13170 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
13171 EVT VT = Op.getValueType();
13172 unsigned BitWidth = VT.getSizeInBits();
13173 unsigned ShAmt = Op->getConstantOperandVal(1);
13174 if (ShAmt >= BitWidth) // Avoid undefined shifts.
13176 APInt Mask = ArithOp.getOpcode() == ISD::SRL
13177 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
13178 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
13179 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
13181 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
13182 DAG.getConstant(Mask, VT));
13183 DAG.ReplaceAllUsesWith(Op, New);
13189 // If the primary and result isn't used, don't bother using X86ISD::AND,
13190 // because a TEST instruction will be better.
13191 if (!hasNonFlagsUse(Op))
13197 // Due to the ISEL shortcoming noted above, be conservative if this op is
13198 // likely to be selected as part of a load-modify-store instruction.
13199 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
13200 UE = Op.getNode()->use_end(); UI != UE; ++UI)
13201 if (UI->getOpcode() == ISD::STORE)
13204 // Otherwise use a regular EFLAGS-setting instruction.
13205 switch (ArithOp.getOpcode()) {
13206 default: llvm_unreachable("unexpected operator!");
13207 case ISD::SUB: Opcode = X86ISD::SUB; break;
13208 case ISD::XOR: Opcode = X86ISD::XOR; break;
13209 case ISD::AND: Opcode = X86ISD::AND; break;
13211 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
13212 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
13213 if (EFLAGS.getNode())
13216 Opcode = X86ISD::OR;
13230 return SDValue(Op.getNode(), 1);
13236 // If we found that truncation is beneficial, perform the truncation and
13238 if (NeedTruncation) {
13239 EVT VT = Op.getValueType();
13240 SDValue WideVal = Op->getOperand(0);
13241 EVT WideVT = WideVal.getValueType();
13242 unsigned ConvertedOp = 0;
13243 // Use a target machine opcode to prevent further DAGCombine
13244 // optimizations that may separate the arithmetic operations
13245 // from the setcc node.
13246 switch (WideVal.getOpcode()) {
13248 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
13249 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
13250 case ISD::AND: ConvertedOp = X86ISD::AND; break;
13251 case ISD::OR: ConvertedOp = X86ISD::OR; break;
13252 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
13256 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13257 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
13258 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
13259 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
13260 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
13266 // Emit a CMP with 0, which is the TEST pattern.
13267 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
13268 DAG.getConstant(0, Op.getValueType()));
13270 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
13271 SmallVector<SDValue, 4> Ops;
13272 for (unsigned i = 0; i != NumOperands; ++i)
13273 Ops.push_back(Op.getOperand(i));
13275 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
13276 DAG.ReplaceAllUsesWith(Op, New);
13277 return SDValue(New.getNode(), 1);
13280 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
13282 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
13283 SDLoc dl, SelectionDAG &DAG) const {
13284 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
13285 if (C->getAPIntValue() == 0)
13286 return EmitTest(Op0, X86CC, dl, DAG);
13288 if (Op0.getValueType() == MVT::i1)
13289 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
13292 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
13293 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
13294 // Do the comparison at i32 if it's smaller, besides the Atom case.
13295 // This avoids subregister aliasing issues. Keep the smaller reference
13296 // if we're optimizing for size, however, as that'll allow better folding
13297 // of memory operations.
13298 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
13299 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
13300 AttributeSet::FunctionIndex, Attribute::MinSize) &&
13301 !Subtarget->isAtom()) {
13302 unsigned ExtendOp =
13303 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
13304 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
13305 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
13307 // Use SUB instead of CMP to enable CSE between SUB and CMP.
13308 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
13309 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
13311 return SDValue(Sub.getNode(), 1);
13313 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
13316 /// Convert a comparison if required by the subtarget.
13317 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
13318 SelectionDAG &DAG) const {
13319 // If the subtarget does not support the FUCOMI instruction, floating-point
13320 // comparisons have to be converted.
13321 if (Subtarget->hasCMov() ||
13322 Cmp.getOpcode() != X86ISD::CMP ||
13323 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
13324 !Cmp.getOperand(1).getValueType().isFloatingPoint())
13327 // The instruction selector will select an FUCOM instruction instead of
13328 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
13329 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
13330 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
13332 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
13333 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
13334 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
13335 DAG.getConstant(8, MVT::i8));
13336 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
13337 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
13340 static bool isAllOnes(SDValue V) {
13341 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
13342 return C && C->isAllOnesValue();
13345 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
13346 /// if it's possible.
13347 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
13348 SDLoc dl, SelectionDAG &DAG) const {
13349 SDValue Op0 = And.getOperand(0);
13350 SDValue Op1 = And.getOperand(1);
13351 if (Op0.getOpcode() == ISD::TRUNCATE)
13352 Op0 = Op0.getOperand(0);
13353 if (Op1.getOpcode() == ISD::TRUNCATE)
13354 Op1 = Op1.getOperand(0);
13357 if (Op1.getOpcode() == ISD::SHL)
13358 std::swap(Op0, Op1);
13359 if (Op0.getOpcode() == ISD::SHL) {
13360 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
13361 if (And00C->getZExtValue() == 1) {
13362 // If we looked past a truncate, check that it's only truncating away
13364 unsigned BitWidth = Op0.getValueSizeInBits();
13365 unsigned AndBitWidth = And.getValueSizeInBits();
13366 if (BitWidth > AndBitWidth) {
13368 DAG.computeKnownBits(Op0, Zeros, Ones);
13369 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
13373 RHS = Op0.getOperand(1);
13375 } else if (Op1.getOpcode() == ISD::Constant) {
13376 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
13377 uint64_t AndRHSVal = AndRHS->getZExtValue();
13378 SDValue AndLHS = Op0;
13380 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
13381 LHS = AndLHS.getOperand(0);
13382 RHS = AndLHS.getOperand(1);
13385 // Use BT if the immediate can't be encoded in a TEST instruction.
13386 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
13388 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
13392 if (LHS.getNode()) {
13393 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
13394 // instruction. Since the shift amount is in-range-or-undefined, we know
13395 // that doing a bittest on the i32 value is ok. We extend to i32 because
13396 // the encoding for the i16 version is larger than the i32 version.
13397 // Also promote i16 to i32 for performance / code size reason.
13398 if (LHS.getValueType() == MVT::i8 ||
13399 LHS.getValueType() == MVT::i16)
13400 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
13402 // If the operand types disagree, extend the shift amount to match. Since
13403 // BT ignores high bits (like shifts) we can use anyextend.
13404 if (LHS.getValueType() != RHS.getValueType())
13405 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
13407 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
13408 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
13409 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13410 DAG.getConstant(Cond, MVT::i8), BT);
13416 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
13418 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
13423 // SSE Condition code mapping:
13432 switch (SetCCOpcode) {
13433 default: llvm_unreachable("Unexpected SETCC condition");
13435 case ISD::SETEQ: SSECC = 0; break;
13437 case ISD::SETGT: Swap = true; // Fallthrough
13439 case ISD::SETOLT: SSECC = 1; break;
13441 case ISD::SETGE: Swap = true; // Fallthrough
13443 case ISD::SETOLE: SSECC = 2; break;
13444 case ISD::SETUO: SSECC = 3; break;
13446 case ISD::SETNE: SSECC = 4; break;
13447 case ISD::SETULE: Swap = true; // Fallthrough
13448 case ISD::SETUGE: SSECC = 5; break;
13449 case ISD::SETULT: Swap = true; // Fallthrough
13450 case ISD::SETUGT: SSECC = 6; break;
13451 case ISD::SETO: SSECC = 7; break;
13453 case ISD::SETONE: SSECC = 8; break;
13456 std::swap(Op0, Op1);
13461 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
13462 // ones, and then concatenate the result back.
13463 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
13464 MVT VT = Op.getSimpleValueType();
13466 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
13467 "Unsupported value type for operation");
13469 unsigned NumElems = VT.getVectorNumElements();
13471 SDValue CC = Op.getOperand(2);
13473 // Extract the LHS vectors
13474 SDValue LHS = Op.getOperand(0);
13475 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
13476 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
13478 // Extract the RHS vectors
13479 SDValue RHS = Op.getOperand(1);
13480 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
13481 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
13483 // Issue the operation on the smaller types and concatenate the result back
13484 MVT EltVT = VT.getVectorElementType();
13485 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
13486 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
13487 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
13488 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
13491 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
13492 const X86Subtarget *Subtarget) {
13493 SDValue Op0 = Op.getOperand(0);
13494 SDValue Op1 = Op.getOperand(1);
13495 SDValue CC = Op.getOperand(2);
13496 MVT VT = Op.getSimpleValueType();
13499 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
13500 Op.getValueType().getScalarType() == MVT::i1 &&
13501 "Cannot set masked compare for this operation");
13503 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13505 bool Unsigned = false;
13508 switch (SetCCOpcode) {
13509 default: llvm_unreachable("Unexpected SETCC condition");
13510 case ISD::SETNE: SSECC = 4; break;
13511 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
13512 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
13513 case ISD::SETLT: Swap = true; //fall-through
13514 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
13515 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
13516 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
13517 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
13518 case ISD::SETULE: Unsigned = true; //fall-through
13519 case ISD::SETLE: SSECC = 2; break;
13523 std::swap(Op0, Op1);
13525 return DAG.getNode(Opc, dl, VT, Op0, Op1);
13526 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
13527 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13528 DAG.getConstant(SSECC, MVT::i8));
13531 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
13532 /// operand \p Op1. If non-trivial (for example because it's not constant)
13533 /// return an empty value.
13534 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
13536 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
13540 MVT VT = Op1.getSimpleValueType();
13541 MVT EVT = VT.getVectorElementType();
13542 unsigned n = VT.getVectorNumElements();
13543 SmallVector<SDValue, 8> ULTOp1;
13545 for (unsigned i = 0; i < n; ++i) {
13546 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
13547 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
13550 // Avoid underflow.
13551 APInt Val = Elt->getAPIntValue();
13555 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
13558 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
13561 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
13562 SelectionDAG &DAG) {
13563 SDValue Op0 = Op.getOperand(0);
13564 SDValue Op1 = Op.getOperand(1);
13565 SDValue CC = Op.getOperand(2);
13566 MVT VT = Op.getSimpleValueType();
13567 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
13568 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
13573 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
13574 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
13577 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
13578 unsigned Opc = X86ISD::CMPP;
13579 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
13580 assert(VT.getVectorNumElements() <= 16);
13581 Opc = X86ISD::CMPM;
13583 // In the two special cases we can't handle, emit two comparisons.
13586 unsigned CombineOpc;
13587 if (SetCCOpcode == ISD::SETUEQ) {
13588 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
13590 assert(SetCCOpcode == ISD::SETONE);
13591 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
13594 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13595 DAG.getConstant(CC0, MVT::i8));
13596 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
13597 DAG.getConstant(CC1, MVT::i8));
13598 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
13600 // Handle all other FP comparisons here.
13601 return DAG.getNode(Opc, dl, VT, Op0, Op1,
13602 DAG.getConstant(SSECC, MVT::i8));
13605 // Break 256-bit integer vector compare into smaller ones.
13606 if (VT.is256BitVector() && !Subtarget->hasInt256())
13607 return Lower256IntVSETCC(Op, DAG);
13609 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
13610 EVT OpVT = Op1.getValueType();
13611 if (Subtarget->hasAVX512()) {
13612 if (Op1.getValueType().is512BitVector() ||
13613 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
13614 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
13615 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
13617 // In AVX-512 architecture setcc returns mask with i1 elements,
13618 // But there is no compare instruction for i8 and i16 elements in KNL.
13619 // We are not talking about 512-bit operands in this case, these
13620 // types are illegal.
13622 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
13623 OpVT.getVectorElementType().getSizeInBits() >= 8))
13624 return DAG.getNode(ISD::TRUNCATE, dl, VT,
13625 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
13628 // We are handling one of the integer comparisons here. Since SSE only has
13629 // GT and EQ comparisons for integer, swapping operands and multiple
13630 // operations may be required for some comparisons.
13632 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
13633 bool Subus = false;
13635 switch (SetCCOpcode) {
13636 default: llvm_unreachable("Unexpected SETCC condition");
13637 case ISD::SETNE: Invert = true;
13638 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
13639 case ISD::SETLT: Swap = true;
13640 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
13641 case ISD::SETGE: Swap = true;
13642 case ISD::SETLE: Opc = X86ISD::PCMPGT;
13643 Invert = true; break;
13644 case ISD::SETULT: Swap = true;
13645 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
13646 FlipSigns = true; break;
13647 case ISD::SETUGE: Swap = true;
13648 case ISD::SETULE: Opc = X86ISD::PCMPGT;
13649 FlipSigns = true; Invert = true; break;
13652 // Special case: Use min/max operations for SETULE/SETUGE
13653 MVT VET = VT.getVectorElementType();
13655 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
13656 || (Subtarget->hasSSE2() && (VET == MVT::i8));
13659 switch (SetCCOpcode) {
13661 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
13662 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
13665 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
13668 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
13669 if (!MinMax && hasSubus) {
13670 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
13672 // t = psubus Op0, Op1
13673 // pcmpeq t, <0..0>
13674 switch (SetCCOpcode) {
13676 case ISD::SETULT: {
13677 // If the comparison is against a constant we can turn this into a
13678 // setule. With psubus, setule does not require a swap. This is
13679 // beneficial because the constant in the register is no longer
13680 // destructed as the destination so it can be hoisted out of a loop.
13681 // Only do this pre-AVX since vpcmp* is no longer destructive.
13682 if (Subtarget->hasAVX())
13684 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
13685 if (ULEOp1.getNode()) {
13687 Subus = true; Invert = false; Swap = false;
13691 // Psubus is better than flip-sign because it requires no inversion.
13692 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
13693 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
13697 Opc = X86ISD::SUBUS;
13703 std::swap(Op0, Op1);
13705 // Check that the operation in question is available (most are plain SSE2,
13706 // but PCMPGTQ and PCMPEQQ have different requirements).
13707 if (VT == MVT::v2i64) {
13708 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
13709 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
13711 // First cast everything to the right type.
13712 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13713 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13715 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13716 // bits of the inputs before performing those operations. The lower
13717 // compare is always unsigned.
13720 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
13722 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
13723 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
13724 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
13725 Sign, Zero, Sign, Zero);
13727 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
13728 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
13730 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
13731 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
13732 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
13734 // Create masks for only the low parts/high parts of the 64 bit integers.
13735 static const int MaskHi[] = { 1, 1, 3, 3 };
13736 static const int MaskLo[] = { 0, 0, 2, 2 };
13737 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
13738 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
13739 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
13741 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
13742 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
13745 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13747 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13750 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
13751 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
13752 // pcmpeqd + pshufd + pand.
13753 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
13755 // First cast everything to the right type.
13756 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
13757 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
13760 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
13762 // Make sure the lower and upper halves are both all-ones.
13763 static const int Mask[] = { 1, 0, 3, 2 };
13764 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
13765 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
13768 Result = DAG.getNOT(dl, Result, MVT::v4i32);
13770 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
13774 // Since SSE has no unsigned integer comparisons, we need to flip the sign
13775 // bits of the inputs before performing those operations.
13777 EVT EltVT = VT.getVectorElementType();
13778 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
13779 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
13780 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
13783 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
13785 // If the logical-not of the result is required, perform that now.
13787 Result = DAG.getNOT(dl, Result, VT);
13790 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
13793 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
13794 getZeroVector(VT, Subtarget, DAG, dl));
13799 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
13801 MVT VT = Op.getSimpleValueType();
13803 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
13805 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
13806 && "SetCC type must be 8-bit or 1-bit integer");
13807 SDValue Op0 = Op.getOperand(0);
13808 SDValue Op1 = Op.getOperand(1);
13810 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
13812 // Optimize to BT if possible.
13813 // Lower (X & (1 << N)) == 0 to BT(X, N).
13814 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
13815 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
13816 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
13817 Op1.getOpcode() == ISD::Constant &&
13818 cast<ConstantSDNode>(Op1)->isNullValue() &&
13819 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13820 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
13821 if (NewSetCC.getNode())
13825 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
13827 if (Op1.getOpcode() == ISD::Constant &&
13828 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
13829 cast<ConstantSDNode>(Op1)->isNullValue()) &&
13830 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13832 // If the input is a setcc, then reuse the input setcc or use a new one with
13833 // the inverted condition.
13834 if (Op0.getOpcode() == X86ISD::SETCC) {
13835 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
13836 bool Invert = (CC == ISD::SETNE) ^
13837 cast<ConstantSDNode>(Op1)->isNullValue();
13841 CCode = X86::GetOppositeBranchCondition(CCode);
13842 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13843 DAG.getConstant(CCode, MVT::i8),
13844 Op0.getOperand(1));
13846 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13850 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
13851 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
13852 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
13854 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
13855 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
13858 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
13859 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
13860 if (X86CC == X86::COND_INVALID)
13863 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
13864 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
13865 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
13866 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
13868 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
13872 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
13873 static bool isX86LogicalCmp(SDValue Op) {
13874 unsigned Opc = Op.getNode()->getOpcode();
13875 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
13876 Opc == X86ISD::SAHF)
13878 if (Op.getResNo() == 1 &&
13879 (Opc == X86ISD::ADD ||
13880 Opc == X86ISD::SUB ||
13881 Opc == X86ISD::ADC ||
13882 Opc == X86ISD::SBB ||
13883 Opc == X86ISD::SMUL ||
13884 Opc == X86ISD::UMUL ||
13885 Opc == X86ISD::INC ||
13886 Opc == X86ISD::DEC ||
13887 Opc == X86ISD::OR ||
13888 Opc == X86ISD::XOR ||
13889 Opc == X86ISD::AND))
13892 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
13898 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
13899 if (V.getOpcode() != ISD::TRUNCATE)
13902 SDValue VOp0 = V.getOperand(0);
13903 unsigned InBits = VOp0.getValueSizeInBits();
13904 unsigned Bits = V.getValueSizeInBits();
13905 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
13908 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
13909 bool addTest = true;
13910 SDValue Cond = Op.getOperand(0);
13911 SDValue Op1 = Op.getOperand(1);
13912 SDValue Op2 = Op.getOperand(2);
13914 EVT VT = Op1.getValueType();
13917 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
13918 // are available. Otherwise fp cmovs get lowered into a less efficient branch
13919 // sequence later on.
13920 if (Cond.getOpcode() == ISD::SETCC &&
13921 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
13922 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
13923 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
13924 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
13925 int SSECC = translateX86FSETCC(
13926 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
13929 if (Subtarget->hasAVX512()) {
13930 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
13931 DAG.getConstant(SSECC, MVT::i8));
13932 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
13934 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
13935 DAG.getConstant(SSECC, MVT::i8));
13936 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
13937 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
13938 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
13942 if (Cond.getOpcode() == ISD::SETCC) {
13943 SDValue NewCond = LowerSETCC(Cond, DAG);
13944 if (NewCond.getNode())
13948 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
13949 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
13950 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
13951 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
13952 if (Cond.getOpcode() == X86ISD::SETCC &&
13953 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
13954 isZero(Cond.getOperand(1).getOperand(1))) {
13955 SDValue Cmp = Cond.getOperand(1);
13957 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
13959 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
13960 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
13961 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
13963 SDValue CmpOp0 = Cmp.getOperand(0);
13964 // Apply further optimizations for special cases
13965 // (select (x != 0), -1, 0) -> neg & sbb
13966 // (select (x == 0), 0, -1) -> neg & sbb
13967 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
13968 if (YC->isNullValue() &&
13969 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
13970 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
13971 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
13972 DAG.getConstant(0, CmpOp0.getValueType()),
13974 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13975 DAG.getConstant(X86::COND_B, MVT::i8),
13976 SDValue(Neg.getNode(), 1));
13980 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
13981 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
13982 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
13984 SDValue Res = // Res = 0 or -1.
13985 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
13986 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
13988 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
13989 Res = DAG.getNOT(DL, Res, Res.getValueType());
13991 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
13992 if (!N2C || !N2C->isNullValue())
13993 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
13998 // Look past (and (setcc_carry (cmp ...)), 1).
13999 if (Cond.getOpcode() == ISD::AND &&
14000 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14001 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14002 if (C && C->getAPIntValue() == 1)
14003 Cond = Cond.getOperand(0);
14006 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14007 // setting operand in place of the X86ISD::SETCC.
14008 unsigned CondOpcode = Cond.getOpcode();
14009 if (CondOpcode == X86ISD::SETCC ||
14010 CondOpcode == X86ISD::SETCC_CARRY) {
14011 CC = Cond.getOperand(0);
14013 SDValue Cmp = Cond.getOperand(1);
14014 unsigned Opc = Cmp.getOpcode();
14015 MVT VT = Op.getSimpleValueType();
14017 bool IllegalFPCMov = false;
14018 if (VT.isFloatingPoint() && !VT.isVector() &&
14019 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14020 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14022 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14023 Opc == X86ISD::BT) { // FIXME
14027 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14028 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14029 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14030 Cond.getOperand(0).getValueType() != MVT::i8)) {
14031 SDValue LHS = Cond.getOperand(0);
14032 SDValue RHS = Cond.getOperand(1);
14033 unsigned X86Opcode;
14036 switch (CondOpcode) {
14037 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14038 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14039 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14040 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14041 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14042 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14043 default: llvm_unreachable("unexpected overflowing operator");
14045 if (CondOpcode == ISD::UMULO)
14046 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14049 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14051 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
14053 if (CondOpcode == ISD::UMULO)
14054 Cond = X86Op.getValue(2);
14056 Cond = X86Op.getValue(1);
14058 CC = DAG.getConstant(X86Cond, MVT::i8);
14063 // Look pass the truncate if the high bits are known zero.
14064 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14065 Cond = Cond.getOperand(0);
14067 // We know the result of AND is compared against zero. Try to match
14069 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14070 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
14071 if (NewSetCC.getNode()) {
14072 CC = NewSetCC.getOperand(0);
14073 Cond = NewSetCC.getOperand(1);
14080 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14081 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
14084 // a < b ? -1 : 0 -> RES = ~setcc_carry
14085 // a < b ? 0 : -1 -> RES = setcc_carry
14086 // a >= b ? -1 : 0 -> RES = setcc_carry
14087 // a >= b ? 0 : -1 -> RES = ~setcc_carry
14088 if (Cond.getOpcode() == X86ISD::SUB) {
14089 Cond = ConvertCmpIfNecessary(Cond, DAG);
14090 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
14092 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
14093 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
14094 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14095 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
14096 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
14097 return DAG.getNOT(DL, Res, Res.getValueType());
14102 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
14103 // widen the cmov and push the truncate through. This avoids introducing a new
14104 // branch during isel and doesn't add any extensions.
14105 if (Op.getValueType() == MVT::i8 &&
14106 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
14107 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
14108 if (T1.getValueType() == T2.getValueType() &&
14109 // Blacklist CopyFromReg to avoid partial register stalls.
14110 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
14111 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
14112 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
14113 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
14117 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
14118 // condition is true.
14119 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
14120 SDValue Ops[] = { Op2, Op1, CC, Cond };
14121 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
14124 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
14125 MVT VT = Op->getSimpleValueType(0);
14126 SDValue In = Op->getOperand(0);
14127 MVT InVT = In.getSimpleValueType();
14130 unsigned int NumElts = VT.getVectorNumElements();
14131 if (NumElts != 8 && NumElts != 16)
14134 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
14135 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14137 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14138 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
14140 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
14141 Constant *C = ConstantInt::get(*DAG.getContext(),
14142 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
14144 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
14145 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
14146 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
14147 MachinePointerInfo::getConstantPool(),
14148 false, false, false, Alignment);
14149 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
14150 if (VT.is512BitVector())
14152 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
14155 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
14156 SelectionDAG &DAG) {
14157 MVT VT = Op->getSimpleValueType(0);
14158 SDValue In = Op->getOperand(0);
14159 MVT InVT = In.getSimpleValueType();
14162 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
14163 return LowerSIGN_EXTEND_AVX512(Op, DAG);
14165 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
14166 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
14167 (VT != MVT::v16i16 || InVT != MVT::v16i8))
14170 if (Subtarget->hasInt256())
14171 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
14173 // Optimize vectors in AVX mode
14174 // Sign extend v8i16 to v8i32 and
14177 // Divide input vector into two parts
14178 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
14179 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
14180 // concat the vectors to original VT
14182 unsigned NumElems = InVT.getVectorNumElements();
14183 SDValue Undef = DAG.getUNDEF(InVT);
14185 SmallVector<int,8> ShufMask1(NumElems, -1);
14186 for (unsigned i = 0; i != NumElems/2; ++i)
14189 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
14191 SmallVector<int,8> ShufMask2(NumElems, -1);
14192 for (unsigned i = 0; i != NumElems/2; ++i)
14193 ShufMask2[i] = i + NumElems/2;
14195 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
14197 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
14198 VT.getVectorNumElements()/2);
14200 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
14201 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
14203 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
14206 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
14207 // may emit an illegal shuffle but the expansion is still better than scalar
14208 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
14209 // we'll emit a shuffle and a arithmetic shift.
14210 // TODO: It is possible to support ZExt by zeroing the undef values during
14211 // the shuffle phase or after the shuffle.
14212 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
14213 SelectionDAG &DAG) {
14214 MVT RegVT = Op.getSimpleValueType();
14215 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
14216 assert(RegVT.isInteger() &&
14217 "We only custom lower integer vector sext loads.");
14219 // Nothing useful we can do without SSE2 shuffles.
14220 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
14222 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
14224 EVT MemVT = Ld->getMemoryVT();
14225 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14226 unsigned RegSz = RegVT.getSizeInBits();
14228 ISD::LoadExtType Ext = Ld->getExtensionType();
14230 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
14231 && "Only anyext and sext are currently implemented.");
14232 assert(MemVT != RegVT && "Cannot extend to the same type");
14233 assert(MemVT.isVector() && "Must load a vector from memory");
14235 unsigned NumElems = RegVT.getVectorNumElements();
14236 unsigned MemSz = MemVT.getSizeInBits();
14237 assert(RegSz > MemSz && "Register size must be greater than the mem size");
14239 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
14240 // The only way in which we have a legal 256-bit vector result but not the
14241 // integer 256-bit operations needed to directly lower a sextload is if we
14242 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
14243 // a 128-bit vector and a normal sign_extend to 256-bits that should get
14244 // correctly legalized. We do this late to allow the canonical form of
14245 // sextload to persist throughout the rest of the DAG combiner -- it wants
14246 // to fold together any extensions it can, and so will fuse a sign_extend
14247 // of an sextload into a sextload targeting a wider value.
14249 if (MemSz == 128) {
14250 // Just switch this to a normal load.
14251 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
14252 "it must be a legal 128-bit vector "
14254 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
14255 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
14256 Ld->isInvariant(), Ld->getAlignment());
14258 assert(MemSz < 128 &&
14259 "Can't extend a type wider than 128 bits to a 256 bit vector!");
14260 // Do an sext load to a 128-bit vector type. We want to use the same
14261 // number of elements, but elements half as wide. This will end up being
14262 // recursively lowered by this routine, but will succeed as we definitely
14263 // have all the necessary features if we're using AVX1.
14265 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
14266 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
14268 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
14269 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
14270 Ld->isNonTemporal(), Ld->isInvariant(),
14271 Ld->getAlignment());
14274 // Replace chain users with the new chain.
14275 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
14276 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
14278 // Finally, do a normal sign-extend to the desired register.
14279 return DAG.getSExtOrTrunc(Load, dl, RegVT);
14282 // All sizes must be a power of two.
14283 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
14284 "Non-power-of-two elements are not custom lowered!");
14286 // Attempt to load the original value using scalar loads.
14287 // Find the largest scalar type that divides the total loaded size.
14288 MVT SclrLoadTy = MVT::i8;
14289 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
14290 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
14291 MVT Tp = (MVT::SimpleValueType)tp;
14292 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
14297 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
14298 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
14300 SclrLoadTy = MVT::f64;
14302 // Calculate the number of scalar loads that we need to perform
14303 // in order to load our vector from memory.
14304 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
14306 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
14307 "Can only lower sext loads with a single scalar load!");
14309 unsigned loadRegZize = RegSz;
14310 if (Ext == ISD::SEXTLOAD && RegSz == 256)
14313 // Represent our vector as a sequence of elements which are the
14314 // largest scalar that we can load.
14315 EVT LoadUnitVecVT = EVT::getVectorVT(
14316 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
14318 // Represent the data using the same element type that is stored in
14319 // memory. In practice, we ''widen'' MemVT.
14321 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
14322 loadRegZize / MemVT.getScalarType().getSizeInBits());
14324 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
14325 "Invalid vector type");
14327 // We can't shuffle using an illegal type.
14328 assert(TLI.isTypeLegal(WideVecVT) &&
14329 "We only lower types that form legal widened vector types");
14331 SmallVector<SDValue, 8> Chains;
14332 SDValue Ptr = Ld->getBasePtr();
14333 SDValue Increment =
14334 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
14335 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
14337 for (unsigned i = 0; i < NumLoads; ++i) {
14338 // Perform a single load.
14339 SDValue ScalarLoad =
14340 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
14341 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
14342 Ld->getAlignment());
14343 Chains.push_back(ScalarLoad.getValue(1));
14344 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
14345 // another round of DAGCombining.
14347 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
14349 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
14350 ScalarLoad, DAG.getIntPtrConstant(i));
14352 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
14355 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
14357 // Bitcast the loaded value to a vector of the original element type, in
14358 // the size of the target vector type.
14359 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
14360 unsigned SizeRatio = RegSz / MemSz;
14362 if (Ext == ISD::SEXTLOAD) {
14363 // If we have SSE4.1, we can directly emit a VSEXT node.
14364 if (Subtarget->hasSSE41()) {
14365 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
14366 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14370 // Otherwise we'll shuffle the small elements in the high bits of the
14371 // larger type and perform an arithmetic shift. If the shift is not legal
14372 // it's better to scalarize.
14373 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
14374 "We can't implement a sext load without an arithmetic right shift!");
14376 // Redistribute the loaded elements into the different locations.
14377 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14378 for (unsigned i = 0; i != NumElems; ++i)
14379 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
14381 SDValue Shuff = DAG.getVectorShuffle(
14382 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14384 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14386 // Build the arithmetic shift.
14387 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
14388 MemVT.getVectorElementType().getSizeInBits();
14390 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
14392 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14396 // Redistribute the loaded elements into the different locations.
14397 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
14398 for (unsigned i = 0; i != NumElems; ++i)
14399 ShuffleVec[i * SizeRatio] = i;
14401 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
14402 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
14404 // Bitcast to the requested type.
14405 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
14406 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
14410 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
14411 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
14412 // from the AND / OR.
14413 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
14414 Opc = Op.getOpcode();
14415 if (Opc != ISD::OR && Opc != ISD::AND)
14417 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14418 Op.getOperand(0).hasOneUse() &&
14419 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
14420 Op.getOperand(1).hasOneUse());
14423 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
14424 // 1 and that the SETCC node has a single use.
14425 static bool isXor1OfSetCC(SDValue Op) {
14426 if (Op.getOpcode() != ISD::XOR)
14428 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
14429 if (N1C && N1C->getAPIntValue() == 1) {
14430 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
14431 Op.getOperand(0).hasOneUse();
14436 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
14437 bool addTest = true;
14438 SDValue Chain = Op.getOperand(0);
14439 SDValue Cond = Op.getOperand(1);
14440 SDValue Dest = Op.getOperand(2);
14443 bool Inverted = false;
14445 if (Cond.getOpcode() == ISD::SETCC) {
14446 // Check for setcc([su]{add,sub,mul}o == 0).
14447 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
14448 isa<ConstantSDNode>(Cond.getOperand(1)) &&
14449 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
14450 Cond.getOperand(0).getResNo() == 1 &&
14451 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
14452 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
14453 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
14454 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
14455 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
14456 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
14458 Cond = Cond.getOperand(0);
14460 SDValue NewCond = LowerSETCC(Cond, DAG);
14461 if (NewCond.getNode())
14466 // FIXME: LowerXALUO doesn't handle these!!
14467 else if (Cond.getOpcode() == X86ISD::ADD ||
14468 Cond.getOpcode() == X86ISD::SUB ||
14469 Cond.getOpcode() == X86ISD::SMUL ||
14470 Cond.getOpcode() == X86ISD::UMUL)
14471 Cond = LowerXALUO(Cond, DAG);
14474 // Look pass (and (setcc_carry (cmp ...)), 1).
14475 if (Cond.getOpcode() == ISD::AND &&
14476 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14477 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14478 if (C && C->getAPIntValue() == 1)
14479 Cond = Cond.getOperand(0);
14482 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14483 // setting operand in place of the X86ISD::SETCC.
14484 unsigned CondOpcode = Cond.getOpcode();
14485 if (CondOpcode == X86ISD::SETCC ||
14486 CondOpcode == X86ISD::SETCC_CARRY) {
14487 CC = Cond.getOperand(0);
14489 SDValue Cmp = Cond.getOperand(1);
14490 unsigned Opc = Cmp.getOpcode();
14491 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
14492 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
14496 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
14500 // These can only come from an arithmetic instruction with overflow,
14501 // e.g. SADDO, UADDO.
14502 Cond = Cond.getNode()->getOperand(1);
14508 CondOpcode = Cond.getOpcode();
14509 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14510 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14511 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14512 Cond.getOperand(0).getValueType() != MVT::i8)) {
14513 SDValue LHS = Cond.getOperand(0);
14514 SDValue RHS = Cond.getOperand(1);
14515 unsigned X86Opcode;
14518 // Keep this in sync with LowerXALUO, otherwise we might create redundant
14519 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
14521 switch (CondOpcode) {
14522 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
14524 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14526 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
14529 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
14530 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
14532 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
14534 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
14537 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
14538 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
14539 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
14540 default: llvm_unreachable("unexpected overflowing operator");
14543 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
14544 if (CondOpcode == ISD::UMULO)
14545 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
14548 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
14550 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
14552 if (CondOpcode == ISD::UMULO)
14553 Cond = X86Op.getValue(2);
14555 Cond = X86Op.getValue(1);
14557 CC = DAG.getConstant(X86Cond, MVT::i8);
14561 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
14562 SDValue Cmp = Cond.getOperand(0).getOperand(1);
14563 if (CondOpc == ISD::OR) {
14564 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
14565 // two branches instead of an explicit OR instruction with a
14567 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14568 isX86LogicalCmp(Cmp)) {
14569 CC = Cond.getOperand(0).getOperand(0);
14570 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14571 Chain, Dest, CC, Cmp);
14572 CC = Cond.getOperand(1).getOperand(0);
14576 } else { // ISD::AND
14577 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
14578 // two branches instead of an explicit AND instruction with a
14579 // separate test. However, we only do this if this block doesn't
14580 // have a fall-through edge, because this requires an explicit
14581 // jmp when the condition is false.
14582 if (Cmp == Cond.getOperand(1).getOperand(1) &&
14583 isX86LogicalCmp(Cmp) &&
14584 Op.getNode()->hasOneUse()) {
14585 X86::CondCode CCode =
14586 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14587 CCode = X86::GetOppositeBranchCondition(CCode);
14588 CC = DAG.getConstant(CCode, MVT::i8);
14589 SDNode *User = *Op.getNode()->use_begin();
14590 // Look for an unconditional branch following this conditional branch.
14591 // We need this because we need to reverse the successors in order
14592 // to implement FCMP_OEQ.
14593 if (User->getOpcode() == ISD::BR) {
14594 SDValue FalseBB = User->getOperand(1);
14596 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14597 assert(NewBR == User);
14601 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14602 Chain, Dest, CC, Cmp);
14603 X86::CondCode CCode =
14604 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
14605 CCode = X86::GetOppositeBranchCondition(CCode);
14606 CC = DAG.getConstant(CCode, MVT::i8);
14612 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
14613 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
14614 // It should be transformed during dag combiner except when the condition
14615 // is set by a arithmetics with overflow node.
14616 X86::CondCode CCode =
14617 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
14618 CCode = X86::GetOppositeBranchCondition(CCode);
14619 CC = DAG.getConstant(CCode, MVT::i8);
14620 Cond = Cond.getOperand(0).getOperand(1);
14622 } else if (Cond.getOpcode() == ISD::SETCC &&
14623 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
14624 // For FCMP_OEQ, we can emit
14625 // two branches instead of an explicit AND instruction with a
14626 // separate test. However, we only do this if this block doesn't
14627 // have a fall-through edge, because this requires an explicit
14628 // jmp when the condition is false.
14629 if (Op.getNode()->hasOneUse()) {
14630 SDNode *User = *Op.getNode()->use_begin();
14631 // Look for an unconditional branch following this conditional branch.
14632 // We need this because we need to reverse the successors in order
14633 // to implement FCMP_OEQ.
14634 if (User->getOpcode() == ISD::BR) {
14635 SDValue FalseBB = User->getOperand(1);
14637 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14638 assert(NewBR == User);
14642 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14643 Cond.getOperand(0), Cond.getOperand(1));
14644 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14645 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14646 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14647 Chain, Dest, CC, Cmp);
14648 CC = DAG.getConstant(X86::COND_P, MVT::i8);
14653 } else if (Cond.getOpcode() == ISD::SETCC &&
14654 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
14655 // For FCMP_UNE, we can emit
14656 // two branches instead of an explicit AND instruction with a
14657 // separate test. However, we only do this if this block doesn't
14658 // have a fall-through edge, because this requires an explicit
14659 // jmp when the condition is false.
14660 if (Op.getNode()->hasOneUse()) {
14661 SDNode *User = *Op.getNode()->use_begin();
14662 // Look for an unconditional branch following this conditional branch.
14663 // We need this because we need to reverse the successors in order
14664 // to implement FCMP_UNE.
14665 if (User->getOpcode() == ISD::BR) {
14666 SDValue FalseBB = User->getOperand(1);
14668 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
14669 assert(NewBR == User);
14672 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
14673 Cond.getOperand(0), Cond.getOperand(1));
14674 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14675 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
14676 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14677 Chain, Dest, CC, Cmp);
14678 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
14688 // Look pass the truncate if the high bits are known zero.
14689 if (isTruncWithZeroHighBitsInput(Cond, DAG))
14690 Cond = Cond.getOperand(0);
14692 // We know the result of AND is compared against zero. Try to match
14694 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
14695 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
14696 if (NewSetCC.getNode()) {
14697 CC = NewSetCC.getOperand(0);
14698 Cond = NewSetCC.getOperand(1);
14705 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
14706 CC = DAG.getConstant(X86Cond, MVT::i8);
14707 Cond = EmitTest(Cond, X86Cond, dl, DAG);
14709 Cond = ConvertCmpIfNecessary(Cond, DAG);
14710 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
14711 Chain, Dest, CC, Cond);
14714 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
14715 // Calls to _alloca are needed to probe the stack when allocating more than 4k
14716 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
14717 // that the guard pages used by the OS virtual memory manager are allocated in
14718 // correct sequence.
14720 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
14721 SelectionDAG &DAG) const {
14722 MachineFunction &MF = DAG.getMachineFunction();
14723 bool SplitStack = MF.shouldSplitStack();
14724 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
14729 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14730 SDNode* Node = Op.getNode();
14732 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
14733 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
14734 " not tell us which reg is the stack pointer!");
14735 EVT VT = Node->getValueType(0);
14736 SDValue Tmp1 = SDValue(Node, 0);
14737 SDValue Tmp2 = SDValue(Node, 1);
14738 SDValue Tmp3 = Node->getOperand(2);
14739 SDValue Chain = Tmp1.getOperand(0);
14741 // Chain the dynamic stack allocation so that it doesn't modify the stack
14742 // pointer when other instructions are using the stack.
14743 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
14746 SDValue Size = Tmp2.getOperand(1);
14747 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
14748 Chain = SP.getValue(1);
14749 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
14750 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
14751 unsigned StackAlign = TFI.getStackAlignment();
14752 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
14753 if (Align > StackAlign)
14754 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
14755 DAG.getConstant(-(uint64_t)Align, VT));
14756 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
14758 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
14759 DAG.getIntPtrConstant(0, true), SDValue(),
14762 SDValue Ops[2] = { Tmp1, Tmp2 };
14763 return DAG.getMergeValues(Ops, dl);
14767 SDValue Chain = Op.getOperand(0);
14768 SDValue Size = Op.getOperand(1);
14769 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
14770 EVT VT = Op.getNode()->getValueType(0);
14772 bool Is64Bit = Subtarget->is64Bit();
14773 EVT SPTy = Is64Bit ? MVT::i64 : MVT::i32;
14776 MachineRegisterInfo &MRI = MF.getRegInfo();
14779 // The 64 bit implementation of segmented stacks needs to clobber both r10
14780 // r11. This makes it impossible to use it along with nested parameters.
14781 const Function *F = MF.getFunction();
14783 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
14785 if (I->hasNestAttr())
14786 report_fatal_error("Cannot use segmented stacks with functions that "
14787 "have nested arguments.");
14790 const TargetRegisterClass *AddrRegClass =
14791 getRegClassFor(Subtarget->is64Bit() ? MVT::i64:MVT::i32);
14792 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
14793 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
14794 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
14795 DAG.getRegister(Vreg, SPTy));
14796 SDValue Ops1[2] = { Value, Chain };
14797 return DAG.getMergeValues(Ops1, dl);
14800 unsigned Reg = (Subtarget->is64Bit() ? X86::RAX : X86::EAX);
14802 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
14803 Flag = Chain.getValue(1);
14804 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
14806 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
14808 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
14809 DAG.getSubtarget().getRegisterInfo());
14810 unsigned SPReg = RegInfo->getStackRegister();
14811 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
14812 Chain = SP.getValue(1);
14815 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
14816 DAG.getConstant(-(uint64_t)Align, VT));
14817 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
14820 SDValue Ops1[2] = { SP, Chain };
14821 return DAG.getMergeValues(Ops1, dl);
14825 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
14826 MachineFunction &MF = DAG.getMachineFunction();
14827 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
14829 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14832 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
14833 // vastart just stores the address of the VarArgsFrameIndex slot into the
14834 // memory location argument.
14835 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14837 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
14838 MachinePointerInfo(SV), false, false, 0);
14842 // gp_offset (0 - 6 * 8)
14843 // fp_offset (48 - 48 + 8 * 16)
14844 // overflow_arg_area (point to parameters coming in memory).
14846 SmallVector<SDValue, 8> MemOps;
14847 SDValue FIN = Op.getOperand(1);
14849 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
14850 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
14852 FIN, MachinePointerInfo(SV), false, false, 0);
14853 MemOps.push_back(Store);
14856 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14857 FIN, DAG.getIntPtrConstant(4));
14858 Store = DAG.getStore(Op.getOperand(0), DL,
14859 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
14861 FIN, MachinePointerInfo(SV, 4), false, false, 0);
14862 MemOps.push_back(Store);
14864 // Store ptr to overflow_arg_area
14865 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14866 FIN, DAG.getIntPtrConstant(4));
14867 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
14869 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
14870 MachinePointerInfo(SV, 8),
14872 MemOps.push_back(Store);
14874 // Store ptr to reg_save_area.
14875 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
14876 FIN, DAG.getIntPtrConstant(8));
14877 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
14879 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
14880 MachinePointerInfo(SV, 16), false, false, 0);
14881 MemOps.push_back(Store);
14882 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
14885 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
14886 assert(Subtarget->is64Bit() &&
14887 "LowerVAARG only handles 64-bit va_arg!");
14888 assert((Subtarget->isTargetLinux() ||
14889 Subtarget->isTargetDarwin()) &&
14890 "Unhandled target in LowerVAARG");
14891 assert(Op.getNode()->getNumOperands() == 4);
14892 SDValue Chain = Op.getOperand(0);
14893 SDValue SrcPtr = Op.getOperand(1);
14894 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
14895 unsigned Align = Op.getConstantOperandVal(3);
14898 EVT ArgVT = Op.getNode()->getValueType(0);
14899 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
14900 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
14903 // Decide which area this value should be read from.
14904 // TODO: Implement the AMD64 ABI in its entirety. This simple
14905 // selection mechanism works only for the basic types.
14906 if (ArgVT == MVT::f80) {
14907 llvm_unreachable("va_arg for f80 not yet implemented");
14908 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
14909 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
14910 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
14911 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
14913 llvm_unreachable("Unhandled argument type in LowerVAARG");
14916 if (ArgMode == 2) {
14917 // Sanity Check: Make sure using fp_offset makes sense.
14918 assert(!DAG.getTarget().Options.UseSoftFloat &&
14919 !(DAG.getMachineFunction()
14920 .getFunction()->getAttributes()
14921 .hasAttribute(AttributeSet::FunctionIndex,
14922 Attribute::NoImplicitFloat)) &&
14923 Subtarget->hasSSE1());
14926 // Insert VAARG_64 node into the DAG
14927 // VAARG_64 returns two values: Variable Argument Address, Chain
14928 SmallVector<SDValue, 11> InstOps;
14929 InstOps.push_back(Chain);
14930 InstOps.push_back(SrcPtr);
14931 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
14932 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
14933 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
14934 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
14935 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
14936 VTs, InstOps, MVT::i64,
14937 MachinePointerInfo(SV),
14939 /*Volatile=*/false,
14941 /*WriteMem=*/true);
14942 Chain = VAARG.getValue(1);
14944 // Load the next argument and return it
14945 return DAG.getLoad(ArgVT, dl,
14948 MachinePointerInfo(),
14949 false, false, false, 0);
14952 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
14953 SelectionDAG &DAG) {
14954 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
14955 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
14956 SDValue Chain = Op.getOperand(0);
14957 SDValue DstPtr = Op.getOperand(1);
14958 SDValue SrcPtr = Op.getOperand(2);
14959 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
14960 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
14963 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
14964 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
14966 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
14969 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
14970 // amount is a constant. Takes immediate version of shift as input.
14971 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
14972 SDValue SrcOp, uint64_t ShiftAmt,
14973 SelectionDAG &DAG) {
14974 MVT ElementType = VT.getVectorElementType();
14976 // Fold this packed shift into its first operand if ShiftAmt is 0.
14980 // Check for ShiftAmt >= element width
14981 if (ShiftAmt >= ElementType.getSizeInBits()) {
14982 if (Opc == X86ISD::VSRAI)
14983 ShiftAmt = ElementType.getSizeInBits() - 1;
14985 return DAG.getConstant(0, VT);
14988 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
14989 && "Unknown target vector shift-by-constant node");
14991 // Fold this packed vector shift into a build vector if SrcOp is a
14992 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
14993 if (VT == SrcOp.getSimpleValueType() &&
14994 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
14995 SmallVector<SDValue, 8> Elts;
14996 unsigned NumElts = SrcOp->getNumOperands();
14997 ConstantSDNode *ND;
15000 default: llvm_unreachable(nullptr);
15001 case X86ISD::VSHLI:
15002 for (unsigned i=0; i!=NumElts; ++i) {
15003 SDValue CurrentOp = SrcOp->getOperand(i);
15004 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15005 Elts.push_back(CurrentOp);
15008 ND = cast<ConstantSDNode>(CurrentOp);
15009 const APInt &C = ND->getAPIntValue();
15010 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15013 case X86ISD::VSRLI:
15014 for (unsigned i=0; i!=NumElts; ++i) {
15015 SDValue CurrentOp = SrcOp->getOperand(i);
15016 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15017 Elts.push_back(CurrentOp);
15020 ND = cast<ConstantSDNode>(CurrentOp);
15021 const APInt &C = ND->getAPIntValue();
15022 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15025 case X86ISD::VSRAI:
15026 for (unsigned i=0; i!=NumElts; ++i) {
15027 SDValue CurrentOp = SrcOp->getOperand(i);
15028 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15029 Elts.push_back(CurrentOp);
15032 ND = cast<ConstantSDNode>(CurrentOp);
15033 const APInt &C = ND->getAPIntValue();
15034 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
15039 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
15042 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
15045 // getTargetVShiftNode - Handle vector element shifts where the shift amount
15046 // may or may not be a constant. Takes immediate version of shift as input.
15047 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
15048 SDValue SrcOp, SDValue ShAmt,
15049 SelectionDAG &DAG) {
15050 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
15052 // Catch shift-by-constant.
15053 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
15054 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
15055 CShAmt->getZExtValue(), DAG);
15057 // Change opcode to non-immediate version
15059 default: llvm_unreachable("Unknown target vector shift node");
15060 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
15061 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
15062 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
15065 // Need to build a vector containing shift amount
15066 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
15069 ShOps[1] = DAG.getConstant(0, MVT::i32);
15070 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
15071 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
15073 // The return type has to be a 128-bit type with the same element
15074 // type as the input type.
15075 MVT EltVT = VT.getVectorElementType();
15076 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
15078 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
15079 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
15082 /// \brief Return (vselect \p Mask, \p Op, \p PreservedSrc) along with the
15083 /// necessary casting for \p Mask when lowering masking intrinsics.
15084 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
15085 SDValue PreservedSrc, SelectionDAG &DAG) {
15086 EVT VT = Op.getValueType();
15087 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
15088 MVT::i1, VT.getVectorNumElements());
15091 assert(MaskVT.isSimple() && "invalid mask type");
15092 return DAG.getNode(ISD::VSELECT, dl, VT,
15093 DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask),
15097 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
15099 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15100 case Intrinsic::x86_fma_vfmadd_ps:
15101 case Intrinsic::x86_fma_vfmadd_pd:
15102 case Intrinsic::x86_fma_vfmadd_ps_256:
15103 case Intrinsic::x86_fma_vfmadd_pd_256:
15104 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15105 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15106 return X86ISD::FMADD;
15107 case Intrinsic::x86_fma_vfmsub_ps:
15108 case Intrinsic::x86_fma_vfmsub_pd:
15109 case Intrinsic::x86_fma_vfmsub_ps_256:
15110 case Intrinsic::x86_fma_vfmsub_pd_256:
15111 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15112 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15113 return X86ISD::FMSUB;
15114 case Intrinsic::x86_fma_vfnmadd_ps:
15115 case Intrinsic::x86_fma_vfnmadd_pd:
15116 case Intrinsic::x86_fma_vfnmadd_ps_256:
15117 case Intrinsic::x86_fma_vfnmadd_pd_256:
15118 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15119 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15120 return X86ISD::FNMADD;
15121 case Intrinsic::x86_fma_vfnmsub_ps:
15122 case Intrinsic::x86_fma_vfnmsub_pd:
15123 case Intrinsic::x86_fma_vfnmsub_ps_256:
15124 case Intrinsic::x86_fma_vfnmsub_pd_256:
15125 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15126 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15127 return X86ISD::FNMSUB;
15128 case Intrinsic::x86_fma_vfmaddsub_ps:
15129 case Intrinsic::x86_fma_vfmaddsub_pd:
15130 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15131 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15132 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15133 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15134 return X86ISD::FMADDSUB;
15135 case Intrinsic::x86_fma_vfmsubadd_ps:
15136 case Intrinsic::x86_fma_vfmsubadd_pd:
15137 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15138 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15139 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15140 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
15141 return X86ISD::FMSUBADD;
15145 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
15147 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15149 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
15151 switch(IntrData->Type) {
15152 case INTR_TYPE_1OP:
15153 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
15154 case INTR_TYPE_2OP:
15155 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15157 case INTR_TYPE_3OP:
15158 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
15159 Op.getOperand(2), Op.getOperand(3));
15160 case COMI: { // Comparison intrinsics
15161 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
15162 SDValue LHS = Op.getOperand(1);
15163 SDValue RHS = Op.getOperand(2);
15164 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
15165 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
15166 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
15167 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15168 DAG.getConstant(X86CC, MVT::i8), Cond);
15169 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15172 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
15173 Op.getOperand(1), Op.getOperand(2), DAG);
15180 default: return SDValue(); // Don't custom lower most intrinsics.
15182 // Arithmetic intrinsics.
15183 case Intrinsic::x86_sse2_pmulu_dq:
15184 case Intrinsic::x86_avx2_pmulu_dq:
15185 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
15186 Op.getOperand(1), Op.getOperand(2));
15188 case Intrinsic::x86_sse41_pmuldq:
15189 case Intrinsic::x86_avx2_pmul_dq:
15190 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
15191 Op.getOperand(1), Op.getOperand(2));
15193 case Intrinsic::x86_sse2_pmulhu_w:
15194 case Intrinsic::x86_avx2_pmulhu_w:
15195 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
15196 Op.getOperand(1), Op.getOperand(2));
15198 case Intrinsic::x86_sse2_pmulh_w:
15199 case Intrinsic::x86_avx2_pmulh_w:
15200 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
15201 Op.getOperand(1), Op.getOperand(2));
15203 // SSE/SSE2/AVX floating point max/min intrinsics.
15204 case Intrinsic::x86_sse_max_ps:
15205 case Intrinsic::x86_sse2_max_pd:
15206 case Intrinsic::x86_avx_max_ps_256:
15207 case Intrinsic::x86_avx_max_pd_256:
15208 case Intrinsic::x86_sse_min_ps:
15209 case Intrinsic::x86_sse2_min_pd:
15210 case Intrinsic::x86_avx_min_ps_256:
15211 case Intrinsic::x86_avx_min_pd_256: {
15214 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15215 case Intrinsic::x86_sse_max_ps:
15216 case Intrinsic::x86_sse2_max_pd:
15217 case Intrinsic::x86_avx_max_ps_256:
15218 case Intrinsic::x86_avx_max_pd_256:
15219 Opcode = X86ISD::FMAX;
15221 case Intrinsic::x86_sse_min_ps:
15222 case Intrinsic::x86_sse2_min_pd:
15223 case Intrinsic::x86_avx_min_ps_256:
15224 case Intrinsic::x86_avx_min_pd_256:
15225 Opcode = X86ISD::FMIN;
15228 return DAG.getNode(Opcode, dl, Op.getValueType(),
15229 Op.getOperand(1), Op.getOperand(2));
15232 // AVX2 variable shift intrinsics
15233 case Intrinsic::x86_avx2_psllv_d:
15234 case Intrinsic::x86_avx2_psllv_q:
15235 case Intrinsic::x86_avx2_psllv_d_256:
15236 case Intrinsic::x86_avx2_psllv_q_256:
15237 case Intrinsic::x86_avx2_psrlv_d:
15238 case Intrinsic::x86_avx2_psrlv_q:
15239 case Intrinsic::x86_avx2_psrlv_d_256:
15240 case Intrinsic::x86_avx2_psrlv_q_256:
15241 case Intrinsic::x86_avx2_psrav_d:
15242 case Intrinsic::x86_avx2_psrav_d_256: {
15245 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15246 case Intrinsic::x86_avx2_psllv_d:
15247 case Intrinsic::x86_avx2_psllv_q:
15248 case Intrinsic::x86_avx2_psllv_d_256:
15249 case Intrinsic::x86_avx2_psllv_q_256:
15252 case Intrinsic::x86_avx2_psrlv_d:
15253 case Intrinsic::x86_avx2_psrlv_q:
15254 case Intrinsic::x86_avx2_psrlv_d_256:
15255 case Intrinsic::x86_avx2_psrlv_q_256:
15258 case Intrinsic::x86_avx2_psrav_d:
15259 case Intrinsic::x86_avx2_psrav_d_256:
15263 return DAG.getNode(Opcode, dl, Op.getValueType(),
15264 Op.getOperand(1), Op.getOperand(2));
15267 case Intrinsic::x86_sse2_packssdw_128:
15268 case Intrinsic::x86_sse2_packsswb_128:
15269 case Intrinsic::x86_avx2_packssdw:
15270 case Intrinsic::x86_avx2_packsswb:
15271 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
15272 Op.getOperand(1), Op.getOperand(2));
15274 case Intrinsic::x86_sse2_packuswb_128:
15275 case Intrinsic::x86_sse41_packusdw:
15276 case Intrinsic::x86_avx2_packuswb:
15277 case Intrinsic::x86_avx2_packusdw:
15278 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
15279 Op.getOperand(1), Op.getOperand(2));
15281 case Intrinsic::x86_ssse3_pshuf_b_128:
15282 case Intrinsic::x86_avx2_pshuf_b:
15283 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
15284 Op.getOperand(1), Op.getOperand(2));
15286 case Intrinsic::x86_sse2_pshuf_d:
15287 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
15288 Op.getOperand(1), Op.getOperand(2));
15290 case Intrinsic::x86_sse2_pshufl_w:
15291 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
15292 Op.getOperand(1), Op.getOperand(2));
15294 case Intrinsic::x86_sse2_pshufh_w:
15295 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
15296 Op.getOperand(1), Op.getOperand(2));
15298 case Intrinsic::x86_ssse3_psign_b_128:
15299 case Intrinsic::x86_ssse3_psign_w_128:
15300 case Intrinsic::x86_ssse3_psign_d_128:
15301 case Intrinsic::x86_avx2_psign_b:
15302 case Intrinsic::x86_avx2_psign_w:
15303 case Intrinsic::x86_avx2_psign_d:
15304 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
15305 Op.getOperand(1), Op.getOperand(2));
15307 case Intrinsic::x86_avx2_permd:
15308 case Intrinsic::x86_avx2_permps:
15309 // Operands intentionally swapped. Mask is last operand to intrinsic,
15310 // but second operand for node/instruction.
15311 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
15312 Op.getOperand(2), Op.getOperand(1));
15314 case Intrinsic::x86_avx512_mask_valign_q_512:
15315 case Intrinsic::x86_avx512_mask_valign_d_512:
15316 // Vector source operands are swapped.
15317 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
15318 Op.getValueType(), Op.getOperand(2),
15321 Op.getOperand(5), Op.getOperand(4), DAG);
15323 // ptest and testp intrinsics. The intrinsic these come from are designed to
15324 // return an integer value, not just an instruction so lower it to the ptest
15325 // or testp pattern and a setcc for the result.
15326 case Intrinsic::x86_sse41_ptestz:
15327 case Intrinsic::x86_sse41_ptestc:
15328 case Intrinsic::x86_sse41_ptestnzc:
15329 case Intrinsic::x86_avx_ptestz_256:
15330 case Intrinsic::x86_avx_ptestc_256:
15331 case Intrinsic::x86_avx_ptestnzc_256:
15332 case Intrinsic::x86_avx_vtestz_ps:
15333 case Intrinsic::x86_avx_vtestc_ps:
15334 case Intrinsic::x86_avx_vtestnzc_ps:
15335 case Intrinsic::x86_avx_vtestz_pd:
15336 case Intrinsic::x86_avx_vtestc_pd:
15337 case Intrinsic::x86_avx_vtestnzc_pd:
15338 case Intrinsic::x86_avx_vtestz_ps_256:
15339 case Intrinsic::x86_avx_vtestc_ps_256:
15340 case Intrinsic::x86_avx_vtestnzc_ps_256:
15341 case Intrinsic::x86_avx_vtestz_pd_256:
15342 case Intrinsic::x86_avx_vtestc_pd_256:
15343 case Intrinsic::x86_avx_vtestnzc_pd_256: {
15344 bool IsTestPacked = false;
15347 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
15348 case Intrinsic::x86_avx_vtestz_ps:
15349 case Intrinsic::x86_avx_vtestz_pd:
15350 case Intrinsic::x86_avx_vtestz_ps_256:
15351 case Intrinsic::x86_avx_vtestz_pd_256:
15352 IsTestPacked = true; // Fallthrough
15353 case Intrinsic::x86_sse41_ptestz:
15354 case Intrinsic::x86_avx_ptestz_256:
15356 X86CC = X86::COND_E;
15358 case Intrinsic::x86_avx_vtestc_ps:
15359 case Intrinsic::x86_avx_vtestc_pd:
15360 case Intrinsic::x86_avx_vtestc_ps_256:
15361 case Intrinsic::x86_avx_vtestc_pd_256:
15362 IsTestPacked = true; // Fallthrough
15363 case Intrinsic::x86_sse41_ptestc:
15364 case Intrinsic::x86_avx_ptestc_256:
15366 X86CC = X86::COND_B;
15368 case Intrinsic::x86_avx_vtestnzc_ps:
15369 case Intrinsic::x86_avx_vtestnzc_pd:
15370 case Intrinsic::x86_avx_vtestnzc_ps_256:
15371 case Intrinsic::x86_avx_vtestnzc_pd_256:
15372 IsTestPacked = true; // Fallthrough
15373 case Intrinsic::x86_sse41_ptestnzc:
15374 case Intrinsic::x86_avx_ptestnzc_256:
15376 X86CC = X86::COND_A;
15380 SDValue LHS = Op.getOperand(1);
15381 SDValue RHS = Op.getOperand(2);
15382 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
15383 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
15384 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15385 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
15386 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15388 case Intrinsic::x86_avx512_kortestz_w:
15389 case Intrinsic::x86_avx512_kortestc_w: {
15390 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
15391 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
15392 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
15393 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
15394 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
15395 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
15396 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15399 case Intrinsic::x86_sse42_pcmpistria128:
15400 case Intrinsic::x86_sse42_pcmpestria128:
15401 case Intrinsic::x86_sse42_pcmpistric128:
15402 case Intrinsic::x86_sse42_pcmpestric128:
15403 case Intrinsic::x86_sse42_pcmpistrio128:
15404 case Intrinsic::x86_sse42_pcmpestrio128:
15405 case Intrinsic::x86_sse42_pcmpistris128:
15406 case Intrinsic::x86_sse42_pcmpestris128:
15407 case Intrinsic::x86_sse42_pcmpistriz128:
15408 case Intrinsic::x86_sse42_pcmpestriz128: {
15412 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
15413 case Intrinsic::x86_sse42_pcmpistria128:
15414 Opcode = X86ISD::PCMPISTRI;
15415 X86CC = X86::COND_A;
15417 case Intrinsic::x86_sse42_pcmpestria128:
15418 Opcode = X86ISD::PCMPESTRI;
15419 X86CC = X86::COND_A;
15421 case Intrinsic::x86_sse42_pcmpistric128:
15422 Opcode = X86ISD::PCMPISTRI;
15423 X86CC = X86::COND_B;
15425 case Intrinsic::x86_sse42_pcmpestric128:
15426 Opcode = X86ISD::PCMPESTRI;
15427 X86CC = X86::COND_B;
15429 case Intrinsic::x86_sse42_pcmpistrio128:
15430 Opcode = X86ISD::PCMPISTRI;
15431 X86CC = X86::COND_O;
15433 case Intrinsic::x86_sse42_pcmpestrio128:
15434 Opcode = X86ISD::PCMPESTRI;
15435 X86CC = X86::COND_O;
15437 case Intrinsic::x86_sse42_pcmpistris128:
15438 Opcode = X86ISD::PCMPISTRI;
15439 X86CC = X86::COND_S;
15441 case Intrinsic::x86_sse42_pcmpestris128:
15442 Opcode = X86ISD::PCMPESTRI;
15443 X86CC = X86::COND_S;
15445 case Intrinsic::x86_sse42_pcmpistriz128:
15446 Opcode = X86ISD::PCMPISTRI;
15447 X86CC = X86::COND_E;
15449 case Intrinsic::x86_sse42_pcmpestriz128:
15450 Opcode = X86ISD::PCMPESTRI;
15451 X86CC = X86::COND_E;
15454 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15455 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15456 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
15457 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15458 DAG.getConstant(X86CC, MVT::i8),
15459 SDValue(PCMP.getNode(), 1));
15460 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
15463 case Intrinsic::x86_sse42_pcmpistri128:
15464 case Intrinsic::x86_sse42_pcmpestri128: {
15466 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
15467 Opcode = X86ISD::PCMPISTRI;
15469 Opcode = X86ISD::PCMPESTRI;
15471 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
15472 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
15473 return DAG.getNode(Opcode, dl, VTs, NewOps);
15476 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
15477 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
15478 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
15479 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
15480 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
15481 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
15482 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
15483 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
15484 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
15485 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
15486 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
15487 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
15488 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
15489 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
15490 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
15491 dl, Op.getValueType(),
15495 Op.getOperand(4), Op.getOperand(1), DAG);
15500 case Intrinsic::x86_fma_vfmadd_ps:
15501 case Intrinsic::x86_fma_vfmadd_pd:
15502 case Intrinsic::x86_fma_vfmsub_ps:
15503 case Intrinsic::x86_fma_vfmsub_pd:
15504 case Intrinsic::x86_fma_vfnmadd_ps:
15505 case Intrinsic::x86_fma_vfnmadd_pd:
15506 case Intrinsic::x86_fma_vfnmsub_ps:
15507 case Intrinsic::x86_fma_vfnmsub_pd:
15508 case Intrinsic::x86_fma_vfmaddsub_ps:
15509 case Intrinsic::x86_fma_vfmaddsub_pd:
15510 case Intrinsic::x86_fma_vfmsubadd_ps:
15511 case Intrinsic::x86_fma_vfmsubadd_pd:
15512 case Intrinsic::x86_fma_vfmadd_ps_256:
15513 case Intrinsic::x86_fma_vfmadd_pd_256:
15514 case Intrinsic::x86_fma_vfmsub_ps_256:
15515 case Intrinsic::x86_fma_vfmsub_pd_256:
15516 case Intrinsic::x86_fma_vfnmadd_ps_256:
15517 case Intrinsic::x86_fma_vfnmadd_pd_256:
15518 case Intrinsic::x86_fma_vfnmsub_ps_256:
15519 case Intrinsic::x86_fma_vfnmsub_pd_256:
15520 case Intrinsic::x86_fma_vfmaddsub_ps_256:
15521 case Intrinsic::x86_fma_vfmaddsub_pd_256:
15522 case Intrinsic::x86_fma_vfmsubadd_ps_256:
15523 case Intrinsic::x86_fma_vfmsubadd_pd_256:
15524 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
15525 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
15529 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15530 SDValue Src, SDValue Mask, SDValue Base,
15531 SDValue Index, SDValue ScaleOp, SDValue Chain,
15532 const X86Subtarget * Subtarget) {
15534 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15535 assert(C && "Invalid scale type");
15536 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15537 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15538 Index.getSimpleValueType().getVectorNumElements());
15540 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15542 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15544 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15545 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
15546 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15547 SDValue Segment = DAG.getRegister(0, MVT::i32);
15548 if (Src.getOpcode() == ISD::UNDEF)
15549 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
15550 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15551 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15552 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
15553 return DAG.getMergeValues(RetOps, dl);
15556 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15557 SDValue Src, SDValue Mask, SDValue Base,
15558 SDValue Index, SDValue ScaleOp, SDValue Chain) {
15560 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15561 assert(C && "Invalid scale type");
15562 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15563 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15564 SDValue Segment = DAG.getRegister(0, MVT::i32);
15565 EVT MaskVT = MVT::getVectorVT(MVT::i1,
15566 Index.getSimpleValueType().getVectorNumElements());
15568 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15570 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15572 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15573 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
15574 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
15575 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
15576 return SDValue(Res, 1);
15579 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
15580 SDValue Mask, SDValue Base, SDValue Index,
15581 SDValue ScaleOp, SDValue Chain) {
15583 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
15584 assert(C && "Invalid scale type");
15585 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
15586 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
15587 SDValue Segment = DAG.getRegister(0, MVT::i32);
15589 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
15591 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
15593 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
15595 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
15596 //SDVTList VTs = DAG.getVTList(MVT::Other);
15597 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
15598 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
15599 return SDValue(Res, 0);
15602 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
15603 // read performance monitor counters (x86_rdpmc).
15604 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
15605 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15606 SmallVectorImpl<SDValue> &Results) {
15607 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15608 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15611 // The ECX register is used to select the index of the performance counter
15613 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
15615 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
15617 // Reads the content of a 64-bit performance counter and returns it in the
15618 // registers EDX:EAX.
15619 if (Subtarget->is64Bit()) {
15620 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15621 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15624 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15625 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15628 Chain = HI.getValue(1);
15630 if (Subtarget->is64Bit()) {
15631 // The EAX register is loaded with the low-order 32 bits. The EDX register
15632 // is loaded with the supported high-order bits of the counter.
15633 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15634 DAG.getConstant(32, MVT::i8));
15635 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15636 Results.push_back(Chain);
15640 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15641 SDValue Ops[] = { LO, HI };
15642 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15643 Results.push_back(Pair);
15644 Results.push_back(Chain);
15647 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
15648 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
15649 // also used to custom lower READCYCLECOUNTER nodes.
15650 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
15651 SelectionDAG &DAG, const X86Subtarget *Subtarget,
15652 SmallVectorImpl<SDValue> &Results) {
15653 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
15654 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
15657 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
15658 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
15659 // and the EAX register is loaded with the low-order 32 bits.
15660 if (Subtarget->is64Bit()) {
15661 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
15662 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
15665 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
15666 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
15669 SDValue Chain = HI.getValue(1);
15671 if (Opcode == X86ISD::RDTSCP_DAG) {
15672 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
15674 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
15675 // the ECX register. Add 'ecx' explicitly to the chain.
15676 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
15678 // Explicitly store the content of ECX at the location passed in input
15679 // to the 'rdtscp' intrinsic.
15680 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
15681 MachinePointerInfo(), false, false, 0);
15684 if (Subtarget->is64Bit()) {
15685 // The EDX register is loaded with the high-order 32 bits of the MSR, and
15686 // the EAX register is loaded with the low-order 32 bits.
15687 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
15688 DAG.getConstant(32, MVT::i8));
15689 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
15690 Results.push_back(Chain);
15694 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
15695 SDValue Ops[] = { LO, HI };
15696 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
15697 Results.push_back(Pair);
15698 Results.push_back(Chain);
15701 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
15702 SelectionDAG &DAG) {
15703 SmallVector<SDValue, 2> Results;
15705 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
15707 return DAG.getMergeValues(Results, DL);
15711 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
15712 SelectionDAG &DAG) {
15713 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
15715 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
15720 switch(IntrData->Type) {
15722 llvm_unreachable("Unknown Intrinsic Type");
15726 // Emit the node with the right value type.
15727 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
15728 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15730 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
15731 // Otherwise return the value from Rand, which is always 0, casted to i32.
15732 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
15733 DAG.getConstant(1, Op->getValueType(1)),
15734 DAG.getConstant(X86::COND_B, MVT::i32),
15735 SDValue(Result.getNode(), 1) };
15736 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
15737 DAG.getVTList(Op->getValueType(1), MVT::Glue),
15740 // Return { result, isValid, chain }.
15741 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
15742 SDValue(Result.getNode(), 2));
15745 //gather(v1, mask, index, base, scale);
15746 SDValue Chain = Op.getOperand(0);
15747 SDValue Src = Op.getOperand(2);
15748 SDValue Base = Op.getOperand(3);
15749 SDValue Index = Op.getOperand(4);
15750 SDValue Mask = Op.getOperand(5);
15751 SDValue Scale = Op.getOperand(6);
15752 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
15756 //scatter(base, mask, index, v1, scale);
15757 SDValue Chain = Op.getOperand(0);
15758 SDValue Base = Op.getOperand(2);
15759 SDValue Mask = Op.getOperand(3);
15760 SDValue Index = Op.getOperand(4);
15761 SDValue Src = Op.getOperand(5);
15762 SDValue Scale = Op.getOperand(6);
15763 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
15766 SDValue Hint = Op.getOperand(6);
15768 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
15769 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
15770 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
15771 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
15772 SDValue Chain = Op.getOperand(0);
15773 SDValue Mask = Op.getOperand(2);
15774 SDValue Index = Op.getOperand(3);
15775 SDValue Base = Op.getOperand(4);
15776 SDValue Scale = Op.getOperand(5);
15777 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
15779 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
15781 SmallVector<SDValue, 2> Results;
15782 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
15783 return DAG.getMergeValues(Results, dl);
15785 // Read Performance Monitoring Counters.
15787 SmallVector<SDValue, 2> Results;
15788 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
15789 return DAG.getMergeValues(Results, dl);
15791 // XTEST intrinsics.
15793 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15794 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
15795 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15796 DAG.getConstant(X86::COND_NE, MVT::i8),
15798 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
15799 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
15800 Ret, SDValue(InTrans.getNode(), 1));
15804 SmallVector<SDValue, 2> Results;
15805 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
15806 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
15807 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
15808 DAG.getConstant(-1, MVT::i8));
15809 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
15810 Op.getOperand(4), GenCF.getValue(1));
15811 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
15812 Op.getOperand(5), MachinePointerInfo(),
15814 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
15815 DAG.getConstant(X86::COND_B, MVT::i8),
15817 Results.push_back(SetCC);
15818 Results.push_back(Store);
15819 return DAG.getMergeValues(Results, dl);
15824 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
15825 SelectionDAG &DAG) const {
15826 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15827 MFI->setReturnAddressIsTaken(true);
15829 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
15832 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15834 EVT PtrVT = getPointerTy();
15837 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
15838 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15839 DAG.getSubtarget().getRegisterInfo());
15840 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
15841 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15842 DAG.getNode(ISD::ADD, dl, PtrVT,
15843 FrameAddr, Offset),
15844 MachinePointerInfo(), false, false, false, 0);
15847 // Just load the return address.
15848 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
15849 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
15850 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
15853 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
15854 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
15855 MFI->setFrameAddressIsTaken(true);
15857 EVT VT = Op.getValueType();
15858 SDLoc dl(Op); // FIXME probably not meaningful
15859 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
15860 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15861 DAG.getSubtarget().getRegisterInfo());
15862 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15863 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
15864 (FrameReg == X86::EBP && VT == MVT::i32)) &&
15865 "Invalid Frame Register!");
15866 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
15868 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
15869 MachinePointerInfo(),
15870 false, false, false, 0);
15874 // FIXME? Maybe this could be a TableGen attribute on some registers and
15875 // this table could be generated automatically from RegInfo.
15876 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
15878 unsigned Reg = StringSwitch<unsigned>(RegName)
15879 .Case("esp", X86::ESP)
15880 .Case("rsp", X86::RSP)
15884 report_fatal_error("Invalid register name global variable");
15887 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
15888 SelectionDAG &DAG) const {
15889 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15890 DAG.getSubtarget().getRegisterInfo());
15891 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
15894 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
15895 SDValue Chain = Op.getOperand(0);
15896 SDValue Offset = Op.getOperand(1);
15897 SDValue Handler = Op.getOperand(2);
15900 EVT PtrVT = getPointerTy();
15901 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15902 DAG.getSubtarget().getRegisterInfo());
15903 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
15904 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
15905 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
15906 "Invalid Frame Register!");
15907 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
15908 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
15910 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
15911 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
15912 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
15913 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
15915 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
15917 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
15918 DAG.getRegister(StoreAddrReg, PtrVT));
15921 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
15922 SelectionDAG &DAG) const {
15924 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
15925 DAG.getVTList(MVT::i32, MVT::Other),
15926 Op.getOperand(0), Op.getOperand(1));
15929 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
15930 SelectionDAG &DAG) const {
15932 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
15933 Op.getOperand(0), Op.getOperand(1));
15936 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
15937 return Op.getOperand(0);
15940 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
15941 SelectionDAG &DAG) const {
15942 SDValue Root = Op.getOperand(0);
15943 SDValue Trmp = Op.getOperand(1); // trampoline
15944 SDValue FPtr = Op.getOperand(2); // nested function
15945 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
15948 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15949 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
15951 if (Subtarget->is64Bit()) {
15952 SDValue OutChains[6];
15954 // Large code-model.
15955 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
15956 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
15958 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
15959 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
15961 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
15963 // Load the pointer to the nested function into R11.
15964 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
15965 SDValue Addr = Trmp;
15966 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15967 Addr, MachinePointerInfo(TrmpAddr),
15970 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15971 DAG.getConstant(2, MVT::i64));
15972 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
15973 MachinePointerInfo(TrmpAddr, 2),
15976 // Load the 'nest' parameter value into R10.
15977 // R10 is specified in X86CallingConv.td
15978 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
15979 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15980 DAG.getConstant(10, MVT::i64));
15981 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15982 Addr, MachinePointerInfo(TrmpAddr, 10),
15985 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15986 DAG.getConstant(12, MVT::i64));
15987 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
15988 MachinePointerInfo(TrmpAddr, 12),
15991 // Jump to the nested function.
15992 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
15993 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
15994 DAG.getConstant(20, MVT::i64));
15995 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
15996 Addr, MachinePointerInfo(TrmpAddr, 20),
15999 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
16000 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16001 DAG.getConstant(22, MVT::i64));
16002 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
16003 MachinePointerInfo(TrmpAddr, 22),
16006 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16008 const Function *Func =
16009 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
16010 CallingConv::ID CC = Func->getCallingConv();
16015 llvm_unreachable("Unsupported calling convention");
16016 case CallingConv::C:
16017 case CallingConv::X86_StdCall: {
16018 // Pass 'nest' parameter in ECX.
16019 // Must be kept in sync with X86CallingConv.td
16020 NestReg = X86::ECX;
16022 // Check that ECX wasn't needed by an 'inreg' parameter.
16023 FunctionType *FTy = Func->getFunctionType();
16024 const AttributeSet &Attrs = Func->getAttributes();
16026 if (!Attrs.isEmpty() && !Func->isVarArg()) {
16027 unsigned InRegCount = 0;
16030 for (FunctionType::param_iterator I = FTy->param_begin(),
16031 E = FTy->param_end(); I != E; ++I, ++Idx)
16032 if (Attrs.hasAttribute(Idx, Attribute::InReg))
16033 // FIXME: should only count parameters that are lowered to integers.
16034 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
16036 if (InRegCount > 2) {
16037 report_fatal_error("Nest register in use - reduce number of inreg"
16043 case CallingConv::X86_FastCall:
16044 case CallingConv::X86_ThisCall:
16045 case CallingConv::Fast:
16046 // Pass 'nest' parameter in EAX.
16047 // Must be kept in sync with X86CallingConv.td
16048 NestReg = X86::EAX;
16052 SDValue OutChains[4];
16053 SDValue Addr, Disp;
16055 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16056 DAG.getConstant(10, MVT::i32));
16057 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
16059 // This is storing the opcode for MOV32ri.
16060 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
16061 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
16062 OutChains[0] = DAG.getStore(Root, dl,
16063 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
16064 Trmp, MachinePointerInfo(TrmpAddr),
16067 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16068 DAG.getConstant(1, MVT::i32));
16069 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
16070 MachinePointerInfo(TrmpAddr, 1),
16073 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
16074 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16075 DAG.getConstant(5, MVT::i32));
16076 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
16077 MachinePointerInfo(TrmpAddr, 5),
16080 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
16081 DAG.getConstant(6, MVT::i32));
16082 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
16083 MachinePointerInfo(TrmpAddr, 6),
16086 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
16090 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
16091 SelectionDAG &DAG) const {
16093 The rounding mode is in bits 11:10 of FPSR, and has the following
16095 00 Round to nearest
16100 FLT_ROUNDS, on the other hand, expects the following:
16107 To perform the conversion, we do:
16108 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
16111 MachineFunction &MF = DAG.getMachineFunction();
16112 const TargetMachine &TM = MF.getTarget();
16113 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
16114 unsigned StackAlignment = TFI.getStackAlignment();
16115 MVT VT = Op.getSimpleValueType();
16118 // Save FP Control Word to stack slot
16119 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
16120 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
16122 MachineMemOperand *MMO =
16123 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
16124 MachineMemOperand::MOStore, 2, 2);
16126 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
16127 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
16128 DAG.getVTList(MVT::Other),
16129 Ops, MVT::i16, MMO);
16131 // Load FP Control Word from stack slot
16132 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
16133 MachinePointerInfo(), false, false, false, 0);
16135 // Transform as necessary
16137 DAG.getNode(ISD::SRL, DL, MVT::i16,
16138 DAG.getNode(ISD::AND, DL, MVT::i16,
16139 CWD, DAG.getConstant(0x800, MVT::i16)),
16140 DAG.getConstant(11, MVT::i8));
16142 DAG.getNode(ISD::SRL, DL, MVT::i16,
16143 DAG.getNode(ISD::AND, DL, MVT::i16,
16144 CWD, DAG.getConstant(0x400, MVT::i16)),
16145 DAG.getConstant(9, MVT::i8));
16148 DAG.getNode(ISD::AND, DL, MVT::i16,
16149 DAG.getNode(ISD::ADD, DL, MVT::i16,
16150 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
16151 DAG.getConstant(1, MVT::i16)),
16152 DAG.getConstant(3, MVT::i16));
16154 return DAG.getNode((VT.getSizeInBits() < 16 ?
16155 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
16158 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
16159 MVT VT = Op.getSimpleValueType();
16161 unsigned NumBits = VT.getSizeInBits();
16164 Op = Op.getOperand(0);
16165 if (VT == MVT::i8) {
16166 // Zero extend to i32 since there is not an i8 bsr.
16168 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16171 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
16172 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16173 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16175 // If src is zero (i.e. bsr sets ZF), returns NumBits.
16178 DAG.getConstant(NumBits+NumBits-1, OpVT),
16179 DAG.getConstant(X86::COND_E, MVT::i8),
16182 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
16184 // Finally xor with NumBits-1.
16185 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16188 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16192 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
16193 MVT VT = Op.getSimpleValueType();
16195 unsigned NumBits = VT.getSizeInBits();
16198 Op = Op.getOperand(0);
16199 if (VT == MVT::i8) {
16200 // Zero extend to i32 since there is not an i8 bsr.
16202 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
16205 // Issue a bsr (scan bits in reverse).
16206 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
16207 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
16209 // And xor with NumBits-1.
16210 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
16213 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
16217 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
16218 MVT VT = Op.getSimpleValueType();
16219 unsigned NumBits = VT.getSizeInBits();
16221 Op = Op.getOperand(0);
16223 // Issue a bsf (scan bits forward) which also sets EFLAGS.
16224 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
16225 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
16227 // If src is zero (i.e. bsf sets ZF), returns NumBits.
16230 DAG.getConstant(NumBits, VT),
16231 DAG.getConstant(X86::COND_E, MVT::i8),
16234 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
16237 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
16238 // ones, and then concatenate the result back.
16239 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
16240 MVT VT = Op.getSimpleValueType();
16242 assert(VT.is256BitVector() && VT.isInteger() &&
16243 "Unsupported value type for operation");
16245 unsigned NumElems = VT.getVectorNumElements();
16248 // Extract the LHS vectors
16249 SDValue LHS = Op.getOperand(0);
16250 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
16251 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
16253 // Extract the RHS vectors
16254 SDValue RHS = Op.getOperand(1);
16255 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
16256 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
16258 MVT EltVT = VT.getVectorElementType();
16259 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
16261 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
16262 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
16263 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
16266 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
16267 assert(Op.getSimpleValueType().is256BitVector() &&
16268 Op.getSimpleValueType().isInteger() &&
16269 "Only handle AVX 256-bit vector integer operation");
16270 return Lower256IntArith(Op, DAG);
16273 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
16274 assert(Op.getSimpleValueType().is256BitVector() &&
16275 Op.getSimpleValueType().isInteger() &&
16276 "Only handle AVX 256-bit vector integer operation");
16277 return Lower256IntArith(Op, DAG);
16280 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
16281 SelectionDAG &DAG) {
16283 MVT VT = Op.getSimpleValueType();
16285 // Decompose 256-bit ops into smaller 128-bit ops.
16286 if (VT.is256BitVector() && !Subtarget->hasInt256())
16287 return Lower256IntArith(Op, DAG);
16289 SDValue A = Op.getOperand(0);
16290 SDValue B = Op.getOperand(1);
16292 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
16293 if (VT == MVT::v4i32) {
16294 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
16295 "Should not custom lower when pmuldq is available!");
16297 // Extract the odd parts.
16298 static const int UnpackMask[] = { 1, -1, 3, -1 };
16299 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
16300 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
16302 // Multiply the even parts.
16303 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
16304 // Now multiply odd parts.
16305 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
16307 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
16308 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
16310 // Merge the two vectors back together with a shuffle. This expands into 2
16312 static const int ShufMask[] = { 0, 4, 2, 6 };
16313 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
16316 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
16317 "Only know how to lower V2I64/V4I64/V8I64 multiply");
16319 // Ahi = psrlqi(a, 32);
16320 // Bhi = psrlqi(b, 32);
16322 // AloBlo = pmuludq(a, b);
16323 // AloBhi = pmuludq(a, Bhi);
16324 // AhiBlo = pmuludq(Ahi, b);
16326 // AloBhi = psllqi(AloBhi, 32);
16327 // AhiBlo = psllqi(AhiBlo, 32);
16328 // return AloBlo + AloBhi + AhiBlo;
16330 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
16331 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
16333 // Bit cast to 32-bit vectors for MULUDQ
16334 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
16335 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
16336 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
16337 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
16338 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
16339 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
16341 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
16342 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
16343 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
16345 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
16346 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
16348 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
16349 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
16352 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
16353 assert(Subtarget->isTargetWin64() && "Unexpected target");
16354 EVT VT = Op.getValueType();
16355 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
16356 "Unexpected return type for lowering");
16360 switch (Op->getOpcode()) {
16361 default: llvm_unreachable("Unexpected request for libcall!");
16362 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
16363 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
16364 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
16365 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
16366 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
16367 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
16371 SDValue InChain = DAG.getEntryNode();
16373 TargetLowering::ArgListTy Args;
16374 TargetLowering::ArgListEntry Entry;
16375 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
16376 EVT ArgVT = Op->getOperand(i).getValueType();
16377 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
16378 "Unexpected argument type for lowering");
16379 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
16380 Entry.Node = StackPtr;
16381 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
16383 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
16384 Entry.Ty = PointerType::get(ArgTy,0);
16385 Entry.isSExt = false;
16386 Entry.isZExt = false;
16387 Args.push_back(Entry);
16390 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
16393 TargetLowering::CallLoweringInfo CLI(DAG);
16394 CLI.setDebugLoc(dl).setChain(InChain)
16395 .setCallee(getLibcallCallingConv(LC),
16396 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
16397 Callee, std::move(Args), 0)
16398 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
16400 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
16401 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
16404 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
16405 SelectionDAG &DAG) {
16406 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
16407 EVT VT = Op0.getValueType();
16410 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
16411 (VT == MVT::v8i32 && Subtarget->hasInt256()));
16413 // PMULxD operations multiply each even value (starting at 0) of LHS with
16414 // the related value of RHS and produce a widen result.
16415 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16416 // => <2 x i64> <ae|cg>
16418 // In other word, to have all the results, we need to perform two PMULxD:
16419 // 1. one with the even values.
16420 // 2. one with the odd values.
16421 // To achieve #2, with need to place the odd values at an even position.
16423 // Place the odd value at an even position (basically, shift all values 1
16424 // step to the left):
16425 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
16426 // <a|b|c|d> => <b|undef|d|undef>
16427 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
16428 // <e|f|g|h> => <f|undef|h|undef>
16429 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
16431 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
16433 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
16434 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
16436 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
16437 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
16438 // => <2 x i64> <ae|cg>
16439 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
16440 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
16441 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
16442 // => <2 x i64> <bf|dh>
16443 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
16444 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
16446 // Shuffle it back into the right order.
16447 SDValue Highs, Lows;
16448 if (VT == MVT::v8i32) {
16449 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
16450 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16451 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
16452 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16454 const int HighMask[] = {1, 5, 3, 7};
16455 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
16456 const int LowMask[] = {0, 4, 2, 6};
16457 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
16460 // If we have a signed multiply but no PMULDQ fix up the high parts of a
16461 // unsigned multiply.
16462 if (IsSigned && !Subtarget->hasSSE41()) {
16464 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
16465 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
16466 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
16467 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
16468 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
16470 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
16471 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
16474 // The first result of MUL_LOHI is actually the low value, followed by the
16476 SDValue Ops[] = {Lows, Highs};
16477 return DAG.getMergeValues(Ops, dl);
16480 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
16481 const X86Subtarget *Subtarget) {
16482 MVT VT = Op.getSimpleValueType();
16484 SDValue R = Op.getOperand(0);
16485 SDValue Amt = Op.getOperand(1);
16487 // Optimize shl/srl/sra with constant shift amount.
16488 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
16489 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
16490 uint64_t ShiftAmt = ShiftConst->getZExtValue();
16492 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
16493 (Subtarget->hasInt256() &&
16494 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16495 (Subtarget->hasAVX512() &&
16496 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16497 if (Op.getOpcode() == ISD::SHL)
16498 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16500 if (Op.getOpcode() == ISD::SRL)
16501 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16503 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
16504 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16508 if (VT == MVT::v16i8) {
16509 if (Op.getOpcode() == ISD::SHL) {
16510 // Make a large shift.
16511 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16512 MVT::v8i16, R, ShiftAmt,
16514 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16515 // Zero out the rightmost bits.
16516 SmallVector<SDValue, 16> V(16,
16517 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16519 return DAG.getNode(ISD::AND, dl, VT, SHL,
16520 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16522 if (Op.getOpcode() == ISD::SRL) {
16523 // Make a large shift.
16524 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16525 MVT::v8i16, R, ShiftAmt,
16527 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16528 // Zero out the leftmost bits.
16529 SmallVector<SDValue, 16> V(16,
16530 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16532 return DAG.getNode(ISD::AND, dl, VT, SRL,
16533 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16535 if (Op.getOpcode() == ISD::SRA) {
16536 if (ShiftAmt == 7) {
16537 // R s>> 7 === R s< 0
16538 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16539 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16542 // R s>> a === ((R u>> a) ^ m) - m
16543 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16544 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
16546 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16547 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16548 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16551 llvm_unreachable("Unknown shift opcode.");
16554 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
16555 if (Op.getOpcode() == ISD::SHL) {
16556 // Make a large shift.
16557 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
16558 MVT::v16i16, R, ShiftAmt,
16560 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
16561 // Zero out the rightmost bits.
16562 SmallVector<SDValue, 32> V(32,
16563 DAG.getConstant(uint8_t(-1U << ShiftAmt),
16565 return DAG.getNode(ISD::AND, dl, VT, SHL,
16566 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16568 if (Op.getOpcode() == ISD::SRL) {
16569 // Make a large shift.
16570 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
16571 MVT::v16i16, R, ShiftAmt,
16573 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
16574 // Zero out the leftmost bits.
16575 SmallVector<SDValue, 32> V(32,
16576 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
16578 return DAG.getNode(ISD::AND, dl, VT, SRL,
16579 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
16581 if (Op.getOpcode() == ISD::SRA) {
16582 if (ShiftAmt == 7) {
16583 // R s>> 7 === R s< 0
16584 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
16585 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
16588 // R s>> a === ((R u>> a) ^ m) - m
16589 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
16590 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
16592 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
16593 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
16594 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
16597 llvm_unreachable("Unknown shift opcode.");
16602 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
16603 if (!Subtarget->is64Bit() &&
16604 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
16605 Amt.getOpcode() == ISD::BITCAST &&
16606 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16607 Amt = Amt.getOperand(0);
16608 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16609 VT.getVectorNumElements();
16610 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
16611 uint64_t ShiftAmt = 0;
16612 for (unsigned i = 0; i != Ratio; ++i) {
16613 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
16617 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
16619 // Check remaining shift amounts.
16620 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16621 uint64_t ShAmt = 0;
16622 for (unsigned j = 0; j != Ratio; ++j) {
16623 ConstantSDNode *C =
16624 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
16628 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
16630 if (ShAmt != ShiftAmt)
16633 switch (Op.getOpcode()) {
16635 llvm_unreachable("Unknown shift opcode!");
16637 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
16640 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
16643 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
16651 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
16652 const X86Subtarget* Subtarget) {
16653 MVT VT = Op.getSimpleValueType();
16655 SDValue R = Op.getOperand(0);
16656 SDValue Amt = Op.getOperand(1);
16658 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
16659 VT == MVT::v4i32 || VT == MVT::v8i16 ||
16660 (Subtarget->hasInt256() &&
16661 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
16662 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
16663 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
16665 EVT EltVT = VT.getVectorElementType();
16667 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
16668 unsigned NumElts = VT.getVectorNumElements();
16670 for (i = 0; i != NumElts; ++i) {
16671 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
16675 for (j = i; j != NumElts; ++j) {
16676 SDValue Arg = Amt.getOperand(j);
16677 if (Arg.getOpcode() == ISD::UNDEF) continue;
16678 if (Arg != Amt.getOperand(i))
16681 if (i != NumElts && j == NumElts)
16682 BaseShAmt = Amt.getOperand(i);
16684 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
16685 Amt = Amt.getOperand(0);
16686 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
16687 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
16688 SDValue InVec = Amt.getOperand(0);
16689 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
16690 unsigned NumElts = InVec.getValueType().getVectorNumElements();
16692 for (; i != NumElts; ++i) {
16693 SDValue Arg = InVec.getOperand(i);
16694 if (Arg.getOpcode() == ISD::UNDEF) continue;
16698 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
16699 if (ConstantSDNode *C =
16700 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
16701 unsigned SplatIdx =
16702 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
16703 if (C->getZExtValue() == SplatIdx)
16704 BaseShAmt = InVec.getOperand(1);
16707 if (!BaseShAmt.getNode())
16708 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
16709 DAG.getIntPtrConstant(0));
16713 if (BaseShAmt.getNode()) {
16714 if (EltVT.bitsGT(MVT::i32))
16715 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
16716 else if (EltVT.bitsLT(MVT::i32))
16717 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
16719 switch (Op.getOpcode()) {
16721 llvm_unreachable("Unknown shift opcode!");
16723 switch (VT.SimpleTy) {
16724 default: return SDValue();
16733 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
16736 switch (VT.SimpleTy) {
16737 default: return SDValue();
16744 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
16747 switch (VT.SimpleTy) {
16748 default: return SDValue();
16757 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
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 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
16767 Amt.getOpcode() == ISD::BITCAST &&
16768 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
16769 Amt = Amt.getOperand(0);
16770 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
16771 VT.getVectorNumElements();
16772 std::vector<SDValue> Vals(Ratio);
16773 for (unsigned i = 0; i != Ratio; ++i)
16774 Vals[i] = Amt.getOperand(i);
16775 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
16776 for (unsigned j = 0; j != Ratio; ++j)
16777 if (Vals[j] != Amt.getOperand(i + j))
16780 switch (Op.getOpcode()) {
16782 llvm_unreachable("Unknown shift opcode!");
16784 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
16786 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
16788 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
16795 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
16796 SelectionDAG &DAG) {
16797 MVT VT = Op.getSimpleValueType();
16799 SDValue R = Op.getOperand(0);
16800 SDValue Amt = Op.getOperand(1);
16803 assert(VT.isVector() && "Custom lowering only for vector shifts!");
16804 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
16806 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
16810 V = LowerScalarVariableShift(Op, DAG, Subtarget);
16814 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
16816 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
16817 if (Subtarget->hasInt256()) {
16818 if (Op.getOpcode() == ISD::SRL &&
16819 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16820 VT == MVT::v4i64 || VT == MVT::v8i32))
16822 if (Op.getOpcode() == ISD::SHL &&
16823 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
16824 VT == MVT::v4i64 || VT == MVT::v8i32))
16826 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
16830 // If possible, lower this packed shift into a vector multiply instead of
16831 // expanding it into a sequence of scalar shifts.
16832 // Do this only if the vector shift count is a constant build_vector.
16833 if (Op.getOpcode() == ISD::SHL &&
16834 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
16835 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
16836 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16837 SmallVector<SDValue, 8> Elts;
16838 EVT SVT = VT.getScalarType();
16839 unsigned SVTBits = SVT.getSizeInBits();
16840 const APInt &One = APInt(SVTBits, 1);
16841 unsigned NumElems = VT.getVectorNumElements();
16843 for (unsigned i=0; i !=NumElems; ++i) {
16844 SDValue Op = Amt->getOperand(i);
16845 if (Op->getOpcode() == ISD::UNDEF) {
16846 Elts.push_back(Op);
16850 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
16851 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
16852 uint64_t ShAmt = C.getZExtValue();
16853 if (ShAmt >= SVTBits) {
16854 Elts.push_back(DAG.getUNDEF(SVT));
16857 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
16859 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16860 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
16863 // Lower SHL with variable shift amount.
16864 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
16865 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
16867 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
16868 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
16869 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
16870 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
16873 // If possible, lower this shift as a sequence of two shifts by
16874 // constant plus a MOVSS/MOVSD instead of scalarizing it.
16876 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
16878 // Could be rewritten as:
16879 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
16881 // The advantage is that the two shifts from the example would be
16882 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
16883 // the vector shift into four scalar shifts plus four pairs of vector
16885 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
16886 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
16887 unsigned TargetOpcode = X86ISD::MOVSS;
16888 bool CanBeSimplified;
16889 // The splat value for the first packed shift (the 'X' from the example).
16890 SDValue Amt1 = Amt->getOperand(0);
16891 // The splat value for the second packed shift (the 'Y' from the example).
16892 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
16893 Amt->getOperand(2);
16895 // See if it is possible to replace this node with a sequence of
16896 // two shifts followed by a MOVSS/MOVSD
16897 if (VT == MVT::v4i32) {
16898 // Check if it is legal to use a MOVSS.
16899 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
16900 Amt2 == Amt->getOperand(3);
16901 if (!CanBeSimplified) {
16902 // Otherwise, check if we can still simplify this node using a MOVSD.
16903 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
16904 Amt->getOperand(2) == Amt->getOperand(3);
16905 TargetOpcode = X86ISD::MOVSD;
16906 Amt2 = Amt->getOperand(2);
16909 // Do similar checks for the case where the machine value type
16911 CanBeSimplified = Amt1 == Amt->getOperand(1);
16912 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
16913 CanBeSimplified = Amt2 == Amt->getOperand(i);
16915 if (!CanBeSimplified) {
16916 TargetOpcode = X86ISD::MOVSD;
16917 CanBeSimplified = true;
16918 Amt2 = Amt->getOperand(4);
16919 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
16920 CanBeSimplified = Amt1 == Amt->getOperand(i);
16921 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
16922 CanBeSimplified = Amt2 == Amt->getOperand(j);
16926 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
16927 isa<ConstantSDNode>(Amt2)) {
16928 // Replace this node with two shifts followed by a MOVSS/MOVSD.
16929 EVT CastVT = MVT::v4i32;
16931 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
16932 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
16934 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
16935 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
16936 if (TargetOpcode == X86ISD::MOVSD)
16937 CastVT = MVT::v2i64;
16938 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
16939 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
16940 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
16942 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
16946 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
16947 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
16950 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
16951 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
16953 // Turn 'a' into a mask suitable for VSELECT
16954 SDValue VSelM = DAG.getConstant(0x80, VT);
16955 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16956 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16958 SDValue CM1 = DAG.getConstant(0x0f, VT);
16959 SDValue CM2 = DAG.getConstant(0x3f, VT);
16961 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
16962 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
16963 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
16964 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16965 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16968 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16969 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16970 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16972 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
16973 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
16974 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
16975 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
16976 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
16979 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
16980 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
16981 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
16983 // return VSELECT(r, r+r, a);
16984 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
16985 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
16989 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
16990 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
16991 // solution better.
16992 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
16993 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
16995 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
16996 R = DAG.getNode(ExtOpc, dl, NewVT, R);
16997 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
16998 return DAG.getNode(ISD::TRUNCATE, dl, VT,
16999 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
17002 // Decompose 256-bit shifts into smaller 128-bit shifts.
17003 if (VT.is256BitVector()) {
17004 unsigned NumElems = VT.getVectorNumElements();
17005 MVT EltVT = VT.getVectorElementType();
17006 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17008 // Extract the two vectors
17009 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
17010 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
17012 // Recreate the shift amount vectors
17013 SDValue Amt1, Amt2;
17014 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17015 // Constant shift amount
17016 SmallVector<SDValue, 4> Amt1Csts;
17017 SmallVector<SDValue, 4> Amt2Csts;
17018 for (unsigned i = 0; i != NumElems/2; ++i)
17019 Amt1Csts.push_back(Amt->getOperand(i));
17020 for (unsigned i = NumElems/2; i != NumElems; ++i)
17021 Amt2Csts.push_back(Amt->getOperand(i));
17023 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
17024 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
17026 // Variable shift amount
17027 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
17028 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
17031 // Issue new vector shifts for the smaller types
17032 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
17033 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
17035 // Concatenate the result back
17036 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
17042 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
17043 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
17044 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
17045 // looks for this combo and may remove the "setcc" instruction if the "setcc"
17046 // has only one use.
17047 SDNode *N = Op.getNode();
17048 SDValue LHS = N->getOperand(0);
17049 SDValue RHS = N->getOperand(1);
17050 unsigned BaseOp = 0;
17053 switch (Op.getOpcode()) {
17054 default: llvm_unreachable("Unknown ovf instruction!");
17056 // A subtract of one will be selected as a INC. Note that INC doesn't
17057 // set CF, so we can't do this for UADDO.
17058 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17060 BaseOp = X86ISD::INC;
17061 Cond = X86::COND_O;
17064 BaseOp = X86ISD::ADD;
17065 Cond = X86::COND_O;
17068 BaseOp = X86ISD::ADD;
17069 Cond = X86::COND_B;
17072 // A subtract of one will be selected as a DEC. Note that DEC doesn't
17073 // set CF, so we can't do this for USUBO.
17074 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
17076 BaseOp = X86ISD::DEC;
17077 Cond = X86::COND_O;
17080 BaseOp = X86ISD::SUB;
17081 Cond = X86::COND_O;
17084 BaseOp = X86ISD::SUB;
17085 Cond = X86::COND_B;
17088 BaseOp = X86ISD::SMUL;
17089 Cond = X86::COND_O;
17091 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
17092 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
17094 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
17097 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
17098 DAG.getConstant(X86::COND_O, MVT::i32),
17099 SDValue(Sum.getNode(), 2));
17101 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17105 // Also sets EFLAGS.
17106 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
17107 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
17110 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
17111 DAG.getConstant(Cond, MVT::i32),
17112 SDValue(Sum.getNode(), 1));
17114 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
17117 // Sign extension of the low part of vector elements. This may be used either
17118 // when sign extend instructions are not available or if the vector element
17119 // sizes already match the sign-extended size. If the vector elements are in
17120 // their pre-extended size and sign extend instructions are available, that will
17121 // be handled by LowerSIGN_EXTEND.
17122 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
17123 SelectionDAG &DAG) const {
17125 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
17126 MVT VT = Op.getSimpleValueType();
17128 if (!Subtarget->hasSSE2() || !VT.isVector())
17131 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
17132 ExtraVT.getScalarType().getSizeInBits();
17134 switch (VT.SimpleTy) {
17135 default: return SDValue();
17138 if (!Subtarget->hasFp256())
17140 if (!Subtarget->hasInt256()) {
17141 // needs to be split
17142 unsigned NumElems = VT.getVectorNumElements();
17144 // Extract the LHS vectors
17145 SDValue LHS = Op.getOperand(0);
17146 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17147 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17149 MVT EltVT = VT.getVectorElementType();
17150 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17152 EVT ExtraEltVT = ExtraVT.getVectorElementType();
17153 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
17154 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
17156 SDValue Extra = DAG.getValueType(ExtraVT);
17158 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
17159 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
17161 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
17166 SDValue Op0 = Op.getOperand(0);
17168 // This is a sign extension of some low part of vector elements without
17169 // changing the size of the vector elements themselves:
17170 // Shift-Left + Shift-Right-Algebraic.
17171 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
17173 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
17179 /// Returns true if the operand type is exactly twice the native width, and
17180 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
17181 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
17182 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
17183 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
17184 const X86Subtarget &Subtarget =
17185 getTargetMachine().getSubtarget<X86Subtarget>();
17186 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
17189 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
17190 else if (OpWidth == 128)
17191 return Subtarget.hasCmpxchg16b();
17196 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
17197 return needsCmpXchgNb(SI->getValueOperand()->getType());
17200 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *SI) const {
17201 return false; // FIXME, currently these are expanded separately in this file.
17204 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
17205 const X86Subtarget &Subtarget =
17206 getTargetMachine().getSubtarget<X86Subtarget>();
17207 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
17208 const Type *MemType = AI->getType();
17210 // If the operand is too big, we must see if cmpxchg8/16b is available
17211 // and default to library calls otherwise.
17212 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
17213 return needsCmpXchgNb(MemType);
17215 AtomicRMWInst::BinOp Op = AI->getOperation();
17218 llvm_unreachable("Unknown atomic operation");
17219 case AtomicRMWInst::Xchg:
17220 case AtomicRMWInst::Add:
17221 case AtomicRMWInst::Sub:
17222 // It's better to use xadd, xsub or xchg for these in all cases.
17224 case AtomicRMWInst::Or:
17225 case AtomicRMWInst::And:
17226 case AtomicRMWInst::Xor:
17227 // If the atomicrmw's result isn't actually used, we can just add a "lock"
17228 // prefix to a normal instruction for these operations.
17229 return !AI->use_empty();
17230 case AtomicRMWInst::Nand:
17231 case AtomicRMWInst::Max:
17232 case AtomicRMWInst::Min:
17233 case AtomicRMWInst::UMax:
17234 case AtomicRMWInst::UMin:
17235 // These always require a non-trivial set of data operations on x86. We must
17236 // use a cmpxchg loop.
17241 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
17242 SelectionDAG &DAG) {
17244 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
17245 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
17246 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
17247 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
17249 // The only fence that needs an instruction is a sequentially-consistent
17250 // cross-thread fence.
17251 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
17252 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
17253 // no-sse2). There isn't any reason to disable it if the target processor
17255 if (Subtarget->hasSSE2() || Subtarget->is64Bit())
17256 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
17258 SDValue Chain = Op.getOperand(0);
17259 SDValue Zero = DAG.getConstant(0, MVT::i32);
17261 DAG.getRegister(X86::ESP, MVT::i32), // Base
17262 DAG.getTargetConstant(1, MVT::i8), // Scale
17263 DAG.getRegister(0, MVT::i32), // Index
17264 DAG.getTargetConstant(0, MVT::i32), // Disp
17265 DAG.getRegister(0, MVT::i32), // Segment.
17269 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
17270 return SDValue(Res, 0);
17273 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
17274 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
17277 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
17278 SelectionDAG &DAG) {
17279 MVT T = Op.getSimpleValueType();
17283 switch(T.SimpleTy) {
17284 default: llvm_unreachable("Invalid value type!");
17285 case MVT::i8: Reg = X86::AL; size = 1; break;
17286 case MVT::i16: Reg = X86::AX; size = 2; break;
17287 case MVT::i32: Reg = X86::EAX; size = 4; break;
17289 assert(Subtarget->is64Bit() && "Node not type legal!");
17290 Reg = X86::RAX; size = 8;
17293 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
17294 Op.getOperand(2), SDValue());
17295 SDValue Ops[] = { cpIn.getValue(0),
17298 DAG.getTargetConstant(size, MVT::i8),
17299 cpIn.getValue(1) };
17300 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17301 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
17302 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
17306 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
17307 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
17308 MVT::i32, cpOut.getValue(2));
17309 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
17310 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17312 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
17313 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
17314 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
17318 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
17319 SelectionDAG &DAG) {
17320 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
17321 MVT DstVT = Op.getSimpleValueType();
17323 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
17324 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17325 if (DstVT != MVT::f64)
17326 // This conversion needs to be expanded.
17329 SDValue InVec = Op->getOperand(0);
17331 unsigned NumElts = SrcVT.getVectorNumElements();
17332 EVT SVT = SrcVT.getVectorElementType();
17334 // Widen the vector in input in the case of MVT::v2i32.
17335 // Example: from MVT::v2i32 to MVT::v4i32.
17336 SmallVector<SDValue, 16> Elts;
17337 for (unsigned i = 0, e = NumElts; i != e; ++i)
17338 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
17339 DAG.getIntPtrConstant(i)));
17341 // Explicitly mark the extra elements as Undef.
17342 SDValue Undef = DAG.getUNDEF(SVT);
17343 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
17344 Elts.push_back(Undef);
17346 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17347 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
17348 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
17349 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
17350 DAG.getIntPtrConstant(0));
17353 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
17354 Subtarget->hasMMX() && "Unexpected custom BITCAST");
17355 assert((DstVT == MVT::i64 ||
17356 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
17357 "Unexpected custom BITCAST");
17358 // i64 <=> MMX conversions are Legal.
17359 if (SrcVT==MVT::i64 && DstVT.isVector())
17361 if (DstVT==MVT::i64 && SrcVT.isVector())
17363 // MMX <=> MMX conversions are Legal.
17364 if (SrcVT.isVector() && DstVT.isVector())
17366 // All other conversions need to be expanded.
17370 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
17371 SDNode *Node = Op.getNode();
17373 EVT T = Node->getValueType(0);
17374 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
17375 DAG.getConstant(0, T), Node->getOperand(2));
17376 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
17377 cast<AtomicSDNode>(Node)->getMemoryVT(),
17378 Node->getOperand(0),
17379 Node->getOperand(1), negOp,
17380 cast<AtomicSDNode>(Node)->getMemOperand(),
17381 cast<AtomicSDNode>(Node)->getOrdering(),
17382 cast<AtomicSDNode>(Node)->getSynchScope());
17385 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
17386 SDNode *Node = Op.getNode();
17388 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17390 // Convert seq_cst store -> xchg
17391 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
17392 // FIXME: On 32-bit, store -> fist or movq would be more efficient
17393 // (The only way to get a 16-byte store is cmpxchg16b)
17394 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
17395 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
17396 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
17397 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
17398 cast<AtomicSDNode>(Node)->getMemoryVT(),
17399 Node->getOperand(0),
17400 Node->getOperand(1), Node->getOperand(2),
17401 cast<AtomicSDNode>(Node)->getMemOperand(),
17402 cast<AtomicSDNode>(Node)->getOrdering(),
17403 cast<AtomicSDNode>(Node)->getSynchScope());
17404 return Swap.getValue(1);
17406 // Other atomic stores have a simple pattern.
17410 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
17411 EVT VT = Op.getNode()->getSimpleValueType(0);
17413 // Let legalize expand this if it isn't a legal type yet.
17414 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
17417 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17420 bool ExtraOp = false;
17421 switch (Op.getOpcode()) {
17422 default: llvm_unreachable("Invalid code");
17423 case ISD::ADDC: Opc = X86ISD::ADD; break;
17424 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
17425 case ISD::SUBC: Opc = X86ISD::SUB; break;
17426 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
17430 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17432 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
17433 Op.getOperand(1), Op.getOperand(2));
17436 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
17437 SelectionDAG &DAG) {
17438 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
17440 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
17441 // which returns the values as { float, float } (in XMM0) or
17442 // { double, double } (which is returned in XMM0, XMM1).
17444 SDValue Arg = Op.getOperand(0);
17445 EVT ArgVT = Arg.getValueType();
17446 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17448 TargetLowering::ArgListTy Args;
17449 TargetLowering::ArgListEntry Entry;
17453 Entry.isSExt = false;
17454 Entry.isZExt = false;
17455 Args.push_back(Entry);
17457 bool isF64 = ArgVT == MVT::f64;
17458 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
17459 // the small struct {f32, f32} is returned in (eax, edx). For f64,
17460 // the results are returned via SRet in memory.
17461 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
17462 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17463 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
17465 Type *RetTy = isF64
17466 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
17467 : (Type*)VectorType::get(ArgTy, 4);
17469 TargetLowering::CallLoweringInfo CLI(DAG);
17470 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
17471 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
17473 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
17476 // Returned in xmm0 and xmm1.
17477 return CallResult.first;
17479 // Returned in bits 0:31 and 32:64 xmm0.
17480 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17481 CallResult.first, DAG.getIntPtrConstant(0));
17482 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
17483 CallResult.first, DAG.getIntPtrConstant(1));
17484 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
17485 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
17488 /// LowerOperation - Provide custom lowering hooks for some operations.
17490 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
17491 switch (Op.getOpcode()) {
17492 default: llvm_unreachable("Should not custom lower this!");
17493 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
17494 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
17495 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
17496 return LowerCMP_SWAP(Op, Subtarget, DAG);
17497 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
17498 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
17499 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
17500 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
17501 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
17502 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
17503 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
17504 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
17505 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
17506 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
17507 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
17508 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
17509 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
17510 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
17511 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
17512 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
17513 case ISD::SHL_PARTS:
17514 case ISD::SRA_PARTS:
17515 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
17516 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
17517 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
17518 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
17519 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
17520 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
17521 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
17522 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
17523 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
17524 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
17525 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
17527 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
17528 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
17529 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
17530 case ISD::SETCC: return LowerSETCC(Op, DAG);
17531 case ISD::SELECT: return LowerSELECT(Op, DAG);
17532 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
17533 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
17534 case ISD::VASTART: return LowerVASTART(Op, DAG);
17535 case ISD::VAARG: return LowerVAARG(Op, DAG);
17536 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
17537 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
17538 case ISD::INTRINSIC_VOID:
17539 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
17540 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
17541 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
17542 case ISD::FRAME_TO_ARGS_OFFSET:
17543 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
17544 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
17545 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
17546 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
17547 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
17548 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
17549 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
17550 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
17551 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
17552 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
17553 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
17554 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
17555 case ISD::UMUL_LOHI:
17556 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
17559 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
17565 case ISD::UMULO: return LowerXALUO(Op, DAG);
17566 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
17567 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
17571 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
17572 case ISD::ADD: return LowerADD(Op, DAG);
17573 case ISD::SUB: return LowerSUB(Op, DAG);
17574 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
17578 static void ReplaceATOMIC_LOAD(SDNode *Node,
17579 SmallVectorImpl<SDValue> &Results,
17580 SelectionDAG &DAG) {
17582 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
17584 // Convert wide load -> cmpxchg8b/cmpxchg16b
17585 // FIXME: On 32-bit, load -> fild or movq would be more efficient
17586 // (The only way to get a 16-byte load is cmpxchg16b)
17587 // FIXME: 16-byte ATOMIC_CMP_SWAP isn't actually hooked up at the moment.
17588 SDValue Zero = DAG.getConstant(0, VT);
17589 SDVTList VTs = DAG.getVTList(VT, MVT::i1, MVT::Other);
17591 DAG.getAtomicCmpSwap(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, dl, VT, VTs,
17592 Node->getOperand(0), Node->getOperand(1), Zero, Zero,
17593 cast<AtomicSDNode>(Node)->getMemOperand(),
17594 cast<AtomicSDNode>(Node)->getOrdering(),
17595 cast<AtomicSDNode>(Node)->getOrdering(),
17596 cast<AtomicSDNode>(Node)->getSynchScope());
17597 Results.push_back(Swap.getValue(0));
17598 Results.push_back(Swap.getValue(2));
17601 /// ReplaceNodeResults - Replace a node with an illegal result type
17602 /// with a new node built out of custom code.
17603 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
17604 SmallVectorImpl<SDValue>&Results,
17605 SelectionDAG &DAG) const {
17607 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
17608 switch (N->getOpcode()) {
17610 llvm_unreachable("Do not know how to custom type legalize this operation!");
17611 case ISD::SIGN_EXTEND_INREG:
17616 // We don't want to expand or promote these.
17623 case ISD::UDIVREM: {
17624 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
17625 Results.push_back(V);
17628 case ISD::FP_TO_SINT:
17629 case ISD::FP_TO_UINT: {
17630 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
17632 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
17635 std::pair<SDValue,SDValue> Vals =
17636 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
17637 SDValue FIST = Vals.first, StackSlot = Vals.second;
17638 if (FIST.getNode()) {
17639 EVT VT = N->getValueType(0);
17640 // Return a load from the stack slot.
17641 if (StackSlot.getNode())
17642 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
17643 MachinePointerInfo(),
17644 false, false, false, 0));
17646 Results.push_back(FIST);
17650 case ISD::UINT_TO_FP: {
17651 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17652 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
17653 N->getValueType(0) != MVT::v2f32)
17655 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
17657 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
17659 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
17660 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
17661 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
17662 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
17663 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
17664 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
17667 case ISD::FP_ROUND: {
17668 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
17670 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
17671 Results.push_back(V);
17674 case ISD::INTRINSIC_W_CHAIN: {
17675 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
17677 default : llvm_unreachable("Do not know how to custom type "
17678 "legalize this intrinsic operation!");
17679 case Intrinsic::x86_rdtsc:
17680 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17682 case Intrinsic::x86_rdtscp:
17683 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
17685 case Intrinsic::x86_rdpmc:
17686 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
17689 case ISD::READCYCLECOUNTER: {
17690 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
17693 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
17694 EVT T = N->getValueType(0);
17695 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
17696 bool Regs64bit = T == MVT::i128;
17697 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
17698 SDValue cpInL, cpInH;
17699 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17700 DAG.getConstant(0, HalfT));
17701 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
17702 DAG.getConstant(1, HalfT));
17703 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
17704 Regs64bit ? X86::RAX : X86::EAX,
17706 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
17707 Regs64bit ? X86::RDX : X86::EDX,
17708 cpInH, cpInL.getValue(1));
17709 SDValue swapInL, swapInH;
17710 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17711 DAG.getConstant(0, HalfT));
17712 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
17713 DAG.getConstant(1, HalfT));
17714 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
17715 Regs64bit ? X86::RBX : X86::EBX,
17716 swapInL, cpInH.getValue(1));
17717 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
17718 Regs64bit ? X86::RCX : X86::ECX,
17719 swapInH, swapInL.getValue(1));
17720 SDValue Ops[] = { swapInH.getValue(0),
17722 swapInH.getValue(1) };
17723 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
17724 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
17725 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
17726 X86ISD::LCMPXCHG8_DAG;
17727 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
17728 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
17729 Regs64bit ? X86::RAX : X86::EAX,
17730 HalfT, Result.getValue(1));
17731 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
17732 Regs64bit ? X86::RDX : X86::EDX,
17733 HalfT, cpOutL.getValue(2));
17734 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
17736 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
17737 MVT::i32, cpOutH.getValue(2));
17739 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
17740 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
17741 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
17743 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
17744 Results.push_back(Success);
17745 Results.push_back(EFLAGS.getValue(1));
17748 case ISD::ATOMIC_SWAP:
17749 case ISD::ATOMIC_LOAD_ADD:
17750 case ISD::ATOMIC_LOAD_SUB:
17751 case ISD::ATOMIC_LOAD_AND:
17752 case ISD::ATOMIC_LOAD_OR:
17753 case ISD::ATOMIC_LOAD_XOR:
17754 case ISD::ATOMIC_LOAD_NAND:
17755 case ISD::ATOMIC_LOAD_MIN:
17756 case ISD::ATOMIC_LOAD_MAX:
17757 case ISD::ATOMIC_LOAD_UMIN:
17758 case ISD::ATOMIC_LOAD_UMAX:
17759 // Delegate to generic TypeLegalization. Situations we can really handle
17760 // should have already been dealt with by AtomicExpandPass.cpp.
17762 case ISD::ATOMIC_LOAD: {
17763 ReplaceATOMIC_LOAD(N, Results, DAG);
17766 case ISD::BITCAST: {
17767 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
17768 EVT DstVT = N->getValueType(0);
17769 EVT SrcVT = N->getOperand(0)->getValueType(0);
17771 if (SrcVT != MVT::f64 ||
17772 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
17775 unsigned NumElts = DstVT.getVectorNumElements();
17776 EVT SVT = DstVT.getVectorElementType();
17777 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
17778 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
17779 MVT::v2f64, N->getOperand(0));
17780 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
17782 if (ExperimentalVectorWideningLegalization) {
17783 // If we are legalizing vectors by widening, we already have the desired
17784 // legal vector type, just return it.
17785 Results.push_back(ToVecInt);
17789 SmallVector<SDValue, 8> Elts;
17790 for (unsigned i = 0, e = NumElts; i != e; ++i)
17791 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
17792 ToVecInt, DAG.getIntPtrConstant(i)));
17794 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
17799 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
17801 default: return nullptr;
17802 case X86ISD::BSF: return "X86ISD::BSF";
17803 case X86ISD::BSR: return "X86ISD::BSR";
17804 case X86ISD::SHLD: return "X86ISD::SHLD";
17805 case X86ISD::SHRD: return "X86ISD::SHRD";
17806 case X86ISD::FAND: return "X86ISD::FAND";
17807 case X86ISD::FANDN: return "X86ISD::FANDN";
17808 case X86ISD::FOR: return "X86ISD::FOR";
17809 case X86ISD::FXOR: return "X86ISD::FXOR";
17810 case X86ISD::FSRL: return "X86ISD::FSRL";
17811 case X86ISD::FILD: return "X86ISD::FILD";
17812 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
17813 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
17814 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
17815 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
17816 case X86ISD::FLD: return "X86ISD::FLD";
17817 case X86ISD::FST: return "X86ISD::FST";
17818 case X86ISD::CALL: return "X86ISD::CALL";
17819 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
17820 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
17821 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
17822 case X86ISD::BT: return "X86ISD::BT";
17823 case X86ISD::CMP: return "X86ISD::CMP";
17824 case X86ISD::COMI: return "X86ISD::COMI";
17825 case X86ISD::UCOMI: return "X86ISD::UCOMI";
17826 case X86ISD::CMPM: return "X86ISD::CMPM";
17827 case X86ISD::CMPMU: return "X86ISD::CMPMU";
17828 case X86ISD::SETCC: return "X86ISD::SETCC";
17829 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
17830 case X86ISD::FSETCC: return "X86ISD::FSETCC";
17831 case X86ISD::CMOV: return "X86ISD::CMOV";
17832 case X86ISD::BRCOND: return "X86ISD::BRCOND";
17833 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
17834 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
17835 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
17836 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
17837 case X86ISD::Wrapper: return "X86ISD::Wrapper";
17838 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
17839 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
17840 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
17841 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
17842 case X86ISD::PINSRB: return "X86ISD::PINSRB";
17843 case X86ISD::PINSRW: return "X86ISD::PINSRW";
17844 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
17845 case X86ISD::ANDNP: return "X86ISD::ANDNP";
17846 case X86ISD::PSIGN: return "X86ISD::PSIGN";
17847 case X86ISD::BLENDV: return "X86ISD::BLENDV";
17848 case X86ISD::BLENDI: return "X86ISD::BLENDI";
17849 case X86ISD::SUBUS: return "X86ISD::SUBUS";
17850 case X86ISD::HADD: return "X86ISD::HADD";
17851 case X86ISD::HSUB: return "X86ISD::HSUB";
17852 case X86ISD::FHADD: return "X86ISD::FHADD";
17853 case X86ISD::FHSUB: return "X86ISD::FHSUB";
17854 case X86ISD::UMAX: return "X86ISD::UMAX";
17855 case X86ISD::UMIN: return "X86ISD::UMIN";
17856 case X86ISD::SMAX: return "X86ISD::SMAX";
17857 case X86ISD::SMIN: return "X86ISD::SMIN";
17858 case X86ISD::FMAX: return "X86ISD::FMAX";
17859 case X86ISD::FMIN: return "X86ISD::FMIN";
17860 case X86ISD::FMAXC: return "X86ISD::FMAXC";
17861 case X86ISD::FMINC: return "X86ISD::FMINC";
17862 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
17863 case X86ISD::FRCP: return "X86ISD::FRCP";
17864 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
17865 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
17866 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
17867 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
17868 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
17869 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
17870 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
17871 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
17872 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
17873 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
17874 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
17875 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
17876 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
17877 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
17878 case X86ISD::VZEXT: return "X86ISD::VZEXT";
17879 case X86ISD::VSEXT: return "X86ISD::VSEXT";
17880 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
17881 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
17882 case X86ISD::VINSERT: return "X86ISD::VINSERT";
17883 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
17884 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
17885 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
17886 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
17887 case X86ISD::VSHL: return "X86ISD::VSHL";
17888 case X86ISD::VSRL: return "X86ISD::VSRL";
17889 case X86ISD::VSRA: return "X86ISD::VSRA";
17890 case X86ISD::VSHLI: return "X86ISD::VSHLI";
17891 case X86ISD::VSRLI: return "X86ISD::VSRLI";
17892 case X86ISD::VSRAI: return "X86ISD::VSRAI";
17893 case X86ISD::CMPP: return "X86ISD::CMPP";
17894 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
17895 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
17896 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
17897 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
17898 case X86ISD::ADD: return "X86ISD::ADD";
17899 case X86ISD::SUB: return "X86ISD::SUB";
17900 case X86ISD::ADC: return "X86ISD::ADC";
17901 case X86ISD::SBB: return "X86ISD::SBB";
17902 case X86ISD::SMUL: return "X86ISD::SMUL";
17903 case X86ISD::UMUL: return "X86ISD::UMUL";
17904 case X86ISD::INC: return "X86ISD::INC";
17905 case X86ISD::DEC: return "X86ISD::DEC";
17906 case X86ISD::OR: return "X86ISD::OR";
17907 case X86ISD::XOR: return "X86ISD::XOR";
17908 case X86ISD::AND: return "X86ISD::AND";
17909 case X86ISD::BEXTR: return "X86ISD::BEXTR";
17910 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
17911 case X86ISD::PTEST: return "X86ISD::PTEST";
17912 case X86ISD::TESTP: return "X86ISD::TESTP";
17913 case X86ISD::TESTM: return "X86ISD::TESTM";
17914 case X86ISD::TESTNM: return "X86ISD::TESTNM";
17915 case X86ISD::KORTEST: return "X86ISD::KORTEST";
17916 case X86ISD::PACKSS: return "X86ISD::PACKSS";
17917 case X86ISD::PACKUS: return "X86ISD::PACKUS";
17918 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
17919 case X86ISD::VALIGN: return "X86ISD::VALIGN";
17920 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
17921 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
17922 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
17923 case X86ISD::SHUFP: return "X86ISD::SHUFP";
17924 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
17925 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
17926 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
17927 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
17928 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
17929 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
17930 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
17931 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
17932 case X86ISD::MOVSD: return "X86ISD::MOVSD";
17933 case X86ISD::MOVSS: return "X86ISD::MOVSS";
17934 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
17935 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
17936 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
17937 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
17938 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
17939 case X86ISD::VPERMILP: return "X86ISD::VPERMILP";
17940 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
17941 case X86ISD::VPERMV: return "X86ISD::VPERMV";
17942 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
17943 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
17944 case X86ISD::VPERMI: return "X86ISD::VPERMI";
17945 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
17946 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
17947 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
17948 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
17949 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
17950 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
17951 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
17952 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
17953 case X86ISD::SAHF: return "X86ISD::SAHF";
17954 case X86ISD::RDRAND: return "X86ISD::RDRAND";
17955 case X86ISD::RDSEED: return "X86ISD::RDSEED";
17956 case X86ISD::FMADD: return "X86ISD::FMADD";
17957 case X86ISD::FMSUB: return "X86ISD::FMSUB";
17958 case X86ISD::FNMADD: return "X86ISD::FNMADD";
17959 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
17960 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
17961 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
17962 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
17963 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
17964 case X86ISD::XTEST: return "X86ISD::XTEST";
17968 // isLegalAddressingMode - Return true if the addressing mode represented
17969 // by AM is legal for this target, for a load/store of the specified type.
17970 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
17972 // X86 supports extremely general addressing modes.
17973 CodeModel::Model M = getTargetMachine().getCodeModel();
17974 Reloc::Model R = getTargetMachine().getRelocationModel();
17976 // X86 allows a sign-extended 32-bit immediate field as a displacement.
17977 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
17982 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
17984 // If a reference to this global requires an extra load, we can't fold it.
17985 if (isGlobalStubReference(GVFlags))
17988 // If BaseGV requires a register for the PIC base, we cannot also have a
17989 // BaseReg specified.
17990 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
17993 // If lower 4G is not available, then we must use rip-relative addressing.
17994 if ((M != CodeModel::Small || R != Reloc::Static) &&
17995 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
17999 switch (AM.Scale) {
18005 // These scales always work.
18010 // These scales are formed with basereg+scalereg. Only accept if there is
18015 default: // Other stuff never works.
18022 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
18023 unsigned Bits = Ty->getScalarSizeInBits();
18025 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
18026 // particularly cheaper than those without.
18030 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
18031 // variable shifts just as cheap as scalar ones.
18032 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
18035 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
18036 // fully general vector.
18040 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
18041 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18043 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
18044 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
18045 return NumBits1 > NumBits2;
18048 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
18049 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
18052 if (!isTypeLegal(EVT::getEVT(Ty1)))
18055 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
18057 // Assuming the caller doesn't have a zeroext or signext return parameter,
18058 // truncation all the way down to i1 is valid.
18062 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
18063 return isInt<32>(Imm);
18066 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
18067 // Can also use sub to handle negated immediates.
18068 return isInt<32>(Imm);
18071 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
18072 if (!VT1.isInteger() || !VT2.isInteger())
18074 unsigned NumBits1 = VT1.getSizeInBits();
18075 unsigned NumBits2 = VT2.getSizeInBits();
18076 return NumBits1 > NumBits2;
18079 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
18080 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18081 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
18084 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
18085 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
18086 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
18089 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
18090 EVT VT1 = Val.getValueType();
18091 if (isZExtFree(VT1, VT2))
18094 if (Val.getOpcode() != ISD::LOAD)
18097 if (!VT1.isSimple() || !VT1.isInteger() ||
18098 !VT2.isSimple() || !VT2.isInteger())
18101 switch (VT1.getSimpleVT().SimpleTy) {
18106 // X86 has 8, 16, and 32-bit zero-extending loads.
18114 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
18115 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
18118 VT = VT.getScalarType();
18120 if (!VT.isSimple())
18123 switch (VT.getSimpleVT().SimpleTy) {
18134 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
18135 // i16 instructions are longer (0x66 prefix) and potentially slower.
18136 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
18139 /// isShuffleMaskLegal - Targets can use this to indicate that they only
18140 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
18141 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
18142 /// are assumed to be legal.
18144 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
18146 if (!VT.isSimple())
18149 MVT SVT = VT.getSimpleVT();
18151 // Very little shuffling can be done for 64-bit vectors right now.
18152 if (VT.getSizeInBits() == 64)
18155 // If this is a single-input shuffle with no 128 bit lane crossings we can
18156 // lower it into pshufb.
18157 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
18158 (SVT.is256BitVector() && Subtarget->hasInt256())) {
18159 bool isLegal = true;
18160 for (unsigned I = 0, E = M.size(); I != E; ++I) {
18161 if (M[I] >= (int)SVT.getVectorNumElements() ||
18162 ShuffleCrosses128bitLane(SVT, I, M[I])) {
18171 // FIXME: blends, shifts.
18172 return (SVT.getVectorNumElements() == 2 ||
18173 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
18174 isMOVLMask(M, SVT) ||
18175 isMOVHLPSMask(M, SVT) ||
18176 isSHUFPMask(M, SVT) ||
18177 isPSHUFDMask(M, SVT) ||
18178 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
18179 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
18180 isPALIGNRMask(M, SVT, Subtarget) ||
18181 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
18182 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
18183 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18184 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
18185 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
18189 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
18191 if (!VT.isSimple())
18194 MVT SVT = VT.getSimpleVT();
18195 unsigned NumElts = SVT.getVectorNumElements();
18196 // FIXME: This collection of masks seems suspect.
18199 if (NumElts == 4 && SVT.is128BitVector()) {
18200 return (isMOVLMask(Mask, SVT) ||
18201 isCommutedMOVLMask(Mask, SVT, true) ||
18202 isSHUFPMask(Mask, SVT) ||
18203 isSHUFPMask(Mask, SVT, /* Commuted */ true));
18208 //===----------------------------------------------------------------------===//
18209 // X86 Scheduler Hooks
18210 //===----------------------------------------------------------------------===//
18212 /// Utility function to emit xbegin specifying the start of an RTM region.
18213 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
18214 const TargetInstrInfo *TII) {
18215 DebugLoc DL = MI->getDebugLoc();
18217 const BasicBlock *BB = MBB->getBasicBlock();
18218 MachineFunction::iterator I = MBB;
18221 // For the v = xbegin(), we generate
18232 MachineBasicBlock *thisMBB = MBB;
18233 MachineFunction *MF = MBB->getParent();
18234 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
18235 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
18236 MF->insert(I, mainMBB);
18237 MF->insert(I, sinkMBB);
18239 // Transfer the remainder of BB and its successor edges to sinkMBB.
18240 sinkMBB->splice(sinkMBB->begin(), MBB,
18241 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18242 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
18246 // # fallthrough to mainMBB
18247 // # abortion to sinkMBB
18248 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
18249 thisMBB->addSuccessor(mainMBB);
18250 thisMBB->addSuccessor(sinkMBB);
18254 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
18255 mainMBB->addSuccessor(sinkMBB);
18258 // EAX is live into the sinkMBB
18259 sinkMBB->addLiveIn(X86::EAX);
18260 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18261 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18264 MI->eraseFromParent();
18268 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
18269 // or XMM0_V32I8 in AVX all of this code can be replaced with that
18270 // in the .td file.
18271 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
18272 const TargetInstrInfo *TII) {
18274 switch (MI->getOpcode()) {
18275 default: llvm_unreachable("illegal opcode!");
18276 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
18277 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
18278 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
18279 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
18280 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
18281 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
18282 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
18283 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
18286 DebugLoc dl = MI->getDebugLoc();
18287 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18289 unsigned NumArgs = MI->getNumOperands();
18290 for (unsigned i = 1; i < NumArgs; ++i) {
18291 MachineOperand &Op = MI->getOperand(i);
18292 if (!(Op.isReg() && Op.isImplicit()))
18293 MIB.addOperand(Op);
18295 if (MI->hasOneMemOperand())
18296 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18298 BuildMI(*BB, MI, dl,
18299 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18300 .addReg(X86::XMM0);
18302 MI->eraseFromParent();
18306 // FIXME: Custom handling because TableGen doesn't support multiple implicit
18307 // defs in an instruction pattern
18308 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
18309 const TargetInstrInfo *TII) {
18311 switch (MI->getOpcode()) {
18312 default: llvm_unreachable("illegal opcode!");
18313 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
18314 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
18315 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
18316 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
18317 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
18318 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
18319 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
18320 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
18323 DebugLoc dl = MI->getDebugLoc();
18324 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
18326 unsigned NumArgs = MI->getNumOperands(); // remove the results
18327 for (unsigned i = 1; i < NumArgs; ++i) {
18328 MachineOperand &Op = MI->getOperand(i);
18329 if (!(Op.isReg() && Op.isImplicit()))
18330 MIB.addOperand(Op);
18332 if (MI->hasOneMemOperand())
18333 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
18335 BuildMI(*BB, MI, dl,
18336 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
18339 MI->eraseFromParent();
18343 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
18344 const TargetInstrInfo *TII,
18345 const X86Subtarget* Subtarget) {
18346 DebugLoc dl = MI->getDebugLoc();
18348 // Address into RAX/EAX, other two args into ECX, EDX.
18349 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
18350 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
18351 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
18352 for (int i = 0; i < X86::AddrNumOperands; ++i)
18353 MIB.addOperand(MI->getOperand(i));
18355 unsigned ValOps = X86::AddrNumOperands;
18356 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
18357 .addReg(MI->getOperand(ValOps).getReg());
18358 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
18359 .addReg(MI->getOperand(ValOps+1).getReg());
18361 // The instruction doesn't actually take any operands though.
18362 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
18364 MI->eraseFromParent(); // The pseudo is gone now.
18368 MachineBasicBlock *
18369 X86TargetLowering::EmitVAARG64WithCustomInserter(
18371 MachineBasicBlock *MBB) const {
18372 // Emit va_arg instruction on X86-64.
18374 // Operands to this pseudo-instruction:
18375 // 0 ) Output : destination address (reg)
18376 // 1-5) Input : va_list address (addr, i64mem)
18377 // 6 ) ArgSize : Size (in bytes) of vararg type
18378 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
18379 // 8 ) Align : Alignment of type
18380 // 9 ) EFLAGS (implicit-def)
18382 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
18383 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
18385 unsigned DestReg = MI->getOperand(0).getReg();
18386 MachineOperand &Base = MI->getOperand(1);
18387 MachineOperand &Scale = MI->getOperand(2);
18388 MachineOperand &Index = MI->getOperand(3);
18389 MachineOperand &Disp = MI->getOperand(4);
18390 MachineOperand &Segment = MI->getOperand(5);
18391 unsigned ArgSize = MI->getOperand(6).getImm();
18392 unsigned ArgMode = MI->getOperand(7).getImm();
18393 unsigned Align = MI->getOperand(8).getImm();
18395 // Memory Reference
18396 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
18397 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
18398 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
18400 // Machine Information
18401 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18402 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
18403 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
18404 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
18405 DebugLoc DL = MI->getDebugLoc();
18407 // struct va_list {
18410 // i64 overflow_area (address)
18411 // i64 reg_save_area (address)
18413 // sizeof(va_list) = 24
18414 // alignment(va_list) = 8
18416 unsigned TotalNumIntRegs = 6;
18417 unsigned TotalNumXMMRegs = 8;
18418 bool UseGPOffset = (ArgMode == 1);
18419 bool UseFPOffset = (ArgMode == 2);
18420 unsigned MaxOffset = TotalNumIntRegs * 8 +
18421 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
18423 /* Align ArgSize to a multiple of 8 */
18424 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
18425 bool NeedsAlign = (Align > 8);
18427 MachineBasicBlock *thisMBB = MBB;
18428 MachineBasicBlock *overflowMBB;
18429 MachineBasicBlock *offsetMBB;
18430 MachineBasicBlock *endMBB;
18432 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
18433 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
18434 unsigned OffsetReg = 0;
18436 if (!UseGPOffset && !UseFPOffset) {
18437 // If we only pull from the overflow region, we don't create a branch.
18438 // We don't need to alter control flow.
18439 OffsetDestReg = 0; // unused
18440 OverflowDestReg = DestReg;
18442 offsetMBB = nullptr;
18443 overflowMBB = thisMBB;
18446 // First emit code to check if gp_offset (or fp_offset) is below the bound.
18447 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
18448 // If not, pull from overflow_area. (branch to overflowMBB)
18453 // offsetMBB overflowMBB
18458 // Registers for the PHI in endMBB
18459 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
18460 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
18462 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18463 MachineFunction *MF = MBB->getParent();
18464 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18465 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18466 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18468 MachineFunction::iterator MBBIter = MBB;
18471 // Insert the new basic blocks
18472 MF->insert(MBBIter, offsetMBB);
18473 MF->insert(MBBIter, overflowMBB);
18474 MF->insert(MBBIter, endMBB);
18476 // Transfer the remainder of MBB and its successor edges to endMBB.
18477 endMBB->splice(endMBB->begin(), thisMBB,
18478 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
18479 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
18481 // Make offsetMBB and overflowMBB successors of thisMBB
18482 thisMBB->addSuccessor(offsetMBB);
18483 thisMBB->addSuccessor(overflowMBB);
18485 // endMBB is a successor of both offsetMBB and overflowMBB
18486 offsetMBB->addSuccessor(endMBB);
18487 overflowMBB->addSuccessor(endMBB);
18489 // Load the offset value into a register
18490 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18491 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
18495 .addDisp(Disp, UseFPOffset ? 4 : 0)
18496 .addOperand(Segment)
18497 .setMemRefs(MMOBegin, MMOEnd);
18499 // Check if there is enough room left to pull this argument.
18500 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
18502 .addImm(MaxOffset + 8 - ArgSizeA8);
18504 // Branch to "overflowMBB" if offset >= max
18505 // Fall through to "offsetMBB" otherwise
18506 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
18507 .addMBB(overflowMBB);
18510 // In offsetMBB, emit code to use the reg_save_area.
18512 assert(OffsetReg != 0);
18514 // Read the reg_save_area address.
18515 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
18516 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
18521 .addOperand(Segment)
18522 .setMemRefs(MMOBegin, MMOEnd);
18524 // Zero-extend the offset
18525 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
18526 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
18529 .addImm(X86::sub_32bit);
18531 // Add the offset to the reg_save_area to get the final address.
18532 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
18533 .addReg(OffsetReg64)
18534 .addReg(RegSaveReg);
18536 // Compute the offset for the next argument
18537 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
18538 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
18540 .addImm(UseFPOffset ? 16 : 8);
18542 // Store it back into the va_list.
18543 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
18547 .addDisp(Disp, UseFPOffset ? 4 : 0)
18548 .addOperand(Segment)
18549 .addReg(NextOffsetReg)
18550 .setMemRefs(MMOBegin, MMOEnd);
18553 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
18558 // Emit code to use overflow area
18561 // Load the overflow_area address into a register.
18562 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
18563 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
18568 .addOperand(Segment)
18569 .setMemRefs(MMOBegin, MMOEnd);
18571 // If we need to align it, do so. Otherwise, just copy the address
18572 // to OverflowDestReg.
18574 // Align the overflow address
18575 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
18576 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
18578 // aligned_addr = (addr + (align-1)) & ~(align-1)
18579 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
18580 .addReg(OverflowAddrReg)
18583 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
18585 .addImm(~(uint64_t)(Align-1));
18587 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
18588 .addReg(OverflowAddrReg);
18591 // Compute the next overflow address after this argument.
18592 // (the overflow address should be kept 8-byte aligned)
18593 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
18594 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
18595 .addReg(OverflowDestReg)
18596 .addImm(ArgSizeA8);
18598 // Store the new overflow address.
18599 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
18604 .addOperand(Segment)
18605 .addReg(NextAddrReg)
18606 .setMemRefs(MMOBegin, MMOEnd);
18608 // If we branched, emit the PHI to the front of endMBB.
18610 BuildMI(*endMBB, endMBB->begin(), DL,
18611 TII->get(X86::PHI), DestReg)
18612 .addReg(OffsetDestReg).addMBB(offsetMBB)
18613 .addReg(OverflowDestReg).addMBB(overflowMBB);
18616 // Erase the pseudo instruction
18617 MI->eraseFromParent();
18622 MachineBasicBlock *
18623 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
18625 MachineBasicBlock *MBB) const {
18626 // Emit code to save XMM registers to the stack. The ABI says that the
18627 // number of registers to save is given in %al, so it's theoretically
18628 // possible to do an indirect jump trick to avoid saving all of them,
18629 // however this code takes a simpler approach and just executes all
18630 // of the stores if %al is non-zero. It's less code, and it's probably
18631 // easier on the hardware branch predictor, and stores aren't all that
18632 // expensive anyway.
18634 // Create the new basic blocks. One block contains all the XMM stores,
18635 // and one block is the final destination regardless of whether any
18636 // stores were performed.
18637 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
18638 MachineFunction *F = MBB->getParent();
18639 MachineFunction::iterator MBBIter = MBB;
18641 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
18642 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
18643 F->insert(MBBIter, XMMSaveMBB);
18644 F->insert(MBBIter, EndMBB);
18646 // Transfer the remainder of MBB and its successor edges to EndMBB.
18647 EndMBB->splice(EndMBB->begin(), MBB,
18648 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
18649 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
18651 // The original block will now fall through to the XMM save block.
18652 MBB->addSuccessor(XMMSaveMBB);
18653 // The XMMSaveMBB will fall through to the end block.
18654 XMMSaveMBB->addSuccessor(EndMBB);
18656 // Now add the instructions.
18657 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
18658 DebugLoc DL = MI->getDebugLoc();
18660 unsigned CountReg = MI->getOperand(0).getReg();
18661 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
18662 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
18664 if (!Subtarget->isTargetWin64()) {
18665 // If %al is 0, branch around the XMM save block.
18666 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
18667 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
18668 MBB->addSuccessor(EndMBB);
18671 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
18672 // that was just emitted, but clearly shouldn't be "saved".
18673 assert((MI->getNumOperands() <= 3 ||
18674 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
18675 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
18676 && "Expected last argument to be EFLAGS");
18677 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
18678 // In the XMM save block, save all the XMM argument registers.
18679 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
18680 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
18681 MachineMemOperand *MMO =
18682 F->getMachineMemOperand(
18683 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
18684 MachineMemOperand::MOStore,
18685 /*Size=*/16, /*Align=*/16);
18686 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
18687 .addFrameIndex(RegSaveFrameIndex)
18688 .addImm(/*Scale=*/1)
18689 .addReg(/*IndexReg=*/0)
18690 .addImm(/*Disp=*/Offset)
18691 .addReg(/*Segment=*/0)
18692 .addReg(MI->getOperand(i).getReg())
18693 .addMemOperand(MMO);
18696 MI->eraseFromParent(); // The pseudo instruction is gone now.
18701 // The EFLAGS operand of SelectItr might be missing a kill marker
18702 // because there were multiple uses of EFLAGS, and ISel didn't know
18703 // which to mark. Figure out whether SelectItr should have had a
18704 // kill marker, and set it if it should. Returns the correct kill
18706 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
18707 MachineBasicBlock* BB,
18708 const TargetRegisterInfo* TRI) {
18709 // Scan forward through BB for a use/def of EFLAGS.
18710 MachineBasicBlock::iterator miI(std::next(SelectItr));
18711 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
18712 const MachineInstr& mi = *miI;
18713 if (mi.readsRegister(X86::EFLAGS))
18715 if (mi.definesRegister(X86::EFLAGS))
18716 break; // Should have kill-flag - update below.
18719 // If we hit the end of the block, check whether EFLAGS is live into a
18721 if (miI == BB->end()) {
18722 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
18723 sEnd = BB->succ_end();
18724 sItr != sEnd; ++sItr) {
18725 MachineBasicBlock* succ = *sItr;
18726 if (succ->isLiveIn(X86::EFLAGS))
18731 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
18732 // out. SelectMI should have a kill flag on EFLAGS.
18733 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
18737 MachineBasicBlock *
18738 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
18739 MachineBasicBlock *BB) const {
18740 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18741 DebugLoc DL = MI->getDebugLoc();
18743 // To "insert" a SELECT_CC instruction, we actually have to insert the
18744 // diamond control-flow pattern. The incoming instruction knows the
18745 // destination vreg to set, the condition code register to branch on, the
18746 // true/false values to select between, and a branch opcode to use.
18747 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18748 MachineFunction::iterator It = BB;
18754 // cmpTY ccX, r1, r2
18756 // fallthrough --> copy0MBB
18757 MachineBasicBlock *thisMBB = BB;
18758 MachineFunction *F = BB->getParent();
18759 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
18760 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
18761 F->insert(It, copy0MBB);
18762 F->insert(It, sinkMBB);
18764 // If the EFLAGS register isn't dead in the terminator, then claim that it's
18765 // live into the sink and copy blocks.
18766 const TargetRegisterInfo *TRI =
18767 BB->getParent()->getSubtarget().getRegisterInfo();
18768 if (!MI->killsRegister(X86::EFLAGS) &&
18769 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
18770 copy0MBB->addLiveIn(X86::EFLAGS);
18771 sinkMBB->addLiveIn(X86::EFLAGS);
18774 // Transfer the remainder of BB and its successor edges to sinkMBB.
18775 sinkMBB->splice(sinkMBB->begin(), BB,
18776 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18777 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
18779 // Add the true and fallthrough blocks as its successors.
18780 BB->addSuccessor(copy0MBB);
18781 BB->addSuccessor(sinkMBB);
18783 // Create the conditional branch instruction.
18785 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
18786 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
18789 // %FalseValue = ...
18790 // # fallthrough to sinkMBB
18791 copy0MBB->addSuccessor(sinkMBB);
18794 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
18796 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
18797 TII->get(X86::PHI), MI->getOperand(0).getReg())
18798 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
18799 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
18801 MI->eraseFromParent(); // The pseudo instruction is gone now.
18805 MachineBasicBlock *
18806 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI, MachineBasicBlock *BB,
18807 bool Is64Bit) const {
18808 MachineFunction *MF = BB->getParent();
18809 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
18810 DebugLoc DL = MI->getDebugLoc();
18811 const BasicBlock *LLVM_BB = BB->getBasicBlock();
18813 assert(MF->shouldSplitStack());
18815 unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
18816 unsigned TlsOffset = Is64Bit ? 0x70 : 0x30;
18819 // ... [Till the alloca]
18820 // If stacklet is not large enough, jump to mallocMBB
18823 // Allocate by subtracting from RSP
18824 // Jump to continueMBB
18827 // Allocate by call to runtime
18831 // [rest of original BB]
18834 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18835 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18836 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
18838 MachineRegisterInfo &MRI = MF->getRegInfo();
18839 const TargetRegisterClass *AddrRegClass =
18840 getRegClassFor(Is64Bit ? MVT::i64:MVT::i32);
18842 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18843 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
18844 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
18845 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
18846 sizeVReg = MI->getOperand(1).getReg(),
18847 physSPReg = Is64Bit ? X86::RSP : X86::ESP;
18849 MachineFunction::iterator MBBIter = BB;
18852 MF->insert(MBBIter, bumpMBB);
18853 MF->insert(MBBIter, mallocMBB);
18854 MF->insert(MBBIter, continueMBB);
18856 continueMBB->splice(continueMBB->begin(), BB,
18857 std::next(MachineBasicBlock::iterator(MI)), BB->end());
18858 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
18860 // Add code to the main basic block to check if the stack limit has been hit,
18861 // and if so, jump to mallocMBB otherwise to bumpMBB.
18862 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
18863 BuildMI(BB, DL, TII->get(Is64Bit ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
18864 .addReg(tmpSPVReg).addReg(sizeVReg);
18865 BuildMI(BB, DL, TII->get(Is64Bit ? X86::CMP64mr:X86::CMP32mr))
18866 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
18867 .addReg(SPLimitVReg);
18868 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
18870 // bumpMBB simply decreases the stack pointer, since we know the current
18871 // stacklet has enough space.
18872 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
18873 .addReg(SPLimitVReg);
18874 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
18875 .addReg(SPLimitVReg);
18876 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18878 // Calls into a routine in libgcc to allocate more space from the heap.
18879 const uint32_t *RegMask = MF->getTarget()
18880 .getSubtargetImpl()
18881 ->getRegisterInfo()
18882 ->getCallPreservedMask(CallingConv::C);
18884 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
18886 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
18887 .addExternalSymbol("__morestack_allocate_stack_space")
18888 .addRegMask(RegMask)
18889 .addReg(X86::RDI, RegState::Implicit)
18890 .addReg(X86::RAX, RegState::ImplicitDefine);
18892 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
18894 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
18895 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
18896 .addExternalSymbol("__morestack_allocate_stack_space")
18897 .addRegMask(RegMask)
18898 .addReg(X86::EAX, RegState::ImplicitDefine);
18902 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
18905 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
18906 .addReg(Is64Bit ? X86::RAX : X86::EAX);
18907 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
18909 // Set up the CFG correctly.
18910 BB->addSuccessor(bumpMBB);
18911 BB->addSuccessor(mallocMBB);
18912 mallocMBB->addSuccessor(continueMBB);
18913 bumpMBB->addSuccessor(continueMBB);
18915 // Take care of the PHI nodes.
18916 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
18917 MI->getOperand(0).getReg())
18918 .addReg(mallocPtrVReg).addMBB(mallocMBB)
18919 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
18921 // Delete the original pseudo instruction.
18922 MI->eraseFromParent();
18925 return continueMBB;
18928 MachineBasicBlock *
18929 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
18930 MachineBasicBlock *BB) const {
18931 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
18932 DebugLoc DL = MI->getDebugLoc();
18934 assert(!Subtarget->isTargetMacho());
18936 // The lowering is pretty easy: we're just emitting the call to _alloca. The
18937 // non-trivial part is impdef of ESP.
18939 if (Subtarget->isTargetWin64()) {
18940 if (Subtarget->isTargetCygMing()) {
18941 // ___chkstk(Mingw64):
18942 // Clobbers R10, R11, RAX and EFLAGS.
18944 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18945 .addExternalSymbol("___chkstk")
18946 .addReg(X86::RAX, RegState::Implicit)
18947 .addReg(X86::RSP, RegState::Implicit)
18948 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
18949 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
18950 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18952 // __chkstk(MSVCRT): does not update stack pointer.
18953 // Clobbers R10, R11 and EFLAGS.
18954 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
18955 .addExternalSymbol("__chkstk")
18956 .addReg(X86::RAX, RegState::Implicit)
18957 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18958 // RAX has the offset to be subtracted from RSP.
18959 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
18964 const char *StackProbeSymbol =
18965 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
18967 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
18968 .addExternalSymbol(StackProbeSymbol)
18969 .addReg(X86::EAX, RegState::Implicit)
18970 .addReg(X86::ESP, RegState::Implicit)
18971 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
18972 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
18973 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
18976 MI->eraseFromParent(); // The pseudo instruction is gone now.
18980 MachineBasicBlock *
18981 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
18982 MachineBasicBlock *BB) const {
18983 // This is pretty easy. We're taking the value that we received from
18984 // our load from the relocation, sticking it in either RDI (x86-64)
18985 // or EAX and doing an indirect call. The return value will then
18986 // be in the normal return register.
18987 MachineFunction *F = BB->getParent();
18988 const X86InstrInfo *TII =
18989 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
18990 DebugLoc DL = MI->getDebugLoc();
18992 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
18993 assert(MI->getOperand(3).isGlobal() && "This should be a global");
18995 // Get a register mask for the lowered call.
18996 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
18997 // proper register mask.
18998 const uint32_t *RegMask = F->getTarget()
18999 .getSubtargetImpl()
19000 ->getRegisterInfo()
19001 ->getCallPreservedMask(CallingConv::C);
19002 if (Subtarget->is64Bit()) {
19003 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19004 TII->get(X86::MOV64rm), X86::RDI)
19006 .addImm(0).addReg(0)
19007 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19008 MI->getOperand(3).getTargetFlags())
19010 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
19011 addDirectMem(MIB, X86::RDI);
19012 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
19013 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
19014 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19015 TII->get(X86::MOV32rm), X86::EAX)
19017 .addImm(0).addReg(0)
19018 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19019 MI->getOperand(3).getTargetFlags())
19021 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19022 addDirectMem(MIB, X86::EAX);
19023 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19025 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
19026 TII->get(X86::MOV32rm), X86::EAX)
19027 .addReg(TII->getGlobalBaseReg(F))
19028 .addImm(0).addReg(0)
19029 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
19030 MI->getOperand(3).getTargetFlags())
19032 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
19033 addDirectMem(MIB, X86::EAX);
19034 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
19037 MI->eraseFromParent(); // The pseudo instruction is gone now.
19041 MachineBasicBlock *
19042 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
19043 MachineBasicBlock *MBB) const {
19044 DebugLoc DL = MI->getDebugLoc();
19045 MachineFunction *MF = MBB->getParent();
19046 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19047 MachineRegisterInfo &MRI = MF->getRegInfo();
19049 const BasicBlock *BB = MBB->getBasicBlock();
19050 MachineFunction::iterator I = MBB;
19053 // Memory Reference
19054 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19055 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19058 unsigned MemOpndSlot = 0;
19060 unsigned CurOp = 0;
19062 DstReg = MI->getOperand(CurOp++).getReg();
19063 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
19064 assert(RC->hasType(MVT::i32) && "Invalid destination!");
19065 unsigned mainDstReg = MRI.createVirtualRegister(RC);
19066 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
19068 MemOpndSlot = CurOp;
19070 MVT PVT = getPointerTy();
19071 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19072 "Invalid Pointer Size!");
19074 // For v = setjmp(buf), we generate
19077 // buf[LabelOffset] = restoreMBB
19078 // SjLjSetup restoreMBB
19084 // v = phi(main, restore)
19089 MachineBasicBlock *thisMBB = MBB;
19090 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19091 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19092 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
19093 MF->insert(I, mainMBB);
19094 MF->insert(I, sinkMBB);
19095 MF->push_back(restoreMBB);
19097 MachineInstrBuilder MIB;
19099 // Transfer the remainder of BB and its successor edges to sinkMBB.
19100 sinkMBB->splice(sinkMBB->begin(), MBB,
19101 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19102 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19105 unsigned PtrStoreOpc = 0;
19106 unsigned LabelReg = 0;
19107 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19108 Reloc::Model RM = MF->getTarget().getRelocationModel();
19109 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
19110 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
19112 // Prepare IP either in reg or imm.
19113 if (!UseImmLabel) {
19114 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
19115 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
19116 LabelReg = MRI.createVirtualRegister(PtrRC);
19117 if (Subtarget->is64Bit()) {
19118 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
19122 .addMBB(restoreMBB)
19125 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
19126 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
19127 .addReg(XII->getGlobalBaseReg(MF))
19130 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
19134 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
19136 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
19137 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19138 if (i == X86::AddrDisp)
19139 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
19141 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
19144 MIB.addReg(LabelReg);
19146 MIB.addMBB(restoreMBB);
19147 MIB.setMemRefs(MMOBegin, MMOEnd);
19149 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
19150 .addMBB(restoreMBB);
19152 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19153 MF->getSubtarget().getRegisterInfo());
19154 MIB.addRegMask(RegInfo->getNoPreservedMask());
19155 thisMBB->addSuccessor(mainMBB);
19156 thisMBB->addSuccessor(restoreMBB);
19160 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
19161 mainMBB->addSuccessor(sinkMBB);
19164 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19165 TII->get(X86::PHI), DstReg)
19166 .addReg(mainDstReg).addMBB(mainMBB)
19167 .addReg(restoreDstReg).addMBB(restoreMBB);
19170 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
19171 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
19172 restoreMBB->addSuccessor(sinkMBB);
19174 MI->eraseFromParent();
19178 MachineBasicBlock *
19179 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
19180 MachineBasicBlock *MBB) const {
19181 DebugLoc DL = MI->getDebugLoc();
19182 MachineFunction *MF = MBB->getParent();
19183 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19184 MachineRegisterInfo &MRI = MF->getRegInfo();
19186 // Memory Reference
19187 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19188 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19190 MVT PVT = getPointerTy();
19191 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
19192 "Invalid Pointer Size!");
19194 const TargetRegisterClass *RC =
19195 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
19196 unsigned Tmp = MRI.createVirtualRegister(RC);
19197 // Since FP is only updated here but NOT referenced, it's treated as GPR.
19198 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
19199 MF->getSubtarget().getRegisterInfo());
19200 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
19201 unsigned SP = RegInfo->getStackRegister();
19203 MachineInstrBuilder MIB;
19205 const int64_t LabelOffset = 1 * PVT.getStoreSize();
19206 const int64_t SPOffset = 2 * PVT.getStoreSize();
19208 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
19209 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
19212 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
19213 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
19214 MIB.addOperand(MI->getOperand(i));
19215 MIB.setMemRefs(MMOBegin, MMOEnd);
19217 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
19218 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19219 if (i == X86::AddrDisp)
19220 MIB.addDisp(MI->getOperand(i), LabelOffset);
19222 MIB.addOperand(MI->getOperand(i));
19224 MIB.setMemRefs(MMOBegin, MMOEnd);
19226 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
19227 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
19228 if (i == X86::AddrDisp)
19229 MIB.addDisp(MI->getOperand(i), SPOffset);
19231 MIB.addOperand(MI->getOperand(i));
19233 MIB.setMemRefs(MMOBegin, MMOEnd);
19235 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
19237 MI->eraseFromParent();
19241 // Replace 213-type (isel default) FMA3 instructions with 231-type for
19242 // accumulator loops. Writing back to the accumulator allows the coalescer
19243 // to remove extra copies in the loop.
19244 MachineBasicBlock *
19245 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
19246 MachineBasicBlock *MBB) const {
19247 MachineOperand &AddendOp = MI->getOperand(3);
19249 // Bail out early if the addend isn't a register - we can't switch these.
19250 if (!AddendOp.isReg())
19253 MachineFunction &MF = *MBB->getParent();
19254 MachineRegisterInfo &MRI = MF.getRegInfo();
19256 // Check whether the addend is defined by a PHI:
19257 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
19258 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
19259 if (!AddendDef.isPHI())
19262 // Look for the following pattern:
19264 // %addend = phi [%entry, 0], [%loop, %result]
19266 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
19270 // %addend = phi [%entry, 0], [%loop, %result]
19272 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
19274 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
19275 assert(AddendDef.getOperand(i).isReg());
19276 MachineOperand PHISrcOp = AddendDef.getOperand(i);
19277 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
19278 if (&PHISrcInst == MI) {
19279 // Found a matching instruction.
19280 unsigned NewFMAOpc = 0;
19281 switch (MI->getOpcode()) {
19282 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
19283 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
19284 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
19285 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
19286 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
19287 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
19288 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
19289 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
19290 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
19291 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
19292 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
19293 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
19294 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
19295 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
19296 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
19297 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
19298 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
19299 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
19300 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
19301 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
19302 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
19303 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
19304 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
19305 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
19306 default: llvm_unreachable("Unrecognized FMA variant.");
19309 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
19310 MachineInstrBuilder MIB =
19311 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
19312 .addOperand(MI->getOperand(0))
19313 .addOperand(MI->getOperand(3))
19314 .addOperand(MI->getOperand(2))
19315 .addOperand(MI->getOperand(1));
19316 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
19317 MI->eraseFromParent();
19324 MachineBasicBlock *
19325 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
19326 MachineBasicBlock *BB) const {
19327 switch (MI->getOpcode()) {
19328 default: llvm_unreachable("Unexpected instr type to insert");
19329 case X86::TAILJMPd64:
19330 case X86::TAILJMPr64:
19331 case X86::TAILJMPm64:
19332 llvm_unreachable("TAILJMP64 would not be touched here.");
19333 case X86::TCRETURNdi64:
19334 case X86::TCRETURNri64:
19335 case X86::TCRETURNmi64:
19337 case X86::WIN_ALLOCA:
19338 return EmitLoweredWinAlloca(MI, BB);
19339 case X86::SEG_ALLOCA_32:
19340 return EmitLoweredSegAlloca(MI, BB, false);
19341 case X86::SEG_ALLOCA_64:
19342 return EmitLoweredSegAlloca(MI, BB, true);
19343 case X86::TLSCall_32:
19344 case X86::TLSCall_64:
19345 return EmitLoweredTLSCall(MI, BB);
19346 case X86::CMOV_GR8:
19347 case X86::CMOV_FR32:
19348 case X86::CMOV_FR64:
19349 case X86::CMOV_V4F32:
19350 case X86::CMOV_V2F64:
19351 case X86::CMOV_V2I64:
19352 case X86::CMOV_V8F32:
19353 case X86::CMOV_V4F64:
19354 case X86::CMOV_V4I64:
19355 case X86::CMOV_V16F32:
19356 case X86::CMOV_V8F64:
19357 case X86::CMOV_V8I64:
19358 case X86::CMOV_GR16:
19359 case X86::CMOV_GR32:
19360 case X86::CMOV_RFP32:
19361 case X86::CMOV_RFP64:
19362 case X86::CMOV_RFP80:
19363 return EmitLoweredSelect(MI, BB);
19365 case X86::FP32_TO_INT16_IN_MEM:
19366 case X86::FP32_TO_INT32_IN_MEM:
19367 case X86::FP32_TO_INT64_IN_MEM:
19368 case X86::FP64_TO_INT16_IN_MEM:
19369 case X86::FP64_TO_INT32_IN_MEM:
19370 case X86::FP64_TO_INT64_IN_MEM:
19371 case X86::FP80_TO_INT16_IN_MEM:
19372 case X86::FP80_TO_INT32_IN_MEM:
19373 case X86::FP80_TO_INT64_IN_MEM: {
19374 MachineFunction *F = BB->getParent();
19375 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
19376 DebugLoc DL = MI->getDebugLoc();
19378 // Change the floating point control register to use "round towards zero"
19379 // mode when truncating to an integer value.
19380 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
19381 addFrameReference(BuildMI(*BB, MI, DL,
19382 TII->get(X86::FNSTCW16m)), CWFrameIdx);
19384 // Load the old value of the high byte of the control word...
19386 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
19387 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
19390 // Set the high part to be round to zero...
19391 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
19394 // Reload the modified control word now...
19395 addFrameReference(BuildMI(*BB, MI, DL,
19396 TII->get(X86::FLDCW16m)), CWFrameIdx);
19398 // Restore the memory image of control word to original value
19399 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
19402 // Get the X86 opcode to use.
19404 switch (MI->getOpcode()) {
19405 default: llvm_unreachable("illegal opcode!");
19406 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
19407 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
19408 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
19409 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
19410 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
19411 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
19412 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
19413 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
19414 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
19418 MachineOperand &Op = MI->getOperand(0);
19420 AM.BaseType = X86AddressMode::RegBase;
19421 AM.Base.Reg = Op.getReg();
19423 AM.BaseType = X86AddressMode::FrameIndexBase;
19424 AM.Base.FrameIndex = Op.getIndex();
19426 Op = MI->getOperand(1);
19428 AM.Scale = Op.getImm();
19429 Op = MI->getOperand(2);
19431 AM.IndexReg = Op.getImm();
19432 Op = MI->getOperand(3);
19433 if (Op.isGlobal()) {
19434 AM.GV = Op.getGlobal();
19436 AM.Disp = Op.getImm();
19438 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
19439 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
19441 // Reload the original control word now.
19442 addFrameReference(BuildMI(*BB, MI, DL,
19443 TII->get(X86::FLDCW16m)), CWFrameIdx);
19445 MI->eraseFromParent(); // The pseudo instruction is gone now.
19448 // String/text processing lowering.
19449 case X86::PCMPISTRM128REG:
19450 case X86::VPCMPISTRM128REG:
19451 case X86::PCMPISTRM128MEM:
19452 case X86::VPCMPISTRM128MEM:
19453 case X86::PCMPESTRM128REG:
19454 case X86::VPCMPESTRM128REG:
19455 case X86::PCMPESTRM128MEM:
19456 case X86::VPCMPESTRM128MEM:
19457 assert(Subtarget->hasSSE42() &&
19458 "Target must have SSE4.2 or AVX features enabled");
19459 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19461 // String/text processing lowering.
19462 case X86::PCMPISTRIREG:
19463 case X86::VPCMPISTRIREG:
19464 case X86::PCMPISTRIMEM:
19465 case X86::VPCMPISTRIMEM:
19466 case X86::PCMPESTRIREG:
19467 case X86::VPCMPESTRIREG:
19468 case X86::PCMPESTRIMEM:
19469 case X86::VPCMPESTRIMEM:
19470 assert(Subtarget->hasSSE42() &&
19471 "Target must have SSE4.2 or AVX features enabled");
19472 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19474 // Thread synchronization.
19476 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
19481 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
19483 case X86::VASTART_SAVE_XMM_REGS:
19484 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
19486 case X86::VAARG_64:
19487 return EmitVAARG64WithCustomInserter(MI, BB);
19489 case X86::EH_SjLj_SetJmp32:
19490 case X86::EH_SjLj_SetJmp64:
19491 return emitEHSjLjSetJmp(MI, BB);
19493 case X86::EH_SjLj_LongJmp32:
19494 case X86::EH_SjLj_LongJmp64:
19495 return emitEHSjLjLongJmp(MI, BB);
19497 case TargetOpcode::STACKMAP:
19498 case TargetOpcode::PATCHPOINT:
19499 return emitPatchPoint(MI, BB);
19501 case X86::VFMADDPDr213r:
19502 case X86::VFMADDPSr213r:
19503 case X86::VFMADDSDr213r:
19504 case X86::VFMADDSSr213r:
19505 case X86::VFMSUBPDr213r:
19506 case X86::VFMSUBPSr213r:
19507 case X86::VFMSUBSDr213r:
19508 case X86::VFMSUBSSr213r:
19509 case X86::VFNMADDPDr213r:
19510 case X86::VFNMADDPSr213r:
19511 case X86::VFNMADDSDr213r:
19512 case X86::VFNMADDSSr213r:
19513 case X86::VFNMSUBPDr213r:
19514 case X86::VFNMSUBPSr213r:
19515 case X86::VFNMSUBSDr213r:
19516 case X86::VFNMSUBSSr213r:
19517 case X86::VFMADDPDr213rY:
19518 case X86::VFMADDPSr213rY:
19519 case X86::VFMSUBPDr213rY:
19520 case X86::VFMSUBPSr213rY:
19521 case X86::VFNMADDPDr213rY:
19522 case X86::VFNMADDPSr213rY:
19523 case X86::VFNMSUBPDr213rY:
19524 case X86::VFNMSUBPSr213rY:
19525 return emitFMA3Instr(MI, BB);
19529 //===----------------------------------------------------------------------===//
19530 // X86 Optimization Hooks
19531 //===----------------------------------------------------------------------===//
19533 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
19536 const SelectionDAG &DAG,
19537 unsigned Depth) const {
19538 unsigned BitWidth = KnownZero.getBitWidth();
19539 unsigned Opc = Op.getOpcode();
19540 assert((Opc >= ISD::BUILTIN_OP_END ||
19541 Opc == ISD::INTRINSIC_WO_CHAIN ||
19542 Opc == ISD::INTRINSIC_W_CHAIN ||
19543 Opc == ISD::INTRINSIC_VOID) &&
19544 "Should use MaskedValueIsZero if you don't know whether Op"
19545 " is a target node!");
19547 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
19561 // These nodes' second result is a boolean.
19562 if (Op.getResNo() == 0)
19565 case X86ISD::SETCC:
19566 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
19568 case ISD::INTRINSIC_WO_CHAIN: {
19569 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
19570 unsigned NumLoBits = 0;
19573 case Intrinsic::x86_sse_movmsk_ps:
19574 case Intrinsic::x86_avx_movmsk_ps_256:
19575 case Intrinsic::x86_sse2_movmsk_pd:
19576 case Intrinsic::x86_avx_movmsk_pd_256:
19577 case Intrinsic::x86_mmx_pmovmskb:
19578 case Intrinsic::x86_sse2_pmovmskb_128:
19579 case Intrinsic::x86_avx2_pmovmskb: {
19580 // High bits of movmskp{s|d}, pmovmskb are known zero.
19582 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
19583 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
19584 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
19585 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
19586 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
19587 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
19588 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
19589 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
19591 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
19600 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
19602 const SelectionDAG &,
19603 unsigned Depth) const {
19604 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
19605 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
19606 return Op.getValueType().getScalarType().getSizeInBits();
19612 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
19613 /// node is a GlobalAddress + offset.
19614 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
19615 const GlobalValue* &GA,
19616 int64_t &Offset) const {
19617 if (N->getOpcode() == X86ISD::Wrapper) {
19618 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
19619 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
19620 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
19624 return TargetLowering::isGAPlusOffset(N, GA, Offset);
19627 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
19628 /// same as extracting the high 128-bit part of 256-bit vector and then
19629 /// inserting the result into the low part of a new 256-bit vector
19630 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
19631 EVT VT = SVOp->getValueType(0);
19632 unsigned NumElems = VT.getVectorNumElements();
19634 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19635 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
19636 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19637 SVOp->getMaskElt(j) >= 0)
19643 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
19644 /// same as extracting the low 128-bit part of 256-bit vector and then
19645 /// inserting the result into the high part of a new 256-bit vector
19646 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
19647 EVT VT = SVOp->getValueType(0);
19648 unsigned NumElems = VT.getVectorNumElements();
19650 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19651 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
19652 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
19653 SVOp->getMaskElt(j) >= 0)
19659 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
19660 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
19661 TargetLowering::DAGCombinerInfo &DCI,
19662 const X86Subtarget* Subtarget) {
19664 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
19665 SDValue V1 = SVOp->getOperand(0);
19666 SDValue V2 = SVOp->getOperand(1);
19667 EVT VT = SVOp->getValueType(0);
19668 unsigned NumElems = VT.getVectorNumElements();
19670 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
19671 V2.getOpcode() == ISD::CONCAT_VECTORS) {
19675 // V UNDEF BUILD_VECTOR UNDEF
19677 // CONCAT_VECTOR CONCAT_VECTOR
19680 // RESULT: V + zero extended
19682 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
19683 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
19684 V1.getOperand(1).getOpcode() != ISD::UNDEF)
19687 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
19690 // To match the shuffle mask, the first half of the mask should
19691 // be exactly the first vector, and all the rest a splat with the
19692 // first element of the second one.
19693 for (unsigned i = 0; i != NumElems/2; ++i)
19694 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
19695 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
19698 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
19699 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
19700 if (Ld->hasNUsesOfValue(1, 0)) {
19701 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
19702 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
19704 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
19706 Ld->getPointerInfo(),
19707 Ld->getAlignment(),
19708 false/*isVolatile*/, true/*ReadMem*/,
19709 false/*WriteMem*/);
19711 // Make sure the newly-created LOAD is in the same position as Ld in
19712 // terms of dependency. We create a TokenFactor for Ld and ResNode,
19713 // and update uses of Ld's output chain to use the TokenFactor.
19714 if (Ld->hasAnyUseOfValue(1)) {
19715 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
19716 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
19717 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
19718 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
19719 SDValue(ResNode.getNode(), 1));
19722 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
19726 // Emit a zeroed vector and insert the desired subvector on its
19728 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
19729 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
19730 return DCI.CombineTo(N, InsV);
19733 //===--------------------------------------------------------------------===//
19734 // Combine some shuffles into subvector extracts and inserts:
19737 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
19738 if (isShuffleHigh128VectorInsertLow(SVOp)) {
19739 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
19740 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
19741 return DCI.CombineTo(N, InsV);
19744 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
19745 if (isShuffleLow128VectorInsertHigh(SVOp)) {
19746 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
19747 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
19748 return DCI.CombineTo(N, InsV);
19754 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
19757 /// This is the leaf of the recursive combinine below. When we have found some
19758 /// chain of single-use x86 shuffle instructions and accumulated the combined
19759 /// shuffle mask represented by them, this will try to pattern match that mask
19760 /// into either a single instruction if there is a special purpose instruction
19761 /// for this operation, or into a PSHUFB instruction which is a fully general
19762 /// instruction but should only be used to replace chains over a certain depth.
19763 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
19764 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
19765 TargetLowering::DAGCombinerInfo &DCI,
19766 const X86Subtarget *Subtarget) {
19767 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
19769 // Find the operand that enters the chain. Note that multiple uses are OK
19770 // here, we're not going to remove the operand we find.
19771 SDValue Input = Op.getOperand(0);
19772 while (Input.getOpcode() == ISD::BITCAST)
19773 Input = Input.getOperand(0);
19775 MVT VT = Input.getSimpleValueType();
19776 MVT RootVT = Root.getSimpleValueType();
19779 // Just remove no-op shuffle masks.
19780 if (Mask.size() == 1) {
19781 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
19786 // Use the float domain if the operand type is a floating point type.
19787 bool FloatDomain = VT.isFloatingPoint();
19789 // For floating point shuffles, we don't have free copies in the shuffle
19790 // instructions or the ability to load as part of the instruction, so
19791 // canonicalize their shuffles to UNPCK or MOV variants.
19793 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
19794 // vectors because it can have a load folded into it that UNPCK cannot. This
19795 // doesn't preclude something switching to the shorter encoding post-RA.
19797 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
19798 bool Lo = Mask.equals(0, 0);
19801 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
19802 // is no slower than UNPCKLPD but has the option to fold the input operand
19803 // into even an unaligned memory load.
19804 if (Lo && Subtarget->hasSSE3()) {
19805 Shuffle = X86ISD::MOVDDUP;
19806 ShuffleVT = MVT::v2f64;
19808 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
19809 // than the UNPCK variants.
19810 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
19811 ShuffleVT = MVT::v4f32;
19813 if (Depth == 1 && Root->getOpcode() == Shuffle)
19814 return false; // Nothing to do!
19815 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19816 DCI.AddToWorklist(Op.getNode());
19817 if (Shuffle == X86ISD::MOVDDUP)
19818 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19820 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19821 DCI.AddToWorklist(Op.getNode());
19822 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19826 if (Subtarget->hasSSE3() &&
19827 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
19828 bool Lo = Mask.equals(0, 0, 2, 2);
19829 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
19830 MVT ShuffleVT = MVT::v4f32;
19831 if (Depth == 1 && Root->getOpcode() == Shuffle)
19832 return false; // Nothing to do!
19833 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19834 DCI.AddToWorklist(Op.getNode());
19835 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
19836 DCI.AddToWorklist(Op.getNode());
19837 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19841 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
19842 bool Lo = Mask.equals(0, 0, 1, 1);
19843 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19844 MVT ShuffleVT = MVT::v4f32;
19845 if (Depth == 1 && Root->getOpcode() == Shuffle)
19846 return false; // Nothing to do!
19847 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19848 DCI.AddToWorklist(Op.getNode());
19849 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19850 DCI.AddToWorklist(Op.getNode());
19851 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19857 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
19858 // variants as none of these have single-instruction variants that are
19859 // superior to the UNPCK formulation.
19860 if (!FloatDomain &&
19861 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
19862 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
19863 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
19864 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
19866 bool Lo = Mask[0] == 0;
19867 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
19868 if (Depth == 1 && Root->getOpcode() == Shuffle)
19869 return false; // Nothing to do!
19871 switch (Mask.size()) {
19873 ShuffleVT = MVT::v8i16;
19876 ShuffleVT = MVT::v16i8;
19879 llvm_unreachable("Impossible mask size!");
19881 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
19882 DCI.AddToWorklist(Op.getNode());
19883 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
19884 DCI.AddToWorklist(Op.getNode());
19885 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19890 // Don't try to re-form single instruction chains under any circumstances now
19891 // that we've done encoding canonicalization for them.
19895 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
19896 // can replace them with a single PSHUFB instruction profitably. Intel's
19897 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
19898 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
19899 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
19900 SmallVector<SDValue, 16> PSHUFBMask;
19901 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
19902 int Ratio = 16 / Mask.size();
19903 for (unsigned i = 0; i < 16; ++i) {
19904 int M = Mask[i / Ratio] != SM_SentinelZero
19905 ? Ratio * Mask[i / Ratio] + i % Ratio
19907 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
19909 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
19910 DCI.AddToWorklist(Op.getNode());
19911 SDValue PSHUFBMaskOp =
19912 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
19913 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
19914 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
19915 DCI.AddToWorklist(Op.getNode());
19916 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
19921 // Failed to find any combines.
19925 /// \brief Fully generic combining of x86 shuffle instructions.
19927 /// This should be the last combine run over the x86 shuffle instructions. Once
19928 /// they have been fully optimized, this will recursively consider all chains
19929 /// of single-use shuffle instructions, build a generic model of the cumulative
19930 /// shuffle operation, and check for simpler instructions which implement this
19931 /// operation. We use this primarily for two purposes:
19933 /// 1) Collapse generic shuffles to specialized single instructions when
19934 /// equivalent. In most cases, this is just an encoding size win, but
19935 /// sometimes we will collapse multiple generic shuffles into a single
19936 /// special-purpose shuffle.
19937 /// 2) Look for sequences of shuffle instructions with 3 or more total
19938 /// instructions, and replace them with the slightly more expensive SSSE3
19939 /// PSHUFB instruction if available. We do this as the last combining step
19940 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
19941 /// a suitable short sequence of other instructions. The PHUFB will either
19942 /// use a register or have to read from memory and so is slightly (but only
19943 /// slightly) more expensive than the other shuffle instructions.
19945 /// Because this is inherently a quadratic operation (for each shuffle in
19946 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
19947 /// This should never be an issue in practice as the shuffle lowering doesn't
19948 /// produce sequences of more than 8 instructions.
19950 /// FIXME: We will currently miss some cases where the redundant shuffling
19951 /// would simplify under the threshold for PSHUFB formation because of
19952 /// combine-ordering. To fix this, we should do the redundant instruction
19953 /// combining in this recursive walk.
19954 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
19955 ArrayRef<int> RootMask,
19956 int Depth, bool HasPSHUFB,
19958 TargetLowering::DAGCombinerInfo &DCI,
19959 const X86Subtarget *Subtarget) {
19960 // Bound the depth of our recursive combine because this is ultimately
19961 // quadratic in nature.
19965 // Directly rip through bitcasts to find the underlying operand.
19966 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
19967 Op = Op.getOperand(0);
19969 MVT VT = Op.getSimpleValueType();
19970 if (!VT.isVector())
19971 return false; // Bail if we hit a non-vector.
19972 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
19973 // version should be added.
19974 if (VT.getSizeInBits() != 128)
19977 assert(Root.getSimpleValueType().isVector() &&
19978 "Shuffles operate on vector types!");
19979 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
19980 "Can only combine shuffles of the same vector register size.");
19982 if (!isTargetShuffle(Op.getOpcode()))
19984 SmallVector<int, 16> OpMask;
19986 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
19987 // We only can combine unary shuffles which we can decode the mask for.
19988 if (!HaveMask || !IsUnary)
19991 assert(VT.getVectorNumElements() == OpMask.size() &&
19992 "Different mask size from vector size!");
19993 assert(((RootMask.size() > OpMask.size() &&
19994 RootMask.size() % OpMask.size() == 0) ||
19995 (OpMask.size() > RootMask.size() &&
19996 OpMask.size() % RootMask.size() == 0) ||
19997 OpMask.size() == RootMask.size()) &&
19998 "The smaller number of elements must divide the larger.");
19999 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
20000 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
20001 assert(((RootRatio == 1 && OpRatio == 1) ||
20002 (RootRatio == 1) != (OpRatio == 1)) &&
20003 "Must not have a ratio for both incoming and op masks!");
20005 SmallVector<int, 16> Mask;
20006 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
20008 // Merge this shuffle operation's mask into our accumulated mask. Note that
20009 // this shuffle's mask will be the first applied to the input, followed by the
20010 // root mask to get us all the way to the root value arrangement. The reason
20011 // for this order is that we are recursing up the operation chain.
20012 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
20013 int RootIdx = i / RootRatio;
20014 if (RootMask[RootIdx] == SM_SentinelZero) {
20015 // This is a zero-ed lane, we're done.
20016 Mask.push_back(SM_SentinelZero);
20020 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
20021 int OpIdx = RootMaskedIdx / OpRatio;
20022 if (OpMask[OpIdx] == SM_SentinelZero) {
20023 // The incoming lanes are zero, it doesn't matter which ones we are using.
20024 Mask.push_back(SM_SentinelZero);
20028 // Ok, we have non-zero lanes, map them through.
20029 Mask.push_back(OpMask[OpIdx] * OpRatio +
20030 RootMaskedIdx % OpRatio);
20033 // See if we can recurse into the operand to combine more things.
20034 switch (Op.getOpcode()) {
20035 case X86ISD::PSHUFB:
20037 case X86ISD::PSHUFD:
20038 case X86ISD::PSHUFHW:
20039 case X86ISD::PSHUFLW:
20040 if (Op.getOperand(0).hasOneUse() &&
20041 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20042 HasPSHUFB, DAG, DCI, Subtarget))
20046 case X86ISD::UNPCKL:
20047 case X86ISD::UNPCKH:
20048 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
20049 // We can't check for single use, we have to check that this shuffle is the only user.
20050 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
20051 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
20052 HasPSHUFB, DAG, DCI, Subtarget))
20057 // Minor canonicalization of the accumulated shuffle mask to make it easier
20058 // to match below. All this does is detect masks with squential pairs of
20059 // elements, and shrink them to the half-width mask. It does this in a loop
20060 // so it will reduce the size of the mask to the minimal width mask which
20061 // performs an equivalent shuffle.
20062 while (Mask.size() > 1 && canWidenShuffleElements(Mask)) {
20063 for (int i = 0, e = Mask.size() / 2; i < e; ++i)
20064 Mask[i] = Mask[2 * i] / 2;
20065 Mask.resize(Mask.size() / 2);
20068 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
20072 /// \brief Get the PSHUF-style mask from PSHUF node.
20074 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
20075 /// PSHUF-style masks that can be reused with such instructions.
20076 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
20077 SmallVector<int, 4> Mask;
20079 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
20083 switch (N.getOpcode()) {
20084 case X86ISD::PSHUFD:
20086 case X86ISD::PSHUFLW:
20089 case X86ISD::PSHUFHW:
20090 Mask.erase(Mask.begin(), Mask.begin() + 4);
20091 for (int &M : Mask)
20095 llvm_unreachable("No valid shuffle instruction found!");
20099 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
20101 /// We walk up the chain and look for a combinable shuffle, skipping over
20102 /// shuffles that we could hoist this shuffle's transformation past without
20103 /// altering anything.
20105 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
20107 TargetLowering::DAGCombinerInfo &DCI) {
20108 assert(N.getOpcode() == X86ISD::PSHUFD &&
20109 "Called with something other than an x86 128-bit half shuffle!");
20112 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
20113 // of the shuffles in the chain so that we can form a fresh chain to replace
20115 SmallVector<SDValue, 8> Chain;
20116 SDValue V = N.getOperand(0);
20117 for (; V.hasOneUse(); V = V.getOperand(0)) {
20118 switch (V.getOpcode()) {
20120 return SDValue(); // Nothing combined!
20123 // Skip bitcasts as we always know the type for the target specific
20127 case X86ISD::PSHUFD:
20128 // Found another dword shuffle.
20131 case X86ISD::PSHUFLW:
20132 // Check that the low words (being shuffled) are the identity in the
20133 // dword shuffle, and the high words are self-contained.
20134 if (Mask[0] != 0 || Mask[1] != 1 ||
20135 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
20138 Chain.push_back(V);
20141 case X86ISD::PSHUFHW:
20142 // Check that the high words (being shuffled) are the identity in the
20143 // dword shuffle, and the low words are self-contained.
20144 if (Mask[2] != 2 || Mask[3] != 3 ||
20145 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
20148 Chain.push_back(V);
20151 case X86ISD::UNPCKL:
20152 case X86ISD::UNPCKH:
20153 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
20154 // shuffle into a preceding word shuffle.
20155 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
20158 // Search for a half-shuffle which we can combine with.
20159 unsigned CombineOp =
20160 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
20161 if (V.getOperand(0) != V.getOperand(1) ||
20162 !V->isOnlyUserOf(V.getOperand(0).getNode()))
20164 Chain.push_back(V);
20165 V = V.getOperand(0);
20167 switch (V.getOpcode()) {
20169 return SDValue(); // Nothing to combine.
20171 case X86ISD::PSHUFLW:
20172 case X86ISD::PSHUFHW:
20173 if (V.getOpcode() == CombineOp)
20176 Chain.push_back(V);
20180 V = V.getOperand(0);
20184 } while (V.hasOneUse());
20187 // Break out of the loop if we break out of the switch.
20191 if (!V.hasOneUse())
20192 // We fell out of the loop without finding a viable combining instruction.
20195 // Merge this node's mask and our incoming mask.
20196 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20197 for (int &M : Mask)
20199 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
20200 getV4X86ShuffleImm8ForMask(Mask, DAG));
20202 // Rebuild the chain around this new shuffle.
20203 while (!Chain.empty()) {
20204 SDValue W = Chain.pop_back_val();
20206 if (V.getValueType() != W.getOperand(0).getValueType())
20207 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
20209 switch (W.getOpcode()) {
20211 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
20213 case X86ISD::UNPCKL:
20214 case X86ISD::UNPCKH:
20215 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
20218 case X86ISD::PSHUFD:
20219 case X86ISD::PSHUFLW:
20220 case X86ISD::PSHUFHW:
20221 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
20225 if (V.getValueType() != N.getValueType())
20226 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
20228 // Return the new chain to replace N.
20232 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
20234 /// We walk up the chain, skipping shuffles of the other half and looking
20235 /// through shuffles which switch halves trying to find a shuffle of the same
20236 /// pair of dwords.
20237 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
20239 TargetLowering::DAGCombinerInfo &DCI) {
20241 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
20242 "Called with something other than an x86 128-bit half shuffle!");
20244 unsigned CombineOpcode = N.getOpcode();
20246 // Walk up a single-use chain looking for a combinable shuffle.
20247 SDValue V = N.getOperand(0);
20248 for (; V.hasOneUse(); V = V.getOperand(0)) {
20249 switch (V.getOpcode()) {
20251 return false; // Nothing combined!
20254 // Skip bitcasts as we always know the type for the target specific
20258 case X86ISD::PSHUFLW:
20259 case X86ISD::PSHUFHW:
20260 if (V.getOpcode() == CombineOpcode)
20263 // Other-half shuffles are no-ops.
20266 // Break out of the loop if we break out of the switch.
20270 if (!V.hasOneUse())
20271 // We fell out of the loop without finding a viable combining instruction.
20274 // Combine away the bottom node as its shuffle will be accumulated into
20275 // a preceding shuffle.
20276 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20278 // Record the old value.
20281 // Merge this node's mask and our incoming mask (adjusted to account for all
20282 // the pshufd instructions encountered).
20283 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20284 for (int &M : Mask)
20286 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
20287 getV4X86ShuffleImm8ForMask(Mask, DAG));
20289 // Check that the shuffles didn't cancel each other out. If not, we need to
20290 // combine to the new one.
20292 // Replace the combinable shuffle with the combined one, updating all users
20293 // so that we re-evaluate the chain here.
20294 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
20299 /// \brief Try to combine x86 target specific shuffles.
20300 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
20301 TargetLowering::DAGCombinerInfo &DCI,
20302 const X86Subtarget *Subtarget) {
20304 MVT VT = N.getSimpleValueType();
20305 SmallVector<int, 4> Mask;
20307 switch (N.getOpcode()) {
20308 case X86ISD::PSHUFD:
20309 case X86ISD::PSHUFLW:
20310 case X86ISD::PSHUFHW:
20311 Mask = getPSHUFShuffleMask(N);
20312 assert(Mask.size() == 4);
20318 // Nuke no-op shuffles that show up after combining.
20319 if (isNoopShuffleMask(Mask))
20320 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
20322 // Look for simplifications involving one or two shuffle instructions.
20323 SDValue V = N.getOperand(0);
20324 switch (N.getOpcode()) {
20327 case X86ISD::PSHUFLW:
20328 case X86ISD::PSHUFHW:
20329 assert(VT == MVT::v8i16);
20332 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
20333 return SDValue(); // We combined away this shuffle, so we're done.
20335 // See if this reduces to a PSHUFD which is no more expensive and can
20336 // combine with more operations.
20337 if (canWidenShuffleElements(Mask)) {
20338 int DMask[] = {-1, -1, -1, -1};
20339 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
20340 DMask[DOffset + 0] = DOffset + Mask[0] / 2;
20341 DMask[DOffset + 1] = DOffset + Mask[2] / 2;
20342 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
20343 DCI.AddToWorklist(V.getNode());
20344 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
20345 getV4X86ShuffleImm8ForMask(DMask, DAG));
20346 DCI.AddToWorklist(V.getNode());
20347 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
20350 // Look for shuffle patterns which can be implemented as a single unpack.
20351 // FIXME: This doesn't handle the location of the PSHUFD generically, and
20352 // only works when we have a PSHUFD followed by two half-shuffles.
20353 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
20354 (V.getOpcode() == X86ISD::PSHUFLW ||
20355 V.getOpcode() == X86ISD::PSHUFHW) &&
20356 V.getOpcode() != N.getOpcode() &&
20358 SDValue D = V.getOperand(0);
20359 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
20360 D = D.getOperand(0);
20361 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
20362 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
20363 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
20364 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20365 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
20367 for (int i = 0; i < 4; ++i) {
20368 WordMask[i + NOffset] = Mask[i] + NOffset;
20369 WordMask[i + VOffset] = VMask[i] + VOffset;
20371 // Map the word mask through the DWord mask.
20373 for (int i = 0; i < 8; ++i)
20374 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
20375 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
20376 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
20377 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
20378 std::begin(UnpackLoMask)) ||
20379 std::equal(std::begin(MappedMask), std::end(MappedMask),
20380 std::begin(UnpackHiMask))) {
20381 // We can replace all three shuffles with an unpack.
20382 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
20383 DCI.AddToWorklist(V.getNode());
20384 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
20386 DL, MVT::v8i16, V, V);
20393 case X86ISD::PSHUFD:
20394 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
20403 /// \brief Try to combine a shuffle into a target-specific add-sub node.
20405 /// We combine this directly on the abstract vector shuffle nodes so it is
20406 /// easier to generically match. We also insert dummy vector shuffle nodes for
20407 /// the operands which explicitly discard the lanes which are unused by this
20408 /// operation to try to flow through the rest of the combiner the fact that
20409 /// they're unused.
20410 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
20412 EVT VT = N->getValueType(0);
20414 // We only handle target-independent shuffles.
20415 // FIXME: It would be easy and harmless to use the target shuffle mask
20416 // extraction tool to support more.
20417 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
20420 auto *SVN = cast<ShuffleVectorSDNode>(N);
20421 ArrayRef<int> Mask = SVN->getMask();
20422 SDValue V1 = N->getOperand(0);
20423 SDValue V2 = N->getOperand(1);
20425 // We require the first shuffle operand to be the SUB node, and the second to
20426 // be the ADD node.
20427 // FIXME: We should support the commuted patterns.
20428 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
20431 // If there are other uses of these operations we can't fold them.
20432 if (!V1->hasOneUse() || !V2->hasOneUse())
20435 // Ensure that both operations have the same operands. Note that we can
20436 // commute the FADD operands.
20437 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
20438 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
20439 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
20442 // We're looking for blends between FADD and FSUB nodes. We insist on these
20443 // nodes being lined up in a specific expected pattern.
20444 if (!(isShuffleEquivalent(Mask, 0, 3) ||
20445 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
20446 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
20449 // Only specific types are legal at this point, assert so we notice if and
20450 // when these change.
20451 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
20452 VT == MVT::v4f64) &&
20453 "Unknown vector type encountered!");
20455 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
20458 /// PerformShuffleCombine - Performs several different shuffle combines.
20459 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
20460 TargetLowering::DAGCombinerInfo &DCI,
20461 const X86Subtarget *Subtarget) {
20463 SDValue N0 = N->getOperand(0);
20464 SDValue N1 = N->getOperand(1);
20465 EVT VT = N->getValueType(0);
20467 // Don't create instructions with illegal types after legalize types has run.
20468 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20469 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
20472 // If we have legalized the vector types, look for blends of FADD and FSUB
20473 // nodes that we can fuse into an ADDSUB node.
20474 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
20475 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
20478 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
20479 if (Subtarget->hasFp256() && VT.is256BitVector() &&
20480 N->getOpcode() == ISD::VECTOR_SHUFFLE)
20481 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
20483 // During Type Legalization, when promoting illegal vector types,
20484 // the backend might introduce new shuffle dag nodes and bitcasts.
20486 // This code performs the following transformation:
20487 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
20488 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
20490 // We do this only if both the bitcast and the BINOP dag nodes have
20491 // one use. Also, perform this transformation only if the new binary
20492 // operation is legal. This is to avoid introducing dag nodes that
20493 // potentially need to be further expanded (or custom lowered) into a
20494 // less optimal sequence of dag nodes.
20495 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
20496 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
20497 N0.getOpcode() == ISD::BITCAST) {
20498 SDValue BC0 = N0.getOperand(0);
20499 EVT SVT = BC0.getValueType();
20500 unsigned Opcode = BC0.getOpcode();
20501 unsigned NumElts = VT.getVectorNumElements();
20503 if (BC0.hasOneUse() && SVT.isVector() &&
20504 SVT.getVectorNumElements() * 2 == NumElts &&
20505 TLI.isOperationLegal(Opcode, VT)) {
20506 bool CanFold = false;
20518 unsigned SVTNumElts = SVT.getVectorNumElements();
20519 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20520 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
20521 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
20522 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
20523 CanFold = SVOp->getMaskElt(i) < 0;
20526 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
20527 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
20528 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
20529 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
20534 // Only handle 128 wide vector from here on.
20535 if (!VT.is128BitVector())
20538 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
20539 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
20540 // consecutive, non-overlapping, and in the right order.
20541 SmallVector<SDValue, 16> Elts;
20542 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
20543 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
20545 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
20549 if (isTargetShuffle(N->getOpcode())) {
20551 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
20552 if (Shuffle.getNode())
20555 // Try recursively combining arbitrary sequences of x86 shuffle
20556 // instructions into higher-order shuffles. We do this after combining
20557 // specific PSHUF instruction sequences into their minimal form so that we
20558 // can evaluate how many specialized shuffle instructions are involved in
20559 // a particular chain.
20560 SmallVector<int, 1> NonceMask; // Just a placeholder.
20561 NonceMask.push_back(0);
20562 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
20563 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
20565 return SDValue(); // This routine will use CombineTo to replace N.
20571 /// PerformTruncateCombine - Converts truncate operation to
20572 /// a sequence of vector shuffle operations.
20573 /// It is possible when we truncate 256-bit vector to 128-bit vector
20574 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
20575 TargetLowering::DAGCombinerInfo &DCI,
20576 const X86Subtarget *Subtarget) {
20580 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
20581 /// specific shuffle of a load can be folded into a single element load.
20582 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
20583 /// shuffles have been customed lowered so we need to handle those here.
20584 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
20585 TargetLowering::DAGCombinerInfo &DCI) {
20586 if (DCI.isBeforeLegalizeOps())
20589 SDValue InVec = N->getOperand(0);
20590 SDValue EltNo = N->getOperand(1);
20592 if (!isa<ConstantSDNode>(EltNo))
20595 EVT VT = InVec.getValueType();
20597 if (InVec.getOpcode() == ISD::BITCAST) {
20598 // Don't duplicate a load with other uses.
20599 if (!InVec.hasOneUse())
20601 EVT BCVT = InVec.getOperand(0).getValueType();
20602 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
20604 InVec = InVec.getOperand(0);
20607 if (!isTargetShuffle(InVec.getOpcode()))
20610 // Don't duplicate a load with other uses.
20611 if (!InVec.hasOneUse())
20614 SmallVector<int, 16> ShuffleMask;
20616 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
20620 // Select the input vector, guarding against out of range extract vector.
20621 unsigned NumElems = VT.getVectorNumElements();
20622 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
20623 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
20624 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
20625 : InVec.getOperand(1);
20627 // If inputs to shuffle are the same for both ops, then allow 2 uses
20628 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
20630 if (LdNode.getOpcode() == ISD::BITCAST) {
20631 // Don't duplicate a load with other uses.
20632 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
20635 AllowedUses = 1; // only allow 1 load use if we have a bitcast
20636 LdNode = LdNode.getOperand(0);
20639 if (!ISD::isNormalLoad(LdNode.getNode()))
20642 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
20644 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
20647 EVT EltVT = N->getValueType(0);
20648 // If there's a bitcast before the shuffle, check if the load type and
20649 // alignment is valid.
20650 unsigned Align = LN0->getAlignment();
20651 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20652 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
20653 EltVT.getTypeForEVT(*DAG.getContext()));
20655 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
20658 // All checks match so transform back to vector_shuffle so that DAG combiner
20659 // can finish the job
20662 // Create shuffle node taking into account the case that its a unary shuffle
20663 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
20664 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
20665 InVec.getOperand(0), Shuffle,
20667 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
20668 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
20672 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
20673 /// generation and convert it from being a bunch of shuffles and extracts
20674 /// to a simple store and scalar loads to extract the elements.
20675 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
20676 TargetLowering::DAGCombinerInfo &DCI) {
20677 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
20678 if (NewOp.getNode())
20681 SDValue InputVector = N->getOperand(0);
20683 // Detect whether we are trying to convert from mmx to i32 and the bitcast
20684 // from mmx to v2i32 has a single usage.
20685 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
20686 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
20687 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
20688 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
20689 N->getValueType(0),
20690 InputVector.getNode()->getOperand(0));
20692 // Only operate on vectors of 4 elements, where the alternative shuffling
20693 // gets to be more expensive.
20694 if (InputVector.getValueType() != MVT::v4i32)
20697 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
20698 // single use which is a sign-extend or zero-extend, and all elements are
20700 SmallVector<SDNode *, 4> Uses;
20701 unsigned ExtractedElements = 0;
20702 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
20703 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
20704 if (UI.getUse().getResNo() != InputVector.getResNo())
20707 SDNode *Extract = *UI;
20708 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
20711 if (Extract->getValueType(0) != MVT::i32)
20713 if (!Extract->hasOneUse())
20715 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
20716 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
20718 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
20721 // Record which element was extracted.
20722 ExtractedElements |=
20723 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
20725 Uses.push_back(Extract);
20728 // If not all the elements were used, this may not be worthwhile.
20729 if (ExtractedElements != 15)
20732 // Ok, we've now decided to do the transformation.
20733 SDLoc dl(InputVector);
20735 // Store the value to a temporary stack slot.
20736 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
20737 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
20738 MachinePointerInfo(), false, false, 0);
20740 // Replace each use (extract) with a load of the appropriate element.
20741 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
20742 UE = Uses.end(); UI != UE; ++UI) {
20743 SDNode *Extract = *UI;
20745 // cOMpute the element's address.
20746 SDValue Idx = Extract->getOperand(1);
20748 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
20749 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
20750 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20751 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
20753 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
20754 StackPtr, OffsetVal);
20756 // Load the scalar.
20757 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
20758 ScalarAddr, MachinePointerInfo(),
20759 false, false, false, 0);
20761 // Replace the exact with the load.
20762 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
20765 // The replacement was made in place; don't return anything.
20769 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
20770 static std::pair<unsigned, bool>
20771 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
20772 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
20773 if (!VT.isVector())
20774 return std::make_pair(0, false);
20776 bool NeedSplit = false;
20777 switch (VT.getSimpleVT().SimpleTy) {
20778 default: return std::make_pair(0, false);
20782 if (!Subtarget->hasAVX2())
20784 if (!Subtarget->hasAVX())
20785 return std::make_pair(0, false);
20790 if (!Subtarget->hasSSE2())
20791 return std::make_pair(0, false);
20794 // SSE2 has only a small subset of the operations.
20795 bool hasUnsigned = Subtarget->hasSSE41() ||
20796 (Subtarget->hasSSE2() && VT == MVT::v16i8);
20797 bool hasSigned = Subtarget->hasSSE41() ||
20798 (Subtarget->hasSSE2() && VT == MVT::v8i16);
20800 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20803 // Check for x CC y ? x : y.
20804 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20805 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20810 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20813 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20816 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20819 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20821 // Check for x CC y ? y : x -- a min/max with reversed arms.
20822 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20823 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20828 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
20831 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
20834 Opc = hasSigned ? X86ISD::SMAX : 0; break;
20837 Opc = hasSigned ? X86ISD::SMIN : 0; break;
20841 return std::make_pair(Opc, NeedSplit);
20845 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
20846 const X86Subtarget *Subtarget) {
20848 SDValue Cond = N->getOperand(0);
20849 SDValue LHS = N->getOperand(1);
20850 SDValue RHS = N->getOperand(2);
20852 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
20853 SDValue CondSrc = Cond->getOperand(0);
20854 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
20855 Cond = CondSrc->getOperand(0);
20858 MVT VT = N->getSimpleValueType(0);
20859 MVT EltVT = VT.getVectorElementType();
20860 unsigned NumElems = VT.getVectorNumElements();
20861 // There is no blend with immediate in AVX-512.
20862 if (VT.is512BitVector())
20865 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
20867 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
20870 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
20873 // A vselect where all conditions and data are constants can be optimized into
20874 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
20875 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
20876 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
20879 unsigned MaskValue = 0;
20880 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
20883 SmallVector<int, 8> ShuffleMask(NumElems, -1);
20884 for (unsigned i = 0; i < NumElems; ++i) {
20885 // Be sure we emit undef where we can.
20886 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
20887 ShuffleMask[i] = -1;
20889 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
20892 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
20895 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
20897 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
20898 TargetLowering::DAGCombinerInfo &DCI,
20899 const X86Subtarget *Subtarget) {
20901 SDValue Cond = N->getOperand(0);
20902 // Get the LHS/RHS of the select.
20903 SDValue LHS = N->getOperand(1);
20904 SDValue RHS = N->getOperand(2);
20905 EVT VT = LHS.getValueType();
20906 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
20908 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
20909 // instructions match the semantics of the common C idiom x<y?x:y but not
20910 // x<=y?x:y, because of how they handle negative zero (which can be
20911 // ignored in unsafe-math mode).
20912 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
20913 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
20914 (Subtarget->hasSSE2() ||
20915 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
20916 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
20918 unsigned Opcode = 0;
20919 // Check for x CC y ? x : y.
20920 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
20921 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
20925 // Converting this to a min would handle NaNs incorrectly, and swapping
20926 // the operands would cause it to handle comparisons between positive
20927 // and negative zero incorrectly.
20928 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20929 if (!DAG.getTarget().Options.UnsafeFPMath &&
20930 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20932 std::swap(LHS, RHS);
20934 Opcode = X86ISD::FMIN;
20937 // Converting this to a min would handle comparisons between positive
20938 // and negative zero incorrectly.
20939 if (!DAG.getTarget().Options.UnsafeFPMath &&
20940 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20942 Opcode = X86ISD::FMIN;
20945 // Converting this to a min would handle both negative zeros and NaNs
20946 // incorrectly, but we can swap the operands to fix both.
20947 std::swap(LHS, RHS);
20951 Opcode = X86ISD::FMIN;
20955 // Converting this to a max would handle comparisons between positive
20956 // and negative zero incorrectly.
20957 if (!DAG.getTarget().Options.UnsafeFPMath &&
20958 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
20960 Opcode = X86ISD::FMAX;
20963 // Converting this to a max would handle NaNs incorrectly, and swapping
20964 // the operands would cause it to handle comparisons between positive
20965 // and negative zero incorrectly.
20966 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
20967 if (!DAG.getTarget().Options.UnsafeFPMath &&
20968 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
20970 std::swap(LHS, RHS);
20972 Opcode = X86ISD::FMAX;
20975 // Converting this to a max would handle both negative zeros and NaNs
20976 // incorrectly, but we can swap the operands to fix both.
20977 std::swap(LHS, RHS);
20981 Opcode = X86ISD::FMAX;
20984 // Check for x CC y ? y : x -- a min/max with reversed arms.
20985 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
20986 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
20990 // Converting this to a min would handle comparisons between positive
20991 // and negative zero incorrectly, and swapping the operands would
20992 // cause it to handle NaNs incorrectly.
20993 if (!DAG.getTarget().Options.UnsafeFPMath &&
20994 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
20995 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
20997 std::swap(LHS, RHS);
20999 Opcode = X86ISD::FMIN;
21002 // Converting this to a min would handle NaNs incorrectly.
21003 if (!DAG.getTarget().Options.UnsafeFPMath &&
21004 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
21006 Opcode = X86ISD::FMIN;
21009 // Converting this to a min would handle both negative zeros and NaNs
21010 // incorrectly, but we can swap the operands to fix both.
21011 std::swap(LHS, RHS);
21015 Opcode = X86ISD::FMIN;
21019 // Converting this to a max would handle NaNs incorrectly.
21020 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21022 Opcode = X86ISD::FMAX;
21025 // Converting this to a max would handle comparisons between positive
21026 // and negative zero incorrectly, and swapping the operands would
21027 // cause it to handle NaNs incorrectly.
21028 if (!DAG.getTarget().Options.UnsafeFPMath &&
21029 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
21030 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
21032 std::swap(LHS, RHS);
21034 Opcode = X86ISD::FMAX;
21037 // Converting this to a max would handle both negative zeros and NaNs
21038 // incorrectly, but we can swap the operands to fix both.
21039 std::swap(LHS, RHS);
21043 Opcode = X86ISD::FMAX;
21049 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
21052 EVT CondVT = Cond.getValueType();
21053 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
21054 CondVT.getVectorElementType() == MVT::i1) {
21055 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
21056 // lowering on KNL. In this case we convert it to
21057 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
21058 // The same situation for all 128 and 256-bit vectors of i8 and i16.
21059 // Since SKX these selects have a proper lowering.
21060 EVT OpVT = LHS.getValueType();
21061 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
21062 (OpVT.getVectorElementType() == MVT::i8 ||
21063 OpVT.getVectorElementType() == MVT::i16) &&
21064 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
21065 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
21066 DCI.AddToWorklist(Cond.getNode());
21067 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
21070 // If this is a select between two integer constants, try to do some
21072 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
21073 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
21074 // Don't do this for crazy integer types.
21075 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
21076 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
21077 // so that TrueC (the true value) is larger than FalseC.
21078 bool NeedsCondInvert = false;
21080 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
21081 // Efficiently invertible.
21082 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
21083 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
21084 isa<ConstantSDNode>(Cond.getOperand(1))))) {
21085 NeedsCondInvert = true;
21086 std::swap(TrueC, FalseC);
21089 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
21090 if (FalseC->getAPIntValue() == 0 &&
21091 TrueC->getAPIntValue().isPowerOf2()) {
21092 if (NeedsCondInvert) // Invert the condition if needed.
21093 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21094 DAG.getConstant(1, Cond.getValueType()));
21096 // Zero extend the condition if needed.
21097 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
21099 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21100 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
21101 DAG.getConstant(ShAmt, MVT::i8));
21104 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
21105 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21106 if (NeedsCondInvert) // Invert the condition if needed.
21107 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21108 DAG.getConstant(1, Cond.getValueType()));
21110 // Zero extend the condition if needed.
21111 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21112 FalseC->getValueType(0), Cond);
21113 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21114 SDValue(FalseC, 0));
21117 // Optimize cases that will turn into an LEA instruction. This requires
21118 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21119 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21120 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21121 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21123 bool isFastMultiplier = false;
21125 switch ((unsigned char)Diff) {
21127 case 1: // result = add base, cond
21128 case 2: // result = lea base( , cond*2)
21129 case 3: // result = lea base(cond, cond*2)
21130 case 4: // result = lea base( , cond*4)
21131 case 5: // result = lea base(cond, cond*4)
21132 case 8: // result = lea base( , cond*8)
21133 case 9: // result = lea base(cond, cond*8)
21134 isFastMultiplier = true;
21139 if (isFastMultiplier) {
21140 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21141 if (NeedsCondInvert) // Invert the condition if needed.
21142 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
21143 DAG.getConstant(1, Cond.getValueType()));
21145 // Zero extend the condition if needed.
21146 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21148 // Scale the condition by the difference.
21150 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21151 DAG.getConstant(Diff, Cond.getValueType()));
21153 // Add the base if non-zero.
21154 if (FalseC->getAPIntValue() != 0)
21155 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21156 SDValue(FalseC, 0));
21163 // Canonicalize max and min:
21164 // (x > y) ? x : y -> (x >= y) ? x : y
21165 // (x < y) ? x : y -> (x <= y) ? x : y
21166 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
21167 // the need for an extra compare
21168 // against zero. e.g.
21169 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
21171 // testl %edi, %edi
21173 // cmovgl %edi, %eax
21177 // cmovsl %eax, %edi
21178 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
21179 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21180 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21181 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21186 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
21187 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
21188 Cond.getOperand(0), Cond.getOperand(1), NewCC);
21189 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
21194 // Early exit check
21195 if (!TLI.isTypeLegal(VT))
21198 // Match VSELECTs into subs with unsigned saturation.
21199 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21200 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
21201 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
21202 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
21203 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21205 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
21206 // left side invert the predicate to simplify logic below.
21208 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
21210 CC = ISD::getSetCCInverse(CC, true);
21211 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
21215 if (Other.getNode() && Other->getNumOperands() == 2 &&
21216 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
21217 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
21218 SDValue CondRHS = Cond->getOperand(1);
21220 // Look for a general sub with unsigned saturation first.
21221 // x >= y ? x-y : 0 --> subus x, y
21222 // x > y ? x-y : 0 --> subus x, y
21223 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
21224 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
21225 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
21227 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
21228 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
21229 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
21230 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
21231 // If the RHS is a constant we have to reverse the const
21232 // canonicalization.
21233 // x > C-1 ? x+-C : 0 --> subus x, C
21234 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
21235 CondRHSConst->getAPIntValue() ==
21236 (-OpRHSConst->getAPIntValue() - 1))
21237 return DAG.getNode(
21238 X86ISD::SUBUS, DL, VT, OpLHS,
21239 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
21241 // Another special case: If C was a sign bit, the sub has been
21242 // canonicalized into a xor.
21243 // FIXME: Would it be better to use computeKnownBits to determine
21244 // whether it's safe to decanonicalize the xor?
21245 // x s< 0 ? x^C : 0 --> subus x, C
21246 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
21247 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
21248 OpRHSConst->getAPIntValue().isSignBit())
21249 // Note that we have to rebuild the RHS constant here to ensure we
21250 // don't rely on particular values of undef lanes.
21251 return DAG.getNode(
21252 X86ISD::SUBUS, DL, VT, OpLHS,
21253 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
21258 // Try to match a min/max vector operation.
21259 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
21260 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
21261 unsigned Opc = ret.first;
21262 bool NeedSplit = ret.second;
21264 if (Opc && NeedSplit) {
21265 unsigned NumElems = VT.getVectorNumElements();
21266 // Extract the LHS vectors
21267 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
21268 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
21270 // Extract the RHS vectors
21271 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
21272 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
21274 // Create min/max for each subvector
21275 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
21276 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
21278 // Merge the result
21279 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
21281 return DAG.getNode(Opc, DL, VT, LHS, RHS);
21284 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
21285 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
21286 // Check if SETCC has already been promoted
21287 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
21288 // Check that condition value type matches vselect operand type
21291 assert(Cond.getValueType().isVector() &&
21292 "vector select expects a vector selector!");
21294 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
21295 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
21297 if (!TValIsAllOnes && !FValIsAllZeros) {
21298 // Try invert the condition if true value is not all 1s and false value
21300 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
21301 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
21303 if (TValIsAllZeros || FValIsAllOnes) {
21304 SDValue CC = Cond.getOperand(2);
21305 ISD::CondCode NewCC =
21306 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
21307 Cond.getOperand(0).getValueType().isInteger());
21308 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
21309 std::swap(LHS, RHS);
21310 TValIsAllOnes = FValIsAllOnes;
21311 FValIsAllZeros = TValIsAllZeros;
21315 if (TValIsAllOnes || FValIsAllZeros) {
21318 if (TValIsAllOnes && FValIsAllZeros)
21320 else if (TValIsAllOnes)
21321 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
21322 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
21323 else if (FValIsAllZeros)
21324 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
21325 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
21327 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
21331 // Try to fold this VSELECT into a MOVSS/MOVSD
21332 if (N->getOpcode() == ISD::VSELECT &&
21333 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
21334 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
21335 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
21336 bool CanFold = false;
21337 unsigned NumElems = Cond.getNumOperands();
21341 if (isZero(Cond.getOperand(0))) {
21344 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
21345 // fold (vselect <0,-1> -> (movsd A, B)
21346 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21347 CanFold = isAllOnes(Cond.getOperand(i));
21348 } else if (isAllOnes(Cond.getOperand(0))) {
21352 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
21353 // fold (vselect <-1,0> -> (movsd B, A)
21354 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
21355 CanFold = isZero(Cond.getOperand(i));
21359 if (VT == MVT::v4i32 || VT == MVT::v4f32)
21360 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
21361 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
21364 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
21365 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
21366 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
21367 // (v2i64 (bitcast B)))))
21369 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
21370 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
21371 // (v2f64 (bitcast B)))))
21373 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
21374 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
21375 // (v2i64 (bitcast A)))))
21377 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
21378 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
21379 // (v2f64 (bitcast A)))))
21381 CanFold = (isZero(Cond.getOperand(0)) &&
21382 isZero(Cond.getOperand(1)) &&
21383 isAllOnes(Cond.getOperand(2)) &&
21384 isAllOnes(Cond.getOperand(3)));
21386 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
21387 isAllOnes(Cond.getOperand(1)) &&
21388 isZero(Cond.getOperand(2)) &&
21389 isZero(Cond.getOperand(3))) {
21391 std::swap(LHS, RHS);
21395 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
21396 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
21397 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
21398 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
21400 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
21406 // If we know that this node is legal then we know that it is going to be
21407 // matched by one of the SSE/AVX BLEND instructions. These instructions only
21408 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
21409 // to simplify previous instructions.
21410 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
21411 !DCI.isBeforeLegalize() &&
21412 // We explicitly check against v8i16 and v16i16 because, although
21413 // they're marked as Custom, they might only be legal when Cond is a
21414 // build_vector of constants. This will be taken care in a later
21416 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
21417 VT != MVT::v8i16)) {
21418 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
21420 // Don't optimize vector selects that map to mask-registers.
21424 // Check all uses of that condition operand to check whether it will be
21425 // consumed by non-BLEND instructions, which may depend on all bits are set
21427 for (SDNode::use_iterator I = Cond->use_begin(),
21428 E = Cond->use_end(); I != E; ++I)
21429 if (I->getOpcode() != ISD::VSELECT)
21430 // TODO: Add other opcodes eventually lowered into BLEND.
21433 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
21434 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
21436 APInt KnownZero, KnownOne;
21437 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
21438 DCI.isBeforeLegalizeOps());
21439 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
21440 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
21441 DCI.CommitTargetLoweringOpt(TLO);
21444 // We should generate an X86ISD::BLENDI from a vselect if its argument
21445 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
21446 // constants. This specific pattern gets generated when we split a
21447 // selector for a 512 bit vector in a machine without AVX512 (but with
21448 // 256-bit vectors), during legalization:
21450 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
21452 // Iff we find this pattern and the build_vectors are built from
21453 // constants, we translate the vselect into a shuffle_vector that we
21454 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
21455 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
21456 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
21457 if (Shuffle.getNode())
21464 // Check whether a boolean test is testing a boolean value generated by
21465 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
21468 // Simplify the following patterns:
21469 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
21470 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
21471 // to (Op EFLAGS Cond)
21473 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
21474 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
21475 // to (Op EFLAGS !Cond)
21477 // where Op could be BRCOND or CMOV.
21479 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
21480 // Quit if not CMP and SUB with its value result used.
21481 if (Cmp.getOpcode() != X86ISD::CMP &&
21482 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
21485 // Quit if not used as a boolean value.
21486 if (CC != X86::COND_E && CC != X86::COND_NE)
21489 // Check CMP operands. One of them should be 0 or 1 and the other should be
21490 // an SetCC or extended from it.
21491 SDValue Op1 = Cmp.getOperand(0);
21492 SDValue Op2 = Cmp.getOperand(1);
21495 const ConstantSDNode* C = nullptr;
21496 bool needOppositeCond = (CC == X86::COND_E);
21497 bool checkAgainstTrue = false; // Is it a comparison against 1?
21499 if ((C = dyn_cast<ConstantSDNode>(Op1)))
21501 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
21503 else // Quit if all operands are not constants.
21506 if (C->getZExtValue() == 1) {
21507 needOppositeCond = !needOppositeCond;
21508 checkAgainstTrue = true;
21509 } else if (C->getZExtValue() != 0)
21510 // Quit if the constant is neither 0 or 1.
21513 bool truncatedToBoolWithAnd = false;
21514 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
21515 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
21516 SetCC.getOpcode() == ISD::TRUNCATE ||
21517 SetCC.getOpcode() == ISD::AND) {
21518 if (SetCC.getOpcode() == ISD::AND) {
21520 ConstantSDNode *CS;
21521 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
21522 CS->getZExtValue() == 1)
21524 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
21525 CS->getZExtValue() == 1)
21529 SetCC = SetCC.getOperand(OpIdx);
21530 truncatedToBoolWithAnd = true;
21532 SetCC = SetCC.getOperand(0);
21535 switch (SetCC.getOpcode()) {
21536 case X86ISD::SETCC_CARRY:
21537 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
21538 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
21539 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
21540 // truncated to i1 using 'and'.
21541 if (checkAgainstTrue && !truncatedToBoolWithAnd)
21543 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
21544 "Invalid use of SETCC_CARRY!");
21546 case X86ISD::SETCC:
21547 // Set the condition code or opposite one if necessary.
21548 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
21549 if (needOppositeCond)
21550 CC = X86::GetOppositeBranchCondition(CC);
21551 return SetCC.getOperand(1);
21552 case X86ISD::CMOV: {
21553 // Check whether false/true value has canonical one, i.e. 0 or 1.
21554 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
21555 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
21556 // Quit if true value is not a constant.
21559 // Quit if false value is not a constant.
21561 SDValue Op = SetCC.getOperand(0);
21562 // Skip 'zext' or 'trunc' node.
21563 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
21564 Op.getOpcode() == ISD::TRUNCATE)
21565 Op = Op.getOperand(0);
21566 // A special case for rdrand/rdseed, where 0 is set if false cond is
21568 if ((Op.getOpcode() != X86ISD::RDRAND &&
21569 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
21572 // Quit if false value is not the constant 0 or 1.
21573 bool FValIsFalse = true;
21574 if (FVal && FVal->getZExtValue() != 0) {
21575 if (FVal->getZExtValue() != 1)
21577 // If FVal is 1, opposite cond is needed.
21578 needOppositeCond = !needOppositeCond;
21579 FValIsFalse = false;
21581 // Quit if TVal is not the constant opposite of FVal.
21582 if (FValIsFalse && TVal->getZExtValue() != 1)
21584 if (!FValIsFalse && TVal->getZExtValue() != 0)
21586 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
21587 if (needOppositeCond)
21588 CC = X86::GetOppositeBranchCondition(CC);
21589 return SetCC.getOperand(3);
21596 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
21597 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
21598 TargetLowering::DAGCombinerInfo &DCI,
21599 const X86Subtarget *Subtarget) {
21602 // If the flag operand isn't dead, don't touch this CMOV.
21603 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
21606 SDValue FalseOp = N->getOperand(0);
21607 SDValue TrueOp = N->getOperand(1);
21608 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
21609 SDValue Cond = N->getOperand(3);
21611 if (CC == X86::COND_E || CC == X86::COND_NE) {
21612 switch (Cond.getOpcode()) {
21616 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
21617 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
21618 return (CC == X86::COND_E) ? FalseOp : TrueOp;
21624 Flags = checkBoolTestSetCCCombine(Cond, CC);
21625 if (Flags.getNode() &&
21626 // Extra check as FCMOV only supports a subset of X86 cond.
21627 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
21628 SDValue Ops[] = { FalseOp, TrueOp,
21629 DAG.getConstant(CC, MVT::i8), Flags };
21630 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
21633 // If this is a select between two integer constants, try to do some
21634 // optimizations. Note that the operands are ordered the opposite of SELECT
21636 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
21637 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
21638 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
21639 // larger than FalseC (the false value).
21640 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
21641 CC = X86::GetOppositeBranchCondition(CC);
21642 std::swap(TrueC, FalseC);
21643 std::swap(TrueOp, FalseOp);
21646 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
21647 // This is efficient for any integer data type (including i8/i16) and
21649 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
21650 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21651 DAG.getConstant(CC, MVT::i8), Cond);
21653 // Zero extend the condition if needed.
21654 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
21656 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
21657 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
21658 DAG.getConstant(ShAmt, MVT::i8));
21659 if (N->getNumValues() == 2) // Dead flag value?
21660 return DCI.CombineTo(N, Cond, SDValue());
21664 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
21665 // for any integer data type, including i8/i16.
21666 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
21667 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21668 DAG.getConstant(CC, MVT::i8), Cond);
21670 // Zero extend the condition if needed.
21671 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
21672 FalseC->getValueType(0), Cond);
21673 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21674 SDValue(FalseC, 0));
21676 if (N->getNumValues() == 2) // Dead flag value?
21677 return DCI.CombineTo(N, Cond, SDValue());
21681 // Optimize cases that will turn into an LEA instruction. This requires
21682 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
21683 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
21684 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
21685 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
21687 bool isFastMultiplier = false;
21689 switch ((unsigned char)Diff) {
21691 case 1: // result = add base, cond
21692 case 2: // result = lea base( , cond*2)
21693 case 3: // result = lea base(cond, cond*2)
21694 case 4: // result = lea base( , cond*4)
21695 case 5: // result = lea base(cond, cond*4)
21696 case 8: // result = lea base( , cond*8)
21697 case 9: // result = lea base(cond, cond*8)
21698 isFastMultiplier = true;
21703 if (isFastMultiplier) {
21704 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
21705 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
21706 DAG.getConstant(CC, MVT::i8), Cond);
21707 // Zero extend the condition if needed.
21708 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
21710 // Scale the condition by the difference.
21712 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
21713 DAG.getConstant(Diff, Cond.getValueType()));
21715 // Add the base if non-zero.
21716 if (FalseC->getAPIntValue() != 0)
21717 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
21718 SDValue(FalseC, 0));
21719 if (N->getNumValues() == 2) // Dead flag value?
21720 return DCI.CombineTo(N, Cond, SDValue());
21727 // Handle these cases:
21728 // (select (x != c), e, c) -> select (x != c), e, x),
21729 // (select (x == c), c, e) -> select (x == c), x, e)
21730 // where the c is an integer constant, and the "select" is the combination
21731 // of CMOV and CMP.
21733 // The rationale for this change is that the conditional-move from a constant
21734 // needs two instructions, however, conditional-move from a register needs
21735 // only one instruction.
21737 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
21738 // some instruction-combining opportunities. This opt needs to be
21739 // postponed as late as possible.
21741 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
21742 // the DCI.xxxx conditions are provided to postpone the optimization as
21743 // late as possible.
21745 ConstantSDNode *CmpAgainst = nullptr;
21746 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
21747 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
21748 !isa<ConstantSDNode>(Cond.getOperand(0))) {
21750 if (CC == X86::COND_NE &&
21751 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
21752 CC = X86::GetOppositeBranchCondition(CC);
21753 std::swap(TrueOp, FalseOp);
21756 if (CC == X86::COND_E &&
21757 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
21758 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
21759 DAG.getConstant(CC, MVT::i8), Cond };
21760 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
21768 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
21769 const X86Subtarget *Subtarget) {
21770 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
21772 default: return SDValue();
21773 // SSE/AVX/AVX2 blend intrinsics.
21774 case Intrinsic::x86_avx2_pblendvb:
21775 case Intrinsic::x86_avx2_pblendw:
21776 case Intrinsic::x86_avx2_pblendd_128:
21777 case Intrinsic::x86_avx2_pblendd_256:
21778 // Don't try to simplify this intrinsic if we don't have AVX2.
21779 if (!Subtarget->hasAVX2())
21782 case Intrinsic::x86_avx_blend_pd_256:
21783 case Intrinsic::x86_avx_blend_ps_256:
21784 case Intrinsic::x86_avx_blendv_pd_256:
21785 case Intrinsic::x86_avx_blendv_ps_256:
21786 // Don't try to simplify this intrinsic if we don't have AVX.
21787 if (!Subtarget->hasAVX())
21790 case Intrinsic::x86_sse41_pblendw:
21791 case Intrinsic::x86_sse41_blendpd:
21792 case Intrinsic::x86_sse41_blendps:
21793 case Intrinsic::x86_sse41_blendvps:
21794 case Intrinsic::x86_sse41_blendvpd:
21795 case Intrinsic::x86_sse41_pblendvb: {
21796 SDValue Op0 = N->getOperand(1);
21797 SDValue Op1 = N->getOperand(2);
21798 SDValue Mask = N->getOperand(3);
21800 // Don't try to simplify this intrinsic if we don't have SSE4.1.
21801 if (!Subtarget->hasSSE41())
21804 // fold (blend A, A, Mask) -> A
21807 // fold (blend A, B, allZeros) -> A
21808 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
21810 // fold (blend A, B, allOnes) -> B
21811 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
21814 // Simplify the case where the mask is a constant i32 value.
21815 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
21816 if (C->isNullValue())
21818 if (C->isAllOnesValue())
21825 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
21826 case Intrinsic::x86_sse2_psrai_w:
21827 case Intrinsic::x86_sse2_psrai_d:
21828 case Intrinsic::x86_avx2_psrai_w:
21829 case Intrinsic::x86_avx2_psrai_d:
21830 case Intrinsic::x86_sse2_psra_w:
21831 case Intrinsic::x86_sse2_psra_d:
21832 case Intrinsic::x86_avx2_psra_w:
21833 case Intrinsic::x86_avx2_psra_d: {
21834 SDValue Op0 = N->getOperand(1);
21835 SDValue Op1 = N->getOperand(2);
21836 EVT VT = Op0.getValueType();
21837 assert(VT.isVector() && "Expected a vector type!");
21839 if (isa<BuildVectorSDNode>(Op1))
21840 Op1 = Op1.getOperand(0);
21842 if (!isa<ConstantSDNode>(Op1))
21845 EVT SVT = VT.getVectorElementType();
21846 unsigned SVTBits = SVT.getSizeInBits();
21848 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
21849 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
21850 uint64_t ShAmt = C.getZExtValue();
21852 // Don't try to convert this shift into a ISD::SRA if the shift
21853 // count is bigger than or equal to the element size.
21854 if (ShAmt >= SVTBits)
21857 // Trivial case: if the shift count is zero, then fold this
21858 // into the first operand.
21862 // Replace this packed shift intrinsic with a target independent
21864 SDValue Splat = DAG.getConstant(C, VT);
21865 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
21870 /// PerformMulCombine - Optimize a single multiply with constant into two
21871 /// in order to implement it with two cheaper instructions, e.g.
21872 /// LEA + SHL, LEA + LEA.
21873 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
21874 TargetLowering::DAGCombinerInfo &DCI) {
21875 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
21878 EVT VT = N->getValueType(0);
21879 if (VT != MVT::i64)
21882 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
21885 uint64_t MulAmt = C->getZExtValue();
21886 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
21889 uint64_t MulAmt1 = 0;
21890 uint64_t MulAmt2 = 0;
21891 if ((MulAmt % 9) == 0) {
21893 MulAmt2 = MulAmt / 9;
21894 } else if ((MulAmt % 5) == 0) {
21896 MulAmt2 = MulAmt / 5;
21897 } else if ((MulAmt % 3) == 0) {
21899 MulAmt2 = MulAmt / 3;
21902 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
21905 if (isPowerOf2_64(MulAmt2) &&
21906 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
21907 // If second multiplifer is pow2, issue it first. We want the multiply by
21908 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
21910 std::swap(MulAmt1, MulAmt2);
21913 if (isPowerOf2_64(MulAmt1))
21914 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
21915 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
21917 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
21918 DAG.getConstant(MulAmt1, VT));
21920 if (isPowerOf2_64(MulAmt2))
21921 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
21922 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
21924 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
21925 DAG.getConstant(MulAmt2, VT));
21927 // Do not add new nodes to DAG combiner worklist.
21928 DCI.CombineTo(N, NewMul, false);
21933 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
21934 SDValue N0 = N->getOperand(0);
21935 SDValue N1 = N->getOperand(1);
21936 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
21937 EVT VT = N0.getValueType();
21939 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
21940 // since the result of setcc_c is all zero's or all ones.
21941 if (VT.isInteger() && !VT.isVector() &&
21942 N1C && N0.getOpcode() == ISD::AND &&
21943 N0.getOperand(1).getOpcode() == ISD::Constant) {
21944 SDValue N00 = N0.getOperand(0);
21945 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
21946 ((N00.getOpcode() == ISD::ANY_EXTEND ||
21947 N00.getOpcode() == ISD::ZERO_EXTEND) &&
21948 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
21949 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
21950 APInt ShAmt = N1C->getAPIntValue();
21951 Mask = Mask.shl(ShAmt);
21953 return DAG.getNode(ISD::AND, SDLoc(N), VT,
21954 N00, DAG.getConstant(Mask, VT));
21958 // Hardware support for vector shifts is sparse which makes us scalarize the
21959 // vector operations in many cases. Also, on sandybridge ADD is faster than
21961 // (shl V, 1) -> add V,V
21962 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
21963 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
21964 assert(N0.getValueType().isVector() && "Invalid vector shift type");
21965 // We shift all of the values by one. In many cases we do not have
21966 // hardware support for this operation. This is better expressed as an ADD
21968 if (N1SplatC->getZExtValue() == 1)
21969 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
21975 /// \brief Returns a vector of 0s if the node in input is a vector logical
21976 /// shift by a constant amount which is known to be bigger than or equal
21977 /// to the vector element size in bits.
21978 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
21979 const X86Subtarget *Subtarget) {
21980 EVT VT = N->getValueType(0);
21982 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
21983 (!Subtarget->hasInt256() ||
21984 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
21987 SDValue Amt = N->getOperand(1);
21989 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
21990 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
21991 APInt ShiftAmt = AmtSplat->getAPIntValue();
21992 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
21994 // SSE2/AVX2 logical shifts always return a vector of 0s
21995 // if the shift amount is bigger than or equal to
21996 // the element size. The constant shift amount will be
21997 // encoded as a 8-bit immediate.
21998 if (ShiftAmt.trunc(8).uge(MaxAmount))
21999 return getZeroVector(VT, Subtarget, DAG, DL);
22005 /// PerformShiftCombine - Combine shifts.
22006 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
22007 TargetLowering::DAGCombinerInfo &DCI,
22008 const X86Subtarget *Subtarget) {
22009 if (N->getOpcode() == ISD::SHL) {
22010 SDValue V = PerformSHLCombine(N, DAG);
22011 if (V.getNode()) return V;
22014 if (N->getOpcode() != ISD::SRA) {
22015 // Try to fold this logical shift into a zero vector.
22016 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
22017 if (V.getNode()) return V;
22023 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
22024 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
22025 // and friends. Likewise for OR -> CMPNEQSS.
22026 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
22027 TargetLowering::DAGCombinerInfo &DCI,
22028 const X86Subtarget *Subtarget) {
22031 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
22032 // we're requiring SSE2 for both.
22033 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
22034 SDValue N0 = N->getOperand(0);
22035 SDValue N1 = N->getOperand(1);
22036 SDValue CMP0 = N0->getOperand(1);
22037 SDValue CMP1 = N1->getOperand(1);
22040 // The SETCCs should both refer to the same CMP.
22041 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
22044 SDValue CMP00 = CMP0->getOperand(0);
22045 SDValue CMP01 = CMP0->getOperand(1);
22046 EVT VT = CMP00.getValueType();
22048 if (VT == MVT::f32 || VT == MVT::f64) {
22049 bool ExpectingFlags = false;
22050 // Check for any users that want flags:
22051 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
22052 !ExpectingFlags && UI != UE; ++UI)
22053 switch (UI->getOpcode()) {
22058 ExpectingFlags = true;
22060 case ISD::CopyToReg:
22061 case ISD::SIGN_EXTEND:
22062 case ISD::ZERO_EXTEND:
22063 case ISD::ANY_EXTEND:
22067 if (!ExpectingFlags) {
22068 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
22069 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
22071 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
22072 X86::CondCode tmp = cc0;
22077 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
22078 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
22079 // FIXME: need symbolic constants for these magic numbers.
22080 // See X86ATTInstPrinter.cpp:printSSECC().
22081 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
22082 if (Subtarget->hasAVX512()) {
22083 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
22084 CMP01, DAG.getConstant(x86cc, MVT::i8));
22085 if (N->getValueType(0) != MVT::i1)
22086 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
22090 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
22091 CMP00.getValueType(), CMP00, CMP01,
22092 DAG.getConstant(x86cc, MVT::i8));
22094 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
22095 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
22097 if (is64BitFP && !Subtarget->is64Bit()) {
22098 // On a 32-bit target, we cannot bitcast the 64-bit float to a
22099 // 64-bit integer, since that's not a legal type. Since
22100 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
22101 // bits, but can do this little dance to extract the lowest 32 bits
22102 // and work with those going forward.
22103 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
22105 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
22107 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
22108 Vector32, DAG.getIntPtrConstant(0));
22112 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
22113 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
22114 DAG.getConstant(1, IntVT));
22115 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
22116 return OneBitOfTruth;
22124 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
22125 /// so it can be folded inside ANDNP.
22126 static bool CanFoldXORWithAllOnes(const SDNode *N) {
22127 EVT VT = N->getValueType(0);
22129 // Match direct AllOnes for 128 and 256-bit vectors
22130 if (ISD::isBuildVectorAllOnes(N))
22133 // Look through a bit convert.
22134 if (N->getOpcode() == ISD::BITCAST)
22135 N = N->getOperand(0).getNode();
22137 // Sometimes the operand may come from a insert_subvector building a 256-bit
22139 if (VT.is256BitVector() &&
22140 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
22141 SDValue V1 = N->getOperand(0);
22142 SDValue V2 = N->getOperand(1);
22144 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
22145 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
22146 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
22147 ISD::isBuildVectorAllOnes(V2.getNode()))
22154 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
22155 // register. In most cases we actually compare or select YMM-sized registers
22156 // and mixing the two types creates horrible code. This method optimizes
22157 // some of the transition sequences.
22158 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
22159 TargetLowering::DAGCombinerInfo &DCI,
22160 const X86Subtarget *Subtarget) {
22161 EVT VT = N->getValueType(0);
22162 if (!VT.is256BitVector())
22165 assert((N->getOpcode() == ISD::ANY_EXTEND ||
22166 N->getOpcode() == ISD::ZERO_EXTEND ||
22167 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
22169 SDValue Narrow = N->getOperand(0);
22170 EVT NarrowVT = Narrow->getValueType(0);
22171 if (!NarrowVT.is128BitVector())
22174 if (Narrow->getOpcode() != ISD::XOR &&
22175 Narrow->getOpcode() != ISD::AND &&
22176 Narrow->getOpcode() != ISD::OR)
22179 SDValue N0 = Narrow->getOperand(0);
22180 SDValue N1 = Narrow->getOperand(1);
22183 // The Left side has to be a trunc.
22184 if (N0.getOpcode() != ISD::TRUNCATE)
22187 // The type of the truncated inputs.
22188 EVT WideVT = N0->getOperand(0)->getValueType(0);
22192 // The right side has to be a 'trunc' or a constant vector.
22193 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
22194 ConstantSDNode *RHSConstSplat = nullptr;
22195 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
22196 RHSConstSplat = RHSBV->getConstantSplatNode();
22197 if (!RHSTrunc && !RHSConstSplat)
22200 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22202 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
22205 // Set N0 and N1 to hold the inputs to the new wide operation.
22206 N0 = N0->getOperand(0);
22207 if (RHSConstSplat) {
22208 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
22209 SDValue(RHSConstSplat, 0));
22210 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
22211 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
22212 } else if (RHSTrunc) {
22213 N1 = N1->getOperand(0);
22216 // Generate the wide operation.
22217 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
22218 unsigned Opcode = N->getOpcode();
22220 case ISD::ANY_EXTEND:
22222 case ISD::ZERO_EXTEND: {
22223 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
22224 APInt Mask = APInt::getAllOnesValue(InBits);
22225 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
22226 return DAG.getNode(ISD::AND, DL, VT,
22227 Op, DAG.getConstant(Mask, VT));
22229 case ISD::SIGN_EXTEND:
22230 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
22231 Op, DAG.getValueType(NarrowVT));
22233 llvm_unreachable("Unexpected opcode");
22237 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
22238 TargetLowering::DAGCombinerInfo &DCI,
22239 const X86Subtarget *Subtarget) {
22240 EVT VT = N->getValueType(0);
22241 if (DCI.isBeforeLegalizeOps())
22244 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22248 // Create BEXTR instructions
22249 // BEXTR is ((X >> imm) & (2**size-1))
22250 if (VT == MVT::i32 || VT == MVT::i64) {
22251 SDValue N0 = N->getOperand(0);
22252 SDValue N1 = N->getOperand(1);
22255 // Check for BEXTR.
22256 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
22257 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
22258 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
22259 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
22260 if (MaskNode && ShiftNode) {
22261 uint64_t Mask = MaskNode->getZExtValue();
22262 uint64_t Shift = ShiftNode->getZExtValue();
22263 if (isMask_64(Mask)) {
22264 uint64_t MaskSize = CountPopulation_64(Mask);
22265 if (Shift + MaskSize <= VT.getSizeInBits())
22266 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
22267 DAG.getConstant(Shift | (MaskSize << 8), VT));
22275 // Want to form ANDNP nodes:
22276 // 1) In the hopes of then easily combining them with OR and AND nodes
22277 // to form PBLEND/PSIGN.
22278 // 2) To match ANDN packed intrinsics
22279 if (VT != MVT::v2i64 && VT != MVT::v4i64)
22282 SDValue N0 = N->getOperand(0);
22283 SDValue N1 = N->getOperand(1);
22286 // Check LHS for vnot
22287 if (N0.getOpcode() == ISD::XOR &&
22288 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
22289 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
22290 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
22292 // Check RHS for vnot
22293 if (N1.getOpcode() == ISD::XOR &&
22294 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
22295 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
22296 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
22301 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
22302 TargetLowering::DAGCombinerInfo &DCI,
22303 const X86Subtarget *Subtarget) {
22304 if (DCI.isBeforeLegalizeOps())
22307 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
22311 SDValue N0 = N->getOperand(0);
22312 SDValue N1 = N->getOperand(1);
22313 EVT VT = N->getValueType(0);
22315 // look for psign/blend
22316 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
22317 if (!Subtarget->hasSSSE3() ||
22318 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
22321 // Canonicalize pandn to RHS
22322 if (N0.getOpcode() == X86ISD::ANDNP)
22324 // or (and (m, y), (pandn m, x))
22325 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
22326 SDValue Mask = N1.getOperand(0);
22327 SDValue X = N1.getOperand(1);
22329 if (N0.getOperand(0) == Mask)
22330 Y = N0.getOperand(1);
22331 if (N0.getOperand(1) == Mask)
22332 Y = N0.getOperand(0);
22334 // Check to see if the mask appeared in both the AND and ANDNP and
22338 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
22339 // Look through mask bitcast.
22340 if (Mask.getOpcode() == ISD::BITCAST)
22341 Mask = Mask.getOperand(0);
22342 if (X.getOpcode() == ISD::BITCAST)
22343 X = X.getOperand(0);
22344 if (Y.getOpcode() == ISD::BITCAST)
22345 Y = Y.getOperand(0);
22347 EVT MaskVT = Mask.getValueType();
22349 // Validate that the Mask operand is a vector sra node.
22350 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
22351 // there is no psrai.b
22352 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
22353 unsigned SraAmt = ~0;
22354 if (Mask.getOpcode() == ISD::SRA) {
22355 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
22356 if (auto *AmtConst = AmtBV->getConstantSplatNode())
22357 SraAmt = AmtConst->getZExtValue();
22358 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
22359 SDValue SraC = Mask.getOperand(1);
22360 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
22362 if ((SraAmt + 1) != EltBits)
22367 // Now we know we at least have a plendvb with the mask val. See if
22368 // we can form a psignb/w/d.
22369 // psign = x.type == y.type == mask.type && y = sub(0, x);
22370 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
22371 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
22372 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
22373 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
22374 "Unsupported VT for PSIGN");
22375 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
22376 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22378 // PBLENDVB only available on SSE 4.1
22379 if (!Subtarget->hasSSE41())
22382 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
22384 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
22385 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
22386 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
22387 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
22388 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
22392 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
22395 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
22396 MachineFunction &MF = DAG.getMachineFunction();
22397 bool OptForSize = MF.getFunction()->getAttributes().
22398 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
22400 // SHLD/SHRD instructions have lower register pressure, but on some
22401 // platforms they have higher latency than the equivalent
22402 // series of shifts/or that would otherwise be generated.
22403 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
22404 // have higher latencies and we are not optimizing for size.
22405 if (!OptForSize && Subtarget->isSHLDSlow())
22408 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
22410 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
22412 if (!N0.hasOneUse() || !N1.hasOneUse())
22415 SDValue ShAmt0 = N0.getOperand(1);
22416 if (ShAmt0.getValueType() != MVT::i8)
22418 SDValue ShAmt1 = N1.getOperand(1);
22419 if (ShAmt1.getValueType() != MVT::i8)
22421 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
22422 ShAmt0 = ShAmt0.getOperand(0);
22423 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
22424 ShAmt1 = ShAmt1.getOperand(0);
22427 unsigned Opc = X86ISD::SHLD;
22428 SDValue Op0 = N0.getOperand(0);
22429 SDValue Op1 = N1.getOperand(0);
22430 if (ShAmt0.getOpcode() == ISD::SUB) {
22431 Opc = X86ISD::SHRD;
22432 std::swap(Op0, Op1);
22433 std::swap(ShAmt0, ShAmt1);
22436 unsigned Bits = VT.getSizeInBits();
22437 if (ShAmt1.getOpcode() == ISD::SUB) {
22438 SDValue Sum = ShAmt1.getOperand(0);
22439 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
22440 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
22441 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
22442 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
22443 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
22444 return DAG.getNode(Opc, DL, VT,
22446 DAG.getNode(ISD::TRUNCATE, DL,
22449 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
22450 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
22452 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
22453 return DAG.getNode(Opc, DL, VT,
22454 N0.getOperand(0), N1.getOperand(0),
22455 DAG.getNode(ISD::TRUNCATE, DL,
22462 // Generate NEG and CMOV for integer abs.
22463 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
22464 EVT VT = N->getValueType(0);
22466 // Since X86 does not have CMOV for 8-bit integer, we don't convert
22467 // 8-bit integer abs to NEG and CMOV.
22468 if (VT.isInteger() && VT.getSizeInBits() == 8)
22471 SDValue N0 = N->getOperand(0);
22472 SDValue N1 = N->getOperand(1);
22475 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
22476 // and change it to SUB and CMOV.
22477 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
22478 N0.getOpcode() == ISD::ADD &&
22479 N0.getOperand(1) == N1 &&
22480 N1.getOpcode() == ISD::SRA &&
22481 N1.getOperand(0) == N0.getOperand(0))
22482 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
22483 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
22484 // Generate SUB & CMOV.
22485 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
22486 DAG.getConstant(0, VT), N0.getOperand(0));
22488 SDValue Ops[] = { N0.getOperand(0), Neg,
22489 DAG.getConstant(X86::COND_GE, MVT::i8),
22490 SDValue(Neg.getNode(), 1) };
22491 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
22496 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
22497 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
22498 TargetLowering::DAGCombinerInfo &DCI,
22499 const X86Subtarget *Subtarget) {
22500 if (DCI.isBeforeLegalizeOps())
22503 if (Subtarget->hasCMov()) {
22504 SDValue RV = performIntegerAbsCombine(N, DAG);
22512 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
22513 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
22514 TargetLowering::DAGCombinerInfo &DCI,
22515 const X86Subtarget *Subtarget) {
22516 LoadSDNode *Ld = cast<LoadSDNode>(N);
22517 EVT RegVT = Ld->getValueType(0);
22518 EVT MemVT = Ld->getMemoryVT();
22520 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22522 // On Sandybridge unaligned 256bit loads are inefficient.
22523 ISD::LoadExtType Ext = Ld->getExtensionType();
22524 unsigned Alignment = Ld->getAlignment();
22525 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
22526 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
22527 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
22528 unsigned NumElems = RegVT.getVectorNumElements();
22532 SDValue Ptr = Ld->getBasePtr();
22533 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
22535 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
22537 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22538 Ld->getPointerInfo(), Ld->isVolatile(),
22539 Ld->isNonTemporal(), Ld->isInvariant(),
22541 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22542 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
22543 Ld->getPointerInfo(), Ld->isVolatile(),
22544 Ld->isNonTemporal(), Ld->isInvariant(),
22545 std::min(16U, Alignment));
22546 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
22548 Load2.getValue(1));
22550 SDValue NewVec = DAG.getUNDEF(RegVT);
22551 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
22552 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
22553 return DCI.CombineTo(N, NewVec, TF, true);
22559 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
22560 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
22561 const X86Subtarget *Subtarget) {
22562 StoreSDNode *St = cast<StoreSDNode>(N);
22563 EVT VT = St->getValue().getValueType();
22564 EVT StVT = St->getMemoryVT();
22566 SDValue StoredVal = St->getOperand(1);
22567 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22569 // If we are saving a concatenation of two XMM registers, perform two stores.
22570 // On Sandy Bridge, 256-bit memory operations are executed by two
22571 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
22572 // memory operation.
22573 unsigned Alignment = St->getAlignment();
22574 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
22575 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
22576 StVT == VT && !IsAligned) {
22577 unsigned NumElems = VT.getVectorNumElements();
22581 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
22582 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
22584 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
22585 SDValue Ptr0 = St->getBasePtr();
22586 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
22588 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
22589 St->getPointerInfo(), St->isVolatile(),
22590 St->isNonTemporal(), Alignment);
22591 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
22592 St->getPointerInfo(), St->isVolatile(),
22593 St->isNonTemporal(),
22594 std::min(16U, Alignment));
22595 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
22598 // Optimize trunc store (of multiple scalars) to shuffle and store.
22599 // First, pack all of the elements in one place. Next, store to memory
22600 // in fewer chunks.
22601 if (St->isTruncatingStore() && VT.isVector()) {
22602 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
22603 unsigned NumElems = VT.getVectorNumElements();
22604 assert(StVT != VT && "Cannot truncate to the same type");
22605 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
22606 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
22608 // From, To sizes and ElemCount must be pow of two
22609 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
22610 // We are going to use the original vector elt for storing.
22611 // Accumulated smaller vector elements must be a multiple of the store size.
22612 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
22614 unsigned SizeRatio = FromSz / ToSz;
22616 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
22618 // Create a type on which we perform the shuffle
22619 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
22620 StVT.getScalarType(), NumElems*SizeRatio);
22622 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
22624 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
22625 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
22626 for (unsigned i = 0; i != NumElems; ++i)
22627 ShuffleVec[i] = i * SizeRatio;
22629 // Can't shuffle using an illegal type.
22630 if (!TLI.isTypeLegal(WideVecVT))
22633 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
22634 DAG.getUNDEF(WideVecVT),
22636 // At this point all of the data is stored at the bottom of the
22637 // register. We now need to save it to mem.
22639 // Find the largest store unit
22640 MVT StoreType = MVT::i8;
22641 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
22642 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
22643 MVT Tp = (MVT::SimpleValueType)tp;
22644 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
22648 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
22649 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
22650 (64 <= NumElems * ToSz))
22651 StoreType = MVT::f64;
22653 // Bitcast the original vector into a vector of store-size units
22654 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
22655 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
22656 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
22657 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
22658 SmallVector<SDValue, 8> Chains;
22659 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
22660 TLI.getPointerTy());
22661 SDValue Ptr = St->getBasePtr();
22663 // Perform one or more big stores into memory.
22664 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
22665 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
22666 StoreType, ShuffWide,
22667 DAG.getIntPtrConstant(i));
22668 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
22669 St->getPointerInfo(), St->isVolatile(),
22670 St->isNonTemporal(), St->getAlignment());
22671 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
22672 Chains.push_back(Ch);
22675 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
22678 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
22679 // the FP state in cases where an emms may be missing.
22680 // A preferable solution to the general problem is to figure out the right
22681 // places to insert EMMS. This qualifies as a quick hack.
22683 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
22684 if (VT.getSizeInBits() != 64)
22687 const Function *F = DAG.getMachineFunction().getFunction();
22688 bool NoImplicitFloatOps = F->getAttributes().
22689 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
22690 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
22691 && Subtarget->hasSSE2();
22692 if ((VT.isVector() ||
22693 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
22694 isa<LoadSDNode>(St->getValue()) &&
22695 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
22696 St->getChain().hasOneUse() && !St->isVolatile()) {
22697 SDNode* LdVal = St->getValue().getNode();
22698 LoadSDNode *Ld = nullptr;
22699 int TokenFactorIndex = -1;
22700 SmallVector<SDValue, 8> Ops;
22701 SDNode* ChainVal = St->getChain().getNode();
22702 // Must be a store of a load. We currently handle two cases: the load
22703 // is a direct child, and it's under an intervening TokenFactor. It is
22704 // possible to dig deeper under nested TokenFactors.
22705 if (ChainVal == LdVal)
22706 Ld = cast<LoadSDNode>(St->getChain());
22707 else if (St->getValue().hasOneUse() &&
22708 ChainVal->getOpcode() == ISD::TokenFactor) {
22709 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
22710 if (ChainVal->getOperand(i).getNode() == LdVal) {
22711 TokenFactorIndex = i;
22712 Ld = cast<LoadSDNode>(St->getValue());
22714 Ops.push_back(ChainVal->getOperand(i));
22718 if (!Ld || !ISD::isNormalLoad(Ld))
22721 // If this is not the MMX case, i.e. we are just turning i64 load/store
22722 // into f64 load/store, avoid the transformation if there are multiple
22723 // uses of the loaded value.
22724 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
22729 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
22730 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
22732 if (Subtarget->is64Bit() || F64IsLegal) {
22733 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
22734 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
22735 Ld->getPointerInfo(), Ld->isVolatile(),
22736 Ld->isNonTemporal(), Ld->isInvariant(),
22737 Ld->getAlignment());
22738 SDValue NewChain = NewLd.getValue(1);
22739 if (TokenFactorIndex != -1) {
22740 Ops.push_back(NewChain);
22741 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22743 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
22744 St->getPointerInfo(),
22745 St->isVolatile(), St->isNonTemporal(),
22746 St->getAlignment());
22749 // Otherwise, lower to two pairs of 32-bit loads / stores.
22750 SDValue LoAddr = Ld->getBasePtr();
22751 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
22752 DAG.getConstant(4, MVT::i32));
22754 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
22755 Ld->getPointerInfo(),
22756 Ld->isVolatile(), Ld->isNonTemporal(),
22757 Ld->isInvariant(), Ld->getAlignment());
22758 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
22759 Ld->getPointerInfo().getWithOffset(4),
22760 Ld->isVolatile(), Ld->isNonTemporal(),
22762 MinAlign(Ld->getAlignment(), 4));
22764 SDValue NewChain = LoLd.getValue(1);
22765 if (TokenFactorIndex != -1) {
22766 Ops.push_back(LoLd);
22767 Ops.push_back(HiLd);
22768 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
22771 LoAddr = St->getBasePtr();
22772 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
22773 DAG.getConstant(4, MVT::i32));
22775 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
22776 St->getPointerInfo(),
22777 St->isVolatile(), St->isNonTemporal(),
22778 St->getAlignment());
22779 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
22780 St->getPointerInfo().getWithOffset(4),
22782 St->isNonTemporal(),
22783 MinAlign(St->getAlignment(), 4));
22784 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
22789 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
22790 /// and return the operands for the horizontal operation in LHS and RHS. A
22791 /// horizontal operation performs the binary operation on successive elements
22792 /// of its first operand, then on successive elements of its second operand,
22793 /// returning the resulting values in a vector. For example, if
22794 /// A = < float a0, float a1, float a2, float a3 >
22796 /// B = < float b0, float b1, float b2, float b3 >
22797 /// then the result of doing a horizontal operation on A and B is
22798 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
22799 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
22800 /// A horizontal-op B, for some already available A and B, and if so then LHS is
22801 /// set to A, RHS to B, and the routine returns 'true'.
22802 /// Note that the binary operation should have the property that if one of the
22803 /// operands is UNDEF then the result is UNDEF.
22804 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
22805 // Look for the following pattern: if
22806 // A = < float a0, float a1, float a2, float a3 >
22807 // B = < float b0, float b1, float b2, float b3 >
22809 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
22810 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
22811 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
22812 // which is A horizontal-op B.
22814 // At least one of the operands should be a vector shuffle.
22815 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
22816 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
22819 MVT VT = LHS.getSimpleValueType();
22821 assert((VT.is128BitVector() || VT.is256BitVector()) &&
22822 "Unsupported vector type for horizontal add/sub");
22824 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
22825 // operate independently on 128-bit lanes.
22826 unsigned NumElts = VT.getVectorNumElements();
22827 unsigned NumLanes = VT.getSizeInBits()/128;
22828 unsigned NumLaneElts = NumElts / NumLanes;
22829 assert((NumLaneElts % 2 == 0) &&
22830 "Vector type should have an even number of elements in each lane");
22831 unsigned HalfLaneElts = NumLaneElts/2;
22833 // View LHS in the form
22834 // LHS = VECTOR_SHUFFLE A, B, LMask
22835 // If LHS is not a shuffle then pretend it is the shuffle
22836 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
22837 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
22840 SmallVector<int, 16> LMask(NumElts);
22841 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22842 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
22843 A = LHS.getOperand(0);
22844 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
22845 B = LHS.getOperand(1);
22846 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
22847 std::copy(Mask.begin(), Mask.end(), LMask.begin());
22849 if (LHS.getOpcode() != ISD::UNDEF)
22851 for (unsigned i = 0; i != NumElts; ++i)
22855 // Likewise, view RHS in the form
22856 // RHS = VECTOR_SHUFFLE C, D, RMask
22858 SmallVector<int, 16> RMask(NumElts);
22859 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
22860 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
22861 C = RHS.getOperand(0);
22862 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
22863 D = RHS.getOperand(1);
22864 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
22865 std::copy(Mask.begin(), Mask.end(), RMask.begin());
22867 if (RHS.getOpcode() != ISD::UNDEF)
22869 for (unsigned i = 0; i != NumElts; ++i)
22873 // Check that the shuffles are both shuffling the same vectors.
22874 if (!(A == C && B == D) && !(A == D && B == C))
22877 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
22878 if (!A.getNode() && !B.getNode())
22881 // If A and B occur in reverse order in RHS, then "swap" them (which means
22882 // rewriting the mask).
22884 CommuteVectorShuffleMask(RMask, NumElts);
22886 // At this point LHS and RHS are equivalent to
22887 // LHS = VECTOR_SHUFFLE A, B, LMask
22888 // RHS = VECTOR_SHUFFLE A, B, RMask
22889 // Check that the masks correspond to performing a horizontal operation.
22890 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
22891 for (unsigned i = 0; i != NumLaneElts; ++i) {
22892 int LIdx = LMask[i+l], RIdx = RMask[i+l];
22894 // Ignore any UNDEF components.
22895 if (LIdx < 0 || RIdx < 0 ||
22896 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
22897 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
22900 // Check that successive elements are being operated on. If not, this is
22901 // not a horizontal operation.
22902 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
22903 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
22904 if (!(LIdx == Index && RIdx == Index + 1) &&
22905 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
22910 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
22911 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
22915 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
22916 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
22917 const X86Subtarget *Subtarget) {
22918 EVT VT = N->getValueType(0);
22919 SDValue LHS = N->getOperand(0);
22920 SDValue RHS = N->getOperand(1);
22922 // Try to synthesize horizontal adds from adds of shuffles.
22923 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22924 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22925 isHorizontalBinOp(LHS, RHS, true))
22926 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
22930 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
22931 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
22932 const X86Subtarget *Subtarget) {
22933 EVT VT = N->getValueType(0);
22934 SDValue LHS = N->getOperand(0);
22935 SDValue RHS = N->getOperand(1);
22937 // Try to synthesize horizontal subs from subs of shuffles.
22938 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
22939 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
22940 isHorizontalBinOp(LHS, RHS, false))
22941 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
22945 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
22946 /// X86ISD::FXOR nodes.
22947 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
22948 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
22949 // F[X]OR(0.0, x) -> x
22950 // F[X]OR(x, 0.0) -> x
22951 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22952 if (C->getValueAPF().isPosZero())
22953 return N->getOperand(1);
22954 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22955 if (C->getValueAPF().isPosZero())
22956 return N->getOperand(0);
22960 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
22961 /// X86ISD::FMAX nodes.
22962 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
22963 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
22965 // Only perform optimizations if UnsafeMath is used.
22966 if (!DAG.getTarget().Options.UnsafeFPMath)
22969 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
22970 // into FMINC and FMAXC, which are Commutative operations.
22971 unsigned NewOp = 0;
22972 switch (N->getOpcode()) {
22973 default: llvm_unreachable("unknown opcode");
22974 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
22975 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
22978 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
22979 N->getOperand(0), N->getOperand(1));
22982 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
22983 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
22984 // FAND(0.0, x) -> 0.0
22985 // FAND(x, 0.0) -> 0.0
22986 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
22987 if (C->getValueAPF().isPosZero())
22988 return N->getOperand(0);
22989 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
22990 if (C->getValueAPF().isPosZero())
22991 return N->getOperand(1);
22995 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
22996 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
22997 // FANDN(x, 0.0) -> 0.0
22998 // FANDN(0.0, x) -> x
22999 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
23000 if (C->getValueAPF().isPosZero())
23001 return N->getOperand(1);
23002 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
23003 if (C->getValueAPF().isPosZero())
23004 return N->getOperand(1);
23008 static SDValue PerformBTCombine(SDNode *N,
23010 TargetLowering::DAGCombinerInfo &DCI) {
23011 // BT ignores high bits in the bit index operand.
23012 SDValue Op1 = N->getOperand(1);
23013 if (Op1.hasOneUse()) {
23014 unsigned BitWidth = Op1.getValueSizeInBits();
23015 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
23016 APInt KnownZero, KnownOne;
23017 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
23018 !DCI.isBeforeLegalizeOps());
23019 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23020 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
23021 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
23022 DCI.CommitTargetLoweringOpt(TLO);
23027 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
23028 SDValue Op = N->getOperand(0);
23029 if (Op.getOpcode() == ISD::BITCAST)
23030 Op = Op.getOperand(0);
23031 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
23032 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
23033 VT.getVectorElementType().getSizeInBits() ==
23034 OpVT.getVectorElementType().getSizeInBits()) {
23035 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
23040 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
23041 const X86Subtarget *Subtarget) {
23042 EVT VT = N->getValueType(0);
23043 if (!VT.isVector())
23046 SDValue N0 = N->getOperand(0);
23047 SDValue N1 = N->getOperand(1);
23048 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
23051 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
23052 // both SSE and AVX2 since there is no sign-extended shift right
23053 // operation on a vector with 64-bit elements.
23054 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
23055 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
23056 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
23057 N0.getOpcode() == ISD::SIGN_EXTEND)) {
23058 SDValue N00 = N0.getOperand(0);
23060 // EXTLOAD has a better solution on AVX2,
23061 // it may be replaced with X86ISD::VSEXT node.
23062 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
23063 if (!ISD::isNormalLoad(N00.getNode()))
23066 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
23067 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
23069 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
23075 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
23076 TargetLowering::DAGCombinerInfo &DCI,
23077 const X86Subtarget *Subtarget) {
23078 if (!DCI.isBeforeLegalizeOps())
23081 if (!Subtarget->hasFp256())
23084 EVT VT = N->getValueType(0);
23085 if (VT.isVector() && VT.getSizeInBits() == 256) {
23086 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23094 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
23095 const X86Subtarget* Subtarget) {
23097 EVT VT = N->getValueType(0);
23099 // Let legalize expand this if it isn't a legal type yet.
23100 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
23103 EVT ScalarVT = VT.getScalarType();
23104 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
23105 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
23108 SDValue A = N->getOperand(0);
23109 SDValue B = N->getOperand(1);
23110 SDValue C = N->getOperand(2);
23112 bool NegA = (A.getOpcode() == ISD::FNEG);
23113 bool NegB = (B.getOpcode() == ISD::FNEG);
23114 bool NegC = (C.getOpcode() == ISD::FNEG);
23116 // Negative multiplication when NegA xor NegB
23117 bool NegMul = (NegA != NegB);
23119 A = A.getOperand(0);
23121 B = B.getOperand(0);
23123 C = C.getOperand(0);
23127 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
23129 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
23131 return DAG.getNode(Opcode, dl, VT, A, B, C);
23134 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
23135 TargetLowering::DAGCombinerInfo &DCI,
23136 const X86Subtarget *Subtarget) {
23137 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
23138 // (and (i32 x86isd::setcc_carry), 1)
23139 // This eliminates the zext. This transformation is necessary because
23140 // ISD::SETCC is always legalized to i8.
23142 SDValue N0 = N->getOperand(0);
23143 EVT VT = N->getValueType(0);
23145 if (N0.getOpcode() == ISD::AND &&
23147 N0.getOperand(0).hasOneUse()) {
23148 SDValue N00 = N0.getOperand(0);
23149 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23150 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23151 if (!C || C->getZExtValue() != 1)
23153 return DAG.getNode(ISD::AND, dl, VT,
23154 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23155 N00.getOperand(0), N00.getOperand(1)),
23156 DAG.getConstant(1, VT));
23160 if (N0.getOpcode() == ISD::TRUNCATE &&
23162 N0.getOperand(0).hasOneUse()) {
23163 SDValue N00 = N0.getOperand(0);
23164 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
23165 return DAG.getNode(ISD::AND, dl, VT,
23166 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
23167 N00.getOperand(0), N00.getOperand(1)),
23168 DAG.getConstant(1, VT));
23171 if (VT.is256BitVector()) {
23172 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
23180 // Optimize x == -y --> x+y == 0
23181 // x != -y --> x+y != 0
23182 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
23183 const X86Subtarget* Subtarget) {
23184 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
23185 SDValue LHS = N->getOperand(0);
23186 SDValue RHS = N->getOperand(1);
23187 EVT VT = N->getValueType(0);
23190 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
23191 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
23192 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
23193 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23194 LHS.getValueType(), RHS, LHS.getOperand(1));
23195 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23196 addV, DAG.getConstant(0, addV.getValueType()), CC);
23198 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
23199 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
23200 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
23201 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
23202 RHS.getValueType(), LHS, RHS.getOperand(1));
23203 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
23204 addV, DAG.getConstant(0, addV.getValueType()), CC);
23207 if (VT.getScalarType() == MVT::i1) {
23208 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
23209 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23210 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
23211 if (!IsSEXT0 && !IsVZero0)
23213 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
23214 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
23215 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
23217 if (!IsSEXT1 && !IsVZero1)
23220 if (IsSEXT0 && IsVZero1) {
23221 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
23222 if (CC == ISD::SETEQ)
23223 return DAG.getNOT(DL, LHS.getOperand(0), VT);
23224 return LHS.getOperand(0);
23226 if (IsSEXT1 && IsVZero0) {
23227 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
23228 if (CC == ISD::SETEQ)
23229 return DAG.getNOT(DL, RHS.getOperand(0), VT);
23230 return RHS.getOperand(0);
23237 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
23238 const X86Subtarget *Subtarget) {
23240 MVT VT = N->getOperand(1)->getSimpleValueType(0);
23241 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
23242 "X86insertps is only defined for v4x32");
23244 SDValue Ld = N->getOperand(1);
23245 if (MayFoldLoad(Ld)) {
23246 // Extract the countS bits from the immediate so we can get the proper
23247 // address when narrowing the vector load to a specific element.
23248 // When the second source op is a memory address, interps doesn't use
23249 // countS and just gets an f32 from that address.
23250 unsigned DestIndex =
23251 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
23252 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
23256 // Create this as a scalar to vector to match the instruction pattern.
23257 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
23258 // countS bits are ignored when loading from memory on insertps, which
23259 // means we don't need to explicitly set them to 0.
23260 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
23261 LoadScalarToVector, N->getOperand(2));
23264 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
23265 // as "sbb reg,reg", since it can be extended without zext and produces
23266 // an all-ones bit which is more useful than 0/1 in some cases.
23267 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
23270 return DAG.getNode(ISD::AND, DL, VT,
23271 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23272 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
23273 DAG.getConstant(1, VT));
23274 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
23275 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
23276 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
23277 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
23280 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
23281 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
23282 TargetLowering::DAGCombinerInfo &DCI,
23283 const X86Subtarget *Subtarget) {
23285 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
23286 SDValue EFLAGS = N->getOperand(1);
23288 if (CC == X86::COND_A) {
23289 // Try to convert COND_A into COND_B in an attempt to facilitate
23290 // materializing "setb reg".
23292 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
23293 // cannot take an immediate as its first operand.
23295 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
23296 EFLAGS.getValueType().isInteger() &&
23297 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
23298 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
23299 EFLAGS.getNode()->getVTList(),
23300 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
23301 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
23302 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
23306 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
23307 // a zext and produces an all-ones bit which is more useful than 0/1 in some
23309 if (CC == X86::COND_B)
23310 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
23314 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23315 if (Flags.getNode()) {
23316 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23317 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
23323 // Optimize branch condition evaluation.
23325 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
23326 TargetLowering::DAGCombinerInfo &DCI,
23327 const X86Subtarget *Subtarget) {
23329 SDValue Chain = N->getOperand(0);
23330 SDValue Dest = N->getOperand(1);
23331 SDValue EFLAGS = N->getOperand(3);
23332 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
23336 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
23337 if (Flags.getNode()) {
23338 SDValue Cond = DAG.getConstant(CC, MVT::i8);
23339 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
23346 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
23347 SelectionDAG &DAG) {
23348 // Take advantage of vector comparisons producing 0 or -1 in each lane to
23349 // optimize away operation when it's from a constant.
23351 // The general transformation is:
23352 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
23353 // AND(VECTOR_CMP(x,y), constant2)
23354 // constant2 = UNARYOP(constant)
23356 // Early exit if this isn't a vector operation, the operand of the
23357 // unary operation isn't a bitwise AND, or if the sizes of the operations
23358 // aren't the same.
23359 EVT VT = N->getValueType(0);
23360 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
23361 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
23362 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
23365 // Now check that the other operand of the AND is a constant. We could
23366 // make the transformation for non-constant splats as well, but it's unclear
23367 // that would be a benefit as it would not eliminate any operations, just
23368 // perform one more step in scalar code before moving to the vector unit.
23369 if (BuildVectorSDNode *BV =
23370 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
23371 // Bail out if the vector isn't a constant.
23372 if (!BV->isConstant())
23375 // Everything checks out. Build up the new and improved node.
23377 EVT IntVT = BV->getValueType(0);
23378 // Create a new constant of the appropriate type for the transformed
23380 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
23381 // The AND node needs bitcasts to/from an integer vector type around it.
23382 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
23383 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
23384 N->getOperand(0)->getOperand(0), MaskConst);
23385 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
23392 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
23393 const X86TargetLowering *XTLI) {
23394 // First try to optimize away the conversion entirely when it's
23395 // conditionally from a constant. Vectors only.
23396 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
23397 if (Res != SDValue())
23400 // Now move on to more general possibilities.
23401 SDValue Op0 = N->getOperand(0);
23402 EVT InVT = Op0->getValueType(0);
23404 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
23405 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
23407 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
23408 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
23409 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
23412 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
23413 // a 32-bit target where SSE doesn't support i64->FP operations.
23414 if (Op0.getOpcode() == ISD::LOAD) {
23415 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
23416 EVT VT = Ld->getValueType(0);
23417 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
23418 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
23419 !XTLI->getSubtarget()->is64Bit() &&
23421 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
23422 Ld->getChain(), Op0, DAG);
23423 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
23430 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
23431 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
23432 X86TargetLowering::DAGCombinerInfo &DCI) {
23433 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
23434 // the result is either zero or one (depending on the input carry bit).
23435 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
23436 if (X86::isZeroNode(N->getOperand(0)) &&
23437 X86::isZeroNode(N->getOperand(1)) &&
23438 // We don't have a good way to replace an EFLAGS use, so only do this when
23440 SDValue(N, 1).use_empty()) {
23442 EVT VT = N->getValueType(0);
23443 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
23444 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
23445 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
23446 DAG.getConstant(X86::COND_B,MVT::i8),
23448 DAG.getConstant(1, VT));
23449 return DCI.CombineTo(N, Res1, CarryOut);
23455 // fold (add Y, (sete X, 0)) -> adc 0, Y
23456 // (add Y, (setne X, 0)) -> sbb -1, Y
23457 // (sub (sete X, 0), Y) -> sbb 0, Y
23458 // (sub (setne X, 0), Y) -> adc -1, Y
23459 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
23462 // Look through ZExts.
23463 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
23464 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
23467 SDValue SetCC = Ext.getOperand(0);
23468 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
23471 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
23472 if (CC != X86::COND_E && CC != X86::COND_NE)
23475 SDValue Cmp = SetCC.getOperand(1);
23476 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
23477 !X86::isZeroNode(Cmp.getOperand(1)) ||
23478 !Cmp.getOperand(0).getValueType().isInteger())
23481 SDValue CmpOp0 = Cmp.getOperand(0);
23482 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
23483 DAG.getConstant(1, CmpOp0.getValueType()));
23485 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
23486 if (CC == X86::COND_NE)
23487 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
23488 DL, OtherVal.getValueType(), OtherVal,
23489 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
23490 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
23491 DL, OtherVal.getValueType(), OtherVal,
23492 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
23495 /// PerformADDCombine - Do target-specific dag combines on integer adds.
23496 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
23497 const X86Subtarget *Subtarget) {
23498 EVT VT = N->getValueType(0);
23499 SDValue Op0 = N->getOperand(0);
23500 SDValue Op1 = N->getOperand(1);
23502 // Try to synthesize horizontal adds from adds of shuffles.
23503 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23504 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23505 isHorizontalBinOp(Op0, Op1, true))
23506 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
23508 return OptimizeConditionalInDecrement(N, DAG);
23511 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
23512 const X86Subtarget *Subtarget) {
23513 SDValue Op0 = N->getOperand(0);
23514 SDValue Op1 = N->getOperand(1);
23516 // X86 can't encode an immediate LHS of a sub. See if we can push the
23517 // negation into a preceding instruction.
23518 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
23519 // If the RHS of the sub is a XOR with one use and a constant, invert the
23520 // immediate. Then add one to the LHS of the sub so we can turn
23521 // X-Y -> X+~Y+1, saving one register.
23522 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
23523 isa<ConstantSDNode>(Op1.getOperand(1))) {
23524 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
23525 EVT VT = Op0.getValueType();
23526 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
23528 DAG.getConstant(~XorC, VT));
23529 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
23530 DAG.getConstant(C->getAPIntValue()+1, VT));
23534 // Try to synthesize horizontal adds from adds of shuffles.
23535 EVT VT = N->getValueType(0);
23536 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
23537 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
23538 isHorizontalBinOp(Op0, Op1, true))
23539 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
23541 return OptimizeConditionalInDecrement(N, DAG);
23544 /// performVZEXTCombine - Performs build vector combines
23545 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
23546 TargetLowering::DAGCombinerInfo &DCI,
23547 const X86Subtarget *Subtarget) {
23548 // (vzext (bitcast (vzext (x)) -> (vzext x)
23549 SDValue In = N->getOperand(0);
23550 while (In.getOpcode() == ISD::BITCAST)
23551 In = In.getOperand(0);
23553 if (In.getOpcode() != X86ISD::VZEXT)
23556 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
23560 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
23561 DAGCombinerInfo &DCI) const {
23562 SelectionDAG &DAG = DCI.DAG;
23563 switch (N->getOpcode()) {
23565 case ISD::EXTRACT_VECTOR_ELT:
23566 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
23568 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
23569 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
23570 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
23571 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
23572 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
23573 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
23576 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
23577 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
23578 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
23579 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
23580 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
23581 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
23582 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
23583 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
23584 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
23586 case X86ISD::FOR: return PerformFORCombine(N, DAG);
23588 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
23589 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
23590 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
23591 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
23592 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
23593 case ISD::ANY_EXTEND:
23594 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
23595 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
23596 case ISD::SIGN_EXTEND_INREG:
23597 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
23598 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
23599 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
23600 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
23601 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
23602 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
23603 case X86ISD::SHUFP: // Handle all target specific shuffles
23604 case X86ISD::PALIGNR:
23605 case X86ISD::UNPCKH:
23606 case X86ISD::UNPCKL:
23607 case X86ISD::MOVHLPS:
23608 case X86ISD::MOVLHPS:
23609 case X86ISD::PSHUFB:
23610 case X86ISD::PSHUFD:
23611 case X86ISD::PSHUFHW:
23612 case X86ISD::PSHUFLW:
23613 case X86ISD::MOVSS:
23614 case X86ISD::MOVSD:
23615 case X86ISD::VPERMILP:
23616 case X86ISD::VPERM2X128:
23617 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
23618 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
23619 case ISD::INTRINSIC_WO_CHAIN:
23620 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
23621 case X86ISD::INSERTPS:
23622 return PerformINSERTPSCombine(N, DAG, Subtarget);
23623 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
23629 /// isTypeDesirableForOp - Return true if the target has native support for
23630 /// the specified value type and it is 'desirable' to use the type for the
23631 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
23632 /// instruction encodings are longer and some i16 instructions are slow.
23633 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
23634 if (!isTypeLegal(VT))
23636 if (VT != MVT::i16)
23643 case ISD::SIGN_EXTEND:
23644 case ISD::ZERO_EXTEND:
23645 case ISD::ANY_EXTEND:
23658 /// IsDesirableToPromoteOp - This method query the target whether it is
23659 /// beneficial for dag combiner to promote the specified node. If true, it
23660 /// should return the desired promotion type by reference.
23661 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
23662 EVT VT = Op.getValueType();
23663 if (VT != MVT::i16)
23666 bool Promote = false;
23667 bool Commute = false;
23668 switch (Op.getOpcode()) {
23671 LoadSDNode *LD = cast<LoadSDNode>(Op);
23672 // If the non-extending load has a single use and it's not live out, then it
23673 // might be folded.
23674 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
23675 Op.hasOneUse()*/) {
23676 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
23677 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
23678 // The only case where we'd want to promote LOAD (rather then it being
23679 // promoted as an operand is when it's only use is liveout.
23680 if (UI->getOpcode() != ISD::CopyToReg)
23687 case ISD::SIGN_EXTEND:
23688 case ISD::ZERO_EXTEND:
23689 case ISD::ANY_EXTEND:
23694 SDValue N0 = Op.getOperand(0);
23695 // Look out for (store (shl (load), x)).
23696 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
23709 SDValue N0 = Op.getOperand(0);
23710 SDValue N1 = Op.getOperand(1);
23711 if (!Commute && MayFoldLoad(N1))
23713 // Avoid disabling potential load folding opportunities.
23714 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
23716 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
23726 //===----------------------------------------------------------------------===//
23727 // X86 Inline Assembly Support
23728 //===----------------------------------------------------------------------===//
23731 // Helper to match a string separated by whitespace.
23732 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
23733 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
23735 for (unsigned i = 0, e = args.size(); i != e; ++i) {
23736 StringRef piece(*args[i]);
23737 if (!s.startswith(piece)) // Check if the piece matches.
23740 s = s.substr(piece.size());
23741 StringRef::size_type pos = s.find_first_not_of(" \t");
23742 if (pos == 0) // We matched a prefix.
23750 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
23753 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
23755 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
23756 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
23757 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
23758 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
23760 if (AsmPieces.size() == 3)
23762 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
23769 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
23770 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
23772 std::string AsmStr = IA->getAsmString();
23774 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
23775 if (!Ty || Ty->getBitWidth() % 16 != 0)
23778 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
23779 SmallVector<StringRef, 4> AsmPieces;
23780 SplitString(AsmStr, AsmPieces, ";\n");
23782 switch (AsmPieces.size()) {
23783 default: return false;
23785 // FIXME: this should verify that we are targeting a 486 or better. If not,
23786 // we will turn this bswap into something that will be lowered to logical
23787 // ops instead of emitting the bswap asm. For now, we don't support 486 or
23788 // lower so don't worry about this.
23790 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
23791 matchAsm(AsmPieces[0], "bswapl", "$0") ||
23792 matchAsm(AsmPieces[0], "bswapq", "$0") ||
23793 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
23794 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
23795 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
23796 // No need to check constraints, nothing other than the equivalent of
23797 // "=r,0" would be valid here.
23798 return IntrinsicLowering::LowerToByteSwap(CI);
23801 // rorw $$8, ${0:w} --> llvm.bswap.i16
23802 if (CI->getType()->isIntegerTy(16) &&
23803 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23804 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
23805 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
23807 const std::string &ConstraintsStr = IA->getConstraintString();
23808 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23809 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23810 if (clobbersFlagRegisters(AsmPieces))
23811 return IntrinsicLowering::LowerToByteSwap(CI);
23815 if (CI->getType()->isIntegerTy(32) &&
23816 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
23817 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
23818 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
23819 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
23821 const std::string &ConstraintsStr = IA->getConstraintString();
23822 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
23823 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
23824 if (clobbersFlagRegisters(AsmPieces))
23825 return IntrinsicLowering::LowerToByteSwap(CI);
23828 if (CI->getType()->isIntegerTy(64)) {
23829 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
23830 if (Constraints.size() >= 2 &&
23831 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
23832 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
23833 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
23834 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
23835 matchAsm(AsmPieces[1], "bswap", "%edx") &&
23836 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
23837 return IntrinsicLowering::LowerToByteSwap(CI);
23845 /// getConstraintType - Given a constraint letter, return the type of
23846 /// constraint it is for this target.
23847 X86TargetLowering::ConstraintType
23848 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
23849 if (Constraint.size() == 1) {
23850 switch (Constraint[0]) {
23861 return C_RegisterClass;
23885 return TargetLowering::getConstraintType(Constraint);
23888 /// Examine constraint type and operand type and determine a weight value.
23889 /// This object must already have been set up with the operand type
23890 /// and the current alternative constraint selected.
23891 TargetLowering::ConstraintWeight
23892 X86TargetLowering::getSingleConstraintMatchWeight(
23893 AsmOperandInfo &info, const char *constraint) const {
23894 ConstraintWeight weight = CW_Invalid;
23895 Value *CallOperandVal = info.CallOperandVal;
23896 // If we don't have a value, we can't do a match,
23897 // but allow it at the lowest weight.
23898 if (!CallOperandVal)
23900 Type *type = CallOperandVal->getType();
23901 // Look at the constraint type.
23902 switch (*constraint) {
23904 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
23915 if (CallOperandVal->getType()->isIntegerTy())
23916 weight = CW_SpecificReg;
23921 if (type->isFloatingPointTy())
23922 weight = CW_SpecificReg;
23925 if (type->isX86_MMXTy() && Subtarget->hasMMX())
23926 weight = CW_SpecificReg;
23930 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
23931 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
23932 weight = CW_Register;
23935 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
23936 if (C->getZExtValue() <= 31)
23937 weight = CW_Constant;
23941 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23942 if (C->getZExtValue() <= 63)
23943 weight = CW_Constant;
23947 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23948 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
23949 weight = CW_Constant;
23953 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23954 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
23955 weight = CW_Constant;
23959 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23960 if (C->getZExtValue() <= 3)
23961 weight = CW_Constant;
23965 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23966 if (C->getZExtValue() <= 0xff)
23967 weight = CW_Constant;
23972 if (dyn_cast<ConstantFP>(CallOperandVal)) {
23973 weight = CW_Constant;
23977 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23978 if ((C->getSExtValue() >= -0x80000000LL) &&
23979 (C->getSExtValue() <= 0x7fffffffLL))
23980 weight = CW_Constant;
23984 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
23985 if (C->getZExtValue() <= 0xffffffff)
23986 weight = CW_Constant;
23993 /// LowerXConstraint - try to replace an X constraint, which matches anything,
23994 /// with another that has more specific requirements based on the type of the
23995 /// corresponding operand.
23996 const char *X86TargetLowering::
23997 LowerXConstraint(EVT ConstraintVT) const {
23998 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
23999 // 'f' like normal targets.
24000 if (ConstraintVT.isFloatingPoint()) {
24001 if (Subtarget->hasSSE2())
24003 if (Subtarget->hasSSE1())
24007 return TargetLowering::LowerXConstraint(ConstraintVT);
24010 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
24011 /// vector. If it is invalid, don't add anything to Ops.
24012 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
24013 std::string &Constraint,
24014 std::vector<SDValue>&Ops,
24015 SelectionDAG &DAG) const {
24018 // Only support length 1 constraints for now.
24019 if (Constraint.length() > 1) return;
24021 char ConstraintLetter = Constraint[0];
24022 switch (ConstraintLetter) {
24025 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24026 if (C->getZExtValue() <= 31) {
24027 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24033 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24034 if (C->getZExtValue() <= 63) {
24035 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24041 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24042 if (isInt<8>(C->getSExtValue())) {
24043 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24049 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24050 if (C->getZExtValue() <= 255) {
24051 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24057 // 32-bit signed value
24058 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24059 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24060 C->getSExtValue())) {
24061 // Widen to 64 bits here to get it sign extended.
24062 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
24065 // FIXME gcc accepts some relocatable values here too, but only in certain
24066 // memory models; it's complicated.
24071 // 32-bit unsigned value
24072 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
24073 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
24074 C->getZExtValue())) {
24075 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
24079 // FIXME gcc accepts some relocatable values here too, but only in certain
24080 // memory models; it's complicated.
24084 // Literal immediates are always ok.
24085 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
24086 // Widen to 64 bits here to get it sign extended.
24087 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
24091 // In any sort of PIC mode addresses need to be computed at runtime by
24092 // adding in a register or some sort of table lookup. These can't
24093 // be used as immediates.
24094 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
24097 // If we are in non-pic codegen mode, we allow the address of a global (with
24098 // an optional displacement) to be used with 'i'.
24099 GlobalAddressSDNode *GA = nullptr;
24100 int64_t Offset = 0;
24102 // Match either (GA), (GA+C), (GA+C1+C2), etc.
24104 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
24105 Offset += GA->getOffset();
24107 } else if (Op.getOpcode() == ISD::ADD) {
24108 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24109 Offset += C->getZExtValue();
24110 Op = Op.getOperand(0);
24113 } else if (Op.getOpcode() == ISD::SUB) {
24114 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
24115 Offset += -C->getZExtValue();
24116 Op = Op.getOperand(0);
24121 // Otherwise, this isn't something we can handle, reject it.
24125 const GlobalValue *GV = GA->getGlobal();
24126 // If we require an extra load to get this address, as in PIC mode, we
24127 // can't accept it.
24128 if (isGlobalStubReference(
24129 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
24132 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
24133 GA->getValueType(0), Offset);
24138 if (Result.getNode()) {
24139 Ops.push_back(Result);
24142 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
24145 std::pair<unsigned, const TargetRegisterClass*>
24146 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
24148 // First, see if this is a constraint that directly corresponds to an LLVM
24150 if (Constraint.size() == 1) {
24151 // GCC Constraint Letters
24152 switch (Constraint[0]) {
24154 // TODO: Slight differences here in allocation order and leaving
24155 // RIP in the class. Do they matter any more here than they do
24156 // in the normal allocation?
24157 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
24158 if (Subtarget->is64Bit()) {
24159 if (VT == MVT::i32 || VT == MVT::f32)
24160 return std::make_pair(0U, &X86::GR32RegClass);
24161 if (VT == MVT::i16)
24162 return std::make_pair(0U, &X86::GR16RegClass);
24163 if (VT == MVT::i8 || VT == MVT::i1)
24164 return std::make_pair(0U, &X86::GR8RegClass);
24165 if (VT == MVT::i64 || VT == MVT::f64)
24166 return std::make_pair(0U, &X86::GR64RegClass);
24169 // 32-bit fallthrough
24170 case 'Q': // Q_REGS
24171 if (VT == MVT::i32 || VT == MVT::f32)
24172 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
24173 if (VT == MVT::i16)
24174 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
24175 if (VT == MVT::i8 || VT == MVT::i1)
24176 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
24177 if (VT == MVT::i64)
24178 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
24180 case 'r': // GENERAL_REGS
24181 case 'l': // INDEX_REGS
24182 if (VT == MVT::i8 || VT == MVT::i1)
24183 return std::make_pair(0U, &X86::GR8RegClass);
24184 if (VT == MVT::i16)
24185 return std::make_pair(0U, &X86::GR16RegClass);
24186 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
24187 return std::make_pair(0U, &X86::GR32RegClass);
24188 return std::make_pair(0U, &X86::GR64RegClass);
24189 case 'R': // LEGACY_REGS
24190 if (VT == MVT::i8 || VT == MVT::i1)
24191 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
24192 if (VT == MVT::i16)
24193 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
24194 if (VT == MVT::i32 || !Subtarget->is64Bit())
24195 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
24196 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
24197 case 'f': // FP Stack registers.
24198 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
24199 // value to the correct fpstack register class.
24200 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
24201 return std::make_pair(0U, &X86::RFP32RegClass);
24202 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
24203 return std::make_pair(0U, &X86::RFP64RegClass);
24204 return std::make_pair(0U, &X86::RFP80RegClass);
24205 case 'y': // MMX_REGS if MMX allowed.
24206 if (!Subtarget->hasMMX()) break;
24207 return std::make_pair(0U, &X86::VR64RegClass);
24208 case 'Y': // SSE_REGS if SSE2 allowed
24209 if (!Subtarget->hasSSE2()) break;
24211 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
24212 if (!Subtarget->hasSSE1()) break;
24214 switch (VT.SimpleTy) {
24216 // Scalar SSE types.
24219 return std::make_pair(0U, &X86::FR32RegClass);
24222 return std::make_pair(0U, &X86::FR64RegClass);
24230 return std::make_pair(0U, &X86::VR128RegClass);
24238 return std::make_pair(0U, &X86::VR256RegClass);
24243 return std::make_pair(0U, &X86::VR512RegClass);
24249 // Use the default implementation in TargetLowering to convert the register
24250 // constraint into a member of a register class.
24251 std::pair<unsigned, const TargetRegisterClass*> Res;
24252 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
24254 // Not found as a standard register?
24256 // Map st(0) -> st(7) -> ST0
24257 if (Constraint.size() == 7 && Constraint[0] == '{' &&
24258 tolower(Constraint[1]) == 's' &&
24259 tolower(Constraint[2]) == 't' &&
24260 Constraint[3] == '(' &&
24261 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
24262 Constraint[5] == ')' &&
24263 Constraint[6] == '}') {
24265 Res.first = X86::FP0+Constraint[4]-'0';
24266 Res.second = &X86::RFP80RegClass;
24270 // GCC allows "st(0)" to be called just plain "st".
24271 if (StringRef("{st}").equals_lower(Constraint)) {
24272 Res.first = X86::FP0;
24273 Res.second = &X86::RFP80RegClass;
24278 if (StringRef("{flags}").equals_lower(Constraint)) {
24279 Res.first = X86::EFLAGS;
24280 Res.second = &X86::CCRRegClass;
24284 // 'A' means EAX + EDX.
24285 if (Constraint == "A") {
24286 Res.first = X86::EAX;
24287 Res.second = &X86::GR32_ADRegClass;
24293 // Otherwise, check to see if this is a register class of the wrong value
24294 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
24295 // turn into {ax},{dx}.
24296 if (Res.second->hasType(VT))
24297 return Res; // Correct type already, nothing to do.
24299 // All of the single-register GCC register classes map their values onto
24300 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
24301 // really want an 8-bit or 32-bit register, map to the appropriate register
24302 // class and return the appropriate register.
24303 if (Res.second == &X86::GR16RegClass) {
24304 if (VT == MVT::i8 || VT == MVT::i1) {
24305 unsigned DestReg = 0;
24306 switch (Res.first) {
24308 case X86::AX: DestReg = X86::AL; break;
24309 case X86::DX: DestReg = X86::DL; break;
24310 case X86::CX: DestReg = X86::CL; break;
24311 case X86::BX: DestReg = X86::BL; break;
24314 Res.first = DestReg;
24315 Res.second = &X86::GR8RegClass;
24317 } else if (VT == MVT::i32 || VT == MVT::f32) {
24318 unsigned DestReg = 0;
24319 switch (Res.first) {
24321 case X86::AX: DestReg = X86::EAX; break;
24322 case X86::DX: DestReg = X86::EDX; break;
24323 case X86::CX: DestReg = X86::ECX; break;
24324 case X86::BX: DestReg = X86::EBX; break;
24325 case X86::SI: DestReg = X86::ESI; break;
24326 case X86::DI: DestReg = X86::EDI; break;
24327 case X86::BP: DestReg = X86::EBP; break;
24328 case X86::SP: DestReg = X86::ESP; break;
24331 Res.first = DestReg;
24332 Res.second = &X86::GR32RegClass;
24334 } else if (VT == MVT::i64 || VT == MVT::f64) {
24335 unsigned DestReg = 0;
24336 switch (Res.first) {
24338 case X86::AX: DestReg = X86::RAX; break;
24339 case X86::DX: DestReg = X86::RDX; break;
24340 case X86::CX: DestReg = X86::RCX; break;
24341 case X86::BX: DestReg = X86::RBX; break;
24342 case X86::SI: DestReg = X86::RSI; break;
24343 case X86::DI: DestReg = X86::RDI; break;
24344 case X86::BP: DestReg = X86::RBP; break;
24345 case X86::SP: DestReg = X86::RSP; break;
24348 Res.first = DestReg;
24349 Res.second = &X86::GR64RegClass;
24352 } else if (Res.second == &X86::FR32RegClass ||
24353 Res.second == &X86::FR64RegClass ||
24354 Res.second == &X86::VR128RegClass ||
24355 Res.second == &X86::VR256RegClass ||
24356 Res.second == &X86::FR32XRegClass ||
24357 Res.second == &X86::FR64XRegClass ||
24358 Res.second == &X86::VR128XRegClass ||
24359 Res.second == &X86::VR256XRegClass ||
24360 Res.second == &X86::VR512RegClass) {
24361 // Handle references to XMM physical registers that got mapped into the
24362 // wrong class. This can happen with constraints like {xmm0} where the
24363 // target independent register mapper will just pick the first match it can
24364 // find, ignoring the required type.
24366 if (VT == MVT::f32 || VT == MVT::i32)
24367 Res.second = &X86::FR32RegClass;
24368 else if (VT == MVT::f64 || VT == MVT::i64)
24369 Res.second = &X86::FR64RegClass;
24370 else if (X86::VR128RegClass.hasType(VT))
24371 Res.second = &X86::VR128RegClass;
24372 else if (X86::VR256RegClass.hasType(VT))
24373 Res.second = &X86::VR256RegClass;
24374 else if (X86::VR512RegClass.hasType(VT))
24375 Res.second = &X86::VR512RegClass;
24381 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
24383 // Scaling factors are not free at all.
24384 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
24385 // will take 2 allocations in the out of order engine instead of 1
24386 // for plain addressing mode, i.e. inst (reg1).
24388 // vaddps (%rsi,%drx), %ymm0, %ymm1
24389 // Requires two allocations (one for the load, one for the computation)
24391 // vaddps (%rsi), %ymm0, %ymm1
24392 // Requires just 1 allocation, i.e., freeing allocations for other operations
24393 // and having less micro operations to execute.
24395 // For some X86 architectures, this is even worse because for instance for
24396 // stores, the complex addressing mode forces the instruction to use the
24397 // "load" ports instead of the dedicated "store" port.
24398 // E.g., on Haswell:
24399 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
24400 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
24401 if (isLegalAddressingMode(AM, Ty))
24402 // Scale represents reg2 * scale, thus account for 1
24403 // as soon as we use a second register.
24404 return AM.Scale != 0;
24408 bool X86TargetLowering::isTargetFTOL() const {
24409 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();