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(const 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);
1563 setOperationAction(ISD::INSERT_SUBVECTOR, MVT::v8i1, Legal);
1566 // SIGN_EXTEND_INREGs are evaluated by the extend type. Handle the expansion
1567 // of this type with custom code.
1568 for (int VT = MVT::FIRST_VECTOR_VALUETYPE;
1569 VT != MVT::LAST_VECTOR_VALUETYPE; VT++) {
1570 setOperationAction(ISD::SIGN_EXTEND_INREG, (MVT::SimpleValueType)VT,
1574 // We want to custom lower some of our intrinsics.
1575 setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
1576 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
1577 setOperationAction(ISD::INTRINSIC_VOID, MVT::Other, Custom);
1578 if (!Subtarget->is64Bit())
1579 setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::i64, Custom);
1581 // Only custom-lower 64-bit SADDO and friends on 64-bit because we don't
1582 // handle type legalization for these operations here.
1584 // FIXME: We really should do custom legalization for addition and
1585 // subtraction on x86-32 once PR3203 is fixed. We really can't do much better
1586 // than generic legalization for 64-bit multiplication-with-overflow, though.
1587 for (unsigned i = 0, e = 3+Subtarget->is64Bit(); i != e; ++i) {
1588 // Add/Sub/Mul with overflow operations are custom lowered.
1590 setOperationAction(ISD::SADDO, VT, Custom);
1591 setOperationAction(ISD::UADDO, VT, Custom);
1592 setOperationAction(ISD::SSUBO, VT, Custom);
1593 setOperationAction(ISD::USUBO, VT, Custom);
1594 setOperationAction(ISD::SMULO, VT, Custom);
1595 setOperationAction(ISD::UMULO, VT, Custom);
1598 // There are no 8-bit 3-address imul/mul instructions
1599 setOperationAction(ISD::SMULO, MVT::i8, Expand);
1600 setOperationAction(ISD::UMULO, MVT::i8, Expand);
1602 if (!Subtarget->is64Bit()) {
1603 // These libcalls are not available in 32-bit.
1604 setLibcallName(RTLIB::SHL_I128, nullptr);
1605 setLibcallName(RTLIB::SRL_I128, nullptr);
1606 setLibcallName(RTLIB::SRA_I128, nullptr);
1609 // Combine sin / cos into one node or libcall if possible.
1610 if (Subtarget->hasSinCos()) {
1611 setLibcallName(RTLIB::SINCOS_F32, "sincosf");
1612 setLibcallName(RTLIB::SINCOS_F64, "sincos");
1613 if (Subtarget->isTargetDarwin()) {
1614 // For MacOSX, we don't want to the normal expansion of a libcall to
1615 // sincos. We want to issue a libcall to __sincos_stret to avoid memory
1617 setOperationAction(ISD::FSINCOS, MVT::f64, Custom);
1618 setOperationAction(ISD::FSINCOS, MVT::f32, Custom);
1622 if (Subtarget->isTargetWin64()) {
1623 setOperationAction(ISD::SDIV, MVT::i128, Custom);
1624 setOperationAction(ISD::UDIV, MVT::i128, Custom);
1625 setOperationAction(ISD::SREM, MVT::i128, Custom);
1626 setOperationAction(ISD::UREM, MVT::i128, Custom);
1627 setOperationAction(ISD::SDIVREM, MVT::i128, Custom);
1628 setOperationAction(ISD::UDIVREM, MVT::i128, Custom);
1631 // We have target-specific dag combine patterns for the following nodes:
1632 setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
1633 setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
1634 setTargetDAGCombine(ISD::VSELECT);
1635 setTargetDAGCombine(ISD::SELECT);
1636 setTargetDAGCombine(ISD::SHL);
1637 setTargetDAGCombine(ISD::SRA);
1638 setTargetDAGCombine(ISD::SRL);
1639 setTargetDAGCombine(ISD::OR);
1640 setTargetDAGCombine(ISD::AND);
1641 setTargetDAGCombine(ISD::ADD);
1642 setTargetDAGCombine(ISD::FADD);
1643 setTargetDAGCombine(ISD::FSUB);
1644 setTargetDAGCombine(ISD::FMA);
1645 setTargetDAGCombine(ISD::SUB);
1646 setTargetDAGCombine(ISD::LOAD);
1647 setTargetDAGCombine(ISD::STORE);
1648 setTargetDAGCombine(ISD::ZERO_EXTEND);
1649 setTargetDAGCombine(ISD::ANY_EXTEND);
1650 setTargetDAGCombine(ISD::SIGN_EXTEND);
1651 setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
1652 setTargetDAGCombine(ISD::TRUNCATE);
1653 setTargetDAGCombine(ISD::SINT_TO_FP);
1654 setTargetDAGCombine(ISD::SETCC);
1655 setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
1656 setTargetDAGCombine(ISD::BUILD_VECTOR);
1657 if (Subtarget->is64Bit())
1658 setTargetDAGCombine(ISD::MUL);
1659 setTargetDAGCombine(ISD::XOR);
1661 computeRegisterProperties();
1663 // On Darwin, -Os means optimize for size without hurting performance,
1664 // do not reduce the limit.
1665 MaxStoresPerMemset = 16; // For @llvm.memset -> sequence of stores
1666 MaxStoresPerMemsetOptSize = Subtarget->isTargetDarwin() ? 16 : 8;
1667 MaxStoresPerMemcpy = 8; // For @llvm.memcpy -> sequence of stores
1668 MaxStoresPerMemcpyOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1669 MaxStoresPerMemmove = 8; // For @llvm.memmove -> sequence of stores
1670 MaxStoresPerMemmoveOptSize = Subtarget->isTargetDarwin() ? 8 : 4;
1671 setPrefLoopAlignment(4); // 2^4 bytes.
1673 // Predictable cmov don't hurt on atom because it's in-order.
1674 PredictableSelectIsExpensive = !Subtarget->isAtom();
1676 setPrefFunctionAlignment(4); // 2^4 bytes.
1678 verifyIntrinsicTables();
1681 // This has so far only been implemented for 64-bit MachO.
1682 bool X86TargetLowering::useLoadStackGuardNode() const {
1683 return Subtarget->getTargetTriple().getObjectFormat() == Triple::MachO &&
1684 Subtarget->is64Bit();
1687 TargetLoweringBase::LegalizeTypeAction
1688 X86TargetLowering::getPreferredVectorAction(EVT VT) const {
1689 if (ExperimentalVectorWideningLegalization &&
1690 VT.getVectorNumElements() != 1 &&
1691 VT.getVectorElementType().getSimpleVT() != MVT::i1)
1692 return TypeWidenVector;
1694 return TargetLoweringBase::getPreferredVectorAction(VT);
1697 EVT X86TargetLowering::getSetCCResultType(LLVMContext &, EVT VT) const {
1699 return Subtarget->hasAVX512() ? MVT::i1: MVT::i8;
1701 const unsigned NumElts = VT.getVectorNumElements();
1702 const EVT EltVT = VT.getVectorElementType();
1703 if (VT.is512BitVector()) {
1704 if (Subtarget->hasAVX512())
1705 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1706 EltVT == MVT::f32 || EltVT == MVT::f64)
1708 case 8: return MVT::v8i1;
1709 case 16: return MVT::v16i1;
1711 if (Subtarget->hasBWI())
1712 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1714 case 32: return MVT::v32i1;
1715 case 64: return MVT::v64i1;
1719 if (VT.is256BitVector() || VT.is128BitVector()) {
1720 if (Subtarget->hasVLX())
1721 if (EltVT == MVT::i32 || EltVT == MVT::i64 ||
1722 EltVT == MVT::f32 || EltVT == MVT::f64)
1724 case 2: return MVT::v2i1;
1725 case 4: return MVT::v4i1;
1726 case 8: return MVT::v8i1;
1728 if (Subtarget->hasBWI() && Subtarget->hasVLX())
1729 if (EltVT == MVT::i8 || EltVT == MVT::i16)
1731 case 8: return MVT::v8i1;
1732 case 16: return MVT::v16i1;
1733 case 32: return MVT::v32i1;
1737 return VT.changeVectorElementTypeToInteger();
1740 /// getMaxByValAlign - Helper for getByValTypeAlignment to determine
1741 /// the desired ByVal argument alignment.
1742 static void getMaxByValAlign(Type *Ty, unsigned &MaxAlign) {
1745 if (VectorType *VTy = dyn_cast<VectorType>(Ty)) {
1746 if (VTy->getBitWidth() == 128)
1748 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1749 unsigned EltAlign = 0;
1750 getMaxByValAlign(ATy->getElementType(), EltAlign);
1751 if (EltAlign > MaxAlign)
1752 MaxAlign = EltAlign;
1753 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
1754 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
1755 unsigned EltAlign = 0;
1756 getMaxByValAlign(STy->getElementType(i), EltAlign);
1757 if (EltAlign > MaxAlign)
1758 MaxAlign = EltAlign;
1765 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
1766 /// function arguments in the caller parameter area. For X86, aggregates
1767 /// that contain SSE vectors are placed at 16-byte boundaries while the rest
1768 /// are at 4-byte boundaries.
1769 unsigned X86TargetLowering::getByValTypeAlignment(Type *Ty) const {
1770 if (Subtarget->is64Bit()) {
1771 // Max of 8 and alignment of type.
1772 unsigned TyAlign = TD->getABITypeAlignment(Ty);
1779 if (Subtarget->hasSSE1())
1780 getMaxByValAlign(Ty, Align);
1784 /// getOptimalMemOpType - Returns the target specific optimal type for load
1785 /// and store operations as a result of memset, memcpy, and memmove
1786 /// lowering. If DstAlign is zero that means it's safe to destination
1787 /// alignment can satisfy any constraint. Similarly if SrcAlign is zero it
1788 /// means there isn't a need to check it against alignment requirement,
1789 /// probably because the source does not need to be loaded. If 'IsMemset' is
1790 /// true, that means it's expanding a memset. If 'ZeroMemset' is true, that
1791 /// means it's a memset of zero. 'MemcpyStrSrc' indicates whether the memcpy
1792 /// source is constant so it does not need to be loaded.
1793 /// It returns EVT::Other if the type should be determined using generic
1794 /// target-independent logic.
1796 X86TargetLowering::getOptimalMemOpType(uint64_t Size,
1797 unsigned DstAlign, unsigned SrcAlign,
1798 bool IsMemset, bool ZeroMemset,
1800 MachineFunction &MF) const {
1801 const Function *F = MF.getFunction();
1802 if ((!IsMemset || ZeroMemset) &&
1803 !F->getAttributes().hasAttribute(AttributeSet::FunctionIndex,
1804 Attribute::NoImplicitFloat)) {
1806 (Subtarget->isUnalignedMemAccessFast() ||
1807 ((DstAlign == 0 || DstAlign >= 16) &&
1808 (SrcAlign == 0 || SrcAlign >= 16)))) {
1810 if (Subtarget->hasInt256())
1812 if (Subtarget->hasFp256())
1815 if (Subtarget->hasSSE2())
1817 if (Subtarget->hasSSE1())
1819 } else if (!MemcpyStrSrc && Size >= 8 &&
1820 !Subtarget->is64Bit() &&
1821 Subtarget->hasSSE2()) {
1822 // Do not use f64 to lower memcpy if source is string constant. It's
1823 // better to use i32 to avoid the loads.
1827 if (Subtarget->is64Bit() && Size >= 8)
1832 bool X86TargetLowering::isSafeMemOpType(MVT VT) const {
1834 return X86ScalarSSEf32;
1835 else if (VT == MVT::f64)
1836 return X86ScalarSSEf64;
1841 X86TargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
1846 *Fast = Subtarget->isUnalignedMemAccessFast();
1850 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
1851 /// current function. The returned value is a member of the
1852 /// MachineJumpTableInfo::JTEntryKind enum.
1853 unsigned X86TargetLowering::getJumpTableEncoding() const {
1854 // In GOT pic mode, each entry in the jump table is emitted as a @GOTOFF
1856 if (getTargetMachine().getRelocationModel() == Reloc::PIC_ &&
1857 Subtarget->isPICStyleGOT())
1858 return MachineJumpTableInfo::EK_Custom32;
1860 // Otherwise, use the normal jump table encoding heuristics.
1861 return TargetLowering::getJumpTableEncoding();
1865 X86TargetLowering::LowerCustomJumpTableEntry(const MachineJumpTableInfo *MJTI,
1866 const MachineBasicBlock *MBB,
1867 unsigned uid,MCContext &Ctx) const{
1868 assert(MBB->getParent()->getTarget().getRelocationModel() == Reloc::PIC_ &&
1869 Subtarget->isPICStyleGOT());
1870 // In 32-bit ELF systems, our jump table entries are formed with @GOTOFF
1872 return MCSymbolRefExpr::Create(MBB->getSymbol(),
1873 MCSymbolRefExpr::VK_GOTOFF, Ctx);
1876 /// getPICJumpTableRelocaBase - Returns relocation base for the given PIC
1878 SDValue X86TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1879 SelectionDAG &DAG) const {
1880 if (!Subtarget->is64Bit())
1881 // This doesn't have SDLoc associated with it, but is not really the
1882 // same as a Register.
1883 return DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy());
1887 /// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1888 /// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1890 const MCExpr *X86TargetLowering::
1891 getPICJumpTableRelocBaseExpr(const MachineFunction *MF, unsigned JTI,
1892 MCContext &Ctx) const {
1893 // X86-64 uses RIP relative addressing based on the jump table label.
1894 if (Subtarget->isPICStyleRIPRel())
1895 return TargetLowering::getPICJumpTableRelocBaseExpr(MF, JTI, Ctx);
1897 // Otherwise, the reference is relative to the PIC base.
1898 return MCSymbolRefExpr::Create(MF->getPICBaseSymbol(), Ctx);
1901 // FIXME: Why this routine is here? Move to RegInfo!
1902 std::pair<const TargetRegisterClass*, uint8_t>
1903 X86TargetLowering::findRepresentativeClass(MVT VT) const{
1904 const TargetRegisterClass *RRC = nullptr;
1906 switch (VT.SimpleTy) {
1908 return TargetLowering::findRepresentativeClass(VT);
1909 case MVT::i8: case MVT::i16: case MVT::i32: case MVT::i64:
1910 RRC = Subtarget->is64Bit() ? &X86::GR64RegClass : &X86::GR32RegClass;
1913 RRC = &X86::VR64RegClass;
1915 case MVT::f32: case MVT::f64:
1916 case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
1917 case MVT::v4f32: case MVT::v2f64:
1918 case MVT::v32i8: case MVT::v8i32: case MVT::v4i64: case MVT::v8f32:
1920 RRC = &X86::VR128RegClass;
1923 return std::make_pair(RRC, Cost);
1926 bool X86TargetLowering::getStackCookieLocation(unsigned &AddressSpace,
1927 unsigned &Offset) const {
1928 if (!Subtarget->isTargetLinux())
1931 if (Subtarget->is64Bit()) {
1932 // %fs:0x28, unless we're using a Kernel code model, in which case it's %gs:
1934 if (getTargetMachine().getCodeModel() == CodeModel::Kernel)
1946 bool X86TargetLowering::isNoopAddrSpaceCast(unsigned SrcAS,
1947 unsigned DestAS) const {
1948 assert(SrcAS != DestAS && "Expected different address spaces!");
1950 return SrcAS < 256 && DestAS < 256;
1953 //===----------------------------------------------------------------------===//
1954 // Return Value Calling Convention Implementation
1955 //===----------------------------------------------------------------------===//
1957 #include "X86GenCallingConv.inc"
1960 X86TargetLowering::CanLowerReturn(CallingConv::ID CallConv,
1961 MachineFunction &MF, bool isVarArg,
1962 const SmallVectorImpl<ISD::OutputArg> &Outs,
1963 LLVMContext &Context) const {
1964 SmallVector<CCValAssign, 16> RVLocs;
1965 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, Context);
1966 return CCInfo.CheckReturn(Outs, RetCC_X86);
1969 const MCPhysReg *X86TargetLowering::getScratchRegisters(CallingConv::ID) const {
1970 static const MCPhysReg ScratchRegs[] = { X86::R11, 0 };
1975 X86TargetLowering::LowerReturn(SDValue Chain,
1976 CallingConv::ID CallConv, bool isVarArg,
1977 const SmallVectorImpl<ISD::OutputArg> &Outs,
1978 const SmallVectorImpl<SDValue> &OutVals,
1979 SDLoc dl, SelectionDAG &DAG) const {
1980 MachineFunction &MF = DAG.getMachineFunction();
1981 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
1983 SmallVector<CCValAssign, 16> RVLocs;
1984 CCState CCInfo(CallConv, isVarArg, MF, RVLocs, *DAG.getContext());
1985 CCInfo.AnalyzeReturn(Outs, RetCC_X86);
1988 SmallVector<SDValue, 6> RetOps;
1989 RetOps.push_back(Chain); // Operand #0 = Chain (updated below)
1990 // Operand #1 = Bytes To Pop
1991 RetOps.push_back(DAG.getTargetConstant(FuncInfo->getBytesToPopOnReturn(),
1994 // Copy the result values into the output registers.
1995 for (unsigned i = 0; i != RVLocs.size(); ++i) {
1996 CCValAssign &VA = RVLocs[i];
1997 assert(VA.isRegLoc() && "Can only return in registers!");
1998 SDValue ValToCopy = OutVals[i];
1999 EVT ValVT = ValToCopy.getValueType();
2001 // Promote values to the appropriate types
2002 if (VA.getLocInfo() == CCValAssign::SExt)
2003 ValToCopy = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), ValToCopy);
2004 else if (VA.getLocInfo() == CCValAssign::ZExt)
2005 ValToCopy = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), ValToCopy);
2006 else if (VA.getLocInfo() == CCValAssign::AExt)
2007 ValToCopy = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), ValToCopy);
2008 else if (VA.getLocInfo() == CCValAssign::BCvt)
2009 ValToCopy = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), ValToCopy);
2011 assert(VA.getLocInfo() != CCValAssign::FPExt &&
2012 "Unexpected FP-extend for return value.");
2014 // If this is x86-64, and we disabled SSE, we can't return FP values,
2015 // or SSE or MMX vectors.
2016 if ((ValVT == MVT::f32 || ValVT == MVT::f64 ||
2017 VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) &&
2018 (Subtarget->is64Bit() && !Subtarget->hasSSE1())) {
2019 report_fatal_error("SSE register return with SSE disabled");
2021 // Likewise we can't return F64 values with SSE1 only. gcc does so, but
2022 // llvm-gcc has never done it right and no one has noticed, so this
2023 // should be OK for now.
2024 if (ValVT == MVT::f64 &&
2025 (Subtarget->is64Bit() && !Subtarget->hasSSE2()))
2026 report_fatal_error("SSE2 register return with SSE2 disabled");
2028 // Returns in ST0/ST1 are handled specially: these are pushed as operands to
2029 // the RET instruction and handled by the FP Stackifier.
2030 if (VA.getLocReg() == X86::FP0 ||
2031 VA.getLocReg() == X86::FP1) {
2032 // If this is a copy from an xmm register to ST(0), use an FPExtend to
2033 // change the value to the FP stack register class.
2034 if (isScalarFPTypeInSSEReg(VA.getValVT()))
2035 ValToCopy = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f80, ValToCopy);
2036 RetOps.push_back(ValToCopy);
2037 // Don't emit a copytoreg.
2041 // 64-bit vector (MMX) values are returned in XMM0 / XMM1 except for v1i64
2042 // which is returned in RAX / RDX.
2043 if (Subtarget->is64Bit()) {
2044 if (ValVT == MVT::x86mmx) {
2045 if (VA.getLocReg() == X86::XMM0 || VA.getLocReg() == X86::XMM1) {
2046 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ValToCopy);
2047 ValToCopy = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
2049 // If we don't have SSE2 available, convert to v4f32 so the generated
2050 // register is legal.
2051 if (!Subtarget->hasSSE2())
2052 ValToCopy = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32,ValToCopy);
2057 Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), ValToCopy, Flag);
2058 Flag = Chain.getValue(1);
2059 RetOps.push_back(DAG.getRegister(VA.getLocReg(), VA.getLocVT()));
2062 // The x86-64 ABIs require that for returning structs by value we copy
2063 // the sret argument into %rax/%eax (depending on ABI) for the return.
2064 // Win32 requires us to put the sret argument to %eax as well.
2065 // We saved the argument into a virtual register in the entry block,
2066 // so now we copy the value out and into %rax/%eax.
2067 if (DAG.getMachineFunction().getFunction()->hasStructRetAttr() &&
2068 (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC())) {
2069 MachineFunction &MF = DAG.getMachineFunction();
2070 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2071 unsigned Reg = FuncInfo->getSRetReturnReg();
2073 "SRetReturnReg should have been set in LowerFormalArguments().");
2074 SDValue Val = DAG.getCopyFromReg(Chain, dl, Reg, getPointerTy());
2077 = (Subtarget->is64Bit() && !Subtarget->isTarget64BitILP32()) ?
2078 X86::RAX : X86::EAX;
2079 Chain = DAG.getCopyToReg(Chain, dl, RetValReg, Val, Flag);
2080 Flag = Chain.getValue(1);
2082 // RAX/EAX now acts like a return value.
2083 RetOps.push_back(DAG.getRegister(RetValReg, getPointerTy()));
2086 RetOps[0] = Chain; // Update chain.
2088 // Add the flag if we have it.
2090 RetOps.push_back(Flag);
2092 return DAG.getNode(X86ISD::RET_FLAG, dl, MVT::Other, RetOps);
2095 bool X86TargetLowering::isUsedByReturnOnly(SDNode *N, SDValue &Chain) const {
2096 if (N->getNumValues() != 1)
2098 if (!N->hasNUsesOfValue(1, 0))
2101 SDValue TCChain = Chain;
2102 SDNode *Copy = *N->use_begin();
2103 if (Copy->getOpcode() == ISD::CopyToReg) {
2104 // If the copy has a glue operand, we conservatively assume it isn't safe to
2105 // perform a tail call.
2106 if (Copy->getOperand(Copy->getNumOperands()-1).getValueType() == MVT::Glue)
2108 TCChain = Copy->getOperand(0);
2109 } else if (Copy->getOpcode() != ISD::FP_EXTEND)
2112 bool HasRet = false;
2113 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
2115 if (UI->getOpcode() != X86ISD::RET_FLAG)
2117 // If we are returning more than one value, we can definitely
2118 // not make a tail call see PR19530
2119 if (UI->getNumOperands() > 4)
2121 if (UI->getNumOperands() == 4 &&
2122 UI->getOperand(UI->getNumOperands()-1).getValueType() != MVT::Glue)
2135 X86TargetLowering::getTypeForExtArgOrReturn(LLVMContext &Context, EVT VT,
2136 ISD::NodeType ExtendKind) const {
2138 // TODO: Is this also valid on 32-bit?
2139 if (Subtarget->is64Bit() && VT == MVT::i1 && ExtendKind == ISD::ZERO_EXTEND)
2140 ReturnMVT = MVT::i8;
2142 ReturnMVT = MVT::i32;
2144 EVT MinVT = getRegisterType(Context, ReturnMVT);
2145 return VT.bitsLT(MinVT) ? MinVT : VT;
2148 /// LowerCallResult - Lower the result values of a call into the
2149 /// appropriate copies out of appropriate physical registers.
2152 X86TargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
2153 CallingConv::ID CallConv, bool isVarArg,
2154 const SmallVectorImpl<ISD::InputArg> &Ins,
2155 SDLoc dl, SelectionDAG &DAG,
2156 SmallVectorImpl<SDValue> &InVals) const {
2158 // Assign locations to each value returned by this call.
2159 SmallVector<CCValAssign, 16> RVLocs;
2160 bool Is64Bit = Subtarget->is64Bit();
2161 CCState CCInfo(CallConv, isVarArg, DAG.getMachineFunction(), RVLocs,
2163 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
2165 // Copy all of the result registers out of their specified physreg.
2166 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
2167 CCValAssign &VA = RVLocs[i];
2168 EVT CopyVT = VA.getValVT();
2170 // If this is x86-64, and we disabled SSE, we can't return FP values
2171 if ((CopyVT == MVT::f32 || CopyVT == MVT::f64) &&
2172 ((Is64Bit || Ins[i].Flags.isInReg()) && !Subtarget->hasSSE1())) {
2173 report_fatal_error("SSE register return with SSE disabled");
2176 // If we prefer to use the value in xmm registers, copy it out as f80 and
2177 // use a truncate to move it from fp stack reg to xmm reg.
2178 if ((VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1) &&
2179 isScalarFPTypeInSSEReg(VA.getValVT()))
2182 Chain = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(),
2183 CopyVT, InFlag).getValue(1);
2184 SDValue Val = Chain.getValue(0);
2186 if (CopyVT != VA.getValVT())
2187 Val = DAG.getNode(ISD::FP_ROUND, dl, VA.getValVT(), Val,
2188 // This truncation won't change the value.
2189 DAG.getIntPtrConstant(1));
2191 InFlag = Chain.getValue(2);
2192 InVals.push_back(Val);
2198 //===----------------------------------------------------------------------===//
2199 // C & StdCall & Fast Calling Convention implementation
2200 //===----------------------------------------------------------------------===//
2201 // StdCall calling convention seems to be standard for many Windows' API
2202 // routines and around. It differs from C calling convention just a little:
2203 // callee should clean up the stack, not caller. Symbols should be also
2204 // decorated in some fancy way :) It doesn't support any vector arguments.
2205 // For info on fast calling convention see Fast Calling Convention (tail call)
2206 // implementation LowerX86_32FastCCCallTo.
2208 /// CallIsStructReturn - Determines whether a call uses struct return
2210 enum StructReturnType {
2215 static StructReturnType
2216 callIsStructReturn(const SmallVectorImpl<ISD::OutputArg> &Outs) {
2218 return NotStructReturn;
2220 const ISD::ArgFlagsTy &Flags = Outs[0].Flags;
2221 if (!Flags.isSRet())
2222 return NotStructReturn;
2223 if (Flags.isInReg())
2224 return RegStructReturn;
2225 return StackStructReturn;
2228 /// ArgsAreStructReturn - Determines whether a function uses struct
2229 /// return semantics.
2230 static StructReturnType
2231 argsAreStructReturn(const SmallVectorImpl<ISD::InputArg> &Ins) {
2233 return NotStructReturn;
2235 const ISD::ArgFlagsTy &Flags = Ins[0].Flags;
2236 if (!Flags.isSRet())
2237 return NotStructReturn;
2238 if (Flags.isInReg())
2239 return RegStructReturn;
2240 return StackStructReturn;
2243 /// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
2244 /// by "Src" to address "Dst" with size and alignment information specified by
2245 /// the specific parameter attribute. The copy will be passed as a byval
2246 /// function parameter.
2248 CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
2249 ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
2251 SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
2253 return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
2254 /*isVolatile*/false, /*AlwaysInline=*/true,
2255 MachinePointerInfo(), MachinePointerInfo());
2258 /// IsTailCallConvention - Return true if the calling convention is one that
2259 /// supports tail call optimization.
2260 static bool IsTailCallConvention(CallingConv::ID CC) {
2261 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2262 CC == CallingConv::HiPE);
2265 /// \brief Return true if the calling convention is a C calling convention.
2266 static bool IsCCallConvention(CallingConv::ID CC) {
2267 return (CC == CallingConv::C || CC == CallingConv::X86_64_Win64 ||
2268 CC == CallingConv::X86_64_SysV);
2271 bool X86TargetLowering::mayBeEmittedAsTailCall(CallInst *CI) const {
2272 if (!CI->isTailCall() || getTargetMachine().Options.DisableTailCalls)
2276 CallingConv::ID CalleeCC = CS.getCallingConv();
2277 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
2283 /// FuncIsMadeTailCallSafe - Return true if the function is being made into
2284 /// a tailcall target by changing its ABI.
2285 static bool FuncIsMadeTailCallSafe(CallingConv::ID CC,
2286 bool GuaranteedTailCallOpt) {
2287 return GuaranteedTailCallOpt && IsTailCallConvention(CC);
2291 X86TargetLowering::LowerMemArgument(SDValue Chain,
2292 CallingConv::ID CallConv,
2293 const SmallVectorImpl<ISD::InputArg> &Ins,
2294 SDLoc dl, SelectionDAG &DAG,
2295 const CCValAssign &VA,
2296 MachineFrameInfo *MFI,
2298 // Create the nodes corresponding to a load from this parameter slot.
2299 ISD::ArgFlagsTy Flags = Ins[i].Flags;
2300 bool AlwaysUseMutable = FuncIsMadeTailCallSafe(
2301 CallConv, DAG.getTarget().Options.GuaranteedTailCallOpt);
2302 bool isImmutable = !AlwaysUseMutable && !Flags.isByVal();
2305 // If value is passed by pointer we have address passed instead of the value
2307 if (VA.getLocInfo() == CCValAssign::Indirect)
2308 ValVT = VA.getLocVT();
2310 ValVT = VA.getValVT();
2312 // FIXME: For now, all byval parameter objects are marked mutable. This can be
2313 // changed with more analysis.
2314 // In case of tail call optimization mark all arguments mutable. Since they
2315 // could be overwritten by lowering of arguments in case of a tail call.
2316 if (Flags.isByVal()) {
2317 unsigned Bytes = Flags.getByValSize();
2318 if (Bytes == 0) Bytes = 1; // Don't create zero-sized stack objects.
2319 int FI = MFI->CreateFixedObject(Bytes, VA.getLocMemOffset(), isImmutable);
2320 return DAG.getFrameIndex(FI, getPointerTy());
2322 int FI = MFI->CreateFixedObject(ValVT.getSizeInBits()/8,
2323 VA.getLocMemOffset(), isImmutable);
2324 SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
2325 return DAG.getLoad(ValVT, dl, Chain, FIN,
2326 MachinePointerInfo::getFixedStack(FI),
2327 false, false, false, 0);
2331 // FIXME: Get this from tablegen.
2332 static ArrayRef<MCPhysReg> get64BitArgumentGPRs(CallingConv::ID CallConv,
2333 const X86Subtarget *Subtarget) {
2334 assert(Subtarget->is64Bit());
2336 if (Subtarget->isCallingConvWin64(CallConv)) {
2337 static const MCPhysReg GPR64ArgRegsWin64[] = {
2338 X86::RCX, X86::RDX, X86::R8, X86::R9
2340 return makeArrayRef(std::begin(GPR64ArgRegsWin64), std::end(GPR64ArgRegsWin64));
2343 static const MCPhysReg GPR64ArgRegs64Bit[] = {
2344 X86::RDI, X86::RSI, X86::RDX, X86::RCX, X86::R8, X86::R9
2346 return makeArrayRef(std::begin(GPR64ArgRegs64Bit), std::end(GPR64ArgRegs64Bit));
2349 // FIXME: Get this from tablegen.
2350 static ArrayRef<MCPhysReg> get64BitArgumentXMMs(MachineFunction &MF,
2351 CallingConv::ID CallConv,
2352 const X86Subtarget *Subtarget) {
2353 assert(Subtarget->is64Bit());
2354 if (Subtarget->isCallingConvWin64(CallConv)) {
2355 // The XMM registers which might contain var arg parameters are shadowed
2356 // in their paired GPR. So we only need to save the GPR to their home
2358 // TODO: __vectorcall will change this.
2362 const Function *Fn = MF.getFunction();
2363 bool NoImplicitFloatOps = Fn->getAttributes().
2364 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
2365 assert(!(MF.getTarget().Options.UseSoftFloat && NoImplicitFloatOps) &&
2366 "SSE register cannot be used when SSE is disabled!");
2367 if (MF.getTarget().Options.UseSoftFloat || NoImplicitFloatOps ||
2368 !Subtarget->hasSSE1())
2369 // Kernel mode asks for SSE to be disabled, so there are no XMM argument
2373 static const MCPhysReg XMMArgRegs64Bit[] = {
2374 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2375 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2377 return makeArrayRef(std::begin(XMMArgRegs64Bit), std::end(XMMArgRegs64Bit));
2381 X86TargetLowering::LowerFormalArguments(SDValue Chain,
2382 CallingConv::ID CallConv,
2384 const SmallVectorImpl<ISD::InputArg> &Ins,
2387 SmallVectorImpl<SDValue> &InVals)
2389 MachineFunction &MF = DAG.getMachineFunction();
2390 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
2392 const Function* Fn = MF.getFunction();
2393 if (Fn->hasExternalLinkage() &&
2394 Subtarget->isTargetCygMing() &&
2395 Fn->getName() == "main")
2396 FuncInfo->setForceFramePointer(true);
2398 MachineFrameInfo *MFI = MF.getFrameInfo();
2399 bool Is64Bit = Subtarget->is64Bit();
2400 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2402 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2403 "Var args not supported with calling convention fastcc, ghc or hipe");
2405 // Assign locations to all of the incoming arguments.
2406 SmallVector<CCValAssign, 16> ArgLocs;
2407 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2409 // Allocate shadow area for Win64
2411 CCInfo.AllocateStack(32, 8);
2413 CCInfo.AnalyzeFormalArguments(Ins, CC_X86);
2415 unsigned LastVal = ~0U;
2417 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2418 CCValAssign &VA = ArgLocs[i];
2419 // TODO: If an arg is passed in two places (e.g. reg and stack), skip later
2421 assert(VA.getValNo() != LastVal &&
2422 "Don't support value assigned to multiple locs yet");
2424 LastVal = VA.getValNo();
2426 if (VA.isRegLoc()) {
2427 EVT RegVT = VA.getLocVT();
2428 const TargetRegisterClass *RC;
2429 if (RegVT == MVT::i32)
2430 RC = &X86::GR32RegClass;
2431 else if (Is64Bit && RegVT == MVT::i64)
2432 RC = &X86::GR64RegClass;
2433 else if (RegVT == MVT::f32)
2434 RC = &X86::FR32RegClass;
2435 else if (RegVT == MVT::f64)
2436 RC = &X86::FR64RegClass;
2437 else if (RegVT.is512BitVector())
2438 RC = &X86::VR512RegClass;
2439 else if (RegVT.is256BitVector())
2440 RC = &X86::VR256RegClass;
2441 else if (RegVT.is128BitVector())
2442 RC = &X86::VR128RegClass;
2443 else if (RegVT == MVT::x86mmx)
2444 RC = &X86::VR64RegClass;
2445 else if (RegVT == MVT::i1)
2446 RC = &X86::VK1RegClass;
2447 else if (RegVT == MVT::v8i1)
2448 RC = &X86::VK8RegClass;
2449 else if (RegVT == MVT::v16i1)
2450 RC = &X86::VK16RegClass;
2451 else if (RegVT == MVT::v32i1)
2452 RC = &X86::VK32RegClass;
2453 else if (RegVT == MVT::v64i1)
2454 RC = &X86::VK64RegClass;
2456 llvm_unreachable("Unknown argument type!");
2458 unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC);
2459 ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
2461 // If this is an 8 or 16-bit value, it is really passed promoted to 32
2462 // bits. Insert an assert[sz]ext to capture this, then truncate to the
2464 if (VA.getLocInfo() == CCValAssign::SExt)
2465 ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
2466 DAG.getValueType(VA.getValVT()));
2467 else if (VA.getLocInfo() == CCValAssign::ZExt)
2468 ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
2469 DAG.getValueType(VA.getValVT()));
2470 else if (VA.getLocInfo() == CCValAssign::BCvt)
2471 ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
2473 if (VA.isExtInLoc()) {
2474 // Handle MMX values passed in XMM regs.
2475 if (RegVT.isVector())
2476 ArgValue = DAG.getNode(X86ISD::MOVDQ2Q, dl, VA.getValVT(), ArgValue);
2478 ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
2481 assert(VA.isMemLoc());
2482 ArgValue = LowerMemArgument(Chain, CallConv, Ins, dl, DAG, VA, MFI, i);
2485 // If value is passed via pointer - do a load.
2486 if (VA.getLocInfo() == CCValAssign::Indirect)
2487 ArgValue = DAG.getLoad(VA.getValVT(), dl, Chain, ArgValue,
2488 MachinePointerInfo(), false, false, false, 0);
2490 InVals.push_back(ArgValue);
2493 if (Subtarget->is64Bit() || Subtarget->isTargetKnownWindowsMSVC()) {
2494 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2495 // The x86-64 ABIs require that for returning structs by value we copy
2496 // the sret argument into %rax/%eax (depending on ABI) for the return.
2497 // Win32 requires us to put the sret argument to %eax as well.
2498 // Save the argument into a virtual register so that we can access it
2499 // from the return points.
2500 if (Ins[i].Flags.isSRet()) {
2501 unsigned Reg = FuncInfo->getSRetReturnReg();
2503 MVT PtrTy = getPointerTy();
2504 Reg = MF.getRegInfo().createVirtualRegister(getRegClassFor(PtrTy));
2505 FuncInfo->setSRetReturnReg(Reg);
2507 SDValue Copy = DAG.getCopyToReg(DAG.getEntryNode(), dl, Reg, InVals[i]);
2508 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Copy, Chain);
2514 unsigned StackSize = CCInfo.getNextStackOffset();
2515 // Align stack specially for tail calls.
2516 if (FuncIsMadeTailCallSafe(CallConv,
2517 MF.getTarget().Options.GuaranteedTailCallOpt))
2518 StackSize = GetAlignedArgumentStackSize(StackSize, DAG);
2520 // If the function takes variable number of arguments, make a frame index for
2521 // the start of the first vararg value... for expansion of llvm.va_start. We
2522 // can skip this if there are no va_start calls.
2523 if (MFI->hasVAStart() &&
2524 (Is64Bit || (CallConv != CallingConv::X86_FastCall &&
2525 CallConv != CallingConv::X86_ThisCall))) {
2526 FuncInfo->setVarArgsFrameIndex(
2527 MFI->CreateFixedObject(1, StackSize, true));
2530 // 64-bit calling conventions support varargs and register parameters, so we
2531 // have to do extra work to spill them in the prologue or forward them to
2533 if (Is64Bit && isVarArg &&
2534 (MFI->hasVAStart() || MFI->hasMustTailInVarArgFunc())) {
2535 // Find the first unallocated argument registers.
2536 ArrayRef<MCPhysReg> ArgGPRs = get64BitArgumentGPRs(CallConv, Subtarget);
2537 ArrayRef<MCPhysReg> ArgXMMs = get64BitArgumentXMMs(MF, CallConv, Subtarget);
2538 unsigned NumIntRegs =
2539 CCInfo.getFirstUnallocated(ArgGPRs.data(), ArgGPRs.size());
2540 unsigned NumXMMRegs =
2541 CCInfo.getFirstUnallocated(ArgXMMs.data(), ArgXMMs.size());
2542 assert(!(NumXMMRegs && !Subtarget->hasSSE1()) &&
2543 "SSE register cannot be used when SSE is disabled!");
2545 // Gather all the live in physical registers.
2546 SmallVector<SDValue, 6> LiveGPRs;
2547 SmallVector<SDValue, 8> LiveXMMRegs;
2549 for (MCPhysReg Reg : ArgGPRs.slice(NumIntRegs)) {
2550 unsigned GPR = MF.addLiveIn(Reg, &X86::GR64RegClass);
2552 DAG.getCopyFromReg(Chain, dl, GPR, MVT::i64));
2554 if (!ArgXMMs.empty()) {
2555 unsigned AL = MF.addLiveIn(X86::AL, &X86::GR8RegClass);
2556 ALVal = DAG.getCopyFromReg(Chain, dl, AL, MVT::i8);
2557 for (MCPhysReg Reg : ArgXMMs.slice(NumXMMRegs)) {
2558 unsigned XMMReg = MF.addLiveIn(Reg, &X86::VR128RegClass);
2559 LiveXMMRegs.push_back(
2560 DAG.getCopyFromReg(Chain, dl, XMMReg, MVT::v4f32));
2564 // Store them to the va_list returned by va_start.
2565 if (MFI->hasVAStart()) {
2567 const TargetFrameLowering &TFI = *MF.getSubtarget().getFrameLowering();
2568 // Get to the caller-allocated home save location. Add 8 to account
2569 // for the return address.
2570 int HomeOffset = TFI.getOffsetOfLocalArea() + 8;
2571 FuncInfo->setRegSaveFrameIndex(
2572 MFI->CreateFixedObject(1, NumIntRegs * 8 + HomeOffset, false));
2573 // Fixup to set vararg frame on shadow area (4 x i64).
2575 FuncInfo->setVarArgsFrameIndex(FuncInfo->getRegSaveFrameIndex());
2577 // For X86-64, if there are vararg parameters that are passed via
2578 // registers, then we must store them to their spots on the stack so
2579 // they may be loaded by deferencing the result of va_next.
2580 FuncInfo->setVarArgsGPOffset(NumIntRegs * 8);
2581 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
2582 FuncInfo->setRegSaveFrameIndex(MFI->CreateStackObject(
2583 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
2586 // Store the integer parameter registers.
2587 SmallVector<SDValue, 8> MemOps;
2588 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
2590 unsigned Offset = FuncInfo->getVarArgsGPOffset();
2591 for (SDValue Val : LiveGPRs) {
2592 SDValue FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), RSFIN,
2593 DAG.getIntPtrConstant(Offset));
2595 DAG.getStore(Val.getValue(1), dl, Val, FIN,
2596 MachinePointerInfo::getFixedStack(
2597 FuncInfo->getRegSaveFrameIndex(), Offset),
2599 MemOps.push_back(Store);
2603 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
2604 // Now store the XMM (fp + vector) parameter registers.
2605 SmallVector<SDValue, 12> SaveXMMOps;
2606 SaveXMMOps.push_back(Chain);
2607 SaveXMMOps.push_back(ALVal);
2608 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2609 FuncInfo->getRegSaveFrameIndex()));
2610 SaveXMMOps.push_back(DAG.getIntPtrConstant(
2611 FuncInfo->getVarArgsFPOffset()));
2612 SaveXMMOps.insert(SaveXMMOps.end(), LiveXMMRegs.begin(),
2614 MemOps.push_back(DAG.getNode(X86ISD::VASTART_SAVE_XMM_REGS, dl,
2615 MVT::Other, SaveXMMOps));
2618 if (!MemOps.empty())
2619 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOps);
2621 // Add all GPRs, al, and XMMs to the list of forwards. We will add then
2622 // to the liveout set on a musttail call.
2623 assert(MFI->hasMustTailInVarArgFunc());
2624 auto &Forwards = FuncInfo->getForwardedMustTailRegParms();
2625 typedef X86MachineFunctionInfo::Forward Forward;
2627 for (unsigned I = 0, E = LiveGPRs.size(); I != E; ++I) {
2629 MF.getRegInfo().createVirtualRegister(&X86::GR64RegClass);
2630 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveGPRs[I]);
2631 Forwards.push_back(Forward(VReg, ArgGPRs[NumIntRegs + I], MVT::i64));
2634 if (!ArgXMMs.empty()) {
2636 MF.getRegInfo().createVirtualRegister(&X86::GR8RegClass);
2637 Chain = DAG.getCopyToReg(Chain, dl, ALVReg, ALVal);
2638 Forwards.push_back(Forward(ALVReg, X86::AL, MVT::i8));
2640 for (unsigned I = 0, E = LiveXMMRegs.size(); I != E; ++I) {
2642 MF.getRegInfo().createVirtualRegister(&X86::VR128RegClass);
2643 Chain = DAG.getCopyToReg(Chain, dl, VReg, LiveXMMRegs[I]);
2645 Forward(VReg, ArgXMMs[NumXMMRegs + I], MVT::v4f32));
2651 // Some CCs need callee pop.
2652 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
2653 MF.getTarget().Options.GuaranteedTailCallOpt)) {
2654 FuncInfo->setBytesToPopOnReturn(StackSize); // Callee pops everything.
2656 FuncInfo->setBytesToPopOnReturn(0); // Callee pops nothing.
2657 // If this is an sret function, the return should pop the hidden pointer.
2658 if (!Is64Bit && !IsTailCallConvention(CallConv) &&
2659 !Subtarget->getTargetTriple().isOSMSVCRT() &&
2660 argsAreStructReturn(Ins) == StackStructReturn)
2661 FuncInfo->setBytesToPopOnReturn(4);
2665 // RegSaveFrameIndex is X86-64 only.
2666 FuncInfo->setRegSaveFrameIndex(0xAAAAAAA);
2667 if (CallConv == CallingConv::X86_FastCall ||
2668 CallConv == CallingConv::X86_ThisCall)
2669 // fastcc functions can't have varargs.
2670 FuncInfo->setVarArgsFrameIndex(0xAAAAAAA);
2673 FuncInfo->setArgumentStackSize(StackSize);
2679 X86TargetLowering::LowerMemOpCallTo(SDValue Chain,
2680 SDValue StackPtr, SDValue Arg,
2681 SDLoc dl, SelectionDAG &DAG,
2682 const CCValAssign &VA,
2683 ISD::ArgFlagsTy Flags) const {
2684 unsigned LocMemOffset = VA.getLocMemOffset();
2685 SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
2686 PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
2687 if (Flags.isByVal())
2688 return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
2690 return DAG.getStore(Chain, dl, Arg, PtrOff,
2691 MachinePointerInfo::getStack(LocMemOffset),
2695 /// EmitTailCallLoadRetAddr - Emit a load of return address if tail call
2696 /// optimization is performed and it is required.
2698 X86TargetLowering::EmitTailCallLoadRetAddr(SelectionDAG &DAG,
2699 SDValue &OutRetAddr, SDValue Chain,
2700 bool IsTailCall, bool Is64Bit,
2701 int FPDiff, SDLoc dl) const {
2702 // Adjust the Return address stack slot.
2703 EVT VT = getPointerTy();
2704 OutRetAddr = getReturnAddressFrameIndex(DAG);
2706 // Load the "old" Return address.
2707 OutRetAddr = DAG.getLoad(VT, dl, Chain, OutRetAddr, MachinePointerInfo(),
2708 false, false, false, 0);
2709 return SDValue(OutRetAddr.getNode(), 1);
2712 /// EmitTailCallStoreRetAddr - Emit a store of the return address if tail call
2713 /// optimization is performed and it is required (FPDiff!=0).
2714 static SDValue EmitTailCallStoreRetAddr(SelectionDAG &DAG, MachineFunction &MF,
2715 SDValue Chain, SDValue RetAddrFrIdx,
2716 EVT PtrVT, unsigned SlotSize,
2717 int FPDiff, SDLoc dl) {
2718 // Store the return address to the appropriate stack slot.
2719 if (!FPDiff) return Chain;
2720 // Calculate the new stack slot for the return address.
2721 int NewReturnAddrFI =
2722 MF.getFrameInfo()->CreateFixedObject(SlotSize, (int64_t)FPDiff - SlotSize,
2724 SDValue NewRetAddrFrIdx = DAG.getFrameIndex(NewReturnAddrFI, PtrVT);
2725 Chain = DAG.getStore(Chain, dl, RetAddrFrIdx, NewRetAddrFrIdx,
2726 MachinePointerInfo::getFixedStack(NewReturnAddrFI),
2732 X86TargetLowering::LowerCall(TargetLowering::CallLoweringInfo &CLI,
2733 SmallVectorImpl<SDValue> &InVals) const {
2734 SelectionDAG &DAG = CLI.DAG;
2736 SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
2737 SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
2738 SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
2739 SDValue Chain = CLI.Chain;
2740 SDValue Callee = CLI.Callee;
2741 CallingConv::ID CallConv = CLI.CallConv;
2742 bool &isTailCall = CLI.IsTailCall;
2743 bool isVarArg = CLI.IsVarArg;
2745 MachineFunction &MF = DAG.getMachineFunction();
2746 bool Is64Bit = Subtarget->is64Bit();
2747 bool IsWin64 = Subtarget->isCallingConvWin64(CallConv);
2748 StructReturnType SR = callIsStructReturn(Outs);
2749 bool IsSibcall = false;
2750 X86MachineFunctionInfo *X86Info = MF.getInfo<X86MachineFunctionInfo>();
2752 if (MF.getTarget().Options.DisableTailCalls)
2755 bool IsMustTail = CLI.CS && CLI.CS->isMustTailCall();
2757 // Force this to be a tail call. The verifier rules are enough to ensure
2758 // that we can lower this successfully without moving the return address
2761 } else if (isTailCall) {
2762 // Check if it's really possible to do a tail call.
2763 isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
2764 isVarArg, SR != NotStructReturn,
2765 MF.getFunction()->hasStructRetAttr(), CLI.RetTy,
2766 Outs, OutVals, Ins, DAG);
2768 // Sibcalls are automatically detected tailcalls which do not require
2770 if (!MF.getTarget().Options.GuaranteedTailCallOpt && isTailCall)
2777 assert(!(isVarArg && IsTailCallConvention(CallConv)) &&
2778 "Var args not supported with calling convention fastcc, ghc or hipe");
2780 // Analyze operands of the call, assigning locations to each operand.
2781 SmallVector<CCValAssign, 16> ArgLocs;
2782 CCState CCInfo(CallConv, isVarArg, MF, ArgLocs, *DAG.getContext());
2784 // Allocate shadow area for Win64
2786 CCInfo.AllocateStack(32, 8);
2788 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
2790 // Get a count of how many bytes are to be pushed on the stack.
2791 unsigned NumBytes = CCInfo.getNextStackOffset();
2793 // This is a sibcall. The memory operands are available in caller's
2794 // own caller's stack.
2796 else if (MF.getTarget().Options.GuaranteedTailCallOpt &&
2797 IsTailCallConvention(CallConv))
2798 NumBytes = GetAlignedArgumentStackSize(NumBytes, DAG);
2801 if (isTailCall && !IsSibcall && !IsMustTail) {
2802 // Lower arguments at fp - stackoffset + fpdiff.
2803 unsigned NumBytesCallerPushed = X86Info->getBytesToPopOnReturn();
2805 FPDiff = NumBytesCallerPushed - NumBytes;
2807 // Set the delta of movement of the returnaddr stackslot.
2808 // But only set if delta is greater than previous delta.
2809 if (FPDiff < X86Info->getTCReturnAddrDelta())
2810 X86Info->setTCReturnAddrDelta(FPDiff);
2813 unsigned NumBytesToPush = NumBytes;
2814 unsigned NumBytesToPop = NumBytes;
2816 // If we have an inalloca argument, all stack space has already been allocated
2817 // for us and be right at the top of the stack. We don't support multiple
2818 // arguments passed in memory when using inalloca.
2819 if (!Outs.empty() && Outs.back().Flags.isInAlloca()) {
2821 if (!ArgLocs.back().isMemLoc())
2822 report_fatal_error("cannot use inalloca attribute on a register "
2824 if (ArgLocs.back().getLocMemOffset() != 0)
2825 report_fatal_error("any parameter with the inalloca attribute must be "
2826 "the only memory argument");
2830 Chain = DAG.getCALLSEQ_START(
2831 Chain, DAG.getIntPtrConstant(NumBytesToPush, true), dl);
2833 SDValue RetAddrFrIdx;
2834 // Load return address for tail calls.
2835 if (isTailCall && FPDiff)
2836 Chain = EmitTailCallLoadRetAddr(DAG, RetAddrFrIdx, Chain, isTailCall,
2837 Is64Bit, FPDiff, dl);
2839 SmallVector<std::pair<unsigned, SDValue>, 8> RegsToPass;
2840 SmallVector<SDValue, 8> MemOpChains;
2843 // Walk the register/memloc assignments, inserting copies/loads. In the case
2844 // of tail call optimization arguments are handle later.
2845 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
2846 DAG.getSubtarget().getRegisterInfo());
2847 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2848 // Skip inalloca arguments, they have already been written.
2849 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2850 if (Flags.isInAlloca())
2853 CCValAssign &VA = ArgLocs[i];
2854 EVT RegVT = VA.getLocVT();
2855 SDValue Arg = OutVals[i];
2856 bool isByVal = Flags.isByVal();
2858 // Promote the value if needed.
2859 switch (VA.getLocInfo()) {
2860 default: llvm_unreachable("Unknown loc info!");
2861 case CCValAssign::Full: break;
2862 case CCValAssign::SExt:
2863 Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, RegVT, Arg);
2865 case CCValAssign::ZExt:
2866 Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, RegVT, Arg);
2868 case CCValAssign::AExt:
2869 if (RegVT.is128BitVector()) {
2870 // Special case: passing MMX values in XMM registers.
2871 Arg = DAG.getNode(ISD::BITCAST, dl, MVT::i64, Arg);
2872 Arg = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64, Arg);
2873 Arg = getMOVL(DAG, dl, MVT::v2i64, DAG.getUNDEF(MVT::v2i64), Arg);
2875 Arg = DAG.getNode(ISD::ANY_EXTEND, dl, RegVT, Arg);
2877 case CCValAssign::BCvt:
2878 Arg = DAG.getNode(ISD::BITCAST, dl, RegVT, Arg);
2880 case CCValAssign::Indirect: {
2881 // Store the argument.
2882 SDValue SpillSlot = DAG.CreateStackTemporary(VA.getValVT());
2883 int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
2884 Chain = DAG.getStore(Chain, dl, Arg, SpillSlot,
2885 MachinePointerInfo::getFixedStack(FI),
2892 if (VA.isRegLoc()) {
2893 RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
2894 if (isVarArg && IsWin64) {
2895 // Win64 ABI requires argument XMM reg to be copied to the corresponding
2896 // shadow reg if callee is a varargs function.
2897 unsigned ShadowReg = 0;
2898 switch (VA.getLocReg()) {
2899 case X86::XMM0: ShadowReg = X86::RCX; break;
2900 case X86::XMM1: ShadowReg = X86::RDX; break;
2901 case X86::XMM2: ShadowReg = X86::R8; break;
2902 case X86::XMM3: ShadowReg = X86::R9; break;
2905 RegsToPass.push_back(std::make_pair(ShadowReg, Arg));
2907 } else if (!IsSibcall && (!isTailCall || isByVal)) {
2908 assert(VA.isMemLoc());
2909 if (!StackPtr.getNode())
2910 StackPtr = DAG.getCopyFromReg(Chain, dl, RegInfo->getStackRegister(),
2912 MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
2913 dl, DAG, VA, Flags));
2917 if (!MemOpChains.empty())
2918 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains);
2920 if (Subtarget->isPICStyleGOT()) {
2921 // ELF / PIC requires GOT in the EBX register before function calls via PLT
2924 RegsToPass.push_back(std::make_pair(unsigned(X86::EBX),
2925 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), getPointerTy())));
2927 // If we are tail calling and generating PIC/GOT style code load the
2928 // address of the callee into ECX. The value in ecx is used as target of
2929 // the tail jump. This is done to circumvent the ebx/callee-saved problem
2930 // for tail calls on PIC/GOT architectures. Normally we would just put the
2931 // address of GOT into ebx and then call target@PLT. But for tail calls
2932 // ebx would be restored (since ebx is callee saved) before jumping to the
2935 // Note: The actual moving to ECX is done further down.
2936 GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee);
2937 if (G && !G->getGlobal()->hasHiddenVisibility() &&
2938 !G->getGlobal()->hasProtectedVisibility())
2939 Callee = LowerGlobalAddress(Callee, DAG);
2940 else if (isa<ExternalSymbolSDNode>(Callee))
2941 Callee = LowerExternalSymbol(Callee, DAG);
2945 if (Is64Bit && isVarArg && !IsWin64 && !IsMustTail) {
2946 // From AMD64 ABI document:
2947 // For calls that may call functions that use varargs or stdargs
2948 // (prototype-less calls or calls to functions containing ellipsis (...) in
2949 // the declaration) %al is used as hidden argument to specify the number
2950 // of SSE registers used. The contents of %al do not need to match exactly
2951 // the number of registers, but must be an ubound on the number of SSE
2952 // registers used and is in the range 0 - 8 inclusive.
2954 // Count the number of XMM registers allocated.
2955 static const MCPhysReg XMMArgRegs[] = {
2956 X86::XMM0, X86::XMM1, X86::XMM2, X86::XMM3,
2957 X86::XMM4, X86::XMM5, X86::XMM6, X86::XMM7
2959 unsigned NumXMMRegs = CCInfo.getFirstUnallocated(XMMArgRegs, 8);
2960 assert((Subtarget->hasSSE1() || !NumXMMRegs)
2961 && "SSE registers cannot be used when SSE is disabled");
2963 RegsToPass.push_back(std::make_pair(unsigned(X86::AL),
2964 DAG.getConstant(NumXMMRegs, MVT::i8)));
2967 if (Is64Bit && isVarArg && IsMustTail) {
2968 const auto &Forwards = X86Info->getForwardedMustTailRegParms();
2969 for (const auto &F : Forwards) {
2970 SDValue Val = DAG.getCopyFromReg(Chain, dl, F.VReg, F.VT);
2971 RegsToPass.push_back(std::make_pair(unsigned(F.PReg), Val));
2975 // For tail calls lower the arguments to the 'real' stack slots. Sibcalls
2976 // don't need this because the eligibility check rejects calls that require
2977 // shuffling arguments passed in memory.
2978 if (!IsSibcall && isTailCall) {
2979 // Force all the incoming stack arguments to be loaded from the stack
2980 // before any new outgoing arguments are stored to the stack, because the
2981 // outgoing stack slots may alias the incoming argument stack slots, and
2982 // the alias isn't otherwise explicit. This is slightly more conservative
2983 // than necessary, because it means that each store effectively depends
2984 // on every argument instead of just those arguments it would clobber.
2985 SDValue ArgChain = DAG.getStackArgumentTokenFactor(Chain);
2987 SmallVector<SDValue, 8> MemOpChains2;
2990 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2991 CCValAssign &VA = ArgLocs[i];
2994 assert(VA.isMemLoc());
2995 SDValue Arg = OutVals[i];
2996 ISD::ArgFlagsTy Flags = Outs[i].Flags;
2997 // Skip inalloca arguments. They don't require any work.
2998 if (Flags.isInAlloca())
3000 // Create frame index.
3001 int32_t Offset = VA.getLocMemOffset()+FPDiff;
3002 uint32_t OpSize = (VA.getLocVT().getSizeInBits()+7)/8;
3003 FI = MF.getFrameInfo()->CreateFixedObject(OpSize, Offset, true);
3004 FIN = DAG.getFrameIndex(FI, getPointerTy());
3006 if (Flags.isByVal()) {
3007 // Copy relative to framepointer.
3008 SDValue Source = DAG.getIntPtrConstant(VA.getLocMemOffset());
3009 if (!StackPtr.getNode())
3010 StackPtr = DAG.getCopyFromReg(Chain, dl,
3011 RegInfo->getStackRegister(),
3013 Source = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, Source);
3015 MemOpChains2.push_back(CreateCopyOfByValArgument(Source, FIN,
3019 // Store relative to framepointer.
3020 MemOpChains2.push_back(
3021 DAG.getStore(ArgChain, dl, Arg, FIN,
3022 MachinePointerInfo::getFixedStack(FI),
3027 if (!MemOpChains2.empty())
3028 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, MemOpChains2);
3030 // Store the return address to the appropriate stack slot.
3031 Chain = EmitTailCallStoreRetAddr(DAG, MF, Chain, RetAddrFrIdx,
3032 getPointerTy(), RegInfo->getSlotSize(),
3036 // Build a sequence of copy-to-reg nodes chained together with token chain
3037 // and flag operands which copy the outgoing args into registers.
3039 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
3040 Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
3041 RegsToPass[i].second, InFlag);
3042 InFlag = Chain.getValue(1);
3045 if (DAG.getTarget().getCodeModel() == CodeModel::Large) {
3046 assert(Is64Bit && "Large code model is only legal in 64-bit mode.");
3047 // In the 64-bit large code model, we have to make all calls
3048 // through a register, since the call instruction's 32-bit
3049 // pc-relative offset may not be large enough to hold the whole
3051 } else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
3052 // If the callee is a GlobalAddress node (quite common, every direct call
3053 // is) turn it into a TargetGlobalAddress node so that legalize doesn't hack
3056 // We should use extra load for direct calls to dllimported functions in
3058 const GlobalValue *GV = G->getGlobal();
3059 if (!GV->hasDLLImportStorageClass()) {
3060 unsigned char OpFlags = 0;
3061 bool ExtraLoad = false;
3062 unsigned WrapperKind = ISD::DELETED_NODE;
3064 // On ELF targets, in both X86-64 and X86-32 mode, direct calls to
3065 // external symbols most go through the PLT in PIC mode. If the symbol
3066 // has hidden or protected visibility, or if it is static or local, then
3067 // we don't need to use the PLT - we can directly call it.
3068 if (Subtarget->isTargetELF() &&
3069 DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
3070 GV->hasDefaultVisibility() && !GV->hasLocalLinkage()) {
3071 OpFlags = X86II::MO_PLT;
3072 } else if (Subtarget->isPICStyleStubAny() &&
3073 (GV->isDeclaration() || GV->isWeakForLinker()) &&
3074 (!Subtarget->getTargetTriple().isMacOSX() ||
3075 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3076 // PC-relative references to external symbols should go through $stub,
3077 // unless we're building with the leopard linker or later, which
3078 // automatically synthesizes these stubs.
3079 OpFlags = X86II::MO_DARWIN_STUB;
3080 } else if (Subtarget->isPICStyleRIPRel() &&
3081 isa<Function>(GV) &&
3082 cast<Function>(GV)->getAttributes().
3083 hasAttribute(AttributeSet::FunctionIndex,
3084 Attribute::NonLazyBind)) {
3085 // If the function is marked as non-lazy, generate an indirect call
3086 // which loads from the GOT directly. This avoids runtime overhead
3087 // at the cost of eager binding (and one extra byte of encoding).
3088 OpFlags = X86II::MO_GOTPCREL;
3089 WrapperKind = X86ISD::WrapperRIP;
3093 Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(),
3094 G->getOffset(), OpFlags);
3096 // Add a wrapper if needed.
3097 if (WrapperKind != ISD::DELETED_NODE)
3098 Callee = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Callee);
3099 // Add extra indirection if needed.
3101 Callee = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Callee,
3102 MachinePointerInfo::getGOT(),
3103 false, false, false, 0);
3105 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
3106 unsigned char OpFlags = 0;
3108 // On ELF targets, in either X86-64 or X86-32 mode, direct calls to
3109 // external symbols should go through the PLT.
3110 if (Subtarget->isTargetELF() &&
3111 DAG.getTarget().getRelocationModel() == Reloc::PIC_) {
3112 OpFlags = X86II::MO_PLT;
3113 } else if (Subtarget->isPICStyleStubAny() &&
3114 (!Subtarget->getTargetTriple().isMacOSX() ||
3115 Subtarget->getTargetTriple().isMacOSXVersionLT(10, 5))) {
3116 // PC-relative references to external symbols should go through $stub,
3117 // unless we're building with the leopard linker or later, which
3118 // automatically synthesizes these stubs.
3119 OpFlags = X86II::MO_DARWIN_STUB;
3122 Callee = DAG.getTargetExternalSymbol(S->getSymbol(), getPointerTy(),
3124 } else if (Subtarget->isTarget64BitILP32() && Callee->getValueType(0) == MVT::i32) {
3125 // Zero-extend the 32-bit Callee address into a 64-bit according to x32 ABI
3126 Callee = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i64, Callee);
3129 // Returns a chain & a flag for retval copy to use.
3130 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
3131 SmallVector<SDValue, 8> Ops;
3133 if (!IsSibcall && isTailCall) {
3134 Chain = DAG.getCALLSEQ_END(Chain,
3135 DAG.getIntPtrConstant(NumBytesToPop, true),
3136 DAG.getIntPtrConstant(0, true), InFlag, dl);
3137 InFlag = Chain.getValue(1);
3140 Ops.push_back(Chain);
3141 Ops.push_back(Callee);
3144 Ops.push_back(DAG.getConstant(FPDiff, MVT::i32));
3146 // Add argument registers to the end of the list so that they are known live
3148 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
3149 Ops.push_back(DAG.getRegister(RegsToPass[i].first,
3150 RegsToPass[i].second.getValueType()));
3152 // Add a register mask operand representing the call-preserved registers.
3153 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
3154 const uint32_t *Mask = TRI->getCallPreservedMask(CallConv);
3155 assert(Mask && "Missing call preserved mask for calling convention");
3156 Ops.push_back(DAG.getRegisterMask(Mask));
3158 if (InFlag.getNode())
3159 Ops.push_back(InFlag);
3163 //// If this is the first return lowered for this function, add the regs
3164 //// to the liveout set for the function.
3165 // This isn't right, although it's probably harmless on x86; liveouts
3166 // should be computed from returns not tail calls. Consider a void
3167 // function making a tail call to a function returning int.
3168 return DAG.getNode(X86ISD::TC_RETURN, dl, NodeTys, Ops);
3171 Chain = DAG.getNode(X86ISD::CALL, dl, NodeTys, Ops);
3172 InFlag = Chain.getValue(1);
3174 // Create the CALLSEQ_END node.
3175 unsigned NumBytesForCalleeToPop;
3176 if (X86::isCalleePop(CallConv, Is64Bit, isVarArg,
3177 DAG.getTarget().Options.GuaranteedTailCallOpt))
3178 NumBytesForCalleeToPop = NumBytes; // Callee pops everything
3179 else if (!Is64Bit && !IsTailCallConvention(CallConv) &&
3180 !Subtarget->getTargetTriple().isOSMSVCRT() &&
3181 SR == StackStructReturn)
3182 // If this is a call to a struct-return function, the callee
3183 // pops the hidden struct pointer, so we have to push it back.
3184 // This is common for Darwin/X86, Linux & Mingw32 targets.
3185 // For MSVC Win32 targets, the caller pops the hidden struct pointer.
3186 NumBytesForCalleeToPop = 4;
3188 NumBytesForCalleeToPop = 0; // Callee pops nothing.
3190 // Returns a flag for retval copy to use.
3192 Chain = DAG.getCALLSEQ_END(Chain,
3193 DAG.getIntPtrConstant(NumBytesToPop, true),
3194 DAG.getIntPtrConstant(NumBytesForCalleeToPop,
3197 InFlag = Chain.getValue(1);
3200 // Handle result values, copying them out of physregs into vregs that we
3202 return LowerCallResult(Chain, InFlag, CallConv, isVarArg,
3203 Ins, dl, DAG, InVals);
3206 //===----------------------------------------------------------------------===//
3207 // Fast Calling Convention (tail call) implementation
3208 //===----------------------------------------------------------------------===//
3210 // Like std call, callee cleans arguments, convention except that ECX is
3211 // reserved for storing the tail called function address. Only 2 registers are
3212 // free for argument passing (inreg). Tail call optimization is performed
3214 // * tailcallopt is enabled
3215 // * caller/callee are fastcc
3216 // On X86_64 architecture with GOT-style position independent code only local
3217 // (within module) calls are supported at the moment.
3218 // To keep the stack aligned according to platform abi the function
3219 // GetAlignedArgumentStackSize ensures that argument delta is always multiples
3220 // of stack alignment. (Dynamic linkers need this - darwin's dyld for example)
3221 // If a tail called function callee has more arguments than the caller the
3222 // caller needs to make sure that there is room to move the RETADDR to. This is
3223 // achieved by reserving an area the size of the argument delta right after the
3224 // original RETADDR, but before the saved framepointer or the spilled registers
3225 // e.g. caller(arg1, arg2) calls callee(arg1, arg2,arg3,arg4)
3237 /// GetAlignedArgumentStackSize - Make the stack size align e.g 16n + 12 aligned
3238 /// for a 16 byte align requirement.
3240 X86TargetLowering::GetAlignedArgumentStackSize(unsigned StackSize,
3241 SelectionDAG& DAG) const {
3242 MachineFunction &MF = DAG.getMachineFunction();
3243 const TargetMachine &TM = MF.getTarget();
3244 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3245 TM.getSubtargetImpl()->getRegisterInfo());
3246 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
3247 unsigned StackAlignment = TFI.getStackAlignment();
3248 uint64_t AlignMask = StackAlignment - 1;
3249 int64_t Offset = StackSize;
3250 unsigned SlotSize = RegInfo->getSlotSize();
3251 if ( (Offset & AlignMask) <= (StackAlignment - SlotSize) ) {
3252 // Number smaller than 12 so just add the difference.
3253 Offset += ((StackAlignment - SlotSize) - (Offset & AlignMask));
3255 // Mask out lower bits, add stackalignment once plus the 12 bytes.
3256 Offset = ((~AlignMask) & Offset) + StackAlignment +
3257 (StackAlignment-SlotSize);
3262 /// MatchingStackOffset - Return true if the given stack call argument is
3263 /// already available in the same position (relatively) of the caller's
3264 /// incoming argument stack.
3266 bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
3267 MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
3268 const X86InstrInfo *TII) {
3269 unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
3271 if (Arg.getOpcode() == ISD::CopyFromReg) {
3272 unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
3273 if (!TargetRegisterInfo::isVirtualRegister(VR))
3275 MachineInstr *Def = MRI->getVRegDef(VR);
3278 if (!Flags.isByVal()) {
3279 if (!TII->isLoadFromStackSlot(Def, FI))
3282 unsigned Opcode = Def->getOpcode();
3283 if ((Opcode == X86::LEA32r || Opcode == X86::LEA64r) &&
3284 Def->getOperand(1).isFI()) {
3285 FI = Def->getOperand(1).getIndex();
3286 Bytes = Flags.getByValSize();
3290 } else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
3291 if (Flags.isByVal())
3292 // ByVal argument is passed in as a pointer but it's now being
3293 // dereferenced. e.g.
3294 // define @foo(%struct.X* %A) {
3295 // tail call @bar(%struct.X* byval %A)
3298 SDValue Ptr = Ld->getBasePtr();
3299 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
3302 FI = FINode->getIndex();
3303 } else if (Arg.getOpcode() == ISD::FrameIndex && Flags.isByVal()) {
3304 FrameIndexSDNode *FINode = cast<FrameIndexSDNode>(Arg);
3305 FI = FINode->getIndex();
3306 Bytes = Flags.getByValSize();
3310 assert(FI != INT_MAX);
3311 if (!MFI->isFixedObjectIndex(FI))
3313 return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
3316 /// IsEligibleForTailCallOptimization - Check whether the call is eligible
3317 /// for tail call optimization. Targets which want to do tail call
3318 /// optimization should implement this function.
3320 X86TargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
3321 CallingConv::ID CalleeCC,
3323 bool isCalleeStructRet,
3324 bool isCallerStructRet,
3326 const SmallVectorImpl<ISD::OutputArg> &Outs,
3327 const SmallVectorImpl<SDValue> &OutVals,
3328 const SmallVectorImpl<ISD::InputArg> &Ins,
3329 SelectionDAG &DAG) const {
3330 if (!IsTailCallConvention(CalleeCC) && !IsCCallConvention(CalleeCC))
3333 // If -tailcallopt is specified, make fastcc functions tail-callable.
3334 const MachineFunction &MF = DAG.getMachineFunction();
3335 const Function *CallerF = MF.getFunction();
3337 // If the function return type is x86_fp80 and the callee return type is not,
3338 // then the FP_EXTEND of the call result is not a nop. It's not safe to
3339 // perform a tailcall optimization here.
3340 if (CallerF->getReturnType()->isX86_FP80Ty() && !RetTy->isX86_FP80Ty())
3343 CallingConv::ID CallerCC = CallerF->getCallingConv();
3344 bool CCMatch = CallerCC == CalleeCC;
3345 bool IsCalleeWin64 = Subtarget->isCallingConvWin64(CalleeCC);
3346 bool IsCallerWin64 = Subtarget->isCallingConvWin64(CallerCC);
3348 if (DAG.getTarget().Options.GuaranteedTailCallOpt) {
3349 if (IsTailCallConvention(CalleeCC) && CCMatch)
3354 // Look for obvious safe cases to perform tail call optimization that do not
3355 // require ABI changes. This is what gcc calls sibcall.
3357 // Can't do sibcall if stack needs to be dynamically re-aligned. PEI needs to
3358 // emit a special epilogue.
3359 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3360 DAG.getSubtarget().getRegisterInfo());
3361 if (RegInfo->needsStackRealignment(MF))
3364 // Also avoid sibcall optimization if either caller or callee uses struct
3365 // return semantics.
3366 if (isCalleeStructRet || isCallerStructRet)
3369 // An stdcall/thiscall caller is expected to clean up its arguments; the
3370 // callee isn't going to do that.
3371 // FIXME: this is more restrictive than needed. We could produce a tailcall
3372 // when the stack adjustment matches. For example, with a thiscall that takes
3373 // only one argument.
3374 if (!CCMatch && (CallerCC == CallingConv::X86_StdCall ||
3375 CallerCC == CallingConv::X86_ThisCall))
3378 // Do not sibcall optimize vararg calls unless all arguments are passed via
3380 if (isVarArg && !Outs.empty()) {
3382 // Optimizing for varargs on Win64 is unlikely to be safe without
3383 // additional testing.
3384 if (IsCalleeWin64 || IsCallerWin64)
3387 SmallVector<CCValAssign, 16> ArgLocs;
3388 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3391 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3392 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
3393 if (!ArgLocs[i].isRegLoc())
3397 // If the call result is in ST0 / ST1, it needs to be popped off the x87
3398 // stack. Therefore, if it's not used by the call it is not safe to optimize
3399 // this into a sibcall.
3400 bool Unused = false;
3401 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3408 SmallVector<CCValAssign, 16> RVLocs;
3409 CCState CCInfo(CalleeCC, false, DAG.getMachineFunction(), RVLocs,
3411 CCInfo.AnalyzeCallResult(Ins, RetCC_X86);
3412 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
3413 CCValAssign &VA = RVLocs[i];
3414 if (VA.getLocReg() == X86::FP0 || VA.getLocReg() == X86::FP1)
3419 // If the calling conventions do not match, then we'd better make sure the
3420 // results are returned in the same way as what the caller expects.
3422 SmallVector<CCValAssign, 16> RVLocs1;
3423 CCState CCInfo1(CalleeCC, false, DAG.getMachineFunction(), RVLocs1,
3425 CCInfo1.AnalyzeCallResult(Ins, RetCC_X86);
3427 SmallVector<CCValAssign, 16> RVLocs2;
3428 CCState CCInfo2(CallerCC, false, DAG.getMachineFunction(), RVLocs2,
3430 CCInfo2.AnalyzeCallResult(Ins, RetCC_X86);
3432 if (RVLocs1.size() != RVLocs2.size())
3434 for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
3435 if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
3437 if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
3439 if (RVLocs1[i].isRegLoc()) {
3440 if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
3443 if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
3449 // If the callee takes no arguments then go on to check the results of the
3451 if (!Outs.empty()) {
3452 // Check if stack adjustment is needed. For now, do not do this if any
3453 // argument is passed on the stack.
3454 SmallVector<CCValAssign, 16> ArgLocs;
3455 CCState CCInfo(CalleeCC, isVarArg, DAG.getMachineFunction(), ArgLocs,
3458 // Allocate shadow area for Win64
3460 CCInfo.AllocateStack(32, 8);
3462 CCInfo.AnalyzeCallOperands(Outs, CC_X86);
3463 if (CCInfo.getNextStackOffset()) {
3464 MachineFunction &MF = DAG.getMachineFunction();
3465 if (MF.getInfo<X86MachineFunctionInfo>()->getBytesToPopOnReturn())
3468 // Check if the arguments are already laid out in the right way as
3469 // the caller's fixed stack objects.
3470 MachineFrameInfo *MFI = MF.getFrameInfo();
3471 const MachineRegisterInfo *MRI = &MF.getRegInfo();
3472 const X86InstrInfo *TII =
3473 static_cast<const X86InstrInfo *>(DAG.getSubtarget().getInstrInfo());
3474 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3475 CCValAssign &VA = ArgLocs[i];
3476 SDValue Arg = OutVals[i];
3477 ISD::ArgFlagsTy Flags = Outs[i].Flags;
3478 if (VA.getLocInfo() == CCValAssign::Indirect)
3480 if (!VA.isRegLoc()) {
3481 if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
3488 // If the tailcall address may be in a register, then make sure it's
3489 // possible to register allocate for it. In 32-bit, the call address can
3490 // only target EAX, EDX, or ECX since the tail call must be scheduled after
3491 // callee-saved registers are restored. These happen to be the same
3492 // registers used to pass 'inreg' arguments so watch out for those.
3493 if (!Subtarget->is64Bit() &&
3494 ((!isa<GlobalAddressSDNode>(Callee) &&
3495 !isa<ExternalSymbolSDNode>(Callee)) ||
3496 DAG.getTarget().getRelocationModel() == Reloc::PIC_)) {
3497 unsigned NumInRegs = 0;
3498 // In PIC we need an extra register to formulate the address computation
3500 unsigned MaxInRegs =
3501 (DAG.getTarget().getRelocationModel() == Reloc::PIC_) ? 2 : 3;
3503 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3504 CCValAssign &VA = ArgLocs[i];
3507 unsigned Reg = VA.getLocReg();
3510 case X86::EAX: case X86::EDX: case X86::ECX:
3511 if (++NumInRegs == MaxInRegs)
3523 X86TargetLowering::createFastISel(FunctionLoweringInfo &funcInfo,
3524 const TargetLibraryInfo *libInfo) const {
3525 return X86::createFastISel(funcInfo, libInfo);
3528 //===----------------------------------------------------------------------===//
3529 // Other Lowering Hooks
3530 //===----------------------------------------------------------------------===//
3532 static bool MayFoldLoad(SDValue Op) {
3533 return Op.hasOneUse() && ISD::isNormalLoad(Op.getNode());
3536 static bool MayFoldIntoStore(SDValue Op) {
3537 return Op.hasOneUse() && ISD::isNormalStore(*Op.getNode()->use_begin());
3540 static bool isTargetShuffle(unsigned Opcode) {
3542 default: return false;
3543 case X86ISD::BLENDI:
3544 case X86ISD::PSHUFB:
3545 case X86ISD::PSHUFD:
3546 case X86ISD::PSHUFHW:
3547 case X86ISD::PSHUFLW:
3549 case X86ISD::PALIGNR:
3550 case X86ISD::MOVLHPS:
3551 case X86ISD::MOVLHPD:
3552 case X86ISD::MOVHLPS:
3553 case X86ISD::MOVLPS:
3554 case X86ISD::MOVLPD:
3555 case X86ISD::MOVSHDUP:
3556 case X86ISD::MOVSLDUP:
3557 case X86ISD::MOVDDUP:
3560 case X86ISD::UNPCKL:
3561 case X86ISD::UNPCKH:
3562 case X86ISD::VPERMILPI:
3563 case X86ISD::VPERM2X128:
3564 case X86ISD::VPERMI:
3569 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3570 SDValue V1, SelectionDAG &DAG) {
3572 default: llvm_unreachable("Unknown x86 shuffle node");
3573 case X86ISD::MOVSHDUP:
3574 case X86ISD::MOVSLDUP:
3575 case X86ISD::MOVDDUP:
3576 return DAG.getNode(Opc, dl, VT, V1);
3580 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3581 SDValue V1, unsigned TargetMask,
3582 SelectionDAG &DAG) {
3584 default: llvm_unreachable("Unknown x86 shuffle node");
3585 case X86ISD::PSHUFD:
3586 case X86ISD::PSHUFHW:
3587 case X86ISD::PSHUFLW:
3588 case X86ISD::VPERMILPI:
3589 case X86ISD::VPERMI:
3590 return DAG.getNode(Opc, dl, VT, V1, DAG.getConstant(TargetMask, MVT::i8));
3594 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3595 SDValue V1, SDValue V2, unsigned TargetMask,
3596 SelectionDAG &DAG) {
3598 default: llvm_unreachable("Unknown x86 shuffle node");
3599 case X86ISD::PALIGNR:
3600 case X86ISD::VALIGN:
3602 case X86ISD::VPERM2X128:
3603 return DAG.getNode(Opc, dl, VT, V1, V2,
3604 DAG.getConstant(TargetMask, MVT::i8));
3608 static SDValue getTargetShuffleNode(unsigned Opc, SDLoc dl, EVT VT,
3609 SDValue V1, SDValue V2, SelectionDAG &DAG) {
3611 default: llvm_unreachable("Unknown x86 shuffle node");
3612 case X86ISD::MOVLHPS:
3613 case X86ISD::MOVLHPD:
3614 case X86ISD::MOVHLPS:
3615 case X86ISD::MOVLPS:
3616 case X86ISD::MOVLPD:
3619 case X86ISD::UNPCKL:
3620 case X86ISD::UNPCKH:
3621 return DAG.getNode(Opc, dl, VT, V1, V2);
3625 SDValue X86TargetLowering::getReturnAddressFrameIndex(SelectionDAG &DAG) const {
3626 MachineFunction &MF = DAG.getMachineFunction();
3627 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
3628 DAG.getSubtarget().getRegisterInfo());
3629 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
3630 int ReturnAddrIndex = FuncInfo->getRAIndex();
3632 if (ReturnAddrIndex == 0) {
3633 // Set up a frame object for the return address.
3634 unsigned SlotSize = RegInfo->getSlotSize();
3635 ReturnAddrIndex = MF.getFrameInfo()->CreateFixedObject(SlotSize,
3638 FuncInfo->setRAIndex(ReturnAddrIndex);
3641 return DAG.getFrameIndex(ReturnAddrIndex, getPointerTy());
3644 bool X86::isOffsetSuitableForCodeModel(int64_t Offset, CodeModel::Model M,
3645 bool hasSymbolicDisplacement) {
3646 // Offset should fit into 32 bit immediate field.
3647 if (!isInt<32>(Offset))
3650 // If we don't have a symbolic displacement - we don't have any extra
3652 if (!hasSymbolicDisplacement)
3655 // FIXME: Some tweaks might be needed for medium code model.
3656 if (M != CodeModel::Small && M != CodeModel::Kernel)
3659 // For small code model we assume that latest object is 16MB before end of 31
3660 // bits boundary. We may also accept pretty large negative constants knowing
3661 // that all objects are in the positive half of address space.
3662 if (M == CodeModel::Small && Offset < 16*1024*1024)
3665 // For kernel code model we know that all object resist in the negative half
3666 // of 32bits address space. We may not accept negative offsets, since they may
3667 // be just off and we may accept pretty large positive ones.
3668 if (M == CodeModel::Kernel && Offset > 0)
3674 /// isCalleePop - Determines whether the callee is required to pop its
3675 /// own arguments. Callee pop is necessary to support tail calls.
3676 bool X86::isCalleePop(CallingConv::ID CallingConv,
3677 bool is64Bit, bool IsVarArg, bool TailCallOpt) {
3678 switch (CallingConv) {
3681 case CallingConv::X86_StdCall:
3682 case CallingConv::X86_FastCall:
3683 case CallingConv::X86_ThisCall:
3685 case CallingConv::Fast:
3686 case CallingConv::GHC:
3687 case CallingConv::HiPE:
3694 /// \brief Return true if the condition is an unsigned comparison operation.
3695 static bool isX86CCUnsigned(unsigned X86CC) {
3697 default: llvm_unreachable("Invalid integer condition!");
3698 case X86::COND_E: return true;
3699 case X86::COND_G: return false;
3700 case X86::COND_GE: return false;
3701 case X86::COND_L: return false;
3702 case X86::COND_LE: return false;
3703 case X86::COND_NE: return true;
3704 case X86::COND_B: return true;
3705 case X86::COND_A: return true;
3706 case X86::COND_BE: return true;
3707 case X86::COND_AE: return true;
3709 llvm_unreachable("covered switch fell through?!");
3712 /// TranslateX86CC - do a one to one translation of a ISD::CondCode to the X86
3713 /// specific condition code, returning the condition code and the LHS/RHS of the
3714 /// comparison to make.
3715 static unsigned TranslateX86CC(ISD::CondCode SetCCOpcode, bool isFP,
3716 SDValue &LHS, SDValue &RHS, SelectionDAG &DAG) {
3718 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) {
3719 if (SetCCOpcode == ISD::SETGT && RHSC->isAllOnesValue()) {
3720 // X > -1 -> X == 0, jump !sign.
3721 RHS = DAG.getConstant(0, RHS.getValueType());
3722 return X86::COND_NS;
3724 if (SetCCOpcode == ISD::SETLT && RHSC->isNullValue()) {
3725 // X < 0 -> X == 0, jump on sign.
3728 if (SetCCOpcode == ISD::SETLT && RHSC->getZExtValue() == 1) {
3730 RHS = DAG.getConstant(0, RHS.getValueType());
3731 return X86::COND_LE;
3735 switch (SetCCOpcode) {
3736 default: llvm_unreachable("Invalid integer condition!");
3737 case ISD::SETEQ: return X86::COND_E;
3738 case ISD::SETGT: return X86::COND_G;
3739 case ISD::SETGE: return X86::COND_GE;
3740 case ISD::SETLT: return X86::COND_L;
3741 case ISD::SETLE: return X86::COND_LE;
3742 case ISD::SETNE: return X86::COND_NE;
3743 case ISD::SETULT: return X86::COND_B;
3744 case ISD::SETUGT: return X86::COND_A;
3745 case ISD::SETULE: return X86::COND_BE;
3746 case ISD::SETUGE: return X86::COND_AE;
3750 // First determine if it is required or is profitable to flip the operands.
3752 // If LHS is a foldable load, but RHS is not, flip the condition.
3753 if (ISD::isNON_EXTLoad(LHS.getNode()) &&
3754 !ISD::isNON_EXTLoad(RHS.getNode())) {
3755 SetCCOpcode = getSetCCSwappedOperands(SetCCOpcode);
3756 std::swap(LHS, RHS);
3759 switch (SetCCOpcode) {
3765 std::swap(LHS, RHS);
3769 // On a floating point condition, the flags are set as follows:
3771 // 0 | 0 | 0 | X > Y
3772 // 0 | 0 | 1 | X < Y
3773 // 1 | 0 | 0 | X == Y
3774 // 1 | 1 | 1 | unordered
3775 switch (SetCCOpcode) {
3776 default: llvm_unreachable("Condcode should be pre-legalized away");
3778 case ISD::SETEQ: return X86::COND_E;
3779 case ISD::SETOLT: // flipped
3781 case ISD::SETGT: return X86::COND_A;
3782 case ISD::SETOLE: // flipped
3784 case ISD::SETGE: return X86::COND_AE;
3785 case ISD::SETUGT: // flipped
3787 case ISD::SETLT: return X86::COND_B;
3788 case ISD::SETUGE: // flipped
3790 case ISD::SETLE: return X86::COND_BE;
3792 case ISD::SETNE: return X86::COND_NE;
3793 case ISD::SETUO: return X86::COND_P;
3794 case ISD::SETO: return X86::COND_NP;
3796 case ISD::SETUNE: return X86::COND_INVALID;
3800 /// hasFPCMov - is there a floating point cmov for the specific X86 condition
3801 /// code. Current x86 isa includes the following FP cmov instructions:
3802 /// fcmovb, fcomvbe, fcomve, fcmovu, fcmovae, fcmova, fcmovne, fcmovnu.
3803 static bool hasFPCMov(unsigned X86CC) {
3819 /// isFPImmLegal - Returns true if the target can instruction select the
3820 /// specified FP immediate natively. If false, the legalizer will
3821 /// materialize the FP immediate as a load from a constant pool.
3822 bool X86TargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
3823 for (unsigned i = 0, e = LegalFPImmediates.size(); i != e; ++i) {
3824 if (Imm.bitwiseIsEqual(LegalFPImmediates[i]))
3830 /// \brief Returns true if it is beneficial to convert a load of a constant
3831 /// to just the constant itself.
3832 bool X86TargetLowering::shouldConvertConstantLoadToIntImm(const APInt &Imm,
3834 assert(Ty->isIntegerTy());
3836 unsigned BitSize = Ty->getPrimitiveSizeInBits();
3837 if (BitSize == 0 || BitSize > 64)
3842 /// isUndefOrInRange - Return true if Val is undef or if its value falls within
3843 /// the specified range (L, H].
3844 static bool isUndefOrInRange(int Val, int Low, int Hi) {
3845 return (Val < 0) || (Val >= Low && Val < Hi);
3848 /// isUndefOrEqual - Val is either less than zero (undef) or equal to the
3849 /// specified value.
3850 static bool isUndefOrEqual(int Val, int CmpVal) {
3851 return (Val < 0 || Val == CmpVal);
3854 /// isSequentialOrUndefInRange - Return true if every element in Mask, beginning
3855 /// from position Pos and ending in Pos+Size, falls within the specified
3856 /// sequential range (L, L+Pos]. or is undef.
3857 static bool isSequentialOrUndefInRange(ArrayRef<int> Mask,
3858 unsigned Pos, unsigned Size, int Low) {
3859 for (unsigned i = Pos, e = Pos+Size; i != e; ++i, ++Low)
3860 if (!isUndefOrEqual(Mask[i], Low))
3865 /// isPSHUFDMask - Return true if the node specifies a shuffle of elements that
3866 /// is suitable for input to PSHUFD or PSHUFW. That is, it doesn't reference
3867 /// the second operand.
3868 static bool isPSHUFDMask(ArrayRef<int> Mask, MVT VT) {
3869 if (VT == MVT::v4f32 || VT == MVT::v4i32 )
3870 return (Mask[0] < 4 && Mask[1] < 4 && Mask[2] < 4 && Mask[3] < 4);
3871 if (VT == MVT::v2f64 || VT == MVT::v2i64)
3872 return (Mask[0] < 2 && Mask[1] < 2);
3876 /// isPSHUFHWMask - Return true if the node specifies a shuffle of elements that
3877 /// is suitable for input to PSHUFHW.
3878 static bool isPSHUFHWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3879 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3882 // Lower quadword copied in order or undef.
3883 if (!isSequentialOrUndefInRange(Mask, 0, 4, 0))
3886 // Upper quadword shuffled.
3887 for (unsigned i = 4; i != 8; ++i)
3888 if (!isUndefOrInRange(Mask[i], 4, 8))
3891 if (VT == MVT::v16i16) {
3892 // Lower quadword copied in order or undef.
3893 if (!isSequentialOrUndefInRange(Mask, 8, 4, 8))
3896 // Upper quadword shuffled.
3897 for (unsigned i = 12; i != 16; ++i)
3898 if (!isUndefOrInRange(Mask[i], 12, 16))
3905 /// isPSHUFLWMask - Return true if the node specifies a shuffle of elements that
3906 /// is suitable for input to PSHUFLW.
3907 static bool isPSHUFLWMask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
3908 if (VT != MVT::v8i16 && (!HasInt256 || VT != MVT::v16i16))
3911 // Upper quadword copied in order.
3912 if (!isSequentialOrUndefInRange(Mask, 4, 4, 4))
3915 // Lower quadword shuffled.
3916 for (unsigned i = 0; i != 4; ++i)
3917 if (!isUndefOrInRange(Mask[i], 0, 4))
3920 if (VT == MVT::v16i16) {
3921 // Upper quadword copied in order.
3922 if (!isSequentialOrUndefInRange(Mask, 12, 4, 12))
3925 // Lower quadword shuffled.
3926 for (unsigned i = 8; i != 12; ++i)
3927 if (!isUndefOrInRange(Mask[i], 8, 12))
3934 /// \brief Return true if the mask specifies a shuffle of elements that is
3935 /// suitable for input to intralane (palignr) or interlane (valign) vector
3937 static bool isAlignrMask(ArrayRef<int> Mask, MVT VT, bool InterLane) {
3938 unsigned NumElts = VT.getVectorNumElements();
3939 unsigned NumLanes = InterLane ? 1: VT.getSizeInBits()/128;
3940 unsigned NumLaneElts = NumElts/NumLanes;
3942 // Do not handle 64-bit element shuffles with palignr.
3943 if (NumLaneElts == 2)
3946 for (unsigned l = 0; l != NumElts; l+=NumLaneElts) {
3948 for (i = 0; i != NumLaneElts; ++i) {
3953 // Lane is all undef, go to next lane
3954 if (i == NumLaneElts)
3957 int Start = Mask[i+l];
3959 // Make sure its in this lane in one of the sources
3960 if (!isUndefOrInRange(Start, l, l+NumLaneElts) &&
3961 !isUndefOrInRange(Start, l+NumElts, l+NumElts+NumLaneElts))
3964 // If not lane 0, then we must match lane 0
3965 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Start, Mask[i]+l))
3968 // Correct second source to be contiguous with first source
3969 if (Start >= (int)NumElts)
3970 Start -= NumElts - NumLaneElts;
3972 // Make sure we're shifting in the right direction.
3973 if (Start <= (int)(i+l))
3978 // Check the rest of the elements to see if they are consecutive.
3979 for (++i; i != NumLaneElts; ++i) {
3980 int Idx = Mask[i+l];
3982 // Make sure its in this lane
3983 if (!isUndefOrInRange(Idx, l, l+NumLaneElts) &&
3984 !isUndefOrInRange(Idx, l+NumElts, l+NumElts+NumLaneElts))
3987 // If not lane 0, then we must match lane 0
3988 if (l != 0 && Mask[i] >= 0 && !isUndefOrEqual(Idx, Mask[i]+l))
3991 if (Idx >= (int)NumElts)
3992 Idx -= NumElts - NumLaneElts;
3994 if (!isUndefOrEqual(Idx, Start+i))
4003 /// \brief Return true if the node specifies a shuffle of elements that is
4004 /// suitable for input to PALIGNR.
4005 static bool isPALIGNRMask(ArrayRef<int> Mask, MVT VT,
4006 const X86Subtarget *Subtarget) {
4007 if ((VT.is128BitVector() && !Subtarget->hasSSSE3()) ||
4008 (VT.is256BitVector() && !Subtarget->hasInt256()) ||
4009 VT.is512BitVector())
4010 // FIXME: Add AVX512BW.
4013 return isAlignrMask(Mask, VT, false);
4016 /// \brief Return true if the node specifies a shuffle of elements that is
4017 /// suitable for input to VALIGN.
4018 static bool isVALIGNMask(ArrayRef<int> Mask, MVT VT,
4019 const X86Subtarget *Subtarget) {
4020 // FIXME: Add AVX512VL.
4021 if (!VT.is512BitVector() || !Subtarget->hasAVX512())
4023 return isAlignrMask(Mask, VT, true);
4026 /// CommuteVectorShuffleMask - Change values in a shuffle permute mask assuming
4027 /// the two vector operands have swapped position.
4028 static void CommuteVectorShuffleMask(SmallVectorImpl<int> &Mask,
4029 unsigned NumElems) {
4030 for (unsigned i = 0; i != NumElems; ++i) {
4034 else if (idx < (int)NumElems)
4035 Mask[i] = idx + NumElems;
4037 Mask[i] = idx - NumElems;
4041 /// isSHUFPMask - Return true if the specified VECTOR_SHUFFLE operand
4042 /// specifies a shuffle of elements that is suitable for input to 128/256-bit
4043 /// SHUFPS and SHUFPD. If Commuted is true, then it checks for sources to be
4044 /// reverse of what x86 shuffles want.
4045 static bool isSHUFPMask(ArrayRef<int> Mask, MVT VT, bool Commuted = false) {
4047 unsigned NumElems = VT.getVectorNumElements();
4048 unsigned NumLanes = VT.getSizeInBits()/128;
4049 unsigned NumLaneElems = NumElems/NumLanes;
4051 if (NumLaneElems != 2 && NumLaneElems != 4)
4054 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4055 bool symetricMaskRequired =
4056 (VT.getSizeInBits() >= 256) && (EltSize == 32);
4058 // VSHUFPSY divides the resulting vector into 4 chunks.
4059 // The sources are also splitted into 4 chunks, and each destination
4060 // chunk must come from a different source chunk.
4062 // SRC1 => X7 X6 X5 X4 X3 X2 X1 X0
4063 // SRC2 => Y7 Y6 Y5 Y4 Y3 Y2 Y1 Y9
4065 // DST => Y7..Y4, Y7..Y4, X7..X4, X7..X4,
4066 // Y3..Y0, Y3..Y0, X3..X0, X3..X0
4068 // VSHUFPDY divides the resulting vector into 4 chunks.
4069 // The sources are also splitted into 4 chunks, and each destination
4070 // chunk must come from a different source chunk.
4072 // SRC1 => X3 X2 X1 X0
4073 // SRC2 => Y3 Y2 Y1 Y0
4075 // DST => Y3..Y2, X3..X2, Y1..Y0, X1..X0
4077 SmallVector<int, 4> MaskVal(NumLaneElems, -1);
4078 unsigned HalfLaneElems = NumLaneElems/2;
4079 for (unsigned l = 0; l != NumElems; l += NumLaneElems) {
4080 for (unsigned i = 0; i != NumLaneElems; ++i) {
4081 int Idx = Mask[i+l];
4082 unsigned RngStart = l + ((Commuted == (i<HalfLaneElems)) ? NumElems : 0);
4083 if (!isUndefOrInRange(Idx, RngStart, RngStart+NumLaneElems))
4085 // For VSHUFPSY, the mask of the second half must be the same as the
4086 // first but with the appropriate offsets. This works in the same way as
4087 // VPERMILPS works with masks.
4088 if (!symetricMaskRequired || Idx < 0)
4090 if (MaskVal[i] < 0) {
4091 MaskVal[i] = Idx - l;
4094 if ((signed)(Idx - l) != MaskVal[i])
4102 /// isMOVHLPSMask - Return true if the specified VECTOR_SHUFFLE operand
4103 /// specifies a shuffle of elements that is suitable for input to MOVHLPS.
4104 static bool isMOVHLPSMask(ArrayRef<int> Mask, MVT VT) {
4105 if (!VT.is128BitVector())
4108 unsigned NumElems = VT.getVectorNumElements();
4113 // Expect bit0 == 6, bit1 == 7, bit2 == 2, bit3 == 3
4114 return isUndefOrEqual(Mask[0], 6) &&
4115 isUndefOrEqual(Mask[1], 7) &&
4116 isUndefOrEqual(Mask[2], 2) &&
4117 isUndefOrEqual(Mask[3], 3);
4120 /// isMOVHLPS_v_undef_Mask - Special case of isMOVHLPSMask for canonical form
4121 /// of vector_shuffle v, v, <2, 3, 2, 3>, i.e. vector_shuffle v, undef,
4123 static bool isMOVHLPS_v_undef_Mask(ArrayRef<int> Mask, MVT VT) {
4124 if (!VT.is128BitVector())
4127 unsigned NumElems = VT.getVectorNumElements();
4132 return isUndefOrEqual(Mask[0], 2) &&
4133 isUndefOrEqual(Mask[1], 3) &&
4134 isUndefOrEqual(Mask[2], 2) &&
4135 isUndefOrEqual(Mask[3], 3);
4138 /// isMOVLPMask - Return true if the specified VECTOR_SHUFFLE operand
4139 /// specifies a shuffle of elements that is suitable for input to MOVLP{S|D}.
4140 static bool isMOVLPMask(ArrayRef<int> Mask, MVT VT) {
4141 if (!VT.is128BitVector())
4144 unsigned NumElems = VT.getVectorNumElements();
4146 if (NumElems != 2 && NumElems != 4)
4149 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4150 if (!isUndefOrEqual(Mask[i], i + NumElems))
4153 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
4154 if (!isUndefOrEqual(Mask[i], i))
4160 /// isMOVLHPSMask - Return true if the specified VECTOR_SHUFFLE operand
4161 /// specifies a shuffle of elements that is suitable for input to MOVLHPS.
4162 static bool isMOVLHPSMask(ArrayRef<int> Mask, MVT VT) {
4163 if (!VT.is128BitVector())
4166 unsigned NumElems = VT.getVectorNumElements();
4168 if (NumElems != 2 && NumElems != 4)
4171 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4172 if (!isUndefOrEqual(Mask[i], i))
4175 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
4176 if (!isUndefOrEqual(Mask[i + e], i + NumElems))
4182 /// isINSERTPSMask - Return true if the specified VECTOR_SHUFFLE operand
4183 /// specifies a shuffle of elements that is suitable for input to INSERTPS.
4184 /// i. e: If all but one element come from the same vector.
4185 static bool isINSERTPSMask(ArrayRef<int> Mask, MVT VT) {
4186 // TODO: Deal with AVX's VINSERTPS
4187 if (!VT.is128BitVector() || (VT != MVT::v4f32 && VT != MVT::v4i32))
4190 unsigned CorrectPosV1 = 0;
4191 unsigned CorrectPosV2 = 0;
4192 for (int i = 0, e = (int)VT.getVectorNumElements(); i != e; ++i) {
4193 if (Mask[i] == -1) {
4201 else if (Mask[i] == i + 4)
4205 if (CorrectPosV1 == 3 || CorrectPosV2 == 3)
4206 // We have 3 elements (undefs count as elements from any vector) from one
4207 // vector, and one from another.
4214 // Some special combinations that can be optimized.
4217 SDValue Compact8x32ShuffleNode(ShuffleVectorSDNode *SVOp,
4218 SelectionDAG &DAG) {
4219 MVT VT = SVOp->getSimpleValueType(0);
4222 if (VT != MVT::v8i32 && VT != MVT::v8f32)
4225 ArrayRef<int> Mask = SVOp->getMask();
4227 // These are the special masks that may be optimized.
4228 static const int MaskToOptimizeEven[] = {0, 8, 2, 10, 4, 12, 6, 14};
4229 static const int MaskToOptimizeOdd[] = {1, 9, 3, 11, 5, 13, 7, 15};
4230 bool MatchEvenMask = true;
4231 bool MatchOddMask = true;
4232 for (int i=0; i<8; ++i) {
4233 if (!isUndefOrEqual(Mask[i], MaskToOptimizeEven[i]))
4234 MatchEvenMask = false;
4235 if (!isUndefOrEqual(Mask[i], MaskToOptimizeOdd[i]))
4236 MatchOddMask = false;
4239 if (!MatchEvenMask && !MatchOddMask)
4242 SDValue UndefNode = DAG.getNode(ISD::UNDEF, dl, VT);
4244 SDValue Op0 = SVOp->getOperand(0);
4245 SDValue Op1 = SVOp->getOperand(1);
4247 if (MatchEvenMask) {
4248 // Shift the second operand right to 32 bits.
4249 static const int ShiftRightMask[] = {-1, 0, -1, 2, -1, 4, -1, 6 };
4250 Op1 = DAG.getVectorShuffle(VT, dl, Op1, UndefNode, ShiftRightMask);
4252 // Shift the first operand left to 32 bits.
4253 static const int ShiftLeftMask[] = {1, -1, 3, -1, 5, -1, 7, -1 };
4254 Op0 = DAG.getVectorShuffle(VT, dl, Op0, UndefNode, ShiftLeftMask);
4256 static const int BlendMask[] = {0, 9, 2, 11, 4, 13, 6, 15};
4257 return DAG.getVectorShuffle(VT, dl, Op0, Op1, BlendMask);
4260 /// isUNPCKLMask - Return true if the specified VECTOR_SHUFFLE operand
4261 /// specifies a shuffle of elements that is suitable for input to UNPCKL.
4262 static bool isUNPCKLMask(ArrayRef<int> Mask, MVT VT,
4263 bool HasInt256, bool V2IsSplat = false) {
4265 assert(VT.getSizeInBits() >= 128 &&
4266 "Unsupported vector type for unpckl");
4268 unsigned NumElts = VT.getVectorNumElements();
4269 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4270 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4273 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4274 "Unsupported vector type for unpckh");
4276 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4277 unsigned NumLanes = VT.getSizeInBits()/128;
4278 unsigned NumLaneElts = NumElts/NumLanes;
4280 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4281 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4282 int BitI = Mask[l+i];
4283 int BitI1 = Mask[l+i+1];
4284 if (!isUndefOrEqual(BitI, j))
4287 if (!isUndefOrEqual(BitI1, NumElts))
4290 if (!isUndefOrEqual(BitI1, j + NumElts))
4299 /// isUNPCKHMask - Return true if the specified VECTOR_SHUFFLE operand
4300 /// specifies a shuffle of elements that is suitable for input to UNPCKH.
4301 static bool isUNPCKHMask(ArrayRef<int> Mask, MVT VT,
4302 bool HasInt256, bool V2IsSplat = false) {
4303 assert(VT.getSizeInBits() >= 128 &&
4304 "Unsupported vector type for unpckh");
4306 unsigned NumElts = VT.getVectorNumElements();
4307 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4308 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4311 assert((!VT.is512BitVector() || VT.getScalarType().getSizeInBits() >= 32) &&
4312 "Unsupported vector type for unpckh");
4314 // AVX defines UNPCK* to operate independently on 128-bit lanes.
4315 unsigned NumLanes = VT.getSizeInBits()/128;
4316 unsigned NumLaneElts = NumElts/NumLanes;
4318 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4319 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4320 int BitI = Mask[l+i];
4321 int BitI1 = Mask[l+i+1];
4322 if (!isUndefOrEqual(BitI, j))
4325 if (isUndefOrEqual(BitI1, NumElts))
4328 if (!isUndefOrEqual(BitI1, j+NumElts))
4336 /// isUNPCKL_v_undef_Mask - Special case of isUNPCKLMask for canonical form
4337 /// of vector_shuffle v, v, <0, 4, 1, 5>, i.e. vector_shuffle v, undef,
4339 static bool isUNPCKL_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4340 unsigned NumElts = VT.getVectorNumElements();
4341 bool Is256BitVec = VT.is256BitVector();
4343 if (VT.is512BitVector())
4345 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4346 "Unsupported vector type for unpckh");
4348 if (Is256BitVec && NumElts != 4 && NumElts != 8 &&
4349 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4352 // For 256-bit i64/f64, use MOVDDUPY instead, so reject the matching pattern
4353 // FIXME: Need a better way to get rid of this, there's no latency difference
4354 // between UNPCKLPD and MOVDDUP, the later should always be checked first and
4355 // the former later. We should also remove the "_undef" special mask.
4356 if (NumElts == 4 && Is256BitVec)
4359 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4360 // independently on 128-bit lanes.
4361 unsigned NumLanes = VT.getSizeInBits()/128;
4362 unsigned NumLaneElts = NumElts/NumLanes;
4364 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4365 for (unsigned i = 0, j = l; i != NumLaneElts; i += 2, ++j) {
4366 int BitI = Mask[l+i];
4367 int BitI1 = Mask[l+i+1];
4369 if (!isUndefOrEqual(BitI, j))
4371 if (!isUndefOrEqual(BitI1, j))
4379 /// isUNPCKH_v_undef_Mask - Special case of isUNPCKHMask for canonical form
4380 /// of vector_shuffle v, v, <2, 6, 3, 7>, i.e. vector_shuffle v, undef,
4382 static bool isUNPCKH_v_undef_Mask(ArrayRef<int> Mask, MVT VT, bool HasInt256) {
4383 unsigned NumElts = VT.getVectorNumElements();
4385 if (VT.is512BitVector())
4388 assert((VT.is128BitVector() || VT.is256BitVector()) &&
4389 "Unsupported vector type for unpckh");
4391 if (VT.is256BitVector() && NumElts != 4 && NumElts != 8 &&
4392 (!HasInt256 || (NumElts != 16 && NumElts != 32)))
4395 // Handle 128 and 256-bit vector lengths. AVX defines UNPCK* to operate
4396 // independently on 128-bit lanes.
4397 unsigned NumLanes = VT.getSizeInBits()/128;
4398 unsigned NumLaneElts = NumElts/NumLanes;
4400 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
4401 for (unsigned i = 0, j = l+NumLaneElts/2; i != NumLaneElts; i += 2, ++j) {
4402 int BitI = Mask[l+i];
4403 int BitI1 = Mask[l+i+1];
4404 if (!isUndefOrEqual(BitI, j))
4406 if (!isUndefOrEqual(BitI1, j))
4413 // Match for INSERTI64x4 INSERTF64x4 instructions (src0[0], src1[0]) or
4414 // (src1[0], src0[1]), manipulation with 256-bit sub-vectors
4415 static bool isINSERT64x4Mask(ArrayRef<int> Mask, MVT VT, unsigned int *Imm) {
4416 if (!VT.is512BitVector())
4419 unsigned NumElts = VT.getVectorNumElements();
4420 unsigned HalfSize = NumElts/2;
4421 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, 0)) {
4422 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, NumElts)) {
4427 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, NumElts)) {
4428 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, HalfSize)) {
4436 /// isMOVLMask - Return true if the specified VECTOR_SHUFFLE operand
4437 /// specifies a shuffle of elements that is suitable for input to MOVSS,
4438 /// MOVSD, and MOVD, i.e. setting the lowest element.
4439 static bool isMOVLMask(ArrayRef<int> Mask, EVT VT) {
4440 if (VT.getVectorElementType().getSizeInBits() < 32)
4442 if (!VT.is128BitVector())
4445 unsigned NumElts = VT.getVectorNumElements();
4447 if (!isUndefOrEqual(Mask[0], NumElts))
4450 for (unsigned i = 1; i != NumElts; ++i)
4451 if (!isUndefOrEqual(Mask[i], i))
4457 /// isVPERM2X128Mask - Match 256-bit shuffles where the elements are considered
4458 /// as permutations between 128-bit chunks or halves. As an example: this
4460 /// vector_shuffle <4, 5, 6, 7, 12, 13, 14, 15>
4461 /// The first half comes from the second half of V1 and the second half from the
4462 /// the second half of V2.
4463 static bool isVPERM2X128Mask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4464 if (!HasFp256 || !VT.is256BitVector())
4467 // The shuffle result is divided into half A and half B. In total the two
4468 // sources have 4 halves, namely: C, D, E, F. The final values of A and
4469 // B must come from C, D, E or F.
4470 unsigned HalfSize = VT.getVectorNumElements()/2;
4471 bool MatchA = false, MatchB = false;
4473 // Check if A comes from one of C, D, E, F.
4474 for (unsigned Half = 0; Half != 4; ++Half) {
4475 if (isSequentialOrUndefInRange(Mask, 0, HalfSize, Half*HalfSize)) {
4481 // Check if B comes from one of C, D, E, F.
4482 for (unsigned Half = 0; Half != 4; ++Half) {
4483 if (isSequentialOrUndefInRange(Mask, HalfSize, HalfSize, Half*HalfSize)) {
4489 return MatchA && MatchB;
4492 /// getShuffleVPERM2X128Immediate - Return the appropriate immediate to shuffle
4493 /// the specified VECTOR_MASK mask with VPERM2F128/VPERM2I128 instructions.
4494 static unsigned getShuffleVPERM2X128Immediate(ShuffleVectorSDNode *SVOp) {
4495 MVT VT = SVOp->getSimpleValueType(0);
4497 unsigned HalfSize = VT.getVectorNumElements()/2;
4499 unsigned FstHalf = 0, SndHalf = 0;
4500 for (unsigned i = 0; i < HalfSize; ++i) {
4501 if (SVOp->getMaskElt(i) > 0) {
4502 FstHalf = SVOp->getMaskElt(i)/HalfSize;
4506 for (unsigned i = HalfSize; i < HalfSize*2; ++i) {
4507 if (SVOp->getMaskElt(i) > 0) {
4508 SndHalf = SVOp->getMaskElt(i)/HalfSize;
4513 return (FstHalf | (SndHalf << 4));
4516 // Symetric in-lane mask. Each lane has 4 elements (for imm8)
4517 static bool isPermImmMask(ArrayRef<int> Mask, MVT VT, unsigned& Imm8) {
4518 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4522 unsigned NumElts = VT.getVectorNumElements();
4524 if (VT.is128BitVector() || (VT.is256BitVector() && EltSize == 64)) {
4525 for (unsigned i = 0; i != NumElts; ++i) {
4528 Imm8 |= Mask[i] << (i*2);
4533 unsigned LaneSize = 4;
4534 SmallVector<int, 4> MaskVal(LaneSize, -1);
4536 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4537 for (unsigned i = 0; i != LaneSize; ++i) {
4538 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4542 if (MaskVal[i] < 0) {
4543 MaskVal[i] = Mask[i+l] - l;
4544 Imm8 |= MaskVal[i] << (i*2);
4547 if (Mask[i+l] != (signed)(MaskVal[i]+l))
4554 /// isVPERMILPMask - Return true if the specified VECTOR_SHUFFLE operand
4555 /// specifies a shuffle of elements that is suitable for input to VPERMILPD*.
4556 /// Note that VPERMIL mask matching is different depending whether theunderlying
4557 /// type is 32 or 64. In the VPERMILPS the high half of the mask should point
4558 /// to the same elements of the low, but to the higher half of the source.
4559 /// In VPERMILPD the two lanes could be shuffled independently of each other
4560 /// with the same restriction that lanes can't be crossed. Also handles PSHUFDY.
4561 static bool isVPERMILPMask(ArrayRef<int> Mask, MVT VT) {
4562 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
4563 if (VT.getSizeInBits() < 256 || EltSize < 32)
4565 bool symetricMaskRequired = (EltSize == 32);
4566 unsigned NumElts = VT.getVectorNumElements();
4568 unsigned NumLanes = VT.getSizeInBits()/128;
4569 unsigned LaneSize = NumElts/NumLanes;
4570 // 2 or 4 elements in one lane
4572 SmallVector<int, 4> ExpectedMaskVal(LaneSize, -1);
4573 for (unsigned l = 0; l != NumElts; l += LaneSize) {
4574 for (unsigned i = 0; i != LaneSize; ++i) {
4575 if (!isUndefOrInRange(Mask[i+l], l, l+LaneSize))
4577 if (symetricMaskRequired) {
4578 if (ExpectedMaskVal[i] < 0 && Mask[i+l] >= 0) {
4579 ExpectedMaskVal[i] = Mask[i+l] - l;
4582 if (!isUndefOrEqual(Mask[i+l], ExpectedMaskVal[i]+l))
4590 /// isCommutedMOVLMask - Returns true if the shuffle mask is except the reverse
4591 /// of what x86 movss want. X86 movs requires the lowest element to be lowest
4592 /// element of vector 2 and the other elements to come from vector 1 in order.
4593 static bool isCommutedMOVLMask(ArrayRef<int> Mask, MVT VT,
4594 bool V2IsSplat = false, bool V2IsUndef = false) {
4595 if (!VT.is128BitVector())
4598 unsigned NumOps = VT.getVectorNumElements();
4599 if (NumOps != 2 && NumOps != 4 && NumOps != 8 && NumOps != 16)
4602 if (!isUndefOrEqual(Mask[0], 0))
4605 for (unsigned i = 1; i != NumOps; ++i)
4606 if (!(isUndefOrEqual(Mask[i], i+NumOps) ||
4607 (V2IsUndef && isUndefOrInRange(Mask[i], NumOps, NumOps*2)) ||
4608 (V2IsSplat && isUndefOrEqual(Mask[i], NumOps))))
4614 /// isMOVSHDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4615 /// specifies a shuffle of elements that is suitable for input to MOVSHDUP.
4616 /// Masks to match: <1, 1, 3, 3> or <1, 1, 3, 3, 5, 5, 7, 7>
4617 static bool isMOVSHDUPMask(ArrayRef<int> Mask, MVT VT,
4618 const X86Subtarget *Subtarget) {
4619 if (!Subtarget->hasSSE3())
4622 unsigned NumElems = VT.getVectorNumElements();
4624 if ((VT.is128BitVector() && NumElems != 4) ||
4625 (VT.is256BitVector() && NumElems != 8) ||
4626 (VT.is512BitVector() && NumElems != 16))
4629 // "i+1" is the value the indexed mask element must have
4630 for (unsigned i = 0; i != NumElems; i += 2)
4631 if (!isUndefOrEqual(Mask[i], i+1) ||
4632 !isUndefOrEqual(Mask[i+1], i+1))
4638 /// isMOVSLDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4639 /// specifies a shuffle of elements that is suitable for input to MOVSLDUP.
4640 /// Masks to match: <0, 0, 2, 2> or <0, 0, 2, 2, 4, 4, 6, 6>
4641 static bool isMOVSLDUPMask(ArrayRef<int> Mask, MVT VT,
4642 const X86Subtarget *Subtarget) {
4643 if (!Subtarget->hasSSE3())
4646 unsigned NumElems = VT.getVectorNumElements();
4648 if ((VT.is128BitVector() && NumElems != 4) ||
4649 (VT.is256BitVector() && NumElems != 8) ||
4650 (VT.is512BitVector() && NumElems != 16))
4653 // "i" is the value the indexed mask element must have
4654 for (unsigned i = 0; i != NumElems; i += 2)
4655 if (!isUndefOrEqual(Mask[i], i) ||
4656 !isUndefOrEqual(Mask[i+1], i))
4662 /// isMOVDDUPYMask - Return true if the specified VECTOR_SHUFFLE operand
4663 /// specifies a shuffle of elements that is suitable for input to 256-bit
4664 /// version of MOVDDUP.
4665 static bool isMOVDDUPYMask(ArrayRef<int> Mask, MVT VT, bool HasFp256) {
4666 if (!HasFp256 || !VT.is256BitVector())
4669 unsigned NumElts = VT.getVectorNumElements();
4673 for (unsigned i = 0; i != NumElts/2; ++i)
4674 if (!isUndefOrEqual(Mask[i], 0))
4676 for (unsigned i = NumElts/2; i != NumElts; ++i)
4677 if (!isUndefOrEqual(Mask[i], NumElts/2))
4682 /// isMOVDDUPMask - Return true if the specified VECTOR_SHUFFLE operand
4683 /// specifies a shuffle of elements that is suitable for input to 128-bit
4684 /// version of MOVDDUP.
4685 static bool isMOVDDUPMask(ArrayRef<int> Mask, MVT VT) {
4686 if (!VT.is128BitVector())
4689 unsigned e = VT.getVectorNumElements() / 2;
4690 for (unsigned i = 0; i != e; ++i)
4691 if (!isUndefOrEqual(Mask[i], i))
4693 for (unsigned i = 0; i != e; ++i)
4694 if (!isUndefOrEqual(Mask[e+i], i))
4699 /// isVEXTRACTIndex - Return true if the specified
4700 /// EXTRACT_SUBVECTOR operand specifies a vector extract that is
4701 /// suitable for instruction that extract 128 or 256 bit vectors
4702 static bool isVEXTRACTIndex(SDNode *N, unsigned vecWidth) {
4703 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4704 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4707 // The index should be aligned on a vecWidth-bit boundary.
4709 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4711 MVT VT = N->getSimpleValueType(0);
4712 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4713 bool Result = (Index * ElSize) % vecWidth == 0;
4718 /// isVINSERTIndex - Return true if the specified INSERT_SUBVECTOR
4719 /// operand specifies a subvector insert that is suitable for input to
4720 /// insertion of 128 or 256-bit subvectors
4721 static bool isVINSERTIndex(SDNode *N, unsigned vecWidth) {
4722 assert((vecWidth == 128 || vecWidth == 256) && "Unexpected vector width");
4723 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4725 // The index should be aligned on a vecWidth-bit boundary.
4727 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4729 MVT VT = N->getSimpleValueType(0);
4730 unsigned ElSize = VT.getVectorElementType().getSizeInBits();
4731 bool Result = (Index * ElSize) % vecWidth == 0;
4736 bool X86::isVINSERT128Index(SDNode *N) {
4737 return isVINSERTIndex(N, 128);
4740 bool X86::isVINSERT256Index(SDNode *N) {
4741 return isVINSERTIndex(N, 256);
4744 bool X86::isVEXTRACT128Index(SDNode *N) {
4745 return isVEXTRACTIndex(N, 128);
4748 bool X86::isVEXTRACT256Index(SDNode *N) {
4749 return isVEXTRACTIndex(N, 256);
4752 /// getShuffleSHUFImmediate - Return the appropriate immediate to shuffle
4753 /// the specified VECTOR_SHUFFLE mask with PSHUF* and SHUFP* instructions.
4754 /// Handles 128-bit and 256-bit.
4755 static unsigned getShuffleSHUFImmediate(ShuffleVectorSDNode *N) {
4756 MVT VT = N->getSimpleValueType(0);
4758 assert((VT.getSizeInBits() >= 128) &&
4759 "Unsupported vector type for PSHUF/SHUFP");
4761 // Handle 128 and 256-bit vector lengths. AVX defines PSHUF/SHUFP to operate
4762 // independently on 128-bit lanes.
4763 unsigned NumElts = VT.getVectorNumElements();
4764 unsigned NumLanes = VT.getSizeInBits()/128;
4765 unsigned NumLaneElts = NumElts/NumLanes;
4767 assert((NumLaneElts == 2 || NumLaneElts == 4 || NumLaneElts == 8) &&
4768 "Only supports 2, 4 or 8 elements per lane");
4770 unsigned Shift = (NumLaneElts >= 4) ? 1 : 0;
4772 for (unsigned i = 0; i != NumElts; ++i) {
4773 int Elt = N->getMaskElt(i);
4774 if (Elt < 0) continue;
4775 Elt &= NumLaneElts - 1;
4776 unsigned ShAmt = (i << Shift) % 8;
4777 Mask |= Elt << ShAmt;
4783 /// getShufflePSHUFHWImmediate - Return the appropriate immediate to shuffle
4784 /// the specified VECTOR_SHUFFLE mask with the PSHUFHW instruction.
4785 static unsigned getShufflePSHUFHWImmediate(ShuffleVectorSDNode *N) {
4786 MVT VT = N->getSimpleValueType(0);
4788 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4789 "Unsupported vector type for PSHUFHW");
4791 unsigned NumElts = VT.getVectorNumElements();
4794 for (unsigned l = 0; l != NumElts; l += 8) {
4795 // 8 nodes per lane, but we only care about the last 4.
4796 for (unsigned i = 0; i < 4; ++i) {
4797 int Elt = N->getMaskElt(l+i+4);
4798 if (Elt < 0) continue;
4799 Elt &= 0x3; // only 2-bits.
4800 Mask |= Elt << (i * 2);
4807 /// getShufflePSHUFLWImmediate - Return the appropriate immediate to shuffle
4808 /// the specified VECTOR_SHUFFLE mask with the PSHUFLW instruction.
4809 static unsigned getShufflePSHUFLWImmediate(ShuffleVectorSDNode *N) {
4810 MVT VT = N->getSimpleValueType(0);
4812 assert((VT == MVT::v8i16 || VT == MVT::v16i16) &&
4813 "Unsupported vector type for PSHUFHW");
4815 unsigned NumElts = VT.getVectorNumElements();
4818 for (unsigned l = 0; l != NumElts; l += 8) {
4819 // 8 nodes per lane, but we only care about the first 4.
4820 for (unsigned i = 0; i < 4; ++i) {
4821 int Elt = N->getMaskElt(l+i);
4822 if (Elt < 0) continue;
4823 Elt &= 0x3; // only 2-bits
4824 Mask |= Elt << (i * 2);
4831 /// \brief Return the appropriate immediate to shuffle the specified
4832 /// VECTOR_SHUFFLE mask with the PALIGNR (if InterLane is false) or with
4833 /// VALIGN (if Interlane is true) instructions.
4834 static unsigned getShuffleAlignrImmediate(ShuffleVectorSDNode *SVOp,
4836 MVT VT = SVOp->getSimpleValueType(0);
4837 unsigned EltSize = InterLane ? 1 :
4838 VT.getVectorElementType().getSizeInBits() >> 3;
4840 unsigned NumElts = VT.getVectorNumElements();
4841 unsigned NumLanes = VT.is512BitVector() ? 1 : VT.getSizeInBits()/128;
4842 unsigned NumLaneElts = NumElts/NumLanes;
4846 for (i = 0; i != NumElts; ++i) {
4847 Val = SVOp->getMaskElt(i);
4851 if (Val >= (int)NumElts)
4852 Val -= NumElts - NumLaneElts;
4854 assert(Val - i > 0 && "PALIGNR imm should be positive");
4855 return (Val - i) * EltSize;
4858 /// \brief Return the appropriate immediate to shuffle the specified
4859 /// VECTOR_SHUFFLE mask with the PALIGNR instruction.
4860 static unsigned getShufflePALIGNRImmediate(ShuffleVectorSDNode *SVOp) {
4861 return getShuffleAlignrImmediate(SVOp, false);
4864 /// \brief Return the appropriate immediate to shuffle the specified
4865 /// VECTOR_SHUFFLE mask with the VALIGN instruction.
4866 static unsigned getShuffleVALIGNImmediate(ShuffleVectorSDNode *SVOp) {
4867 return getShuffleAlignrImmediate(SVOp, true);
4871 static unsigned getExtractVEXTRACTImmediate(SDNode *N, unsigned vecWidth) {
4872 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4873 if (!isa<ConstantSDNode>(N->getOperand(1).getNode()))
4874 llvm_unreachable("Illegal extract subvector for VEXTRACT");
4877 cast<ConstantSDNode>(N->getOperand(1).getNode())->getZExtValue();
4879 MVT VecVT = N->getOperand(0).getSimpleValueType();
4880 MVT ElVT = VecVT.getVectorElementType();
4882 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4883 return Index / NumElemsPerChunk;
4886 static unsigned getInsertVINSERTImmediate(SDNode *N, unsigned vecWidth) {
4887 assert((vecWidth == 128 || vecWidth == 256) && "Unsupported vector width");
4888 if (!isa<ConstantSDNode>(N->getOperand(2).getNode()))
4889 llvm_unreachable("Illegal insert subvector for VINSERT");
4892 cast<ConstantSDNode>(N->getOperand(2).getNode())->getZExtValue();
4894 MVT VecVT = N->getSimpleValueType(0);
4895 MVT ElVT = VecVT.getVectorElementType();
4897 unsigned NumElemsPerChunk = vecWidth / ElVT.getSizeInBits();
4898 return Index / NumElemsPerChunk;
4901 /// getExtractVEXTRACT128Immediate - Return the appropriate immediate
4902 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF128
4903 /// and VINSERTI128 instructions.
4904 unsigned X86::getExtractVEXTRACT128Immediate(SDNode *N) {
4905 return getExtractVEXTRACTImmediate(N, 128);
4908 /// getExtractVEXTRACT256Immediate - Return the appropriate immediate
4909 /// to extract the specified EXTRACT_SUBVECTOR index with VEXTRACTF64x4
4910 /// and VINSERTI64x4 instructions.
4911 unsigned X86::getExtractVEXTRACT256Immediate(SDNode *N) {
4912 return getExtractVEXTRACTImmediate(N, 256);
4915 /// getInsertVINSERT128Immediate - Return the appropriate immediate
4916 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF128
4917 /// and VINSERTI128 instructions.
4918 unsigned X86::getInsertVINSERT128Immediate(SDNode *N) {
4919 return getInsertVINSERTImmediate(N, 128);
4922 /// getInsertVINSERT256Immediate - Return the appropriate immediate
4923 /// to insert at the specified INSERT_SUBVECTOR index with VINSERTF46x4
4924 /// and VINSERTI64x4 instructions.
4925 unsigned X86::getInsertVINSERT256Immediate(SDNode *N) {
4926 return getInsertVINSERTImmediate(N, 256);
4929 /// isZero - Returns true if Elt is a constant integer zero
4930 static bool isZero(SDValue V) {
4931 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
4932 return C && C->isNullValue();
4935 /// isZeroNode - Returns true if Elt is a constant zero or a floating point
4937 bool X86::isZeroNode(SDValue Elt) {
4940 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Elt))
4941 return CFP->getValueAPF().isPosZero();
4945 /// ShouldXformToMOVHLPS - Return true if the node should be transformed to
4946 /// match movhlps. The lower half elements should come from upper half of
4947 /// V1 (and in order), and the upper half elements should come from the upper
4948 /// half of V2 (and in order).
4949 static bool ShouldXformToMOVHLPS(ArrayRef<int> Mask, MVT VT) {
4950 if (!VT.is128BitVector())
4952 if (VT.getVectorNumElements() != 4)
4954 for (unsigned i = 0, e = 2; i != e; ++i)
4955 if (!isUndefOrEqual(Mask[i], i+2))
4957 for (unsigned i = 2; i != 4; ++i)
4958 if (!isUndefOrEqual(Mask[i], i+4))
4963 /// isScalarLoadToVector - Returns true if the node is a scalar load that
4964 /// is promoted to a vector. It also returns the LoadSDNode by reference if
4966 static bool isScalarLoadToVector(SDNode *N, LoadSDNode **LD = nullptr) {
4967 if (N->getOpcode() != ISD::SCALAR_TO_VECTOR)
4969 N = N->getOperand(0).getNode();
4970 if (!ISD::isNON_EXTLoad(N))
4973 *LD = cast<LoadSDNode>(N);
4977 // Test whether the given value is a vector value which will be legalized
4979 static bool WillBeConstantPoolLoad(SDNode *N) {
4980 if (N->getOpcode() != ISD::BUILD_VECTOR)
4983 // Check for any non-constant elements.
4984 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4985 switch (N->getOperand(i).getNode()->getOpcode()) {
4987 case ISD::ConstantFP:
4994 // Vectors of all-zeros and all-ones are materialized with special
4995 // instructions rather than being loaded.
4996 return !ISD::isBuildVectorAllZeros(N) &&
4997 !ISD::isBuildVectorAllOnes(N);
5000 /// ShouldXformToMOVLP{S|D} - Return true if the node should be transformed to
5001 /// match movlp{s|d}. The lower half elements should come from lower half of
5002 /// V1 (and in order), and the upper half elements should come from the upper
5003 /// half of V2 (and in order). And since V1 will become the source of the
5004 /// MOVLP, it must be either a vector load or a scalar load to vector.
5005 static bool ShouldXformToMOVLP(SDNode *V1, SDNode *V2,
5006 ArrayRef<int> Mask, MVT VT) {
5007 if (!VT.is128BitVector())
5010 if (!ISD::isNON_EXTLoad(V1) && !isScalarLoadToVector(V1))
5012 // Is V2 is a vector load, don't do this transformation. We will try to use
5013 // load folding shufps op.
5014 if (ISD::isNON_EXTLoad(V2) || WillBeConstantPoolLoad(V2))
5017 unsigned NumElems = VT.getVectorNumElements();
5019 if (NumElems != 2 && NumElems != 4)
5021 for (unsigned i = 0, e = NumElems/2; i != e; ++i)
5022 if (!isUndefOrEqual(Mask[i], i))
5024 for (unsigned i = NumElems/2, e = NumElems; i != e; ++i)
5025 if (!isUndefOrEqual(Mask[i], i+NumElems))
5030 /// isZeroShuffle - Returns true if N is a VECTOR_SHUFFLE that can be resolved
5031 /// to an zero vector.
5032 /// FIXME: move to dag combiner / method on ShuffleVectorSDNode
5033 static bool isZeroShuffle(ShuffleVectorSDNode *N) {
5034 SDValue V1 = N->getOperand(0);
5035 SDValue V2 = N->getOperand(1);
5036 unsigned NumElems = N->getValueType(0).getVectorNumElements();
5037 for (unsigned i = 0; i != NumElems; ++i) {
5038 int Idx = N->getMaskElt(i);
5039 if (Idx >= (int)NumElems) {
5040 unsigned Opc = V2.getOpcode();
5041 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V2.getNode()))
5043 if (Opc != ISD::BUILD_VECTOR ||
5044 !X86::isZeroNode(V2.getOperand(Idx-NumElems)))
5046 } else if (Idx >= 0) {
5047 unsigned Opc = V1.getOpcode();
5048 if (Opc == ISD::UNDEF || ISD::isBuildVectorAllZeros(V1.getNode()))
5050 if (Opc != ISD::BUILD_VECTOR ||
5051 !X86::isZeroNode(V1.getOperand(Idx)))
5058 /// getZeroVector - Returns a vector of specified type with all zero elements.
5060 static SDValue getZeroVector(EVT VT, const X86Subtarget *Subtarget,
5061 SelectionDAG &DAG, SDLoc dl) {
5062 assert(VT.isVector() && "Expected a vector type");
5064 // Always build SSE zero vectors as <4 x i32> bitcasted
5065 // to their dest type. This ensures they get CSE'd.
5067 if (VT.is128BitVector()) { // SSE
5068 if (Subtarget->hasSSE2()) { // SSE2
5069 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5070 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5072 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5073 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4f32, Cst, Cst, Cst, Cst);
5075 } else if (VT.is256BitVector()) { // AVX
5076 if (Subtarget->hasInt256()) { // AVX2
5077 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5078 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5079 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5081 // 256-bit logic and arithmetic instructions in AVX are all
5082 // floating-point, no support for integer ops. Emit fp zeroed vectors.
5083 SDValue Cst = DAG.getTargetConstantFP(+0.0, MVT::f32);
5084 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5085 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8f32, Ops);
5087 } else if (VT.is512BitVector()) { // AVX-512
5088 SDValue Cst = DAG.getTargetConstant(0, MVT::i32);
5089 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst,
5090 Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5091 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v16i32, Ops);
5092 } else if (VT.getScalarType() == MVT::i1) {
5093 assert(VT.getVectorNumElements() <= 16 && "Unexpected vector type");
5094 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
5095 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
5096 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
5098 llvm_unreachable("Unexpected vector type");
5100 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5103 /// getOnesVector - Returns a vector of specified type with all bits set.
5104 /// Always build ones vectors as <4 x i32> or <8 x i32>. For 256-bit types with
5105 /// no AVX2 supprt, use two <4 x i32> inserted in a <8 x i32> appropriately.
5106 /// Then bitcast to their original type, ensuring they get CSE'd.
5107 static SDValue getOnesVector(MVT VT, bool HasInt256, SelectionDAG &DAG,
5109 assert(VT.isVector() && "Expected a vector type");
5111 SDValue Cst = DAG.getTargetConstant(~0U, MVT::i32);
5113 if (VT.is256BitVector()) {
5114 if (HasInt256) { // AVX2
5115 SDValue Ops[] = { Cst, Cst, Cst, Cst, Cst, Cst, Cst, Cst };
5116 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v8i32, Ops);
5118 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5119 Vec = Concat128BitVectors(Vec, Vec, MVT::v8i32, 8, DAG, dl);
5121 } else if (VT.is128BitVector()) {
5122 Vec = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, Cst, Cst, Cst, Cst);
5124 llvm_unreachable("Unexpected vector type");
5126 return DAG.getNode(ISD::BITCAST, dl, VT, Vec);
5129 /// NormalizeMask - V2 is a splat, modify the mask (if needed) so all elements
5130 /// that point to V2 points to its first element.
5131 static void NormalizeMask(SmallVectorImpl<int> &Mask, unsigned NumElems) {
5132 for (unsigned i = 0; i != NumElems; ++i) {
5133 if (Mask[i] > (int)NumElems) {
5139 /// getMOVLMask - Returns a vector_shuffle mask for an movs{s|d}, movd
5140 /// operation of specified width.
5141 static SDValue getMOVL(SelectionDAG &DAG, SDLoc dl, EVT VT, SDValue V1,
5143 unsigned NumElems = VT.getVectorNumElements();
5144 SmallVector<int, 8> Mask;
5145 Mask.push_back(NumElems);
5146 for (unsigned i = 1; i != NumElems; ++i)
5148 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5151 /// getUnpackl - Returns a vector_shuffle node for an unpackl operation.
5152 static SDValue getUnpackl(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5154 unsigned NumElems = VT.getVectorNumElements();
5155 SmallVector<int, 8> Mask;
5156 for (unsigned i = 0, e = NumElems/2; i != e; ++i) {
5158 Mask.push_back(i + NumElems);
5160 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5163 /// getUnpackh - Returns a vector_shuffle node for an unpackh operation.
5164 static SDValue getUnpackh(SelectionDAG &DAG, SDLoc dl, MVT VT, SDValue V1,
5166 unsigned NumElems = VT.getVectorNumElements();
5167 SmallVector<int, 8> Mask;
5168 for (unsigned i = 0, Half = NumElems/2; i != Half; ++i) {
5169 Mask.push_back(i + Half);
5170 Mask.push_back(i + NumElems + Half);
5172 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask[0]);
5175 // PromoteSplati8i16 - All i16 and i8 vector types can't be used directly by
5176 // a generic shuffle instruction because the target has no such instructions.
5177 // Generate shuffles which repeat i16 and i8 several times until they can be
5178 // represented by v4f32 and then be manipulated by target suported shuffles.
5179 static SDValue PromoteSplati8i16(SDValue V, SelectionDAG &DAG, int &EltNo) {
5180 MVT VT = V.getSimpleValueType();
5181 int NumElems = VT.getVectorNumElements();
5184 while (NumElems > 4) {
5185 if (EltNo < NumElems/2) {
5186 V = getUnpackl(DAG, dl, VT, V, V);
5188 V = getUnpackh(DAG, dl, VT, V, V);
5189 EltNo -= NumElems/2;
5196 /// getLegalSplat - Generate a legal splat with supported x86 shuffles
5197 static SDValue getLegalSplat(SelectionDAG &DAG, SDValue V, int EltNo) {
5198 MVT VT = V.getSimpleValueType();
5201 if (VT.is128BitVector()) {
5202 V = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V);
5203 int SplatMask[4] = { EltNo, EltNo, EltNo, EltNo };
5204 V = DAG.getVectorShuffle(MVT::v4f32, dl, V, DAG.getUNDEF(MVT::v4f32),
5206 } else if (VT.is256BitVector()) {
5207 // To use VPERMILPS to splat scalars, the second half of indicies must
5208 // refer to the higher part, which is a duplication of the lower one,
5209 // because VPERMILPS can only handle in-lane permutations.
5210 int SplatMask[8] = { EltNo, EltNo, EltNo, EltNo,
5211 EltNo+4, EltNo+4, EltNo+4, EltNo+4 };
5213 V = DAG.getNode(ISD::BITCAST, dl, MVT::v8f32, V);
5214 V = DAG.getVectorShuffle(MVT::v8f32, dl, V, DAG.getUNDEF(MVT::v8f32),
5217 llvm_unreachable("Vector size not supported");
5219 return DAG.getNode(ISD::BITCAST, dl, VT, V);
5222 /// PromoteSplat - Splat is promoted to target supported vector shuffles.
5223 static SDValue PromoteSplat(ShuffleVectorSDNode *SV, SelectionDAG &DAG) {
5224 MVT SrcVT = SV->getSimpleValueType(0);
5225 SDValue V1 = SV->getOperand(0);
5228 int EltNo = SV->getSplatIndex();
5229 int NumElems = SrcVT.getVectorNumElements();
5230 bool Is256BitVec = SrcVT.is256BitVector();
5232 assert(((SrcVT.is128BitVector() && NumElems > 4) || Is256BitVec) &&
5233 "Unknown how to promote splat for type");
5235 // Extract the 128-bit part containing the splat element and update
5236 // the splat element index when it refers to the higher register.
5238 V1 = Extract128BitVector(V1, EltNo, DAG, dl);
5239 if (EltNo >= NumElems/2)
5240 EltNo -= NumElems/2;
5243 // All i16 and i8 vector types can't be used directly by a generic shuffle
5244 // instruction because the target has no such instruction. Generate shuffles
5245 // which repeat i16 and i8 several times until they fit in i32, and then can
5246 // be manipulated by target suported shuffles.
5247 MVT EltVT = SrcVT.getVectorElementType();
5248 if (EltVT == MVT::i8 || EltVT == MVT::i16)
5249 V1 = PromoteSplati8i16(V1, DAG, EltNo);
5251 // Recreate the 256-bit vector and place the same 128-bit vector
5252 // into the low and high part. This is necessary because we want
5253 // to use VPERM* to shuffle the vectors
5255 V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, SrcVT, V1, V1);
5258 return getLegalSplat(DAG, V1, EltNo);
5261 /// getShuffleVectorZeroOrUndef - Return a vector_shuffle of the specified
5262 /// vector of zero or undef vector. This produces a shuffle where the low
5263 /// element of V2 is swizzled into the zero/undef vector, landing at element
5264 /// Idx. This produces a shuffle mask like 4,1,2,3 (idx=0) or 0,1,2,4 (idx=3).
5265 static SDValue getShuffleVectorZeroOrUndef(SDValue V2, unsigned Idx,
5267 const X86Subtarget *Subtarget,
5268 SelectionDAG &DAG) {
5269 MVT VT = V2.getSimpleValueType();
5271 ? getZeroVector(VT, Subtarget, DAG, SDLoc(V2)) : DAG.getUNDEF(VT);
5272 unsigned NumElems = VT.getVectorNumElements();
5273 SmallVector<int, 16> MaskVec;
5274 for (unsigned i = 0; i != NumElems; ++i)
5275 // If this is the insertion idx, put the low elt of V2 here.
5276 MaskVec.push_back(i == Idx ? NumElems : i);
5277 return DAG.getVectorShuffle(VT, SDLoc(V2), V1, V2, &MaskVec[0]);
5280 /// getTargetShuffleMask - Calculates the shuffle mask corresponding to the
5281 /// target specific opcode. Returns true if the Mask could be calculated. Sets
5282 /// IsUnary to true if only uses one source. Note that this will set IsUnary for
5283 /// shuffles which use a single input multiple times, and in those cases it will
5284 /// adjust the mask to only have indices within that single input.
5285 static bool getTargetShuffleMask(SDNode *N, MVT VT,
5286 SmallVectorImpl<int> &Mask, bool &IsUnary) {
5287 unsigned NumElems = VT.getVectorNumElements();
5291 bool IsFakeUnary = false;
5292 switch(N->getOpcode()) {
5293 case X86ISD::BLENDI:
5294 ImmN = N->getOperand(N->getNumOperands()-1);
5295 DecodeBLENDMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5298 ImmN = N->getOperand(N->getNumOperands()-1);
5299 DecodeSHUFPMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5300 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5302 case X86ISD::UNPCKH:
5303 DecodeUNPCKHMask(VT, Mask);
5304 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5306 case X86ISD::UNPCKL:
5307 DecodeUNPCKLMask(VT, Mask);
5308 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5310 case X86ISD::MOVHLPS:
5311 DecodeMOVHLPSMask(NumElems, Mask);
5312 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5314 case X86ISD::MOVLHPS:
5315 DecodeMOVLHPSMask(NumElems, Mask);
5316 IsUnary = IsFakeUnary = N->getOperand(0) == N->getOperand(1);
5318 case X86ISD::PALIGNR:
5319 ImmN = N->getOperand(N->getNumOperands()-1);
5320 DecodePALIGNRMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5322 case X86ISD::PSHUFD:
5323 case X86ISD::VPERMILPI:
5324 ImmN = N->getOperand(N->getNumOperands()-1);
5325 DecodePSHUFMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5328 case X86ISD::PSHUFHW:
5329 ImmN = N->getOperand(N->getNumOperands()-1);
5330 DecodePSHUFHWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5333 case X86ISD::PSHUFLW:
5334 ImmN = N->getOperand(N->getNumOperands()-1);
5335 DecodePSHUFLWMask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5338 case X86ISD::PSHUFB: {
5340 SDValue MaskNode = N->getOperand(1);
5341 while (MaskNode->getOpcode() == ISD::BITCAST)
5342 MaskNode = MaskNode->getOperand(0);
5344 if (MaskNode->getOpcode() == ISD::BUILD_VECTOR) {
5345 // If we have a build-vector, then things are easy.
5346 EVT VT = MaskNode.getValueType();
5347 assert(VT.isVector() &&
5348 "Can't produce a non-vector with a build_vector!");
5349 if (!VT.isInteger())
5352 int NumBytesPerElement = VT.getVectorElementType().getSizeInBits() / 8;
5354 SmallVector<uint64_t, 32> RawMask;
5355 for (int i = 0, e = MaskNode->getNumOperands(); i < e; ++i) {
5356 SDValue Op = MaskNode->getOperand(i);
5357 if (Op->getOpcode() == ISD::UNDEF) {
5358 RawMask.push_back((uint64_t)SM_SentinelUndef);
5361 auto *CN = dyn_cast<ConstantSDNode>(Op.getNode());
5364 APInt MaskElement = CN->getAPIntValue();
5366 // We now have to decode the element which could be any integer size and
5367 // extract each byte of it.
5368 for (int j = 0; j < NumBytesPerElement; ++j) {
5369 // Note that this is x86 and so always little endian: the low byte is
5370 // the first byte of the mask.
5371 RawMask.push_back(MaskElement.getLoBits(8).getZExtValue());
5372 MaskElement = MaskElement.lshr(8);
5375 DecodePSHUFBMask(RawMask, Mask);
5379 auto *MaskLoad = dyn_cast<LoadSDNode>(MaskNode);
5383 SDValue Ptr = MaskLoad->getBasePtr();
5384 if (Ptr->getOpcode() == X86ISD::Wrapper)
5385 Ptr = Ptr->getOperand(0);
5387 auto *MaskCP = dyn_cast<ConstantPoolSDNode>(Ptr);
5388 if (!MaskCP || MaskCP->isMachineConstantPoolEntry())
5391 if (auto *C = dyn_cast<Constant>(MaskCP->getConstVal())) {
5392 // FIXME: Support AVX-512 here.
5393 Type *Ty = C->getType();
5394 if (!Ty->isVectorTy() || (Ty->getVectorNumElements() != 16 &&
5395 Ty->getVectorNumElements() != 32))
5398 DecodePSHUFBMask(C, Mask);
5404 case X86ISD::VPERMI:
5405 ImmN = N->getOperand(N->getNumOperands()-1);
5406 DecodeVPERMMask(cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5410 case X86ISD::MOVSD: {
5411 // The index 0 always comes from the first element of the second source,
5412 // this is why MOVSS and MOVSD are used in the first place. The other
5413 // elements come from the other positions of the first source vector
5414 Mask.push_back(NumElems);
5415 for (unsigned i = 1; i != NumElems; ++i) {
5420 case X86ISD::VPERM2X128:
5421 ImmN = N->getOperand(N->getNumOperands()-1);
5422 DecodeVPERM2X128Mask(VT, cast<ConstantSDNode>(ImmN)->getZExtValue(), Mask);
5423 if (Mask.empty()) return false;
5425 case X86ISD::MOVSLDUP:
5426 DecodeMOVSLDUPMask(VT, Mask);
5428 case X86ISD::MOVSHDUP:
5429 DecodeMOVSHDUPMask(VT, Mask);
5431 case X86ISD::MOVDDUP:
5432 case X86ISD::MOVLHPD:
5433 case X86ISD::MOVLPD:
5434 case X86ISD::MOVLPS:
5435 // Not yet implemented
5437 default: llvm_unreachable("unknown target shuffle node");
5440 // If we have a fake unary shuffle, the shuffle mask is spread across two
5441 // inputs that are actually the same node. Re-map the mask to always point
5442 // into the first input.
5445 if (M >= (int)Mask.size())
5451 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
5452 /// element of the result of the vector shuffle.
5453 static SDValue getShuffleScalarElt(SDNode *N, unsigned Index, SelectionDAG &DAG,
5456 return SDValue(); // Limit search depth.
5458 SDValue V = SDValue(N, 0);
5459 EVT VT = V.getValueType();
5460 unsigned Opcode = V.getOpcode();
5462 // Recurse into ISD::VECTOR_SHUFFLE node to find scalars.
5463 if (const ShuffleVectorSDNode *SV = dyn_cast<ShuffleVectorSDNode>(N)) {
5464 int Elt = SV->getMaskElt(Index);
5467 return DAG.getUNDEF(VT.getVectorElementType());
5469 unsigned NumElems = VT.getVectorNumElements();
5470 SDValue NewV = (Elt < (int)NumElems) ? SV->getOperand(0)
5471 : SV->getOperand(1);
5472 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG, Depth+1);
5475 // Recurse into target specific vector shuffles to find scalars.
5476 if (isTargetShuffle(Opcode)) {
5477 MVT ShufVT = V.getSimpleValueType();
5478 unsigned NumElems = ShufVT.getVectorNumElements();
5479 SmallVector<int, 16> ShuffleMask;
5482 if (!getTargetShuffleMask(N, ShufVT, ShuffleMask, IsUnary))
5485 int Elt = ShuffleMask[Index];
5487 return DAG.getUNDEF(ShufVT.getVectorElementType());
5489 SDValue NewV = (Elt < (int)NumElems) ? N->getOperand(0)
5491 return getShuffleScalarElt(NewV.getNode(), Elt % NumElems, DAG,
5495 // Actual nodes that may contain scalar elements
5496 if (Opcode == ISD::BITCAST) {
5497 V = V.getOperand(0);
5498 EVT SrcVT = V.getValueType();
5499 unsigned NumElems = VT.getVectorNumElements();
5501 if (!SrcVT.isVector() || SrcVT.getVectorNumElements() != NumElems)
5505 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
5506 return (Index == 0) ? V.getOperand(0)
5507 : DAG.getUNDEF(VT.getVectorElementType());
5509 if (V.getOpcode() == ISD::BUILD_VECTOR)
5510 return V.getOperand(Index);
5515 /// getNumOfConsecutiveZeros - Return the number of elements of a vector
5516 /// shuffle operation which come from a consecutively from a zero. The
5517 /// search can start in two different directions, from left or right.
5518 /// We count undefs as zeros until PreferredNum is reached.
5519 static unsigned getNumOfConsecutiveZeros(ShuffleVectorSDNode *SVOp,
5520 unsigned NumElems, bool ZerosFromLeft,
5522 unsigned PreferredNum = -1U) {
5523 unsigned NumZeros = 0;
5524 for (unsigned i = 0; i != NumElems; ++i) {
5525 unsigned Index = ZerosFromLeft ? i : NumElems - i - 1;
5526 SDValue Elt = getShuffleScalarElt(SVOp, Index, DAG, 0);
5530 if (X86::isZeroNode(Elt))
5532 else if (Elt.getOpcode() == ISD::UNDEF) // Undef as zero up to PreferredNum.
5533 NumZeros = std::min(NumZeros + 1, PreferredNum);
5541 /// isShuffleMaskConsecutive - Check if the shuffle mask indicies [MaskI, MaskE)
5542 /// correspond consecutively to elements from one of the vector operands,
5543 /// starting from its index OpIdx. Also tell OpNum which source vector operand.
5545 bool isShuffleMaskConsecutive(ShuffleVectorSDNode *SVOp,
5546 unsigned MaskI, unsigned MaskE, unsigned OpIdx,
5547 unsigned NumElems, unsigned &OpNum) {
5548 bool SeenV1 = false;
5549 bool SeenV2 = false;
5551 for (unsigned i = MaskI; i != MaskE; ++i, ++OpIdx) {
5552 int Idx = SVOp->getMaskElt(i);
5553 // Ignore undef indicies
5557 if (Idx < (int)NumElems)
5562 // Only accept consecutive elements from the same vector
5563 if ((Idx % NumElems != OpIdx) || (SeenV1 && SeenV2))
5567 OpNum = SeenV1 ? 0 : 1;
5571 /// isVectorShiftRight - Returns true if the shuffle can be implemented as a
5572 /// logical left shift of a vector.
5573 static bool isVectorShiftRight(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5574 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5576 SVOp->getSimpleValueType(0).getVectorNumElements();
5577 unsigned NumZeros = getNumOfConsecutiveZeros(
5578 SVOp, NumElems, false /* check zeros from right */, DAG,
5579 SVOp->getMaskElt(0));
5585 // Considering the elements in the mask that are not consecutive zeros,
5586 // check if they consecutively come from only one of the source vectors.
5588 // V1 = {X, A, B, C} 0
5590 // vector_shuffle V1, V2 <1, 2, 3, X>
5592 if (!isShuffleMaskConsecutive(SVOp,
5593 0, // Mask Start Index
5594 NumElems-NumZeros, // Mask End Index(exclusive)
5595 NumZeros, // Where to start looking in the src vector
5596 NumElems, // Number of elements in vector
5597 OpSrc)) // Which source operand ?
5602 ShVal = SVOp->getOperand(OpSrc);
5606 /// isVectorShiftLeft - Returns true if the shuffle can be implemented as a
5607 /// logical left shift of a vector.
5608 static bool isVectorShiftLeft(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5609 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5611 SVOp->getSimpleValueType(0).getVectorNumElements();
5612 unsigned NumZeros = getNumOfConsecutiveZeros(
5613 SVOp, NumElems, true /* check zeros from left */, DAG,
5614 NumElems - SVOp->getMaskElt(NumElems - 1) - 1);
5620 // Considering the elements in the mask that are not consecutive zeros,
5621 // check if they consecutively come from only one of the source vectors.
5623 // 0 { A, B, X, X } = V2
5625 // vector_shuffle V1, V2 <X, X, 4, 5>
5627 if (!isShuffleMaskConsecutive(SVOp,
5628 NumZeros, // Mask Start Index
5629 NumElems, // Mask End Index(exclusive)
5630 0, // Where to start looking in the src vector
5631 NumElems, // Number of elements in vector
5632 OpSrc)) // Which source operand ?
5637 ShVal = SVOp->getOperand(OpSrc);
5641 /// isVectorShift - Returns true if the shuffle can be implemented as a
5642 /// logical left or right shift of a vector.
5643 static bool isVectorShift(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG,
5644 bool &isLeft, SDValue &ShVal, unsigned &ShAmt) {
5645 // Although the logic below support any bitwidth size, there are no
5646 // shift instructions which handle more than 128-bit vectors.
5647 if (!SVOp->getSimpleValueType(0).is128BitVector())
5650 if (isVectorShiftLeft(SVOp, DAG, isLeft, ShVal, ShAmt) ||
5651 isVectorShiftRight(SVOp, DAG, isLeft, ShVal, ShAmt))
5657 /// LowerBuildVectorv16i8 - Custom lower build_vector of v16i8.
5659 static SDValue LowerBuildVectorv16i8(SDValue Op, unsigned NonZeros,
5660 unsigned NumNonZero, unsigned NumZero,
5662 const X86Subtarget* Subtarget,
5663 const TargetLowering &TLI) {
5670 for (unsigned i = 0; i < 16; ++i) {
5671 bool ThisIsNonZero = (NonZeros & (1 << i)) != 0;
5672 if (ThisIsNonZero && First) {
5674 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5676 V = DAG.getUNDEF(MVT::v8i16);
5681 SDValue ThisElt, LastElt;
5682 bool LastIsNonZero = (NonZeros & (1 << (i-1))) != 0;
5683 if (LastIsNonZero) {
5684 LastElt = DAG.getNode(ISD::ZERO_EXTEND, dl,
5685 MVT::i16, Op.getOperand(i-1));
5687 if (ThisIsNonZero) {
5688 ThisElt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i16, Op.getOperand(i));
5689 ThisElt = DAG.getNode(ISD::SHL, dl, MVT::i16,
5690 ThisElt, DAG.getConstant(8, MVT::i8));
5692 ThisElt = DAG.getNode(ISD::OR, dl, MVT::i16, ThisElt, LastElt);
5696 if (ThisElt.getNode())
5697 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, V, ThisElt,
5698 DAG.getIntPtrConstant(i/2));
5702 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, V);
5705 /// LowerBuildVectorv8i16 - Custom lower build_vector of v8i16.
5707 static SDValue LowerBuildVectorv8i16(SDValue Op, unsigned NonZeros,
5708 unsigned NumNonZero, unsigned NumZero,
5710 const X86Subtarget* Subtarget,
5711 const TargetLowering &TLI) {
5718 for (unsigned i = 0; i < 8; ++i) {
5719 bool isNonZero = (NonZeros & (1 << i)) != 0;
5723 V = getZeroVector(MVT::v8i16, Subtarget, DAG, dl);
5725 V = DAG.getUNDEF(MVT::v8i16);
5728 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl,
5729 MVT::v8i16, V, Op.getOperand(i),
5730 DAG.getIntPtrConstant(i));
5737 /// LowerBuildVectorv4x32 - Custom lower build_vector of v4i32 or v4f32.
5738 static SDValue LowerBuildVectorv4x32(SDValue Op, unsigned NumElems,
5739 unsigned NonZeros, unsigned NumNonZero,
5740 unsigned NumZero, SelectionDAG &DAG,
5741 const X86Subtarget *Subtarget,
5742 const TargetLowering &TLI) {
5743 // We know there's at least one non-zero element
5744 unsigned FirstNonZeroIdx = 0;
5745 SDValue FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5746 while (FirstNonZero.getOpcode() == ISD::UNDEF ||
5747 X86::isZeroNode(FirstNonZero)) {
5749 FirstNonZero = Op->getOperand(FirstNonZeroIdx);
5752 if (FirstNonZero.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
5753 !isa<ConstantSDNode>(FirstNonZero.getOperand(1)))
5756 SDValue V = FirstNonZero.getOperand(0);
5757 MVT VVT = V.getSimpleValueType();
5758 if (!Subtarget->hasSSE41() || (VVT != MVT::v4f32 && VVT != MVT::v4i32))
5761 unsigned FirstNonZeroDst =
5762 cast<ConstantSDNode>(FirstNonZero.getOperand(1))->getZExtValue();
5763 unsigned CorrectIdx = FirstNonZeroDst == FirstNonZeroIdx;
5764 unsigned IncorrectIdx = CorrectIdx ? -1U : FirstNonZeroIdx;
5765 unsigned IncorrectDst = CorrectIdx ? -1U : FirstNonZeroDst;
5767 for (unsigned Idx = FirstNonZeroIdx + 1; Idx < NumElems; ++Idx) {
5768 SDValue Elem = Op.getOperand(Idx);
5769 if (Elem.getOpcode() == ISD::UNDEF || X86::isZeroNode(Elem))
5772 // TODO: What else can be here? Deal with it.
5773 if (Elem.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
5776 // TODO: Some optimizations are still possible here
5777 // ex: Getting one element from a vector, and the rest from another.
5778 if (Elem.getOperand(0) != V)
5781 unsigned Dst = cast<ConstantSDNode>(Elem.getOperand(1))->getZExtValue();
5784 else if (IncorrectIdx == -1U) {
5788 // There was already one element with an incorrect index.
5789 // We can't optimize this case to an insertps.
5793 if (NumNonZero == CorrectIdx || NumNonZero == CorrectIdx + 1) {
5795 EVT VT = Op.getSimpleValueType();
5796 unsigned ElementMoveMask = 0;
5797 if (IncorrectIdx == -1U)
5798 ElementMoveMask = FirstNonZeroIdx << 6 | FirstNonZeroIdx << 4;
5800 ElementMoveMask = IncorrectDst << 6 | IncorrectIdx << 4;
5802 SDValue InsertpsMask =
5803 DAG.getIntPtrConstant(ElementMoveMask | (~NonZeros & 0xf));
5804 return DAG.getNode(X86ISD::INSERTPS, dl, VT, V, V, InsertpsMask);
5810 /// getVShift - Return a vector logical shift node.
5812 static SDValue getVShift(bool isLeft, EVT VT, SDValue SrcOp,
5813 unsigned NumBits, SelectionDAG &DAG,
5814 const TargetLowering &TLI, SDLoc dl) {
5815 assert(VT.is128BitVector() && "Unknown type for VShift");
5816 EVT ShVT = MVT::v2i64;
5817 unsigned Opc = isLeft ? X86ISD::VSHLDQ : X86ISD::VSRLDQ;
5818 SrcOp = DAG.getNode(ISD::BITCAST, dl, ShVT, SrcOp);
5819 return DAG.getNode(ISD::BITCAST, dl, VT,
5820 DAG.getNode(Opc, dl, ShVT, SrcOp,
5821 DAG.getConstant(NumBits,
5822 TLI.getScalarShiftAmountTy(SrcOp.getValueType()))));
5826 LowerAsSplatVectorLoad(SDValue SrcOp, MVT VT, SDLoc dl, SelectionDAG &DAG) {
5828 // Check if the scalar load can be widened into a vector load. And if
5829 // the address is "base + cst" see if the cst can be "absorbed" into
5830 // the shuffle mask.
5831 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(SrcOp)) {
5832 SDValue Ptr = LD->getBasePtr();
5833 if (!ISD::isNormalLoad(LD) || LD->isVolatile())
5835 EVT PVT = LD->getValueType(0);
5836 if (PVT != MVT::i32 && PVT != MVT::f32)
5841 if (FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr)) {
5842 FI = FINode->getIndex();
5844 } else if (DAG.isBaseWithConstantOffset(Ptr) &&
5845 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
5846 FI = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
5847 Offset = Ptr.getConstantOperandVal(1);
5848 Ptr = Ptr.getOperand(0);
5853 // FIXME: 256-bit vector instructions don't require a strict alignment,
5854 // improve this code to support it better.
5855 unsigned RequiredAlign = VT.getSizeInBits()/8;
5856 SDValue Chain = LD->getChain();
5857 // Make sure the stack object alignment is at least 16 or 32.
5858 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
5859 if (DAG.InferPtrAlignment(Ptr) < RequiredAlign) {
5860 if (MFI->isFixedObjectIndex(FI)) {
5861 // Can't change the alignment. FIXME: It's possible to compute
5862 // the exact stack offset and reference FI + adjust offset instead.
5863 // If someone *really* cares about this. That's the way to implement it.
5866 MFI->setObjectAlignment(FI, RequiredAlign);
5870 // (Offset % 16 or 32) must be multiple of 4. Then address is then
5871 // Ptr + (Offset & ~15).
5874 if ((Offset % RequiredAlign) & 3)
5876 int64_t StartOffset = Offset & ~(RequiredAlign-1);
5878 Ptr = DAG.getNode(ISD::ADD, SDLoc(Ptr), Ptr.getValueType(),
5879 Ptr,DAG.getConstant(StartOffset, Ptr.getValueType()));
5881 int EltNo = (Offset - StartOffset) >> 2;
5882 unsigned NumElems = VT.getVectorNumElements();
5884 EVT NVT = EVT::getVectorVT(*DAG.getContext(), PVT, NumElems);
5885 SDValue V1 = DAG.getLoad(NVT, dl, Chain, Ptr,
5886 LD->getPointerInfo().getWithOffset(StartOffset),
5887 false, false, false, 0);
5889 SmallVector<int, 8> Mask;
5890 for (unsigned i = 0; i != NumElems; ++i)
5891 Mask.push_back(EltNo);
5893 return DAG.getVectorShuffle(NVT, dl, V1, DAG.getUNDEF(NVT), &Mask[0]);
5899 /// EltsFromConsecutiveLoads - Given the initializing elements 'Elts' of a
5900 /// vector of type 'VT', see if the elements can be replaced by a single large
5901 /// load which has the same value as a build_vector whose operands are 'elts'.
5903 /// Example: <load i32 *a, load i32 *a+4, undef, undef> -> zextload a
5905 /// FIXME: we'd also like to handle the case where the last elements are zero
5906 /// rather than undef via VZEXT_LOAD, but we do not detect that case today.
5907 /// There's even a handy isZeroNode for that purpose.
5908 static SDValue EltsFromConsecutiveLoads(EVT VT, SmallVectorImpl<SDValue> &Elts,
5909 SDLoc &DL, SelectionDAG &DAG,
5910 bool isAfterLegalize) {
5911 EVT EltVT = VT.getVectorElementType();
5912 unsigned NumElems = Elts.size();
5914 LoadSDNode *LDBase = nullptr;
5915 unsigned LastLoadedElt = -1U;
5917 // For each element in the initializer, see if we've found a load or an undef.
5918 // If we don't find an initial load element, or later load elements are
5919 // non-consecutive, bail out.
5920 for (unsigned i = 0; i < NumElems; ++i) {
5921 SDValue Elt = Elts[i];
5923 if (!Elt.getNode() ||
5924 (Elt.getOpcode() != ISD::UNDEF && !ISD::isNON_EXTLoad(Elt.getNode())))
5927 if (Elt.getNode()->getOpcode() == ISD::UNDEF)
5929 LDBase = cast<LoadSDNode>(Elt.getNode());
5933 if (Elt.getOpcode() == ISD::UNDEF)
5936 LoadSDNode *LD = cast<LoadSDNode>(Elt);
5937 if (!DAG.isConsecutiveLoad(LD, LDBase, EltVT.getSizeInBits()/8, i))
5942 // If we have found an entire vector of loads and undefs, then return a large
5943 // load of the entire vector width starting at the base pointer. If we found
5944 // consecutive loads for the low half, generate a vzext_load node.
5945 if (LastLoadedElt == NumElems - 1) {
5947 if (isAfterLegalize &&
5948 !DAG.getTargetLoweringInfo().isOperationLegal(ISD::LOAD, VT))
5951 SDValue NewLd = SDValue();
5953 if (DAG.InferPtrAlignment(LDBase->getBasePtr()) >= 16)
5954 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5955 LDBase->getPointerInfo(),
5956 LDBase->isVolatile(), LDBase->isNonTemporal(),
5957 LDBase->isInvariant(), 0);
5958 NewLd = DAG.getLoad(VT, DL, LDBase->getChain(), LDBase->getBasePtr(),
5959 LDBase->getPointerInfo(),
5960 LDBase->isVolatile(), LDBase->isNonTemporal(),
5961 LDBase->isInvariant(), LDBase->getAlignment());
5963 if (LDBase->hasAnyUseOfValue(1)) {
5964 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5966 SDValue(NewLd.getNode(), 1));
5967 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5968 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5969 SDValue(NewLd.getNode(), 1));
5974 if (NumElems == 4 && LastLoadedElt == 1 &&
5975 DAG.getTargetLoweringInfo().isTypeLegal(MVT::v2i64)) {
5976 SDVTList Tys = DAG.getVTList(MVT::v2i64, MVT::Other);
5977 SDValue Ops[] = { LDBase->getChain(), LDBase->getBasePtr() };
5979 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, DL, Tys, Ops, MVT::i64,
5980 LDBase->getPointerInfo(),
5981 LDBase->getAlignment(),
5982 false/*isVolatile*/, true/*ReadMem*/,
5985 // Make sure the newly-created LOAD is in the same position as LDBase in
5986 // terms of dependency. We create a TokenFactor for LDBase and ResNode, and
5987 // update uses of LDBase's output chain to use the TokenFactor.
5988 if (LDBase->hasAnyUseOfValue(1)) {
5989 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
5990 SDValue(LDBase, 1), SDValue(ResNode.getNode(), 1));
5991 DAG.ReplaceAllUsesOfValueWith(SDValue(LDBase, 1), NewChain);
5992 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(LDBase, 1),
5993 SDValue(ResNode.getNode(), 1));
5996 return DAG.getNode(ISD::BITCAST, DL, VT, ResNode);
6001 /// LowerVectorBroadcast - Attempt to use the vbroadcast instruction
6002 /// to generate a splat value for the following cases:
6003 /// 1. A splat BUILD_VECTOR which uses a single scalar load, or a constant.
6004 /// 2. A splat shuffle which uses a scalar_to_vector node which comes from
6005 /// a scalar load, or a constant.
6006 /// The VBROADCAST node is returned when a pattern is found,
6007 /// or SDValue() otherwise.
6008 static SDValue LowerVectorBroadcast(SDValue Op, const X86Subtarget* Subtarget,
6009 SelectionDAG &DAG) {
6010 // VBROADCAST requires AVX.
6011 // TODO: Splats could be generated for non-AVX CPUs using SSE
6012 // instructions, but there's less potential gain for only 128-bit vectors.
6013 if (!Subtarget->hasAVX())
6016 MVT VT = Op.getSimpleValueType();
6019 assert((VT.is128BitVector() || VT.is256BitVector() || VT.is512BitVector()) &&
6020 "Unsupported vector type for broadcast.");
6025 switch (Op.getOpcode()) {
6027 // Unknown pattern found.
6030 case ISD::BUILD_VECTOR: {
6031 auto *BVOp = cast<BuildVectorSDNode>(Op.getNode());
6032 BitVector UndefElements;
6033 SDValue Splat = BVOp->getSplatValue(&UndefElements);
6035 // We need a splat of a single value to use broadcast, and it doesn't
6036 // make any sense if the value is only in one element of the vector.
6037 if (!Splat || (VT.getVectorNumElements() - UndefElements.count()) <= 1)
6041 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6042 Ld.getOpcode() == ISD::ConstantFP);
6044 // Make sure that all of the users of a non-constant load are from the
6045 // BUILD_VECTOR node.
6046 if (!ConstSplatVal && !BVOp->isOnlyUserOf(Ld.getNode()))
6051 case ISD::VECTOR_SHUFFLE: {
6052 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
6054 // Shuffles must have a splat mask where the first element is
6056 if ((!SVOp->isSplat()) || SVOp->getMaskElt(0) != 0)
6059 SDValue Sc = Op.getOperand(0);
6060 if (Sc.getOpcode() != ISD::SCALAR_TO_VECTOR &&
6061 Sc.getOpcode() != ISD::BUILD_VECTOR) {
6063 if (!Subtarget->hasInt256())
6066 // Use the register form of the broadcast instruction available on AVX2.
6067 if (VT.getSizeInBits() >= 256)
6068 Sc = Extract128BitVector(Sc, 0, DAG, dl);
6069 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Sc);
6072 Ld = Sc.getOperand(0);
6073 ConstSplatVal = (Ld.getOpcode() == ISD::Constant ||
6074 Ld.getOpcode() == ISD::ConstantFP);
6076 // The scalar_to_vector node and the suspected
6077 // load node must have exactly one user.
6078 // Constants may have multiple users.
6080 // AVX-512 has register version of the broadcast
6081 bool hasRegVer = Subtarget->hasAVX512() && VT.is512BitVector() &&
6082 Ld.getValueType().getSizeInBits() >= 32;
6083 if (!ConstSplatVal && ((!Sc.hasOneUse() || !Ld.hasOneUse()) &&
6090 unsigned ScalarSize = Ld.getValueType().getSizeInBits();
6091 bool IsGE256 = (VT.getSizeInBits() >= 256);
6093 // When optimizing for size, generate up to 5 extra bytes for a broadcast
6094 // instruction to save 8 or more bytes of constant pool data.
6095 // TODO: If multiple splats are generated to load the same constant,
6096 // it may be detrimental to overall size. There needs to be a way to detect
6097 // that condition to know if this is truly a size win.
6098 const Function *F = DAG.getMachineFunction().getFunction();
6099 bool OptForSize = F->getAttributes().
6100 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
6102 // Handle broadcasting a single constant scalar from the constant pool
6104 // On Sandybridge (no AVX2), it is still better to load a constant vector
6105 // from the constant pool and not to broadcast it from a scalar.
6106 // But override that restriction when optimizing for size.
6107 // TODO: Check if splatting is recommended for other AVX-capable CPUs.
6108 if (ConstSplatVal && (Subtarget->hasAVX2() || OptForSize)) {
6109 EVT CVT = Ld.getValueType();
6110 assert(!CVT.isVector() && "Must not broadcast a vector type");
6112 // Splat f32, i32, v4f64, v4i64 in all cases with AVX2.
6113 // For size optimization, also splat v2f64 and v2i64, and for size opt
6114 // with AVX2, also splat i8 and i16.
6115 // With pattern matching, the VBROADCAST node may become a VMOVDDUP.
6116 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64) ||
6117 (OptForSize && (ScalarSize == 64 || Subtarget->hasAVX2()))) {
6118 const Constant *C = nullptr;
6119 if (ConstantSDNode *CI = dyn_cast<ConstantSDNode>(Ld))
6120 C = CI->getConstantIntValue();
6121 else if (ConstantFPSDNode *CF = dyn_cast<ConstantFPSDNode>(Ld))
6122 C = CF->getConstantFPValue();
6124 assert(C && "Invalid constant type");
6126 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6127 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
6128 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
6129 Ld = DAG.getLoad(CVT, dl, DAG.getEntryNode(), CP,
6130 MachinePointerInfo::getConstantPool(),
6131 false, false, false, Alignment);
6133 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6137 bool IsLoad = ISD::isNormalLoad(Ld.getNode());
6139 // Handle AVX2 in-register broadcasts.
6140 if (!IsLoad && Subtarget->hasInt256() &&
6141 (ScalarSize == 32 || (IsGE256 && ScalarSize == 64)))
6142 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6144 // The scalar source must be a normal load.
6148 if (ScalarSize == 32 || (IsGE256 && ScalarSize == 64))
6149 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6151 // The integer check is needed for the 64-bit into 128-bit so it doesn't match
6152 // double since there is no vbroadcastsd xmm
6153 if (Subtarget->hasInt256() && Ld.getValueType().isInteger()) {
6154 if (ScalarSize == 8 || ScalarSize == 16 || ScalarSize == 64)
6155 return DAG.getNode(X86ISD::VBROADCAST, dl, VT, Ld);
6158 // Unsupported broadcast.
6162 /// \brief For an EXTRACT_VECTOR_ELT with a constant index return the real
6163 /// underlying vector and index.
6165 /// Modifies \p ExtractedFromVec to the real vector and returns the real
6167 static int getUnderlyingExtractedFromVec(SDValue &ExtractedFromVec,
6169 int Idx = cast<ConstantSDNode>(ExtIdx)->getZExtValue();
6170 if (!isa<ShuffleVectorSDNode>(ExtractedFromVec))
6173 // For 256-bit vectors, LowerEXTRACT_VECTOR_ELT_SSE4 may have already
6175 // (extract_vector_elt (v8f32 %vreg1), Constant<6>)
6177 // (extract_vector_elt (vector_shuffle<2,u,u,u>
6178 // (extract_subvector (v8f32 %vreg0), Constant<4>),
6181 // In this case the vector is the extract_subvector expression and the index
6182 // is 2, as specified by the shuffle.
6183 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(ExtractedFromVec);
6184 SDValue ShuffleVec = SVOp->getOperand(0);
6185 MVT ShuffleVecVT = ShuffleVec.getSimpleValueType();
6186 assert(ShuffleVecVT.getVectorElementType() ==
6187 ExtractedFromVec.getSimpleValueType().getVectorElementType());
6189 int ShuffleIdx = SVOp->getMaskElt(Idx);
6190 if (isUndefOrInRange(ShuffleIdx, 0, ShuffleVecVT.getVectorNumElements())) {
6191 ExtractedFromVec = ShuffleVec;
6197 static SDValue buildFromShuffleMostly(SDValue Op, SelectionDAG &DAG) {
6198 MVT VT = Op.getSimpleValueType();
6200 // Skip if insert_vec_elt is not supported.
6201 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
6202 if (!TLI.isOperationLegalOrCustom(ISD::INSERT_VECTOR_ELT, VT))
6206 unsigned NumElems = Op.getNumOperands();
6210 SmallVector<unsigned, 4> InsertIndices;
6211 SmallVector<int, 8> Mask(NumElems, -1);
6213 for (unsigned i = 0; i != NumElems; ++i) {
6214 unsigned Opc = Op.getOperand(i).getOpcode();
6216 if (Opc == ISD::UNDEF)
6219 if (Opc != ISD::EXTRACT_VECTOR_ELT) {
6220 // Quit if more than 1 elements need inserting.
6221 if (InsertIndices.size() > 1)
6224 InsertIndices.push_back(i);
6228 SDValue ExtractedFromVec = Op.getOperand(i).getOperand(0);
6229 SDValue ExtIdx = Op.getOperand(i).getOperand(1);
6230 // Quit if non-constant index.
6231 if (!isa<ConstantSDNode>(ExtIdx))
6233 int Idx = getUnderlyingExtractedFromVec(ExtractedFromVec, ExtIdx);
6235 // Quit if extracted from vector of different type.
6236 if (ExtractedFromVec.getValueType() != VT)
6239 if (!VecIn1.getNode())
6240 VecIn1 = ExtractedFromVec;
6241 else if (VecIn1 != ExtractedFromVec) {
6242 if (!VecIn2.getNode())
6243 VecIn2 = ExtractedFromVec;
6244 else if (VecIn2 != ExtractedFromVec)
6245 // Quit if more than 2 vectors to shuffle
6249 if (ExtractedFromVec == VecIn1)
6251 else if (ExtractedFromVec == VecIn2)
6252 Mask[i] = Idx + NumElems;
6255 if (!VecIn1.getNode())
6258 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
6259 SDValue NV = DAG.getVectorShuffle(VT, DL, VecIn1, VecIn2, &Mask[0]);
6260 for (unsigned i = 0, e = InsertIndices.size(); i != e; ++i) {
6261 unsigned Idx = InsertIndices[i];
6262 NV = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, NV, Op.getOperand(Idx),
6263 DAG.getIntPtrConstant(Idx));
6269 // Lower BUILD_VECTOR operation for v8i1 and v16i1 types.
6271 X86TargetLowering::LowerBUILD_VECTORvXi1(SDValue Op, SelectionDAG &DAG) const {
6273 MVT VT = Op.getSimpleValueType();
6274 assert((VT.getVectorElementType() == MVT::i1) && (VT.getSizeInBits() <= 16) &&
6275 "Unexpected type in LowerBUILD_VECTORvXi1!");
6278 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6279 SDValue Cst = DAG.getTargetConstant(0, MVT::i1);
6280 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6281 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6284 if (ISD::isBuildVectorAllOnes(Op.getNode())) {
6285 SDValue Cst = DAG.getTargetConstant(1, MVT::i1);
6286 SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Cst);
6287 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
6290 bool AllContants = true;
6291 uint64_t Immediate = 0;
6292 int NonConstIdx = -1;
6293 bool IsSplat = true;
6294 unsigned NumNonConsts = 0;
6295 unsigned NumConsts = 0;
6296 for (unsigned idx = 0, e = Op.getNumOperands(); idx < e; ++idx) {
6297 SDValue In = Op.getOperand(idx);
6298 if (In.getOpcode() == ISD::UNDEF)
6300 if (!isa<ConstantSDNode>(In)) {
6301 AllContants = false;
6307 if (cast<ConstantSDNode>(In)->getZExtValue())
6308 Immediate |= (1ULL << idx);
6310 if (In != Op.getOperand(0))
6315 SDValue FullMask = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1,
6316 DAG.getConstant(Immediate, MVT::i16));
6317 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT, FullMask,
6318 DAG.getIntPtrConstant(0));
6321 if (NumNonConsts == 1 && NonConstIdx != 0) {
6324 SDValue VecAsImm = DAG.getConstant(Immediate,
6325 MVT::getIntegerVT(VT.getSizeInBits()));
6326 DstVec = DAG.getNode(ISD::BITCAST, dl, VT, VecAsImm);
6329 DstVec = DAG.getUNDEF(VT);
6330 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, DstVec,
6331 Op.getOperand(NonConstIdx),
6332 DAG.getIntPtrConstant(NonConstIdx));
6334 if (!IsSplat && (NonConstIdx != 0))
6335 llvm_unreachable("Unsupported BUILD_VECTOR operation");
6336 MVT SelectVT = (VT == MVT::v16i1)? MVT::i16 : MVT::i8;
6339 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6340 DAG.getConstant(-1, SelectVT),
6341 DAG.getConstant(0, SelectVT));
6343 Select = DAG.getNode(ISD::SELECT, dl, SelectVT, Op.getOperand(0),
6344 DAG.getConstant((Immediate | 1), SelectVT),
6345 DAG.getConstant(Immediate, SelectVT));
6346 return DAG.getNode(ISD::BITCAST, dl, VT, Select);
6349 /// \brief Return true if \p N implements a horizontal binop and return the
6350 /// operands for the horizontal binop into V0 and V1.
6352 /// This is a helper function of PerformBUILD_VECTORCombine.
6353 /// This function checks that the build_vector \p N in input implements a
6354 /// horizontal operation. Parameter \p Opcode defines the kind of horizontal
6355 /// operation to match.
6356 /// For example, if \p Opcode is equal to ISD::ADD, then this function
6357 /// checks if \p N implements a horizontal arithmetic add; if instead \p Opcode
6358 /// is equal to ISD::SUB, then this function checks if this is a horizontal
6361 /// This function only analyzes elements of \p N whose indices are
6362 /// in range [BaseIdx, LastIdx).
6363 static bool isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode,
6365 unsigned BaseIdx, unsigned LastIdx,
6366 SDValue &V0, SDValue &V1) {
6367 EVT VT = N->getValueType(0);
6369 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!");
6370 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx &&
6371 "Invalid Vector in input!");
6373 bool IsCommutable = (Opcode == ISD::ADD || Opcode == ISD::FADD);
6374 bool CanFold = true;
6375 unsigned ExpectedVExtractIdx = BaseIdx;
6376 unsigned NumElts = LastIdx - BaseIdx;
6377 V0 = DAG.getUNDEF(VT);
6378 V1 = DAG.getUNDEF(VT);
6380 // Check if N implements a horizontal binop.
6381 for (unsigned i = 0, e = NumElts; i != e && CanFold; ++i) {
6382 SDValue Op = N->getOperand(i + BaseIdx);
6385 if (Op->getOpcode() == ISD::UNDEF) {
6386 // Update the expected vector extract index.
6387 if (i * 2 == NumElts)
6388 ExpectedVExtractIdx = BaseIdx;
6389 ExpectedVExtractIdx += 2;
6393 CanFold = Op->getOpcode() == Opcode && Op->hasOneUse();
6398 SDValue Op0 = Op.getOperand(0);
6399 SDValue Op1 = Op.getOperand(1);
6401 // Try to match the following pattern:
6402 // (BINOP (extract_vector_elt A, I), (extract_vector_elt A, I+1))
6403 CanFold = (Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6404 Op1.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
6405 Op0.getOperand(0) == Op1.getOperand(0) &&
6406 isa<ConstantSDNode>(Op0.getOperand(1)) &&
6407 isa<ConstantSDNode>(Op1.getOperand(1)));
6411 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6412 unsigned I1 = cast<ConstantSDNode>(Op1.getOperand(1))->getZExtValue();
6414 if (i * 2 < NumElts) {
6415 if (V0.getOpcode() == ISD::UNDEF)
6416 V0 = Op0.getOperand(0);
6418 if (V1.getOpcode() == ISD::UNDEF)
6419 V1 = Op0.getOperand(0);
6420 if (i * 2 == NumElts)
6421 ExpectedVExtractIdx = BaseIdx;
6424 SDValue Expected = (i * 2 < NumElts) ? V0 : V1;
6425 if (I0 == ExpectedVExtractIdx)
6426 CanFold = I1 == I0 + 1 && Op0.getOperand(0) == Expected;
6427 else if (IsCommutable && I1 == ExpectedVExtractIdx) {
6428 // Try to match the following dag sequence:
6429 // (BINOP (extract_vector_elt A, I+1), (extract_vector_elt A, I))
6430 CanFold = I0 == I1 + 1 && Op1.getOperand(0) == Expected;
6434 ExpectedVExtractIdx += 2;
6440 /// \brief Emit a sequence of two 128-bit horizontal add/sub followed by
6441 /// a concat_vector.
6443 /// This is a helper function of PerformBUILD_VECTORCombine.
6444 /// This function expects two 256-bit vectors called V0 and V1.
6445 /// At first, each vector is split into two separate 128-bit vectors.
6446 /// Then, the resulting 128-bit vectors are used to implement two
6447 /// horizontal binary operations.
6449 /// The kind of horizontal binary operation is defined by \p X86Opcode.
6451 /// \p Mode specifies how the 128-bit parts of V0 and V1 are passed in input to
6452 /// the two new horizontal binop.
6453 /// When Mode is set, the first horizontal binop dag node would take as input
6454 /// the lower 128-bit of V0 and the upper 128-bit of V0. The second
6455 /// horizontal binop dag node would take as input the lower 128-bit of V1
6456 /// and the upper 128-bit of V1.
6458 /// HADD V0_LO, V0_HI
6459 /// HADD V1_LO, V1_HI
6461 /// Otherwise, the first horizontal binop dag node takes as input the lower
6462 /// 128-bit of V0 and the lower 128-bit of V1, and the second horizontal binop
6463 /// dag node takes the the upper 128-bit of V0 and the upper 128-bit of V1.
6465 /// HADD V0_LO, V1_LO
6466 /// HADD V0_HI, V1_HI
6468 /// If \p isUndefLO is set, then the algorithm propagates UNDEF to the lower
6469 /// 128-bits of the result. If \p isUndefHI is set, then UNDEF is propagated to
6470 /// the upper 128-bits of the result.
6471 static SDValue ExpandHorizontalBinOp(const SDValue &V0, const SDValue &V1,
6472 SDLoc DL, SelectionDAG &DAG,
6473 unsigned X86Opcode, bool Mode,
6474 bool isUndefLO, bool isUndefHI) {
6475 EVT VT = V0.getValueType();
6476 assert(VT.is256BitVector() && VT == V1.getValueType() &&
6477 "Invalid nodes in input!");
6479 unsigned NumElts = VT.getVectorNumElements();
6480 SDValue V0_LO = Extract128BitVector(V0, 0, DAG, DL);
6481 SDValue V0_HI = Extract128BitVector(V0, NumElts/2, DAG, DL);
6482 SDValue V1_LO = Extract128BitVector(V1, 0, DAG, DL);
6483 SDValue V1_HI = Extract128BitVector(V1, NumElts/2, DAG, DL);
6484 EVT NewVT = V0_LO.getValueType();
6486 SDValue LO = DAG.getUNDEF(NewVT);
6487 SDValue HI = DAG.getUNDEF(NewVT);
6490 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6491 if (!isUndefLO && V0->getOpcode() != ISD::UNDEF)
6492 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V0_HI);
6493 if (!isUndefHI && V1->getOpcode() != ISD::UNDEF)
6494 HI = DAG.getNode(X86Opcode, DL, NewVT, V1_LO, V1_HI);
6496 // Don't emit a horizontal binop if the result is expected to be UNDEF.
6497 if (!isUndefLO && (V0_LO->getOpcode() != ISD::UNDEF ||
6498 V1_LO->getOpcode() != ISD::UNDEF))
6499 LO = DAG.getNode(X86Opcode, DL, NewVT, V0_LO, V1_LO);
6501 if (!isUndefHI && (V0_HI->getOpcode() != ISD::UNDEF ||
6502 V1_HI->getOpcode() != ISD::UNDEF))
6503 HI = DAG.getNode(X86Opcode, DL, NewVT, V0_HI, V1_HI);
6506 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LO, HI);
6509 /// \brief Try to fold a build_vector that performs an 'addsub' into the
6510 /// sequence of 'vadd + vsub + blendi'.
6511 static SDValue matchAddSub(const BuildVectorSDNode *BV, SelectionDAG &DAG,
6512 const X86Subtarget *Subtarget) {
6514 EVT VT = BV->getValueType(0);
6515 unsigned NumElts = VT.getVectorNumElements();
6516 SDValue InVec0 = DAG.getUNDEF(VT);
6517 SDValue InVec1 = DAG.getUNDEF(VT);
6519 assert((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v4f32 ||
6520 VT == MVT::v2f64) && "build_vector with an invalid type found!");
6522 // Odd-numbered elements in the input build vector are obtained from
6523 // adding two integer/float elements.
6524 // Even-numbered elements in the input build vector are obtained from
6525 // subtracting two integer/float elements.
6526 unsigned ExpectedOpcode = ISD::FSUB;
6527 unsigned NextExpectedOpcode = ISD::FADD;
6528 bool AddFound = false;
6529 bool SubFound = false;
6531 for (unsigned i = 0, e = NumElts; i != e; i++) {
6532 SDValue Op = BV->getOperand(i);
6534 // Skip 'undef' values.
6535 unsigned Opcode = Op.getOpcode();
6536 if (Opcode == ISD::UNDEF) {
6537 std::swap(ExpectedOpcode, NextExpectedOpcode);
6541 // Early exit if we found an unexpected opcode.
6542 if (Opcode != ExpectedOpcode)
6545 SDValue Op0 = Op.getOperand(0);
6546 SDValue Op1 = Op.getOperand(1);
6548 // Try to match the following pattern:
6549 // (BINOP (extract_vector_elt A, i), (extract_vector_elt B, i))
6550 // Early exit if we cannot match that sequence.
6551 if (Op0.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6552 Op1.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
6553 !isa<ConstantSDNode>(Op0.getOperand(1)) ||
6554 !isa<ConstantSDNode>(Op1.getOperand(1)) ||
6555 Op0.getOperand(1) != Op1.getOperand(1))
6558 unsigned I0 = cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue();
6562 // We found a valid add/sub node. Update the information accordingly.
6568 // Update InVec0 and InVec1.
6569 if (InVec0.getOpcode() == ISD::UNDEF)
6570 InVec0 = Op0.getOperand(0);
6571 if (InVec1.getOpcode() == ISD::UNDEF)
6572 InVec1 = Op1.getOperand(0);
6574 // Make sure that operands in input to each add/sub node always
6575 // come from a same pair of vectors.
6576 if (InVec0 != Op0.getOperand(0)) {
6577 if (ExpectedOpcode == ISD::FSUB)
6580 // FADD is commutable. Try to commute the operands
6581 // and then test again.
6582 std::swap(Op0, Op1);
6583 if (InVec0 != Op0.getOperand(0))
6587 if (InVec1 != Op1.getOperand(0))
6590 // Update the pair of expected opcodes.
6591 std::swap(ExpectedOpcode, NextExpectedOpcode);
6594 // Don't try to fold this build_vector into an ADDSUB if the inputs are undef.
6595 if (AddFound && SubFound && InVec0.getOpcode() != ISD::UNDEF &&
6596 InVec1.getOpcode() != ISD::UNDEF)
6597 return DAG.getNode(X86ISD::ADDSUB, DL, VT, InVec0, InVec1);
6602 static SDValue PerformBUILD_VECTORCombine(SDNode *N, SelectionDAG &DAG,
6603 const X86Subtarget *Subtarget) {
6605 EVT VT = N->getValueType(0);
6606 unsigned NumElts = VT.getVectorNumElements();
6607 BuildVectorSDNode *BV = cast<BuildVectorSDNode>(N);
6608 SDValue InVec0, InVec1;
6610 // Try to match an ADDSUB.
6611 if ((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
6612 (Subtarget->hasAVX() && (VT == MVT::v8f32 || VT == MVT::v4f64))) {
6613 SDValue Value = matchAddSub(BV, DAG, Subtarget);
6614 if (Value.getNode())
6618 // Try to match horizontal ADD/SUB.
6619 unsigned NumUndefsLO = 0;
6620 unsigned NumUndefsHI = 0;
6621 unsigned Half = NumElts/2;
6623 // Count the number of UNDEF operands in the build_vector in input.
6624 for (unsigned i = 0, e = Half; i != e; ++i)
6625 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6628 for (unsigned i = Half, e = NumElts; i != e; ++i)
6629 if (BV->getOperand(i)->getOpcode() == ISD::UNDEF)
6632 // Early exit if this is either a build_vector of all UNDEFs or all the
6633 // operands but one are UNDEF.
6634 if (NumUndefsLO + NumUndefsHI + 1 >= NumElts)
6637 if ((VT == MVT::v4f32 || VT == MVT::v2f64) && Subtarget->hasSSE3()) {
6638 // Try to match an SSE3 float HADD/HSUB.
6639 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6640 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6642 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6643 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6644 } else if ((VT == MVT::v4i32 || VT == MVT::v8i16) && Subtarget->hasSSSE3()) {
6645 // Try to match an SSSE3 integer HADD/HSUB.
6646 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6647 return DAG.getNode(X86ISD::HADD, DL, VT, InVec0, InVec1);
6649 if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6650 return DAG.getNode(X86ISD::HSUB, DL, VT, InVec0, InVec1);
6653 if (!Subtarget->hasAVX())
6656 if ((VT == MVT::v8f32 || VT == MVT::v4f64)) {
6657 // Try to match an AVX horizontal add/sub of packed single/double
6658 // precision floating point values from 256-bit vectors.
6659 SDValue InVec2, InVec3;
6660 if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, Half, InVec0, InVec1) &&
6661 isHorizontalBinOp(BV, ISD::FADD, DAG, Half, NumElts, InVec2, InVec3) &&
6662 ((InVec0.getOpcode() == ISD::UNDEF ||
6663 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6664 ((InVec1.getOpcode() == ISD::UNDEF ||
6665 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6666 return DAG.getNode(X86ISD::FHADD, DL, VT, InVec0, InVec1);
6668 if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, Half, InVec0, InVec1) &&
6669 isHorizontalBinOp(BV, ISD::FSUB, DAG, Half, NumElts, InVec2, InVec3) &&
6670 ((InVec0.getOpcode() == ISD::UNDEF ||
6671 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6672 ((InVec1.getOpcode() == ISD::UNDEF ||
6673 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6674 return DAG.getNode(X86ISD::FHSUB, DL, VT, InVec0, InVec1);
6675 } else if (VT == MVT::v8i32 || VT == MVT::v16i16) {
6676 // Try to match an AVX2 horizontal add/sub of signed integers.
6677 SDValue InVec2, InVec3;
6679 bool CanFold = true;
6681 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, Half, InVec0, InVec1) &&
6682 isHorizontalBinOp(BV, ISD::ADD, DAG, Half, NumElts, InVec2, InVec3) &&
6683 ((InVec0.getOpcode() == ISD::UNDEF ||
6684 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6685 ((InVec1.getOpcode() == ISD::UNDEF ||
6686 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6687 X86Opcode = X86ISD::HADD;
6688 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, Half, InVec0, InVec1) &&
6689 isHorizontalBinOp(BV, ISD::SUB, DAG, Half, NumElts, InVec2, InVec3) &&
6690 ((InVec0.getOpcode() == ISD::UNDEF ||
6691 InVec2.getOpcode() == ISD::UNDEF) || InVec0 == InVec2) &&
6692 ((InVec1.getOpcode() == ISD::UNDEF ||
6693 InVec3.getOpcode() == ISD::UNDEF) || InVec1 == InVec3))
6694 X86Opcode = X86ISD::HSUB;
6699 // Fold this build_vector into a single horizontal add/sub.
6700 // Do this only if the target has AVX2.
6701 if (Subtarget->hasAVX2())
6702 return DAG.getNode(X86Opcode, DL, VT, InVec0, InVec1);
6704 // Do not try to expand this build_vector into a pair of horizontal
6705 // add/sub if we can emit a pair of scalar add/sub.
6706 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6709 // Convert this build_vector into a pair of horizontal binop followed by
6711 bool isUndefLO = NumUndefsLO == Half;
6712 bool isUndefHI = NumUndefsHI == Half;
6713 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, false,
6714 isUndefLO, isUndefHI);
6718 if ((VT == MVT::v8f32 || VT == MVT::v4f64 || VT == MVT::v8i32 ||
6719 VT == MVT::v16i16) && Subtarget->hasAVX()) {
6721 if (isHorizontalBinOp(BV, ISD::ADD, DAG, 0, NumElts, InVec0, InVec1))
6722 X86Opcode = X86ISD::HADD;
6723 else if (isHorizontalBinOp(BV, ISD::SUB, DAG, 0, NumElts, InVec0, InVec1))
6724 X86Opcode = X86ISD::HSUB;
6725 else if (isHorizontalBinOp(BV, ISD::FADD, DAG, 0, NumElts, InVec0, InVec1))
6726 X86Opcode = X86ISD::FHADD;
6727 else if (isHorizontalBinOp(BV, ISD::FSUB, DAG, 0, NumElts, InVec0, InVec1))
6728 X86Opcode = X86ISD::FHSUB;
6732 // Don't try to expand this build_vector into a pair of horizontal add/sub
6733 // if we can simply emit a pair of scalar add/sub.
6734 if (NumUndefsLO + 1 == Half || NumUndefsHI + 1 == Half)
6737 // Convert this build_vector into two horizontal add/sub followed by
6739 bool isUndefLO = NumUndefsLO == Half;
6740 bool isUndefHI = NumUndefsHI == Half;
6741 return ExpandHorizontalBinOp(InVec0, InVec1, DL, DAG, X86Opcode, true,
6742 isUndefLO, isUndefHI);
6749 X86TargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG) const {
6752 MVT VT = Op.getSimpleValueType();
6753 MVT ExtVT = VT.getVectorElementType();
6754 unsigned NumElems = Op.getNumOperands();
6756 // Generate vectors for predicate vectors.
6757 if (VT.getScalarType() == MVT::i1 && Subtarget->hasAVX512())
6758 return LowerBUILD_VECTORvXi1(Op, DAG);
6760 // Vectors containing all zeros can be matched by pxor and xorps later
6761 if (ISD::isBuildVectorAllZeros(Op.getNode())) {
6762 // Canonicalize this to <4 x i32> to 1) ensure the zero vectors are CSE'd
6763 // and 2) ensure that i64 scalars are eliminated on x86-32 hosts.
6764 if (VT == MVT::v4i32 || VT == MVT::v8i32 || VT == MVT::v16i32)
6767 return getZeroVector(VT, Subtarget, DAG, dl);
6770 // Vectors containing all ones can be matched by pcmpeqd on 128-bit width
6771 // vectors or broken into v4i32 operations on 256-bit vectors. AVX2 can use
6772 // vpcmpeqd on 256-bit vectors.
6773 if (Subtarget->hasSSE2() && ISD::isBuildVectorAllOnes(Op.getNode())) {
6774 if (VT == MVT::v4i32 || (VT == MVT::v8i32 && Subtarget->hasInt256()))
6777 if (!VT.is512BitVector())
6778 return getOnesVector(VT, Subtarget->hasInt256(), DAG, dl);
6781 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
6782 if (Broadcast.getNode())
6785 unsigned EVTBits = ExtVT.getSizeInBits();
6787 unsigned NumZero = 0;
6788 unsigned NumNonZero = 0;
6789 unsigned NonZeros = 0;
6790 bool IsAllConstants = true;
6791 SmallSet<SDValue, 8> Values;
6792 for (unsigned i = 0; i < NumElems; ++i) {
6793 SDValue Elt = Op.getOperand(i);
6794 if (Elt.getOpcode() == ISD::UNDEF)
6797 if (Elt.getOpcode() != ISD::Constant &&
6798 Elt.getOpcode() != ISD::ConstantFP)
6799 IsAllConstants = false;
6800 if (X86::isZeroNode(Elt))
6803 NonZeros |= (1 << i);
6808 // All undef vector. Return an UNDEF. All zero vectors were handled above.
6809 if (NumNonZero == 0)
6810 return DAG.getUNDEF(VT);
6812 // Special case for single non-zero, non-undef, element.
6813 if (NumNonZero == 1) {
6814 unsigned Idx = countTrailingZeros(NonZeros);
6815 SDValue Item = Op.getOperand(Idx);
6817 // If this is an insertion of an i64 value on x86-32, and if the top bits of
6818 // the value are obviously zero, truncate the value to i32 and do the
6819 // insertion that way. Only do this if the value is non-constant or if the
6820 // value is a constant being inserted into element 0. It is cheaper to do
6821 // a constant pool load than it is to do a movd + shuffle.
6822 if (ExtVT == MVT::i64 && !Subtarget->is64Bit() &&
6823 (!IsAllConstants || Idx == 0)) {
6824 if (DAG.MaskedValueIsZero(Item, APInt::getBitsSet(64, 32, 64))) {
6826 assert(VT == MVT::v2i64 && "Expected an SSE value type!");
6827 EVT VecVT = MVT::v4i32;
6828 unsigned VecElts = 4;
6830 // Truncate the value (which may itself be a constant) to i32, and
6831 // convert it to a vector with movd (S2V+shuffle to zero extend).
6832 Item = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Item);
6833 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Item);
6835 // If using the new shuffle lowering, just directly insert this.
6836 if (ExperimentalVectorShuffleLowering)
6838 ISD::BITCAST, dl, VT,
6839 getShuffleVectorZeroOrUndef(Item, Idx * 2, true, Subtarget, DAG));
6841 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6843 // Now we have our 32-bit value zero extended in the low element of
6844 // a vector. If Idx != 0, swizzle it into place.
6846 SmallVector<int, 4> Mask;
6847 Mask.push_back(Idx);
6848 for (unsigned i = 1; i != VecElts; ++i)
6850 Item = DAG.getVectorShuffle(VecVT, dl, Item, DAG.getUNDEF(VecVT),
6853 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6857 // If we have a constant or non-constant insertion into the low element of
6858 // a vector, we can do this with SCALAR_TO_VECTOR + shuffle of zero into
6859 // the rest of the elements. This will be matched as movd/movq/movss/movsd
6860 // depending on what the source datatype is.
6863 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6865 if (ExtVT == MVT::i32 || ExtVT == MVT::f32 || ExtVT == MVT::f64 ||
6866 (ExtVT == MVT::i64 && Subtarget->is64Bit())) {
6867 if (VT.is256BitVector() || VT.is512BitVector()) {
6868 SDValue ZeroVec = getZeroVector(VT, Subtarget, DAG, dl);
6869 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, ZeroVec,
6870 Item, DAG.getIntPtrConstant(0));
6872 assert(VT.is128BitVector() && "Expected an SSE value type!");
6873 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6874 // Turn it into a MOVL (i.e. movss, movsd, or movd) to a zero vector.
6875 return getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6878 if (ExtVT == MVT::i16 || ExtVT == MVT::i8) {
6879 Item = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Item);
6880 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32, Item);
6881 if (VT.is256BitVector()) {
6882 SDValue ZeroVec = getZeroVector(MVT::v8i32, Subtarget, DAG, dl);
6883 Item = Insert128BitVector(ZeroVec, Item, 0, DAG, dl);
6885 assert(VT.is128BitVector() && "Expected an SSE value type!");
6886 Item = getShuffleVectorZeroOrUndef(Item, 0, true, Subtarget, DAG);
6888 return DAG.getNode(ISD::BITCAST, dl, VT, Item);
6892 // Is it a vector logical left shift?
6893 if (NumElems == 2 && Idx == 1 &&
6894 X86::isZeroNode(Op.getOperand(0)) &&
6895 !X86::isZeroNode(Op.getOperand(1))) {
6896 unsigned NumBits = VT.getSizeInBits();
6897 return getVShift(true, VT,
6898 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
6899 VT, Op.getOperand(1)),
6900 NumBits/2, DAG, *this, dl);
6903 if (IsAllConstants) // Otherwise, it's better to do a constpool load.
6906 // Otherwise, if this is a vector with i32 or f32 elements, and the element
6907 // is a non-constant being inserted into an element other than the low one,
6908 // we can't use a constant pool load. Instead, use SCALAR_TO_VECTOR (aka
6909 // movd/movss) to move this into the low element, then shuffle it into
6911 if (EVTBits == 32) {
6912 Item = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Item);
6914 // If using the new shuffle lowering, just directly insert this.
6915 if (ExperimentalVectorShuffleLowering)
6916 return getShuffleVectorZeroOrUndef(Item, Idx, NumZero > 0, Subtarget, DAG);
6918 // Turn it into a shuffle of zero and zero-extended scalar to vector.
6919 Item = getShuffleVectorZeroOrUndef(Item, 0, NumZero > 0, Subtarget, DAG);
6920 SmallVector<int, 8> MaskVec;
6921 for (unsigned i = 0; i != NumElems; ++i)
6922 MaskVec.push_back(i == Idx ? 0 : 1);
6923 return DAG.getVectorShuffle(VT, dl, Item, DAG.getUNDEF(VT), &MaskVec[0]);
6927 // Splat is obviously ok. Let legalizer expand it to a shuffle.
6928 if (Values.size() == 1) {
6929 if (EVTBits == 32) {
6930 // Instead of a shuffle like this:
6931 // shuffle (scalar_to_vector (load (ptr + 4))), undef, <0, 0, 0, 0>
6932 // Check if it's possible to issue this instead.
6933 // shuffle (vload ptr)), undef, <1, 1, 1, 1>
6934 unsigned Idx = countTrailingZeros(NonZeros);
6935 SDValue Item = Op.getOperand(Idx);
6936 if (Op.getNode()->isOnlyUserOf(Item.getNode()))
6937 return LowerAsSplatVectorLoad(Item, VT, dl, DAG);
6942 // A vector full of immediates; various special cases are already
6943 // handled, so this is best done with a single constant-pool load.
6947 // For AVX-length vectors, build the individual 128-bit pieces and use
6948 // shuffles to put them in place.
6949 if (VT.is256BitVector() || VT.is512BitVector()) {
6950 SmallVector<SDValue, 64> V;
6951 for (unsigned i = 0; i != NumElems; ++i)
6952 V.push_back(Op.getOperand(i));
6954 EVT HVT = EVT::getVectorVT(*DAG.getContext(), ExtVT, NumElems/2);
6956 // Build both the lower and upper subvector.
6957 SDValue Lower = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6958 makeArrayRef(&V[0], NumElems/2));
6959 SDValue Upper = DAG.getNode(ISD::BUILD_VECTOR, dl, HVT,
6960 makeArrayRef(&V[NumElems / 2], NumElems/2));
6962 // Recreate the wider vector with the lower and upper part.
6963 if (VT.is256BitVector())
6964 return Concat128BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6965 return Concat256BitVectors(Lower, Upper, VT, NumElems, DAG, dl);
6968 // Let legalizer expand 2-wide build_vectors.
6969 if (EVTBits == 64) {
6970 if (NumNonZero == 1) {
6971 // One half is zero or undef.
6972 unsigned Idx = countTrailingZeros(NonZeros);
6973 SDValue V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT,
6974 Op.getOperand(Idx));
6975 return getShuffleVectorZeroOrUndef(V2, Idx, true, Subtarget, DAG);
6980 // If element VT is < 32 bits, convert it to inserts into a zero vector.
6981 if (EVTBits == 8 && NumElems == 16) {
6982 SDValue V = LowerBuildVectorv16i8(Op, NonZeros,NumNonZero,NumZero, DAG,
6984 if (V.getNode()) return V;
6987 if (EVTBits == 16 && NumElems == 8) {
6988 SDValue V = LowerBuildVectorv8i16(Op, NonZeros,NumNonZero,NumZero, DAG,
6990 if (V.getNode()) return V;
6993 // If element VT is == 32 bits and has 4 elems, try to generate an INSERTPS
6994 if (EVTBits == 32 && NumElems == 4) {
6995 SDValue V = LowerBuildVectorv4x32(Op, NumElems, NonZeros, NumNonZero,
6996 NumZero, DAG, Subtarget, *this);
7001 // If element VT is == 32 bits, turn it into a number of shuffles.
7002 SmallVector<SDValue, 8> V(NumElems);
7003 if (NumElems == 4 && NumZero > 0) {
7004 for (unsigned i = 0; i < 4; ++i) {
7005 bool isZero = !(NonZeros & (1 << i));
7007 V[i] = getZeroVector(VT, Subtarget, DAG, dl);
7009 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7012 for (unsigned i = 0; i < 2; ++i) {
7013 switch ((NonZeros & (0x3 << i*2)) >> (i*2)) {
7016 V[i] = V[i*2]; // Must be a zero vector.
7019 V[i] = getMOVL(DAG, dl, VT, V[i*2+1], V[i*2]);
7022 V[i] = getMOVL(DAG, dl, VT, V[i*2], V[i*2+1]);
7025 V[i] = getUnpackl(DAG, dl, VT, V[i*2], V[i*2+1]);
7030 bool Reverse1 = (NonZeros & 0x3) == 2;
7031 bool Reverse2 = ((NonZeros & (0x3 << 2)) >> 2) == 2;
7035 static_cast<int>(Reverse2 ? NumElems+1 : NumElems),
7036 static_cast<int>(Reverse2 ? NumElems : NumElems+1)
7038 return DAG.getVectorShuffle(VT, dl, V[0], V[1], &MaskVec[0]);
7041 if (Values.size() > 1 && VT.is128BitVector()) {
7042 // Check for a build vector of consecutive loads.
7043 for (unsigned i = 0; i < NumElems; ++i)
7044 V[i] = Op.getOperand(i);
7046 // Check for elements which are consecutive loads.
7047 SDValue LD = EltsFromConsecutiveLoads(VT, V, dl, DAG, false);
7051 // Check for a build vector from mostly shuffle plus few inserting.
7052 SDValue Sh = buildFromShuffleMostly(Op, DAG);
7056 // For SSE 4.1, use insertps to put the high elements into the low element.
7057 if (getSubtarget()->hasSSE41()) {
7059 if (Op.getOperand(0).getOpcode() != ISD::UNDEF)
7060 Result = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(0));
7062 Result = DAG.getUNDEF(VT);
7064 for (unsigned i = 1; i < NumElems; ++i) {
7065 if (Op.getOperand(i).getOpcode() == ISD::UNDEF) continue;
7066 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, Result,
7067 Op.getOperand(i), DAG.getIntPtrConstant(i));
7072 // Otherwise, expand into a number of unpckl*, start by extending each of
7073 // our (non-undef) elements to the full vector width with the element in the
7074 // bottom slot of the vector (which generates no code for SSE).
7075 for (unsigned i = 0; i < NumElems; ++i) {
7076 if (Op.getOperand(i).getOpcode() != ISD::UNDEF)
7077 V[i] = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Op.getOperand(i));
7079 V[i] = DAG.getUNDEF(VT);
7082 // Next, we iteratively mix elements, e.g. for v4f32:
7083 // Step 1: unpcklps 0, 2 ==> X: <?, ?, 2, 0>
7084 // : unpcklps 1, 3 ==> Y: <?, ?, 3, 1>
7085 // Step 2: unpcklps X, Y ==> <3, 2, 1, 0>
7086 unsigned EltStride = NumElems >> 1;
7087 while (EltStride != 0) {
7088 for (unsigned i = 0; i < EltStride; ++i) {
7089 // If V[i+EltStride] is undef and this is the first round of mixing,
7090 // then it is safe to just drop this shuffle: V[i] is already in the
7091 // right place, the one element (since it's the first round) being
7092 // inserted as undef can be dropped. This isn't safe for successive
7093 // rounds because they will permute elements within both vectors.
7094 if (V[i+EltStride].getOpcode() == ISD::UNDEF &&
7095 EltStride == NumElems/2)
7098 V[i] = getUnpackl(DAG, dl, VT, V[i], V[i + EltStride]);
7107 // LowerAVXCONCAT_VECTORS - 256-bit AVX can use the vinsertf128 instruction
7108 // to create 256-bit vectors from two other 128-bit ones.
7109 static SDValue LowerAVXCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7111 MVT ResVT = Op.getSimpleValueType();
7113 assert((ResVT.is256BitVector() ||
7114 ResVT.is512BitVector()) && "Value type must be 256-/512-bit wide");
7116 SDValue V1 = Op.getOperand(0);
7117 SDValue V2 = Op.getOperand(1);
7118 unsigned NumElems = ResVT.getVectorNumElements();
7119 if(ResVT.is256BitVector())
7120 return Concat128BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7122 if (Op.getNumOperands() == 4) {
7123 MVT HalfVT = MVT::getVectorVT(ResVT.getScalarType(),
7124 ResVT.getVectorNumElements()/2);
7125 SDValue V3 = Op.getOperand(2);
7126 SDValue V4 = Op.getOperand(3);
7127 return Concat256BitVectors(Concat128BitVectors(V1, V2, HalfVT, NumElems/2, DAG, dl),
7128 Concat128BitVectors(V3, V4, HalfVT, NumElems/2, DAG, dl), ResVT, NumElems, DAG, dl);
7130 return Concat256BitVectors(V1, V2, ResVT, NumElems, DAG, dl);
7133 static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
7134 MVT LLVM_ATTRIBUTE_UNUSED VT = Op.getSimpleValueType();
7135 assert((VT.is256BitVector() && Op.getNumOperands() == 2) ||
7136 (VT.is512BitVector() && (Op.getNumOperands() == 2 ||
7137 Op.getNumOperands() == 4)));
7139 // AVX can use the vinsertf128 instruction to create 256-bit vectors
7140 // from two other 128-bit ones.
7142 // 512-bit vector may contain 2 256-bit vectors or 4 128-bit vectors
7143 return LowerAVXCONCAT_VECTORS(Op, DAG);
7147 //===----------------------------------------------------------------------===//
7148 // Vector shuffle lowering
7150 // This is an experimental code path for lowering vector shuffles on x86. It is
7151 // designed to handle arbitrary vector shuffles and blends, gracefully
7152 // degrading performance as necessary. It works hard to recognize idiomatic
7153 // shuffles and lower them to optimal instruction patterns without leaving
7154 // a framework that allows reasonably efficient handling of all vector shuffle
7156 //===----------------------------------------------------------------------===//
7158 /// \brief Tiny helper function to identify a no-op mask.
7160 /// This is a somewhat boring predicate function. It checks whether the mask
7161 /// array input, which is assumed to be a single-input shuffle mask of the kind
7162 /// used by the X86 shuffle instructions (not a fully general
7163 /// ShuffleVectorSDNode mask) requires any shuffles to occur. Both undef and an
7164 /// in-place shuffle are 'no-op's.
7165 static bool isNoopShuffleMask(ArrayRef<int> Mask) {
7166 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7167 if (Mask[i] != -1 && Mask[i] != i)
7172 /// \brief Helper function to classify a mask as a single-input mask.
7174 /// This isn't a generic single-input test because in the vector shuffle
7175 /// lowering we canonicalize single inputs to be the first input operand. This
7176 /// means we can more quickly test for a single input by only checking whether
7177 /// an input from the second operand exists. We also assume that the size of
7178 /// mask corresponds to the size of the input vectors which isn't true in the
7179 /// fully general case.
7180 static bool isSingleInputShuffleMask(ArrayRef<int> Mask) {
7182 if (M >= (int)Mask.size())
7187 /// \brief Test whether there are elements crossing 128-bit lanes in this
7190 /// X86 divides up its shuffles into in-lane and cross-lane shuffle operations
7191 /// and we routinely test for these.
7192 static bool is128BitLaneCrossingShuffleMask(MVT VT, ArrayRef<int> Mask) {
7193 int LaneSize = 128 / VT.getScalarSizeInBits();
7194 int Size = Mask.size();
7195 for (int i = 0; i < Size; ++i)
7196 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
7201 /// \brief Test whether a shuffle mask is equivalent within each 128-bit lane.
7203 /// This checks a shuffle mask to see if it is performing the same
7204 /// 128-bit lane-relative shuffle in each 128-bit lane. This trivially implies
7205 /// that it is also not lane-crossing. It may however involve a blend from the
7206 /// same lane of a second vector.
7208 /// The specific repeated shuffle mask is populated in \p RepeatedMask, as it is
7209 /// non-trivial to compute in the face of undef lanes. The representation is
7210 /// *not* suitable for use with existing 128-bit shuffles as it will contain
7211 /// entries from both V1 and V2 inputs to the wider mask.
7213 is128BitLaneRepeatedShuffleMask(MVT VT, ArrayRef<int> Mask,
7214 SmallVectorImpl<int> &RepeatedMask) {
7215 int LaneSize = 128 / VT.getScalarSizeInBits();
7216 RepeatedMask.resize(LaneSize, -1);
7217 int Size = Mask.size();
7218 for (int i = 0; i < Size; ++i) {
7221 if ((Mask[i] % Size) / LaneSize != i / LaneSize)
7222 // This entry crosses lanes, so there is no way to model this shuffle.
7225 // Ok, handle the in-lane shuffles by detecting if and when they repeat.
7226 if (RepeatedMask[i % LaneSize] == -1)
7227 // This is the first non-undef entry in this slot of a 128-bit lane.
7228 RepeatedMask[i % LaneSize] =
7229 Mask[i] < Size ? Mask[i] % LaneSize : Mask[i] % LaneSize + Size;
7230 else if (RepeatedMask[i % LaneSize] + (i / LaneSize) * LaneSize != Mask[i])
7231 // Found a mismatch with the repeated mask.
7237 // Hide this symbol with an anonymous namespace instead of 'static' so that MSVC
7238 // 2013 will allow us to use it as a non-type template parameter.
7241 /// \brief Implementation of the \c isShuffleEquivalent variadic functor.
7243 /// See its documentation for details.
7244 bool isShuffleEquivalentImpl(ArrayRef<int> Mask, ArrayRef<const int *> Args) {
7245 if (Mask.size() != Args.size())
7247 for (int i = 0, e = Mask.size(); i < e; ++i) {
7248 assert(*Args[i] >= 0 && "Arguments must be positive integers!");
7249 if (Mask[i] != -1 && Mask[i] != *Args[i])
7257 /// \brief Checks whether a shuffle mask is equivalent to an explicit list of
7260 /// This is a fast way to test a shuffle mask against a fixed pattern:
7262 /// if (isShuffleEquivalent(Mask, 3, 2, 1, 0)) { ... }
7264 /// It returns true if the mask is exactly as wide as the argument list, and
7265 /// each element of the mask is either -1 (signifying undef) or the value given
7266 /// in the argument.
7267 static const VariadicFunction1<
7268 bool, ArrayRef<int>, int, isShuffleEquivalentImpl> isShuffleEquivalent = {};
7270 /// \brief Get a 4-lane 8-bit shuffle immediate for a mask.
7272 /// This helper function produces an 8-bit shuffle immediate corresponding to
7273 /// the ubiquitous shuffle encoding scheme used in x86 instructions for
7274 /// shuffling 4 lanes. It can be used with most of the PSHUF instructions for
7277 /// NB: We rely heavily on "undef" masks preserving the input lane.
7278 static SDValue getV4X86ShuffleImm8ForMask(ArrayRef<int> Mask,
7279 SelectionDAG &DAG) {
7280 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
7281 assert(Mask[0] >= -1 && Mask[0] < 4 && "Out of bound mask element!");
7282 assert(Mask[1] >= -1 && Mask[1] < 4 && "Out of bound mask element!");
7283 assert(Mask[2] >= -1 && Mask[2] < 4 && "Out of bound mask element!");
7284 assert(Mask[3] >= -1 && Mask[3] < 4 && "Out of bound mask element!");
7287 Imm |= (Mask[0] == -1 ? 0 : Mask[0]) << 0;
7288 Imm |= (Mask[1] == -1 ? 1 : Mask[1]) << 2;
7289 Imm |= (Mask[2] == -1 ? 2 : Mask[2]) << 4;
7290 Imm |= (Mask[3] == -1 ? 3 : Mask[3]) << 6;
7291 return DAG.getConstant(Imm, MVT::i8);
7294 /// \brief Try to emit a blend instruction for a shuffle.
7296 /// This doesn't do any checks for the availability of instructions for blending
7297 /// these values. It relies on the availability of the X86ISD::BLENDI pattern to
7298 /// be matched in the backend with the type given. What it does check for is
7299 /// that the shuffle mask is in fact a blend.
7300 static SDValue lowerVectorShuffleAsBlend(SDLoc DL, MVT VT, SDValue V1,
7301 SDValue V2, ArrayRef<int> Mask,
7302 const X86Subtarget *Subtarget,
7303 SelectionDAG &DAG) {
7305 unsigned BlendMask = 0;
7306 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7307 if (Mask[i] >= Size) {
7308 if (Mask[i] != i + Size)
7309 return SDValue(); // Shuffled V2 input!
7310 BlendMask |= 1u << i;
7313 if (Mask[i] >= 0 && Mask[i] != i)
7314 return SDValue(); // Shuffled V1 input!
7316 switch (VT.SimpleTy) {
7321 return DAG.getNode(X86ISD::BLENDI, DL, VT, V1, V2,
7322 DAG.getConstant(BlendMask, MVT::i8));
7326 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7330 // If we have AVX2 it is faster to use VPBLENDD when the shuffle fits into
7331 // that instruction.
7332 if (Subtarget->hasAVX2()) {
7333 // Scale the blend by the number of 32-bit dwords per element.
7334 int Scale = VT.getScalarSizeInBits() / 32;
7336 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7337 if (Mask[i] >= Size)
7338 for (int j = 0; j < Scale; ++j)
7339 BlendMask |= 1u << (i * Scale + j);
7341 MVT BlendVT = VT.getSizeInBits() > 128 ? MVT::v8i32 : MVT::v4i32;
7342 V1 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V1);
7343 V2 = DAG.getNode(ISD::BITCAST, DL, BlendVT, V2);
7344 return DAG.getNode(ISD::BITCAST, DL, VT,
7345 DAG.getNode(X86ISD::BLENDI, DL, BlendVT, V1, V2,
7346 DAG.getConstant(BlendMask, MVT::i8)));
7350 // For integer shuffles we need to expand the mask and cast the inputs to
7351 // v8i16s prior to blending.
7352 int Scale = 8 / VT.getVectorNumElements();
7354 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7355 if (Mask[i] >= Size)
7356 for (int j = 0; j < Scale; ++j)
7357 BlendMask |= 1u << (i * Scale + j);
7359 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
7360 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
7361 return DAG.getNode(ISD::BITCAST, DL, VT,
7362 DAG.getNode(X86ISD::BLENDI, DL, MVT::v8i16, V1, V2,
7363 DAG.getConstant(BlendMask, MVT::i8)));
7367 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7368 SmallVector<int, 8> RepeatedMask;
7369 if (is128BitLaneRepeatedShuffleMask(MVT::v16i16, Mask, RepeatedMask)) {
7370 // We can lower these with PBLENDW which is mirrored across 128-bit lanes.
7371 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
7373 for (int i = 0; i < 8; ++i)
7374 if (RepeatedMask[i] >= 16)
7375 BlendMask |= 1u << i;
7376 return DAG.getNode(X86ISD::BLENDI, DL, MVT::v16i16, V1, V2,
7377 DAG.getConstant(BlendMask, MVT::i8));
7382 assert(Subtarget->hasAVX2() && "256-bit integer blends require AVX2!");
7383 // Scale the blend by the number of bytes per element.
7384 int Scale = VT.getScalarSizeInBits() / 8;
7385 assert(Mask.size() * Scale == 32 && "Not a 256-bit vector!");
7387 // Compute the VSELECT mask. Note that VSELECT is really confusing in the
7388 // mix of LLVM's code generator and the x86 backend. We tell the code
7389 // generator that boolean values in the elements of an x86 vector register
7390 // are -1 for true and 0 for false. We then use the LLVM semantics of 'true'
7391 // mapping a select to operand #1, and 'false' mapping to operand #2. The
7392 // reality in x86 is that vector masks (pre-AVX-512) use only the high bit
7393 // of the element (the remaining are ignored) and 0 in that high bit would
7394 // mean operand #1 while 1 in the high bit would mean operand #2. So while
7395 // the LLVM model for boolean values in vector elements gets the relevant
7396 // bit set, it is set backwards and over constrained relative to x86's
7398 SDValue VSELECTMask[32];
7399 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7400 for (int j = 0; j < Scale; ++j)
7401 VSELECTMask[Scale * i + j] =
7402 Mask[i] < 0 ? DAG.getUNDEF(MVT::i8)
7403 : DAG.getConstant(Mask[i] < Size ? -1 : 0, MVT::i8);
7405 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1);
7406 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V2);
7408 ISD::BITCAST, DL, VT,
7409 DAG.getNode(ISD::VSELECT, DL, MVT::v32i8,
7410 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, VSELECTMask),
7415 llvm_unreachable("Not a supported integer vector type!");
7419 /// \brief Generic routine to lower a shuffle and blend as a decomposed set of
7420 /// unblended shuffles followed by an unshuffled blend.
7422 /// This matches the extremely common pattern for handling combined
7423 /// shuffle+blend operations on newer X86 ISAs where we have very fast blend
7425 static SDValue lowerVectorShuffleAsDecomposedShuffleBlend(SDLoc DL, MVT VT,
7429 SelectionDAG &DAG) {
7430 // Shuffle the input elements into the desired positions in V1 and V2 and
7431 // blend them together.
7432 SmallVector<int, 32> V1Mask(Mask.size(), -1);
7433 SmallVector<int, 32> V2Mask(Mask.size(), -1);
7434 SmallVector<int, 32> BlendMask(Mask.size(), -1);
7435 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7436 if (Mask[i] >= 0 && Mask[i] < Size) {
7437 V1Mask[i] = Mask[i];
7439 } else if (Mask[i] >= Size) {
7440 V2Mask[i] = Mask[i] - Size;
7441 BlendMask[i] = i + Size;
7444 V1 = DAG.getVectorShuffle(VT, DL, V1, DAG.getUNDEF(VT), V1Mask);
7445 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Mask);
7446 return DAG.getVectorShuffle(VT, DL, V1, V2, BlendMask);
7449 /// \brief Try to lower a vector shuffle as a byte rotation.
7451 /// We have a generic PALIGNR instruction in x86 that will do an arbitrary
7452 /// byte-rotation of a the concatentation of two vectors. This routine will
7453 /// try to generically lower a vector shuffle through such an instruction. It
7454 /// does not check for the availability of PALIGNR-based lowerings, only the
7455 /// applicability of this strategy to the given mask. This matches shuffle
7456 /// vectors that look like:
7458 /// v8i16 [11, 12, 13, 14, 15, 0, 1, 2]
7460 /// Essentially it concatenates V1 and V2, shifts right by some number of
7461 /// elements, and takes the low elements as the result. Note that while this is
7462 /// specified as a *right shift* because x86 is little-endian, it is a *left
7463 /// rotate* of the vector lanes.
7465 /// Note that this only handles 128-bit vector widths currently.
7466 static SDValue lowerVectorShuffleAsByteRotate(SDLoc DL, MVT VT, SDValue V1,
7469 SelectionDAG &DAG) {
7470 assert(!isNoopShuffleMask(Mask) && "We shouldn't lower no-op shuffles!");
7472 // We need to detect various ways of spelling a rotation:
7473 // [11, 12, 13, 14, 15, 0, 1, 2]
7474 // [-1, 12, 13, 14, -1, -1, 1, -1]
7475 // [-1, -1, -1, -1, -1, -1, 1, 2]
7476 // [ 3, 4, 5, 6, 7, 8, 9, 10]
7477 // [-1, 4, 5, 6, -1, -1, 9, -1]
7478 // [-1, 4, 5, 6, -1, -1, -1, -1]
7481 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7484 assert(Mask[i] >= 0 && "Only -1 is a valid negative mask element!");
7486 // Based on the mod-Size value of this mask element determine where
7487 // a rotated vector would have started.
7488 int StartIdx = i - (Mask[i] % Size);
7490 // The identity rotation isn't interesting, stop.
7493 // If we found the tail of a vector the rotation must be the missing
7494 // front. If we found the head of a vector, it must be how much of the head.
7495 int CandidateRotation = StartIdx < 0 ? -StartIdx : Size - StartIdx;
7498 Rotation = CandidateRotation;
7499 else if (Rotation != CandidateRotation)
7500 // The rotations don't match, so we can't match this mask.
7503 // Compute which value this mask is pointing at.
7504 SDValue MaskV = Mask[i] < Size ? V1 : V2;
7506 // Compute which of the two target values this index should be assigned to.
7507 // This reflects whether the high elements are remaining or the low elements
7509 SDValue &TargetV = StartIdx < 0 ? Hi : Lo;
7511 // Either set up this value if we've not encountered it before, or check
7512 // that it remains consistent.
7515 else if (TargetV != MaskV)
7516 // This may be a rotation, but it pulls from the inputs in some
7517 // unsupported interleaving.
7521 // Check that we successfully analyzed the mask, and normalize the results.
7522 assert(Rotation != 0 && "Failed to locate a viable rotation!");
7523 assert((Lo || Hi) && "Failed to find a rotated input vector!");
7529 // Cast the inputs to v16i8 to match PALIGNR.
7530 Lo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Lo);
7531 Hi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Hi);
7533 assert(VT.getSizeInBits() == 128 &&
7534 "Rotate-based lowering only supports 128-bit lowering!");
7535 assert(Mask.size() <= 16 &&
7536 "Can shuffle at most 16 bytes in a 128-bit vector!");
7537 // The actual rotate instruction rotates bytes, so we need to scale the
7538 // rotation based on how many bytes are in the vector.
7539 int Scale = 16 / Mask.size();
7541 return DAG.getNode(ISD::BITCAST, DL, VT,
7542 DAG.getNode(X86ISD::PALIGNR, DL, MVT::v16i8, Hi, Lo,
7543 DAG.getConstant(Rotation * Scale, MVT::i8)));
7546 /// \brief Compute whether each element of a shuffle is zeroable.
7548 /// A "zeroable" vector shuffle element is one which can be lowered to zero.
7549 /// Either it is an undef element in the shuffle mask, the element of the input
7550 /// referenced is undef, or the element of the input referenced is known to be
7551 /// zero. Many x86 shuffles can zero lanes cheaply and we often want to handle
7552 /// as many lanes with this technique as possible to simplify the remaining
7554 static SmallBitVector computeZeroableShuffleElements(ArrayRef<int> Mask,
7555 SDValue V1, SDValue V2) {
7556 SmallBitVector Zeroable(Mask.size(), false);
7558 bool V1IsZero = ISD::isBuildVectorAllZeros(V1.getNode());
7559 bool V2IsZero = ISD::isBuildVectorAllZeros(V2.getNode());
7561 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
7563 // Handle the easy cases.
7564 if (M < 0 || (M >= 0 && M < Size && V1IsZero) || (M >= Size && V2IsZero)) {
7569 // If this is an index into a build_vector node, dig out the input value and
7571 SDValue V = M < Size ? V1 : V2;
7572 if (V.getOpcode() != ISD::BUILD_VECTOR)
7575 SDValue Input = V.getOperand(M % Size);
7576 // The UNDEF opcode check really should be dead code here, but not quite
7577 // worth asserting on (it isn't invalid, just unexpected).
7578 if (Input.getOpcode() == ISD::UNDEF || X86::isZeroNode(Input))
7585 /// \brief Lower a vector shuffle as a zero or any extension.
7587 /// Given a specific number of elements, element bit width, and extension
7588 /// stride, produce either a zero or any extension based on the available
7589 /// features of the subtarget.
7590 static SDValue lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7591 SDLoc DL, MVT VT, int NumElements, int Scale, bool AnyExt, SDValue InputV,
7592 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7593 assert(Scale > 1 && "Need a scale to extend.");
7594 int EltBits = VT.getSizeInBits() / NumElements;
7595 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
7596 "Only 8, 16, and 32 bit elements can be extended.");
7597 assert(Scale * EltBits <= 64 && "Cannot zero extend past 64 bits.");
7599 // Found a valid zext mask! Try various lowering strategies based on the
7600 // input type and available ISA extensions.
7601 if (Subtarget->hasSSE41()) {
7602 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7603 MVT ExtVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits * Scale),
7604 NumElements / Scale);
7605 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7606 return DAG.getNode(ISD::BITCAST, DL, VT,
7607 DAG.getNode(X86ISD::VZEXT, DL, ExtVT, InputV));
7610 // For any extends we can cheat for larger element sizes and use shuffle
7611 // instructions that can fold with a load and/or copy.
7612 if (AnyExt && EltBits == 32) {
7613 int PSHUFDMask[4] = {0, -1, 1, -1};
7615 ISD::BITCAST, DL, VT,
7616 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7617 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7618 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
7620 if (AnyExt && EltBits == 16 && Scale > 2) {
7621 int PSHUFDMask[4] = {0, -1, 0, -1};
7622 InputV = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
7623 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, InputV),
7624 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG));
7625 int PSHUFHWMask[4] = {1, -1, -1, -1};
7627 ISD::BITCAST, DL, VT,
7628 DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16,
7629 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, InputV),
7630 getV4X86ShuffleImm8ForMask(PSHUFHWMask, DAG)));
7633 // If this would require more than 2 unpack instructions to expand, use
7634 // pshufb when available. We can only use more than 2 unpack instructions
7635 // when zero extending i8 elements which also makes it easier to use pshufb.
7636 if (Scale > 4 && EltBits == 8 && Subtarget->hasSSSE3()) {
7637 assert(NumElements == 16 && "Unexpected byte vector width!");
7638 SDValue PSHUFBMask[16];
7639 for (int i = 0; i < 16; ++i)
7641 DAG.getConstant((i % Scale == 0) ? i / Scale : 0x80, MVT::i8);
7642 InputV = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, InputV);
7643 return DAG.getNode(ISD::BITCAST, DL, VT,
7644 DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, InputV,
7645 DAG.getNode(ISD::BUILD_VECTOR, DL,
7646 MVT::v16i8, PSHUFBMask)));
7649 // Otherwise emit a sequence of unpacks.
7651 MVT InputVT = MVT::getVectorVT(MVT::getIntegerVT(EltBits), NumElements);
7652 SDValue Ext = AnyExt ? DAG.getUNDEF(InputVT)
7653 : getZeroVector(InputVT, Subtarget, DAG, DL);
7654 InputV = DAG.getNode(ISD::BITCAST, DL, InputVT, InputV);
7655 InputV = DAG.getNode(X86ISD::UNPCKL, DL, InputVT, InputV, Ext);
7659 } while (Scale > 1);
7660 return DAG.getNode(ISD::BITCAST, DL, VT, InputV);
7663 /// \brief Try to lower a vector shuffle as a zero extension on any micrarch.
7665 /// This routine will try to do everything in its power to cleverly lower
7666 /// a shuffle which happens to match the pattern of a zero extend. It doesn't
7667 /// check for the profitability of this lowering, it tries to aggressively
7668 /// match this pattern. It will use all of the micro-architectural details it
7669 /// can to emit an efficient lowering. It handles both blends with all-zero
7670 /// inputs to explicitly zero-extend and undef-lanes (sometimes undef due to
7671 /// masking out later).
7673 /// The reason we have dedicated lowering for zext-style shuffles is that they
7674 /// are both incredibly common and often quite performance sensitive.
7675 static SDValue lowerVectorShuffleAsZeroOrAnyExtend(
7676 SDLoc DL, MVT VT, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7677 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7678 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7680 int Bits = VT.getSizeInBits();
7681 int NumElements = Mask.size();
7683 // Define a helper function to check a particular ext-scale and lower to it if
7685 auto Lower = [&](int Scale) -> SDValue {
7688 for (int i = 0; i < NumElements; ++i) {
7690 continue; // Valid anywhere but doesn't tell us anything.
7691 if (i % Scale != 0) {
7692 // Each of the extend elements needs to be zeroable.
7696 // We no lorger are in the anyext case.
7701 // Each of the base elements needs to be consecutive indices into the
7702 // same input vector.
7703 SDValue V = Mask[i] < NumElements ? V1 : V2;
7706 else if (InputV != V)
7707 return SDValue(); // Flip-flopping inputs.
7709 if (Mask[i] % NumElements != i / Scale)
7710 return SDValue(); // Non-consecutive strided elemenst.
7713 // If we fail to find an input, we have a zero-shuffle which should always
7714 // have already been handled.
7715 // FIXME: Maybe handle this here in case during blending we end up with one?
7719 return lowerVectorShuffleAsSpecificZeroOrAnyExtend(
7720 DL, VT, NumElements, Scale, AnyExt, InputV, Subtarget, DAG);
7723 // The widest scale possible for extending is to a 64-bit integer.
7724 assert(Bits % 64 == 0 &&
7725 "The number of bits in a vector must be divisible by 64 on x86!");
7726 int NumExtElements = Bits / 64;
7728 // Each iteration, try extending the elements half as much, but into twice as
7730 for (; NumExtElements < NumElements; NumExtElements *= 2) {
7731 assert(NumElements % NumExtElements == 0 &&
7732 "The input vector size must be divisble by the extended size.");
7733 if (SDValue V = Lower(NumElements / NumExtElements))
7737 // No viable ext lowering found.
7741 /// \brief Try to get a scalar value for a specific element of a vector.
7743 /// Looks through BUILD_VECTOR and SCALAR_TO_VECTOR nodes to find a scalar.
7744 static SDValue getScalarValueForVectorElement(SDValue V, int Idx,
7745 SelectionDAG &DAG) {
7746 MVT VT = V.getSimpleValueType();
7747 MVT EltVT = VT.getVectorElementType();
7748 while (V.getOpcode() == ISD::BITCAST)
7749 V = V.getOperand(0);
7750 // If the bitcasts shift the element size, we can't extract an equivalent
7752 MVT NewVT = V.getSimpleValueType();
7753 if (!NewVT.isVector() || NewVT.getScalarSizeInBits() != VT.getScalarSizeInBits())
7756 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7757 (Idx == 0 && V.getOpcode() == ISD::SCALAR_TO_VECTOR))
7758 return DAG.getNode(ISD::BITCAST, SDLoc(V), EltVT, V.getOperand(Idx));
7763 /// \brief Helper to test for a load that can be folded with x86 shuffles.
7765 /// This is particularly important because the set of instructions varies
7766 /// significantly based on whether the operand is a load or not.
7767 static bool isShuffleFoldableLoad(SDValue V) {
7768 while (V.getOpcode() == ISD::BITCAST)
7769 V = V.getOperand(0);
7771 return ISD::isNON_EXTLoad(V.getNode());
7774 /// \brief Try to lower insertion of a single element into a zero vector.
7776 /// This is a common pattern that we have especially efficient patterns to lower
7777 /// across all subtarget feature sets.
7778 static SDValue lowerVectorShuffleAsElementInsertion(
7779 MVT VT, SDLoc DL, SDValue V1, SDValue V2, ArrayRef<int> Mask,
7780 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
7781 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
7783 MVT EltVT = VT.getVectorElementType();
7785 int V2Index = std::find_if(Mask.begin(), Mask.end(),
7786 [&Mask](int M) { return M >= (int)Mask.size(); }) -
7788 bool IsV1Zeroable = true;
7789 for (int i = 0, Size = Mask.size(); i < Size; ++i)
7790 if (i != V2Index && !Zeroable[i]) {
7791 IsV1Zeroable = false;
7795 // Check for a single input from a SCALAR_TO_VECTOR node.
7796 // FIXME: All of this should be canonicalized into INSERT_VECTOR_ELT and
7797 // all the smarts here sunk into that routine. However, the current
7798 // lowering of BUILD_VECTOR makes that nearly impossible until the old
7799 // vector shuffle lowering is dead.
7800 if (SDValue V2S = getScalarValueForVectorElement(
7801 V2, Mask[V2Index] - Mask.size(), DAG)) {
7802 // We need to zext the scalar if it is smaller than an i32.
7803 V2S = DAG.getNode(ISD::BITCAST, DL, EltVT, V2S);
7804 if (EltVT == MVT::i8 || EltVT == MVT::i16) {
7805 // Using zext to expand a narrow element won't work for non-zero
7810 // Zero-extend directly to i32.
7812 V2S = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, V2S);
7814 V2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, ExtVT, V2S);
7815 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
7816 EltVT == MVT::i16) {
7817 // Either not inserting from the low element of the input or the input
7818 // element size is too small to use VZEXT_MOVL to clear the high bits.
7822 if (!IsV1Zeroable) {
7823 // If V1 can't be treated as a zero vector we have fewer options to lower
7824 // this. We can't support integer vectors or non-zero targets cheaply, and
7825 // the V1 elements can't be permuted in any way.
7826 assert(VT == ExtVT && "Cannot change extended type when non-zeroable!");
7827 if (!VT.isFloatingPoint() || V2Index != 0)
7829 SmallVector<int, 8> V1Mask(Mask.begin(), Mask.end());
7830 V1Mask[V2Index] = -1;
7831 if (!isNoopShuffleMask(V1Mask))
7834 // Otherwise, use MOVSD or MOVSS.
7835 assert((EltVT == MVT::f32 || EltVT == MVT::f64) &&
7836 "Only two types of floating point element types to handle!");
7837 return DAG.getNode(EltVT == MVT::f32 ? X86ISD::MOVSS : X86ISD::MOVSD, DL,
7841 V2 = DAG.getNode(X86ISD::VZEXT_MOVL, DL, ExtVT, V2);
7843 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7846 // If we have 4 or fewer lanes we can cheaply shuffle the element into
7847 // the desired position. Otherwise it is more efficient to do a vector
7848 // shift left. We know that we can do a vector shift left because all
7849 // the inputs are zero.
7850 if (VT.isFloatingPoint() || VT.getVectorNumElements() <= 4) {
7851 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
7852 V2Shuffle[V2Index] = 0;
7853 V2 = DAG.getVectorShuffle(VT, DL, V2, DAG.getUNDEF(VT), V2Shuffle);
7855 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, V2);
7857 X86ISD::VSHLDQ, DL, MVT::v2i64, V2,
7859 V2Index * EltVT.getSizeInBits(),
7860 DAG.getTargetLoweringInfo().getScalarShiftAmountTy(MVT::v2i64)));
7861 V2 = DAG.getNode(ISD::BITCAST, DL, VT, V2);
7867 /// \brief Try to lower broadcast of a single element.
7869 /// For convenience, this code also bundles all of the subtarget feature set
7870 /// filtering. While a little annoying to re-dispatch on type here, there isn't
7871 /// a convenient way to factor it out.
7872 static SDValue lowerVectorShuffleAsBroadcast(MVT VT, SDLoc DL, SDValue V,
7874 const X86Subtarget *Subtarget,
7875 SelectionDAG &DAG) {
7876 if (!Subtarget->hasAVX())
7878 if (VT.isInteger() && !Subtarget->hasAVX2())
7881 // Check that the mask is a broadcast.
7882 int BroadcastIdx = -1;
7884 if (M >= 0 && BroadcastIdx == -1)
7886 else if (M >= 0 && M != BroadcastIdx)
7889 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
7890 "a sorted mask where the broadcast "
7893 // Check if this is a broadcast of a scalar. We special case lowering for
7894 // scalars so that we can more effectively fold with loads.
7895 if (V.getOpcode() == ISD::BUILD_VECTOR ||
7896 (V.getOpcode() == ISD::SCALAR_TO_VECTOR && BroadcastIdx == 0)) {
7897 V = V.getOperand(BroadcastIdx);
7899 // If the scalar isn't a load we can't broadcast from it in AVX1, only with
7901 if (!Subtarget->hasAVX2() && !isShuffleFoldableLoad(V))
7903 } else if (BroadcastIdx != 0 || !Subtarget->hasAVX2()) {
7904 // We can't broadcast from a vector register w/o AVX2, and we can only
7905 // broadcast from the zero-element of a vector register.
7909 return DAG.getNode(X86ISD::VBROADCAST, DL, VT, V);
7912 /// \brief Handle lowering of 2-lane 64-bit floating point shuffles.
7914 /// This is the basis function for the 2-lane 64-bit shuffles as we have full
7915 /// support for floating point shuffles but not integer shuffles. These
7916 /// instructions will incur a domain crossing penalty on some chips though so
7917 /// it is better to avoid lowering through this for integer vectors where
7919 static SDValue lowerV2F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7920 const X86Subtarget *Subtarget,
7921 SelectionDAG &DAG) {
7923 assert(Op.getSimpleValueType() == MVT::v2f64 && "Bad shuffle type!");
7924 assert(V1.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7925 assert(V2.getSimpleValueType() == MVT::v2f64 && "Bad operand type!");
7926 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
7927 ArrayRef<int> Mask = SVOp->getMask();
7928 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
7930 if (isSingleInputShuffleMask(Mask)) {
7931 // Straight shuffle of a single input vector. Simulate this by using the
7932 // single input as both of the "inputs" to this instruction..
7933 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1);
7935 if (Subtarget->hasAVX()) {
7936 // If we have AVX, we can use VPERMILPS which will allow folding a load
7937 // into the shuffle.
7938 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v2f64, V1,
7939 DAG.getConstant(SHUFPDMask, MVT::i8));
7942 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V1,
7943 DAG.getConstant(SHUFPDMask, MVT::i8));
7945 assert(Mask[0] >= 0 && Mask[0] < 2 && "Non-canonicalized blend!");
7946 assert(Mask[1] >= 2 && "Non-canonicalized blend!");
7948 // Use dedicated unpack instructions for masks that match their pattern.
7949 if (isShuffleEquivalent(Mask, 0, 2))
7950 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2f64, V1, V2);
7951 if (isShuffleEquivalent(Mask, 1, 3))
7952 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2f64, V1, V2);
7954 // If we have a single input, insert that into V1 if we can do so cheaply.
7955 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
7956 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7957 MVT::v2f64, DL, V1, V2, Mask, Subtarget, DAG))
7959 // Try inverting the insertion since for v2 masks it is easy to do and we
7960 // can't reliably sort the mask one way or the other.
7961 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
7962 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
7963 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
7964 MVT::v2f64, DL, V2, V1, InverseMask, Subtarget, DAG))
7968 // Try to use one of the special instruction patterns to handle two common
7969 // blend patterns if a zero-blend above didn't work.
7970 if (isShuffleEquivalent(Mask, 0, 3) || isShuffleEquivalent(Mask, 1, 3))
7971 if (SDValue V1S = getScalarValueForVectorElement(V1, Mask[0], DAG))
7972 // We can either use a special instruction to load over the low double or
7973 // to move just the low double.
7975 isShuffleFoldableLoad(V1S) ? X86ISD::MOVLPD : X86ISD::MOVSD,
7977 DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64, V1S));
7979 if (Subtarget->hasSSE41())
7980 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2f64, V1, V2, Mask,
7984 unsigned SHUFPDMask = (Mask[0] == 1) | (((Mask[1] - 2) == 1) << 1);
7985 return DAG.getNode(X86ISD::SHUFP, SDLoc(Op), MVT::v2f64, V1, V2,
7986 DAG.getConstant(SHUFPDMask, MVT::i8));
7989 /// \brief Handle lowering of 2-lane 64-bit integer shuffles.
7991 /// Tries to lower a 2-lane 64-bit shuffle using shuffle operations provided by
7992 /// the integer unit to minimize domain crossing penalties. However, for blends
7993 /// it falls back to the floating point shuffle operation with appropriate bit
7995 static SDValue lowerV2I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
7996 const X86Subtarget *Subtarget,
7997 SelectionDAG &DAG) {
7999 assert(Op.getSimpleValueType() == MVT::v2i64 && "Bad shuffle type!");
8000 assert(V1.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8001 assert(V2.getSimpleValueType() == MVT::v2i64 && "Bad operand type!");
8002 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8003 ArrayRef<int> Mask = SVOp->getMask();
8004 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
8006 if (isSingleInputShuffleMask(Mask)) {
8007 // Check for being able to broadcast a single element.
8008 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v2i64, DL, V1,
8009 Mask, Subtarget, DAG))
8012 // Straight shuffle of a single input vector. For everything from SSE2
8013 // onward this has a single fast instruction with no scary immediates.
8014 // We have to map the mask as it is actually a v4i32 shuffle instruction.
8015 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V1);
8016 int WidenedMask[4] = {
8017 std::max(Mask[0], 0) * 2, std::max(Mask[0], 0) * 2 + 1,
8018 std::max(Mask[1], 0) * 2, std::max(Mask[1], 0) * 2 + 1};
8020 ISD::BITCAST, DL, MVT::v2i64,
8021 DAG.getNode(X86ISD::PSHUFD, SDLoc(Op), MVT::v4i32, V1,
8022 getV4X86ShuffleImm8ForMask(WidenedMask, DAG)));
8025 // If we have a single input from V2 insert that into V1 if we can do so
8027 if ((Mask[0] >= 2) + (Mask[1] >= 2) == 1) {
8028 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8029 MVT::v2i64, DL, V1, V2, Mask, Subtarget, DAG))
8031 // Try inverting the insertion since for v2 masks it is easy to do and we
8032 // can't reliably sort the mask one way or the other.
8033 int InverseMask[2] = {Mask[0] < 0 ? -1 : (Mask[0] ^ 2),
8034 Mask[1] < 0 ? -1 : (Mask[1] ^ 2)};
8035 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
8036 MVT::v2i64, DL, V2, V1, InverseMask, Subtarget, DAG))
8040 // Use dedicated unpack instructions for masks that match their pattern.
8041 if (isShuffleEquivalent(Mask, 0, 2))
8042 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, V1, V2);
8043 if (isShuffleEquivalent(Mask, 1, 3))
8044 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v2i64, V1, V2);
8046 if (Subtarget->hasSSE41())
8047 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v2i64, V1, V2, Mask,
8051 // Try to use rotation instructions if available.
8052 if (Subtarget->hasSSSE3())
8053 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8054 DL, MVT::v2i64, V1, V2, Mask, DAG))
8057 // We implement this with SHUFPD which is pretty lame because it will likely
8058 // incur 2 cycles of stall for integer vectors on Nehalem and older chips.
8059 // However, all the alternatives are still more cycles and newer chips don't
8060 // have this problem. It would be really nice if x86 had better shuffles here.
8061 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V1);
8062 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v2f64, V2);
8063 return DAG.getNode(ISD::BITCAST, DL, MVT::v2i64,
8064 DAG.getVectorShuffle(MVT::v2f64, DL, V1, V2, Mask));
8067 /// \brief Lower a vector shuffle using the SHUFPS instruction.
8069 /// This is a helper routine dedicated to lowering vector shuffles using SHUFPS.
8070 /// It makes no assumptions about whether this is the *best* lowering, it simply
8072 static SDValue lowerVectorShuffleWithSHUFPS(SDLoc DL, MVT VT,
8073 ArrayRef<int> Mask, SDValue V1,
8074 SDValue V2, SelectionDAG &DAG) {
8075 SDValue LowV = V1, HighV = V2;
8076 int NewMask[4] = {Mask[0], Mask[1], Mask[2], Mask[3]};
8079 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8081 if (NumV2Elements == 1) {
8083 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8086 // Compute the index adjacent to V2Index and in the same half by toggling
8088 int V2AdjIndex = V2Index ^ 1;
8090 if (Mask[V2AdjIndex] == -1) {
8091 // Handles all the cases where we have a single V2 element and an undef.
8092 // This will only ever happen in the high lanes because we commute the
8093 // vector otherwise.
8095 std::swap(LowV, HighV);
8096 NewMask[V2Index] -= 4;
8098 // Handle the case where the V2 element ends up adjacent to a V1 element.
8099 // To make this work, blend them together as the first step.
8100 int V1Index = V2AdjIndex;
8101 int BlendMask[4] = {Mask[V2Index] - 4, 0, Mask[V1Index], 0};
8102 V2 = DAG.getNode(X86ISD::SHUFP, DL, VT, V2, V1,
8103 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8105 // Now proceed to reconstruct the final blend as we have the necessary
8106 // high or low half formed.
8113 NewMask[V1Index] = 2; // We put the V1 element in V2[2].
8114 NewMask[V2Index] = 0; // We shifted the V2 element into V2[0].
8116 } else if (NumV2Elements == 2) {
8117 if (Mask[0] < 4 && Mask[1] < 4) {
8118 // Handle the easy case where we have V1 in the low lanes and V2 in the
8122 } else if (Mask[2] < 4 && Mask[3] < 4) {
8123 // We also handle the reversed case because this utility may get called
8124 // when we detect a SHUFPS pattern but can't easily commute the shuffle to
8125 // arrange things in the right direction.
8131 // We have a mixture of V1 and V2 in both low and high lanes. Rather than
8132 // trying to place elements directly, just blend them and set up the final
8133 // shuffle to place them.
8135 // The first two blend mask elements are for V1, the second two are for
8137 int BlendMask[4] = {Mask[0] < 4 ? Mask[0] : Mask[1],
8138 Mask[2] < 4 ? Mask[2] : Mask[3],
8139 (Mask[0] >= 4 ? Mask[0] : Mask[1]) - 4,
8140 (Mask[2] >= 4 ? Mask[2] : Mask[3]) - 4};
8141 V1 = DAG.getNode(X86ISD::SHUFP, DL, VT, V1, V2,
8142 getV4X86ShuffleImm8ForMask(BlendMask, DAG));
8144 // Now we do a normal shuffle of V1 by giving V1 as both operands to
8147 NewMask[0] = Mask[0] < 4 ? 0 : 2;
8148 NewMask[1] = Mask[0] < 4 ? 2 : 0;
8149 NewMask[2] = Mask[2] < 4 ? 1 : 3;
8150 NewMask[3] = Mask[2] < 4 ? 3 : 1;
8153 return DAG.getNode(X86ISD::SHUFP, DL, VT, LowV, HighV,
8154 getV4X86ShuffleImm8ForMask(NewMask, DAG));
8157 /// \brief Lower 4-lane 32-bit floating point shuffles.
8159 /// Uses instructions exclusively from the floating point unit to minimize
8160 /// domain crossing penalties, as these are sufficient to implement all v4f32
8162 static SDValue lowerV4F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8163 const X86Subtarget *Subtarget,
8164 SelectionDAG &DAG) {
8166 assert(Op.getSimpleValueType() == MVT::v4f32 && "Bad shuffle type!");
8167 assert(V1.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8168 assert(V2.getSimpleValueType() == MVT::v4f32 && "Bad operand type!");
8169 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8170 ArrayRef<int> Mask = SVOp->getMask();
8171 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8174 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8176 if (NumV2Elements == 0) {
8177 // Check for being able to broadcast a single element.
8178 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f32, DL, V1,
8179 Mask, Subtarget, DAG))
8182 if (Subtarget->hasAVX()) {
8183 // If we have AVX, we can use VPERMILPS which will allow folding a load
8184 // into the shuffle.
8185 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f32, V1,
8186 getV4X86ShuffleImm8ForMask(Mask, DAG));
8189 // Otherwise, use a straight shuffle of a single input vector. We pass the
8190 // input vector to both operands to simulate this with a SHUFPS.
8191 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f32, V1, V1,
8192 getV4X86ShuffleImm8ForMask(Mask, DAG));
8195 // Use dedicated unpack instructions for masks that match their pattern.
8196 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8197 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f32, V1, V2);
8198 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8199 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f32, V1, V2);
8201 // There are special ways we can lower some single-element blends. However, we
8202 // have custom ways we can lower more complex single-element blends below that
8203 // we defer to if both this and BLENDPS fail to match, so restrict this to
8204 // when the V2 input is targeting element 0 of the mask -- that is the fast
8206 if (NumV2Elements == 1 && Mask[0] >= 4)
8207 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4f32, DL, V1, V2,
8208 Mask, Subtarget, DAG))
8211 if (Subtarget->hasSSE41())
8212 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f32, V1, V2, Mask,
8216 // Check for whether we can use INSERTPS to perform the blend. We only use
8217 // INSERTPS when the V1 elements are already in the correct locations
8218 // because otherwise we can just always use two SHUFPS instructions which
8219 // are much smaller to encode than a SHUFPS and an INSERTPS.
8220 if (NumV2Elements == 1 && Subtarget->hasSSE41()) {
8222 std::find_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; }) -
8225 // When using INSERTPS we can zero any lane of the destination. Collect
8226 // the zero inputs into a mask and drop them from the lanes of V1 which
8227 // actually need to be present as inputs to the INSERTPS.
8228 SmallBitVector Zeroable = computeZeroableShuffleElements(Mask, V1, V2);
8230 // Synthesize a shuffle mask for the non-zero and non-v2 inputs.
8231 bool InsertNeedsShuffle = false;
8233 for (int i = 0; i < 4; ++i)
8237 } else if (Mask[i] != i) {
8238 InsertNeedsShuffle = true;
8243 // We don't want to use INSERTPS or other insertion techniques if it will
8244 // require shuffling anyways.
8245 if (!InsertNeedsShuffle) {
8246 // If all of V1 is zeroable, replace it with undef.
8247 if ((ZMask | 1 << V2Index) == 0xF)
8248 V1 = DAG.getUNDEF(MVT::v4f32);
8250 unsigned InsertPSMask = (Mask[V2Index] - 4) << 6 | V2Index << 4 | ZMask;
8251 assert((InsertPSMask & ~0xFFu) == 0 && "Invalid mask!");
8253 // Insert the V2 element into the desired position.
8254 return DAG.getNode(X86ISD::INSERTPS, DL, MVT::v4f32, V1, V2,
8255 DAG.getConstant(InsertPSMask, MVT::i8));
8259 // Otherwise fall back to a SHUFPS lowering strategy.
8260 return lowerVectorShuffleWithSHUFPS(DL, MVT::v4f32, Mask, V1, V2, DAG);
8263 /// \brief Lower 4-lane i32 vector shuffles.
8265 /// We try to handle these with integer-domain shuffles where we can, but for
8266 /// blends we use the floating point domain blend instructions.
8267 static SDValue lowerV4I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8268 const X86Subtarget *Subtarget,
8269 SelectionDAG &DAG) {
8271 assert(Op.getSimpleValueType() == MVT::v4i32 && "Bad shuffle type!");
8272 assert(V1.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8273 assert(V2.getSimpleValueType() == MVT::v4i32 && "Bad operand type!");
8274 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8275 ArrayRef<int> Mask = SVOp->getMask();
8276 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
8278 // Whenever we can lower this as a zext, that instruction is strictly faster
8279 // than any alternative. It also allows us to fold memory operands into the
8280 // shuffle in many cases.
8281 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(DL, MVT::v4i32, V1, V2,
8282 Mask, Subtarget, DAG))
8286 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
8288 if (NumV2Elements == 0) {
8289 // Check for being able to broadcast a single element.
8290 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i32, DL, V1,
8291 Mask, Subtarget, DAG))
8294 // Straight shuffle of a single input vector. For everything from SSE2
8295 // onward this has a single fast instruction with no scary immediates.
8296 // We coerce the shuffle pattern to be compatible with UNPCK instructions
8297 // but we aren't actually going to use the UNPCK instruction because doing
8298 // so prevents folding a load into this instruction or making a copy.
8299 const int UnpackLoMask[] = {0, 0, 1, 1};
8300 const int UnpackHiMask[] = {2, 2, 3, 3};
8301 if (isShuffleEquivalent(Mask, 0, 0, 1, 1))
8302 Mask = UnpackLoMask;
8303 else if (isShuffleEquivalent(Mask, 2, 2, 3, 3))
8304 Mask = UnpackHiMask;
8306 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V1,
8307 getV4X86ShuffleImm8ForMask(Mask, DAG));
8310 // There are special ways we can lower some single-element blends.
8311 if (NumV2Elements == 1)
8312 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v4i32, DL, V1, V2,
8313 Mask, Subtarget, DAG))
8316 // Use dedicated unpack instructions for masks that match their pattern.
8317 if (isShuffleEquivalent(Mask, 0, 4, 1, 5))
8318 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i32, V1, V2);
8319 if (isShuffleEquivalent(Mask, 2, 6, 3, 7))
8320 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i32, V1, V2);
8322 if (Subtarget->hasSSE41())
8323 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i32, V1, V2, Mask,
8327 // Try to use rotation instructions if available.
8328 if (Subtarget->hasSSSE3())
8329 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8330 DL, MVT::v4i32, V1, V2, Mask, DAG))
8333 // We implement this with SHUFPS because it can blend from two vectors.
8334 // Because we're going to eventually use SHUFPS, we use SHUFPS even to build
8335 // up the inputs, bypassing domain shift penalties that we would encur if we
8336 // directly used PSHUFD on Nehalem and older. For newer chips, this isn't
8338 return DAG.getNode(ISD::BITCAST, DL, MVT::v4i32,
8339 DAG.getVectorShuffle(
8341 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V1),
8342 DAG.getNode(ISD::BITCAST, DL, MVT::v4f32, V2), Mask));
8345 /// \brief Lowering of single-input v8i16 shuffles is the cornerstone of SSE2
8346 /// shuffle lowering, and the most complex part.
8348 /// The lowering strategy is to try to form pairs of input lanes which are
8349 /// targeted at the same half of the final vector, and then use a dword shuffle
8350 /// to place them onto the right half, and finally unpack the paired lanes into
8351 /// their final position.
8353 /// The exact breakdown of how to form these dword pairs and align them on the
8354 /// correct sides is really tricky. See the comments within the function for
8355 /// more of the details.
8356 static SDValue lowerV8I16SingleInputVectorShuffle(
8357 SDLoc DL, SDValue V, MutableArrayRef<int> Mask,
8358 const X86Subtarget *Subtarget, SelectionDAG &DAG) {
8359 assert(V.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8360 MutableArrayRef<int> LoMask = Mask.slice(0, 4);
8361 MutableArrayRef<int> HiMask = Mask.slice(4, 4);
8363 SmallVector<int, 4> LoInputs;
8364 std::copy_if(LoMask.begin(), LoMask.end(), std::back_inserter(LoInputs),
8365 [](int M) { return M >= 0; });
8366 std::sort(LoInputs.begin(), LoInputs.end());
8367 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()), LoInputs.end());
8368 SmallVector<int, 4> HiInputs;
8369 std::copy_if(HiMask.begin(), HiMask.end(), std::back_inserter(HiInputs),
8370 [](int M) { return M >= 0; });
8371 std::sort(HiInputs.begin(), HiInputs.end());
8372 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()), HiInputs.end());
8374 std::lower_bound(LoInputs.begin(), LoInputs.end(), 4) - LoInputs.begin();
8375 int NumHToL = LoInputs.size() - NumLToL;
8377 std::lower_bound(HiInputs.begin(), HiInputs.end(), 4) - HiInputs.begin();
8378 int NumHToH = HiInputs.size() - NumLToH;
8379 MutableArrayRef<int> LToLInputs(LoInputs.data(), NumLToL);
8380 MutableArrayRef<int> LToHInputs(HiInputs.data(), NumLToH);
8381 MutableArrayRef<int> HToLInputs(LoInputs.data() + NumLToL, NumHToL);
8382 MutableArrayRef<int> HToHInputs(HiInputs.data() + NumLToH, NumHToH);
8384 // Check for being able to broadcast a single element.
8385 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i16, DL, V,
8386 Mask, Subtarget, DAG))
8389 // Use dedicated unpack instructions for masks that match their pattern.
8390 if (isShuffleEquivalent(Mask, 0, 0, 1, 1, 2, 2, 3, 3))
8391 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, V, V);
8392 if (isShuffleEquivalent(Mask, 4, 4, 5, 5, 6, 6, 7, 7))
8393 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i16, V, V);
8395 // Try to use rotation instructions if available.
8396 if (Subtarget->hasSSSE3())
8397 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(
8398 DL, MVT::v8i16, V, V, Mask, DAG))
8401 // Simplify the 1-into-3 and 3-into-1 cases with a single pshufd. For all
8402 // such inputs we can swap two of the dwords across the half mark and end up
8403 // with <=2 inputs to each half in each half. Once there, we can fall through
8404 // to the generic code below. For example:
8406 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8407 // Mask: [0, 1, 2, 7, 4, 5, 6, 3] -----------------> [0, 1, 4, 7, 2, 3, 6, 5]
8409 // However in some very rare cases we have a 1-into-3 or 3-into-1 on one half
8410 // and an existing 2-into-2 on the other half. In this case we may have to
8411 // pre-shuffle the 2-into-2 half to avoid turning it into a 3-into-1 or
8412 // 1-into-3 which could cause us to cycle endlessly fixing each side in turn.
8413 // Fortunately, we don't have to handle anything but a 2-into-2 pattern
8414 // because any other situation (including a 3-into-1 or 1-into-3 in the other
8415 // half than the one we target for fixing) will be fixed when we re-enter this
8416 // path. We will also combine away any sequence of PSHUFD instructions that
8417 // result into a single instruction. Here is an example of the tricky case:
8419 // Input: [a, b, c, d, e, f, g, h] -PSHUFD[0,2,1,3]-> [a, b, e, f, c, d, g, h]
8420 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -THIS-IS-BAD!!!!-> [5, 7, 1, 0, 4, 7, 5, 3]
8422 // This now has a 1-into-3 in the high half! Instead, we do two shuffles:
8424 // Input: [a, b, c, d, e, f, g, h] PSHUFHW[0,2,1,3]-> [a, b, c, d, e, g, f, h]
8425 // Mask: [3, 7, 1, 0, 2, 7, 3, 5] -----------------> [3, 7, 1, 0, 2, 7, 3, 6]
8427 // Input: [a, b, c, d, e, g, f, h] -PSHUFD[0,2,1,3]-> [a, b, e, g, c, d, f, h]
8428 // Mask: [3, 7, 1, 0, 2, 7, 3, 6] -----------------> [5, 7, 1, 0, 4, 7, 5, 6]
8430 // The result is fine to be handled by the generic logic.
8431 auto balanceSides = [&](ArrayRef<int> AToAInputs, ArrayRef<int> BToAInputs,
8432 ArrayRef<int> BToBInputs, ArrayRef<int> AToBInputs,
8433 int AOffset, int BOffset) {
8434 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
8435 "Must call this with A having 3 or 1 inputs from the A half.");
8436 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
8437 "Must call this with B having 1 or 3 inputs from the B half.");
8438 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
8439 "Must call this with either 3:1 or 1:3 inputs (summing to 4).");
8441 // Compute the index of dword with only one word among the three inputs in
8442 // a half by taking the sum of the half with three inputs and subtracting
8443 // the sum of the actual three inputs. The difference is the remaining
8446 int &TripleDWord = AToAInputs.size() == 3 ? ADWord : BDWord;
8447 int &OneInputDWord = AToAInputs.size() == 3 ? BDWord : ADWord;
8448 int TripleInputOffset = AToAInputs.size() == 3 ? AOffset : BOffset;
8449 ArrayRef<int> TripleInputs = AToAInputs.size() == 3 ? AToAInputs : BToAInputs;
8450 int OneInput = AToAInputs.size() == 3 ? BToAInputs[0] : AToAInputs[0];
8451 int TripleInputSum = 0 + 1 + 2 + 3 + (4 * TripleInputOffset);
8452 int TripleNonInputIdx =
8453 TripleInputSum - std::accumulate(TripleInputs.begin(), TripleInputs.end(), 0);
8454 TripleDWord = TripleNonInputIdx / 2;
8456 // We use xor with one to compute the adjacent DWord to whichever one the
8458 OneInputDWord = (OneInput / 2) ^ 1;
8460 // Check for one tricky case: We're fixing a 3<-1 or a 1<-3 shuffle for AToA
8461 // and BToA inputs. If there is also such a problem with the BToB and AToB
8462 // inputs, we don't try to fix it necessarily -- we'll recurse and see it in
8463 // the next pass. However, if we have a 2<-2 in the BToB and AToB inputs, it
8464 // is essential that we don't *create* a 3<-1 as then we might oscillate.
8465 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
8466 // Compute how many inputs will be flipped by swapping these DWords. We
8468 // to balance this to ensure we don't form a 3-1 shuffle in the other
8470 int NumFlippedAToBInputs =
8471 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord) +
8472 std::count(AToBInputs.begin(), AToBInputs.end(), 2 * ADWord + 1);
8473 int NumFlippedBToBInputs =
8474 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord) +
8475 std::count(BToBInputs.begin(), BToBInputs.end(), 2 * BDWord + 1);
8476 if ((NumFlippedAToBInputs == 1 &&
8477 (NumFlippedBToBInputs == 0 || NumFlippedBToBInputs == 2)) ||
8478 (NumFlippedBToBInputs == 1 &&
8479 (NumFlippedAToBInputs == 0 || NumFlippedAToBInputs == 2))) {
8480 // We choose whether to fix the A half or B half based on whether that
8481 // half has zero flipped inputs. At zero, we may not be able to fix it
8482 // with that half. We also bias towards fixing the B half because that
8483 // will more commonly be the high half, and we have to bias one way.
8484 auto FixFlippedInputs = [&V, &DL, &Mask, &DAG](int PinnedIdx, int DWord,
8485 ArrayRef<int> Inputs) {
8486 int FixIdx = PinnedIdx ^ 1; // The adjacent slot to the pinned slot.
8487 bool IsFixIdxInput = std::find(Inputs.begin(), Inputs.end(),
8488 PinnedIdx ^ 1) != Inputs.end();
8489 // Determine whether the free index is in the flipped dword or the
8490 // unflipped dword based on where the pinned index is. We use this bit
8491 // in an xor to conditionally select the adjacent dword.
8492 int FixFreeIdx = 2 * (DWord ^ (PinnedIdx / 2 == DWord));
8493 bool IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8494 FixFreeIdx) != Inputs.end();
8495 if (IsFixIdxInput == IsFixFreeIdxInput)
8497 IsFixFreeIdxInput = std::find(Inputs.begin(), Inputs.end(),
8498 FixFreeIdx) != Inputs.end();
8499 assert(IsFixIdxInput != IsFixFreeIdxInput &&
8500 "We need to be changing the number of flipped inputs!");
8501 int PSHUFHalfMask[] = {0, 1, 2, 3};
8502 std::swap(PSHUFHalfMask[FixFreeIdx % 4], PSHUFHalfMask[FixIdx % 4]);
8503 V = DAG.getNode(FixIdx < 4 ? X86ISD::PSHUFLW : X86ISD::PSHUFHW, DL,
8505 getV4X86ShuffleImm8ForMask(PSHUFHalfMask, DAG));
8508 if (M != -1 && M == FixIdx)
8510 else if (M != -1 && M == FixFreeIdx)
8513 if (NumFlippedBToBInputs != 0) {
8515 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8516 FixFlippedInputs(BPinnedIdx, BDWord, BToBInputs);
8518 assert(NumFlippedAToBInputs != 0 && "Impossible given predicates!");
8520 AToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
8521 FixFlippedInputs(APinnedIdx, ADWord, AToBInputs);
8526 int PSHUFDMask[] = {0, 1, 2, 3};
8527 PSHUFDMask[ADWord] = BDWord;
8528 PSHUFDMask[BDWord] = ADWord;
8529 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8530 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8531 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8532 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8534 // Adjust the mask to match the new locations of A and B.
8536 if (M != -1 && M/2 == ADWord)
8537 M = 2 * BDWord + M % 2;
8538 else if (M != -1 && M/2 == BDWord)
8539 M = 2 * ADWord + M % 2;
8541 // Recurse back into this routine to re-compute state now that this isn't
8542 // a 3 and 1 problem.
8543 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8546 if ((NumLToL == 3 && NumHToL == 1) || (NumLToL == 1 && NumHToL == 3))
8547 return balanceSides(LToLInputs, HToLInputs, HToHInputs, LToHInputs, 0, 4);
8548 else if ((NumHToH == 3 && NumLToH == 1) || (NumHToH == 1 && NumLToH == 3))
8549 return balanceSides(HToHInputs, LToHInputs, LToLInputs, HToLInputs, 4, 0);
8551 // At this point there are at most two inputs to the low and high halves from
8552 // each half. That means the inputs can always be grouped into dwords and
8553 // those dwords can then be moved to the correct half with a dword shuffle.
8554 // We use at most one low and one high word shuffle to collect these paired
8555 // inputs into dwords, and finally a dword shuffle to place them.
8556 int PSHUFLMask[4] = {-1, -1, -1, -1};
8557 int PSHUFHMask[4] = {-1, -1, -1, -1};
8558 int PSHUFDMask[4] = {-1, -1, -1, -1};
8560 // First fix the masks for all the inputs that are staying in their
8561 // original halves. This will then dictate the targets of the cross-half
8563 auto fixInPlaceInputs =
8564 [&PSHUFDMask](ArrayRef<int> InPlaceInputs, ArrayRef<int> IncomingInputs,
8565 MutableArrayRef<int> SourceHalfMask,
8566 MutableArrayRef<int> HalfMask, int HalfOffset) {
8567 if (InPlaceInputs.empty())
8569 if (InPlaceInputs.size() == 1) {
8570 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8571 InPlaceInputs[0] - HalfOffset;
8572 PSHUFDMask[InPlaceInputs[0] / 2] = InPlaceInputs[0] / 2;
8575 if (IncomingInputs.empty()) {
8576 // Just fix all of the in place inputs.
8577 for (int Input : InPlaceInputs) {
8578 SourceHalfMask[Input - HalfOffset] = Input - HalfOffset;
8579 PSHUFDMask[Input / 2] = Input / 2;
8584 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
8585 SourceHalfMask[InPlaceInputs[0] - HalfOffset] =
8586 InPlaceInputs[0] - HalfOffset;
8587 // Put the second input next to the first so that they are packed into
8588 // a dword. We find the adjacent index by toggling the low bit.
8589 int AdjIndex = InPlaceInputs[0] ^ 1;
8590 SourceHalfMask[AdjIndex - HalfOffset] = InPlaceInputs[1] - HalfOffset;
8591 std::replace(HalfMask.begin(), HalfMask.end(), InPlaceInputs[1], AdjIndex);
8592 PSHUFDMask[AdjIndex / 2] = AdjIndex / 2;
8594 fixInPlaceInputs(LToLInputs, HToLInputs, PSHUFLMask, LoMask, 0);
8595 fixInPlaceInputs(HToHInputs, LToHInputs, PSHUFHMask, HiMask, 4);
8597 // Now gather the cross-half inputs and place them into a free dword of
8598 // their target half.
8599 // FIXME: This operation could almost certainly be simplified dramatically to
8600 // look more like the 3-1 fixing operation.
8601 auto moveInputsToRightHalf = [&PSHUFDMask](
8602 MutableArrayRef<int> IncomingInputs, ArrayRef<int> ExistingInputs,
8603 MutableArrayRef<int> SourceHalfMask, MutableArrayRef<int> HalfMask,
8604 MutableArrayRef<int> FinalSourceHalfMask, int SourceOffset,
8606 auto isWordClobbered = [](ArrayRef<int> SourceHalfMask, int Word) {
8607 return SourceHalfMask[Word] != -1 && SourceHalfMask[Word] != Word;
8609 auto isDWordClobbered = [&isWordClobbered](ArrayRef<int> SourceHalfMask,
8611 int LowWord = Word & ~1;
8612 int HighWord = Word | 1;
8613 return isWordClobbered(SourceHalfMask, LowWord) ||
8614 isWordClobbered(SourceHalfMask, HighWord);
8617 if (IncomingInputs.empty())
8620 if (ExistingInputs.empty()) {
8621 // Map any dwords with inputs from them into the right half.
8622 for (int Input : IncomingInputs) {
8623 // If the source half mask maps over the inputs, turn those into
8624 // swaps and use the swapped lane.
8625 if (isWordClobbered(SourceHalfMask, Input - SourceOffset)) {
8626 if (SourceHalfMask[SourceHalfMask[Input - SourceOffset]] == -1) {
8627 SourceHalfMask[SourceHalfMask[Input - SourceOffset]] =
8628 Input - SourceOffset;
8629 // We have to swap the uses in our half mask in one sweep.
8630 for (int &M : HalfMask)
8631 if (M == SourceHalfMask[Input - SourceOffset] + SourceOffset)
8633 else if (M == Input)
8634 M = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8636 assert(SourceHalfMask[SourceHalfMask[Input - SourceOffset]] ==
8637 Input - SourceOffset &&
8638 "Previous placement doesn't match!");
8640 // Note that this correctly re-maps both when we do a swap and when
8641 // we observe the other side of the swap above. We rely on that to
8642 // avoid swapping the members of the input list directly.
8643 Input = SourceHalfMask[Input - SourceOffset] + SourceOffset;
8646 // Map the input's dword into the correct half.
8647 if (PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] == -1)
8648 PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] = Input / 2;
8650 assert(PSHUFDMask[(Input - SourceOffset + DestOffset) / 2] ==
8652 "Previous placement doesn't match!");
8655 // And just directly shift any other-half mask elements to be same-half
8656 // as we will have mirrored the dword containing the element into the
8657 // same position within that half.
8658 for (int &M : HalfMask)
8659 if (M >= SourceOffset && M < SourceOffset + 4) {
8660 M = M - SourceOffset + DestOffset;
8661 assert(M >= 0 && "This should never wrap below zero!");
8666 // Ensure we have the input in a viable dword of its current half. This
8667 // is particularly tricky because the original position may be clobbered
8668 // by inputs being moved and *staying* in that half.
8669 if (IncomingInputs.size() == 1) {
8670 if (isWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8671 int InputFixed = std::find(std::begin(SourceHalfMask),
8672 std::end(SourceHalfMask), -1) -
8673 std::begin(SourceHalfMask) + SourceOffset;
8674 SourceHalfMask[InputFixed - SourceOffset] =
8675 IncomingInputs[0] - SourceOffset;
8676 std::replace(HalfMask.begin(), HalfMask.end(), IncomingInputs[0],
8678 IncomingInputs[0] = InputFixed;
8680 } else if (IncomingInputs.size() == 2) {
8681 if (IncomingInputs[0] / 2 != IncomingInputs[1] / 2 ||
8682 isDWordClobbered(SourceHalfMask, IncomingInputs[0] - SourceOffset)) {
8683 // We have two non-adjacent or clobbered inputs we need to extract from
8684 // the source half. To do this, we need to map them into some adjacent
8685 // dword slot in the source mask.
8686 int InputsFixed[2] = {IncomingInputs[0] - SourceOffset,
8687 IncomingInputs[1] - SourceOffset};
8689 // If there is a free slot in the source half mask adjacent to one of
8690 // the inputs, place the other input in it. We use (Index XOR 1) to
8691 // compute an adjacent index.
8692 if (!isWordClobbered(SourceHalfMask, InputsFixed[0]) &&
8693 SourceHalfMask[InputsFixed[0] ^ 1] == -1) {
8694 SourceHalfMask[InputsFixed[0]] = InputsFixed[0];
8695 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8696 InputsFixed[1] = InputsFixed[0] ^ 1;
8697 } else if (!isWordClobbered(SourceHalfMask, InputsFixed[1]) &&
8698 SourceHalfMask[InputsFixed[1] ^ 1] == -1) {
8699 SourceHalfMask[InputsFixed[1]] = InputsFixed[1];
8700 SourceHalfMask[InputsFixed[1] ^ 1] = InputsFixed[0];
8701 InputsFixed[0] = InputsFixed[1] ^ 1;
8702 } else if (SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] == -1 &&
8703 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] == -1) {
8704 // The two inputs are in the same DWord but it is clobbered and the
8705 // adjacent DWord isn't used at all. Move both inputs to the free
8707 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1)] = InputsFixed[0];
8708 SourceHalfMask[2 * ((InputsFixed[0] / 2) ^ 1) + 1] = InputsFixed[1];
8709 InputsFixed[0] = 2 * ((InputsFixed[0] / 2) ^ 1);
8710 InputsFixed[1] = 2 * ((InputsFixed[0] / 2) ^ 1) + 1;
8712 // The only way we hit this point is if there is no clobbering
8713 // (because there are no off-half inputs to this half) and there is no
8714 // free slot adjacent to one of the inputs. In this case, we have to
8715 // swap an input with a non-input.
8716 for (int i = 0; i < 4; ++i)
8717 assert((SourceHalfMask[i] == -1 || SourceHalfMask[i] == i) &&
8718 "We can't handle any clobbers here!");
8719 assert(InputsFixed[1] != (InputsFixed[0] ^ 1) &&
8720 "Cannot have adjacent inputs here!");
8722 SourceHalfMask[InputsFixed[0] ^ 1] = InputsFixed[1];
8723 SourceHalfMask[InputsFixed[1]] = InputsFixed[0] ^ 1;
8725 // We also have to update the final source mask in this case because
8726 // it may need to undo the above swap.
8727 for (int &M : FinalSourceHalfMask)
8728 if (M == (InputsFixed[0] ^ 1) + SourceOffset)
8729 M = InputsFixed[1] + SourceOffset;
8730 else if (M == InputsFixed[1] + SourceOffset)
8731 M = (InputsFixed[0] ^ 1) + SourceOffset;
8733 InputsFixed[1] = InputsFixed[0] ^ 1;
8736 // Point everything at the fixed inputs.
8737 for (int &M : HalfMask)
8738 if (M == IncomingInputs[0])
8739 M = InputsFixed[0] + SourceOffset;
8740 else if (M == IncomingInputs[1])
8741 M = InputsFixed[1] + SourceOffset;
8743 IncomingInputs[0] = InputsFixed[0] + SourceOffset;
8744 IncomingInputs[1] = InputsFixed[1] + SourceOffset;
8747 llvm_unreachable("Unhandled input size!");
8750 // Now hoist the DWord down to the right half.
8751 int FreeDWord = (PSHUFDMask[DestOffset / 2] == -1 ? 0 : 1) + DestOffset / 2;
8752 assert(PSHUFDMask[FreeDWord] == -1 && "DWord not free");
8753 PSHUFDMask[FreeDWord] = IncomingInputs[0] / 2;
8754 for (int &M : HalfMask)
8755 for (int Input : IncomingInputs)
8757 M = FreeDWord * 2 + Input % 2;
8759 moveInputsToRightHalf(HToLInputs, LToLInputs, PSHUFHMask, LoMask, HiMask,
8760 /*SourceOffset*/ 4, /*DestOffset*/ 0);
8761 moveInputsToRightHalf(LToHInputs, HToHInputs, PSHUFLMask, HiMask, LoMask,
8762 /*SourceOffset*/ 0, /*DestOffset*/ 4);
8764 // Now enact all the shuffles we've computed to move the inputs into their
8766 if (!isNoopShuffleMask(PSHUFLMask))
8767 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8768 getV4X86ShuffleImm8ForMask(PSHUFLMask, DAG));
8769 if (!isNoopShuffleMask(PSHUFHMask))
8770 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8771 getV4X86ShuffleImm8ForMask(PSHUFHMask, DAG));
8772 if (!isNoopShuffleMask(PSHUFDMask))
8773 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
8774 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32,
8775 DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V),
8776 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
8778 // At this point, each half should contain all its inputs, and we can then
8779 // just shuffle them into their final position.
8780 assert(std::count_if(LoMask.begin(), LoMask.end(),
8781 [](int M) { return M >= 4; }) == 0 &&
8782 "Failed to lift all the high half inputs to the low mask!");
8783 assert(std::count_if(HiMask.begin(), HiMask.end(),
8784 [](int M) { return M >= 0 && M < 4; }) == 0 &&
8785 "Failed to lift all the low half inputs to the high mask!");
8787 // Do a half shuffle for the low mask.
8788 if (!isNoopShuffleMask(LoMask))
8789 V = DAG.getNode(X86ISD::PSHUFLW, DL, MVT::v8i16, V,
8790 getV4X86ShuffleImm8ForMask(LoMask, DAG));
8792 // Do a half shuffle with the high mask after shifting its values down.
8793 for (int &M : HiMask)
8796 if (!isNoopShuffleMask(HiMask))
8797 V = DAG.getNode(X86ISD::PSHUFHW, DL, MVT::v8i16, V,
8798 getV4X86ShuffleImm8ForMask(HiMask, DAG));
8803 /// \brief Detect whether the mask pattern should be lowered through
8806 /// This essentially tests whether viewing the mask as an interleaving of two
8807 /// sub-sequences reduces the cross-input traffic of a blend operation. If so,
8808 /// lowering it through interleaving is a significantly better strategy.
8809 static bool shouldLowerAsInterleaving(ArrayRef<int> Mask) {
8810 int NumEvenInputs[2] = {0, 0};
8811 int NumOddInputs[2] = {0, 0};
8812 int NumLoInputs[2] = {0, 0};
8813 int NumHiInputs[2] = {0, 0};
8814 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
8818 int InputIdx = Mask[i] >= Size;
8821 ++NumLoInputs[InputIdx];
8823 ++NumHiInputs[InputIdx];
8826 ++NumEvenInputs[InputIdx];
8828 ++NumOddInputs[InputIdx];
8831 // The minimum number of cross-input results for both the interleaved and
8832 // split cases. If interleaving results in fewer cross-input results, return
8834 int InterleavedCrosses = std::min(NumEvenInputs[1] + NumOddInputs[0],
8835 NumEvenInputs[0] + NumOddInputs[1]);
8836 int SplitCrosses = std::min(NumLoInputs[1] + NumHiInputs[0],
8837 NumLoInputs[0] + NumHiInputs[1]);
8838 return InterleavedCrosses < SplitCrosses;
8841 /// \brief Blend two v8i16 vectors using a naive unpack strategy.
8843 /// This strategy only works when the inputs from each vector fit into a single
8844 /// half of that vector, and generally there are not so many inputs as to leave
8845 /// the in-place shuffles required highly constrained (and thus expensive). It
8846 /// shifts all the inputs into a single side of both input vectors and then
8847 /// uses an unpack to interleave these inputs in a single vector. At that
8848 /// point, we will fall back on the generic single input shuffle lowering.
8849 static SDValue lowerV8I16BasicBlendVectorShuffle(SDLoc DL, SDValue V1,
8851 MutableArrayRef<int> Mask,
8852 const X86Subtarget *Subtarget,
8853 SelectionDAG &DAG) {
8854 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8855 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad input type!");
8856 SmallVector<int, 3> LoV1Inputs, HiV1Inputs, LoV2Inputs, HiV2Inputs;
8857 for (int i = 0; i < 8; ++i)
8858 if (Mask[i] >= 0 && Mask[i] < 4)
8859 LoV1Inputs.push_back(i);
8860 else if (Mask[i] >= 4 && Mask[i] < 8)
8861 HiV1Inputs.push_back(i);
8862 else if (Mask[i] >= 8 && Mask[i] < 12)
8863 LoV2Inputs.push_back(i);
8864 else if (Mask[i] >= 12)
8865 HiV2Inputs.push_back(i);
8867 int NumV1Inputs = LoV1Inputs.size() + HiV1Inputs.size();
8868 int NumV2Inputs = LoV2Inputs.size() + HiV2Inputs.size();
8871 assert(NumV1Inputs > 0 && NumV1Inputs <= 3 && "At most 3 inputs supported");
8872 assert(NumV2Inputs > 0 && NumV2Inputs <= 3 && "At most 3 inputs supported");
8873 assert(NumV1Inputs + NumV2Inputs <= 4 && "At most 4 combined inputs");
8875 bool MergeFromLo = LoV1Inputs.size() + LoV2Inputs.size() >=
8876 HiV1Inputs.size() + HiV2Inputs.size();
8878 auto moveInputsToHalf = [&](SDValue V, ArrayRef<int> LoInputs,
8879 ArrayRef<int> HiInputs, bool MoveToLo,
8881 ArrayRef<int> GoodInputs = MoveToLo ? LoInputs : HiInputs;
8882 ArrayRef<int> BadInputs = MoveToLo ? HiInputs : LoInputs;
8883 if (BadInputs.empty())
8886 int MoveMask[] = {-1, -1, -1, -1, -1, -1, -1, -1};
8887 int MoveOffset = MoveToLo ? 0 : 4;
8889 if (GoodInputs.empty()) {
8890 for (int BadInput : BadInputs) {
8891 MoveMask[Mask[BadInput] % 4 + MoveOffset] = Mask[BadInput] - MaskOffset;
8892 Mask[BadInput] = Mask[BadInput] % 4 + MoveOffset + MaskOffset;
8895 if (GoodInputs.size() == 2) {
8896 // If the low inputs are spread across two dwords, pack them into
8898 MoveMask[MoveOffset] = Mask[GoodInputs[0]] - MaskOffset;
8899 MoveMask[MoveOffset + 1] = Mask[GoodInputs[1]] - MaskOffset;
8900 Mask[GoodInputs[0]] = MoveOffset + MaskOffset;
8901 Mask[GoodInputs[1]] = MoveOffset + 1 + MaskOffset;
8903 // Otherwise pin the good inputs.
8904 for (int GoodInput : GoodInputs)
8905 MoveMask[Mask[GoodInput] - MaskOffset] = Mask[GoodInput] - MaskOffset;
8908 if (BadInputs.size() == 2) {
8909 // If we have two bad inputs then there may be either one or two good
8910 // inputs fixed in place. Find a fixed input, and then find the *other*
8911 // two adjacent indices by using modular arithmetic.
8913 std::find_if(std::begin(MoveMask) + MoveOffset, std::end(MoveMask),
8914 [](int M) { return M >= 0; }) -
8915 std::begin(MoveMask);
8917 ((((GoodMaskIdx - MoveOffset) & ~1) + 2) % 4) + MoveOffset;
8918 assert(MoveMask[MoveMaskIdx] == -1 && "Expected empty slot");
8919 assert(MoveMask[MoveMaskIdx + 1] == -1 && "Expected empty slot");
8920 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8921 MoveMask[MoveMaskIdx + 1] = Mask[BadInputs[1]] - MaskOffset;
8922 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8923 Mask[BadInputs[1]] = MoveMaskIdx + 1 + MaskOffset;
8925 assert(BadInputs.size() == 1 && "All sizes handled");
8926 int MoveMaskIdx = std::find(std::begin(MoveMask) + MoveOffset,
8927 std::end(MoveMask), -1) -
8928 std::begin(MoveMask);
8929 MoveMask[MoveMaskIdx] = Mask[BadInputs[0]] - MaskOffset;
8930 Mask[BadInputs[0]] = MoveMaskIdx + MaskOffset;
8934 return DAG.getVectorShuffle(MVT::v8i16, DL, V, DAG.getUNDEF(MVT::v8i16),
8937 V1 = moveInputsToHalf(V1, LoV1Inputs, HiV1Inputs, MergeFromLo,
8939 V2 = moveInputsToHalf(V2, LoV2Inputs, HiV2Inputs, MergeFromLo,
8942 // FIXME: Select an interleaving of the merge of V1 and V2 that minimizes
8943 // cross-half traffic in the final shuffle.
8945 // Munge the mask to be a single-input mask after the unpack merges the
8949 M = 2 * (M % 4) + (M / 8);
8951 return DAG.getVectorShuffle(
8952 MVT::v8i16, DL, DAG.getNode(MergeFromLo ? X86ISD::UNPCKL : X86ISD::UNPCKH,
8953 DL, MVT::v8i16, V1, V2),
8954 DAG.getUNDEF(MVT::v8i16), Mask);
8957 /// \brief Generic lowering of 8-lane i16 shuffles.
8959 /// This handles both single-input shuffles and combined shuffle/blends with
8960 /// two inputs. The single input shuffles are immediately delegated to
8961 /// a dedicated lowering routine.
8963 /// The blends are lowered in one of three fundamental ways. If there are few
8964 /// enough inputs, it delegates to a basic UNPCK-based strategy. If the shuffle
8965 /// of the input is significantly cheaper when lowered as an interleaving of
8966 /// the two inputs, try to interleave them. Otherwise, blend the low and high
8967 /// halves of the inputs separately (making them have relatively few inputs)
8968 /// and then concatenate them.
8969 static SDValue lowerV8I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
8970 const X86Subtarget *Subtarget,
8971 SelectionDAG &DAG) {
8973 assert(Op.getSimpleValueType() == MVT::v8i16 && "Bad shuffle type!");
8974 assert(V1.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8975 assert(V2.getSimpleValueType() == MVT::v8i16 && "Bad operand type!");
8976 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
8977 ArrayRef<int> OrigMask = SVOp->getMask();
8978 int MaskStorage[8] = {OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
8979 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7]};
8980 MutableArrayRef<int> Mask(MaskStorage);
8982 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
8984 // Whenever we can lower this as a zext, that instruction is strictly faster
8985 // than any alternative.
8986 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
8987 DL, MVT::v8i16, V1, V2, OrigMask, Subtarget, DAG))
8990 auto isV1 = [](int M) { return M >= 0 && M < 8; };
8991 auto isV2 = [](int M) { return M >= 8; };
8993 int NumV1Inputs = std::count_if(Mask.begin(), Mask.end(), isV1);
8994 int NumV2Inputs = std::count_if(Mask.begin(), Mask.end(), isV2);
8996 if (NumV2Inputs == 0)
8997 return lowerV8I16SingleInputVectorShuffle(DL, V1, Mask, Subtarget, DAG);
8999 assert(NumV1Inputs > 0 && "All single-input shuffles should be canonicalized "
9000 "to be V1-input shuffles.");
9002 // There are special ways we can lower some single-element blends.
9003 if (NumV2Inputs == 1)
9004 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v8i16, DL, V1, V2,
9005 Mask, Subtarget, DAG))
9008 if (Subtarget->hasSSE41())
9009 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i16, V1, V2, Mask,
9013 // Try to use rotation instructions if available.
9014 if (Subtarget->hasSSSE3())
9015 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v8i16, V1, V2, Mask, DAG))
9018 if (NumV1Inputs + NumV2Inputs <= 4)
9019 return lowerV8I16BasicBlendVectorShuffle(DL, V1, V2, Mask, Subtarget, DAG);
9021 // Check whether an interleaving lowering is likely to be more efficient.
9022 // This isn't perfect but it is a strong heuristic that tends to work well on
9023 // the kinds of shuffles that show up in practice.
9025 // FIXME: Handle 1x, 2x, and 4x interleaving.
9026 if (shouldLowerAsInterleaving(Mask)) {
9027 // FIXME: Figure out whether we should pack these into the low or high
9030 int EMask[8], OMask[8];
9031 for (int i = 0; i < 4; ++i) {
9032 EMask[i] = Mask[2*i];
9033 OMask[i] = Mask[2*i + 1];
9038 SDValue Evens = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, EMask);
9039 SDValue Odds = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, OMask);
9041 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i16, Evens, Odds);
9044 int LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9045 int HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9047 for (int i = 0; i < 4; ++i) {
9048 LoBlendMask[i] = Mask[i];
9049 HiBlendMask[i] = Mask[i + 4];
9052 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9053 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9054 LoV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, LoV);
9055 HiV = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, HiV);
9057 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9058 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v2i64, LoV, HiV));
9061 /// \brief Check whether a compaction lowering can be done by dropping even
9062 /// elements and compute how many times even elements must be dropped.
9064 /// This handles shuffles which take every Nth element where N is a power of
9065 /// two. Example shuffle masks:
9067 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 0, 2, 4, 6, 8, 10, 12, 14
9068 /// N = 1: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30
9069 /// N = 2: 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12, 0, 4, 8, 12
9070 /// N = 2: 0, 4, 8, 12, 16, 20, 24, 28, 0, 4, 8, 12, 16, 20, 24, 28
9071 /// N = 3: 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8
9072 /// N = 3: 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24
9074 /// Any of these lanes can of course be undef.
9076 /// This routine only supports N <= 3.
9077 /// FIXME: Evaluate whether either AVX or AVX-512 have any opportunities here
9080 /// \returns N above, or the number of times even elements must be dropped if
9081 /// there is such a number. Otherwise returns zero.
9082 static int canLowerByDroppingEvenElements(ArrayRef<int> Mask) {
9083 // Figure out whether we're looping over two inputs or just one.
9084 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9086 // The modulus for the shuffle vector entries is based on whether this is
9087 // a single input or not.
9088 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
9089 assert(isPowerOf2_32((uint32_t)ShuffleModulus) &&
9090 "We should only be called with masks with a power-of-2 size!");
9092 uint64_t ModMask = (uint64_t)ShuffleModulus - 1;
9094 // We track whether the input is viable for all power-of-2 strides 2^1, 2^2,
9095 // and 2^3 simultaneously. This is because we may have ambiguity with
9096 // partially undef inputs.
9097 bool ViableForN[3] = {true, true, true};
9099 for (int i = 0, e = Mask.size(); i < e; ++i) {
9100 // Ignore undef lanes, we'll optimistically collapse them to the pattern we
9105 bool IsAnyViable = false;
9106 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9107 if (ViableForN[j]) {
9110 // The shuffle mask must be equal to (i * 2^N) % M.
9111 if ((uint64_t)Mask[i] == (((uint64_t)i << N) & ModMask))
9114 ViableForN[j] = false;
9116 // Early exit if we exhaust the possible powers of two.
9121 for (unsigned j = 0; j != array_lengthof(ViableForN); ++j)
9125 // Return 0 as there is no viable power of two.
9129 /// \brief Generic lowering of v16i8 shuffles.
9131 /// This is a hybrid strategy to lower v16i8 vectors. It first attempts to
9132 /// detect any complexity reducing interleaving. If that doesn't help, it uses
9133 /// UNPCK to spread the i8 elements across two i16-element vectors, and uses
9134 /// the existing lowering for v8i16 blends on each half, finally PACK-ing them
9136 static SDValue lowerV16I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9137 const X86Subtarget *Subtarget,
9138 SelectionDAG &DAG) {
9140 assert(Op.getSimpleValueType() == MVT::v16i8 && "Bad shuffle type!");
9141 assert(V1.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9142 assert(V2.getSimpleValueType() == MVT::v16i8 && "Bad operand type!");
9143 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9144 ArrayRef<int> OrigMask = SVOp->getMask();
9145 assert(OrigMask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9147 // Try to use rotation instructions if available.
9148 if (Subtarget->hasSSSE3())
9149 if (SDValue Rotate = lowerVectorShuffleAsByteRotate(DL, MVT::v16i8, V1, V2,
9153 // Try to use a zext lowering.
9154 if (SDValue ZExt = lowerVectorShuffleAsZeroOrAnyExtend(
9155 DL, MVT::v16i8, V1, V2, OrigMask, Subtarget, DAG))
9158 int MaskStorage[16] = {
9159 OrigMask[0], OrigMask[1], OrigMask[2], OrigMask[3],
9160 OrigMask[4], OrigMask[5], OrigMask[6], OrigMask[7],
9161 OrigMask[8], OrigMask[9], OrigMask[10], OrigMask[11],
9162 OrigMask[12], OrigMask[13], OrigMask[14], OrigMask[15]};
9163 MutableArrayRef<int> Mask(MaskStorage);
9164 MutableArrayRef<int> LoMask = Mask.slice(0, 8);
9165 MutableArrayRef<int> HiMask = Mask.slice(8, 8);
9168 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 16; });
9170 // For single-input shuffles, there are some nicer lowering tricks we can use.
9171 if (NumV2Elements == 0) {
9172 // Check for being able to broadcast a single element.
9173 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i8, DL, V1,
9174 Mask, Subtarget, DAG))
9177 // Check whether we can widen this to an i16 shuffle by duplicating bytes.
9178 // Notably, this handles splat and partial-splat shuffles more efficiently.
9179 // However, it only makes sense if the pre-duplication shuffle simplifies
9180 // things significantly. Currently, this means we need to be able to
9181 // express the pre-duplication shuffle as an i16 shuffle.
9183 // FIXME: We should check for other patterns which can be widened into an
9184 // i16 shuffle as well.
9185 auto canWidenViaDuplication = [](ArrayRef<int> Mask) {
9186 for (int i = 0; i < 16; i += 2)
9187 if (Mask[i] != -1 && Mask[i + 1] != -1 && Mask[i] != Mask[i + 1])
9192 auto tryToWidenViaDuplication = [&]() -> SDValue {
9193 if (!canWidenViaDuplication(Mask))
9195 SmallVector<int, 4> LoInputs;
9196 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(LoInputs),
9197 [](int M) { return M >= 0 && M < 8; });
9198 std::sort(LoInputs.begin(), LoInputs.end());
9199 LoInputs.erase(std::unique(LoInputs.begin(), LoInputs.end()),
9201 SmallVector<int, 4> HiInputs;
9202 std::copy_if(Mask.begin(), Mask.end(), std::back_inserter(HiInputs),
9203 [](int M) { return M >= 8; });
9204 std::sort(HiInputs.begin(), HiInputs.end());
9205 HiInputs.erase(std::unique(HiInputs.begin(), HiInputs.end()),
9208 bool TargetLo = LoInputs.size() >= HiInputs.size();
9209 ArrayRef<int> InPlaceInputs = TargetLo ? LoInputs : HiInputs;
9210 ArrayRef<int> MovingInputs = TargetLo ? HiInputs : LoInputs;
9212 int PreDupI16Shuffle[] = {-1, -1, -1, -1, -1, -1, -1, -1};
9213 SmallDenseMap<int, int, 8> LaneMap;
9214 for (int I : InPlaceInputs) {
9215 PreDupI16Shuffle[I/2] = I/2;
9218 int j = TargetLo ? 0 : 4, je = j + 4;
9219 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
9220 // Check if j is already a shuffle of this input. This happens when
9221 // there are two adjacent bytes after we move the low one.
9222 if (PreDupI16Shuffle[j] != MovingInputs[i] / 2) {
9223 // If we haven't yet mapped the input, search for a slot into which
9225 while (j < je && PreDupI16Shuffle[j] != -1)
9229 // We can't place the inputs into a single half with a simple i16 shuffle, so bail.
9232 // Map this input with the i16 shuffle.
9233 PreDupI16Shuffle[j] = MovingInputs[i] / 2;
9236 // Update the lane map based on the mapping we ended up with.
9237 LaneMap[MovingInputs[i]] = 2 * j + MovingInputs[i] % 2;
9240 ISD::BITCAST, DL, MVT::v16i8,
9241 DAG.getVectorShuffle(MVT::v8i16, DL,
9242 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9243 DAG.getUNDEF(MVT::v8i16), PreDupI16Shuffle));
9245 // Unpack the bytes to form the i16s that will be shuffled into place.
9246 V1 = DAG.getNode(TargetLo ? X86ISD::UNPCKL : X86ISD::UNPCKH, DL,
9247 MVT::v16i8, V1, V1);
9249 int PostDupI16Shuffle[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9250 for (int i = 0; i < 16; ++i)
9251 if (Mask[i] != -1) {
9252 int MappedMask = LaneMap[Mask[i]] - (TargetLo ? 0 : 8);
9253 assert(MappedMask < 8 && "Invalid v8 shuffle mask!");
9254 if (PostDupI16Shuffle[i / 2] == -1)
9255 PostDupI16Shuffle[i / 2] = MappedMask;
9257 assert(PostDupI16Shuffle[i / 2] == MappedMask &&
9258 "Conflicting entrties in the original shuffle!");
9261 ISD::BITCAST, DL, MVT::v16i8,
9262 DAG.getVectorShuffle(MVT::v8i16, DL,
9263 DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1),
9264 DAG.getUNDEF(MVT::v8i16), PostDupI16Shuffle));
9266 if (SDValue V = tryToWidenViaDuplication())
9270 // Check whether an interleaving lowering is likely to be more efficient.
9271 // This isn't perfect but it is a strong heuristic that tends to work well on
9272 // the kinds of shuffles that show up in practice.
9274 // FIXME: We need to handle other interleaving widths (i16, i32, ...).
9275 if (shouldLowerAsInterleaving(Mask)) {
9276 // FIXME: Figure out whether we should pack these into the low or high
9279 int EMask[16], OMask[16];
9280 for (int i = 0; i < 8; ++i) {
9281 EMask[i] = Mask[2*i];
9282 OMask[i] = Mask[2*i + 1];
9287 SDValue Evens = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, EMask);
9288 SDValue Odds = DAG.getVectorShuffle(MVT::v16i8, DL, V1, V2, OMask);
9290 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, Evens, Odds);
9293 // Check for SSSE3 which lets us lower all v16i8 shuffles much more directly
9294 // with PSHUFB. It is important to do this before we attempt to generate any
9295 // blends but after all of the single-input lowerings. If the single input
9296 // lowerings can find an instruction sequence that is faster than a PSHUFB, we
9297 // want to preserve that and we can DAG combine any longer sequences into
9298 // a PSHUFB in the end. But once we start blending from multiple inputs,
9299 // the complexity of DAG combining bad patterns back into PSHUFB is too high,
9300 // and there are *very* few patterns that would actually be faster than the
9301 // PSHUFB approach because of its ability to zero lanes.
9303 // FIXME: The only exceptions to the above are blends which are exact
9304 // interleavings with direct instructions supporting them. We currently don't
9305 // handle those well here.
9306 if (Subtarget->hasSSSE3()) {
9309 for (int i = 0; i < 16; ++i)
9310 if (Mask[i] == -1) {
9311 V1Mask[i] = V2Mask[i] = DAG.getUNDEF(MVT::i8);
9313 V1Mask[i] = DAG.getConstant(Mask[i] < 16 ? Mask[i] : 0x80, MVT::i8);
9315 DAG.getConstant(Mask[i] < 16 ? 0x80 : Mask[i] - 16, MVT::i8);
9317 V1 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V1,
9318 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V1Mask));
9319 if (isSingleInputShuffleMask(Mask))
9320 return V1; // Single inputs are easy.
9322 // Otherwise, blend the two.
9323 V2 = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, V2,
9324 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, V2Mask));
9325 return DAG.getNode(ISD::OR, DL, MVT::v16i8, V1, V2);
9328 // There are special ways we can lower some single-element blends.
9329 if (NumV2Elements == 1)
9330 if (SDValue V = lowerVectorShuffleAsElementInsertion(MVT::v16i8, DL, V1, V2,
9331 Mask, Subtarget, DAG))
9334 // Check whether a compaction lowering can be done. This handles shuffles
9335 // which take every Nth element for some even N. See the helper function for
9338 // We special case these as they can be particularly efficiently handled with
9339 // the PACKUSB instruction on x86 and they show up in common patterns of
9340 // rearranging bytes to truncate wide elements.
9341 if (int NumEvenDrops = canLowerByDroppingEvenElements(Mask)) {
9342 // NumEvenDrops is the power of two stride of the elements. Another way of
9343 // thinking about it is that we need to drop the even elements this many
9344 // times to get the original input.
9345 bool IsSingleInput = isSingleInputShuffleMask(Mask);
9347 // First we need to zero all the dropped bytes.
9348 assert(NumEvenDrops <= 3 &&
9349 "No support for dropping even elements more than 3 times.");
9350 // We use the mask type to pick which bytes are preserved based on how many
9351 // elements are dropped.
9352 MVT MaskVTs[] = { MVT::v8i16, MVT::v4i32, MVT::v2i64 };
9353 SDValue ByteClearMask =
9354 DAG.getNode(ISD::BITCAST, DL, MVT::v16i8,
9355 DAG.getConstant(0xFF, MaskVTs[NumEvenDrops - 1]));
9356 V1 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V1, ByteClearMask);
9358 V2 = DAG.getNode(ISD::AND, DL, MVT::v16i8, V2, ByteClearMask);
9360 // Now pack things back together.
9361 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V1);
9362 V2 = IsSingleInput ? V1 : DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V2);
9363 SDValue Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, V1, V2);
9364 for (int i = 1; i < NumEvenDrops; ++i) {
9365 Result = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, Result);
9366 Result = DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, Result, Result);
9372 int V1LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9373 int V1HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9374 int V2LoBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9375 int V2HiBlendMask[8] = {-1, -1, -1, -1, -1, -1, -1, -1};
9377 auto buildBlendMasks = [](MutableArrayRef<int> HalfMask,
9378 MutableArrayRef<int> V1HalfBlendMask,
9379 MutableArrayRef<int> V2HalfBlendMask) {
9380 for (int i = 0; i < 8; ++i)
9381 if (HalfMask[i] >= 0 && HalfMask[i] < 16) {
9382 V1HalfBlendMask[i] = HalfMask[i];
9384 } else if (HalfMask[i] >= 16) {
9385 V2HalfBlendMask[i] = HalfMask[i] - 16;
9386 HalfMask[i] = i + 8;
9389 buildBlendMasks(LoMask, V1LoBlendMask, V2LoBlendMask);
9390 buildBlendMasks(HiMask, V1HiBlendMask, V2HiBlendMask);
9392 SDValue Zero = getZeroVector(MVT::v8i16, Subtarget, DAG, DL);
9394 auto buildLoAndHiV8s = [&](SDValue V, MutableArrayRef<int> LoBlendMask,
9395 MutableArrayRef<int> HiBlendMask) {
9397 // Check if any of the odd lanes in the v16i8 are used. If not, we can mask
9398 // them out and avoid using UNPCK{L,H} to extract the elements of V as
9400 if (std::none_of(LoBlendMask.begin(), LoBlendMask.end(),
9401 [](int M) { return M >= 0 && M % 2 == 1; }) &&
9402 std::none_of(HiBlendMask.begin(), HiBlendMask.end(),
9403 [](int M) { return M >= 0 && M % 2 == 1; })) {
9404 // Use a mask to drop the high bytes.
9405 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
9406 V1 = DAG.getNode(ISD::AND, DL, MVT::v8i16, V1,
9407 DAG.getConstant(0x00FF, MVT::v8i16));
9409 // This will be a single vector shuffle instead of a blend so nuke V2.
9410 V2 = DAG.getUNDEF(MVT::v8i16);
9412 // Squash the masks to point directly into V1.
9413 for (int &M : LoBlendMask)
9416 for (int &M : HiBlendMask)
9420 // Otherwise just unpack the low half of V into V1 and the high half into
9421 // V2 so that we can blend them as i16s.
9422 V1 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9423 DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i8, V, Zero));
9424 V2 = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16,
9425 DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i8, V, Zero));
9428 SDValue BlendedLo = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, LoBlendMask);
9429 SDValue BlendedHi = DAG.getVectorShuffle(MVT::v8i16, DL, V1, V2, HiBlendMask);
9430 return std::make_pair(BlendedLo, BlendedHi);
9432 SDValue V1Lo, V1Hi, V2Lo, V2Hi;
9433 std::tie(V1Lo, V1Hi) = buildLoAndHiV8s(V1, V1LoBlendMask, V1HiBlendMask);
9434 std::tie(V2Lo, V2Hi) = buildLoAndHiV8s(V2, V2LoBlendMask, V2HiBlendMask);
9436 SDValue LoV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Lo, V2Lo, LoMask);
9437 SDValue HiV = DAG.getVectorShuffle(MVT::v8i16, DL, V1Hi, V2Hi, HiMask);
9439 return DAG.getNode(X86ISD::PACKUS, DL, MVT::v16i8, LoV, HiV);
9442 /// \brief Dispatching routine to lower various 128-bit x86 vector shuffles.
9444 /// This routine breaks down the specific type of 128-bit shuffle and
9445 /// dispatches to the lowering routines accordingly.
9446 static SDValue lower128BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9447 MVT VT, const X86Subtarget *Subtarget,
9448 SelectionDAG &DAG) {
9449 switch (VT.SimpleTy) {
9451 return lowerV2I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9453 return lowerV2F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
9455 return lowerV4I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9457 return lowerV4F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
9459 return lowerV8I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
9461 return lowerV16I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
9464 llvm_unreachable("Unimplemented!");
9468 /// \brief Generic routine to split ector shuffle into half-sized shuffles.
9470 /// This routine just extracts two subvectors, shuffles them independently, and
9471 /// then concatenates them back together. This should work effectively with all
9472 /// AVX vector shuffle types.
9473 static SDValue splitAndLowerVectorShuffle(SDLoc DL, MVT VT, SDValue V1,
9474 SDValue V2, ArrayRef<int> Mask,
9475 SelectionDAG &DAG) {
9476 assert(VT.getSizeInBits() >= 256 &&
9477 "Only for 256-bit or wider vector shuffles!");
9478 assert(V1.getSimpleValueType() == VT && "Bad operand type!");
9479 assert(V2.getSimpleValueType() == VT && "Bad operand type!");
9481 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
9482 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
9484 int NumElements = VT.getVectorNumElements();
9485 int SplitNumElements = NumElements / 2;
9486 MVT ScalarVT = VT.getScalarType();
9487 MVT SplitVT = MVT::getVectorVT(ScalarVT, NumElements / 2);
9489 SDValue LoV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9490 DAG.getIntPtrConstant(0));
9491 SDValue HiV1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V1,
9492 DAG.getIntPtrConstant(SplitNumElements));
9493 SDValue LoV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9494 DAG.getIntPtrConstant(0));
9495 SDValue HiV2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SplitVT, V2,
9496 DAG.getIntPtrConstant(SplitNumElements));
9498 // Now create two 4-way blends of these half-width vectors.
9499 auto HalfBlend = [&](ArrayRef<int> HalfMask) {
9500 SmallVector<int, 32> V1BlendMask, V2BlendMask, BlendMask;
9501 for (int i = 0; i < SplitNumElements; ++i) {
9502 int M = HalfMask[i];
9503 if (M >= NumElements) {
9504 V2BlendMask.push_back(M - NumElements);
9505 V1BlendMask.push_back(-1);
9506 BlendMask.push_back(SplitNumElements + i);
9507 } else if (M >= 0) {
9508 V2BlendMask.push_back(-1);
9509 V1BlendMask.push_back(M);
9510 BlendMask.push_back(i);
9512 V2BlendMask.push_back(-1);
9513 V1BlendMask.push_back(-1);
9514 BlendMask.push_back(-1);
9518 DAG.getVectorShuffle(SplitVT, DL, LoV1, HiV1, V1BlendMask);
9520 DAG.getVectorShuffle(SplitVT, DL, LoV2, HiV2, V2BlendMask);
9521 return DAG.getVectorShuffle(SplitVT, DL, V1Blend, V2Blend, BlendMask);
9523 SDValue Lo = HalfBlend(LoMask);
9524 SDValue Hi = HalfBlend(HiMask);
9525 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
9528 /// \brief Lower a vector shuffle crossing multiple 128-bit lanes as
9529 /// a permutation and blend of those lanes.
9531 /// This essentially blends the out-of-lane inputs to each lane into the lane
9532 /// from a permuted copy of the vector. This lowering strategy results in four
9533 /// instructions in the worst case for a single-input cross lane shuffle which
9534 /// is lower than any other fully general cross-lane shuffle strategy I'm aware
9535 /// of. Special cases for each particular shuffle pattern should be handled
9536 /// prior to trying this lowering.
9537 static SDValue lowerVectorShuffleAsLanePermuteAndBlend(SDLoc DL, MVT VT,
9538 SDValue V1, SDValue V2,
9540 SelectionDAG &DAG) {
9541 // FIXME: This should probably be generalized for 512-bit vectors as well.
9542 assert(VT.getSizeInBits() == 256 && "Only for 256-bit vector shuffles!");
9543 int LaneSize = Mask.size() / 2;
9545 // If there are only inputs from one 128-bit lane, splitting will in fact be
9546 // less expensive. The flags track wether the given lane contains an element
9547 // that crosses to another lane.
9548 bool LaneCrossing[2] = {false, false};
9549 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9550 if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize)
9551 LaneCrossing[(Mask[i] % Size) / LaneSize] = true;
9552 if (!LaneCrossing[0] || !LaneCrossing[1])
9553 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
9555 if (isSingleInputShuffleMask(Mask)) {
9556 SmallVector<int, 32> FlippedBlendMask;
9557 for (int i = 0, Size = Mask.size(); i < Size; ++i)
9558 FlippedBlendMask.push_back(
9559 Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize)
9561 : Mask[i] % LaneSize +
9562 (i / LaneSize) * LaneSize + Size));
9564 // Flip the vector, and blend the results which should now be in-lane. The
9565 // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and
9566 // 5 for the high source. The value 3 selects the high half of source 2 and
9567 // the value 2 selects the low half of source 2. We only use source 2 to
9568 // allow folding it into a memory operand.
9569 unsigned PERMMask = 3 | 2 << 4;
9570 SDValue Flipped = DAG.getNode(X86ISD::VPERM2X128, DL, VT, DAG.getUNDEF(VT),
9571 V1, DAG.getConstant(PERMMask, MVT::i8));
9572 return DAG.getVectorShuffle(VT, DL, V1, Flipped, FlippedBlendMask);
9575 // This now reduces to two single-input shuffles of V1 and V2 which at worst
9576 // will be handled by the above logic and a blend of the results, much like
9577 // other patterns in AVX.
9578 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, VT, V1, V2, Mask, DAG);
9581 /// \brief Handle lowering of 4-lane 64-bit floating point shuffles.
9583 /// Also ends up handling lowering of 4-lane 64-bit integer shuffles when AVX2
9584 /// isn't available.
9585 static SDValue lowerV4F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9586 const X86Subtarget *Subtarget,
9587 SelectionDAG &DAG) {
9589 assert(V1.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9590 assert(V2.getSimpleValueType() == MVT::v4f64 && "Bad operand type!");
9591 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9592 ArrayRef<int> Mask = SVOp->getMask();
9593 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9595 if (isSingleInputShuffleMask(Mask)) {
9596 // Check for being able to broadcast a single element.
9597 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4f64, DL, V1,
9598 Mask, Subtarget, DAG))
9601 if (!is128BitLaneCrossingShuffleMask(MVT::v4f64, Mask)) {
9602 // Non-half-crossing single input shuffles can be lowerid with an
9603 // interleaved permutation.
9604 unsigned VPERMILPMask = (Mask[0] == 1) | ((Mask[1] == 1) << 1) |
9605 ((Mask[2] == 3) << 2) | ((Mask[3] == 3) << 3);
9606 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v4f64, V1,
9607 DAG.getConstant(VPERMILPMask, MVT::i8));
9610 // With AVX2 we have direct support for this permutation.
9611 if (Subtarget->hasAVX2())
9612 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4f64, V1,
9613 getV4X86ShuffleImm8ForMask(Mask, DAG));
9615 // Otherwise, fall back.
9616 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v4f64, V1, V2, Mask,
9620 // X86 has dedicated unpack instructions that can handle specific blend
9621 // operations: UNPCKH and UNPCKL.
9622 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9623 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4f64, V1, V2);
9624 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9625 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4f64, V1, V2);
9627 // If we have a single input to the zero element, insert that into V1 if we
9628 // can do so cheaply.
9630 std::count_if(Mask.begin(), Mask.end(), [](int M) { return M >= 4; });
9631 if (NumV2Elements == 1 && Mask[0] >= 4)
9632 if (SDValue Insertion = lowerVectorShuffleAsElementInsertion(
9633 MVT::v4f64, DL, V1, V2, Mask, Subtarget, DAG))
9636 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4f64, V1, V2, Mask,
9640 // Check if the blend happens to exactly fit that of SHUFPD.
9641 if ((Mask[0] == -1 || Mask[0] < 2) &&
9642 (Mask[1] == -1 || (Mask[1] >= 4 && Mask[1] < 6)) &&
9643 (Mask[2] == -1 || (Mask[2] >= 2 && Mask[2] < 4)) &&
9644 (Mask[3] == -1 || Mask[3] >= 6)) {
9645 unsigned SHUFPDMask = (Mask[0] == 1) | ((Mask[1] == 5) << 1) |
9646 ((Mask[2] == 3) << 2) | ((Mask[3] == 7) << 3);
9647 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V1, V2,
9648 DAG.getConstant(SHUFPDMask, MVT::i8));
9650 if ((Mask[0] == -1 || (Mask[0] >= 4 && Mask[0] < 6)) &&
9651 (Mask[1] == -1 || Mask[1] < 2) &&
9652 (Mask[2] == -1 || Mask[2] >= 6) &&
9653 (Mask[3] == -1 || (Mask[3] >= 2 && Mask[3] < 4))) {
9654 unsigned SHUFPDMask = (Mask[0] == 5) | ((Mask[1] == 1) << 1) |
9655 ((Mask[2] == 7) << 2) | ((Mask[3] == 3) << 3);
9656 return DAG.getNode(X86ISD::SHUFP, DL, MVT::v4f64, V2, V1,
9657 DAG.getConstant(SHUFPDMask, MVT::i8));
9660 // Otherwise fall back on generic blend lowering.
9661 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4f64, V1, V2,
9665 /// \brief Handle lowering of 4-lane 64-bit integer shuffles.
9667 /// This routine is only called when we have AVX2 and thus a reasonable
9668 /// instruction set for v4i64 shuffling..
9669 static SDValue lowerV4I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9670 const X86Subtarget *Subtarget,
9671 SelectionDAG &DAG) {
9673 assert(V1.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9674 assert(V2.getSimpleValueType() == MVT::v4i64 && "Bad operand type!");
9675 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9676 ArrayRef<int> Mask = SVOp->getMask();
9677 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
9678 assert(Subtarget->hasAVX2() && "We can only lower v4i64 with AVX2!");
9680 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v4i64, V1, V2, Mask,
9684 // Check for being able to broadcast a single element.
9685 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v4i64, DL, V1,
9686 Mask, Subtarget, DAG))
9689 // When the shuffle is mirrored between the 128-bit lanes of the unit, we can
9690 // use lower latency instructions that will operate on both 128-bit lanes.
9691 SmallVector<int, 2> RepeatedMask;
9692 if (is128BitLaneRepeatedShuffleMask(MVT::v4i64, Mask, RepeatedMask)) {
9693 if (isSingleInputShuffleMask(Mask)) {
9694 int PSHUFDMask[] = {-1, -1, -1, -1};
9695 for (int i = 0; i < 2; ++i)
9696 if (RepeatedMask[i] >= 0) {
9697 PSHUFDMask[2 * i] = 2 * RepeatedMask[i];
9698 PSHUFDMask[2 * i + 1] = 2 * RepeatedMask[i] + 1;
9701 ISD::BITCAST, DL, MVT::v4i64,
9702 DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32,
9703 DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, V1),
9704 getV4X86ShuffleImm8ForMask(PSHUFDMask, DAG)));
9707 // Use dedicated unpack instructions for masks that match their pattern.
9708 if (isShuffleEquivalent(Mask, 0, 4, 2, 6))
9709 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v4i64, V1, V2);
9710 if (isShuffleEquivalent(Mask, 1, 5, 3, 7))
9711 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v4i64, V1, V2);
9714 // AVX2 provides a direct instruction for permuting a single input across
9716 if (isSingleInputShuffleMask(Mask))
9717 return DAG.getNode(X86ISD::VPERMI, DL, MVT::v4i64, V1,
9718 getV4X86ShuffleImm8ForMask(Mask, DAG));
9720 // Otherwise fall back on generic blend lowering.
9721 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v4i64, V1, V2,
9725 /// \brief Handle lowering of 8-lane 32-bit floating point shuffles.
9727 /// Also ends up handling lowering of 8-lane 32-bit integer shuffles when AVX2
9728 /// isn't available.
9729 static SDValue lowerV8F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9730 const X86Subtarget *Subtarget,
9731 SelectionDAG &DAG) {
9733 assert(V1.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9734 assert(V2.getSimpleValueType() == MVT::v8f32 && "Bad operand type!");
9735 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9736 ArrayRef<int> Mask = SVOp->getMask();
9737 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9739 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8f32, V1, V2, Mask,
9743 // Check for being able to broadcast a single element.
9744 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8f32, DL, V1,
9745 Mask, Subtarget, DAG))
9748 // If the shuffle mask is repeated in each 128-bit lane, we have many more
9749 // options to efficiently lower the shuffle.
9750 SmallVector<int, 4> RepeatedMask;
9751 if (is128BitLaneRepeatedShuffleMask(MVT::v8f32, Mask, RepeatedMask)) {
9752 assert(RepeatedMask.size() == 4 &&
9753 "Repeated masks must be half the mask width!");
9754 if (isSingleInputShuffleMask(Mask))
9755 return DAG.getNode(X86ISD::VPERMILPI, DL, MVT::v8f32, V1,
9756 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9758 // Use dedicated unpack instructions for masks that match their pattern.
9759 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9760 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8f32, V1, V2);
9761 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9762 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8f32, V1, V2);
9764 // Otherwise, fall back to a SHUFPS sequence. Here it is important that we
9765 // have already handled any direct blends. We also need to squash the
9766 // repeated mask into a simulated v4f32 mask.
9767 for (int i = 0; i < 4; ++i)
9768 if (RepeatedMask[i] >= 8)
9769 RepeatedMask[i] -= 4;
9770 return lowerVectorShuffleWithSHUFPS(DL, MVT::v8f32, RepeatedMask, V1, V2, DAG);
9773 // If we have a single input shuffle with different shuffle patterns in the
9774 // two 128-bit lanes use the variable mask to VPERMILPS.
9775 if (isSingleInputShuffleMask(Mask)) {
9776 SDValue VPermMask[8];
9777 for (int i = 0; i < 8; ++i)
9778 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9779 : DAG.getConstant(Mask[i], MVT::i32);
9780 if (!is128BitLaneCrossingShuffleMask(MVT::v8f32, Mask))
9782 X86ISD::VPERMILPV, DL, MVT::v8f32, V1,
9783 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask));
9785 if (Subtarget->hasAVX2())
9786 return DAG.getNode(X86ISD::VPERMV, DL, MVT::v8f32,
9787 DAG.getNode(ISD::BITCAST, DL, MVT::v8f32,
9788 DAG.getNode(ISD::BUILD_VECTOR, DL,
9789 MVT::v8i32, VPermMask)),
9792 // Otherwise, fall back.
9793 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v8f32, V1, V2, Mask,
9797 // Otherwise fall back on generic blend lowering.
9798 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8f32, V1, V2,
9802 /// \brief Handle lowering of 8-lane 32-bit integer shuffles.
9804 /// This routine is only called when we have AVX2 and thus a reasonable
9805 /// instruction set for v8i32 shuffling..
9806 static SDValue lowerV8I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9807 const X86Subtarget *Subtarget,
9808 SelectionDAG &DAG) {
9810 assert(V1.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9811 assert(V2.getSimpleValueType() == MVT::v8i32 && "Bad operand type!");
9812 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9813 ArrayRef<int> Mask = SVOp->getMask();
9814 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
9815 assert(Subtarget->hasAVX2() && "We can only lower v8i32 with AVX2!");
9817 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v8i32, V1, V2, Mask,
9821 // Check for being able to broadcast a single element.
9822 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v8i32, DL, V1,
9823 Mask, Subtarget, DAG))
9826 // If the shuffle mask is repeated in each 128-bit lane we can use more
9827 // efficient instructions that mirror the shuffles across the two 128-bit
9829 SmallVector<int, 4> RepeatedMask;
9830 if (is128BitLaneRepeatedShuffleMask(MVT::v8i32, Mask, RepeatedMask)) {
9831 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
9832 if (isSingleInputShuffleMask(Mask))
9833 return DAG.getNode(X86ISD::PSHUFD, DL, MVT::v8i32, V1,
9834 getV4X86ShuffleImm8ForMask(RepeatedMask, DAG));
9836 // Use dedicated unpack instructions for masks that match their pattern.
9837 if (isShuffleEquivalent(Mask, 0, 8, 1, 9, 4, 12, 5, 13))
9838 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v8i32, V1, V2);
9839 if (isShuffleEquivalent(Mask, 2, 10, 3, 11, 6, 14, 7, 15))
9840 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v8i32, V1, V2);
9843 // If the shuffle patterns aren't repeated but it is a single input, directly
9844 // generate a cross-lane VPERMD instruction.
9845 if (isSingleInputShuffleMask(Mask)) {
9846 SDValue VPermMask[8];
9847 for (int i = 0; i < 8; ++i)
9848 VPermMask[i] = Mask[i] < 0 ? DAG.getUNDEF(MVT::i32)
9849 : DAG.getConstant(Mask[i], MVT::i32);
9851 X86ISD::VPERMV, DL, MVT::v8i32,
9852 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v8i32, VPermMask), V1);
9855 // Otherwise fall back on generic blend lowering.
9856 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v8i32, V1, V2,
9860 /// \brief Handle lowering of 16-lane 16-bit integer shuffles.
9862 /// This routine is only called when we have AVX2 and thus a reasonable
9863 /// instruction set for v16i16 shuffling..
9864 static SDValue lowerV16I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9865 const X86Subtarget *Subtarget,
9866 SelectionDAG &DAG) {
9868 assert(V1.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9869 assert(V2.getSimpleValueType() == MVT::v16i16 && "Bad operand type!");
9870 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9871 ArrayRef<int> Mask = SVOp->getMask();
9872 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
9873 assert(Subtarget->hasAVX2() && "We can only lower v16i16 with AVX2!");
9875 // Check for being able to broadcast a single element.
9876 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v16i16, DL, V1,
9877 Mask, Subtarget, DAG))
9880 // There are no generalized cross-lane shuffle operations available on i16
9882 if (is128BitLaneCrossingShuffleMask(MVT::v16i16, Mask))
9883 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v16i16, V1, V2,
9886 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v16i16, V1, V2, Mask,
9890 // Use dedicated unpack instructions for masks that match their pattern.
9891 if (isShuffleEquivalent(Mask,
9892 // First 128-bit lane:
9893 0, 16, 1, 17, 2, 18, 3, 19,
9894 // Second 128-bit lane:
9895 8, 24, 9, 25, 10, 26, 11, 27))
9896 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v16i16, V1, V2);
9897 if (isShuffleEquivalent(Mask,
9898 // First 128-bit lane:
9899 4, 20, 5, 21, 6, 22, 7, 23,
9900 // Second 128-bit lane:
9901 12, 28, 13, 29, 14, 30, 15, 31))
9902 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v16i16, V1, V2);
9904 if (isSingleInputShuffleMask(Mask)) {
9905 SDValue PSHUFBMask[32];
9906 for (int i = 0; i < 16; ++i) {
9907 if (Mask[i] == -1) {
9908 PSHUFBMask[2 * i] = PSHUFBMask[2 * i + 1] = DAG.getUNDEF(MVT::i8);
9912 int M = i < 8 ? Mask[i] : Mask[i] - 8;
9913 assert(M >= 0 && M < 8 && "Invalid single-input mask!");
9914 PSHUFBMask[2 * i] = DAG.getConstant(2 * M, MVT::i8);
9915 PSHUFBMask[2 * i + 1] = DAG.getConstant(2 * M + 1, MVT::i8);
9918 ISD::BITCAST, DL, MVT::v16i16,
9920 X86ISD::PSHUFB, DL, MVT::v32i8,
9921 DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, V1),
9922 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask)));
9925 // Otherwise fall back on generic blend lowering.
9926 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v16i16, V1, V2,
9930 /// \brief Handle lowering of 32-lane 8-bit integer shuffles.
9932 /// This routine is only called when we have AVX2 and thus a reasonable
9933 /// instruction set for v32i8 shuffling..
9934 static SDValue lowerV32I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
9935 const X86Subtarget *Subtarget,
9936 SelectionDAG &DAG) {
9938 assert(V1.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9939 assert(V2.getSimpleValueType() == MVT::v32i8 && "Bad operand type!");
9940 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
9941 ArrayRef<int> Mask = SVOp->getMask();
9942 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
9943 assert(Subtarget->hasAVX2() && "We can only lower v32i8 with AVX2!");
9945 // Check for being able to broadcast a single element.
9946 if (SDValue Broadcast = lowerVectorShuffleAsBroadcast(MVT::v32i8, DL, V1,
9947 Mask, Subtarget, DAG))
9950 // There are no generalized cross-lane shuffle operations available on i8
9952 if (is128BitLaneCrossingShuffleMask(MVT::v32i8, Mask))
9953 return lowerVectorShuffleAsLanePermuteAndBlend(DL, MVT::v32i8, V1, V2,
9956 if (SDValue Blend = lowerVectorShuffleAsBlend(DL, MVT::v32i8, V1, V2, Mask,
9960 // Use dedicated unpack instructions for masks that match their pattern.
9961 // Note that these are repeated 128-bit lane unpacks, not unpacks across all
9963 if (isShuffleEquivalent(
9965 // First 128-bit lane:
9966 0, 32, 1, 33, 2, 34, 3, 35, 4, 36, 5, 37, 6, 38, 7, 39,
9967 // Second 128-bit lane:
9968 16, 48, 17, 49, 18, 50, 19, 51, 20, 52, 21, 53, 22, 54, 23, 55))
9969 return DAG.getNode(X86ISD::UNPCKL, DL, MVT::v32i8, V1, V2);
9970 if (isShuffleEquivalent(
9972 // First 128-bit lane:
9973 8, 40, 9, 41, 10, 42, 11, 43, 12, 44, 13, 45, 14, 46, 15, 47,
9974 // Second 128-bit lane:
9975 24, 56, 25, 57, 26, 58, 27, 59, 28, 60, 29, 61, 30, 62, 31, 63))
9976 return DAG.getNode(X86ISD::UNPCKH, DL, MVT::v32i8, V1, V2);
9978 if (isSingleInputShuffleMask(Mask)) {
9979 SDValue PSHUFBMask[32];
9980 for (int i = 0; i < 32; ++i)
9983 ? DAG.getUNDEF(MVT::i8)
9984 : DAG.getConstant(Mask[i] < 16 ? Mask[i] : Mask[i] - 16, MVT::i8);
9987 X86ISD::PSHUFB, DL, MVT::v32i8, V1,
9988 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, PSHUFBMask));
9991 // Otherwise fall back on generic blend lowering.
9992 return lowerVectorShuffleAsDecomposedShuffleBlend(DL, MVT::v32i8, V1, V2,
9996 /// \brief High-level routine to lower various 256-bit x86 vector shuffles.
9998 /// This routine either breaks down the specific type of a 256-bit x86 vector
9999 /// shuffle or splits it into two 128-bit shuffles and fuses the results back
10000 /// together based on the available instructions.
10001 static SDValue lower256BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10002 MVT VT, const X86Subtarget *Subtarget,
10003 SelectionDAG &DAG) {
10005 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10006 ArrayRef<int> Mask = SVOp->getMask();
10008 // There is a really nice hard cut-over between AVX1 and AVX2 that means we can
10009 // check for those subtargets here and avoid much of the subtarget querying in
10010 // the per-vector-type lowering routines. With AVX1 we have essentially *zero*
10011 // ability to manipulate a 256-bit vector with integer types. Since we'll use
10012 // floating point types there eventually, just immediately cast everything to
10013 // a float and operate entirely in that domain.
10014 if (VT.isInteger() && !Subtarget->hasAVX2()) {
10015 int ElementBits = VT.getScalarSizeInBits();
10016 if (ElementBits < 32)
10017 // No floating point type available, decompose into 128-bit vectors.
10018 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10020 MVT FpVT = MVT::getVectorVT(MVT::getFloatingPointVT(ElementBits),
10021 VT.getVectorNumElements());
10022 V1 = DAG.getNode(ISD::BITCAST, DL, FpVT, V1);
10023 V2 = DAG.getNode(ISD::BITCAST, DL, FpVT, V2);
10024 return DAG.getNode(ISD::BITCAST, DL, VT,
10025 DAG.getVectorShuffle(FpVT, DL, V1, V2, Mask));
10028 switch (VT.SimpleTy) {
10030 return lowerV4F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10032 return lowerV4I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10034 return lowerV8F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10036 return lowerV8I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10038 return lowerV16I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10040 return lowerV32I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10043 llvm_unreachable("Not a valid 256-bit x86 vector type!");
10047 /// \brief Handle lowering of 8-lane 64-bit floating point shuffles.
10048 static SDValue lowerV8F64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10049 const X86Subtarget *Subtarget,
10050 SelectionDAG &DAG) {
10052 assert(V1.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10053 assert(V2.getSimpleValueType() == MVT::v8f64 && "Bad operand type!");
10054 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10055 ArrayRef<int> Mask = SVOp->getMask();
10056 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10058 // FIXME: Implement direct support for this type!
10059 return splitAndLowerVectorShuffle(DL, MVT::v8f64, V1, V2, Mask, DAG);
10062 /// \brief Handle lowering of 16-lane 32-bit floating point shuffles.
10063 static SDValue lowerV16F32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10064 const X86Subtarget *Subtarget,
10065 SelectionDAG &DAG) {
10067 assert(V1.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10068 assert(V2.getSimpleValueType() == MVT::v16f32 && "Bad operand type!");
10069 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10070 ArrayRef<int> Mask = SVOp->getMask();
10071 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10073 // FIXME: Implement direct support for this type!
10074 return splitAndLowerVectorShuffle(DL, MVT::v16f32, V1, V2, Mask, DAG);
10077 /// \brief Handle lowering of 8-lane 64-bit integer shuffles.
10078 static SDValue lowerV8I64VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10079 const X86Subtarget *Subtarget,
10080 SelectionDAG &DAG) {
10082 assert(V1.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10083 assert(V2.getSimpleValueType() == MVT::v8i64 && "Bad operand type!");
10084 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10085 ArrayRef<int> Mask = SVOp->getMask();
10086 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
10087 assert(Subtarget->hasDQI() && "We can only lower v8i64 with AVX-512-DQI");
10089 // FIXME: Implement direct support for this type!
10090 return splitAndLowerVectorShuffle(DL, MVT::v8i64, V1, V2, Mask, DAG);
10093 /// \brief Handle lowering of 16-lane 32-bit integer shuffles.
10094 static SDValue lowerV16I32VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10095 const X86Subtarget *Subtarget,
10096 SelectionDAG &DAG) {
10098 assert(V1.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10099 assert(V2.getSimpleValueType() == MVT::v16i32 && "Bad operand type!");
10100 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10101 ArrayRef<int> Mask = SVOp->getMask();
10102 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
10103 assert(Subtarget->hasDQI() && "We can only lower v16i32 with AVX-512-DQI!");
10105 // FIXME: Implement direct support for this type!
10106 return splitAndLowerVectorShuffle(DL, MVT::v16i32, V1, V2, Mask, DAG);
10109 /// \brief Handle lowering of 32-lane 16-bit integer shuffles.
10110 static SDValue lowerV32I16VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10111 const X86Subtarget *Subtarget,
10112 SelectionDAG &DAG) {
10114 assert(V1.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10115 assert(V2.getSimpleValueType() == MVT::v32i16 && "Bad operand type!");
10116 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10117 ArrayRef<int> Mask = SVOp->getMask();
10118 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
10119 assert(Subtarget->hasBWI() && "We can only lower v32i16 with AVX-512-BWI!");
10121 // FIXME: Implement direct support for this type!
10122 return splitAndLowerVectorShuffle(DL, MVT::v32i16, V1, V2, Mask, DAG);
10125 /// \brief Handle lowering of 64-lane 8-bit integer shuffles.
10126 static SDValue lowerV64I8VectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10127 const X86Subtarget *Subtarget,
10128 SelectionDAG &DAG) {
10130 assert(V1.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10131 assert(V2.getSimpleValueType() == MVT::v64i8 && "Bad operand type!");
10132 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10133 ArrayRef<int> Mask = SVOp->getMask();
10134 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
10135 assert(Subtarget->hasBWI() && "We can only lower v64i8 with AVX-512-BWI!");
10137 // FIXME: Implement direct support for this type!
10138 return splitAndLowerVectorShuffle(DL, MVT::v64i8, V1, V2, Mask, DAG);
10141 /// \brief High-level routine to lower various 512-bit x86 vector shuffles.
10143 /// This routine either breaks down the specific type of a 512-bit x86 vector
10144 /// shuffle or splits it into two 256-bit shuffles and fuses the results back
10145 /// together based on the available instructions.
10146 static SDValue lower512BitVectorShuffle(SDValue Op, SDValue V1, SDValue V2,
10147 MVT VT, const X86Subtarget *Subtarget,
10148 SelectionDAG &DAG) {
10150 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10151 ArrayRef<int> Mask = SVOp->getMask();
10152 assert(Subtarget->hasAVX512() &&
10153 "Cannot lower 512-bit vectors w/ basic ISA!");
10155 // Dispatch to each element type for lowering. If we don't have supprot for
10156 // specific element type shuffles at 512 bits, immediately split them and
10157 // lower them. Each lowering routine of a given type is allowed to assume that
10158 // the requisite ISA extensions for that element type are available.
10159 switch (VT.SimpleTy) {
10161 return lowerV8F64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10163 return lowerV16F32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10165 if (Subtarget->hasDQI())
10166 return lowerV8I64VectorShuffle(Op, V1, V2, Subtarget, DAG);
10169 if (Subtarget->hasDQI())
10170 return lowerV16I32VectorShuffle(Op, V1, V2, Subtarget, DAG);
10173 if (Subtarget->hasBWI())
10174 return lowerV32I16VectorShuffle(Op, V1, V2, Subtarget, DAG);
10177 if (Subtarget->hasBWI())
10178 return lowerV64I8VectorShuffle(Op, V1, V2, Subtarget, DAG);
10182 llvm_unreachable("Not a valid 512-bit x86 vector type!");
10185 // Otherwise fall back on splitting.
10186 return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG);
10189 /// \brief Helper function to test whether a shuffle mask could be
10190 /// simplified by widening the elements being shuffled.
10192 /// Appends the mask for wider elements in WidenedMask if valid. Otherwise
10193 /// leaves it in an unspecified state.
10195 /// NOTE: This must handle normal vector shuffle masks and *target* vector
10196 /// shuffle masks. The latter have the special property of a '-2' representing
10197 /// a zero-ed lane of a vector.
10198 static bool canWidenShuffleElements(ArrayRef<int> Mask,
10199 SmallVectorImpl<int> &WidenedMask) {
10200 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
10201 // If both elements are undef, its trivial.
10202 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] == SM_SentinelUndef) {
10203 WidenedMask.push_back(SM_SentinelUndef);
10207 // Check for an undef mask and a mask value properly aligned to fit with
10208 // a pair of values. If we find such a case, use the non-undef mask's value.
10209 if (Mask[i] == SM_SentinelUndef && Mask[i + 1] >= 0 && Mask[i + 1] % 2 == 1) {
10210 WidenedMask.push_back(Mask[i + 1] / 2);
10213 if (Mask[i + 1] == SM_SentinelUndef && Mask[i] >= 0 && Mask[i] % 2 == 0) {
10214 WidenedMask.push_back(Mask[i] / 2);
10218 // When zeroing, we need to spread the zeroing across both lanes to widen.
10219 if (Mask[i] == SM_SentinelZero || Mask[i + 1] == SM_SentinelZero) {
10220 if ((Mask[i] == SM_SentinelZero || Mask[i] == SM_SentinelUndef) &&
10221 (Mask[i + 1] == SM_SentinelZero || Mask[i + 1] == SM_SentinelUndef)) {
10222 WidenedMask.push_back(SM_SentinelZero);
10228 // Finally check if the two mask values are adjacent and aligned with
10230 if (Mask[i] != SM_SentinelUndef && Mask[i] % 2 == 0 && Mask[i] + 1 == Mask[i + 1]) {
10231 WidenedMask.push_back(Mask[i] / 2);
10235 // Otherwise we can't safely widen the elements used in this shuffle.
10238 assert(WidenedMask.size() == Mask.size() / 2 &&
10239 "Incorrect size of mask after widening the elements!");
10244 /// \brief Top-level lowering for x86 vector shuffles.
10246 /// This handles decomposition, canonicalization, and lowering of all x86
10247 /// vector shuffles. Most of the specific lowering strategies are encapsulated
10248 /// above in helper routines. The canonicalization attempts to widen shuffles
10249 /// to involve fewer lanes of wider elements, consolidate symmetric patterns
10250 /// s.t. only one of the two inputs needs to be tested, etc.
10251 static SDValue lowerVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
10252 SelectionDAG &DAG) {
10253 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10254 ArrayRef<int> Mask = SVOp->getMask();
10255 SDValue V1 = Op.getOperand(0);
10256 SDValue V2 = Op.getOperand(1);
10257 MVT VT = Op.getSimpleValueType();
10258 int NumElements = VT.getVectorNumElements();
10261 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
10263 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
10264 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10265 if (V1IsUndef && V2IsUndef)
10266 return DAG.getUNDEF(VT);
10268 // When we create a shuffle node we put the UNDEF node to second operand,
10269 // but in some cases the first operand may be transformed to UNDEF.
10270 // In this case we should just commute the node.
10272 return DAG.getCommutedVectorShuffle(*SVOp);
10274 // Check for non-undef masks pointing at an undef vector and make the masks
10275 // undef as well. This makes it easier to match the shuffle based solely on
10279 if (M >= NumElements) {
10280 SmallVector<int, 8> NewMask(Mask.begin(), Mask.end());
10281 for (int &M : NewMask)
10282 if (M >= NumElements)
10284 return DAG.getVectorShuffle(VT, dl, V1, V2, NewMask);
10287 // Try to collapse shuffles into using a vector type with fewer elements but
10288 // wider element types. We cap this to not form integers or floating point
10289 // elements wider than 64 bits, but it might be interesting to form i128
10290 // integers to handle flipping the low and high halves of AVX 256-bit vectors.
10291 SmallVector<int, 16> WidenedMask;
10292 if (VT.getScalarSizeInBits() < 64 &&
10293 canWidenShuffleElements(Mask, WidenedMask)) {
10294 MVT NewEltVT = VT.isFloatingPoint()
10295 ? MVT::getFloatingPointVT(VT.getScalarSizeInBits() * 2)
10296 : MVT::getIntegerVT(VT.getScalarSizeInBits() * 2);
10297 MVT NewVT = MVT::getVectorVT(NewEltVT, VT.getVectorNumElements() / 2);
10298 // Make sure that the new vector type is legal. For example, v2f64 isn't
10300 if (DAG.getTargetLoweringInfo().isTypeLegal(NewVT)) {
10301 V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, V1);
10302 V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, V2);
10303 return DAG.getNode(ISD::BITCAST, dl, VT,
10304 DAG.getVectorShuffle(NewVT, dl, V1, V2, WidenedMask));
10308 int NumV1Elements = 0, NumUndefElements = 0, NumV2Elements = 0;
10309 for (int M : SVOp->getMask())
10311 ++NumUndefElements;
10312 else if (M < NumElements)
10317 // Commute the shuffle as needed such that more elements come from V1 than
10318 // V2. This allows us to match the shuffle pattern strictly on how many
10319 // elements come from V1 without handling the symmetric cases.
10320 if (NumV2Elements > NumV1Elements)
10321 return DAG.getCommutedVectorShuffle(*SVOp);
10323 // When the number of V1 and V2 elements are the same, try to minimize the
10324 // number of uses of V2 in the low half of the vector. When that is tied,
10325 // ensure that the sum of indices for V1 is equal to or lower than the sum
10327 if (NumV1Elements == NumV2Elements) {
10328 int LowV1Elements = 0, LowV2Elements = 0;
10329 for (int M : SVOp->getMask().slice(0, NumElements / 2))
10330 if (M >= NumElements)
10334 if (LowV2Elements > LowV1Elements) {
10335 return DAG.getCommutedVectorShuffle(*SVOp);
10336 } else if (LowV2Elements == LowV1Elements) {
10337 int SumV1Indices = 0, SumV2Indices = 0;
10338 for (int i = 0, Size = SVOp->getMask().size(); i < Size; ++i)
10339 if (SVOp->getMask()[i] >= NumElements)
10341 else if (SVOp->getMask()[i] >= 0)
10343 if (SumV2Indices < SumV1Indices)
10344 return DAG.getCommutedVectorShuffle(*SVOp);
10348 // For each vector width, delegate to a specialized lowering routine.
10349 if (VT.getSizeInBits() == 128)
10350 return lower128BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10352 if (VT.getSizeInBits() == 256)
10353 return lower256BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10355 // Force AVX-512 vectors to be scalarized for now.
10356 // FIXME: Implement AVX-512 support!
10357 if (VT.getSizeInBits() == 512)
10358 return lower512BitVectorShuffle(Op, V1, V2, VT, Subtarget, DAG);
10360 llvm_unreachable("Unimplemented!");
10364 //===----------------------------------------------------------------------===//
10365 // Legacy vector shuffle lowering
10367 // This code is the legacy code handling vector shuffles until the above
10368 // replaces its functionality and performance.
10369 //===----------------------------------------------------------------------===//
10371 static bool isBlendMask(ArrayRef<int> MaskVals, MVT VT, bool hasSSE41,
10372 bool hasInt256, unsigned *MaskOut = nullptr) {
10373 MVT EltVT = VT.getVectorElementType();
10375 // There is no blend with immediate in AVX-512.
10376 if (VT.is512BitVector())
10379 if (!hasSSE41 || EltVT == MVT::i8)
10381 if (!hasInt256 && VT == MVT::v16i16)
10384 unsigned MaskValue = 0;
10385 unsigned NumElems = VT.getVectorNumElements();
10386 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
10387 unsigned NumLanes = (NumElems - 1) / 8 + 1;
10388 unsigned NumElemsInLane = NumElems / NumLanes;
10390 // Blend for v16i16 should be symetric for the both lanes.
10391 for (unsigned i = 0; i < NumElemsInLane; ++i) {
10393 int SndLaneEltIdx = (NumLanes == 2) ? MaskVals[i + NumElemsInLane] : -1;
10394 int EltIdx = MaskVals[i];
10396 if ((EltIdx < 0 || EltIdx == (int)i) &&
10397 (SndLaneEltIdx < 0 || SndLaneEltIdx == (int)(i + NumElemsInLane)))
10400 if (((unsigned)EltIdx == (i + NumElems)) &&
10401 (SndLaneEltIdx < 0 ||
10402 (unsigned)SndLaneEltIdx == i + NumElems + NumElemsInLane))
10403 MaskValue |= (1 << i);
10409 *MaskOut = MaskValue;
10413 // Try to lower a shuffle node into a simple blend instruction.
10414 // This function assumes isBlendMask returns true for this
10415 // SuffleVectorSDNode
10416 static SDValue LowerVECTOR_SHUFFLEtoBlend(ShuffleVectorSDNode *SVOp,
10417 unsigned MaskValue,
10418 const X86Subtarget *Subtarget,
10419 SelectionDAG &DAG) {
10420 MVT VT = SVOp->getSimpleValueType(0);
10421 MVT EltVT = VT.getVectorElementType();
10422 assert(isBlendMask(SVOp->getMask(), VT, Subtarget->hasSSE41(),
10423 Subtarget->hasInt256() && "Trying to lower a "
10424 "VECTOR_SHUFFLE to a Blend but "
10425 "with the wrong mask"));
10426 SDValue V1 = SVOp->getOperand(0);
10427 SDValue V2 = SVOp->getOperand(1);
10429 unsigned NumElems = VT.getVectorNumElements();
10431 // Convert i32 vectors to floating point if it is not AVX2.
10432 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
10434 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
10435 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
10437 V1 = DAG.getNode(ISD::BITCAST, dl, VT, V1);
10438 V2 = DAG.getNode(ISD::BITCAST, dl, VT, V2);
10441 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, V1, V2,
10442 DAG.getConstant(MaskValue, MVT::i32));
10443 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
10446 /// In vector type \p VT, return true if the element at index \p InputIdx
10447 /// falls on a different 128-bit lane than \p OutputIdx.
10448 static bool ShuffleCrosses128bitLane(MVT VT, unsigned InputIdx,
10449 unsigned OutputIdx) {
10450 unsigned EltSize = VT.getVectorElementType().getSizeInBits();
10451 return InputIdx * EltSize / 128 != OutputIdx * EltSize / 128;
10454 /// Generate a PSHUFB if possible. Selects elements from \p V1 according to
10455 /// \p MaskVals. MaskVals[OutputIdx] = InputIdx specifies that we want to
10456 /// shuffle the element at InputIdx in V1 to OutputIdx in the result. If \p
10457 /// MaskVals refers to elements outside of \p V1 or is undef (-1), insert a
10459 static SDValue getPSHUFB(ArrayRef<int> MaskVals, SDValue V1, SDLoc &dl,
10460 SelectionDAG &DAG) {
10461 MVT VT = V1.getSimpleValueType();
10462 assert(VT.is128BitVector() || VT.is256BitVector());
10464 MVT EltVT = VT.getVectorElementType();
10465 unsigned EltSizeInBytes = EltVT.getSizeInBits() / 8;
10466 unsigned NumElts = VT.getVectorNumElements();
10468 SmallVector<SDValue, 32> PshufbMask;
10469 for (unsigned OutputIdx = 0; OutputIdx < NumElts; ++OutputIdx) {
10470 int InputIdx = MaskVals[OutputIdx];
10471 unsigned InputByteIdx;
10473 if (InputIdx < 0 || NumElts <= (unsigned)InputIdx)
10474 InputByteIdx = 0x80;
10476 // Cross lane is not allowed.
10477 if (ShuffleCrosses128bitLane(VT, InputIdx, OutputIdx))
10479 InputByteIdx = InputIdx * EltSizeInBytes;
10480 // Index is an byte offset within the 128-bit lane.
10481 InputByteIdx &= 0xf;
10484 for (unsigned j = 0; j < EltSizeInBytes; ++j) {
10485 PshufbMask.push_back(DAG.getConstant(InputByteIdx, MVT::i8));
10486 if (InputByteIdx != 0x80)
10491 MVT ShufVT = MVT::getVectorVT(MVT::i8, PshufbMask.size());
10493 V1 = DAG.getNode(ISD::BITCAST, dl, ShufVT, V1);
10494 return DAG.getNode(X86ISD::PSHUFB, dl, ShufVT, V1,
10495 DAG.getNode(ISD::BUILD_VECTOR, dl, ShufVT, PshufbMask));
10498 // v8i16 shuffles - Prefer shuffles in the following order:
10499 // 1. [all] pshuflw, pshufhw, optional move
10500 // 2. [ssse3] 1 x pshufb
10501 // 3. [ssse3] 2 x pshufb + 1 x por
10502 // 4. [all] mov + pshuflw + pshufhw + N x (pextrw + pinsrw)
10504 LowerVECTOR_SHUFFLEv8i16(SDValue Op, const X86Subtarget *Subtarget,
10505 SelectionDAG &DAG) {
10506 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10507 SDValue V1 = SVOp->getOperand(0);
10508 SDValue V2 = SVOp->getOperand(1);
10510 SmallVector<int, 8> MaskVals;
10512 // Determine if more than 1 of the words in each of the low and high quadwords
10513 // of the result come from the same quadword of one of the two inputs. Undef
10514 // mask values count as coming from any quadword, for better codegen.
10516 // Lo/HiQuad[i] = j indicates how many words from the ith quad of the input
10517 // feeds this quad. For i, 0 and 1 refer to V1, 2 and 3 refer to V2.
10518 unsigned LoQuad[] = { 0, 0, 0, 0 };
10519 unsigned HiQuad[] = { 0, 0, 0, 0 };
10520 // Indices of quads used.
10521 std::bitset<4> InputQuads;
10522 for (unsigned i = 0; i < 8; ++i) {
10523 unsigned *Quad = i < 4 ? LoQuad : HiQuad;
10524 int EltIdx = SVOp->getMaskElt(i);
10525 MaskVals.push_back(EltIdx);
10533 ++Quad[EltIdx / 4];
10534 InputQuads.set(EltIdx / 4);
10537 int BestLoQuad = -1;
10538 unsigned MaxQuad = 1;
10539 for (unsigned i = 0; i < 4; ++i) {
10540 if (LoQuad[i] > MaxQuad) {
10542 MaxQuad = LoQuad[i];
10546 int BestHiQuad = -1;
10548 for (unsigned i = 0; i < 4; ++i) {
10549 if (HiQuad[i] > MaxQuad) {
10551 MaxQuad = HiQuad[i];
10555 // For SSSE3, If all 8 words of the result come from only 1 quadword of each
10556 // of the two input vectors, shuffle them into one input vector so only a
10557 // single pshufb instruction is necessary. If there are more than 2 input
10558 // quads, disable the next transformation since it does not help SSSE3.
10559 bool V1Used = InputQuads[0] || InputQuads[1];
10560 bool V2Used = InputQuads[2] || InputQuads[3];
10561 if (Subtarget->hasSSSE3()) {
10562 if (InputQuads.count() == 2 && V1Used && V2Used) {
10563 BestLoQuad = InputQuads[0] ? 0 : 1;
10564 BestHiQuad = InputQuads[2] ? 2 : 3;
10566 if (InputQuads.count() > 2) {
10572 // If BestLoQuad or BestHiQuad are set, shuffle the quads together and update
10573 // the shuffle mask. If a quad is scored as -1, that means that it contains
10574 // words from all 4 input quadwords.
10576 if (BestLoQuad >= 0 || BestHiQuad >= 0) {
10578 BestLoQuad < 0 ? 0 : BestLoQuad,
10579 BestHiQuad < 0 ? 1 : BestHiQuad
10581 NewV = DAG.getVectorShuffle(MVT::v2i64, dl,
10582 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V1),
10583 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, V2), &MaskV[0]);
10584 NewV = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, NewV);
10586 // Rewrite the MaskVals and assign NewV to V1 if NewV now contains all the
10587 // source words for the shuffle, to aid later transformations.
10588 bool AllWordsInNewV = true;
10589 bool InOrder[2] = { true, true };
10590 for (unsigned i = 0; i != 8; ++i) {
10591 int idx = MaskVals[i];
10593 InOrder[i/4] = false;
10594 if (idx < 0 || (idx/4) == BestLoQuad || (idx/4) == BestHiQuad)
10596 AllWordsInNewV = false;
10600 bool pshuflw = AllWordsInNewV, pshufhw = AllWordsInNewV;
10601 if (AllWordsInNewV) {
10602 for (int i = 0; i != 8; ++i) {
10603 int idx = MaskVals[i];
10606 idx = MaskVals[i] = (idx / 4) == BestLoQuad ? (idx & 3) : (idx & 3) + 4;
10607 if ((idx != i) && idx < 4)
10609 if ((idx != i) && idx > 3)
10618 // If we've eliminated the use of V2, and the new mask is a pshuflw or
10619 // pshufhw, that's as cheap as it gets. Return the new shuffle.
10620 if ((pshufhw && InOrder[0]) || (pshuflw && InOrder[1])) {
10621 unsigned Opc = pshufhw ? X86ISD::PSHUFHW : X86ISD::PSHUFLW;
10622 unsigned TargetMask = 0;
10623 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV,
10624 DAG.getUNDEF(MVT::v8i16), &MaskVals[0]);
10625 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10626 TargetMask = pshufhw ? getShufflePSHUFHWImmediate(SVOp):
10627 getShufflePSHUFLWImmediate(SVOp);
10628 V1 = NewV.getOperand(0);
10629 return getTargetShuffleNode(Opc, dl, MVT::v8i16, V1, TargetMask, DAG);
10633 // Promote splats to a larger type which usually leads to more efficient code.
10634 // FIXME: Is this true if pshufb is available?
10635 if (SVOp->isSplat())
10636 return PromoteSplat(SVOp, DAG);
10638 // If we have SSSE3, and all words of the result are from 1 input vector,
10639 // case 2 is generated, otherwise case 3 is generated. If no SSSE3
10640 // is present, fall back to case 4.
10641 if (Subtarget->hasSSSE3()) {
10642 SmallVector<SDValue,16> pshufbMask;
10644 // If we have elements from both input vectors, set the high bit of the
10645 // shuffle mask element to zero out elements that come from V2 in the V1
10646 // mask, and elements that come from V1 in the V2 mask, so that the two
10647 // results can be OR'd together.
10648 bool TwoInputs = V1Used && V2Used;
10649 V1 = getPSHUFB(MaskVals, V1, dl, DAG);
10651 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10653 // Calculate the shuffle mask for the second input, shuffle it, and
10654 // OR it with the first shuffled input.
10655 CommuteVectorShuffleMask(MaskVals, 8);
10656 V2 = getPSHUFB(MaskVals, V2, dl, DAG);
10657 V1 = DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10658 return DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10661 // If BestLoQuad >= 0, generate a pshuflw to put the low elements in order,
10662 // and update MaskVals with new element order.
10663 std::bitset<8> InOrder;
10664 if (BestLoQuad >= 0) {
10665 int MaskV[] = { -1, -1, -1, -1, 4, 5, 6, 7 };
10666 for (int i = 0; i != 4; ++i) {
10667 int idx = MaskVals[i];
10670 } else if ((idx / 4) == BestLoQuad) {
10671 MaskV[i] = idx & 3;
10675 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10678 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10679 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10680 NewV = getTargetShuffleNode(X86ISD::PSHUFLW, dl, MVT::v8i16,
10681 NewV.getOperand(0),
10682 getShufflePSHUFLWImmediate(SVOp), DAG);
10686 // If BestHi >= 0, generate a pshufhw to put the high elements in order,
10687 // and update MaskVals with the new element order.
10688 if (BestHiQuad >= 0) {
10689 int MaskV[] = { 0, 1, 2, 3, -1, -1, -1, -1 };
10690 for (unsigned i = 4; i != 8; ++i) {
10691 int idx = MaskVals[i];
10694 } else if ((idx / 4) == BestHiQuad) {
10695 MaskV[i] = (idx & 3) + 4;
10699 NewV = DAG.getVectorShuffle(MVT::v8i16, dl, NewV, DAG.getUNDEF(MVT::v8i16),
10702 if (NewV.getOpcode() == ISD::VECTOR_SHUFFLE && Subtarget->hasSSE2()) {
10703 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(NewV.getNode());
10704 NewV = getTargetShuffleNode(X86ISD::PSHUFHW, dl, MVT::v8i16,
10705 NewV.getOperand(0),
10706 getShufflePSHUFHWImmediate(SVOp), DAG);
10710 // In case BestHi & BestLo were both -1, which means each quadword has a word
10711 // from each of the four input quadwords, calculate the InOrder bitvector now
10712 // before falling through to the insert/extract cleanup.
10713 if (BestLoQuad == -1 && BestHiQuad == -1) {
10715 for (int i = 0; i != 8; ++i)
10716 if (MaskVals[i] < 0 || MaskVals[i] == i)
10720 // The other elements are put in the right place using pextrw and pinsrw.
10721 for (unsigned i = 0; i != 8; ++i) {
10724 int EltIdx = MaskVals[i];
10727 SDValue ExtOp = (EltIdx < 8) ?
10728 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V1,
10729 DAG.getIntPtrConstant(EltIdx)) :
10730 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, V2,
10731 DAG.getIntPtrConstant(EltIdx - 8));
10732 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, ExtOp,
10733 DAG.getIntPtrConstant(i));
10738 /// \brief v16i16 shuffles
10740 /// FIXME: We only support generation of a single pshufb currently. We can
10741 /// generalize the other applicable cases from LowerVECTOR_SHUFFLEv8i16 as
10742 /// well (e.g 2 x pshufb + 1 x por).
10744 LowerVECTOR_SHUFFLEv16i16(SDValue Op, SelectionDAG &DAG) {
10745 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
10746 SDValue V1 = SVOp->getOperand(0);
10747 SDValue V2 = SVOp->getOperand(1);
10750 if (V2.getOpcode() != ISD::UNDEF)
10753 SmallVector<int, 16> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10754 return getPSHUFB(MaskVals, V1, dl, DAG);
10757 // v16i8 shuffles - Prefer shuffles in the following order:
10758 // 1. [ssse3] 1 x pshufb
10759 // 2. [ssse3] 2 x pshufb + 1 x por
10760 // 3. [all] v8i16 shuffle + N x pextrw + rotate + pinsrw
10761 static SDValue LowerVECTOR_SHUFFLEv16i8(ShuffleVectorSDNode *SVOp,
10762 const X86Subtarget* Subtarget,
10763 SelectionDAG &DAG) {
10764 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
10765 SDValue V1 = SVOp->getOperand(0);
10766 SDValue V2 = SVOp->getOperand(1);
10768 ArrayRef<int> MaskVals = SVOp->getMask();
10770 // Promote splats to a larger type which usually leads to more efficient code.
10771 // FIXME: Is this true if pshufb is available?
10772 if (SVOp->isSplat())
10773 return PromoteSplat(SVOp, DAG);
10775 // If we have SSSE3, case 1 is generated when all result bytes come from
10776 // one of the inputs. Otherwise, case 2 is generated. If no SSSE3 is
10777 // present, fall back to case 3.
10779 // If SSSE3, use 1 pshufb instruction per vector with elements in the result.
10780 if (Subtarget->hasSSSE3()) {
10781 SmallVector<SDValue,16> pshufbMask;
10783 // If all result elements are from one input vector, then only translate
10784 // undef mask values to 0x80 (zero out result) in the pshufb mask.
10786 // Otherwise, we have elements from both input vectors, and must zero out
10787 // elements that come from V2 in the first mask, and V1 in the second mask
10788 // so that we can OR them together.
10789 for (unsigned i = 0; i != 16; ++i) {
10790 int EltIdx = MaskVals[i];
10791 if (EltIdx < 0 || EltIdx >= 16)
10793 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10795 V1 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V1,
10796 DAG.getNode(ISD::BUILD_VECTOR, dl,
10797 MVT::v16i8, pshufbMask));
10799 // As PSHUFB will zero elements with negative indices, it's safe to ignore
10800 // the 2nd operand if it's undefined or zero.
10801 if (V2.getOpcode() == ISD::UNDEF ||
10802 ISD::isBuildVectorAllZeros(V2.getNode()))
10805 // Calculate the shuffle mask for the second input, shuffle it, and
10806 // OR it with the first shuffled input.
10807 pshufbMask.clear();
10808 for (unsigned i = 0; i != 16; ++i) {
10809 int EltIdx = MaskVals[i];
10810 EltIdx = (EltIdx < 16) ? 0x80 : EltIdx - 16;
10811 pshufbMask.push_back(DAG.getConstant(EltIdx, MVT::i8));
10813 V2 = DAG.getNode(X86ISD::PSHUFB, dl, MVT::v16i8, V2,
10814 DAG.getNode(ISD::BUILD_VECTOR, dl,
10815 MVT::v16i8, pshufbMask));
10816 return DAG.getNode(ISD::OR, dl, MVT::v16i8, V1, V2);
10819 // No SSSE3 - Calculate in place words and then fix all out of place words
10820 // With 0-16 extracts & inserts. Worst case is 16 bytes out of order from
10821 // the 16 different words that comprise the two doublequadword input vectors.
10822 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V1);
10823 V2 = DAG.getNode(ISD::BITCAST, dl, MVT::v8i16, V2);
10825 for (int i = 0; i != 8; ++i) {
10826 int Elt0 = MaskVals[i*2];
10827 int Elt1 = MaskVals[i*2+1];
10829 // This word of the result is all undef, skip it.
10830 if (Elt0 < 0 && Elt1 < 0)
10833 // This word of the result is already in the correct place, skip it.
10834 if ((Elt0 == i*2) && (Elt1 == i*2+1))
10837 SDValue Elt0Src = Elt0 < 16 ? V1 : V2;
10838 SDValue Elt1Src = Elt1 < 16 ? V1 : V2;
10841 // If Elt0 and Elt1 are defined, are consecutive, and can be load
10842 // using a single extract together, load it and store it.
10843 if ((Elt0 >= 0) && ((Elt0 + 1) == Elt1) && ((Elt0 & 1) == 0)) {
10844 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10845 DAG.getIntPtrConstant(Elt1 / 2));
10846 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10847 DAG.getIntPtrConstant(i));
10851 // If Elt1 is defined, extract it from the appropriate source. If the
10852 // source byte is not also odd, shift the extracted word left 8 bits
10853 // otherwise clear the bottom 8 bits if we need to do an or.
10855 InsElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16, Elt1Src,
10856 DAG.getIntPtrConstant(Elt1 / 2));
10857 if ((Elt1 & 1) == 0)
10858 InsElt = DAG.getNode(ISD::SHL, dl, MVT::i16, InsElt,
10860 TLI.getShiftAmountTy(InsElt.getValueType())));
10861 else if (Elt0 >= 0)
10862 InsElt = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt,
10863 DAG.getConstant(0xFF00, MVT::i16));
10865 // If Elt0 is defined, extract it from the appropriate source. If the
10866 // source byte is not also even, shift the extracted word right 8 bits. If
10867 // Elt1 was also defined, OR the extracted values together before
10868 // inserting them in the result.
10870 SDValue InsElt0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i16,
10871 Elt0Src, DAG.getIntPtrConstant(Elt0 / 2));
10872 if ((Elt0 & 1) != 0)
10873 InsElt0 = DAG.getNode(ISD::SRL, dl, MVT::i16, InsElt0,
10875 TLI.getShiftAmountTy(InsElt0.getValueType())));
10876 else if (Elt1 >= 0)
10877 InsElt0 = DAG.getNode(ISD::AND, dl, MVT::i16, InsElt0,
10878 DAG.getConstant(0x00FF, MVT::i16));
10879 InsElt = Elt1 >= 0 ? DAG.getNode(ISD::OR, dl, MVT::i16, InsElt, InsElt0)
10882 NewV = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v8i16, NewV, InsElt,
10883 DAG.getIntPtrConstant(i));
10885 return DAG.getNode(ISD::BITCAST, dl, MVT::v16i8, NewV);
10888 // v32i8 shuffles - Translate to VPSHUFB if possible.
10890 SDValue LowerVECTOR_SHUFFLEv32i8(ShuffleVectorSDNode *SVOp,
10891 const X86Subtarget *Subtarget,
10892 SelectionDAG &DAG) {
10893 MVT VT = SVOp->getSimpleValueType(0);
10894 SDValue V1 = SVOp->getOperand(0);
10895 SDValue V2 = SVOp->getOperand(1);
10897 SmallVector<int, 32> MaskVals(SVOp->getMask().begin(), SVOp->getMask().end());
10899 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
10900 bool V1IsAllZero = ISD::isBuildVectorAllZeros(V1.getNode());
10901 bool V2IsAllZero = ISD::isBuildVectorAllZeros(V2.getNode());
10903 // VPSHUFB may be generated if
10904 // (1) one of input vector is undefined or zeroinitializer.
10905 // The mask value 0x80 puts 0 in the corresponding slot of the vector.
10906 // And (2) the mask indexes don't cross the 128-bit lane.
10907 if (VT != MVT::v32i8 || !Subtarget->hasInt256() ||
10908 (!V2IsUndef && !V2IsAllZero && !V1IsAllZero))
10911 if (V1IsAllZero && !V2IsAllZero) {
10912 CommuteVectorShuffleMask(MaskVals, 32);
10915 return getPSHUFB(MaskVals, V1, dl, DAG);
10918 /// RewriteAsNarrowerShuffle - Try rewriting v8i16 and v16i8 shuffles as 4 wide
10919 /// ones, or rewriting v4i32 / v4f32 as 2 wide ones if possible. This can be
10920 /// done when every pair / quad of shuffle mask elements point to elements in
10921 /// the right sequence. e.g.
10922 /// vector_shuffle X, Y, <2, 3, | 10, 11, | 0, 1, | 14, 15>
10924 SDValue RewriteAsNarrowerShuffle(ShuffleVectorSDNode *SVOp,
10925 SelectionDAG &DAG) {
10926 MVT VT = SVOp->getSimpleValueType(0);
10928 unsigned NumElems = VT.getVectorNumElements();
10931 switch (VT.SimpleTy) {
10932 default: llvm_unreachable("Unexpected!");
10935 return SDValue(SVOp, 0);
10936 case MVT::v4f32: NewVT = MVT::v2f64; Scale = 2; break;
10937 case MVT::v4i32: NewVT = MVT::v2i64; Scale = 2; break;
10938 case MVT::v8i16: NewVT = MVT::v4i32; Scale = 2; break;
10939 case MVT::v16i8: NewVT = MVT::v4i32; Scale = 4; break;
10940 case MVT::v16i16: NewVT = MVT::v8i32; Scale = 2; break;
10941 case MVT::v32i8: NewVT = MVT::v8i32; Scale = 4; break;
10944 SmallVector<int, 8> MaskVec;
10945 for (unsigned i = 0; i != NumElems; i += Scale) {
10947 for (unsigned j = 0; j != Scale; ++j) {
10948 int EltIdx = SVOp->getMaskElt(i+j);
10952 StartIdx = (EltIdx / Scale);
10953 if (EltIdx != (int)(StartIdx*Scale + j))
10956 MaskVec.push_back(StartIdx);
10959 SDValue V1 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(0));
10960 SDValue V2 = DAG.getNode(ISD::BITCAST, dl, NewVT, SVOp->getOperand(1));
10961 return DAG.getVectorShuffle(NewVT, dl, V1, V2, &MaskVec[0]);
10964 /// getVZextMovL - Return a zero-extending vector move low node.
10966 static SDValue getVZextMovL(MVT VT, MVT OpVT,
10967 SDValue SrcOp, SelectionDAG &DAG,
10968 const X86Subtarget *Subtarget, SDLoc dl) {
10969 if (VT == MVT::v2f64 || VT == MVT::v4f32) {
10970 LoadSDNode *LD = nullptr;
10971 if (!isScalarLoadToVector(SrcOp.getNode(), &LD))
10972 LD = dyn_cast<LoadSDNode>(SrcOp);
10974 // movssrr and movsdrr do not clear top bits. Try to use movd, movq
10976 MVT ExtVT = (OpVT == MVT::v2f64) ? MVT::i64 : MVT::i32;
10977 if ((ExtVT != MVT::i64 || Subtarget->is64Bit()) &&
10978 SrcOp.getOpcode() == ISD::SCALAR_TO_VECTOR &&
10979 SrcOp.getOperand(0).getOpcode() == ISD::BITCAST &&
10980 SrcOp.getOperand(0).getOperand(0).getValueType() == ExtVT) {
10982 OpVT = (OpVT == MVT::v2f64) ? MVT::v2i64 : MVT::v4i32;
10983 return DAG.getNode(ISD::BITCAST, dl, VT,
10984 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10985 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
10987 SrcOp.getOperand(0)
10993 return DAG.getNode(ISD::BITCAST, dl, VT,
10994 DAG.getNode(X86ISD::VZEXT_MOVL, dl, OpVT,
10995 DAG.getNode(ISD::BITCAST, dl,
10999 /// LowerVECTOR_SHUFFLE_256 - Handle all 256-bit wide vectors shuffles
11000 /// which could not be matched by any known target speficic shuffle
11002 LowerVECTOR_SHUFFLE_256(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
11004 SDValue NewOp = Compact8x32ShuffleNode(SVOp, DAG);
11005 if (NewOp.getNode())
11008 MVT VT = SVOp->getSimpleValueType(0);
11010 unsigned NumElems = VT.getVectorNumElements();
11011 unsigned NumLaneElems = NumElems / 2;
11014 MVT EltVT = VT.getVectorElementType();
11015 MVT NVT = MVT::getVectorVT(EltVT, NumLaneElems);
11018 SmallVector<int, 16> Mask;
11019 for (unsigned l = 0; l < 2; ++l) {
11020 // Build a shuffle mask for the output, discovering on the fly which
11021 // input vectors to use as shuffle operands (recorded in InputUsed).
11022 // If building a suitable shuffle vector proves too hard, then bail
11023 // out with UseBuildVector set.
11024 bool UseBuildVector = false;
11025 int InputUsed[2] = { -1, -1 }; // Not yet discovered.
11026 unsigned LaneStart = l * NumLaneElems;
11027 for (unsigned i = 0; i != NumLaneElems; ++i) {
11028 // The mask element. This indexes into the input.
11029 int Idx = SVOp->getMaskElt(i+LaneStart);
11031 // the mask element does not index into any input vector.
11032 Mask.push_back(-1);
11036 // The input vector this mask element indexes into.
11037 int Input = Idx / NumLaneElems;
11039 // Turn the index into an offset from the start of the input vector.
11040 Idx -= Input * NumLaneElems;
11042 // Find or create a shuffle vector operand to hold this input.
11044 for (OpNo = 0; OpNo < array_lengthof(InputUsed); ++OpNo) {
11045 if (InputUsed[OpNo] == Input)
11046 // This input vector is already an operand.
11048 if (InputUsed[OpNo] < 0) {
11049 // Create a new operand for this input vector.
11050 InputUsed[OpNo] = Input;
11055 if (OpNo >= array_lengthof(InputUsed)) {
11056 // More than two input vectors used! Give up on trying to create a
11057 // shuffle vector. Insert all elements into a BUILD_VECTOR instead.
11058 UseBuildVector = true;
11062 // Add the mask index for the new shuffle vector.
11063 Mask.push_back(Idx + OpNo * NumLaneElems);
11066 if (UseBuildVector) {
11067 SmallVector<SDValue, 16> SVOps;
11068 for (unsigned i = 0; i != NumLaneElems; ++i) {
11069 // The mask element. This indexes into the input.
11070 int Idx = SVOp->getMaskElt(i+LaneStart);
11072 SVOps.push_back(DAG.getUNDEF(EltVT));
11076 // The input vector this mask element indexes into.
11077 int Input = Idx / NumElems;
11079 // Turn the index into an offset from the start of the input vector.
11080 Idx -= Input * NumElems;
11082 // Extract the vector element by hand.
11083 SVOps.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
11084 SVOp->getOperand(Input),
11085 DAG.getIntPtrConstant(Idx)));
11088 // Construct the output using a BUILD_VECTOR.
11089 Output[l] = DAG.getNode(ISD::BUILD_VECTOR, dl, NVT, SVOps);
11090 } else if (InputUsed[0] < 0) {
11091 // No input vectors were used! The result is undefined.
11092 Output[l] = DAG.getUNDEF(NVT);
11094 SDValue Op0 = Extract128BitVector(SVOp->getOperand(InputUsed[0] / 2),
11095 (InputUsed[0] % 2) * NumLaneElems,
11097 // If only one input was used, use an undefined vector for the other.
11098 SDValue Op1 = (InputUsed[1] < 0) ? DAG.getUNDEF(NVT) :
11099 Extract128BitVector(SVOp->getOperand(InputUsed[1] / 2),
11100 (InputUsed[1] % 2) * NumLaneElems, DAG, dl);
11101 // At least one input vector was used. Create a new shuffle vector.
11102 Output[l] = DAG.getVectorShuffle(NVT, dl, Op0, Op1, &Mask[0]);
11108 // Concatenate the result back
11109 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, Output[0], Output[1]);
11112 /// LowerVECTOR_SHUFFLE_128v4 - Handle all 128-bit wide vectors with
11113 /// 4 elements, and match them with several different shuffle types.
11115 LowerVECTOR_SHUFFLE_128v4(ShuffleVectorSDNode *SVOp, SelectionDAG &DAG) {
11116 SDValue V1 = SVOp->getOperand(0);
11117 SDValue V2 = SVOp->getOperand(1);
11119 MVT VT = SVOp->getSimpleValueType(0);
11121 assert(VT.is128BitVector() && "Unsupported vector size");
11123 std::pair<int, int> Locs[4];
11124 int Mask1[] = { -1, -1, -1, -1 };
11125 SmallVector<int, 8> PermMask(SVOp->getMask().begin(), SVOp->getMask().end());
11127 unsigned NumHi = 0;
11128 unsigned NumLo = 0;
11129 for (unsigned i = 0; i != 4; ++i) {
11130 int Idx = PermMask[i];
11132 Locs[i] = std::make_pair(-1, -1);
11134 assert(Idx < 8 && "Invalid VECTOR_SHUFFLE index!");
11136 Locs[i] = std::make_pair(0, NumLo);
11137 Mask1[NumLo] = Idx;
11140 Locs[i] = std::make_pair(1, NumHi);
11142 Mask1[2+NumHi] = Idx;
11148 if (NumLo <= 2 && NumHi <= 2) {
11149 // If no more than two elements come from either vector. This can be
11150 // implemented with two shuffles. First shuffle gather the elements.
11151 // The second shuffle, which takes the first shuffle as both of its
11152 // vector operands, put the elements into the right order.
11153 V1 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11155 int Mask2[] = { -1, -1, -1, -1 };
11157 for (unsigned i = 0; i != 4; ++i)
11158 if (Locs[i].first != -1) {
11159 unsigned Idx = (i < 2) ? 0 : 4;
11160 Idx += Locs[i].first * 2 + Locs[i].second;
11164 return DAG.getVectorShuffle(VT, dl, V1, V1, &Mask2[0]);
11167 if (NumLo == 3 || NumHi == 3) {
11168 // Otherwise, we must have three elements from one vector, call it X, and
11169 // one element from the other, call it Y. First, use a shufps to build an
11170 // intermediate vector with the one element from Y and the element from X
11171 // that will be in the same half in the final destination (the indexes don't
11172 // matter). Then, use a shufps to build the final vector, taking the half
11173 // containing the element from Y from the intermediate, and the other half
11176 // Normalize it so the 3 elements come from V1.
11177 CommuteVectorShuffleMask(PermMask, 4);
11181 // Find the element from V2.
11183 for (HiIndex = 0; HiIndex < 3; ++HiIndex) {
11184 int Val = PermMask[HiIndex];
11191 Mask1[0] = PermMask[HiIndex];
11193 Mask1[2] = PermMask[HiIndex^1];
11195 V2 = DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11197 if (HiIndex >= 2) {
11198 Mask1[0] = PermMask[0];
11199 Mask1[1] = PermMask[1];
11200 Mask1[2] = HiIndex & 1 ? 6 : 4;
11201 Mask1[3] = HiIndex & 1 ? 4 : 6;
11202 return DAG.getVectorShuffle(VT, dl, V1, V2, &Mask1[0]);
11205 Mask1[0] = HiIndex & 1 ? 2 : 0;
11206 Mask1[1] = HiIndex & 1 ? 0 : 2;
11207 Mask1[2] = PermMask[2];
11208 Mask1[3] = PermMask[3];
11213 return DAG.getVectorShuffle(VT, dl, V2, V1, &Mask1[0]);
11216 // Break it into (shuffle shuffle_hi, shuffle_lo).
11217 int LoMask[] = { -1, -1, -1, -1 };
11218 int HiMask[] = { -1, -1, -1, -1 };
11220 int *MaskPtr = LoMask;
11221 unsigned MaskIdx = 0;
11222 unsigned LoIdx = 0;
11223 unsigned HiIdx = 2;
11224 for (unsigned i = 0; i != 4; ++i) {
11231 int Idx = PermMask[i];
11233 Locs[i] = std::make_pair(-1, -1);
11234 } else if (Idx < 4) {
11235 Locs[i] = std::make_pair(MaskIdx, LoIdx);
11236 MaskPtr[LoIdx] = Idx;
11239 Locs[i] = std::make_pair(MaskIdx, HiIdx);
11240 MaskPtr[HiIdx] = Idx;
11245 SDValue LoShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &LoMask[0]);
11246 SDValue HiShuffle = DAG.getVectorShuffle(VT, dl, V1, V2, &HiMask[0]);
11247 int MaskOps[] = { -1, -1, -1, -1 };
11248 for (unsigned i = 0; i != 4; ++i)
11249 if (Locs[i].first != -1)
11250 MaskOps[i] = Locs[i].first * 4 + Locs[i].second;
11251 return DAG.getVectorShuffle(VT, dl, LoShuffle, HiShuffle, &MaskOps[0]);
11254 static bool MayFoldVectorLoad(SDValue V) {
11255 while (V.hasOneUse() && V.getOpcode() == ISD::BITCAST)
11256 V = V.getOperand(0);
11258 if (V.hasOneUse() && V.getOpcode() == ISD::SCALAR_TO_VECTOR)
11259 V = V.getOperand(0);
11260 if (V.hasOneUse() && V.getOpcode() == ISD::BUILD_VECTOR &&
11261 V.getNumOperands() == 2 && V.getOperand(1).getOpcode() == ISD::UNDEF)
11262 // BUILD_VECTOR (load), undef
11263 V = V.getOperand(0);
11265 return MayFoldLoad(V);
11269 SDValue getMOVDDup(SDValue &Op, SDLoc &dl, SDValue V1, SelectionDAG &DAG) {
11270 MVT VT = Op.getSimpleValueType();
11272 // Canonizalize to v2f64.
11273 V1 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, V1);
11274 return DAG.getNode(ISD::BITCAST, dl, VT,
11275 getTargetShuffleNode(X86ISD::MOVDDUP, dl, MVT::v2f64,
11280 SDValue getMOVLowToHigh(SDValue &Op, SDLoc &dl, SelectionDAG &DAG,
11282 SDValue V1 = Op.getOperand(0);
11283 SDValue V2 = Op.getOperand(1);
11284 MVT VT = Op.getSimpleValueType();
11286 assert(VT != MVT::v2i64 && "unsupported shuffle type");
11288 if (HasSSE2 && VT == MVT::v2f64)
11289 return getTargetShuffleNode(X86ISD::MOVLHPD, dl, VT, V1, V2, DAG);
11291 // v4f32 or v4i32: canonizalized to v4f32 (which is legal for SSE1)
11292 return DAG.getNode(ISD::BITCAST, dl, VT,
11293 getTargetShuffleNode(X86ISD::MOVLHPS, dl, MVT::v4f32,
11294 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V1),
11295 DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, V2), DAG));
11299 SDValue getMOVHighToLow(SDValue &Op, SDLoc &dl, SelectionDAG &DAG) {
11300 SDValue V1 = Op.getOperand(0);
11301 SDValue V2 = Op.getOperand(1);
11302 MVT VT = Op.getSimpleValueType();
11304 assert((VT == MVT::v4i32 || VT == MVT::v4f32) &&
11305 "unsupported shuffle type");
11307 if (V2.getOpcode() == ISD::UNDEF)
11311 return getTargetShuffleNode(X86ISD::MOVHLPS, dl, VT, V1, V2, DAG);
11315 SDValue getMOVLP(SDValue &Op, SDLoc &dl, SelectionDAG &DAG, bool HasSSE2) {
11316 SDValue V1 = Op.getOperand(0);
11317 SDValue V2 = Op.getOperand(1);
11318 MVT VT = Op.getSimpleValueType();
11319 unsigned NumElems = VT.getVectorNumElements();
11321 // Use MOVLPS and MOVLPD in case V1 or V2 are loads. During isel, the second
11322 // operand of these instructions is only memory, so check if there's a
11323 // potencial load folding here, otherwise use SHUFPS or MOVSD to match the
11325 bool CanFoldLoad = false;
11327 // Trivial case, when V2 comes from a load.
11328 if (MayFoldVectorLoad(V2))
11329 CanFoldLoad = true;
11331 // When V1 is a load, it can be folded later into a store in isel, example:
11332 // (store (v4f32 (X86Movlps (load addr:$src1), VR128:$src2)), addr:$src1)
11334 // (MOVLPSmr addr:$src1, VR128:$src2)
11335 // So, recognize this potential and also use MOVLPS or MOVLPD
11336 else if (MayFoldVectorLoad(V1) && MayFoldIntoStore(Op))
11337 CanFoldLoad = true;
11339 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11341 if (HasSSE2 && NumElems == 2)
11342 return getTargetShuffleNode(X86ISD::MOVLPD, dl, VT, V1, V2, DAG);
11345 // If we don't care about the second element, proceed to use movss.
11346 if (SVOp->getMaskElt(1) != -1)
11347 return getTargetShuffleNode(X86ISD::MOVLPS, dl, VT, V1, V2, DAG);
11350 // movl and movlp will both match v2i64, but v2i64 is never matched by
11351 // movl earlier because we make it strict to avoid messing with the movlp load
11352 // folding logic (see the code above getMOVLP call). Match it here then,
11353 // this is horrible, but will stay like this until we move all shuffle
11354 // matching to x86 specific nodes. Note that for the 1st condition all
11355 // types are matched with movsd.
11357 // FIXME: isMOVLMask should be checked and matched before getMOVLP,
11358 // as to remove this logic from here, as much as possible
11359 if (NumElems == 2 || !isMOVLMask(SVOp->getMask(), VT))
11360 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11361 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11364 assert(VT != MVT::v4i32 && "unsupported shuffle type");
11366 // Invert the operand order and use SHUFPS to match it.
11367 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V2, V1,
11368 getShuffleSHUFImmediate(SVOp), DAG);
11371 static SDValue NarrowVectorLoadToElement(LoadSDNode *Load, unsigned Index,
11372 SelectionDAG &DAG) {
11374 MVT VT = Load->getSimpleValueType(0);
11375 MVT EVT = VT.getVectorElementType();
11376 SDValue Addr = Load->getOperand(1);
11377 SDValue NewAddr = DAG.getNode(
11378 ISD::ADD, dl, Addr.getSimpleValueType(), Addr,
11379 DAG.getConstant(Index * EVT.getStoreSize(), Addr.getSimpleValueType()));
11382 DAG.getLoad(EVT, dl, Load->getChain(), NewAddr,
11383 DAG.getMachineFunction().getMachineMemOperand(
11384 Load->getMemOperand(), 0, EVT.getStoreSize()));
11388 // It is only safe to call this function if isINSERTPSMask is true for
11389 // this shufflevector mask.
11390 static SDValue getINSERTPS(ShuffleVectorSDNode *SVOp, SDLoc &dl,
11391 SelectionDAG &DAG) {
11392 // Generate an insertps instruction when inserting an f32 from memory onto a
11393 // v4f32 or when copying a member from one v4f32 to another.
11394 // We also use it for transferring i32 from one register to another,
11395 // since it simply copies the same bits.
11396 // If we're transferring an i32 from memory to a specific element in a
11397 // register, we output a generic DAG that will match the PINSRD
11399 MVT VT = SVOp->getSimpleValueType(0);
11400 MVT EVT = VT.getVectorElementType();
11401 SDValue V1 = SVOp->getOperand(0);
11402 SDValue V2 = SVOp->getOperand(1);
11403 auto Mask = SVOp->getMask();
11404 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
11405 "unsupported vector type for insertps/pinsrd");
11407 auto FromV1Predicate = [](const int &i) { return i < 4 && i > -1; };
11408 auto FromV2Predicate = [](const int &i) { return i >= 4; };
11409 int FromV1 = std::count_if(Mask.begin(), Mask.end(), FromV1Predicate);
11413 unsigned DestIndex;
11417 DestIndex = std::find_if(Mask.begin(), Mask.end(), FromV1Predicate) -
11420 // If we have 1 element from each vector, we have to check if we're
11421 // changing V1's element's place. If so, we're done. Otherwise, we
11422 // should assume we're changing V2's element's place and behave
11424 int FromV2 = std::count_if(Mask.begin(), Mask.end(), FromV2Predicate);
11425 assert(DestIndex <= INT32_MAX && "truncated destination index");
11426 if (FromV1 == FromV2 &&
11427 static_cast<int>(DestIndex) == Mask[DestIndex] % 4) {
11431 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11434 assert(std::count_if(Mask.begin(), Mask.end(), FromV2Predicate) == 1 &&
11435 "More than one element from V1 and from V2, or no elements from one "
11436 "of the vectors. This case should not have returned true from "
11441 std::find_if(Mask.begin(), Mask.end(), FromV2Predicate) - Mask.begin();
11444 // Get an index into the source vector in the range [0,4) (the mask is
11445 // in the range [0,8) because it can address V1 and V2)
11446 unsigned SrcIndex = Mask[DestIndex] % 4;
11447 if (MayFoldLoad(From)) {
11448 // Trivial case, when From comes from a load and is only used by the
11449 // shuffle. Make it use insertps from the vector that we need from that
11452 NarrowVectorLoadToElement(cast<LoadSDNode>(From), SrcIndex, DAG);
11453 if (!NewLoad.getNode())
11456 if (EVT == MVT::f32) {
11457 // Create this as a scalar to vector to match the instruction pattern.
11458 SDValue LoadScalarToVector =
11459 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, NewLoad);
11460 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4);
11461 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, LoadScalarToVector,
11463 } else { // EVT == MVT::i32
11464 // If we're getting an i32 from memory, use an INSERT_VECTOR_ELT
11465 // instruction, to match the PINSRD instruction, which loads an i32 to a
11466 // certain vector element.
11467 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VT, To, NewLoad,
11468 DAG.getConstant(DestIndex, MVT::i32));
11472 // Vector-element-to-vector
11473 SDValue InsertpsMask = DAG.getIntPtrConstant(DestIndex << 4 | SrcIndex << 6);
11474 return DAG.getNode(X86ISD::INSERTPS, dl, VT, To, From, InsertpsMask);
11477 // Reduce a vector shuffle to zext.
11478 static SDValue LowerVectorIntExtend(SDValue Op, const X86Subtarget *Subtarget,
11479 SelectionDAG &DAG) {
11480 // PMOVZX is only available from SSE41.
11481 if (!Subtarget->hasSSE41())
11484 MVT VT = Op.getSimpleValueType();
11486 // Only AVX2 support 256-bit vector integer extending.
11487 if (!Subtarget->hasInt256() && VT.is256BitVector())
11490 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11492 SDValue V1 = Op.getOperand(0);
11493 SDValue V2 = Op.getOperand(1);
11494 unsigned NumElems = VT.getVectorNumElements();
11496 // Extending is an unary operation and the element type of the source vector
11497 // won't be equal to or larger than i64.
11498 if (V2.getOpcode() != ISD::UNDEF || !VT.isInteger() ||
11499 VT.getVectorElementType() == MVT::i64)
11502 // Find the expansion ratio, e.g. expanding from i8 to i32 has a ratio of 4.
11503 unsigned Shift = 1; // Start from 2, i.e. 1 << 1.
11504 while ((1U << Shift) < NumElems) {
11505 if (SVOp->getMaskElt(1U << Shift) == 1)
11508 // The maximal ratio is 8, i.e. from i8 to i64.
11513 // Check the shuffle mask.
11514 unsigned Mask = (1U << Shift) - 1;
11515 for (unsigned i = 0; i != NumElems; ++i) {
11516 int EltIdx = SVOp->getMaskElt(i);
11517 if ((i & Mask) != 0 && EltIdx != -1)
11519 if ((i & Mask) == 0 && (unsigned)EltIdx != (i >> Shift))
11523 unsigned NBits = VT.getVectorElementType().getSizeInBits() << Shift;
11524 MVT NeVT = MVT::getIntegerVT(NBits);
11525 MVT NVT = MVT::getVectorVT(NeVT, NumElems >> Shift);
11527 if (!DAG.getTargetLoweringInfo().isTypeLegal(NVT))
11530 // Simplify the operand as it's prepared to be fed into shuffle.
11531 unsigned SignificantBits = NVT.getSizeInBits() >> Shift;
11532 if (V1.getOpcode() == ISD::BITCAST &&
11533 V1.getOperand(0).getOpcode() == ISD::SCALAR_TO_VECTOR &&
11534 V1.getOperand(0).getOperand(0).getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
11535 V1.getOperand(0).getOperand(0)
11536 .getSimpleValueType().getSizeInBits() == SignificantBits) {
11537 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast x)
11538 SDValue V = V1.getOperand(0).getOperand(0).getOperand(0);
11539 ConstantSDNode *CIdx =
11540 dyn_cast<ConstantSDNode>(V1.getOperand(0).getOperand(0).getOperand(1));
11541 // If it's foldable, i.e. normal load with single use, we will let code
11542 // selection to fold it. Otherwise, we will short the conversion sequence.
11543 if (CIdx && CIdx->getZExtValue() == 0 &&
11544 (!ISD::isNormalLoad(V.getNode()) || !V.hasOneUse())) {
11545 MVT FullVT = V.getSimpleValueType();
11546 MVT V1VT = V1.getSimpleValueType();
11547 if (FullVT.getSizeInBits() > V1VT.getSizeInBits()) {
11548 // The "ext_vec_elt" node is wider than the result node.
11549 // In this case we should extract subvector from V.
11550 // (bitcast (sclr2vec (ext_vec_elt x))) -> (bitcast (extract_subvector x)).
11551 unsigned Ratio = FullVT.getSizeInBits() / V1VT.getSizeInBits();
11552 MVT SubVecVT = MVT::getVectorVT(FullVT.getVectorElementType(),
11553 FullVT.getVectorNumElements()/Ratio);
11554 V = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, SubVecVT, V,
11555 DAG.getIntPtrConstant(0));
11557 V1 = DAG.getNode(ISD::BITCAST, DL, V1VT, V);
11561 return DAG.getNode(ISD::BITCAST, DL, VT,
11562 DAG.getNode(X86ISD::VZEXT, DL, NVT, V1));
11565 static SDValue NormalizeVectorShuffle(SDValue Op, const X86Subtarget *Subtarget,
11566 SelectionDAG &DAG) {
11567 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11568 MVT VT = Op.getSimpleValueType();
11570 SDValue V1 = Op.getOperand(0);
11571 SDValue V2 = Op.getOperand(1);
11573 if (isZeroShuffle(SVOp))
11574 return getZeroVector(VT, Subtarget, DAG, dl);
11576 // Handle splat operations
11577 if (SVOp->isSplat()) {
11578 // Use vbroadcast whenever the splat comes from a foldable load
11579 SDValue Broadcast = LowerVectorBroadcast(Op, Subtarget, DAG);
11580 if (Broadcast.getNode())
11584 // Check integer expanding shuffles.
11585 SDValue NewOp = LowerVectorIntExtend(Op, Subtarget, DAG);
11586 if (NewOp.getNode())
11589 // If the shuffle can be profitably rewritten as a narrower shuffle, then
11591 if (VT == MVT::v8i16 || VT == MVT::v16i8 || VT == MVT::v16i16 ||
11592 VT == MVT::v32i8) {
11593 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11594 if (NewOp.getNode())
11595 return DAG.getNode(ISD::BITCAST, dl, VT, NewOp);
11596 } else if (VT.is128BitVector() && Subtarget->hasSSE2()) {
11597 // FIXME: Figure out a cleaner way to do this.
11598 if (ISD::isBuildVectorAllZeros(V2.getNode())) {
11599 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11600 if (NewOp.getNode()) {
11601 MVT NewVT = NewOp.getSimpleValueType();
11602 if (isCommutedMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(),
11603 NewVT, true, false))
11604 return getVZextMovL(VT, NewVT, NewOp.getOperand(0), DAG, Subtarget,
11607 } else if (ISD::isBuildVectorAllZeros(V1.getNode())) {
11608 SDValue NewOp = RewriteAsNarrowerShuffle(SVOp, DAG);
11609 if (NewOp.getNode()) {
11610 MVT NewVT = NewOp.getSimpleValueType();
11611 if (isMOVLMask(cast<ShuffleVectorSDNode>(NewOp)->getMask(), NewVT))
11612 return getVZextMovL(VT, NewVT, NewOp.getOperand(1), DAG, Subtarget,
11621 X86TargetLowering::LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) const {
11622 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Op);
11623 SDValue V1 = Op.getOperand(0);
11624 SDValue V2 = Op.getOperand(1);
11625 MVT VT = Op.getSimpleValueType();
11627 unsigned NumElems = VT.getVectorNumElements();
11628 bool V1IsUndef = V1.getOpcode() == ISD::UNDEF;
11629 bool V2IsUndef = V2.getOpcode() == ISD::UNDEF;
11630 bool V1IsSplat = false;
11631 bool V2IsSplat = false;
11632 bool HasSSE2 = Subtarget->hasSSE2();
11633 bool HasFp256 = Subtarget->hasFp256();
11634 bool HasInt256 = Subtarget->hasInt256();
11635 MachineFunction &MF = DAG.getMachineFunction();
11636 bool OptForSize = MF.getFunction()->getAttributes().
11637 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
11639 // Check if we should use the experimental vector shuffle lowering. If so,
11640 // delegate completely to that code path.
11641 if (ExperimentalVectorShuffleLowering)
11642 return lowerVectorShuffle(Op, Subtarget, DAG);
11644 assert(VT.getSizeInBits() != 64 && "Can't lower MMX shuffles");
11646 if (V1IsUndef && V2IsUndef)
11647 return DAG.getUNDEF(VT);
11649 // When we create a shuffle node we put the UNDEF node to second operand,
11650 // but in some cases the first operand may be transformed to UNDEF.
11651 // In this case we should just commute the node.
11653 return DAG.getCommutedVectorShuffle(*SVOp);
11655 // Vector shuffle lowering takes 3 steps:
11657 // 1) Normalize the input vectors. Here splats, zeroed vectors, profitable
11658 // narrowing and commutation of operands should be handled.
11659 // 2) Matching of shuffles with known shuffle masks to x86 target specific
11661 // 3) Rewriting of unmatched masks into new generic shuffle operations,
11662 // so the shuffle can be broken into other shuffles and the legalizer can
11663 // try the lowering again.
11665 // The general idea is that no vector_shuffle operation should be left to
11666 // be matched during isel, all of them must be converted to a target specific
11669 // Normalize the input vectors. Here splats, zeroed vectors, profitable
11670 // narrowing and commutation of operands should be handled. The actual code
11671 // doesn't include all of those, work in progress...
11672 SDValue NewOp = NormalizeVectorShuffle(Op, Subtarget, DAG);
11673 if (NewOp.getNode())
11676 SmallVector<int, 8> M(SVOp->getMask().begin(), SVOp->getMask().end());
11678 // NOTE: isPSHUFDMask can also match both masks below (unpckl_undef and
11679 // unpckh_undef). Only use pshufd if speed is more important than size.
11680 if (OptForSize && isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11681 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11682 if (OptForSize && isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11683 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11685 if (isMOVDDUPMask(M, VT) && Subtarget->hasSSE3() &&
11686 V2IsUndef && MayFoldVectorLoad(V1))
11687 return getMOVDDup(Op, dl, V1, DAG);
11689 if (isMOVHLPS_v_undef_Mask(M, VT))
11690 return getMOVHighToLow(Op, dl, DAG);
11692 // Use to match splats
11693 if (HasSSE2 && isUNPCKHMask(M, VT, HasInt256) && V2IsUndef &&
11694 (VT == MVT::v2f64 || VT == MVT::v2i64))
11695 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11697 if (isPSHUFDMask(M, VT)) {
11698 // The actual implementation will match the mask in the if above and then
11699 // during isel it can match several different instructions, not only pshufd
11700 // as its name says, sad but true, emulate the behavior for now...
11701 if (isMOVDDUPMask(M, VT) && ((VT == MVT::v4f32 || VT == MVT::v2i64)))
11702 return getTargetShuffleNode(X86ISD::MOVLHPS, dl, VT, V1, V1, DAG);
11704 unsigned TargetMask = getShuffleSHUFImmediate(SVOp);
11706 if (HasSSE2 && (VT == MVT::v4f32 || VT == MVT::v4i32))
11707 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1, TargetMask, DAG);
11709 if (HasFp256 && (VT == MVT::v4f32 || VT == MVT::v2f64))
11710 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1, TargetMask,
11713 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V1,
11717 if (isPALIGNRMask(M, VT, Subtarget))
11718 return getTargetShuffleNode(X86ISD::PALIGNR, dl, VT, V1, V2,
11719 getShufflePALIGNRImmediate(SVOp),
11722 if (isVALIGNMask(M, VT, Subtarget))
11723 return getTargetShuffleNode(X86ISD::VALIGN, dl, VT, V1, V2,
11724 getShuffleVALIGNImmediate(SVOp),
11727 // Check if this can be converted into a logical shift.
11728 bool isLeft = false;
11729 unsigned ShAmt = 0;
11731 bool isShift = HasSSE2 && isVectorShift(SVOp, DAG, isLeft, ShVal, ShAmt);
11732 if (isShift && ShVal.hasOneUse()) {
11733 // If the shifted value has multiple uses, it may be cheaper to use
11734 // v_set0 + movlhps or movhlps, etc.
11735 MVT EltVT = VT.getVectorElementType();
11736 ShAmt *= EltVT.getSizeInBits();
11737 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11740 if (isMOVLMask(M, VT)) {
11741 if (ISD::isBuildVectorAllZeros(V1.getNode()))
11742 return getVZextMovL(VT, VT, V2, DAG, Subtarget, dl);
11743 if (!isMOVLPMask(M, VT)) {
11744 if (HasSSE2 && (VT == MVT::v2i64 || VT == MVT::v2f64))
11745 return getTargetShuffleNode(X86ISD::MOVSD, dl, VT, V1, V2, DAG);
11747 if (VT == MVT::v4i32 || VT == MVT::v4f32)
11748 return getTargetShuffleNode(X86ISD::MOVSS, dl, VT, V1, V2, DAG);
11752 // FIXME: fold these into legal mask.
11753 if (isMOVLHPSMask(M, VT) && !isUNPCKLMask(M, VT, HasInt256))
11754 return getMOVLowToHigh(Op, dl, DAG, HasSSE2);
11756 if (isMOVHLPSMask(M, VT))
11757 return getMOVHighToLow(Op, dl, DAG);
11759 if (V2IsUndef && isMOVSHDUPMask(M, VT, Subtarget))
11760 return getTargetShuffleNode(X86ISD::MOVSHDUP, dl, VT, V1, DAG);
11762 if (V2IsUndef && isMOVSLDUPMask(M, VT, Subtarget))
11763 return getTargetShuffleNode(X86ISD::MOVSLDUP, dl, VT, V1, DAG);
11765 if (isMOVLPMask(M, VT))
11766 return getMOVLP(Op, dl, DAG, HasSSE2);
11768 if (ShouldXformToMOVHLPS(M, VT) ||
11769 ShouldXformToMOVLP(V1.getNode(), V2.getNode(), M, VT))
11770 return DAG.getCommutedVectorShuffle(*SVOp);
11773 // No better options. Use a vshldq / vsrldq.
11774 MVT EltVT = VT.getVectorElementType();
11775 ShAmt *= EltVT.getSizeInBits();
11776 return getVShift(isLeft, VT, ShVal, ShAmt, DAG, *this, dl);
11779 bool Commuted = false;
11780 // FIXME: This should also accept a bitcast of a splat? Be careful, not
11781 // 1,1,1,1 -> v8i16 though.
11782 BitVector UndefElements;
11783 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V1.getNode()))
11784 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11786 if (auto *BVOp = dyn_cast<BuildVectorSDNode>(V2.getNode()))
11787 if (BVOp->getConstantSplatNode(&UndefElements) && UndefElements.none())
11790 // Canonicalize the splat or undef, if present, to be on the RHS.
11791 if (!V2IsUndef && V1IsSplat && !V2IsSplat) {
11792 CommuteVectorShuffleMask(M, NumElems);
11794 std::swap(V1IsSplat, V2IsSplat);
11798 if (isCommutedMOVLMask(M, VT, V2IsSplat, V2IsUndef)) {
11799 // Shuffling low element of v1 into undef, just return v1.
11802 // If V2 is a splat, the mask may be malformed such as <4,3,3,3>, which
11803 // the instruction selector will not match, so get a canonical MOVL with
11804 // swapped operands to undo the commute.
11805 return getMOVL(DAG, dl, VT, V2, V1);
11808 if (isUNPCKLMask(M, VT, HasInt256))
11809 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11811 if (isUNPCKHMask(M, VT, HasInt256))
11812 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11815 // Normalize mask so all entries that point to V2 points to its first
11816 // element then try to match unpck{h|l} again. If match, return a
11817 // new vector_shuffle with the corrected mask.p
11818 SmallVector<int, 8> NewMask(M.begin(), M.end());
11819 NormalizeMask(NewMask, NumElems);
11820 if (isUNPCKLMask(NewMask, VT, HasInt256, true))
11821 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11822 if (isUNPCKHMask(NewMask, VT, HasInt256, true))
11823 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11827 // Commute is back and try unpck* again.
11828 // FIXME: this seems wrong.
11829 CommuteVectorShuffleMask(M, NumElems);
11831 std::swap(V1IsSplat, V2IsSplat);
11833 if (isUNPCKLMask(M, VT, HasInt256))
11834 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V2, DAG);
11836 if (isUNPCKHMask(M, VT, HasInt256))
11837 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V2, DAG);
11840 // Normalize the node to match x86 shuffle ops if needed
11841 if (!V2IsUndef && (isSHUFPMask(M, VT, /* Commuted */ true)))
11842 return DAG.getCommutedVectorShuffle(*SVOp);
11844 // The checks below are all present in isShuffleMaskLegal, but they are
11845 // inlined here right now to enable us to directly emit target specific
11846 // nodes, and remove one by one until they don't return Op anymore.
11848 if (ShuffleVectorSDNode::isSplatMask(&M[0], VT) &&
11849 SVOp->getSplatIndex() == 0 && V2IsUndef) {
11850 if (VT == MVT::v2f64 || VT == MVT::v2i64)
11851 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11854 if (isPSHUFHWMask(M, VT, HasInt256))
11855 return getTargetShuffleNode(X86ISD::PSHUFHW, dl, VT, V1,
11856 getShufflePSHUFHWImmediate(SVOp),
11859 if (isPSHUFLWMask(M, VT, HasInt256))
11860 return getTargetShuffleNode(X86ISD::PSHUFLW, dl, VT, V1,
11861 getShufflePSHUFLWImmediate(SVOp),
11864 unsigned MaskValue;
11865 if (isBlendMask(M, VT, Subtarget->hasSSE41(), Subtarget->hasInt256(),
11867 return LowerVECTOR_SHUFFLEtoBlend(SVOp, MaskValue, Subtarget, DAG);
11869 if (isSHUFPMask(M, VT))
11870 return getTargetShuffleNode(X86ISD::SHUFP, dl, VT, V1, V2,
11871 getShuffleSHUFImmediate(SVOp), DAG);
11873 if (isUNPCKL_v_undef_Mask(M, VT, HasInt256))
11874 return getTargetShuffleNode(X86ISD::UNPCKL, dl, VT, V1, V1, DAG);
11875 if (isUNPCKH_v_undef_Mask(M, VT, HasInt256))
11876 return getTargetShuffleNode(X86ISD::UNPCKH, dl, VT, V1, V1, DAG);
11878 //===--------------------------------------------------------------------===//
11879 // Generate target specific nodes for 128 or 256-bit shuffles only
11880 // supported in the AVX instruction set.
11883 // Handle VMOVDDUPY permutations
11884 if (V2IsUndef && isMOVDDUPYMask(M, VT, HasFp256))
11885 return getTargetShuffleNode(X86ISD::MOVDDUP, dl, VT, V1, DAG);
11887 // Handle VPERMILPS/D* permutations
11888 if (isVPERMILPMask(M, VT)) {
11889 if ((HasInt256 && VT == MVT::v8i32) || VT == MVT::v16i32)
11890 return getTargetShuffleNode(X86ISD::PSHUFD, dl, VT, V1,
11891 getShuffleSHUFImmediate(SVOp), DAG);
11892 return getTargetShuffleNode(X86ISD::VPERMILPI, dl, VT, V1,
11893 getShuffleSHUFImmediate(SVOp), DAG);
11897 if (VT.is512BitVector() && isINSERT64x4Mask(M, VT, &Idx))
11898 return Insert256BitVector(V1, Extract256BitVector(V2, 0, DAG, dl),
11899 Idx*(NumElems/2), DAG, dl);
11901 // Handle VPERM2F128/VPERM2I128 permutations
11902 if (isVPERM2X128Mask(M, VT, HasFp256))
11903 return getTargetShuffleNode(X86ISD::VPERM2X128, dl, VT, V1,
11904 V2, getShuffleVPERM2X128Immediate(SVOp), DAG);
11906 if (Subtarget->hasSSE41() && isINSERTPSMask(M, VT))
11907 return getINSERTPS(SVOp, dl, DAG);
11910 if (V2IsUndef && HasInt256 && isPermImmMask(M, VT, Imm8))
11911 return getTargetShuffleNode(X86ISD::VPERMI, dl, VT, V1, Imm8, DAG);
11913 if ((V2IsUndef && HasInt256 && VT.is256BitVector() && NumElems == 8) ||
11914 VT.is512BitVector()) {
11915 MVT MaskEltVT = MVT::getIntegerVT(VT.getVectorElementType().getSizeInBits());
11916 MVT MaskVectorVT = MVT::getVectorVT(MaskEltVT, NumElems);
11917 SmallVector<SDValue, 16> permclMask;
11918 for (unsigned i = 0; i != NumElems; ++i) {
11919 permclMask.push_back(DAG.getConstant((M[i]>=0) ? M[i] : 0, MaskEltVT));
11922 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, MaskVectorVT, permclMask);
11924 // Bitcast is for VPERMPS since mask is v8i32 but node takes v8f32
11925 return DAG.getNode(X86ISD::VPERMV, dl, VT,
11926 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V1);
11927 return DAG.getNode(X86ISD::VPERMV3, dl, VT, V1,
11928 DAG.getNode(ISD::BITCAST, dl, VT, Mask), V2);
11931 //===--------------------------------------------------------------------===//
11932 // Since no target specific shuffle was selected for this generic one,
11933 // lower it into other known shuffles. FIXME: this isn't true yet, but
11934 // this is the plan.
11937 // Handle v8i16 specifically since SSE can do byte extraction and insertion.
11938 if (VT == MVT::v8i16) {
11939 SDValue NewOp = LowerVECTOR_SHUFFLEv8i16(Op, Subtarget, DAG);
11940 if (NewOp.getNode())
11944 if (VT == MVT::v16i16 && Subtarget->hasInt256()) {
11945 SDValue NewOp = LowerVECTOR_SHUFFLEv16i16(Op, DAG);
11946 if (NewOp.getNode())
11950 if (VT == MVT::v16i8) {
11951 SDValue NewOp = LowerVECTOR_SHUFFLEv16i8(SVOp, Subtarget, DAG);
11952 if (NewOp.getNode())
11956 if (VT == MVT::v32i8) {
11957 SDValue NewOp = LowerVECTOR_SHUFFLEv32i8(SVOp, Subtarget, DAG);
11958 if (NewOp.getNode())
11962 // Handle all 128-bit wide vectors with 4 elements, and match them with
11963 // several different shuffle types.
11964 if (NumElems == 4 && VT.is128BitVector())
11965 return LowerVECTOR_SHUFFLE_128v4(SVOp, DAG);
11967 // Handle general 256-bit shuffles
11968 if (VT.is256BitVector())
11969 return LowerVECTOR_SHUFFLE_256(SVOp, DAG);
11974 // This function assumes its argument is a BUILD_VECTOR of constants or
11975 // undef SDNodes. i.e: ISD::isBuildVectorOfConstantSDNodes(BuildVector) is
11977 static bool BUILD_VECTORtoBlendMask(BuildVectorSDNode *BuildVector,
11978 unsigned &MaskValue) {
11980 unsigned NumElems = BuildVector->getNumOperands();
11981 // There are 2 lanes if (NumElems > 8), and 1 lane otherwise.
11982 unsigned NumLanes = (NumElems - 1) / 8 + 1;
11983 unsigned NumElemsInLane = NumElems / NumLanes;
11985 // Blend for v16i16 should be symetric for the both lanes.
11986 for (unsigned i = 0; i < NumElemsInLane; ++i) {
11987 SDValue EltCond = BuildVector->getOperand(i);
11988 SDValue SndLaneEltCond =
11989 (NumLanes == 2) ? BuildVector->getOperand(i + NumElemsInLane) : EltCond;
11991 int Lane1Cond = -1, Lane2Cond = -1;
11992 if (isa<ConstantSDNode>(EltCond))
11993 Lane1Cond = !isZero(EltCond);
11994 if (isa<ConstantSDNode>(SndLaneEltCond))
11995 Lane2Cond = !isZero(SndLaneEltCond);
11997 if (Lane1Cond == Lane2Cond || Lane2Cond < 0)
11998 // Lane1Cond != 0, means we want the first argument.
11999 // Lane1Cond == 0, means we want the second argument.
12000 // The encoding of this argument is 0 for the first argument, 1
12001 // for the second. Therefore, invert the condition.
12002 MaskValue |= !Lane1Cond << i;
12003 else if (Lane1Cond < 0)
12004 MaskValue |= !Lane2Cond << i;
12011 /// \brief Try to lower a VSELECT instruction to an immediate-controlled blend
12013 static SDValue lowerVSELECTtoBLENDI(SDValue Op, const X86Subtarget *Subtarget,
12014 SelectionDAG &DAG) {
12015 SDValue Cond = Op.getOperand(0);
12016 SDValue LHS = Op.getOperand(1);
12017 SDValue RHS = Op.getOperand(2);
12019 MVT VT = Op.getSimpleValueType();
12020 MVT EltVT = VT.getVectorElementType();
12021 unsigned NumElems = VT.getVectorNumElements();
12023 // There is no blend with immediate in AVX-512.
12024 if (VT.is512BitVector())
12027 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
12029 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
12032 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
12035 // Check the mask for BLEND and build the value.
12036 unsigned MaskValue = 0;
12037 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
12040 // Convert i32 vectors to floating point if it is not AVX2.
12041 // AVX2 introduced VPBLENDD instruction for 128 and 256-bit vectors.
12043 if (EltVT == MVT::i64 || (EltVT == MVT::i32 && !Subtarget->hasInt256())) {
12044 BlendVT = MVT::getVectorVT(MVT::getFloatingPointVT(EltVT.getSizeInBits()),
12046 LHS = DAG.getNode(ISD::BITCAST, dl, VT, LHS);
12047 RHS = DAG.getNode(ISD::BITCAST, dl, VT, RHS);
12050 SDValue Ret = DAG.getNode(X86ISD::BLENDI, dl, BlendVT, LHS, RHS,
12051 DAG.getConstant(MaskValue, MVT::i32));
12052 return DAG.getNode(ISD::BITCAST, dl, VT, Ret);
12055 SDValue X86TargetLowering::LowerVSELECT(SDValue Op, SelectionDAG &DAG) const {
12056 // A vselect where all conditions and data are constants can be optimized into
12057 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
12058 if (ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(0).getNode()) &&
12059 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(1).getNode()) &&
12060 ISD::isBuildVectorOfConstantSDNodes(Op.getOperand(2).getNode()))
12063 SDValue BlendOp = lowerVSELECTtoBLENDI(Op, Subtarget, DAG);
12064 if (BlendOp.getNode())
12067 // Some types for vselect were previously set to Expand, not Legal or
12068 // Custom. Return an empty SDValue so we fall-through to Expand, after
12069 // the Custom lowering phase.
12070 MVT VT = Op.getSimpleValueType();
12071 switch (VT.SimpleTy) {
12076 if (Subtarget->hasBWI() && Subtarget->hasVLX())
12081 // We couldn't create a "Blend with immediate" node.
12082 // This node should still be legal, but we'll have to emit a blendv*
12087 static SDValue LowerEXTRACT_VECTOR_ELT_SSE4(SDValue Op, SelectionDAG &DAG) {
12088 MVT VT = Op.getSimpleValueType();
12091 if (!Op.getOperand(0).getSimpleValueType().is128BitVector())
12094 if (VT.getSizeInBits() == 8) {
12095 SDValue Extract = DAG.getNode(X86ISD::PEXTRB, dl, MVT::i32,
12096 Op.getOperand(0), Op.getOperand(1));
12097 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12098 DAG.getValueType(VT));
12099 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12102 if (VT.getSizeInBits() == 16) {
12103 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12104 // If Idx is 0, it's cheaper to do a move instead of a pextrw.
12106 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12107 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12108 DAG.getNode(ISD::BITCAST, dl,
12111 Op.getOperand(1)));
12112 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, MVT::i32,
12113 Op.getOperand(0), Op.getOperand(1));
12114 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, MVT::i32, Extract,
12115 DAG.getValueType(VT));
12116 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12119 if (VT == MVT::f32) {
12120 // EXTRACTPS outputs to a GPR32 register which will require a movd to copy
12121 // the result back to FR32 register. It's only worth matching if the
12122 // result has a single use which is a store or a bitcast to i32. And in
12123 // the case of a store, it's not worth it if the index is a constant 0,
12124 // because a MOVSSmr can be used instead, which is smaller and faster.
12125 if (!Op.hasOneUse())
12127 SDNode *User = *Op.getNode()->use_begin();
12128 if ((User->getOpcode() != ISD::STORE ||
12129 (isa<ConstantSDNode>(Op.getOperand(1)) &&
12130 cast<ConstantSDNode>(Op.getOperand(1))->isNullValue())) &&
12131 (User->getOpcode() != ISD::BITCAST ||
12132 User->getValueType(0) != MVT::i32))
12134 SDValue Extract = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12135 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32,
12138 return DAG.getNode(ISD::BITCAST, dl, MVT::f32, Extract);
12141 if (VT == MVT::i32 || VT == MVT::i64) {
12142 // ExtractPS/pextrq works with constant index.
12143 if (isa<ConstantSDNode>(Op.getOperand(1)))
12149 /// Extract one bit from mask vector, like v16i1 or v8i1.
12150 /// AVX-512 feature.
12152 X86TargetLowering::ExtractBitFromMaskVector(SDValue Op, SelectionDAG &DAG) const {
12153 SDValue Vec = Op.getOperand(0);
12155 MVT VecVT = Vec.getSimpleValueType();
12156 SDValue Idx = Op.getOperand(1);
12157 MVT EltVT = Op.getSimpleValueType();
12159 assert((EltVT == MVT::i1) && "Unexpected operands in ExtractBitFromMaskVector");
12161 // variable index can't be handled in mask registers,
12162 // extend vector to VR512
12163 if (!isa<ConstantSDNode>(Idx)) {
12164 MVT ExtVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12165 SDValue Ext = DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVT, Vec);
12166 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
12167 ExtVT.getVectorElementType(), Ext, Idx);
12168 return DAG.getNode(ISD::TRUNCATE, dl, EltVT, Elt);
12171 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12172 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12173 unsigned MaxSift = rc->getSize()*8 - 1;
12174 Vec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, Vec,
12175 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12176 Vec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, Vec,
12177 DAG.getConstant(MaxSift, MVT::i8));
12178 return DAG.getNode(X86ISD::VEXTRACT, dl, MVT::i1, Vec,
12179 DAG.getIntPtrConstant(0));
12183 X86TargetLowering::LowerEXTRACT_VECTOR_ELT(SDValue Op,
12184 SelectionDAG &DAG) const {
12186 SDValue Vec = Op.getOperand(0);
12187 MVT VecVT = Vec.getSimpleValueType();
12188 SDValue Idx = Op.getOperand(1);
12190 if (Op.getSimpleValueType() == MVT::i1)
12191 return ExtractBitFromMaskVector(Op, DAG);
12193 if (!isa<ConstantSDNode>(Idx)) {
12194 if (VecVT.is512BitVector() ||
12195 (VecVT.is256BitVector() && Subtarget->hasInt256() &&
12196 VecVT.getVectorElementType().getSizeInBits() == 32)) {
12199 MVT::getIntegerVT(VecVT.getVectorElementType().getSizeInBits());
12200 MVT MaskVT = MVT::getVectorVT(MaskEltVT, VecVT.getSizeInBits() /
12201 MaskEltVT.getSizeInBits());
12203 Idx = DAG.getZExtOrTrunc(Idx, dl, MaskEltVT);
12204 SDValue Mask = DAG.getNode(X86ISD::VINSERT, dl, MaskVT,
12205 getZeroVector(MaskVT, Subtarget, DAG, dl),
12206 Idx, DAG.getConstant(0, getPointerTy()));
12207 SDValue Perm = DAG.getNode(X86ISD::VPERMV, dl, VecVT, Mask, Vec);
12208 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(),
12209 Perm, DAG.getConstant(0, getPointerTy()));
12214 // If this is a 256-bit vector result, first extract the 128-bit vector and
12215 // then extract the element from the 128-bit vector.
12216 if (VecVT.is256BitVector() || VecVT.is512BitVector()) {
12218 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12219 // Get the 128-bit vector.
12220 Vec = Extract128BitVector(Vec, IdxVal, DAG, dl);
12221 MVT EltVT = VecVT.getVectorElementType();
12223 unsigned ElemsPerChunk = 128 / EltVT.getSizeInBits();
12225 //if (IdxVal >= NumElems/2)
12226 // IdxVal -= NumElems/2;
12227 IdxVal -= (IdxVal/ElemsPerChunk)*ElemsPerChunk;
12228 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, Op.getValueType(), Vec,
12229 DAG.getConstant(IdxVal, MVT::i32));
12232 assert(VecVT.is128BitVector() && "Unexpected vector length");
12234 if (Subtarget->hasSSE41()) {
12235 SDValue Res = LowerEXTRACT_VECTOR_ELT_SSE4(Op, DAG);
12240 MVT VT = Op.getSimpleValueType();
12241 // TODO: handle v16i8.
12242 if (VT.getSizeInBits() == 16) {
12243 SDValue Vec = Op.getOperand(0);
12244 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12246 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i16,
12247 DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::i32,
12248 DAG.getNode(ISD::BITCAST, dl,
12250 Op.getOperand(1)));
12251 // Transform it so it match pextrw which produces a 32-bit result.
12252 MVT EltVT = MVT::i32;
12253 SDValue Extract = DAG.getNode(X86ISD::PEXTRW, dl, EltVT,
12254 Op.getOperand(0), Op.getOperand(1));
12255 SDValue Assert = DAG.getNode(ISD::AssertZext, dl, EltVT, Extract,
12256 DAG.getValueType(VT));
12257 return DAG.getNode(ISD::TRUNCATE, dl, VT, Assert);
12260 if (VT.getSizeInBits() == 32) {
12261 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12265 // SHUFPS the element to the lowest double word, then movss.
12266 int Mask[4] = { static_cast<int>(Idx), -1, -1, -1 };
12267 MVT VVT = Op.getOperand(0).getSimpleValueType();
12268 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12269 DAG.getUNDEF(VVT), Mask);
12270 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12271 DAG.getIntPtrConstant(0));
12274 if (VT.getSizeInBits() == 64) {
12275 // FIXME: .td only matches this for <2 x f64>, not <2 x i64> on 32b
12276 // FIXME: seems like this should be unnecessary if mov{h,l}pd were taught
12277 // to match extract_elt for f64.
12278 unsigned Idx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
12282 // UNPCKHPD the element to the lowest double word, then movsd.
12283 // Note if the lower 64 bits of the result of the UNPCKHPD is then stored
12284 // to a f64mem, the whole operation is folded into a single MOVHPDmr.
12285 int Mask[2] = { 1, -1 };
12286 MVT VVT = Op.getOperand(0).getSimpleValueType();
12287 SDValue Vec = DAG.getVectorShuffle(VVT, dl, Op.getOperand(0),
12288 DAG.getUNDEF(VVT), Mask);
12289 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, VT, Vec,
12290 DAG.getIntPtrConstant(0));
12296 /// Insert one bit to mask vector, like v16i1 or v8i1.
12297 /// AVX-512 feature.
12299 X86TargetLowering::InsertBitToMaskVector(SDValue Op, SelectionDAG &DAG) const {
12301 SDValue Vec = Op.getOperand(0);
12302 SDValue Elt = Op.getOperand(1);
12303 SDValue Idx = Op.getOperand(2);
12304 MVT VecVT = Vec.getSimpleValueType();
12306 if (!isa<ConstantSDNode>(Idx)) {
12307 // Non constant index. Extend source and destination,
12308 // insert element and then truncate the result.
12309 MVT ExtVecVT = (VecVT == MVT::v8i1 ? MVT::v8i64 : MVT::v16i32);
12310 MVT ExtEltVT = (VecVT == MVT::v8i1 ? MVT::i64 : MVT::i32);
12311 SDValue ExtOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, ExtVecVT,
12312 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtVecVT, Vec),
12313 DAG.getNode(ISD::ZERO_EXTEND, dl, ExtEltVT, Elt), Idx);
12314 return DAG.getNode(ISD::TRUNCATE, dl, VecVT, ExtOp);
12317 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12318 SDValue EltInVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecVT, Elt);
12319 if (Vec.getOpcode() == ISD::UNDEF)
12320 return DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12321 DAG.getConstant(IdxVal, MVT::i8));
12322 const TargetRegisterClass* rc = getRegClassFor(VecVT);
12323 unsigned MaxSift = rc->getSize()*8 - 1;
12324 EltInVec = DAG.getNode(X86ISD::VSHLI, dl, VecVT, EltInVec,
12325 DAG.getConstant(MaxSift, MVT::i8));
12326 EltInVec = DAG.getNode(X86ISD::VSRLI, dl, VecVT, EltInVec,
12327 DAG.getConstant(MaxSift - IdxVal, MVT::i8));
12328 return DAG.getNode(ISD::OR, dl, VecVT, Vec, EltInVec);
12331 SDValue X86TargetLowering::LowerINSERT_VECTOR_ELT(SDValue Op,
12332 SelectionDAG &DAG) const {
12333 MVT VT = Op.getSimpleValueType();
12334 MVT EltVT = VT.getVectorElementType();
12336 if (EltVT == MVT::i1)
12337 return InsertBitToMaskVector(Op, DAG);
12340 SDValue N0 = Op.getOperand(0);
12341 SDValue N1 = Op.getOperand(1);
12342 SDValue N2 = Op.getOperand(2);
12343 if (!isa<ConstantSDNode>(N2))
12345 auto *N2C = cast<ConstantSDNode>(N2);
12346 unsigned IdxVal = N2C->getZExtValue();
12348 // If the vector is wider than 128 bits, extract the 128-bit subvector, insert
12349 // into that, and then insert the subvector back into the result.
12350 if (VT.is256BitVector() || VT.is512BitVector()) {
12351 // Get the desired 128-bit vector half.
12352 SDValue V = Extract128BitVector(N0, IdxVal, DAG, dl);
12354 // Insert the element into the desired half.
12355 unsigned NumEltsIn128 = 128 / EltVT.getSizeInBits();
12356 unsigned IdxIn128 = IdxVal - (IdxVal / NumEltsIn128) * NumEltsIn128;
12358 V = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, V.getValueType(), V, N1,
12359 DAG.getConstant(IdxIn128, MVT::i32));
12361 // Insert the changed part back to the 256-bit vector
12362 return Insert128BitVector(N0, V, IdxVal, DAG, dl);
12364 assert(VT.is128BitVector() && "Only 128-bit vector types should be left!");
12366 if (Subtarget->hasSSE41()) {
12367 if (EltVT.getSizeInBits() == 8 || EltVT.getSizeInBits() == 16) {
12369 if (VT == MVT::v8i16) {
12370 Opc = X86ISD::PINSRW;
12372 assert(VT == MVT::v16i8);
12373 Opc = X86ISD::PINSRB;
12376 // Transform it so it match pinsr{b,w} which expects a GR32 as its second
12378 if (N1.getValueType() != MVT::i32)
12379 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12380 if (N2.getValueType() != MVT::i32)
12381 N2 = DAG.getIntPtrConstant(IdxVal);
12382 return DAG.getNode(Opc, dl, VT, N0, N1, N2);
12385 if (EltVT == MVT::f32) {
12386 // Bits [7:6] of the constant are the source select. This will always be
12387 // zero here. The DAG Combiner may combine an extract_elt index into
12389 // bits. For example (insert (extract, 3), 2) could be matched by
12391 // the '3' into bits [7:6] of X86ISD::INSERTPS.
12392 // Bits [5:4] of the constant are the destination select. This is the
12393 // value of the incoming immediate.
12394 // Bits [3:0] of the constant are the zero mask. The DAG Combiner may
12395 // combine either bitwise AND or insert of float 0.0 to set these bits.
12396 N2 = DAG.getIntPtrConstant(IdxVal << 4);
12397 // Create this as a scalar to vector..
12398 N1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4f32, N1);
12399 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N0, N1, N2);
12402 if (EltVT == MVT::i32 || EltVT == MVT::i64) {
12403 // PINSR* works with constant index.
12408 if (EltVT == MVT::i8)
12411 if (EltVT.getSizeInBits() == 16) {
12412 // Transform it so it match pinsrw which expects a 16-bit value in a GR32
12413 // as its second argument.
12414 if (N1.getValueType() != MVT::i32)
12415 N1 = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, N1);
12416 if (N2.getValueType() != MVT::i32)
12417 N2 = DAG.getIntPtrConstant(IdxVal);
12418 return DAG.getNode(X86ISD::PINSRW, dl, VT, N0, N1, N2);
12423 static SDValue LowerSCALAR_TO_VECTOR(SDValue Op, SelectionDAG &DAG) {
12425 MVT OpVT = Op.getSimpleValueType();
12427 // If this is a 256-bit vector result, first insert into a 128-bit
12428 // vector and then insert into the 256-bit vector.
12429 if (!OpVT.is128BitVector()) {
12430 // Insert into a 128-bit vector.
12431 unsigned SizeFactor = OpVT.getSizeInBits()/128;
12432 MVT VT128 = MVT::getVectorVT(OpVT.getVectorElementType(),
12433 OpVT.getVectorNumElements() / SizeFactor);
12435 Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT128, Op.getOperand(0));
12437 // Insert the 128-bit vector.
12438 return Insert128BitVector(DAG.getUNDEF(OpVT), Op, 0, DAG, dl);
12441 if (OpVT == MVT::v1i64 &&
12442 Op.getOperand(0).getValueType() == MVT::i64)
12443 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v1i64, Op.getOperand(0));
12445 SDValue AnyExt = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, Op.getOperand(0));
12446 assert(OpVT.is128BitVector() && "Expected an SSE type!");
12447 return DAG.getNode(ISD::BITCAST, dl, OpVT,
12448 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,AnyExt));
12451 // Lower a node with an EXTRACT_SUBVECTOR opcode. This may result in
12452 // a simple subregister reference or explicit instructions to grab
12453 // upper bits of a vector.
12454 static SDValue LowerEXTRACT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12455 SelectionDAG &DAG) {
12457 SDValue In = Op.getOperand(0);
12458 SDValue Idx = Op.getOperand(1);
12459 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12460 MVT ResVT = Op.getSimpleValueType();
12461 MVT InVT = In.getSimpleValueType();
12463 if (Subtarget->hasFp256()) {
12464 if (ResVT.is128BitVector() &&
12465 (InVT.is256BitVector() || InVT.is512BitVector()) &&
12466 isa<ConstantSDNode>(Idx)) {
12467 return Extract128BitVector(In, IdxVal, DAG, dl);
12469 if (ResVT.is256BitVector() && InVT.is512BitVector() &&
12470 isa<ConstantSDNode>(Idx)) {
12471 return Extract256BitVector(In, IdxVal, DAG, dl);
12477 // Lower a node with an INSERT_SUBVECTOR opcode. This may result in a
12478 // simple superregister reference or explicit instructions to insert
12479 // the upper bits of a vector.
12480 static SDValue LowerINSERT_SUBVECTOR(SDValue Op, const X86Subtarget *Subtarget,
12481 SelectionDAG &DAG) {
12482 if (Subtarget->hasFp256()) {
12483 SDLoc dl(Op.getNode());
12484 SDValue Vec = Op.getNode()->getOperand(0);
12485 SDValue SubVec = Op.getNode()->getOperand(1);
12486 SDValue Idx = Op.getNode()->getOperand(2);
12488 if ((Op.getNode()->getSimpleValueType(0).is256BitVector() ||
12489 Op.getNode()->getSimpleValueType(0).is512BitVector()) &&
12490 SubVec.getNode()->getSimpleValueType(0).is128BitVector() &&
12491 isa<ConstantSDNode>(Idx)) {
12492 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12493 return Insert128BitVector(Vec, SubVec, IdxVal, DAG, dl);
12496 if (Op.getNode()->getSimpleValueType(0).is512BitVector() &&
12497 SubVec.getNode()->getSimpleValueType(0).is256BitVector() &&
12498 isa<ConstantSDNode>(Idx)) {
12499 unsigned IdxVal = cast<ConstantSDNode>(Idx)->getZExtValue();
12500 return Insert256BitVector(Vec, SubVec, IdxVal, DAG, dl);
12506 // ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
12507 // their target countpart wrapped in the X86ISD::Wrapper node. Suppose N is
12508 // one of the above mentioned nodes. It has to be wrapped because otherwise
12509 // Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
12510 // be used to form addressing mode. These wrapped nodes will be selected
12513 X86TargetLowering::LowerConstantPool(SDValue Op, SelectionDAG &DAG) const {
12514 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
12516 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12517 // global base reg.
12518 unsigned char OpFlag = 0;
12519 unsigned WrapperKind = X86ISD::Wrapper;
12520 CodeModel::Model M = DAG.getTarget().getCodeModel();
12522 if (Subtarget->isPICStyleRIPRel() &&
12523 (M == CodeModel::Small || M == CodeModel::Kernel))
12524 WrapperKind = X86ISD::WrapperRIP;
12525 else if (Subtarget->isPICStyleGOT())
12526 OpFlag = X86II::MO_GOTOFF;
12527 else if (Subtarget->isPICStyleStubPIC())
12528 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12530 SDValue Result = DAG.getTargetConstantPool(CP->getConstVal(), getPointerTy(),
12531 CP->getAlignment(),
12532 CP->getOffset(), OpFlag);
12534 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12535 // With PIC, the address is actually $g + Offset.
12537 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12538 DAG.getNode(X86ISD::GlobalBaseReg,
12539 SDLoc(), getPointerTy()),
12546 SDValue X86TargetLowering::LowerJumpTable(SDValue Op, SelectionDAG &DAG) const {
12547 JumpTableSDNode *JT = cast<JumpTableSDNode>(Op);
12549 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12550 // global base reg.
12551 unsigned char OpFlag = 0;
12552 unsigned WrapperKind = X86ISD::Wrapper;
12553 CodeModel::Model M = DAG.getTarget().getCodeModel();
12555 if (Subtarget->isPICStyleRIPRel() &&
12556 (M == CodeModel::Small || M == CodeModel::Kernel))
12557 WrapperKind = X86ISD::WrapperRIP;
12558 else if (Subtarget->isPICStyleGOT())
12559 OpFlag = X86II::MO_GOTOFF;
12560 else if (Subtarget->isPICStyleStubPIC())
12561 OpFlag = X86II::MO_PIC_BASE_OFFSET;
12563 SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), getPointerTy(),
12566 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12568 // With PIC, the address is actually $g + Offset.
12570 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12571 DAG.getNode(X86ISD::GlobalBaseReg,
12572 SDLoc(), getPointerTy()),
12579 X86TargetLowering::LowerExternalSymbol(SDValue Op, SelectionDAG &DAG) const {
12580 const char *Sym = cast<ExternalSymbolSDNode>(Op)->getSymbol();
12582 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12583 // global base reg.
12584 unsigned char OpFlag = 0;
12585 unsigned WrapperKind = X86ISD::Wrapper;
12586 CodeModel::Model M = DAG.getTarget().getCodeModel();
12588 if (Subtarget->isPICStyleRIPRel() &&
12589 (M == CodeModel::Small || M == CodeModel::Kernel)) {
12590 if (Subtarget->isTargetDarwin() || Subtarget->isTargetELF())
12591 OpFlag = X86II::MO_GOTPCREL;
12592 WrapperKind = X86ISD::WrapperRIP;
12593 } else if (Subtarget->isPICStyleGOT()) {
12594 OpFlag = X86II::MO_GOT;
12595 } else if (Subtarget->isPICStyleStubPIC()) {
12596 OpFlag = X86II::MO_DARWIN_NONLAZY_PIC_BASE;
12597 } else if (Subtarget->isPICStyleStubNoDynamic()) {
12598 OpFlag = X86II::MO_DARWIN_NONLAZY;
12601 SDValue Result = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlag);
12604 Result = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12606 // With PIC, the address is actually $g + Offset.
12607 if (DAG.getTarget().getRelocationModel() == Reloc::PIC_ &&
12608 !Subtarget->is64Bit()) {
12609 Result = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12610 DAG.getNode(X86ISD::GlobalBaseReg,
12611 SDLoc(), getPointerTy()),
12615 // For symbols that require a load from a stub to get the address, emit the
12617 if (isGlobalStubReference(OpFlag))
12618 Result = DAG.getLoad(getPointerTy(), DL, DAG.getEntryNode(), Result,
12619 MachinePointerInfo::getGOT(), false, false, false, 0);
12625 X86TargetLowering::LowerBlockAddress(SDValue Op, SelectionDAG &DAG) const {
12626 // Create the TargetBlockAddressAddress node.
12627 unsigned char OpFlags =
12628 Subtarget->ClassifyBlockAddressReference();
12629 CodeModel::Model M = DAG.getTarget().getCodeModel();
12630 const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
12631 int64_t Offset = cast<BlockAddressSDNode>(Op)->getOffset();
12633 SDValue Result = DAG.getTargetBlockAddress(BA, getPointerTy(), Offset,
12636 if (Subtarget->isPICStyleRIPRel() &&
12637 (M == CodeModel::Small || M == CodeModel::Kernel))
12638 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12640 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12642 // With PIC, the address is actually $g + Offset.
12643 if (isGlobalRelativeToPICBase(OpFlags)) {
12644 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12645 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12653 X86TargetLowering::LowerGlobalAddress(const GlobalValue *GV, SDLoc dl,
12654 int64_t Offset, SelectionDAG &DAG) const {
12655 // Create the TargetGlobalAddress node, folding in the constant
12656 // offset if it is legal.
12657 unsigned char OpFlags =
12658 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget());
12659 CodeModel::Model M = DAG.getTarget().getCodeModel();
12661 if (OpFlags == X86II::MO_NO_FLAG &&
12662 X86::isOffsetSuitableForCodeModel(Offset, M)) {
12663 // A direct static reference to a global.
12664 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), Offset);
12667 Result = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
12670 if (Subtarget->isPICStyleRIPRel() &&
12671 (M == CodeModel::Small || M == CodeModel::Kernel))
12672 Result = DAG.getNode(X86ISD::WrapperRIP, dl, getPointerTy(), Result);
12674 Result = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), Result);
12676 // With PIC, the address is actually $g + Offset.
12677 if (isGlobalRelativeToPICBase(OpFlags)) {
12678 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(),
12679 DAG.getNode(X86ISD::GlobalBaseReg, dl, getPointerTy()),
12683 // For globals that require a load from a stub to get the address, emit the
12685 if (isGlobalStubReference(OpFlags))
12686 Result = DAG.getLoad(getPointerTy(), dl, DAG.getEntryNode(), Result,
12687 MachinePointerInfo::getGOT(), false, false, false, 0);
12689 // If there was a non-zero offset that we didn't fold, create an explicit
12690 // addition for it.
12692 Result = DAG.getNode(ISD::ADD, dl, getPointerTy(), Result,
12693 DAG.getConstant(Offset, getPointerTy()));
12699 X86TargetLowering::LowerGlobalAddress(SDValue Op, SelectionDAG &DAG) const {
12700 const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
12701 int64_t Offset = cast<GlobalAddressSDNode>(Op)->getOffset();
12702 return LowerGlobalAddress(GV, SDLoc(Op), Offset, DAG);
12706 GetTLSADDR(SelectionDAG &DAG, SDValue Chain, GlobalAddressSDNode *GA,
12707 SDValue *InFlag, const EVT PtrVT, unsigned ReturnReg,
12708 unsigned char OperandFlags, bool LocalDynamic = false) {
12709 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12710 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12712 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12713 GA->getValueType(0),
12717 X86ISD::NodeType CallType = LocalDynamic ? X86ISD::TLSBASEADDR
12721 SDValue Ops[] = { Chain, TGA, *InFlag };
12722 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12724 SDValue Ops[] = { Chain, TGA };
12725 Chain = DAG.getNode(CallType, dl, NodeTys, Ops);
12728 // TLSADDR will be codegen'ed as call. Inform MFI that function has calls.
12729 MFI->setAdjustsStack(true);
12731 SDValue Flag = Chain.getValue(1);
12732 return DAG.getCopyFromReg(Chain, dl, ReturnReg, PtrVT, Flag);
12735 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 32 bit
12737 LowerToTLSGeneralDynamicModel32(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12740 SDLoc dl(GA); // ? function entry point might be better
12741 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12742 DAG.getNode(X86ISD::GlobalBaseReg,
12743 SDLoc(), PtrVT), InFlag);
12744 InFlag = Chain.getValue(1);
12746 return GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX, X86II::MO_TLSGD);
12749 // Lower ISD::GlobalTLSAddress using the "general dynamic" model, 64 bit
12751 LowerToTLSGeneralDynamicModel64(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12753 return GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT,
12754 X86::RAX, X86II::MO_TLSGD);
12757 static SDValue LowerToTLSLocalDynamicModel(GlobalAddressSDNode *GA,
12763 // Get the start address of the TLS block for this module.
12764 X86MachineFunctionInfo* MFI = DAG.getMachineFunction()
12765 .getInfo<X86MachineFunctionInfo>();
12766 MFI->incNumLocalDynamicTLSAccesses();
12770 Base = GetTLSADDR(DAG, DAG.getEntryNode(), GA, nullptr, PtrVT, X86::RAX,
12771 X86II::MO_TLSLD, /*LocalDynamic=*/true);
12774 SDValue Chain = DAG.getCopyToReg(DAG.getEntryNode(), dl, X86::EBX,
12775 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT), InFlag);
12776 InFlag = Chain.getValue(1);
12777 Base = GetTLSADDR(DAG, Chain, GA, &InFlag, PtrVT, X86::EAX,
12778 X86II::MO_TLSLDM, /*LocalDynamic=*/true);
12781 // Note: the CleanupLocalDynamicTLSPass will remove redundant computations
12785 unsigned char OperandFlags = X86II::MO_DTPOFF;
12786 unsigned WrapperKind = X86ISD::Wrapper;
12787 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12788 GA->getValueType(0),
12789 GA->getOffset(), OperandFlags);
12790 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12792 // Add x@dtpoff with the base.
12793 return DAG.getNode(ISD::ADD, dl, PtrVT, Offset, Base);
12796 // Lower ISD::GlobalTLSAddress using the "initial exec" or "local exec" model.
12797 static SDValue LowerToTLSExecModel(GlobalAddressSDNode *GA, SelectionDAG &DAG,
12798 const EVT PtrVT, TLSModel::Model model,
12799 bool is64Bit, bool isPIC) {
12802 // Get the Thread Pointer, which is %gs:0 (32-bit) or %fs:0 (64-bit).
12803 Value *Ptr = Constant::getNullValue(Type::getInt8PtrTy(*DAG.getContext(),
12804 is64Bit ? 257 : 256));
12806 SDValue ThreadPointer =
12807 DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), DAG.getIntPtrConstant(0),
12808 MachinePointerInfo(Ptr), false, false, false, 0);
12810 unsigned char OperandFlags = 0;
12811 // Most TLS accesses are not RIP relative, even on x86-64. One exception is
12813 unsigned WrapperKind = X86ISD::Wrapper;
12814 if (model == TLSModel::LocalExec) {
12815 OperandFlags = is64Bit ? X86II::MO_TPOFF : X86II::MO_NTPOFF;
12816 } else if (model == TLSModel::InitialExec) {
12818 OperandFlags = X86II::MO_GOTTPOFF;
12819 WrapperKind = X86ISD::WrapperRIP;
12821 OperandFlags = isPIC ? X86II::MO_GOTNTPOFF : X86II::MO_INDNTPOFF;
12824 llvm_unreachable("Unexpected model");
12827 // emit "addl x@ntpoff,%eax" (local exec)
12828 // or "addl x@indntpoff,%eax" (initial exec)
12829 // or "addl x@gotntpoff(%ebx) ,%eax" (initial exec, 32-bit pic)
12831 DAG.getTargetGlobalAddress(GA->getGlobal(), dl, GA->getValueType(0),
12832 GA->getOffset(), OperandFlags);
12833 SDValue Offset = DAG.getNode(WrapperKind, dl, PtrVT, TGA);
12835 if (model == TLSModel::InitialExec) {
12836 if (isPIC && !is64Bit) {
12837 Offset = DAG.getNode(ISD::ADD, dl, PtrVT,
12838 DAG.getNode(X86ISD::GlobalBaseReg, SDLoc(), PtrVT),
12842 Offset = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Offset,
12843 MachinePointerInfo::getGOT(), false, false, false, 0);
12846 // The address of the thread local variable is the add of the thread
12847 // pointer with the offset of the variable.
12848 return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
12852 X86TargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
12854 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
12855 const GlobalValue *GV = GA->getGlobal();
12857 if (Subtarget->isTargetELF()) {
12858 TLSModel::Model model = DAG.getTarget().getTLSModel(GV);
12861 case TLSModel::GeneralDynamic:
12862 if (Subtarget->is64Bit())
12863 return LowerToTLSGeneralDynamicModel64(GA, DAG, getPointerTy());
12864 return LowerToTLSGeneralDynamicModel32(GA, DAG, getPointerTy());
12865 case TLSModel::LocalDynamic:
12866 return LowerToTLSLocalDynamicModel(GA, DAG, getPointerTy(),
12867 Subtarget->is64Bit());
12868 case TLSModel::InitialExec:
12869 case TLSModel::LocalExec:
12870 return LowerToTLSExecModel(
12871 GA, DAG, getPointerTy(), model, Subtarget->is64Bit(),
12872 DAG.getTarget().getRelocationModel() == Reloc::PIC_);
12874 llvm_unreachable("Unknown TLS model.");
12877 if (Subtarget->isTargetDarwin()) {
12878 // Darwin only has one model of TLS. Lower to that.
12879 unsigned char OpFlag = 0;
12880 unsigned WrapperKind = Subtarget->isPICStyleRIPRel() ?
12881 X86ISD::WrapperRIP : X86ISD::Wrapper;
12883 // In PIC mode (unless we're in RIPRel PIC mode) we add an offset to the
12884 // global base reg.
12885 bool PIC32 = (DAG.getTarget().getRelocationModel() == Reloc::PIC_) &&
12886 !Subtarget->is64Bit();
12888 OpFlag = X86II::MO_TLVP_PIC_BASE;
12890 OpFlag = X86II::MO_TLVP;
12892 SDValue Result = DAG.getTargetGlobalAddress(GA->getGlobal(), DL,
12893 GA->getValueType(0),
12894 GA->getOffset(), OpFlag);
12895 SDValue Offset = DAG.getNode(WrapperKind, DL, getPointerTy(), Result);
12897 // With PIC32, the address is actually $g + Offset.
12899 Offset = DAG.getNode(ISD::ADD, DL, getPointerTy(),
12900 DAG.getNode(X86ISD::GlobalBaseReg,
12901 SDLoc(), getPointerTy()),
12904 // Lowering the machine isd will make sure everything is in the right
12906 SDValue Chain = DAG.getEntryNode();
12907 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
12908 SDValue Args[] = { Chain, Offset };
12909 Chain = DAG.getNode(X86ISD::TLSCALL, DL, NodeTys, Args);
12911 // TLSCALL will be codegen'ed as call. Inform MFI that function has calls.
12912 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
12913 MFI->setAdjustsStack(true);
12915 // And our return value (tls address) is in the standard call return value
12917 unsigned Reg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
12918 return DAG.getCopyFromReg(Chain, DL, Reg, getPointerTy(),
12919 Chain.getValue(1));
12922 if (Subtarget->isTargetKnownWindowsMSVC() ||
12923 Subtarget->isTargetWindowsGNU()) {
12924 // Just use the implicit TLS architecture
12925 // Need to generate someting similar to:
12926 // mov rdx, qword [gs:abs 58H]; Load pointer to ThreadLocalStorage
12928 // mov ecx, dword [rel _tls_index]: Load index (from C runtime)
12929 // mov rcx, qword [rdx+rcx*8]
12930 // mov eax, .tls$:tlsvar
12931 // [rax+rcx] contains the address
12932 // Windows 64bit: gs:0x58
12933 // Windows 32bit: fs:__tls_array
12936 SDValue Chain = DAG.getEntryNode();
12938 // Get the Thread Pointer, which is %fs:__tls_array (32-bit) or
12939 // %gs:0x58 (64-bit). On MinGW, __tls_array is not available, so directly
12940 // use its literal value of 0x2C.
12941 Value *Ptr = Constant::getNullValue(Subtarget->is64Bit()
12942 ? Type::getInt8PtrTy(*DAG.getContext(),
12944 : Type::getInt32PtrTy(*DAG.getContext(),
12948 Subtarget->is64Bit()
12949 ? DAG.getIntPtrConstant(0x58)
12950 : (Subtarget->isTargetWindowsGNU()
12951 ? DAG.getIntPtrConstant(0x2C)
12952 : DAG.getExternalSymbol("_tls_array", getPointerTy()));
12954 SDValue ThreadPointer =
12955 DAG.getLoad(getPointerTy(), dl, Chain, TlsArray,
12956 MachinePointerInfo(Ptr), false, false, false, 0);
12958 // Load the _tls_index variable
12959 SDValue IDX = DAG.getExternalSymbol("_tls_index", getPointerTy());
12960 if (Subtarget->is64Bit())
12961 IDX = DAG.getExtLoad(ISD::ZEXTLOAD, dl, getPointerTy(), Chain,
12962 IDX, MachinePointerInfo(), MVT::i32,
12963 false, false, false, 0);
12965 IDX = DAG.getLoad(getPointerTy(), dl, Chain, IDX, MachinePointerInfo(),
12966 false, false, false, 0);
12968 SDValue Scale = DAG.getConstant(Log2_64_Ceil(TD->getPointerSize()),
12970 IDX = DAG.getNode(ISD::SHL, dl, getPointerTy(), IDX, Scale);
12972 SDValue res = DAG.getNode(ISD::ADD, dl, getPointerTy(), ThreadPointer, IDX);
12973 res = DAG.getLoad(getPointerTy(), dl, Chain, res, MachinePointerInfo(),
12974 false, false, false, 0);
12976 // Get the offset of start of .tls section
12977 SDValue TGA = DAG.getTargetGlobalAddress(GA->getGlobal(), dl,
12978 GA->getValueType(0),
12979 GA->getOffset(), X86II::MO_SECREL);
12980 SDValue Offset = DAG.getNode(X86ISD::Wrapper, dl, getPointerTy(), TGA);
12982 // The address of the thread local variable is the add of the thread
12983 // pointer with the offset of the variable.
12984 return DAG.getNode(ISD::ADD, dl, getPointerTy(), res, Offset);
12987 llvm_unreachable("TLS not implemented for this target.");
12990 /// LowerShiftParts - Lower SRA_PARTS and friends, which return two i32 values
12991 /// and take a 2 x i32 value to shift plus a shift amount.
12992 static SDValue LowerShiftParts(SDValue Op, SelectionDAG &DAG) {
12993 assert(Op.getNumOperands() == 3 && "Not a double-shift!");
12994 MVT VT = Op.getSimpleValueType();
12995 unsigned VTBits = VT.getSizeInBits();
12997 bool isSRA = Op.getOpcode() == ISD::SRA_PARTS;
12998 SDValue ShOpLo = Op.getOperand(0);
12999 SDValue ShOpHi = Op.getOperand(1);
13000 SDValue ShAmt = Op.getOperand(2);
13001 // X86ISD::SHLD and X86ISD::SHRD have defined overflow behavior but the
13002 // generic ISD nodes haven't. Insert an AND to be safe, it's optimized away
13004 SDValue SafeShAmt = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
13005 DAG.getConstant(VTBits - 1, MVT::i8));
13006 SDValue Tmp1 = isSRA ? DAG.getNode(ISD::SRA, dl, VT, ShOpHi,
13007 DAG.getConstant(VTBits - 1, MVT::i8))
13008 : DAG.getConstant(0, VT);
13010 SDValue Tmp2, Tmp3;
13011 if (Op.getOpcode() == ISD::SHL_PARTS) {
13012 Tmp2 = DAG.getNode(X86ISD::SHLD, dl, VT, ShOpHi, ShOpLo, ShAmt);
13013 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, SafeShAmt);
13015 Tmp2 = DAG.getNode(X86ISD::SHRD, dl, VT, ShOpLo, ShOpHi, ShAmt);
13016 Tmp3 = DAG.getNode(isSRA ? ISD::SRA : ISD::SRL, dl, VT, ShOpHi, SafeShAmt);
13019 // If the shift amount is larger or equal than the width of a part we can't
13020 // rely on the results of shld/shrd. Insert a test and select the appropriate
13021 // values for large shift amounts.
13022 SDValue AndNode = DAG.getNode(ISD::AND, dl, MVT::i8, ShAmt,
13023 DAG.getConstant(VTBits, MVT::i8));
13024 SDValue Cond = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
13025 AndNode, DAG.getConstant(0, MVT::i8));
13028 SDValue CC = DAG.getConstant(X86::COND_NE, MVT::i8);
13029 SDValue Ops0[4] = { Tmp2, Tmp3, CC, Cond };
13030 SDValue Ops1[4] = { Tmp3, Tmp1, CC, Cond };
13032 if (Op.getOpcode() == ISD::SHL_PARTS) {
13033 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
13034 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
13036 Lo = DAG.getNode(X86ISD::CMOV, dl, VT, Ops0);
13037 Hi = DAG.getNode(X86ISD::CMOV, dl, VT, Ops1);
13040 SDValue Ops[2] = { Lo, Hi };
13041 return DAG.getMergeValues(Ops, dl);
13044 SDValue X86TargetLowering::LowerSINT_TO_FP(SDValue Op,
13045 SelectionDAG &DAG) const {
13046 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
13048 if (SrcVT.isVector())
13051 assert(SrcVT <= MVT::i64 && SrcVT >= MVT::i16 &&
13052 "Unknown SINT_TO_FP to lower!");
13054 // These are really Legal; return the operand so the caller accepts it as
13056 if (SrcVT == MVT::i32 && isScalarFPTypeInSSEReg(Op.getValueType()))
13058 if (SrcVT == MVT::i64 && isScalarFPTypeInSSEReg(Op.getValueType()) &&
13059 Subtarget->is64Bit()) {
13064 unsigned Size = SrcVT.getSizeInBits()/8;
13065 MachineFunction &MF = DAG.getMachineFunction();
13066 int SSFI = MF.getFrameInfo()->CreateStackObject(Size, Size, false);
13067 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13068 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13070 MachinePointerInfo::getFixedStack(SSFI),
13072 return BuildFILD(Op, SrcVT, Chain, StackSlot, DAG);
13075 SDValue X86TargetLowering::BuildFILD(SDValue Op, EVT SrcVT, SDValue Chain,
13077 SelectionDAG &DAG) const {
13081 bool useSSE = isScalarFPTypeInSSEReg(Op.getValueType());
13083 Tys = DAG.getVTList(MVT::f64, MVT::Other, MVT::Glue);
13085 Tys = DAG.getVTList(Op.getValueType(), MVT::Other);
13087 unsigned ByteSize = SrcVT.getSizeInBits()/8;
13089 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(StackSlot);
13090 MachineMemOperand *MMO;
13092 int SSFI = FI->getIndex();
13094 DAG.getMachineFunction()
13095 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13096 MachineMemOperand::MOLoad, ByteSize, ByteSize);
13098 MMO = cast<LoadSDNode>(StackSlot)->getMemOperand();
13099 StackSlot = StackSlot.getOperand(1);
13101 SDValue Ops[] = { Chain, StackSlot, DAG.getValueType(SrcVT) };
13102 SDValue Result = DAG.getMemIntrinsicNode(useSSE ? X86ISD::FILD_FLAG :
13104 Tys, Ops, SrcVT, MMO);
13107 Chain = Result.getValue(1);
13108 SDValue InFlag = Result.getValue(2);
13110 // FIXME: Currently the FST is flagged to the FILD_FLAG. This
13111 // shouldn't be necessary except that RFP cannot be live across
13112 // multiple blocks. When stackifier is fixed, they can be uncoupled.
13113 MachineFunction &MF = DAG.getMachineFunction();
13114 unsigned SSFISize = Op.getValueType().getSizeInBits()/8;
13115 int SSFI = MF.getFrameInfo()->CreateStackObject(SSFISize, SSFISize, false);
13116 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13117 Tys = DAG.getVTList(MVT::Other);
13119 Chain, Result, StackSlot, DAG.getValueType(Op.getValueType()), InFlag
13121 MachineMemOperand *MMO =
13122 DAG.getMachineFunction()
13123 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13124 MachineMemOperand::MOStore, SSFISize, SSFISize);
13126 Chain = DAG.getMemIntrinsicNode(X86ISD::FST, DL, Tys,
13127 Ops, Op.getValueType(), MMO);
13128 Result = DAG.getLoad(Op.getValueType(), DL, Chain, StackSlot,
13129 MachinePointerInfo::getFixedStack(SSFI),
13130 false, false, false, 0);
13136 // LowerUINT_TO_FP_i64 - 64-bit unsigned integer to double expansion.
13137 SDValue X86TargetLowering::LowerUINT_TO_FP_i64(SDValue Op,
13138 SelectionDAG &DAG) const {
13139 // This algorithm is not obvious. Here it is what we're trying to output:
13142 punpckldq (c0), %xmm0 // c0: (uint4){ 0x43300000U, 0x45300000U, 0U, 0U }
13143 subpd (c1), %xmm0 // c1: (double2){ 0x1.0p52, 0x1.0p52 * 0x1.0p32 }
13145 haddpd %xmm0, %xmm0
13147 pshufd $0x4e, %xmm0, %xmm1
13153 LLVMContext *Context = DAG.getContext();
13155 // Build some magic constants.
13156 static const uint32_t CV0[] = { 0x43300000, 0x45300000, 0, 0 };
13157 Constant *C0 = ConstantDataVector::get(*Context, CV0);
13158 SDValue CPIdx0 = DAG.getConstantPool(C0, getPointerTy(), 16);
13160 SmallVector<Constant*,2> CV1;
13162 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13163 APInt(64, 0x4330000000000000ULL))));
13165 ConstantFP::get(*Context, APFloat(APFloat::IEEEdouble,
13166 APInt(64, 0x4530000000000000ULL))));
13167 Constant *C1 = ConstantVector::get(CV1);
13168 SDValue CPIdx1 = DAG.getConstantPool(C1, getPointerTy(), 16);
13170 // Load the 64-bit value into an XMM register.
13171 SDValue XR1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2i64,
13173 SDValue CLod0 = DAG.getLoad(MVT::v4i32, dl, DAG.getEntryNode(), CPIdx0,
13174 MachinePointerInfo::getConstantPool(),
13175 false, false, false, 16);
13176 SDValue Unpck1 = getUnpackl(DAG, dl, MVT::v4i32,
13177 DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, XR1),
13180 SDValue CLod1 = DAG.getLoad(MVT::v2f64, dl, CLod0.getValue(1), CPIdx1,
13181 MachinePointerInfo::getConstantPool(),
13182 false, false, false, 16);
13183 SDValue XR2F = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Unpck1);
13184 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, XR2F, CLod1);
13187 if (Subtarget->hasSSE3()) {
13188 // FIXME: The 'haddpd' instruction may be slower than 'movhlps + addsd'.
13189 Result = DAG.getNode(X86ISD::FHADD, dl, MVT::v2f64, Sub, Sub);
13191 SDValue S2F = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Sub);
13192 SDValue Shuffle = getTargetShuffleNode(X86ISD::PSHUFD, dl, MVT::v4i32,
13194 Result = DAG.getNode(ISD::FADD, dl, MVT::v2f64,
13195 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Shuffle),
13199 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Result,
13200 DAG.getIntPtrConstant(0));
13203 // LowerUINT_TO_FP_i32 - 32-bit unsigned integer to float expansion.
13204 SDValue X86TargetLowering::LowerUINT_TO_FP_i32(SDValue Op,
13205 SelectionDAG &DAG) const {
13207 // FP constant to bias correct the final result.
13208 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
13211 // Load the 32-bit value into an XMM register.
13212 SDValue Load = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v4i32,
13215 // Zero out the upper parts of the register.
13216 Load = getShuffleVectorZeroOrUndef(Load, 0, true, Subtarget, DAG);
13218 Load = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13219 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Load),
13220 DAG.getIntPtrConstant(0));
13222 // Or the load with the bias.
13223 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64,
13224 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13225 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13226 MVT::v2f64, Load)),
13227 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64,
13228 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
13229 MVT::v2f64, Bias)));
13230 Or = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
13231 DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or),
13232 DAG.getIntPtrConstant(0));
13234 // Subtract the bias.
13235 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Or, Bias);
13237 // Handle final rounding.
13238 EVT DestVT = Op.getValueType();
13240 if (DestVT.bitsLT(MVT::f64))
13241 return DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
13242 DAG.getIntPtrConstant(0));
13243 if (DestVT.bitsGT(MVT::f64))
13244 return DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
13246 // Handle final rounding.
13250 SDValue X86TargetLowering::lowerUINT_TO_FP_vec(SDValue Op,
13251 SelectionDAG &DAG) const {
13252 SDValue N0 = Op.getOperand(0);
13253 MVT SVT = N0.getSimpleValueType();
13256 assert((SVT == MVT::v4i8 || SVT == MVT::v4i16 ||
13257 SVT == MVT::v8i8 || SVT == MVT::v8i16) &&
13258 "Custom UINT_TO_FP is not supported!");
13260 MVT NVT = MVT::getVectorVT(MVT::i32, SVT.getVectorNumElements());
13261 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(),
13262 DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N0));
13265 SDValue X86TargetLowering::LowerUINT_TO_FP(SDValue Op,
13266 SelectionDAG &DAG) const {
13267 SDValue N0 = Op.getOperand(0);
13270 if (Op.getValueType().isVector())
13271 return lowerUINT_TO_FP_vec(Op, DAG);
13273 // Since UINT_TO_FP is legal (it's marked custom), dag combiner won't
13274 // optimize it to a SINT_TO_FP when the sign bit is known zero. Perform
13275 // the optimization here.
13276 if (DAG.SignBitIsZero(N0))
13277 return DAG.getNode(ISD::SINT_TO_FP, dl, Op.getValueType(), N0);
13279 MVT SrcVT = N0.getSimpleValueType();
13280 MVT DstVT = Op.getSimpleValueType();
13281 if (SrcVT == MVT::i64 && DstVT == MVT::f64 && X86ScalarSSEf64)
13282 return LowerUINT_TO_FP_i64(Op, DAG);
13283 if (SrcVT == MVT::i32 && X86ScalarSSEf64)
13284 return LowerUINT_TO_FP_i32(Op, DAG);
13285 if (Subtarget->is64Bit() && SrcVT == MVT::i64 && DstVT == MVT::f32)
13288 // Make a 64-bit buffer, and use it to build an FILD.
13289 SDValue StackSlot = DAG.CreateStackTemporary(MVT::i64);
13290 if (SrcVT == MVT::i32) {
13291 SDValue WordOff = DAG.getConstant(4, getPointerTy());
13292 SDValue OffsetSlot = DAG.getNode(ISD::ADD, dl,
13293 getPointerTy(), StackSlot, WordOff);
13294 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13295 StackSlot, MachinePointerInfo(),
13297 SDValue Store2 = DAG.getStore(Store1, dl, DAG.getConstant(0, MVT::i32),
13298 OffsetSlot, MachinePointerInfo(),
13300 SDValue Fild = BuildFILD(Op, MVT::i64, Store2, StackSlot, DAG);
13304 assert(SrcVT == MVT::i64 && "Unexpected type in UINT_TO_FP");
13305 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, Op.getOperand(0),
13306 StackSlot, MachinePointerInfo(),
13308 // For i64 source, we need to add the appropriate power of 2 if the input
13309 // was negative. This is the same as the optimization in
13310 // DAGTypeLegalizer::ExpandIntOp_UNIT_TO_FP, and for it to be safe here,
13311 // we must be careful to do the computation in x87 extended precision, not
13312 // in SSE. (The generic code can't know it's OK to do this, or how to.)
13313 int SSFI = cast<FrameIndexSDNode>(StackSlot)->getIndex();
13314 MachineMemOperand *MMO =
13315 DAG.getMachineFunction()
13316 .getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13317 MachineMemOperand::MOLoad, 8, 8);
13319 SDVTList Tys = DAG.getVTList(MVT::f80, MVT::Other);
13320 SDValue Ops[] = { Store, StackSlot, DAG.getValueType(MVT::i64) };
13321 SDValue Fild = DAG.getMemIntrinsicNode(X86ISD::FILD, dl, Tys, Ops,
13324 APInt FF(32, 0x5F800000ULL);
13326 // Check whether the sign bit is set.
13327 SDValue SignSet = DAG.getSetCC(dl,
13328 getSetCCResultType(*DAG.getContext(), MVT::i64),
13329 Op.getOperand(0), DAG.getConstant(0, MVT::i64),
13332 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
13333 SDValue FudgePtr = DAG.getConstantPool(
13334 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
13337 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
13338 SDValue Zero = DAG.getIntPtrConstant(0);
13339 SDValue Four = DAG.getIntPtrConstant(4);
13340 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
13342 FudgePtr = DAG.getNode(ISD::ADD, dl, getPointerTy(), FudgePtr, Offset);
13344 // Load the value out, extending it from f32 to f80.
13345 // FIXME: Avoid the extend by constructing the right constant pool?
13346 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, MVT::f80, DAG.getEntryNode(),
13347 FudgePtr, MachinePointerInfo::getConstantPool(),
13348 MVT::f32, false, false, false, 4);
13349 // Extend everything to 80 bits to force it to be done on x87.
13350 SDValue Add = DAG.getNode(ISD::FADD, dl, MVT::f80, Fild, Fudge);
13351 return DAG.getNode(ISD::FP_ROUND, dl, DstVT, Add, DAG.getIntPtrConstant(0));
13354 std::pair<SDValue,SDValue>
13355 X86TargetLowering:: FP_TO_INTHelper(SDValue Op, SelectionDAG &DAG,
13356 bool IsSigned, bool IsReplace) const {
13359 EVT DstTy = Op.getValueType();
13361 if (!IsSigned && !isIntegerTypeFTOL(DstTy)) {
13362 assert(DstTy == MVT::i32 && "Unexpected FP_TO_UINT");
13366 assert(DstTy.getSimpleVT() <= MVT::i64 &&
13367 DstTy.getSimpleVT() >= MVT::i16 &&
13368 "Unknown FP_TO_INT to lower!");
13370 // These are really Legal.
13371 if (DstTy == MVT::i32 &&
13372 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13373 return std::make_pair(SDValue(), SDValue());
13374 if (Subtarget->is64Bit() &&
13375 DstTy == MVT::i64 &&
13376 isScalarFPTypeInSSEReg(Op.getOperand(0).getValueType()))
13377 return std::make_pair(SDValue(), SDValue());
13379 // We lower FP->int64 either into FISTP64 followed by a load from a temporary
13380 // stack slot, or into the FTOL runtime function.
13381 MachineFunction &MF = DAG.getMachineFunction();
13382 unsigned MemSize = DstTy.getSizeInBits()/8;
13383 int SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13384 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13387 if (!IsSigned && isIntegerTypeFTOL(DstTy))
13388 Opc = X86ISD::WIN_FTOL;
13390 switch (DstTy.getSimpleVT().SimpleTy) {
13391 default: llvm_unreachable("Invalid FP_TO_SINT to lower!");
13392 case MVT::i16: Opc = X86ISD::FP_TO_INT16_IN_MEM; break;
13393 case MVT::i32: Opc = X86ISD::FP_TO_INT32_IN_MEM; break;
13394 case MVT::i64: Opc = X86ISD::FP_TO_INT64_IN_MEM; break;
13397 SDValue Chain = DAG.getEntryNode();
13398 SDValue Value = Op.getOperand(0);
13399 EVT TheVT = Op.getOperand(0).getValueType();
13400 // FIXME This causes a redundant load/store if the SSE-class value is already
13401 // in memory, such as if it is on the callstack.
13402 if (isScalarFPTypeInSSEReg(TheVT)) {
13403 assert(DstTy == MVT::i64 && "Invalid FP_TO_SINT to lower!");
13404 Chain = DAG.getStore(Chain, DL, Value, StackSlot,
13405 MachinePointerInfo::getFixedStack(SSFI),
13407 SDVTList Tys = DAG.getVTList(Op.getOperand(0).getValueType(), MVT::Other);
13409 Chain, StackSlot, DAG.getValueType(TheVT)
13412 MachineMemOperand *MMO =
13413 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13414 MachineMemOperand::MOLoad, MemSize, MemSize);
13415 Value = DAG.getMemIntrinsicNode(X86ISD::FLD, DL, Tys, Ops, DstTy, MMO);
13416 Chain = Value.getValue(1);
13417 SSFI = MF.getFrameInfo()->CreateStackObject(MemSize, MemSize, false);
13418 StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
13421 MachineMemOperand *MMO =
13422 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
13423 MachineMemOperand::MOStore, MemSize, MemSize);
13425 if (Opc != X86ISD::WIN_FTOL) {
13426 // Build the FP_TO_INT*_IN_MEM
13427 SDValue Ops[] = { Chain, Value, StackSlot };
13428 SDValue FIST = DAG.getMemIntrinsicNode(Opc, DL, DAG.getVTList(MVT::Other),
13430 return std::make_pair(FIST, StackSlot);
13432 SDValue ftol = DAG.getNode(X86ISD::WIN_FTOL, DL,
13433 DAG.getVTList(MVT::Other, MVT::Glue),
13435 SDValue eax = DAG.getCopyFromReg(ftol, DL, X86::EAX,
13436 MVT::i32, ftol.getValue(1));
13437 SDValue edx = DAG.getCopyFromReg(eax.getValue(1), DL, X86::EDX,
13438 MVT::i32, eax.getValue(2));
13439 SDValue Ops[] = { eax, edx };
13440 SDValue pair = IsReplace
13441 ? DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops)
13442 : DAG.getMergeValues(Ops, DL);
13443 return std::make_pair(pair, SDValue());
13447 static SDValue LowerAVXExtend(SDValue Op, SelectionDAG &DAG,
13448 const X86Subtarget *Subtarget) {
13449 MVT VT = Op->getSimpleValueType(0);
13450 SDValue In = Op->getOperand(0);
13451 MVT InVT = In.getSimpleValueType();
13454 // Optimize vectors in AVX mode:
13457 // Use vpunpcklwd for 4 lower elements v8i16 -> v4i32.
13458 // Use vpunpckhwd for 4 upper elements v8i16 -> v4i32.
13459 // Concat upper and lower parts.
13462 // Use vpunpckldq for 4 lower elements v4i32 -> v2i64.
13463 // Use vpunpckhdq for 4 upper elements v4i32 -> v2i64.
13464 // Concat upper and lower parts.
13467 if (((VT != MVT::v16i16) || (InVT != MVT::v16i8)) &&
13468 ((VT != MVT::v8i32) || (InVT != MVT::v8i16)) &&
13469 ((VT != MVT::v4i64) || (InVT != MVT::v4i32)))
13472 if (Subtarget->hasInt256())
13473 return DAG.getNode(X86ISD::VZEXT, dl, VT, In);
13475 SDValue ZeroVec = getZeroVector(InVT, Subtarget, DAG, dl);
13476 SDValue Undef = DAG.getUNDEF(InVT);
13477 bool NeedZero = Op.getOpcode() == ISD::ZERO_EXTEND;
13478 SDValue OpLo = getUnpackl(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13479 SDValue OpHi = getUnpackh(DAG, dl, InVT, In, NeedZero ? ZeroVec : Undef);
13481 MVT HVT = MVT::getVectorVT(VT.getVectorElementType(),
13482 VT.getVectorNumElements()/2);
13484 OpLo = DAG.getNode(ISD::BITCAST, dl, HVT, OpLo);
13485 OpHi = DAG.getNode(ISD::BITCAST, dl, HVT, OpHi);
13487 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
13490 static SDValue LowerZERO_EXTEND_AVX512(SDValue Op,
13491 SelectionDAG &DAG) {
13492 MVT VT = Op->getSimpleValueType(0);
13493 SDValue In = Op->getOperand(0);
13494 MVT InVT = In.getSimpleValueType();
13496 unsigned int NumElts = VT.getVectorNumElements();
13497 if (NumElts != 8 && NumElts != 16)
13500 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
13501 return DAG.getNode(X86ISD::VZEXT, DL, VT, In);
13503 EVT ExtVT = (NumElts == 8)? MVT::v8i64 : MVT::v16i32;
13504 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13505 // Now we have only mask extension
13506 assert(InVT.getVectorElementType() == MVT::i1);
13507 SDValue Cst = DAG.getTargetConstant(1, ExtVT.getScalarType());
13508 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13509 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
13510 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13511 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13512 MachinePointerInfo::getConstantPool(),
13513 false, false, false, Alignment);
13515 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, DL, ExtVT, In, Ld);
13516 if (VT.is512BitVector())
13518 return DAG.getNode(X86ISD::VTRUNC, DL, VT, Brcst);
13521 static SDValue LowerANY_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13522 SelectionDAG &DAG) {
13523 if (Subtarget->hasFp256()) {
13524 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13532 static SDValue LowerZERO_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
13533 SelectionDAG &DAG) {
13535 MVT VT = Op.getSimpleValueType();
13536 SDValue In = Op.getOperand(0);
13537 MVT SVT = In.getSimpleValueType();
13539 if (VT.is512BitVector() || SVT.getVectorElementType() == MVT::i1)
13540 return LowerZERO_EXTEND_AVX512(Op, DAG);
13542 if (Subtarget->hasFp256()) {
13543 SDValue Res = LowerAVXExtend(Op, DAG, Subtarget);
13548 assert(!VT.is256BitVector() || !SVT.is128BitVector() ||
13549 VT.getVectorNumElements() != SVT.getVectorNumElements());
13553 SDValue X86TargetLowering::LowerTRUNCATE(SDValue Op, SelectionDAG &DAG) const {
13555 MVT VT = Op.getSimpleValueType();
13556 SDValue In = Op.getOperand(0);
13557 MVT InVT = In.getSimpleValueType();
13559 if (VT == MVT::i1) {
13560 assert((InVT.isInteger() && (InVT.getSizeInBits() <= 64)) &&
13561 "Invalid scalar TRUNCATE operation");
13562 if (InVT.getSizeInBits() >= 32)
13564 In = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i32, In);
13565 return DAG.getNode(ISD::TRUNCATE, DL, VT, In);
13567 assert(VT.getVectorNumElements() == InVT.getVectorNumElements() &&
13568 "Invalid TRUNCATE operation");
13570 if (InVT.is512BitVector() || VT.getVectorElementType() == MVT::i1) {
13571 if (VT.getVectorElementType().getSizeInBits() >=8)
13572 return DAG.getNode(X86ISD::VTRUNC, DL, VT, In);
13574 assert(VT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
13575 unsigned NumElts = InVT.getVectorNumElements();
13576 assert ((NumElts == 8 || NumElts == 16) && "Unexpected vector type");
13577 if (InVT.getSizeInBits() < 512) {
13578 MVT ExtVT = (NumElts == 16)? MVT::v16i32 : MVT::v8i64;
13579 In = DAG.getNode(ISD::SIGN_EXTEND, DL, ExtVT, In);
13583 SDValue Cst = DAG.getTargetConstant(1, InVT.getVectorElementType());
13584 const Constant *C = (dyn_cast<ConstantSDNode>(Cst))->getConstantIntValue();
13585 SDValue CP = DAG.getConstantPool(C, getPointerTy());
13586 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
13587 SDValue Ld = DAG.getLoad(Cst.getValueType(), DL, DAG.getEntryNode(), CP,
13588 MachinePointerInfo::getConstantPool(),
13589 false, false, false, Alignment);
13590 SDValue OneV = DAG.getNode(X86ISD::VBROADCAST, DL, InVT, Ld);
13591 SDValue And = DAG.getNode(ISD::AND, DL, InVT, OneV, In);
13592 return DAG.getNode(X86ISD::TESTM, DL, VT, And, And);
13595 if ((VT == MVT::v4i32) && (InVT == MVT::v4i64)) {
13596 // On AVX2, v4i64 -> v4i32 becomes VPERMD.
13597 if (Subtarget->hasInt256()) {
13598 static const int ShufMask[] = {0, 2, 4, 6, -1, -1, -1, -1};
13599 In = DAG.getNode(ISD::BITCAST, DL, MVT::v8i32, In);
13600 In = DAG.getVectorShuffle(MVT::v8i32, DL, In, DAG.getUNDEF(MVT::v8i32),
13602 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, In,
13603 DAG.getIntPtrConstant(0));
13606 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13607 DAG.getIntPtrConstant(0));
13608 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13609 DAG.getIntPtrConstant(2));
13610 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13611 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13612 static const int ShufMask[] = {0, 2, 4, 6};
13613 return DAG.getVectorShuffle(VT, DL, OpLo, OpHi, ShufMask);
13616 if ((VT == MVT::v8i16) && (InVT == MVT::v8i32)) {
13617 // On AVX2, v8i32 -> v8i16 becomed PSHUFB.
13618 if (Subtarget->hasInt256()) {
13619 In = DAG.getNode(ISD::BITCAST, DL, MVT::v32i8, In);
13621 SmallVector<SDValue,32> pshufbMask;
13622 for (unsigned i = 0; i < 2; ++i) {
13623 pshufbMask.push_back(DAG.getConstant(0x0, MVT::i8));
13624 pshufbMask.push_back(DAG.getConstant(0x1, MVT::i8));
13625 pshufbMask.push_back(DAG.getConstant(0x4, MVT::i8));
13626 pshufbMask.push_back(DAG.getConstant(0x5, MVT::i8));
13627 pshufbMask.push_back(DAG.getConstant(0x8, MVT::i8));
13628 pshufbMask.push_back(DAG.getConstant(0x9, MVT::i8));
13629 pshufbMask.push_back(DAG.getConstant(0xc, MVT::i8));
13630 pshufbMask.push_back(DAG.getConstant(0xd, MVT::i8));
13631 for (unsigned j = 0; j < 8; ++j)
13632 pshufbMask.push_back(DAG.getConstant(0x80, MVT::i8));
13634 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v32i8, pshufbMask);
13635 In = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v32i8, In, BV);
13636 In = DAG.getNode(ISD::BITCAST, DL, MVT::v4i64, In);
13638 static const int ShufMask[] = {0, 2, -1, -1};
13639 In = DAG.getVectorShuffle(MVT::v4i64, DL, In, DAG.getUNDEF(MVT::v4i64),
13641 In = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v2i64, In,
13642 DAG.getIntPtrConstant(0));
13643 return DAG.getNode(ISD::BITCAST, DL, VT, In);
13646 SDValue OpLo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13647 DAG.getIntPtrConstant(0));
13649 SDValue OpHi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, MVT::v4i32, In,
13650 DAG.getIntPtrConstant(4));
13652 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpLo);
13653 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, OpHi);
13655 // The PSHUFB mask:
13656 static const int ShufMask1[] = {0, 1, 4, 5, 8, 9, 12, 13,
13657 -1, -1, -1, -1, -1, -1, -1, -1};
13659 SDValue Undef = DAG.getUNDEF(MVT::v16i8);
13660 OpLo = DAG.getVectorShuffle(MVT::v16i8, DL, OpLo, Undef, ShufMask1);
13661 OpHi = DAG.getVectorShuffle(MVT::v16i8, DL, OpHi, Undef, ShufMask1);
13663 OpLo = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpLo);
13664 OpHi = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, OpHi);
13666 // The MOVLHPS Mask:
13667 static const int ShufMask2[] = {0, 1, 4, 5};
13668 SDValue res = DAG.getVectorShuffle(MVT::v4i32, DL, OpLo, OpHi, ShufMask2);
13669 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, res);
13672 // Handle truncation of V256 to V128 using shuffles.
13673 if (!VT.is128BitVector() || !InVT.is256BitVector())
13676 assert(Subtarget->hasFp256() && "256-bit vector without AVX!");
13678 unsigned NumElems = VT.getVectorNumElements();
13679 MVT NVT = MVT::getVectorVT(VT.getVectorElementType(), NumElems * 2);
13681 SmallVector<int, 16> MaskVec(NumElems * 2, -1);
13682 // Prepare truncation shuffle mask
13683 for (unsigned i = 0; i != NumElems; ++i)
13684 MaskVec[i] = i * 2;
13685 SDValue V = DAG.getVectorShuffle(NVT, DL,
13686 DAG.getNode(ISD::BITCAST, DL, NVT, In),
13687 DAG.getUNDEF(NVT), &MaskVec[0]);
13688 return DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, V,
13689 DAG.getIntPtrConstant(0));
13692 SDValue X86TargetLowering::LowerFP_TO_SINT(SDValue Op,
13693 SelectionDAG &DAG) const {
13694 assert(!Op.getSimpleValueType().isVector());
13696 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13697 /*IsSigned=*/ true, /*IsReplace=*/ false);
13698 SDValue FIST = Vals.first, StackSlot = Vals.second;
13699 // If FP_TO_INTHelper failed, the node is actually supposed to be Legal.
13700 if (!FIST.getNode()) return Op;
13702 if (StackSlot.getNode())
13703 // Load the result.
13704 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13705 FIST, StackSlot, MachinePointerInfo(),
13706 false, false, false, 0);
13708 // The node is the result.
13712 SDValue X86TargetLowering::LowerFP_TO_UINT(SDValue Op,
13713 SelectionDAG &DAG) const {
13714 std::pair<SDValue,SDValue> Vals = FP_TO_INTHelper(Op, DAG,
13715 /*IsSigned=*/ false, /*IsReplace=*/ false);
13716 SDValue FIST = Vals.first, StackSlot = Vals.second;
13717 assert(FIST.getNode() && "Unexpected failure");
13719 if (StackSlot.getNode())
13720 // Load the result.
13721 return DAG.getLoad(Op.getValueType(), SDLoc(Op),
13722 FIST, StackSlot, MachinePointerInfo(),
13723 false, false, false, 0);
13725 // The node is the result.
13729 static SDValue LowerFP_EXTEND(SDValue Op, SelectionDAG &DAG) {
13731 MVT VT = Op.getSimpleValueType();
13732 SDValue In = Op.getOperand(0);
13733 MVT SVT = In.getSimpleValueType();
13735 assert(SVT == MVT::v2f32 && "Only customize MVT::v2f32 type legalization!");
13737 return DAG.getNode(X86ISD::VFPEXT, DL, VT,
13738 DAG.getNode(ISD::CONCAT_VECTORS, DL, MVT::v4f32,
13739 In, DAG.getUNDEF(SVT)));
13742 /// The only differences between FABS and FNEG are the mask and the logic op.
13743 /// FNEG also has a folding opportunity for FNEG(FABS(x)).
13744 static SDValue LowerFABSorFNEG(SDValue Op, SelectionDAG &DAG) {
13745 assert((Op.getOpcode() == ISD::FABS || Op.getOpcode() == ISD::FNEG) &&
13746 "Wrong opcode for lowering FABS or FNEG.");
13748 bool IsFABS = (Op.getOpcode() == ISD::FABS);
13750 // If this is a FABS and it has an FNEG user, bail out to fold the combination
13751 // into an FNABS. We'll lower the FABS after that if it is still in use.
13753 for (SDNode *User : Op->uses())
13754 if (User->getOpcode() == ISD::FNEG)
13757 SDValue Op0 = Op.getOperand(0);
13758 bool IsFNABS = !IsFABS && (Op0.getOpcode() == ISD::FABS);
13761 MVT VT = Op.getSimpleValueType();
13762 // Assume scalar op for initialization; update for vector if needed.
13763 // Note that there are no scalar bitwise logical SSE/AVX instructions, so we
13764 // generate a 16-byte vector constant and logic op even for the scalar case.
13765 // Using a 16-byte mask allows folding the load of the mask with
13766 // the logic op, so it can save (~4 bytes) on code size.
13768 unsigned NumElts = VT == MVT::f64 ? 2 : 4;
13769 // FIXME: Use function attribute "OptimizeForSize" and/or CodeGenOpt::Level to
13770 // decide if we should generate a 16-byte constant mask when we only need 4 or
13771 // 8 bytes for the scalar case.
13772 if (VT.isVector()) {
13773 EltVT = VT.getVectorElementType();
13774 NumElts = VT.getVectorNumElements();
13777 unsigned EltBits = EltVT.getSizeInBits();
13778 LLVMContext *Context = DAG.getContext();
13779 // For FABS, mask is 0x7f...; for FNEG, mask is 0x80...
13781 IsFABS ? APInt::getSignedMaxValue(EltBits) : APInt::getSignBit(EltBits);
13782 Constant *C = ConstantInt::get(*Context, MaskElt);
13783 C = ConstantVector::getSplat(NumElts, C);
13784 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13785 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy());
13786 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
13787 SDValue Mask = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13788 MachinePointerInfo::getConstantPool(),
13789 false, false, false, Alignment);
13791 if (VT.isVector()) {
13792 // For a vector, cast operands to a vector type, perform the logic op,
13793 // and cast the result back to the original value type.
13794 MVT VecVT = MVT::getVectorVT(MVT::i64, VT.getSizeInBits() / 64);
13795 SDValue MaskCasted = DAG.getNode(ISD::BITCAST, dl, VecVT, Mask);
13796 SDValue Operand = IsFNABS ?
13797 DAG.getNode(ISD::BITCAST, dl, VecVT, Op0.getOperand(0)) :
13798 DAG.getNode(ISD::BITCAST, dl, VecVT, Op0);
13799 unsigned BitOp = IsFABS ? ISD::AND : IsFNABS ? ISD::OR : ISD::XOR;
13800 return DAG.getNode(ISD::BITCAST, dl, VT,
13801 DAG.getNode(BitOp, dl, VecVT, Operand, MaskCasted));
13804 // If not vector, then scalar.
13805 unsigned BitOp = IsFABS ? X86ISD::FAND : IsFNABS ? X86ISD::FOR : X86ISD::FXOR;
13806 SDValue Operand = IsFNABS ? Op0.getOperand(0) : Op0;
13807 return DAG.getNode(BitOp, dl, VT, Operand, Mask);
13810 static SDValue LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) {
13811 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13812 LLVMContext *Context = DAG.getContext();
13813 SDValue Op0 = Op.getOperand(0);
13814 SDValue Op1 = Op.getOperand(1);
13816 MVT VT = Op.getSimpleValueType();
13817 MVT SrcVT = Op1.getSimpleValueType();
13819 // If second operand is smaller, extend it first.
13820 if (SrcVT.bitsLT(VT)) {
13821 Op1 = DAG.getNode(ISD::FP_EXTEND, dl, VT, Op1);
13824 // And if it is bigger, shrink it first.
13825 if (SrcVT.bitsGT(VT)) {
13826 Op1 = DAG.getNode(ISD::FP_ROUND, dl, VT, Op1, DAG.getIntPtrConstant(1));
13830 // At this point the operands and the result should have the same
13831 // type, and that won't be f80 since that is not custom lowered.
13833 // First get the sign bit of second operand.
13834 SmallVector<Constant*,4> CV;
13835 if (SrcVT == MVT::f64) {
13836 const fltSemantics &Sem = APFloat::IEEEdouble;
13837 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 1ULL << 63))));
13838 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13840 const fltSemantics &Sem = APFloat::IEEEsingle;
13841 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 1U << 31))));
13842 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13843 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13844 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13846 Constant *C = ConstantVector::get(CV);
13847 SDValue CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13848 SDValue Mask1 = DAG.getLoad(SrcVT, dl, DAG.getEntryNode(), CPIdx,
13849 MachinePointerInfo::getConstantPool(),
13850 false, false, false, 16);
13851 SDValue SignBit = DAG.getNode(X86ISD::FAND, dl, SrcVT, Op1, Mask1);
13853 // Shift sign bit right or left if the two operands have different types.
13854 if (SrcVT.bitsGT(VT)) {
13855 // Op0 is MVT::f32, Op1 is MVT::f64.
13856 SignBit = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, MVT::v2f64, SignBit);
13857 SignBit = DAG.getNode(X86ISD::FSRL, dl, MVT::v2f64, SignBit,
13858 DAG.getConstant(32, MVT::i32));
13859 SignBit = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, SignBit);
13860 SignBit = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f32, SignBit,
13861 DAG.getIntPtrConstant(0));
13864 // Clear first operand sign bit.
13866 if (VT == MVT::f64) {
13867 const fltSemantics &Sem = APFloat::IEEEdouble;
13868 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13869 APInt(64, ~(1ULL << 63)))));
13870 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(64, 0))));
13872 const fltSemantics &Sem = APFloat::IEEEsingle;
13873 CV.push_back(ConstantFP::get(*Context, APFloat(Sem,
13874 APInt(32, ~(1U << 31)))));
13875 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13876 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13877 CV.push_back(ConstantFP::get(*Context, APFloat(Sem, APInt(32, 0))));
13879 C = ConstantVector::get(CV);
13880 CPIdx = DAG.getConstantPool(C, TLI.getPointerTy(), 16);
13881 SDValue Mask2 = DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
13882 MachinePointerInfo::getConstantPool(),
13883 false, false, false, 16);
13884 SDValue Val = DAG.getNode(X86ISD::FAND, dl, VT, Op0, Mask2);
13886 // Or the value with the sign bit.
13887 return DAG.getNode(X86ISD::FOR, dl, VT, Val, SignBit);
13890 static SDValue LowerFGETSIGN(SDValue Op, SelectionDAG &DAG) {
13891 SDValue N0 = Op.getOperand(0);
13893 MVT VT = Op.getSimpleValueType();
13895 // Lower ISD::FGETSIGN to (AND (X86ISD::FGETSIGNx86 ...) 1).
13896 SDValue xFGETSIGN = DAG.getNode(X86ISD::FGETSIGNx86, dl, VT, N0,
13897 DAG.getConstant(1, VT));
13898 return DAG.getNode(ISD::AND, dl, VT, xFGETSIGN, DAG.getConstant(1, VT));
13901 // Check whether an OR'd tree is PTEST-able.
13902 static SDValue LowerVectorAllZeroTest(SDValue Op, const X86Subtarget *Subtarget,
13903 SelectionDAG &DAG) {
13904 assert(Op.getOpcode() == ISD::OR && "Only check OR'd tree.");
13906 if (!Subtarget->hasSSE41())
13909 if (!Op->hasOneUse())
13912 SDNode *N = Op.getNode();
13915 SmallVector<SDValue, 8> Opnds;
13916 DenseMap<SDValue, unsigned> VecInMap;
13917 SmallVector<SDValue, 8> VecIns;
13918 EVT VT = MVT::Other;
13920 // Recognize a special case where a vector is casted into wide integer to
13922 Opnds.push_back(N->getOperand(0));
13923 Opnds.push_back(N->getOperand(1));
13925 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
13926 SmallVectorImpl<SDValue>::const_iterator I = Opnds.begin() + Slot;
13927 // BFS traverse all OR'd operands.
13928 if (I->getOpcode() == ISD::OR) {
13929 Opnds.push_back(I->getOperand(0));
13930 Opnds.push_back(I->getOperand(1));
13931 // Re-evaluate the number of nodes to be traversed.
13932 e += 2; // 2 more nodes (LHS and RHS) are pushed.
13936 // Quit if a non-EXTRACT_VECTOR_ELT
13937 if (I->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
13940 // Quit if without a constant index.
13941 SDValue Idx = I->getOperand(1);
13942 if (!isa<ConstantSDNode>(Idx))
13945 SDValue ExtractedFromVec = I->getOperand(0);
13946 DenseMap<SDValue, unsigned>::iterator M = VecInMap.find(ExtractedFromVec);
13947 if (M == VecInMap.end()) {
13948 VT = ExtractedFromVec.getValueType();
13949 // Quit if not 128/256-bit vector.
13950 if (!VT.is128BitVector() && !VT.is256BitVector())
13952 // Quit if not the same type.
13953 if (VecInMap.begin() != VecInMap.end() &&
13954 VT != VecInMap.begin()->first.getValueType())
13956 M = VecInMap.insert(std::make_pair(ExtractedFromVec, 0)).first;
13957 VecIns.push_back(ExtractedFromVec);
13959 M->second |= 1U << cast<ConstantSDNode>(Idx)->getZExtValue();
13962 assert((VT.is128BitVector() || VT.is256BitVector()) &&
13963 "Not extracted from 128-/256-bit vector.");
13965 unsigned FullMask = (1U << VT.getVectorNumElements()) - 1U;
13967 for (DenseMap<SDValue, unsigned>::const_iterator
13968 I = VecInMap.begin(), E = VecInMap.end(); I != E; ++I) {
13969 // Quit if not all elements are used.
13970 if (I->second != FullMask)
13974 EVT TestVT = VT.is128BitVector() ? MVT::v2i64 : MVT::v4i64;
13976 // Cast all vectors into TestVT for PTEST.
13977 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
13978 VecIns[i] = DAG.getNode(ISD::BITCAST, DL, TestVT, VecIns[i]);
13980 // If more than one full vectors are evaluated, OR them first before PTEST.
13981 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
13982 // Each iteration will OR 2 nodes and append the result until there is only
13983 // 1 node left, i.e. the final OR'd value of all vectors.
13984 SDValue LHS = VecIns[Slot];
13985 SDValue RHS = VecIns[Slot + 1];
13986 VecIns.push_back(DAG.getNode(ISD::OR, DL, TestVT, LHS, RHS));
13989 return DAG.getNode(X86ISD::PTEST, DL, MVT::i32,
13990 VecIns.back(), VecIns.back());
13993 /// \brief return true if \c Op has a use that doesn't just read flags.
13994 static bool hasNonFlagsUse(SDValue Op) {
13995 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
13997 SDNode *User = *UI;
13998 unsigned UOpNo = UI.getOperandNo();
13999 if (User->getOpcode() == ISD::TRUNCATE && User->hasOneUse()) {
14000 // Look pass truncate.
14001 UOpNo = User->use_begin().getOperandNo();
14002 User = *User->use_begin();
14005 if (User->getOpcode() != ISD::BRCOND && User->getOpcode() != ISD::SETCC &&
14006 !(User->getOpcode() == ISD::SELECT && UOpNo == 0))
14012 /// Emit nodes that will be selected as "test Op0,Op0", or something
14014 SDValue X86TargetLowering::EmitTest(SDValue Op, unsigned X86CC, SDLoc dl,
14015 SelectionDAG &DAG) const {
14016 if (Op.getValueType() == MVT::i1)
14017 // KORTEST instruction should be selected
14018 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14019 DAG.getConstant(0, Op.getValueType()));
14021 // CF and OF aren't always set the way we want. Determine which
14022 // of these we need.
14023 bool NeedCF = false;
14024 bool NeedOF = false;
14027 case X86::COND_A: case X86::COND_AE:
14028 case X86::COND_B: case X86::COND_BE:
14031 case X86::COND_G: case X86::COND_GE:
14032 case X86::COND_L: case X86::COND_LE:
14033 case X86::COND_O: case X86::COND_NO: {
14034 // Check if we really need to set the
14035 // Overflow flag. If NoSignedWrap is present
14036 // that is not actually needed.
14037 switch (Op->getOpcode()) {
14042 const BinaryWithFlagsSDNode *BinNode =
14043 cast<BinaryWithFlagsSDNode>(Op.getNode());
14044 if (BinNode->hasNoSignedWrap())
14054 // See if we can use the EFLAGS value from the operand instead of
14055 // doing a separate TEST. TEST always sets OF and CF to 0, so unless
14056 // we prove that the arithmetic won't overflow, we can't use OF or CF.
14057 if (Op.getResNo() != 0 || NeedOF || NeedCF) {
14058 // Emit a CMP with 0, which is the TEST pattern.
14059 //if (Op.getValueType() == MVT::i1)
14060 // return DAG.getNode(X86ISD::CMP, dl, MVT::i1, Op,
14061 // DAG.getConstant(0, MVT::i1));
14062 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14063 DAG.getConstant(0, Op.getValueType()));
14065 unsigned Opcode = 0;
14066 unsigned NumOperands = 0;
14068 // Truncate operations may prevent the merge of the SETCC instruction
14069 // and the arithmetic instruction before it. Attempt to truncate the operands
14070 // of the arithmetic instruction and use a reduced bit-width instruction.
14071 bool NeedTruncation = false;
14072 SDValue ArithOp = Op;
14073 if (Op->getOpcode() == ISD::TRUNCATE && Op->hasOneUse()) {
14074 SDValue Arith = Op->getOperand(0);
14075 // Both the trunc and the arithmetic op need to have one user each.
14076 if (Arith->hasOneUse())
14077 switch (Arith.getOpcode()) {
14084 NeedTruncation = true;
14090 // NOTICE: In the code below we use ArithOp to hold the arithmetic operation
14091 // which may be the result of a CAST. We use the variable 'Op', which is the
14092 // non-casted variable when we check for possible users.
14093 switch (ArithOp.getOpcode()) {
14095 // Due to an isel shortcoming, be conservative if this add is likely to be
14096 // selected as part of a load-modify-store instruction. When the root node
14097 // in a match is a store, isel doesn't know how to remap non-chain non-flag
14098 // uses of other nodes in the match, such as the ADD in this case. This
14099 // leads to the ADD being left around and reselected, with the result being
14100 // two adds in the output. Alas, even if none our users are stores, that
14101 // doesn't prove we're O.K. Ergo, if we have any parents that aren't
14102 // CopyToReg or SETCC, eschew INC/DEC. A better fix seems to require
14103 // climbing the DAG back to the root, and it doesn't seem to be worth the
14105 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14106 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14107 if (UI->getOpcode() != ISD::CopyToReg &&
14108 UI->getOpcode() != ISD::SETCC &&
14109 UI->getOpcode() != ISD::STORE)
14112 if (ConstantSDNode *C =
14113 dyn_cast<ConstantSDNode>(ArithOp.getNode()->getOperand(1))) {
14114 // An add of one will be selected as an INC.
14115 if (C->getAPIntValue() == 1 && !Subtarget->slowIncDec()) {
14116 Opcode = X86ISD::INC;
14121 // An add of negative one (subtract of one) will be selected as a DEC.
14122 if (C->getAPIntValue().isAllOnesValue() && !Subtarget->slowIncDec()) {
14123 Opcode = X86ISD::DEC;
14129 // Otherwise use a regular EFLAGS-setting add.
14130 Opcode = X86ISD::ADD;
14135 // If we have a constant logical shift that's only used in a comparison
14136 // against zero turn it into an equivalent AND. This allows turning it into
14137 // a TEST instruction later.
14138 if ((X86CC == X86::COND_E || X86CC == X86::COND_NE) && Op->hasOneUse() &&
14139 isa<ConstantSDNode>(Op->getOperand(1)) && !hasNonFlagsUse(Op)) {
14140 EVT VT = Op.getValueType();
14141 unsigned BitWidth = VT.getSizeInBits();
14142 unsigned ShAmt = Op->getConstantOperandVal(1);
14143 if (ShAmt >= BitWidth) // Avoid undefined shifts.
14145 APInt Mask = ArithOp.getOpcode() == ISD::SRL
14146 ? APInt::getHighBitsSet(BitWidth, BitWidth - ShAmt)
14147 : APInt::getLowBitsSet(BitWidth, BitWidth - ShAmt);
14148 if (!Mask.isSignedIntN(32)) // Avoid large immediates.
14150 SDValue New = DAG.getNode(ISD::AND, dl, VT, Op->getOperand(0),
14151 DAG.getConstant(Mask, VT));
14152 DAG.ReplaceAllUsesWith(Op, New);
14158 // If the primary and result isn't used, don't bother using X86ISD::AND,
14159 // because a TEST instruction will be better.
14160 if (!hasNonFlagsUse(Op))
14166 // Due to the ISEL shortcoming noted above, be conservative if this op is
14167 // likely to be selected as part of a load-modify-store instruction.
14168 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
14169 UE = Op.getNode()->use_end(); UI != UE; ++UI)
14170 if (UI->getOpcode() == ISD::STORE)
14173 // Otherwise use a regular EFLAGS-setting instruction.
14174 switch (ArithOp.getOpcode()) {
14175 default: llvm_unreachable("unexpected operator!");
14176 case ISD::SUB: Opcode = X86ISD::SUB; break;
14177 case ISD::XOR: Opcode = X86ISD::XOR; break;
14178 case ISD::AND: Opcode = X86ISD::AND; break;
14180 if (!NeedTruncation && (X86CC == X86::COND_E || X86CC == X86::COND_NE)) {
14181 SDValue EFLAGS = LowerVectorAllZeroTest(Op, Subtarget, DAG);
14182 if (EFLAGS.getNode())
14185 Opcode = X86ISD::OR;
14199 return SDValue(Op.getNode(), 1);
14205 // If we found that truncation is beneficial, perform the truncation and
14207 if (NeedTruncation) {
14208 EVT VT = Op.getValueType();
14209 SDValue WideVal = Op->getOperand(0);
14210 EVT WideVT = WideVal.getValueType();
14211 unsigned ConvertedOp = 0;
14212 // Use a target machine opcode to prevent further DAGCombine
14213 // optimizations that may separate the arithmetic operations
14214 // from the setcc node.
14215 switch (WideVal.getOpcode()) {
14217 case ISD::ADD: ConvertedOp = X86ISD::ADD; break;
14218 case ISD::SUB: ConvertedOp = X86ISD::SUB; break;
14219 case ISD::AND: ConvertedOp = X86ISD::AND; break;
14220 case ISD::OR: ConvertedOp = X86ISD::OR; break;
14221 case ISD::XOR: ConvertedOp = X86ISD::XOR; break;
14225 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
14226 if (TLI.isOperationLegal(WideVal.getOpcode(), WideVT)) {
14227 SDValue V0 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(0));
14228 SDValue V1 = DAG.getNode(ISD::TRUNCATE, dl, VT, WideVal.getOperand(1));
14229 Op = DAG.getNode(ConvertedOp, dl, VT, V0, V1);
14235 // Emit a CMP with 0, which is the TEST pattern.
14236 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op,
14237 DAG.getConstant(0, Op.getValueType()));
14239 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
14240 SmallVector<SDValue, 4> Ops;
14241 for (unsigned i = 0; i != NumOperands; ++i)
14242 Ops.push_back(Op.getOperand(i));
14244 SDValue New = DAG.getNode(Opcode, dl, VTs, Ops);
14245 DAG.ReplaceAllUsesWith(Op, New);
14246 return SDValue(New.getNode(), 1);
14249 /// Emit nodes that will be selected as "cmp Op0,Op1", or something
14251 SDValue X86TargetLowering::EmitCmp(SDValue Op0, SDValue Op1, unsigned X86CC,
14252 SDLoc dl, SelectionDAG &DAG) const {
14253 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op1)) {
14254 if (C->getAPIntValue() == 0)
14255 return EmitTest(Op0, X86CC, dl, DAG);
14257 if (Op0.getValueType() == MVT::i1)
14258 llvm_unreachable("Unexpected comparison operation for MVT::i1 operands");
14261 if ((Op0.getValueType() == MVT::i8 || Op0.getValueType() == MVT::i16 ||
14262 Op0.getValueType() == MVT::i32 || Op0.getValueType() == MVT::i64)) {
14263 // Do the comparison at i32 if it's smaller, besides the Atom case.
14264 // This avoids subregister aliasing issues. Keep the smaller reference
14265 // if we're optimizing for size, however, as that'll allow better folding
14266 // of memory operations.
14267 if (Op0.getValueType() != MVT::i32 && Op0.getValueType() != MVT::i64 &&
14268 !DAG.getMachineFunction().getFunction()->getAttributes().hasAttribute(
14269 AttributeSet::FunctionIndex, Attribute::MinSize) &&
14270 !Subtarget->isAtom()) {
14271 unsigned ExtendOp =
14272 isX86CCUnsigned(X86CC) ? ISD::ZERO_EXTEND : ISD::SIGN_EXTEND;
14273 Op0 = DAG.getNode(ExtendOp, dl, MVT::i32, Op0);
14274 Op1 = DAG.getNode(ExtendOp, dl, MVT::i32, Op1);
14276 // Use SUB instead of CMP to enable CSE between SUB and CMP.
14277 SDVTList VTs = DAG.getVTList(Op0.getValueType(), MVT::i32);
14278 SDValue Sub = DAG.getNode(X86ISD::SUB, dl, VTs,
14280 return SDValue(Sub.getNode(), 1);
14282 return DAG.getNode(X86ISD::CMP, dl, MVT::i32, Op0, Op1);
14285 /// Convert a comparison if required by the subtarget.
14286 SDValue X86TargetLowering::ConvertCmpIfNecessary(SDValue Cmp,
14287 SelectionDAG &DAG) const {
14288 // If the subtarget does not support the FUCOMI instruction, floating-point
14289 // comparisons have to be converted.
14290 if (Subtarget->hasCMov() ||
14291 Cmp.getOpcode() != X86ISD::CMP ||
14292 !Cmp.getOperand(0).getValueType().isFloatingPoint() ||
14293 !Cmp.getOperand(1).getValueType().isFloatingPoint())
14296 // The instruction selector will select an FUCOM instruction instead of
14297 // FUCOMI, which writes the comparison result to FPSW instead of EFLAGS. Hence
14298 // build an SDNode sequence that transfers the result from FPSW into EFLAGS:
14299 // (X86sahf (trunc (srl (X86fp_stsw (trunc (X86cmp ...)), 8))))
14301 SDValue TruncFPSW = DAG.getNode(ISD::TRUNCATE, dl, MVT::i16, Cmp);
14302 SDValue FNStSW = DAG.getNode(X86ISD::FNSTSW16r, dl, MVT::i16, TruncFPSW);
14303 SDValue Srl = DAG.getNode(ISD::SRL, dl, MVT::i16, FNStSW,
14304 DAG.getConstant(8, MVT::i8));
14305 SDValue TruncSrl = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Srl);
14306 return DAG.getNode(X86ISD::SAHF, dl, MVT::i32, TruncSrl);
14309 static bool isAllOnes(SDValue V) {
14310 ConstantSDNode *C = dyn_cast<ConstantSDNode>(V);
14311 return C && C->isAllOnesValue();
14314 /// LowerToBT - Result of 'and' is compared against zero. Turn it into a BT node
14315 /// if it's possible.
14316 SDValue X86TargetLowering::LowerToBT(SDValue And, ISD::CondCode CC,
14317 SDLoc dl, SelectionDAG &DAG) const {
14318 SDValue Op0 = And.getOperand(0);
14319 SDValue Op1 = And.getOperand(1);
14320 if (Op0.getOpcode() == ISD::TRUNCATE)
14321 Op0 = Op0.getOperand(0);
14322 if (Op1.getOpcode() == ISD::TRUNCATE)
14323 Op1 = Op1.getOperand(0);
14326 if (Op1.getOpcode() == ISD::SHL)
14327 std::swap(Op0, Op1);
14328 if (Op0.getOpcode() == ISD::SHL) {
14329 if (ConstantSDNode *And00C = dyn_cast<ConstantSDNode>(Op0.getOperand(0)))
14330 if (And00C->getZExtValue() == 1) {
14331 // If we looked past a truncate, check that it's only truncating away
14333 unsigned BitWidth = Op0.getValueSizeInBits();
14334 unsigned AndBitWidth = And.getValueSizeInBits();
14335 if (BitWidth > AndBitWidth) {
14337 DAG.computeKnownBits(Op0, Zeros, Ones);
14338 if (Zeros.countLeadingOnes() < BitWidth - AndBitWidth)
14342 RHS = Op0.getOperand(1);
14344 } else if (Op1.getOpcode() == ISD::Constant) {
14345 ConstantSDNode *AndRHS = cast<ConstantSDNode>(Op1);
14346 uint64_t AndRHSVal = AndRHS->getZExtValue();
14347 SDValue AndLHS = Op0;
14349 if (AndRHSVal == 1 && AndLHS.getOpcode() == ISD::SRL) {
14350 LHS = AndLHS.getOperand(0);
14351 RHS = AndLHS.getOperand(1);
14354 // Use BT if the immediate can't be encoded in a TEST instruction.
14355 if (!isUInt<32>(AndRHSVal) && isPowerOf2_64(AndRHSVal)) {
14357 RHS = DAG.getConstant(Log2_64_Ceil(AndRHSVal), LHS.getValueType());
14361 if (LHS.getNode()) {
14362 // If LHS is i8, promote it to i32 with any_extend. There is no i8 BT
14363 // instruction. Since the shift amount is in-range-or-undefined, we know
14364 // that doing a bittest on the i32 value is ok. We extend to i32 because
14365 // the encoding for the i16 version is larger than the i32 version.
14366 // Also promote i16 to i32 for performance / code size reason.
14367 if (LHS.getValueType() == MVT::i8 ||
14368 LHS.getValueType() == MVT::i16)
14369 LHS = DAG.getNode(ISD::ANY_EXTEND, dl, MVT::i32, LHS);
14371 // If the operand types disagree, extend the shift amount to match. Since
14372 // BT ignores high bits (like shifts) we can use anyextend.
14373 if (LHS.getValueType() != RHS.getValueType())
14374 RHS = DAG.getNode(ISD::ANY_EXTEND, dl, LHS.getValueType(), RHS);
14376 SDValue BT = DAG.getNode(X86ISD::BT, dl, MVT::i32, LHS, RHS);
14377 X86::CondCode Cond = CC == ISD::SETEQ ? X86::COND_AE : X86::COND_B;
14378 return DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14379 DAG.getConstant(Cond, MVT::i8), BT);
14385 /// \brief - Turns an ISD::CondCode into a value suitable for SSE floating point
14387 static int translateX86FSETCC(ISD::CondCode SetCCOpcode, SDValue &Op0,
14392 // SSE Condition code mapping:
14401 switch (SetCCOpcode) {
14402 default: llvm_unreachable("Unexpected SETCC condition");
14404 case ISD::SETEQ: SSECC = 0; break;
14406 case ISD::SETGT: Swap = true; // Fallthrough
14408 case ISD::SETOLT: SSECC = 1; break;
14410 case ISD::SETGE: Swap = true; // Fallthrough
14412 case ISD::SETOLE: SSECC = 2; break;
14413 case ISD::SETUO: SSECC = 3; break;
14415 case ISD::SETNE: SSECC = 4; break;
14416 case ISD::SETULE: Swap = true; // Fallthrough
14417 case ISD::SETUGE: SSECC = 5; break;
14418 case ISD::SETULT: Swap = true; // Fallthrough
14419 case ISD::SETUGT: SSECC = 6; break;
14420 case ISD::SETO: SSECC = 7; break;
14422 case ISD::SETONE: SSECC = 8; break;
14425 std::swap(Op0, Op1);
14430 // Lower256IntVSETCC - Break a VSETCC 256-bit integer VSETCC into two new 128
14431 // ones, and then concatenate the result back.
14432 static SDValue Lower256IntVSETCC(SDValue Op, SelectionDAG &DAG) {
14433 MVT VT = Op.getSimpleValueType();
14435 assert(VT.is256BitVector() && Op.getOpcode() == ISD::SETCC &&
14436 "Unsupported value type for operation");
14438 unsigned NumElems = VT.getVectorNumElements();
14440 SDValue CC = Op.getOperand(2);
14442 // Extract the LHS vectors
14443 SDValue LHS = Op.getOperand(0);
14444 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
14445 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
14447 // Extract the RHS vectors
14448 SDValue RHS = Op.getOperand(1);
14449 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
14450 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
14452 // Issue the operation on the smaller types and concatenate the result back
14453 MVT EltVT = VT.getVectorElementType();
14454 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
14455 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
14456 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1, CC),
14457 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2, CC));
14460 static SDValue LowerIntVSETCC_AVX512(SDValue Op, SelectionDAG &DAG,
14461 const X86Subtarget *Subtarget) {
14462 SDValue Op0 = Op.getOperand(0);
14463 SDValue Op1 = Op.getOperand(1);
14464 SDValue CC = Op.getOperand(2);
14465 MVT VT = Op.getSimpleValueType();
14468 assert(Op0.getValueType().getVectorElementType().getSizeInBits() >= 8 &&
14469 Op.getValueType().getScalarType() == MVT::i1 &&
14470 "Cannot set masked compare for this operation");
14472 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14474 bool Unsigned = false;
14477 switch (SetCCOpcode) {
14478 default: llvm_unreachable("Unexpected SETCC condition");
14479 case ISD::SETNE: SSECC = 4; break;
14480 case ISD::SETEQ: Opc = X86ISD::PCMPEQM; break;
14481 case ISD::SETUGT: SSECC = 6; Unsigned = true; break;
14482 case ISD::SETLT: Swap = true; //fall-through
14483 case ISD::SETGT: Opc = X86ISD::PCMPGTM; break;
14484 case ISD::SETULT: SSECC = 1; Unsigned = true; break;
14485 case ISD::SETUGE: SSECC = 5; Unsigned = true; break; //NLT
14486 case ISD::SETGE: Swap = true; SSECC = 2; break; // LE + swap
14487 case ISD::SETULE: Unsigned = true; //fall-through
14488 case ISD::SETLE: SSECC = 2; break;
14492 std::swap(Op0, Op1);
14494 return DAG.getNode(Opc, dl, VT, Op0, Op1);
14495 Opc = Unsigned ? X86ISD::CMPMU: X86ISD::CMPM;
14496 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14497 DAG.getConstant(SSECC, MVT::i8));
14500 /// \brief Try to turn a VSETULT into a VSETULE by modifying its second
14501 /// operand \p Op1. If non-trivial (for example because it's not constant)
14502 /// return an empty value.
14503 static SDValue ChangeVSETULTtoVSETULE(SDLoc dl, SDValue Op1, SelectionDAG &DAG)
14505 BuildVectorSDNode *BV = dyn_cast<BuildVectorSDNode>(Op1.getNode());
14509 MVT VT = Op1.getSimpleValueType();
14510 MVT EVT = VT.getVectorElementType();
14511 unsigned n = VT.getVectorNumElements();
14512 SmallVector<SDValue, 8> ULTOp1;
14514 for (unsigned i = 0; i < n; ++i) {
14515 ConstantSDNode *Elt = dyn_cast<ConstantSDNode>(BV->getOperand(i));
14516 if (!Elt || Elt->isOpaque() || Elt->getValueType(0) != EVT)
14519 // Avoid underflow.
14520 APInt Val = Elt->getAPIntValue();
14524 ULTOp1.push_back(DAG.getConstant(Val - 1, EVT));
14527 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, ULTOp1);
14530 static SDValue LowerVSETCC(SDValue Op, const X86Subtarget *Subtarget,
14531 SelectionDAG &DAG) {
14532 SDValue Op0 = Op.getOperand(0);
14533 SDValue Op1 = Op.getOperand(1);
14534 SDValue CC = Op.getOperand(2);
14535 MVT VT = Op.getSimpleValueType();
14536 ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
14537 bool isFP = Op.getOperand(1).getSimpleValueType().isFloatingPoint();
14542 MVT EltVT = Op0.getSimpleValueType().getVectorElementType();
14543 assert(EltVT == MVT::f32 || EltVT == MVT::f64);
14546 unsigned SSECC = translateX86FSETCC(SetCCOpcode, Op0, Op1);
14547 unsigned Opc = X86ISD::CMPP;
14548 if (Subtarget->hasAVX512() && VT.getVectorElementType() == MVT::i1) {
14549 assert(VT.getVectorNumElements() <= 16);
14550 Opc = X86ISD::CMPM;
14552 // In the two special cases we can't handle, emit two comparisons.
14555 unsigned CombineOpc;
14556 if (SetCCOpcode == ISD::SETUEQ) {
14557 CC0 = 3; CC1 = 0; CombineOpc = ISD::OR;
14559 assert(SetCCOpcode == ISD::SETONE);
14560 CC0 = 7; CC1 = 4; CombineOpc = ISD::AND;
14563 SDValue Cmp0 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14564 DAG.getConstant(CC0, MVT::i8));
14565 SDValue Cmp1 = DAG.getNode(Opc, dl, VT, Op0, Op1,
14566 DAG.getConstant(CC1, MVT::i8));
14567 return DAG.getNode(CombineOpc, dl, VT, Cmp0, Cmp1);
14569 // Handle all other FP comparisons here.
14570 return DAG.getNode(Opc, dl, VT, Op0, Op1,
14571 DAG.getConstant(SSECC, MVT::i8));
14574 // Break 256-bit integer vector compare into smaller ones.
14575 if (VT.is256BitVector() && !Subtarget->hasInt256())
14576 return Lower256IntVSETCC(Op, DAG);
14578 bool MaskResult = (VT.getVectorElementType() == MVT::i1);
14579 EVT OpVT = Op1.getValueType();
14580 if (Subtarget->hasAVX512()) {
14581 if (Op1.getValueType().is512BitVector() ||
14582 (Subtarget->hasBWI() && Subtarget->hasVLX()) ||
14583 (MaskResult && OpVT.getVectorElementType().getSizeInBits() >= 32))
14584 return LowerIntVSETCC_AVX512(Op, DAG, Subtarget);
14586 // In AVX-512 architecture setcc returns mask with i1 elements,
14587 // But there is no compare instruction for i8 and i16 elements in KNL.
14588 // We are not talking about 512-bit operands in this case, these
14589 // types are illegal.
14591 (OpVT.getVectorElementType().getSizeInBits() < 32 &&
14592 OpVT.getVectorElementType().getSizeInBits() >= 8))
14593 return DAG.getNode(ISD::TRUNCATE, dl, VT,
14594 DAG.getNode(ISD::SETCC, dl, OpVT, Op0, Op1, CC));
14597 // We are handling one of the integer comparisons here. Since SSE only has
14598 // GT and EQ comparisons for integer, swapping operands and multiple
14599 // operations may be required for some comparisons.
14601 bool Swap = false, Invert = false, FlipSigns = false, MinMax = false;
14602 bool Subus = false;
14604 switch (SetCCOpcode) {
14605 default: llvm_unreachable("Unexpected SETCC condition");
14606 case ISD::SETNE: Invert = true;
14607 case ISD::SETEQ: Opc = X86ISD::PCMPEQ; break;
14608 case ISD::SETLT: Swap = true;
14609 case ISD::SETGT: Opc = X86ISD::PCMPGT; break;
14610 case ISD::SETGE: Swap = true;
14611 case ISD::SETLE: Opc = X86ISD::PCMPGT;
14612 Invert = true; break;
14613 case ISD::SETULT: Swap = true;
14614 case ISD::SETUGT: Opc = X86ISD::PCMPGT;
14615 FlipSigns = true; break;
14616 case ISD::SETUGE: Swap = true;
14617 case ISD::SETULE: Opc = X86ISD::PCMPGT;
14618 FlipSigns = true; Invert = true; break;
14621 // Special case: Use min/max operations for SETULE/SETUGE
14622 MVT VET = VT.getVectorElementType();
14624 (Subtarget->hasSSE41() && (VET >= MVT::i8 && VET <= MVT::i32))
14625 || (Subtarget->hasSSE2() && (VET == MVT::i8));
14628 switch (SetCCOpcode) {
14630 case ISD::SETULE: Opc = X86ISD::UMIN; MinMax = true; break;
14631 case ISD::SETUGE: Opc = X86ISD::UMAX; MinMax = true; break;
14634 if (MinMax) { Swap = false; Invert = false; FlipSigns = false; }
14637 bool hasSubus = Subtarget->hasSSE2() && (VET == MVT::i8 || VET == MVT::i16);
14638 if (!MinMax && hasSubus) {
14639 // As another special case, use PSUBUS[BW] when it's profitable. E.g. for
14641 // t = psubus Op0, Op1
14642 // pcmpeq t, <0..0>
14643 switch (SetCCOpcode) {
14645 case ISD::SETULT: {
14646 // If the comparison is against a constant we can turn this into a
14647 // setule. With psubus, setule does not require a swap. This is
14648 // beneficial because the constant in the register is no longer
14649 // destructed as the destination so it can be hoisted out of a loop.
14650 // Only do this pre-AVX since vpcmp* is no longer destructive.
14651 if (Subtarget->hasAVX())
14653 SDValue ULEOp1 = ChangeVSETULTtoVSETULE(dl, Op1, DAG);
14654 if (ULEOp1.getNode()) {
14656 Subus = true; Invert = false; Swap = false;
14660 // Psubus is better than flip-sign because it requires no inversion.
14661 case ISD::SETUGE: Subus = true; Invert = false; Swap = true; break;
14662 case ISD::SETULE: Subus = true; Invert = false; Swap = false; break;
14666 Opc = X86ISD::SUBUS;
14672 std::swap(Op0, Op1);
14674 // Check that the operation in question is available (most are plain SSE2,
14675 // but PCMPGTQ and PCMPEQQ have different requirements).
14676 if (VT == MVT::v2i64) {
14677 if (Opc == X86ISD::PCMPGT && !Subtarget->hasSSE42()) {
14678 assert(Subtarget->hasSSE2() && "Don't know how to lower!");
14680 // First cast everything to the right type.
14681 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14682 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14684 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14685 // bits of the inputs before performing those operations. The lower
14686 // compare is always unsigned.
14689 SB = DAG.getConstant(0x80000000U, MVT::v4i32);
14691 SDValue Sign = DAG.getConstant(0x80000000U, MVT::i32);
14692 SDValue Zero = DAG.getConstant(0x00000000U, MVT::i32);
14693 SB = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32,
14694 Sign, Zero, Sign, Zero);
14696 Op0 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op0, SB);
14697 Op1 = DAG.getNode(ISD::XOR, dl, MVT::v4i32, Op1, SB);
14699 // Emulate PCMPGTQ with (hi1 > hi2) | ((hi1 == hi2) & (lo1 > lo2))
14700 SDValue GT = DAG.getNode(X86ISD::PCMPGT, dl, MVT::v4i32, Op0, Op1);
14701 SDValue EQ = DAG.getNode(X86ISD::PCMPEQ, dl, MVT::v4i32, Op0, Op1);
14703 // Create masks for only the low parts/high parts of the 64 bit integers.
14704 static const int MaskHi[] = { 1, 1, 3, 3 };
14705 static const int MaskLo[] = { 0, 0, 2, 2 };
14706 SDValue EQHi = DAG.getVectorShuffle(MVT::v4i32, dl, EQ, EQ, MaskHi);
14707 SDValue GTLo = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskLo);
14708 SDValue GTHi = DAG.getVectorShuffle(MVT::v4i32, dl, GT, GT, MaskHi);
14710 SDValue Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, EQHi, GTLo);
14711 Result = DAG.getNode(ISD::OR, dl, MVT::v4i32, Result, GTHi);
14714 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14716 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14719 if (Opc == X86ISD::PCMPEQ && !Subtarget->hasSSE41()) {
14720 // If pcmpeqq is missing but pcmpeqd is available synthesize pcmpeqq with
14721 // pcmpeqd + pshufd + pand.
14722 assert(Subtarget->hasSSE2() && !FlipSigns && "Don't know how to lower!");
14724 // First cast everything to the right type.
14725 Op0 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op0);
14726 Op1 = DAG.getNode(ISD::BITCAST, dl, MVT::v4i32, Op1);
14729 SDValue Result = DAG.getNode(Opc, dl, MVT::v4i32, Op0, Op1);
14731 // Make sure the lower and upper halves are both all-ones.
14732 static const int Mask[] = { 1, 0, 3, 2 };
14733 SDValue Shuf = DAG.getVectorShuffle(MVT::v4i32, dl, Result, Result, Mask);
14734 Result = DAG.getNode(ISD::AND, dl, MVT::v4i32, Result, Shuf);
14737 Result = DAG.getNOT(dl, Result, MVT::v4i32);
14739 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
14743 // Since SSE has no unsigned integer comparisons, we need to flip the sign
14744 // bits of the inputs before performing those operations.
14746 EVT EltVT = VT.getVectorElementType();
14747 SDValue SB = DAG.getConstant(APInt::getSignBit(EltVT.getSizeInBits()), VT);
14748 Op0 = DAG.getNode(ISD::XOR, dl, VT, Op0, SB);
14749 Op1 = DAG.getNode(ISD::XOR, dl, VT, Op1, SB);
14752 SDValue Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
14754 // If the logical-not of the result is required, perform that now.
14756 Result = DAG.getNOT(dl, Result, VT);
14759 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Op0, Result);
14762 Result = DAG.getNode(X86ISD::PCMPEQ, dl, VT, Result,
14763 getZeroVector(VT, Subtarget, DAG, dl));
14768 SDValue X86TargetLowering::LowerSETCC(SDValue Op, SelectionDAG &DAG) const {
14770 MVT VT = Op.getSimpleValueType();
14772 if (VT.isVector()) return LowerVSETCC(Op, Subtarget, DAG);
14774 assert(((!Subtarget->hasAVX512() && VT == MVT::i8) || (VT == MVT::i1))
14775 && "SetCC type must be 8-bit or 1-bit integer");
14776 SDValue Op0 = Op.getOperand(0);
14777 SDValue Op1 = Op.getOperand(1);
14779 ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
14781 // Optimize to BT if possible.
14782 // Lower (X & (1 << N)) == 0 to BT(X, N).
14783 // Lower ((X >>u N) & 1) != 0 to BT(X, N).
14784 // Lower ((X >>s N) & 1) != 0 to BT(X, N).
14785 if (Op0.getOpcode() == ISD::AND && Op0.hasOneUse() &&
14786 Op1.getOpcode() == ISD::Constant &&
14787 cast<ConstantSDNode>(Op1)->isNullValue() &&
14788 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14789 SDValue NewSetCC = LowerToBT(Op0, CC, dl, DAG);
14790 if (NewSetCC.getNode())
14794 // Look for X == 0, X == 1, X != 0, or X != 1. We can simplify some forms of
14796 if (Op1.getOpcode() == ISD::Constant &&
14797 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1 ||
14798 cast<ConstantSDNode>(Op1)->isNullValue()) &&
14799 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14801 // If the input is a setcc, then reuse the input setcc or use a new one with
14802 // the inverted condition.
14803 if (Op0.getOpcode() == X86ISD::SETCC) {
14804 X86::CondCode CCode = (X86::CondCode)Op0.getConstantOperandVal(0);
14805 bool Invert = (CC == ISD::SETNE) ^
14806 cast<ConstantSDNode>(Op1)->isNullValue();
14810 CCode = X86::GetOppositeBranchCondition(CCode);
14811 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14812 DAG.getConstant(CCode, MVT::i8),
14813 Op0.getOperand(1));
14815 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14819 if ((Op0.getValueType() == MVT::i1) && (Op1.getOpcode() == ISD::Constant) &&
14820 (cast<ConstantSDNode>(Op1)->getZExtValue() == 1) &&
14821 (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14823 ISD::CondCode NewCC = ISD::getSetCCInverse(CC, true);
14824 return DAG.getSetCC(dl, VT, Op0, DAG.getConstant(0, MVT::i1), NewCC);
14827 bool isFP = Op1.getSimpleValueType().isFloatingPoint();
14828 unsigned X86CC = TranslateX86CC(CC, isFP, Op0, Op1, DAG);
14829 if (X86CC == X86::COND_INVALID)
14832 SDValue EFLAGS = EmitCmp(Op0, Op1, X86CC, dl, DAG);
14833 EFLAGS = ConvertCmpIfNecessary(EFLAGS, DAG);
14834 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
14835 DAG.getConstant(X86CC, MVT::i8), EFLAGS);
14837 return DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, SetCC);
14841 // isX86LogicalCmp - Return true if opcode is a X86 logical comparison.
14842 static bool isX86LogicalCmp(SDValue Op) {
14843 unsigned Opc = Op.getNode()->getOpcode();
14844 if (Opc == X86ISD::CMP || Opc == X86ISD::COMI || Opc == X86ISD::UCOMI ||
14845 Opc == X86ISD::SAHF)
14847 if (Op.getResNo() == 1 &&
14848 (Opc == X86ISD::ADD ||
14849 Opc == X86ISD::SUB ||
14850 Opc == X86ISD::ADC ||
14851 Opc == X86ISD::SBB ||
14852 Opc == X86ISD::SMUL ||
14853 Opc == X86ISD::UMUL ||
14854 Opc == X86ISD::INC ||
14855 Opc == X86ISD::DEC ||
14856 Opc == X86ISD::OR ||
14857 Opc == X86ISD::XOR ||
14858 Opc == X86ISD::AND))
14861 if (Op.getResNo() == 2 && Opc == X86ISD::UMUL)
14867 static bool isTruncWithZeroHighBitsInput(SDValue V, SelectionDAG &DAG) {
14868 if (V.getOpcode() != ISD::TRUNCATE)
14871 SDValue VOp0 = V.getOperand(0);
14872 unsigned InBits = VOp0.getValueSizeInBits();
14873 unsigned Bits = V.getValueSizeInBits();
14874 return DAG.MaskedValueIsZero(VOp0, APInt::getHighBitsSet(InBits,InBits-Bits));
14877 SDValue X86TargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
14878 bool addTest = true;
14879 SDValue Cond = Op.getOperand(0);
14880 SDValue Op1 = Op.getOperand(1);
14881 SDValue Op2 = Op.getOperand(2);
14883 EVT VT = Op1.getValueType();
14886 // Lower fp selects into a CMP/AND/ANDN/OR sequence when the necessary SSE ops
14887 // are available. Otherwise fp cmovs get lowered into a less efficient branch
14888 // sequence later on.
14889 if (Cond.getOpcode() == ISD::SETCC &&
14890 ((Subtarget->hasSSE2() && (VT == MVT::f32 || VT == MVT::f64)) ||
14891 (Subtarget->hasSSE1() && VT == MVT::f32)) &&
14892 VT == Cond.getOperand(0).getValueType() && Cond->hasOneUse()) {
14893 SDValue CondOp0 = Cond.getOperand(0), CondOp1 = Cond.getOperand(1);
14894 int SSECC = translateX86FSETCC(
14895 cast<CondCodeSDNode>(Cond.getOperand(2))->get(), CondOp0, CondOp1);
14898 if (Subtarget->hasAVX512()) {
14899 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CondOp0, CondOp1,
14900 DAG.getConstant(SSECC, MVT::i8));
14901 return DAG.getNode(X86ISD::SELECT, DL, VT, Cmp, Op1, Op2);
14903 SDValue Cmp = DAG.getNode(X86ISD::FSETCC, DL, VT, CondOp0, CondOp1,
14904 DAG.getConstant(SSECC, MVT::i8));
14905 SDValue AndN = DAG.getNode(X86ISD::FANDN, DL, VT, Cmp, Op2);
14906 SDValue And = DAG.getNode(X86ISD::FAND, DL, VT, Cmp, Op1);
14907 return DAG.getNode(X86ISD::FOR, DL, VT, AndN, And);
14911 if (Cond.getOpcode() == ISD::SETCC) {
14912 SDValue NewCond = LowerSETCC(Cond, DAG);
14913 if (NewCond.getNode())
14917 // (select (x == 0), -1, y) -> (sign_bit (x - 1)) | y
14918 // (select (x == 0), y, -1) -> ~(sign_bit (x - 1)) | y
14919 // (select (x != 0), y, -1) -> (sign_bit (x - 1)) | y
14920 // (select (x != 0), -1, y) -> ~(sign_bit (x - 1)) | y
14921 if (Cond.getOpcode() == X86ISD::SETCC &&
14922 Cond.getOperand(1).getOpcode() == X86ISD::CMP &&
14923 isZero(Cond.getOperand(1).getOperand(1))) {
14924 SDValue Cmp = Cond.getOperand(1);
14926 unsigned CondCode =cast<ConstantSDNode>(Cond.getOperand(0))->getZExtValue();
14928 if ((isAllOnes(Op1) || isAllOnes(Op2)) &&
14929 (CondCode == X86::COND_E || CondCode == X86::COND_NE)) {
14930 SDValue Y = isAllOnes(Op2) ? Op1 : Op2;
14932 SDValue CmpOp0 = Cmp.getOperand(0);
14933 // Apply further optimizations for special cases
14934 // (select (x != 0), -1, 0) -> neg & sbb
14935 // (select (x == 0), 0, -1) -> neg & sbb
14936 if (ConstantSDNode *YC = dyn_cast<ConstantSDNode>(Y))
14937 if (YC->isNullValue() &&
14938 (isAllOnes(Op1) == (CondCode == X86::COND_NE))) {
14939 SDVTList VTs = DAG.getVTList(CmpOp0.getValueType(), MVT::i32);
14940 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, VTs,
14941 DAG.getConstant(0, CmpOp0.getValueType()),
14943 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14944 DAG.getConstant(X86::COND_B, MVT::i8),
14945 SDValue(Neg.getNode(), 1));
14949 Cmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32,
14950 CmpOp0, DAG.getConstant(1, CmpOp0.getValueType()));
14951 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
14953 SDValue Res = // Res = 0 or -1.
14954 DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
14955 DAG.getConstant(X86::COND_B, MVT::i8), Cmp);
14957 if (isAllOnes(Op1) != (CondCode == X86::COND_E))
14958 Res = DAG.getNOT(DL, Res, Res.getValueType());
14960 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(Op2);
14961 if (!N2C || !N2C->isNullValue())
14962 Res = DAG.getNode(ISD::OR, DL, Res.getValueType(), Res, Y);
14967 // Look past (and (setcc_carry (cmp ...)), 1).
14968 if (Cond.getOpcode() == ISD::AND &&
14969 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
14970 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
14971 if (C && C->getAPIntValue() == 1)
14972 Cond = Cond.getOperand(0);
14975 // If condition flag is set by a X86ISD::CMP, then use it as the condition
14976 // setting operand in place of the X86ISD::SETCC.
14977 unsigned CondOpcode = Cond.getOpcode();
14978 if (CondOpcode == X86ISD::SETCC ||
14979 CondOpcode == X86ISD::SETCC_CARRY) {
14980 CC = Cond.getOperand(0);
14982 SDValue Cmp = Cond.getOperand(1);
14983 unsigned Opc = Cmp.getOpcode();
14984 MVT VT = Op.getSimpleValueType();
14986 bool IllegalFPCMov = false;
14987 if (VT.isFloatingPoint() && !VT.isVector() &&
14988 !isScalarFPTypeInSSEReg(VT)) // FPStack?
14989 IllegalFPCMov = !hasFPCMov(cast<ConstantSDNode>(CC)->getSExtValue());
14991 if ((isX86LogicalCmp(Cmp) && !IllegalFPCMov) ||
14992 Opc == X86ISD::BT) { // FIXME
14996 } else if (CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
14997 CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
14998 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
14999 Cond.getOperand(0).getValueType() != MVT::i8)) {
15000 SDValue LHS = Cond.getOperand(0);
15001 SDValue RHS = Cond.getOperand(1);
15002 unsigned X86Opcode;
15005 switch (CondOpcode) {
15006 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15007 case ISD::SADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15008 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15009 case ISD::SSUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15010 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15011 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15012 default: llvm_unreachable("unexpected overflowing operator");
15014 if (CondOpcode == ISD::UMULO)
15015 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15018 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15020 SDValue X86Op = DAG.getNode(X86Opcode, DL, VTs, LHS, RHS);
15022 if (CondOpcode == ISD::UMULO)
15023 Cond = X86Op.getValue(2);
15025 Cond = X86Op.getValue(1);
15027 CC = DAG.getConstant(X86Cond, MVT::i8);
15032 // Look pass the truncate if the high bits are known zero.
15033 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15034 Cond = Cond.getOperand(0);
15036 // We know the result of AND is compared against zero. Try to match
15038 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15039 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, DL, DAG);
15040 if (NewSetCC.getNode()) {
15041 CC = NewSetCC.getOperand(0);
15042 Cond = NewSetCC.getOperand(1);
15049 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15050 Cond = EmitTest(Cond, X86::COND_NE, DL, DAG);
15053 // a < b ? -1 : 0 -> RES = ~setcc_carry
15054 // a < b ? 0 : -1 -> RES = setcc_carry
15055 // a >= b ? -1 : 0 -> RES = setcc_carry
15056 // a >= b ? 0 : -1 -> RES = ~setcc_carry
15057 if (Cond.getOpcode() == X86ISD::SUB) {
15058 Cond = ConvertCmpIfNecessary(Cond, DAG);
15059 unsigned CondCode = cast<ConstantSDNode>(CC)->getZExtValue();
15061 if ((CondCode == X86::COND_AE || CondCode == X86::COND_B) &&
15062 (isAllOnes(Op1) || isAllOnes(Op2)) && (isZero(Op1) || isZero(Op2))) {
15063 SDValue Res = DAG.getNode(X86ISD::SETCC_CARRY, DL, Op.getValueType(),
15064 DAG.getConstant(X86::COND_B, MVT::i8), Cond);
15065 if (isAllOnes(Op1) != (CondCode == X86::COND_B))
15066 return DAG.getNOT(DL, Res, Res.getValueType());
15071 // X86 doesn't have an i8 cmov. If both operands are the result of a truncate
15072 // widen the cmov and push the truncate through. This avoids introducing a new
15073 // branch during isel and doesn't add any extensions.
15074 if (Op.getValueType() == MVT::i8 &&
15075 Op1.getOpcode() == ISD::TRUNCATE && Op2.getOpcode() == ISD::TRUNCATE) {
15076 SDValue T1 = Op1.getOperand(0), T2 = Op2.getOperand(0);
15077 if (T1.getValueType() == T2.getValueType() &&
15078 // Blacklist CopyFromReg to avoid partial register stalls.
15079 T1.getOpcode() != ISD::CopyFromReg && T2.getOpcode()!=ISD::CopyFromReg){
15080 SDVTList VTs = DAG.getVTList(T1.getValueType(), MVT::Glue);
15081 SDValue Cmov = DAG.getNode(X86ISD::CMOV, DL, VTs, T2, T1, CC, Cond);
15082 return DAG.getNode(ISD::TRUNCATE, DL, Op.getValueType(), Cmov);
15086 // X86ISD::CMOV means set the result (which is operand 1) to the RHS if
15087 // condition is true.
15088 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::Glue);
15089 SDValue Ops[] = { Op2, Op1, CC, Cond };
15090 return DAG.getNode(X86ISD::CMOV, DL, VTs, Ops);
15093 static SDValue LowerSIGN_EXTEND_AVX512(SDValue Op, SelectionDAG &DAG) {
15094 MVT VT = Op->getSimpleValueType(0);
15095 SDValue In = Op->getOperand(0);
15096 MVT InVT = In.getSimpleValueType();
15099 unsigned int NumElts = VT.getVectorNumElements();
15100 if (NumElts != 8 && NumElts != 16)
15103 if (VT.is512BitVector() && InVT.getVectorElementType() != MVT::i1)
15104 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15106 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15107 assert (InVT.getVectorElementType() == MVT::i1 && "Unexpected vector type");
15109 MVT ExtVT = (NumElts == 8) ? MVT::v8i64 : MVT::v16i32;
15110 Constant *C = ConstantInt::get(*DAG.getContext(),
15111 APInt::getAllOnesValue(ExtVT.getScalarType().getSizeInBits()));
15113 SDValue CP = DAG.getConstantPool(C, TLI.getPointerTy());
15114 unsigned Alignment = cast<ConstantPoolSDNode>(CP)->getAlignment();
15115 SDValue Ld = DAG.getLoad(ExtVT.getScalarType(), dl, DAG.getEntryNode(), CP,
15116 MachinePointerInfo::getConstantPool(),
15117 false, false, false, Alignment);
15118 SDValue Brcst = DAG.getNode(X86ISD::VBROADCASTM, dl, ExtVT, In, Ld);
15119 if (VT.is512BitVector())
15121 return DAG.getNode(X86ISD::VTRUNC, dl, VT, Brcst);
15124 static SDValue LowerSIGN_EXTEND(SDValue Op, const X86Subtarget *Subtarget,
15125 SelectionDAG &DAG) {
15126 MVT VT = Op->getSimpleValueType(0);
15127 SDValue In = Op->getOperand(0);
15128 MVT InVT = In.getSimpleValueType();
15131 if (VT.is512BitVector() || InVT.getVectorElementType() == MVT::i1)
15132 return LowerSIGN_EXTEND_AVX512(Op, DAG);
15134 if ((VT != MVT::v4i64 || InVT != MVT::v4i32) &&
15135 (VT != MVT::v8i32 || InVT != MVT::v8i16) &&
15136 (VT != MVT::v16i16 || InVT != MVT::v16i8))
15139 if (Subtarget->hasInt256())
15140 return DAG.getNode(X86ISD::VSEXT, dl, VT, In);
15142 // Optimize vectors in AVX mode
15143 // Sign extend v8i16 to v8i32 and
15146 // Divide input vector into two parts
15147 // for v4i32 the shuffle mask will be { 0, 1, -1, -1} {2, 3, -1, -1}
15148 // use vpmovsx instruction to extend v4i32 -> v2i64; v8i16 -> v4i32
15149 // concat the vectors to original VT
15151 unsigned NumElems = InVT.getVectorNumElements();
15152 SDValue Undef = DAG.getUNDEF(InVT);
15154 SmallVector<int,8> ShufMask1(NumElems, -1);
15155 for (unsigned i = 0; i != NumElems/2; ++i)
15158 SDValue OpLo = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask1[0]);
15160 SmallVector<int,8> ShufMask2(NumElems, -1);
15161 for (unsigned i = 0; i != NumElems/2; ++i)
15162 ShufMask2[i] = i + NumElems/2;
15164 SDValue OpHi = DAG.getVectorShuffle(InVT, dl, In, Undef, &ShufMask2[0]);
15166 MVT HalfVT = MVT::getVectorVT(VT.getScalarType(),
15167 VT.getVectorNumElements()/2);
15169 OpLo = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpLo);
15170 OpHi = DAG.getNode(X86ISD::VSEXT, dl, HalfVT, OpHi);
15172 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, OpLo, OpHi);
15175 // Lower vector extended loads using a shuffle. If SSSE3 is not available we
15176 // may emit an illegal shuffle but the expansion is still better than scalar
15177 // code. We generate X86ISD::VSEXT for SEXTLOADs if it's available, otherwise
15178 // we'll emit a shuffle and a arithmetic shift.
15179 // TODO: It is possible to support ZExt by zeroing the undef values during
15180 // the shuffle phase or after the shuffle.
15181 static SDValue LowerExtendedLoad(SDValue Op, const X86Subtarget *Subtarget,
15182 SelectionDAG &DAG) {
15183 MVT RegVT = Op.getSimpleValueType();
15184 assert(RegVT.isVector() && "We only custom lower vector sext loads.");
15185 assert(RegVT.isInteger() &&
15186 "We only custom lower integer vector sext loads.");
15188 // Nothing useful we can do without SSE2 shuffles.
15189 assert(Subtarget->hasSSE2() && "We only custom lower sext loads with SSE2.");
15191 LoadSDNode *Ld = cast<LoadSDNode>(Op.getNode());
15193 EVT MemVT = Ld->getMemoryVT();
15194 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15195 unsigned RegSz = RegVT.getSizeInBits();
15197 ISD::LoadExtType Ext = Ld->getExtensionType();
15199 assert((Ext == ISD::EXTLOAD || Ext == ISD::SEXTLOAD)
15200 && "Only anyext and sext are currently implemented.");
15201 assert(MemVT != RegVT && "Cannot extend to the same type");
15202 assert(MemVT.isVector() && "Must load a vector from memory");
15204 unsigned NumElems = RegVT.getVectorNumElements();
15205 unsigned MemSz = MemVT.getSizeInBits();
15206 assert(RegSz > MemSz && "Register size must be greater than the mem size");
15208 if (Ext == ISD::SEXTLOAD && RegSz == 256 && !Subtarget->hasInt256()) {
15209 // The only way in which we have a legal 256-bit vector result but not the
15210 // integer 256-bit operations needed to directly lower a sextload is if we
15211 // have AVX1 but not AVX2. In that case, we can always emit a sextload to
15212 // a 128-bit vector and a normal sign_extend to 256-bits that should get
15213 // correctly legalized. We do this late to allow the canonical form of
15214 // sextload to persist throughout the rest of the DAG combiner -- it wants
15215 // to fold together any extensions it can, and so will fuse a sign_extend
15216 // of an sextload into a sextload targeting a wider value.
15218 if (MemSz == 128) {
15219 // Just switch this to a normal load.
15220 assert(TLI.isTypeLegal(MemVT) && "If the memory type is a 128-bit type, "
15221 "it must be a legal 128-bit vector "
15223 Load = DAG.getLoad(MemVT, dl, Ld->getChain(), Ld->getBasePtr(),
15224 Ld->getPointerInfo(), Ld->isVolatile(), Ld->isNonTemporal(),
15225 Ld->isInvariant(), Ld->getAlignment());
15227 assert(MemSz < 128 &&
15228 "Can't extend a type wider than 128 bits to a 256 bit vector!");
15229 // Do an sext load to a 128-bit vector type. We want to use the same
15230 // number of elements, but elements half as wide. This will end up being
15231 // recursively lowered by this routine, but will succeed as we definitely
15232 // have all the necessary features if we're using AVX1.
15234 EVT::getIntegerVT(*DAG.getContext(), RegVT.getScalarSizeInBits() / 2);
15235 EVT HalfVecVT = EVT::getVectorVT(*DAG.getContext(), HalfEltVT, NumElems);
15237 DAG.getExtLoad(Ext, dl, HalfVecVT, Ld->getChain(), Ld->getBasePtr(),
15238 Ld->getPointerInfo(), MemVT, Ld->isVolatile(),
15239 Ld->isNonTemporal(), Ld->isInvariant(),
15240 Ld->getAlignment());
15243 // Replace chain users with the new chain.
15244 assert(Load->getNumValues() == 2 && "Loads must carry a chain!");
15245 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), Load.getValue(1));
15247 // Finally, do a normal sign-extend to the desired register.
15248 return DAG.getSExtOrTrunc(Load, dl, RegVT);
15251 // All sizes must be a power of two.
15252 assert(isPowerOf2_32(RegSz * MemSz * NumElems) &&
15253 "Non-power-of-two elements are not custom lowered!");
15255 // Attempt to load the original value using scalar loads.
15256 // Find the largest scalar type that divides the total loaded size.
15257 MVT SclrLoadTy = MVT::i8;
15258 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
15259 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
15260 MVT Tp = (MVT::SimpleValueType)tp;
15261 if (TLI.isTypeLegal(Tp) && ((MemSz % Tp.getSizeInBits()) == 0)) {
15266 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
15267 if (TLI.isTypeLegal(MVT::f64) && SclrLoadTy.getSizeInBits() < 64 &&
15269 SclrLoadTy = MVT::f64;
15271 // Calculate the number of scalar loads that we need to perform
15272 // in order to load our vector from memory.
15273 unsigned NumLoads = MemSz / SclrLoadTy.getSizeInBits();
15275 assert((Ext != ISD::SEXTLOAD || NumLoads == 1) &&
15276 "Can only lower sext loads with a single scalar load!");
15278 unsigned loadRegZize = RegSz;
15279 if (Ext == ISD::SEXTLOAD && RegSz == 256)
15282 // Represent our vector as a sequence of elements which are the
15283 // largest scalar that we can load.
15284 EVT LoadUnitVecVT = EVT::getVectorVT(
15285 *DAG.getContext(), SclrLoadTy, loadRegZize / SclrLoadTy.getSizeInBits());
15287 // Represent the data using the same element type that is stored in
15288 // memory. In practice, we ''widen'' MemVT.
15290 EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
15291 loadRegZize / MemVT.getScalarType().getSizeInBits());
15293 assert(WideVecVT.getSizeInBits() == LoadUnitVecVT.getSizeInBits() &&
15294 "Invalid vector type");
15296 // We can't shuffle using an illegal type.
15297 assert(TLI.isTypeLegal(WideVecVT) &&
15298 "We only lower types that form legal widened vector types");
15300 SmallVector<SDValue, 8> Chains;
15301 SDValue Ptr = Ld->getBasePtr();
15302 SDValue Increment =
15303 DAG.getConstant(SclrLoadTy.getSizeInBits() / 8, TLI.getPointerTy());
15304 SDValue Res = DAG.getUNDEF(LoadUnitVecVT);
15306 for (unsigned i = 0; i < NumLoads; ++i) {
15307 // Perform a single load.
15308 SDValue ScalarLoad =
15309 DAG.getLoad(SclrLoadTy, dl, Ld->getChain(), Ptr, Ld->getPointerInfo(),
15310 Ld->isVolatile(), Ld->isNonTemporal(), Ld->isInvariant(),
15311 Ld->getAlignment());
15312 Chains.push_back(ScalarLoad.getValue(1));
15313 // Create the first element type using SCALAR_TO_VECTOR in order to avoid
15314 // another round of DAGCombining.
15316 Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, LoadUnitVecVT, ScalarLoad);
15318 Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, LoadUnitVecVT, Res,
15319 ScalarLoad, DAG.getIntPtrConstant(i));
15321 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
15324 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
15326 // Bitcast the loaded value to a vector of the original element type, in
15327 // the size of the target vector type.
15328 SDValue SlicedVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, Res);
15329 unsigned SizeRatio = RegSz / MemSz;
15331 if (Ext == ISD::SEXTLOAD) {
15332 // If we have SSE4.1, we can directly emit a VSEXT node.
15333 if (Subtarget->hasSSE41()) {
15334 SDValue Sext = DAG.getNode(X86ISD::VSEXT, dl, RegVT, SlicedVec);
15335 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15339 // Otherwise we'll shuffle the small elements in the high bits of the
15340 // larger type and perform an arithmetic shift. If the shift is not legal
15341 // it's better to scalarize.
15342 assert(TLI.isOperationLegalOrCustom(ISD::SRA, RegVT) &&
15343 "We can't implement a sext load without an arithmetic right shift!");
15345 // Redistribute the loaded elements into the different locations.
15346 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15347 for (unsigned i = 0; i != NumElems; ++i)
15348 ShuffleVec[i * SizeRatio + SizeRatio - 1] = i;
15350 SDValue Shuff = DAG.getVectorShuffle(
15351 WideVecVT, dl, SlicedVec, DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15353 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15355 // Build the arithmetic shift.
15356 unsigned Amt = RegVT.getVectorElementType().getSizeInBits() -
15357 MemVT.getVectorElementType().getSizeInBits();
15359 DAG.getNode(ISD::SRA, dl, RegVT, Shuff, DAG.getConstant(Amt, RegVT));
15361 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15365 // Redistribute the loaded elements into the different locations.
15366 SmallVector<int, 16> ShuffleVec(NumElems * SizeRatio, -1);
15367 for (unsigned i = 0; i != NumElems; ++i)
15368 ShuffleVec[i * SizeRatio] = i;
15370 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, SlicedVec,
15371 DAG.getUNDEF(WideVecVT), &ShuffleVec[0]);
15373 // Bitcast to the requested type.
15374 Shuff = DAG.getNode(ISD::BITCAST, dl, RegVT, Shuff);
15375 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), TF);
15379 // isAndOrOfSingleUseSetCCs - Return true if node is an ISD::AND or
15380 // ISD::OR of two X86ISD::SETCC nodes each of which has no other use apart
15381 // from the AND / OR.
15382 static bool isAndOrOfSetCCs(SDValue Op, unsigned &Opc) {
15383 Opc = Op.getOpcode();
15384 if (Opc != ISD::OR && Opc != ISD::AND)
15386 return (Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15387 Op.getOperand(0).hasOneUse() &&
15388 Op.getOperand(1).getOpcode() == X86ISD::SETCC &&
15389 Op.getOperand(1).hasOneUse());
15392 // isXor1OfSetCC - Return true if node is an ISD::XOR of a X86ISD::SETCC and
15393 // 1 and that the SETCC node has a single use.
15394 static bool isXor1OfSetCC(SDValue Op) {
15395 if (Op.getOpcode() != ISD::XOR)
15397 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
15398 if (N1C && N1C->getAPIntValue() == 1) {
15399 return Op.getOperand(0).getOpcode() == X86ISD::SETCC &&
15400 Op.getOperand(0).hasOneUse();
15405 SDValue X86TargetLowering::LowerBRCOND(SDValue Op, SelectionDAG &DAG) const {
15406 bool addTest = true;
15407 SDValue Chain = Op.getOperand(0);
15408 SDValue Cond = Op.getOperand(1);
15409 SDValue Dest = Op.getOperand(2);
15412 bool Inverted = false;
15414 if (Cond.getOpcode() == ISD::SETCC) {
15415 // Check for setcc([su]{add,sub,mul}o == 0).
15416 if (cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETEQ &&
15417 isa<ConstantSDNode>(Cond.getOperand(1)) &&
15418 cast<ConstantSDNode>(Cond.getOperand(1))->isNullValue() &&
15419 Cond.getOperand(0).getResNo() == 1 &&
15420 (Cond.getOperand(0).getOpcode() == ISD::SADDO ||
15421 Cond.getOperand(0).getOpcode() == ISD::UADDO ||
15422 Cond.getOperand(0).getOpcode() == ISD::SSUBO ||
15423 Cond.getOperand(0).getOpcode() == ISD::USUBO ||
15424 Cond.getOperand(0).getOpcode() == ISD::SMULO ||
15425 Cond.getOperand(0).getOpcode() == ISD::UMULO)) {
15427 Cond = Cond.getOperand(0);
15429 SDValue NewCond = LowerSETCC(Cond, DAG);
15430 if (NewCond.getNode())
15435 // FIXME: LowerXALUO doesn't handle these!!
15436 else if (Cond.getOpcode() == X86ISD::ADD ||
15437 Cond.getOpcode() == X86ISD::SUB ||
15438 Cond.getOpcode() == X86ISD::SMUL ||
15439 Cond.getOpcode() == X86ISD::UMUL)
15440 Cond = LowerXALUO(Cond, DAG);
15443 // Look pass (and (setcc_carry (cmp ...)), 1).
15444 if (Cond.getOpcode() == ISD::AND &&
15445 Cond.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY) {
15446 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Cond.getOperand(1));
15447 if (C && C->getAPIntValue() == 1)
15448 Cond = Cond.getOperand(0);
15451 // If condition flag is set by a X86ISD::CMP, then use it as the condition
15452 // setting operand in place of the X86ISD::SETCC.
15453 unsigned CondOpcode = Cond.getOpcode();
15454 if (CondOpcode == X86ISD::SETCC ||
15455 CondOpcode == X86ISD::SETCC_CARRY) {
15456 CC = Cond.getOperand(0);
15458 SDValue Cmp = Cond.getOperand(1);
15459 unsigned Opc = Cmp.getOpcode();
15460 // FIXME: WHY THE SPECIAL CASING OF LogicalCmp??
15461 if (isX86LogicalCmp(Cmp) || Opc == X86ISD::BT) {
15465 switch (cast<ConstantSDNode>(CC)->getZExtValue()) {
15469 // These can only come from an arithmetic instruction with overflow,
15470 // e.g. SADDO, UADDO.
15471 Cond = Cond.getNode()->getOperand(1);
15477 CondOpcode = Cond.getOpcode();
15478 if (CondOpcode == ISD::UADDO || CondOpcode == ISD::SADDO ||
15479 CondOpcode == ISD::USUBO || CondOpcode == ISD::SSUBO ||
15480 ((CondOpcode == ISD::UMULO || CondOpcode == ISD::SMULO) &&
15481 Cond.getOperand(0).getValueType() != MVT::i8)) {
15482 SDValue LHS = Cond.getOperand(0);
15483 SDValue RHS = Cond.getOperand(1);
15484 unsigned X86Opcode;
15487 // Keep this in sync with LowerXALUO, otherwise we might create redundant
15488 // instructions that can't be removed afterwards (i.e. X86ISD::ADD and
15490 switch (CondOpcode) {
15491 case ISD::UADDO: X86Opcode = X86ISD::ADD; X86Cond = X86::COND_B; break;
15493 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15495 X86Opcode = X86ISD::INC; X86Cond = X86::COND_O;
15498 X86Opcode = X86ISD::ADD; X86Cond = X86::COND_O; break;
15499 case ISD::USUBO: X86Opcode = X86ISD::SUB; X86Cond = X86::COND_B; break;
15501 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
15503 X86Opcode = X86ISD::DEC; X86Cond = X86::COND_O;
15506 X86Opcode = X86ISD::SUB; X86Cond = X86::COND_O; break;
15507 case ISD::UMULO: X86Opcode = X86ISD::UMUL; X86Cond = X86::COND_O; break;
15508 case ISD::SMULO: X86Opcode = X86ISD::SMUL; X86Cond = X86::COND_O; break;
15509 default: llvm_unreachable("unexpected overflowing operator");
15512 X86Cond = X86::GetOppositeBranchCondition((X86::CondCode)X86Cond);
15513 if (CondOpcode == ISD::UMULO)
15514 VTs = DAG.getVTList(LHS.getValueType(), LHS.getValueType(),
15517 VTs = DAG.getVTList(LHS.getValueType(), MVT::i32);
15519 SDValue X86Op = DAG.getNode(X86Opcode, dl, VTs, LHS, RHS);
15521 if (CondOpcode == ISD::UMULO)
15522 Cond = X86Op.getValue(2);
15524 Cond = X86Op.getValue(1);
15526 CC = DAG.getConstant(X86Cond, MVT::i8);
15530 if (Cond.hasOneUse() && isAndOrOfSetCCs(Cond, CondOpc)) {
15531 SDValue Cmp = Cond.getOperand(0).getOperand(1);
15532 if (CondOpc == ISD::OR) {
15533 // Also, recognize the pattern generated by an FCMP_UNE. We can emit
15534 // two branches instead of an explicit OR instruction with a
15536 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15537 isX86LogicalCmp(Cmp)) {
15538 CC = Cond.getOperand(0).getOperand(0);
15539 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15540 Chain, Dest, CC, Cmp);
15541 CC = Cond.getOperand(1).getOperand(0);
15545 } else { // ISD::AND
15546 // Also, recognize the pattern generated by an FCMP_OEQ. We can emit
15547 // two branches instead of an explicit AND instruction with a
15548 // separate test. However, we only do this if this block doesn't
15549 // have a fall-through edge, because this requires an explicit
15550 // jmp when the condition is false.
15551 if (Cmp == Cond.getOperand(1).getOperand(1) &&
15552 isX86LogicalCmp(Cmp) &&
15553 Op.getNode()->hasOneUse()) {
15554 X86::CondCode CCode =
15555 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15556 CCode = X86::GetOppositeBranchCondition(CCode);
15557 CC = DAG.getConstant(CCode, MVT::i8);
15558 SDNode *User = *Op.getNode()->use_begin();
15559 // Look for an unconditional branch following this conditional branch.
15560 // We need this because we need to reverse the successors in order
15561 // to implement FCMP_OEQ.
15562 if (User->getOpcode() == ISD::BR) {
15563 SDValue FalseBB = User->getOperand(1);
15565 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15566 assert(NewBR == User);
15570 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15571 Chain, Dest, CC, Cmp);
15572 X86::CondCode CCode =
15573 (X86::CondCode)Cond.getOperand(1).getConstantOperandVal(0);
15574 CCode = X86::GetOppositeBranchCondition(CCode);
15575 CC = DAG.getConstant(CCode, MVT::i8);
15581 } else if (Cond.hasOneUse() && isXor1OfSetCC(Cond)) {
15582 // Recognize for xorb (setcc), 1 patterns. The xor inverts the condition.
15583 // It should be transformed during dag combiner except when the condition
15584 // is set by a arithmetics with overflow node.
15585 X86::CondCode CCode =
15586 (X86::CondCode)Cond.getOperand(0).getConstantOperandVal(0);
15587 CCode = X86::GetOppositeBranchCondition(CCode);
15588 CC = DAG.getConstant(CCode, MVT::i8);
15589 Cond = Cond.getOperand(0).getOperand(1);
15591 } else if (Cond.getOpcode() == ISD::SETCC &&
15592 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETOEQ) {
15593 // For FCMP_OEQ, we can emit
15594 // two branches instead of an explicit AND instruction with a
15595 // separate test. However, we only do this if this block doesn't
15596 // have a fall-through edge, because this requires an explicit
15597 // jmp when the condition is false.
15598 if (Op.getNode()->hasOneUse()) {
15599 SDNode *User = *Op.getNode()->use_begin();
15600 // Look for an unconditional branch following this conditional branch.
15601 // We need this because we need to reverse the successors in order
15602 // to implement FCMP_OEQ.
15603 if (User->getOpcode() == ISD::BR) {
15604 SDValue FalseBB = User->getOperand(1);
15606 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15607 assert(NewBR == User);
15611 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15612 Cond.getOperand(0), Cond.getOperand(1));
15613 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15614 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15615 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15616 Chain, Dest, CC, Cmp);
15617 CC = DAG.getConstant(X86::COND_P, MVT::i8);
15622 } else if (Cond.getOpcode() == ISD::SETCC &&
15623 cast<CondCodeSDNode>(Cond.getOperand(2))->get() == ISD::SETUNE) {
15624 // For FCMP_UNE, we can emit
15625 // two branches instead of an explicit AND instruction with a
15626 // separate test. However, we only do this if this block doesn't
15627 // have a fall-through edge, because this requires an explicit
15628 // jmp when the condition is false.
15629 if (Op.getNode()->hasOneUse()) {
15630 SDNode *User = *Op.getNode()->use_begin();
15631 // Look for an unconditional branch following this conditional branch.
15632 // We need this because we need to reverse the successors in order
15633 // to implement FCMP_UNE.
15634 if (User->getOpcode() == ISD::BR) {
15635 SDValue FalseBB = User->getOperand(1);
15637 DAG.UpdateNodeOperands(User, User->getOperand(0), Dest);
15638 assert(NewBR == User);
15641 SDValue Cmp = DAG.getNode(X86ISD::CMP, dl, MVT::i32,
15642 Cond.getOperand(0), Cond.getOperand(1));
15643 Cmp = ConvertCmpIfNecessary(Cmp, DAG);
15644 CC = DAG.getConstant(X86::COND_NE, MVT::i8);
15645 Chain = DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15646 Chain, Dest, CC, Cmp);
15647 CC = DAG.getConstant(X86::COND_NP, MVT::i8);
15657 // Look pass the truncate if the high bits are known zero.
15658 if (isTruncWithZeroHighBitsInput(Cond, DAG))
15659 Cond = Cond.getOperand(0);
15661 // We know the result of AND is compared against zero. Try to match
15663 if (Cond.getOpcode() == ISD::AND && Cond.hasOneUse()) {
15664 SDValue NewSetCC = LowerToBT(Cond, ISD::SETNE, dl, DAG);
15665 if (NewSetCC.getNode()) {
15666 CC = NewSetCC.getOperand(0);
15667 Cond = NewSetCC.getOperand(1);
15674 X86::CondCode X86Cond = Inverted ? X86::COND_E : X86::COND_NE;
15675 CC = DAG.getConstant(X86Cond, MVT::i8);
15676 Cond = EmitTest(Cond, X86Cond, dl, DAG);
15678 Cond = ConvertCmpIfNecessary(Cond, DAG);
15679 return DAG.getNode(X86ISD::BRCOND, dl, Op.getValueType(),
15680 Chain, Dest, CC, Cond);
15683 // Lower dynamic stack allocation to _alloca call for Cygwin/Mingw targets.
15684 // Calls to _alloca are needed to probe the stack when allocating more than 4k
15685 // bytes in one go. Touching the stack at 4K increments is necessary to ensure
15686 // that the guard pages used by the OS virtual memory manager are allocated in
15687 // correct sequence.
15689 X86TargetLowering::LowerDYNAMIC_STACKALLOC(SDValue Op,
15690 SelectionDAG &DAG) const {
15691 MachineFunction &MF = DAG.getMachineFunction();
15692 bool SplitStack = MF.shouldSplitStack();
15693 bool Lower = (Subtarget->isOSWindows() && !Subtarget->isTargetMacho()) ||
15698 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
15699 SDNode* Node = Op.getNode();
15701 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
15702 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
15703 " not tell us which reg is the stack pointer!");
15704 EVT VT = Node->getValueType(0);
15705 SDValue Tmp1 = SDValue(Node, 0);
15706 SDValue Tmp2 = SDValue(Node, 1);
15707 SDValue Tmp3 = Node->getOperand(2);
15708 SDValue Chain = Tmp1.getOperand(0);
15710 // Chain the dynamic stack allocation so that it doesn't modify the stack
15711 // pointer when other instructions are using the stack.
15712 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true),
15715 SDValue Size = Tmp2.getOperand(1);
15716 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
15717 Chain = SP.getValue(1);
15718 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
15719 const TargetFrameLowering &TFI = *DAG.getSubtarget().getFrameLowering();
15720 unsigned StackAlign = TFI.getStackAlignment();
15721 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
15722 if (Align > StackAlign)
15723 Tmp1 = DAG.getNode(ISD::AND, dl, VT, Tmp1,
15724 DAG.getConstant(-(uint64_t)Align, VT));
15725 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
15727 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
15728 DAG.getIntPtrConstant(0, true), SDValue(),
15731 SDValue Ops[2] = { Tmp1, Tmp2 };
15732 return DAG.getMergeValues(Ops, dl);
15736 SDValue Chain = Op.getOperand(0);
15737 SDValue Size = Op.getOperand(1);
15738 unsigned Align = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
15739 EVT VT = Op.getNode()->getValueType(0);
15741 bool Is64Bit = Subtarget->is64Bit();
15742 EVT SPTy = getPointerTy();
15745 MachineRegisterInfo &MRI = MF.getRegInfo();
15748 // The 64 bit implementation of segmented stacks needs to clobber both r10
15749 // r11. This makes it impossible to use it along with nested parameters.
15750 const Function *F = MF.getFunction();
15752 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
15754 if (I->hasNestAttr())
15755 report_fatal_error("Cannot use segmented stacks with functions that "
15756 "have nested arguments.");
15759 const TargetRegisterClass *AddrRegClass =
15760 getRegClassFor(getPointerTy());
15761 unsigned Vreg = MRI.createVirtualRegister(AddrRegClass);
15762 Chain = DAG.getCopyToReg(Chain, dl, Vreg, Size);
15763 SDValue Value = DAG.getNode(X86ISD::SEG_ALLOCA, dl, SPTy, Chain,
15764 DAG.getRegister(Vreg, SPTy));
15765 SDValue Ops1[2] = { Value, Chain };
15766 return DAG.getMergeValues(Ops1, dl);
15769 const unsigned Reg = (Subtarget->isTarget64BitLP64() ? X86::RAX : X86::EAX);
15771 Chain = DAG.getCopyToReg(Chain, dl, Reg, Size, Flag);
15772 Flag = Chain.getValue(1);
15773 SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
15775 Chain = DAG.getNode(X86ISD::WIN_ALLOCA, dl, NodeTys, Chain, Flag);
15777 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
15778 DAG.getSubtarget().getRegisterInfo());
15779 unsigned SPReg = RegInfo->getStackRegister();
15780 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, SPTy);
15781 Chain = SP.getValue(1);
15784 SP = DAG.getNode(ISD::AND, dl, VT, SP.getValue(0),
15785 DAG.getConstant(-(uint64_t)Align, VT));
15786 Chain = DAG.getCopyToReg(Chain, dl, SPReg, SP);
15789 SDValue Ops1[2] = { SP, Chain };
15790 return DAG.getMergeValues(Ops1, dl);
15794 SDValue X86TargetLowering::LowerVASTART(SDValue Op, SelectionDAG &DAG) const {
15795 MachineFunction &MF = DAG.getMachineFunction();
15796 X86MachineFunctionInfo *FuncInfo = MF.getInfo<X86MachineFunctionInfo>();
15798 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15801 if (!Subtarget->is64Bit() || Subtarget->isTargetWin64()) {
15802 // vastart just stores the address of the VarArgsFrameIndex slot into the
15803 // memory location argument.
15804 SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15806 return DAG.getStore(Op.getOperand(0), DL, FR, Op.getOperand(1),
15807 MachinePointerInfo(SV), false, false, 0);
15811 // gp_offset (0 - 6 * 8)
15812 // fp_offset (48 - 48 + 8 * 16)
15813 // overflow_arg_area (point to parameters coming in memory).
15815 SmallVector<SDValue, 8> MemOps;
15816 SDValue FIN = Op.getOperand(1);
15818 SDValue Store = DAG.getStore(Op.getOperand(0), DL,
15819 DAG.getConstant(FuncInfo->getVarArgsGPOffset(),
15821 FIN, MachinePointerInfo(SV), false, false, 0);
15822 MemOps.push_back(Store);
15825 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15826 FIN, DAG.getIntPtrConstant(4));
15827 Store = DAG.getStore(Op.getOperand(0), DL,
15828 DAG.getConstant(FuncInfo->getVarArgsFPOffset(),
15830 FIN, MachinePointerInfo(SV, 4), false, false, 0);
15831 MemOps.push_back(Store);
15833 // Store ptr to overflow_arg_area
15834 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15835 FIN, DAG.getIntPtrConstant(4));
15836 SDValue OVFIN = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(),
15838 Store = DAG.getStore(Op.getOperand(0), DL, OVFIN, FIN,
15839 MachinePointerInfo(SV, 8),
15841 MemOps.push_back(Store);
15843 // Store ptr to reg_save_area.
15844 FIN = DAG.getNode(ISD::ADD, DL, getPointerTy(),
15845 FIN, DAG.getIntPtrConstant(8));
15846 SDValue RSFIN = DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(),
15848 Store = DAG.getStore(Op.getOperand(0), DL, RSFIN, FIN,
15849 MachinePointerInfo(SV, 16), false, false, 0);
15850 MemOps.push_back(Store);
15851 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
15854 SDValue X86TargetLowering::LowerVAARG(SDValue Op, SelectionDAG &DAG) const {
15855 assert(Subtarget->is64Bit() &&
15856 "LowerVAARG only handles 64-bit va_arg!");
15857 assert((Subtarget->isTargetLinux() ||
15858 Subtarget->isTargetDarwin()) &&
15859 "Unhandled target in LowerVAARG");
15860 assert(Op.getNode()->getNumOperands() == 4);
15861 SDValue Chain = Op.getOperand(0);
15862 SDValue SrcPtr = Op.getOperand(1);
15863 const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
15864 unsigned Align = Op.getConstantOperandVal(3);
15867 EVT ArgVT = Op.getNode()->getValueType(0);
15868 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
15869 uint32_t ArgSize = getDataLayout()->getTypeAllocSize(ArgTy);
15872 // Decide which area this value should be read from.
15873 // TODO: Implement the AMD64 ABI in its entirety. This simple
15874 // selection mechanism works only for the basic types.
15875 if (ArgVT == MVT::f80) {
15876 llvm_unreachable("va_arg for f80 not yet implemented");
15877 } else if (ArgVT.isFloatingPoint() && ArgSize <= 16 /*bytes*/) {
15878 ArgMode = 2; // Argument passed in XMM register. Use fp_offset.
15879 } else if (ArgVT.isInteger() && ArgSize <= 32 /*bytes*/) {
15880 ArgMode = 1; // Argument passed in GPR64 register(s). Use gp_offset.
15882 llvm_unreachable("Unhandled argument type in LowerVAARG");
15885 if (ArgMode == 2) {
15886 // Sanity Check: Make sure using fp_offset makes sense.
15887 assert(!DAG.getTarget().Options.UseSoftFloat &&
15888 !(DAG.getMachineFunction()
15889 .getFunction()->getAttributes()
15890 .hasAttribute(AttributeSet::FunctionIndex,
15891 Attribute::NoImplicitFloat)) &&
15892 Subtarget->hasSSE1());
15895 // Insert VAARG_64 node into the DAG
15896 // VAARG_64 returns two values: Variable Argument Address, Chain
15897 SmallVector<SDValue, 11> InstOps;
15898 InstOps.push_back(Chain);
15899 InstOps.push_back(SrcPtr);
15900 InstOps.push_back(DAG.getConstant(ArgSize, MVT::i32));
15901 InstOps.push_back(DAG.getConstant(ArgMode, MVT::i8));
15902 InstOps.push_back(DAG.getConstant(Align, MVT::i32));
15903 SDVTList VTs = DAG.getVTList(getPointerTy(), MVT::Other);
15904 SDValue VAARG = DAG.getMemIntrinsicNode(X86ISD::VAARG_64, dl,
15905 VTs, InstOps, MVT::i64,
15906 MachinePointerInfo(SV),
15908 /*Volatile=*/false,
15910 /*WriteMem=*/true);
15911 Chain = VAARG.getValue(1);
15913 // Load the next argument and return it
15914 return DAG.getLoad(ArgVT, dl,
15917 MachinePointerInfo(),
15918 false, false, false, 0);
15921 static SDValue LowerVACOPY(SDValue Op, const X86Subtarget *Subtarget,
15922 SelectionDAG &DAG) {
15923 // X86-64 va_list is a struct { i32, i32, i8*, i8* }.
15924 assert(Subtarget->is64Bit() && "This code only handles 64-bit va_copy!");
15925 SDValue Chain = Op.getOperand(0);
15926 SDValue DstPtr = Op.getOperand(1);
15927 SDValue SrcPtr = Op.getOperand(2);
15928 const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
15929 const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
15932 return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr,
15933 DAG.getIntPtrConstant(24), 8, /*isVolatile*/false,
15935 MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
15938 // getTargetVShiftByConstNode - Handle vector element shifts where the shift
15939 // amount is a constant. Takes immediate version of shift as input.
15940 static SDValue getTargetVShiftByConstNode(unsigned Opc, SDLoc dl, MVT VT,
15941 SDValue SrcOp, uint64_t ShiftAmt,
15942 SelectionDAG &DAG) {
15943 MVT ElementType = VT.getVectorElementType();
15945 // Fold this packed shift into its first operand if ShiftAmt is 0.
15949 // Check for ShiftAmt >= element width
15950 if (ShiftAmt >= ElementType.getSizeInBits()) {
15951 if (Opc == X86ISD::VSRAI)
15952 ShiftAmt = ElementType.getSizeInBits() - 1;
15954 return DAG.getConstant(0, VT);
15957 assert((Opc == X86ISD::VSHLI || Opc == X86ISD::VSRLI || Opc == X86ISD::VSRAI)
15958 && "Unknown target vector shift-by-constant node");
15960 // Fold this packed vector shift into a build vector if SrcOp is a
15961 // vector of Constants or UNDEFs, and SrcOp valuetype is the same as VT.
15962 if (VT == SrcOp.getSimpleValueType() &&
15963 ISD::isBuildVectorOfConstantSDNodes(SrcOp.getNode())) {
15964 SmallVector<SDValue, 8> Elts;
15965 unsigned NumElts = SrcOp->getNumOperands();
15966 ConstantSDNode *ND;
15969 default: llvm_unreachable(nullptr);
15970 case X86ISD::VSHLI:
15971 for (unsigned i=0; i!=NumElts; ++i) {
15972 SDValue CurrentOp = SrcOp->getOperand(i);
15973 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15974 Elts.push_back(CurrentOp);
15977 ND = cast<ConstantSDNode>(CurrentOp);
15978 const APInt &C = ND->getAPIntValue();
15979 Elts.push_back(DAG.getConstant(C.shl(ShiftAmt), ElementType));
15982 case X86ISD::VSRLI:
15983 for (unsigned i=0; i!=NumElts; ++i) {
15984 SDValue CurrentOp = SrcOp->getOperand(i);
15985 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15986 Elts.push_back(CurrentOp);
15989 ND = cast<ConstantSDNode>(CurrentOp);
15990 const APInt &C = ND->getAPIntValue();
15991 Elts.push_back(DAG.getConstant(C.lshr(ShiftAmt), ElementType));
15994 case X86ISD::VSRAI:
15995 for (unsigned i=0; i!=NumElts; ++i) {
15996 SDValue CurrentOp = SrcOp->getOperand(i);
15997 if (CurrentOp->getOpcode() == ISD::UNDEF) {
15998 Elts.push_back(CurrentOp);
16001 ND = cast<ConstantSDNode>(CurrentOp);
16002 const APInt &C = ND->getAPIntValue();
16003 Elts.push_back(DAG.getConstant(C.ashr(ShiftAmt), ElementType));
16008 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
16011 return DAG.getNode(Opc, dl, VT, SrcOp, DAG.getConstant(ShiftAmt, MVT::i8));
16014 // getTargetVShiftNode - Handle vector element shifts where the shift amount
16015 // may or may not be a constant. Takes immediate version of shift as input.
16016 static SDValue getTargetVShiftNode(unsigned Opc, SDLoc dl, MVT VT,
16017 SDValue SrcOp, SDValue ShAmt,
16018 SelectionDAG &DAG) {
16019 assert(ShAmt.getValueType() == MVT::i32 && "ShAmt is not i32");
16021 // Catch shift-by-constant.
16022 if (ConstantSDNode *CShAmt = dyn_cast<ConstantSDNode>(ShAmt))
16023 return getTargetVShiftByConstNode(Opc, dl, VT, SrcOp,
16024 CShAmt->getZExtValue(), DAG);
16026 // Change opcode to non-immediate version
16028 default: llvm_unreachable("Unknown target vector shift node");
16029 case X86ISD::VSHLI: Opc = X86ISD::VSHL; break;
16030 case X86ISD::VSRLI: Opc = X86ISD::VSRL; break;
16031 case X86ISD::VSRAI: Opc = X86ISD::VSRA; break;
16034 // Need to build a vector containing shift amount
16035 // Shift amount is 32-bits, but SSE instructions read 64-bit, so fill with 0
16038 ShOps[1] = DAG.getConstant(0, MVT::i32);
16039 ShOps[2] = ShOps[3] = DAG.getUNDEF(MVT::i32);
16040 ShAmt = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v4i32, ShOps);
16042 // The return type has to be a 128-bit type with the same element
16043 // type as the input type.
16044 MVT EltVT = VT.getVectorElementType();
16045 EVT ShVT = MVT::getVectorVT(EltVT, 128/EltVT.getSizeInBits());
16047 ShAmt = DAG.getNode(ISD::BITCAST, dl, ShVT, ShAmt);
16048 return DAG.getNode(Opc, dl, VT, SrcOp, ShAmt);
16051 /// \brief Return (and \p Op, \p Mask) for compare instructions or
16052 /// (vselect \p Mask, \p Op, \p PreservedSrc) for others along with the
16053 /// necessary casting for \p Mask when lowering masking intrinsics.
16054 static SDValue getVectorMaskingNode(SDValue Op, SDValue Mask,
16055 SDValue PreservedSrc, SelectionDAG &DAG) {
16056 EVT VT = Op.getValueType();
16057 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(),
16058 MVT::i1, VT.getVectorNumElements());
16059 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16060 Mask.getValueType().getSizeInBits());
16063 assert(MaskVT.isSimple() && "invalid mask type");
16065 if (isAllOnes(Mask))
16068 // In case when MaskVT equals v2i1 or v4i1, low 2 or 4 elements
16069 // are extracted by EXTRACT_SUBVECTOR.
16070 SDValue VMask = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, MaskVT,
16071 DAG.getNode(ISD::BITCAST, dl, BitcastVT, Mask),
16072 DAG.getIntPtrConstant(0));
16074 switch (Op.getOpcode()) {
16076 case X86ISD::PCMPEQM:
16077 case X86ISD::PCMPGTM:
16079 case X86ISD::CMPMU:
16080 return DAG.getNode(ISD::AND, dl, VT, Op, VMask);
16083 return DAG.getNode(ISD::VSELECT, dl, VT, VMask, Op, PreservedSrc);
16086 static unsigned getOpcodeForFMAIntrinsic(unsigned IntNo) {
16088 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16089 case Intrinsic::x86_fma_vfmadd_ps:
16090 case Intrinsic::x86_fma_vfmadd_pd:
16091 case Intrinsic::x86_fma_vfmadd_ps_256:
16092 case Intrinsic::x86_fma_vfmadd_pd_256:
16093 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16094 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16095 return X86ISD::FMADD;
16096 case Intrinsic::x86_fma_vfmsub_ps:
16097 case Intrinsic::x86_fma_vfmsub_pd:
16098 case Intrinsic::x86_fma_vfmsub_ps_256:
16099 case Intrinsic::x86_fma_vfmsub_pd_256:
16100 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16101 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16102 return X86ISD::FMSUB;
16103 case Intrinsic::x86_fma_vfnmadd_ps:
16104 case Intrinsic::x86_fma_vfnmadd_pd:
16105 case Intrinsic::x86_fma_vfnmadd_ps_256:
16106 case Intrinsic::x86_fma_vfnmadd_pd_256:
16107 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16108 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16109 return X86ISD::FNMADD;
16110 case Intrinsic::x86_fma_vfnmsub_ps:
16111 case Intrinsic::x86_fma_vfnmsub_pd:
16112 case Intrinsic::x86_fma_vfnmsub_ps_256:
16113 case Intrinsic::x86_fma_vfnmsub_pd_256:
16114 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16115 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16116 return X86ISD::FNMSUB;
16117 case Intrinsic::x86_fma_vfmaddsub_ps:
16118 case Intrinsic::x86_fma_vfmaddsub_pd:
16119 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16120 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16121 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16122 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16123 return X86ISD::FMADDSUB;
16124 case Intrinsic::x86_fma_vfmsubadd_ps:
16125 case Intrinsic::x86_fma_vfmsubadd_pd:
16126 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16127 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16128 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16129 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512:
16130 return X86ISD::FMSUBADD;
16134 static SDValue LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG) {
16136 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16138 const IntrinsicData* IntrData = getIntrinsicWithoutChain(IntNo);
16140 switch(IntrData->Type) {
16141 case INTR_TYPE_1OP:
16142 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1));
16143 case INTR_TYPE_2OP:
16144 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16146 case INTR_TYPE_3OP:
16147 return DAG.getNode(IntrData->Opc0, dl, Op.getValueType(), Op.getOperand(1),
16148 Op.getOperand(2), Op.getOperand(3));
16150 // Comparison intrinsics with masks.
16151 // Example of transformation:
16152 // (i8 (int_x86_avx512_mask_pcmpeq_q_128
16153 // (v2i64 %a), (v2i64 %b), (i8 %mask))) ->
16155 // (v8i1 (insert_subvector undef,
16156 // (v2i1 (and (PCMPEQM %a, %b),
16157 // (extract_subvector
16158 // (v8i1 (bitcast %mask)), 0))), 0))))
16159 EVT VT = Op.getOperand(1).getValueType();
16160 EVT MaskVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16161 VT.getVectorNumElements());
16162 SDValue Mask = Op.getOperand(3);
16163 EVT BitcastVT = EVT::getVectorVT(*DAG.getContext(), MVT::i1,
16164 Mask.getValueType().getSizeInBits());
16165 SDValue Cmp = DAG.getNode(IntrData->Opc0, dl, MaskVT,
16166 Op.getOperand(1), Op.getOperand(2));
16167 SDValue CmpMask = getVectorMaskingNode(Cmp, Op.getOperand(3),
16168 DAG.getTargetConstant(0, MaskVT), DAG);
16169 SDValue Res = DAG.getNode(ISD::INSERT_SUBVECTOR, dl, BitcastVT,
16170 DAG.getUNDEF(BitcastVT), CmpMask,
16171 DAG.getIntPtrConstant(0));
16172 return DAG.getNode(ISD::BITCAST, dl, Op.getValueType(), Res);
16174 case COMI: { // Comparison intrinsics
16175 ISD::CondCode CC = (ISD::CondCode)IntrData->Opc1;
16176 SDValue LHS = Op.getOperand(1);
16177 SDValue RHS = Op.getOperand(2);
16178 unsigned X86CC = TranslateX86CC(CC, true, LHS, RHS, DAG);
16179 assert(X86CC != X86::COND_INVALID && "Unexpected illegal condition!");
16180 SDValue Cond = DAG.getNode(IntrData->Opc0, dl, MVT::i32, LHS, RHS);
16181 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16182 DAG.getConstant(X86CC, MVT::i8), Cond);
16183 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16186 return getTargetVShiftNode(IntrData->Opc0, dl, Op.getSimpleValueType(),
16187 Op.getOperand(1), Op.getOperand(2), DAG);
16194 default: return SDValue(); // Don't custom lower most intrinsics.
16196 // Arithmetic intrinsics.
16197 case Intrinsic::x86_sse2_pmulu_dq:
16198 case Intrinsic::x86_avx2_pmulu_dq:
16199 return DAG.getNode(X86ISD::PMULUDQ, dl, Op.getValueType(),
16200 Op.getOperand(1), Op.getOperand(2));
16202 case Intrinsic::x86_sse41_pmuldq:
16203 case Intrinsic::x86_avx2_pmul_dq:
16204 return DAG.getNode(X86ISD::PMULDQ, dl, Op.getValueType(),
16205 Op.getOperand(1), Op.getOperand(2));
16207 case Intrinsic::x86_sse2_pmulhu_w:
16208 case Intrinsic::x86_avx2_pmulhu_w:
16209 return DAG.getNode(ISD::MULHU, dl, Op.getValueType(),
16210 Op.getOperand(1), Op.getOperand(2));
16212 case Intrinsic::x86_sse2_pmulh_w:
16213 case Intrinsic::x86_avx2_pmulh_w:
16214 return DAG.getNode(ISD::MULHS, dl, Op.getValueType(),
16215 Op.getOperand(1), Op.getOperand(2));
16217 // SSE/SSE2/AVX floating point max/min intrinsics.
16218 case Intrinsic::x86_sse_max_ps:
16219 case Intrinsic::x86_sse2_max_pd:
16220 case Intrinsic::x86_avx_max_ps_256:
16221 case Intrinsic::x86_avx_max_pd_256:
16222 case Intrinsic::x86_sse_min_ps:
16223 case Intrinsic::x86_sse2_min_pd:
16224 case Intrinsic::x86_avx_min_ps_256:
16225 case Intrinsic::x86_avx_min_pd_256: {
16228 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16229 case Intrinsic::x86_sse_max_ps:
16230 case Intrinsic::x86_sse2_max_pd:
16231 case Intrinsic::x86_avx_max_ps_256:
16232 case Intrinsic::x86_avx_max_pd_256:
16233 Opcode = X86ISD::FMAX;
16235 case Intrinsic::x86_sse_min_ps:
16236 case Intrinsic::x86_sse2_min_pd:
16237 case Intrinsic::x86_avx_min_ps_256:
16238 case Intrinsic::x86_avx_min_pd_256:
16239 Opcode = X86ISD::FMIN;
16242 return DAG.getNode(Opcode, dl, Op.getValueType(),
16243 Op.getOperand(1), Op.getOperand(2));
16246 // AVX2 variable shift intrinsics
16247 case Intrinsic::x86_avx2_psllv_d:
16248 case Intrinsic::x86_avx2_psllv_q:
16249 case Intrinsic::x86_avx2_psllv_d_256:
16250 case Intrinsic::x86_avx2_psllv_q_256:
16251 case Intrinsic::x86_avx2_psrlv_d:
16252 case Intrinsic::x86_avx2_psrlv_q:
16253 case Intrinsic::x86_avx2_psrlv_d_256:
16254 case Intrinsic::x86_avx2_psrlv_q_256:
16255 case Intrinsic::x86_avx2_psrav_d:
16256 case Intrinsic::x86_avx2_psrav_d_256: {
16259 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16260 case Intrinsic::x86_avx2_psllv_d:
16261 case Intrinsic::x86_avx2_psllv_q:
16262 case Intrinsic::x86_avx2_psllv_d_256:
16263 case Intrinsic::x86_avx2_psllv_q_256:
16266 case Intrinsic::x86_avx2_psrlv_d:
16267 case Intrinsic::x86_avx2_psrlv_q:
16268 case Intrinsic::x86_avx2_psrlv_d_256:
16269 case Intrinsic::x86_avx2_psrlv_q_256:
16272 case Intrinsic::x86_avx2_psrav_d:
16273 case Intrinsic::x86_avx2_psrav_d_256:
16277 return DAG.getNode(Opcode, dl, Op.getValueType(),
16278 Op.getOperand(1), Op.getOperand(2));
16281 case Intrinsic::x86_sse2_packssdw_128:
16282 case Intrinsic::x86_sse2_packsswb_128:
16283 case Intrinsic::x86_avx2_packssdw:
16284 case Intrinsic::x86_avx2_packsswb:
16285 return DAG.getNode(X86ISD::PACKSS, dl, Op.getValueType(),
16286 Op.getOperand(1), Op.getOperand(2));
16288 case Intrinsic::x86_sse2_packuswb_128:
16289 case Intrinsic::x86_sse41_packusdw:
16290 case Intrinsic::x86_avx2_packuswb:
16291 case Intrinsic::x86_avx2_packusdw:
16292 return DAG.getNode(X86ISD::PACKUS, dl, Op.getValueType(),
16293 Op.getOperand(1), Op.getOperand(2));
16295 case Intrinsic::x86_ssse3_pshuf_b_128:
16296 case Intrinsic::x86_avx2_pshuf_b:
16297 return DAG.getNode(X86ISD::PSHUFB, dl, Op.getValueType(),
16298 Op.getOperand(1), Op.getOperand(2));
16300 case Intrinsic::x86_sse2_pshuf_d:
16301 return DAG.getNode(X86ISD::PSHUFD, dl, Op.getValueType(),
16302 Op.getOperand(1), Op.getOperand(2));
16304 case Intrinsic::x86_sse2_pshufl_w:
16305 return DAG.getNode(X86ISD::PSHUFLW, dl, Op.getValueType(),
16306 Op.getOperand(1), Op.getOperand(2));
16308 case Intrinsic::x86_sse2_pshufh_w:
16309 return DAG.getNode(X86ISD::PSHUFHW, dl, Op.getValueType(),
16310 Op.getOperand(1), Op.getOperand(2));
16312 case Intrinsic::x86_ssse3_psign_b_128:
16313 case Intrinsic::x86_ssse3_psign_w_128:
16314 case Intrinsic::x86_ssse3_psign_d_128:
16315 case Intrinsic::x86_avx2_psign_b:
16316 case Intrinsic::x86_avx2_psign_w:
16317 case Intrinsic::x86_avx2_psign_d:
16318 return DAG.getNode(X86ISD::PSIGN, dl, Op.getValueType(),
16319 Op.getOperand(1), Op.getOperand(2));
16321 case Intrinsic::x86_avx2_permd:
16322 case Intrinsic::x86_avx2_permps:
16323 // Operands intentionally swapped. Mask is last operand to intrinsic,
16324 // but second operand for node/instruction.
16325 return DAG.getNode(X86ISD::VPERMV, dl, Op.getValueType(),
16326 Op.getOperand(2), Op.getOperand(1));
16328 case Intrinsic::x86_avx512_mask_valign_q_512:
16329 case Intrinsic::x86_avx512_mask_valign_d_512:
16330 // Vector source operands are swapped.
16331 return getVectorMaskingNode(DAG.getNode(X86ISD::VALIGN, dl,
16332 Op.getValueType(), Op.getOperand(2),
16335 Op.getOperand(5), Op.getOperand(4), DAG);
16337 // ptest and testp intrinsics. The intrinsic these come from are designed to
16338 // return an integer value, not just an instruction so lower it to the ptest
16339 // or testp pattern and a setcc for the result.
16340 case Intrinsic::x86_sse41_ptestz:
16341 case Intrinsic::x86_sse41_ptestc:
16342 case Intrinsic::x86_sse41_ptestnzc:
16343 case Intrinsic::x86_avx_ptestz_256:
16344 case Intrinsic::x86_avx_ptestc_256:
16345 case Intrinsic::x86_avx_ptestnzc_256:
16346 case Intrinsic::x86_avx_vtestz_ps:
16347 case Intrinsic::x86_avx_vtestc_ps:
16348 case Intrinsic::x86_avx_vtestnzc_ps:
16349 case Intrinsic::x86_avx_vtestz_pd:
16350 case Intrinsic::x86_avx_vtestc_pd:
16351 case Intrinsic::x86_avx_vtestnzc_pd:
16352 case Intrinsic::x86_avx_vtestz_ps_256:
16353 case Intrinsic::x86_avx_vtestc_ps_256:
16354 case Intrinsic::x86_avx_vtestnzc_ps_256:
16355 case Intrinsic::x86_avx_vtestz_pd_256:
16356 case Intrinsic::x86_avx_vtestc_pd_256:
16357 case Intrinsic::x86_avx_vtestnzc_pd_256: {
16358 bool IsTestPacked = false;
16361 default: llvm_unreachable("Bad fallthrough in Intrinsic lowering.");
16362 case Intrinsic::x86_avx_vtestz_ps:
16363 case Intrinsic::x86_avx_vtestz_pd:
16364 case Intrinsic::x86_avx_vtestz_ps_256:
16365 case Intrinsic::x86_avx_vtestz_pd_256:
16366 IsTestPacked = true; // Fallthrough
16367 case Intrinsic::x86_sse41_ptestz:
16368 case Intrinsic::x86_avx_ptestz_256:
16370 X86CC = X86::COND_E;
16372 case Intrinsic::x86_avx_vtestc_ps:
16373 case Intrinsic::x86_avx_vtestc_pd:
16374 case Intrinsic::x86_avx_vtestc_ps_256:
16375 case Intrinsic::x86_avx_vtestc_pd_256:
16376 IsTestPacked = true; // Fallthrough
16377 case Intrinsic::x86_sse41_ptestc:
16378 case Intrinsic::x86_avx_ptestc_256:
16380 X86CC = X86::COND_B;
16382 case Intrinsic::x86_avx_vtestnzc_ps:
16383 case Intrinsic::x86_avx_vtestnzc_pd:
16384 case Intrinsic::x86_avx_vtestnzc_ps_256:
16385 case Intrinsic::x86_avx_vtestnzc_pd_256:
16386 IsTestPacked = true; // Fallthrough
16387 case Intrinsic::x86_sse41_ptestnzc:
16388 case Intrinsic::x86_avx_ptestnzc_256:
16390 X86CC = X86::COND_A;
16394 SDValue LHS = Op.getOperand(1);
16395 SDValue RHS = Op.getOperand(2);
16396 unsigned TestOpc = IsTestPacked ? X86ISD::TESTP : X86ISD::PTEST;
16397 SDValue Test = DAG.getNode(TestOpc, dl, MVT::i32, LHS, RHS);
16398 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16399 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8, CC, Test);
16400 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16402 case Intrinsic::x86_avx512_kortestz_w:
16403 case Intrinsic::x86_avx512_kortestc_w: {
16404 unsigned X86CC = (IntNo == Intrinsic::x86_avx512_kortestz_w)? X86::COND_E: X86::COND_B;
16405 SDValue LHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(1));
16406 SDValue RHS = DAG.getNode(ISD::BITCAST, dl, MVT::v16i1, Op.getOperand(2));
16407 SDValue CC = DAG.getConstant(X86CC, MVT::i8);
16408 SDValue Test = DAG.getNode(X86ISD::KORTEST, dl, MVT::i32, LHS, RHS);
16409 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i1, CC, Test);
16410 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16413 case Intrinsic::x86_sse42_pcmpistria128:
16414 case Intrinsic::x86_sse42_pcmpestria128:
16415 case Intrinsic::x86_sse42_pcmpistric128:
16416 case Intrinsic::x86_sse42_pcmpestric128:
16417 case Intrinsic::x86_sse42_pcmpistrio128:
16418 case Intrinsic::x86_sse42_pcmpestrio128:
16419 case Intrinsic::x86_sse42_pcmpistris128:
16420 case Intrinsic::x86_sse42_pcmpestris128:
16421 case Intrinsic::x86_sse42_pcmpistriz128:
16422 case Intrinsic::x86_sse42_pcmpestriz128: {
16426 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
16427 case Intrinsic::x86_sse42_pcmpistria128:
16428 Opcode = X86ISD::PCMPISTRI;
16429 X86CC = X86::COND_A;
16431 case Intrinsic::x86_sse42_pcmpestria128:
16432 Opcode = X86ISD::PCMPESTRI;
16433 X86CC = X86::COND_A;
16435 case Intrinsic::x86_sse42_pcmpistric128:
16436 Opcode = X86ISD::PCMPISTRI;
16437 X86CC = X86::COND_B;
16439 case Intrinsic::x86_sse42_pcmpestric128:
16440 Opcode = X86ISD::PCMPESTRI;
16441 X86CC = X86::COND_B;
16443 case Intrinsic::x86_sse42_pcmpistrio128:
16444 Opcode = X86ISD::PCMPISTRI;
16445 X86CC = X86::COND_O;
16447 case Intrinsic::x86_sse42_pcmpestrio128:
16448 Opcode = X86ISD::PCMPESTRI;
16449 X86CC = X86::COND_O;
16451 case Intrinsic::x86_sse42_pcmpistris128:
16452 Opcode = X86ISD::PCMPISTRI;
16453 X86CC = X86::COND_S;
16455 case Intrinsic::x86_sse42_pcmpestris128:
16456 Opcode = X86ISD::PCMPESTRI;
16457 X86CC = X86::COND_S;
16459 case Intrinsic::x86_sse42_pcmpistriz128:
16460 Opcode = X86ISD::PCMPISTRI;
16461 X86CC = X86::COND_E;
16463 case Intrinsic::x86_sse42_pcmpestriz128:
16464 Opcode = X86ISD::PCMPESTRI;
16465 X86CC = X86::COND_E;
16468 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16469 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16470 SDValue PCMP = DAG.getNode(Opcode, dl, VTs, NewOps);
16471 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16472 DAG.getConstant(X86CC, MVT::i8),
16473 SDValue(PCMP.getNode(), 1));
16474 return DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, SetCC);
16477 case Intrinsic::x86_sse42_pcmpistri128:
16478 case Intrinsic::x86_sse42_pcmpestri128: {
16480 if (IntNo == Intrinsic::x86_sse42_pcmpistri128)
16481 Opcode = X86ISD::PCMPISTRI;
16483 Opcode = X86ISD::PCMPESTRI;
16485 SmallVector<SDValue, 5> NewOps(Op->op_begin()+1, Op->op_end());
16486 SDVTList VTs = DAG.getVTList(Op.getValueType(), MVT::i32);
16487 return DAG.getNode(Opcode, dl, VTs, NewOps);
16490 case Intrinsic::x86_fma_mask_vfmadd_ps_512:
16491 case Intrinsic::x86_fma_mask_vfmadd_pd_512:
16492 case Intrinsic::x86_fma_mask_vfmsub_ps_512:
16493 case Intrinsic::x86_fma_mask_vfmsub_pd_512:
16494 case Intrinsic::x86_fma_mask_vfnmadd_ps_512:
16495 case Intrinsic::x86_fma_mask_vfnmadd_pd_512:
16496 case Intrinsic::x86_fma_mask_vfnmsub_ps_512:
16497 case Intrinsic::x86_fma_mask_vfnmsub_pd_512:
16498 case Intrinsic::x86_fma_mask_vfmaddsub_ps_512:
16499 case Intrinsic::x86_fma_mask_vfmaddsub_pd_512:
16500 case Intrinsic::x86_fma_mask_vfmsubadd_ps_512:
16501 case Intrinsic::x86_fma_mask_vfmsubadd_pd_512: {
16502 auto *SAE = cast<ConstantSDNode>(Op.getOperand(5));
16503 if (SAE->getZExtValue() == X86::STATIC_ROUNDING::CUR_DIRECTION)
16504 return getVectorMaskingNode(DAG.getNode(getOpcodeForFMAIntrinsic(IntNo),
16505 dl, Op.getValueType(),
16509 Op.getOperand(4), Op.getOperand(1), DAG);
16514 case Intrinsic::x86_fma_vfmadd_ps:
16515 case Intrinsic::x86_fma_vfmadd_pd:
16516 case Intrinsic::x86_fma_vfmsub_ps:
16517 case Intrinsic::x86_fma_vfmsub_pd:
16518 case Intrinsic::x86_fma_vfnmadd_ps:
16519 case Intrinsic::x86_fma_vfnmadd_pd:
16520 case Intrinsic::x86_fma_vfnmsub_ps:
16521 case Intrinsic::x86_fma_vfnmsub_pd:
16522 case Intrinsic::x86_fma_vfmaddsub_ps:
16523 case Intrinsic::x86_fma_vfmaddsub_pd:
16524 case Intrinsic::x86_fma_vfmsubadd_ps:
16525 case Intrinsic::x86_fma_vfmsubadd_pd:
16526 case Intrinsic::x86_fma_vfmadd_ps_256:
16527 case Intrinsic::x86_fma_vfmadd_pd_256:
16528 case Intrinsic::x86_fma_vfmsub_ps_256:
16529 case Intrinsic::x86_fma_vfmsub_pd_256:
16530 case Intrinsic::x86_fma_vfnmadd_ps_256:
16531 case Intrinsic::x86_fma_vfnmadd_pd_256:
16532 case Intrinsic::x86_fma_vfnmsub_ps_256:
16533 case Intrinsic::x86_fma_vfnmsub_pd_256:
16534 case Intrinsic::x86_fma_vfmaddsub_ps_256:
16535 case Intrinsic::x86_fma_vfmaddsub_pd_256:
16536 case Intrinsic::x86_fma_vfmsubadd_ps_256:
16537 case Intrinsic::x86_fma_vfmsubadd_pd_256:
16538 return DAG.getNode(getOpcodeForFMAIntrinsic(IntNo), dl, Op.getValueType(),
16539 Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));
16543 static SDValue getGatherNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16544 SDValue Src, SDValue Mask, SDValue Base,
16545 SDValue Index, SDValue ScaleOp, SDValue Chain,
16546 const X86Subtarget * Subtarget) {
16548 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16549 assert(C && "Invalid scale type");
16550 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16551 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16552 Index.getSimpleValueType().getVectorNumElements());
16554 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16556 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16558 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16559 SDVTList VTs = DAG.getVTList(Op.getValueType(), MaskVT, MVT::Other);
16560 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16561 SDValue Segment = DAG.getRegister(0, MVT::i32);
16562 if (Src.getOpcode() == ISD::UNDEF)
16563 Src = getZeroVector(Op.getValueType(), Subtarget, DAG, dl);
16564 SDValue Ops[] = {Src, MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16565 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16566 SDValue RetOps[] = { SDValue(Res, 0), SDValue(Res, 2) };
16567 return DAG.getMergeValues(RetOps, dl);
16570 static SDValue getScatterNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16571 SDValue Src, SDValue Mask, SDValue Base,
16572 SDValue Index, SDValue ScaleOp, SDValue Chain) {
16574 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16575 assert(C && "Invalid scale type");
16576 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16577 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16578 SDValue Segment = DAG.getRegister(0, MVT::i32);
16579 EVT MaskVT = MVT::getVectorVT(MVT::i1,
16580 Index.getSimpleValueType().getVectorNumElements());
16582 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16584 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16586 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16587 SDVTList VTs = DAG.getVTList(MaskVT, MVT::Other);
16588 SDValue Ops[] = {Base, Scale, Index, Disp, Segment, MaskInReg, Src, Chain};
16589 SDNode *Res = DAG.getMachineNode(Opc, dl, VTs, Ops);
16590 return SDValue(Res, 1);
16593 static SDValue getPrefetchNode(unsigned Opc, SDValue Op, SelectionDAG &DAG,
16594 SDValue Mask, SDValue Base, SDValue Index,
16595 SDValue ScaleOp, SDValue Chain) {
16597 ConstantSDNode *C = dyn_cast<ConstantSDNode>(ScaleOp);
16598 assert(C && "Invalid scale type");
16599 SDValue Scale = DAG.getTargetConstant(C->getZExtValue(), MVT::i8);
16600 SDValue Disp = DAG.getTargetConstant(0, MVT::i32);
16601 SDValue Segment = DAG.getRegister(0, MVT::i32);
16603 MVT::getVectorVT(MVT::i1, Index.getSimpleValueType().getVectorNumElements());
16605 ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(Mask);
16607 MaskInReg = DAG.getTargetConstant(MaskC->getSExtValue(), MaskVT);
16609 MaskInReg = DAG.getNode(ISD::BITCAST, dl, MaskVT, Mask);
16610 //SDVTList VTs = DAG.getVTList(MVT::Other);
16611 SDValue Ops[] = {MaskInReg, Base, Scale, Index, Disp, Segment, Chain};
16612 SDNode *Res = DAG.getMachineNode(Opc, dl, MVT::Other, Ops);
16613 return SDValue(Res, 0);
16616 // getReadPerformanceCounter - Handles the lowering of builtin intrinsics that
16617 // read performance monitor counters (x86_rdpmc).
16618 static void getReadPerformanceCounter(SDNode *N, SDLoc DL,
16619 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16620 SmallVectorImpl<SDValue> &Results) {
16621 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16622 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16625 // The ECX register is used to select the index of the performance counter
16627 SDValue Chain = DAG.getCopyToReg(N->getOperand(0), DL, X86::ECX,
16629 SDValue rd = DAG.getNode(X86ISD::RDPMC_DAG, DL, Tys, Chain);
16631 // Reads the content of a 64-bit performance counter and returns it in the
16632 // registers EDX:EAX.
16633 if (Subtarget->is64Bit()) {
16634 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16635 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16638 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16639 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16642 Chain = HI.getValue(1);
16644 if (Subtarget->is64Bit()) {
16645 // The EAX register is loaded with the low-order 32 bits. The EDX register
16646 // is loaded with the supported high-order bits of the counter.
16647 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16648 DAG.getConstant(32, MVT::i8));
16649 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16650 Results.push_back(Chain);
16654 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16655 SDValue Ops[] = { LO, HI };
16656 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16657 Results.push_back(Pair);
16658 Results.push_back(Chain);
16661 // getReadTimeStampCounter - Handles the lowering of builtin intrinsics that
16662 // read the time stamp counter (x86_rdtsc and x86_rdtscp). This function is
16663 // also used to custom lower READCYCLECOUNTER nodes.
16664 static void getReadTimeStampCounter(SDNode *N, SDLoc DL, unsigned Opcode,
16665 SelectionDAG &DAG, const X86Subtarget *Subtarget,
16666 SmallVectorImpl<SDValue> &Results) {
16667 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
16668 SDValue rd = DAG.getNode(Opcode, DL, Tys, N->getOperand(0));
16671 // The processor's time-stamp counter (a 64-bit MSR) is stored into the
16672 // EDX:EAX registers. EDX is loaded with the high-order 32 bits of the MSR
16673 // and the EAX register is loaded with the low-order 32 bits.
16674 if (Subtarget->is64Bit()) {
16675 LO = DAG.getCopyFromReg(rd, DL, X86::RAX, MVT::i64, rd.getValue(1));
16676 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::RDX, MVT::i64,
16679 LO = DAG.getCopyFromReg(rd, DL, X86::EAX, MVT::i32, rd.getValue(1));
16680 HI = DAG.getCopyFromReg(LO.getValue(1), DL, X86::EDX, MVT::i32,
16683 SDValue Chain = HI.getValue(1);
16685 if (Opcode == X86ISD::RDTSCP_DAG) {
16686 assert(N->getNumOperands() == 3 && "Unexpected number of operands!");
16688 // Instruction RDTSCP loads the IA32:TSC_AUX_MSR (address C000_0103H) into
16689 // the ECX register. Add 'ecx' explicitly to the chain.
16690 SDValue ecx = DAG.getCopyFromReg(Chain, DL, X86::ECX, MVT::i32,
16692 // Explicitly store the content of ECX at the location passed in input
16693 // to the 'rdtscp' intrinsic.
16694 Chain = DAG.getStore(ecx.getValue(1), DL, ecx, N->getOperand(2),
16695 MachinePointerInfo(), false, false, 0);
16698 if (Subtarget->is64Bit()) {
16699 // The EDX register is loaded with the high-order 32 bits of the MSR, and
16700 // the EAX register is loaded with the low-order 32 bits.
16701 SDValue Tmp = DAG.getNode(ISD::SHL, DL, MVT::i64, HI,
16702 DAG.getConstant(32, MVT::i8));
16703 Results.push_back(DAG.getNode(ISD::OR, DL, MVT::i64, LO, Tmp));
16704 Results.push_back(Chain);
16708 // Use a buildpair to merge the two 32-bit values into a 64-bit one.
16709 SDValue Ops[] = { LO, HI };
16710 SDValue Pair = DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Ops);
16711 Results.push_back(Pair);
16712 Results.push_back(Chain);
16715 static SDValue LowerREADCYCLECOUNTER(SDValue Op, const X86Subtarget *Subtarget,
16716 SelectionDAG &DAG) {
16717 SmallVector<SDValue, 2> Results;
16719 getReadTimeStampCounter(Op.getNode(), DL, X86ISD::RDTSC_DAG, DAG, Subtarget,
16721 return DAG.getMergeValues(Results, DL);
16725 static SDValue LowerINTRINSIC_W_CHAIN(SDValue Op, const X86Subtarget *Subtarget,
16726 SelectionDAG &DAG) {
16727 unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
16729 const IntrinsicData* IntrData = getIntrinsicWithChain(IntNo);
16734 switch(IntrData->Type) {
16736 llvm_unreachable("Unknown Intrinsic Type");
16740 // Emit the node with the right value type.
16741 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Glue, MVT::Other);
16742 SDValue Result = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16744 // If the value returned by RDRAND/RDSEED was valid (CF=1), return 1.
16745 // Otherwise return the value from Rand, which is always 0, casted to i32.
16746 SDValue Ops[] = { DAG.getZExtOrTrunc(Result, dl, Op->getValueType(1)),
16747 DAG.getConstant(1, Op->getValueType(1)),
16748 DAG.getConstant(X86::COND_B, MVT::i32),
16749 SDValue(Result.getNode(), 1) };
16750 SDValue isValid = DAG.getNode(X86ISD::CMOV, dl,
16751 DAG.getVTList(Op->getValueType(1), MVT::Glue),
16754 // Return { result, isValid, chain }.
16755 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(), Result, isValid,
16756 SDValue(Result.getNode(), 2));
16759 //gather(v1, mask, index, base, scale);
16760 SDValue Chain = Op.getOperand(0);
16761 SDValue Src = Op.getOperand(2);
16762 SDValue Base = Op.getOperand(3);
16763 SDValue Index = Op.getOperand(4);
16764 SDValue Mask = Op.getOperand(5);
16765 SDValue Scale = Op.getOperand(6);
16766 return getGatherNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain,
16770 //scatter(base, mask, index, v1, scale);
16771 SDValue Chain = Op.getOperand(0);
16772 SDValue Base = Op.getOperand(2);
16773 SDValue Mask = Op.getOperand(3);
16774 SDValue Index = Op.getOperand(4);
16775 SDValue Src = Op.getOperand(5);
16776 SDValue Scale = Op.getOperand(6);
16777 return getScatterNode(IntrData->Opc0, Op, DAG, Src, Mask, Base, Index, Scale, Chain);
16780 SDValue Hint = Op.getOperand(6);
16782 if (dyn_cast<ConstantSDNode> (Hint) == nullptr ||
16783 (HintVal = dyn_cast<ConstantSDNode> (Hint)->getZExtValue()) > 1)
16784 llvm_unreachable("Wrong prefetch hint in intrinsic: should be 0 or 1");
16785 unsigned Opcode = (HintVal ? IntrData->Opc1 : IntrData->Opc0);
16786 SDValue Chain = Op.getOperand(0);
16787 SDValue Mask = Op.getOperand(2);
16788 SDValue Index = Op.getOperand(3);
16789 SDValue Base = Op.getOperand(4);
16790 SDValue Scale = Op.getOperand(5);
16791 return getPrefetchNode(Opcode, Op, DAG, Mask, Base, Index, Scale, Chain);
16793 // Read Time Stamp Counter (RDTSC) and Processor ID (RDTSCP).
16795 SmallVector<SDValue, 2> Results;
16796 getReadTimeStampCounter(Op.getNode(), dl, IntrData->Opc0, DAG, Subtarget, Results);
16797 return DAG.getMergeValues(Results, dl);
16799 // Read Performance Monitoring Counters.
16801 SmallVector<SDValue, 2> Results;
16802 getReadPerformanceCounter(Op.getNode(), dl, DAG, Subtarget, Results);
16803 return DAG.getMergeValues(Results, dl);
16805 // XTEST intrinsics.
16807 SDVTList VTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16808 SDValue InTrans = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(0));
16809 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16810 DAG.getConstant(X86::COND_NE, MVT::i8),
16812 SDValue Ret = DAG.getNode(ISD::ZERO_EXTEND, dl, Op->getValueType(0), SetCC);
16813 return DAG.getNode(ISD::MERGE_VALUES, dl, Op->getVTList(),
16814 Ret, SDValue(InTrans.getNode(), 1));
16818 SmallVector<SDValue, 2> Results;
16819 SDVTList CFVTs = DAG.getVTList(Op->getValueType(0), MVT::Other);
16820 SDVTList VTs = DAG.getVTList(Op.getOperand(3)->getValueType(0), MVT::Other);
16821 SDValue GenCF = DAG.getNode(X86ISD::ADD, dl, CFVTs, Op.getOperand(2),
16822 DAG.getConstant(-1, MVT::i8));
16823 SDValue Res = DAG.getNode(IntrData->Opc0, dl, VTs, Op.getOperand(3),
16824 Op.getOperand(4), GenCF.getValue(1));
16825 SDValue Store = DAG.getStore(Op.getOperand(0), dl, Res.getValue(0),
16826 Op.getOperand(5), MachinePointerInfo(),
16828 SDValue SetCC = DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
16829 DAG.getConstant(X86::COND_B, MVT::i8),
16831 Results.push_back(SetCC);
16832 Results.push_back(Store);
16833 return DAG.getMergeValues(Results, dl);
16838 SDValue X86TargetLowering::LowerRETURNADDR(SDValue Op,
16839 SelectionDAG &DAG) const {
16840 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16841 MFI->setReturnAddressIsTaken(true);
16843 if (verifyReturnAddressArgumentIsConstant(Op, DAG))
16846 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16848 EVT PtrVT = getPointerTy();
16851 SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
16852 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16853 DAG.getSubtarget().getRegisterInfo());
16854 SDValue Offset = DAG.getConstant(RegInfo->getSlotSize(), PtrVT);
16855 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16856 DAG.getNode(ISD::ADD, dl, PtrVT,
16857 FrameAddr, Offset),
16858 MachinePointerInfo(), false, false, false, 0);
16861 // Just load the return address.
16862 SDValue RetAddrFI = getReturnAddressFrameIndex(DAG);
16863 return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
16864 RetAddrFI, MachinePointerInfo(), false, false, false, 0);
16867 SDValue X86TargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
16868 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
16869 MFI->setFrameAddressIsTaken(true);
16871 EVT VT = Op.getValueType();
16872 SDLoc dl(Op); // FIXME probably not meaningful
16873 unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
16874 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16875 DAG.getSubtarget().getRegisterInfo());
16876 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16877 assert(((FrameReg == X86::RBP && VT == MVT::i64) ||
16878 (FrameReg == X86::EBP && VT == MVT::i32)) &&
16879 "Invalid Frame Register!");
16880 SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
16882 FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
16883 MachinePointerInfo(),
16884 false, false, false, 0);
16888 // FIXME? Maybe this could be a TableGen attribute on some registers and
16889 // this table could be generated automatically from RegInfo.
16890 unsigned X86TargetLowering::getRegisterByName(const char* RegName,
16892 unsigned Reg = StringSwitch<unsigned>(RegName)
16893 .Case("esp", X86::ESP)
16894 .Case("rsp", X86::RSP)
16898 report_fatal_error("Invalid register name global variable");
16901 SDValue X86TargetLowering::LowerFRAME_TO_ARGS_OFFSET(SDValue Op,
16902 SelectionDAG &DAG) const {
16903 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16904 DAG.getSubtarget().getRegisterInfo());
16905 return DAG.getIntPtrConstant(2 * RegInfo->getSlotSize());
16908 SDValue X86TargetLowering::LowerEH_RETURN(SDValue Op, SelectionDAG &DAG) const {
16909 SDValue Chain = Op.getOperand(0);
16910 SDValue Offset = Op.getOperand(1);
16911 SDValue Handler = Op.getOperand(2);
16914 EVT PtrVT = getPointerTy();
16915 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
16916 DAG.getSubtarget().getRegisterInfo());
16917 unsigned FrameReg = RegInfo->getFrameRegister(DAG.getMachineFunction());
16918 assert(((FrameReg == X86::RBP && PtrVT == MVT::i64) ||
16919 (FrameReg == X86::EBP && PtrVT == MVT::i32)) &&
16920 "Invalid Frame Register!");
16921 SDValue Frame = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, PtrVT);
16922 unsigned StoreAddrReg = (PtrVT == MVT::i64) ? X86::RCX : X86::ECX;
16924 SDValue StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, Frame,
16925 DAG.getIntPtrConstant(RegInfo->getSlotSize()));
16926 StoreAddr = DAG.getNode(ISD::ADD, dl, PtrVT, StoreAddr, Offset);
16927 Chain = DAG.getStore(Chain, dl, Handler, StoreAddr, MachinePointerInfo(),
16929 Chain = DAG.getCopyToReg(Chain, dl, StoreAddrReg, StoreAddr);
16931 return DAG.getNode(X86ISD::EH_RETURN, dl, MVT::Other, Chain,
16932 DAG.getRegister(StoreAddrReg, PtrVT));
16935 SDValue X86TargetLowering::lowerEH_SJLJ_SETJMP(SDValue Op,
16936 SelectionDAG &DAG) const {
16938 return DAG.getNode(X86ISD::EH_SJLJ_SETJMP, DL,
16939 DAG.getVTList(MVT::i32, MVT::Other),
16940 Op.getOperand(0), Op.getOperand(1));
16943 SDValue X86TargetLowering::lowerEH_SJLJ_LONGJMP(SDValue Op,
16944 SelectionDAG &DAG) const {
16946 return DAG.getNode(X86ISD::EH_SJLJ_LONGJMP, DL, MVT::Other,
16947 Op.getOperand(0), Op.getOperand(1));
16950 static SDValue LowerADJUST_TRAMPOLINE(SDValue Op, SelectionDAG &DAG) {
16951 return Op.getOperand(0);
16954 SDValue X86TargetLowering::LowerINIT_TRAMPOLINE(SDValue Op,
16955 SelectionDAG &DAG) const {
16956 SDValue Root = Op.getOperand(0);
16957 SDValue Trmp = Op.getOperand(1); // trampoline
16958 SDValue FPtr = Op.getOperand(2); // nested function
16959 SDValue Nest = Op.getOperand(3); // 'nest' parameter value
16962 const Value *TrmpAddr = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
16963 const TargetRegisterInfo *TRI = DAG.getSubtarget().getRegisterInfo();
16965 if (Subtarget->is64Bit()) {
16966 SDValue OutChains[6];
16968 // Large code-model.
16969 const unsigned char JMP64r = 0xFF; // 64-bit jmp through register opcode.
16970 const unsigned char MOV64ri = 0xB8; // X86::MOV64ri opcode.
16972 const unsigned char N86R10 = TRI->getEncodingValue(X86::R10) & 0x7;
16973 const unsigned char N86R11 = TRI->getEncodingValue(X86::R11) & 0x7;
16975 const unsigned char REX_WB = 0x40 | 0x08 | 0x01; // REX prefix
16977 // Load the pointer to the nested function into R11.
16978 unsigned OpCode = ((MOV64ri | N86R11) << 8) | REX_WB; // movabsq r11
16979 SDValue Addr = Trmp;
16980 OutChains[0] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16981 Addr, MachinePointerInfo(TrmpAddr),
16984 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16985 DAG.getConstant(2, MVT::i64));
16986 OutChains[1] = DAG.getStore(Root, dl, FPtr, Addr,
16987 MachinePointerInfo(TrmpAddr, 2),
16990 // Load the 'nest' parameter value into R10.
16991 // R10 is specified in X86CallingConv.td
16992 OpCode = ((MOV64ri | N86R10) << 8) | REX_WB; // movabsq r10
16993 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
16994 DAG.getConstant(10, MVT::i64));
16995 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
16996 Addr, MachinePointerInfo(TrmpAddr, 10),
16999 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17000 DAG.getConstant(12, MVT::i64));
17001 OutChains[3] = DAG.getStore(Root, dl, Nest, Addr,
17002 MachinePointerInfo(TrmpAddr, 12),
17005 // Jump to the nested function.
17006 OpCode = (JMP64r << 8) | REX_WB; // jmpq *...
17007 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17008 DAG.getConstant(20, MVT::i64));
17009 OutChains[4] = DAG.getStore(Root, dl, DAG.getConstant(OpCode, MVT::i16),
17010 Addr, MachinePointerInfo(TrmpAddr, 20),
17013 unsigned char ModRM = N86R11 | (4 << 3) | (3 << 6); // ...r11
17014 Addr = DAG.getNode(ISD::ADD, dl, MVT::i64, Trmp,
17015 DAG.getConstant(22, MVT::i64));
17016 OutChains[5] = DAG.getStore(Root, dl, DAG.getConstant(ModRM, MVT::i8), Addr,
17017 MachinePointerInfo(TrmpAddr, 22),
17020 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17022 const Function *Func =
17023 cast<Function>(cast<SrcValueSDNode>(Op.getOperand(5))->getValue());
17024 CallingConv::ID CC = Func->getCallingConv();
17029 llvm_unreachable("Unsupported calling convention");
17030 case CallingConv::C:
17031 case CallingConv::X86_StdCall: {
17032 // Pass 'nest' parameter in ECX.
17033 // Must be kept in sync with X86CallingConv.td
17034 NestReg = X86::ECX;
17036 // Check that ECX wasn't needed by an 'inreg' parameter.
17037 FunctionType *FTy = Func->getFunctionType();
17038 const AttributeSet &Attrs = Func->getAttributes();
17040 if (!Attrs.isEmpty() && !Func->isVarArg()) {
17041 unsigned InRegCount = 0;
17044 for (FunctionType::param_iterator I = FTy->param_begin(),
17045 E = FTy->param_end(); I != E; ++I, ++Idx)
17046 if (Attrs.hasAttribute(Idx, Attribute::InReg))
17047 // FIXME: should only count parameters that are lowered to integers.
17048 InRegCount += (TD->getTypeSizeInBits(*I) + 31) / 32;
17050 if (InRegCount > 2) {
17051 report_fatal_error("Nest register in use - reduce number of inreg"
17057 case CallingConv::X86_FastCall:
17058 case CallingConv::X86_ThisCall:
17059 case CallingConv::Fast:
17060 // Pass 'nest' parameter in EAX.
17061 // Must be kept in sync with X86CallingConv.td
17062 NestReg = X86::EAX;
17066 SDValue OutChains[4];
17067 SDValue Addr, Disp;
17069 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17070 DAG.getConstant(10, MVT::i32));
17071 Disp = DAG.getNode(ISD::SUB, dl, MVT::i32, FPtr, Addr);
17073 // This is storing the opcode for MOV32ri.
17074 const unsigned char MOV32ri = 0xB8; // X86::MOV32ri's opcode byte.
17075 const unsigned char N86Reg = TRI->getEncodingValue(NestReg) & 0x7;
17076 OutChains[0] = DAG.getStore(Root, dl,
17077 DAG.getConstant(MOV32ri|N86Reg, MVT::i8),
17078 Trmp, MachinePointerInfo(TrmpAddr),
17081 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17082 DAG.getConstant(1, MVT::i32));
17083 OutChains[1] = DAG.getStore(Root, dl, Nest, Addr,
17084 MachinePointerInfo(TrmpAddr, 1),
17087 const unsigned char JMP = 0xE9; // jmp <32bit dst> opcode.
17088 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17089 DAG.getConstant(5, MVT::i32));
17090 OutChains[2] = DAG.getStore(Root, dl, DAG.getConstant(JMP, MVT::i8), Addr,
17091 MachinePointerInfo(TrmpAddr, 5),
17094 Addr = DAG.getNode(ISD::ADD, dl, MVT::i32, Trmp,
17095 DAG.getConstant(6, MVT::i32));
17096 OutChains[3] = DAG.getStore(Root, dl, Disp, Addr,
17097 MachinePointerInfo(TrmpAddr, 6),
17100 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, OutChains);
17104 SDValue X86TargetLowering::LowerFLT_ROUNDS_(SDValue Op,
17105 SelectionDAG &DAG) const {
17107 The rounding mode is in bits 11:10 of FPSR, and has the following
17109 00 Round to nearest
17114 FLT_ROUNDS, on the other hand, expects the following:
17121 To perform the conversion, we do:
17122 (((((FPSR & 0x800) >> 11) | ((FPSR & 0x400) >> 9)) + 1) & 3)
17125 MachineFunction &MF = DAG.getMachineFunction();
17126 const TargetMachine &TM = MF.getTarget();
17127 const TargetFrameLowering &TFI = *TM.getSubtargetImpl()->getFrameLowering();
17128 unsigned StackAlignment = TFI.getStackAlignment();
17129 MVT VT = Op.getSimpleValueType();
17132 // Save FP Control Word to stack slot
17133 int SSFI = MF.getFrameInfo()->CreateStackObject(2, StackAlignment, false);
17134 SDValue StackSlot = DAG.getFrameIndex(SSFI, getPointerTy());
17136 MachineMemOperand *MMO =
17137 MF.getMachineMemOperand(MachinePointerInfo::getFixedStack(SSFI),
17138 MachineMemOperand::MOStore, 2, 2);
17140 SDValue Ops[] = { DAG.getEntryNode(), StackSlot };
17141 SDValue Chain = DAG.getMemIntrinsicNode(X86ISD::FNSTCW16m, DL,
17142 DAG.getVTList(MVT::Other),
17143 Ops, MVT::i16, MMO);
17145 // Load FP Control Word from stack slot
17146 SDValue CWD = DAG.getLoad(MVT::i16, DL, Chain, StackSlot,
17147 MachinePointerInfo(), false, false, false, 0);
17149 // Transform as necessary
17151 DAG.getNode(ISD::SRL, DL, MVT::i16,
17152 DAG.getNode(ISD::AND, DL, MVT::i16,
17153 CWD, DAG.getConstant(0x800, MVT::i16)),
17154 DAG.getConstant(11, MVT::i8));
17156 DAG.getNode(ISD::SRL, DL, MVT::i16,
17157 DAG.getNode(ISD::AND, DL, MVT::i16,
17158 CWD, DAG.getConstant(0x400, MVT::i16)),
17159 DAG.getConstant(9, MVT::i8));
17162 DAG.getNode(ISD::AND, DL, MVT::i16,
17163 DAG.getNode(ISD::ADD, DL, MVT::i16,
17164 DAG.getNode(ISD::OR, DL, MVT::i16, CWD1, CWD2),
17165 DAG.getConstant(1, MVT::i16)),
17166 DAG.getConstant(3, MVT::i16));
17168 return DAG.getNode((VT.getSizeInBits() < 16 ?
17169 ISD::TRUNCATE : ISD::ZERO_EXTEND), DL, VT, RetVal);
17172 static SDValue LowerCTLZ(SDValue Op, SelectionDAG &DAG) {
17173 MVT VT = Op.getSimpleValueType();
17175 unsigned NumBits = VT.getSizeInBits();
17178 Op = Op.getOperand(0);
17179 if (VT == MVT::i8) {
17180 // Zero extend to i32 since there is not an i8 bsr.
17182 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17185 // Issue a bsr (scan bits in reverse) which also sets EFLAGS.
17186 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17187 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17189 // If src is zero (i.e. bsr sets ZF), returns NumBits.
17192 DAG.getConstant(NumBits+NumBits-1, OpVT),
17193 DAG.getConstant(X86::COND_E, MVT::i8),
17196 Op = DAG.getNode(X86ISD::CMOV, dl, OpVT, Ops);
17198 // Finally xor with NumBits-1.
17199 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17202 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17206 static SDValue LowerCTLZ_ZERO_UNDEF(SDValue Op, SelectionDAG &DAG) {
17207 MVT VT = Op.getSimpleValueType();
17209 unsigned NumBits = VT.getSizeInBits();
17212 Op = Op.getOperand(0);
17213 if (VT == MVT::i8) {
17214 // Zero extend to i32 since there is not an i8 bsr.
17216 Op = DAG.getNode(ISD::ZERO_EXTEND, dl, OpVT, Op);
17219 // Issue a bsr (scan bits in reverse).
17220 SDVTList VTs = DAG.getVTList(OpVT, MVT::i32);
17221 Op = DAG.getNode(X86ISD::BSR, dl, VTs, Op);
17223 // And xor with NumBits-1.
17224 Op = DAG.getNode(ISD::XOR, dl, OpVT, Op, DAG.getConstant(NumBits-1, OpVT));
17227 Op = DAG.getNode(ISD::TRUNCATE, dl, MVT::i8, Op);
17231 static SDValue LowerCTTZ(SDValue Op, SelectionDAG &DAG) {
17232 MVT VT = Op.getSimpleValueType();
17233 unsigned NumBits = VT.getSizeInBits();
17235 Op = Op.getOperand(0);
17237 // Issue a bsf (scan bits forward) which also sets EFLAGS.
17238 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
17239 Op = DAG.getNode(X86ISD::BSF, dl, VTs, Op);
17241 // If src is zero (i.e. bsf sets ZF), returns NumBits.
17244 DAG.getConstant(NumBits, VT),
17245 DAG.getConstant(X86::COND_E, MVT::i8),
17248 return DAG.getNode(X86ISD::CMOV, dl, VT, Ops);
17251 // Lower256IntArith - Break a 256-bit integer operation into two new 128-bit
17252 // ones, and then concatenate the result back.
17253 static SDValue Lower256IntArith(SDValue Op, SelectionDAG &DAG) {
17254 MVT VT = Op.getSimpleValueType();
17256 assert(VT.is256BitVector() && VT.isInteger() &&
17257 "Unsupported value type for operation");
17259 unsigned NumElems = VT.getVectorNumElements();
17262 // Extract the LHS vectors
17263 SDValue LHS = Op.getOperand(0);
17264 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
17265 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
17267 // Extract the RHS vectors
17268 SDValue RHS = Op.getOperand(1);
17269 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, dl);
17270 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, dl);
17272 MVT EltVT = VT.getVectorElementType();
17273 MVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
17275 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT,
17276 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, RHS1),
17277 DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, RHS2));
17280 static SDValue LowerADD(SDValue Op, SelectionDAG &DAG) {
17281 assert(Op.getSimpleValueType().is256BitVector() &&
17282 Op.getSimpleValueType().isInteger() &&
17283 "Only handle AVX 256-bit vector integer operation");
17284 return Lower256IntArith(Op, DAG);
17287 static SDValue LowerSUB(SDValue Op, SelectionDAG &DAG) {
17288 assert(Op.getSimpleValueType().is256BitVector() &&
17289 Op.getSimpleValueType().isInteger() &&
17290 "Only handle AVX 256-bit vector integer operation");
17291 return Lower256IntArith(Op, DAG);
17294 static SDValue LowerMUL(SDValue Op, const X86Subtarget *Subtarget,
17295 SelectionDAG &DAG) {
17297 MVT VT = Op.getSimpleValueType();
17299 // Decompose 256-bit ops into smaller 128-bit ops.
17300 if (VT.is256BitVector() && !Subtarget->hasInt256())
17301 return Lower256IntArith(Op, DAG);
17303 SDValue A = Op.getOperand(0);
17304 SDValue B = Op.getOperand(1);
17306 // Lower v4i32 mul as 2x shuffle, 2x pmuludq, 2x shuffle.
17307 if (VT == MVT::v4i32) {
17308 assert(Subtarget->hasSSE2() && !Subtarget->hasSSE41() &&
17309 "Should not custom lower when pmuldq is available!");
17311 // Extract the odd parts.
17312 static const int UnpackMask[] = { 1, -1, 3, -1 };
17313 SDValue Aodds = DAG.getVectorShuffle(VT, dl, A, A, UnpackMask);
17314 SDValue Bodds = DAG.getVectorShuffle(VT, dl, B, B, UnpackMask);
17316 // Multiply the even parts.
17317 SDValue Evens = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, A, B);
17318 // Now multiply odd parts.
17319 SDValue Odds = DAG.getNode(X86ISD::PMULUDQ, dl, MVT::v2i64, Aodds, Bodds);
17321 Evens = DAG.getNode(ISD::BITCAST, dl, VT, Evens);
17322 Odds = DAG.getNode(ISD::BITCAST, dl, VT, Odds);
17324 // Merge the two vectors back together with a shuffle. This expands into 2
17326 static const int ShufMask[] = { 0, 4, 2, 6 };
17327 return DAG.getVectorShuffle(VT, dl, Evens, Odds, ShufMask);
17330 assert((VT == MVT::v2i64 || VT == MVT::v4i64 || VT == MVT::v8i64) &&
17331 "Only know how to lower V2I64/V4I64/V8I64 multiply");
17333 // Ahi = psrlqi(a, 32);
17334 // Bhi = psrlqi(b, 32);
17336 // AloBlo = pmuludq(a, b);
17337 // AloBhi = pmuludq(a, Bhi);
17338 // AhiBlo = pmuludq(Ahi, b);
17340 // AloBhi = psllqi(AloBhi, 32);
17341 // AhiBlo = psllqi(AhiBlo, 32);
17342 // return AloBlo + AloBhi + AhiBlo;
17344 SDValue Ahi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, A, 32, DAG);
17345 SDValue Bhi = getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, B, 32, DAG);
17347 // Bit cast to 32-bit vectors for MULUDQ
17348 EVT MulVT = (VT == MVT::v2i64) ? MVT::v4i32 :
17349 (VT == MVT::v4i64) ? MVT::v8i32 : MVT::v16i32;
17350 A = DAG.getNode(ISD::BITCAST, dl, MulVT, A);
17351 B = DAG.getNode(ISD::BITCAST, dl, MulVT, B);
17352 Ahi = DAG.getNode(ISD::BITCAST, dl, MulVT, Ahi);
17353 Bhi = DAG.getNode(ISD::BITCAST, dl, MulVT, Bhi);
17355 SDValue AloBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, B);
17356 SDValue AloBhi = DAG.getNode(X86ISD::PMULUDQ, dl, VT, A, Bhi);
17357 SDValue AhiBlo = DAG.getNode(X86ISD::PMULUDQ, dl, VT, Ahi, B);
17359 AloBhi = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AloBhi, 32, DAG);
17360 AhiBlo = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, AhiBlo, 32, DAG);
17362 SDValue Res = DAG.getNode(ISD::ADD, dl, VT, AloBlo, AloBhi);
17363 return DAG.getNode(ISD::ADD, dl, VT, Res, AhiBlo);
17366 SDValue X86TargetLowering::LowerWin64_i128OP(SDValue Op, SelectionDAG &DAG) const {
17367 assert(Subtarget->isTargetWin64() && "Unexpected target");
17368 EVT VT = Op.getValueType();
17369 assert(VT.isInteger() && VT.getSizeInBits() == 128 &&
17370 "Unexpected return type for lowering");
17374 switch (Op->getOpcode()) {
17375 default: llvm_unreachable("Unexpected request for libcall!");
17376 case ISD::SDIV: isSigned = true; LC = RTLIB::SDIV_I128; break;
17377 case ISD::UDIV: isSigned = false; LC = RTLIB::UDIV_I128; break;
17378 case ISD::SREM: isSigned = true; LC = RTLIB::SREM_I128; break;
17379 case ISD::UREM: isSigned = false; LC = RTLIB::UREM_I128; break;
17380 case ISD::SDIVREM: isSigned = true; LC = RTLIB::SDIVREM_I128; break;
17381 case ISD::UDIVREM: isSigned = false; LC = RTLIB::UDIVREM_I128; break;
17385 SDValue InChain = DAG.getEntryNode();
17387 TargetLowering::ArgListTy Args;
17388 TargetLowering::ArgListEntry Entry;
17389 for (unsigned i = 0, e = Op->getNumOperands(); i != e; ++i) {
17390 EVT ArgVT = Op->getOperand(i).getValueType();
17391 assert(ArgVT.isInteger() && ArgVT.getSizeInBits() == 128 &&
17392 "Unexpected argument type for lowering");
17393 SDValue StackPtr = DAG.CreateStackTemporary(ArgVT, 16);
17394 Entry.Node = StackPtr;
17395 InChain = DAG.getStore(InChain, dl, Op->getOperand(i), StackPtr, MachinePointerInfo(),
17397 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
17398 Entry.Ty = PointerType::get(ArgTy,0);
17399 Entry.isSExt = false;
17400 Entry.isZExt = false;
17401 Args.push_back(Entry);
17404 SDValue Callee = DAG.getExternalSymbol(getLibcallName(LC),
17407 TargetLowering::CallLoweringInfo CLI(DAG);
17408 CLI.setDebugLoc(dl).setChain(InChain)
17409 .setCallee(getLibcallCallingConv(LC),
17410 static_cast<EVT>(MVT::v2i64).getTypeForEVT(*DAG.getContext()),
17411 Callee, std::move(Args), 0)
17412 .setInRegister().setSExtResult(isSigned).setZExtResult(!isSigned);
17414 std::pair<SDValue, SDValue> CallInfo = LowerCallTo(CLI);
17415 return DAG.getNode(ISD::BITCAST, dl, VT, CallInfo.first);
17418 static SDValue LowerMUL_LOHI(SDValue Op, const X86Subtarget *Subtarget,
17419 SelectionDAG &DAG) {
17420 SDValue Op0 = Op.getOperand(0), Op1 = Op.getOperand(1);
17421 EVT VT = Op0.getValueType();
17424 assert((VT == MVT::v4i32 && Subtarget->hasSSE2()) ||
17425 (VT == MVT::v8i32 && Subtarget->hasInt256()));
17427 // PMULxD operations multiply each even value (starting at 0) of LHS with
17428 // the related value of RHS and produce a widen result.
17429 // E.g., PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17430 // => <2 x i64> <ae|cg>
17432 // In other word, to have all the results, we need to perform two PMULxD:
17433 // 1. one with the even values.
17434 // 2. one with the odd values.
17435 // To achieve #2, with need to place the odd values at an even position.
17437 // Place the odd value at an even position (basically, shift all values 1
17438 // step to the left):
17439 const int Mask[] = {1, -1, 3, -1, 5, -1, 7, -1};
17440 // <a|b|c|d> => <b|undef|d|undef>
17441 SDValue Odd0 = DAG.getVectorShuffle(VT, dl, Op0, Op0, Mask);
17442 // <e|f|g|h> => <f|undef|h|undef>
17443 SDValue Odd1 = DAG.getVectorShuffle(VT, dl, Op1, Op1, Mask);
17445 // Emit two multiplies, one for the lower 2 ints and one for the higher 2
17447 MVT MulVT = VT == MVT::v4i32 ? MVT::v2i64 : MVT::v4i64;
17448 bool IsSigned = Op->getOpcode() == ISD::SMUL_LOHI;
17450 (!IsSigned || !Subtarget->hasSSE41()) ? X86ISD::PMULUDQ : X86ISD::PMULDQ;
17451 // PMULUDQ <4 x i32> <a|b|c|d>, <4 x i32> <e|f|g|h>
17452 // => <2 x i64> <ae|cg>
17453 SDValue Mul1 = DAG.getNode(ISD::BITCAST, dl, VT,
17454 DAG.getNode(Opcode, dl, MulVT, Op0, Op1));
17455 // PMULUDQ <4 x i32> <b|undef|d|undef>, <4 x i32> <f|undef|h|undef>
17456 // => <2 x i64> <bf|dh>
17457 SDValue Mul2 = DAG.getNode(ISD::BITCAST, dl, VT,
17458 DAG.getNode(Opcode, dl, MulVT, Odd0, Odd1));
17460 // Shuffle it back into the right order.
17461 SDValue Highs, Lows;
17462 if (VT == MVT::v8i32) {
17463 const int HighMask[] = {1, 9, 3, 11, 5, 13, 7, 15};
17464 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17465 const int LowMask[] = {0, 8, 2, 10, 4, 12, 6, 14};
17466 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17468 const int HighMask[] = {1, 5, 3, 7};
17469 Highs = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, HighMask);
17470 const int LowMask[] = {0, 4, 2, 6};
17471 Lows = DAG.getVectorShuffle(VT, dl, Mul1, Mul2, LowMask);
17474 // If we have a signed multiply but no PMULDQ fix up the high parts of a
17475 // unsigned multiply.
17476 if (IsSigned && !Subtarget->hasSSE41()) {
17478 DAG.getConstant(31, DAG.getTargetLoweringInfo().getShiftAmountTy(VT));
17479 SDValue T1 = DAG.getNode(ISD::AND, dl, VT,
17480 DAG.getNode(ISD::SRA, dl, VT, Op0, ShAmt), Op1);
17481 SDValue T2 = DAG.getNode(ISD::AND, dl, VT,
17482 DAG.getNode(ISD::SRA, dl, VT, Op1, ShAmt), Op0);
17484 SDValue Fixup = DAG.getNode(ISD::ADD, dl, VT, T1, T2);
17485 Highs = DAG.getNode(ISD::SUB, dl, VT, Highs, Fixup);
17488 // The first result of MUL_LOHI is actually the low value, followed by the
17490 SDValue Ops[] = {Lows, Highs};
17491 return DAG.getMergeValues(Ops, dl);
17494 static SDValue LowerScalarImmediateShift(SDValue Op, SelectionDAG &DAG,
17495 const X86Subtarget *Subtarget) {
17496 MVT VT = Op.getSimpleValueType();
17498 SDValue R = Op.getOperand(0);
17499 SDValue Amt = Op.getOperand(1);
17501 // Optimize shl/srl/sra with constant shift amount.
17502 if (auto *BVAmt = dyn_cast<BuildVectorSDNode>(Amt)) {
17503 if (auto *ShiftConst = BVAmt->getConstantSplatNode()) {
17504 uint64_t ShiftAmt = ShiftConst->getZExtValue();
17506 if (VT == MVT::v2i64 || VT == MVT::v4i32 || VT == MVT::v8i16 ||
17507 (Subtarget->hasInt256() &&
17508 (VT == MVT::v4i64 || VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17509 (Subtarget->hasAVX512() &&
17510 (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17511 if (Op.getOpcode() == ISD::SHL)
17512 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17514 if (Op.getOpcode() == ISD::SRL)
17515 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17517 if (Op.getOpcode() == ISD::SRA && VT != MVT::v2i64 && VT != MVT::v4i64)
17518 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17522 if (VT == MVT::v16i8) {
17523 if (Op.getOpcode() == ISD::SHL) {
17524 // Make a large shift.
17525 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17526 MVT::v8i16, R, ShiftAmt,
17528 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17529 // Zero out the rightmost bits.
17530 SmallVector<SDValue, 16> V(16,
17531 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17533 return DAG.getNode(ISD::AND, dl, VT, SHL,
17534 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17536 if (Op.getOpcode() == ISD::SRL) {
17537 // Make a large shift.
17538 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17539 MVT::v8i16, R, ShiftAmt,
17541 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17542 // Zero out the leftmost bits.
17543 SmallVector<SDValue, 16> V(16,
17544 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17546 return DAG.getNode(ISD::AND, dl, VT, SRL,
17547 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17549 if (Op.getOpcode() == ISD::SRA) {
17550 if (ShiftAmt == 7) {
17551 // R s>> 7 === R s< 0
17552 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17553 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17556 // R s>> a === ((R u>> a) ^ m) - m
17557 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17558 SmallVector<SDValue, 16> V(16, DAG.getConstant(128 >> ShiftAmt,
17560 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17561 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17562 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17565 llvm_unreachable("Unknown shift opcode.");
17568 if (Subtarget->hasInt256() && VT == MVT::v32i8) {
17569 if (Op.getOpcode() == ISD::SHL) {
17570 // Make a large shift.
17571 SDValue SHL = getTargetVShiftByConstNode(X86ISD::VSHLI, dl,
17572 MVT::v16i16, R, ShiftAmt,
17574 SHL = DAG.getNode(ISD::BITCAST, dl, VT, SHL);
17575 // Zero out the rightmost bits.
17576 SmallVector<SDValue, 32> V(32,
17577 DAG.getConstant(uint8_t(-1U << ShiftAmt),
17579 return DAG.getNode(ISD::AND, dl, VT, SHL,
17580 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17582 if (Op.getOpcode() == ISD::SRL) {
17583 // Make a large shift.
17584 SDValue SRL = getTargetVShiftByConstNode(X86ISD::VSRLI, dl,
17585 MVT::v16i16, R, ShiftAmt,
17587 SRL = DAG.getNode(ISD::BITCAST, dl, VT, SRL);
17588 // Zero out the leftmost bits.
17589 SmallVector<SDValue, 32> V(32,
17590 DAG.getConstant(uint8_t(-1U) >> ShiftAmt,
17592 return DAG.getNode(ISD::AND, dl, VT, SRL,
17593 DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V));
17595 if (Op.getOpcode() == ISD::SRA) {
17596 if (ShiftAmt == 7) {
17597 // R s>> 7 === R s< 0
17598 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
17599 return DAG.getNode(X86ISD::PCMPGT, dl, VT, Zeros, R);
17602 // R s>> a === ((R u>> a) ^ m) - m
17603 SDValue Res = DAG.getNode(ISD::SRL, dl, VT, R, Amt);
17604 SmallVector<SDValue, 32> V(32, DAG.getConstant(128 >> ShiftAmt,
17606 SDValue Mask = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, V);
17607 Res = DAG.getNode(ISD::XOR, dl, VT, Res, Mask);
17608 Res = DAG.getNode(ISD::SUB, dl, VT, Res, Mask);
17611 llvm_unreachable("Unknown shift opcode.");
17616 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17617 if (!Subtarget->is64Bit() &&
17618 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64)) &&
17619 Amt.getOpcode() == ISD::BITCAST &&
17620 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17621 Amt = Amt.getOperand(0);
17622 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17623 VT.getVectorNumElements();
17624 unsigned RatioInLog2 = Log2_32_Ceil(Ratio);
17625 uint64_t ShiftAmt = 0;
17626 for (unsigned i = 0; i != Ratio; ++i) {
17627 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Amt.getOperand(i));
17631 ShiftAmt |= C->getZExtValue() << (i * (1 << (6 - RatioInLog2)));
17633 // Check remaining shift amounts.
17634 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17635 uint64_t ShAmt = 0;
17636 for (unsigned j = 0; j != Ratio; ++j) {
17637 ConstantSDNode *C =
17638 dyn_cast<ConstantSDNode>(Amt.getOperand(i + j));
17642 ShAmt |= C->getZExtValue() << (j * (1 << (6 - RatioInLog2)));
17644 if (ShAmt != ShiftAmt)
17647 switch (Op.getOpcode()) {
17649 llvm_unreachable("Unknown shift opcode!");
17651 return getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, R, ShiftAmt,
17654 return getTargetVShiftByConstNode(X86ISD::VSRLI, dl, VT, R, ShiftAmt,
17657 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, R, ShiftAmt,
17665 static SDValue LowerScalarVariableShift(SDValue Op, SelectionDAG &DAG,
17666 const X86Subtarget* Subtarget) {
17667 MVT VT = Op.getSimpleValueType();
17669 SDValue R = Op.getOperand(0);
17670 SDValue Amt = Op.getOperand(1);
17672 if ((VT == MVT::v2i64 && Op.getOpcode() != ISD::SRA) ||
17673 VT == MVT::v4i32 || VT == MVT::v8i16 ||
17674 (Subtarget->hasInt256() &&
17675 ((VT == MVT::v4i64 && Op.getOpcode() != ISD::SRA) ||
17676 VT == MVT::v8i32 || VT == MVT::v16i16)) ||
17677 (Subtarget->hasAVX512() && (VT == MVT::v8i64 || VT == MVT::v16i32))) {
17679 EVT EltVT = VT.getVectorElementType();
17681 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
17682 unsigned NumElts = VT.getVectorNumElements();
17684 for (i = 0; i != NumElts; ++i) {
17685 if (Amt.getOperand(i).getOpcode() == ISD::UNDEF)
17689 for (j = i; j != NumElts; ++j) {
17690 SDValue Arg = Amt.getOperand(j);
17691 if (Arg.getOpcode() == ISD::UNDEF) continue;
17692 if (Arg != Amt.getOperand(i))
17695 if (i != NumElts && j == NumElts)
17696 BaseShAmt = Amt.getOperand(i);
17698 if (Amt.getOpcode() == ISD::EXTRACT_SUBVECTOR)
17699 Amt = Amt.getOperand(0);
17700 if (Amt.getOpcode() == ISD::VECTOR_SHUFFLE &&
17701 cast<ShuffleVectorSDNode>(Amt)->isSplat()) {
17702 SDValue InVec = Amt.getOperand(0);
17703 if (InVec.getOpcode() == ISD::BUILD_VECTOR) {
17704 unsigned NumElts = InVec.getValueType().getVectorNumElements();
17706 for (; i != NumElts; ++i) {
17707 SDValue Arg = InVec.getOperand(i);
17708 if (Arg.getOpcode() == ISD::UNDEF) continue;
17712 } else if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT) {
17713 if (ConstantSDNode *C =
17714 dyn_cast<ConstantSDNode>(InVec.getOperand(2))) {
17715 unsigned SplatIdx =
17716 cast<ShuffleVectorSDNode>(Amt)->getSplatIndex();
17717 if (C->getZExtValue() == SplatIdx)
17718 BaseShAmt = InVec.getOperand(1);
17721 if (!BaseShAmt.getNode())
17722 BaseShAmt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Amt,
17723 DAG.getIntPtrConstant(0));
17727 if (BaseShAmt.getNode()) {
17728 if (EltVT.bitsGT(MVT::i32))
17729 BaseShAmt = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, BaseShAmt);
17730 else if (EltVT.bitsLT(MVT::i32))
17731 BaseShAmt = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, BaseShAmt);
17733 switch (Op.getOpcode()) {
17735 llvm_unreachable("Unknown shift opcode!");
17737 switch (VT.SimpleTy) {
17738 default: return SDValue();
17747 return getTargetVShiftNode(X86ISD::VSHLI, dl, VT, R, BaseShAmt, DAG);
17750 switch (VT.SimpleTy) {
17751 default: return SDValue();
17758 return getTargetVShiftNode(X86ISD::VSRAI, dl, VT, R, BaseShAmt, DAG);
17761 switch (VT.SimpleTy) {
17762 default: return SDValue();
17771 return getTargetVShiftNode(X86ISD::VSRLI, dl, VT, R, BaseShAmt, DAG);
17777 // Special case in 32-bit mode, where i64 is expanded into high and low parts.
17778 if (!Subtarget->is64Bit() &&
17779 (VT == MVT::v2i64 || (Subtarget->hasInt256() && VT == MVT::v4i64) ||
17780 (Subtarget->hasAVX512() && VT == MVT::v8i64)) &&
17781 Amt.getOpcode() == ISD::BITCAST &&
17782 Amt.getOperand(0).getOpcode() == ISD::BUILD_VECTOR) {
17783 Amt = Amt.getOperand(0);
17784 unsigned Ratio = Amt.getSimpleValueType().getVectorNumElements() /
17785 VT.getVectorNumElements();
17786 std::vector<SDValue> Vals(Ratio);
17787 for (unsigned i = 0; i != Ratio; ++i)
17788 Vals[i] = Amt.getOperand(i);
17789 for (unsigned i = Ratio; i != Amt.getNumOperands(); i += Ratio) {
17790 for (unsigned j = 0; j != Ratio; ++j)
17791 if (Vals[j] != Amt.getOperand(i + j))
17794 switch (Op.getOpcode()) {
17796 llvm_unreachable("Unknown shift opcode!");
17798 return DAG.getNode(X86ISD::VSHL, dl, VT, R, Op.getOperand(1));
17800 return DAG.getNode(X86ISD::VSRL, dl, VT, R, Op.getOperand(1));
17802 return DAG.getNode(X86ISD::VSRA, dl, VT, R, Op.getOperand(1));
17809 static SDValue LowerShift(SDValue Op, const X86Subtarget* Subtarget,
17810 SelectionDAG &DAG) {
17811 MVT VT = Op.getSimpleValueType();
17813 SDValue R = Op.getOperand(0);
17814 SDValue Amt = Op.getOperand(1);
17817 assert(VT.isVector() && "Custom lowering only for vector shifts!");
17818 assert(Subtarget->hasSSE2() && "Only custom lower when we have SSE2!");
17820 V = LowerScalarImmediateShift(Op, DAG, Subtarget);
17824 V = LowerScalarVariableShift(Op, DAG, Subtarget);
17828 if (Subtarget->hasAVX512() && (VT == MVT::v16i32 || VT == MVT::v8i64))
17830 // AVX2 has VPSLLV/VPSRAV/VPSRLV.
17831 if (Subtarget->hasInt256()) {
17832 if (Op.getOpcode() == ISD::SRL &&
17833 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17834 VT == MVT::v4i64 || VT == MVT::v8i32))
17836 if (Op.getOpcode() == ISD::SHL &&
17837 (VT == MVT::v2i64 || VT == MVT::v4i32 ||
17838 VT == MVT::v4i64 || VT == MVT::v8i32))
17840 if (Op.getOpcode() == ISD::SRA && (VT == MVT::v4i32 || VT == MVT::v8i32))
17844 // If possible, lower this packed shift into a vector multiply instead of
17845 // expanding it into a sequence of scalar shifts.
17846 // Do this only if the vector shift count is a constant build_vector.
17847 if (Op.getOpcode() == ISD::SHL &&
17848 (VT == MVT::v8i16 || VT == MVT::v4i32 ||
17849 (Subtarget->hasInt256() && VT == MVT::v16i16)) &&
17850 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17851 SmallVector<SDValue, 8> Elts;
17852 EVT SVT = VT.getScalarType();
17853 unsigned SVTBits = SVT.getSizeInBits();
17854 const APInt &One = APInt(SVTBits, 1);
17855 unsigned NumElems = VT.getVectorNumElements();
17857 for (unsigned i=0; i !=NumElems; ++i) {
17858 SDValue Op = Amt->getOperand(i);
17859 if (Op->getOpcode() == ISD::UNDEF) {
17860 Elts.push_back(Op);
17864 ConstantSDNode *ND = cast<ConstantSDNode>(Op);
17865 const APInt &C = APInt(SVTBits, ND->getAPIntValue().getZExtValue());
17866 uint64_t ShAmt = C.getZExtValue();
17867 if (ShAmt >= SVTBits) {
17868 Elts.push_back(DAG.getUNDEF(SVT));
17871 Elts.push_back(DAG.getConstant(One.shl(ShAmt), SVT));
17873 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Elts);
17874 return DAG.getNode(ISD::MUL, dl, VT, R, BV);
17877 // Lower SHL with variable shift amount.
17878 if (VT == MVT::v4i32 && Op->getOpcode() == ISD::SHL) {
17879 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(23, VT));
17881 Op = DAG.getNode(ISD::ADD, dl, VT, Op, DAG.getConstant(0x3f800000U, VT));
17882 Op = DAG.getNode(ISD::BITCAST, dl, MVT::v4f32, Op);
17883 Op = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op);
17884 return DAG.getNode(ISD::MUL, dl, VT, Op, R);
17887 // If possible, lower this shift as a sequence of two shifts by
17888 // constant plus a MOVSS/MOVSD instead of scalarizing it.
17890 // (v4i32 (srl A, (build_vector < X, Y, Y, Y>)))
17892 // Could be rewritten as:
17893 // (v4i32 (MOVSS (srl A, <Y,Y,Y,Y>), (srl A, <X,X,X,X>)))
17895 // The advantage is that the two shifts from the example would be
17896 // lowered as X86ISD::VSRLI nodes. This would be cheaper than scalarizing
17897 // the vector shift into four scalar shifts plus four pairs of vector
17899 if ((VT == MVT::v8i16 || VT == MVT::v4i32) &&
17900 ISD::isBuildVectorOfConstantSDNodes(Amt.getNode())) {
17901 unsigned TargetOpcode = X86ISD::MOVSS;
17902 bool CanBeSimplified;
17903 // The splat value for the first packed shift (the 'X' from the example).
17904 SDValue Amt1 = Amt->getOperand(0);
17905 // The splat value for the second packed shift (the 'Y' from the example).
17906 SDValue Amt2 = (VT == MVT::v4i32) ? Amt->getOperand(1) :
17907 Amt->getOperand(2);
17909 // See if it is possible to replace this node with a sequence of
17910 // two shifts followed by a MOVSS/MOVSD
17911 if (VT == MVT::v4i32) {
17912 // Check if it is legal to use a MOVSS.
17913 CanBeSimplified = Amt2 == Amt->getOperand(2) &&
17914 Amt2 == Amt->getOperand(3);
17915 if (!CanBeSimplified) {
17916 // Otherwise, check if we can still simplify this node using a MOVSD.
17917 CanBeSimplified = Amt1 == Amt->getOperand(1) &&
17918 Amt->getOperand(2) == Amt->getOperand(3);
17919 TargetOpcode = X86ISD::MOVSD;
17920 Amt2 = Amt->getOperand(2);
17923 // Do similar checks for the case where the machine value type
17925 CanBeSimplified = Amt1 == Amt->getOperand(1);
17926 for (unsigned i=3; i != 8 && CanBeSimplified; ++i)
17927 CanBeSimplified = Amt2 == Amt->getOperand(i);
17929 if (!CanBeSimplified) {
17930 TargetOpcode = X86ISD::MOVSD;
17931 CanBeSimplified = true;
17932 Amt2 = Amt->getOperand(4);
17933 for (unsigned i=0; i != 4 && CanBeSimplified; ++i)
17934 CanBeSimplified = Amt1 == Amt->getOperand(i);
17935 for (unsigned j=4; j != 8 && CanBeSimplified; ++j)
17936 CanBeSimplified = Amt2 == Amt->getOperand(j);
17940 if (CanBeSimplified && isa<ConstantSDNode>(Amt1) &&
17941 isa<ConstantSDNode>(Amt2)) {
17942 // Replace this node with two shifts followed by a MOVSS/MOVSD.
17943 EVT CastVT = MVT::v4i32;
17945 DAG.getConstant(cast<ConstantSDNode>(Amt1)->getAPIntValue(), VT);
17946 SDValue Shift1 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat1);
17948 DAG.getConstant(cast<ConstantSDNode>(Amt2)->getAPIntValue(), VT);
17949 SDValue Shift2 = DAG.getNode(Op->getOpcode(), dl, VT, R, Splat2);
17950 if (TargetOpcode == X86ISD::MOVSD)
17951 CastVT = MVT::v2i64;
17952 SDValue BitCast1 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift1);
17953 SDValue BitCast2 = DAG.getNode(ISD::BITCAST, dl, CastVT, Shift2);
17954 SDValue Result = getTargetShuffleNode(TargetOpcode, dl, CastVT, BitCast2,
17956 return DAG.getNode(ISD::BITCAST, dl, VT, Result);
17960 if (VT == MVT::v16i8 && Op->getOpcode() == ISD::SHL) {
17961 assert(Subtarget->hasSSE2() && "Need SSE2 for pslli/pcmpeq.");
17964 Op = DAG.getNode(ISD::SHL, dl, VT, Amt, DAG.getConstant(5, VT));
17965 Op = DAG.getNode(ISD::BITCAST, dl, VT, Op);
17967 // Turn 'a' into a mask suitable for VSELECT
17968 SDValue VSelM = DAG.getConstant(0x80, VT);
17969 SDValue OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17970 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17972 SDValue CM1 = DAG.getConstant(0x0f, VT);
17973 SDValue CM2 = DAG.getConstant(0x3f, VT);
17975 // r = VSELECT(r, psllw(r & (char16)15, 4), a);
17976 SDValue M = DAG.getNode(ISD::AND, dl, VT, R, CM1);
17977 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 4, DAG);
17978 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17979 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17982 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17983 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17984 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17986 // r = VSELECT(r, psllw(r & (char16)63, 2), a);
17987 M = DAG.getNode(ISD::AND, dl, VT, R, CM2);
17988 M = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, MVT::v8i16, M, 2, DAG);
17989 M = DAG.getNode(ISD::BITCAST, dl, VT, M);
17990 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel, M, R);
17993 Op = DAG.getNode(ISD::ADD, dl, VT, Op, Op);
17994 OpVSel = DAG.getNode(ISD::AND, dl, VT, VSelM, Op);
17995 OpVSel = DAG.getNode(X86ISD::PCMPEQ, dl, VT, OpVSel, VSelM);
17997 // return VSELECT(r, r+r, a);
17998 R = DAG.getNode(ISD::VSELECT, dl, VT, OpVSel,
17999 DAG.getNode(ISD::ADD, dl, VT, R, R), R);
18003 // It's worth extending once and using the v8i32 shifts for 16-bit types, but
18004 // the extra overheads to get from v16i8 to v8i32 make the existing SSE
18005 // solution better.
18006 if (Subtarget->hasInt256() && VT == MVT::v8i16) {
18007 MVT NewVT = VT == MVT::v8i16 ? MVT::v8i32 : MVT::v16i16;
18009 Op.getOpcode() == ISD::SRA ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
18010 R = DAG.getNode(ExtOpc, dl, NewVT, R);
18011 Amt = DAG.getNode(ISD::ANY_EXTEND, dl, NewVT, Amt);
18012 return DAG.getNode(ISD::TRUNCATE, dl, VT,
18013 DAG.getNode(Op.getOpcode(), dl, NewVT, R, Amt));
18016 // Decompose 256-bit shifts into smaller 128-bit shifts.
18017 if (VT.is256BitVector()) {
18018 unsigned NumElems = VT.getVectorNumElements();
18019 MVT EltVT = VT.getVectorElementType();
18020 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18022 // Extract the two vectors
18023 SDValue V1 = Extract128BitVector(R, 0, DAG, dl);
18024 SDValue V2 = Extract128BitVector(R, NumElems/2, DAG, dl);
18026 // Recreate the shift amount vectors
18027 SDValue Amt1, Amt2;
18028 if (Amt.getOpcode() == ISD::BUILD_VECTOR) {
18029 // Constant shift amount
18030 SmallVector<SDValue, 4> Amt1Csts;
18031 SmallVector<SDValue, 4> Amt2Csts;
18032 for (unsigned i = 0; i != NumElems/2; ++i)
18033 Amt1Csts.push_back(Amt->getOperand(i));
18034 for (unsigned i = NumElems/2; i != NumElems; ++i)
18035 Amt2Csts.push_back(Amt->getOperand(i));
18037 Amt1 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt1Csts);
18038 Amt2 = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Amt2Csts);
18040 // Variable shift amount
18041 Amt1 = Extract128BitVector(Amt, 0, DAG, dl);
18042 Amt2 = Extract128BitVector(Amt, NumElems/2, DAG, dl);
18045 // Issue new vector shifts for the smaller types
18046 V1 = DAG.getNode(Op.getOpcode(), dl, NewVT, V1, Amt1);
18047 V2 = DAG.getNode(Op.getOpcode(), dl, NewVT, V2, Amt2);
18049 // Concatenate the result back
18050 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, V1, V2);
18056 static SDValue LowerXALUO(SDValue Op, SelectionDAG &DAG) {
18057 // Lower the "add/sub/mul with overflow" instruction into a regular ins plus
18058 // a "setcc" instruction that checks the overflow flag. The "brcond" lowering
18059 // looks for this combo and may remove the "setcc" instruction if the "setcc"
18060 // has only one use.
18061 SDNode *N = Op.getNode();
18062 SDValue LHS = N->getOperand(0);
18063 SDValue RHS = N->getOperand(1);
18064 unsigned BaseOp = 0;
18067 switch (Op.getOpcode()) {
18068 default: llvm_unreachable("Unknown ovf instruction!");
18070 // A subtract of one will be selected as a INC. Note that INC doesn't
18071 // set CF, so we can't do this for UADDO.
18072 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18074 BaseOp = X86ISD::INC;
18075 Cond = X86::COND_O;
18078 BaseOp = X86ISD::ADD;
18079 Cond = X86::COND_O;
18082 BaseOp = X86ISD::ADD;
18083 Cond = X86::COND_B;
18086 // A subtract of one will be selected as a DEC. Note that DEC doesn't
18087 // set CF, so we can't do this for USUBO.
18088 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS))
18090 BaseOp = X86ISD::DEC;
18091 Cond = X86::COND_O;
18094 BaseOp = X86ISD::SUB;
18095 Cond = X86::COND_O;
18098 BaseOp = X86ISD::SUB;
18099 Cond = X86::COND_B;
18102 BaseOp = X86ISD::SMUL;
18103 Cond = X86::COND_O;
18105 case ISD::UMULO: { // i64, i8 = umulo lhs, rhs --> i64, i64, i32 umul lhs,rhs
18106 SDVTList VTs = DAG.getVTList(N->getValueType(0), N->getValueType(0),
18108 SDValue Sum = DAG.getNode(X86ISD::UMUL, DL, VTs, LHS, RHS);
18111 DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
18112 DAG.getConstant(X86::COND_O, MVT::i32),
18113 SDValue(Sum.getNode(), 2));
18115 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18119 // Also sets EFLAGS.
18120 SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
18121 SDValue Sum = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);
18124 DAG.getNode(X86ISD::SETCC, DL, N->getValueType(1),
18125 DAG.getConstant(Cond, MVT::i32),
18126 SDValue(Sum.getNode(), 1));
18128 return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Sum, SetCC);
18131 // Sign extension of the low part of vector elements. This may be used either
18132 // when sign extend instructions are not available or if the vector element
18133 // sizes already match the sign-extended size. If the vector elements are in
18134 // their pre-extended size and sign extend instructions are available, that will
18135 // be handled by LowerSIGN_EXTEND.
18136 SDValue X86TargetLowering::LowerSIGN_EXTEND_INREG(SDValue Op,
18137 SelectionDAG &DAG) const {
18139 EVT ExtraVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
18140 MVT VT = Op.getSimpleValueType();
18142 if (!Subtarget->hasSSE2() || !VT.isVector())
18145 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
18146 ExtraVT.getScalarType().getSizeInBits();
18148 switch (VT.SimpleTy) {
18149 default: return SDValue();
18152 if (!Subtarget->hasFp256())
18154 if (!Subtarget->hasInt256()) {
18155 // needs to be split
18156 unsigned NumElems = VT.getVectorNumElements();
18158 // Extract the LHS vectors
18159 SDValue LHS = Op.getOperand(0);
18160 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, dl);
18161 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, dl);
18163 MVT EltVT = VT.getVectorElementType();
18164 EVT NewVT = MVT::getVectorVT(EltVT, NumElems/2);
18166 EVT ExtraEltVT = ExtraVT.getVectorElementType();
18167 unsigned ExtraNumElems = ExtraVT.getVectorNumElements();
18168 ExtraVT = EVT::getVectorVT(*DAG.getContext(), ExtraEltVT,
18170 SDValue Extra = DAG.getValueType(ExtraVT);
18172 LHS1 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS1, Extra);
18173 LHS2 = DAG.getNode(Op.getOpcode(), dl, NewVT, LHS2, Extra);
18175 return DAG.getNode(ISD::CONCAT_VECTORS, dl, VT, LHS1, LHS2);
18180 SDValue Op0 = Op.getOperand(0);
18182 // This is a sign extension of some low part of vector elements without
18183 // changing the size of the vector elements themselves:
18184 // Shift-Left + Shift-Right-Algebraic.
18185 SDValue Shl = getTargetVShiftByConstNode(X86ISD::VSHLI, dl, VT, Op0,
18187 return getTargetVShiftByConstNode(X86ISD::VSRAI, dl, VT, Shl, BitsDiff,
18193 /// Returns true if the operand type is exactly twice the native width, and
18194 /// the corresponding cmpxchg8b or cmpxchg16b instruction is available.
18195 /// Used to know whether to use cmpxchg8/16b when expanding atomic operations
18196 /// (otherwise we leave them alone to become __sync_fetch_and_... calls).
18197 bool X86TargetLowering::needsCmpXchgNb(const Type *MemType) const {
18198 const X86Subtarget &Subtarget =
18199 getTargetMachine().getSubtarget<X86Subtarget>();
18200 unsigned OpWidth = MemType->getPrimitiveSizeInBits();
18203 return !Subtarget.is64Bit(); // FIXME this should be Subtarget.hasCmpxchg8b
18204 else if (OpWidth == 128)
18205 return Subtarget.hasCmpxchg16b();
18210 bool X86TargetLowering::shouldExpandAtomicStoreInIR(StoreInst *SI) const {
18211 return needsCmpXchgNb(SI->getValueOperand()->getType());
18214 // Note: this turns large loads into lock cmpxchg8b/16b.
18215 // FIXME: On 32 bits x86, fild/movq might be faster than lock cmpxchg8b.
18216 bool X86TargetLowering::shouldExpandAtomicLoadInIR(LoadInst *LI) const {
18217 auto PTy = cast<PointerType>(LI->getPointerOperand()->getType());
18218 return needsCmpXchgNb(PTy->getElementType());
18221 bool X86TargetLowering::shouldExpandAtomicRMWInIR(AtomicRMWInst *AI) const {
18222 const X86Subtarget &Subtarget =
18223 getTargetMachine().getSubtarget<X86Subtarget>();
18224 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18225 const Type *MemType = AI->getType();
18227 // If the operand is too big, we must see if cmpxchg8/16b is available
18228 // and default to library calls otherwise.
18229 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18230 return needsCmpXchgNb(MemType);
18232 AtomicRMWInst::BinOp Op = AI->getOperation();
18235 llvm_unreachable("Unknown atomic operation");
18236 case AtomicRMWInst::Xchg:
18237 case AtomicRMWInst::Add:
18238 case AtomicRMWInst::Sub:
18239 // It's better to use xadd, xsub or xchg for these in all cases.
18241 case AtomicRMWInst::Or:
18242 case AtomicRMWInst::And:
18243 case AtomicRMWInst::Xor:
18244 // If the atomicrmw's result isn't actually used, we can just add a "lock"
18245 // prefix to a normal instruction for these operations.
18246 return !AI->use_empty();
18247 case AtomicRMWInst::Nand:
18248 case AtomicRMWInst::Max:
18249 case AtomicRMWInst::Min:
18250 case AtomicRMWInst::UMax:
18251 case AtomicRMWInst::UMin:
18252 // These always require a non-trivial set of data operations on x86. We must
18253 // use a cmpxchg loop.
18258 static bool hasMFENCE(const X86Subtarget& Subtarget) {
18259 // Use mfence if we have SSE2 or we're on x86-64 (even if we asked for
18260 // no-sse2). There isn't any reason to disable it if the target processor
18262 return Subtarget.hasSSE2() || Subtarget.is64Bit();
18266 X86TargetLowering::lowerIdempotentRMWIntoFencedLoad(AtomicRMWInst *AI) const {
18267 const X86Subtarget &Subtarget =
18268 getTargetMachine().getSubtarget<X86Subtarget>();
18269 unsigned NativeWidth = Subtarget.is64Bit() ? 64 : 32;
18270 const Type *MemType = AI->getType();
18271 // Accesses larger than the native width are turned into cmpxchg/libcalls, so
18272 // there is no benefit in turning such RMWs into loads, and it is actually
18273 // harmful as it introduces a mfence.
18274 if (MemType->getPrimitiveSizeInBits() > NativeWidth)
18277 auto Builder = IRBuilder<>(AI);
18278 Module *M = Builder.GetInsertBlock()->getParent()->getParent();
18279 auto SynchScope = AI->getSynchScope();
18280 // We must restrict the ordering to avoid generating loads with Release or
18281 // ReleaseAcquire orderings.
18282 auto Order = AtomicCmpXchgInst::getStrongestFailureOrdering(AI->getOrdering());
18283 auto Ptr = AI->getPointerOperand();
18285 // Before the load we need a fence. Here is an example lifted from
18286 // http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf showing why a fence
18289 // x.store(1, relaxed);
18290 // r1 = y.fetch_add(0, release);
18292 // y.fetch_add(42, acquire);
18293 // r2 = x.load(relaxed);
18294 // r1 = r2 = 0 is impossible, but becomes possible if the idempotent rmw is
18295 // lowered to just a load without a fence. A mfence flushes the store buffer,
18296 // making the optimization clearly correct.
18297 // FIXME: it is required if isAtLeastRelease(Order) but it is not clear
18298 // otherwise, we might be able to be more agressive on relaxed idempotent
18299 // rmw. In practice, they do not look useful, so we don't try to be
18300 // especially clever.
18301 if (SynchScope == SingleThread) {
18302 // FIXME: we could just insert an X86ISD::MEMBARRIER here, except we are at
18303 // the IR level, so we must wrap it in an intrinsic.
18305 } else if (hasMFENCE(Subtarget)) {
18306 Function *MFence = llvm::Intrinsic::getDeclaration(M,
18307 Intrinsic::x86_sse2_mfence);
18308 Builder.CreateCall(MFence);
18310 // FIXME: it might make sense to use a locked operation here but on a
18311 // different cache-line to prevent cache-line bouncing. In practice it
18312 // is probably a small win, and x86 processors without mfence are rare
18313 // enough that we do not bother.
18317 // Finally we can emit the atomic load.
18318 LoadInst *Loaded = Builder.CreateAlignedLoad(Ptr,
18319 AI->getType()->getPrimitiveSizeInBits());
18320 Loaded->setAtomic(Order, SynchScope);
18321 AI->replaceAllUsesWith(Loaded);
18322 AI->eraseFromParent();
18326 static SDValue LowerATOMIC_FENCE(SDValue Op, const X86Subtarget *Subtarget,
18327 SelectionDAG &DAG) {
18329 AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
18330 cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
18331 SynchronizationScope FenceScope = static_cast<SynchronizationScope>(
18332 cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());
18334 // The only fence that needs an instruction is a sequentially-consistent
18335 // cross-thread fence.
18336 if (FenceOrdering == SequentiallyConsistent && FenceScope == CrossThread) {
18337 if (hasMFENCE(*Subtarget))
18338 return DAG.getNode(X86ISD::MFENCE, dl, MVT::Other, Op.getOperand(0));
18340 SDValue Chain = Op.getOperand(0);
18341 SDValue Zero = DAG.getConstant(0, MVT::i32);
18343 DAG.getRegister(X86::ESP, MVT::i32), // Base
18344 DAG.getTargetConstant(1, MVT::i8), // Scale
18345 DAG.getRegister(0, MVT::i32), // Index
18346 DAG.getTargetConstant(0, MVT::i32), // Disp
18347 DAG.getRegister(0, MVT::i32), // Segment.
18351 SDNode *Res = DAG.getMachineNode(X86::OR32mrLocked, dl, MVT::Other, Ops);
18352 return SDValue(Res, 0);
18355 // MEMBARRIER is a compiler barrier; it codegens to a no-op.
18356 return DAG.getNode(X86ISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0));
18359 static SDValue LowerCMP_SWAP(SDValue Op, const X86Subtarget *Subtarget,
18360 SelectionDAG &DAG) {
18361 MVT T = Op.getSimpleValueType();
18365 switch(T.SimpleTy) {
18366 default: llvm_unreachable("Invalid value type!");
18367 case MVT::i8: Reg = X86::AL; size = 1; break;
18368 case MVT::i16: Reg = X86::AX; size = 2; break;
18369 case MVT::i32: Reg = X86::EAX; size = 4; break;
18371 assert(Subtarget->is64Bit() && "Node not type legal!");
18372 Reg = X86::RAX; size = 8;
18375 SDValue cpIn = DAG.getCopyToReg(Op.getOperand(0), DL, Reg,
18376 Op.getOperand(2), SDValue());
18377 SDValue Ops[] = { cpIn.getValue(0),
18380 DAG.getTargetConstant(size, MVT::i8),
18381 cpIn.getValue(1) };
18382 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18383 MachineMemOperand *MMO = cast<AtomicSDNode>(Op)->getMemOperand();
18384 SDValue Result = DAG.getMemIntrinsicNode(X86ISD::LCMPXCHG_DAG, DL, Tys,
18388 DAG.getCopyFromReg(Result.getValue(0), DL, Reg, T, Result.getValue(1));
18389 SDValue EFLAGS = DAG.getCopyFromReg(cpOut.getValue(1), DL, X86::EFLAGS,
18390 MVT::i32, cpOut.getValue(2));
18391 SDValue Success = DAG.getNode(X86ISD::SETCC, DL, Op->getValueType(1),
18392 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18394 DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), cpOut);
18395 DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
18396 DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), EFLAGS.getValue(1));
18400 static SDValue LowerBITCAST(SDValue Op, const X86Subtarget *Subtarget,
18401 SelectionDAG &DAG) {
18402 MVT SrcVT = Op.getOperand(0).getSimpleValueType();
18403 MVT DstVT = Op.getSimpleValueType();
18405 if (SrcVT == MVT::v2i32 || SrcVT == MVT::v4i16 || SrcVT == MVT::v8i8) {
18406 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18407 if (DstVT != MVT::f64)
18408 // This conversion needs to be expanded.
18411 SDValue InVec = Op->getOperand(0);
18413 unsigned NumElts = SrcVT.getVectorNumElements();
18414 EVT SVT = SrcVT.getVectorElementType();
18416 // Widen the vector in input in the case of MVT::v2i32.
18417 // Example: from MVT::v2i32 to MVT::v4i32.
18418 SmallVector<SDValue, 16> Elts;
18419 for (unsigned i = 0, e = NumElts; i != e; ++i)
18420 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT, InVec,
18421 DAG.getIntPtrConstant(i)));
18423 // Explicitly mark the extra elements as Undef.
18424 SDValue Undef = DAG.getUNDEF(SVT);
18425 for (unsigned i = NumElts, e = NumElts * 2; i != e; ++i)
18426 Elts.push_back(Undef);
18428 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18429 SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT, Elts);
18430 SDValue ToV2F64 = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, BV);
18431 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, ToV2F64,
18432 DAG.getIntPtrConstant(0));
18435 assert(Subtarget->is64Bit() && !Subtarget->hasSSE2() &&
18436 Subtarget->hasMMX() && "Unexpected custom BITCAST");
18437 assert((DstVT == MVT::i64 ||
18438 (DstVT.isVector() && DstVT.getSizeInBits()==64)) &&
18439 "Unexpected custom BITCAST");
18440 // i64 <=> MMX conversions are Legal.
18441 if (SrcVT==MVT::i64 && DstVT.isVector())
18443 if (DstVT==MVT::i64 && SrcVT.isVector())
18445 // MMX <=> MMX conversions are Legal.
18446 if (SrcVT.isVector() && DstVT.isVector())
18448 // All other conversions need to be expanded.
18452 static SDValue LowerLOAD_SUB(SDValue Op, SelectionDAG &DAG) {
18453 SDNode *Node = Op.getNode();
18455 EVT T = Node->getValueType(0);
18456 SDValue negOp = DAG.getNode(ISD::SUB, dl, T,
18457 DAG.getConstant(0, T), Node->getOperand(2));
18458 return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, dl,
18459 cast<AtomicSDNode>(Node)->getMemoryVT(),
18460 Node->getOperand(0),
18461 Node->getOperand(1), negOp,
18462 cast<AtomicSDNode>(Node)->getMemOperand(),
18463 cast<AtomicSDNode>(Node)->getOrdering(),
18464 cast<AtomicSDNode>(Node)->getSynchScope());
18467 static SDValue LowerATOMIC_STORE(SDValue Op, SelectionDAG &DAG) {
18468 SDNode *Node = Op.getNode();
18470 EVT VT = cast<AtomicSDNode>(Node)->getMemoryVT();
18472 // Convert seq_cst store -> xchg
18473 // Convert wide store -> swap (-> cmpxchg8b/cmpxchg16b)
18474 // FIXME: On 32-bit, store -> fist or movq would be more efficient
18475 // (The only way to get a 16-byte store is cmpxchg16b)
18476 // FIXME: 16-byte ATOMIC_SWAP isn't actually hooked up at the moment.
18477 if (cast<AtomicSDNode>(Node)->getOrdering() == SequentiallyConsistent ||
18478 !DAG.getTargetLoweringInfo().isTypeLegal(VT)) {
18479 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
18480 cast<AtomicSDNode>(Node)->getMemoryVT(),
18481 Node->getOperand(0),
18482 Node->getOperand(1), Node->getOperand(2),
18483 cast<AtomicSDNode>(Node)->getMemOperand(),
18484 cast<AtomicSDNode>(Node)->getOrdering(),
18485 cast<AtomicSDNode>(Node)->getSynchScope());
18486 return Swap.getValue(1);
18488 // Other atomic stores have a simple pattern.
18492 static SDValue LowerADDC_ADDE_SUBC_SUBE(SDValue Op, SelectionDAG &DAG) {
18493 EVT VT = Op.getNode()->getSimpleValueType(0);
18495 // Let legalize expand this if it isn't a legal type yet.
18496 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
18499 SDVTList VTs = DAG.getVTList(VT, MVT::i32);
18502 bool ExtraOp = false;
18503 switch (Op.getOpcode()) {
18504 default: llvm_unreachable("Invalid code");
18505 case ISD::ADDC: Opc = X86ISD::ADD; break;
18506 case ISD::ADDE: Opc = X86ISD::ADC; ExtraOp = true; break;
18507 case ISD::SUBC: Opc = X86ISD::SUB; break;
18508 case ISD::SUBE: Opc = X86ISD::SBB; ExtraOp = true; break;
18512 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18514 return DAG.getNode(Opc, SDLoc(Op), VTs, Op.getOperand(0),
18515 Op.getOperand(1), Op.getOperand(2));
18518 static SDValue LowerFSINCOS(SDValue Op, const X86Subtarget *Subtarget,
18519 SelectionDAG &DAG) {
18520 assert(Subtarget->isTargetDarwin() && Subtarget->is64Bit());
18522 // For MacOSX, we want to call an alternative entry point: __sincos_stret,
18523 // which returns the values as { float, float } (in XMM0) or
18524 // { double, double } (which is returned in XMM0, XMM1).
18526 SDValue Arg = Op.getOperand(0);
18527 EVT ArgVT = Arg.getValueType();
18528 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
18530 TargetLowering::ArgListTy Args;
18531 TargetLowering::ArgListEntry Entry;
18535 Entry.isSExt = false;
18536 Entry.isZExt = false;
18537 Args.push_back(Entry);
18539 bool isF64 = ArgVT == MVT::f64;
18540 // Only optimize x86_64 for now. i386 is a bit messy. For f32,
18541 // the small struct {f32, f32} is returned in (eax, edx). For f64,
18542 // the results are returned via SRet in memory.
18543 const char *LibcallName = isF64 ? "__sincos_stret" : "__sincosf_stret";
18544 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18545 SDValue Callee = DAG.getExternalSymbol(LibcallName, TLI.getPointerTy());
18547 Type *RetTy = isF64
18548 ? (Type*)StructType::get(ArgTy, ArgTy, NULL)
18549 : (Type*)VectorType::get(ArgTy, 4);
18551 TargetLowering::CallLoweringInfo CLI(DAG);
18552 CLI.setDebugLoc(dl).setChain(DAG.getEntryNode())
18553 .setCallee(CallingConv::C, RetTy, Callee, std::move(Args), 0);
18555 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
18558 // Returned in xmm0 and xmm1.
18559 return CallResult.first;
18561 // Returned in bits 0:31 and 32:64 xmm0.
18562 SDValue SinVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18563 CallResult.first, DAG.getIntPtrConstant(0));
18564 SDValue CosVal = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ArgVT,
18565 CallResult.first, DAG.getIntPtrConstant(1));
18566 SDVTList Tys = DAG.getVTList(ArgVT, ArgVT);
18567 return DAG.getNode(ISD::MERGE_VALUES, dl, Tys, SinVal, CosVal);
18570 /// LowerOperation - Provide custom lowering hooks for some operations.
18572 SDValue X86TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
18573 switch (Op.getOpcode()) {
18574 default: llvm_unreachable("Should not custom lower this!");
18575 case ISD::SIGN_EXTEND_INREG: return LowerSIGN_EXTEND_INREG(Op,DAG);
18576 case ISD::ATOMIC_FENCE: return LowerATOMIC_FENCE(Op, Subtarget, DAG);
18577 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
18578 return LowerCMP_SWAP(Op, Subtarget, DAG);
18579 case ISD::ATOMIC_LOAD_SUB: return LowerLOAD_SUB(Op,DAG);
18580 case ISD::ATOMIC_STORE: return LowerATOMIC_STORE(Op,DAG);
18581 case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG);
18582 case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
18583 case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
18584 case ISD::VSELECT: return LowerVSELECT(Op, DAG);
18585 case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
18586 case ISD::INSERT_VECTOR_ELT: return LowerINSERT_VECTOR_ELT(Op, DAG);
18587 case ISD::EXTRACT_SUBVECTOR: return LowerEXTRACT_SUBVECTOR(Op,Subtarget,DAG);
18588 case ISD::INSERT_SUBVECTOR: return LowerINSERT_SUBVECTOR(Op, Subtarget,DAG);
18589 case ISD::SCALAR_TO_VECTOR: return LowerSCALAR_TO_VECTOR(Op, DAG);
18590 case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
18591 case ISD::GlobalAddress: return LowerGlobalAddress(Op, DAG);
18592 case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
18593 case ISD::ExternalSymbol: return LowerExternalSymbol(Op, DAG);
18594 case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
18595 case ISD::SHL_PARTS:
18596 case ISD::SRA_PARTS:
18597 case ISD::SRL_PARTS: return LowerShiftParts(Op, DAG);
18598 case ISD::SINT_TO_FP: return LowerSINT_TO_FP(Op, DAG);
18599 case ISD::UINT_TO_FP: return LowerUINT_TO_FP(Op, DAG);
18600 case ISD::TRUNCATE: return LowerTRUNCATE(Op, DAG);
18601 case ISD::ZERO_EXTEND: return LowerZERO_EXTEND(Op, Subtarget, DAG);
18602 case ISD::SIGN_EXTEND: return LowerSIGN_EXTEND(Op, Subtarget, DAG);
18603 case ISD::ANY_EXTEND: return LowerANY_EXTEND(Op, Subtarget, DAG);
18604 case ISD::FP_TO_SINT: return LowerFP_TO_SINT(Op, DAG);
18605 case ISD::FP_TO_UINT: return LowerFP_TO_UINT(Op, DAG);
18606 case ISD::FP_EXTEND: return LowerFP_EXTEND(Op, DAG);
18607 case ISD::LOAD: return LowerExtendedLoad(Op, Subtarget, DAG);
18609 case ISD::FNEG: return LowerFABSorFNEG(Op, DAG);
18610 case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
18611 case ISD::FGETSIGN: return LowerFGETSIGN(Op, DAG);
18612 case ISD::SETCC: return LowerSETCC(Op, DAG);
18613 case ISD::SELECT: return LowerSELECT(Op, DAG);
18614 case ISD::BRCOND: return LowerBRCOND(Op, DAG);
18615 case ISD::JumpTable: return LowerJumpTable(Op, DAG);
18616 case ISD::VASTART: return LowerVASTART(Op, DAG);
18617 case ISD::VAARG: return LowerVAARG(Op, DAG);
18618 case ISD::VACOPY: return LowerVACOPY(Op, Subtarget, DAG);
18619 case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG);
18620 case ISD::INTRINSIC_VOID:
18621 case ISD::INTRINSIC_W_CHAIN: return LowerINTRINSIC_W_CHAIN(Op, Subtarget, DAG);
18622 case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
18623 case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
18624 case ISD::FRAME_TO_ARGS_OFFSET:
18625 return LowerFRAME_TO_ARGS_OFFSET(Op, DAG);
18626 case ISD::DYNAMIC_STACKALLOC: return LowerDYNAMIC_STACKALLOC(Op, DAG);
18627 case ISD::EH_RETURN: return LowerEH_RETURN(Op, DAG);
18628 case ISD::EH_SJLJ_SETJMP: return lowerEH_SJLJ_SETJMP(Op, DAG);
18629 case ISD::EH_SJLJ_LONGJMP: return lowerEH_SJLJ_LONGJMP(Op, DAG);
18630 case ISD::INIT_TRAMPOLINE: return LowerINIT_TRAMPOLINE(Op, DAG);
18631 case ISD::ADJUST_TRAMPOLINE: return LowerADJUST_TRAMPOLINE(Op, DAG);
18632 case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
18633 case ISD::CTLZ: return LowerCTLZ(Op, DAG);
18634 case ISD::CTLZ_ZERO_UNDEF: return LowerCTLZ_ZERO_UNDEF(Op, DAG);
18635 case ISD::CTTZ: return LowerCTTZ(Op, DAG);
18636 case ISD::MUL: return LowerMUL(Op, Subtarget, DAG);
18637 case ISD::UMUL_LOHI:
18638 case ISD::SMUL_LOHI: return LowerMUL_LOHI(Op, Subtarget, DAG);
18641 case ISD::SHL: return LowerShift(Op, Subtarget, DAG);
18647 case ISD::UMULO: return LowerXALUO(Op, DAG);
18648 case ISD::READCYCLECOUNTER: return LowerREADCYCLECOUNTER(Op, Subtarget,DAG);
18649 case ISD::BITCAST: return LowerBITCAST(Op, Subtarget, DAG);
18653 case ISD::SUBE: return LowerADDC_ADDE_SUBC_SUBE(Op, DAG);
18654 case ISD::ADD: return LowerADD(Op, DAG);
18655 case ISD::SUB: return LowerSUB(Op, DAG);
18656 case ISD::FSINCOS: return LowerFSINCOS(Op, Subtarget, DAG);
18660 /// ReplaceNodeResults - Replace a node with an illegal result type
18661 /// with a new node built out of custom code.
18662 void X86TargetLowering::ReplaceNodeResults(SDNode *N,
18663 SmallVectorImpl<SDValue>&Results,
18664 SelectionDAG &DAG) const {
18666 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
18667 switch (N->getOpcode()) {
18669 llvm_unreachable("Do not know how to custom type legalize this operation!");
18670 case ISD::SIGN_EXTEND_INREG:
18675 // We don't want to expand or promote these.
18682 case ISD::UDIVREM: {
18683 SDValue V = LowerWin64_i128OP(SDValue(N,0), DAG);
18684 Results.push_back(V);
18687 case ISD::FP_TO_SINT:
18688 case ISD::FP_TO_UINT: {
18689 bool IsSigned = N->getOpcode() == ISD::FP_TO_SINT;
18691 if (!IsSigned && !isIntegerTypeFTOL(SDValue(N, 0).getValueType()))
18694 std::pair<SDValue,SDValue> Vals =
18695 FP_TO_INTHelper(SDValue(N, 0), DAG, IsSigned, /*IsReplace=*/ true);
18696 SDValue FIST = Vals.first, StackSlot = Vals.second;
18697 if (FIST.getNode()) {
18698 EVT VT = N->getValueType(0);
18699 // Return a load from the stack slot.
18700 if (StackSlot.getNode())
18701 Results.push_back(DAG.getLoad(VT, dl, FIST, StackSlot,
18702 MachinePointerInfo(),
18703 false, false, false, 0));
18705 Results.push_back(FIST);
18709 case ISD::UINT_TO_FP: {
18710 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18711 if (N->getOperand(0).getValueType() != MVT::v2i32 ||
18712 N->getValueType(0) != MVT::v2f32)
18714 SDValue ZExtIn = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::v2i64,
18716 SDValue Bias = DAG.getConstantFP(BitsToDouble(0x4330000000000000ULL),
18718 SDValue VBias = DAG.getNode(ISD::BUILD_VECTOR, dl, MVT::v2f64, Bias, Bias);
18719 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::v2i64, ZExtIn,
18720 DAG.getNode(ISD::BITCAST, dl, MVT::v2i64, VBias));
18721 Or = DAG.getNode(ISD::BITCAST, dl, MVT::v2f64, Or);
18722 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::v2f64, Or, VBias);
18723 Results.push_back(DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, Sub));
18726 case ISD::FP_ROUND: {
18727 if (!TLI.isTypeLegal(N->getOperand(0).getValueType()))
18729 SDValue V = DAG.getNode(X86ISD::VFPROUND, dl, MVT::v4f32, N->getOperand(0));
18730 Results.push_back(V);
18733 case ISD::INTRINSIC_W_CHAIN: {
18734 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(1))->getZExtValue();
18736 default : llvm_unreachable("Do not know how to custom type "
18737 "legalize this intrinsic operation!");
18738 case Intrinsic::x86_rdtsc:
18739 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18741 case Intrinsic::x86_rdtscp:
18742 return getReadTimeStampCounter(N, dl, X86ISD::RDTSCP_DAG, DAG, Subtarget,
18744 case Intrinsic::x86_rdpmc:
18745 return getReadPerformanceCounter(N, dl, DAG, Subtarget, Results);
18748 case ISD::READCYCLECOUNTER: {
18749 return getReadTimeStampCounter(N, dl, X86ISD::RDTSC_DAG, DAG, Subtarget,
18752 case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
18753 EVT T = N->getValueType(0);
18754 assert((T == MVT::i64 || T == MVT::i128) && "can only expand cmpxchg pair");
18755 bool Regs64bit = T == MVT::i128;
18756 EVT HalfT = Regs64bit ? MVT::i64 : MVT::i32;
18757 SDValue cpInL, cpInH;
18758 cpInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18759 DAG.getConstant(0, HalfT));
18760 cpInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(2),
18761 DAG.getConstant(1, HalfT));
18762 cpInL = DAG.getCopyToReg(N->getOperand(0), dl,
18763 Regs64bit ? X86::RAX : X86::EAX,
18765 cpInH = DAG.getCopyToReg(cpInL.getValue(0), dl,
18766 Regs64bit ? X86::RDX : X86::EDX,
18767 cpInH, cpInL.getValue(1));
18768 SDValue swapInL, swapInH;
18769 swapInL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18770 DAG.getConstant(0, HalfT));
18771 swapInH = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, HalfT, N->getOperand(3),
18772 DAG.getConstant(1, HalfT));
18773 swapInL = DAG.getCopyToReg(cpInH.getValue(0), dl,
18774 Regs64bit ? X86::RBX : X86::EBX,
18775 swapInL, cpInH.getValue(1));
18776 swapInH = DAG.getCopyToReg(swapInL.getValue(0), dl,
18777 Regs64bit ? X86::RCX : X86::ECX,
18778 swapInH, swapInL.getValue(1));
18779 SDValue Ops[] = { swapInH.getValue(0),
18781 swapInH.getValue(1) };
18782 SDVTList Tys = DAG.getVTList(MVT::Other, MVT::Glue);
18783 MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
18784 unsigned Opcode = Regs64bit ? X86ISD::LCMPXCHG16_DAG :
18785 X86ISD::LCMPXCHG8_DAG;
18786 SDValue Result = DAG.getMemIntrinsicNode(Opcode, dl, Tys, Ops, T, MMO);
18787 SDValue cpOutL = DAG.getCopyFromReg(Result.getValue(0), dl,
18788 Regs64bit ? X86::RAX : X86::EAX,
18789 HalfT, Result.getValue(1));
18790 SDValue cpOutH = DAG.getCopyFromReg(cpOutL.getValue(1), dl,
18791 Regs64bit ? X86::RDX : X86::EDX,
18792 HalfT, cpOutL.getValue(2));
18793 SDValue OpsF[] = { cpOutL.getValue(0), cpOutH.getValue(0)};
18795 SDValue EFLAGS = DAG.getCopyFromReg(cpOutH.getValue(1), dl, X86::EFLAGS,
18796 MVT::i32, cpOutH.getValue(2));
18798 DAG.getNode(X86ISD::SETCC, dl, MVT::i8,
18799 DAG.getConstant(X86::COND_E, MVT::i8), EFLAGS);
18800 Success = DAG.getZExtOrTrunc(Success, dl, N->getValueType(1));
18802 Results.push_back(DAG.getNode(ISD::BUILD_PAIR, dl, T, OpsF));
18803 Results.push_back(Success);
18804 Results.push_back(EFLAGS.getValue(1));
18807 case ISD::ATOMIC_SWAP:
18808 case ISD::ATOMIC_LOAD_ADD:
18809 case ISD::ATOMIC_LOAD_SUB:
18810 case ISD::ATOMIC_LOAD_AND:
18811 case ISD::ATOMIC_LOAD_OR:
18812 case ISD::ATOMIC_LOAD_XOR:
18813 case ISD::ATOMIC_LOAD_NAND:
18814 case ISD::ATOMIC_LOAD_MIN:
18815 case ISD::ATOMIC_LOAD_MAX:
18816 case ISD::ATOMIC_LOAD_UMIN:
18817 case ISD::ATOMIC_LOAD_UMAX:
18818 case ISD::ATOMIC_LOAD: {
18819 // Delegate to generic TypeLegalization. Situations we can really handle
18820 // should have already been dealt with by AtomicExpandPass.cpp.
18823 case ISD::BITCAST: {
18824 assert(Subtarget->hasSSE2() && "Requires at least SSE2!");
18825 EVT DstVT = N->getValueType(0);
18826 EVT SrcVT = N->getOperand(0)->getValueType(0);
18828 if (SrcVT != MVT::f64 ||
18829 (DstVT != MVT::v2i32 && DstVT != MVT::v4i16 && DstVT != MVT::v8i8))
18832 unsigned NumElts = DstVT.getVectorNumElements();
18833 EVT SVT = DstVT.getVectorElementType();
18834 EVT WiderVT = EVT::getVectorVT(*DAG.getContext(), SVT, NumElts * 2);
18835 SDValue Expanded = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
18836 MVT::v2f64, N->getOperand(0));
18837 SDValue ToVecInt = DAG.getNode(ISD::BITCAST, dl, WiderVT, Expanded);
18839 if (ExperimentalVectorWideningLegalization) {
18840 // If we are legalizing vectors by widening, we already have the desired
18841 // legal vector type, just return it.
18842 Results.push_back(ToVecInt);
18846 SmallVector<SDValue, 8> Elts;
18847 for (unsigned i = 0, e = NumElts; i != e; ++i)
18848 Elts.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SVT,
18849 ToVecInt, DAG.getIntPtrConstant(i)));
18851 Results.push_back(DAG.getNode(ISD::BUILD_VECTOR, dl, DstVT, Elts));
18856 const char *X86TargetLowering::getTargetNodeName(unsigned Opcode) const {
18858 default: return nullptr;
18859 case X86ISD::BSF: return "X86ISD::BSF";
18860 case X86ISD::BSR: return "X86ISD::BSR";
18861 case X86ISD::SHLD: return "X86ISD::SHLD";
18862 case X86ISD::SHRD: return "X86ISD::SHRD";
18863 case X86ISD::FAND: return "X86ISD::FAND";
18864 case X86ISD::FANDN: return "X86ISD::FANDN";
18865 case X86ISD::FOR: return "X86ISD::FOR";
18866 case X86ISD::FXOR: return "X86ISD::FXOR";
18867 case X86ISD::FSRL: return "X86ISD::FSRL";
18868 case X86ISD::FILD: return "X86ISD::FILD";
18869 case X86ISD::FILD_FLAG: return "X86ISD::FILD_FLAG";
18870 case X86ISD::FP_TO_INT16_IN_MEM: return "X86ISD::FP_TO_INT16_IN_MEM";
18871 case X86ISD::FP_TO_INT32_IN_MEM: return "X86ISD::FP_TO_INT32_IN_MEM";
18872 case X86ISD::FP_TO_INT64_IN_MEM: return "X86ISD::FP_TO_INT64_IN_MEM";
18873 case X86ISD::FLD: return "X86ISD::FLD";
18874 case X86ISD::FST: return "X86ISD::FST";
18875 case X86ISD::CALL: return "X86ISD::CALL";
18876 case X86ISD::RDTSC_DAG: return "X86ISD::RDTSC_DAG";
18877 case X86ISD::RDTSCP_DAG: return "X86ISD::RDTSCP_DAG";
18878 case X86ISD::RDPMC_DAG: return "X86ISD::RDPMC_DAG";
18879 case X86ISD::BT: return "X86ISD::BT";
18880 case X86ISD::CMP: return "X86ISD::CMP";
18881 case X86ISD::COMI: return "X86ISD::COMI";
18882 case X86ISD::UCOMI: return "X86ISD::UCOMI";
18883 case X86ISD::CMPM: return "X86ISD::CMPM";
18884 case X86ISD::CMPMU: return "X86ISD::CMPMU";
18885 case X86ISD::SETCC: return "X86ISD::SETCC";
18886 case X86ISD::SETCC_CARRY: return "X86ISD::SETCC_CARRY";
18887 case X86ISD::FSETCC: return "X86ISD::FSETCC";
18888 case X86ISD::CMOV: return "X86ISD::CMOV";
18889 case X86ISD::BRCOND: return "X86ISD::BRCOND";
18890 case X86ISD::RET_FLAG: return "X86ISD::RET_FLAG";
18891 case X86ISD::REP_STOS: return "X86ISD::REP_STOS";
18892 case X86ISD::REP_MOVS: return "X86ISD::REP_MOVS";
18893 case X86ISD::GlobalBaseReg: return "X86ISD::GlobalBaseReg";
18894 case X86ISD::Wrapper: return "X86ISD::Wrapper";
18895 case X86ISD::WrapperRIP: return "X86ISD::WrapperRIP";
18896 case X86ISD::PEXTRB: return "X86ISD::PEXTRB";
18897 case X86ISD::PEXTRW: return "X86ISD::PEXTRW";
18898 case X86ISD::INSERTPS: return "X86ISD::INSERTPS";
18899 case X86ISD::PINSRB: return "X86ISD::PINSRB";
18900 case X86ISD::PINSRW: return "X86ISD::PINSRW";
18901 case X86ISD::PSHUFB: return "X86ISD::PSHUFB";
18902 case X86ISD::ANDNP: return "X86ISD::ANDNP";
18903 case X86ISD::PSIGN: return "X86ISD::PSIGN";
18904 case X86ISD::BLENDI: return "X86ISD::BLENDI";
18905 case X86ISD::SUBUS: return "X86ISD::SUBUS";
18906 case X86ISD::HADD: return "X86ISD::HADD";
18907 case X86ISD::HSUB: return "X86ISD::HSUB";
18908 case X86ISD::FHADD: return "X86ISD::FHADD";
18909 case X86ISD::FHSUB: return "X86ISD::FHSUB";
18910 case X86ISD::UMAX: return "X86ISD::UMAX";
18911 case X86ISD::UMIN: return "X86ISD::UMIN";
18912 case X86ISD::SMAX: return "X86ISD::SMAX";
18913 case X86ISD::SMIN: return "X86ISD::SMIN";
18914 case X86ISD::FMAX: return "X86ISD::FMAX";
18915 case X86ISD::FMIN: return "X86ISD::FMIN";
18916 case X86ISD::FMAXC: return "X86ISD::FMAXC";
18917 case X86ISD::FMINC: return "X86ISD::FMINC";
18918 case X86ISD::FRSQRT: return "X86ISD::FRSQRT";
18919 case X86ISD::FRCP: return "X86ISD::FRCP";
18920 case X86ISD::TLSADDR: return "X86ISD::TLSADDR";
18921 case X86ISD::TLSBASEADDR: return "X86ISD::TLSBASEADDR";
18922 case X86ISD::TLSCALL: return "X86ISD::TLSCALL";
18923 case X86ISD::EH_SJLJ_SETJMP: return "X86ISD::EH_SJLJ_SETJMP";
18924 case X86ISD::EH_SJLJ_LONGJMP: return "X86ISD::EH_SJLJ_LONGJMP";
18925 case X86ISD::EH_RETURN: return "X86ISD::EH_RETURN";
18926 case X86ISD::TC_RETURN: return "X86ISD::TC_RETURN";
18927 case X86ISD::FNSTCW16m: return "X86ISD::FNSTCW16m";
18928 case X86ISD::FNSTSW16r: return "X86ISD::FNSTSW16r";
18929 case X86ISD::LCMPXCHG_DAG: return "X86ISD::LCMPXCHG_DAG";
18930 case X86ISD::LCMPXCHG8_DAG: return "X86ISD::LCMPXCHG8_DAG";
18931 case X86ISD::LCMPXCHG16_DAG: return "X86ISD::LCMPXCHG16_DAG";
18932 case X86ISD::VZEXT_MOVL: return "X86ISD::VZEXT_MOVL";
18933 case X86ISD::VZEXT_LOAD: return "X86ISD::VZEXT_LOAD";
18934 case X86ISD::VZEXT: return "X86ISD::VZEXT";
18935 case X86ISD::VSEXT: return "X86ISD::VSEXT";
18936 case X86ISD::VTRUNC: return "X86ISD::VTRUNC";
18937 case X86ISD::VTRUNCM: return "X86ISD::VTRUNCM";
18938 case X86ISD::VINSERT: return "X86ISD::VINSERT";
18939 case X86ISD::VFPEXT: return "X86ISD::VFPEXT";
18940 case X86ISD::VFPROUND: return "X86ISD::VFPROUND";
18941 case X86ISD::VSHLDQ: return "X86ISD::VSHLDQ";
18942 case X86ISD::VSRLDQ: return "X86ISD::VSRLDQ";
18943 case X86ISD::VSHL: return "X86ISD::VSHL";
18944 case X86ISD::VSRL: return "X86ISD::VSRL";
18945 case X86ISD::VSRA: return "X86ISD::VSRA";
18946 case X86ISD::VSHLI: return "X86ISD::VSHLI";
18947 case X86ISD::VSRLI: return "X86ISD::VSRLI";
18948 case X86ISD::VSRAI: return "X86ISD::VSRAI";
18949 case X86ISD::CMPP: return "X86ISD::CMPP";
18950 case X86ISD::PCMPEQ: return "X86ISD::PCMPEQ";
18951 case X86ISD::PCMPGT: return "X86ISD::PCMPGT";
18952 case X86ISD::PCMPEQM: return "X86ISD::PCMPEQM";
18953 case X86ISD::PCMPGTM: return "X86ISD::PCMPGTM";
18954 case X86ISD::ADD: return "X86ISD::ADD";
18955 case X86ISD::SUB: return "X86ISD::SUB";
18956 case X86ISD::ADC: return "X86ISD::ADC";
18957 case X86ISD::SBB: return "X86ISD::SBB";
18958 case X86ISD::SMUL: return "X86ISD::SMUL";
18959 case X86ISD::UMUL: return "X86ISD::UMUL";
18960 case X86ISD::INC: return "X86ISD::INC";
18961 case X86ISD::DEC: return "X86ISD::DEC";
18962 case X86ISD::OR: return "X86ISD::OR";
18963 case X86ISD::XOR: return "X86ISD::XOR";
18964 case X86ISD::AND: return "X86ISD::AND";
18965 case X86ISD::BEXTR: return "X86ISD::BEXTR";
18966 case X86ISD::MUL_IMM: return "X86ISD::MUL_IMM";
18967 case X86ISD::PTEST: return "X86ISD::PTEST";
18968 case X86ISD::TESTP: return "X86ISD::TESTP";
18969 case X86ISD::TESTM: return "X86ISD::TESTM";
18970 case X86ISD::TESTNM: return "X86ISD::TESTNM";
18971 case X86ISD::KORTEST: return "X86ISD::KORTEST";
18972 case X86ISD::PACKSS: return "X86ISD::PACKSS";
18973 case X86ISD::PACKUS: return "X86ISD::PACKUS";
18974 case X86ISD::PALIGNR: return "X86ISD::PALIGNR";
18975 case X86ISD::VALIGN: return "X86ISD::VALIGN";
18976 case X86ISD::PSHUFD: return "X86ISD::PSHUFD";
18977 case X86ISD::PSHUFHW: return "X86ISD::PSHUFHW";
18978 case X86ISD::PSHUFLW: return "X86ISD::PSHUFLW";
18979 case X86ISD::SHUFP: return "X86ISD::SHUFP";
18980 case X86ISD::MOVLHPS: return "X86ISD::MOVLHPS";
18981 case X86ISD::MOVLHPD: return "X86ISD::MOVLHPD";
18982 case X86ISD::MOVHLPS: return "X86ISD::MOVHLPS";
18983 case X86ISD::MOVLPS: return "X86ISD::MOVLPS";
18984 case X86ISD::MOVLPD: return "X86ISD::MOVLPD";
18985 case X86ISD::MOVDDUP: return "X86ISD::MOVDDUP";
18986 case X86ISD::MOVSHDUP: return "X86ISD::MOVSHDUP";
18987 case X86ISD::MOVSLDUP: return "X86ISD::MOVSLDUP";
18988 case X86ISD::MOVSD: return "X86ISD::MOVSD";
18989 case X86ISD::MOVSS: return "X86ISD::MOVSS";
18990 case X86ISD::UNPCKL: return "X86ISD::UNPCKL";
18991 case X86ISD::UNPCKH: return "X86ISD::UNPCKH";
18992 case X86ISD::VBROADCAST: return "X86ISD::VBROADCAST";
18993 case X86ISD::VBROADCASTM: return "X86ISD::VBROADCASTM";
18994 case X86ISD::VEXTRACT: return "X86ISD::VEXTRACT";
18995 case X86ISD::VPERMILPI: return "X86ISD::VPERMILPI";
18996 case X86ISD::VPERM2X128: return "X86ISD::VPERM2X128";
18997 case X86ISD::VPERMV: return "X86ISD::VPERMV";
18998 case X86ISD::VPERMV3: return "X86ISD::VPERMV3";
18999 case X86ISD::VPERMIV3: return "X86ISD::VPERMIV3";
19000 case X86ISD::VPERMI: return "X86ISD::VPERMI";
19001 case X86ISD::PMULUDQ: return "X86ISD::PMULUDQ";
19002 case X86ISD::PMULDQ: return "X86ISD::PMULDQ";
19003 case X86ISD::VASTART_SAVE_XMM_REGS: return "X86ISD::VASTART_SAVE_XMM_REGS";
19004 case X86ISD::VAARG_64: return "X86ISD::VAARG_64";
19005 case X86ISD::WIN_ALLOCA: return "X86ISD::WIN_ALLOCA";
19006 case X86ISD::MEMBARRIER: return "X86ISD::MEMBARRIER";
19007 case X86ISD::SEG_ALLOCA: return "X86ISD::SEG_ALLOCA";
19008 case X86ISD::WIN_FTOL: return "X86ISD::WIN_FTOL";
19009 case X86ISD::SAHF: return "X86ISD::SAHF";
19010 case X86ISD::RDRAND: return "X86ISD::RDRAND";
19011 case X86ISD::RDSEED: return "X86ISD::RDSEED";
19012 case X86ISD::FMADD: return "X86ISD::FMADD";
19013 case X86ISD::FMSUB: return "X86ISD::FMSUB";
19014 case X86ISD::FNMADD: return "X86ISD::FNMADD";
19015 case X86ISD::FNMSUB: return "X86ISD::FNMSUB";
19016 case X86ISD::FMADDSUB: return "X86ISD::FMADDSUB";
19017 case X86ISD::FMSUBADD: return "X86ISD::FMSUBADD";
19018 case X86ISD::PCMPESTRI: return "X86ISD::PCMPESTRI";
19019 case X86ISD::PCMPISTRI: return "X86ISD::PCMPISTRI";
19020 case X86ISD::XTEST: return "X86ISD::XTEST";
19024 // isLegalAddressingMode - Return true if the addressing mode represented
19025 // by AM is legal for this target, for a load/store of the specified type.
19026 bool X86TargetLowering::isLegalAddressingMode(const AddrMode &AM,
19028 // X86 supports extremely general addressing modes.
19029 CodeModel::Model M = getTargetMachine().getCodeModel();
19030 Reloc::Model R = getTargetMachine().getRelocationModel();
19032 // X86 allows a sign-extended 32-bit immediate field as a displacement.
19033 if (!X86::isOffsetSuitableForCodeModel(AM.BaseOffs, M, AM.BaseGV != nullptr))
19038 Subtarget->ClassifyGlobalReference(AM.BaseGV, getTargetMachine());
19040 // If a reference to this global requires an extra load, we can't fold it.
19041 if (isGlobalStubReference(GVFlags))
19044 // If BaseGV requires a register for the PIC base, we cannot also have a
19045 // BaseReg specified.
19046 if (AM.HasBaseReg && isGlobalRelativeToPICBase(GVFlags))
19049 // If lower 4G is not available, then we must use rip-relative addressing.
19050 if ((M != CodeModel::Small || R != Reloc::Static) &&
19051 Subtarget->is64Bit() && (AM.BaseOffs || AM.Scale > 1))
19055 switch (AM.Scale) {
19061 // These scales always work.
19066 // These scales are formed with basereg+scalereg. Only accept if there is
19071 default: // Other stuff never works.
19078 bool X86TargetLowering::isVectorShiftByScalarCheap(Type *Ty) const {
19079 unsigned Bits = Ty->getScalarSizeInBits();
19081 // 8-bit shifts are always expensive, but versions with a scalar amount aren't
19082 // particularly cheaper than those without.
19086 // On AVX2 there are new vpsllv[dq] instructions (and other shifts), that make
19087 // variable shifts just as cheap as scalar ones.
19088 if (Subtarget->hasInt256() && (Bits == 32 || Bits == 64))
19091 // Otherwise, it's significantly cheaper to shift by a scalar amount than by a
19092 // fully general vector.
19096 bool X86TargetLowering::isTruncateFree(Type *Ty1, Type *Ty2) const {
19097 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19099 unsigned NumBits1 = Ty1->getPrimitiveSizeInBits();
19100 unsigned NumBits2 = Ty2->getPrimitiveSizeInBits();
19101 return NumBits1 > NumBits2;
19104 bool X86TargetLowering::allowTruncateForTailCall(Type *Ty1, Type *Ty2) const {
19105 if (!Ty1->isIntegerTy() || !Ty2->isIntegerTy())
19108 if (!isTypeLegal(EVT::getEVT(Ty1)))
19111 assert(Ty1->getPrimitiveSizeInBits() <= 64 && "i128 is probably not a noop");
19113 // Assuming the caller doesn't have a zeroext or signext return parameter,
19114 // truncation all the way down to i1 is valid.
19118 bool X86TargetLowering::isLegalICmpImmediate(int64_t Imm) const {
19119 return isInt<32>(Imm);
19122 bool X86TargetLowering::isLegalAddImmediate(int64_t Imm) const {
19123 // Can also use sub to handle negated immediates.
19124 return isInt<32>(Imm);
19127 bool X86TargetLowering::isTruncateFree(EVT VT1, EVT VT2) const {
19128 if (!VT1.isInteger() || !VT2.isInteger())
19130 unsigned NumBits1 = VT1.getSizeInBits();
19131 unsigned NumBits2 = VT2.getSizeInBits();
19132 return NumBits1 > NumBits2;
19135 bool X86TargetLowering::isZExtFree(Type *Ty1, Type *Ty2) const {
19136 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19137 return Ty1->isIntegerTy(32) && Ty2->isIntegerTy(64) && Subtarget->is64Bit();
19140 bool X86TargetLowering::isZExtFree(EVT VT1, EVT VT2) const {
19141 // x86-64 implicitly zero-extends 32-bit results in 64-bit registers.
19142 return VT1 == MVT::i32 && VT2 == MVT::i64 && Subtarget->is64Bit();
19145 bool X86TargetLowering::isZExtFree(SDValue Val, EVT VT2) const {
19146 EVT VT1 = Val.getValueType();
19147 if (isZExtFree(VT1, VT2))
19150 if (Val.getOpcode() != ISD::LOAD)
19153 if (!VT1.isSimple() || !VT1.isInteger() ||
19154 !VT2.isSimple() || !VT2.isInteger())
19157 switch (VT1.getSimpleVT().SimpleTy) {
19162 // X86 has 8, 16, and 32-bit zero-extending loads.
19170 X86TargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
19171 if (!(Subtarget->hasFMA() || Subtarget->hasFMA4()))
19174 VT = VT.getScalarType();
19176 if (!VT.isSimple())
19179 switch (VT.getSimpleVT().SimpleTy) {
19190 bool X86TargetLowering::isNarrowingProfitable(EVT VT1, EVT VT2) const {
19191 // i16 instructions are longer (0x66 prefix) and potentially slower.
19192 return !(VT1 == MVT::i32 && VT2 == MVT::i16);
19195 /// isShuffleMaskLegal - Targets can use this to indicate that they only
19196 /// support *some* VECTOR_SHUFFLE operations, those with specific masks.
19197 /// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
19198 /// are assumed to be legal.
19200 X86TargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
19202 if (!VT.isSimple())
19205 MVT SVT = VT.getSimpleVT();
19207 // Very little shuffling can be done for 64-bit vectors right now.
19208 if (VT.getSizeInBits() == 64)
19211 // If this is a single-input shuffle with no 128 bit lane crossings we can
19212 // lower it into pshufb.
19213 if ((SVT.is128BitVector() && Subtarget->hasSSSE3()) ||
19214 (SVT.is256BitVector() && Subtarget->hasInt256())) {
19215 bool isLegal = true;
19216 for (unsigned I = 0, E = M.size(); I != E; ++I) {
19217 if (M[I] >= (int)SVT.getVectorNumElements() ||
19218 ShuffleCrosses128bitLane(SVT, I, M[I])) {
19227 // FIXME: blends, shifts.
19228 return (SVT.getVectorNumElements() == 2 ||
19229 ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
19230 isMOVLMask(M, SVT) ||
19231 isMOVHLPSMask(M, SVT) ||
19232 isSHUFPMask(M, SVT) ||
19233 isPSHUFDMask(M, SVT) ||
19234 isPSHUFHWMask(M, SVT, Subtarget->hasInt256()) ||
19235 isPSHUFLWMask(M, SVT, Subtarget->hasInt256()) ||
19236 isPALIGNRMask(M, SVT, Subtarget) ||
19237 isUNPCKLMask(M, SVT, Subtarget->hasInt256()) ||
19238 isUNPCKHMask(M, SVT, Subtarget->hasInt256()) ||
19239 isUNPCKL_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19240 isUNPCKH_v_undef_Mask(M, SVT, Subtarget->hasInt256()) ||
19241 isBlendMask(M, SVT, Subtarget->hasSSE41(), Subtarget->hasInt256()));
19245 X86TargetLowering::isVectorClearMaskLegal(const SmallVectorImpl<int> &Mask,
19247 if (!VT.isSimple())
19250 MVT SVT = VT.getSimpleVT();
19251 unsigned NumElts = SVT.getVectorNumElements();
19252 // FIXME: This collection of masks seems suspect.
19255 if (NumElts == 4 && SVT.is128BitVector()) {
19256 return (isMOVLMask(Mask, SVT) ||
19257 isCommutedMOVLMask(Mask, SVT, true) ||
19258 isSHUFPMask(Mask, SVT) ||
19259 isSHUFPMask(Mask, SVT, /* Commuted */ true));
19264 //===----------------------------------------------------------------------===//
19265 // X86 Scheduler Hooks
19266 //===----------------------------------------------------------------------===//
19268 /// Utility function to emit xbegin specifying the start of an RTM region.
19269 static MachineBasicBlock *EmitXBegin(MachineInstr *MI, MachineBasicBlock *MBB,
19270 const TargetInstrInfo *TII) {
19271 DebugLoc DL = MI->getDebugLoc();
19273 const BasicBlock *BB = MBB->getBasicBlock();
19274 MachineFunction::iterator I = MBB;
19277 // For the v = xbegin(), we generate
19288 MachineBasicBlock *thisMBB = MBB;
19289 MachineFunction *MF = MBB->getParent();
19290 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
19291 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
19292 MF->insert(I, mainMBB);
19293 MF->insert(I, sinkMBB);
19295 // Transfer the remainder of BB and its successor edges to sinkMBB.
19296 sinkMBB->splice(sinkMBB->begin(), MBB,
19297 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19298 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
19302 // # fallthrough to mainMBB
19303 // # abortion to sinkMBB
19304 BuildMI(thisMBB, DL, TII->get(X86::XBEGIN_4)).addMBB(sinkMBB);
19305 thisMBB->addSuccessor(mainMBB);
19306 thisMBB->addSuccessor(sinkMBB);
19310 BuildMI(mainMBB, DL, TII->get(X86::MOV32ri), X86::EAX).addImm(-1);
19311 mainMBB->addSuccessor(sinkMBB);
19314 // EAX is live into the sinkMBB
19315 sinkMBB->addLiveIn(X86::EAX);
19316 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19317 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19320 MI->eraseFromParent();
19324 // FIXME: When we get size specific XMM0 registers, i.e. XMM0_V16I8
19325 // or XMM0_V32I8 in AVX all of this code can be replaced with that
19326 // in the .td file.
19327 static MachineBasicBlock *EmitPCMPSTRM(MachineInstr *MI, MachineBasicBlock *BB,
19328 const TargetInstrInfo *TII) {
19330 switch (MI->getOpcode()) {
19331 default: llvm_unreachable("illegal opcode!");
19332 case X86::PCMPISTRM128REG: Opc = X86::PCMPISTRM128rr; break;
19333 case X86::VPCMPISTRM128REG: Opc = X86::VPCMPISTRM128rr; break;
19334 case X86::PCMPISTRM128MEM: Opc = X86::PCMPISTRM128rm; break;
19335 case X86::VPCMPISTRM128MEM: Opc = X86::VPCMPISTRM128rm; break;
19336 case X86::PCMPESTRM128REG: Opc = X86::PCMPESTRM128rr; break;
19337 case X86::VPCMPESTRM128REG: Opc = X86::VPCMPESTRM128rr; break;
19338 case X86::PCMPESTRM128MEM: Opc = X86::PCMPESTRM128rm; break;
19339 case X86::VPCMPESTRM128MEM: Opc = X86::VPCMPESTRM128rm; break;
19342 DebugLoc dl = MI->getDebugLoc();
19343 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19345 unsigned NumArgs = MI->getNumOperands();
19346 for (unsigned i = 1; i < NumArgs; ++i) {
19347 MachineOperand &Op = MI->getOperand(i);
19348 if (!(Op.isReg() && Op.isImplicit()))
19349 MIB.addOperand(Op);
19351 if (MI->hasOneMemOperand())
19352 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19354 BuildMI(*BB, MI, dl,
19355 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19356 .addReg(X86::XMM0);
19358 MI->eraseFromParent();
19362 // FIXME: Custom handling because TableGen doesn't support multiple implicit
19363 // defs in an instruction pattern
19364 static MachineBasicBlock *EmitPCMPSTRI(MachineInstr *MI, MachineBasicBlock *BB,
19365 const TargetInstrInfo *TII) {
19367 switch (MI->getOpcode()) {
19368 default: llvm_unreachable("illegal opcode!");
19369 case X86::PCMPISTRIREG: Opc = X86::PCMPISTRIrr; break;
19370 case X86::VPCMPISTRIREG: Opc = X86::VPCMPISTRIrr; break;
19371 case X86::PCMPISTRIMEM: Opc = X86::PCMPISTRIrm; break;
19372 case X86::VPCMPISTRIMEM: Opc = X86::VPCMPISTRIrm; break;
19373 case X86::PCMPESTRIREG: Opc = X86::PCMPESTRIrr; break;
19374 case X86::VPCMPESTRIREG: Opc = X86::VPCMPESTRIrr; break;
19375 case X86::PCMPESTRIMEM: Opc = X86::PCMPESTRIrm; break;
19376 case X86::VPCMPESTRIMEM: Opc = X86::VPCMPESTRIrm; break;
19379 DebugLoc dl = MI->getDebugLoc();
19380 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(Opc));
19382 unsigned NumArgs = MI->getNumOperands(); // remove the results
19383 for (unsigned i = 1; i < NumArgs; ++i) {
19384 MachineOperand &Op = MI->getOperand(i);
19385 if (!(Op.isReg() && Op.isImplicit()))
19386 MIB.addOperand(Op);
19388 if (MI->hasOneMemOperand())
19389 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end());
19391 BuildMI(*BB, MI, dl,
19392 TII->get(TargetOpcode::COPY), MI->getOperand(0).getReg())
19395 MI->eraseFromParent();
19399 static MachineBasicBlock * EmitMonitor(MachineInstr *MI, MachineBasicBlock *BB,
19400 const TargetInstrInfo *TII,
19401 const X86Subtarget* Subtarget) {
19402 DebugLoc dl = MI->getDebugLoc();
19404 // Address into RAX/EAX, other two args into ECX, EDX.
19405 unsigned MemOpc = Subtarget->is64Bit() ? X86::LEA64r : X86::LEA32r;
19406 unsigned MemReg = Subtarget->is64Bit() ? X86::RAX : X86::EAX;
19407 MachineInstrBuilder MIB = BuildMI(*BB, MI, dl, TII->get(MemOpc), MemReg);
19408 for (int i = 0; i < X86::AddrNumOperands; ++i)
19409 MIB.addOperand(MI->getOperand(i));
19411 unsigned ValOps = X86::AddrNumOperands;
19412 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::ECX)
19413 .addReg(MI->getOperand(ValOps).getReg());
19414 BuildMI(*BB, MI, dl, TII->get(TargetOpcode::COPY), X86::EDX)
19415 .addReg(MI->getOperand(ValOps+1).getReg());
19417 // The instruction doesn't actually take any operands though.
19418 BuildMI(*BB, MI, dl, TII->get(X86::MONITORrrr));
19420 MI->eraseFromParent(); // The pseudo is gone now.
19424 MachineBasicBlock *
19425 X86TargetLowering::EmitVAARG64WithCustomInserter(
19427 MachineBasicBlock *MBB) const {
19428 // Emit va_arg instruction on X86-64.
19430 // Operands to this pseudo-instruction:
19431 // 0 ) Output : destination address (reg)
19432 // 1-5) Input : va_list address (addr, i64mem)
19433 // 6 ) ArgSize : Size (in bytes) of vararg type
19434 // 7 ) ArgMode : 0=overflow only, 1=use gp_offset, 2=use fp_offset
19435 // 8 ) Align : Alignment of type
19436 // 9 ) EFLAGS (implicit-def)
19438 assert(MI->getNumOperands() == 10 && "VAARG_64 should have 10 operands!");
19439 assert(X86::AddrNumOperands == 5 && "VAARG_64 assumes 5 address operands");
19441 unsigned DestReg = MI->getOperand(0).getReg();
19442 MachineOperand &Base = MI->getOperand(1);
19443 MachineOperand &Scale = MI->getOperand(2);
19444 MachineOperand &Index = MI->getOperand(3);
19445 MachineOperand &Disp = MI->getOperand(4);
19446 MachineOperand &Segment = MI->getOperand(5);
19447 unsigned ArgSize = MI->getOperand(6).getImm();
19448 unsigned ArgMode = MI->getOperand(7).getImm();
19449 unsigned Align = MI->getOperand(8).getImm();
19451 // Memory Reference
19452 assert(MI->hasOneMemOperand() && "Expected VAARG_64 to have one memoperand");
19453 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
19454 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
19456 // Machine Information
19457 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19458 MachineRegisterInfo &MRI = MBB->getParent()->getRegInfo();
19459 const TargetRegisterClass *AddrRegClass = getRegClassFor(MVT::i64);
19460 const TargetRegisterClass *OffsetRegClass = getRegClassFor(MVT::i32);
19461 DebugLoc DL = MI->getDebugLoc();
19463 // struct va_list {
19466 // i64 overflow_area (address)
19467 // i64 reg_save_area (address)
19469 // sizeof(va_list) = 24
19470 // alignment(va_list) = 8
19472 unsigned TotalNumIntRegs = 6;
19473 unsigned TotalNumXMMRegs = 8;
19474 bool UseGPOffset = (ArgMode == 1);
19475 bool UseFPOffset = (ArgMode == 2);
19476 unsigned MaxOffset = TotalNumIntRegs * 8 +
19477 (UseFPOffset ? TotalNumXMMRegs * 16 : 0);
19479 /* Align ArgSize to a multiple of 8 */
19480 unsigned ArgSizeA8 = (ArgSize + 7) & ~7;
19481 bool NeedsAlign = (Align > 8);
19483 MachineBasicBlock *thisMBB = MBB;
19484 MachineBasicBlock *overflowMBB;
19485 MachineBasicBlock *offsetMBB;
19486 MachineBasicBlock *endMBB;
19488 unsigned OffsetDestReg = 0; // Argument address computed by offsetMBB
19489 unsigned OverflowDestReg = 0; // Argument address computed by overflowMBB
19490 unsigned OffsetReg = 0;
19492 if (!UseGPOffset && !UseFPOffset) {
19493 // If we only pull from the overflow region, we don't create a branch.
19494 // We don't need to alter control flow.
19495 OffsetDestReg = 0; // unused
19496 OverflowDestReg = DestReg;
19498 offsetMBB = nullptr;
19499 overflowMBB = thisMBB;
19502 // First emit code to check if gp_offset (or fp_offset) is below the bound.
19503 // If so, pull the argument from reg_save_area. (branch to offsetMBB)
19504 // If not, pull from overflow_area. (branch to overflowMBB)
19509 // offsetMBB overflowMBB
19514 // Registers for the PHI in endMBB
19515 OffsetDestReg = MRI.createVirtualRegister(AddrRegClass);
19516 OverflowDestReg = MRI.createVirtualRegister(AddrRegClass);
19518 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19519 MachineFunction *MF = MBB->getParent();
19520 overflowMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19521 offsetMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19522 endMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19524 MachineFunction::iterator MBBIter = MBB;
19527 // Insert the new basic blocks
19528 MF->insert(MBBIter, offsetMBB);
19529 MF->insert(MBBIter, overflowMBB);
19530 MF->insert(MBBIter, endMBB);
19532 // Transfer the remainder of MBB and its successor edges to endMBB.
19533 endMBB->splice(endMBB->begin(), thisMBB,
19534 std::next(MachineBasicBlock::iterator(MI)), thisMBB->end());
19535 endMBB->transferSuccessorsAndUpdatePHIs(thisMBB);
19537 // Make offsetMBB and overflowMBB successors of thisMBB
19538 thisMBB->addSuccessor(offsetMBB);
19539 thisMBB->addSuccessor(overflowMBB);
19541 // endMBB is a successor of both offsetMBB and overflowMBB
19542 offsetMBB->addSuccessor(endMBB);
19543 overflowMBB->addSuccessor(endMBB);
19545 // Load the offset value into a register
19546 OffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19547 BuildMI(thisMBB, DL, TII->get(X86::MOV32rm), OffsetReg)
19551 .addDisp(Disp, UseFPOffset ? 4 : 0)
19552 .addOperand(Segment)
19553 .setMemRefs(MMOBegin, MMOEnd);
19555 // Check if there is enough room left to pull this argument.
19556 BuildMI(thisMBB, DL, TII->get(X86::CMP32ri))
19558 .addImm(MaxOffset + 8 - ArgSizeA8);
19560 // Branch to "overflowMBB" if offset >= max
19561 // Fall through to "offsetMBB" otherwise
19562 BuildMI(thisMBB, DL, TII->get(X86::GetCondBranchFromCond(X86::COND_AE)))
19563 .addMBB(overflowMBB);
19566 // In offsetMBB, emit code to use the reg_save_area.
19568 assert(OffsetReg != 0);
19570 // Read the reg_save_area address.
19571 unsigned RegSaveReg = MRI.createVirtualRegister(AddrRegClass);
19572 BuildMI(offsetMBB, DL, TII->get(X86::MOV64rm), RegSaveReg)
19577 .addOperand(Segment)
19578 .setMemRefs(MMOBegin, MMOEnd);
19580 // Zero-extend the offset
19581 unsigned OffsetReg64 = MRI.createVirtualRegister(AddrRegClass);
19582 BuildMI(offsetMBB, DL, TII->get(X86::SUBREG_TO_REG), OffsetReg64)
19585 .addImm(X86::sub_32bit);
19587 // Add the offset to the reg_save_area to get the final address.
19588 BuildMI(offsetMBB, DL, TII->get(X86::ADD64rr), OffsetDestReg)
19589 .addReg(OffsetReg64)
19590 .addReg(RegSaveReg);
19592 // Compute the offset for the next argument
19593 unsigned NextOffsetReg = MRI.createVirtualRegister(OffsetRegClass);
19594 BuildMI(offsetMBB, DL, TII->get(X86::ADD32ri), NextOffsetReg)
19596 .addImm(UseFPOffset ? 16 : 8);
19598 // Store it back into the va_list.
19599 BuildMI(offsetMBB, DL, TII->get(X86::MOV32mr))
19603 .addDisp(Disp, UseFPOffset ? 4 : 0)
19604 .addOperand(Segment)
19605 .addReg(NextOffsetReg)
19606 .setMemRefs(MMOBegin, MMOEnd);
19609 BuildMI(offsetMBB, DL, TII->get(X86::JMP_4))
19614 // Emit code to use overflow area
19617 // Load the overflow_area address into a register.
19618 unsigned OverflowAddrReg = MRI.createVirtualRegister(AddrRegClass);
19619 BuildMI(overflowMBB, DL, TII->get(X86::MOV64rm), OverflowAddrReg)
19624 .addOperand(Segment)
19625 .setMemRefs(MMOBegin, MMOEnd);
19627 // If we need to align it, do so. Otherwise, just copy the address
19628 // to OverflowDestReg.
19630 // Align the overflow address
19631 assert((Align & (Align-1)) == 0 && "Alignment must be a power of 2");
19632 unsigned TmpReg = MRI.createVirtualRegister(AddrRegClass);
19634 // aligned_addr = (addr + (align-1)) & ~(align-1)
19635 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), TmpReg)
19636 .addReg(OverflowAddrReg)
19639 BuildMI(overflowMBB, DL, TII->get(X86::AND64ri32), OverflowDestReg)
19641 .addImm(~(uint64_t)(Align-1));
19643 BuildMI(overflowMBB, DL, TII->get(TargetOpcode::COPY), OverflowDestReg)
19644 .addReg(OverflowAddrReg);
19647 // Compute the next overflow address after this argument.
19648 // (the overflow address should be kept 8-byte aligned)
19649 unsigned NextAddrReg = MRI.createVirtualRegister(AddrRegClass);
19650 BuildMI(overflowMBB, DL, TII->get(X86::ADD64ri32), NextAddrReg)
19651 .addReg(OverflowDestReg)
19652 .addImm(ArgSizeA8);
19654 // Store the new overflow address.
19655 BuildMI(overflowMBB, DL, TII->get(X86::MOV64mr))
19660 .addOperand(Segment)
19661 .addReg(NextAddrReg)
19662 .setMemRefs(MMOBegin, MMOEnd);
19664 // If we branched, emit the PHI to the front of endMBB.
19666 BuildMI(*endMBB, endMBB->begin(), DL,
19667 TII->get(X86::PHI), DestReg)
19668 .addReg(OffsetDestReg).addMBB(offsetMBB)
19669 .addReg(OverflowDestReg).addMBB(overflowMBB);
19672 // Erase the pseudo instruction
19673 MI->eraseFromParent();
19678 MachineBasicBlock *
19679 X86TargetLowering::EmitVAStartSaveXMMRegsWithCustomInserter(
19681 MachineBasicBlock *MBB) const {
19682 // Emit code to save XMM registers to the stack. The ABI says that the
19683 // number of registers to save is given in %al, so it's theoretically
19684 // possible to do an indirect jump trick to avoid saving all of them,
19685 // however this code takes a simpler approach and just executes all
19686 // of the stores if %al is non-zero. It's less code, and it's probably
19687 // easier on the hardware branch predictor, and stores aren't all that
19688 // expensive anyway.
19690 // Create the new basic blocks. One block contains all the XMM stores,
19691 // and one block is the final destination regardless of whether any
19692 // stores were performed.
19693 const BasicBlock *LLVM_BB = MBB->getBasicBlock();
19694 MachineFunction *F = MBB->getParent();
19695 MachineFunction::iterator MBBIter = MBB;
19697 MachineBasicBlock *XMMSaveMBB = F->CreateMachineBasicBlock(LLVM_BB);
19698 MachineBasicBlock *EndMBB = F->CreateMachineBasicBlock(LLVM_BB);
19699 F->insert(MBBIter, XMMSaveMBB);
19700 F->insert(MBBIter, EndMBB);
19702 // Transfer the remainder of MBB and its successor edges to EndMBB.
19703 EndMBB->splice(EndMBB->begin(), MBB,
19704 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
19705 EndMBB->transferSuccessorsAndUpdatePHIs(MBB);
19707 // The original block will now fall through to the XMM save block.
19708 MBB->addSuccessor(XMMSaveMBB);
19709 // The XMMSaveMBB will fall through to the end block.
19710 XMMSaveMBB->addSuccessor(EndMBB);
19712 // Now add the instructions.
19713 const TargetInstrInfo *TII = MBB->getParent()->getSubtarget().getInstrInfo();
19714 DebugLoc DL = MI->getDebugLoc();
19716 unsigned CountReg = MI->getOperand(0).getReg();
19717 int64_t RegSaveFrameIndex = MI->getOperand(1).getImm();
19718 int64_t VarArgsFPOffset = MI->getOperand(2).getImm();
19720 if (!Subtarget->isTargetWin64()) {
19721 // If %al is 0, branch around the XMM save block.
19722 BuildMI(MBB, DL, TII->get(X86::TEST8rr)).addReg(CountReg).addReg(CountReg);
19723 BuildMI(MBB, DL, TII->get(X86::JE_4)).addMBB(EndMBB);
19724 MBB->addSuccessor(EndMBB);
19727 // Make sure the last operand is EFLAGS, which gets clobbered by the branch
19728 // that was just emitted, but clearly shouldn't be "saved".
19729 assert((MI->getNumOperands() <= 3 ||
19730 !MI->getOperand(MI->getNumOperands() - 1).isReg() ||
19731 MI->getOperand(MI->getNumOperands() - 1).getReg() == X86::EFLAGS)
19732 && "Expected last argument to be EFLAGS");
19733 unsigned MOVOpc = Subtarget->hasFp256() ? X86::VMOVAPSmr : X86::MOVAPSmr;
19734 // In the XMM save block, save all the XMM argument registers.
19735 for (int i = 3, e = MI->getNumOperands() - 1; i != e; ++i) {
19736 int64_t Offset = (i - 3) * 16 + VarArgsFPOffset;
19737 MachineMemOperand *MMO =
19738 F->getMachineMemOperand(
19739 MachinePointerInfo::getFixedStack(RegSaveFrameIndex, Offset),
19740 MachineMemOperand::MOStore,
19741 /*Size=*/16, /*Align=*/16);
19742 BuildMI(XMMSaveMBB, DL, TII->get(MOVOpc))
19743 .addFrameIndex(RegSaveFrameIndex)
19744 .addImm(/*Scale=*/1)
19745 .addReg(/*IndexReg=*/0)
19746 .addImm(/*Disp=*/Offset)
19747 .addReg(/*Segment=*/0)
19748 .addReg(MI->getOperand(i).getReg())
19749 .addMemOperand(MMO);
19752 MI->eraseFromParent(); // The pseudo instruction is gone now.
19757 // The EFLAGS operand of SelectItr might be missing a kill marker
19758 // because there were multiple uses of EFLAGS, and ISel didn't know
19759 // which to mark. Figure out whether SelectItr should have had a
19760 // kill marker, and set it if it should. Returns the correct kill
19762 static bool checkAndUpdateEFLAGSKill(MachineBasicBlock::iterator SelectItr,
19763 MachineBasicBlock* BB,
19764 const TargetRegisterInfo* TRI) {
19765 // Scan forward through BB for a use/def of EFLAGS.
19766 MachineBasicBlock::iterator miI(std::next(SelectItr));
19767 for (MachineBasicBlock::iterator miE = BB->end(); miI != miE; ++miI) {
19768 const MachineInstr& mi = *miI;
19769 if (mi.readsRegister(X86::EFLAGS))
19771 if (mi.definesRegister(X86::EFLAGS))
19772 break; // Should have kill-flag - update below.
19775 // If we hit the end of the block, check whether EFLAGS is live into a
19777 if (miI == BB->end()) {
19778 for (MachineBasicBlock::succ_iterator sItr = BB->succ_begin(),
19779 sEnd = BB->succ_end();
19780 sItr != sEnd; ++sItr) {
19781 MachineBasicBlock* succ = *sItr;
19782 if (succ->isLiveIn(X86::EFLAGS))
19787 // We found a def, or hit the end of the basic block and EFLAGS wasn't live
19788 // out. SelectMI should have a kill flag on EFLAGS.
19789 SelectItr->addRegisterKilled(X86::EFLAGS, TRI);
19793 MachineBasicBlock *
19794 X86TargetLowering::EmitLoweredSelect(MachineInstr *MI,
19795 MachineBasicBlock *BB) const {
19796 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19797 DebugLoc DL = MI->getDebugLoc();
19799 // To "insert" a SELECT_CC instruction, we actually have to insert the
19800 // diamond control-flow pattern. The incoming instruction knows the
19801 // destination vreg to set, the condition code register to branch on, the
19802 // true/false values to select between, and a branch opcode to use.
19803 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19804 MachineFunction::iterator It = BB;
19810 // cmpTY ccX, r1, r2
19812 // fallthrough --> copy0MBB
19813 MachineBasicBlock *thisMBB = BB;
19814 MachineFunction *F = BB->getParent();
19815 MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
19816 MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
19817 F->insert(It, copy0MBB);
19818 F->insert(It, sinkMBB);
19820 // If the EFLAGS register isn't dead in the terminator, then claim that it's
19821 // live into the sink and copy blocks.
19822 const TargetRegisterInfo *TRI =
19823 BB->getParent()->getSubtarget().getRegisterInfo();
19824 if (!MI->killsRegister(X86::EFLAGS) &&
19825 !checkAndUpdateEFLAGSKill(MI, BB, TRI)) {
19826 copy0MBB->addLiveIn(X86::EFLAGS);
19827 sinkMBB->addLiveIn(X86::EFLAGS);
19830 // Transfer the remainder of BB and its successor edges to sinkMBB.
19831 sinkMBB->splice(sinkMBB->begin(), BB,
19832 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19833 sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
19835 // Add the true and fallthrough blocks as its successors.
19836 BB->addSuccessor(copy0MBB);
19837 BB->addSuccessor(sinkMBB);
19839 // Create the conditional branch instruction.
19841 X86::GetCondBranchFromCond((X86::CondCode)MI->getOperand(3).getImm());
19842 BuildMI(BB, DL, TII->get(Opc)).addMBB(sinkMBB);
19845 // %FalseValue = ...
19846 // # fallthrough to sinkMBB
19847 copy0MBB->addSuccessor(sinkMBB);
19850 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
19852 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
19853 TII->get(X86::PHI), MI->getOperand(0).getReg())
19854 .addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
19855 .addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
19857 MI->eraseFromParent(); // The pseudo instruction is gone now.
19861 MachineBasicBlock *
19862 X86TargetLowering::EmitLoweredSegAlloca(MachineInstr *MI,
19863 MachineBasicBlock *BB) const {
19864 MachineFunction *MF = BB->getParent();
19865 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
19866 DebugLoc DL = MI->getDebugLoc();
19867 const BasicBlock *LLVM_BB = BB->getBasicBlock();
19869 assert(MF->shouldSplitStack());
19871 const bool Is64Bit = Subtarget->is64Bit();
19872 const bool IsLP64 = Subtarget->isTarget64BitLP64();
19874 const unsigned TlsReg = Is64Bit ? X86::FS : X86::GS;
19875 const unsigned TlsOffset = IsLP64 ? 0x70 : Is64Bit ? 0x40 : 0x30;
19878 // ... [Till the alloca]
19879 // If stacklet is not large enough, jump to mallocMBB
19882 // Allocate by subtracting from RSP
19883 // Jump to continueMBB
19886 // Allocate by call to runtime
19890 // [rest of original BB]
19893 MachineBasicBlock *mallocMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19894 MachineBasicBlock *bumpMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19895 MachineBasicBlock *continueMBB = MF->CreateMachineBasicBlock(LLVM_BB);
19897 MachineRegisterInfo &MRI = MF->getRegInfo();
19898 const TargetRegisterClass *AddrRegClass =
19899 getRegClassFor(getPointerTy());
19901 unsigned mallocPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19902 bumpSPPtrVReg = MRI.createVirtualRegister(AddrRegClass),
19903 tmpSPVReg = MRI.createVirtualRegister(AddrRegClass),
19904 SPLimitVReg = MRI.createVirtualRegister(AddrRegClass),
19905 sizeVReg = MI->getOperand(1).getReg(),
19906 physSPReg = IsLP64 || Subtarget->isTargetNaCl64() ? X86::RSP : X86::ESP;
19908 MachineFunction::iterator MBBIter = BB;
19911 MF->insert(MBBIter, bumpMBB);
19912 MF->insert(MBBIter, mallocMBB);
19913 MF->insert(MBBIter, continueMBB);
19915 continueMBB->splice(continueMBB->begin(), BB,
19916 std::next(MachineBasicBlock::iterator(MI)), BB->end());
19917 continueMBB->transferSuccessorsAndUpdatePHIs(BB);
19919 // Add code to the main basic block to check if the stack limit has been hit,
19920 // and if so, jump to mallocMBB otherwise to bumpMBB.
19921 BuildMI(BB, DL, TII->get(TargetOpcode::COPY), tmpSPVReg).addReg(physSPReg);
19922 BuildMI(BB, DL, TII->get(IsLP64 ? X86::SUB64rr:X86::SUB32rr), SPLimitVReg)
19923 .addReg(tmpSPVReg).addReg(sizeVReg);
19924 BuildMI(BB, DL, TII->get(IsLP64 ? X86::CMP64mr:X86::CMP32mr))
19925 .addReg(0).addImm(1).addReg(0).addImm(TlsOffset).addReg(TlsReg)
19926 .addReg(SPLimitVReg);
19927 BuildMI(BB, DL, TII->get(X86::JG_4)).addMBB(mallocMBB);
19929 // bumpMBB simply decreases the stack pointer, since we know the current
19930 // stacklet has enough space.
19931 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), physSPReg)
19932 .addReg(SPLimitVReg);
19933 BuildMI(bumpMBB, DL, TII->get(TargetOpcode::COPY), bumpSPPtrVReg)
19934 .addReg(SPLimitVReg);
19935 BuildMI(bumpMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19937 // Calls into a routine in libgcc to allocate more space from the heap.
19938 const uint32_t *RegMask = MF->getTarget()
19939 .getSubtargetImpl()
19940 ->getRegisterInfo()
19941 ->getCallPreservedMask(CallingConv::C);
19943 BuildMI(mallocMBB, DL, TII->get(X86::MOV64rr), X86::RDI)
19945 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19946 .addExternalSymbol("__morestack_allocate_stack_space")
19947 .addRegMask(RegMask)
19948 .addReg(X86::RDI, RegState::Implicit)
19949 .addReg(X86::RAX, RegState::ImplicitDefine);
19950 } else if (Is64Bit) {
19951 BuildMI(mallocMBB, DL, TII->get(X86::MOV32rr), X86::EDI)
19953 BuildMI(mallocMBB, DL, TII->get(X86::CALL64pcrel32))
19954 .addExternalSymbol("__morestack_allocate_stack_space")
19955 .addRegMask(RegMask)
19956 .addReg(X86::EDI, RegState::Implicit)
19957 .addReg(X86::EAX, RegState::ImplicitDefine);
19959 BuildMI(mallocMBB, DL, TII->get(X86::SUB32ri), physSPReg).addReg(physSPReg)
19961 BuildMI(mallocMBB, DL, TII->get(X86::PUSH32r)).addReg(sizeVReg);
19962 BuildMI(mallocMBB, DL, TII->get(X86::CALLpcrel32))
19963 .addExternalSymbol("__morestack_allocate_stack_space")
19964 .addRegMask(RegMask)
19965 .addReg(X86::EAX, RegState::ImplicitDefine);
19969 BuildMI(mallocMBB, DL, TII->get(X86::ADD32ri), physSPReg).addReg(physSPReg)
19972 BuildMI(mallocMBB, DL, TII->get(TargetOpcode::COPY), mallocPtrVReg)
19973 .addReg(IsLP64 ? X86::RAX : X86::EAX);
19974 BuildMI(mallocMBB, DL, TII->get(X86::JMP_4)).addMBB(continueMBB);
19976 // Set up the CFG correctly.
19977 BB->addSuccessor(bumpMBB);
19978 BB->addSuccessor(mallocMBB);
19979 mallocMBB->addSuccessor(continueMBB);
19980 bumpMBB->addSuccessor(continueMBB);
19982 // Take care of the PHI nodes.
19983 BuildMI(*continueMBB, continueMBB->begin(), DL, TII->get(X86::PHI),
19984 MI->getOperand(0).getReg())
19985 .addReg(mallocPtrVReg).addMBB(mallocMBB)
19986 .addReg(bumpSPPtrVReg).addMBB(bumpMBB);
19988 // Delete the original pseudo instruction.
19989 MI->eraseFromParent();
19992 return continueMBB;
19995 MachineBasicBlock *
19996 X86TargetLowering::EmitLoweredWinAlloca(MachineInstr *MI,
19997 MachineBasicBlock *BB) const {
19998 const TargetInstrInfo *TII = BB->getParent()->getSubtarget().getInstrInfo();
19999 DebugLoc DL = MI->getDebugLoc();
20001 assert(!Subtarget->isTargetMacho());
20003 // The lowering is pretty easy: we're just emitting the call to _alloca. The
20004 // non-trivial part is impdef of ESP.
20006 if (Subtarget->isTargetWin64()) {
20007 if (Subtarget->isTargetCygMing()) {
20008 // ___chkstk(Mingw64):
20009 // Clobbers R10, R11, RAX and EFLAGS.
20011 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
20012 .addExternalSymbol("___chkstk")
20013 .addReg(X86::RAX, RegState::Implicit)
20014 .addReg(X86::RSP, RegState::Implicit)
20015 .addReg(X86::RAX, RegState::Define | RegState::Implicit)
20016 .addReg(X86::RSP, RegState::Define | RegState::Implicit)
20017 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20019 // __chkstk(MSVCRT): does not update stack pointer.
20020 // Clobbers R10, R11 and EFLAGS.
20021 BuildMI(*BB, MI, DL, TII->get(X86::W64ALLOCA))
20022 .addExternalSymbol("__chkstk")
20023 .addReg(X86::RAX, RegState::Implicit)
20024 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20025 // RAX has the offset to be subtracted from RSP.
20026 BuildMI(*BB, MI, DL, TII->get(X86::SUB64rr), X86::RSP)
20031 const char *StackProbeSymbol =
20032 Subtarget->isTargetKnownWindowsMSVC() ? "_chkstk" : "_alloca";
20034 BuildMI(*BB, MI, DL, TII->get(X86::CALLpcrel32))
20035 .addExternalSymbol(StackProbeSymbol)
20036 .addReg(X86::EAX, RegState::Implicit)
20037 .addReg(X86::ESP, RegState::Implicit)
20038 .addReg(X86::EAX, RegState::Define | RegState::Implicit)
20039 .addReg(X86::ESP, RegState::Define | RegState::Implicit)
20040 .addReg(X86::EFLAGS, RegState::Define | RegState::Implicit);
20043 MI->eraseFromParent(); // The pseudo instruction is gone now.
20047 MachineBasicBlock *
20048 X86TargetLowering::EmitLoweredTLSCall(MachineInstr *MI,
20049 MachineBasicBlock *BB) const {
20050 // This is pretty easy. We're taking the value that we received from
20051 // our load from the relocation, sticking it in either RDI (x86-64)
20052 // or EAX and doing an indirect call. The return value will then
20053 // be in the normal return register.
20054 MachineFunction *F = BB->getParent();
20055 const X86InstrInfo *TII =
20056 static_cast<const X86InstrInfo *>(F->getSubtarget().getInstrInfo());
20057 DebugLoc DL = MI->getDebugLoc();
20059 assert(Subtarget->isTargetDarwin() && "Darwin only instr emitted?");
20060 assert(MI->getOperand(3).isGlobal() && "This should be a global");
20062 // Get a register mask for the lowered call.
20063 // FIXME: The 32-bit calls have non-standard calling conventions. Use a
20064 // proper register mask.
20065 const uint32_t *RegMask = F->getTarget()
20066 .getSubtargetImpl()
20067 ->getRegisterInfo()
20068 ->getCallPreservedMask(CallingConv::C);
20069 if (Subtarget->is64Bit()) {
20070 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20071 TII->get(X86::MOV64rm), X86::RDI)
20073 .addImm(0).addReg(0)
20074 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20075 MI->getOperand(3).getTargetFlags())
20077 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL64m));
20078 addDirectMem(MIB, X86::RDI);
20079 MIB.addReg(X86::RAX, RegState::ImplicitDefine).addRegMask(RegMask);
20080 } else if (F->getTarget().getRelocationModel() != Reloc::PIC_) {
20081 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20082 TII->get(X86::MOV32rm), X86::EAX)
20084 .addImm(0).addReg(0)
20085 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20086 MI->getOperand(3).getTargetFlags())
20088 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20089 addDirectMem(MIB, X86::EAX);
20090 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20092 MachineInstrBuilder MIB = BuildMI(*BB, MI, DL,
20093 TII->get(X86::MOV32rm), X86::EAX)
20094 .addReg(TII->getGlobalBaseReg(F))
20095 .addImm(0).addReg(0)
20096 .addGlobalAddress(MI->getOperand(3).getGlobal(), 0,
20097 MI->getOperand(3).getTargetFlags())
20099 MIB = BuildMI(*BB, MI, DL, TII->get(X86::CALL32m));
20100 addDirectMem(MIB, X86::EAX);
20101 MIB.addReg(X86::EAX, RegState::ImplicitDefine).addRegMask(RegMask);
20104 MI->eraseFromParent(); // The pseudo instruction is gone now.
20108 MachineBasicBlock *
20109 X86TargetLowering::emitEHSjLjSetJmp(MachineInstr *MI,
20110 MachineBasicBlock *MBB) const {
20111 DebugLoc DL = MI->getDebugLoc();
20112 MachineFunction *MF = MBB->getParent();
20113 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20114 MachineRegisterInfo &MRI = MF->getRegInfo();
20116 const BasicBlock *BB = MBB->getBasicBlock();
20117 MachineFunction::iterator I = MBB;
20120 // Memory Reference
20121 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20122 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20125 unsigned MemOpndSlot = 0;
20127 unsigned CurOp = 0;
20129 DstReg = MI->getOperand(CurOp++).getReg();
20130 const TargetRegisterClass *RC = MRI.getRegClass(DstReg);
20131 assert(RC->hasType(MVT::i32) && "Invalid destination!");
20132 unsigned mainDstReg = MRI.createVirtualRegister(RC);
20133 unsigned restoreDstReg = MRI.createVirtualRegister(RC);
20135 MemOpndSlot = CurOp;
20137 MVT PVT = getPointerTy();
20138 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20139 "Invalid Pointer Size!");
20141 // For v = setjmp(buf), we generate
20144 // buf[LabelOffset] = restoreMBB
20145 // SjLjSetup restoreMBB
20151 // v = phi(main, restore)
20156 MachineBasicBlock *thisMBB = MBB;
20157 MachineBasicBlock *mainMBB = MF->CreateMachineBasicBlock(BB);
20158 MachineBasicBlock *sinkMBB = MF->CreateMachineBasicBlock(BB);
20159 MachineBasicBlock *restoreMBB = MF->CreateMachineBasicBlock(BB);
20160 MF->insert(I, mainMBB);
20161 MF->insert(I, sinkMBB);
20162 MF->push_back(restoreMBB);
20164 MachineInstrBuilder MIB;
20166 // Transfer the remainder of BB and its successor edges to sinkMBB.
20167 sinkMBB->splice(sinkMBB->begin(), MBB,
20168 std::next(MachineBasicBlock::iterator(MI)), MBB->end());
20169 sinkMBB->transferSuccessorsAndUpdatePHIs(MBB);
20172 unsigned PtrStoreOpc = 0;
20173 unsigned LabelReg = 0;
20174 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20175 Reloc::Model RM = MF->getTarget().getRelocationModel();
20176 bool UseImmLabel = (MF->getTarget().getCodeModel() == CodeModel::Small) &&
20177 (RM == Reloc::Static || RM == Reloc::DynamicNoPIC);
20179 // Prepare IP either in reg or imm.
20180 if (!UseImmLabel) {
20181 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mr : X86::MOV32mr;
20182 const TargetRegisterClass *PtrRC = getRegClassFor(PVT);
20183 LabelReg = MRI.createVirtualRegister(PtrRC);
20184 if (Subtarget->is64Bit()) {
20185 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA64r), LabelReg)
20189 .addMBB(restoreMBB)
20192 const X86InstrInfo *XII = static_cast<const X86InstrInfo*>(TII);
20193 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::LEA32r), LabelReg)
20194 .addReg(XII->getGlobalBaseReg(MF))
20197 .addMBB(restoreMBB, Subtarget->ClassifyBlockAddressReference())
20201 PtrStoreOpc = (PVT == MVT::i64) ? X86::MOV64mi32 : X86::MOV32mi;
20203 MIB = BuildMI(*thisMBB, MI, DL, TII->get(PtrStoreOpc));
20204 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20205 if (i == X86::AddrDisp)
20206 MIB.addDisp(MI->getOperand(MemOpndSlot + i), LabelOffset);
20208 MIB.addOperand(MI->getOperand(MemOpndSlot + i));
20211 MIB.addReg(LabelReg);
20213 MIB.addMBB(restoreMBB);
20214 MIB.setMemRefs(MMOBegin, MMOEnd);
20216 MIB = BuildMI(*thisMBB, MI, DL, TII->get(X86::EH_SjLj_Setup))
20217 .addMBB(restoreMBB);
20219 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20220 MF->getSubtarget().getRegisterInfo());
20221 MIB.addRegMask(RegInfo->getNoPreservedMask());
20222 thisMBB->addSuccessor(mainMBB);
20223 thisMBB->addSuccessor(restoreMBB);
20227 BuildMI(mainMBB, DL, TII->get(X86::MOV32r0), mainDstReg);
20228 mainMBB->addSuccessor(sinkMBB);
20231 BuildMI(*sinkMBB, sinkMBB->begin(), DL,
20232 TII->get(X86::PHI), DstReg)
20233 .addReg(mainDstReg).addMBB(mainMBB)
20234 .addReg(restoreDstReg).addMBB(restoreMBB);
20237 BuildMI(restoreMBB, DL, TII->get(X86::MOV32ri), restoreDstReg).addImm(1);
20238 BuildMI(restoreMBB, DL, TII->get(X86::JMP_4)).addMBB(sinkMBB);
20239 restoreMBB->addSuccessor(sinkMBB);
20241 MI->eraseFromParent();
20245 MachineBasicBlock *
20246 X86TargetLowering::emitEHSjLjLongJmp(MachineInstr *MI,
20247 MachineBasicBlock *MBB) const {
20248 DebugLoc DL = MI->getDebugLoc();
20249 MachineFunction *MF = MBB->getParent();
20250 const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();
20251 MachineRegisterInfo &MRI = MF->getRegInfo();
20253 // Memory Reference
20254 MachineInstr::mmo_iterator MMOBegin = MI->memoperands_begin();
20255 MachineInstr::mmo_iterator MMOEnd = MI->memoperands_end();
20257 MVT PVT = getPointerTy();
20258 assert((PVT == MVT::i64 || PVT == MVT::i32) &&
20259 "Invalid Pointer Size!");
20261 const TargetRegisterClass *RC =
20262 (PVT == MVT::i64) ? &X86::GR64RegClass : &X86::GR32RegClass;
20263 unsigned Tmp = MRI.createVirtualRegister(RC);
20264 // Since FP is only updated here but NOT referenced, it's treated as GPR.
20265 const X86RegisterInfo *RegInfo = static_cast<const X86RegisterInfo *>(
20266 MF->getSubtarget().getRegisterInfo());
20267 unsigned FP = (PVT == MVT::i64) ? X86::RBP : X86::EBP;
20268 unsigned SP = RegInfo->getStackRegister();
20270 MachineInstrBuilder MIB;
20272 const int64_t LabelOffset = 1 * PVT.getStoreSize();
20273 const int64_t SPOffset = 2 * PVT.getStoreSize();
20275 unsigned PtrLoadOpc = (PVT == MVT::i64) ? X86::MOV64rm : X86::MOV32rm;
20276 unsigned IJmpOpc = (PVT == MVT::i64) ? X86::JMP64r : X86::JMP32r;
20279 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), FP);
20280 for (unsigned i = 0; i < X86::AddrNumOperands; ++i)
20281 MIB.addOperand(MI->getOperand(i));
20282 MIB.setMemRefs(MMOBegin, MMOEnd);
20284 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), Tmp);
20285 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20286 if (i == X86::AddrDisp)
20287 MIB.addDisp(MI->getOperand(i), LabelOffset);
20289 MIB.addOperand(MI->getOperand(i));
20291 MIB.setMemRefs(MMOBegin, MMOEnd);
20293 MIB = BuildMI(*MBB, MI, DL, TII->get(PtrLoadOpc), SP);
20294 for (unsigned i = 0; i < X86::AddrNumOperands; ++i) {
20295 if (i == X86::AddrDisp)
20296 MIB.addDisp(MI->getOperand(i), SPOffset);
20298 MIB.addOperand(MI->getOperand(i));
20300 MIB.setMemRefs(MMOBegin, MMOEnd);
20302 BuildMI(*MBB, MI, DL, TII->get(IJmpOpc)).addReg(Tmp);
20304 MI->eraseFromParent();
20308 // Replace 213-type (isel default) FMA3 instructions with 231-type for
20309 // accumulator loops. Writing back to the accumulator allows the coalescer
20310 // to remove extra copies in the loop.
20311 MachineBasicBlock *
20312 X86TargetLowering::emitFMA3Instr(MachineInstr *MI,
20313 MachineBasicBlock *MBB) const {
20314 MachineOperand &AddendOp = MI->getOperand(3);
20316 // Bail out early if the addend isn't a register - we can't switch these.
20317 if (!AddendOp.isReg())
20320 MachineFunction &MF = *MBB->getParent();
20321 MachineRegisterInfo &MRI = MF.getRegInfo();
20323 // Check whether the addend is defined by a PHI:
20324 assert(MRI.hasOneDef(AddendOp.getReg()) && "Multiple defs in SSA?");
20325 MachineInstr &AddendDef = *MRI.def_instr_begin(AddendOp.getReg());
20326 if (!AddendDef.isPHI())
20329 // Look for the following pattern:
20331 // %addend = phi [%entry, 0], [%loop, %result]
20333 // %result<tied1> = FMA213 %m2<tied0>, %m1, %addend
20337 // %addend = phi [%entry, 0], [%loop, %result]
20339 // %result<tied1> = FMA231 %addend<tied0>, %m1, %m2
20341 for (unsigned i = 1, e = AddendDef.getNumOperands(); i < e; i += 2) {
20342 assert(AddendDef.getOperand(i).isReg());
20343 MachineOperand PHISrcOp = AddendDef.getOperand(i);
20344 MachineInstr &PHISrcInst = *MRI.def_instr_begin(PHISrcOp.getReg());
20345 if (&PHISrcInst == MI) {
20346 // Found a matching instruction.
20347 unsigned NewFMAOpc = 0;
20348 switch (MI->getOpcode()) {
20349 case X86::VFMADDPDr213r: NewFMAOpc = X86::VFMADDPDr231r; break;
20350 case X86::VFMADDPSr213r: NewFMAOpc = X86::VFMADDPSr231r; break;
20351 case X86::VFMADDSDr213r: NewFMAOpc = X86::VFMADDSDr231r; break;
20352 case X86::VFMADDSSr213r: NewFMAOpc = X86::VFMADDSSr231r; break;
20353 case X86::VFMSUBPDr213r: NewFMAOpc = X86::VFMSUBPDr231r; break;
20354 case X86::VFMSUBPSr213r: NewFMAOpc = X86::VFMSUBPSr231r; break;
20355 case X86::VFMSUBSDr213r: NewFMAOpc = X86::VFMSUBSDr231r; break;
20356 case X86::VFMSUBSSr213r: NewFMAOpc = X86::VFMSUBSSr231r; break;
20357 case X86::VFNMADDPDr213r: NewFMAOpc = X86::VFNMADDPDr231r; break;
20358 case X86::VFNMADDPSr213r: NewFMAOpc = X86::VFNMADDPSr231r; break;
20359 case X86::VFNMADDSDr213r: NewFMAOpc = X86::VFNMADDSDr231r; break;
20360 case X86::VFNMADDSSr213r: NewFMAOpc = X86::VFNMADDSSr231r; break;
20361 case X86::VFNMSUBPDr213r: NewFMAOpc = X86::VFNMSUBPDr231r; break;
20362 case X86::VFNMSUBPSr213r: NewFMAOpc = X86::VFNMSUBPSr231r; break;
20363 case X86::VFNMSUBSDr213r: NewFMAOpc = X86::VFNMSUBSDr231r; break;
20364 case X86::VFNMSUBSSr213r: NewFMAOpc = X86::VFNMSUBSSr231r; break;
20365 case X86::VFMADDPDr213rY: NewFMAOpc = X86::VFMADDPDr231rY; break;
20366 case X86::VFMADDPSr213rY: NewFMAOpc = X86::VFMADDPSr231rY; break;
20367 case X86::VFMSUBPDr213rY: NewFMAOpc = X86::VFMSUBPDr231rY; break;
20368 case X86::VFMSUBPSr213rY: NewFMAOpc = X86::VFMSUBPSr231rY; break;
20369 case X86::VFNMADDPDr213rY: NewFMAOpc = X86::VFNMADDPDr231rY; break;
20370 case X86::VFNMADDPSr213rY: NewFMAOpc = X86::VFNMADDPSr231rY; break;
20371 case X86::VFNMSUBPDr213rY: NewFMAOpc = X86::VFNMSUBPDr231rY; break;
20372 case X86::VFNMSUBPSr213rY: NewFMAOpc = X86::VFNMSUBPSr231rY; break;
20373 default: llvm_unreachable("Unrecognized FMA variant.");
20376 const TargetInstrInfo &TII = *MF.getSubtarget().getInstrInfo();
20377 MachineInstrBuilder MIB =
20378 BuildMI(MF, MI->getDebugLoc(), TII.get(NewFMAOpc))
20379 .addOperand(MI->getOperand(0))
20380 .addOperand(MI->getOperand(3))
20381 .addOperand(MI->getOperand(2))
20382 .addOperand(MI->getOperand(1));
20383 MBB->insert(MachineBasicBlock::iterator(MI), MIB);
20384 MI->eraseFromParent();
20391 MachineBasicBlock *
20392 X86TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
20393 MachineBasicBlock *BB) const {
20394 switch (MI->getOpcode()) {
20395 default: llvm_unreachable("Unexpected instr type to insert");
20396 case X86::TAILJMPd64:
20397 case X86::TAILJMPr64:
20398 case X86::TAILJMPm64:
20399 llvm_unreachable("TAILJMP64 would not be touched here.");
20400 case X86::TCRETURNdi64:
20401 case X86::TCRETURNri64:
20402 case X86::TCRETURNmi64:
20404 case X86::WIN_ALLOCA:
20405 return EmitLoweredWinAlloca(MI, BB);
20406 case X86::SEG_ALLOCA_32:
20407 case X86::SEG_ALLOCA_64:
20408 return EmitLoweredSegAlloca(MI, BB);
20409 case X86::TLSCall_32:
20410 case X86::TLSCall_64:
20411 return EmitLoweredTLSCall(MI, BB);
20412 case X86::CMOV_GR8:
20413 case X86::CMOV_FR32:
20414 case X86::CMOV_FR64:
20415 case X86::CMOV_V4F32:
20416 case X86::CMOV_V2F64:
20417 case X86::CMOV_V2I64:
20418 case X86::CMOV_V8F32:
20419 case X86::CMOV_V4F64:
20420 case X86::CMOV_V4I64:
20421 case X86::CMOV_V16F32:
20422 case X86::CMOV_V8F64:
20423 case X86::CMOV_V8I64:
20424 case X86::CMOV_GR16:
20425 case X86::CMOV_GR32:
20426 case X86::CMOV_RFP32:
20427 case X86::CMOV_RFP64:
20428 case X86::CMOV_RFP80:
20429 return EmitLoweredSelect(MI, BB);
20431 case X86::FP32_TO_INT16_IN_MEM:
20432 case X86::FP32_TO_INT32_IN_MEM:
20433 case X86::FP32_TO_INT64_IN_MEM:
20434 case X86::FP64_TO_INT16_IN_MEM:
20435 case X86::FP64_TO_INT32_IN_MEM:
20436 case X86::FP64_TO_INT64_IN_MEM:
20437 case X86::FP80_TO_INT16_IN_MEM:
20438 case X86::FP80_TO_INT32_IN_MEM:
20439 case X86::FP80_TO_INT64_IN_MEM: {
20440 MachineFunction *F = BB->getParent();
20441 const TargetInstrInfo *TII = F->getSubtarget().getInstrInfo();
20442 DebugLoc DL = MI->getDebugLoc();
20444 // Change the floating point control register to use "round towards zero"
20445 // mode when truncating to an integer value.
20446 int CWFrameIdx = F->getFrameInfo()->CreateStackObject(2, 2, false);
20447 addFrameReference(BuildMI(*BB, MI, DL,
20448 TII->get(X86::FNSTCW16m)), CWFrameIdx);
20450 // Load the old value of the high byte of the control word...
20452 F->getRegInfo().createVirtualRegister(&X86::GR16RegClass);
20453 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16rm), OldCW),
20456 // Set the high part to be round to zero...
20457 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mi)), CWFrameIdx)
20460 // Reload the modified control word now...
20461 addFrameReference(BuildMI(*BB, MI, DL,
20462 TII->get(X86::FLDCW16m)), CWFrameIdx);
20464 // Restore the memory image of control word to original value
20465 addFrameReference(BuildMI(*BB, MI, DL, TII->get(X86::MOV16mr)), CWFrameIdx)
20468 // Get the X86 opcode to use.
20470 switch (MI->getOpcode()) {
20471 default: llvm_unreachable("illegal opcode!");
20472 case X86::FP32_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m32; break;
20473 case X86::FP32_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m32; break;
20474 case X86::FP32_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m32; break;
20475 case X86::FP64_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m64; break;
20476 case X86::FP64_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m64; break;
20477 case X86::FP64_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m64; break;
20478 case X86::FP80_TO_INT16_IN_MEM: Opc = X86::IST_Fp16m80; break;
20479 case X86::FP80_TO_INT32_IN_MEM: Opc = X86::IST_Fp32m80; break;
20480 case X86::FP80_TO_INT64_IN_MEM: Opc = X86::IST_Fp64m80; break;
20484 MachineOperand &Op = MI->getOperand(0);
20486 AM.BaseType = X86AddressMode::RegBase;
20487 AM.Base.Reg = Op.getReg();
20489 AM.BaseType = X86AddressMode::FrameIndexBase;
20490 AM.Base.FrameIndex = Op.getIndex();
20492 Op = MI->getOperand(1);
20494 AM.Scale = Op.getImm();
20495 Op = MI->getOperand(2);
20497 AM.IndexReg = Op.getImm();
20498 Op = MI->getOperand(3);
20499 if (Op.isGlobal()) {
20500 AM.GV = Op.getGlobal();
20502 AM.Disp = Op.getImm();
20504 addFullAddress(BuildMI(*BB, MI, DL, TII->get(Opc)), AM)
20505 .addReg(MI->getOperand(X86::AddrNumOperands).getReg());
20507 // Reload the original control word now.
20508 addFrameReference(BuildMI(*BB, MI, DL,
20509 TII->get(X86::FLDCW16m)), CWFrameIdx);
20511 MI->eraseFromParent(); // The pseudo instruction is gone now.
20514 // String/text processing lowering.
20515 case X86::PCMPISTRM128REG:
20516 case X86::VPCMPISTRM128REG:
20517 case X86::PCMPISTRM128MEM:
20518 case X86::VPCMPISTRM128MEM:
20519 case X86::PCMPESTRM128REG:
20520 case X86::VPCMPESTRM128REG:
20521 case X86::PCMPESTRM128MEM:
20522 case X86::VPCMPESTRM128MEM:
20523 assert(Subtarget->hasSSE42() &&
20524 "Target must have SSE4.2 or AVX features enabled");
20525 return EmitPCMPSTRM(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20527 // String/text processing lowering.
20528 case X86::PCMPISTRIREG:
20529 case X86::VPCMPISTRIREG:
20530 case X86::PCMPISTRIMEM:
20531 case X86::VPCMPISTRIMEM:
20532 case X86::PCMPESTRIREG:
20533 case X86::VPCMPESTRIREG:
20534 case X86::PCMPESTRIMEM:
20535 case X86::VPCMPESTRIMEM:
20536 assert(Subtarget->hasSSE42() &&
20537 "Target must have SSE4.2 or AVX features enabled");
20538 return EmitPCMPSTRI(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20540 // Thread synchronization.
20542 return EmitMonitor(MI, BB, BB->getParent()->getSubtarget().getInstrInfo(),
20547 return EmitXBegin(MI, BB, BB->getParent()->getSubtarget().getInstrInfo());
20549 case X86::VASTART_SAVE_XMM_REGS:
20550 return EmitVAStartSaveXMMRegsWithCustomInserter(MI, BB);
20552 case X86::VAARG_64:
20553 return EmitVAARG64WithCustomInserter(MI, BB);
20555 case X86::EH_SjLj_SetJmp32:
20556 case X86::EH_SjLj_SetJmp64:
20557 return emitEHSjLjSetJmp(MI, BB);
20559 case X86::EH_SjLj_LongJmp32:
20560 case X86::EH_SjLj_LongJmp64:
20561 return emitEHSjLjLongJmp(MI, BB);
20563 case TargetOpcode::STACKMAP:
20564 case TargetOpcode::PATCHPOINT:
20565 return emitPatchPoint(MI, BB);
20567 case X86::VFMADDPDr213r:
20568 case X86::VFMADDPSr213r:
20569 case X86::VFMADDSDr213r:
20570 case X86::VFMADDSSr213r:
20571 case X86::VFMSUBPDr213r:
20572 case X86::VFMSUBPSr213r:
20573 case X86::VFMSUBSDr213r:
20574 case X86::VFMSUBSSr213r:
20575 case X86::VFNMADDPDr213r:
20576 case X86::VFNMADDPSr213r:
20577 case X86::VFNMADDSDr213r:
20578 case X86::VFNMADDSSr213r:
20579 case X86::VFNMSUBPDr213r:
20580 case X86::VFNMSUBPSr213r:
20581 case X86::VFNMSUBSDr213r:
20582 case X86::VFNMSUBSSr213r:
20583 case X86::VFMADDPDr213rY:
20584 case X86::VFMADDPSr213rY:
20585 case X86::VFMSUBPDr213rY:
20586 case X86::VFMSUBPSr213rY:
20587 case X86::VFNMADDPDr213rY:
20588 case X86::VFNMADDPSr213rY:
20589 case X86::VFNMSUBPDr213rY:
20590 case X86::VFNMSUBPSr213rY:
20591 return emitFMA3Instr(MI, BB);
20595 //===----------------------------------------------------------------------===//
20596 // X86 Optimization Hooks
20597 //===----------------------------------------------------------------------===//
20599 void X86TargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
20602 const SelectionDAG &DAG,
20603 unsigned Depth) const {
20604 unsigned BitWidth = KnownZero.getBitWidth();
20605 unsigned Opc = Op.getOpcode();
20606 assert((Opc >= ISD::BUILTIN_OP_END ||
20607 Opc == ISD::INTRINSIC_WO_CHAIN ||
20608 Opc == ISD::INTRINSIC_W_CHAIN ||
20609 Opc == ISD::INTRINSIC_VOID) &&
20610 "Should use MaskedValueIsZero if you don't know whether Op"
20611 " is a target node!");
20613 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
20627 // These nodes' second result is a boolean.
20628 if (Op.getResNo() == 0)
20631 case X86ISD::SETCC:
20632 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
20634 case ISD::INTRINSIC_WO_CHAIN: {
20635 unsigned IntId = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
20636 unsigned NumLoBits = 0;
20639 case Intrinsic::x86_sse_movmsk_ps:
20640 case Intrinsic::x86_avx_movmsk_ps_256:
20641 case Intrinsic::x86_sse2_movmsk_pd:
20642 case Intrinsic::x86_avx_movmsk_pd_256:
20643 case Intrinsic::x86_mmx_pmovmskb:
20644 case Intrinsic::x86_sse2_pmovmskb_128:
20645 case Intrinsic::x86_avx2_pmovmskb: {
20646 // High bits of movmskp{s|d}, pmovmskb are known zero.
20648 default: llvm_unreachable("Impossible intrinsic"); // Can't reach here.
20649 case Intrinsic::x86_sse_movmsk_ps: NumLoBits = 4; break;
20650 case Intrinsic::x86_avx_movmsk_ps_256: NumLoBits = 8; break;
20651 case Intrinsic::x86_sse2_movmsk_pd: NumLoBits = 2; break;
20652 case Intrinsic::x86_avx_movmsk_pd_256: NumLoBits = 4; break;
20653 case Intrinsic::x86_mmx_pmovmskb: NumLoBits = 8; break;
20654 case Intrinsic::x86_sse2_pmovmskb_128: NumLoBits = 16; break;
20655 case Intrinsic::x86_avx2_pmovmskb: NumLoBits = 32; break;
20657 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - NumLoBits);
20666 unsigned X86TargetLowering::ComputeNumSignBitsForTargetNode(
20668 const SelectionDAG &,
20669 unsigned Depth) const {
20670 // SETCC_CARRY sets the dest to ~0 for true or 0 for false.
20671 if (Op.getOpcode() == X86ISD::SETCC_CARRY)
20672 return Op.getValueType().getScalarType().getSizeInBits();
20678 /// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
20679 /// node is a GlobalAddress + offset.
20680 bool X86TargetLowering::isGAPlusOffset(SDNode *N,
20681 const GlobalValue* &GA,
20682 int64_t &Offset) const {
20683 if (N->getOpcode() == X86ISD::Wrapper) {
20684 if (isa<GlobalAddressSDNode>(N->getOperand(0))) {
20685 GA = cast<GlobalAddressSDNode>(N->getOperand(0))->getGlobal();
20686 Offset = cast<GlobalAddressSDNode>(N->getOperand(0))->getOffset();
20690 return TargetLowering::isGAPlusOffset(N, GA, Offset);
20693 /// isShuffleHigh128VectorInsertLow - Checks whether the shuffle node is the
20694 /// same as extracting the high 128-bit part of 256-bit vector and then
20695 /// inserting the result into the low part of a new 256-bit vector
20696 static bool isShuffleHigh128VectorInsertLow(ShuffleVectorSDNode *SVOp) {
20697 EVT VT = SVOp->getValueType(0);
20698 unsigned NumElems = VT.getVectorNumElements();
20700 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20701 for (unsigned i = 0, j = NumElems/2; i != NumElems/2; ++i, ++j)
20702 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20703 SVOp->getMaskElt(j) >= 0)
20709 /// isShuffleLow128VectorInsertHigh - Checks whether the shuffle node is the
20710 /// same as extracting the low 128-bit part of 256-bit vector and then
20711 /// inserting the result into the high part of a new 256-bit vector
20712 static bool isShuffleLow128VectorInsertHigh(ShuffleVectorSDNode *SVOp) {
20713 EVT VT = SVOp->getValueType(0);
20714 unsigned NumElems = VT.getVectorNumElements();
20716 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20717 for (unsigned i = NumElems/2, j = 0; i != NumElems; ++i, ++j)
20718 if (!isUndefOrEqual(SVOp->getMaskElt(i), j) ||
20719 SVOp->getMaskElt(j) >= 0)
20725 /// PerformShuffleCombine256 - Performs shuffle combines for 256-bit vectors.
20726 static SDValue PerformShuffleCombine256(SDNode *N, SelectionDAG &DAG,
20727 TargetLowering::DAGCombinerInfo &DCI,
20728 const X86Subtarget* Subtarget) {
20730 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
20731 SDValue V1 = SVOp->getOperand(0);
20732 SDValue V2 = SVOp->getOperand(1);
20733 EVT VT = SVOp->getValueType(0);
20734 unsigned NumElems = VT.getVectorNumElements();
20736 if (V1.getOpcode() == ISD::CONCAT_VECTORS &&
20737 V2.getOpcode() == ISD::CONCAT_VECTORS) {
20741 // V UNDEF BUILD_VECTOR UNDEF
20743 // CONCAT_VECTOR CONCAT_VECTOR
20746 // RESULT: V + zero extended
20748 if (V2.getOperand(0).getOpcode() != ISD::BUILD_VECTOR ||
20749 V2.getOperand(1).getOpcode() != ISD::UNDEF ||
20750 V1.getOperand(1).getOpcode() != ISD::UNDEF)
20753 if (!ISD::isBuildVectorAllZeros(V2.getOperand(0).getNode()))
20756 // To match the shuffle mask, the first half of the mask should
20757 // be exactly the first vector, and all the rest a splat with the
20758 // first element of the second one.
20759 for (unsigned i = 0; i != NumElems/2; ++i)
20760 if (!isUndefOrEqual(SVOp->getMaskElt(i), i) ||
20761 !isUndefOrEqual(SVOp->getMaskElt(i+NumElems/2), NumElems))
20764 // If V1 is coming from a vector load then just fold to a VZEXT_LOAD.
20765 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(V1.getOperand(0))) {
20766 if (Ld->hasNUsesOfValue(1, 0)) {
20767 SDVTList Tys = DAG.getVTList(MVT::v4i64, MVT::Other);
20768 SDValue Ops[] = { Ld->getChain(), Ld->getBasePtr() };
20770 DAG.getMemIntrinsicNode(X86ISD::VZEXT_LOAD, dl, Tys, Ops,
20772 Ld->getPointerInfo(),
20773 Ld->getAlignment(),
20774 false/*isVolatile*/, true/*ReadMem*/,
20775 false/*WriteMem*/);
20777 // Make sure the newly-created LOAD is in the same position as Ld in
20778 // terms of dependency. We create a TokenFactor for Ld and ResNode,
20779 // and update uses of Ld's output chain to use the TokenFactor.
20780 if (Ld->hasAnyUseOfValue(1)) {
20781 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
20782 SDValue(Ld, 1), SDValue(ResNode.getNode(), 1));
20783 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1), NewChain);
20784 DAG.UpdateNodeOperands(NewChain.getNode(), SDValue(Ld, 1),
20785 SDValue(ResNode.getNode(), 1));
20788 return DAG.getNode(ISD::BITCAST, dl, VT, ResNode);
20792 // Emit a zeroed vector and insert the desired subvector on its
20794 SDValue Zeros = getZeroVector(VT, Subtarget, DAG, dl);
20795 SDValue InsV = Insert128BitVector(Zeros, V1.getOperand(0), 0, DAG, dl);
20796 return DCI.CombineTo(N, InsV);
20799 //===--------------------------------------------------------------------===//
20800 // Combine some shuffles into subvector extracts and inserts:
20803 // vector_shuffle <4, 5, 6, 7, u, u, u, u> or <2, 3, u, u>
20804 if (isShuffleHigh128VectorInsertLow(SVOp)) {
20805 SDValue V = Extract128BitVector(V1, NumElems/2, DAG, dl);
20806 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, 0, DAG, dl);
20807 return DCI.CombineTo(N, InsV);
20810 // vector_shuffle <u, u, u, u, 0, 1, 2, 3> or <u, u, 0, 1>
20811 if (isShuffleLow128VectorInsertHigh(SVOp)) {
20812 SDValue V = Extract128BitVector(V1, 0, DAG, dl);
20813 SDValue InsV = Insert128BitVector(DAG.getUNDEF(VT), V, NumElems/2, DAG, dl);
20814 return DCI.CombineTo(N, InsV);
20820 /// \brief Combine an arbitrary chain of shuffles into a single instruction if
20823 /// This is the leaf of the recursive combinine below. When we have found some
20824 /// chain of single-use x86 shuffle instructions and accumulated the combined
20825 /// shuffle mask represented by them, this will try to pattern match that mask
20826 /// into either a single instruction if there is a special purpose instruction
20827 /// for this operation, or into a PSHUFB instruction which is a fully general
20828 /// instruction but should only be used to replace chains over a certain depth.
20829 static bool combineX86ShuffleChain(SDValue Op, SDValue Root, ArrayRef<int> Mask,
20830 int Depth, bool HasPSHUFB, SelectionDAG &DAG,
20831 TargetLowering::DAGCombinerInfo &DCI,
20832 const X86Subtarget *Subtarget) {
20833 assert(!Mask.empty() && "Cannot combine an empty shuffle mask!");
20835 // Find the operand that enters the chain. Note that multiple uses are OK
20836 // here, we're not going to remove the operand we find.
20837 SDValue Input = Op.getOperand(0);
20838 while (Input.getOpcode() == ISD::BITCAST)
20839 Input = Input.getOperand(0);
20841 MVT VT = Input.getSimpleValueType();
20842 MVT RootVT = Root.getSimpleValueType();
20845 // Just remove no-op shuffle masks.
20846 if (Mask.size() == 1) {
20847 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Input),
20852 // Use the float domain if the operand type is a floating point type.
20853 bool FloatDomain = VT.isFloatingPoint();
20855 // For floating point shuffles, we don't have free copies in the shuffle
20856 // instructions or the ability to load as part of the instruction, so
20857 // canonicalize their shuffles to UNPCK or MOV variants.
20859 // Note that even with AVX we prefer the PSHUFD form of shuffle for integer
20860 // vectors because it can have a load folded into it that UNPCK cannot. This
20861 // doesn't preclude something switching to the shorter encoding post-RA.
20863 if (Mask.equals(0, 0) || Mask.equals(1, 1)) {
20864 bool Lo = Mask.equals(0, 0);
20867 // Check if we have SSE3 which will let us use MOVDDUP. That instruction
20868 // is no slower than UNPCKLPD but has the option to fold the input operand
20869 // into even an unaligned memory load.
20870 if (Lo && Subtarget->hasSSE3()) {
20871 Shuffle = X86ISD::MOVDDUP;
20872 ShuffleVT = MVT::v2f64;
20874 // We have MOVLHPS and MOVHLPS throughout SSE and they encode smaller
20875 // than the UNPCK variants.
20876 Shuffle = Lo ? X86ISD::MOVLHPS : X86ISD::MOVHLPS;
20877 ShuffleVT = MVT::v4f32;
20879 if (Depth == 1 && Root->getOpcode() == Shuffle)
20880 return false; // Nothing to do!
20881 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20882 DCI.AddToWorklist(Op.getNode());
20883 if (Shuffle == X86ISD::MOVDDUP)
20884 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20886 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20887 DCI.AddToWorklist(Op.getNode());
20888 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20892 if (Subtarget->hasSSE3() &&
20893 (Mask.equals(0, 0, 2, 2) || Mask.equals(1, 1, 3, 3))) {
20894 bool Lo = Mask.equals(0, 0, 2, 2);
20895 unsigned Shuffle = Lo ? X86ISD::MOVSLDUP : X86ISD::MOVSHDUP;
20896 MVT ShuffleVT = MVT::v4f32;
20897 if (Depth == 1 && Root->getOpcode() == Shuffle)
20898 return false; // Nothing to do!
20899 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20900 DCI.AddToWorklist(Op.getNode());
20901 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op);
20902 DCI.AddToWorklist(Op.getNode());
20903 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20907 if (Mask.equals(0, 0, 1, 1) || Mask.equals(2, 2, 3, 3)) {
20908 bool Lo = Mask.equals(0, 0, 1, 1);
20909 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20910 MVT ShuffleVT = MVT::v4f32;
20911 if (Depth == 1 && Root->getOpcode() == Shuffle)
20912 return false; // Nothing to do!
20913 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20914 DCI.AddToWorklist(Op.getNode());
20915 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20916 DCI.AddToWorklist(Op.getNode());
20917 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20923 // We always canonicalize the 8 x i16 and 16 x i8 shuffles into their UNPCK
20924 // variants as none of these have single-instruction variants that are
20925 // superior to the UNPCK formulation.
20926 if (!FloatDomain &&
20927 (Mask.equals(0, 0, 1, 1, 2, 2, 3, 3) ||
20928 Mask.equals(4, 4, 5, 5, 6, 6, 7, 7) ||
20929 Mask.equals(0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7) ||
20930 Mask.equals(8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15,
20932 bool Lo = Mask[0] == 0;
20933 unsigned Shuffle = Lo ? X86ISD::UNPCKL : X86ISD::UNPCKH;
20934 if (Depth == 1 && Root->getOpcode() == Shuffle)
20935 return false; // Nothing to do!
20937 switch (Mask.size()) {
20939 ShuffleVT = MVT::v8i16;
20942 ShuffleVT = MVT::v16i8;
20945 llvm_unreachable("Impossible mask size!");
20947 Op = DAG.getNode(ISD::BITCAST, DL, ShuffleVT, Input);
20948 DCI.AddToWorklist(Op.getNode());
20949 Op = DAG.getNode(Shuffle, DL, ShuffleVT, Op, Op);
20950 DCI.AddToWorklist(Op.getNode());
20951 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20956 // Don't try to re-form single instruction chains under any circumstances now
20957 // that we've done encoding canonicalization for them.
20961 // If we have 3 or more shuffle instructions or a chain involving PSHUFB, we
20962 // can replace them with a single PSHUFB instruction profitably. Intel's
20963 // manuals suggest only using PSHUFB if doing so replacing 5 instructions, but
20964 // in practice PSHUFB tends to be *very* fast so we're more aggressive.
20965 if ((Depth >= 3 || HasPSHUFB) && Subtarget->hasSSSE3()) {
20966 SmallVector<SDValue, 16> PSHUFBMask;
20967 assert(Mask.size() <= 16 && "Can't shuffle elements smaller than bytes!");
20968 int Ratio = 16 / Mask.size();
20969 for (unsigned i = 0; i < 16; ++i) {
20970 if (Mask[i / Ratio] == SM_SentinelUndef) {
20971 PSHUFBMask.push_back(DAG.getUNDEF(MVT::i8));
20974 int M = Mask[i / Ratio] != SM_SentinelZero
20975 ? Ratio * Mask[i / Ratio] + i % Ratio
20977 PSHUFBMask.push_back(DAG.getConstant(M, MVT::i8));
20979 Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Input);
20980 DCI.AddToWorklist(Op.getNode());
20981 SDValue PSHUFBMaskOp =
20982 DAG.getNode(ISD::BUILD_VECTOR, DL, MVT::v16i8, PSHUFBMask);
20983 DCI.AddToWorklist(PSHUFBMaskOp.getNode());
20984 Op = DAG.getNode(X86ISD::PSHUFB, DL, MVT::v16i8, Op, PSHUFBMaskOp);
20985 DCI.AddToWorklist(Op.getNode());
20986 DCI.CombineTo(Root.getNode(), DAG.getNode(ISD::BITCAST, DL, RootVT, Op),
20991 // Failed to find any combines.
20995 /// \brief Fully generic combining of x86 shuffle instructions.
20997 /// This should be the last combine run over the x86 shuffle instructions. Once
20998 /// they have been fully optimized, this will recursively consider all chains
20999 /// of single-use shuffle instructions, build a generic model of the cumulative
21000 /// shuffle operation, and check for simpler instructions which implement this
21001 /// operation. We use this primarily for two purposes:
21003 /// 1) Collapse generic shuffles to specialized single instructions when
21004 /// equivalent. In most cases, this is just an encoding size win, but
21005 /// sometimes we will collapse multiple generic shuffles into a single
21006 /// special-purpose shuffle.
21007 /// 2) Look for sequences of shuffle instructions with 3 or more total
21008 /// instructions, and replace them with the slightly more expensive SSSE3
21009 /// PSHUFB instruction if available. We do this as the last combining step
21010 /// to ensure we avoid using PSHUFB if we can implement the shuffle with
21011 /// a suitable short sequence of other instructions. The PHUFB will either
21012 /// use a register or have to read from memory and so is slightly (but only
21013 /// slightly) more expensive than the other shuffle instructions.
21015 /// Because this is inherently a quadratic operation (for each shuffle in
21016 /// a chain, we recurse up the chain), the depth is limited to 8 instructions.
21017 /// This should never be an issue in practice as the shuffle lowering doesn't
21018 /// produce sequences of more than 8 instructions.
21020 /// FIXME: We will currently miss some cases where the redundant shuffling
21021 /// would simplify under the threshold for PSHUFB formation because of
21022 /// combine-ordering. To fix this, we should do the redundant instruction
21023 /// combining in this recursive walk.
21024 static bool combineX86ShufflesRecursively(SDValue Op, SDValue Root,
21025 ArrayRef<int> RootMask,
21026 int Depth, bool HasPSHUFB,
21028 TargetLowering::DAGCombinerInfo &DCI,
21029 const X86Subtarget *Subtarget) {
21030 // Bound the depth of our recursive combine because this is ultimately
21031 // quadratic in nature.
21035 // Directly rip through bitcasts to find the underlying operand.
21036 while (Op.getOpcode() == ISD::BITCAST && Op.getOperand(0).hasOneUse())
21037 Op = Op.getOperand(0);
21039 MVT VT = Op.getSimpleValueType();
21040 if (!VT.isVector())
21041 return false; // Bail if we hit a non-vector.
21042 // FIXME: This routine should be taught about 256-bit shuffles, or a 256-bit
21043 // version should be added.
21044 if (VT.getSizeInBits() != 128)
21047 assert(Root.getSimpleValueType().isVector() &&
21048 "Shuffles operate on vector types!");
21049 assert(VT.getSizeInBits() == Root.getSimpleValueType().getSizeInBits() &&
21050 "Can only combine shuffles of the same vector register size.");
21052 if (!isTargetShuffle(Op.getOpcode()))
21054 SmallVector<int, 16> OpMask;
21056 bool HaveMask = getTargetShuffleMask(Op.getNode(), VT, OpMask, IsUnary);
21057 // We only can combine unary shuffles which we can decode the mask for.
21058 if (!HaveMask || !IsUnary)
21061 assert(VT.getVectorNumElements() == OpMask.size() &&
21062 "Different mask size from vector size!");
21063 assert(((RootMask.size() > OpMask.size() &&
21064 RootMask.size() % OpMask.size() == 0) ||
21065 (OpMask.size() > RootMask.size() &&
21066 OpMask.size() % RootMask.size() == 0) ||
21067 OpMask.size() == RootMask.size()) &&
21068 "The smaller number of elements must divide the larger.");
21069 int RootRatio = std::max<int>(1, OpMask.size() / RootMask.size());
21070 int OpRatio = std::max<int>(1, RootMask.size() / OpMask.size());
21071 assert(((RootRatio == 1 && OpRatio == 1) ||
21072 (RootRatio == 1) != (OpRatio == 1)) &&
21073 "Must not have a ratio for both incoming and op masks!");
21075 SmallVector<int, 16> Mask;
21076 Mask.reserve(std::max(OpMask.size(), RootMask.size()));
21078 // Merge this shuffle operation's mask into our accumulated mask. Note that
21079 // this shuffle's mask will be the first applied to the input, followed by the
21080 // root mask to get us all the way to the root value arrangement. The reason
21081 // for this order is that we are recursing up the operation chain.
21082 for (int i = 0, e = std::max(OpMask.size(), RootMask.size()); i < e; ++i) {
21083 int RootIdx = i / RootRatio;
21084 if (RootMask[RootIdx] < 0) {
21085 // This is a zero or undef lane, we're done.
21086 Mask.push_back(RootMask[RootIdx]);
21090 int RootMaskedIdx = RootMask[RootIdx] * RootRatio + i % RootRatio;
21091 int OpIdx = RootMaskedIdx / OpRatio;
21092 if (OpMask[OpIdx] < 0) {
21093 // The incoming lanes are zero or undef, it doesn't matter which ones we
21095 Mask.push_back(OpMask[OpIdx]);
21099 // Ok, we have non-zero lanes, map them through.
21100 Mask.push_back(OpMask[OpIdx] * OpRatio +
21101 RootMaskedIdx % OpRatio);
21104 // See if we can recurse into the operand to combine more things.
21105 switch (Op.getOpcode()) {
21106 case X86ISD::PSHUFB:
21108 case X86ISD::PSHUFD:
21109 case X86ISD::PSHUFHW:
21110 case X86ISD::PSHUFLW:
21111 if (Op.getOperand(0).hasOneUse() &&
21112 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21113 HasPSHUFB, DAG, DCI, Subtarget))
21117 case X86ISD::UNPCKL:
21118 case X86ISD::UNPCKH:
21119 assert(Op.getOperand(0) == Op.getOperand(1) && "We only combine unary shuffles!");
21120 // We can't check for single use, we have to check that this shuffle is the only user.
21121 if (Op->isOnlyUserOf(Op.getOperand(0).getNode()) &&
21122 combineX86ShufflesRecursively(Op.getOperand(0), Root, Mask, Depth + 1,
21123 HasPSHUFB, DAG, DCI, Subtarget))
21128 // Minor canonicalization of the accumulated shuffle mask to make it easier
21129 // to match below. All this does is detect masks with squential pairs of
21130 // elements, and shrink them to the half-width mask. It does this in a loop
21131 // so it will reduce the size of the mask to the minimal width mask which
21132 // performs an equivalent shuffle.
21133 SmallVector<int, 16> WidenedMask;
21134 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
21135 Mask = std::move(WidenedMask);
21136 WidenedMask.clear();
21139 return combineX86ShuffleChain(Op, Root, Mask, Depth, HasPSHUFB, DAG, DCI,
21143 /// \brief Get the PSHUF-style mask from PSHUF node.
21145 /// This is a very minor wrapper around getTargetShuffleMask to easy forming v4
21146 /// PSHUF-style masks that can be reused with such instructions.
21147 static SmallVector<int, 4> getPSHUFShuffleMask(SDValue N) {
21148 SmallVector<int, 4> Mask;
21150 bool HaveMask = getTargetShuffleMask(N.getNode(), N.getSimpleValueType(), Mask, IsUnary);
21154 switch (N.getOpcode()) {
21155 case X86ISD::PSHUFD:
21157 case X86ISD::PSHUFLW:
21160 case X86ISD::PSHUFHW:
21161 Mask.erase(Mask.begin(), Mask.begin() + 4);
21162 for (int &M : Mask)
21166 llvm_unreachable("No valid shuffle instruction found!");
21170 /// \brief Search for a combinable shuffle across a chain ending in pshufd.
21172 /// We walk up the chain and look for a combinable shuffle, skipping over
21173 /// shuffles that we could hoist this shuffle's transformation past without
21174 /// altering anything.
21176 combineRedundantDWordShuffle(SDValue N, MutableArrayRef<int> Mask,
21178 TargetLowering::DAGCombinerInfo &DCI) {
21179 assert(N.getOpcode() == X86ISD::PSHUFD &&
21180 "Called with something other than an x86 128-bit half shuffle!");
21183 // Walk up a single-use chain looking for a combinable shuffle. Keep a stack
21184 // of the shuffles in the chain so that we can form a fresh chain to replace
21186 SmallVector<SDValue, 8> Chain;
21187 SDValue V = N.getOperand(0);
21188 for (; V.hasOneUse(); V = V.getOperand(0)) {
21189 switch (V.getOpcode()) {
21191 return SDValue(); // Nothing combined!
21194 // Skip bitcasts as we always know the type for the target specific
21198 case X86ISD::PSHUFD:
21199 // Found another dword shuffle.
21202 case X86ISD::PSHUFLW:
21203 // Check that the low words (being shuffled) are the identity in the
21204 // dword shuffle, and the high words are self-contained.
21205 if (Mask[0] != 0 || Mask[1] != 1 ||
21206 !(Mask[2] >= 2 && Mask[2] < 4 && Mask[3] >= 2 && Mask[3] < 4))
21209 Chain.push_back(V);
21212 case X86ISD::PSHUFHW:
21213 // Check that the high words (being shuffled) are the identity in the
21214 // dword shuffle, and the low words are self-contained.
21215 if (Mask[2] != 2 || Mask[3] != 3 ||
21216 !(Mask[0] >= 0 && Mask[0] < 2 && Mask[1] >= 0 && Mask[1] < 2))
21219 Chain.push_back(V);
21222 case X86ISD::UNPCKL:
21223 case X86ISD::UNPCKH:
21224 // For either i8 -> i16 or i16 -> i32 unpacks, we can combine a dword
21225 // shuffle into a preceding word shuffle.
21226 if (V.getValueType() != MVT::v16i8 && V.getValueType() != MVT::v8i16)
21229 // Search for a half-shuffle which we can combine with.
21230 unsigned CombineOp =
21231 V.getOpcode() == X86ISD::UNPCKL ? X86ISD::PSHUFLW : X86ISD::PSHUFHW;
21232 if (V.getOperand(0) != V.getOperand(1) ||
21233 !V->isOnlyUserOf(V.getOperand(0).getNode()))
21235 Chain.push_back(V);
21236 V = V.getOperand(0);
21238 switch (V.getOpcode()) {
21240 return SDValue(); // Nothing to combine.
21242 case X86ISD::PSHUFLW:
21243 case X86ISD::PSHUFHW:
21244 if (V.getOpcode() == CombineOp)
21247 Chain.push_back(V);
21251 V = V.getOperand(0);
21255 } while (V.hasOneUse());
21258 // Break out of the loop if we break out of the switch.
21262 if (!V.hasOneUse())
21263 // We fell out of the loop without finding a viable combining instruction.
21266 // Merge this node's mask and our incoming mask.
21267 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21268 for (int &M : Mask)
21270 V = DAG.getNode(V.getOpcode(), DL, V.getValueType(), V.getOperand(0),
21271 getV4X86ShuffleImm8ForMask(Mask, DAG));
21273 // Rebuild the chain around this new shuffle.
21274 while (!Chain.empty()) {
21275 SDValue W = Chain.pop_back_val();
21277 if (V.getValueType() != W.getOperand(0).getValueType())
21278 V = DAG.getNode(ISD::BITCAST, DL, W.getOperand(0).getValueType(), V);
21280 switch (W.getOpcode()) {
21282 llvm_unreachable("Only PSHUF and UNPCK instructions get here!");
21284 case X86ISD::UNPCKL:
21285 case X86ISD::UNPCKH:
21286 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, V);
21289 case X86ISD::PSHUFD:
21290 case X86ISD::PSHUFLW:
21291 case X86ISD::PSHUFHW:
21292 V = DAG.getNode(W.getOpcode(), DL, W.getValueType(), V, W.getOperand(1));
21296 if (V.getValueType() != N.getValueType())
21297 V = DAG.getNode(ISD::BITCAST, DL, N.getValueType(), V);
21299 // Return the new chain to replace N.
21303 /// \brief Search for a combinable shuffle across a chain ending in pshuflw or pshufhw.
21305 /// We walk up the chain, skipping shuffles of the other half and looking
21306 /// through shuffles which switch halves trying to find a shuffle of the same
21307 /// pair of dwords.
21308 static bool combineRedundantHalfShuffle(SDValue N, MutableArrayRef<int> Mask,
21310 TargetLowering::DAGCombinerInfo &DCI) {
21312 (N.getOpcode() == X86ISD::PSHUFLW || N.getOpcode() == X86ISD::PSHUFHW) &&
21313 "Called with something other than an x86 128-bit half shuffle!");
21315 unsigned CombineOpcode = N.getOpcode();
21317 // Walk up a single-use chain looking for a combinable shuffle.
21318 SDValue V = N.getOperand(0);
21319 for (; V.hasOneUse(); V = V.getOperand(0)) {
21320 switch (V.getOpcode()) {
21322 return false; // Nothing combined!
21325 // Skip bitcasts as we always know the type for the target specific
21329 case X86ISD::PSHUFLW:
21330 case X86ISD::PSHUFHW:
21331 if (V.getOpcode() == CombineOpcode)
21334 // Other-half shuffles are no-ops.
21337 // Break out of the loop if we break out of the switch.
21341 if (!V.hasOneUse())
21342 // We fell out of the loop without finding a viable combining instruction.
21345 // Combine away the bottom node as its shuffle will be accumulated into
21346 // a preceding shuffle.
21347 DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21349 // Record the old value.
21352 // Merge this node's mask and our incoming mask (adjusted to account for all
21353 // the pshufd instructions encountered).
21354 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21355 for (int &M : Mask)
21357 V = DAG.getNode(V.getOpcode(), DL, MVT::v8i16, V.getOperand(0),
21358 getV4X86ShuffleImm8ForMask(Mask, DAG));
21360 // Check that the shuffles didn't cancel each other out. If not, we need to
21361 // combine to the new one.
21363 // Replace the combinable shuffle with the combined one, updating all users
21364 // so that we re-evaluate the chain here.
21365 DCI.CombineTo(Old.getNode(), V, /*AddTo*/ true);
21370 /// \brief Try to combine x86 target specific shuffles.
21371 static SDValue PerformTargetShuffleCombine(SDValue N, SelectionDAG &DAG,
21372 TargetLowering::DAGCombinerInfo &DCI,
21373 const X86Subtarget *Subtarget) {
21375 MVT VT = N.getSimpleValueType();
21376 SmallVector<int, 4> Mask;
21378 switch (N.getOpcode()) {
21379 case X86ISD::PSHUFD:
21380 case X86ISD::PSHUFLW:
21381 case X86ISD::PSHUFHW:
21382 Mask = getPSHUFShuffleMask(N);
21383 assert(Mask.size() == 4);
21389 // Nuke no-op shuffles that show up after combining.
21390 if (isNoopShuffleMask(Mask))
21391 return DCI.CombineTo(N.getNode(), N.getOperand(0), /*AddTo*/ true);
21393 // Look for simplifications involving one or two shuffle instructions.
21394 SDValue V = N.getOperand(0);
21395 switch (N.getOpcode()) {
21398 case X86ISD::PSHUFLW:
21399 case X86ISD::PSHUFHW:
21400 assert(VT == MVT::v8i16);
21403 if (combineRedundantHalfShuffle(N, Mask, DAG, DCI))
21404 return SDValue(); // We combined away this shuffle, so we're done.
21406 // See if this reduces to a PSHUFD which is no more expensive and can
21407 // combine with more operations. Note that it has to at least flip the
21408 // dwords as otherwise it would have been removed as a no-op.
21409 if (Mask[0] == 2 && Mask[1] == 3 && Mask[2] == 0 && Mask[3] == 1) {
21410 int DMask[] = {0, 1, 2, 3};
21411 int DOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 2;
21412 DMask[DOffset + 0] = DOffset + 1;
21413 DMask[DOffset + 1] = DOffset + 0;
21414 V = DAG.getNode(ISD::BITCAST, DL, MVT::v4i32, V);
21415 DCI.AddToWorklist(V.getNode());
21416 V = DAG.getNode(X86ISD::PSHUFD, DL, MVT::v4i32, V,
21417 getV4X86ShuffleImm8ForMask(DMask, DAG));
21418 DCI.AddToWorklist(V.getNode());
21419 return DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, V);
21422 // Look for shuffle patterns which can be implemented as a single unpack.
21423 // FIXME: This doesn't handle the location of the PSHUFD generically, and
21424 // only works when we have a PSHUFD followed by two half-shuffles.
21425 if (Mask[0] == Mask[1] && Mask[2] == Mask[3] &&
21426 (V.getOpcode() == X86ISD::PSHUFLW ||
21427 V.getOpcode() == X86ISD::PSHUFHW) &&
21428 V.getOpcode() != N.getOpcode() &&
21430 SDValue D = V.getOperand(0);
21431 while (D.getOpcode() == ISD::BITCAST && D.hasOneUse())
21432 D = D.getOperand(0);
21433 if (D.getOpcode() == X86ISD::PSHUFD && D.hasOneUse()) {
21434 SmallVector<int, 4> VMask = getPSHUFShuffleMask(V);
21435 SmallVector<int, 4> DMask = getPSHUFShuffleMask(D);
21436 int NOffset = N.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21437 int VOffset = V.getOpcode() == X86ISD::PSHUFLW ? 0 : 4;
21439 for (int i = 0; i < 4; ++i) {
21440 WordMask[i + NOffset] = Mask[i] + NOffset;
21441 WordMask[i + VOffset] = VMask[i] + VOffset;
21443 // Map the word mask through the DWord mask.
21445 for (int i = 0; i < 8; ++i)
21446 MappedMask[i] = 2 * DMask[WordMask[i] / 2] + WordMask[i] % 2;
21447 const int UnpackLoMask[] = {0, 0, 1, 1, 2, 2, 3, 3};
21448 const int UnpackHiMask[] = {4, 4, 5, 5, 6, 6, 7, 7};
21449 if (std::equal(std::begin(MappedMask), std::end(MappedMask),
21450 std::begin(UnpackLoMask)) ||
21451 std::equal(std::begin(MappedMask), std::end(MappedMask),
21452 std::begin(UnpackHiMask))) {
21453 // We can replace all three shuffles with an unpack.
21454 V = DAG.getNode(ISD::BITCAST, DL, MVT::v8i16, D.getOperand(0));
21455 DCI.AddToWorklist(V.getNode());
21456 return DAG.getNode(MappedMask[0] == 0 ? X86ISD::UNPCKL
21458 DL, MVT::v8i16, V, V);
21465 case X86ISD::PSHUFD:
21466 if (SDValue NewN = combineRedundantDWordShuffle(N, Mask, DAG, DCI))
21475 /// \brief Try to combine a shuffle into a target-specific add-sub node.
21477 /// We combine this directly on the abstract vector shuffle nodes so it is
21478 /// easier to generically match. We also insert dummy vector shuffle nodes for
21479 /// the operands which explicitly discard the lanes which are unused by this
21480 /// operation to try to flow through the rest of the combiner the fact that
21481 /// they're unused.
21482 static SDValue combineShuffleToAddSub(SDNode *N, SelectionDAG &DAG) {
21484 EVT VT = N->getValueType(0);
21486 // We only handle target-independent shuffles.
21487 // FIXME: It would be easy and harmless to use the target shuffle mask
21488 // extraction tool to support more.
21489 if (N->getOpcode() != ISD::VECTOR_SHUFFLE)
21492 auto *SVN = cast<ShuffleVectorSDNode>(N);
21493 ArrayRef<int> Mask = SVN->getMask();
21494 SDValue V1 = N->getOperand(0);
21495 SDValue V2 = N->getOperand(1);
21497 // We require the first shuffle operand to be the SUB node, and the second to
21498 // be the ADD node.
21499 // FIXME: We should support the commuted patterns.
21500 if (V1->getOpcode() != ISD::FSUB || V2->getOpcode() != ISD::FADD)
21503 // If there are other uses of these operations we can't fold them.
21504 if (!V1->hasOneUse() || !V2->hasOneUse())
21507 // Ensure that both operations have the same operands. Note that we can
21508 // commute the FADD operands.
21509 SDValue LHS = V1->getOperand(0), RHS = V1->getOperand(1);
21510 if ((V2->getOperand(0) != LHS || V2->getOperand(1) != RHS) &&
21511 (V2->getOperand(0) != RHS || V2->getOperand(1) != LHS))
21514 // We're looking for blends between FADD and FSUB nodes. We insist on these
21515 // nodes being lined up in a specific expected pattern.
21516 if (!(isShuffleEquivalent(Mask, 0, 3) ||
21517 isShuffleEquivalent(Mask, 0, 5, 2, 7) ||
21518 isShuffleEquivalent(Mask, 0, 9, 2, 11, 4, 13, 6, 15)))
21521 // Only specific types are legal at this point, assert so we notice if and
21522 // when these change.
21523 assert((VT == MVT::v4f32 || VT == MVT::v2f64 || VT == MVT::v8f32 ||
21524 VT == MVT::v4f64) &&
21525 "Unknown vector type encountered!");
21527 return DAG.getNode(X86ISD::ADDSUB, DL, VT, LHS, RHS);
21530 /// PerformShuffleCombine - Performs several different shuffle combines.
21531 static SDValue PerformShuffleCombine(SDNode *N, SelectionDAG &DAG,
21532 TargetLowering::DAGCombinerInfo &DCI,
21533 const X86Subtarget *Subtarget) {
21535 SDValue N0 = N->getOperand(0);
21536 SDValue N1 = N->getOperand(1);
21537 EVT VT = N->getValueType(0);
21539 // Don't create instructions with illegal types after legalize types has run.
21540 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21541 if (!DCI.isBeforeLegalize() && !TLI.isTypeLegal(VT.getVectorElementType()))
21544 // If we have legalized the vector types, look for blends of FADD and FSUB
21545 // nodes that we can fuse into an ADDSUB node.
21546 if (TLI.isTypeLegal(VT) && Subtarget->hasSSE3())
21547 if (SDValue AddSub = combineShuffleToAddSub(N, DAG))
21550 // Combine 256-bit vector shuffles. This is only profitable when in AVX mode
21551 if (Subtarget->hasFp256() && VT.is256BitVector() &&
21552 N->getOpcode() == ISD::VECTOR_SHUFFLE)
21553 return PerformShuffleCombine256(N, DAG, DCI, Subtarget);
21555 // During Type Legalization, when promoting illegal vector types,
21556 // the backend might introduce new shuffle dag nodes and bitcasts.
21558 // This code performs the following transformation:
21559 // fold: (shuffle (bitcast (BINOP A, B)), Undef, <Mask>) ->
21560 // (shuffle (BINOP (bitcast A), (bitcast B)), Undef, <Mask>)
21562 // We do this only if both the bitcast and the BINOP dag nodes have
21563 // one use. Also, perform this transformation only if the new binary
21564 // operation is legal. This is to avoid introducing dag nodes that
21565 // potentially need to be further expanded (or custom lowered) into a
21566 // less optimal sequence of dag nodes.
21567 if (!DCI.isBeforeLegalize() && DCI.isBeforeLegalizeOps() &&
21568 N1.getOpcode() == ISD::UNDEF && N0.hasOneUse() &&
21569 N0.getOpcode() == ISD::BITCAST) {
21570 SDValue BC0 = N0.getOperand(0);
21571 EVT SVT = BC0.getValueType();
21572 unsigned Opcode = BC0.getOpcode();
21573 unsigned NumElts = VT.getVectorNumElements();
21575 if (BC0.hasOneUse() && SVT.isVector() &&
21576 SVT.getVectorNumElements() * 2 == NumElts &&
21577 TLI.isOperationLegal(Opcode, VT)) {
21578 bool CanFold = false;
21590 unsigned SVTNumElts = SVT.getVectorNumElements();
21591 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(N);
21592 for (unsigned i = 0, e = SVTNumElts; i != e && CanFold; ++i)
21593 CanFold = SVOp->getMaskElt(i) == (int)(i * 2);
21594 for (unsigned i = SVTNumElts, e = NumElts; i != e && CanFold; ++i)
21595 CanFold = SVOp->getMaskElt(i) < 0;
21598 SDValue BC00 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(0));
21599 SDValue BC01 = DAG.getNode(ISD::BITCAST, dl, VT, BC0.getOperand(1));
21600 SDValue NewBinOp = DAG.getNode(BC0.getOpcode(), dl, VT, BC00, BC01);
21601 return DAG.getVectorShuffle(VT, dl, NewBinOp, N1, &SVOp->getMask()[0]);
21606 // Only handle 128 wide vector from here on.
21607 if (!VT.is128BitVector())
21610 // Combine a vector_shuffle that is equal to build_vector load1, load2, load3,
21611 // load4, <0, 1, 2, 3> into a 128-bit load if the load addresses are
21612 // consecutive, non-overlapping, and in the right order.
21613 SmallVector<SDValue, 16> Elts;
21614 for (unsigned i = 0, e = VT.getVectorNumElements(); i != e; ++i)
21615 Elts.push_back(getShuffleScalarElt(N, i, DAG, 0));
21617 SDValue LD = EltsFromConsecutiveLoads(VT, Elts, dl, DAG, true);
21621 if (isTargetShuffle(N->getOpcode())) {
21623 PerformTargetShuffleCombine(SDValue(N, 0), DAG, DCI, Subtarget);
21624 if (Shuffle.getNode())
21627 // Try recursively combining arbitrary sequences of x86 shuffle
21628 // instructions into higher-order shuffles. We do this after combining
21629 // specific PSHUF instruction sequences into their minimal form so that we
21630 // can evaluate how many specialized shuffle instructions are involved in
21631 // a particular chain.
21632 SmallVector<int, 1> NonceMask; // Just a placeholder.
21633 NonceMask.push_back(0);
21634 if (combineX86ShufflesRecursively(SDValue(N, 0), SDValue(N, 0), NonceMask,
21635 /*Depth*/ 1, /*HasPSHUFB*/ false, DAG,
21637 return SDValue(); // This routine will use CombineTo to replace N.
21643 /// PerformTruncateCombine - Converts truncate operation to
21644 /// a sequence of vector shuffle operations.
21645 /// It is possible when we truncate 256-bit vector to 128-bit vector
21646 static SDValue PerformTruncateCombine(SDNode *N, SelectionDAG &DAG,
21647 TargetLowering::DAGCombinerInfo &DCI,
21648 const X86Subtarget *Subtarget) {
21652 /// XFormVExtractWithShuffleIntoLoad - Check if a vector extract from a target
21653 /// specific shuffle of a load can be folded into a single element load.
21654 /// Similar handling for VECTOR_SHUFFLE is performed by DAGCombiner, but
21655 /// shuffles have been customed lowered so we need to handle those here.
21656 static SDValue XFormVExtractWithShuffleIntoLoad(SDNode *N, SelectionDAG &DAG,
21657 TargetLowering::DAGCombinerInfo &DCI) {
21658 if (DCI.isBeforeLegalizeOps())
21661 SDValue InVec = N->getOperand(0);
21662 SDValue EltNo = N->getOperand(1);
21664 if (!isa<ConstantSDNode>(EltNo))
21667 EVT VT = InVec.getValueType();
21669 if (InVec.getOpcode() == ISD::BITCAST) {
21670 // Don't duplicate a load with other uses.
21671 if (!InVec.hasOneUse())
21673 EVT BCVT = InVec.getOperand(0).getValueType();
21674 if (BCVT.getVectorNumElements() != VT.getVectorNumElements())
21676 InVec = InVec.getOperand(0);
21679 if (!isTargetShuffle(InVec.getOpcode()))
21682 // Don't duplicate a load with other uses.
21683 if (!InVec.hasOneUse())
21686 SmallVector<int, 16> ShuffleMask;
21688 if (!getTargetShuffleMask(InVec.getNode(), VT.getSimpleVT(), ShuffleMask,
21692 // Select the input vector, guarding against out of range extract vector.
21693 unsigned NumElems = VT.getVectorNumElements();
21694 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
21695 int Idx = (Elt > (int)NumElems) ? -1 : ShuffleMask[Elt];
21696 SDValue LdNode = (Idx < (int)NumElems) ? InVec.getOperand(0)
21697 : InVec.getOperand(1);
21699 // If inputs to shuffle are the same for both ops, then allow 2 uses
21700 unsigned AllowedUses = InVec.getOperand(0) == InVec.getOperand(1) ? 2 : 1;
21702 if (LdNode.getOpcode() == ISD::BITCAST) {
21703 // Don't duplicate a load with other uses.
21704 if (!LdNode.getNode()->hasNUsesOfValue(AllowedUses, 0))
21707 AllowedUses = 1; // only allow 1 load use if we have a bitcast
21708 LdNode = LdNode.getOperand(0);
21711 if (!ISD::isNormalLoad(LdNode.getNode()))
21714 LoadSDNode *LN0 = cast<LoadSDNode>(LdNode);
21716 if (!LN0 ||!LN0->hasNUsesOfValue(AllowedUses, 0) || LN0->isVolatile())
21719 EVT EltVT = N->getValueType(0);
21720 // If there's a bitcast before the shuffle, check if the load type and
21721 // alignment is valid.
21722 unsigned Align = LN0->getAlignment();
21723 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21724 unsigned NewAlign = TLI.getDataLayout()->getABITypeAlignment(
21725 EltVT.getTypeForEVT(*DAG.getContext()));
21727 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, EltVT))
21730 // All checks match so transform back to vector_shuffle so that DAG combiner
21731 // can finish the job
21734 // Create shuffle node taking into account the case that its a unary shuffle
21735 SDValue Shuffle = (UnaryShuffle) ? DAG.getUNDEF(VT) : InVec.getOperand(1);
21736 Shuffle = DAG.getVectorShuffle(InVec.getValueType(), dl,
21737 InVec.getOperand(0), Shuffle,
21739 Shuffle = DAG.getNode(ISD::BITCAST, dl, VT, Shuffle);
21740 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, N->getValueType(0), Shuffle,
21744 /// PerformEXTRACT_VECTOR_ELTCombine - Detect vector gather/scatter index
21745 /// generation and convert it from being a bunch of shuffles and extracts
21746 /// to a simple store and scalar loads to extract the elements.
21747 static SDValue PerformEXTRACT_VECTOR_ELTCombine(SDNode *N, SelectionDAG &DAG,
21748 TargetLowering::DAGCombinerInfo &DCI) {
21749 SDValue NewOp = XFormVExtractWithShuffleIntoLoad(N, DAG, DCI);
21750 if (NewOp.getNode())
21753 SDValue InputVector = N->getOperand(0);
21755 // Detect whether we are trying to convert from mmx to i32 and the bitcast
21756 // from mmx to v2i32 has a single usage.
21757 if (InputVector.getNode()->getOpcode() == llvm::ISD::BITCAST &&
21758 InputVector.getNode()->getOperand(0).getValueType() == MVT::x86mmx &&
21759 InputVector.hasOneUse() && N->getValueType(0) == MVT::i32)
21760 return DAG.getNode(X86ISD::MMX_MOVD2W, SDLoc(InputVector),
21761 N->getValueType(0),
21762 InputVector.getNode()->getOperand(0));
21764 // Only operate on vectors of 4 elements, where the alternative shuffling
21765 // gets to be more expensive.
21766 if (InputVector.getValueType() != MVT::v4i32)
21769 // Check whether every use of InputVector is an EXTRACT_VECTOR_ELT with a
21770 // single use which is a sign-extend or zero-extend, and all elements are
21772 SmallVector<SDNode *, 4> Uses;
21773 unsigned ExtractedElements = 0;
21774 for (SDNode::use_iterator UI = InputVector.getNode()->use_begin(),
21775 UE = InputVector.getNode()->use_end(); UI != UE; ++UI) {
21776 if (UI.getUse().getResNo() != InputVector.getResNo())
21779 SDNode *Extract = *UI;
21780 if (Extract->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
21783 if (Extract->getValueType(0) != MVT::i32)
21785 if (!Extract->hasOneUse())
21787 if (Extract->use_begin()->getOpcode() != ISD::SIGN_EXTEND &&
21788 Extract->use_begin()->getOpcode() != ISD::ZERO_EXTEND)
21790 if (!isa<ConstantSDNode>(Extract->getOperand(1)))
21793 // Record which element was extracted.
21794 ExtractedElements |=
21795 1 << cast<ConstantSDNode>(Extract->getOperand(1))->getZExtValue();
21797 Uses.push_back(Extract);
21800 // If not all the elements were used, this may not be worthwhile.
21801 if (ExtractedElements != 15)
21804 // Ok, we've now decided to do the transformation.
21805 SDLoc dl(InputVector);
21807 // Store the value to a temporary stack slot.
21808 SDValue StackPtr = DAG.CreateStackTemporary(InputVector.getValueType());
21809 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, InputVector, StackPtr,
21810 MachinePointerInfo(), false, false, 0);
21812 // Replace each use (extract) with a load of the appropriate element.
21813 for (SmallVectorImpl<SDNode *>::iterator UI = Uses.begin(),
21814 UE = Uses.end(); UI != UE; ++UI) {
21815 SDNode *Extract = *UI;
21817 // cOMpute the element's address.
21818 SDValue Idx = Extract->getOperand(1);
21820 InputVector.getValueType().getVectorElementType().getSizeInBits()/8;
21821 uint64_t Offset = EltSize * cast<ConstantSDNode>(Idx)->getZExtValue();
21822 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21823 SDValue OffsetVal = DAG.getConstant(Offset, TLI.getPointerTy());
21825 SDValue ScalarAddr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(),
21826 StackPtr, OffsetVal);
21828 // Load the scalar.
21829 SDValue LoadScalar = DAG.getLoad(Extract->getValueType(0), dl, Ch,
21830 ScalarAddr, MachinePointerInfo(),
21831 false, false, false, 0);
21833 // Replace the exact with the load.
21834 DAG.ReplaceAllUsesOfValueWith(SDValue(Extract, 0), LoadScalar);
21837 // The replacement was made in place; don't return anything.
21841 /// \brief Matches a VSELECT onto min/max or return 0 if the node doesn't match.
21842 static std::pair<unsigned, bool>
21843 matchIntegerMINMAX(SDValue Cond, EVT VT, SDValue LHS, SDValue RHS,
21844 SelectionDAG &DAG, const X86Subtarget *Subtarget) {
21845 if (!VT.isVector())
21846 return std::make_pair(0, false);
21848 bool NeedSplit = false;
21849 switch (VT.getSimpleVT().SimpleTy) {
21850 default: return std::make_pair(0, false);
21854 if (!Subtarget->hasAVX2())
21856 if (!Subtarget->hasAVX())
21857 return std::make_pair(0, false);
21862 if (!Subtarget->hasSSE2())
21863 return std::make_pair(0, false);
21866 // SSE2 has only a small subset of the operations.
21867 bool hasUnsigned = Subtarget->hasSSE41() ||
21868 (Subtarget->hasSSE2() && VT == MVT::v16i8);
21869 bool hasSigned = Subtarget->hasSSE41() ||
21870 (Subtarget->hasSSE2() && VT == MVT::v8i16);
21872 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21875 // Check for x CC y ? x : y.
21876 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21877 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21882 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21885 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21888 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21891 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21893 // Check for x CC y ? y : x -- a min/max with reversed arms.
21894 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
21895 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
21900 Opc = hasUnsigned ? X86ISD::UMAX : 0; break;
21903 Opc = hasUnsigned ? X86ISD::UMIN : 0; break;
21906 Opc = hasSigned ? X86ISD::SMAX : 0; break;
21909 Opc = hasSigned ? X86ISD::SMIN : 0; break;
21913 return std::make_pair(Opc, NeedSplit);
21917 TransformVSELECTtoBlendVECTOR_SHUFFLE(SDNode *N, SelectionDAG &DAG,
21918 const X86Subtarget *Subtarget) {
21920 SDValue Cond = N->getOperand(0);
21921 SDValue LHS = N->getOperand(1);
21922 SDValue RHS = N->getOperand(2);
21924 if (Cond.getOpcode() == ISD::SIGN_EXTEND) {
21925 SDValue CondSrc = Cond->getOperand(0);
21926 if (CondSrc->getOpcode() == ISD::SIGN_EXTEND_INREG)
21927 Cond = CondSrc->getOperand(0);
21930 MVT VT = N->getSimpleValueType(0);
21931 MVT EltVT = VT.getVectorElementType();
21932 unsigned NumElems = VT.getVectorNumElements();
21933 // There is no blend with immediate in AVX-512.
21934 if (VT.is512BitVector())
21937 if (!Subtarget->hasSSE41() || EltVT == MVT::i8)
21939 if (!Subtarget->hasInt256() && VT == MVT::v16i16)
21942 if (!ISD::isBuildVectorOfConstantSDNodes(Cond.getNode()))
21945 // A vselect where all conditions and data are constants can be optimized into
21946 // a single vector load by SelectionDAGLegalize::ExpandBUILD_VECTOR().
21947 if (ISD::isBuildVectorOfConstantSDNodes(LHS.getNode()) &&
21948 ISD::isBuildVectorOfConstantSDNodes(RHS.getNode()))
21951 unsigned MaskValue = 0;
21952 if (!BUILD_VECTORtoBlendMask(cast<BuildVectorSDNode>(Cond), MaskValue))
21955 SmallVector<int, 8> ShuffleMask(NumElems, -1);
21956 for (unsigned i = 0; i < NumElems; ++i) {
21957 // Be sure we emit undef where we can.
21958 if (Cond.getOperand(i)->getOpcode() == ISD::UNDEF)
21959 ShuffleMask[i] = -1;
21961 ShuffleMask[i] = i + NumElems * ((MaskValue >> i) & 1);
21964 return DAG.getVectorShuffle(VT, dl, LHS, RHS, &ShuffleMask[0]);
21967 /// PerformSELECTCombine - Do target-specific dag combines on SELECT and VSELECT
21969 static SDValue PerformSELECTCombine(SDNode *N, SelectionDAG &DAG,
21970 TargetLowering::DAGCombinerInfo &DCI,
21971 const X86Subtarget *Subtarget) {
21973 SDValue Cond = N->getOperand(0);
21974 // Get the LHS/RHS of the select.
21975 SDValue LHS = N->getOperand(1);
21976 SDValue RHS = N->getOperand(2);
21977 EVT VT = LHS.getValueType();
21978 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
21980 // If we have SSE[12] support, try to form min/max nodes. SSE min/max
21981 // instructions match the semantics of the common C idiom x<y?x:y but not
21982 // x<=y?x:y, because of how they handle negative zero (which can be
21983 // ignored in unsafe-math mode).
21984 if (Cond.getOpcode() == ISD::SETCC && VT.isFloatingPoint() &&
21985 VT != MVT::f80 && TLI.isTypeLegal(VT) &&
21986 (Subtarget->hasSSE2() ||
21987 (Subtarget->hasSSE1() && VT.getScalarType() == MVT::f32))) {
21988 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
21990 unsigned Opcode = 0;
21991 // Check for x CC y ? x : y.
21992 if (DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
21993 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
21997 // Converting this to a min would handle NaNs incorrectly, and swapping
21998 // the operands would cause it to handle comparisons between positive
21999 // and negative zero incorrectly.
22000 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
22001 if (!DAG.getTarget().Options.UnsafeFPMath &&
22002 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
22004 std::swap(LHS, RHS);
22006 Opcode = X86ISD::FMIN;
22009 // Converting this to a min would handle comparisons between positive
22010 // and negative zero incorrectly.
22011 if (!DAG.getTarget().Options.UnsafeFPMath &&
22012 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
22014 Opcode = X86ISD::FMIN;
22017 // Converting this to a min would handle both negative zeros and NaNs
22018 // incorrectly, but we can swap the operands to fix both.
22019 std::swap(LHS, RHS);
22023 Opcode = X86ISD::FMIN;
22027 // Converting this to a max would handle comparisons between positive
22028 // and negative zero incorrectly.
22029 if (!DAG.getTarget().Options.UnsafeFPMath &&
22030 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS))
22032 Opcode = X86ISD::FMAX;
22035 // Converting this to a max would handle NaNs incorrectly, and swapping
22036 // the operands would cause it to handle comparisons between positive
22037 // and negative zero incorrectly.
22038 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)) {
22039 if (!DAG.getTarget().Options.UnsafeFPMath &&
22040 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
22042 std::swap(LHS, RHS);
22044 Opcode = X86ISD::FMAX;
22047 // Converting this to a max would handle both negative zeros and NaNs
22048 // incorrectly, but we can swap the operands to fix both.
22049 std::swap(LHS, RHS);
22053 Opcode = X86ISD::FMAX;
22056 // Check for x CC y ? y : x -- a min/max with reversed arms.
22057 } else if (DAG.isEqualTo(LHS, Cond.getOperand(1)) &&
22058 DAG.isEqualTo(RHS, Cond.getOperand(0))) {
22062 // Converting this to a min would handle comparisons between positive
22063 // and negative zero incorrectly, and swapping the operands would
22064 // cause it to handle NaNs incorrectly.
22065 if (!DAG.getTarget().Options.UnsafeFPMath &&
22066 !(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS))) {
22067 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22069 std::swap(LHS, RHS);
22071 Opcode = X86ISD::FMIN;
22074 // Converting this to a min would handle NaNs incorrectly.
22075 if (!DAG.getTarget().Options.UnsafeFPMath &&
22076 (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS)))
22078 Opcode = X86ISD::FMIN;
22081 // Converting this to a min would handle both negative zeros and NaNs
22082 // incorrectly, but we can swap the operands to fix both.
22083 std::swap(LHS, RHS);
22087 Opcode = X86ISD::FMIN;
22091 // Converting this to a max would handle NaNs incorrectly.
22092 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22094 Opcode = X86ISD::FMAX;
22097 // Converting this to a max would handle comparisons between positive
22098 // and negative zero incorrectly, and swapping the operands would
22099 // cause it to handle NaNs incorrectly.
22100 if (!DAG.getTarget().Options.UnsafeFPMath &&
22101 !DAG.isKnownNeverZero(LHS) && !DAG.isKnownNeverZero(RHS)) {
22102 if (!DAG.isKnownNeverNaN(LHS) || !DAG.isKnownNeverNaN(RHS))
22104 std::swap(LHS, RHS);
22106 Opcode = X86ISD::FMAX;
22109 // Converting this to a max would handle both negative zeros and NaNs
22110 // incorrectly, but we can swap the operands to fix both.
22111 std::swap(LHS, RHS);
22115 Opcode = X86ISD::FMAX;
22121 return DAG.getNode(Opcode, DL, N->getValueType(0), LHS, RHS);
22124 EVT CondVT = Cond.getValueType();
22125 if (Subtarget->hasAVX512() && VT.isVector() && CondVT.isVector() &&
22126 CondVT.getVectorElementType() == MVT::i1) {
22127 // v16i8 (select v16i1, v16i8, v16i8) does not have a proper
22128 // lowering on KNL. In this case we convert it to
22129 // v16i8 (select v16i8, v16i8, v16i8) and use AVX instruction.
22130 // The same situation for all 128 and 256-bit vectors of i8 and i16.
22131 // Since SKX these selects have a proper lowering.
22132 EVT OpVT = LHS.getValueType();
22133 if ((OpVT.is128BitVector() || OpVT.is256BitVector()) &&
22134 (OpVT.getVectorElementType() == MVT::i8 ||
22135 OpVT.getVectorElementType() == MVT::i16) &&
22136 !(Subtarget->hasBWI() && Subtarget->hasVLX())) {
22137 Cond = DAG.getNode(ISD::SIGN_EXTEND, DL, OpVT, Cond);
22138 DCI.AddToWorklist(Cond.getNode());
22139 return DAG.getNode(N->getOpcode(), DL, OpVT, Cond, LHS, RHS);
22142 // If this is a select between two integer constants, try to do some
22144 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(LHS)) {
22145 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(RHS))
22146 // Don't do this for crazy integer types.
22147 if (DAG.getTargetLoweringInfo().isTypeLegal(LHS.getValueType())) {
22148 // If this is efficiently invertible, canonicalize the LHSC/RHSC values
22149 // so that TrueC (the true value) is larger than FalseC.
22150 bool NeedsCondInvert = false;
22152 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue()) &&
22153 // Efficiently invertible.
22154 (Cond.getOpcode() == ISD::SETCC || // setcc -> invertible.
22155 (Cond.getOpcode() == ISD::XOR && // xor(X, C) -> invertible.
22156 isa<ConstantSDNode>(Cond.getOperand(1))))) {
22157 NeedsCondInvert = true;
22158 std::swap(TrueC, FalseC);
22161 // Optimize C ? 8 : 0 -> zext(C) << 3. Likewise for any pow2/0.
22162 if (FalseC->getAPIntValue() == 0 &&
22163 TrueC->getAPIntValue().isPowerOf2()) {
22164 if (NeedsCondInvert) // Invert the condition if needed.
22165 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22166 DAG.getConstant(1, Cond.getValueType()));
22168 // Zero extend the condition if needed.
22169 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, LHS.getValueType(), Cond);
22171 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22172 return DAG.getNode(ISD::SHL, DL, LHS.getValueType(), Cond,
22173 DAG.getConstant(ShAmt, MVT::i8));
22176 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst.
22177 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22178 if (NeedsCondInvert) // Invert the condition if needed.
22179 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22180 DAG.getConstant(1, Cond.getValueType()));
22182 // Zero extend the condition if needed.
22183 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22184 FalseC->getValueType(0), Cond);
22185 return DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22186 SDValue(FalseC, 0));
22189 // Optimize cases that will turn into an LEA instruction. This requires
22190 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22191 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22192 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22193 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22195 bool isFastMultiplier = false;
22197 switch ((unsigned char)Diff) {
22199 case 1: // result = add base, cond
22200 case 2: // result = lea base( , cond*2)
22201 case 3: // result = lea base(cond, cond*2)
22202 case 4: // result = lea base( , cond*4)
22203 case 5: // result = lea base(cond, cond*4)
22204 case 8: // result = lea base( , cond*8)
22205 case 9: // result = lea base(cond, cond*8)
22206 isFastMultiplier = true;
22211 if (isFastMultiplier) {
22212 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22213 if (NeedsCondInvert) // Invert the condition if needed.
22214 Cond = DAG.getNode(ISD::XOR, DL, Cond.getValueType(), Cond,
22215 DAG.getConstant(1, Cond.getValueType()));
22217 // Zero extend the condition if needed.
22218 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22220 // Scale the condition by the difference.
22222 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22223 DAG.getConstant(Diff, Cond.getValueType()));
22225 // Add the base if non-zero.
22226 if (FalseC->getAPIntValue() != 0)
22227 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22228 SDValue(FalseC, 0));
22235 // Canonicalize max and min:
22236 // (x > y) ? x : y -> (x >= y) ? x : y
22237 // (x < y) ? x : y -> (x <= y) ? x : y
22238 // This allows use of COND_S / COND_NS (see TranslateX86CC) which eliminates
22239 // the need for an extra compare
22240 // against zero. e.g.
22241 // (x - y) > 0 : (x - y) ? 0 -> (x - y) >= 0 : (x - y) ? 0
22243 // testl %edi, %edi
22245 // cmovgl %edi, %eax
22249 // cmovsl %eax, %edi
22250 if (N->getOpcode() == ISD::SELECT && Cond.getOpcode() == ISD::SETCC &&
22251 DAG.isEqualTo(LHS, Cond.getOperand(0)) &&
22252 DAG.isEqualTo(RHS, Cond.getOperand(1))) {
22253 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22258 ISD::CondCode NewCC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGE;
22259 Cond = DAG.getSetCC(SDLoc(Cond), Cond.getValueType(),
22260 Cond.getOperand(0), Cond.getOperand(1), NewCC);
22261 return DAG.getNode(ISD::SELECT, DL, VT, Cond, LHS, RHS);
22266 // Early exit check
22267 if (!TLI.isTypeLegal(VT))
22270 // Match VSELECTs into subs with unsigned saturation.
22271 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22272 // psubus is available in SSE2 and AVX2 for i8 and i16 vectors.
22273 ((Subtarget->hasSSE2() && (VT == MVT::v16i8 || VT == MVT::v8i16)) ||
22274 (Subtarget->hasAVX2() && (VT == MVT::v32i8 || VT == MVT::v16i16)))) {
22275 ISD::CondCode CC = cast<CondCodeSDNode>(Cond.getOperand(2))->get();
22277 // Check if one of the arms of the VSELECT is a zero vector. If it's on the
22278 // left side invert the predicate to simplify logic below.
22280 if (ISD::isBuildVectorAllZeros(LHS.getNode())) {
22282 CC = ISD::getSetCCInverse(CC, true);
22283 } else if (ISD::isBuildVectorAllZeros(RHS.getNode())) {
22287 if (Other.getNode() && Other->getNumOperands() == 2 &&
22288 DAG.isEqualTo(Other->getOperand(0), Cond.getOperand(0))) {
22289 SDValue OpLHS = Other->getOperand(0), OpRHS = Other->getOperand(1);
22290 SDValue CondRHS = Cond->getOperand(1);
22292 // Look for a general sub with unsigned saturation first.
22293 // x >= y ? x-y : 0 --> subus x, y
22294 // x > y ? x-y : 0 --> subus x, y
22295 if ((CC == ISD::SETUGE || CC == ISD::SETUGT) &&
22296 Other->getOpcode() == ISD::SUB && DAG.isEqualTo(OpRHS, CondRHS))
22297 return DAG.getNode(X86ISD::SUBUS, DL, VT, OpLHS, OpRHS);
22299 if (auto *OpRHSBV = dyn_cast<BuildVectorSDNode>(OpRHS))
22300 if (auto *OpRHSConst = OpRHSBV->getConstantSplatNode()) {
22301 if (auto *CondRHSBV = dyn_cast<BuildVectorSDNode>(CondRHS))
22302 if (auto *CondRHSConst = CondRHSBV->getConstantSplatNode())
22303 // If the RHS is a constant we have to reverse the const
22304 // canonicalization.
22305 // x > C-1 ? x+-C : 0 --> subus x, C
22306 if (CC == ISD::SETUGT && Other->getOpcode() == ISD::ADD &&
22307 CondRHSConst->getAPIntValue() ==
22308 (-OpRHSConst->getAPIntValue() - 1))
22309 return DAG.getNode(
22310 X86ISD::SUBUS, DL, VT, OpLHS,
22311 DAG.getConstant(-OpRHSConst->getAPIntValue(), VT));
22313 // Another special case: If C was a sign bit, the sub has been
22314 // canonicalized into a xor.
22315 // FIXME: Would it be better to use computeKnownBits to determine
22316 // whether it's safe to decanonicalize the xor?
22317 // x s< 0 ? x^C : 0 --> subus x, C
22318 if (CC == ISD::SETLT && Other->getOpcode() == ISD::XOR &&
22319 ISD::isBuildVectorAllZeros(CondRHS.getNode()) &&
22320 OpRHSConst->getAPIntValue().isSignBit())
22321 // Note that we have to rebuild the RHS constant here to ensure we
22322 // don't rely on particular values of undef lanes.
22323 return DAG.getNode(
22324 X86ISD::SUBUS, DL, VT, OpLHS,
22325 DAG.getConstant(OpRHSConst->getAPIntValue(), VT));
22330 // Try to match a min/max vector operation.
22331 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC) {
22332 std::pair<unsigned, bool> ret = matchIntegerMINMAX(Cond, VT, LHS, RHS, DAG, Subtarget);
22333 unsigned Opc = ret.first;
22334 bool NeedSplit = ret.second;
22336 if (Opc && NeedSplit) {
22337 unsigned NumElems = VT.getVectorNumElements();
22338 // Extract the LHS vectors
22339 SDValue LHS1 = Extract128BitVector(LHS, 0, DAG, DL);
22340 SDValue LHS2 = Extract128BitVector(LHS, NumElems/2, DAG, DL);
22342 // Extract the RHS vectors
22343 SDValue RHS1 = Extract128BitVector(RHS, 0, DAG, DL);
22344 SDValue RHS2 = Extract128BitVector(RHS, NumElems/2, DAG, DL);
22346 // Create min/max for each subvector
22347 LHS = DAG.getNode(Opc, DL, LHS1.getValueType(), LHS1, RHS1);
22348 RHS = DAG.getNode(Opc, DL, LHS2.getValueType(), LHS2, RHS2);
22350 // Merge the result
22351 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, LHS, RHS);
22353 return DAG.getNode(Opc, DL, VT, LHS, RHS);
22356 // Simplify vector selection if the selector will be produced by CMPP*/PCMP*.
22357 if (N->getOpcode() == ISD::VSELECT && Cond.getOpcode() == ISD::SETCC &&
22358 // Check if SETCC has already been promoted
22359 TLI.getSetCCResultType(*DAG.getContext(), VT) == CondVT &&
22360 // Check that condition value type matches vselect operand type
22363 assert(Cond.getValueType().isVector() &&
22364 "vector select expects a vector selector!");
22366 bool TValIsAllOnes = ISD::isBuildVectorAllOnes(LHS.getNode());
22367 bool FValIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
22369 if (!TValIsAllOnes && !FValIsAllZeros) {
22370 // Try invert the condition if true value is not all 1s and false value
22372 bool TValIsAllZeros = ISD::isBuildVectorAllZeros(LHS.getNode());
22373 bool FValIsAllOnes = ISD::isBuildVectorAllOnes(RHS.getNode());
22375 if (TValIsAllZeros || FValIsAllOnes) {
22376 SDValue CC = Cond.getOperand(2);
22377 ISD::CondCode NewCC =
22378 ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
22379 Cond.getOperand(0).getValueType().isInteger());
22380 Cond = DAG.getSetCC(DL, CondVT, Cond.getOperand(0), Cond.getOperand(1), NewCC);
22381 std::swap(LHS, RHS);
22382 TValIsAllOnes = FValIsAllOnes;
22383 FValIsAllZeros = TValIsAllZeros;
22387 if (TValIsAllOnes || FValIsAllZeros) {
22390 if (TValIsAllOnes && FValIsAllZeros)
22392 else if (TValIsAllOnes)
22393 Ret = DAG.getNode(ISD::OR, DL, CondVT, Cond,
22394 DAG.getNode(ISD::BITCAST, DL, CondVT, RHS));
22395 else if (FValIsAllZeros)
22396 Ret = DAG.getNode(ISD::AND, DL, CondVT, Cond,
22397 DAG.getNode(ISD::BITCAST, DL, CondVT, LHS));
22399 return DAG.getNode(ISD::BITCAST, DL, VT, Ret);
22403 // Try to fold this VSELECT into a MOVSS/MOVSD
22404 if (N->getOpcode() == ISD::VSELECT &&
22405 Cond.getOpcode() == ISD::BUILD_VECTOR && !DCI.isBeforeLegalize()) {
22406 if (VT == MVT::v4i32 || VT == MVT::v4f32 ||
22407 (Subtarget->hasSSE2() && (VT == MVT::v2i64 || VT == MVT::v2f64))) {
22408 bool CanFold = false;
22409 unsigned NumElems = Cond.getNumOperands();
22413 if (isZero(Cond.getOperand(0))) {
22416 // fold (vselect <0,-1,-1,-1>, A, B) -> (movss A, B)
22417 // fold (vselect <0,-1> -> (movsd A, B)
22418 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22419 CanFold = isAllOnes(Cond.getOperand(i));
22420 } else if (isAllOnes(Cond.getOperand(0))) {
22424 // fold (vselect <-1,0,0,0>, A, B) -> (movss B, A)
22425 // fold (vselect <-1,0> -> (movsd B, A)
22426 for (unsigned i = 1, e = NumElems; i != e && CanFold; ++i)
22427 CanFold = isZero(Cond.getOperand(i));
22431 if (VT == MVT::v4i32 || VT == MVT::v4f32)
22432 return getTargetShuffleNode(X86ISD::MOVSS, DL, VT, A, B, DAG);
22433 return getTargetShuffleNode(X86ISD::MOVSD, DL, VT, A, B, DAG);
22436 if (Subtarget->hasSSE2() && (VT == MVT::v4i32 || VT == MVT::v4f32)) {
22437 // fold (v4i32: vselect <0,0,-1,-1>, A, B) ->
22438 // (v4i32 (bitcast (movsd (v2i64 (bitcast A)),
22439 // (v2i64 (bitcast B)))))
22441 // fold (v4f32: vselect <0,0,-1,-1>, A, B) ->
22442 // (v4f32 (bitcast (movsd (v2f64 (bitcast A)),
22443 // (v2f64 (bitcast B)))))
22445 // fold (v4i32: vselect <-1,-1,0,0>, A, B) ->
22446 // (v4i32 (bitcast (movsd (v2i64 (bitcast B)),
22447 // (v2i64 (bitcast A)))))
22449 // fold (v4f32: vselect <-1,-1,0,0>, A, B) ->
22450 // (v4f32 (bitcast (movsd (v2f64 (bitcast B)),
22451 // (v2f64 (bitcast A)))))
22453 CanFold = (isZero(Cond.getOperand(0)) &&
22454 isZero(Cond.getOperand(1)) &&
22455 isAllOnes(Cond.getOperand(2)) &&
22456 isAllOnes(Cond.getOperand(3)));
22458 if (!CanFold && isAllOnes(Cond.getOperand(0)) &&
22459 isAllOnes(Cond.getOperand(1)) &&
22460 isZero(Cond.getOperand(2)) &&
22461 isZero(Cond.getOperand(3))) {
22463 std::swap(LHS, RHS);
22467 EVT NVT = (VT == MVT::v4i32) ? MVT::v2i64 : MVT::v2f64;
22468 SDValue NewA = DAG.getNode(ISD::BITCAST, DL, NVT, LHS);
22469 SDValue NewB = DAG.getNode(ISD::BITCAST, DL, NVT, RHS);
22470 SDValue Select = getTargetShuffleNode(X86ISD::MOVSD, DL, NVT, NewA,
22472 return DAG.getNode(ISD::BITCAST, DL, VT, Select);
22478 // If we know that this node is legal then we know that it is going to be
22479 // matched by one of the SSE/AVX BLEND instructions. These instructions only
22480 // depend on the highest bit in each word. Try to use SimplifyDemandedBits
22481 // to simplify previous instructions.
22482 if (N->getOpcode() == ISD::VSELECT && DCI.isBeforeLegalizeOps() &&
22483 !DCI.isBeforeLegalize() &&
22484 // We explicitly check against v8i16 and v16i16 because, although
22485 // they're marked as Custom, they might only be legal when Cond is a
22486 // build_vector of constants. This will be taken care in a later
22488 (TLI.isOperationLegalOrCustom(ISD::VSELECT, VT) && VT != MVT::v16i16 &&
22489 VT != MVT::v8i16)) {
22490 unsigned BitWidth = Cond.getValueType().getScalarType().getSizeInBits();
22492 // Don't optimize vector selects that map to mask-registers.
22496 // Check all uses of that condition operand to check whether it will be
22497 // consumed by non-BLEND instructions, which may depend on all bits are set
22499 for (SDNode::use_iterator I = Cond->use_begin(),
22500 E = Cond->use_end(); I != E; ++I)
22501 if (I->getOpcode() != ISD::VSELECT)
22502 // TODO: Add other opcodes eventually lowered into BLEND.
22505 assert(BitWidth >= 8 && BitWidth <= 64 && "Invalid mask size");
22506 APInt DemandedMask = APInt::getHighBitsSet(BitWidth, 1);
22508 APInt KnownZero, KnownOne;
22509 TargetLowering::TargetLoweringOpt TLO(DAG, DCI.isBeforeLegalize(),
22510 DCI.isBeforeLegalizeOps());
22511 if (TLO.ShrinkDemandedConstant(Cond, DemandedMask) ||
22512 TLI.SimplifyDemandedBits(Cond, DemandedMask, KnownZero, KnownOne, TLO))
22513 DCI.CommitTargetLoweringOpt(TLO);
22516 // We should generate an X86ISD::BLENDI from a vselect if its argument
22517 // is a sign_extend_inreg of an any_extend of a BUILD_VECTOR of
22518 // constants. This specific pattern gets generated when we split a
22519 // selector for a 512 bit vector in a machine without AVX512 (but with
22520 // 256-bit vectors), during legalization:
22522 // (vselect (sign_extend (any_extend (BUILD_VECTOR)) i1) LHS RHS)
22524 // Iff we find this pattern and the build_vectors are built from
22525 // constants, we translate the vselect into a shuffle_vector that we
22526 // know will be matched by LowerVECTOR_SHUFFLEtoBlend.
22527 if (N->getOpcode() == ISD::VSELECT && !DCI.isBeforeLegalize()) {
22528 SDValue Shuffle = TransformVSELECTtoBlendVECTOR_SHUFFLE(N, DAG, Subtarget);
22529 if (Shuffle.getNode())
22536 // Check whether a boolean test is testing a boolean value generated by
22537 // X86ISD::SETCC. If so, return the operand of that SETCC and proper condition
22540 // Simplify the following patterns:
22541 // (Op (CMP (SETCC Cond EFLAGS) 1) EQ) or
22542 // (Op (CMP (SETCC Cond EFLAGS) 0) NEQ)
22543 // to (Op EFLAGS Cond)
22545 // (Op (CMP (SETCC Cond EFLAGS) 0) EQ) or
22546 // (Op (CMP (SETCC Cond EFLAGS) 1) NEQ)
22547 // to (Op EFLAGS !Cond)
22549 // where Op could be BRCOND or CMOV.
22551 static SDValue checkBoolTestSetCCCombine(SDValue Cmp, X86::CondCode &CC) {
22552 // Quit if not CMP and SUB with its value result used.
22553 if (Cmp.getOpcode() != X86ISD::CMP &&
22554 (Cmp.getOpcode() != X86ISD::SUB || Cmp.getNode()->hasAnyUseOfValue(0)))
22557 // Quit if not used as a boolean value.
22558 if (CC != X86::COND_E && CC != X86::COND_NE)
22561 // Check CMP operands. One of them should be 0 or 1 and the other should be
22562 // an SetCC or extended from it.
22563 SDValue Op1 = Cmp.getOperand(0);
22564 SDValue Op2 = Cmp.getOperand(1);
22567 const ConstantSDNode* C = nullptr;
22568 bool needOppositeCond = (CC == X86::COND_E);
22569 bool checkAgainstTrue = false; // Is it a comparison against 1?
22571 if ((C = dyn_cast<ConstantSDNode>(Op1)))
22573 else if ((C = dyn_cast<ConstantSDNode>(Op2)))
22575 else // Quit if all operands are not constants.
22578 if (C->getZExtValue() == 1) {
22579 needOppositeCond = !needOppositeCond;
22580 checkAgainstTrue = true;
22581 } else if (C->getZExtValue() != 0)
22582 // Quit if the constant is neither 0 or 1.
22585 bool truncatedToBoolWithAnd = false;
22586 // Skip (zext $x), (trunc $x), or (and $x, 1) node.
22587 while (SetCC.getOpcode() == ISD::ZERO_EXTEND ||
22588 SetCC.getOpcode() == ISD::TRUNCATE ||
22589 SetCC.getOpcode() == ISD::AND) {
22590 if (SetCC.getOpcode() == ISD::AND) {
22592 ConstantSDNode *CS;
22593 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(0))) &&
22594 CS->getZExtValue() == 1)
22596 if ((CS = dyn_cast<ConstantSDNode>(SetCC.getOperand(1))) &&
22597 CS->getZExtValue() == 1)
22601 SetCC = SetCC.getOperand(OpIdx);
22602 truncatedToBoolWithAnd = true;
22604 SetCC = SetCC.getOperand(0);
22607 switch (SetCC.getOpcode()) {
22608 case X86ISD::SETCC_CARRY:
22609 // Since SETCC_CARRY gives output based on R = CF ? ~0 : 0, it's unsafe to
22610 // simplify it if the result of SETCC_CARRY is not canonicalized to 0 or 1,
22611 // i.e. it's a comparison against true but the result of SETCC_CARRY is not
22612 // truncated to i1 using 'and'.
22613 if (checkAgainstTrue && !truncatedToBoolWithAnd)
22615 assert(X86::CondCode(SetCC.getConstantOperandVal(0)) == X86::COND_B &&
22616 "Invalid use of SETCC_CARRY!");
22618 case X86ISD::SETCC:
22619 // Set the condition code or opposite one if necessary.
22620 CC = X86::CondCode(SetCC.getConstantOperandVal(0));
22621 if (needOppositeCond)
22622 CC = X86::GetOppositeBranchCondition(CC);
22623 return SetCC.getOperand(1);
22624 case X86ISD::CMOV: {
22625 // Check whether false/true value has canonical one, i.e. 0 or 1.
22626 ConstantSDNode *FVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(0));
22627 ConstantSDNode *TVal = dyn_cast<ConstantSDNode>(SetCC.getOperand(1));
22628 // Quit if true value is not a constant.
22631 // Quit if false value is not a constant.
22633 SDValue Op = SetCC.getOperand(0);
22634 // Skip 'zext' or 'trunc' node.
22635 if (Op.getOpcode() == ISD::ZERO_EXTEND ||
22636 Op.getOpcode() == ISD::TRUNCATE)
22637 Op = Op.getOperand(0);
22638 // A special case for rdrand/rdseed, where 0 is set if false cond is
22640 if ((Op.getOpcode() != X86ISD::RDRAND &&
22641 Op.getOpcode() != X86ISD::RDSEED) || Op.getResNo() != 0)
22644 // Quit if false value is not the constant 0 or 1.
22645 bool FValIsFalse = true;
22646 if (FVal && FVal->getZExtValue() != 0) {
22647 if (FVal->getZExtValue() != 1)
22649 // If FVal is 1, opposite cond is needed.
22650 needOppositeCond = !needOppositeCond;
22651 FValIsFalse = false;
22653 // Quit if TVal is not the constant opposite of FVal.
22654 if (FValIsFalse && TVal->getZExtValue() != 1)
22656 if (!FValIsFalse && TVal->getZExtValue() != 0)
22658 CC = X86::CondCode(SetCC.getConstantOperandVal(2));
22659 if (needOppositeCond)
22660 CC = X86::GetOppositeBranchCondition(CC);
22661 return SetCC.getOperand(3);
22668 /// Optimize X86ISD::CMOV [LHS, RHS, CONDCODE (e.g. X86::COND_NE), CONDVAL]
22669 static SDValue PerformCMOVCombine(SDNode *N, SelectionDAG &DAG,
22670 TargetLowering::DAGCombinerInfo &DCI,
22671 const X86Subtarget *Subtarget) {
22674 // If the flag operand isn't dead, don't touch this CMOV.
22675 if (N->getNumValues() == 2 && !SDValue(N, 1).use_empty())
22678 SDValue FalseOp = N->getOperand(0);
22679 SDValue TrueOp = N->getOperand(1);
22680 X86::CondCode CC = (X86::CondCode)N->getConstantOperandVal(2);
22681 SDValue Cond = N->getOperand(3);
22683 if (CC == X86::COND_E || CC == X86::COND_NE) {
22684 switch (Cond.getOpcode()) {
22688 // If operand of BSR / BSF are proven never zero, then ZF cannot be set.
22689 if (DAG.isKnownNeverZero(Cond.getOperand(0)))
22690 return (CC == X86::COND_E) ? FalseOp : TrueOp;
22696 Flags = checkBoolTestSetCCCombine(Cond, CC);
22697 if (Flags.getNode() &&
22698 // Extra check as FCMOV only supports a subset of X86 cond.
22699 (FalseOp.getValueType() != MVT::f80 || hasFPCMov(CC))) {
22700 SDValue Ops[] = { FalseOp, TrueOp,
22701 DAG.getConstant(CC, MVT::i8), Flags };
22702 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList(), Ops);
22705 // If this is a select between two integer constants, try to do some
22706 // optimizations. Note that the operands are ordered the opposite of SELECT
22708 if (ConstantSDNode *TrueC = dyn_cast<ConstantSDNode>(TrueOp)) {
22709 if (ConstantSDNode *FalseC = dyn_cast<ConstantSDNode>(FalseOp)) {
22710 // Canonicalize the TrueC/FalseC values so that TrueC (the true value) is
22711 // larger than FalseC (the false value).
22712 if (TrueC->getAPIntValue().ult(FalseC->getAPIntValue())) {
22713 CC = X86::GetOppositeBranchCondition(CC);
22714 std::swap(TrueC, FalseC);
22715 std::swap(TrueOp, FalseOp);
22718 // Optimize C ? 8 : 0 -> zext(setcc(C)) << 3. Likewise for any pow2/0.
22719 // This is efficient for any integer data type (including i8/i16) and
22721 if (FalseC->getAPIntValue() == 0 && TrueC->getAPIntValue().isPowerOf2()) {
22722 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22723 DAG.getConstant(CC, MVT::i8), Cond);
22725 // Zero extend the condition if needed.
22726 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, TrueC->getValueType(0), Cond);
22728 unsigned ShAmt = TrueC->getAPIntValue().logBase2();
22729 Cond = DAG.getNode(ISD::SHL, DL, Cond.getValueType(), Cond,
22730 DAG.getConstant(ShAmt, MVT::i8));
22731 if (N->getNumValues() == 2) // Dead flag value?
22732 return DCI.CombineTo(N, Cond, SDValue());
22736 // Optimize Cond ? cst+1 : cst -> zext(setcc(C)+cst. This is efficient
22737 // for any integer data type, including i8/i16.
22738 if (FalseC->getAPIntValue()+1 == TrueC->getAPIntValue()) {
22739 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22740 DAG.getConstant(CC, MVT::i8), Cond);
22742 // Zero extend the condition if needed.
22743 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL,
22744 FalseC->getValueType(0), Cond);
22745 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22746 SDValue(FalseC, 0));
22748 if (N->getNumValues() == 2) // Dead flag value?
22749 return DCI.CombineTo(N, Cond, SDValue());
22753 // Optimize cases that will turn into an LEA instruction. This requires
22754 // an i32 or i64 and an efficient multiplier (1, 2, 3, 4, 5, 8, 9).
22755 if (N->getValueType(0) == MVT::i32 || N->getValueType(0) == MVT::i64) {
22756 uint64_t Diff = TrueC->getZExtValue()-FalseC->getZExtValue();
22757 if (N->getValueType(0) == MVT::i32) Diff = (unsigned)Diff;
22759 bool isFastMultiplier = false;
22761 switch ((unsigned char)Diff) {
22763 case 1: // result = add base, cond
22764 case 2: // result = lea base( , cond*2)
22765 case 3: // result = lea base(cond, cond*2)
22766 case 4: // result = lea base( , cond*4)
22767 case 5: // result = lea base(cond, cond*4)
22768 case 8: // result = lea base( , cond*8)
22769 case 9: // result = lea base(cond, cond*8)
22770 isFastMultiplier = true;
22775 if (isFastMultiplier) {
22776 APInt Diff = TrueC->getAPIntValue()-FalseC->getAPIntValue();
22777 Cond = DAG.getNode(X86ISD::SETCC, DL, MVT::i8,
22778 DAG.getConstant(CC, MVT::i8), Cond);
22779 // Zero extend the condition if needed.
22780 Cond = DAG.getNode(ISD::ZERO_EXTEND, DL, FalseC->getValueType(0),
22782 // Scale the condition by the difference.
22784 Cond = DAG.getNode(ISD::MUL, DL, Cond.getValueType(), Cond,
22785 DAG.getConstant(Diff, Cond.getValueType()));
22787 // Add the base if non-zero.
22788 if (FalseC->getAPIntValue() != 0)
22789 Cond = DAG.getNode(ISD::ADD, DL, Cond.getValueType(), Cond,
22790 SDValue(FalseC, 0));
22791 if (N->getNumValues() == 2) // Dead flag value?
22792 return DCI.CombineTo(N, Cond, SDValue());
22799 // Handle these cases:
22800 // (select (x != c), e, c) -> select (x != c), e, x),
22801 // (select (x == c), c, e) -> select (x == c), x, e)
22802 // where the c is an integer constant, and the "select" is the combination
22803 // of CMOV and CMP.
22805 // The rationale for this change is that the conditional-move from a constant
22806 // needs two instructions, however, conditional-move from a register needs
22807 // only one instruction.
22809 // CAVEAT: By replacing a constant with a symbolic value, it may obscure
22810 // some instruction-combining opportunities. This opt needs to be
22811 // postponed as late as possible.
22813 if (!DCI.isBeforeLegalize() && !DCI.isBeforeLegalizeOps()) {
22814 // the DCI.xxxx conditions are provided to postpone the optimization as
22815 // late as possible.
22817 ConstantSDNode *CmpAgainst = nullptr;
22818 if ((Cond.getOpcode() == X86ISD::CMP || Cond.getOpcode() == X86ISD::SUB) &&
22819 (CmpAgainst = dyn_cast<ConstantSDNode>(Cond.getOperand(1))) &&
22820 !isa<ConstantSDNode>(Cond.getOperand(0))) {
22822 if (CC == X86::COND_NE &&
22823 CmpAgainst == dyn_cast<ConstantSDNode>(FalseOp)) {
22824 CC = X86::GetOppositeBranchCondition(CC);
22825 std::swap(TrueOp, FalseOp);
22828 if (CC == X86::COND_E &&
22829 CmpAgainst == dyn_cast<ConstantSDNode>(TrueOp)) {
22830 SDValue Ops[] = { FalseOp, Cond.getOperand(0),
22831 DAG.getConstant(CC, MVT::i8), Cond };
22832 return DAG.getNode(X86ISD::CMOV, DL, N->getVTList (), Ops);
22840 static SDValue PerformINTRINSIC_WO_CHAINCombine(SDNode *N, SelectionDAG &DAG,
22841 const X86Subtarget *Subtarget) {
22842 unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
22844 default: return SDValue();
22845 // SSE/AVX/AVX2 blend intrinsics.
22846 case Intrinsic::x86_avx2_pblendvb:
22847 case Intrinsic::x86_avx2_pblendw:
22848 case Intrinsic::x86_avx2_pblendd_128:
22849 case Intrinsic::x86_avx2_pblendd_256:
22850 // Don't try to simplify this intrinsic if we don't have AVX2.
22851 if (!Subtarget->hasAVX2())
22854 case Intrinsic::x86_avx_blend_pd_256:
22855 case Intrinsic::x86_avx_blend_ps_256:
22856 case Intrinsic::x86_avx_blendv_pd_256:
22857 case Intrinsic::x86_avx_blendv_ps_256:
22858 // Don't try to simplify this intrinsic if we don't have AVX.
22859 if (!Subtarget->hasAVX())
22862 case Intrinsic::x86_sse41_pblendw:
22863 case Intrinsic::x86_sse41_blendpd:
22864 case Intrinsic::x86_sse41_blendps:
22865 case Intrinsic::x86_sse41_blendvps:
22866 case Intrinsic::x86_sse41_blendvpd:
22867 case Intrinsic::x86_sse41_pblendvb: {
22868 SDValue Op0 = N->getOperand(1);
22869 SDValue Op1 = N->getOperand(2);
22870 SDValue Mask = N->getOperand(3);
22872 // Don't try to simplify this intrinsic if we don't have SSE4.1.
22873 if (!Subtarget->hasSSE41())
22876 // fold (blend A, A, Mask) -> A
22879 // fold (blend A, B, allZeros) -> A
22880 if (ISD::isBuildVectorAllZeros(Mask.getNode()))
22882 // fold (blend A, B, allOnes) -> B
22883 if (ISD::isBuildVectorAllOnes(Mask.getNode()))
22886 // Simplify the case where the mask is a constant i32 value.
22887 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Mask)) {
22888 if (C->isNullValue())
22890 if (C->isAllOnesValue())
22897 // Packed SSE2/AVX2 arithmetic shift immediate intrinsics.
22898 case Intrinsic::x86_sse2_psrai_w:
22899 case Intrinsic::x86_sse2_psrai_d:
22900 case Intrinsic::x86_avx2_psrai_w:
22901 case Intrinsic::x86_avx2_psrai_d:
22902 case Intrinsic::x86_sse2_psra_w:
22903 case Intrinsic::x86_sse2_psra_d:
22904 case Intrinsic::x86_avx2_psra_w:
22905 case Intrinsic::x86_avx2_psra_d: {
22906 SDValue Op0 = N->getOperand(1);
22907 SDValue Op1 = N->getOperand(2);
22908 EVT VT = Op0.getValueType();
22909 assert(VT.isVector() && "Expected a vector type!");
22911 if (isa<BuildVectorSDNode>(Op1))
22912 Op1 = Op1.getOperand(0);
22914 if (!isa<ConstantSDNode>(Op1))
22917 EVT SVT = VT.getVectorElementType();
22918 unsigned SVTBits = SVT.getSizeInBits();
22920 ConstantSDNode *CND = cast<ConstantSDNode>(Op1);
22921 const APInt &C = APInt(SVTBits, CND->getAPIntValue().getZExtValue());
22922 uint64_t ShAmt = C.getZExtValue();
22924 // Don't try to convert this shift into a ISD::SRA if the shift
22925 // count is bigger than or equal to the element size.
22926 if (ShAmt >= SVTBits)
22929 // Trivial case: if the shift count is zero, then fold this
22930 // into the first operand.
22934 // Replace this packed shift intrinsic with a target independent
22936 SDValue Splat = DAG.getConstant(C, VT);
22937 return DAG.getNode(ISD::SRA, SDLoc(N), VT, Op0, Splat);
22942 /// PerformMulCombine - Optimize a single multiply with constant into two
22943 /// in order to implement it with two cheaper instructions, e.g.
22944 /// LEA + SHL, LEA + LEA.
22945 static SDValue PerformMulCombine(SDNode *N, SelectionDAG &DAG,
22946 TargetLowering::DAGCombinerInfo &DCI) {
22947 if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
22950 EVT VT = N->getValueType(0);
22951 if (VT != MVT::i64)
22954 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
22957 uint64_t MulAmt = C->getZExtValue();
22958 if (isPowerOf2_64(MulAmt) || MulAmt == 3 || MulAmt == 5 || MulAmt == 9)
22961 uint64_t MulAmt1 = 0;
22962 uint64_t MulAmt2 = 0;
22963 if ((MulAmt % 9) == 0) {
22965 MulAmt2 = MulAmt / 9;
22966 } else if ((MulAmt % 5) == 0) {
22968 MulAmt2 = MulAmt / 5;
22969 } else if ((MulAmt % 3) == 0) {
22971 MulAmt2 = MulAmt / 3;
22974 (isPowerOf2_64(MulAmt2) || MulAmt2 == 3 || MulAmt2 == 5 || MulAmt2 == 9)){
22977 if (isPowerOf2_64(MulAmt2) &&
22978 !(N->hasOneUse() && N->use_begin()->getOpcode() == ISD::ADD))
22979 // If second multiplifer is pow2, issue it first. We want the multiply by
22980 // 3, 5, or 9 to be folded into the addressing mode unless the lone use
22982 std::swap(MulAmt1, MulAmt2);
22985 if (isPowerOf2_64(MulAmt1))
22986 NewMul = DAG.getNode(ISD::SHL, DL, VT, N->getOperand(0),
22987 DAG.getConstant(Log2_64(MulAmt1), MVT::i8));
22989 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, N->getOperand(0),
22990 DAG.getConstant(MulAmt1, VT));
22992 if (isPowerOf2_64(MulAmt2))
22993 NewMul = DAG.getNode(ISD::SHL, DL, VT, NewMul,
22994 DAG.getConstant(Log2_64(MulAmt2), MVT::i8));
22996 NewMul = DAG.getNode(X86ISD::MUL_IMM, DL, VT, NewMul,
22997 DAG.getConstant(MulAmt2, VT));
22999 // Do not add new nodes to DAG combiner worklist.
23000 DCI.CombineTo(N, NewMul, false);
23005 static SDValue PerformSHLCombine(SDNode *N, SelectionDAG &DAG) {
23006 SDValue N0 = N->getOperand(0);
23007 SDValue N1 = N->getOperand(1);
23008 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
23009 EVT VT = N0.getValueType();
23011 // fold (shl (and (setcc_c), c1), c2) -> (and setcc_c, (c1 << c2))
23012 // since the result of setcc_c is all zero's or all ones.
23013 if (VT.isInteger() && !VT.isVector() &&
23014 N1C && N0.getOpcode() == ISD::AND &&
23015 N0.getOperand(1).getOpcode() == ISD::Constant) {
23016 SDValue N00 = N0.getOperand(0);
23017 if (N00.getOpcode() == X86ISD::SETCC_CARRY ||
23018 ((N00.getOpcode() == ISD::ANY_EXTEND ||
23019 N00.getOpcode() == ISD::ZERO_EXTEND) &&
23020 N00.getOperand(0).getOpcode() == X86ISD::SETCC_CARRY)) {
23021 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
23022 APInt ShAmt = N1C->getAPIntValue();
23023 Mask = Mask.shl(ShAmt);
23025 return DAG.getNode(ISD::AND, SDLoc(N), VT,
23026 N00, DAG.getConstant(Mask, VT));
23030 // Hardware support for vector shifts is sparse which makes us scalarize the
23031 // vector operations in many cases. Also, on sandybridge ADD is faster than
23033 // (shl V, 1) -> add V,V
23034 if (auto *N1BV = dyn_cast<BuildVectorSDNode>(N1))
23035 if (auto *N1SplatC = N1BV->getConstantSplatNode()) {
23036 assert(N0.getValueType().isVector() && "Invalid vector shift type");
23037 // We shift all of the values by one. In many cases we do not have
23038 // hardware support for this operation. This is better expressed as an ADD
23040 if (N1SplatC->getZExtValue() == 1)
23041 return DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N0);
23047 /// \brief Returns a vector of 0s if the node in input is a vector logical
23048 /// shift by a constant amount which is known to be bigger than or equal
23049 /// to the vector element size in bits.
23050 static SDValue performShiftToAllZeros(SDNode *N, SelectionDAG &DAG,
23051 const X86Subtarget *Subtarget) {
23052 EVT VT = N->getValueType(0);
23054 if (VT != MVT::v2i64 && VT != MVT::v4i32 && VT != MVT::v8i16 &&
23055 (!Subtarget->hasInt256() ||
23056 (VT != MVT::v4i64 && VT != MVT::v8i32 && VT != MVT::v16i16)))
23059 SDValue Amt = N->getOperand(1);
23061 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Amt))
23062 if (auto *AmtSplat = AmtBV->getConstantSplatNode()) {
23063 APInt ShiftAmt = AmtSplat->getAPIntValue();
23064 unsigned MaxAmount = VT.getVectorElementType().getSizeInBits();
23066 // SSE2/AVX2 logical shifts always return a vector of 0s
23067 // if the shift amount is bigger than or equal to
23068 // the element size. The constant shift amount will be
23069 // encoded as a 8-bit immediate.
23070 if (ShiftAmt.trunc(8).uge(MaxAmount))
23071 return getZeroVector(VT, Subtarget, DAG, DL);
23077 /// PerformShiftCombine - Combine shifts.
23078 static SDValue PerformShiftCombine(SDNode* N, SelectionDAG &DAG,
23079 TargetLowering::DAGCombinerInfo &DCI,
23080 const X86Subtarget *Subtarget) {
23081 if (N->getOpcode() == ISD::SHL) {
23082 SDValue V = PerformSHLCombine(N, DAG);
23083 if (V.getNode()) return V;
23086 if (N->getOpcode() != ISD::SRA) {
23087 // Try to fold this logical shift into a zero vector.
23088 SDValue V = performShiftToAllZeros(N, DAG, Subtarget);
23089 if (V.getNode()) return V;
23095 // CMPEQCombine - Recognize the distinctive (AND (setcc ...) (setcc ..))
23096 // where both setccs reference the same FP CMP, and rewrite for CMPEQSS
23097 // and friends. Likewise for OR -> CMPNEQSS.
23098 static SDValue CMPEQCombine(SDNode *N, SelectionDAG &DAG,
23099 TargetLowering::DAGCombinerInfo &DCI,
23100 const X86Subtarget *Subtarget) {
23103 // SSE1 supports CMP{eq|ne}SS, and SSE2 added CMP{eq|ne}SD, but
23104 // we're requiring SSE2 for both.
23105 if (Subtarget->hasSSE2() && isAndOrOfSetCCs(SDValue(N, 0U), opcode)) {
23106 SDValue N0 = N->getOperand(0);
23107 SDValue N1 = N->getOperand(1);
23108 SDValue CMP0 = N0->getOperand(1);
23109 SDValue CMP1 = N1->getOperand(1);
23112 // The SETCCs should both refer to the same CMP.
23113 if (CMP0.getOpcode() != X86ISD::CMP || CMP0 != CMP1)
23116 SDValue CMP00 = CMP0->getOperand(0);
23117 SDValue CMP01 = CMP0->getOperand(1);
23118 EVT VT = CMP00.getValueType();
23120 if (VT == MVT::f32 || VT == MVT::f64) {
23121 bool ExpectingFlags = false;
23122 // Check for any users that want flags:
23123 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
23124 !ExpectingFlags && UI != UE; ++UI)
23125 switch (UI->getOpcode()) {
23130 ExpectingFlags = true;
23132 case ISD::CopyToReg:
23133 case ISD::SIGN_EXTEND:
23134 case ISD::ZERO_EXTEND:
23135 case ISD::ANY_EXTEND:
23139 if (!ExpectingFlags) {
23140 enum X86::CondCode cc0 = (enum X86::CondCode)N0.getConstantOperandVal(0);
23141 enum X86::CondCode cc1 = (enum X86::CondCode)N1.getConstantOperandVal(0);
23143 if (cc1 == X86::COND_E || cc1 == X86::COND_NE) {
23144 X86::CondCode tmp = cc0;
23149 if ((cc0 == X86::COND_E && cc1 == X86::COND_NP) ||
23150 (cc0 == X86::COND_NE && cc1 == X86::COND_P)) {
23151 // FIXME: need symbolic constants for these magic numbers.
23152 // See X86ATTInstPrinter.cpp:printSSECC().
23153 unsigned x86cc = (cc0 == X86::COND_E) ? 0 : 4;
23154 if (Subtarget->hasAVX512()) {
23155 SDValue FSetCC = DAG.getNode(X86ISD::FSETCC, DL, MVT::i1, CMP00,
23156 CMP01, DAG.getConstant(x86cc, MVT::i8));
23157 if (N->getValueType(0) != MVT::i1)
23158 return DAG.getNode(ISD::ZERO_EXTEND, DL, N->getValueType(0),
23162 SDValue OnesOrZeroesF = DAG.getNode(X86ISD::FSETCC, DL,
23163 CMP00.getValueType(), CMP00, CMP01,
23164 DAG.getConstant(x86cc, MVT::i8));
23166 bool is64BitFP = (CMP00.getValueType() == MVT::f64);
23167 MVT IntVT = is64BitFP ? MVT::i64 : MVT::i32;
23169 if (is64BitFP && !Subtarget->is64Bit()) {
23170 // On a 32-bit target, we cannot bitcast the 64-bit float to a
23171 // 64-bit integer, since that's not a legal type. Since
23172 // OnesOrZeroesF is all ones of all zeroes, we don't need all the
23173 // bits, but can do this little dance to extract the lowest 32 bits
23174 // and work with those going forward.
23175 SDValue Vector64 = DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, MVT::v2f64,
23177 SDValue Vector32 = DAG.getNode(ISD::BITCAST, DL, MVT::v4f32,
23179 OnesOrZeroesF = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, MVT::f32,
23180 Vector32, DAG.getIntPtrConstant(0));
23184 SDValue OnesOrZeroesI = DAG.getNode(ISD::BITCAST, DL, IntVT, OnesOrZeroesF);
23185 SDValue ANDed = DAG.getNode(ISD::AND, DL, IntVT, OnesOrZeroesI,
23186 DAG.getConstant(1, IntVT));
23187 SDValue OneBitOfTruth = DAG.getNode(ISD::TRUNCATE, DL, MVT::i8, ANDed);
23188 return OneBitOfTruth;
23196 /// CanFoldXORWithAllOnes - Test whether the XOR operand is a AllOnes vector
23197 /// so it can be folded inside ANDNP.
23198 static bool CanFoldXORWithAllOnes(const SDNode *N) {
23199 EVT VT = N->getValueType(0);
23201 // Match direct AllOnes for 128 and 256-bit vectors
23202 if (ISD::isBuildVectorAllOnes(N))
23205 // Look through a bit convert.
23206 if (N->getOpcode() == ISD::BITCAST)
23207 N = N->getOperand(0).getNode();
23209 // Sometimes the operand may come from a insert_subvector building a 256-bit
23211 if (VT.is256BitVector() &&
23212 N->getOpcode() == ISD::INSERT_SUBVECTOR) {
23213 SDValue V1 = N->getOperand(0);
23214 SDValue V2 = N->getOperand(1);
23216 if (V1.getOpcode() == ISD::INSERT_SUBVECTOR &&
23217 V1.getOperand(0).getOpcode() == ISD::UNDEF &&
23218 ISD::isBuildVectorAllOnes(V1.getOperand(1).getNode()) &&
23219 ISD::isBuildVectorAllOnes(V2.getNode()))
23226 // On AVX/AVX2 the type v8i1 is legalized to v8i16, which is an XMM sized
23227 // register. In most cases we actually compare or select YMM-sized registers
23228 // and mixing the two types creates horrible code. This method optimizes
23229 // some of the transition sequences.
23230 static SDValue WidenMaskArithmetic(SDNode *N, SelectionDAG &DAG,
23231 TargetLowering::DAGCombinerInfo &DCI,
23232 const X86Subtarget *Subtarget) {
23233 EVT VT = N->getValueType(0);
23234 if (!VT.is256BitVector())
23237 assert((N->getOpcode() == ISD::ANY_EXTEND ||
23238 N->getOpcode() == ISD::ZERO_EXTEND ||
23239 N->getOpcode() == ISD::SIGN_EXTEND) && "Invalid Node");
23241 SDValue Narrow = N->getOperand(0);
23242 EVT NarrowVT = Narrow->getValueType(0);
23243 if (!NarrowVT.is128BitVector())
23246 if (Narrow->getOpcode() != ISD::XOR &&
23247 Narrow->getOpcode() != ISD::AND &&
23248 Narrow->getOpcode() != ISD::OR)
23251 SDValue N0 = Narrow->getOperand(0);
23252 SDValue N1 = Narrow->getOperand(1);
23255 // The Left side has to be a trunc.
23256 if (N0.getOpcode() != ISD::TRUNCATE)
23259 // The type of the truncated inputs.
23260 EVT WideVT = N0->getOperand(0)->getValueType(0);
23264 // The right side has to be a 'trunc' or a constant vector.
23265 bool RHSTrunc = N1.getOpcode() == ISD::TRUNCATE;
23266 ConstantSDNode *RHSConstSplat = nullptr;
23267 if (auto *RHSBV = dyn_cast<BuildVectorSDNode>(N1))
23268 RHSConstSplat = RHSBV->getConstantSplatNode();
23269 if (!RHSTrunc && !RHSConstSplat)
23272 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23274 if (!TLI.isOperationLegalOrPromote(Narrow->getOpcode(), WideVT))
23277 // Set N0 and N1 to hold the inputs to the new wide operation.
23278 N0 = N0->getOperand(0);
23279 if (RHSConstSplat) {
23280 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, WideVT.getScalarType(),
23281 SDValue(RHSConstSplat, 0));
23282 SmallVector<SDValue, 8> C(WideVT.getVectorNumElements(), N1);
23283 N1 = DAG.getNode(ISD::BUILD_VECTOR, DL, WideVT, C);
23284 } else if (RHSTrunc) {
23285 N1 = N1->getOperand(0);
23288 // Generate the wide operation.
23289 SDValue Op = DAG.getNode(Narrow->getOpcode(), DL, WideVT, N0, N1);
23290 unsigned Opcode = N->getOpcode();
23292 case ISD::ANY_EXTEND:
23294 case ISD::ZERO_EXTEND: {
23295 unsigned InBits = NarrowVT.getScalarType().getSizeInBits();
23296 APInt Mask = APInt::getAllOnesValue(InBits);
23297 Mask = Mask.zext(VT.getScalarType().getSizeInBits());
23298 return DAG.getNode(ISD::AND, DL, VT,
23299 Op, DAG.getConstant(Mask, VT));
23301 case ISD::SIGN_EXTEND:
23302 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT,
23303 Op, DAG.getValueType(NarrowVT));
23305 llvm_unreachable("Unexpected opcode");
23309 static SDValue PerformAndCombine(SDNode *N, SelectionDAG &DAG,
23310 TargetLowering::DAGCombinerInfo &DCI,
23311 const X86Subtarget *Subtarget) {
23312 EVT VT = N->getValueType(0);
23313 if (DCI.isBeforeLegalizeOps())
23316 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23320 // Create BEXTR instructions
23321 // BEXTR is ((X >> imm) & (2**size-1))
23322 if (VT == MVT::i32 || VT == MVT::i64) {
23323 SDValue N0 = N->getOperand(0);
23324 SDValue N1 = N->getOperand(1);
23327 // Check for BEXTR.
23328 if ((Subtarget->hasBMI() || Subtarget->hasTBM()) &&
23329 (N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::SRL)) {
23330 ConstantSDNode *MaskNode = dyn_cast<ConstantSDNode>(N1);
23331 ConstantSDNode *ShiftNode = dyn_cast<ConstantSDNode>(N0.getOperand(1));
23332 if (MaskNode && ShiftNode) {
23333 uint64_t Mask = MaskNode->getZExtValue();
23334 uint64_t Shift = ShiftNode->getZExtValue();
23335 if (isMask_64(Mask)) {
23336 uint64_t MaskSize = CountPopulation_64(Mask);
23337 if (Shift + MaskSize <= VT.getSizeInBits())
23338 return DAG.getNode(X86ISD::BEXTR, DL, VT, N0.getOperand(0),
23339 DAG.getConstant(Shift | (MaskSize << 8), VT));
23347 // Want to form ANDNP nodes:
23348 // 1) In the hopes of then easily combining them with OR and AND nodes
23349 // to form PBLEND/PSIGN.
23350 // 2) To match ANDN packed intrinsics
23351 if (VT != MVT::v2i64 && VT != MVT::v4i64)
23354 SDValue N0 = N->getOperand(0);
23355 SDValue N1 = N->getOperand(1);
23358 // Check LHS for vnot
23359 if (N0.getOpcode() == ISD::XOR &&
23360 //ISD::isBuildVectorAllOnes(N0.getOperand(1).getNode()))
23361 CanFoldXORWithAllOnes(N0.getOperand(1).getNode()))
23362 return DAG.getNode(X86ISD::ANDNP, DL, VT, N0.getOperand(0), N1);
23364 // Check RHS for vnot
23365 if (N1.getOpcode() == ISD::XOR &&
23366 //ISD::isBuildVectorAllOnes(N1.getOperand(1).getNode()))
23367 CanFoldXORWithAllOnes(N1.getOperand(1).getNode()))
23368 return DAG.getNode(X86ISD::ANDNP, DL, VT, N1.getOperand(0), N0);
23373 static SDValue PerformOrCombine(SDNode *N, SelectionDAG &DAG,
23374 TargetLowering::DAGCombinerInfo &DCI,
23375 const X86Subtarget *Subtarget) {
23376 if (DCI.isBeforeLegalizeOps())
23379 SDValue R = CMPEQCombine(N, DAG, DCI, Subtarget);
23383 SDValue N0 = N->getOperand(0);
23384 SDValue N1 = N->getOperand(1);
23385 EVT VT = N->getValueType(0);
23387 // look for psign/blend
23388 if (VT == MVT::v2i64 || VT == MVT::v4i64) {
23389 if (!Subtarget->hasSSSE3() ||
23390 (VT == MVT::v4i64 && !Subtarget->hasInt256()))
23393 // Canonicalize pandn to RHS
23394 if (N0.getOpcode() == X86ISD::ANDNP)
23396 // or (and (m, y), (pandn m, x))
23397 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == X86ISD::ANDNP) {
23398 SDValue Mask = N1.getOperand(0);
23399 SDValue X = N1.getOperand(1);
23401 if (N0.getOperand(0) == Mask)
23402 Y = N0.getOperand(1);
23403 if (N0.getOperand(1) == Mask)
23404 Y = N0.getOperand(0);
23406 // Check to see if the mask appeared in both the AND and ANDNP and
23410 // Validate that X, Y, and Mask are BIT_CONVERTS, and see through them.
23411 // Look through mask bitcast.
23412 if (Mask.getOpcode() == ISD::BITCAST)
23413 Mask = Mask.getOperand(0);
23414 if (X.getOpcode() == ISD::BITCAST)
23415 X = X.getOperand(0);
23416 if (Y.getOpcode() == ISD::BITCAST)
23417 Y = Y.getOperand(0);
23419 EVT MaskVT = Mask.getValueType();
23421 // Validate that the Mask operand is a vector sra node.
23422 // FIXME: what to do for bytes, since there is a psignb/pblendvb, but
23423 // there is no psrai.b
23424 unsigned EltBits = MaskVT.getVectorElementType().getSizeInBits();
23425 unsigned SraAmt = ~0;
23426 if (Mask.getOpcode() == ISD::SRA) {
23427 if (auto *AmtBV = dyn_cast<BuildVectorSDNode>(Mask.getOperand(1)))
23428 if (auto *AmtConst = AmtBV->getConstantSplatNode())
23429 SraAmt = AmtConst->getZExtValue();
23430 } else if (Mask.getOpcode() == X86ISD::VSRAI) {
23431 SDValue SraC = Mask.getOperand(1);
23432 SraAmt = cast<ConstantSDNode>(SraC)->getZExtValue();
23434 if ((SraAmt + 1) != EltBits)
23439 // Now we know we at least have a plendvb with the mask val. See if
23440 // we can form a psignb/w/d.
23441 // psign = x.type == y.type == mask.type && y = sub(0, x);
23442 if (Y.getOpcode() == ISD::SUB && Y.getOperand(1) == X &&
23443 ISD::isBuildVectorAllZeros(Y.getOperand(0).getNode()) &&
23444 X.getValueType() == MaskVT && Y.getValueType() == MaskVT) {
23445 assert((EltBits == 8 || EltBits == 16 || EltBits == 32) &&
23446 "Unsupported VT for PSIGN");
23447 Mask = DAG.getNode(X86ISD::PSIGN, DL, MaskVT, X, Mask.getOperand(0));
23448 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23450 // PBLENDVB only available on SSE 4.1
23451 if (!Subtarget->hasSSE41())
23454 EVT BlendVT = (VT == MVT::v4i64) ? MVT::v32i8 : MVT::v16i8;
23456 X = DAG.getNode(ISD::BITCAST, DL, BlendVT, X);
23457 Y = DAG.getNode(ISD::BITCAST, DL, BlendVT, Y);
23458 Mask = DAG.getNode(ISD::BITCAST, DL, BlendVT, Mask);
23459 Mask = DAG.getNode(ISD::VSELECT, DL, BlendVT, Mask, Y, X);
23460 return DAG.getNode(ISD::BITCAST, DL, VT, Mask);
23464 if (VT != MVT::i16 && VT != MVT::i32 && VT != MVT::i64)
23467 // fold (or (x << c) | (y >> (64 - c))) ==> (shld64 x, y, c)
23468 MachineFunction &MF = DAG.getMachineFunction();
23469 bool OptForSize = MF.getFunction()->getAttributes().
23470 hasAttribute(AttributeSet::FunctionIndex, Attribute::OptimizeForSize);
23472 // SHLD/SHRD instructions have lower register pressure, but on some
23473 // platforms they have higher latency than the equivalent
23474 // series of shifts/or that would otherwise be generated.
23475 // Don't fold (or (x << c) | (y >> (64 - c))) if SHLD/SHRD instructions
23476 // have higher latencies and we are not optimizing for size.
23477 if (!OptForSize && Subtarget->isSHLDSlow())
23480 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
23482 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
23484 if (!N0.hasOneUse() || !N1.hasOneUse())
23487 SDValue ShAmt0 = N0.getOperand(1);
23488 if (ShAmt0.getValueType() != MVT::i8)
23490 SDValue ShAmt1 = N1.getOperand(1);
23491 if (ShAmt1.getValueType() != MVT::i8)
23493 if (ShAmt0.getOpcode() == ISD::TRUNCATE)
23494 ShAmt0 = ShAmt0.getOperand(0);
23495 if (ShAmt1.getOpcode() == ISD::TRUNCATE)
23496 ShAmt1 = ShAmt1.getOperand(0);
23499 unsigned Opc = X86ISD::SHLD;
23500 SDValue Op0 = N0.getOperand(0);
23501 SDValue Op1 = N1.getOperand(0);
23502 if (ShAmt0.getOpcode() == ISD::SUB) {
23503 Opc = X86ISD::SHRD;
23504 std::swap(Op0, Op1);
23505 std::swap(ShAmt0, ShAmt1);
23508 unsigned Bits = VT.getSizeInBits();
23509 if (ShAmt1.getOpcode() == ISD::SUB) {
23510 SDValue Sum = ShAmt1.getOperand(0);
23511 if (ConstantSDNode *SumC = dyn_cast<ConstantSDNode>(Sum)) {
23512 SDValue ShAmt1Op1 = ShAmt1.getOperand(1);
23513 if (ShAmt1Op1.getNode()->getOpcode() == ISD::TRUNCATE)
23514 ShAmt1Op1 = ShAmt1Op1.getOperand(0);
23515 if (SumC->getSExtValue() == Bits && ShAmt1Op1 == ShAmt0)
23516 return DAG.getNode(Opc, DL, VT,
23518 DAG.getNode(ISD::TRUNCATE, DL,
23521 } else if (ConstantSDNode *ShAmt1C = dyn_cast<ConstantSDNode>(ShAmt1)) {
23522 ConstantSDNode *ShAmt0C = dyn_cast<ConstantSDNode>(ShAmt0);
23524 ShAmt0C->getSExtValue() + ShAmt1C->getSExtValue() == Bits)
23525 return DAG.getNode(Opc, DL, VT,
23526 N0.getOperand(0), N1.getOperand(0),
23527 DAG.getNode(ISD::TRUNCATE, DL,
23534 // Generate NEG and CMOV for integer abs.
23535 static SDValue performIntegerAbsCombine(SDNode *N, SelectionDAG &DAG) {
23536 EVT VT = N->getValueType(0);
23538 // Since X86 does not have CMOV for 8-bit integer, we don't convert
23539 // 8-bit integer abs to NEG and CMOV.
23540 if (VT.isInteger() && VT.getSizeInBits() == 8)
23543 SDValue N0 = N->getOperand(0);
23544 SDValue N1 = N->getOperand(1);
23547 // Check pattern of XOR(ADD(X,Y), Y) where Y is SRA(X, size(X)-1)
23548 // and change it to SUB and CMOV.
23549 if (VT.isInteger() && N->getOpcode() == ISD::XOR &&
23550 N0.getOpcode() == ISD::ADD &&
23551 N0.getOperand(1) == N1 &&
23552 N1.getOpcode() == ISD::SRA &&
23553 N1.getOperand(0) == N0.getOperand(0))
23554 if (ConstantSDNode *Y1C = dyn_cast<ConstantSDNode>(N1.getOperand(1)))
23555 if (Y1C->getAPIntValue() == VT.getSizeInBits()-1) {
23556 // Generate SUB & CMOV.
23557 SDValue Neg = DAG.getNode(X86ISD::SUB, DL, DAG.getVTList(VT, MVT::i32),
23558 DAG.getConstant(0, VT), N0.getOperand(0));
23560 SDValue Ops[] = { N0.getOperand(0), Neg,
23561 DAG.getConstant(X86::COND_GE, MVT::i8),
23562 SDValue(Neg.getNode(), 1) };
23563 return DAG.getNode(X86ISD::CMOV, DL, DAG.getVTList(VT, MVT::Glue), Ops);
23568 // PerformXorCombine - Attempts to turn XOR nodes into BLSMSK nodes
23569 static SDValue PerformXorCombine(SDNode *N, SelectionDAG &DAG,
23570 TargetLowering::DAGCombinerInfo &DCI,
23571 const X86Subtarget *Subtarget) {
23572 if (DCI.isBeforeLegalizeOps())
23575 if (Subtarget->hasCMov()) {
23576 SDValue RV = performIntegerAbsCombine(N, DAG);
23584 /// PerformLOADCombine - Do target-specific dag combines on LOAD nodes.
23585 static SDValue PerformLOADCombine(SDNode *N, SelectionDAG &DAG,
23586 TargetLowering::DAGCombinerInfo &DCI,
23587 const X86Subtarget *Subtarget) {
23588 LoadSDNode *Ld = cast<LoadSDNode>(N);
23589 EVT RegVT = Ld->getValueType(0);
23590 EVT MemVT = Ld->getMemoryVT();
23592 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23594 // On Sandybridge unaligned 256bit loads are inefficient.
23595 ISD::LoadExtType Ext = Ld->getExtensionType();
23596 unsigned Alignment = Ld->getAlignment();
23597 bool IsAligned = Alignment == 0 || Alignment >= MemVT.getSizeInBits()/8;
23598 if (RegVT.is256BitVector() && !Subtarget->hasInt256() &&
23599 !DCI.isBeforeLegalizeOps() && !IsAligned && Ext == ISD::NON_EXTLOAD) {
23600 unsigned NumElems = RegVT.getVectorNumElements();
23604 SDValue Ptr = Ld->getBasePtr();
23605 SDValue Increment = DAG.getConstant(16, TLI.getPointerTy());
23607 EVT HalfVT = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(),
23609 SDValue Load1 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23610 Ld->getPointerInfo(), Ld->isVolatile(),
23611 Ld->isNonTemporal(), Ld->isInvariant(),
23613 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23614 SDValue Load2 = DAG.getLoad(HalfVT, dl, Ld->getChain(), Ptr,
23615 Ld->getPointerInfo(), Ld->isVolatile(),
23616 Ld->isNonTemporal(), Ld->isInvariant(),
23617 std::min(16U, Alignment));
23618 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
23620 Load2.getValue(1));
23622 SDValue NewVec = DAG.getUNDEF(RegVT);
23623 NewVec = Insert128BitVector(NewVec, Load1, 0, DAG, dl);
23624 NewVec = Insert128BitVector(NewVec, Load2, NumElems/2, DAG, dl);
23625 return DCI.CombineTo(N, NewVec, TF, true);
23631 /// PerformSTORECombine - Do target-specific dag combines on STORE nodes.
23632 static SDValue PerformSTORECombine(SDNode *N, SelectionDAG &DAG,
23633 const X86Subtarget *Subtarget) {
23634 StoreSDNode *St = cast<StoreSDNode>(N);
23635 EVT VT = St->getValue().getValueType();
23636 EVT StVT = St->getMemoryVT();
23638 SDValue StoredVal = St->getOperand(1);
23639 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23641 // If we are saving a concatenation of two XMM registers, perform two stores.
23642 // On Sandy Bridge, 256-bit memory operations are executed by two
23643 // 128-bit ports. However, on Haswell it is better to issue a single 256-bit
23644 // memory operation.
23645 unsigned Alignment = St->getAlignment();
23646 bool IsAligned = Alignment == 0 || Alignment >= VT.getSizeInBits()/8;
23647 if (VT.is256BitVector() && !Subtarget->hasInt256() &&
23648 StVT == VT && !IsAligned) {
23649 unsigned NumElems = VT.getVectorNumElements();
23653 SDValue Value0 = Extract128BitVector(StoredVal, 0, DAG, dl);
23654 SDValue Value1 = Extract128BitVector(StoredVal, NumElems/2, DAG, dl);
23656 SDValue Stride = DAG.getConstant(16, TLI.getPointerTy());
23657 SDValue Ptr0 = St->getBasePtr();
23658 SDValue Ptr1 = DAG.getNode(ISD::ADD, dl, Ptr0.getValueType(), Ptr0, Stride);
23660 SDValue Ch0 = DAG.getStore(St->getChain(), dl, Value0, Ptr0,
23661 St->getPointerInfo(), St->isVolatile(),
23662 St->isNonTemporal(), Alignment);
23663 SDValue Ch1 = DAG.getStore(St->getChain(), dl, Value1, Ptr1,
23664 St->getPointerInfo(), St->isVolatile(),
23665 St->isNonTemporal(),
23666 std::min(16U, Alignment));
23667 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ch0, Ch1);
23670 // Optimize trunc store (of multiple scalars) to shuffle and store.
23671 // First, pack all of the elements in one place. Next, store to memory
23672 // in fewer chunks.
23673 if (St->isTruncatingStore() && VT.isVector()) {
23674 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
23675 unsigned NumElems = VT.getVectorNumElements();
23676 assert(StVT != VT && "Cannot truncate to the same type");
23677 unsigned FromSz = VT.getVectorElementType().getSizeInBits();
23678 unsigned ToSz = StVT.getVectorElementType().getSizeInBits();
23680 // From, To sizes and ElemCount must be pow of two
23681 if (!isPowerOf2_32(NumElems * FromSz * ToSz)) return SDValue();
23682 // We are going to use the original vector elt for storing.
23683 // Accumulated smaller vector elements must be a multiple of the store size.
23684 if (0 != (NumElems * FromSz) % ToSz) return SDValue();
23686 unsigned SizeRatio = FromSz / ToSz;
23688 assert(SizeRatio * NumElems * ToSz == VT.getSizeInBits());
23690 // Create a type on which we perform the shuffle
23691 EVT WideVecVT = EVT::getVectorVT(*DAG.getContext(),
23692 StVT.getScalarType(), NumElems*SizeRatio);
23694 assert(WideVecVT.getSizeInBits() == VT.getSizeInBits());
23696 SDValue WideVec = DAG.getNode(ISD::BITCAST, dl, WideVecVT, St->getValue());
23697 SmallVector<int, 8> ShuffleVec(NumElems * SizeRatio, -1);
23698 for (unsigned i = 0; i != NumElems; ++i)
23699 ShuffleVec[i] = i * SizeRatio;
23701 // Can't shuffle using an illegal type.
23702 if (!TLI.isTypeLegal(WideVecVT))
23705 SDValue Shuff = DAG.getVectorShuffle(WideVecVT, dl, WideVec,
23706 DAG.getUNDEF(WideVecVT),
23708 // At this point all of the data is stored at the bottom of the
23709 // register. We now need to save it to mem.
23711 // Find the largest store unit
23712 MVT StoreType = MVT::i8;
23713 for (unsigned tp = MVT::FIRST_INTEGER_VALUETYPE;
23714 tp < MVT::LAST_INTEGER_VALUETYPE; ++tp) {
23715 MVT Tp = (MVT::SimpleValueType)tp;
23716 if (TLI.isTypeLegal(Tp) && Tp.getSizeInBits() <= NumElems * ToSz)
23720 // On 32bit systems, we can't save 64bit integers. Try bitcasting to F64.
23721 if (TLI.isTypeLegal(MVT::f64) && StoreType.getSizeInBits() < 64 &&
23722 (64 <= NumElems * ToSz))
23723 StoreType = MVT::f64;
23725 // Bitcast the original vector into a vector of store-size units
23726 EVT StoreVecVT = EVT::getVectorVT(*DAG.getContext(),
23727 StoreType, VT.getSizeInBits()/StoreType.getSizeInBits());
23728 assert(StoreVecVT.getSizeInBits() == VT.getSizeInBits());
23729 SDValue ShuffWide = DAG.getNode(ISD::BITCAST, dl, StoreVecVT, Shuff);
23730 SmallVector<SDValue, 8> Chains;
23731 SDValue Increment = DAG.getConstant(StoreType.getSizeInBits()/8,
23732 TLI.getPointerTy());
23733 SDValue Ptr = St->getBasePtr();
23735 // Perform one or more big stores into memory.
23736 for (unsigned i=0, e=(ToSz*NumElems)/StoreType.getSizeInBits(); i!=e; ++i) {
23737 SDValue SubVec = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
23738 StoreType, ShuffWide,
23739 DAG.getIntPtrConstant(i));
23740 SDValue Ch = DAG.getStore(St->getChain(), dl, SubVec, Ptr,
23741 St->getPointerInfo(), St->isVolatile(),
23742 St->isNonTemporal(), St->getAlignment());
23743 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
23744 Chains.push_back(Ch);
23747 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
23750 // Turn load->store of MMX types into GPR load/stores. This avoids clobbering
23751 // the FP state in cases where an emms may be missing.
23752 // A preferable solution to the general problem is to figure out the right
23753 // places to insert EMMS. This qualifies as a quick hack.
23755 // Similarly, turn load->store of i64 into double load/stores in 32-bit mode.
23756 if (VT.getSizeInBits() != 64)
23759 const Function *F = DAG.getMachineFunction().getFunction();
23760 bool NoImplicitFloatOps = F->getAttributes().
23761 hasAttribute(AttributeSet::FunctionIndex, Attribute::NoImplicitFloat);
23762 bool F64IsLegal = !DAG.getTarget().Options.UseSoftFloat && !NoImplicitFloatOps
23763 && Subtarget->hasSSE2();
23764 if ((VT.isVector() ||
23765 (VT == MVT::i64 && F64IsLegal && !Subtarget->is64Bit())) &&
23766 isa<LoadSDNode>(St->getValue()) &&
23767 !cast<LoadSDNode>(St->getValue())->isVolatile() &&
23768 St->getChain().hasOneUse() && !St->isVolatile()) {
23769 SDNode* LdVal = St->getValue().getNode();
23770 LoadSDNode *Ld = nullptr;
23771 int TokenFactorIndex = -1;
23772 SmallVector<SDValue, 8> Ops;
23773 SDNode* ChainVal = St->getChain().getNode();
23774 // Must be a store of a load. We currently handle two cases: the load
23775 // is a direct child, and it's under an intervening TokenFactor. It is
23776 // possible to dig deeper under nested TokenFactors.
23777 if (ChainVal == LdVal)
23778 Ld = cast<LoadSDNode>(St->getChain());
23779 else if (St->getValue().hasOneUse() &&
23780 ChainVal->getOpcode() == ISD::TokenFactor) {
23781 for (unsigned i = 0, e = ChainVal->getNumOperands(); i != e; ++i) {
23782 if (ChainVal->getOperand(i).getNode() == LdVal) {
23783 TokenFactorIndex = i;
23784 Ld = cast<LoadSDNode>(St->getValue());
23786 Ops.push_back(ChainVal->getOperand(i));
23790 if (!Ld || !ISD::isNormalLoad(Ld))
23793 // If this is not the MMX case, i.e. we are just turning i64 load/store
23794 // into f64 load/store, avoid the transformation if there are multiple
23795 // uses of the loaded value.
23796 if (!VT.isVector() && !Ld->hasNUsesOfValue(1, 0))
23801 // If we are a 64-bit capable x86, lower to a single movq load/store pair.
23802 // Otherwise, if it's legal to use f64 SSE instructions, use f64 load/store
23804 if (Subtarget->is64Bit() || F64IsLegal) {
23805 EVT LdVT = Subtarget->is64Bit() ? MVT::i64 : MVT::f64;
23806 SDValue NewLd = DAG.getLoad(LdVT, LdDL, Ld->getChain(), Ld->getBasePtr(),
23807 Ld->getPointerInfo(), Ld->isVolatile(),
23808 Ld->isNonTemporal(), Ld->isInvariant(),
23809 Ld->getAlignment());
23810 SDValue NewChain = NewLd.getValue(1);
23811 if (TokenFactorIndex != -1) {
23812 Ops.push_back(NewChain);
23813 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23815 return DAG.getStore(NewChain, StDL, NewLd, St->getBasePtr(),
23816 St->getPointerInfo(),
23817 St->isVolatile(), St->isNonTemporal(),
23818 St->getAlignment());
23821 // Otherwise, lower to two pairs of 32-bit loads / stores.
23822 SDValue LoAddr = Ld->getBasePtr();
23823 SDValue HiAddr = DAG.getNode(ISD::ADD, LdDL, MVT::i32, LoAddr,
23824 DAG.getConstant(4, MVT::i32));
23826 SDValue LoLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), LoAddr,
23827 Ld->getPointerInfo(),
23828 Ld->isVolatile(), Ld->isNonTemporal(),
23829 Ld->isInvariant(), Ld->getAlignment());
23830 SDValue HiLd = DAG.getLoad(MVT::i32, LdDL, Ld->getChain(), HiAddr,
23831 Ld->getPointerInfo().getWithOffset(4),
23832 Ld->isVolatile(), Ld->isNonTemporal(),
23834 MinAlign(Ld->getAlignment(), 4));
23836 SDValue NewChain = LoLd.getValue(1);
23837 if (TokenFactorIndex != -1) {
23838 Ops.push_back(LoLd);
23839 Ops.push_back(HiLd);
23840 NewChain = DAG.getNode(ISD::TokenFactor, LdDL, MVT::Other, Ops);
23843 LoAddr = St->getBasePtr();
23844 HiAddr = DAG.getNode(ISD::ADD, StDL, MVT::i32, LoAddr,
23845 DAG.getConstant(4, MVT::i32));
23847 SDValue LoSt = DAG.getStore(NewChain, StDL, LoLd, LoAddr,
23848 St->getPointerInfo(),
23849 St->isVolatile(), St->isNonTemporal(),
23850 St->getAlignment());
23851 SDValue HiSt = DAG.getStore(NewChain, StDL, HiLd, HiAddr,
23852 St->getPointerInfo().getWithOffset(4),
23854 St->isNonTemporal(),
23855 MinAlign(St->getAlignment(), 4));
23856 return DAG.getNode(ISD::TokenFactor, StDL, MVT::Other, LoSt, HiSt);
23861 /// isHorizontalBinOp - Return 'true' if this vector operation is "horizontal"
23862 /// and return the operands for the horizontal operation in LHS and RHS. A
23863 /// horizontal operation performs the binary operation on successive elements
23864 /// of its first operand, then on successive elements of its second operand,
23865 /// returning the resulting values in a vector. For example, if
23866 /// A = < float a0, float a1, float a2, float a3 >
23868 /// B = < float b0, float b1, float b2, float b3 >
23869 /// then the result of doing a horizontal operation on A and B is
23870 /// A horizontal-op B = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >.
23871 /// In short, LHS and RHS are inspected to see if LHS op RHS is of the form
23872 /// A horizontal-op B, for some already available A and B, and if so then LHS is
23873 /// set to A, RHS to B, and the routine returns 'true'.
23874 /// Note that the binary operation should have the property that if one of the
23875 /// operands is UNDEF then the result is UNDEF.
23876 static bool isHorizontalBinOp(SDValue &LHS, SDValue &RHS, bool IsCommutative) {
23877 // Look for the following pattern: if
23878 // A = < float a0, float a1, float a2, float a3 >
23879 // B = < float b0, float b1, float b2, float b3 >
23881 // LHS = VECTOR_SHUFFLE A, B, <0, 2, 4, 6>
23882 // RHS = VECTOR_SHUFFLE A, B, <1, 3, 5, 7>
23883 // then LHS op RHS = < a0 op a1, a2 op a3, b0 op b1, b2 op b3 >
23884 // which is A horizontal-op B.
23886 // At least one of the operands should be a vector shuffle.
23887 if (LHS.getOpcode() != ISD::VECTOR_SHUFFLE &&
23888 RHS.getOpcode() != ISD::VECTOR_SHUFFLE)
23891 MVT VT = LHS.getSimpleValueType();
23893 assert((VT.is128BitVector() || VT.is256BitVector()) &&
23894 "Unsupported vector type for horizontal add/sub");
23896 // Handle 128 and 256-bit vector lengths. AVX defines horizontal add/sub to
23897 // operate independently on 128-bit lanes.
23898 unsigned NumElts = VT.getVectorNumElements();
23899 unsigned NumLanes = VT.getSizeInBits()/128;
23900 unsigned NumLaneElts = NumElts / NumLanes;
23901 assert((NumLaneElts % 2 == 0) &&
23902 "Vector type should have an even number of elements in each lane");
23903 unsigned HalfLaneElts = NumLaneElts/2;
23905 // View LHS in the form
23906 // LHS = VECTOR_SHUFFLE A, B, LMask
23907 // If LHS is not a shuffle then pretend it is the shuffle
23908 // LHS = VECTOR_SHUFFLE LHS, undef, <0, 1, ..., N-1>
23909 // NOTE: in what follows a default initialized SDValue represents an UNDEF of
23912 SmallVector<int, 16> LMask(NumElts);
23913 if (LHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23914 if (LHS.getOperand(0).getOpcode() != ISD::UNDEF)
23915 A = LHS.getOperand(0);
23916 if (LHS.getOperand(1).getOpcode() != ISD::UNDEF)
23917 B = LHS.getOperand(1);
23918 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(LHS.getNode())->getMask();
23919 std::copy(Mask.begin(), Mask.end(), LMask.begin());
23921 if (LHS.getOpcode() != ISD::UNDEF)
23923 for (unsigned i = 0; i != NumElts; ++i)
23927 // Likewise, view RHS in the form
23928 // RHS = VECTOR_SHUFFLE C, D, RMask
23930 SmallVector<int, 16> RMask(NumElts);
23931 if (RHS.getOpcode() == ISD::VECTOR_SHUFFLE) {
23932 if (RHS.getOperand(0).getOpcode() != ISD::UNDEF)
23933 C = RHS.getOperand(0);
23934 if (RHS.getOperand(1).getOpcode() != ISD::UNDEF)
23935 D = RHS.getOperand(1);
23936 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(RHS.getNode())->getMask();
23937 std::copy(Mask.begin(), Mask.end(), RMask.begin());
23939 if (RHS.getOpcode() != ISD::UNDEF)
23941 for (unsigned i = 0; i != NumElts; ++i)
23945 // Check that the shuffles are both shuffling the same vectors.
23946 if (!(A == C && B == D) && !(A == D && B == C))
23949 // If everything is UNDEF then bail out: it would be better to fold to UNDEF.
23950 if (!A.getNode() && !B.getNode())
23953 // If A and B occur in reverse order in RHS, then "swap" them (which means
23954 // rewriting the mask).
23956 CommuteVectorShuffleMask(RMask, NumElts);
23958 // At this point LHS and RHS are equivalent to
23959 // LHS = VECTOR_SHUFFLE A, B, LMask
23960 // RHS = VECTOR_SHUFFLE A, B, RMask
23961 // Check that the masks correspond to performing a horizontal operation.
23962 for (unsigned l = 0; l != NumElts; l += NumLaneElts) {
23963 for (unsigned i = 0; i != NumLaneElts; ++i) {
23964 int LIdx = LMask[i+l], RIdx = RMask[i+l];
23966 // Ignore any UNDEF components.
23967 if (LIdx < 0 || RIdx < 0 ||
23968 (!A.getNode() && (LIdx < (int)NumElts || RIdx < (int)NumElts)) ||
23969 (!B.getNode() && (LIdx >= (int)NumElts || RIdx >= (int)NumElts)))
23972 // Check that successive elements are being operated on. If not, this is
23973 // not a horizontal operation.
23974 unsigned Src = (i/HalfLaneElts); // each lane is split between srcs
23975 int Index = 2*(i%HalfLaneElts) + NumElts*Src + l;
23976 if (!(LIdx == Index && RIdx == Index + 1) &&
23977 !(IsCommutative && LIdx == Index + 1 && RIdx == Index))
23982 LHS = A.getNode() ? A : B; // If A is 'UNDEF', use B for it.
23983 RHS = B.getNode() ? B : A; // If B is 'UNDEF', use A for it.
23987 /// PerformFADDCombine - Do target-specific dag combines on floating point adds.
23988 static SDValue PerformFADDCombine(SDNode *N, SelectionDAG &DAG,
23989 const X86Subtarget *Subtarget) {
23990 EVT VT = N->getValueType(0);
23991 SDValue LHS = N->getOperand(0);
23992 SDValue RHS = N->getOperand(1);
23994 // Try to synthesize horizontal adds from adds of shuffles.
23995 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
23996 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
23997 isHorizontalBinOp(LHS, RHS, true))
23998 return DAG.getNode(X86ISD::FHADD, SDLoc(N), VT, LHS, RHS);
24002 /// PerformFSUBCombine - Do target-specific dag combines on floating point subs.
24003 static SDValue PerformFSUBCombine(SDNode *N, SelectionDAG &DAG,
24004 const X86Subtarget *Subtarget) {
24005 EVT VT = N->getValueType(0);
24006 SDValue LHS = N->getOperand(0);
24007 SDValue RHS = N->getOperand(1);
24009 // Try to synthesize horizontal subs from subs of shuffles.
24010 if (((Subtarget->hasSSE3() && (VT == MVT::v4f32 || VT == MVT::v2f64)) ||
24011 (Subtarget->hasFp256() && (VT == MVT::v8f32 || VT == MVT::v4f64))) &&
24012 isHorizontalBinOp(LHS, RHS, false))
24013 return DAG.getNode(X86ISD::FHSUB, SDLoc(N), VT, LHS, RHS);
24017 /// PerformFORCombine - Do target-specific dag combines on X86ISD::FOR and
24018 /// X86ISD::FXOR nodes.
24019 static SDValue PerformFORCombine(SDNode *N, SelectionDAG &DAG) {
24020 assert(N->getOpcode() == X86ISD::FOR || N->getOpcode() == X86ISD::FXOR);
24021 // F[X]OR(0.0, x) -> x
24022 // F[X]OR(x, 0.0) -> x
24023 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24024 if (C->getValueAPF().isPosZero())
24025 return N->getOperand(1);
24026 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24027 if (C->getValueAPF().isPosZero())
24028 return N->getOperand(0);
24032 /// PerformFMinFMaxCombine - Do target-specific dag combines on X86ISD::FMIN and
24033 /// X86ISD::FMAX nodes.
24034 static SDValue PerformFMinFMaxCombine(SDNode *N, SelectionDAG &DAG) {
24035 assert(N->getOpcode() == X86ISD::FMIN || N->getOpcode() == X86ISD::FMAX);
24037 // Only perform optimizations if UnsafeMath is used.
24038 if (!DAG.getTarget().Options.UnsafeFPMath)
24041 // If we run in unsafe-math mode, then convert the FMAX and FMIN nodes
24042 // into FMINC and FMAXC, which are Commutative operations.
24043 unsigned NewOp = 0;
24044 switch (N->getOpcode()) {
24045 default: llvm_unreachable("unknown opcode");
24046 case X86ISD::FMIN: NewOp = X86ISD::FMINC; break;
24047 case X86ISD::FMAX: NewOp = X86ISD::FMAXC; break;
24050 return DAG.getNode(NewOp, SDLoc(N), N->getValueType(0),
24051 N->getOperand(0), N->getOperand(1));
24054 /// PerformFANDCombine - Do target-specific dag combines on X86ISD::FAND nodes.
24055 static SDValue PerformFANDCombine(SDNode *N, SelectionDAG &DAG) {
24056 // FAND(0.0, x) -> 0.0
24057 // FAND(x, 0.0) -> 0.0
24058 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24059 if (C->getValueAPF().isPosZero())
24060 return N->getOperand(0);
24061 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24062 if (C->getValueAPF().isPosZero())
24063 return N->getOperand(1);
24067 /// PerformFANDNCombine - Do target-specific dag combines on X86ISD::FANDN nodes
24068 static SDValue PerformFANDNCombine(SDNode *N, SelectionDAG &DAG) {
24069 // FANDN(x, 0.0) -> 0.0
24070 // FANDN(0.0, x) -> x
24071 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(0)))
24072 if (C->getValueAPF().isPosZero())
24073 return N->getOperand(1);
24074 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(N->getOperand(1)))
24075 if (C->getValueAPF().isPosZero())
24076 return N->getOperand(1);
24080 static SDValue PerformBTCombine(SDNode *N,
24082 TargetLowering::DAGCombinerInfo &DCI) {
24083 // BT ignores high bits in the bit index operand.
24084 SDValue Op1 = N->getOperand(1);
24085 if (Op1.hasOneUse()) {
24086 unsigned BitWidth = Op1.getValueSizeInBits();
24087 APInt DemandedMask = APInt::getLowBitsSet(BitWidth, Log2_32(BitWidth));
24088 APInt KnownZero, KnownOne;
24089 TargetLowering::TargetLoweringOpt TLO(DAG, !DCI.isBeforeLegalize(),
24090 !DCI.isBeforeLegalizeOps());
24091 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
24092 if (TLO.ShrinkDemandedConstant(Op1, DemandedMask) ||
24093 TLI.SimplifyDemandedBits(Op1, DemandedMask, KnownZero, KnownOne, TLO))
24094 DCI.CommitTargetLoweringOpt(TLO);
24099 static SDValue PerformVZEXT_MOVLCombine(SDNode *N, SelectionDAG &DAG) {
24100 SDValue Op = N->getOperand(0);
24101 if (Op.getOpcode() == ISD::BITCAST)
24102 Op = Op.getOperand(0);
24103 EVT VT = N->getValueType(0), OpVT = Op.getValueType();
24104 if (Op.getOpcode() == X86ISD::VZEXT_LOAD &&
24105 VT.getVectorElementType().getSizeInBits() ==
24106 OpVT.getVectorElementType().getSizeInBits()) {
24107 return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
24112 static SDValue PerformSIGN_EXTEND_INREGCombine(SDNode *N, SelectionDAG &DAG,
24113 const X86Subtarget *Subtarget) {
24114 EVT VT = N->getValueType(0);
24115 if (!VT.isVector())
24118 SDValue N0 = N->getOperand(0);
24119 SDValue N1 = N->getOperand(1);
24120 EVT ExtraVT = cast<VTSDNode>(N1)->getVT();
24123 // The SIGN_EXTEND_INREG to v4i64 is expensive operation on the
24124 // both SSE and AVX2 since there is no sign-extended shift right
24125 // operation on a vector with 64-bit elements.
24126 //(sext_in_reg (v4i64 anyext (v4i32 x )), ExtraVT) ->
24127 // (v4i64 sext (v4i32 sext_in_reg (v4i32 x , ExtraVT)))
24128 if (VT == MVT::v4i64 && (N0.getOpcode() == ISD::ANY_EXTEND ||
24129 N0.getOpcode() == ISD::SIGN_EXTEND)) {
24130 SDValue N00 = N0.getOperand(0);
24132 // EXTLOAD has a better solution on AVX2,
24133 // it may be replaced with X86ISD::VSEXT node.
24134 if (N00.getOpcode() == ISD::LOAD && Subtarget->hasInt256())
24135 if (!ISD::isNormalLoad(N00.getNode()))
24138 if (N00.getValueType() == MVT::v4i32 && ExtraVT.getSizeInBits() < 128) {
24139 SDValue Tmp = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, MVT::v4i32,
24141 return DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::v4i64, Tmp);
24147 static SDValue PerformSExtCombine(SDNode *N, SelectionDAG &DAG,
24148 TargetLowering::DAGCombinerInfo &DCI,
24149 const X86Subtarget *Subtarget) {
24150 if (!DCI.isBeforeLegalizeOps())
24153 if (!Subtarget->hasFp256())
24156 EVT VT = N->getValueType(0);
24157 if (VT.isVector() && VT.getSizeInBits() == 256) {
24158 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24166 static SDValue PerformFMACombine(SDNode *N, SelectionDAG &DAG,
24167 const X86Subtarget* Subtarget) {
24169 EVT VT = N->getValueType(0);
24171 // Let legalize expand this if it isn't a legal type yet.
24172 if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
24175 EVT ScalarVT = VT.getScalarType();
24176 if ((ScalarVT != MVT::f32 && ScalarVT != MVT::f64) ||
24177 (!Subtarget->hasFMA() && !Subtarget->hasFMA4()))
24180 SDValue A = N->getOperand(0);
24181 SDValue B = N->getOperand(1);
24182 SDValue C = N->getOperand(2);
24184 bool NegA = (A.getOpcode() == ISD::FNEG);
24185 bool NegB = (B.getOpcode() == ISD::FNEG);
24186 bool NegC = (C.getOpcode() == ISD::FNEG);
24188 // Negative multiplication when NegA xor NegB
24189 bool NegMul = (NegA != NegB);
24191 A = A.getOperand(0);
24193 B = B.getOperand(0);
24195 C = C.getOperand(0);
24199 Opcode = (!NegC) ? X86ISD::FMADD : X86ISD::FMSUB;
24201 Opcode = (!NegC) ? X86ISD::FNMADD : X86ISD::FNMSUB;
24203 return DAG.getNode(Opcode, dl, VT, A, B, C);
24206 static SDValue PerformZExtCombine(SDNode *N, SelectionDAG &DAG,
24207 TargetLowering::DAGCombinerInfo &DCI,
24208 const X86Subtarget *Subtarget) {
24209 // (i32 zext (and (i8 x86isd::setcc_carry), 1)) ->
24210 // (and (i32 x86isd::setcc_carry), 1)
24211 // This eliminates the zext. This transformation is necessary because
24212 // ISD::SETCC is always legalized to i8.
24214 SDValue N0 = N->getOperand(0);
24215 EVT VT = N->getValueType(0);
24217 if (N0.getOpcode() == ISD::AND &&
24219 N0.getOperand(0).hasOneUse()) {
24220 SDValue N00 = N0.getOperand(0);
24221 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24222 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
24223 if (!C || C->getZExtValue() != 1)
24225 return DAG.getNode(ISD::AND, dl, VT,
24226 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24227 N00.getOperand(0), N00.getOperand(1)),
24228 DAG.getConstant(1, VT));
24232 if (N0.getOpcode() == ISD::TRUNCATE &&
24234 N0.getOperand(0).hasOneUse()) {
24235 SDValue N00 = N0.getOperand(0);
24236 if (N00.getOpcode() == X86ISD::SETCC_CARRY) {
24237 return DAG.getNode(ISD::AND, dl, VT,
24238 DAG.getNode(X86ISD::SETCC_CARRY, dl, VT,
24239 N00.getOperand(0), N00.getOperand(1)),
24240 DAG.getConstant(1, VT));
24243 if (VT.is256BitVector()) {
24244 SDValue R = WidenMaskArithmetic(N, DAG, DCI, Subtarget);
24252 // Optimize x == -y --> x+y == 0
24253 // x != -y --> x+y != 0
24254 static SDValue PerformISDSETCCCombine(SDNode *N, SelectionDAG &DAG,
24255 const X86Subtarget* Subtarget) {
24256 ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get();
24257 SDValue LHS = N->getOperand(0);
24258 SDValue RHS = N->getOperand(1);
24259 EVT VT = N->getValueType(0);
24262 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && LHS.getOpcode() == ISD::SUB)
24263 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHS.getOperand(0)))
24264 if (C->getAPIntValue() == 0 && LHS.hasOneUse()) {
24265 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24266 LHS.getValueType(), RHS, LHS.getOperand(1));
24267 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24268 addV, DAG.getConstant(0, addV.getValueType()), CC);
24270 if ((CC == ISD::SETNE || CC == ISD::SETEQ) && RHS.getOpcode() == ISD::SUB)
24271 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHS.getOperand(0)))
24272 if (C->getAPIntValue() == 0 && RHS.hasOneUse()) {
24273 SDValue addV = DAG.getNode(ISD::ADD, SDLoc(N),
24274 RHS.getValueType(), LHS, RHS.getOperand(1));
24275 return DAG.getSetCC(SDLoc(N), N->getValueType(0),
24276 addV, DAG.getConstant(0, addV.getValueType()), CC);
24279 if (VT.getScalarType() == MVT::i1) {
24280 bool IsSEXT0 = (LHS.getOpcode() == ISD::SIGN_EXTEND) &&
24281 (LHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24282 bool IsVZero0 = ISD::isBuildVectorAllZeros(LHS.getNode());
24283 if (!IsSEXT0 && !IsVZero0)
24285 bool IsSEXT1 = (RHS.getOpcode() == ISD::SIGN_EXTEND) &&
24286 (RHS.getOperand(0).getValueType().getScalarType() == MVT::i1);
24287 bool IsVZero1 = ISD::isBuildVectorAllZeros(RHS.getNode());
24289 if (!IsSEXT1 && !IsVZero1)
24292 if (IsSEXT0 && IsVZero1) {
24293 assert(VT == LHS.getOperand(0).getValueType() && "Uexpected operand type");
24294 if (CC == ISD::SETEQ)
24295 return DAG.getNOT(DL, LHS.getOperand(0), VT);
24296 return LHS.getOperand(0);
24298 if (IsSEXT1 && IsVZero0) {
24299 assert(VT == RHS.getOperand(0).getValueType() && "Uexpected operand type");
24300 if (CC == ISD::SETEQ)
24301 return DAG.getNOT(DL, RHS.getOperand(0), VT);
24302 return RHS.getOperand(0);
24309 static SDValue PerformINSERTPSCombine(SDNode *N, SelectionDAG &DAG,
24310 const X86Subtarget *Subtarget) {
24312 MVT VT = N->getOperand(1)->getSimpleValueType(0);
24313 assert((VT == MVT::v4f32 || VT == MVT::v4i32) &&
24314 "X86insertps is only defined for v4x32");
24316 SDValue Ld = N->getOperand(1);
24317 if (MayFoldLoad(Ld)) {
24318 // Extract the countS bits from the immediate so we can get the proper
24319 // address when narrowing the vector load to a specific element.
24320 // When the second source op is a memory address, interps doesn't use
24321 // countS and just gets an f32 from that address.
24322 unsigned DestIndex =
24323 cast<ConstantSDNode>(N->getOperand(2))->getZExtValue() >> 6;
24324 Ld = NarrowVectorLoadToElement(cast<LoadSDNode>(Ld), DestIndex, DAG);
24328 // Create this as a scalar to vector to match the instruction pattern.
24329 SDValue LoadScalarToVector = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Ld);
24330 // countS bits are ignored when loading from memory on insertps, which
24331 // means we don't need to explicitly set them to 0.
24332 return DAG.getNode(X86ISD::INSERTPS, dl, VT, N->getOperand(0),
24333 LoadScalarToVector, N->getOperand(2));
24336 // Helper function of PerformSETCCCombine. It is to materialize "setb reg"
24337 // as "sbb reg,reg", since it can be extended without zext and produces
24338 // an all-ones bit which is more useful than 0/1 in some cases.
24339 static SDValue MaterializeSETB(SDLoc DL, SDValue EFLAGS, SelectionDAG &DAG,
24342 return DAG.getNode(ISD::AND, DL, VT,
24343 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24344 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS),
24345 DAG.getConstant(1, VT));
24346 assert (VT == MVT::i1 && "Unexpected type for SECCC node");
24347 return DAG.getNode(ISD::TRUNCATE, DL, MVT::i1,
24348 DAG.getNode(X86ISD::SETCC_CARRY, DL, MVT::i8,
24349 DAG.getConstant(X86::COND_B, MVT::i8), EFLAGS));
24352 // Optimize RES = X86ISD::SETCC CONDCODE, EFLAG_INPUT
24353 static SDValue PerformSETCCCombine(SDNode *N, SelectionDAG &DAG,
24354 TargetLowering::DAGCombinerInfo &DCI,
24355 const X86Subtarget *Subtarget) {
24357 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(0));
24358 SDValue EFLAGS = N->getOperand(1);
24360 if (CC == X86::COND_A) {
24361 // Try to convert COND_A into COND_B in an attempt to facilitate
24362 // materializing "setb reg".
24364 // Do not flip "e > c", where "c" is a constant, because Cmp instruction
24365 // cannot take an immediate as its first operand.
24367 if (EFLAGS.getOpcode() == X86ISD::SUB && EFLAGS.hasOneUse() &&
24368 EFLAGS.getValueType().isInteger() &&
24369 !isa<ConstantSDNode>(EFLAGS.getOperand(1))) {
24370 SDValue NewSub = DAG.getNode(X86ISD::SUB, SDLoc(EFLAGS),
24371 EFLAGS.getNode()->getVTList(),
24372 EFLAGS.getOperand(1), EFLAGS.getOperand(0));
24373 SDValue NewEFLAGS = SDValue(NewSub.getNode(), EFLAGS.getResNo());
24374 return MaterializeSETB(DL, NewEFLAGS, DAG, N->getSimpleValueType(0));
24378 // Materialize "setb reg" as "sbb reg,reg", since it can be extended without
24379 // a zext and produces an all-ones bit which is more useful than 0/1 in some
24381 if (CC == X86::COND_B)
24382 return MaterializeSETB(DL, EFLAGS, DAG, N->getSimpleValueType(0));
24386 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24387 if (Flags.getNode()) {
24388 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24389 return DAG.getNode(X86ISD::SETCC, DL, N->getVTList(), Cond, Flags);
24395 // Optimize branch condition evaluation.
24397 static SDValue PerformBrCondCombine(SDNode *N, SelectionDAG &DAG,
24398 TargetLowering::DAGCombinerInfo &DCI,
24399 const X86Subtarget *Subtarget) {
24401 SDValue Chain = N->getOperand(0);
24402 SDValue Dest = N->getOperand(1);
24403 SDValue EFLAGS = N->getOperand(3);
24404 X86::CondCode CC = X86::CondCode(N->getConstantOperandVal(2));
24408 Flags = checkBoolTestSetCCCombine(EFLAGS, CC);
24409 if (Flags.getNode()) {
24410 SDValue Cond = DAG.getConstant(CC, MVT::i8);
24411 return DAG.getNode(X86ISD::BRCOND, DL, N->getVTList(), Chain, Dest, Cond,
24418 static SDValue performVectorCompareAndMaskUnaryOpCombine(SDNode *N,
24419 SelectionDAG &DAG) {
24420 // Take advantage of vector comparisons producing 0 or -1 in each lane to
24421 // optimize away operation when it's from a constant.
24423 // The general transformation is:
24424 // UNARYOP(AND(VECTOR_CMP(x,y), constant)) -->
24425 // AND(VECTOR_CMP(x,y), constant2)
24426 // constant2 = UNARYOP(constant)
24428 // Early exit if this isn't a vector operation, the operand of the
24429 // unary operation isn't a bitwise AND, or if the sizes of the operations
24430 // aren't the same.
24431 EVT VT = N->getValueType(0);
24432 if (!VT.isVector() || N->getOperand(0)->getOpcode() != ISD::AND ||
24433 N->getOperand(0)->getOperand(0)->getOpcode() != ISD::SETCC ||
24434 VT.getSizeInBits() != N->getOperand(0)->getValueType(0).getSizeInBits())
24437 // Now check that the other operand of the AND is a constant. We could
24438 // make the transformation for non-constant splats as well, but it's unclear
24439 // that would be a benefit as it would not eliminate any operations, just
24440 // perform one more step in scalar code before moving to the vector unit.
24441 if (BuildVectorSDNode *BV =
24442 dyn_cast<BuildVectorSDNode>(N->getOperand(0)->getOperand(1))) {
24443 // Bail out if the vector isn't a constant.
24444 if (!BV->isConstant())
24447 // Everything checks out. Build up the new and improved node.
24449 EVT IntVT = BV->getValueType(0);
24450 // Create a new constant of the appropriate type for the transformed
24452 SDValue SourceConst = DAG.getNode(N->getOpcode(), DL, VT, SDValue(BV, 0));
24453 // The AND node needs bitcasts to/from an integer vector type around it.
24454 SDValue MaskConst = DAG.getNode(ISD::BITCAST, DL, IntVT, SourceConst);
24455 SDValue NewAnd = DAG.getNode(ISD::AND, DL, IntVT,
24456 N->getOperand(0)->getOperand(0), MaskConst);
24457 SDValue Res = DAG.getNode(ISD::BITCAST, DL, VT, NewAnd);
24464 static SDValue PerformSINT_TO_FPCombine(SDNode *N, SelectionDAG &DAG,
24465 const X86TargetLowering *XTLI) {
24466 // First try to optimize away the conversion entirely when it's
24467 // conditionally from a constant. Vectors only.
24468 SDValue Res = performVectorCompareAndMaskUnaryOpCombine(N, DAG);
24469 if (Res != SDValue())
24472 // Now move on to more general possibilities.
24473 SDValue Op0 = N->getOperand(0);
24474 EVT InVT = Op0->getValueType(0);
24476 // SINT_TO_FP(v4i8) -> SINT_TO_FP(SEXT(v4i8 to v4i32))
24477 if (InVT == MVT::v8i8 || InVT == MVT::v4i8) {
24479 MVT DstVT = InVT == MVT::v4i8 ? MVT::v4i32 : MVT::v8i32;
24480 SDValue P = DAG.getNode(ISD::SIGN_EXTEND, dl, DstVT, Op0);
24481 return DAG.getNode(ISD::SINT_TO_FP, dl, N->getValueType(0), P);
24484 // Transform (SINT_TO_FP (i64 ...)) into an x87 operation if we have
24485 // a 32-bit target where SSE doesn't support i64->FP operations.
24486 if (Op0.getOpcode() == ISD::LOAD) {
24487 LoadSDNode *Ld = cast<LoadSDNode>(Op0.getNode());
24488 EVT VT = Ld->getValueType(0);
24489 if (!Ld->isVolatile() && !N->getValueType(0).isVector() &&
24490 ISD::isNON_EXTLoad(Op0.getNode()) && Op0.hasOneUse() &&
24491 !XTLI->getSubtarget()->is64Bit() &&
24493 SDValue FILDChain = XTLI->BuildFILD(SDValue(N, 0), Ld->getValueType(0),
24494 Ld->getChain(), Op0, DAG);
24495 DAG.ReplaceAllUsesOfValueWith(Op0.getValue(1), FILDChain.getValue(1));
24502 // Optimize RES, EFLAGS = X86ISD::ADC LHS, RHS, EFLAGS
24503 static SDValue PerformADCCombine(SDNode *N, SelectionDAG &DAG,
24504 X86TargetLowering::DAGCombinerInfo &DCI) {
24505 // If the LHS and RHS of the ADC node are zero, then it can't overflow and
24506 // the result is either zero or one (depending on the input carry bit).
24507 // Strength reduce this down to a "set on carry" aka SETCC_CARRY&1.
24508 if (X86::isZeroNode(N->getOperand(0)) &&
24509 X86::isZeroNode(N->getOperand(1)) &&
24510 // We don't have a good way to replace an EFLAGS use, so only do this when
24512 SDValue(N, 1).use_empty()) {
24514 EVT VT = N->getValueType(0);
24515 SDValue CarryOut = DAG.getConstant(0, N->getValueType(1));
24516 SDValue Res1 = DAG.getNode(ISD::AND, DL, VT,
24517 DAG.getNode(X86ISD::SETCC_CARRY, DL, VT,
24518 DAG.getConstant(X86::COND_B,MVT::i8),
24520 DAG.getConstant(1, VT));
24521 return DCI.CombineTo(N, Res1, CarryOut);
24527 // fold (add Y, (sete X, 0)) -> adc 0, Y
24528 // (add Y, (setne X, 0)) -> sbb -1, Y
24529 // (sub (sete X, 0), Y) -> sbb 0, Y
24530 // (sub (setne X, 0), Y) -> adc -1, Y
24531 static SDValue OptimizeConditionalInDecrement(SDNode *N, SelectionDAG &DAG) {
24534 // Look through ZExts.
24535 SDValue Ext = N->getOperand(N->getOpcode() == ISD::SUB ? 1 : 0);
24536 if (Ext.getOpcode() != ISD::ZERO_EXTEND || !Ext.hasOneUse())
24539 SDValue SetCC = Ext.getOperand(0);
24540 if (SetCC.getOpcode() != X86ISD::SETCC || !SetCC.hasOneUse())
24543 X86::CondCode CC = (X86::CondCode)SetCC.getConstantOperandVal(0);
24544 if (CC != X86::COND_E && CC != X86::COND_NE)
24547 SDValue Cmp = SetCC.getOperand(1);
24548 if (Cmp.getOpcode() != X86ISD::CMP || !Cmp.hasOneUse() ||
24549 !X86::isZeroNode(Cmp.getOperand(1)) ||
24550 !Cmp.getOperand(0).getValueType().isInteger())
24553 SDValue CmpOp0 = Cmp.getOperand(0);
24554 SDValue NewCmp = DAG.getNode(X86ISD::CMP, DL, MVT::i32, CmpOp0,
24555 DAG.getConstant(1, CmpOp0.getValueType()));
24557 SDValue OtherVal = N->getOperand(N->getOpcode() == ISD::SUB ? 0 : 1);
24558 if (CC == X86::COND_NE)
24559 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::ADC : X86ISD::SBB,
24560 DL, OtherVal.getValueType(), OtherVal,
24561 DAG.getConstant(-1ULL, OtherVal.getValueType()), NewCmp);
24562 return DAG.getNode(N->getOpcode() == ISD::SUB ? X86ISD::SBB : X86ISD::ADC,
24563 DL, OtherVal.getValueType(), OtherVal,
24564 DAG.getConstant(0, OtherVal.getValueType()), NewCmp);
24567 /// PerformADDCombine - Do target-specific dag combines on integer adds.
24568 static SDValue PerformAddCombine(SDNode *N, SelectionDAG &DAG,
24569 const X86Subtarget *Subtarget) {
24570 EVT VT = N->getValueType(0);
24571 SDValue Op0 = N->getOperand(0);
24572 SDValue Op1 = N->getOperand(1);
24574 // Try to synthesize horizontal adds from adds of shuffles.
24575 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24576 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24577 isHorizontalBinOp(Op0, Op1, true))
24578 return DAG.getNode(X86ISD::HADD, SDLoc(N), VT, Op0, Op1);
24580 return OptimizeConditionalInDecrement(N, DAG);
24583 static SDValue PerformSubCombine(SDNode *N, SelectionDAG &DAG,
24584 const X86Subtarget *Subtarget) {
24585 SDValue Op0 = N->getOperand(0);
24586 SDValue Op1 = N->getOperand(1);
24588 // X86 can't encode an immediate LHS of a sub. See if we can push the
24589 // negation into a preceding instruction.
24590 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op0)) {
24591 // If the RHS of the sub is a XOR with one use and a constant, invert the
24592 // immediate. Then add one to the LHS of the sub so we can turn
24593 // X-Y -> X+~Y+1, saving one register.
24594 if (Op1->hasOneUse() && Op1.getOpcode() == ISD::XOR &&
24595 isa<ConstantSDNode>(Op1.getOperand(1))) {
24596 APInt XorC = cast<ConstantSDNode>(Op1.getOperand(1))->getAPIntValue();
24597 EVT VT = Op0.getValueType();
24598 SDValue NewXor = DAG.getNode(ISD::XOR, SDLoc(Op1), VT,
24600 DAG.getConstant(~XorC, VT));
24601 return DAG.getNode(ISD::ADD, SDLoc(N), VT, NewXor,
24602 DAG.getConstant(C->getAPIntValue()+1, VT));
24606 // Try to synthesize horizontal adds from adds of shuffles.
24607 EVT VT = N->getValueType(0);
24608 if (((Subtarget->hasSSSE3() && (VT == MVT::v8i16 || VT == MVT::v4i32)) ||
24609 (Subtarget->hasInt256() && (VT == MVT::v16i16 || VT == MVT::v8i32))) &&
24610 isHorizontalBinOp(Op0, Op1, true))
24611 return DAG.getNode(X86ISD::HSUB, SDLoc(N), VT, Op0, Op1);
24613 return OptimizeConditionalInDecrement(N, DAG);
24616 /// performVZEXTCombine - Performs build vector combines
24617 static SDValue performVZEXTCombine(SDNode *N, SelectionDAG &DAG,
24618 TargetLowering::DAGCombinerInfo &DCI,
24619 const X86Subtarget *Subtarget) {
24620 // (vzext (bitcast (vzext (x)) -> (vzext x)
24621 SDValue In = N->getOperand(0);
24622 while (In.getOpcode() == ISD::BITCAST)
24623 In = In.getOperand(0);
24625 if (In.getOpcode() != X86ISD::VZEXT)
24628 return DAG.getNode(X86ISD::VZEXT, SDLoc(N), N->getValueType(0),
24632 SDValue X86TargetLowering::PerformDAGCombine(SDNode *N,
24633 DAGCombinerInfo &DCI) const {
24634 SelectionDAG &DAG = DCI.DAG;
24635 switch (N->getOpcode()) {
24637 case ISD::EXTRACT_VECTOR_ELT:
24638 return PerformEXTRACT_VECTOR_ELTCombine(N, DAG, DCI);
24640 case ISD::SELECT: return PerformSELECTCombine(N, DAG, DCI, Subtarget);
24641 case X86ISD::CMOV: return PerformCMOVCombine(N, DAG, DCI, Subtarget);
24642 case ISD::ADD: return PerformAddCombine(N, DAG, Subtarget);
24643 case ISD::SUB: return PerformSubCombine(N, DAG, Subtarget);
24644 case X86ISD::ADC: return PerformADCCombine(N, DAG, DCI);
24645 case ISD::MUL: return PerformMulCombine(N, DAG, DCI);
24648 case ISD::SRL: return PerformShiftCombine(N, DAG, DCI, Subtarget);
24649 case ISD::AND: return PerformAndCombine(N, DAG, DCI, Subtarget);
24650 case ISD::OR: return PerformOrCombine(N, DAG, DCI, Subtarget);
24651 case ISD::XOR: return PerformXorCombine(N, DAG, DCI, Subtarget);
24652 case ISD::LOAD: return PerformLOADCombine(N, DAG, DCI, Subtarget);
24653 case ISD::STORE: return PerformSTORECombine(N, DAG, Subtarget);
24654 case ISD::SINT_TO_FP: return PerformSINT_TO_FPCombine(N, DAG, this);
24655 case ISD::FADD: return PerformFADDCombine(N, DAG, Subtarget);
24656 case ISD::FSUB: return PerformFSUBCombine(N, DAG, Subtarget);
24658 case X86ISD::FOR: return PerformFORCombine(N, DAG);
24660 case X86ISD::FMAX: return PerformFMinFMaxCombine(N, DAG);
24661 case X86ISD::FAND: return PerformFANDCombine(N, DAG);
24662 case X86ISD::FANDN: return PerformFANDNCombine(N, DAG);
24663 case X86ISD::BT: return PerformBTCombine(N, DAG, DCI);
24664 case X86ISD::VZEXT_MOVL: return PerformVZEXT_MOVLCombine(N, DAG);
24665 case ISD::ANY_EXTEND:
24666 case ISD::ZERO_EXTEND: return PerformZExtCombine(N, DAG, DCI, Subtarget);
24667 case ISD::SIGN_EXTEND: return PerformSExtCombine(N, DAG, DCI, Subtarget);
24668 case ISD::SIGN_EXTEND_INREG:
24669 return PerformSIGN_EXTEND_INREGCombine(N, DAG, Subtarget);
24670 case ISD::TRUNCATE: return PerformTruncateCombine(N, DAG,DCI,Subtarget);
24671 case ISD::SETCC: return PerformISDSETCCCombine(N, DAG, Subtarget);
24672 case X86ISD::SETCC: return PerformSETCCCombine(N, DAG, DCI, Subtarget);
24673 case X86ISD::BRCOND: return PerformBrCondCombine(N, DAG, DCI, Subtarget);
24674 case X86ISD::VZEXT: return performVZEXTCombine(N, DAG, DCI, Subtarget);
24675 case X86ISD::SHUFP: // Handle all target specific shuffles
24676 case X86ISD::PALIGNR:
24677 case X86ISD::UNPCKH:
24678 case X86ISD::UNPCKL:
24679 case X86ISD::MOVHLPS:
24680 case X86ISD::MOVLHPS:
24681 case X86ISD::PSHUFB:
24682 case X86ISD::PSHUFD:
24683 case X86ISD::PSHUFHW:
24684 case X86ISD::PSHUFLW:
24685 case X86ISD::MOVSS:
24686 case X86ISD::MOVSD:
24687 case X86ISD::VPERMILPI:
24688 case X86ISD::VPERM2X128:
24689 case ISD::VECTOR_SHUFFLE: return PerformShuffleCombine(N, DAG, DCI,Subtarget);
24690 case ISD::FMA: return PerformFMACombine(N, DAG, Subtarget);
24691 case ISD::INTRINSIC_WO_CHAIN:
24692 return PerformINTRINSIC_WO_CHAINCombine(N, DAG, Subtarget);
24693 case X86ISD::INSERTPS:
24694 return PerformINSERTPSCombine(N, DAG, Subtarget);
24695 case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DAG, Subtarget);
24701 /// isTypeDesirableForOp - Return true if the target has native support for
24702 /// the specified value type and it is 'desirable' to use the type for the
24703 /// given node type. e.g. On x86 i16 is legal, but undesirable since i16
24704 /// instruction encodings are longer and some i16 instructions are slow.
24705 bool X86TargetLowering::isTypeDesirableForOp(unsigned Opc, EVT VT) const {
24706 if (!isTypeLegal(VT))
24708 if (VT != MVT::i16)
24715 case ISD::SIGN_EXTEND:
24716 case ISD::ZERO_EXTEND:
24717 case ISD::ANY_EXTEND:
24730 /// IsDesirableToPromoteOp - This method query the target whether it is
24731 /// beneficial for dag combiner to promote the specified node. If true, it
24732 /// should return the desired promotion type by reference.
24733 bool X86TargetLowering::IsDesirableToPromoteOp(SDValue Op, EVT &PVT) const {
24734 EVT VT = Op.getValueType();
24735 if (VT != MVT::i16)
24738 bool Promote = false;
24739 bool Commute = false;
24740 switch (Op.getOpcode()) {
24743 LoadSDNode *LD = cast<LoadSDNode>(Op);
24744 // If the non-extending load has a single use and it's not live out, then it
24745 // might be folded.
24746 if (LD->getExtensionType() == ISD::NON_EXTLOAD /*&&
24747 Op.hasOneUse()*/) {
24748 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
24749 UE = Op.getNode()->use_end(); UI != UE; ++UI) {
24750 // The only case where we'd want to promote LOAD (rather then it being
24751 // promoted as an operand is when it's only use is liveout.
24752 if (UI->getOpcode() != ISD::CopyToReg)
24759 case ISD::SIGN_EXTEND:
24760 case ISD::ZERO_EXTEND:
24761 case ISD::ANY_EXTEND:
24766 SDValue N0 = Op.getOperand(0);
24767 // Look out for (store (shl (load), x)).
24768 if (MayFoldLoad(N0) && MayFoldIntoStore(Op))
24781 SDValue N0 = Op.getOperand(0);
24782 SDValue N1 = Op.getOperand(1);
24783 if (!Commute && MayFoldLoad(N1))
24785 // Avoid disabling potential load folding opportunities.
24786 if (MayFoldLoad(N0) && (!isa<ConstantSDNode>(N1) || MayFoldIntoStore(Op)))
24788 if (MayFoldLoad(N1) && (!isa<ConstantSDNode>(N0) || MayFoldIntoStore(Op)))
24798 //===----------------------------------------------------------------------===//
24799 // X86 Inline Assembly Support
24800 //===----------------------------------------------------------------------===//
24803 // Helper to match a string separated by whitespace.
24804 bool matchAsmImpl(StringRef s, ArrayRef<const StringRef *> args) {
24805 s = s.substr(s.find_first_not_of(" \t")); // Skip leading whitespace.
24807 for (unsigned i = 0, e = args.size(); i != e; ++i) {
24808 StringRef piece(*args[i]);
24809 if (!s.startswith(piece)) // Check if the piece matches.
24812 s = s.substr(piece.size());
24813 StringRef::size_type pos = s.find_first_not_of(" \t");
24814 if (pos == 0) // We matched a prefix.
24822 const VariadicFunction1<bool, StringRef, StringRef, matchAsmImpl> matchAsm={};
24825 static bool clobbersFlagRegisters(const SmallVector<StringRef, 4> &AsmPieces) {
24827 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
24828 if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{cc}") &&
24829 std::count(AsmPieces.begin(), AsmPieces.end(), "~{flags}") &&
24830 std::count(AsmPieces.begin(), AsmPieces.end(), "~{fpsr}")) {
24832 if (AsmPieces.size() == 3)
24834 else if (std::count(AsmPieces.begin(), AsmPieces.end(), "~{dirflag}"))
24841 bool X86TargetLowering::ExpandInlineAsm(CallInst *CI) const {
24842 InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
24844 std::string AsmStr = IA->getAsmString();
24846 IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
24847 if (!Ty || Ty->getBitWidth() % 16 != 0)
24850 // TODO: should remove alternatives from the asmstring: "foo {a|b}" -> "foo a"
24851 SmallVector<StringRef, 4> AsmPieces;
24852 SplitString(AsmStr, AsmPieces, ";\n");
24854 switch (AsmPieces.size()) {
24855 default: return false;
24857 // FIXME: this should verify that we are targeting a 486 or better. If not,
24858 // we will turn this bswap into something that will be lowered to logical
24859 // ops instead of emitting the bswap asm. For now, we don't support 486 or
24860 // lower so don't worry about this.
24862 if (matchAsm(AsmPieces[0], "bswap", "$0") ||
24863 matchAsm(AsmPieces[0], "bswapl", "$0") ||
24864 matchAsm(AsmPieces[0], "bswapq", "$0") ||
24865 matchAsm(AsmPieces[0], "bswap", "${0:q}") ||
24866 matchAsm(AsmPieces[0], "bswapl", "${0:q}") ||
24867 matchAsm(AsmPieces[0], "bswapq", "${0:q}")) {
24868 // No need to check constraints, nothing other than the equivalent of
24869 // "=r,0" would be valid here.
24870 return IntrinsicLowering::LowerToByteSwap(CI);
24873 // rorw $$8, ${0:w} --> llvm.bswap.i16
24874 if (CI->getType()->isIntegerTy(16) &&
24875 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24876 (matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") ||
24877 matchAsm(AsmPieces[0], "rolw", "$$8,", "${0:w}"))) {
24879 const std::string &ConstraintsStr = IA->getConstraintString();
24880 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24881 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24882 if (clobbersFlagRegisters(AsmPieces))
24883 return IntrinsicLowering::LowerToByteSwap(CI);
24887 if (CI->getType()->isIntegerTy(32) &&
24888 IA->getConstraintString().compare(0, 5, "=r,0,") == 0 &&
24889 matchAsm(AsmPieces[0], "rorw", "$$8,", "${0:w}") &&
24890 matchAsm(AsmPieces[1], "rorl", "$$16,", "$0") &&
24891 matchAsm(AsmPieces[2], "rorw", "$$8,", "${0:w}")) {
24893 const std::string &ConstraintsStr = IA->getConstraintString();
24894 SplitString(StringRef(ConstraintsStr).substr(5), AsmPieces, ",");
24895 array_pod_sort(AsmPieces.begin(), AsmPieces.end());
24896 if (clobbersFlagRegisters(AsmPieces))
24897 return IntrinsicLowering::LowerToByteSwap(CI);
24900 if (CI->getType()->isIntegerTy(64)) {
24901 InlineAsm::ConstraintInfoVector Constraints = IA->ParseConstraints();
24902 if (Constraints.size() >= 2 &&
24903 Constraints[0].Codes.size() == 1 && Constraints[0].Codes[0] == "A" &&
24904 Constraints[1].Codes.size() == 1 && Constraints[1].Codes[0] == "0") {
24905 // bswap %eax / bswap %edx / xchgl %eax, %edx -> llvm.bswap.i64
24906 if (matchAsm(AsmPieces[0], "bswap", "%eax") &&
24907 matchAsm(AsmPieces[1], "bswap", "%edx") &&
24908 matchAsm(AsmPieces[2], "xchgl", "%eax,", "%edx"))
24909 return IntrinsicLowering::LowerToByteSwap(CI);
24917 /// getConstraintType - Given a constraint letter, return the type of
24918 /// constraint it is for this target.
24919 X86TargetLowering::ConstraintType
24920 X86TargetLowering::getConstraintType(const std::string &Constraint) const {
24921 if (Constraint.size() == 1) {
24922 switch (Constraint[0]) {
24933 return C_RegisterClass;
24957 return TargetLowering::getConstraintType(Constraint);
24960 /// Examine constraint type and operand type and determine a weight value.
24961 /// This object must already have been set up with the operand type
24962 /// and the current alternative constraint selected.
24963 TargetLowering::ConstraintWeight
24964 X86TargetLowering::getSingleConstraintMatchWeight(
24965 AsmOperandInfo &info, const char *constraint) const {
24966 ConstraintWeight weight = CW_Invalid;
24967 Value *CallOperandVal = info.CallOperandVal;
24968 // If we don't have a value, we can't do a match,
24969 // but allow it at the lowest weight.
24970 if (!CallOperandVal)
24972 Type *type = CallOperandVal->getType();
24973 // Look at the constraint type.
24974 switch (*constraint) {
24976 weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
24987 if (CallOperandVal->getType()->isIntegerTy())
24988 weight = CW_SpecificReg;
24993 if (type->isFloatingPointTy())
24994 weight = CW_SpecificReg;
24997 if (type->isX86_MMXTy() && Subtarget->hasMMX())
24998 weight = CW_SpecificReg;
25002 if (((type->getPrimitiveSizeInBits() == 128) && Subtarget->hasSSE1()) ||
25003 ((type->getPrimitiveSizeInBits() == 256) && Subtarget->hasFp256()))
25004 weight = CW_Register;
25007 if (ConstantInt *C = dyn_cast<ConstantInt>(info.CallOperandVal)) {
25008 if (C->getZExtValue() <= 31)
25009 weight = CW_Constant;
25013 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25014 if (C->getZExtValue() <= 63)
25015 weight = CW_Constant;
25019 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25020 if ((C->getSExtValue() >= -0x80) && (C->getSExtValue() <= 0x7f))
25021 weight = CW_Constant;
25025 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25026 if ((C->getZExtValue() == 0xff) || (C->getZExtValue() == 0xffff))
25027 weight = CW_Constant;
25031 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25032 if (C->getZExtValue() <= 3)
25033 weight = CW_Constant;
25037 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25038 if (C->getZExtValue() <= 0xff)
25039 weight = CW_Constant;
25044 if (dyn_cast<ConstantFP>(CallOperandVal)) {
25045 weight = CW_Constant;
25049 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25050 if ((C->getSExtValue() >= -0x80000000LL) &&
25051 (C->getSExtValue() <= 0x7fffffffLL))
25052 weight = CW_Constant;
25056 if (ConstantInt *C = dyn_cast<ConstantInt>(CallOperandVal)) {
25057 if (C->getZExtValue() <= 0xffffffff)
25058 weight = CW_Constant;
25065 /// LowerXConstraint - try to replace an X constraint, which matches anything,
25066 /// with another that has more specific requirements based on the type of the
25067 /// corresponding operand.
25068 const char *X86TargetLowering::
25069 LowerXConstraint(EVT ConstraintVT) const {
25070 // FP X constraints get lowered to SSE1/2 registers if available, otherwise
25071 // 'f' like normal targets.
25072 if (ConstraintVT.isFloatingPoint()) {
25073 if (Subtarget->hasSSE2())
25075 if (Subtarget->hasSSE1())
25079 return TargetLowering::LowerXConstraint(ConstraintVT);
25082 /// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
25083 /// vector. If it is invalid, don't add anything to Ops.
25084 void X86TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
25085 std::string &Constraint,
25086 std::vector<SDValue>&Ops,
25087 SelectionDAG &DAG) const {
25090 // Only support length 1 constraints for now.
25091 if (Constraint.length() > 1) return;
25093 char ConstraintLetter = Constraint[0];
25094 switch (ConstraintLetter) {
25097 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25098 if (C->getZExtValue() <= 31) {
25099 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25105 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25106 if (C->getZExtValue() <= 63) {
25107 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25113 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25114 if (isInt<8>(C->getSExtValue())) {
25115 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25121 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25122 if (C->getZExtValue() <= 255) {
25123 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25129 // 32-bit signed value
25130 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25131 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25132 C->getSExtValue())) {
25133 // Widen to 64 bits here to get it sign extended.
25134 Result = DAG.getTargetConstant(C->getSExtValue(), MVT::i64);
25137 // FIXME gcc accepts some relocatable values here too, but only in certain
25138 // memory models; it's complicated.
25143 // 32-bit unsigned value
25144 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op)) {
25145 if (ConstantInt::isValueValidForType(Type::getInt32Ty(*DAG.getContext()),
25146 C->getZExtValue())) {
25147 Result = DAG.getTargetConstant(C->getZExtValue(), Op.getValueType());
25151 // FIXME gcc accepts some relocatable values here too, but only in certain
25152 // memory models; it's complicated.
25156 // Literal immediates are always ok.
25157 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Op)) {
25158 // Widen to 64 bits here to get it sign extended.
25159 Result = DAG.getTargetConstant(CST->getSExtValue(), MVT::i64);
25163 // In any sort of PIC mode addresses need to be computed at runtime by
25164 // adding in a register or some sort of table lookup. These can't
25165 // be used as immediates.
25166 if (Subtarget->isPICStyleGOT() || Subtarget->isPICStyleStubPIC())
25169 // If we are in non-pic codegen mode, we allow the address of a global (with
25170 // an optional displacement) to be used with 'i'.
25171 GlobalAddressSDNode *GA = nullptr;
25172 int64_t Offset = 0;
25174 // Match either (GA), (GA+C), (GA+C1+C2), etc.
25176 if ((GA = dyn_cast<GlobalAddressSDNode>(Op))) {
25177 Offset += GA->getOffset();
25179 } else if (Op.getOpcode() == ISD::ADD) {
25180 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25181 Offset += C->getZExtValue();
25182 Op = Op.getOperand(0);
25185 } else if (Op.getOpcode() == ISD::SUB) {
25186 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
25187 Offset += -C->getZExtValue();
25188 Op = Op.getOperand(0);
25193 // Otherwise, this isn't something we can handle, reject it.
25197 const GlobalValue *GV = GA->getGlobal();
25198 // If we require an extra load to get this address, as in PIC mode, we
25199 // can't accept it.
25200 if (isGlobalStubReference(
25201 Subtarget->ClassifyGlobalReference(GV, DAG.getTarget())))
25204 Result = DAG.getTargetGlobalAddress(GV, SDLoc(Op),
25205 GA->getValueType(0), Offset);
25210 if (Result.getNode()) {
25211 Ops.push_back(Result);
25214 return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
25217 std::pair<unsigned, const TargetRegisterClass*>
25218 X86TargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
25220 // First, see if this is a constraint that directly corresponds to an LLVM
25222 if (Constraint.size() == 1) {
25223 // GCC Constraint Letters
25224 switch (Constraint[0]) {
25226 // TODO: Slight differences here in allocation order and leaving
25227 // RIP in the class. Do they matter any more here than they do
25228 // in the normal allocation?
25229 case 'q': // GENERAL_REGS in 64-bit mode, Q_REGS in 32-bit mode.
25230 if (Subtarget->is64Bit()) {
25231 if (VT == MVT::i32 || VT == MVT::f32)
25232 return std::make_pair(0U, &X86::GR32RegClass);
25233 if (VT == MVT::i16)
25234 return std::make_pair(0U, &X86::GR16RegClass);
25235 if (VT == MVT::i8 || VT == MVT::i1)
25236 return std::make_pair(0U, &X86::GR8RegClass);
25237 if (VT == MVT::i64 || VT == MVT::f64)
25238 return std::make_pair(0U, &X86::GR64RegClass);
25241 // 32-bit fallthrough
25242 case 'Q': // Q_REGS
25243 if (VT == MVT::i32 || VT == MVT::f32)
25244 return std::make_pair(0U, &X86::GR32_ABCDRegClass);
25245 if (VT == MVT::i16)
25246 return std::make_pair(0U, &X86::GR16_ABCDRegClass);
25247 if (VT == MVT::i8 || VT == MVT::i1)
25248 return std::make_pair(0U, &X86::GR8_ABCD_LRegClass);
25249 if (VT == MVT::i64)
25250 return std::make_pair(0U, &X86::GR64_ABCDRegClass);
25252 case 'r': // GENERAL_REGS
25253 case 'l': // INDEX_REGS
25254 if (VT == MVT::i8 || VT == MVT::i1)
25255 return std::make_pair(0U, &X86::GR8RegClass);
25256 if (VT == MVT::i16)
25257 return std::make_pair(0U, &X86::GR16RegClass);
25258 if (VT == MVT::i32 || VT == MVT::f32 || !Subtarget->is64Bit())
25259 return std::make_pair(0U, &X86::GR32RegClass);
25260 return std::make_pair(0U, &X86::GR64RegClass);
25261 case 'R': // LEGACY_REGS
25262 if (VT == MVT::i8 || VT == MVT::i1)
25263 return std::make_pair(0U, &X86::GR8_NOREXRegClass);
25264 if (VT == MVT::i16)
25265 return std::make_pair(0U, &X86::GR16_NOREXRegClass);
25266 if (VT == MVT::i32 || !Subtarget->is64Bit())
25267 return std::make_pair(0U, &X86::GR32_NOREXRegClass);
25268 return std::make_pair(0U, &X86::GR64_NOREXRegClass);
25269 case 'f': // FP Stack registers.
25270 // If SSE is enabled for this VT, use f80 to ensure the isel moves the
25271 // value to the correct fpstack register class.
25272 if (VT == MVT::f32 && !isScalarFPTypeInSSEReg(VT))
25273 return std::make_pair(0U, &X86::RFP32RegClass);
25274 if (VT == MVT::f64 && !isScalarFPTypeInSSEReg(VT))
25275 return std::make_pair(0U, &X86::RFP64RegClass);
25276 return std::make_pair(0U, &X86::RFP80RegClass);
25277 case 'y': // MMX_REGS if MMX allowed.
25278 if (!Subtarget->hasMMX()) break;
25279 return std::make_pair(0U, &X86::VR64RegClass);
25280 case 'Y': // SSE_REGS if SSE2 allowed
25281 if (!Subtarget->hasSSE2()) break;
25283 case 'x': // SSE_REGS if SSE1 allowed or AVX_REGS if AVX allowed
25284 if (!Subtarget->hasSSE1()) break;
25286 switch (VT.SimpleTy) {
25288 // Scalar SSE types.
25291 return std::make_pair(0U, &X86::FR32RegClass);
25294 return std::make_pair(0U, &X86::FR64RegClass);
25302 return std::make_pair(0U, &X86::VR128RegClass);
25310 return std::make_pair(0U, &X86::VR256RegClass);
25315 return std::make_pair(0U, &X86::VR512RegClass);
25321 // Use the default implementation in TargetLowering to convert the register
25322 // constraint into a member of a register class.
25323 std::pair<unsigned, const TargetRegisterClass*> Res;
25324 Res = TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
25326 // Not found as a standard register?
25328 // Map st(0) -> st(7) -> ST0
25329 if (Constraint.size() == 7 && Constraint[0] == '{' &&
25330 tolower(Constraint[1]) == 's' &&
25331 tolower(Constraint[2]) == 't' &&
25332 Constraint[3] == '(' &&
25333 (Constraint[4] >= '0' && Constraint[4] <= '7') &&
25334 Constraint[5] == ')' &&
25335 Constraint[6] == '}') {
25337 Res.first = X86::FP0+Constraint[4]-'0';
25338 Res.second = &X86::RFP80RegClass;
25342 // GCC allows "st(0)" to be called just plain "st".
25343 if (StringRef("{st}").equals_lower(Constraint)) {
25344 Res.first = X86::FP0;
25345 Res.second = &X86::RFP80RegClass;
25350 if (StringRef("{flags}").equals_lower(Constraint)) {
25351 Res.first = X86::EFLAGS;
25352 Res.second = &X86::CCRRegClass;
25356 // 'A' means EAX + EDX.
25357 if (Constraint == "A") {
25358 Res.first = X86::EAX;
25359 Res.second = &X86::GR32_ADRegClass;
25365 // Otherwise, check to see if this is a register class of the wrong value
25366 // type. For example, we want to map "{ax},i32" -> {eax}, we don't want it to
25367 // turn into {ax},{dx}.
25368 if (Res.second->hasType(VT))
25369 return Res; // Correct type already, nothing to do.
25371 // All of the single-register GCC register classes map their values onto
25372 // 16-bit register pieces "ax","dx","cx","bx","si","di","bp","sp". If we
25373 // really want an 8-bit or 32-bit register, map to the appropriate register
25374 // class and return the appropriate register.
25375 if (Res.second == &X86::GR16RegClass) {
25376 if (VT == MVT::i8 || VT == MVT::i1) {
25377 unsigned DestReg = 0;
25378 switch (Res.first) {
25380 case X86::AX: DestReg = X86::AL; break;
25381 case X86::DX: DestReg = X86::DL; break;
25382 case X86::CX: DestReg = X86::CL; break;
25383 case X86::BX: DestReg = X86::BL; break;
25386 Res.first = DestReg;
25387 Res.second = &X86::GR8RegClass;
25389 } else if (VT == MVT::i32 || VT == MVT::f32) {
25390 unsigned DestReg = 0;
25391 switch (Res.first) {
25393 case X86::AX: DestReg = X86::EAX; break;
25394 case X86::DX: DestReg = X86::EDX; break;
25395 case X86::CX: DestReg = X86::ECX; break;
25396 case X86::BX: DestReg = X86::EBX; break;
25397 case X86::SI: DestReg = X86::ESI; break;
25398 case X86::DI: DestReg = X86::EDI; break;
25399 case X86::BP: DestReg = X86::EBP; break;
25400 case X86::SP: DestReg = X86::ESP; break;
25403 Res.first = DestReg;
25404 Res.second = &X86::GR32RegClass;
25406 } else if (VT == MVT::i64 || VT == MVT::f64) {
25407 unsigned DestReg = 0;
25408 switch (Res.first) {
25410 case X86::AX: DestReg = X86::RAX; break;
25411 case X86::DX: DestReg = X86::RDX; break;
25412 case X86::CX: DestReg = X86::RCX; break;
25413 case X86::BX: DestReg = X86::RBX; break;
25414 case X86::SI: DestReg = X86::RSI; break;
25415 case X86::DI: DestReg = X86::RDI; break;
25416 case X86::BP: DestReg = X86::RBP; break;
25417 case X86::SP: DestReg = X86::RSP; break;
25420 Res.first = DestReg;
25421 Res.second = &X86::GR64RegClass;
25424 } else if (Res.second == &X86::FR32RegClass ||
25425 Res.second == &X86::FR64RegClass ||
25426 Res.second == &X86::VR128RegClass ||
25427 Res.second == &X86::VR256RegClass ||
25428 Res.second == &X86::FR32XRegClass ||
25429 Res.second == &X86::FR64XRegClass ||
25430 Res.second == &X86::VR128XRegClass ||
25431 Res.second == &X86::VR256XRegClass ||
25432 Res.second == &X86::VR512RegClass) {
25433 // Handle references to XMM physical registers that got mapped into the
25434 // wrong class. This can happen with constraints like {xmm0} where the
25435 // target independent register mapper will just pick the first match it can
25436 // find, ignoring the required type.
25438 if (VT == MVT::f32 || VT == MVT::i32)
25439 Res.second = &X86::FR32RegClass;
25440 else if (VT == MVT::f64 || VT == MVT::i64)
25441 Res.second = &X86::FR64RegClass;
25442 else if (X86::VR128RegClass.hasType(VT))
25443 Res.second = &X86::VR128RegClass;
25444 else if (X86::VR256RegClass.hasType(VT))
25445 Res.second = &X86::VR256RegClass;
25446 else if (X86::VR512RegClass.hasType(VT))
25447 Res.second = &X86::VR512RegClass;
25453 int X86TargetLowering::getScalingFactorCost(const AddrMode &AM,
25455 // Scaling factors are not free at all.
25456 // An indexed folded instruction, i.e., inst (reg1, reg2, scale),
25457 // will take 2 allocations in the out of order engine instead of 1
25458 // for plain addressing mode, i.e. inst (reg1).
25460 // vaddps (%rsi,%drx), %ymm0, %ymm1
25461 // Requires two allocations (one for the load, one for the computation)
25463 // vaddps (%rsi), %ymm0, %ymm1
25464 // Requires just 1 allocation, i.e., freeing allocations for other operations
25465 // and having less micro operations to execute.
25467 // For some X86 architectures, this is even worse because for instance for
25468 // stores, the complex addressing mode forces the instruction to use the
25469 // "load" ports instead of the dedicated "store" port.
25470 // E.g., on Haswell:
25471 // vmovaps %ymm1, (%r8, %rdi) can use port 2 or 3.
25472 // vmovaps %ymm1, (%r8) can use port 2, 3, or 7.
25473 if (isLegalAddressingMode(AM, Ty))
25474 // Scale represents reg2 * scale, thus account for 1
25475 // as soon as we use a second register.
25476 return AM.Scale != 0;
25480 bool X86TargetLowering::isTargetFTOL() const {
25481 return Subtarget->isTargetKnownWindowsMSVC() && !Subtarget->is64Bit();